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.
dmapToMap :: DMap (Const2 k v) Identity -> Map k vpatch Data.Functor.Misc dmapToThese :: DMap (EitherTag a b) Identity -> Maybe (These a b)patch Data.Functor.Misc newtype
PatchDMap (k1 :: k -> Type) (v :: k -> Type)patch Data.Patch A set of changes to a DMap. Any element may be inserted/updated or deleted. Insertions are represented as ComposeMaybe (Just value), while deletions are represented as ComposeMaybe Nothing.
PatchDMap :: DMap k1 (ComposeMaybe v) -> PatchDMap (k1 :: k -> Type) (v :: k -> Type)patch Data.Patch No documentation available.
data
PatchDMapWithMove (k1 :: k -> Type) (v :: k -> Type)patch Data.Patch 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))
-
patch Data.Patch 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 No documentation available.
-
patch Data.Patch Patch a Map with additions, deletions, and moves. Invariant: If key k1 is coming from From_Move k2, then key k2 should be going to Just k1, and vice versa. There should never be any unpaired From/To keys.
patchIntMapNewElements :: PatchIntMap a -> [a]patch Data.Patch Extract all as inserted/updated by the given PatchIntMap a.
patchIntMapNewElementsMap :: PatchIntMap a -> IntMap apatch Data.Patch Convert the given PatchIntMap a into an IntMap a with all the inserts/updates in the given patch.