Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.CanonicalMaps

Synopsis

class Eq t => CanonicalZero t where
- zeroC :: t
- joinC :: t -> t -> t
canonicalInsert :: ( Ord k, CanonicalZero a) => (a -> a -> a) -> k -> a -> Map k a -> Map k a
canonicalMapUnion :: ( Ord k, CanonicalZero a) => (a -> a -> a) -> Map k a -> Map k a -> Map k a
canonicalMap :: ( Ord k, CanonicalZero a) => (a -> a) -> Map k a -> Map k a
pointWise :: ( Ord k, CanonicalZero v) => (v -> v -> Bool ) -> Map k v -> Map k v -> Bool
data Map k a

Documentation

class Eq t => CanonicalZero t where Source #

Methods

zeroC :: t Source #

joinC :: t -> t -> t Source #

Instances

Instances details

CanonicalZero Integer Source #
Instance details Defined in Data.CanonicalMaps Methods zeroC :: Integer Source # joinC :: Integer -> Integer -> Integer Source #
( Eq k, Eq v, Ord k, CanonicalZero v) => CanonicalZero ( Map k v) Source #
Instance details Defined in Data.CanonicalMaps Methods zeroC :: Map k v Source # joinC :: Map k v -> Map k v -> Map k v Source #

canonicalInsert :: ( Ord k, CanonicalZero a) => (a -> a -> a) -> k -> a -> Map k a -> Map k a Source #

canonicalMapUnion :: ( Ord k, CanonicalZero a) => (a -> a -> a) -> Map k a -> Map k a -> Map k a Source #

canonicalMap :: ( Ord k, CanonicalZero a) => (a -> a) -> Map k a -> Map k a Source #

pointWise :: ( Ord k, CanonicalZero v) => (v -> v -> Bool ) -> Map k v -> Map k v -> Bool Source #

data Map k a Source #

A Map from keys k to values a .

The Semigroup operation for Map is union , which prefers values from the left operand. If m1 maps a key k to a value a1 , and m2 maps the same key to a different value a2 , then their union m1 <> m2 maps k to a1 .

Instances

Instances details

