Data.Trie.Pred.Unified

Documentation

data RUPTrie t x

Constructors

Rooted

Fields

root :: Maybe x

children :: [UPTrie t x]

Instances

Functor (RUPTrie t)

Foldable (RUPTrie t)

(Eq t, Eq x) => Eq (RUPTrie t x)

Show t => Show (RUPTrie t x)

Eq t => Monoid (RUPTrie t x)

(Arbitrary t, Arbitrary x) => Arbitrary (RUPTrie t x)

data UPTrie t x where

Constructors

UMore :: t -> Maybe x -> [UPTrie t x] -> UPTrie t x

UPred :: t -> (t -> Maybe r) -> Maybe (r -> x) -> [UPTrie t (r -> x)] -> UPTrie t x

Instances

Functor (UPTrie t)

Foldable (UPTrie t)

(Eq t, Eq x) => Eq (UPTrie t x)

Show t => Show (UPTrie t x)

Ignores contents

Eq t => Semigroup (UPTrie t x)

(Arbitrary t, Arbitrary x) => Arbitrary (UPTrie t x)

Can only generate literal examples

assignLit :: Eq t => [t] -> Maybe x -> RUPTrie t x -> RUPTrie t x

showTrie :: Show t => RUPTrie t x -> String

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

elem :: Eq t => [t] -> RUPTrie t x -> Bool

lookup :: Eq t => [t] -> RUPTrie t x -> Maybe x

lookupWithL :: Eq t => (t -> t) -> [t] -> RUPTrie t x -> Maybe x

Applies f to the last chunk.

lookupNearestParent :: Eq t => [t] -> RUPTrie t x -> Maybe x

lookupThrough :: Eq t => [t] -> RUPTrie t x -> [x]

Append contents up-to lookup path.

litSingleton :: [t] -> x -> RUPTrie t x

litExtrude :: [t] -> RUPTrie t x -> RUPTrie t x