impure-containers-0.5.1: Mutable containers in Haskell.

Safe Haskell	None
Language	Haskell2010

Data.Trie.Immutable.Bits

Synopsis

data Trie k v = Trie {
- trieValue :: !(UnsafeMaybe v)
- trieLeft :: !(UnsafeMaybe (Trie k v))
- trieRight :: !(UnsafeMaybe (Trie k v))
}
empty :: Trie k v
lookup :: FiniteBits k => Trie k v -> k -> Maybe v
freeze :: PrimMonad m => MTrie (PrimState m) k v -> m (Trie k v)

Documentation

data Trie k v Source #

Constructors

Trie
Fields trieValue :: !(UnsafeMaybe v) trieLeft :: !(UnsafeMaybe (Trie k v)) trieRight :: !(UnsafeMaybe (Trie k v))

empty :: Trie k v Source #

lookup :: FiniteBits k => Trie k v -> k -> Maybe v Source #

This gives the best match, that is, the value stored at the longest prefix that matched this key.

freeze :: PrimMonad m => MTrie (PrimState m) k v -> m (Trie k v) Source #