SimpleH-0.9: A light, clean and powerful Haskell utility library

Safe HaskellNone

SimpleH.Containers

Synopsis

Documentation

class DataMap m k a | m -> k a whereSource

Methods

lookup :: k -> m -> Maybe aSource

alter :: (Maybe a -> Maybe a) -> k -> m -> mSource

Instances

Ord a => DataMap (Set a) a Void 
Ord k => DataMap (Map k a) k a 

newtype AList k a Source

Constructors

AList 

Fields

getAList :: [(k, a)]
 

data Set a

A set of values a.

Instances

Typeable1 Set 
Foldable Set 
Eq a => Eq (Set a) 
(Data a, Ord a) => Data (Set a) 
Ord a => Ord (Set a) 
(Read a, Ord a) => Read (Set a) 
Show a => Show (Set a) 
Ord a => Monoid (Set a) 
NFData a => NFData (Set a) 
Ord a => Monoid (Set a) 
Ord a => Semigroup (Set a) 
Ord a => DataMap (Set a) a Void 

data Map k a

A Map from keys k to values a.

Instances

Typeable2 Map 
Functor (Map k) 
Foldable (Map k) 
Traversable (Map k) 
Functor (Map k) 
(Eq k, Eq a) => Eq (Map k a) 
(Data k, Data a, Ord k) => Data (Map k a) 
(Ord k, Ord v) => Ord (Map k v) 
(Ord k, Read k, Read e) => Read (Map k e) 
(Show k, Show a) => Show (Map k a) 
Ord k => Monoid (Map k v) 
(NFData k, NFData a) => NFData (Map k a) 
Ord k => Monoid (Map k a) 
Ord k => Semigroup (Map k a) 
Ord k => DataMap (Map k a) k a 

member :: DataMap m k Void => k -> m -> BoolSource

delete :: DataMap m k a => k -> m -> mSource

minsert :: (Monoid a, DataMap m k a) => k -> m -> mSource

insert :: DataMap m k a => a -> k -> m -> mSource