pomaps 0.0.2.0 → 0.0.2.1
raw patch · 4 files changed
+13/−13 lines, 4 filesdep ~basedep ~latticesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base, lattices
API changes (from Hackage documentation)
- Algebra.PartialOrd: class Eq a => PartialOrd a
- Algebra.PartialOrd: comparable :: PartialOrd a => a -> a -> Bool
- Algebra.PartialOrd: gfpFrom :: PartialOrd a => a -> (a -> a) -> a
- Algebra.PartialOrd: instance (Algebra.PartialOrd.PartialOrd a, Algebra.PartialOrd.PartialOrd b) => Algebra.PartialOrd.PartialOrd (a, b)
- Algebra.PartialOrd: instance (GHC.Classes.Ord k, Algebra.PartialOrd.PartialOrd v) => Algebra.PartialOrd.PartialOrd (Data.Map.Internal.Map k v)
- Algebra.PartialOrd: instance Algebra.PartialOrd.PartialOrd ()
- Algebra.PartialOrd: instance Algebra.PartialOrd.PartialOrd Data.IntSet.Internal.IntSet
- Algebra.PartialOrd: instance Algebra.PartialOrd.PartialOrd Data.Void.Void
- Algebra.PartialOrd: instance Algebra.PartialOrd.PartialOrd v => Algebra.PartialOrd.PartialOrd (Data.IntMap.Internal.IntMap v)
- Algebra.PartialOrd: instance GHC.Classes.Ord a => Algebra.PartialOrd.PartialOrd (Data.Set.Internal.Set a)
- Algebra.PartialOrd: leq :: PartialOrd a => a -> a -> Bool
- Algebra.PartialOrd: lfpFrom :: PartialOrd a => a -> (a -> a) -> a
- Algebra.PartialOrd: partialOrdEq :: PartialOrd a => a -> a -> Bool
- Algebra.PartialOrd: unsafeGfpFrom :: Eq a => a -> (a -> a) -> a
- Algebra.PartialOrd: unsafeLfpFrom :: Eq a => a -> (a -> a) -> a
- Data.POMap.Internal: isProperSubmapOfBy :: (PartialOrd k) => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
+ Data.POMap.Internal: isProperSubmapOfBy :: PartialOrd k => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
- Data.POMap.Internal: isSubmapOfBy :: (PartialOrd k) => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
+ Data.POMap.Internal: isSubmapOfBy :: PartialOrd k => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
- Data.POMap.Lazy: isProperSubmapOfBy :: (PartialOrd k) => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
+ Data.POMap.Lazy: isProperSubmapOfBy :: PartialOrd k => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
- Data.POMap.Lazy: isSubmapOfBy :: (PartialOrd k) => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
+ Data.POMap.Lazy: isSubmapOfBy :: PartialOrd k => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
- Data.POMap.Strict: isProperSubmapOfBy :: (PartialOrd k) => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
+ Data.POMap.Strict: isProperSubmapOfBy :: PartialOrd k => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
- Data.POMap.Strict: isSubmapOfBy :: (PartialOrd k) => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
+ Data.POMap.Strict: isSubmapOfBy :: PartialOrd k => (a -> b -> Bool) -> POMap k a -> POMap k b -> Bool
- Data.POSet: delete :: (PartialOrd k) => k -> POSet k -> POSet k
+ Data.POSet: delete :: PartialOrd k => k -> POSet k -> POSet k
- Data.POSet: foldl :: Foldable t => b -> a -> b -> b -> t a -> b
+ Data.POSet: foldl :: Foldable t => (b -> a -> b) -> b -> t a -> b
- Data.POSet: foldr :: Foldable t => a -> b -> b -> b -> t a -> b
+ Data.POSet: foldr :: Foldable t => (a -> b -> b) -> b -> t a -> b
- Data.POSet: fromList :: (PartialOrd k) => [k] -> POSet k
+ Data.POSet: fromList :: PartialOrd k => [k] -> POSet k
- Data.POSet: insert :: (PartialOrd k) => k -> POSet k -> POSet k
+ Data.POSet: insert :: PartialOrd k => k -> POSet k -> POSet k
- Data.POSet.Internal: POSet :: (POMap k ()) -> POSet k
+ Data.POSet.Internal: POSet :: POMap k () -> POSet k
- Data.POSet.Internal: delete :: (PartialOrd k) => k -> POSet k -> POSet k
+ Data.POSet.Internal: delete :: PartialOrd k => k -> POSet k -> POSet k
- Data.POSet.Internal: fromList :: (PartialOrd k) => [k] -> POSet k
+ Data.POSet.Internal: fromList :: PartialOrd k => [k] -> POSet k
- Data.POSet.Internal: insert :: (PartialOrd k) => k -> POSet k -> POSet k
+ Data.POSet.Internal: insert :: PartialOrd k => k -> POSet k -> POSet k
Files
- pomaps.cabal +9/−9
- src/Data/POMap/Internal.hs +0/−1
- stack.yaml +3/−2
- tests/Data/POMap/Strictness.hs +1/−1
pomaps.cabal view
@@ -1,5 +1,5 @@ name: pomaps-version: 0.0.2.0+version: 0.0.2.1 synopsis: Maps and sets of partial orders category: Data Structures homepage: https://github.com/sgraf812/pomaps#readme@@ -36,19 +36,19 @@ src ghc-options: -Wall build-depends:- base >= 4.6.0.0 && < 4.12+ base >= 4.6.0.0 && < 4.13 -- oneShot , ghc-prim >= 0.4 && < 0.6 , deepseq >= 1.1 && < 1.5- -- We depend on the internal modules of containers, + -- We depend on the internal modules of containers, -- so we have to track development really close. -- Data.Map.Internal is only available since 0.5.9, -- of which 0.5.9.2 is the first safe version , containers >= 0.5.9.2 && <= 0.6.0.1 if !flag(no-lattices)- build-depends: + build-depends: -- We need PartialOrd instances for ()- lattices >= 1.7 && < 2+ lattices >= 1.7 exposed-modules: Data.POMap.Internal Data.POMap.Lazy@@ -77,7 +77,7 @@ , tasty-quickcheck , ChasingBottoms if !flag(no-lattices)- build-depends: + build-depends: lattices < 2 other-modules: Data.POMap.Arbitrary@@ -89,10 +89,10 @@ test-suite doctests type: exitcode-stdio-1.0 main-is: doctest-driver.hs- hs-source-dirs: + hs-source-dirs: tests ghc-options: -threaded- build-depends: + build-depends: base >4 && <5 , doctest , Glob@@ -112,7 +112,7 @@ , random , vector if !flag(no-lattices)- build-depends: + build-depends: lattices < 2 default-language: Haskell2010
src/Data/POMap/Internal.hs view
@@ -2,7 +2,6 @@ {-# LANGUAGE DataKinds #-} {-# LANGUAGE DeriveFunctor #-} {-# LANGUAGE GADTs #-}-{-# LANGUAGE KindSignatures #-} {-# LANGUAGE LambdaCase #-} {-# LANGUAGE MagicHash #-} {-# LANGUAGE MonadComprehensions #-}
stack.yaml view
@@ -15,7 +15,7 @@ # resolver: # name: custom-snapshot # location: "./custom-snapshot.yaml" -resolver: lts-12.7 +resolver: lts-13.18 # User packages to be built. # Various formats can be used as shown in the example below. @@ -39,7 +39,8 @@ - '.' # Dependency packages to be pulled from upstream that are not in the resolver # (e.g., acme-missiles-0.3) -extra-deps: [] +extra-deps: +- ChasingBottoms-1.3.1.5 # Extra package databases containing global packages extra-package-dbs: []
tests/Data/POMap/Strictness.hs view
@@ -162,7 +162,7 @@ describe "Functor" $ do describe "fmap" $ it "always lazy" $ property $ \(m :: DivMap Int) ->- shouldNotBeBottom (const bottom <$> m)+ shouldNotBeBottom (bottom <$ m) describe "<$" $ it "always lazy" $ property $ \(m :: DivMap Int) -> shouldNotBeBottom (bottom <$ m)