PixelPerfectEngine.system.binarySearchTree

Undocumented in source.

Members

Structs

BSTNode
struct BSTNode(K, E)
Undocumented in source.
BinarySearchTree
struct BinarySearchTree(K, E)

Implements a mostly @nogc-able container format, with relatively fast access times. Mostly based upon the AVT tree algorithm with small modifications, with the intent to replace D's default associative arrays for GC-free operations. TODO: Implement ordered tree traversal.

Meta