Not logged in

Many hyperlinks are disabled.
Use anonymous login to enable hyperlinks.

Overview
Comment:fix typo in documentation
Timelines: family | ancestors | descendants | both | trunk
Files: files | file ages | folders
SHA1:43955340503c0844dceea7d2a423ca9218851579
User & Date: brandon 2013-11-17 16:43:48
Context
2013-11-17
16:44
update online documentation check-in: 49ffcaef99 user: brandon tags: trunk
16:43
fix typo in documentation check-in: 4395534050 user: brandon tags: trunk
16:42
update online documentation check-in: a6a1a3f1f1 user: brandon tags: trunk
Changes

Changes to doc/zeptodb.texi.

120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
@end example

You can customize the creation of a database in two ways.  The first is
by specifying the number of @dfn{buckets} that comprise the database,
specified via the @option{-b}/@option{--num-buckets} option.  A DBM
database can be imagined as a series of buckets.  When a new item is
added, an algorithm determines which bucket it belongs in based on its
value.  Likewise, the same algorithm will be used in determining the
bucket from which to fetch an item.  If each bucket only contains a
maximum of one item, then you are guaranteed to be able to find any item
in the same amount of time as any other item.  On the other hand, if the
number of buckets is smaller than the number of items, then when you go
to fetch an item from a bucket, you might then have to search through
all the items in that bucket to find the one that you want.  This might
slow you down.  On the other hand, if the number of buckets is far







|







120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
@end example

You can customize the creation of a database in two ways.  The first is
by specifying the number of @dfn{buckets} that comprise the database,
specified via the @option{-b}/@option{--num-buckets} option.  A DBM
database can be imagined as a series of buckets.  When a new item is
added, an algorithm determines which bucket it belongs in based on its
key.  Likewise, the same algorithm will be used in determining the
bucket from which to fetch an item.  If each bucket only contains a
maximum of one item, then you are guaranteed to be able to find any item
in the same amount of time as any other item.  On the other hand, if the
number of buckets is smaller than the number of items, then when you go
to fetch an item from a bucket, you might then have to search through
all the items in that bucket to find the one that you want.  This might
slow you down.  On the other hand, if the number of buckets is far