Safe Haskell	Safe-Inferred
Language	Haskell2010

Test.Util.Classify

Contents

Description

Classification of lists of symbols

Intended for qualified import.

import qualified Test.Util.Classify as C

Synopsis

data Predicate a b = Predicate {
- predApply ∷ a → Either b (Predicate a b)
- predFinish ∷ Maybe b
}
classify ∷ ∀ a b. [Predicate a b] → [a] → [b]
maximum ∷ ∀ a b. Ord b ⇒ (a → Maybe b) → Predicate a b
predicate ∷ (a → Either b (Predicate a b)) → Predicate a b
data Tag
example ∷ [Int] → [Tag]

Documentation

Predicate over a list of as, using classification b

Constructors

Predicate
Fields predApply ∷ a → Either b (Predicate a b) Given an `a`, either successfully classify as `b` or continue looking predFinish ∷ Maybe b End of the string The predicate is given a final chance to return a value.

Instances details

Functor (Predicate a) Source #
Instance details Defined in Test.Util.Classify Methods fmap ∷ (a0 → b) → Predicate a a0 → Predicate a b Source # (<$) ∷ a0 → Predicate a b → Predicate a a0 Source #

classify ∷ ∀ a b. [Predicate a b] → [a] → [b] Source #

Do a linear scan over the list, returning all successful classifications

maximum ∷ ∀ a b. Ord b ⇒ (a → Maybe b) → Predicate a b Source #

Maximum value found, if any

Construct simply predicate that returns Nothing on termination

Example

Instances details

Show Tag Source #
Instance details Defined in Test.Util.Classify Methods showsPrec ∷ Int → Tag → ShowS Source # show ∷ Tag → String Source # showList ∷ [Tag] → ShowS Source #