Does anyone of you know any recipe or workaround to make it possible with tied hashes?
BerkeleyDB doesn't suffer the 2GB limitation, and its faster than the *dbm modules for lookups.
In reply to Re: Problems with SDBM
by BrowserUk
in thread Problems with SDBM
by Laurent_R
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |