X-Git-Url: http://git.osdn.net/view?a=blobdiff_plain;f=original%2Fman3%2Fbtree.3;h=dc02563abc0e3ee9c3896ef5e99a78b815b48e9e;hb=07fa5605e0daad79b4953812940975c354154113;hp=ef657b72612a95d30b56f5de871e704db0f544a7;hpb=bf11c0c4717abfd30785b3991b933f4687bb24fc;p=linuxjm%2FLDP_man-pages.git

diff --git a/original/man3/btree.3 b/original/man3/btree.3
index ef657b72..dc02563a 100644
--- a/original/man3/btree.3
+++ b/original/man3/btree.3
@@ -58,12 +58,12 @@ 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),
-this manual page describes only the btree specific information.
+this manual page describes only the btree-specific information.
 .PP
 The btree data structure is a sorted, balanced tree structure storing
 associated key/data pairs.
 .PP
-The btree access method specific data structure provided to
+The btree access-method-specific data structure provided to
 .BR dbopen (3)
 is defined in the
 .I <db.h>
@@ -133,7 +133,7 @@ Obviously, using a cache increases (but only increases) the likelihood of
 corruption or lost data if the system crashes while a tree is being modified.
 If
 .I cachesize
-is 0 (no size is specified) a default cache is used.
+is 0 (no size is specified), a default cache is used.
 .TP
 .I maxkeypage
 The maximum number of keys which will be stored on any single page.
@@ -144,7 +144,7 @@ Not currently implemented.
 .\" must always be greater than or equal to 2.
 .\" If
 .\" .I maxkeypage
-.\" is 0 (no maximum number of keys is specified) the page fill factor is
+.\" is 0 (no maximum number of keys is specified), the page fill factor is
 .\" made as large as possible (which is almost invariably what is wanted).
 .TP
 .I minkeypage
@@ -155,14 +155,14 @@ by the minkeypage value, it will be stored on overflow pages instead
 of in the page itself.
 If
 .I minkeypage
-is 0 (no minimum number of keys is specified) a value of 2 is used.
+is 0 (no minimum number of keys is specified), a value of 2 is used.
 .TP
 .I psize
 Page size is the size (in bytes) of the pages used for nodes in the tree.
 The minimum page size is 512 bytes and the maximum page size is 64K.
 If
 .I psize
-is 0 (no page size is specified) a page size is chosen based on the
+is 0 (no page size is specified), a page size is chosen based on the
 underlying filesystem I/O block size.
 .TP
 .I compare
@@ -202,7 +202,7 @@ The number should represent the order as an integer; for example,
 big endian order would be the number 4,321.
 If
 .I lorder
-is 0 (no order is specified) the current host order is used.
+is 0 (no order is specified), the current host order is used.
 .PP
 If the file already exists (and the
 .B O_TRUNC
@@ -252,3 +252,12 @@ Bayer and Unterauer, ACM Transactions on Database Systems, Vol. 2, 1
 
 .IR "The Art of Computer Programming Vol. 3: Sorting and Searching" ,
 D.E. Knuth, 1968, pp 471-480.
+.SH COLOPHON
+This page is part of release 3.78 of the Linux
+.I man-pages
+project.
+A description of the project,
+information about reporting bugs,
+and the latest version of this page,
+can be found at
+\%http://www.kernel.org/doc/man\-pages/.