vebtree

Members

Classes

vebTree
class vebTree

This struct represents the VEB tree itself. For the sake of convinience it saves the provided at the initialization step wished maximum element. However at the point of development it is only used for testing. Beyond this, it stores only the reference to the root element, as the theory tells. The tree implements not only the documented interface of a van VEB tree, but is also a bidirectional range. It supports two slice operations and a non-trivial opIndex operator.

Functions

fill
vebTree fill(uint M, Random rndGenInUse)
high
uint high(uint value, uint universeSize)
Undocumented in source. Be warned that the author may not have intended to support it.
higherSquareRoot
uint higherSquareRoot(uint value)
Undocumented in source. Be warned that the author may not have intended to support it.
index
uint index(uint universeSize, uint x, uint y)
Undocumented in source. Be warned that the author may not have intended to support it.
low
uint low(uint value, uint universeSize)
Undocumented in source. Be warned that the author may not have intended to support it.
lowerSqrtShift
uint lowerSqrtShift(uint value)
Undocumented in source. Be warned that the author may not have intended to support it.
lowerSquareRoot
uint lowerSquareRoot(uint value)
Undocumented in source. Be warned that the author may not have intended to support it.
nextPowerOfTwo
uint nextPowerOfTwo(uint value)
Undocumented in source. Be warned that the author may not have intended to support it.

Variables

BASE_SIZE
ubyte BASE_SIZE;
Undocumented in source.

See Also

Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, and Charles E. Leiserson. 2001. <em>Introduction to Algorithms</em> (2nd ed.). McGraw-Hill Higher Education.

Meta