Hello,
I have to do something like this
string = " 10. this is a good example to show"
search = array {this,good,show,^\s*[0-9]+\.}
find and replace them with a token like
string = " {?} {1} is a {2} example to {3}" (order is intact)
the string will undergo some processing and then
string = "{?} {1} is a {2} numbers to {3}" (order is intact)
tokens are again replaced back to the string so that the string becomes
string = " 10. this is a good example to show"
how to make sure that the pattern is matched and the same tokens are replaced
for example /[gG]ood/ is a pattern to search and replaced later with appropriate "case".Or in other words if ^\s*[0-9]+. is the pattern the matched string needs to be stored and replace to form the original text as it was
How should it be implemented so that the process is done at high performance ?
Thanks in advance.
