On Thu, 10 Jul 2003, Andreas J Mueller wrote:
> I know that it's not terribly efficient if the list is really large,
> but doing 24 DBM lookups to find a netblock isn't very efficient,
> either.
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.
--
Philip Hazel University of Cambridge Computing Service,
ph10@??? Cambridge, England. Phone: +44 1223 334714.
Get the Exim 4 book: http://www.uit.co.uk/exim-book
