CBT(1)

NAME
cbt - programs for b-trees

SYNOPSIS
cbt command arguments ...

DESCRIPTION

B-trees support lookup of values by key. A b-tree file corresponds to two files, file.T and file.F. file.T contains the keys and pointers to values. file.F contains the values. If the b-tree is an index there is no .F file.

cbt creat arguments creates empty b-trees. Each argument may be a file name or the flag -i. The b-trees created for all the names following a flag argument will be indexes.

cbt report file-names reports on the sizes of the files. If the amount of useful data is much less than the file sizes, cbt squash file will make the b-tree much smaller by reconstructing it in nearly minimal form.

cbt cat file prints out the contents of the b-tree in the form
    key tab value new-line

cbt build [-r] file fills an empty b-tree with key-value pairs read from the standard input. The keys must be sorted and without duplicates. If the optional argument is not present, then the part of each line up to the first tab is the key, and the part after the first tab, not including the new-line, is the value. If the optional argument is present, then the input is assumed to be a sequence of
    shortklen;charkey[klen];shortvlen;charvalue[vlen]
quadruples. The smallest possible value for klen is 1, so the shortest quadruple consists of 2 short integers and one character.

SEE ALSO
memo by pjw, cbt(3)