Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
module Data.Patch.
DMapWithMove This Module contains PatchDMapWithMove k v and associated functions, which represents a Patch to a DMap k v which can insert, update, delete, and move values between keys.
newtype
PatchDMapWithMove (k1 :: k -> Type) (v :: k -> Type)patch Data.Patch.DMapWithMove Like PatchMapWithMove, but for DMap. Each key carries a NodeInfo which describes how it will be changed by the patch and connects move sources and destinations. Invariants:
- A key should not move to itself.
- A move should always be represented with both the destination key (as a From_Move) and the source key (as a ComposeMaybe (Just destination))
PatchDMapWithMove :: DMap k1 (NodeInfo k1 v) -> PatchDMapWithMove (k1 :: k -> Type) (v :: k -> Type)patch Data.Patch.DMapWithMove No documentation available.
-
Patches of this sort allow for insert/update or delete of associations.
-
patch Data.Patch.IntMap Patch for IntMap which represents insertion or deletion of keys in the mapping. Internally represented by 'IntMap (Maybe a)', where Just means insert/update and Nothing means delete.
PatchIntMap :: IntMap (Maybe a) -> PatchIntMap apatch Data.Patch.IntMap No documentation available.
patchIntMapNewElements :: PatchIntMap a -> [a]patch Data.Patch.IntMap Extract all as inserted/updated by the given PatchIntMap a.
patchIntMapNewElementsMap :: PatchIntMap a -> IntMap apatch Data.Patch.IntMap Convert the given PatchIntMap a into an IntMap a with all the inserts/updates in the given patch.
-
patch Data.Patch.IntMap Map an effectful function Int -> a -> f b over all as in the given PatchIntMap a (that is, all inserts/updates), producing a f (PatchIntMap b).
unPatchIntMap :: PatchIntMap a -> IntMap (Maybe a)patch Data.Patch.IntMap No documentation available.