Data.Trie.Class

Documentation

class Trie p s t | t -> p where

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)

Minimal complete definition

lookup, insert, delete

Methods

lookup :: p s -> t s a -> Maybe a

insert :: p s -> a -> t s a -> t s a

delete :: p s -> t s a -> t s a

Instances

Trie Identity ByteString BSTrie

Methods

lookup :: Identity ByteString -> BSTrie ByteString a -> Maybe a

insert :: Identity ByteString -> a -> BSTrie ByteString a -> BSTrie ByteString a

delete :: Identity ByteString -> BSTrie ByteString a -> BSTrie ByteString a

(Hashable p, Eq p) => Trie NonEmpty p HashMapTrie

Methods

lookup :: NonEmpty p -> HashMapTrie p a -> Maybe a

insert :: NonEmpty p -> a -> HashMapTrie p a -> HashMapTrie p a

delete :: NonEmpty p -> HashMapTrie p a -> HashMapTrie p a

Eq s => Trie NonEmpty s KnuthTrie

Methods

lookup :: NonEmpty s -> KnuthTrie s a -> Maybe a

insert :: NonEmpty s -> a -> KnuthTrie s a -> KnuthTrie s a

delete :: NonEmpty s -> KnuthTrie s a -> KnuthTrie s a

Eq s => Trie NonEmpty s ListTrie

Methods

lookup :: NonEmpty s -> ListTrie s a -> Maybe a

insert :: NonEmpty s -> a -> ListTrie s a -> ListTrie s a

delete :: NonEmpty s -> ListTrie s a -> ListTrie s a

Ord s => Trie NonEmpty s MapTrie

Methods

lookup :: NonEmpty s -> MapTrie s a -> Maybe a

insert :: NonEmpty s -> a -> MapTrie s a -> MapTrie s a

delete :: NonEmpty s -> MapTrie s a -> MapTrie s a

(Hashable p, Eq p, Trie NonEmpty p c) => Trie NonEmpty p (HashMapStep c)

Methods

lookup :: NonEmpty p -> HashMapStep c p a -> Maybe a

insert :: NonEmpty p -> a -> HashMapStep c p a -> HashMapStep c p a

delete :: NonEmpty p -> HashMapStep c p a -> HashMapStep c p a

(Ord p, Trie NonEmpty p c) => Trie NonEmpty p (MapStep c)

No insertion instance - requires children nodes to be a monoid. Use Data.Trie.Map.insert instead.

Methods

lookup :: NonEmpty p -> MapStep c p a -> Maybe a

insert :: NonEmpty p -> a -> MapStep c p a -> MapStep c p a

delete :: NonEmpty p -> MapStep c p a -> MapStep c p a

lookupWithDefault :: Trie p s t => a -> p s -> t s a -> a

member :: Trie p s t => p s -> t s a -> Bool

notMember :: Trie p s t => p s -> t s a -> Bool

Conversion

fromFoldable :: (Foldable f, Monoid (t s a), Trie p s t) => f (p s, a) -> t s a

Ternary Map

ByteString-Trie

newtype BSTrie q a

Embeds an empty ByteString passed around for type inference.

Constructors

BSTrie

Fields

• unBSTrie :: (q, Trie a)

Instances

Trie Identity ByteString BSTrie

Methods

lookup :: Identity ByteString -> BSTrie ByteString a -> Maybe a

insert :: Identity ByteString -> a -> BSTrie ByteString a -> BSTrie ByteString a

delete :: Identity ByteString -> BSTrie ByteString a -> BSTrie ByteString a

makeBSTrie :: Trie a -> BSTrie ByteString a

getBSTrie :: BSTrie ByteString a -> Trie a