Text.Regex.PDeriv.Dictionary

A module that implements a dictionary/hash table

Documentation

class Key a where

Methods

hash :: a -> [Int]

Instances

Key Char

Key Int

Key RE

Key Pat

Key a => Key [a]

(Key a, Key b) => Key (a, b)

(Key a, Key b, Key c) => Key (a, b, c)

newtype Dictionary a

Constructors

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

the dictionary (k,a) version of elem

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

Constructors

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