asami.durable.tree — org.clojars.quoll/asami 2.3.3

This namespace provides the basic mechanisms for AVL trees

add-to-root clj/s

(add-to-root tree node deeper?)

Runs back up a branch to update and balance the branch for the transaction. node argument is a fully written branch of the tree. Returns the root of the tree.

balance-bitshift clj/s

balance-mask clj/s

calc-block-size clj/s

(calc-block-size payload-size)

Determines the size of a block used by a tree, based on the payload in the node

find-end-node clj/s

(find-end-node {:keys [root] :as tree} side)

Finds the first or the last node in the tree

find-node* clj/s

(find-node* {:keys [root node-comparator] :as tree} key)

Finds a node in the tree using a key. returns one of: null: an empty tree node: the data was found vector: the data was not there, and is found between 2 nodes. The leaf node is in the vector. The other (unneeded) node is represented by nil.

get-node clj/s

(get-node tree id)

(get-node {:keys [block-manager node-cache] :as tree} id parent)

Returns a node object for a given ID

header-size clj/s

header-size-int clj/s

header-size-long clj/s

init-child! clj/s

(init-child! node side child)

left clj/s

left-mask clj/s

left-offset clj/s

Offset of the left child, in longs

neighbor-node clj/s

(neighbor-node side tree node)

new-block-tree clj/s

(new-block-tree block-manager-factory store-name data-size node-comparator)

(new-block-tree block-manager-factory
                store-name
                data-size
                node-comparator
                root-id)

Creates an empty block tree. The factory may provide a block manager that this objects owns, or which is provided. This can be determined by calling the block-manager-factory with no arguments.

new-node clj/s

(new-node tree)

(new-node tree data writer)

(new-node {:keys [block-manager node-cache] :as tree} data parent writer)

Returns a new node object

next-node clj/s

node-cache-size clj/s

node-seq clj/s

(node-seq tree node)

null clj/s

Indicate an invalid node ID

other clj/s

(other s)

prev-node clj/s

rebalance! clj/s

(rebalance! tree node balance)

Rebalance an AVL node. The root of the rebalance is returned unwritten, but all subnodes are written.

right clj/s

right-offset clj/s

Offset of the right child, in longs

to-hex clj/s

(to-hex n)

Tree clj/s protocol

add clj/s

(add this data writer)

(add this data writer location)

Adds data to the tree

at clj/s

(at this new-root)

Returns a tree for a given transaction root

find-node clj/s

(find-node this key)

Finds a node in the tree using a key.

first-node clj/s

(first-node this)

Finds the first node in iteration order

last-node clj/s

(last-node this)

Finds the last node in iteration order

modify-node! clj/s

(modify-node! this node)

Makes a node available to modify in the current transaction. Returns the new tree and a node that can be modified (possible the same node)

TreeNode clj/s protocol

copy-on-write clj/s

(copy-on-write this tree)

Return a node that is writable in the current transaction

get-balance clj/s

(get-balance this)

Retrieves the balance of the node

get-child clj/s

(get-child this tree side)

Gets the Node of the child on the given side

get-child-id clj/s

(get-child-id this side)

Gets the Node ID of the child on the given side

get-parent clj/s

(get-parent this)

Returns the parent node. Not the Node ID, but the node object.

set-balance! clj/s

(set-balance! this balance)

Sets the balance of the node

set-child! clj/s

(set-child! this side child)

Sets the ID of the child for the given side

write clj/s

(write this tree)

Persists the node to storage