On Tue, 8 Nov 2005, Jason Meers wrote:
>
> I am concerned about how expensive all of these lookups will get, and will
> eventually convert them to cdb files once they become more stable, but this
> still seems a very messy way to do things.
It looks fairly straightforward to me, which is probably what you want in
this situation - after all, there's not much point in optimising a
temporary lash-up. If the lsearch files aren't too big the efficiency will
not be a problem.
Tony.
--
<fanf@???> <dot@???>
http://dotat.at/ ${sg{\N${sg{\
N\}{([^N]*)(.)(.)(.*)}{\$1\$3\$2\$1\$3\n\$2\$3\$4\$3\n\$3\$2\$4}}\
\N}{([^N]*)(.)(.)(.*)}{\$1\$3\$2\$1\$3\n\$2\$3\$4\$3\n\$3\$2\$4}}
