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