Return to cbt.1 CVS log

Up to [Research Unix] / researchv10no / cmd / btree

Annotation of researchv10no/cmd/btree/cbt.1, revision 1.1.1.1

1.1       root        1: .TH CBT 1
                      2: .SH NAME
                      3: cbt
                      4: \- programs for b-trees
                      5: .SH SYNOPSIS
                      6: .B cbt
                      7: .I command
                      8: arguments ...
                      9: .SH DESCRIPTION
                     10: .PP
                     11: B-trees support lookup of values by key.
                     12: A b-tree
                     13: .I file
                     14: corresponds to two files,
                     15: .I file.T
                     16: and
                     17: .IR file.F .
                     18: .I file.T
                     19: contains the keys and pointers to values.
                     20: .I file.F
                     21: contains the values.
                     22: If the b-tree is an
                     23: .I index
                     24: there is no
                     25: .I .F
                     26: file.
                     27: .PP
                     28: .B cbt creat
                     29: .I arguments
                     30: creates empty b-trees.
                     31: Each argument may be a file name or the flag
                     32: .BR -i .
                     33: The b-trees created for all the names following a flag argument
                     34: will be indexes.
                     35: .PP
                     36: .B cbt report
                     37: .I file-names
                     38: reports on the sizes of the files.
                     39: If the amount of useful data is much less than the file sizes,
                     40: .B cbt squash
                     41: .I file
                     42: will make the b-tree much smaller by reconstructing it in nearly
                     43: minimal form.
                     44: .PP
                     45: .B cbt cat
                     46: .I file
                     47: prints out the contents of the b-tree in the form
                     48: .RS
                     49: .I key tab value new-line
                     50: .RE
                     51: .PP
                     52: .B cbt build [-r]
                     53: .I file
                     54: fills an empty b-tree with key-value pairs read from the standard
                     55: input.
                     56: The keys must be sorted and without duplicates.
                     57: If the optional argument is not present, then the part of each line
                     58: up to the first tab is the key, and the part after the first tab,
                     59: not including the new-line, is the value.
                     60: If the optional argument is present, then the input is assumed to
                     61: be a sequence of
                     62: .RS
                     63: .RI short klen; char key[klen]; short vlen; char value[vlen]
                     64: .RE
                     65: quadruples.
                     66: The smallest possible value for
                     67: .I klen
                     68: is 1,
                     69: so the shortest quadruple consists of 2 short integers and one character.
                     70: .SH SEE ALSO
                     71: memo by pjw, cbt(3)

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.