Crate im_ternary_tree

A variant of 2-3 tree, with enhancements on ternary branching, optimized with tricks like finger-tree. t.push_right(..) is optimized to be amortized O(1) at best cases and O(log n) when restructuring involed.

it is also interesting to display it with triples:

(((0 1 2) (3 4 5) (6 7 8)) ((9 10 11) (12 13 14) (15 16 17)) (18 19 _))

or with more holes:

(((0 1 _) (2 3 4) (5 6 _)) ((7 8 _) (9 10 _) (11 12 _)) ((13 14 _) (15 16 17) (18 19 _)))

Structs

• TernaryTreeListRefIntoIterator

Enums

• TernaryTreeList
  wraps TerarnaryTreeList with support for empty