lint

first pass at making DB use basic integral types (the Alpha port)

search both backwards and forwards if the page is empty and
duplicates are turned on

if enough duplicate keys are entered and deleted, it's possible for
the search to end up in a leaf page that doesn't have any of the searched
for keys, while adjacent pages still have them. If the k

if enough duplicate keys are entered and deleted, it's possible for
the search to end up in a leaf page that doesn't have any of the searched
for keys, while adjacent pages still have them. If the key we end up with
is not an exact match and we're on a page boundary, and duplicate keys are
in the DB, check the adjacent pages for an exact match

show more ...

the __bt_search value shouldn't be stored in a static, can't pin
across calls in that case

4.4BSD snapshot (revision 8.1); add 1993 to copyright

index -> indx_t

move db.h to the end of the includes, make compat.h work better

clear the stack in the search routine; it's a lot simpler

if the tree is being prefix compressed, it's possible to get a base
of zero.

prettiness police

bt_push -> __bt_push

Rev #2. Redo the btree code add recno's and checkpoint

use the pointer name, not the address of its first element

date and time created 91/01/23 08:12:43 by mao