Would it be possible to reduce address book searches down to logarithmic algorithm range? I know that exact match can be done with hash and right-hand extension can be done with binary search, but is it possible to do fast substring search with little memory overhead?
------------------------------------------------------- This sf.net email is sponsored by:ThinkGeek Welcome to geek heaven. http://thinkgeek.com/sf _______________________________________________ Mahogany-Developers mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/mahogany-developers
