BSD 4_4 release
[unix-history] / usr / src / lib / libc / db / VERSION
# @(#)VERSION 8.1 (Berkeley) 6/6/93
This is version 1.6 of the Berkeley DB code.
If your version of the DB code doesn't have a copy of
this version file, it's really old, please update it!
New versions of this software are periodically made
available by anonymous ftp from ftp.cs.berkeley.edu,
in the file ucb/4bsd/db.tar.Z, or from ftp.uu.net.
Email questions may be addressed to Keith Bostic at
bostic@cs.berkeley.edu.
============================================
1.5 -> 1.6 06 Jun 1993
hash: In PAIRFITS, the first comparison should look at (P)[2].
The hash_realloc function was walking off the end of memory.
The overflow page number was wrong when bumping splitpoint.
1.4 -> 1.5 23 May 1993
hash: Set hash default fill factor dynamically.
recno: Fixed bug in sorted page splits.
Add page size parameter support.
Allow recno to specify the name of the underlying btree;
used for vi recovery.
btree/recno:
Support 64K pages.
btree/hash/recno:
Provide access to an underlying file descriptor.
Change sync routines to take a flag argument, recno
uses this to sync out the underlying btree.
1.3 -> 1.4 10 May 1993
recno: Delete the R_CURSORLOG flag from the recno interface.
Zero-length record fix for non-mmap reads.
Try and make SIZE_T_MAX test in open portable.
1.2 -> 1.3 1 May 1993
btree: Ignore user byte-order setting when reading already
existing database. Fixes to byte-order conversions.
1.1 -> 1.2 15 Apr 1993
No bug fixes, only compatibility hacks.
============================================
Distribution contents:
Makefile.inc Ignore this, it's Berkeley's internal Makefile.
PORT The directory to build in.
README This file.
VERSION This file.
btree B+tree routines.
db Dbopen(3) interface routine.
doc USENIX papers.
hash Extended linear hashing routines.
man Man pages.
mpool Memory pool routines.
recno Fixed/variable length routines.
test Test package.