monoids-0.1.32: Monoids, specialized containers and a general map/reduce framework Source code Contents Index

Data.Monoid.Lexical.Words Portability non-portable (MPTCs, OverloadedStrings) Stability experimental Maintainer ekmett@gmail.com

Contents Words Lines

Description

A simple demonstration of tokenizing a Generator into distinct words and/or lines using a word-parsing Monoid that accumulates partial information about words and then builds up a token stream.

Synopsis

module Data.Monoid.Reducer.Char data Words m runWords :: Words m -> [m] data Unspaced m wordsFrom :: (Generator c, Elem c ~ Char, Reducer Char m, Reducer Char n, Reducer Char o) => m -> c -> [(m, n, o)] data Lines m runLines :: Lines m -> [m] data Unlined m linesFrom :: (Generator c, Elem c ~ Char, Reducer Char m, Reducer Char n, Reducer Char o) => m -> c -> [(m, n, o)]

Documentation

module Data.Monoid.Reducer.Char

Words

data Words m Source

A CharReducer transformer that breaks a Char Generator into distinct words, feeding a Char Reducer each line in turn Instances Functor Words Reducer Char m => Reducer Char (Words m) Read m => Read (Words m) Show m => Show (Words m) Reducer Char m => IsString (Words m) Monoid m => Monoid (Words m) CharReducer m => CharReducer (Words m)

runWords :: Words m -> [m] Source

Extract the matched words from the Words Monoid

data Unspaced m Source

A CharReducer transformer that strips out any character matched by isSpace Instances Functor Unspaced Pointed Unspaced Copointed Unspaced Reducer Char m => Reducer Char (Unspaced m) Eq m => Eq (Unspaced m) Ord m => Ord (Unspaced m) Read m => Read (Unspaced m) Show m => Show (Unspaced m) Reducer Char m => IsString (Unspaced m) Monoid m => Monoid (Unspaced m) CharReducer m => CharReducer (Unspaced m)

wordsFrom :: (Generator c, Elem c ~ Char, Reducer Char m, Reducer Char n, Reducer Char o) => m -> c -> [(m, n, o)] Source

Utility function to extract words using accumulator, inside-word, and until-next-word monoids

Lines

data Lines m Source

A CharReducer transformer that breaks a Char Generator into distinct lines, feeding a Char Reducer each line in turn. Instances Functor Lines Reducer Char m => Reducer Char (Lines m) Read m => Read (Lines m) Show m => Show (Lines m) Reducer Char m => IsString (Lines m) Monoid m => Monoid (Lines m) CharReducer m => CharReducer (Lines m)

runLines :: Lines m -> [m] Source

Extract the matched lines from the Lines Monoid

data Unlined m Source

A CharReducer transformer that strips out newlines Instances Functor Unlined Pointed Unlined Copointed Unlined Reducer Char m => Reducer Char (Unlined m) Eq m => Eq (Unlined m) Ord m => Ord (Unlined m) Read m => Read (Unlined m) Show m => Show (Unlined m) Reducer Char m => IsString (Unlined m) Monoid m => Monoid (Unlined m) CharReducer m => CharReducer (Unlined m)

linesFrom :: (Generator c, Elem c ~ Char, Reducer Char m, Reducer Char n, Reducer Char o) => m -> c -> [(m, n, o)] Source

Utility function to extract lines using accumulator, inside-line, and until-next-line monoids

Produced by Haddock version 2.4.2