String searching facilities described in this very man page
provide a way to locate a specific sequence of bytes in a string.
Fixed pattern search engine's settings may be tuned up (for example
to perform case-insensitive search), see the
stri_opts_fixed function for more details.
The Knuth-Morris-Pratt search algorithm, with worst time complexity of
O(n+p) (n == length(str), p == length(pattern))
is utilized (with some tweaks for very short search patterns).
For natural language processing, however, this is not what
you probably want. It is because a bitwise match will
not give correct results in cases of:
accented letters;
conjoined letters;
ignorable punctuation;
ignorable case,
see also stringi-search-coll.
Note that the conversion of input data to Unicode is done as usual.
Other search_fixed: stri_opts_fixed,
stringi-search
Other stringi_general_topics: stringi-arguments,
stringi-encoding,
stringi-locale,
stringi-package,
stringi-search-boundaries,
stringi-search-charclass,
stringi-search-coll,
stringi-search-regex,
stringi-search