A hash will allow you to map one string to another straightforwardly enough. So, is the problem identifying the possible candidates ? If so, what is the nature of that problem ?
In reply to Re: Search and Replace with a Large Dictionary
by gone2015
in thread Search and Replace with a Large Dictionary
by THuG
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |