stringsearch

Fast searching, splitting and replacing of ByteStrings

https://bitbucket.org/dafis/stringsearch

Version on this page:	0.3.6.5@rev:1
LTS Haskell 22.36:	0.3.6.6@rev:2
Stackage Nightly 2024-10-03:	0.3.6.6@rev:2
Latest on Hackage:	0.3.6.6@rev:2

See all snapshots stringsearch appears in

BSD-3-Clause licensed by Daniel Fischer, Chris Kuklewicz, Justin Bailey

Maintained by [email protected]

This version can be pinned in stack with:stringsearch-0.3.6.5@sha256:7a10da5ee4d6b4fbed31b2ac007e7cba3d9fe446736be03d49f62584641ef4c5,4253

Module documentation for 0.3.6.5

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

Depends on 4 packages(full list with versions):

array, base, bytestring, containers

Used by 1 package in lts-0.7(full list with versions):

wai-extra

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.