One Step
newtype MapStep c p a Source
Instances
(Ord p, Trie NonEmpty p c) => Trie NonEmpty p (MapStep c) Source | No insertion instance - requires children nodes to be a monoid. Use Data.Trie.Map.insert
instead. |
Functor (c p) => Functor (MapStep c p) Source | |
Foldable (c p) => Foldable (MapStep c p) Source | |
Traversable (c p) => Traversable (MapStep c p) Source | |
(Eq p, Eq a, Eq (c p a)) => Eq (MapStep c p a) Source | |
(Ord p, Ord a, Ord (c p a)) => Ord (MapStep c p a) Source | |
(Show p, Show a, Show (c p a)) => Show (MapStep c p a) Source | |
(Ord s, Monoid (c s a)) => Monoid (MapStep c s a) Source | |
(Arbitrary a, Arbitrary p, Arbitrary (c p a), Ord p) => Arbitrary (MapStep c p a) Source | |
Fixpoint of Steps
Conversion
Query
matches :: Ord s => NonEmpty s -> MapTrie s a -> [(NonEmpty s, a, [s])] Source
Returns a list of all the nodes along the path to the furthest point in the
query, in order of the path walked from the root to the furthest point.