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, and better speed (theoretical worst-case access times: aArray's = n, this' = log2(n)). Tree traversal through D's Range capabilities. TODO: <ul> <li>Implement tree traversal.</li> <li>Improve tree optimization speeds.</li> <li>Fix potential memory leakage issues.</li> </ul>
Implements a binary search tree without a key, meaning elements can be looked up in a different fashion, eg. through opEquals method overriding