| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Parser.Json
Contents
Description
This module contains the Json Parser.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Parser.Json
Contents
Description
This module contains the Json Parser.
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Parser.Json
Contents
Description
This module contains the Json Parser.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Parser.Parser
Description
This module describes the abstract tree that can be validated by Relapse.
The JSON and XML parsers both are both versions of this type class.
Tree is the type class that should be implemented by a katydid parser. +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Parser.Parser
Description
This module describes the abstract tree that can be validated by Relapse.
The JSON and XML parsers both are both versions of this type class.
Tree is the type class that should be implemented by a katydid parser. This is implemented by the Json and XML parser.
Minimal complete definition
Label is a tagged union of all possible value types that can returned by a katydid parser: - String, Int, Uint, Double, Bool and Bytes.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Parser.Xml
Contents
Description
This module contains the XML Parser.
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Parser.Xml
Contents
Description
This module contains the XML Parser.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Ast
Description
This module describes the Relapse's abstract syntax tree.
It also contains some simple functions for the map of references that a Relapse grammar consists of.
Finally it also contains some very simple pattern functions.
Pattern recursively describes a Relapse Pattern.
Constructors
Refs is a map from reference name to pattern and describes a relapse grammar.
newRef :: String -> Pattern -> Grammar Source #
newRef returns a new reference map given a single pattern and its reference name.
reverseLookupRef :: Pattern -> Grammar -> Maybe String Source #
reverseLookupRef returns the reference name for a given pattern.
lookupRef :: Grammar -> String -> Either String Pattern Source #
lookupRef looks up a pattern in the reference map, given a reference name.
hasRecursion :: Grammar -> Either String Bool Source #
hasRecursion returns whether an relapse grammar has any recursion, starting from the "main" reference.
nullable :: Grammar -> Pattern -> Either String Bool Source #
The nullable function returns whether a pattern is nullable. +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Ast
Description
This module describes the Relapse's abstract syntax tree.
It also contains some simple functions for the map of references that a Relapse grammar consists of.
Finally it also contains some very simple pattern functions.
Pattern recursively describes a Relapse Pattern.
Constructors
Refs is a map from reference name to pattern and describes a relapse grammar.
newRef :: String -> Pattern -> Grammar Source #
newRef returns a new reference map given a single pattern and its reference name.
reverseLookupRef :: Pattern -> Grammar -> Maybe String Source #
reverseLookupRef returns the reference name for a given pattern.
lookupRef :: Grammar -> String -> Either String Pattern Source #
lookupRef looks up a pattern in the reference map, given a reference name.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Derive
Contents
Description
This module is a simple implementation of the internal derivative algorithm.
It is intended to be used for explanation purposes.
This means that it gives up speed for readability.
Thus it has no type of memoization.
derive :: Tree t => Grammar -> [t] -> Either String Pattern Source #
derive is the classic derivative implementation for trees.
calls :: Grammar -> [Pattern] -> IfExprs Source #
calls returns a compiled if expression tree. +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Derive
Contents
Description
This module is a simple implementation of the internal derivative algorithm.
It is intended to be used for explanation purposes.
This means that it gives up speed for readability.
Thus it has no type of memoization.
derive :: Tree t => Grammar -> [t] -> Either String Pattern Source #
derive is the classic derivative implementation for trees.
calls :: Grammar -> [Pattern] -> IfExprs Source #
calls returns a compiled if expression tree. Each if expression returns a child pattern, given the input value. In other words calls signature is actually:
Refs -> [Pattern] -> Value -> [Pattern]
, where the resulting list of patterns are the child patterns, diff --git a/docs/Data-Katydid-Relapse-Expr.html b/docs/Data-Katydid-Relapse-Expr.html index a117871..37ca41a 100644 --- a/docs/Data-Katydid-Relapse-Expr.html +++ b/docs/Data-Katydid-Relapse-Expr.html @@ -1,4 +1,4 @@ -
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Expr
Description
This module contains all the functions you need to implement a Relapse expression.
Desc is the description of a function, +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Expr
Description
This module contains all the functions you need to implement a Relapse expression.
Desc is the description of a function, especially built to make comparisons of user defined expressions possible.
Constructors
| Desc | |
mkDesc :: String -> [Desc] -> Desc Source #
mkDesc makes a description from a function name and a list of the argument's descriptions.
AnyExpr is used by the Relapse parser to represent an Expression that can return any type of value, where any is a predefined list of possible types represented by AnyFunc.
AnyFunc is used by the Relapse parser and represents the list all supported types of functions.
Constructors
| BoolFunc (Func Bool) | |
| IntFunc (Func Int) | |
| StringFunc (Func Text) | |
| DoubleFunc (Func Double) | |
| UintFunc (Func Word) | |
| BytesFunc (Func ByteString) | |
| BoolsFunc (Func [Bool]) | |
| IntsFunc (Func [Int]) | |
| StringsFunc (Func [Text]) | |
| DoublesFunc (Func [Double]) | |
| UintsFunc (Func [Word]) | |
| ListOfBytesFunc (Func [ByteString]) |
Expr represents a user defined expression, which consists of a description for comparisons and an evaluation function.
type Func a = Label -> Either String a Source #
Func represents the evaluation function part of a user defined expression. diff --git a/docs/Data-Katydid-Relapse-Exprs-Compare.html b/docs/Data-Katydid-Relapse-Exprs-Compare.html index 3166804..e729d07 100644 --- a/docs/Data-Katydid-Relapse-Exprs-Compare.html +++ b/docs/Data-Katydid-Relapse-Exprs-Compare.html @@ -1,4 +1,4 @@ -
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Compare
Description
This module contains the Relapse compare expressions: +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Compare
Description
This module contains the Relapse compare expressions: equal, not equal, greater than, greater than or equal, less than and less than or equal.
mkEqExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkEqExpr dynamically creates an eq (equal) expression, if the two input types are the same.
eqExpr :: Eq a => Expr a -> Expr a -> Expr Bool Source #
eqExpr creates an eq (equal) expression that returns true if the two evaluated input expressions are equal and both don't evaluate to an error.
mkNeExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkNeExpr dynamically creates a ne (not equal) expression, if the two input types are the same.
neExpr :: Eq a => Expr a -> Expr a -> Expr Bool Source #
neExpr creates a ne (not equal) expression that returns true if the two evaluated input expressions are not equal and both don't evaluate to an error.
mkGeExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkGeExpr dynamically creates a ge (greater than or equal) expression, if the two input types are the same.
geExpr :: Ord a => Expr a -> Expr a -> Expr Bool Source #
geExpr creates a ge (greater than or equal) expression that returns true if the first evaluated expression is greater than or equal to the second diff --git a/docs/Data-Katydid-Relapse-Exprs-Contains.html b/docs/Data-Katydid-Relapse-Exprs-Contains.html index 8fd089c..2fcc7bb 100644 --- a/docs/Data-Katydid-Relapse-Exprs-Contains.html +++ b/docs/Data-Katydid-Relapse-Exprs-Contains.html @@ -1 +1 @@ -
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Contains
Description
This module contains the Relapse contains expressions.
mkContainsExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkContainsExpr dynamically creates a contains expression, if the two input types are:
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Contains
Description
This module contains the Relapse contains expressions.
mkContainsExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkContainsExpr dynamically creates a contains expression, if the two input types are:
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Elem
Description
This module contains the Relapse elem expression.
mkElemExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkElemExpr dynamically creates an elem expression, if the first argument is a list and the second an int index.
elemExpr :: Expr [a] -> Expr Int -> Expr a Source #
elemExpr creates an expression that returns an element from the list at the specified index. +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Elem
Description
This module contains the Relapse elem expression.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Length
Description
This module contains the Relapse length expressions.
mkLengthExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkLengthExpr dynamically creates a length expression, if the single argument is a list, string or bytes.
lengthListExpr :: Expr [a] -> Expr Int Source #
lengthListExpr creates a length expression, that returns the length of a list.
lengthStringExpr :: Expr Text -> Expr Int Source #
lengthStringExpr creates a length expression, that returns the length of a string.
lengthBytesExpr :: Expr ByteString -> Expr Int Source #
lengthBytesExpr creates a length expression, that returns the length of bytes.
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Length
Description
This module contains the Relapse length expressions.
mkLengthExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkLengthExpr dynamically creates a length expression, if the single argument is a list, string or bytes.
lengthListExpr :: Expr [a] -> Expr Int Source #
lengthListExpr creates a length expression, that returns the length of a list.
lengthStringExpr :: Expr Text -> Expr Int Source #
lengthStringExpr creates a length expression, that returns the length of a string.
lengthBytesExpr :: Expr ByteString -> Expr Int Source #
lengthBytesExpr creates a length expression, that returns the length of bytes.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Logic
Description
This module contains the Relapse logic expressions: not, and, or.
mkNotExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkNotExpr dynamically creates a not expression, if the single argument is a bool expression.
notExpr :: Expr Bool -> Expr Bool Source #
notExpr creates a not expression, that returns true is the argument expression returns an error or false.
mkAndExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkAndExpr dynamically creates an and expression, if the two arguments are both bool expressions.
andExpr :: Expr Bool -> Expr Bool -> Expr Bool Source #
andExpr creates an and expression that returns true if both arguments are true.
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Logic
Description
This module contains the Relapse logic expressions: not, and, or.
mkNotExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkNotExpr dynamically creates a not expression, if the single argument is a bool expression.
notExpr :: Expr Bool -> Expr Bool Source #
notExpr creates a not expression, that returns true is the argument expression returns an error or false.
mkAndExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkAndExpr dynamically creates an and expression, if the two arguments are both bool expressions.
andExpr :: Expr Bool -> Expr Bool -> Expr Bool Source #
andExpr creates an and expression that returns true if both arguments are true.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Strings
Description
This module contains the Relapse string expressions.
mkHasPrefixExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkHasPrefixExpr dynamically creates a hasPrefix expression.
hasPrefixExpr :: Expr Text -> Expr Text -> Expr Bool Source #
hasPrefixExpr creates a hasPrefix expression that returns true if the second is a prefix of the first.
mkHasSuffixExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkHasSuffixExpr dynamically creates a hasSuffix expression.
hasSuffixExpr :: Expr Text -> Expr Text -> Expr Bool Source #
hasSuffixExpr creates a hasSuffix expression that returns true if the second is a suffix of the first.
mkRegexExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkRegexExpr dynamically creates a regex expression.
regexExpr :: Expr Text -> Expr Text -> Expr Bool Source #
regexExpr creates a regex expression that returns true if the first expression matches the second string.
mkToLowerExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkToLowerExpr dynamically creates a toLower expression.
toLowerExpr :: Expr Text -> Expr Text Source #
toLowerExpr creates a toLower expression that converts the input string to a lowercase string.
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Strings
Description
This module contains the Relapse string expressions.
mkHasPrefixExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkHasPrefixExpr dynamically creates a hasPrefix expression.
hasPrefixExpr :: Expr Text -> Expr Text -> Expr Bool Source #
hasPrefixExpr creates a hasPrefix expression that returns true if the second is a prefix of the first.
mkHasSuffixExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkHasSuffixExpr dynamically creates a hasSuffix expression.
hasSuffixExpr :: Expr Text -> Expr Text -> Expr Bool Source #
hasSuffixExpr creates a hasSuffix expression that returns true if the second is a suffix of the first.
mkRegexExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkRegexExpr dynamically creates a regex expression.
regexExpr :: Expr Text -> Expr Text -> Expr Bool Source #
regexExpr creates a regex expression that returns true if the first expression matches the second string.
mkToLowerExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkToLowerExpr dynamically creates a toLower expression.
toLowerExpr :: Expr Text -> Expr Text Source #
toLowerExpr creates a toLower expression that converts the input string to a lowercase string.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Type
Description
This module contains the Relapse type expression.
mkTypeExpr :: [AnyExpr] -> Either String AnyExpr Source #
mkTypeExpr is used by the parser to create a type expression for the specific input type.
typeExpr :: Expr a -> Expr Bool Source #
typeExpr creates an expression that returns true if the containing expression does not return an error. +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Type
Description
This module contains the Relapse type expression.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Var
Description
This module contains all expressions for Relapse variables.
varBoolExpr :: Expr Bool Source #
varBoolExpr creates a bool variable expression.
varIntExpr :: Expr Int Source #
varIntExpr creates an int variable expression.
varUintExpr :: Expr Word Source #
varUintExpr creates a uint variable expression.
varDoubleExpr :: Expr Double Source #
varDoubleExpr creates a double variable expression.
varStringExpr :: Expr Text Source #
varStringExpr creates a string variable expression.
varBytesExpr :: Expr ByteString Source #
varBytesExpr creates a bytes variable expression.
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs.Var
Description
This module contains all expressions for Relapse variables.
varBoolExpr :: Expr Bool Source #
varBoolExpr creates a bool variable expression.
varIntExpr :: Expr Int Source #
varIntExpr creates an int variable expression.
varUintExpr :: Expr Word Source #
varUintExpr creates a uint variable expression.
varDoubleExpr :: Expr Double Source #
varDoubleExpr creates a double variable expression.
varStringExpr :: Expr Text Source #
varStringExpr creates a string variable expression.
varBytesExpr :: Expr ByteString Source #
varBytesExpr creates a bytes variable expression.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs
Description
This module contains the standard library of expressions, used by the Relapse parser.
mkBuiltIn :: String -> AnyExpr -> Either String AnyExpr Source #
mkBuiltIn parsers a builtin function to a relapse expression.
mkExpr :: String -> [AnyExpr] -> Either String AnyExpr Source #
mkExpr is a grouping of all the standard library functions as one MkFunc.
type MkFunc = String -> [AnyExpr] -> Either String AnyExpr Source #
MkFunc is used by the parser to create a function from a name and arguments.
stdOnly :: String -> [AnyExpr] -> Either String AnyExpr Source #
stdOnly contains no functions, which means that when it is combined +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Exprs
Description
This module contains the standard library of expressions, used by the Relapse parser.
mkBuiltIn :: String -> AnyExpr -> Either String AnyExpr Source #
mkBuiltIn parsers a builtin function to a relapse expression.
mkExpr :: String -> [AnyExpr] -> Either String AnyExpr Source #
mkExpr is a grouping of all the standard library functions as one MkFunc.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.IfExprs
Description
This is an internal relapse module.
It contains multiple implementations of if expressions.
IfExprs is a tree of if expressions, which contains a list of resulting patterns on each of its leaves.
evalIfExprs :: IfExprs -> Label -> Either String [Pattern] Source #
valIfExprs evaluates a tree of if expressions and returns the resulting patterns or an error.
compileIfExprs :: [IfExpr] -> IfExprs Source #
compileIfExprs compiles a list of if expressions in an IfExprs tree, for efficient evaluation.
data ZippedIfExprs Source #
ZippedIfExprs is a tree of if expressions, but with a zipped pattern list and a zipper on each of the leaves.
zipIfExprs :: IfExprs -> ZippedIfExprs Source #
zipIfExprs compresses an if expression tree's leaves.
evalZippedIfExprs :: ZippedIfExprs -> Label -> Either String ([Pattern], Zipper) Source #
evalZippedIfExprs evaulates a ZippedIfExprs tree and returns the zipped pattern list and zipper from the resulting leaf.
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.IfExprs
Description
This is an internal relapse module.
It contains multiple implementations of if expressions.
IfExprs is a tree of if expressions, which contains a list of resulting patterns on each of its leaves.
evalIfExprs :: IfExprs -> Label -> Either String [Pattern] Source #
valIfExprs evaluates a tree of if expressions and returns the resulting patterns or an error.
compileIfExprs :: [IfExpr] -> IfExprs Source #
compileIfExprs compiles a list of if expressions in an IfExprs tree, for efficient evaluation.
data ZippedIfExprs Source #
ZippedIfExprs is a tree of if expressions, but with a zipped pattern list and a zipper on each of the leaves.
zipIfExprs :: IfExprs -> ZippedIfExprs Source #
zipIfExprs compresses an if expression tree's leaves.
evalZippedIfExprs :: ZippedIfExprs -> Label -> Either String ([Pattern], Zipper) Source #
evalZippedIfExprs evaulates a ZippedIfExprs tree and returns the zipped pattern list and zipper from the resulting leaf.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.MemDerive
Description
This module is an efficient implementation of the derivative algorithm for trees.
It is intended to be used for production purposes.
This means that it gives up some readability for speed.
This module provides memoization of the nullable, calls and returns functions.
derive :: Tree t => Grammar -> [t] -> Either String Pattern Source #
derive is the classic derivative implementation for trees.
Mem is the object used to store memoized results of the nullable, calls and returns functions.
newMem creates a object used for memoization by the validate function. +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.MemDerive
Description
This module is an efficient implementation of the derivative algorithm for trees.
It is intended to be used for production purposes.
This means that it gives up some readability for speed.
This module provides memoization of the nullable, calls and returns functions.
derive :: Tree t => Grammar -> [t] -> Either String Pattern Source #
derive is the classic derivative implementation for trees.
Mem is the object used to store memoized results of the nullable, calls and returns functions.
newMem creates a object used for memoization by the validate function. Each grammar should create its own memoize object.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Parser
Contents
Description
This module parses the Relapse Grammar using the Parsec Library.
parseGrammarWithUDFs :: MkFunc -> String -> Either String Grammar Source #
parseGrammarWithUDFs parses the Relapse Grammar with extra user defined functions.
These functions are exposed for testing purposes.
idLit :: CharParser () String Source #
For internal testing
bytesCastLit :: CharParser () ByteString Source #
For internal testing
stringLit :: CharParser () Text Source #
For internal testing
doubleCastLit :: CharParser () Double Source #
For internal testing
uintCastLit :: CharParser () Word Source #
For internal testing
intLit :: CharParser () Int Source #
For internal testing
ws :: CharParser () () Source #
For internal testing
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Parser
Contents
Description
This module parses the Relapse Grammar using the Parsec Library.
parseGrammarWithUDFs :: MkFunc -> String -> Either String Grammar Source #
parseGrammarWithUDFs parses the Relapse Grammar with extra user defined functions.
These functions are exposed for testing purposes.
idLit :: CharParser () String Source #
For internal testing
bytesCastLit :: CharParser () ByteString Source #
For internal testing
stringLit :: CharParser () Text Source #
For internal testing
doubleCastLit :: CharParser () Double Source #
For internal testing
uintCastLit :: CharParser () Word Source #
For internal testing
intLit :: CharParser () Int Source #
For internal testing
ws :: CharParser () () Source #
For internal testing
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Relapse
Description
This module provides an implementation of the relapse validation language.
Relapse is intended to be used for validation of trees or filtering of lists of trees.
Katydid currently provides two types of trees out of the box: Json and XML, +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Relapse
Description
This module provides an implementation of the relapse validation language.
Relapse is intended to be used for validation of trees or filtering of lists of trees.
Katydid currently provides two types of trees out of the box: Json and XML, but relapse supports any type of tree as long the type is of the Tree typeclass provided by the Parsers module.
The validate and filter functions expects a Tree to be a list of trees, since not all serialization formats have a single root. diff --git a/docs/Data-Katydid-Relapse-Simplify.html b/docs/Data-Katydid-Relapse-Simplify.html index 8018c6e..3ab15cb 100644 --- a/docs/Data-Katydid-Relapse-Simplify.html +++ b/docs/Data-Katydid-Relapse-Simplify.html @@ -1 +1 @@ -
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Simplify
Description
This module simplifies Relapse patterns.
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Simplify
Description
This module simplifies Relapse patterns.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Smart
Description
This module describes the smart constructors for Relapse patterns.
Pattern recursively describes a Relapse Pattern.
Grammar is a map from reference name to pattern and describes a relapse grammar.
lookupRef :: Grammar -> ValidRef -> Pattern Source #
lookupRef looks up a pattern in the reference map, given a reference name.
nodePat :: Expr Bool -> Pattern -> Pattern Source #
nodePat is the smart constructor for the node pattern.
andPat :: Pattern -> Pattern -> Pattern Source #
andPat is the smart constructor for the and pattern.
concatPat :: Pattern -> Pattern -> Pattern Source #
concatPat is the smart constructor for the concat pattern.
interleavePat :: Pattern -> Pattern -> Pattern Source #
interleavePat is the smart constructor for the interleave pattern.
zeroOrMorePat :: Pattern -> Pattern Source #
zeroOrMorePat is the smart constructor for the zeroOrMore pattern.
optionalPat :: Pattern -> Pattern Source #
optionalPat is the smart constructor for the optional pattern.
containsPat :: Pattern -> Pattern Source #
containsPat is the smart constructor for the contains pattern.
refPat :: Map String Bool -> String -> Either String Pattern Source #
refPat is the smart constructor for the reference pattern.
unescapable :: Pattern -> Bool Source #
unescapable is used for short circuiting. +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Smart
Description
This module describes the smart constructors for Relapse patterns.
Pattern recursively describes a Relapse Pattern.
Grammar is a map from reference name to pattern and describes a relapse grammar.
lookupRef :: Grammar -> ValidRef -> Pattern Source #
lookupRef looks up a pattern in the reference map, given a reference name.
nodePat :: Expr Bool -> Pattern -> Pattern Source #
nodePat is the smart constructor for the node pattern.
andPat :: Pattern -> Pattern -> Pattern Source #
andPat is the smart constructor for the and pattern.
concatPat :: Pattern -> Pattern -> Pattern Source #
concatPat is the smart constructor for the concat pattern.
interleavePat :: Pattern -> Pattern -> Pattern Source #
interleavePat is the smart constructor for the interleave pattern.
zeroOrMorePat :: Pattern -> Pattern Source #
zeroOrMorePat is the smart constructor for the zeroOrMore pattern.
optionalPat :: Pattern -> Pattern Source #
optionalPat is the smart constructor for the optional pattern.
containsPat :: Pattern -> Pattern Source #
containsPat is the smart constructor for the contains pattern.
refPat :: Map String Bool -> String -> Either String Pattern Source #
refPat is the smart constructor for the reference pattern.
unescapable :: Pattern -> Bool Source #
unescapable is used for short circuiting. A part of the tree can be skipped if all patterns are unescapable.
lookupMain :: Grammar -> Pattern Source #
lookupMain retrieves the main pattern from the grammar.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.VpaDerive
Description
This module contains a VPA (Visibly Pushdown Automaton) implementation of the internal derivative algorithm.
It is intended to be used for explanation purposes.
It shows how our algorithm is effectively equivalent to a visibly pushdown automaton.
derive :: Tree t => Grammar -> [t] -> Either String Pattern Source #
derive is the derivative implementation for trees. +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.VpaDerive
Description
This module contains a VPA (Visibly Pushdown Automaton) implementation of the internal derivative algorithm.
It is intended to be used for explanation purposes.
It shows how our algorithm is effectively equivalent to a visibly pushdown automaton.
katydid-0.4.0.1: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Zip
Description
This is an internal relapse module.
It zips patterns to reduce the state space.
Zipper represents compressed indexes +
katydid-0.4.0.2: A haskell implementation of Katydid
| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Katydid.Relapse.Zip
Description
This is an internal relapse module.
It zips patterns to reduce the state space.
katydid-0.4.0.1: A haskell implementation of Katydid
Index - _
| _desc | Data.Katydid.Relapse.Expr |
| _eval | Data.Katydid.Relapse.Expr |
| _hash | |
| 1 (Function) | Data.Katydid.Relapse.Expr |
| 2 (Function) | Data.Katydid.Relapse.Smart |
| _hasVar | Data.Katydid.Relapse.Expr |
| _name | Data.Katydid.Relapse.Expr |
| _nullable | Data.Katydid.Relapse.Smart |
| _params | Data.Katydid.Relapse.Expr |
| _toStr | Data.Katydid.Relapse.Expr |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - _
| _desc | Data.Katydid.Relapse.Expr |
| _eval | Data.Katydid.Relapse.Expr |
| _hash | |
| 1 (Function) | Data.Katydid.Relapse.Expr |
| 2 (Function) | Data.Katydid.Relapse.Smart |
| _hasVar | Data.Katydid.Relapse.Expr |
| _name | Data.Katydid.Relapse.Expr |
| _nullable | Data.Katydid.Relapse.Smart |
| _params | Data.Katydid.Relapse.Expr |
| _toStr | Data.Katydid.Relapse.Expr |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - A
| And | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| andExpr | Data.Katydid.Relapse.Exprs.Logic |
| andPat | Data.Katydid.Relapse.Smart |
| AnyExpr | |
| 1 (Type/Class) | Data.Katydid.Relapse.Expr |
| 2 (Data Constructor) | Data.Katydid.Relapse.Expr |
| AnyFunc | Data.Katydid.Relapse.Expr |
| assertArgs1 | Data.Katydid.Relapse.Expr |
| assertArgs2 | Data.Katydid.Relapse.Expr |
| assertBool | Data.Katydid.Relapse.Expr |
| assertBools | Data.Katydid.Relapse.Expr |
| assertBytes | Data.Katydid.Relapse.Expr |
| assertDouble | Data.Katydid.Relapse.Expr |
| assertDoubles | Data.Katydid.Relapse.Expr |
| assertInt | Data.Katydid.Relapse.Expr |
| assertInts | Data.Katydid.Relapse.Expr |
| assertListOfBytes | Data.Katydid.Relapse.Expr |
| assertString | Data.Katydid.Relapse.Expr |
| assertStrings | Data.Katydid.Relapse.Expr |
| assertUint | Data.Katydid.Relapse.Expr |
| assertUints | Data.Katydid.Relapse.Expr |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - A
| And | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| andExpr | Data.Katydid.Relapse.Exprs.Logic |
| andPat | Data.Katydid.Relapse.Smart |
| AnyExpr | |
| 1 (Type/Class) | Data.Katydid.Relapse.Expr |
| 2 (Data Constructor) | Data.Katydid.Relapse.Expr |
| AnyFunc | Data.Katydid.Relapse.Expr |
| assertArgs1 | Data.Katydid.Relapse.Expr |
| assertArgs2 | Data.Katydid.Relapse.Expr |
| assertBool | Data.Katydid.Relapse.Expr |
| assertBools | Data.Katydid.Relapse.Expr |
| assertBytes | Data.Katydid.Relapse.Expr |
| assertDouble | Data.Katydid.Relapse.Expr |
| assertDoubles | Data.Katydid.Relapse.Expr |
| assertInt | Data.Katydid.Relapse.Expr |
| assertInts | Data.Katydid.Relapse.Expr |
| assertListOfBytes | Data.Katydid.Relapse.Expr |
| assertString | Data.Katydid.Relapse.Expr |
| assertStrings | Data.Katydid.Relapse.Expr |
| assertUint | Data.Katydid.Relapse.Expr |
| assertUints | Data.Katydid.Relapse.Expr |
katydid-0.4.0.1: A haskell implementation of Katydid
Index
katydid-0.4.0.2: A haskell implementation of Katydid
Index
katydid-0.4.0.1: A haskell implementation of Katydid
Index - B
| Bool | Data.Katydid.Parser.Parser |
| boolExpr | Data.Katydid.Relapse.Expr |
| BoolFunc | Data.Katydid.Relapse.Expr |
| boolsExpr | Data.Katydid.Relapse.Expr |
| BoolsFunc | Data.Katydid.Relapse.Expr |
| Bytes | Data.Katydid.Parser.Parser |
| bytesCastLit | Data.Katydid.Relapse.Parser |
| bytesExpr | Data.Katydid.Relapse.Expr |
| BytesFunc | Data.Katydid.Relapse.Expr |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - B
| Bool | Data.Katydid.Parser.Parser |
| boolExpr | Data.Katydid.Relapse.Expr |
| BoolFunc | Data.Katydid.Relapse.Expr |
| boolsExpr | Data.Katydid.Relapse.Expr |
| BoolsFunc | Data.Katydid.Relapse.Expr |
| Bytes | Data.Katydid.Parser.Parser |
| bytesCastLit | Data.Katydid.Relapse.Parser |
| bytesExpr | Data.Katydid.Relapse.Expr |
| BytesFunc | Data.Katydid.Relapse.Expr |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - C
| calls | Data.Katydid.Relapse.Derive |
| compile | Data.Katydid.Relapse.Smart |
| compileIfExprs | Data.Katydid.Relapse.IfExprs |
| Concat | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| concatPat | Data.Katydid.Relapse.Smart |
| Contains | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| containsExpr | Data.Katydid.Relapse.Exprs.Contains |
| containsPat | Data.Katydid.Relapse.Smart |
| containsStringExpr | Data.Katydid.Relapse.Exprs.Contains |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - C
| calls | Data.Katydid.Relapse.Derive |
| compile | Data.Katydid.Relapse.Smart |
| compileIfExprs | Data.Katydid.Relapse.IfExprs |
| Concat | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| concatPat | Data.Katydid.Relapse.Smart |
| Contains | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| containsExpr | Data.Katydid.Relapse.Exprs.Contains |
| containsPat | Data.Katydid.Relapse.Smart |
| containsStringExpr | Data.Katydid.Relapse.Exprs.Contains |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - D
| decodeJSON | Data.Katydid.Parser.Json |
| decodeXML | Data.Katydid.Parser.Xml |
| derive | |
| 1 (Function) | Data.Katydid.Relapse.Derive |
| 2 (Function) | Data.Katydid.Relapse.VpaDerive |
| 3 (Function) | Data.Katydid.Relapse.MemDerive |
| Desc | |
| 1 (Type/Class) | Data.Katydid.Relapse.Expr |
| 2 (Data Constructor) | Data.Katydid.Relapse.Expr |
| desc | Data.Katydid.Relapse.Expr |
| Double | Data.Katydid.Parser.Parser |
| doubleCastLit | Data.Katydid.Relapse.Parser |
| doubleExpr | Data.Katydid.Relapse.Expr |
| DoubleFunc | Data.Katydid.Relapse.Expr |
| doublesExpr | Data.Katydid.Relapse.Expr |
| DoublesFunc | Data.Katydid.Relapse.Expr |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - D
| decodeJSON | Data.Katydid.Parser.Json |
| decodeXML | Data.Katydid.Parser.Xml |
| derive | |
| 1 (Function) | Data.Katydid.Relapse.Derive |
| 2 (Function) | Data.Katydid.Relapse.VpaDerive |
| 3 (Function) | Data.Katydid.Relapse.MemDerive |
| Desc | |
| 1 (Type/Class) | Data.Katydid.Relapse.Expr |
| 2 (Data Constructor) | Data.Katydid.Relapse.Expr |
| desc | Data.Katydid.Relapse.Expr |
| Double | Data.Katydid.Parser.Parser |
| doubleCastLit | Data.Katydid.Relapse.Parser |
| doubleExpr | Data.Katydid.Relapse.Expr |
| DoubleFunc | Data.Katydid.Relapse.Expr |
| doublesExpr | Data.Katydid.Relapse.Expr |
| DoublesFunc | Data.Katydid.Relapse.Expr |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - E
| elemExpr | Data.Katydid.Relapse.Exprs.Elem |
| Empty | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| emptyPat | Data.Katydid.Relapse.Smart |
| emptyRef | Data.Katydid.Relapse.Ast |
| emptySet | Data.Katydid.Relapse.Smart |
| eqExpr | Data.Katydid.Relapse.Exprs.Compare |
| eval | Data.Katydid.Relapse.Expr |
| evalConst | Data.Katydid.Relapse.Expr |
| evalIfExprs | Data.Katydid.Relapse.IfExprs |
| evalZippedIfExprs | Data.Katydid.Relapse.IfExprs |
| Expr | |
| 1 (Type/Class) | Data.Katydid.Relapse.Expr |
| 2 (Data Constructor) | Data.Katydid.Relapse.Expr |
| expr | |
| 1 (Function) | Data.Katydid.Relapse.Parser |
| 2 (Function) | Data.Katydid.Relapse.Smart |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - E
| elemExpr | Data.Katydid.Relapse.Exprs.Elem |
| Empty | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| emptyPat | Data.Katydid.Relapse.Smart |
| emptyRef | Data.Katydid.Relapse.Ast |
| emptySet | Data.Katydid.Relapse.Smart |
| eqExpr | Data.Katydid.Relapse.Exprs.Compare |
| eval | Data.Katydid.Relapse.Expr |
| evalConst | Data.Katydid.Relapse.Expr |
| evalIfExprs | Data.Katydid.Relapse.IfExprs |
| evalZippedIfExprs | Data.Katydid.Relapse.IfExprs |
| Expr | |
| 1 (Type/Class) | Data.Katydid.Relapse.Expr |
| 2 (Data Constructor) | Data.Katydid.Relapse.Expr |
| expr | |
| 1 (Function) | Data.Katydid.Relapse.Parser |
| 2 (Function) | Data.Katydid.Relapse.Smart |
katydid-0.4.0.1: A haskell implementation of Katydid
katydid-0.4.0.2: A haskell implementation of Katydid
katydid-0.4.0.1: A haskell implementation of Katydid
Index - G
| geExpr | Data.Katydid.Relapse.Exprs.Compare |
| getChildren | Data.Katydid.Parser.Parser |
| getLabel | Data.Katydid.Parser.Parser |
| Grammar | |
| 1 (Type/Class) | Data.Katydid.Relapse.Ast |
| 2 (Type/Class) | Data.Katydid.Relapse.Smart |
| 3 (Type/Class) | Data.Katydid.Relapse.Relapse |
| grammar | Data.Katydid.Relapse.Parser |
| gtExpr | Data.Katydid.Relapse.Exprs.Compare |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - G
| geExpr | Data.Katydid.Relapse.Exprs.Compare |
| getChildren | Data.Katydid.Parser.Parser |
| getLabel | Data.Katydid.Parser.Parser |
| Grammar | |
| 1 (Type/Class) | Data.Katydid.Relapse.Ast |
| 2 (Type/Class) | Data.Katydid.Relapse.Smart |
| 3 (Type/Class) | Data.Katydid.Relapse.Relapse |
| grammar | Data.Katydid.Relapse.Parser |
| gtExpr | Data.Katydid.Relapse.Exprs.Compare |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - H
| hashList | Data.Katydid.Relapse.Expr |
| hashString | Data.Katydid.Relapse.Expr |
| hashWithName | Data.Katydid.Relapse.Expr |
| hasPrefixExpr | Data.Katydid.Relapse.Exprs.Strings |
| hasRecursion | Data.Katydid.Relapse.Ast |
| hasSuffixExpr | Data.Katydid.Relapse.Exprs.Strings |
| hasVar | Data.Katydid.Relapse.Expr |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - H
| hashList | Data.Katydid.Relapse.Expr |
| hashString | Data.Katydid.Relapse.Expr |
| hashWithName | Data.Katydid.Relapse.Expr |
| hasPrefixExpr | Data.Katydid.Relapse.Exprs.Strings |
| hasRecursion | Data.Katydid.Relapse.Ast |
| hasSuffixExpr | Data.Katydid.Relapse.Exprs.Strings |
| hasVar | Data.Katydid.Relapse.Expr |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - I
| idLit | Data.Katydid.Relapse.Parser |
| IfExpr | Data.Katydid.Relapse.IfExprs |
| IfExprs | Data.Katydid.Relapse.IfExprs |
| Int | Data.Katydid.Parser.Parser |
| Interleave | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| interleavePat | Data.Katydid.Relapse.Smart |
| intExpr | Data.Katydid.Relapse.Expr |
| IntFunc | Data.Katydid.Relapse.Expr |
| intLit | Data.Katydid.Relapse.Parser |
| intsExpr | Data.Katydid.Relapse.Expr |
| IntsFunc | Data.Katydid.Relapse.Expr |
| isConst | Data.Katydid.Relapse.Expr |
| isVar | Data.Katydid.Relapse.Exprs.Var |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - I
| idLit | Data.Katydid.Relapse.Parser |
| IfExpr | Data.Katydid.Relapse.IfExprs |
| IfExprs | Data.Katydid.Relapse.IfExprs |
| Int | Data.Katydid.Parser.Parser |
| Interleave | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| interleavePat | Data.Katydid.Relapse.Smart |
| intExpr | Data.Katydid.Relapse.Expr |
| IntFunc | Data.Katydid.Relapse.Expr |
| intLit | Data.Katydid.Relapse.Parser |
| intsExpr | Data.Katydid.Relapse.Expr |
| IntsFunc | Data.Katydid.Relapse.Expr |
| isConst | Data.Katydid.Relapse.Expr |
| isVar | Data.Katydid.Relapse.Exprs.Var |
katydid-0.4.0.1: A haskell implementation of Katydid
katydid-0.4.0.2: A haskell implementation of Katydid
katydid-0.4.0.1: A haskell implementation of Katydid
Index - L
| Label | Data.Katydid.Parser.Parser |
| leExpr | Data.Katydid.Relapse.Exprs.Compare |
| left | Data.Katydid.Relapse.Smart |
| lengthBytesExpr | Data.Katydid.Relapse.Exprs.Length |
| lengthListExpr | Data.Katydid.Relapse.Exprs.Length |
| lengthStringExpr | Data.Katydid.Relapse.Exprs.Length |
| listOfBytesExpr | Data.Katydid.Relapse.Expr |
| ListOfBytesFunc | Data.Katydid.Relapse.Expr |
| listRefs | Data.Katydid.Relapse.Ast |
| lookupMain | Data.Katydid.Relapse.Smart |
| lookupRef | |
| 1 (Function) | Data.Katydid.Relapse.Ast |
| 2 (Function) | Data.Katydid.Relapse.Smart |
| ltExpr | Data.Katydid.Relapse.Exprs.Compare |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - L
| Label | Data.Katydid.Parser.Parser |
| leExpr | Data.Katydid.Relapse.Exprs.Compare |
| left | Data.Katydid.Relapse.Smart |
| lengthBytesExpr | Data.Katydid.Relapse.Exprs.Length |
| lengthListExpr | Data.Katydid.Relapse.Exprs.Length |
| lengthStringExpr | Data.Katydid.Relapse.Exprs.Length |
| listOfBytesExpr | Data.Katydid.Relapse.Expr |
| ListOfBytesFunc | Data.Katydid.Relapse.Expr |
| listRefs | Data.Katydid.Relapse.Ast |
| lookupMain | Data.Katydid.Relapse.Smart |
| lookupRef | |
| 1 (Function) | Data.Katydid.Relapse.Ast |
| 2 (Function) | Data.Katydid.Relapse.Smart |
| ltExpr | Data.Katydid.Relapse.Exprs.Compare |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - M
katydid-0.4.0.2: A haskell implementation of Katydid
Index - M
katydid-0.4.0.1: A haskell implementation of Katydid
Index - N
| name | Data.Katydid.Relapse.Expr |
| nameExpr | Data.Katydid.Relapse.Parser |
| neExpr | Data.Katydid.Relapse.Exprs.Compare |
| newIfExpr | Data.Katydid.Relapse.IfExprs |
| newMem | Data.Katydid.Relapse.MemDerive |
| newRef | Data.Katydid.Relapse.Ast |
| Node | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| nodePat | Data.Katydid.Relapse.Smart |
| Not | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| notExpr | Data.Katydid.Relapse.Exprs.Logic |
| notPat | Data.Katydid.Relapse.Smart |
| nullable | |
| 1 (Function) | Data.Katydid.Relapse.Ast |
| 2 (Function) | Data.Katydid.Relapse.Smart |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - N
| name | Data.Katydid.Relapse.Expr |
| nameExpr | Data.Katydid.Relapse.Parser |
| neExpr | Data.Katydid.Relapse.Exprs.Compare |
| newIfExpr | Data.Katydid.Relapse.IfExprs |
| newMem | Data.Katydid.Relapse.MemDerive |
| newRef | Data.Katydid.Relapse.Ast |
| Node | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| nodePat | Data.Katydid.Relapse.Smart |
| Not | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| notExpr | Data.Katydid.Relapse.Exprs.Logic |
| notPat | Data.Katydid.Relapse.Smart |
| nullable | |
| 1 (Function) | Data.Katydid.Relapse.Ast |
| 2 (Function) | Data.Katydid.Relapse.Smart |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - O
| Optional | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| optionalPat | Data.Katydid.Relapse.Smart |
| Or | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| orExpr | Data.Katydid.Relapse.Exprs.Logic |
| orPat | Data.Katydid.Relapse.Smart |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - O
| Optional | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| optionalPat | Data.Katydid.Relapse.Smart |
| Or | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| orExpr | Data.Katydid.Relapse.Exprs.Logic |
| orPat | Data.Katydid.Relapse.Smart |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - P
| params | Data.Katydid.Relapse.Expr |
| parse | Data.Katydid.Relapse.Relapse |
| parseGrammar | Data.Katydid.Relapse.Parser |
| parseGrammarWithUDFs | Data.Katydid.Relapse.Parser |
| parseWithUDFs | Data.Katydid.Relapse.Relapse |
| pat | Data.Katydid.Relapse.Smart |
| pats | Data.Katydid.Relapse.Smart |
| Pattern | |
| 1 (Type/Class) | Data.Katydid.Relapse.Ast |
| 2 (Type/Class) | Data.Katydid.Relapse.Smart |
| pattern | Data.Katydid.Relapse.Parser |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - P
| params | Data.Katydid.Relapse.Expr |
| parse | Data.Katydid.Relapse.Relapse |
| parseGrammar | Data.Katydid.Relapse.Parser |
| parseGrammarWithUDFs | Data.Katydid.Relapse.Parser |
| parseWithUDFs | Data.Katydid.Relapse.Relapse |
| pat | Data.Katydid.Relapse.Smart |
| pats | Data.Katydid.Relapse.Smart |
| Pattern | |
| 1 (Type/Class) | Data.Katydid.Relapse.Ast |
| 2 (Type/Class) | Data.Katydid.Relapse.Smart |
| pattern | Data.Katydid.Relapse.Parser |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - R
| Reference | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| refName | Data.Katydid.Relapse.Smart |
| refPat | Data.Katydid.Relapse.Smart |
| regexExpr | Data.Katydid.Relapse.Exprs.Strings |
| removeOneForEach | Data.Katydid.Relapse.Derive |
| returns | Data.Katydid.Relapse.Derive |
| reverseLookupRef | Data.Katydid.Relapse.Ast |
| right | Data.Katydid.Relapse.Smart |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - R
| Reference | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| refName | Data.Katydid.Relapse.Smart |
| refPat | Data.Katydid.Relapse.Smart |
| regexExpr | Data.Katydid.Relapse.Exprs.Strings |
| removeOneForEach | Data.Katydid.Relapse.Derive |
| returns | Data.Katydid.Relapse.Derive |
| reverseLookupRef | Data.Katydid.Relapse.Ast |
| right | Data.Katydid.Relapse.Smart |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - S
| simplify | Data.Katydid.Relapse.Simplify |
| stdOnly | Data.Katydid.Relapse.Exprs |
| String | Data.Katydid.Parser.Parser |
| stringExpr | Data.Katydid.Relapse.Expr |
| StringFunc | Data.Katydid.Relapse.Expr |
| stringLit | Data.Katydid.Relapse.Parser |
| stringsExpr | Data.Katydid.Relapse.Expr |
| StringsFunc | Data.Katydid.Relapse.Expr |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - S
| simplify | Data.Katydid.Relapse.Simplify |
| stdOnly | Data.Katydid.Relapse.Exprs |
| String | Data.Katydid.Parser.Parser |
| stringExpr | Data.Katydid.Relapse.Expr |
| StringFunc | Data.Katydid.Relapse.Expr |
| stringLit | Data.Katydid.Relapse.Parser |
| stringsExpr | Data.Katydid.Relapse.Expr |
| StringsFunc | Data.Katydid.Relapse.Expr |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - T
| toLowerExpr | Data.Katydid.Relapse.Exprs.Strings |
| toUpperExpr | Data.Katydid.Relapse.Exprs.Strings |
| Tree | Data.Katydid.Parser.Parser |
| trimBool | Data.Katydid.Relapse.Expr |
| trimBytes | Data.Katydid.Relapse.Expr |
| trimDouble | Data.Katydid.Relapse.Expr |
| trimInt | Data.Katydid.Relapse.Expr |
| trimString | Data.Katydid.Relapse.Expr |
| trimUint | Data.Katydid.Relapse.Expr |
| typeExpr | Data.Katydid.Relapse.Exprs.Type |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - T
| toLowerExpr | Data.Katydid.Relapse.Exprs.Strings |
| toUpperExpr | Data.Katydid.Relapse.Exprs.Strings |
| Tree | Data.Katydid.Parser.Parser |
| trimBool | Data.Katydid.Relapse.Expr |
| trimBytes | Data.Katydid.Relapse.Expr |
| trimDouble | Data.Katydid.Relapse.Expr |
| trimInt | Data.Katydid.Relapse.Expr |
| trimString | Data.Katydid.Relapse.Expr |
| trimUint | Data.Katydid.Relapse.Expr |
| typeExpr | Data.Katydid.Relapse.Exprs.Type |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - U
| Uint | Data.Katydid.Parser.Parser |
| uintCastLit | Data.Katydid.Relapse.Parser |
| uintExpr | Data.Katydid.Relapse.Expr |
| UintFunc | Data.Katydid.Relapse.Expr |
| uintsExpr | Data.Katydid.Relapse.Expr |
| UintsFunc | Data.Katydid.Relapse.Expr |
| unescapable | Data.Katydid.Relapse.Smart |
| union | Data.Katydid.Relapse.Ast |
| unzipby | Data.Katydid.Relapse.Zip |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - U
| Uint | Data.Katydid.Parser.Parser |
| uintCastLit | Data.Katydid.Relapse.Parser |
| uintExpr | Data.Katydid.Relapse.Expr |
| UintFunc | Data.Katydid.Relapse.Expr |
| uintsExpr | Data.Katydid.Relapse.Expr |
| UintsFunc | Data.Katydid.Relapse.Expr |
| unescapable | Data.Katydid.Relapse.Smart |
| union | Data.Katydid.Relapse.Ast |
| unzipby | Data.Katydid.Relapse.Zip |
katydid-0.4.0.1: A haskell implementation of Katydid
Index - V
| validate | |
| 1 (Function) | Data.Katydid.Relapse.MemDerive |
| 2 (Function) | Data.Katydid.Relapse.Relapse |
| varBoolExpr | Data.Katydid.Relapse.Exprs.Var |
| varBytesExpr | Data.Katydid.Relapse.Exprs.Var |
| varDoubleExpr | Data.Katydid.Relapse.Exprs.Var |
| varIntExpr | Data.Katydid.Relapse.Exprs.Var |
| varStringExpr | Data.Katydid.Relapse.Exprs.Var |
| varUintExpr | Data.Katydid.Relapse.Exprs.Var |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - V
| validate | |
| 1 (Function) | Data.Katydid.Relapse.MemDerive |
| 2 (Function) | Data.Katydid.Relapse.Relapse |
| varBoolExpr | Data.Katydid.Relapse.Exprs.Var |
| varBytesExpr | Data.Katydid.Relapse.Exprs.Var |
| varDoubleExpr | Data.Katydid.Relapse.Exprs.Var |
| varIntExpr | Data.Katydid.Relapse.Exprs.Var |
| varStringExpr | Data.Katydid.Relapse.Exprs.Var |
| varUintExpr | Data.Katydid.Relapse.Exprs.Var |
katydid-0.4.0.1: A haskell implementation of Katydid
katydid-0.4.0.2: A haskell implementation of Katydid
katydid-0.4.0.1: A haskell implementation of Katydid
Index - Z
| ZAny | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| zanyPat | Data.Katydid.Relapse.Smart |
| ZeroOrMore | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| zeroOrMorePat | Data.Katydid.Relapse.Smart |
| zipderive | Data.Katydid.Relapse.Derive |
| zipIfExprs | Data.Katydid.Relapse.IfExprs |
| ZippedIfExprs | Data.Katydid.Relapse.IfExprs |
| Zipper | Data.Katydid.Relapse.Zip |
| zippy | Data.Katydid.Relapse.Zip |
katydid-0.4.0.2: A haskell implementation of Katydid
Index - Z
| ZAny | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| zanyPat | Data.Katydid.Relapse.Smart |
| ZeroOrMore | |
| 1 (Data Constructor) | Data.Katydid.Relapse.Ast |
| 2 (Data Constructor) | Data.Katydid.Relapse.Smart |
| zeroOrMorePat | Data.Katydid.Relapse.Smart |
| zipderive | Data.Katydid.Relapse.Derive |
| zipIfExprs | Data.Katydid.Relapse.IfExprs |
| ZippedIfExprs | Data.Katydid.Relapse.IfExprs |
| Zipper | Data.Katydid.Relapse.Zip |
| zippy | Data.Katydid.Relapse.Zip |
katydid-0.4.0.1: A haskell implementation of Katydid
katydid-0.4.0.2: A haskell implementation of Katydid
katydid-0.4.0.1: A haskell implementation of Katydid
Please see the README on GitHub at https://github.com/katydid/katydid-haskell#readme
Signatures
Modules
katydid-0.4.0.2: A haskell implementation of Katydid
Please see the README on GitHub at https://github.com/katydid/katydid-haskell#readme
Signatures
Modules