@@ -28,7 +28,7 @@ import Data.Dependent.Sum (DSum (..))
28
28
import qualified Data.Dependent.Map as DMap
29
29
import Data.Functor.Constant (Constant (.. ))
30
30
import Data.Functor.Misc
31
- ( Const2 (.. ), Proxy3 ( .. )
31
+ ( Const2 (.. )
32
32
, weakenDMapWith
33
33
, dmapToMapWith
34
34
)
@@ -53,6 +53,7 @@ import Data.Patch.Class
53
53
( Patch (.. ), PatchHet (.. )
54
54
, PatchHet2 (.. ), PatchSource1 , PatchTarget1
55
55
, applyAlwaysHet2
56
+ , IndexedEq (.. )
56
57
)
57
58
import Data.Patch.MapWithPatchingMove (PatchMapWithPatchingMove (.. ))
58
59
import qualified Data.Patch.MapWithPatchingMove as MapWithPatchingMove
@@ -359,10 +360,10 @@ insertDMapKey k v =
359
360
-- @
360
361
moveDMapKey
361
362
:: GCompare k
362
- => k a -> k a -> PatchDMapWithPatchingMove k (Proxy3 v )
363
+ => k a -> k a -> PatchDMapWithPatchingMove k (IndexedEq v )
363
364
moveDMapKey src dst = case src `geq` dst of
364
365
Nothing -> PatchDMapWithPatchingMove $ DMap. fromList
365
- [ dst :=> NodeInfo (From_Move (src :=> Flip Proxy3 )) To_NonMove
366
+ [ dst :=> NodeInfo (From_Move (src :=> Flip IndexedRefl )) To_NonMove
366
367
, src :=> NodeInfo From_Delete (To_Move $ Some dst)
367
368
]
368
369
Just _ -> PatchDMapWithPatchingMove DMap. empty
@@ -377,11 +378,11 @@ moveDMapKey src dst = case src `geq` dst of
377
378
-- . maybe id (DMap.insert b) (aMay <> bMay)
378
379
-- . DMap.delete a . DMap.delete b $ dmap
379
380
-- @
380
- swapDMapKey :: GCompare k => k a -> k a -> PatchDMapWithPatchingMove k (Proxy3 v )
381
+ swapDMapKey :: GCompare k => k a -> k a -> PatchDMapWithPatchingMove k (IndexedEq v )
381
382
swapDMapKey src dst = case src `geq` dst of
382
383
Nothing -> PatchDMapWithPatchingMove $ DMap. fromList
383
- [ dst :=> NodeInfo (From_Move (src :=> Flip Proxy3 )) (To_Move $ Some src)
384
- , src :=> NodeInfo (From_Move (dst :=> Flip Proxy3 )) (To_Move $ Some dst)
384
+ [ dst :=> NodeInfo (From_Move (src :=> Flip IndexedRefl )) (To_Move $ Some src)
385
+ , src :=> NodeInfo (From_Move (dst :=> Flip IndexedRefl )) (To_Move $ Some dst)
385
386
]
386
387
Just _ -> PatchDMapWithPatchingMove DMap. empty
387
388
@@ -566,16 +567,16 @@ const2PatchDMapWithPatchingMoveWith
566
567
:: forall k v v' a
567
568
. (v -> v' a )
568
569
-> PatchMapWithPatchingMove k (Proxy v )
569
- -> PatchDMapWithPatchingMove (Const2 k a ) (Proxy3 v' )
570
+ -> PatchDMapWithPatchingMove (Const2 k a ) (IndexedEq v' )
570
571
const2PatchDMapWithPatchingMoveWith f (PatchMapWithPatchingMove p) =
571
572
PatchDMapWithPatchingMove $ DMap. fromDistinctAscList $ g <$> Map. toAscList p
572
573
where g :: (k , MapWithPatchingMove. NodeInfo k (Proxy v ))
573
- -> DSum (Const2 k a) (NodeInfo (Const2 k a) (Proxy3 v'))
574
+ -> DSum (Const2 k a) (NodeInfo (Const2 k a) (IndexedEq v'))
574
575
g (k, ni) = Const2 k :=> NodeInfo
575
576
{ _nodeInfo_from = case MapWithPatchingMove. _nodeInfo_from ni of
576
577
MapWithPatchingMove. From_Insert v -> From_Insert $ f v
577
578
MapWithPatchingMove. From_Delete -> From_Delete
578
- MapWithPatchingMove. From_Move fromKey Proxy -> From_Move $ Const2 fromKey :=> Flip Proxy3
579
+ MapWithPatchingMove. From_Move fromKey Proxy -> From_Move $ Const2 fromKey :=> Flip IndexedRefl
579
580
, _nodeInfo_to = case MapWithPatchingMove. _nodeInfo_to ni of
580
581
Nothing -> To_NonMove
581
582
Just toKey -> To_Move $ Some (Const2 toKey)
0 commit comments