Matt Selsky wrote:
If you want to have a full-on layered permissions scheme (where the action
applies to the smallest containing subnet) you could store a more complicated
hash...
You could also use a Patricia trie to find the smallest matching
network.
See http://search.cpan.org/~plonka/Net-Patricia-1.014/
That's handy... except that it does add a package dependency that wasn't
there
before...
I remember Patricia... It's in the Sedgewick book...
Looking at the code, it's a little hinky... Or it's been too long since
I had to write
an .xs stub. What's up with the "constant" function, and why not just use
isalpha()? Also, "errno" is only ever EINVAL, since the flow always ends up
assigning "errno = EINVAL; return 0;". The code in not_there: is
unreachable;
and there's no default case for the "switch", and not of the labels in
the switch
do anything but "break" anyway... so the whole "switch" is a no-op...
How does constant() get called?
-Philip
_______________________________________________
NOTE: If there is a disclaimer or other legal boilerplate in the above
message, it is NULL AND VOID. You may ignore it.
Visit http://www.mimedefang.org and http://www.roaringpenguin.com
MIMEDefang mailing list [email protected]
http://lists.roaringpenguin.com/mailman/listinfo/mimedefang
