modular-prelude-0.2.0.0: A new Prelude featuring first class modules

Safe HaskellNone

ModularPrelude.LHashMap

Documentation

data LHashMapModule Source

Constructors

LHashMap 

Fields

map :: forall k a b. (a -> b) -> HashMap k a -> HashMap k b
 
filter :: forall k a. (k -> a -> Bool) -> HashMap k a -> HashMap k a
 
length :: forall k a. HashMap k a -> Int
 
singleton :: forall k a. Hashable k => k -> a -> HashMap k a
 
null :: forall k a. HashMap k a -> Bool
 
pack :: forall k a. (Eq k, Hashable k) => [(k, a)] -> HashMap k a
 
unpack :: forall k a. HashMap k a -> [(k, a)]
 
fromList :: forall k a. (Eq k, Hashable k) => [(k, a)] -> HashMap k a
 
toList :: forall k a. HashMap k a -> [(k, a)]
 
lookup :: forall k a. (Eq k, Hashable k) => k -> HashMap k a -> Maybe a
 
empty :: forall k a. HashMap k a
 
insert :: forall k a. (Eq k, Hashable k) => k -> a -> HashMap k a -> HashMap k a
 
delete :: forall k a. (Eq k, Hashable k) => k -> HashMap k a -> HashMap k a
 
member :: forall k a. (Eq k, Hashable k) => k -> HashMap k a -> Bool