Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Map.Diff.Strict

Contents

Types
Conversion
Construction
- Maps
- Lists
Query
- Size
Applying diffs
Folds and traversals
Filter

Description

Differences on Maps, represented as cancellative monoids.

Synopsis

data Delta v
- = Insert !v
- | Delete
data Diff k v
keysSet :: Diff k v -> Set k
diff :: (Ord k, Eq v) => Map k v -> Map k v -> Diff k v
empty :: Diff k v
fromMap :: Map k (Delta v) -> Diff k v
fromMapDeletes :: Map k v -> Diff k v
fromMapInserts :: Map k v -> Diff k v
fromList :: Ord k => [(k, Delta v)] -> Diff k v
fromListDeletes :: Ord k => [k] -> Diff k v
fromListInserts :: Ord k => [(k, v)] -> Diff k v
null :: Diff k v -> Bool
numDeletes :: Diff k v -> Int
numInserts :: Diff k v -> Int
size :: Diff k v -> Int
applyDiff :: Ord k => Map k v -> Diff k v -> Map k v
applyDiffForKeys :: Ord k => Map k v -> Set k -> Diff k v -> Map k v
foldMapDelta :: Monoid m => (Delta v -> m) -> Diff k v -> m
traverseDeltaWithKey_ :: Applicative t => (k -> Delta v -> t a) -> Diff k v -> t ()
filterOnlyKey :: (k -> Bool) -> Diff k v -> Diff k v

Types

data Delta v Source #

A change to a value in a key-value store.

Constructors

Insert !v
Delete

Instances

Instances details

Foldable Delta Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods fold :: Monoid m => Delta m -> m # foldMap :: Monoid m => (a -> m) -> Delta a -> m # foldMap' :: Monoid m => (a -> m) -> Delta a -> m # foldr :: (a -> b -> b) -> b -> Delta a -> b # foldr' :: (a -> b -> b) -> b -> Delta a -> b # foldl :: (b -> a -> b) -> b -> Delta a -> b # foldl' :: (b -> a -> b) -> b -> Delta a -> b # foldr1 :: (a -> a -> a) -> Delta a -> a # foldl1 :: (a -> a -> a) -> Delta a -> a # toList :: Delta a -> [a] # null :: Delta a -> Bool # length :: Delta a -> Int # elem :: Eq a => a -> Delta a -> Bool # maximum :: Ord a => Delta a -> a # minimum :: Ord a => Delta a -> a # sum :: Num a => Delta a -> a # product :: Num a => Delta a -> a #
Traversable Delta Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods traverse :: Applicative f => (a -> f b) -> Delta a -> f (Delta b) # sequenceA :: Applicative f => Delta (f a) -> f (Delta a) # mapM :: Monad m => (a -> m b) -> Delta a -> m (Delta b) # sequence :: Monad m => Delta (m a) -> m (Delta a) #
Functor Delta Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods fmap :: (a -> b) -> Delta a -> Delta b # (<$) :: a -> Delta b -> Delta a #
Generic (Delta v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Associated Types type Rep (Delta v) :: Type -> Type # Methods from :: Delta v -> Rep (Delta v) x # to :: Rep (Delta v) x -> Delta v #
Show v => Show (Delta v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods showsPrec :: Int -> Delta v -> ShowS # show :: Delta v -> String # showList :: [Delta v] -> ShowS #
Eq v => Eq (Delta v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods (==) :: Delta v -> Delta v -> Bool # (/=) :: Delta v -> Delta v -> Bool #
NoThunks v => NoThunks (Delta v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods noThunks :: Context -> Delta v -> IO (Maybe ThunkInfo) # wNoThunks :: Context -> Delta v -> IO (Maybe ThunkInfo) # showTypeOf :: Proxy (Delta v) -> String #
type Rep (Delta v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal type Rep (Delta v) = D1 ('MetaData "Delta" "Data.Map.Diff.Strict.Internal" "diff-containers-1.3.0.0-inplace" 'False) (C1 ('MetaCons "Insert" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 v)) :+: C1 ('MetaCons "Delete" 'PrefixI 'False) (U1 :: Type -> Type))

data Diff k v Source #

A diff for key-value stores.

Instances

Instances details

Functor (Diff k) Source #	Custom `Functor` instance, since `Functor (Map k)` is actually the `Functor` instance for a lazy Map.
Instance details Defined in Data.Map.Diff.Strict.Internal Methods fmap :: (a -> b) -> Diff k a -> Diff k b # (<$) :: a -> Diff k b -> Diff k a #
Ord k => Monoid (Diff k v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods mempty :: Diff k v # mappend :: Diff k v -> Diff k v -> Diff k v # mconcat :: [Diff k v] -> Diff k v #
Ord k => Semigroup (Diff k v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods (<>) :: Diff k v -> Diff k v -> Diff k v # sconcat :: NonEmpty (Diff k v) -> Diff k v # stimes :: Integral b => b -> Diff k v -> Diff k v #
Generic (Diff k v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Associated Types type Rep (Diff k v) :: Type -> Type # Methods from :: Diff k v -> Rep (Diff k v) x # to :: Rep (Diff k v) x -> Diff k v #
(Show k, Show v) => Show (Diff k v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods showsPrec :: Int -> Diff k v -> ShowS # show :: Diff k v -> String # showList :: [Diff k v] -> ShowS #
(Eq k, Eq v) => Eq (Diff k v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods (==) :: Diff k v -> Diff k v -> Bool # (/=) :: Diff k v -> Diff k v -> Bool #
(Ord k, Eq v) => LeftCancellative (Diff k v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal
(Ord k, Eq v) => LeftReductive (Diff k v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods isPrefixOf :: Diff k v -> Diff k v -> Bool # stripPrefix :: Diff k v -> Diff k v -> Maybe (Diff k v) #
(Ord k, Eq v) => RightCancellative (Diff k v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal
(Ord k, Eq v) => RightReductive (Diff k v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods isSuffixOf :: Diff k v -> Diff k v -> Bool # stripSuffix :: Diff k v -> Diff k v -> Maybe (Diff k v) #
(NoThunks k, NoThunks v) => NoThunks (Diff k v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal Methods noThunks :: Context -> Diff k v -> IO (Maybe ThunkInfo) # wNoThunks :: Context -> Diff k v -> IO (Maybe ThunkInfo) # showTypeOf :: Proxy (Diff k v) -> String #
type Rep (Diff k v) Source #
Instance details Defined in Data.Map.Diff.Strict.Internal type Rep (Diff k v) = D1 ('MetaData "Diff" "Data.Map.Diff.Strict.Internal" "diff-containers-1.3.0.0-inplace" 'True) (C1 ('MetaCons "Diff" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map k (DeltaHistory v)))))