set-monad 0.2.0.0 → 0.3.0.0
raw patch · 2 files changed
+6/−4 lines, 2 filesdep ~basePVP ok
version bump matches the API change (PVP)
Dependency ranges changed: base
API changes (from Hackage documentation)
- Data.Set.Monad: instance [safe] (NFData a, Ord a) => NFData (Set a)
- Data.Set.Monad: instance [safe] (Read a, Ord a) => Read (Set a)
- Data.Set.Monad: instance [safe] (Show a, Ord a) => Show (Set a)
- Data.Set.Monad: instance [safe] Alternative Set
- Data.Set.Monad: instance [safe] Applicative Set
- Data.Set.Monad: instance [safe] Foldable Set
- Data.Set.Monad: instance [safe] Functor Set
- Data.Set.Monad: instance [safe] Monad Set
- Data.Set.Monad: instance [safe] MonadPlus Set
- Data.Set.Monad: instance [safe] Ord a => Eq (Set a)
- Data.Set.Monad: instance [safe] Ord a => Monoid (Set a)
- Data.Set.Monad: instance [safe] Ord a => Ord (Set a)
+ Data.Set.Monad: infixl 9 \\
+ Data.Set.Monad: instance (Control.DeepSeq.NFData a, GHC.Classes.Ord a) => Control.DeepSeq.NFData (Data.Set.Monad.Set a)
+ Data.Set.Monad: instance (GHC.Read.Read a, GHC.Classes.Ord a) => GHC.Read.Read (Data.Set.Monad.Set a)
+ Data.Set.Monad: instance (GHC.Show.Show a, GHC.Classes.Ord a) => GHC.Show.Show (Data.Set.Monad.Set a)
+ Data.Set.Monad: instance Data.Foldable.Foldable Data.Set.Monad.Set
+ Data.Set.Monad: instance GHC.Base.Alternative Data.Set.Monad.Set
+ Data.Set.Monad: instance GHC.Base.Applicative Data.Set.Monad.Set
+ Data.Set.Monad: instance GHC.Base.Functor Data.Set.Monad.Set
+ Data.Set.Monad: instance GHC.Base.Monad Data.Set.Monad.Set
+ Data.Set.Monad: instance GHC.Base.MonadPlus Data.Set.Monad.Set
+ Data.Set.Monad: instance GHC.Base.Semigroup (Data.Set.Monad.Set a)
+ Data.Set.Monad: instance GHC.Classes.Ord a => GHC.Base.Monoid (Data.Set.Monad.Set a)
+ Data.Set.Monad: instance GHC.Classes.Ord a => GHC.Classes.Eq (Data.Set.Monad.Set a)
+ Data.Set.Monad: instance GHC.Classes.Ord a => GHC.Classes.Ord (Data.Set.Monad.Set a)
- Data.Set.Monad: (\\) :: Ord a => Set a -> Set a -> Set a
+ Data.Set.Monad: (\\) :: (Ord a) => Set a -> Set a -> Set a
- Data.Set.Monad: delete :: Ord a => a -> Set a -> Set a
+ Data.Set.Monad: delete :: (Ord a) => a -> Set a -> Set a
- Data.Set.Monad: deleteFindMax :: Ord a => Set a -> (a, Set a)
+ Data.Set.Monad: deleteFindMax :: (Ord a) => Set a -> (a, Set a)
- Data.Set.Monad: deleteFindMin :: Ord a => Set a -> (a, Set a)
+ Data.Set.Monad: deleteFindMin :: (Ord a) => Set a -> (a, Set a)
- Data.Set.Monad: deleteMax :: Ord a => Set a -> Set a
+ Data.Set.Monad: deleteMax :: (Ord a) => Set a -> Set a
- Data.Set.Monad: deleteMin :: Ord a => Set a -> Set a
+ Data.Set.Monad: deleteMin :: (Ord a) => Set a -> Set a
- Data.Set.Monad: difference :: Ord a => Set a -> Set a -> Set a
+ Data.Set.Monad: difference :: (Ord a) => Set a -> Set a -> Set a
- Data.Set.Monad: elems :: Ord a => Set a -> [a]
+ Data.Set.Monad: elems :: (Ord a) => Set a -> [a]
- Data.Set.Monad: empty :: Ord a => Set a
+ Data.Set.Monad: empty :: (Ord a) => Set a
- Data.Set.Monad: filter :: Ord a => (a -> Bool) -> Set a -> Set a
+ Data.Set.Monad: filter :: (Ord a) => (a -> Bool) -> Set a -> Set a
- Data.Set.Monad: findMax :: Ord a => Set a -> a
+ Data.Set.Monad: findMax :: (Ord a) => Set a -> a
- Data.Set.Monad: findMin :: Ord a => Set a -> a
+ Data.Set.Monad: findMin :: (Ord a) => Set a -> a
- Data.Set.Monad: fold :: Ord a => (a -> b -> b) -> b -> Set a -> b
+ Data.Set.Monad: fold :: (Ord a) => (a -> b -> b) -> b -> Set a -> b
- Data.Set.Monad: foldl :: Ord a => (b -> a -> b) -> b -> Set a -> b
+ Data.Set.Monad: foldl :: (Ord a) => (b -> a -> b) -> b -> Set a -> b
- Data.Set.Monad: foldl' :: Ord a => (b -> a -> b) -> b -> Set a -> b
+ Data.Set.Monad: foldl' :: (Ord a) => (b -> a -> b) -> b -> Set a -> b
- Data.Set.Monad: foldr :: Ord a => (a -> b -> b) -> b -> Set a -> b
+ Data.Set.Monad: foldr :: (Ord a) => (a -> b -> b) -> b -> Set a -> b
- Data.Set.Monad: foldr' :: Ord a => (a -> b -> b) -> b -> Set a -> b
+ Data.Set.Monad: foldr' :: (Ord a) => (a -> b -> b) -> b -> Set a -> b
- Data.Set.Monad: fromAscList :: Ord a => [a] -> Set a
+ Data.Set.Monad: fromAscList :: (Ord a) => [a] -> Set a
- Data.Set.Monad: fromDistinctAscList :: Ord a => [a] -> Set a
+ Data.Set.Monad: fromDistinctAscList :: (Ord a) => [a] -> Set a
- Data.Set.Monad: fromList :: Ord a => [a] -> Set a
+ Data.Set.Monad: fromList :: (Ord a) => [a] -> Set a
- Data.Set.Monad: insert :: Ord a => a -> Set a -> Set a
+ Data.Set.Monad: insert :: (Ord a) => a -> Set a -> Set a
- Data.Set.Monad: intersection :: Ord a => Set a -> Set a -> Set a
+ Data.Set.Monad: intersection :: (Ord a) => Set a -> Set a -> Set a
- Data.Set.Monad: maxView :: Ord a => Set a -> Maybe (a, Set a)
+ Data.Set.Monad: maxView :: (Ord a) => Set a -> Maybe (a, Set a)
- Data.Set.Monad: member :: Ord a => a -> Set a -> Bool
+ Data.Set.Monad: member :: (Ord a) => a -> Set a -> Bool
- Data.Set.Monad: minView :: Ord a => Set a -> Maybe (a, Set a)
+ Data.Set.Monad: minView :: (Ord a) => Set a -> Maybe (a, Set a)
- Data.Set.Monad: notMember :: Ord a => a -> Set a -> Bool
+ Data.Set.Monad: notMember :: (Ord a) => a -> Set a -> Bool
- Data.Set.Monad: null :: Ord a => Set a -> Bool
+ Data.Set.Monad: null :: (Ord a) => Set a -> Bool
- Data.Set.Monad: partition :: Ord a => (a -> Bool) -> Set a -> (Set a, Set a)
+ Data.Set.Monad: partition :: (Ord a) => (a -> Bool) -> Set a -> (Set a, Set a)
- Data.Set.Monad: singleton :: Ord a => a -> Set a
+ Data.Set.Monad: singleton :: (Ord a) => a -> Set a
- Data.Set.Monad: size :: Ord a => Set a -> Int
+ Data.Set.Monad: size :: (Ord a) => Set a -> Int
- Data.Set.Monad: split :: Ord a => a -> Set a -> (Set a, Set a)
+ Data.Set.Monad: split :: (Ord a) => a -> Set a -> (Set a, Set a)
- Data.Set.Monad: splitMember :: Ord a => a -> Set a -> (Set a, Bool, Set a)
+ Data.Set.Monad: splitMember :: (Ord a) => a -> Set a -> (Set a, Bool, Set a)
- Data.Set.Monad: toAscList :: Ord a => Set a -> [a]
+ Data.Set.Monad: toAscList :: (Ord a) => Set a -> [a]
- Data.Set.Monad: toList :: Ord a => Set a -> [a]
+ Data.Set.Monad: toList :: (Ord a) => Set a -> [a]
- Data.Set.Monad: union :: Ord a => Set a -> Set a -> Set a
+ Data.Set.Monad: union :: (Ord a) => Set a -> Set a -> Set a
- Data.Set.Monad: unions :: Ord a => [Set a] -> Set a
+ Data.Set.Monad: unions :: (Ord a) => [Set a] -> Set a
- Data.Set.Monad: valid :: Ord a => Set a -> Bool
+ Data.Set.Monad: valid :: (Ord a) => Set a -> Bool
Files
- Data/Set/Monad.hs +4/−2
- set-monad.cabal +2/−2
Data/Set/Monad.hs view
@@ -158,7 +158,6 @@ import qualified Control.Applicative as A import qualified Data.Foldable as Foldable -import Data.Monoid import Data.Foldable (Foldable) import Control.Arrow import Control.Monad@@ -208,13 +207,16 @@ mzero = Zero mplus = Plus +instance Semigroup (Set a) where+ (<>) = Plus+ instance (Ord a) => Monoid (Set a) where mempty = empty mappend = union mconcat = unions instance Foldable Set where- foldr f def m = + foldr f def m = case m of Prim s -> S.foldr f def s Return a -> f a def
set-monad.cabal view
@@ -1,5 +1,5 @@ name: set-monad-version: 0.2.0.0+version: 0.3.0.0 synopsis: Set monad description: The @set-monad@ library exports the @Set@ abstract data type and@@ -88,5 +88,5 @@ library exposed-modules: Data.Set.Monad- build-depends: base >=4 && <5, deepseq, containers+ build-depends: base >=4.9 && < 5, deepseq, containers ghc-options: -O3 -Wall