unix – grep如何运行这么快？

我真的很惊讶于GREP在shell中的功能，早期我曾经在java中使用substring方法，但现在我使用GREP为它，它执行在几秒钟，它的速度比我用来写的java代码快得多。 (根据我的经验，我可能是错了)

这是说我没有能够弄清楚它是怎么回事？网上也没有太多可用的。

谁能帮我这个？

假设你的问题具体关注GNU grep。这里是作者Mike Haertel的一个注释：

GNU grep is fast because it AVOIDS LOOKING AT EVERY INPUT BYTE.

GNU grep is fast because it EXECUTES VERY FEW INSTRUCTIONS FOR EACH
BYTE that it
does look at.

GNU grep uses the well-kNown Boyer-Moore algorithm,which looks first
for the final letter of the target string,and uses a lookup table to
tell it how far ahead it can skip in the input whenever it finds a
non-matching character.

GNU grep also unrolls the inner loop of Boyer-Moore,and sets up the
Boyer-Moore delta table entries in such a way that it doesn’t need to
do the loop exit test at every unrolled step. The result of this is
that,in the limit,GNU grep averages fewer than 3 x86 instructions
executed for each input byte it actually looks at (and it skips many
bytes entirely).

GNU grep uses raw Unix input system calls and avoids copying data
after reading it. Moreover,GNU grep AVOIDS BREAKING THE INPUT INTO
LInes. Looking for newlines would slow grep down by a factor of
several times,because to find the newlines it would have to look at
every byte!

So instead of using line-oriented input,GNU grep reads raw data into
a large buffer,searches the buffer using Boyer-Moore,and only when
it finds a match does it go and look for the bounding newlines
(Certain command line options like
-n disable this optimization.)

这个答案是取自here的信息的子集。