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

Data.ByteString.Lazy.SearchFast overlapping Boyer-Moore search of lazy
Data.ByteString.Lazy.Search.DFAFast search of lazy ByteString values. Breaking,
Data.ByteString.Lazy.Search.KMPFast search of lazy ByteString values using the
Data.ByteString.Lazy.Search.KarpRabinSimultaneous search for multiple patterns in a lazy ByteString
Data.ByteString.SearchFast overlapping Boyer-Moore search of strict
Data.ByteString.Search.BoyerMooreFast overlapping Boyer-Moore search of both strict and lazy
Data.ByteString.Search.DFAFast search of strict ByteString values. Breaking, splitting and
Data.ByteString.Search.KMPFast search of strict ByteString values using the
Data.ByteString.Search.KarpRabinSimultaneous search for multiple patterns in a strict ByteString
Data.ByteString.Search.KnuthMorrisPrattFast non-overlapping Knuth-Morris-Pratt search of both strict and
Data.ByteString.Search.SubstitutionClass 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