Example #1
0
 protected virtual extern Haxe.Ds.TreeNode <K, V> RemoveMinBinding(Haxe.Ds.TreeNode <K, V> t);
Example #2
0
 protected virtual extern Haxe.Ds.TreeNode <K, V> Balance(Haxe.Ds.TreeNode <K, V> l, K k, V v, Haxe.Ds.TreeNode <K, V> r);
Example #3
0
 protected virtual extern Haxe.Ds.TreeNode <K, V> Merge(Haxe.Ds.TreeNode <K, V> t1, Haxe.Ds.TreeNode <K, V> t2);
Example #4
0
 protected virtual extern void KeysLoop(Haxe.Ds.TreeNode <K, V> node, Haxe.HaxeArray <K> acc);
Example #5
0
 protected virtual extern void IteratorLoop(Haxe.Ds.TreeNode <K, V> node, Haxe.HaxeArray <V> acc);
Example #6
0
 protected virtual extern Haxe.Ds.TreeNode <K, V> RemoveLoop(K k, Haxe.Ds.TreeNode <K, V> node);
Example #7
0
 protected virtual extern Haxe.Ds.TreeNode <K, V> SetLoop(K k, V v, Haxe.Ds.TreeNode <K, V> node);