| 22 |
</P> |
</P> |
| 23 |
<LI><A NAME="SEC2" HREF="#TOC1">SYNOPSIS</A> |
<LI><A NAME="SEC2" HREF="#TOC1">SYNOPSIS</A> |
| 24 |
<P> |
<P> |
| 25 |
<B>pcregrep [-Vchilnsvx] pattern [file] ...</B> |
<B>pcregrep [-Vcfhilnrsvx] pattern [file] ...</B> |
| 26 |
</P> |
</P> |
| 27 |
<LI><A NAME="SEC3" HREF="#TOC1">DESCRIPTION</A> |
<LI><A NAME="SEC3" HREF="#TOC1">DESCRIPTION</A> |
| 28 |
<P> |
<P> |
| 55 |
count is printed for each of them. |
count is printed for each of them. |
| 56 |
</P> |
</P> |
| 57 |
<P> |
<P> |
| 58 |
|
\fB-f<I>filename</I> |
| 59 |
|
Read patterns from the file, one per line, and match all patterns against each |
| 60 |
|
line. There is a maximum of 100 patterns. Trailing white space is removed, and |
| 61 |
|
blank lines are ignored. An empty file contains no patterns and therefore |
| 62 |
|
matches nothing. |
| 63 |
|
</P> |
| 64 |
|
<P> |
| 65 |
<B>-h</B> |
<B>-h</B> |
| 66 |
Suppress printing of filenames when searching multiple files. |
Suppress printing of filenames when searching multiple files. |
| 67 |
</P> |
</P> |
| 80 |
Precede each line by its line number in the file. |
Precede each line by its line number in the file. |
| 81 |
</P> |
</P> |
| 82 |
<P> |
<P> |
| 83 |
|
<B>-r</B> |
| 84 |
|
If any file is a directory, recursively scan the files it contains. Without |
| 85 |
|
<B>-r</B> a directory is scanned as a normal file. |
| 86 |
|
</P> |
| 87 |
|
<P> |
| 88 |
<B>-s</B> |
<B>-s</B> |
| 89 |
Work silently, that is, display nothing except error messages. |
Work silently, that is, display nothing except error messages. |
| 90 |
The exit status indicates whether any matches were found. |
The exit status indicates whether any matches were found. |
| 113 |
<LI><A NAME="SEC7" HREF="#TOC1">AUTHOR</A> |
<LI><A NAME="SEC7" HREF="#TOC1">AUTHOR</A> |
| 114 |
<P> |
<P> |
| 115 |
Philip Hazel <ph10@cam.ac.uk> |
Philip Hazel <ph10@cam.ac.uk> |
| 116 |
|
</P> |
| 117 |
|
<P> |
| 118 |
|
Last updated: 15 August 2001 |
| 119 |
<BR> |
<BR> |
| 120 |
Copyright (c) 1997-2000 University of Cambridge. |
Copyright (c) 1997-2001 University of Cambridge. |