packages feed

partialord 0.0.2 → 0.0.3

raw patch · 3 files changed

+5/−11 lines, 3 filesdep ~containersPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: containers

API changes (from Hackage documentation)

- Data.PartialOrd: fromCompare :: Ord a => a -> a -> PartialOrdering

Files

README.md view
@@ -9,7 +9,6 @@   [partial-order](https://hackage.haskell.org/package/partial-order). Differences include: * PartialOrd has a comparison valued in Maybe Ordering; we use a fresh-  type with four constructors.+  type. * Where types have several natural partial orderings, we provide   newtypes rather than choosing one.-* We pay slightly more attention to algorithmic complexity.
partialord.cabal view
@@ -1,11 +1,11 @@ cabal-version: 2.2 --- This file has been generated from package.yaml by hpack version 0.36.0.+-- This file has been generated from package.yaml by hpack version 0.37.0. -- -- see: https://github.com/sol/hpack  name:           partialord-version:        0.0.2+version:        0.0.3 synopsis:       Data structure supporting partial orders description:    Please see README.md category:       Data structures@@ -37,7 +37,7 @@   ghc-options: -Wall -Wcompat -Widentities -Wincomplete-record-updates -Wincomplete-uni-patterns -Wmissing-export-lists -Wmissing-home-modules -Wpartial-fields -Wredundant-constraints   build-depends:       base >=4.7 && <5-    , containers >=0.6 && <0.8+    , containers >=0.6 && <0.9   default-language: Haskell2010  test-suite partialord-test@@ -53,7 +53,7 @@   ghc-options: -Wall -Wcompat -Widentities -Wincomplete-record-updates -Wincomplete-uni-patterns -Wmissing-export-lists -Wmissing-home-modules -Wpartial-fields -Wredundant-constraints -threaded -rtsopts -with-rtsopts=-N   build-depends:       base >=4.7 && <5-    , containers >=0.6 && <0.8+    , containers >=0.6 && <0.9     , hspec >=2.7 && <2.12     , partialord   default-language: Haskell2010
src/Data/PartialOrd.hs view
@@ -12,7 +12,6 @@   toMaybeOrd,   fromMaybeOrd,   fromLeqGeq,-  fromCompare,   -- * Partial orderings   PartialOrd(..),   comparable,@@ -51,10 +50,6 @@ fromOrd EQ = EQ' fromOrd LT = LT' fromOrd GT = GT'---- | Lift a `compare` to a `compare'`-fromCompare :: Ord a => a -> a -> PartialOrdering-fromCompare x y = fromOrd $ compare x y  -- | Convert a partial ordering to an ordering toMaybeOrd :: PartialOrdering -> Maybe Ordering