@@ -100,7 +100,7 @@ type To k = PM.To k
101traverseNodeInfo
101traverseNodeInfo
102 :: Traversal (NodeInfo k a) (NodeInfo k b) a b
102 :: Traversal (NodeInfo k a) (NodeInfo k b) a b
103−traverseNodeInfo = PM.bitraverseNodeInfo pure (\(~Proxy) -> pure Proxy)
103+traverseNodeInfo = PM.bitraverseNodeInfo pure (\ ~Proxy -> pure Proxy)
105-- | Create a 'PatchMapWithMove', validating it
105-- | Create a 'PatchMapWithMove', validating it
106patchMapWithMove :: Ord k => Map k (NodeInfo k v) -> Maybe (PatchMapWithMove k v)
106patchMapWithMove :: Ord k => Map k (NodeInfo k v) -> Maybe (PatchMapWithMove k v)
@@ -147,7 +147,7 @@ unsafePatchMapWithMove = PatchMapWithMove' . PM.unsafePatchMapWithPatchingMove
147-- | Apply the insertions, deletions, and moves to a given 'Map'
147-- | Apply the insertions, deletions, and moves to a given 'Map'
148instance Ord k => Patch (PatchMapWithMove k v) where
148instance Ord k => Patch (PatchMapWithMove k v) where
149 type PatchTarget (PatchMapWithMove k v) = Map k v
149 type PatchTarget (PatchMapWithMove k v) = Map k v
150− apply (PatchMapWithMove' p) old = apply p old
150+ apply (PatchMapWithMove' p) = apply p
152-- | Returns all the new elements that will be added to the 'Map'.
152-- | Returns all the new elements that will be added to the 'Map'.
153patchMapWithMoveNewElements :: PatchMapWithMove k v -> [v]
153patchMapWithMoveNewElements :: PatchMapWithMove k v -> [v]