virtual class std::TreeMap

sys::Obj
  std::Map<TreeMap^K,TreeMap^V>
    std::TreeMap

AVL Tree (named after inventors Adelson-Velsky and Landis) is an balanced binary tree.

add: virtual override This add(TreeMap^K key, TreeMap^V val)
clear: virtual override This clear()
containsKey: virtual override Bool containsKey(TreeMap^K k)
createEmpty: protected virtual override This createEmpty()
each: virtual override Void each(Func<Void,TreeMap^V,TreeMap^K> f)
eachWhile: virtual override Obj? eachWhile(Func<Obj?,TreeMap^V,TreeMap^K> c)
get: virtual override TreeMap^V? get(TreeMap^K k, TreeMap^V? defValue := super.defV)
isImmutable: virtual override Bool isImmutable()
isRO: virtual override Bool isRO()
keySafe: protected Bool keySafe := true
keys: virtual override List<TreeMap^K> keys()
make: new make()
modify: protected virtual override Void modify()
remove: virtual override TreeMap^V? remove(TreeMap^K e)
ro: virtual override This ro()
rw: virtual override This rw()
set: virtual override This set(TreeMap^K key, TreeMap^V val)
size: virtual override Int size { private set }
toImmutable: virtual override Map<TreeMap^K,TreeMap^V> toImmutable()
vals: virtual override List<TreeMap^V> vals()