On Mon, Oct 16, 2000 at 12:19:42PM -0500, Dave Plonka wrote:
> Perl module folks,
>
> I am preparing, for CPAN, my perl module which implements a PATRICIA
> Trie for fast lookups by IP address.
>
> Name DSLI Description Info
> ------------- ---- -------------------------------------------- -----
> Net::Patricia RdcO perl API for fast lookups by IP address PLONKA
>
> I think it belongs in the Net namespace because it requires that the
> search keys must consist of IP addresses and netmasks, and the
> underlying C code on which it is based requires that as well. I.e.
> this module is not a general Trie implementation like Text::Trie or
> Tree::Trie.
It seems to me that it would be more appropriate as, e.g.,
Tree::Patricia. It doesn't implement network protocols, rather it
manipulates data structures. The fact that the elements of the
data structure _can_ obviously be interpreted as CIDR addresses and
netmasks doesn't prevent one from coming up with more dastardly uses
for the module.
> Patricia Trie is the data structure used by the BSD kernel routing code
> (where it is misnamed "radix") for which it was proposed by Van
> Jacobsen. Further explanation and references for the name is in the
> "DESCRIPTION" section in the attaced file.
>
> My module is currently called "Net::PatriciaTrie".
> ^^^^
> I have considered shortening it to "Net::Patricia" since that is
> sufficiently descriptive (since Patricia implies that the data
> structure is a tree or trie), and the use of the term "Trie", while
> correct, is somewhat obscure. Input welcome.
>
> The POD is available here:
>
> http://net.doit.wisc.edu/~plonka/Net-PatriciaTrie/
>
> and is also attached as plain text.
Very useful. Thanks for your work!
Peace,
* Kurt Starsinic ([EMAIL PROTECTED]) ---------------- Senior Software Architect *
| "There is an old network saying: Bandwidth problems can be cured with |
| money. Latency problems are harder because the speed of light is |
| fixed - you can't bribe God." --- David Clark, MIT |
