|
Data.Monoid.Lexical.Words | Portability | non-portable (MPTCs, OverloadedStrings) | Stability | experimental | Maintainer | ekmett@gmail.com |
|
|
|
|
|
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
|
|
|
|
|
|
Extract the matched words from the Words Monoid
|
|
|
|
|
|
Utility function to extract words using accumulator, inside-word, and until-next-word monoids
|
|
Lines
|
|
|
|
|
|
Extract the matched lines from the Lines Monoid
|
|
|
A CharReducer transformer that strips out newlines
| Instances | |
|
|
|
Utility function to extract lines using accumulator, inside-line, and until-next-line monoids
|
|
Produced by Haddock version 2.4.2 |