Bifoldable Map	Since: containers-0.6.3.1
Instance details Defined in Data.Map.Internal Methods bifold :: Monoid m => Map m m -> m Source # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Map a b -> m Source # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Map a b -> c Source # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Map a b -> c Source #
Eq2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftEq2 :: (a -> b -> Bool ) -> (c -> d -> Bool ) -> Map a c -> Map b d -> Bool Source #
Ord2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftCompare2 :: (a -> b -> Ordering ) -> (c -> d -> Ordering ) -> Map a c -> Map b d -> Ordering Source #
Show2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftShowsPrec2 :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> ( Int -> b -> ShowS ) -> ([b] -> ShowS ) -> Int -> Map a b -> ShowS Source # liftShowList2 :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> ( Int -> b -> ShowS ) -> ([b] -> ShowS ) -> [ Map a b] -> ShowS Source #
Hashable2 Map	Since: hashable-1.3.4.0
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt2 :: ( Int -> a -> Int ) -> ( Int -> b -> Int ) -> Int -> Map a b -> Int Source #
Functor ( Map k)
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> Map k a -> Map k b Source # (<$) :: a -> Map k b -> Map k a Source #
Foldable ( Map k)	Folds in order of increasing key.
Instance details Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m Source # foldMap :: Monoid m => (a -> m) -> Map k a -> m Source # foldMap' :: Monoid m => (a -> m) -> Map k a -> m Source # foldr :: (a -> b -> b) -> b -> Map k a -> b Source # foldr' :: (a -> b -> b) -> b -> Map k a -> b Source # foldl :: (b -> a -> b) -> b -> Map k a -> b Source # foldl' :: (b -> a -> b) -> b -> Map k a -> b Source # foldr1 :: (a -> a -> a) -> Map k a -> a Source # foldl1 :: (a -> a -> a) -> Map k a -> a Source # toList :: Map k a -> [a] Source # null :: Map k a -> Bool Source # length :: Map k a -> Int Source # elem :: Eq a => a -> Map k a -> Bool Source # maximum :: Ord a => Map k a -> a Source # minimum :: Ord a => Map k a -> a Source # sum :: Num a => Map k a -> a Source # product :: Num a => Map k a -> a Source #
Traversable ( Map k)	Traverses in order of increasing key.
Instance details Defined in Data.Map.Internal Methods traverse :: Applicative f => (a -> f b) -> Map k a -> f ( Map k b) Source # sequenceA :: Applicative f => Map k (f a) -> f ( Map k a) Source # mapM :: Monad m => (a -> m b) -> Map k a -> m ( Map k b) Source # sequence :: Monad m => Map k (m a) -> m ( Map k a) Source #
Eq k => Eq1 ( Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftEq :: (a -> b -> Bool ) -> Map k a -> Map k b -> Bool Source #
Ord k => Ord1 ( Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftCompare :: (a -> b -> Ordering ) -> Map k a -> Map k b -> Ordering Source #
( Ord k, Read k) => Read1 ( Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftReadsPrec :: ( Int -> ReadS a) -> ReadS [a] -> Int -> ReadS ( Map k a) Source # liftReadList :: ( Int -> ReadS a) -> ReadS [a] -> ReadS [ Map k a] Source # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec ( Map k a) Source # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [ Map k a] Source #
Show k => Show1 ( Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftShowsPrec :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> Int -> Map k a -> ShowS Source # liftShowList :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> [ Map k a] -> ShowS Source #
Hashable k => Hashable1 ( Map k)	Since: hashable-1.3.4.0
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: ( Int -> a -> Int ) -> Int -> Map k a -> Int Source #
Ord k => IsList ( Map k v)	Since: containers-0.5.6.2
Instance details Defined in Data.Map.Internal Associated Types type Item ( Map k v) Source # Methods fromList :: [ Item ( Map k v)] -> Map k v Source # fromListN :: Int -> [ Item ( Map k v)] -> Map k v Source # toList :: Map k v -> [ Item ( Map k v)] Source #
( Eq k, Eq a) => Eq ( Map k a)
Instance details Defined in Data.Map.Internal Methods (==) :: Map k a -> Map k a -> Bool Source # (/=) :: Map k a -> Map k a -> Bool Source #
( Data k, Data a, Ord k) => Data ( Map k a)
Instance details Defined in Data.Map.Internal Methods gfoldl :: ( forall d b. Data d => c (d -> b) -> d -> c b) -> ( forall g. g -> c g) -> Map k a -> c ( Map k a) Source # gunfold :: ( forall b r. Data b => c (b -> r) -> c r) -> ( forall r. r -> c r) -> Constr -> c ( Map k a) Source # toConstr :: Map k a -> Constr Source # dataTypeOf :: Map k a -> DataType Source # dataCast1 :: Typeable t => ( forall d. Data d => c (t d)) -> Maybe (c ( Map k a)) Source # dataCast2 :: Typeable t => ( forall d e. ( Data d, Data e) => c (t d e)) -> Maybe (c ( Map k a)) Source # gmapT :: ( forall b. Data b => b -> b) -> Map k a -> Map k a Source # gmapQl :: (r -> r' -> r) -> r -> ( forall d. Data d => d -> r') -> Map k a -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> ( forall d. Data d => d -> r') -> Map k a -> r Source # gmapQ :: ( forall d. Data d => d -> u) -> Map k a -> [u] Source # gmapQi :: Int -> ( forall d. Data d => d -> u) -> Map k a -> u Source # gmapM :: Monad m => ( forall d. Data d => d -> m d) -> Map k a -> m ( Map k a) Source # gmapMp :: MonadPlus m => ( forall d. Data d => d -> m d) -> Map k a -> m ( Map k a) Source # gmapMo :: MonadPlus m => ( forall d. Data d => d -> m d) -> Map k a -> m ( Map k a) Source #
( Ord k, Ord v) => Ord ( Map k v)
Instance details Defined in Data.Map.Internal Methods compare :: Map k v -> Map k v -> Ordering Source # (<) :: Map k v -> Map k v -> Bool Source # (<=) :: Map k v -> Map k v -> Bool Source # (>) :: Map k v -> Map k v -> Bool Source # (>=) :: Map k v -> Map k v -> Bool Source # max :: Map k v -> Map k v -> Map k v Source # min :: Map k v -> Map k v -> Map k v Source #
( Ord k, Read k, Read e) => Read ( Map k e)
Instance details Defined in Data.Map.Internal Methods readsPrec :: Int -> ReadS ( Map k e) Source # readList :: ReadS [ Map k e] Source # readPrec :: ReadPrec ( Map k e) Source # readListPrec :: ReadPrec [ Map k e] Source #
( Show k, Show a) => Show ( Map k a)
Instance details Defined in Data.Map.Internal Methods showsPrec :: Int -> Map k a -> ShowS Source # show :: Map k a -> String Source # showList :: [ Map k a] -> ShowS Source #
Ord k => Semigroup ( Map k v)
Instance details Defined in Data.Map.Internal Methods (<>) :: Map k v -> Map k v -> Map k v Source # sconcat :: NonEmpty ( Map k v) -> Map k v Source # stimes :: Integral b => b -> Map k v -> Map k v Source #
Ord k => Monoid ( Map k v)
Instance details Defined in Data.Map.Internal Methods mempty :: Map k v Source # mappend :: Map k v -> Map k v -> Map k v Source # mconcat :: [ Map k v] -> Map k v Source #
( Hashable k, Hashable v) => Hashable ( Map k v)	Since: hashable-1.3.4.0
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Map k v -> Int Source # hash :: Map k v -> Int Source #
( Ord k, ToCBOR k, ToCBOR v) => ToCBOR ( Map k v)
Instance details Defined in Cardano.Binary.ToCBOR Methods toCBOR :: Map k v -> Encoding Source # encodedSizeExpr :: ( forall t. ToCBOR t => Proxy t -> Size ) -> Proxy ( Map k v) -> Size Source # encodedListSizeExpr :: ( forall t. ToCBOR t => Proxy t -> Size ) -> Proxy [ Map k v] -> Size Source #
( Ord k, FromCBOR k, FromCBOR v) => FromCBOR ( Map k v)
Instance details Defined in Cardano.Binary.FromCBOR Methods fromCBOR :: Decoder s ( Map k v) Source # label :: Proxy ( Map k v) -> Text Source #
( NFData k, NFData a) => NFData ( Map k a)
Instance details Defined in Data.Map.Internal Methods rnf :: Map k a -> () Source #
( NoThunks k, NoThunks v) => NoThunks ( Map k v)
Instance details Defined in NoThunks.Class Methods noThunks :: Context -> Map k v -> IO ( Maybe ThunkInfo ) Source # wNoThunks :: Context -> Map k v -> IO ( Maybe ThunkInfo ) Source # showTypeOf :: Proxy ( Map k v) -> String Source #
( Eq k, Eq v, Ord k, CanonicalZero v) => CanonicalZero ( Map k v) Source #
Instance details Defined in Data.CanonicalMaps Methods zeroC :: Map k v Source # joinC :: Map k v -> Map k v -> Map k v Source #
( Ord k, FromCBOR k, FromCBOR v) => FromSharedCBOR ( Map k v) Source #
Instance details Defined in Data.Sharing Associated Types type Share ( Map k v) Source # Methods getShare :: Map k v -> Share ( Map k v) Source # fromSharedCBOR :: Share ( Map k v) -> Decoder s ( Map k v) Source # fromSharedPlusCBOR :: StateT ( Share ( Map k v)) ( Decoder s) ( Map k v) Source #
type Item ( Map k v)
Instance details Defined in Data.Map.Internal type Item ( Map k v) = (k, v)
type Share ( Map k v) Source #
Instance details Defined in Data.Sharing type Share ( Map k v) = ( Interns k, Interns v)