Algorithms.DFA.KMP

Documentation

newtype DFA a

a specialized DFA with distinguish between Left and Right jumps. Nothing signals a final state

Constructors

DFA (a -> Maybe (Either (DFA a) (DFA a)))

step

Arguments

:: Eq a

=> (Int -> DFA a)

index to state solver

-> [(a, Int)]

Right argument to index list

-> Either Int Int

fallback index

-> [a]

final state arguments

-> a

the selector

-> Maybe (Either (DFA a) (DFA a))

create a DFA step

run :: DFA a -> [a] -> Maybe (DFA a)

run the automata against an input Nothing signal success

mkDFA :: Eq a => [(a, Int)] -> DFA a

build a DFA from a pattern zipeed with the prefix

prefix :: Eq a => [a] -> [Int]

A list of prefixes to serve mkDFA

match :: Eq a => [a] -> [a] -> Bool

test a match exists