Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
src/automakefile.py | |
src/balanced_structures/skiplist/skiplist.h [code] | |
src/balanced_structures/skiplist/skiplist_iterator.h [code] | |
src/balanced_structures/skiplist/skiplist_node.h [code] | |
src/balanced_structures/skiplist/skiplist_trail.h [code] | |
src/balanced_structures/skiplist/skiplist_utils.h [code] | |
src/debug/ppdebug.h [code] | |
src/geometry/two_d/angle.h [code] | |
src/geometry/two_d/convex_hull.h [code] | |
src/geometry/two_d/distance.h [code] | |
src/geometry/two_d/intersect.h [code] | |
src/geometry/two_d/linesegment.h [code] | |
src/geometry/two_d/point.h [code] | |
src/geometry/two_d/signum.h [code] | |
src/interval_trees/array/interval_array.h [code] | |
src/interval_trees/fenwick/fenwick.h [code] | |
src/interval_trees/full_binary_tree/full_binary_tree.h [code] | |
src/interval_trees/simple/simple_max.h [code] | |
src/interval_trees/utils/heap.h [code] | |
src/math/binsearch/function_binsearch.h [code] | |
src/math/binsearch/int_binsearch.h [code] | |
src/math/factorize/factorize_naive.h [code] | |
src/math/factorize/factorize_with_oracle.h [code] | |
src/math/factorize/oracle_brent.h [code] | |
src/math/factorize/oracle_pollard.h [code] | |
src/math/gcd/extended_gcd.h [code] | |
src/math/gcd/extended_gcd_loop.h [code] | |
src/math/gcd/gcd.h [code] | |
src/math/modular_inverse/modular_inverse_fermat.h [code] | |
src/math/modular_inverse/modular_inverse_gcd.h [code] | |
src/math/modular_inverse/modular_inverse_precomputed.h [code] | |
src/math/powermod/multmod_extended.h [code] | |
src/math/powermod/multmod_simple.h [code] | |
src/math/powermod/powermod.h [code] | |
src/math/prime_sieve/eratosthenes_basic.h [code] | |
src/math/prime_sieve/eratosthenes_optimized.h [code] | |
src/math/prime_sieve/segmented_sieve.h [code] | |
src/math/primes/primes_basic.h [code] | |
src/math/primes/primes_fast.h [code] | |
src/math/primes/primes_slow.h [code] | |
src/math/primes/primes_test_data.h [code] | |
src/math/rational/rational.h [code] | |
src/strings/testdata.h [code] | |
src/strings/cyclic/duval.h [code] | |
src/strings/lcs/lcs.h [code] | |
src/strings/lcs/lcs_hirschberg.h [code] | |
src/strings/search_callback/search_callback.h [code] | |
src/strings/search_kmp/kmp.h [code] | |
src/strings/search_rabin_karp/rabin_karp.h [code] | |
src/strings/search_rabin_karp/rolling_hash.h [code] | |
src/strings/suffix_array_binsearch/binsearch.h [code] | |
src/strings/suffix_array_check/suffix_array_check.h [code] | |
src/strings/suffix_array_lcp_kasai/lcp_kasai.h [code] | |
src/strings/suffix_array_lcp_manzini/lcp_manzini.h [code] | |
src/strings/suffix_array_lcp_naive/lcp_naive.h [code] | |
src/strings/suffix_array_log2/manber_myers_log2.h [code] | |
src/strings/suffix_array_myers/manber_myers.h [code] | |
src/strings/suffix_array_naive/naive.h [code] | |
src/strings/suffix_array_naive/sort_helper.h [code] | |
src/strings/testdata/cantenbury/fields.c | |
src/strings/utils/sequence_helper.h [code] | |
src/strings/utils/sequence_loader.h [code] | |
src/template/template.h [code] | |
src/utils/assert/integer_overflow.h [code] | |
src/utils/benchmark/benchmark.h [code] | |
src/utils/benchmark/color.h [code] | |
src/utils/branch_predict/branch_predict.h [code] | |
src/utils/macros/array_size.h [code] | |
src/utils/macros/evil_constructors.h [code] | |
src/utils/macros/foreach.h [code] | |
src/utils/macros/unused.h [code] | |
src/utils/memory_usage/memory_usage.h [code] | |
src/utils/preconditions/preconditions.h [code] | |
src/utils/rand/rand.cpp | |
src/utils/rand/rand.h [code] | |
src/utils/si_units/si_units.h [code] | |
src/utils/static_assert/static_assert.h [code] | |
src/utils/timer/timer.h [code] |