github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-25 16:02:43 +03:00
Code Issues Projects Releases Wiki Activity

Compute the key/value pair for deleted elements.

Browse Source
This commit is contained in:
Rob Rix 2015-12-14 19:05:57 -05:00
parent 8249f7492c
commit 0d95b54f0f
1 changed files with 5 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/Interpreter.hs
View File

@ -13,6 +13,7 @@ import Control.Comonad.Cofree hiding (unwrap)
import qualified OrderedMap as Map
import OrderedMap ((!))
import Data.Maybe
import qualified Data.Set as Set
hylo :: Functor f => (t -> f b -> b) -> (a -> (t, f a)) -> a -> b
hylo down up a = down annotation $ hylo down up <$> syntax where
@ -55,6 +56,10 @@ run comparable (Free (ByKey a b f)) = run comparable $ f byKey where
deleted = (Pure . Delete) <$> Map.difference a b
inserted = (Pure . Insert) <$> Map.difference b a
patched = Map.intersectionWith (interpret comparable) a b
toKeyValue key | Set.member key deleted = (key, Pure $ Delete (a ! key))
aKeys = Set.fromList $ Map.keys a
bKeys = Set.fromList $ Map.keys b
deleted = Set.difference aKeys bKeys
run comparable (Free (ByIndex a b f)) = run comparable . f $ ses (constructAndRun comparable) diffCost a b