On Fri, Jul 11, 2003 at 09:51:13AM +0100, Philip Hazel wrote:
> I have had some ideas about keeping some kind of bit-sorted tree as a
> way of representing a collection of IP addresses of various lengths, but
> I have never had the time to sit down and work through them properly.
BSD and Linux use Radix-like trees for their routing tables. This is
a similar application, so that code may be usable.
There are routines available to build and search Patricia Tries that could
be adapted. Though, I believe a patent's been awarded for using Patricia
Tries in string compression, which may taint the code for this purpose.
Steve
----------------------------------------------------------------------
Steven A. Reisman <sar@???> P.O. Box 409
PressEnter LLP 421 N 2nd Street
715-426-2100 or 651-436-5254 River Falls, WI 54022
----------------------------------------------------------------------
