Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
c | strings::search::RollingHash< BaseType > | [private] |
c_len | strings::search::RollingHash< BaseType > | [private] |
getHash() const | strings::search::RollingHash< BaseType > | [inline] |
hash | strings::search::RollingHash< BaseType > | [private] |
length | strings::search::RollingHash< BaseType > | [private] |
modulus | strings::search::RollingHash< BaseType > | [private] |
roll(ValueType new_element, ValueType discarded_element) | strings::search::RollingHash< BaseType > | [inline] |
RollingHash(SizeType length, BaseType modulus_, BaseType c_) | strings::search::RollingHash< BaseType > | [inline] |
SizeType typedef | strings::search::RollingHash< BaseType > | [private] |