Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
Main Page
Namespaces
Classes
Files
Namespace List
Namespace Members
All
Functions
Variables
Typedefs
Enumerations
Enumerator
a
b
c
d
e
f
g
i
l
m
n
o
p
q
r
s
t
u
Here is a list of all namespace members with links to the namespace documentation for each member:
- a -
all_files :
automakefile
angleLess() :
geometry::two_d
- b -
b :
automakefile
benchmarks :
automakefile
BLUE :
color
BOTTOM_LEFT :
geometry::two_d
BOTTOM_RIGHT :
geometry::two_d
- c -
CC :
automakefile
CENTER :
geometry::two_d
Color :
color
colorPrintf() :
color
compilable :
automakefile
compiletest :
automakefile
CYAN :
color
- d -
distancePointLine() :
geometry::two_d
distancePointLineSegment() :
geometry::two_d
distancePointPoint() :
geometry::two_d
- e -
EXCLUDES :
automakefile
- f -
FactorizeBrent :
math::factorize
FactorizeNaive :
math::factorize
FactorizePollard :
math::factorize
FenwickDirection :
interval_trees::fenwick
- g -
gcd() :
math::gcd
get_binary() :
automakefile
get_dependencies() :
automakefile
getQuadrant() :
geometry::two_d
getUsedMemoryKb() :
utils::memory_usage
- i -
INTERSECT :
geometry::two_d
intersectLineLineSegment() :
geometry::two_d
intersectLineSegmentLineSegment() :
geometry::two_d
IntersectType :
geometry::two_d
intervalIntersect() :
geometry::two_d
isLeftChild() :
heap
isRightChild() :
heap
- l -
left() :
heap
LevelType :
balanced_structures::skiplist
LEVELUP_PROB :
balanced_structures::skiplist
lower_bound() :
math::binsearch
- m -
ManberMyersLog2 :
strings::suffix_array
MAXLEVEL :
balanced_structures::skiplist
MIN_BENCHMARK_TIME :
utils::benchmark
ModularInverseFermat :
math::modular_inverse
ModularInversePrecomputed :
math::modular_inverse
- n -
nextPowerOfTwo() :
heap
NO_INTERSECT :
geometry::two_d
- o -
operator!=() :
geometry::two_d
operator*() :
geometry::two_d
operator+() :
geometry::two_d
operator-() :
geometry::two_d
,
math::rational
operator/() :
geometry::two_d
operator<() :
math::rational
operator<<() :
math::rational
operator<=() :
math::rational
operator==() :
geometry::two_d
,
math::rational
operator>() :
math::rational
operator>=() :
math::rational
OPT :
automakefile
OracleBrent :
math::factorize
OraclePollard :
math::factorize
OVERLAY :
geometry::two_d
- p -
parent() :
heap
PINK :
color
pointOnLine() :
geometry::two_d
pointOnLineSegment() :
geometry::two_d
PowermodExtended :
math::powermod
PowermodSimple :
math::powermod
prime_count_big :
testdata
prime_count_small :
testdata
prime_twins_count :
testdata
PrimesFast :
math::primes
print_compile_rule() :
automakefile
print_compiletest_rule() :
automakefile
print_headers() :
automakefile
printBenchmarkResults() :
utils::benchmark
- q -
Quadrant :
geometry::two_d
- r -
randomLevel() :
balanced_structures::skiplist::node_utils
range_middle() :
math::binsearch
right() :
heap
- s -
sibling() :
heap
signum() :
geometry::two_d
SizeType :
balanced_structures::skiplist::trail
sqrDistancePointLine() :
geometry::two_d
sqrDistancePointLineSegment() :
geometry::two_d
sqrDistancePointPoint() :
geometry::two_d
- t -
TANGENCY :
geometry::two_d
TESTLIB :
automakefile
tests :
automakefile
TO_INFTY :
interval_trees::fenwick
TO_ZERO :
interval_trees::fenwick
TOP_LEFT :
geometry::two_d
TOP_RIGHT :
geometry::two_d
- u -
unittests :
automakefile
upper_bound() :
math::binsearch
Generated on Wed May 4 2011 21:39:15 for Effective implementation of algorithms (Master Thesis) by
1.7.4
All
Classes
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Defines