multi-containers 0.1.0.1 → 0.1.0.2

raw patch · 3 files changed

+8/−4 lines, 3 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

Files

• ChangeLog.md +4/−0
• multi-containers.cabal +2/−2
• src/Data/Multimap/Set.hs +2/−2

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

@@ -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

@@ -266,7 +266,7 @@ -- -- > 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@@ -274,7 +274,7 @@ -- -- > 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)/.