Quicksilver wants to do it for every word in the file, which means that using a regex to search for it will scale like O(nē) (n being the length of the input file) in time, while the traversal of the files is possible in O(n).
In reply to Re^2: Finding word either side of a word match
by moritz
in thread Finding word either side of a word match
by Quicksilver
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |