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)

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

Eq s => Trie NonEmpty s KnuthTrie

Eq s => Trie NonEmpty s ListTrie

Ord s => Trie NonEmpty s MapTrie

(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.

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

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

makeBSTrie :: Trie a -> BSTrie ByteString a

getBSTrie :: BSTrie ByteString a -> Trie a