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

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

Data.Map.IMap

Description

 

Synopsis

Documentation

data IMap m v Source #

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

Instances

Functor m => Functor (IMap m) Source # 

Methods

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

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

IsMap m => Applicative (IMap m) Source # 

Methods

pure :: a -> IMap m a #

(<*>) :: IMap m (a -> b) -> IMap m a -> IMap m b #

(*>) :: IMap m a -> IMap m b -> IMap m b #

(<*) :: IMap m a -> IMap m b -> IMap m a #

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

Methods

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

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

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

Methods

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

show :: IMap m v -> String #

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

fromList :: IsMap m => [(Key m, v)] -> m v Source #

intersectionWith :: IsMap m => (a -> b -> c) -> m a -> m b -> m c Source #