Data.ByteString.Search.KnuthMorrisPratt

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

Copyright | Justin Bailey Chris Kuklewicz Daniel Fischer
License | BSD3
Maintainer | Daniel Fischer <daniel.is.fischer@googlemail.com>
Stability | Provisional
Portability | non-portable (BangPatterns)
Safe Haskell | None
Language | Haskell98

Data.ByteString.Search.KnuthMorrisPratt

Contents

- Overview
  - Changes
  - Deprecation
  - Parameter and return types
  - Lazy ByteStrings
- Partial application
- Complexity and Performance
- Functions

Description

Deprecated: Use the new interface instead

Fast non-overlapping Knuth-Morris-Pratt search of both strict and lazy `ByteString` values.

A description of the algorithm can be found at http://en.wikipedia.org/wiki/Knuth-Morris-Pratt_algorithm.

Original authors: Justin Bailey (jgbailey at gmail.com) and Chris Kuklewicz (haskell at list.mightyreason.com).

Synopsis

- matchLL :: ByteString -> ByteString -> [Int64]
- matchLS :: ByteString -> ByteString -> [Int]
- matchSS :: ByteString -> ByteString -> [Int]
- matchSL :: ByteString -> ByteString -> [Int64]

# Overview

This module exists only for backwards compatibility. Nevertheless there have been small changes in the behaviour of the functions. The module exports four search functions: `matchLL`, `matchLS`, `matchSL`, and `matchSS`. All of them return the list of all starting positions of non-overlapping occurrences of a pattern in a string.

## Changes

Formerly, all four functions returned an empty list when passed an empty pattern. Now, in accordance with the functions from the other modules, `matchXY "" target = [0 .. `length` target]`.

Further, the return type of `matchLS` and `matchSS` has changed to `[`Int`]`, since strict `ByteString`s are `Int`-indexed.

## Deprecation

This module is deprecated. You should use the new interface provided in Data.ByteString.Search.KMP and Data.ByteString.Lazy.Search.KMP or the generally faster functions from Data.ByteString.Search and Data.ByteString.Search.DFA, respectively the lazy versions.

## Parameter and return types

The first parameter is always the pattern string. The second parameter is always the target string to be searched. The returned list contains the offsets of all non-overlapping patterns.

A returned `Int` or `Int64` is an index into the target string which is aligned to the head of the pattern string. Strict targets return `Int` indices and lazy targets return `Int64` indices. All returned lists are computed and returned in a lazy fashion.

## Lazy ByteStrings

`matchLL` and `matchLS` take lazy bytestrings as patterns. For performance, if the pattern is not a single strict chunk then all the the pattern chunks will copied into a concatenated strict bytestring. This limits the patterns to a length of (maxBound :: Int).

`matchLL` and `matchSL` take lazy bytestrings as targets. These are written so that while they work they will not retain a reference to all the earlier parts of the the lazy bytestring. This means the garbage collector would be able to keep only a small amount of the target string and free the rest.

# Partial application

These functions can all be usefully partially applied. Given only a pattern, the auxiliary data will be computed only once, allowing for efficient re-use.

# Complexity and Performance

The preprocessing of the pattern is O(`patternLength`) in time and space. The time complexity of the searching phase is O(`targetLength`) for all functions.

In most cases, these functions are considerably slower than the Boyer-Moore variants, performance is close to that of those from Data.ByteString.Search.DFA resp. Data.ByteString.Lazy.Search.DFA.

# Functions

matchLL #

Arguments

:: ByteString | Lazy pattern
-> ByteString | Lazy target string
-> [Int64] | Offsets of matches

``matchLL`` finds the starting indices of all non-overlapping occurrences of the pattern in the target string. It is a simple wrapper around `nonOverlappingIndices` strictifying the pattern.

matchLS #

Arguments

:: ByteString | Lazy pattern
-> ByteString | Strict target string
-> [Int] | Offsets of matches

``matchLS`` finds the starting indices of all non-overlapping occurrences of the pattern in the target string. It is a simple wrapper around `nonOverlappingIndices` strictifying the pattern.

matchSS #

Arguments

:: ByteString | Strict pattern
-> ByteString | Strict target string
-> [Int] | Offsets of matches

``matchSS`` finds the starting indices of all non-overlapping occurrences of the pattern in the target string. It is an alias for `nonOverlappingIndices`.

matchSL #

Arguments

:: ByteString | Strict pattern
-> ByteString | Lazy target string
-> [Int64] | Offsets of matches

``matchSL`` finds the starting indices of all non-overlapping occurrences of the pattern in the target string. It is an alias for `nonOverlappingIndices`.