Ord k => Maplike (Strict Map) k Source #
Methods union :: Strict Map k v -> Strict Map k v -> Strict Map k v Source # intersection :: Strict Map k v -> Strict Map k v -> Strict Map k v Source # difference :: Strict Map k v -> Strict Map k v -> Strict Map k v Source # empty :: Strict Map k v Source # lookup :: k -> Strict Map k v -> Maybe v Source # singleton :: k -> v -> Strict Map k v Source # insert :: k -> v -> Strict Map k v -> Strict Map k v Source # delete :: k -> Strict Map k v -> Strict Map k v Source # toList :: Strict Map k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Strict Map k v -> a Source #
Enum k => Maplike (Strict EnumMap) k Source #
Methods union :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v Source # intersection :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v Source # difference :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v Source # empty :: Strict EnumMap k v Source # lookup :: k -> Strict EnumMap k v -> Maybe v Source # singleton :: k -> v -> Strict EnumMap k v Source # insert :: k -> v -> Strict EnumMap k v -> Strict EnumMap k v Source # delete :: k -> Strict EnumMap k v -> Strict EnumMap k v Source # toList :: Strict EnumMap k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Strict EnumMap k v -> a Source #
(Eq k, Hashable k) => Maplike (Strict HashMap) k Source #
Methods union :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v Source # intersection :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v Source # difference :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v Source # empty :: Strict HashMap k v Source # lookup :: k -> Strict HashMap k v -> Maybe v Source # singleton :: k -> v -> Strict HashMap k v Source # insert :: k -> v -> Strict HashMap k v -> Strict HashMap k v Source # delete :: k -> Strict HashMap k v -> Strict HashMap k v Source # toList :: Strict HashMap k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Strict HashMap k v -> a Source #
Ord k => Maplike (Lazy Map) k Source #
Methods union :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v Source # intersection :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v Source # difference :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v Source # empty :: Lazy Map k v Source # lookup :: k -> Lazy Map k v -> Maybe v Source # singleton :: k -> v -> Lazy Map k v Source # insert :: k -> v -> Lazy Map k v -> Lazy Map k v Source # delete :: k -> Lazy Map k v -> Lazy Map k v Source # toList :: Lazy Map k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy Map k v -> a Source #
Enum k => Maplike (Lazy EnumMap) k Source #
Methods union :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v Source # intersection :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v Source # difference :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v Source # empty :: Lazy EnumMap k v Source # lookup :: k -> Lazy EnumMap k v -> Maybe v Source # singleton :: k -> v -> Lazy EnumMap k v Source # insert :: k -> v -> Lazy EnumMap k v -> Lazy EnumMap k v Source # delete :: k -> Lazy EnumMap k v -> Lazy EnumMap k v Source # toList :: Lazy EnumMap k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy EnumMap k v -> a Source #
(Eq k, Hashable k) => Maplike (Lazy HashMap) k Source #
Methods union :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v Source # intersection :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v Source # difference :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v Source # empty :: Lazy HashMap k v Source # lookup :: k -> Lazy HashMap k v -> Maybe v Source # singleton :: k -> v -> Lazy HashMap k v Source # insert :: k -> v -> Lazy HashMap k v -> Lazy HashMap k v Source # delete :: k -> Lazy HashMap k v -> Lazy HashMap k v Source # toList :: Lazy HashMap k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy HashMap k v -> a Source #

newtype Lazy c k v Source #

Constructors

Lazy (c k v)

Instances

Ord k => Maplike (Lazy Map) k Source #
Methods union :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v Source # intersection :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v Source # difference :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v Source # empty :: Lazy Map k v Source # lookup :: k -> Lazy Map k v -> Maybe v Source # singleton :: k -> v -> Lazy Map k v Source # insert :: k -> v -> Lazy Map k v -> Lazy Map k v Source # delete :: k -> Lazy Map k v -> Lazy Map k v Source # toList :: Lazy Map k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy Map k v -> a Source #
Enum k => Maplike (Lazy EnumMap) k Source #
Methods union :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v Source # intersection :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v Source # difference :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v Source # empty :: Lazy EnumMap k v Source # lookup :: k -> Lazy EnumMap k v -> Maybe v Source # singleton :: k -> v -> Lazy EnumMap k v Source # insert :: k -> v -> Lazy EnumMap k v -> Lazy EnumMap k v Source # delete :: k -> Lazy EnumMap k v -> Lazy EnumMap k v Source # toList :: Lazy EnumMap k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy EnumMap k v -> a Source #
(Eq k, Hashable k) => Maplike (Lazy HashMap) k Source #
Methods union :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v Source # intersection :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v Source # difference :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v Source # empty :: Lazy HashMap k v Source # lookup :: k -> Lazy HashMap k v -> Maybe v Source # singleton :: k -> v -> Lazy HashMap k v Source # insert :: k -> v -> Lazy HashMap k v -> Lazy HashMap k v Source # delete :: k -> Lazy HashMap k v -> Lazy HashMap k v Source # toList :: Lazy HashMap k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy HashMap k v -> a Source #

newtype Strict c k v Source #

Constructors

Strict (c k v)

Instances

Ord k => Maplike (Strict Map) k Source #
Methods union :: Strict Map k v -> Strict Map k v -> Strict Map k v Source # intersection :: Strict Map k v -> Strict Map k v -> Strict Map k v Source # difference :: Strict Map k v -> Strict Map k v -> Strict Map k v Source # empty :: Strict Map k v Source # lookup :: k -> Strict Map k v -> Maybe v Source # singleton :: k -> v -> Strict Map k v Source # insert :: k -> v -> Strict Map k v -> Strict Map k v Source # delete :: k -> Strict Map k v -> Strict Map k v Source # toList :: Strict Map k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Strict Map k v -> a Source #
Enum k => Maplike (Strict EnumMap) k Source #
Methods union :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v Source # intersection :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v Source # difference :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v Source # empty :: Strict EnumMap k v Source # lookup :: k -> Strict EnumMap k v -> Maybe v Source # singleton :: k -> v -> Strict EnumMap k v Source # insert :: k -> v -> Strict EnumMap k v -> Strict EnumMap k v Source # delete :: k -> Strict EnumMap k v -> Strict EnumMap k v Source # toList :: Strict EnumMap k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Strict EnumMap k v -> a Source #
(Eq k, Hashable k) => Maplike (Strict HashMap) k Source #
Methods union :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v Source # intersection :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v Source # difference :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v Source # empty :: Strict HashMap k v Source # lookup :: k -> Strict HashMap k v -> Maybe v Source # singleton :: k -> v -> Strict HashMap k v Source # insert :: k -> v -> Strict HashMap k v -> Strict HashMap k v Source # delete :: k -> Strict HashMap k v -> Strict HashMap k v Source # toList :: Strict HashMap k v -> [(k, v)] Source # foldrWithKey :: (k -> v -> a -> a) -> a -> Strict HashMap k v -> a Source #