@@ -1,15 +1,10 @@
11{-# LANGUAGE CPP #-}
2−{-# LANGUAGE DeriveFunctor #-}
3−{-# LANGUAGE DeriveGeneric #-}
4−{-# LANGUAGE DeriveTraversable #-}
52{-# LANGUAGE FlexibleContexts #-}
63{-# LANGUAGE FlexibleInstances #-}
7−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
84{-# LANGUAGE MultiParamTypeClasses #-}
95{-# LANGUAGE PatternSynonyms #-}
106{-# LANGUAGE RoleAnnotations #-}
117{-# LANGUAGE ScopedTypeVariables #-}
12−{-# LANGUAGE StandaloneDeriving #-}
138{-# LANGUAGE TypeFamilies #-}
149{-# OPTIONS_GHC -fno-warn-orphans #-}
1510-- | 'Data.Map' with a better 'Monoid' instance
@@ -33,7 +28,6 @@ import qualified Data.Map as Map (showTree, showTreeWith)
3328#endif
3429import Data.Map.Monoidal
3530import Reflex.Class (FunctorMaybe (..))
36−import Reflex.Patch (Additive, Group (..))
3731
3832{-# DEPRECATED AppendMap "Use 'MonoidalMap' instead" #-}
3933type AppendMap = MonoidalMap
@@ -66,11 +60,6 @@ mapMaybeNoNull f as =
6660 else Just bs
6761
6862-- TODO: Move instances to `Reflex.Patch`
69−instance (Ord k, Group q) => Group (MonoidalMap k q) where
70− negateG = map negateG
71−
72−instance (Ord k, Additive q) => Additive (MonoidalMap k q)
73−
7463showTree :: forall k a. (Show k, Show a) => MonoidalMap k a -> String
7564showTree = coerce (Map.showTree :: Map k a -> String)
7665