| iMatix home page | << | < | > | >> |
![]() Version 1.91 |
Filename: sflfind.h
Package: Standard Function Library (SFL)
Written: 1996/04/24 iMatix SFL project team sfl@imatix.com
Revised: 1998/04/15 iMatix SFL project team sfl@imatix.com
Copyright: Copyright (c) 1991-1998 iMatix
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 basic functions for searching blocks of memory with known sizes, plus envelopes that search null-delimited strings. Provides the option of repeatedly searching for the same pattern without re-parsing the pattern each time. 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. Use of strfind() and memfind() is discouraged (they are provided only for backwards compatibility).
sflfind.h defines these symbols, possibly conditionally:
Symbol: | Defined as: |
---|---|
_SFLFIND_INCLUDED | TRUE |
| << | < | > | >> |
![]() |