Data.Trie.Pred.Unified.Fast

Documentation

data FUPTrie t x where

A fast, unified, predicative trie. Singleton, leaf-ending branches have their own data constructor, predicate labels and literals have a unified type.

Constructors

FURest :: NonEmpty t -> x -> FUPTrie t x

FUMore :: t -> Maybe x -> NonEmpty (FUPTrie t x) -> FUPTrie t x

FUPred :: t -> (t -> Maybe r) -> Maybe (r -> x) -> [FUPTrie t (r -> x)] -> FUPTrie t x

lookup :: Eq t => NonEmpty t -> FUPTrie t x -> Maybe x

merge :: Eq t => FUPTrie t x -> FUPTrie t x -> FUPTrie t x

Overwrites when similar, leaves untouched when not

areDisjoint :: Eq t => FUPTrie t x -> FUPTrie t x -> Bool