subzero-0.1.0.6: Helps when going "seed values" -> alternatives and optional -> answers

Copyright(c) Tristan Wibberley 2017
LicenseGPL-2
Maintainertristan.wibberley@gmail.com
Stabilityexperimental
Safe HaskellSafe
LanguageHaskell2010

Data.Map.IMap

Description

 

Synopsis

Documentation

data IMap m k v Source #

An applicative map that discards mismatched keys (ie, uses intersection)

Instances

Functor (m k) => Functor (IMap m k) Source # 

Methods

fmap :: (a -> b) -> IMap m k a -> IMap m k b #

(<$) :: a -> IMap m k b -> IMap m k a #

(Functor (Map k), Ord k) => Applicative (IMap Map k) Source # 

Methods

pure :: a -> IMap Map k a #

(<*>) :: IMap Map k (a -> b) -> IMap Map k a -> IMap Map k b #

(*>) :: IMap Map k a -> IMap Map k b -> IMap Map k b #

(<*) :: IMap Map k a -> IMap Map k b -> IMap Map k a #

(Eq (m k v), Eq v) => Eq (IMap m k v) Source # 

Methods

(==) :: IMap m k v -> IMap m k v -> Bool #

(/=) :: IMap m k v -> IMap m k v -> Bool #

(Show (m k v), Show v) => Show (IMap m k v) Source # 

Methods

showsPrec :: Int -> IMap m k v -> ShowS #

show :: IMap m k v -> String #

showList :: [IMap m k v] -> ShowS #

fromList :: Ord k => [(k, v)] -> IMap Map k v Source #