GIT.Harvie.CZ
/
svn
/
Cll1h
/
.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
do not compile yet
[svn/Cll1h/.git]
/
demos
/
trees.c
diff --git
a/demos/trees.c
b/demos/trees.c
index 44c9ad5903c6eda277c02ad921ffa69dbea5bf16..dff0ddafdeea0213c17f41f1ed2a0e3b4c2f500b 100644
(file)
--- a/
demos/trees.c
+++ b/
demos/trees.c
@@
-22,24
+22,25
@@
program
//grow tree
{
//grow tree
{
- void *prev = NULL, *newleaf = leaf;
-
+ void *prev=NULL, *newleaf=leaf;
//find where to store
//find where to store
- for(leaf=root; leaf && leaf->__key
<=
newkey ; leaf=leaf->__next)
+ for(leaf=root; leaf && leaf->__key
<=
newkey ; leaf=leaf->__next)
{
{
- prev
=
leaf;
- if(leaf->__seek && leaf->__seek->key
<=
newkey) leaf=leaf->__seek;
+ prev
=
leaf;
+ if(leaf->__seek && leaf->__seek->key
<=
newkey) leaf=leaf->__seek;
}
}
-
//store new node
//store new node
+ leaf=newleaf;
if(prev)
{
if(prev)
{
-
+ leaf->__next=prev->__next->__next;
+ prev->__next=leaf;
}
else
}
else
- {
-
- }
+ leaf->__next=root;
+ //auto seek
+ if(leaf->__next->__next;)
+ leaf->__seek=leaf->__next->__next;
//reindex B+ tree
for(leaf=root; leaf->__next ; leaf=leaf->__next)
//reindex B+ tree
for(leaf=root; leaf->__next ; leaf=leaf->__next)
This page took
0.138273 seconds
and
4
git commands to generate.