kmp-dfa-0.1.0.1: KMP algorithm implementation, based on Deterministic Finite State Automata

Safe HaskellNone
LanguageHaskell2010

Algorithms.DFA.Test.KMP

Synopsis

Documentation

rif :: Eq a => [a] -> [a] -> Bool Source #

make the result as isPrefixOf application

data Rif a Source #

Correct results

Constructors

Rif [a] [a] Bool 

Instances

Show a => Show (Rif a) Source # 

Methods

showsPrec :: Int -> Rif a -> ShowS #

show :: Rif a -> String #

showList :: [Rif a] -> ShowS #

(Show a, Eq a, Arbitrary a) => Arbitrary (Rif a) Source # 

Methods

arbitrary :: Gen (Rif a) #

shrink :: Rif a -> [Rif a] #

test :: Rif Bool -> Bool Source #

use Bools for high repetition and matching results