liquid-fixpoint-0.8.10.2: Predicate Abstraction-based Horn-Clause/Implication Constraint Solver

Safe HaskellNone
LanguageHaskell98

Language.Fixpoint.Utils.Trie

Contents

Synopsis

Datatype

data Trie a Source #

Constructors

Node ![Branch a] 
Instances
Eq a => Eq (Trie a) Source # 
Instance details

Defined in Language.Fixpoint.Utils.Trie

Methods

(==) :: Trie a -> Trie a -> Bool #

(/=) :: Trie a -> Trie a -> Bool #

Show a => Show (Trie a) Source # 
Instance details

Defined in Language.Fixpoint.Utils.Trie

Methods

showsPrec :: Int -> Trie a -> ShowS #

show :: Trie a -> String #

showList :: [Trie a] -> ShowS #

Show a => PPrint (Trie a) Source # 
Instance details

Defined in Language.Fixpoint.Utils.Trie

Methods

pprintTidy :: Tidy -> Trie a -> Doc Source #

pprintPrec :: Int -> Tidy -> Trie a -> Doc Source #

data Branch a Source #

Constructors

Bind !Key !(Trie a) 
Val a 
Instances
Eq a => Eq (Branch a) Source # 
Instance details

Defined in Language.Fixpoint.Utils.Trie

Methods

(==) :: Branch a -> Branch a -> Bool #

(/=) :: Branch a -> Branch a -> Bool #

Show a => Show (Branch a) Source # 
Instance details

Defined in Language.Fixpoint.Utils.Trie

Methods

showsPrec :: Int -> Branch a -> ShowS #

show :: Branch a -> String #

showList :: [Branch a] -> ShowS #

Constructors

insert :: Path -> a -> Trie a -> Trie a Source #

fromList :: [(Path, a)] -> Trie a Source #

Visitors

fold :: (acc -> Path -> a -> acc) -> acc -> Trie a -> acc Source #

foldM :: Monad m => (acc -> Path -> a -> m acc) -> acc -> Trie a -> m acc Source #