diff options
Diffstat (limited to 'man3/btree.3')
| -rw-r--r-- | man3/btree.3 | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/man3/btree.3 b/man3/btree.3 index b3ce40c13..3ed661ee7 100644 --- a/man3/btree.3 +++ b/man3/btree.3 @@ -28,18 +28,18 @@ Probably, you are looking for the APIs provided by the library instead. .P The routine -.BR dbopen (3) +.MR dbopen 3 is the library interface to database files. One of the supported file formats is btree files. The general description of the database access methods is in -.BR dbopen (3), +.MR dbopen 3 , this manual page describes only the btree-specific information. .P The btree data structure is a sorted, balanced tree structure storing associated key/data pairs. .P The btree access-method-specific data structure provided to -.BR dbopen (3) +.MR dbopen 3 is defined in the .I <db.h> include file as follows: @@ -70,7 +70,7 @@ Permit duplicate keys in the tree, that is, permit insertion if the key to be inserted already exists in the tree. The default behavior, as described in -.BR dbopen (3), +.MR dbopen 3 , is to overwrite a matching key when inserting a new key or to fail if the .B R_NOOVERWRITE @@ -209,14 +209,14 @@ The access method routines may fail and set .I errno for any of the errors specified for the library routine -.BR dbopen (3). +.MR dbopen 3 . .SH BUGS Only big and little endian byte order is supported. .SH SEE ALSO -.BR dbopen (3), -.BR hash (3), -.BR mpool (3), -.BR recno (3) +.MR dbopen 3 , +.MR hash 3 , +.MR mpool 3 , +.MR recno 3 .P .IR "The Ubiquitous B-tree" , Douglas Comer, ACM Comput. Surv. 11, 2 (June 1979), 121-138. |