Annotation of researchv10dc/man/adm/man1/cbt.1, revision 1.1.1.1

1.1       root        1: .TH CBT 1 
                      2: .CT 1 files
                      3: .SH NAME
                      4: cbt \- btree utilities
                      5: .SH SYNOPSIS
                      6: .B cbt creat
                      7: .I name ...
                      8: .br
                      9: .B cbt report
                     10: .I name ...
                     11: .br
                     12: .B cbt cat
                     13: [
                     14: .B -R
                     15: ]
                     16: .I name ...
                     17: .br
                     18: .B cbt squash
                     19: [
                     20: .BI -o dest
                     21: ]
                     22: .I name
                     23: .br
                     24: .B cbt build
                     25: [
                     26: .B -R
                     27: ]
                     28: .I name
                     29: .br
                     30: .B cbt add
                     31: [
                     32: .B -R
                     33: ]
                     34: .I name
                     35: .br
                     36: .B cbt delete
                     37: [
                     38: .B -R
                     39: ]
                     40: .I name
                     41: .br
                     42: .B cbt look
                     43: [
                     44: .B -R
                     45: ]
                     46: .I name
                     47: .SH DESCRIPTION
                     48: A B-tree
                     49: .I name
                     50: corresponds to a pair of
                     51: files named
                     52: .IB name .T
                     53: and
                     54: .IB name .F .
                     55: .IB Name .T
                     56: contains an access tree,
                     57: and
                     58: .IB name .F
                     59: contains the data.
                     60: .PP
                     61: The
                     62: .L creat
                     63: version of the command creates empty B-trees.
                     64: .PP
                     65: The
                     66: .L report
                     67: version of the command scans each B-tree and reports how many records it
                     68: contains.
                     69: .PP
                     70: The
                     71: .L cat
                     72: version of the command scans the
                     73: B-tree in key-sort order, writing on its standard output.
                     74: With no option,
                     75: .L cat 
                     76: writes each key followed by a tab,
                     77: followed by the record, followed by a new-line.
                     78: If option
                     79: .B -R
                     80: (raw) is present,
                     81: each key-record pair has the format
                     82: .PP
                     83: .EX
                     84: .nf
                     85: struct {
                     86:        short keylen;
                     87:        char key[keylen];
                     88:        short reclen;
                     89:        char rec[reclen];
                     90: };
                     91: .EE
                     92: .LP 
                     93: Keys and records are not null-terminated and
                     94: consecutive key-record pairs are not separated by new-lines.
                     95: Keys may be no longer than 255 bytes.
                     96: .PP
                     97: The
                     98: .L squash
                     99: version of the command compresses the access tree to minimal size.
                    100: Option
                    101: .B -o
                    102: names the squashed database
                    103: .IR dest ,
                    104: leaving the original database unaltered.
                    105: .PP
                    106: The
                    107: .L build
                    108: version of the command reads a sorted list of keys
                    109: and records from the standard input and fills the file
                    110: with them.
                    111: Input is in the form produced by the corresponding
                    112: .L cat 
                    113: option.
                    114: .PP
                    115: The
                    116: .L add
                    117: .RB ( delete,
                    118: .LR look )
                    119: version of the command
                    120: inserts (removes, looks up) records.
                    121: Input (and output of
                    122: .LR look )
                    123: is in the form produced by the corresponding
                    124: .L cat 
                    125: option.
                    126: The records may be unsorted.
                    127: In newline-separated input, only the keys need be present.
                    128: .SH EXAMPLES
                    129: .TP
                    130: .L
                    131: sort '-t\fR<tab>\fP' +0 -1 inputfile | cbt build btreefile
                    132: <tab> denotes a tab character
                    133: .SH FILES
                    134: .TF /usr/lib/btree/*
                    135: .TP
                    136: .F /usr/lib/btree/*
                    137: .TP
                    138: .F \fIname\fP.[TF]
                    139: .TP
                    140: .F TS*[TF]
                    141: temporaries for
                    142: .B squash
                    143: .SH SEE ALSO
                    144: .IR cbt (3)

unix.superglobalmegacorp.com

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