Index
Modules:
rbtree
.
API symbols
`$`:
rbtree: `$`[T: TreeElem; K](self: RedBlackTree[T, K]): string
ceil:
rbtree: ceil[T: TreeElem; K](tree: RedBlackTree[T, K]; key: K): Option[T]
contains:
rbtree: contains[T: TreeElem; K](tree: RedBlackTree[T, K]; value: T | K): bool
defineIndex:
rbtree: defineIndex(name, source, extractIt, cmpAB: untyped)
delete:
rbtree: delete[T: TreeElem; K](self: var RedBlackTree[T, K]; value: T)
find:
rbtree: find[T: TreeElem; K](tree: RedBlackTree[T, K]; key: K): Option[T]
floor:
rbtree: floor[T: TreeElem; K](tree: RedBlackTree[T, K]; key: K): Option[T]
insert:
rbtree: insert[T: TreeElem; K](self: var RedBlackTree[T, K]; value: T)
rbtree: insert[T: TreeElem; K](self: var RedBlackTree[T, K]; one: T; two: T; more: varargs[T])
isEmpty:
rbtree: isEmpty[T: TreeElem; K](tree: RedBlackTree[T, K]): bool
items:
rbtree: items[T: TreeElem; K](tree: RedBlackTree[T, K]): T
max:
rbtree: max[T: TreeElem; K](tree: RedBlackTree[T, K]): Option[T]
min:
rbtree: min[T: TreeElem; K](tree: RedBlackTree[T, K]): Option[T]
newRBTree:
rbtree: newRBTree[T: TreeElem; K](): RedBlackTree[T, K]
RedBlackTree:
rbtree: RedBlackTree
reversed:
rbtree: reversed[T: TreeElem; K](tree: RedBlackTree[T, K]): T
TreeElem:
rbtree: TreeElem
validate:
rbtree: validate[T: TreeElem; K](tree: RedBlackTree[T, K])