Not logged in

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

Overview
Comment:update online documentation
Timelines: family | ancestors | descendants | both | trunk
Files: files | file ages | folders
SHA1:49ffcaef99cc95e4b4c9fec495b766d0825d2475
User & Date: brandon 2013-11-17 16:44:15
Context
2013-11-17
16:45
fix typo in documentation check-in: 652004d52e user: brandon tags: trunk
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
Changes

Changes to www/html_node/Tutorial.html.

91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
</pre></div>

<p>You can customize the creation of a database in two ways.  The first is
by specifying the number of <em>buckets</em> that comprise the database,
specified via the <samp>-b</samp>/<samp>--num-buckets</samp> 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







|







91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
</pre></div>

<p>You can customize the creation of a database in two ways.  The first is
by specifying the number of <em>buckets</em> that comprise the database,
specified via the <samp>-b</samp>/<samp>--num-buckets</samp> 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

Changes to www/zeptodb.dvi.gz.

cannot compute difference between binary files

Changes to www/zeptodb.html.

218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
</pre></div>

<p>You can customize the creation of a database in two ways.  The first is
by specifying the number of <em>buckets</em> that comprise the database,
specified via the <samp>-b</samp>/<samp>--num-buckets</samp> 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







|







218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
</pre></div>

<p>You can customize the creation of a database in two ways.  The first is
by specifying the number of <em>buckets</em> that comprise the database,
specified via the <samp>-b</samp>/<samp>--num-buckets</samp> 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

Changes to www/zeptodb.html.gz.

cannot compute difference between binary files

Changes to www/zeptodb.html_node.tar.gz.

cannot compute difference between binary files

Changes to www/zeptodb.info.tar.gz.

cannot compute difference between binary files

Changes to www/zeptodb.pdf.

cannot compute difference between binary files

Changes to www/zeptodb.texi.tar.gz.

cannot compute difference between binary files

Changes to www/zeptodb.txt.

62
63
64
65
66
67
68
69
70
71
72
73
74
75
76

     $ zdbc foo.db

   You can customize the creation of a database in two ways.  The first
is by specifying the number of "buckets" that comprise the database,
specified via the '-b'/'--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







|







62
63
64
65
66
67
68
69
70
71
72
73
74
75
76

     $ zdbc foo.db

   You can customize the creation of a database in two ways.  The first
is by specifying the number of "buckets" that comprise the database,
specified via the '-b'/'--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

Changes to www/zeptodb.txt.gz.

cannot compute difference between binary files