| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2010-02-17 | Replaces the algorithm for building balanced trees. | Ondrej Zajicek | |
| Changes the time complexity of the algorithm from O(n^2) to O(n*log(n)). This speeds up loading of huge DEC-IX config from 128 s to 15 s. It also makes the code significantly simpler. | |||
| 2000-06-07 | Progdocs updates | Pavel Machek | |
| 2000-06-07 | Even better documentation of filters. | Pavel Machek | |
| 2000-06-07 | Comment fix. | Pavel Machek | |
| 2000-06-07 | Better progdocs for filters | Pavel Machek | |
| 2000-04-01 | Removed lots of superfluous includes. | Martin Mares | |
| Use debug() instead of printf(). | |||
| 2000-01-31 | filter_same() implemented. Don't bet on it, yet. | Pavel Machek | |
| 1999-10-28 | switch() { } done right. | Pavel Machek | |
| 1999-04-12 | Sets of integers now actually work. Sets of IP will work as soon as | Pavel Machek | |
| compare function is ready. | |||
 |
index : bird | |
| [no description] | Matthias Schiffer <mschiffer@universe-factory.net> |
| summaryrefslogtreecommitdiffstats |