Safe Haskell	Safe
Language	Haskell2010

Parsers

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.

Documentation

class Tree a where Source #

Minimal complete definition

Methods

Constructors

Instances

Eq Label Source #
Methods (==) :: Label -> Label -> Bool # (/=) :: Label -> Label -> Bool #
Ord Label Source #
Methods compare :: Label -> Label -> Ordering # (<) :: Label -> Label -> Bool # (<=) :: Label -> Label -> Bool # (>) :: Label -> Label -> Bool # (>=) :: Label -> Label -> Bool # max :: Label -> Label -> Label # min :: Label -> Label -> Label #
Show Label Source #
Methods showsPrec :: Int -> Label -> ShowS # show :: Label -> String # showList :: [Label] -> ShowS #
Generic Label Source #
Associated Types type Rep Label :: * -> * # Methods from :: Label -> Rep Label x # to :: Rep Label x -> Label #
NFData Label Source #
Methods rnf :: Label -> () #
type Rep Label Source #
type Rep Label = D1 * (MetaData "Label" "Parsers" "katydid-0.2.0.1-ACarOSbTDdkJp5fcyd2HNP" False) ((:+:) * (C1 * (MetaCons "String" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * String))) ((:+:) * (C1 * (MetaCons "Number" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * Rational))) (C1 * (MetaCons "Bool" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * Bool)))))