Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
Class Index
B | C | D | E | F | I | K | L | M | N | O | P | R | S | T | U
  B  
FenwickMaxTree (interval_trees::fenwick)   LineSegment (geometry::two_d)   PatternFiles (strings)   SequenceLoader (strings::utils)   
BinaryMax (interval_trees::fenwick)   FenwickSumTree (interval_trees::fenwick)   LowerBoundTrailFunction (balanced_structures::skiplist::trail)   Point (geometry::two_d)   SieveCallback (math::prime_sieve)   
BinaryPlus (interval_trees::fenwick)   FenwickTree (interval_trees::fenwick)   
  M  
ConvexHull::PointCompare (geometry::two_d)   SimpleMaxTree (interval_trees::simple)   
Binsearch (strings::suffix_array)   FullBinaryTree (interval_trees)   ManberMyers (strings::suffix_array)   Powermod_ (math::powermod)   Skiplist (balanced_structures::skiplist)   
  C  
Function (math::binsearch)   ManberMyersLog2_ (strings::suffix_array)   Preconditions   SortHelper (strings::suffix_array)   
ConstIterator (balanced_structures::skiplist)   FunctionBinsearch (math::binsearch)   ModularInverseFermat_ (math::modular_inverse)   PrimesBasic (math::primes)   static_assert_test (utils::static_assert_)   
ConvexFunction (math::binsearch)   
  I  
ModularInverseGcd (math::modular_inverse)   PrimesFast_ (math::primes)   STATIC_ASSERTION_FAILURE< true > (utils::static_assert_)   
ConvexHull (geometry::two_d)   IntervalMaxArray   ModularInversePrecomputed_ (math::modular_inverse)   PrimesSlow (math::primes)   ManberMyersLog2_::Suffix (strings::suffix_array)   
  D  
IntervalSumArray   MultmodExtended (math::powermod)   
  R  
SuffixArrayChecker (strings::suffix_array)   
Duval (strings::cyclic)   
  K  
MultmodExtendedOpt (math::powermod)   RabinKarp (strings::search)   
  T  
  E  
KMP (strings::search)   MultmodSimple (math::powermod)   Rand   TestdataFiles (strings)   
EratosthenesBasic (math::prime_sieve)   KthTrailFunction (balanced_structures::skiplist::trail)   
  N  
Rational (math::rational)   Timer (utils::timer)   
EratosthenesOptimized (math::prime_sieve)   
  L  
NaiveSuffixArray (strings::suffix_array)   RollingHash (strings::search)   Trail (balanced_structures::skiplist::trail)   
ExtendedGCD (math::gcd)   LCPKasai (strings::suffix_array)   Node (balanced_structures::skiplist)   
  S  
TrailFunction (balanced_structures::skiplist::trail)   
ExtendedGCDLoop (math::gcd)   LCPManzini (strings::suffix_array)   
  O  
SearchCallback (strings::search_callback)   FullBinaryTree::Traverser (interval_trees)   
  F  
LCPNaive (strings::suffix_array)   OracleBrent_ (math::factorize)   SearchHelper (strings::suffix_array)   
  U  
FactorizeNaive_ (math::factorize)   LCS (strings::lcs)   OraclePollard_ (math::factorize)   SegmentedSieve (math::prime_sieve)   UpperBoundTrailFunction (balanced_structures::skiplist::trail)   
FactorizeWithOracle_ (math::factorize)   LCSHirschberg (strings::lcs)   
  P  
SequenceHelper (strings::utils)   
B | C | D | E | F | I | K | L | M | N | O | P | R | S | T | U
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines