com.github.ivarref.paginate-vector.impl.bst — com.github.ivarref/paginate-vector 0.2.69

after-value clj

(after-value root keep? from-value sort-attrs max-items)

balanced-tree clj

(balanced-tree sorted-vec)

(balanced-tree sorted-vec start end)

before-value clj

(before-value root keep? from-value sort-attrs max-items)

cmp-attrs clj

(cmp-attrs sort-attrs a b)

comparator-over-nodes clj

(comparator-over-nodes func)

(comparator-over-nodes func & args)

Returns a comparison function specific for values of tree nodes

depth-first-vals clj

(depth-first-vals root)

(depth-first-vals root v)

equals clj

from-beginning clj

(from-beginning root keep? max-items)

(from-beginning root keep? res max-items)

from-end clj

(from-end root keep? max-items)

(from-end root keep? res max-items)

get-leftmost-value clj

(get-leftmost-value root keep?)

get-rightmost-value clj

(get-rightmost-value root keep?)

greater-than clj

height clj

(height root)

(height root count)

Determines the depth of the BST

insert-node clj

(insert-node root new-node)

inserts a node into a BST

is-bst clj

(is-bst root)

(is-bst root greaters lesss)

Not only does this check to see if the value at each 'less' child of each node is less than the value at that node (and 'greater'), but it also checks that EVERY element to the 'less' of each node is less than that node. Otherwise, the tree is not a BST. Additionally, this function ensures that

left clj

(left node)

less-than clj

make-node clj

(make-node value)

(make-node value left right)

next-value clj

(next-value root nearest-value sort-attrs)

Node clj

right clj

(right node)

take-all-first clj

(take-all-first root keep? res max-items)

take-all-last clj

(take-all-last root keep? res max-items)

take-min clj

(take-min a b sort-fn)

tree-contains? clj

(tree-contains? root v sort-attrs)

tree-vals clj

(tree-vals node)

value clj

(value node)

visit-all-depth-first clj

(visit-all-depth-first root keep? f)