'binfind' searches files for a byte sequence. The pattern can be given on the command line in ASCII or hex, read from a file, or a combination of the above. It uses the Boyer-Moore algorithm and can search large files without using a lot of memory. For each occurrence of the pattern, 'binfind' prints a line containing the offset of the occurrence in the searched file. If the user specifies more than one file, binfind prints the filename and a colon before the offset.
DocumentationUser manpage available in HTML format from http://stud4.tuwien.ac.at/~e9825234/binfind/man.html
released on 16 September 2005
|License||Verified by||Verified on||Notes|
|GPLv2orlater||Janet Casey||8 March 2005|
Leaders and contributors
Resources and communication
This entry (in part or in whole) was last reviewed on 28 December 2016.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.