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.

Exact lookup

1. patchMapKey :: DecidablyEmpty p => k -> p -> PatchMapWithPatchingMove k p

   patch	Data.Patch.MapWithPatchingMove

   No documentation available.

2. patchMapWithPatchingMove :: Ord k => Map k (NodeInfo k p) -> Maybe (PatchMapWithPatchingMove k p)

   patch	Data.Patch.MapWithPatchingMove

   Create a PatchMapWithPatchingMove, validating it

3. patchMapWithPatchingMoveInsertAll :: Map k (PatchTarget p) -> PatchMapWithPatchingMove k p

   patch	Data.Patch.MapWithPatchingMove

   Create a PatchMapWithPatchingMove that inserts everything in the given Map

4. patchMapWithPatchingMoveNewElements :: PatchMapWithPatchingMove k p -> [PatchTarget p]

   patch	Data.Patch.MapWithPatchingMove

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

5. patchMapWithPatchingMoveNewElementsMap :: PatchMapWithPatchingMove k p -> Map k (PatchTarget p)

   patch	Data.Patch.MapWithPatchingMove

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

6. patchThatChangesAndSortsMapWith :: (Ord k, Ord (PatchTarget p), Monoid p) => (PatchTarget p -> PatchTarget p -> Ordering) -> Map k (PatchTarget p) -> Map k (PatchTarget p) -> PatchMapWithPatchingMove k p

   patch	Data.Patch.MapWithPatchingMove

   Create a PatchMapWithPatchingMove 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.

7. patchThatChangesMap :: (Ord k, Ord (PatchTarget p), Monoid p) => Map k (PatchTarget p) -> Map k (PatchTarget p) -> PatchMapWithPatchingMove k p

   patch	Data.Patch.MapWithPatchingMove

   Create a PatchMapWithPatchingMove that, if applied to the first Map provided, will produce the second Map. Note: this will never produce a patch on a value.

8. patchThatSortsMapWith :: (Ord k, Monoid p) => (PatchTarget p -> PatchTarget p -> Ordering) -> Map k (PatchTarget p) -> PatchMapWithPatchingMove k p

   patch	Data.Patch.MapWithPatchingMove

   Create a PatchMapWithPatchingMove 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.

9. swapMapKey :: (DecidablyEmpty p, Patch p, Ord k) => k -> k -> PatchMapWithPatchingMove k p

   patch	Data.Patch.MapWithPatchingMove

   Make a PatchMapWithPatchingMove k p 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
   

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

    patch	Data.Patch.MapWithPatchingMove

    Extract the internal representation of the PatchMapWithPatchingMove

Page 965 of many | Previous | Next