Ranged-sets 0.2.0 → 0.2.1
raw patch · 2 files changed
+8/−4 lines, 2 filesdep ~HUnitdep ~QuickCheckdep ~basePVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: HUnit, QuickCheck, base
API changes (from Hackage documentation)
- Data.Ranged.Boundaries: instance (Arbitrary a) => Arbitrary (Boundary a)
- Data.Ranged.Boundaries: instance (DiscreteOrdered a) => Eq (Boundary a)
- Data.Ranged.Boundaries: instance (DiscreteOrdered a) => Ord (Boundary a)
- Data.Ranged.Boundaries: instance (Integral a) => DiscreteOrdered (Ratio a)
- Data.Ranged.Boundaries: instance (Ord a) => DiscreteOrdered [a]
- Data.Ranged.Boundaries: instance (Show a) => Show (Boundary a)
- Data.Ranged.RangedSet: instance (DiscreteOrdered a) => Monoid (RSet a)
- Data.Ranged.RangedSet: instance (DiscreteOrdered v) => Eq (RSet v)
- Data.Ranged.Ranges: instance (DiscreteOrdered a) => Eq (Range a)
- Data.Ranged.Ranges: instance (DiscreteOrdered a) => Ord (Range a)
+ Data.Ranged.Boundaries: instance Arbitrary a => Arbitrary (Boundary a)
+ Data.Ranged.Boundaries: instance DiscreteOrdered a => Eq (Boundary a)
+ Data.Ranged.Boundaries: instance DiscreteOrdered a => Ord (Boundary a)
+ Data.Ranged.Boundaries: instance Integral a => DiscreteOrdered (Ratio a)
+ Data.Ranged.Boundaries: instance Ord a => DiscreteOrdered [a]
+ Data.Ranged.Boundaries: instance Show a => Show (Boundary a)
+ Data.Ranged.RangedSet: instance DiscreteOrdered a => Monoid (RSet a)
+ Data.Ranged.RangedSet: instance DiscreteOrdered v => Eq (RSet v)
+ Data.Ranged.Ranges: instance DiscreteOrdered a => Eq (Range a)
+ Data.Ranged.Ranges: instance DiscreteOrdered a => Ord (Range a)
- Data.Ranged.Boundaries: (/>/) :: (Ord v) => v -> Boundary v -> Bool
+ Data.Ranged.Boundaries: (/>/) :: Ord v => v -> Boundary v -> Bool
- Data.Ranged.Boundaries: above :: (Ord v) => Boundary v -> v -> Bool
+ Data.Ranged.Boundaries: above :: Ord v => Boundary v -> v -> Bool
- Data.Ranged.Boundaries: adjacent :: (DiscreteOrdered a) => a -> a -> Bool
+ Data.Ranged.Boundaries: adjacent :: DiscreteOrdered a => a -> a -> Bool
- Data.Ranged.Boundaries: adjacentBelow :: (DiscreteOrdered a) => a -> Maybe a
+ Data.Ranged.Boundaries: adjacentBelow :: DiscreteOrdered a => a -> Maybe a
- Data.Ranged.Boundaries: class (Ord a) => DiscreteOrdered a
+ Data.Ranged.Boundaries: class Ord a => DiscreteOrdered a
- Data.Ranged.RangedSet: (-!-) :: (DiscreteOrdered v) => RSet v -> RSet v -> RSet v
+ Data.Ranged.RangedSet: (-!-) :: DiscreteOrdered v => RSet v -> RSet v -> RSet v
- Data.Ranged.RangedSet: (-/\-) :: (DiscreteOrdered v) => RSet v -> RSet v -> RSet v
+ Data.Ranged.RangedSet: (-/\-) :: DiscreteOrdered v => RSet v -> RSet v -> RSet v
- Data.Ranged.RangedSet: (-<-) :: (DiscreteOrdered v) => RSet v -> RSet v -> Bool
+ Data.Ranged.RangedSet: (-<-) :: DiscreteOrdered v => RSet v -> RSet v -> Bool
- Data.Ranged.RangedSet: (-<=-) :: (DiscreteOrdered v) => RSet v -> RSet v -> Bool
+ Data.Ranged.RangedSet: (-<=-) :: DiscreteOrdered v => RSet v -> RSet v -> Bool
- Data.Ranged.RangedSet: (-?-) :: (DiscreteOrdered v) => RSet v -> v -> Bool
+ Data.Ranged.RangedSet: (-?-) :: DiscreteOrdered v => RSet v -> v -> Bool
- Data.Ranged.RangedSet: (-\/-) :: (DiscreteOrdered v) => RSet v -> RSet v -> RSet v
+ Data.Ranged.RangedSet: (-\/-) :: DiscreteOrdered v => RSet v -> RSet v -> RSet v
- Data.Ranged.RangedSet: data (DiscreteOrdered v) => RSet v
+ Data.Ranged.RangedSet: data DiscreteOrdered v => RSet v
- Data.Ranged.RangedSet: makeRangedSet :: (DiscreteOrdered v) => [Range v] -> RSet v
+ Data.Ranged.RangedSet: makeRangedSet :: DiscreteOrdered v => [Range v] -> RSet v
- Data.Ranged.RangedSet: normaliseRangeList :: (DiscreteOrdered v) => [Range v] -> [Range v]
+ Data.Ranged.RangedSet: normaliseRangeList :: DiscreteOrdered v => [Range v] -> [Range v]
- Data.Ranged.RangedSet: prop_de_morgan_intersection :: (DiscreteOrdered a) => RSet a -> RSet a -> Bool
+ Data.Ranged.RangedSet: prop_de_morgan_intersection :: DiscreteOrdered a => RSet a -> RSet a -> Bool
- Data.Ranged.RangedSet: prop_de_morgan_union :: (DiscreteOrdered a) => RSet a -> RSet a -> Bool
+ Data.Ranged.RangedSet: prop_de_morgan_union :: DiscreteOrdered a => RSet a -> RSet a -> Bool
- Data.Ranged.RangedSet: prop_diff_intersect :: (DiscreteOrdered a) => RSet a -> RSet a -> Bool
+ Data.Ranged.RangedSet: prop_diff_intersect :: DiscreteOrdered a => RSet a -> RSet a -> Bool
- Data.Ranged.RangedSet: prop_difference :: (DiscreteOrdered a) => RSet a -> RSet a -> a -> Bool
+ Data.Ranged.RangedSet: prop_difference :: DiscreteOrdered a => RSet a -> RSet a -> a -> Bool
- Data.Ranged.RangedSet: prop_empty :: (DiscreteOrdered a) => a -> Bool
+ Data.Ranged.RangedSet: prop_empty :: DiscreteOrdered a => a -> Bool
- Data.Ranged.RangedSet: prop_empty_intersection :: (DiscreteOrdered a) => RSet a -> Bool
+ Data.Ranged.RangedSet: prop_empty_intersection :: DiscreteOrdered a => RSet a -> Bool
- Data.Ranged.RangedSet: prop_full :: (DiscreteOrdered a) => a -> Bool
+ Data.Ranged.RangedSet: prop_full :: DiscreteOrdered a => a -> Bool
- Data.Ranged.RangedSet: prop_full_union :: (DiscreteOrdered a) => RSet a -> Bool
+ Data.Ranged.RangedSet: prop_full_union :: DiscreteOrdered a => RSet a -> Bool
- Data.Ranged.RangedSet: prop_has :: (DiscreteOrdered a) => [Range a] -> a -> Bool
+ Data.Ranged.RangedSet: prop_has :: DiscreteOrdered a => [Range a] -> a -> Bool
- Data.Ranged.RangedSet: prop_intersection :: (DiscreteOrdered a) => RSet a -> RSet a -> a -> Bool
+ Data.Ranged.RangedSet: prop_intersection :: DiscreteOrdered a => RSet a -> RSet a -> a -> Bool
- Data.Ranged.RangedSet: prop_intersection_associates :: (DiscreteOrdered a) => RSet a -> RSet a -> RSet a -> Bool
+ Data.Ranged.RangedSet: prop_intersection_associates :: DiscreteOrdered a => RSet a -> RSet a -> RSet a -> Bool
- Data.Ranged.RangedSet: prop_intersection_commutes :: (DiscreteOrdered a) => RSet a -> RSet a -> Bool
+ Data.Ranged.RangedSet: prop_intersection_commutes :: DiscreteOrdered a => RSet a -> RSet a -> Bool
- Data.Ranged.RangedSet: prop_intersection_subset :: (DiscreteOrdered a) => RSet a -> RSet a -> Bool
+ Data.Ranged.RangedSet: prop_intersection_subset :: DiscreteOrdered a => RSet a -> RSet a -> Bool
- Data.Ranged.RangedSet: prop_negation :: (DiscreteOrdered a) => RSet a -> a -> Bool
+ Data.Ranged.RangedSet: prop_negation :: DiscreteOrdered a => RSet a -> a -> Bool
- Data.Ranged.RangedSet: prop_not_empty :: (DiscreteOrdered a) => RSet a -> a -> Property
+ Data.Ranged.RangedSet: prop_not_empty :: DiscreteOrdered a => RSet a -> a -> Property
- Data.Ranged.RangedSet: prop_strict_subset :: (DiscreteOrdered a) => RSet a -> Bool
+ Data.Ranged.RangedSet: prop_strict_subset :: DiscreteOrdered a => RSet a -> Bool
- Data.Ranged.RangedSet: prop_subset :: (DiscreteOrdered a) => RSet a -> Bool
+ Data.Ranged.RangedSet: prop_subset :: DiscreteOrdered a => RSet a -> Bool
- Data.Ranged.RangedSet: prop_union :: (DiscreteOrdered a) => RSet a -> RSet a -> a -> Bool
+ Data.Ranged.RangedSet: prop_union :: DiscreteOrdered a => RSet a -> RSet a -> a -> Bool
- Data.Ranged.RangedSet: prop_union_associates :: (DiscreteOrdered a) => RSet a -> RSet a -> RSet a -> Bool
+ Data.Ranged.RangedSet: prop_union_associates :: DiscreteOrdered a => RSet a -> RSet a -> RSet a -> Bool
- Data.Ranged.RangedSet: prop_union_commutes :: (DiscreteOrdered a) => RSet a -> RSet a -> Bool
+ Data.Ranged.RangedSet: prop_union_commutes :: DiscreteOrdered a => RSet a -> RSet a -> Bool
- Data.Ranged.RangedSet: prop_union_strict_superset :: (DiscreteOrdered a) => RSet a -> RSet a -> Property
+ Data.Ranged.RangedSet: prop_union_strict_superset :: DiscreteOrdered a => RSet a -> RSet a -> Property
- Data.Ranged.RangedSet: prop_union_superset :: (DiscreteOrdered a) => RSet a -> RSet a -> Bool
+ Data.Ranged.RangedSet: prop_union_superset :: DiscreteOrdered a => RSet a -> RSet a -> Bool
- Data.Ranged.RangedSet: prop_validNormalised :: (DiscreteOrdered a) => [Range a] -> Bool
+ Data.Ranged.RangedSet: prop_validNormalised :: DiscreteOrdered a => [Range a] -> Bool
- Data.Ranged.RangedSet: rSetDifference :: (DiscreteOrdered v) => RSet v -> RSet v -> RSet v
+ Data.Ranged.RangedSet: rSetDifference :: DiscreteOrdered v => RSet v -> RSet v -> RSet v
- Data.Ranged.RangedSet: rSetEmpty :: (DiscreteOrdered a) => RSet a
+ Data.Ranged.RangedSet: rSetEmpty :: DiscreteOrdered a => RSet a
- Data.Ranged.RangedSet: rSetFull :: (DiscreteOrdered a) => RSet a
+ Data.Ranged.RangedSet: rSetFull :: DiscreteOrdered a => RSet a
- Data.Ranged.RangedSet: rSetHas :: (DiscreteOrdered v) => RSet v -> v -> Bool
+ Data.Ranged.RangedSet: rSetHas :: DiscreteOrdered v => RSet v -> v -> Bool
- Data.Ranged.RangedSet: rSetIntersection :: (DiscreteOrdered v) => RSet v -> RSet v -> RSet v
+ Data.Ranged.RangedSet: rSetIntersection :: DiscreteOrdered v => RSet v -> RSet v -> RSet v
- Data.Ranged.RangedSet: rSetIsEmpty :: (DiscreteOrdered v) => RSet v -> Bool
+ Data.Ranged.RangedSet: rSetIsEmpty :: DiscreteOrdered v => RSet v -> Bool
- Data.Ranged.RangedSet: rSetIsFull :: (DiscreteOrdered v) => RSet v -> Bool
+ Data.Ranged.RangedSet: rSetIsFull :: DiscreteOrdered v => RSet v -> Bool
- Data.Ranged.RangedSet: rSetIsSubset :: (DiscreteOrdered v) => RSet v -> RSet v -> Bool
+ Data.Ranged.RangedSet: rSetIsSubset :: DiscreteOrdered v => RSet v -> RSet v -> Bool
- Data.Ranged.RangedSet: rSetIsSubsetStrict :: (DiscreteOrdered v) => RSet v -> RSet v -> Bool
+ Data.Ranged.RangedSet: rSetIsSubsetStrict :: DiscreteOrdered v => RSet v -> RSet v -> Bool
- Data.Ranged.RangedSet: rSetNegation :: (DiscreteOrdered a) => RSet a -> RSet a
+ Data.Ranged.RangedSet: rSetNegation :: DiscreteOrdered a => RSet a -> RSet a
- Data.Ranged.RangedSet: rSetUnfold :: (DiscreteOrdered a) => Boundary a -> (Boundary a -> Boundary a) -> (Boundary a -> Maybe (Boundary a)) -> RSet a
+ Data.Ranged.RangedSet: rSetUnfold :: DiscreteOrdered a => Boundary a -> (Boundary a -> Boundary a) -> (Boundary a -> Maybe (Boundary a)) -> RSet a
- Data.Ranged.RangedSet: rSetUnion :: (DiscreteOrdered v) => RSet v -> RSet v -> RSet v
+ Data.Ranged.RangedSet: rSetUnion :: DiscreteOrdered v => RSet v -> RSet v -> RSet v
- Data.Ranged.RangedSet: rSingleton :: (DiscreteOrdered v) => v -> RSet v
+ Data.Ranged.RangedSet: rSingleton :: DiscreteOrdered v => v -> RSet v
- Data.Ranged.RangedSet: unsafeRangedSet :: (DiscreteOrdered v) => [Range v] -> RSet v
+ Data.Ranged.RangedSet: unsafeRangedSet :: DiscreteOrdered v => [Range v] -> RSet v
- Data.Ranged.RangedSet: validRangeList :: (DiscreteOrdered v) => [Range v] -> Bool
+ Data.Ranged.RangedSet: validRangeList :: DiscreteOrdered v => [Range v] -> Bool
- Data.Ranged.Ranges: data (Ord v) => Range v
+ Data.Ranged.Ranges: data Ord v => Range v
- Data.Ranged.Ranges: emptyRange :: (DiscreteOrdered v) => Range v
+ Data.Ranged.Ranges: emptyRange :: DiscreteOrdered v => Range v
- Data.Ranged.Ranges: fullRange :: (DiscreteOrdered v) => Range v
+ Data.Ranged.Ranges: fullRange :: DiscreteOrdered v => Range v
- Data.Ranged.Ranges: prop_differenceRange :: (DiscreteOrdered a) => Range a -> Range a -> a -> Bool
+ Data.Ranged.Ranges: prop_differenceRange :: DiscreteOrdered a => Range a -> Range a -> a -> Bool
- Data.Ranged.Ranges: prop_enclosureUnion :: (DiscreteOrdered a) => Range a -> Range a -> Bool
+ Data.Ranged.Ranges: prop_enclosureUnion :: DiscreteOrdered a => Range a -> Range a -> Bool
- Data.Ranged.Ranges: prop_intersectionOverlap :: (DiscreteOrdered a) => Range a -> Range a -> Bool
+ Data.Ranged.Ranges: prop_intersectionOverlap :: DiscreteOrdered a => Range a -> Range a -> Bool
- Data.Ranged.Ranges: prop_intersectionRange :: (DiscreteOrdered a) => Range a -> Range a -> a -> Bool
+ Data.Ranged.Ranges: prop_intersectionRange :: DiscreteOrdered a => Range a -> Range a -> a -> Bool
- Data.Ranged.Ranges: prop_singletonRangeConverse :: (DiscreteOrdered a) => a -> Bool
+ Data.Ranged.Ranges: prop_singletonRangeConverse :: DiscreteOrdered a => a -> Bool
- Data.Ranged.Ranges: prop_singletonRangeHas :: (DiscreteOrdered a) => a -> Bool
+ Data.Ranged.Ranges: prop_singletonRangeHas :: DiscreteOrdered a => a -> Bool
- Data.Ranged.Ranges: prop_singletonRangeHasOnly :: (DiscreteOrdered a) => a -> a -> Bool
+ Data.Ranged.Ranges: prop_singletonRangeHasOnly :: DiscreteOrdered a => a -> a -> Bool
- Data.Ranged.Ranges: prop_unionRange :: (DiscreteOrdered a) => Range a -> Range a -> a -> Bool
+ Data.Ranged.Ranges: prop_unionRange :: DiscreteOrdered a => Range a -> Range a -> a -> Bool
- Data.Ranged.Ranges: prop_unionRangeLength :: (DiscreteOrdered a) => Range a -> Range a -> Bool
+ Data.Ranged.Ranges: prop_unionRangeLength :: DiscreteOrdered a => Range a -> Range a -> Bool
- Data.Ranged.Ranges: rangeDifference :: (DiscreteOrdered v) => Range v -> Range v -> [Range v]
+ Data.Ranged.Ranges: rangeDifference :: DiscreteOrdered v => Range v -> Range v -> [Range v]
- Data.Ranged.Ranges: rangeEncloses :: (DiscreteOrdered v) => Range v -> Range v -> Bool
+ Data.Ranged.Ranges: rangeEncloses :: DiscreteOrdered v => Range v -> Range v -> Bool
- Data.Ranged.Ranges: rangeHas :: (Ord v) => Range v -> v -> Bool
+ Data.Ranged.Ranges: rangeHas :: Ord v => Range v -> v -> Bool
- Data.Ranged.Ranges: rangeIntersection :: (DiscreteOrdered v) => Range v -> Range v -> Range v
+ Data.Ranged.Ranges: rangeIntersection :: DiscreteOrdered v => Range v -> Range v -> Range v
- Data.Ranged.Ranges: rangeIsEmpty :: (DiscreteOrdered v) => Range v -> Bool
+ Data.Ranged.Ranges: rangeIsEmpty :: DiscreteOrdered v => Range v -> Bool
- Data.Ranged.Ranges: rangeIsFull :: (DiscreteOrdered v) => Range v -> Bool
+ Data.Ranged.Ranges: rangeIsFull :: DiscreteOrdered v => Range v -> Bool
- Data.Ranged.Ranges: rangeListHas :: (Ord v) => [Range v] -> v -> Bool
+ Data.Ranged.Ranges: rangeListHas :: Ord v => [Range v] -> v -> Bool
- Data.Ranged.Ranges: rangeOverlap :: (DiscreteOrdered v) => Range v -> Range v -> Bool
+ Data.Ranged.Ranges: rangeOverlap :: DiscreteOrdered v => Range v -> Range v -> Bool
- Data.Ranged.Ranges: rangeSingletonValue :: (DiscreteOrdered v) => Range v -> Maybe v
+ Data.Ranged.Ranges: rangeSingletonValue :: DiscreteOrdered v => Range v -> Maybe v
- Data.Ranged.Ranges: rangeUnion :: (DiscreteOrdered v) => Range v -> Range v -> [Range v]
+ Data.Ranged.Ranges: rangeUnion :: DiscreteOrdered v => Range v -> Range v -> [Range v]
- Data.Ranged.Ranges: singletonRange :: (DiscreteOrdered v) => v -> Range v
+ Data.Ranged.Ranges: singletonRange :: DiscreteOrdered v => v -> Range v
Files
- CHANGES.txt +4/−0
- Ranged-sets.cabal +4/−4
CHANGES.txt view
@@ -41,3 +41,7 @@ Reorganised and extended tests. Added "rangeIsFull" predicate.++Version 0.2.1+-------------+Require QuickCheck < 2.
Ranged-sets.cabal view
@@ -1,5 +1,5 @@ Name: Ranged-sets-Version: 0.2.0+Version: 0.2.1 License: BSD3 License-file: LICENSE.txt Copyright: Paul Johnson, 2005, 2006, 2007, 2008@@ -8,14 +8,14 @@ Maintainer: paul@cogito.org.uk Stability: beta Category: Data-Build-Depends: base, QuickCheck, HUnit+Build-Depends: base, QuickCheck<2, HUnit Build-type: Simple Synopsis: Ranged sets for Haskell Description: A ranged set is an ordered list of ranges. This allows sets such as all reals x such that (0.25 < x <= 0.75 or 1.4 <= x < 2.3 or 4.5 < x).-Exposed-modules: Data.Ranged, Data.Ranged.Boundaries, Data.Ranged.Ranges, +Exposed-modules: Data.Ranged, Data.Ranged.Boundaries, Data.Ranged.Ranges, Data.Ranged.RangedSet-Extra-source-files: tests/Makefile, tests/Main.hs, README.txt, CHANGES.txt, +Extra-source-files: tests/Makefile, tests/Main.hs, README.txt, CHANGES.txt, INSTALL.txt, TODO.txt ghc-options: -Wall