| Copyright | (C) 2015, Yu Fukuzawa |
|---|---|
| License | BSD3 |
| Maintainer | minpou.primer@email.com |
| Stability | experimental |
| Portability | portable |
| Safe Haskell | None |
| Language | Haskell2010 |
Control.Imperative.Hash.Class
Contents
Description
- class Monad m => MHash m where
- type HashEntity m :: * -> * -> *
- newSizedHash :: Int -> m (HashEntity m k v)
- unsafeLookupHash :: HashKey k => HashEntity m k v -> k -> m v
- lookupHash :: HashKey k => HashEntity m k v -> k -> m (Maybe v)
- insertHash :: HashKey k => HashEntity m k v -> k -> v -> m ()
- deleteHash :: HashKey k => HashEntity m k v -> k -> m ()
- fromListHash :: HashKey k => [(k, v)] -> m (HashEntity m k v)
- toListHash :: HashKey k => HashEntity m k v -> m [(k, v)]
- class (Eq k, Hashable k) => HashKey k
Class
class Monad m => MHash m where Source
Base class for mutable hashtables.
Associated Types
type HashEntity m :: * -> * -> * Source
Methods
newSizedHash :: Int -> m (HashEntity m k v) Source
unsafeLookupHash :: HashKey k => HashEntity m k v -> k -> m v Source
lookupHash :: HashKey k => HashEntity m k v -> k -> m (Maybe v) Source
insertHash :: HashKey k => HashEntity m k v -> k -> v -> m () Source
deleteHash :: HashKey k => HashEntity m k v -> k -> m () Source
fromListHash :: HashKey k => [(k, v)] -> m (HashEntity m k v) Source
toListHash :: HashKey k => HashEntity m k v -> m [(k, v)] Source