Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data MTrie s k v = MTrie {
- mtrieValue :: !(MutMaybeVar s v)
- mtrieLeft :: !(MutMaybeVar s (MTrie s k v))
- mtrieRight :: !(MutMaybeVar s (MTrie s k v))
- new :: PrimMonad m => m (MTrie (PrimState m) k v)
- lookup :: (FiniteBits k, PrimMonad m) => MTrie (PrimState m) k v -> k -> m (Maybe v)
- insert :: (FiniteBits k, PrimMonad m) => MTrie (PrimState m) k v -> k -> v -> m ()
- insertPrefix :: (FiniteBits k, PrimMonad m) => MTrie (PrimState m) k v -> Int -> k -> v -> m ()
Documentation
MTrie | |
|
lookup :: (FiniteBits k, PrimMonad m) => MTrie (PrimState m) k v -> k -> m (Maybe v) Source #
This gives the best match, that is, the value stored at the longest prefix that matched this key.
:: (FiniteBits k, PrimMonad m) | |
=> MTrie (PrimState m) k v | |
-> k | prefix key |
-> v | value |
-> m () |
:: (FiniteBits k, PrimMonad m) | |
=> MTrie (PrimState m) k v | |
-> Int | significant bits from key |
-> k | prefix key |
-> v | value |
-> m () |