Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Z
ZODB
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Kirill Smelkov
ZODB
Commits
880dc94e
Commit
880dc94e
authored
Dec 09, 2004
by
Tim Peters
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Added minimal IFBTree docs.
parent
5ce266e4
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
20 additions
and
10 deletions
+20
-10
trunk/NEWS.txt
trunk/NEWS.txt
+10
-0
trunk/doc/guide/modules.tex
trunk/doc/guide/modules.tex
+10
-10
No files found.
trunk/NEWS.txt
View file @
880dc94e
...
...
@@ -29,6 +29,16 @@ DB
raised. In ZODB 3.6, these optional arguments will be removed.
BTrees
------
- A new family of BTree types, in the ``IFBTree`` module, map
signed integers (32 bits) to C floats (also 32 bits). The
intended use is to help construct search indices, where, e.g.,
integer word or document identifiers map to scores of some
kind. This is easier than trying to work with scaled integer
score in an ``IIBTree``, and Zope3 has moved to ``IFBTrees``
for these purposes in its search code.
Tools
-----
...
...
trunk/doc/guide/modules.tex
View file @
880dc94e
...
...
@@ -59,11 +59,11 @@ touching every single key).
The BTrees package provides a large collection of related data
structures. There are variants of the data structures specialized to
integers, which are faster and use less memory. There
are f
our
modules that handle the different variants. The first two
are f
ive
modules that handle the different variants. The first two
letters of the module name specify the types of the keys and values in
mappings -- O for any object
and I for integer. For example, the
\module
{
BTrees.IOBTree
}
module provides a mapping with integer
keys and arbitrary objects as values.
mappings -- O for any object
, I for 32-bit signed integer, and F for
32-bit C float. For example, the
\module
{
BTrees.IOBTree
}
module provides
a mapping with integer
keys and arbitrary objects as values.
The four data structures provide by each module are a BTree, a Bucket,
a TreeSet, and a Set. The BTree and Bucket types are mappings and
...
...
@@ -85,10 +85,10 @@ is built out of multiple objects, which ZODB can load individually
as needed.
The four modules are named
\module
{
OOBTree
}
,
\module
{
IOBTree
}
,
\module
{
OIBTree
}
,
and
\module
{
IIBTree
}
. The two letter prefixes are
repeated in the data types names. The
\module
{
BTrees.OOBTree
}
module
defines the following types:
\class
{
OOBTree
}
,
\class
{
OOBucket
}
,
\class
{
OOSet
}
, and
\class
{
OOTreeSet
}
. Similarly, the other
three
modules
\module
{
OIBTree
}
,
\module
{
IIBTree
}
, and
\module
{
IFBTree
}
. The two letter
prefixes are repeated in the data types names. The
\module
{
BTrees.OOBTree
}
module
defines the following types:
\class
{
OOBTree
}
,
\class
{
OOBucket
}
,
\class
{
OOSet
}
, and
\class
{
OOTreeSet
}
. Similarly, the other
four
modules
each define their own variants of those four types.
The
\function
{
keys()
}
,
\function
{
values()
}
, and
\function
{
items()
}
...
...
@@ -179,8 +179,8 @@ BTrees -- \function{difference()}, \function{union()}, and
\function
{
intersection()
}
. The
\function
{
difference()
}
function returns
a Bucket, while the other two methods return a Set.
If the keys are integers, then the module also defines
\function
{
multiunion()
}
. If the values are integers
, then the modul
e
also defines
\function
{
weightedIntersection()
}
and
\function
{
multiunion()
}
. If the values are integers
or floats, then th
e
module
also defines
\function
{
weightedIntersection()
}
and
\function
{
weightedUnion()
}
. The function doc strings describe each
function briefly.
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment