# FUNCTION

# Public

# CLOSE (BTREE)

Close open b-tree.

# DELETE (BTREE KEY)

Delete key and its associated value from B-tree.

# INSERT (BTREE KEY VALUE)

Insert (key, value) pair to b-tree.

# MAP (RET-TYPE BTREE FUNC)

Map function func over B-tree.

# MAX (BTREE &OPTIONAL (START-NODE (B-TREE-ROOT BTREE)))

Returns two values from B-tree, or nil if B-tree is empty. If
B-tree is non-empty the first value is associated value of max key in
B-tree and the second value is the max key of B-tree.

# MIN (BTREE &OPTIONAL (START-NODE (B-TREE-ROOT BTREE)))

Returns two values from B-tree, or nil if B-tree is empty. If
B-tree is non-empty the first value is associated value of min key in
B-tree and the second value is the min key of B-tree.

# OPEN (FILESPEC &KEY (TYPE DEFAULT) (MINIMUM-DEGREE 3) (BLOCK-SIZE 4096) (IF-EXISTS OVERWRITE) (IF-DOES-NOT-EXIST ERROR IF-DOES-NOT-EXIST-P))

Open B-tree.

# PRINT (BTREE &OPTIONAL (STREAM *STANDARD-OUTPUT*))

Write b-tree to stream.

# SEARCH (BTREE KEY &OPTIONAL (START-NODE (B-TREE-ROOT BTREE)))

Returns value associated with the key in b-tree or nil if key does not exist.

# Private

# CREATE (FILESPEC &KEY (TYPE DEFAULT) (MINIMUM-DEGREE 3) (IF-EXISTS ERROR) (BLOCK-SIZE 4096))

Create new file based b-tree to given filespec.