Examples.RecoveredMap

An ordinary left-biased map similar to Map, implemented in terms of MonoidMap.

Documentation

newtype Map k v

Constructors

Map

Fields

• unMap :: MonoidMap k (First v)

Instances

Functor (Map k)

Defined in Examples.RecoveredMap

Methods

fmap :: (a -> b) -> Map k a -> Map k b

(<$) :: a -> Map k b -> Map k a

Ord k => Monoid (Map k v)

Defined in Examples.RecoveredMap

Methods

mempty :: Map k v

mappend :: Map k v -> Map k v -> Map k v

mconcat :: [Map k v] -> Map k v

Ord k => Semigroup (Map k v)

Defined in Examples.RecoveredMap

Methods

(<>) :: Map k v -> Map k v -> Map k v

sconcat :: NonEmpty (Map k v) -> Map k v

stimes :: Integral b => b -> Map k v -> Map k v

(Show k, Show v) => Show (Map k v)

Defined in Examples.RecoveredMap

Methods

showsPrec :: Int -> Map k v -> ShowS

show :: Map k v -> String

showList :: [Map k v] -> ShowS

(NFData k, NFData v) => NFData (Map k v)

Defined in Examples.RecoveredMap

Methods

rnf :: Map k v -> ()

(Eq k, Eq v) => Eq (Map k v)

Defined in Examples.RecoveredMap

Methods

(==) :: Map k v -> Map k v -> Bool

(/=) :: Map k v -> Map k v -> Bool

empty :: Map k v

singleton :: Ord k => k -> v -> Map k v

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

toList :: Map k v -> [(k, v)]

delete :: Ord k => k -> Map k v -> Map k v

insert :: Ord k => k -> v -> Map k v -> Map k v

keysSet :: Map k v -> Set k

lookup :: Ord k => k -> Map k v -> Maybe v

member :: Ord k => k -> Map k v -> Bool

map :: (v1 -> v2) -> Map k v1 -> Map k v2