Newest Files
 Nov.20
Driver for Broadcom 570x 10/100 Ethernet Driver.
 Nov.16
This is a 650mb raw disk image that will eventually ...
 Nov.12
About Photograbber:
PhotoGrabber ha...
 Nov.11
Driver for Broadcom 440x 10/100 Ethernet Driver.
 Nov.09
This is a 10gb expanding VMWare disk image. I plan t...
 Nov.09
About IPW2100:
Driver for Intel(R) PRO/Wireless...
 Nov.09
Attansic L2 FastEthernet adapter:
Driver for At...
 Nov.09
About Pegasus BeOS Driver:
Pegasus BeOS driver....
 Nov.08
SLFFEA stands for San Le's Free Finite Element Ana...
 Nov.08
Aladdin is a computational toolkit for the interac...
 Oct.28
Qonk is a small space build-and-conquer strategy gam...
 Oct.25
This port is based on the work done by Takashi Toyos...
 Oct.25
These are the icons Haiku comes with converted from ...
 Oct.17
This project was based on the popular weekly superpa...
 Oct.16
The MUSCLE system is a robust, somewhat scalable, cr...
|
- Description:
-

About AVLDupTree:
AVL Balanced Binary Tree with Duplicates handling and a stylish GUI Demo.
Short: AVL Balanced Binary Tree with Duplicates handling and GUI Demo.
Author: agmsmith@achilles.net (Alexander G. M. Smith)
Uploader: agmsmith@achilles.net (Alexander G. M. Smith)
Website: http://www.achilles.net/~agmsmith/
Version: 1.0
Type: Development/Example Code
Requires: BeOS 5.0+
AVLDupTree is a set of C subroutines (not C++, so you can use it in
drivers) that is useful for indexing a set of key/value pairs, using
the key to find a matching value. The standard AVL balanced binary tree
algorithm is enhanced to support multiple values for the same key. It
is designed for future use in a file system to support fast attribute
indexing and queries, but you can use it for other things.
The API supports these operations:
Create a tree, with a specified data type for keys and another for
values (choose from C string (any length), int32, int64, float,
double). Optionally enable multitasking protection - which allows N
simultaneous readers or one writer.
Deallocate a tree and its contents.
Add a key/value pair.
Delete a key/value pair.
Iterate over the tree. This uses a callback function for efficiency, so
you can process a large batch of key/values in one operation rather
than having a "find" operation to find individual ones. It is
generalized to efficiently iterate over an optionally open ended range
of keys, optionally including the ones equal to your range limits (the
difference between less-than-or-equal and less-than), making it ideal
for query processing.
AGMSAVLTest is a BeOS GUI program for testing the tree library and
demonstrating the tree operations via a graphical display of the tree.
It also has a cool subtle colour cycling effect.
AVLDupTree is released under the GNU Lesser General Public License. The AGMSAVLTest program is released as public domain.
- Alex (Ottawa, March 2001)
| |
 |
|
Details about this version:
Version 1.0 is the initial version, supporting basic Add, Delete and Range Iterate operations. |
- License:
-
LGPL
- Submitted On:
-
29 Oct 2007
- Submitted By:
-
Karl vom Dorff (karl)
- File Date:
-
29 Oct 2007
- File Author:
-
Alexander G. M. Smith
- File Version:
-
1.0
- File Size:
-
153.22 Kb
- File Type:
-
zip
- File HomePage:
- Click to visit site
- Downloads:
-
5
- Rating:
-
 Total Votes:0
|
|