find substring faster

Diane4Luo has asked for the wisdom of the Perl Monks concerning the following question:

Replies are listed 'Best First'.
Re: find substring faster by roboticus (Chancellor) on May 29, 2011 at 16:07 UTC
Diane4Luo: Ermmm.... faster than what? ...roboticus When your only tool is a hammer, all problems look like your thumb.	[reply]
Re: find substring faster by planetscape (Chancellor) on May 29, 2011 at 17:40 UTC
Is your unstated (at least for us) problem similar to list of unique strings, also eliminating matching substrings? HTH, planetscape	[reply]
Re^2: find substring faster by Anonymous Monk on May 29, 2011 at 22:40 UTC
yes. We are working together on this project. Thanks!	[reply]
Re: find substring faster by salva (Canon) on May 29, 2011 at 15:43 UTC
See index.	[reply]
Re: find substring faster by thezip (Vicar) on May 29, 2011 at 15:01 UTC
Volo a infantia equus. What can be asserted without proof can be dismissed without proof. - Christopher Hitchens	[reply]
Re: find substring faster by anonymized user 468275 (Curate) on May 29, 2011 at 15:25 UTC
See perlre and perlretut. Hint - its exactly the same syntax as with sed in this case. But first disable carriage control for the filehandle using `local $/ = undef();` It's more efficient than using multiline substitution. One world, one people	[reply] [d/l]


Syntactic Confectionery Delight
	PerlMonks