 Diego Biurrun
|
89c9ff504b
spelling/grammar/consistency review part I
|
15 years ago |
|
Aurelien Jacobs
|
045cbba92d
cosmetic: indent
|
15 years ago |
|
Aurelien Jacobs
|
d8bd113ef4
add a termination condition
|
15 years ago |
|
Michael Niedermayer
|
eed3607564
Avoid undefined behavior for removing elements that were not in the tree.
|
16 years ago |
|
Michael Niedermayer
|
51198a8737
Comment to explain how the add/remove core works.
|
16 years ago |
|
Michael Niedermayer
|
5d1e3d2210
Print removing of nodes in the test code.
|
16 years ago |
|
Michael Niedermayer
|
3f161c7eab
simplify
|
16 years ago |
|
Diego Biurrun
|
a005768d25
Remove unused variable j.
|
16 years ago |
|
Michael Niedermayer
|
a35bf971c6
indent
|
16 years ago |
|
Michael Niedermayer
|
2e1d287329
Flip key and element so types match, not that it matters for any code
|
16 years ago |
|
Michael Niedermayer
|
d5cb5fe86b
Fix selftest.
|
16 years ago |
|
Michael Niedermayer
|
f05dda3b7a
Support removing elements.
|
16 years ago |
|
Michael Niedermayer
|
6e8b982bcc
Move *malloc() out of tree.c, that way the code can be used with
|
16 years ago |
|
Michael Niedermayer
|
116d15ccf1
Always set next correctly, even if a matching element is found (that is
|
16 years ago |
|
Diego Biurrun
|
f8a80fd69d
main() --> main(void)
|
16 years ago |
|
Michael Niedermayer
|
eaaa48b29e
0.5l
|
17 years ago |
|
Michael Niedermayer
|
3320687691
improve enumerate so arbitrary ranges can be enumerated quickly
|
17 years ago |
|
Michael Niedermayer
|
9eb88fdeba
AVL tree
|
17 years ago |
