Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. patchMapWithMoveNewElements :: PatchMapWithMove k v -> [v]

   patch	Data.Patch.MapWithMove

   Returns all the new elements that will be added to the Map.

2. patchMapWithMoveNewElementsMap :: PatchMapWithMove k v -> Map k v

   patch	Data.Patch.MapWithMove

   Return a Map k v with all the inserts/updates from the given PatchMapWithMove k v.

3. patchThatChangesAndSortsMapWith :: (Ord k, Ord v) => (v -> v -> Ordering) -> Map k v -> Map k v -> PatchMapWithMove k v

   patch	Data.Patch.MapWithMove

   Create a PatchMapWithMove that, if applied to the first Map provided, will produce a Map with the same values as the second Map but with the values sorted with the given ordering function.

4. patchThatChangesMap :: (Ord k, Ord v) => Map k v -> Map k v -> PatchMapWithMove k v

   patch	Data.Patch.MapWithMove

   Create a PatchMapWithMove that, if applied to the first Map provided, will produce the second Map.

5. patchThatSortsMapWith :: Ord k => (v -> v -> Ordering) -> Map k v -> PatchMapWithMove k v

   patch	Data.Patch.MapWithMove

   Create a PatchMapWithMove that, if applied to the given Map, will sort its values using the given ordering function. The set keys of the Map is not changed.

6. swapMapKey :: Ord k => k -> k -> PatchMapWithMove k v

   patch	Data.Patch.MapWithMove

   Make a PatchMapWithMove k v which has the effect of swapping two keys in the mapping, equivalent to:

   let aMay = Map.lookup a map
   bMay = Map.lookup b map
   in maybe id (Map.insert a) (bMay <> aMay)
   . maybe id (Map.insert b) (aMay <> bMay)
   . Map.delete a . Map.delete b $ map
   

7. unPatchMapWithMove' :: PatchMapWithMove k v -> PatchMapWithPatchingMove k (Proxy v)

   patch	Data.Patch.MapWithMove

   Extract the underlying 'PatchMapWithPatchingMove k (Proxy v)'

8. unsafePatchMapWithMove :: Map k (NodeInfo k v) -> PatchMapWithMove k v

   patch	Data.Patch.MapWithMove

   Wrap a Map k (NodeInfo k v) representing patch changes into a PatchMapWithMove k v, without checking any invariants. Warning: when using this function, you must ensure that the invariants of PatchMapWithMove are preserved; they will not be checked.

9. newtype PatchMapWithPatchingMove k p

   patch	Data.Patch.MapWithPatchingMove

   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.

10. PatchMapWithPatchingMove :: Map k (NodeInfo k p) -> PatchMapWithPatchingMove k p

    patch	Data.Patch.MapWithPatchingMove

    No documentation available.

Page 965 of many | Previous | Next