stringsearch

Fast searching, splitting and replacing of ByteStrings

Version0.3.6.6
CategoryText, Search
LicenceBSD-3-Clause
AuthorDaniel Fischer, Chris Kuklewicz, Justin Bailey
Maintainerdaniel.is.fischer@googlemail.com
Homepagebitbucket.org/dafis/stringsearch
Pinned byhackage stringsearch 0.3.6.6
Sourcehackage.haskell.org/package/stringsearch-0.3.6.6

Modules

11 modules

Data.ByteString.Lazy.Search10Fast overlapping Boyer-Moore search of lazy
Data.ByteString.Lazy.Search.DFA9Fast search of lazy ByteString values. Breaking,
Data.ByteString.Lazy.Search.KMP3Fast search of lazy ByteString values using the
Data.ByteString.Lazy.Search.KarpRabin1Simultaneous search for multiple patterns in a lazy ByteString
Data.ByteString.Search8Fast overlapping Boyer-Moore search of strict
Data.ByteString.Search.BoyerMoore4Fast overlapping Boyer-Moore search of both strict and lazy
Data.ByteString.Search.DFA8Fast search of strict ByteString values. Breaking, splitting and
Data.ByteString.Search.KMP2Fast search of strict ByteString values using the
Data.ByteString.Search.KarpRabin1Simultaneous search for multiple patterns in a strict ByteString
Data.ByteString.Search.KnuthMorrisPratt4Fast non-overlapping Knuth-Morris-Pratt search of both strict and
Data.ByteString.Search.Substitution1Class for values to be substituted into strict and lazy ByteStrings

Description

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.

Depends on

4 packages

Used by in this set · 1

pipes-bytestring-2.1.7