Data.Trie.Pred

Predicated Trie

data PredTrie s a

Constructors

PredTrie

Fields

predLits :: MapStep PredTrie s a

predPreds :: PredSteps PredTrie s a

Instances

Ord s => Trie NonEmpty s PredTrie

Functor (PredTrie s)

Ord s => Monoid (PredTrie s a)

emptyPT :: PredTrie s a

matchPT :: Ord s => NonEmpty s -> PredTrie s a -> Maybe (NonEmpty s, a, [s])

Find the nearest parent node of the requested query, while returning the split of the string that was matched, and what wasn't.

matchesPT :: Ord s => NonEmpty s -> PredTrie s a -> [(NonEmpty s, a, [s])]

Rooted Predicated Trie

data RootedPredTrie s a

Constructors

RootedPredTrie

Fields

rootedBase :: Maybe a

rootedSub :: PredTrie s a

Instances

Ord s => Trie [] s RootedPredTrie

Functor (RootedPredTrie s)

Ord s => Monoid (RootedPredTrie s a)

emptyRPT :: RootedPredTrie s a

matchRPT :: Ord s => [s] -> RootedPredTrie s a -> Maybe ([s], a, [s])

matchesRPT :: Ord s => [s] -> RootedPredTrie s a -> [([s], a, [s])]