That said, I would think an escaped URI might be the best solution, though I haven't done extensive work with BerkeleyDB... (just a few small int=>data lookup tables)
-Blake
In reply to Re: Data indexing in BerkeleyDB hashes
by blakem
in thread Data indexing in BerkeleyDB hashes
by rob_au
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |