Ondrej Zajicek dfd48621d1 Replaces the algorithm for building balanced trees. ... 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.		2010-02-17 22:11:42 +01:00
..
config.Y	Changes right recursion to left in the grammar of the case expression.	2010-02-17 11:29:48 +01:00
Doc	Reimplementation of prefix sets.	2009-03-31 12:55:57 +02:00
f-util.c	... and in the filter.	2004-06-05 09:26:55 +00:00
filter.c	Replaces the algorithm for building balanced trees.	2010-02-17 22:11:42 +01:00
filter.h	Replaces the algorithm for building balanced trees.	2010-02-17 22:11:42 +01:00
Makefile	Reimplementation of prefix sets.	2009-03-31 12:55:57 +02:00
test6.conf	Reimplementation of prefix sets.	2009-03-31 12:55:57 +02:00
test.conf	Replaces the algorithm for building balanced trees.	2010-02-17 22:11:42 +01:00
test.conf2	Allow matching on enums:	2000-06-01 08:32:49 +00:00
tree.c	Replaces the algorithm for building balanced trees.	2010-02-17 22:11:42 +01:00
trie.c	Some cleanups.	2009-08-27 19:01:04 +02:00