ghopp
/
taskrambler
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
117 Commits
8 Branches
10 Tags
3.6 MiB
Tree: d3e7244592
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'd3e7244592'
${ noResults }
Commit Graph

10 Commits (d3e7244592107458dcc87f18f118a9e6df387cd8)

Author SHA1 Message Date
Georg Hopp c8dc541c48 use now my own tree implementation as base for my hashes....sadly this thing is leaking memory again...on the other hand I workarounded the problem of a sometimes occuring infinite loop within connect.
12 years ago
Georg Hopp 157f48031c now valgrind shows no more violations...but cleanup does not work correcly. The memory usage depends now on the amount of paralell connections...ab show approximately 10% to 20% performance improvement / and the code is far from optimal.
12 years ago
Georg Hopp 55675eb50a tree based memory management does not segfault anymore, but reusage does not seem to work, as well as free
12 years ago
Georg Hopp 06266ef541 update todo and make my rbtree implementation use externally allocated elements.
12 years ago
Georg Hopp ef6ccfbcbe rbtree insert and delete now as one function and working as expected...still has to be checked on sideeffects.
12 years ago
Georg Hopp a543ed8538 all insert cases merged in one insertElement function.
12 years ago
Georg Hopp 5ea16b6227 now the memory is freed outside the tree delete function....
12 years ago
Georg Hopp c3498917bc now it seems that rb trees are working now...stiff a lot of optimization work to be done, as this is mostly one 2 one the code from wikipedia, with some modifiations to work with NULL leaf nodes.
12 years ago
Georg Hopp f54c40e264 inserting in red black tree now works as in my example.
12 years ago
Georg Hopp fafc5af2ab cope binarytree to play with an rbtree implementation
12 years ago
Georg Hopp ac93db101b fix traversal
12 years ago
Georg Hopp 1f40d1bc4b alternative approach on delete of single child nodes. This one really exchanges the nodes, thus preventing large copy on big data that might be in the tree...anyway, for small data i think the other approach is faster.
12 years ago
Georg Hopp e5fa68bf02 now use the parent in element in delete
12 years ago
Georg Hopp 847b275c86 fix insert and make another in-order traverse for checking
12 years ago
Georg Hopp 84451e7de3 remove wrong comment
12 years ago
Georg Hopp 74a60c72c1 add parent in element and implement an iterative in-order traversal with it.
12 years ago
Georg Hopp 3da465a846 add first own binary tree testcode. Not ballanced right now.
12 years ago