Remove redundant constraints

ChangeLog.md

@@ -1,5 +1,9 @@
 # Changelog for multi-containers
 
+## 0.1.0.2
+
+- Remove redundant constraints
+
 ## 0.1.0.1
 
 - Update README

multi-containers.cabal

@@ -2,10 +2,10 @@
 --
 -- see: https://github.com/sol/hpack
 --
--- hash: 9da8e5d6bcf046772035130681fc079404a33a3d4d63ac224b441b08ce7e0284
+-- hash: 5c8d0a2541fa360ef1903f422222c873e84c5ea3b0fd709475a4ee54c843bbf8
 
 name:           multi-containers
-version:        0.1.0.1
+version:        0.1.0.2
 synopsis:       A few multimap variants.
 description:    A library that provides a few multimap variants.
 category:       Data Structures

package.yaml

@@ -1,5 +1,5 @@
 name:                multi-containers
-version:             0.1.0.1
+version:             0.1.0.2
 github:              "zliu41/multi-containers"
 license:             BSD3
 author:              "Ziyang Liu <free@cofree.io>"

src/Data/Multimap/Set.hs

@@ -266,15 +266,15 @@ deleteWithValue k a = alter (Set.delete a) k
 --
 -- > deleteMax 3 (fromList [(1,'a'),(1,'b'),(2,'c')]) === fromList [(1,'a'),(1,'b'),(2,'c')]
 -- > deleteMax 1 (fromList [(1,'a'),(1,'b'),(2,'c')]) === fromList [(1,'a'),(2,'c')]
-deleteMax :: (Ord k, Ord a) => k -> SetMultimap k a -> SetMultimap k a
+deleteMax :: Ord k => k -> SetMultimap k a -> SetMultimap k a
 deleteMax = alter Set.deleteMax
 
 -- | /O(log m * log k)/. Remove the minimal value
 -- associated with the key, if exists.
 --
 -- > deleteMin 3 (fromList [(1,'a'),(1,'b'),(2,'c')]) === fromList [(1,'a'),(1,'b'),(2,'c')]
 -- > deleteMin 1 (fromList [(1,'a'),(1,'b'),(2,'c')]) === fromList [(1,'b'),(2,'c')]
-deleteMin :: (Ord k, Ord a) => k -> SetMultimap k a -> SetMultimap k a
+deleteMin :: Ord k => k -> SetMultimap k a -> SetMultimap k a
 deleteMin = alter Set.deleteMin
 
 -- | /O(m * log m * log k)/, assuming the function @a -> a@ takes /O(1)/.