|
About:
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. binfind uses the Boyer-Moore algorithm and
is able to 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 more than one
file was specified, binfind prints the filename
and a colon before the offset.
Author:
Edwin Steiner [contact developer]
Homepage:
http://www.lith.at/binfind/index.html
Tar/GZ:
http://www.lith.at/binfind/binfind-0.0.3.tar.gz
Trove categories:
[change]
Dependencies:
[change]
No dependencies filed
|
|
» Rating:
(not rated)
» Vitality: 0.00% (Rank 20236)
» Popularity: 0.17% (Rank 27123)

(click to enlarge graphs)
Record hits: 1,718
URL hits: 426
Subscribers: 4
|
|