| iMatix home page|
| << | < | > | >>
Package: Standard Function Library (SFL)
Written: 1996/04/24 iMatix SFL project team email@example.com
Copyright: Copyright (c) 1996-2000 iMatix Corporation
Searches for a pattern within a string or block of memory using a variant of the Boyer-Moore algorithm (improved by Horspool and Sunday). As fast or faster than the normal Boyer-Moore algorithm for most search strings, and much simpler. Includes a basic function for searching blocks of memory with known sizes, plus an envelope that searches null-delimited strings. Provides the option of repeatedly searching for the same pattern without re-parsing the pattern each time. Original algorithm published by BOYER, R., and S. MOORE 1977, "A Fast String Searching Algorithm." CACM, 20, 762-72. Simplifications by HORSPOOL, R. N. 1980, "Practical Fast Searching in Strings." Software - Practice and Experience, 10, 501-06. More improvements by HUME, A., and D. M. SUNDAY 1991, "Fast String Searching." AT&T Bell Labs Computing Science Technical Report No. 156. Implemented in C by P. Hintjens. strfind r() and memfind r(), are reentrant versions of strfind() and memfind() for single searches, and strfind rb() and memfind rb() are reentrant versions of strfind() and memfind() supporting repeat searches against the same pattern.
sflfind.h defines these symbols, possibly conditionally:
|| << | < | > | >>||Copyright © 1996-2000 iMatix Corporation|