| btree.3 (119893) | btree.3 (131504) |
|---|---|
| 1.\" Copyright (c) 1990, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" Redistribution and use in source and binary forms, with or without 5.\" modification, are permitted provided that the following conditions 6.\" are met: 7.\" 1. Redistributions of source code must retain the above copyright 8.\" notice, this list of conditions and the following disclaimer. --- 16 unchanged lines hidden (view full) --- 25.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30.\" SUCH DAMAGE. 31.\" 32.\" @(#)btree.3 8.4 (Berkeley) 8/18/94 | 1.\" Copyright (c) 1990, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" Redistribution and use in source and binary forms, with or without 5.\" modification, are permitted provided that the following conditions 6.\" are met: 7.\" 1. Redistributions of source code must retain the above copyright 8.\" notice, this list of conditions and the following disclaimer. --- 16 unchanged lines hidden (view full) --- 25.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30.\" SUCH DAMAGE. 31.\" 32.\" @(#)btree.3 8.4 (Berkeley) 8/18/94 |
| 33.\" $FreeBSD: head/lib/libc/db/man/btree.3 119893 2003-09-08 19:57:22Z ru $ | 33.\" $FreeBSD: head/lib/libc/db/man/btree.3 131504 2004-07-02 23:52:20Z ru $ |
| 34.\" 35.Dd August 18, 1994 36.Dt BTREE 3 37.Os 38.Sh NAME 39.Nm btree 40.Nd "btree database access method" 41.Sh SYNOPSIS --- 40 unchanged lines hidden (view full) --- 82The elements of this structure are as follows: 83.Bl -tag -width indent 84.It Va flags 85The flag value is specified by 86.Em or Ns 'ing 87any of the following values: 88.Bl -tag -width indent 89.It Dv R_DUP | 34.\" 35.Dd August 18, 1994 36.Dt BTREE 3 37.Os 38.Sh NAME 39.Nm btree 40.Nd "btree database access method" 41.Sh SYNOPSIS --- 40 unchanged lines hidden (view full) --- 82The elements of this structure are as follows: 83.Bl -tag -width indent 84.It Va flags 85The flag value is specified by 86.Em or Ns 'ing 87any of the following values: 88.Bl -tag -width indent 89.It Dv R_DUP |
| 90Permit duplicate keys in the tree, i.e. permit insertion if the key to be | 90Permit duplicate keys in the tree, i.e., permit insertion if the key to be |
| 91inserted already exists in the tree. 92The default behavior, as described in 93.Xr dbopen 3 , 94is to overwrite a matching key when inserting a new key or to fail if 95the 96.Dv R_NOOVERWRITE 97flag is specified. 98The --- 41 unchanged lines hidden (view full) --- 140.\" must always be greater than or equal to 2. 141.\" If 142.\" .Va maxkeypage 143.\" is 0 (no maximum number of keys is specified) the page fill factor is 144.\" made as large as possible (which is almost invariably what is wanted). 145.It Va minkeypage 146The minimum number of keys which will be stored on any single page. 147This value is used to determine which keys will be stored on overflow | 91inserted already exists in the tree. 92The default behavior, as described in 93.Xr dbopen 3 , 94is to overwrite a matching key when inserting a new key or to fail if 95the 96.Dv R_NOOVERWRITE 97flag is specified. 98The --- 41 unchanged lines hidden (view full) --- 140.\" must always be greater than or equal to 2. 141.\" If 142.\" .Va maxkeypage 143.\" is 0 (no maximum number of keys is specified) the page fill factor is 144.\" made as large as possible (which is almost invariably what is wanted). 145.It Va minkeypage 146The minimum number of keys which will be stored on any single page. 147This value is used to determine which keys will be stored on overflow |
| 148pages, i.e. if a key or data item is longer than the pagesize divided | 148pages, i.e., if a key or data item is longer than the pagesize divided |
| 149by the minkeypage value, it will be stored on overflow pages instead 150of in the page itself. 151If 152.Va minkeypage 153is 0 (no minimum number of keys is specified) a value of 2 is used. 154.It Va psize 155Page size is the size (in bytes) of the pages used for nodes in the tree. 156The minimum page size is 512 bytes and the maximum page size is 64K. --- 119 unchanged lines hidden --- | 149by the minkeypage value, it will be stored on overflow pages instead 150of in the page itself. 151If 152.Va minkeypage 153is 0 (no minimum number of keys is specified) a value of 2 is used. 154.It Va psize 155Page size is the size (in bytes) of the pages used for nodes in the tree. 156The minimum page size is 512 bytes and the maximum page size is 64K. --- 119 unchanged lines hidden --- |