Data.Trie.Pred.Unified.Tail

Documentation

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

suppliment :: (t -> Maybe r) -> t -> UPTrie t (r -> x) -> Maybe (UPTrie t x)

Given a parser and a chunk, take a trie expecting a result, and possibly return a reduced trie without the expectation.

tagUPTrie :: UPTrie t x -> t

Acts as a default tag value for the node

measureDepthRelative :: ([Int] -> Int) -> UPTrie t x -> Int

Measure the depth of a trie, based on the relation of other adjacent depths

minDepth :: UPTrie t x -> Int

maxDepth :: UPTrie t x -> Int

showTail :: Show t => UPTrie t x -> String

assignLit :: Eq t => Path t -> Maybe x -> UPTrie t x -> UPTrie t x

Assigns a value to literal constructors

elem :: Eq t => Path t -> UPTrie t x -> Bool

lookup :: Eq t => Path t -> UPTrie t x -> Maybe x

lookupWithL :: Eq t => (t -> t) -> Path t -> UPTrie t x -> Maybe x

Apply a transform f to the final path chunk, when matching a literal cell - used for eliminating file extensions in nested-routes.

lookupNearestParent :: Eq t => Path t -> UPTrie t x -> Maybe x

lookupThrough :: Eq t => Path t -> UPTrie t x -> [x]

Return all nodes passed during a lookup

firstNonEmpty :: [[a]] -> [a]

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

Overwrites when similar, leaves untouched when not

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

litSingletonTail :: Path t -> x -> UPTrie t x

Create a singleton trie out of literal constructors

litExtrudeTail :: [t] -> UPTrie t x -> UPTrie t x

Push a trie down with literal constructors

sort :: Eq t => [UPTrie t x] -> [UPTrie t x]

also does a non-deterministic merge - make sure your nodes are disjoint & clean