Commit message (Expand) | Author | Age | |
---|---|---|---|
* | Comment to explain how the add/remove core works. | Michael Niedermayer | 2008-01-23 |
* | Print removing of nodes in the test code. | Michael Niedermayer | 2008-01-16 |
* | simplify | Michael Niedermayer | 2008-01-16 |
* | Remove unused variable j. | Diego Biurrun | 2008-01-08 |
* | indent | Michael Niedermayer | 2008-01-04 |
* | Flip key and element so types match, not that it matters for any code | Michael Niedermayer | 2008-01-04 |
* | Fix selftest. | Michael Niedermayer | 2008-01-04 |
* | Support removing elements. | Michael Niedermayer | 2008-01-04 |
* | Move *malloc() out of tree.c, that way the code can be used with | Michael Niedermayer | 2008-01-04 |
* | Always set next correctly, even if a matching element is found (that is | Michael Niedermayer | 2008-01-04 |
* | main() --> main(void) | Diego Biurrun | 2007-11-23 |
* | 0.5l | Michael Niedermayer | 2006-11-14 |
* | improve enumerate so arbitrary ranges can be enumerated quickly | Michael Niedermayer | 2006-11-14 |
* | AVL tree | Michael Niedermayer | 2006-11-14 |