stringi-search-fixed

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
<code><a href="/link/stri_opts_fixed?package=stringi&version=1.0-1" rd-options="" data-mini-rdoc="stringi::stri_opts_fixed">stri_opts_fixed</a></code> function for more details.

Allows for fast, correct, consistent, portable,
    as well as convenient character string/text processing in every locale
    and any native encoding. Owing to the use of the ICU library,
    the package provides R users with platform-independent functions
    known to Java, Perl, Python, PHP, and Ruby programmers. Among available
    features there are: pattern searching (e.g., with ICU Java-like regular
    expressions or the Unicode Collation Algorithm), random string generation,
    case mapping, string transliteration, concatenation,
    Unicode normalization, date-time formatting and parsing, etc.

Marek Gagolewski

stringi

Character String Processing Facilities

stringi-search-fixed function

The Knuth-Morris-Pratt search algorithm, with worst time complexity of
O(n+p) (<code>n == length(str)</code>, <code>p == length(pattern)</code>)
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:
<ol><li>accented letters;</li><li>conjoined letters;</li><li>ignorable punctuation;</li><li>ignorable case,</li></ol>
see also <a href="/link/stringi-search-coll?package=stringi&version=1.0-1" rd-options="" data-mini-rdoc="stringi::stringi-search-coll">stringi-search-coll</a>.<p></p><p>Note that the conversion of input data
to Unicode is done as usual.</p>

stringi-search-fixed: Locale-Insensitive Fixed Pattern Matching in stringi

Description

Arguments

Byte Compare

See Also