Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Documentation
class Trie p s t | t -> p where Source #
Class representing tries with single-threaded insertion, deletion, and lookup.
forall ts ps a. isJust $ lookupPath ps (insertPath ps a ts)
forall ts ps. isNothing $ lookupPath ps (deletePath ps ts)
Instances
(Hashable p, Eq p) => Trie NonEmpty p HashMapTrie Source # | |
Defined in Data.Trie.HashMap lookup :: NonEmpty p -> HashMapTrie p a -> Maybe a Source # insert :: NonEmpty p -> a -> HashMapTrie p a -> HashMapTrie p a Source # delete :: NonEmpty p -> HashMapTrie p a -> HashMapTrie p a Source # | |
Eq s => Trie NonEmpty s KnuthTrie Source # | |
Eq s => Trie NonEmpty s ListTrie Source # | |
Ord s => Trie NonEmpty s MapTrie Source # | |
(Hashable p, Eq p, Trie NonEmpty p c) => Trie NonEmpty p (HashMapStep c) Source # | |
Defined in Data.Trie.HashMap lookup :: NonEmpty p -> HashMapStep c p a -> Maybe a Source # insert :: NonEmpty p -> a -> HashMapStep c p a -> HashMapStep c p a Source # delete :: NonEmpty p -> HashMapStep c p a -> HashMapStep c p a Source # | |
(Ord p, Trie NonEmpty p c) => Trie NonEmpty p (MapStep c) Source # | No insertion instance - requires children nodes to be a monoid. Use |