Sears Russell
041bfce736
The bucket list entries for variable lenth hash tables were too long, causing memory corruption, and wasting space+log bandwidth
2006-04-04 22:34:35 +00:00
Sears Russell
ef3c30b190
Benchmark updates.
2005-03-20 05:17:25 +00:00
Sears Russell
26d50f19e3
Cleaned up berkeley db tests / lladd logger optimizations + bug fix.
2005-03-19 20:28:30 +00:00
Sears Russell
ed49949512
This commit breaks the build so that Jimmy and I can sync. Sorry. :(
2005-03-14 00:25:29 +00:00
Sears Russell
18c772234d
new benchmarks revealed that inserts for linkedList, pageOrientedList were taking O(n) time, yielding O(n^2)
...
time to build a list, since the lists could not contain duplicate keys. These operations are now O(1), and
the lists can contain duplicates.
2005-03-10 20:10:49 +00:00
Sears Russell
f28df29736
Fixed unit tests, added iterator interface, and generic (almost) iterator test harness.
2005-03-10 03:19:04 +00:00
Sears Russell
a3112ee81c
Fixes for freebsd.
2005-03-02 05:47:38 +00:00
Sears Russell
3e5f7aea8a
Bugfixes for OASYS.
2005-03-01 07:32:02 +00:00
Sears Russell
41fb85eef0
More error handling...
2005-02-22 03:10:54 +00:00
Sears Russell
84a20a3c96
Started adding error handling code to LLADD.
2005-02-16 04:11:14 +00:00
Sears Russell
7cf5fdee6e
Re-implemented pageOrientedListNTA from scratch. It's now more flexible, but relies on features that are not provided by Talloc/Tdealloc, so performance isn't as good as it could be.
2005-01-29 01:17:37 +00:00
Sears Russell
56d98adcbf
Working, but slow and non-concurrent variable length key/value support for linear hashtable.
2005-01-28 21:28:23 +00:00
Sears Russell
d7b846d370
CHT is starting to work.
2005-01-19 00:47:55 +00:00
Sears Russell
ac0d413e58
- linkedListNTA is now re-entrant.
...
- linearHashNTA now uses nested top actions, is re-entrant, and supports a
non-re-entrant iterator
- 'recursive' nested top actions allow nested top actions to be nested within each
other.
2005-01-15 01:45:27 +00:00
Sears Russell
360f0d15e2
Working, non-concurrent linear hash and linked list implementations.
...
The idea is to implement the non-concurrent versions, and then convert
them to concurrent versions using nested top actions.
2005-01-14 01:52:53 +00:00
