| Subject: | Support for opaque bitstrings (blobs) of arbitrary length needed |
With a little hackery, support could be added to do DNS matching, via:
my $blob = join('.', reverse(split(/\./, $domain_name)));
and then searching on the nearest to $blob, length($blob) * 8 ...
Issue is that libpatricia makes a pessimistic assumption about the
density of the trie (i.e. worst case, one fork per bit) which causes it
to be a stack hog.