| Safe Haskell | Safe |
|---|---|
| Language | Haskell98 |
Text.Regex.PDeriv.Dictionary
Description
A module that implements a dictionary/hash table
- class Key a where
- newtype Dictionary a = Dictionary (Trie a)
- primeL :: Int
- primeR :: Int
- empty :: Dictionary a
- insert :: Key k => k -> a -> Dictionary a -> Dictionary a
- insertNotOverwrite :: Key k => k -> a -> Dictionary a -> Dictionary a
- lookup :: Key k => k -> Dictionary a -> Maybe a
- lookupAll :: Key k => k -> Dictionary a -> [a]
- fromList :: Key k => [(k, a)] -> Dictionary a
- fromListNotOverwrite :: Key k => [(k, a)] -> Dictionary a
- update :: Key k => k -> a -> Dictionary a -> Dictionary a
- isIn :: (Key k, Eq k) => k -> Dictionary (k, a) -> Bool
- nub :: (Key k, Eq k) => [k] -> [k]
- nubSub :: (Key k, Eq k) => [k] -> Dictionary (k, ()) -> [k]
- data Trie a = Trie ![a] !(IntMap (Trie a))
- emptyTrie :: Trie a
- insertTrie :: Bool -> [Int] -> a -> Trie a -> Trie a
- lookupTrie :: [Int] -> Trie a -> Maybe (Trie a)
- updateTrie :: [Int] -> a -> Trie a -> Trie a
Documentation
Minimal complete definition
newtype Dictionary a Source #
Constructors
| Dictionary (Trie a) |
empty :: Dictionary a Source #
insert :: Key k => k -> a -> Dictionary a -> Dictionary a Source #
insertNotOverwrite :: Key k => k -> a -> Dictionary a -> Dictionary a Source #
lookupAll :: Key k => k -> Dictionary a -> [a] Source #
fromList :: Key k => [(k, a)] -> Dictionary a Source #
fromListNotOverwrite :: Key k => [(k, a)] -> Dictionary a Source #
update :: Key k => k -> a -> Dictionary a -> Dictionary a Source #
the dictionary (k,a) version of elem