 Georg Hopp
|
b32823cd30
|
add heap code
|
11 years ago |
|
Georg Hopp
|
49c7f8be2c
|
separate find last index into its own function
|
11 years ago |
|
Georg Hopp
|
054fab8b44
|
New dynamic array implementation.
|
11 years ago |
|
Georg Hopp
|
1753e0928d
|
cleanup empties the hash but does not remove the tree root, as this is removed in the destructor.
|
11 years ago |
|
Georg Hopp
|
daaa2133b2
|
use threadsave libc. Prepare code for locks. Separate tree and tree elements. Use c99 standard.
|
11 years ago |
|
Georg Hopp
|
21cf5258cb
|
Revert "try to make data structures thread save by using a mutex"
This reverts commit 88d64d65ab.
|
11 years ago |
|
Georg Hopp
|
af33e8450f
|
Revert "try to make code more thread save"
This reverts commit 2f3a24d906.
|
11 years ago |
|
Georg Hopp
|
2f3a24d906
|
try to make code more thread save
|
11 years ago |
|
Georg Hopp
|
88d64d65ab
|
try to make data structures thread save by using a mutex
|
11 years ago |
|
Georg Hopp
|
7a1cb6982a
|
loc action
|
11 years ago |
|
Georg Hopp
|
0b485ec798
|
now its possible to say a hash that it should not free its members on cleanup... useful if several structures hold the members
|
11 years ago |
|
Georg Hopp
|
dba7679800
|
small fix in queuePutFirst
|
11 years ago |
|
Georg Hopp
|
b9b5faa37d
|
add queueDestroy and hashEmpty
|
11 years ago |
|
Georg Hopp
|
d8b2c214e9
|
small fix in delete
|
11 years ago |
|
Georg Hopp
|
96d30bb5f3
|
add more list like functions to the queue .. they are not used now and not testes, so they probably have bugs.
|
11 years ago |
|
Georg Hopp
|
28134883d6
|
small fix in queuePutFirst
|
11 years ago |
|
Georg Hopp
|
9d8045fbba
|
add m4 shipped with this project
|
11 years ago |
|
Georg Hopp
|
35fa742df4
|
add put_first
|
11 years ago |
|
Georg Hopp
|
f7108d4bab
|
add possibility to inject extra data into treeWalk and hashEach and change queue detructor to only conditionally free data within the nodes.
|
12 years ago |
|
Georg Hopp
|
da66d5df84
|
Use new class interface and update copyright information
|
12 years ago |
|
Georg Hopp
|
47b80e1c97
|
initialize static instance creation
|
12 years ago |
|
Georg Hopp
|
10c40865ae
|
change wrong comment
|
12 years ago |
|
Georg Hopp
|
265c8661a6
|
only trigger the if action is not null during walk or destroy
|
12 years ago |
|
Georg Hopp
|
077376be5e
|
don't replace tree nodes on insert but return the existing one. Note that this is different from the behaviour of tsearch which is the POSIX equivalent of this function, but in various situations it is much more handy.
|
12 years ago |
|
Georg Hopp
|
309ecbaf51
|
ignore generated config file
|
12 years ago |
|
Georg Hopp
|
46ea3bc838
|
small fix
|
12 years ago |
|
Georg Hopp
|
116911945e
|
fix position of TR_TREE_FIND call
|
12 years ago |
|
Georg Hopp
|
99ce2633f5
|
use rebalance macros
|
12 years ago |
|
Georg Hopp
|
4990e7d4d9
|
fix a small algorythmic bug introduced during optimization.
|
12 years ago |
|
Georg Hopp
|
eacc711dbf
|
moved tree macros to trbase library, as they are also used in the memory management. Some small fixes
|
12 years ago |
|
Georg Hopp
|
07cb206931
|
Created a macro for tree find to prevent duplicating this code in insert and delete.
|
12 years ago |
|
Georg Hopp
|
af8994b0c6
|
modified the rotate macro so that it works with any structure that has a left, right and parent reference to variables of itself.
|
12 years ago |
Georg Hopp
|
3266c80841
|
some more optimizations by preventing NULL checks
|
12 years ago |
|
Georg Hopp
|
895e789181
|
started some optimizations, but with not much effect for now
|
12 years ago |
|
Georg Hopp
|
21fc0713aa
|
initial checkin
|
12 years ago |
