meridian.datomic-rtree.rtree — org.clojars.sideris/datomic-rtree 0.1.1-SNAPSHOT

add-adjust-tx clj

(add-adjust-tx txs node entry split-nodes)

add-id clj

(add-id node)

add-split-tx clj

(add-split-tx txs parent? node new-splits tree)

adjusted-node clj

(adjusted-node node entry new-children)

choose-leaf clj

(choose-leaf root new-bbox)

Select a leaf node in which to place a new index entry, new-bbox. Starts at the root node a works down the tree. Finds the node whose path to the root consists of ancestors nodes that all required the least enlargement to include new-bbox, or have the smallest area.

containing clj

(containing root search-box)

Given the root of the tree and a bounding box to search within finds entries contained within the search box.

create-tree-tx clj

(create-tree-tx max-children min-children)

find clj

(find db)

group-chooser clj

(group-chooser node)

For any given node returns a function that given a group will return a value that can be used as a sort order for the group.

grow-tree-tx clj

(grow-tree-tx tree-id split)

hilbert-ents clj

(hilbert-ents db)

insert-entry-tx clj

(insert-entry-tx tree entry & {:keys [install-entry] :or {install-entry false}})

intersecting clj

(intersecting root search-box)

Given the root of the tree and a bounding box to search within finds entries intersecting the search box.

new-splits clj

(new-splits node old-child new-children min-children id-adder)

node-ids clj

(node-ids nodes)

pick-next clj

(pick-next group-a group-b nodes)

Select one remaining entry for classification in a group. Determine the cost of putting each entry in each group. Find the entry with greatest preference for one group.

pick-seeds clj

(pick-seeds entries)

Select two entries to be the first elements of the new groups. Choose the most wasteful (in terms of area) pair.

search-tree clj

(search-tree root child-filter)

(search-tree root child-filter recur-step)

should-split? clj

(should-split? node split-nodes {max-children :rtree/max-children})

split-accum clj

(split-accum init-groups children)

Produces a lazy seq of vectors containing a list of groups (that accumulate at every step) and a list of children yet to be grouped at that step.

split-finished? clj

(split-finished? min-children [groups remaining])

split-node clj

(split-node children min-children)

Quadractic-Cost Algorithm. Attempts to find a small-area split. Given a set of children (and a minimum number of children allowed in a node), returns a vector containing two new sets of child nodes.

split-tx clj

(split-tx node split)