1# @(#)VERSION 8.1 (Berkeley) 06/06/93 2 3This is version 1.6 of the Berkeley DB code. 4 5If your version of the DB code doesn't have a copy of 6this version file, it's really old, please update it! 7 8New versions of this software are periodically made 9available by anonymous ftp from ftp.cs.berkeley.edu, 10in the file ucb/4bsd/db.tar.Z, or from ftp.uu.net. 11 12Email questions may be addressed to Keith Bostic at 13bostic@cs.berkeley.edu. 14 15============================================ 161.5 -> 1.6 06 Jun 1993 17 hash: In PAIRFITS, the first comparison should look at (P)[2]. 18 The hash_realloc function was walking off the end of memory. 19 The overflow page number was wrong when bumping splitpoint. 201.4 -> 1.5 23 May 1993 21 hash: Set hash default fill factor dynamically. 22 recno: Fixed bug in sorted page splits. 23 Add page size parameter support. 24 Allow recno to specify the name of the underlying btree; 25 used for vi recovery. 26 btree/recno: 27 Support 64K pages. 28 btree/hash/recno: 29 Provide access to an underlying file descriptor. 30 Change sync routines to take a flag argument, recno 31 uses this to sync out the underlying btree. 32 331.3 -> 1.4 10 May 1993 34 recno: Delete the R_CURSORLOG flag from the recno interface. 35 Zero-length record fix for non-mmap reads. 36 Try and make SIZE_T_MAX test in open portable. 37 381.2 -> 1.3 1 May 1993 39 btree: Ignore user byte-order setting when reading already 40 existing database. Fixes to byte-order conversions. 41 421.1 -> 1.2 15 Apr 1993 43 No bug fixes, only compatibility hacks. 44============================================ 45 46Distribution contents: 47 Makefile.inc Ignore this, it's Berkeley's internal Makefile. 48 PORT The directory to build in. 49 README This file. 50 VERSION This file. 51 btree B+tree routines. 52 db Dbopen(3) interface routine. 53 doc USENIX papers. 54 hash Extended linear hashing routines. 55 man Man pages. 56 mpool Memory pool routines. 57 recno Fixed/variable length routines. 58 test Test package. 59