stringsearch-0.3.6.6: Fast searching, splitting and replacing of ByteStrings

# stringsearch-0.3.6.6: Fast searching, splitting and replacing of ByteStrings

This package provides several functions to quickly search for substrings in strict or lazy ByteStrings. It also provides functions for breaking or splitting on substrings and replacing all occurrences of a substring (the first in case of overlaps) with another. GHC before 6.10 are no longer supported, other compilers only if they support BangPatterns. If you need it to work with other compilers, send a feature request.

Modules

stringsearch-0.3.6.6

- Data
  Submodules
  - ByteString
    Submodules
    - Lazy
      Submodules
      - Data.ByteString.Lazy.Search
        Submodules
        - Data.ByteString.Lazy.Search.DFA
        - Data.ByteString.Lazy.Search.KMP
        - Data.ByteString.Lazy.Search.KarpRabin
    - Data.ByteString.Search
      Submodules
      - Data.ByteString.Search.BoyerMoore
      - Data.ByteString.Search.DFA
      - Data.ByteString.Search.KMP
      - Data.ByteString.Search.KarpRabin
      - Data.ByteString.Search.KnuthMorrisPratt
      - Data.ByteString.Search.Substitution