Hoogle Search
Within LTS Haskell 24.35 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
trd_offset :: VarMsg -> Word64NineP Data.NineP No documentation available.
twr_offset :: VarMsg -> Word64NineP Data.NineP No documentation available.
-
No documentation available.
data DiscreteOrdered v =>
RSet vRanged-sets Data.Ranged.RangedSet An RSet (for Ranged Set) is a list of ranges. The ranges must be sorted and not overlap.
makeRangedSet :: DiscreteOrdered v => [Range v] -> RSet vRanged-sets Data.Ranged.RangedSet Create a new Ranged Set from a list of ranges. The list may contain ranges that overlap or are not in ascending order.
prop_intersection_subset :: DiscreteOrdered a => RSet a -> RSet a -> BoolRanged-sets Data.Ranged.RangedSet The intersection of two sets is the non-strict subset of both.
prop_intersection_subset rs1 rs2 = i -<=- rs1 && i -<=- rs2 where i = rs1 -/\- rs2
prop_strict_subset :: DiscreteOrdered a => RSet a -> BoolRanged-sets Data.Ranged.RangedSet A set is not the strict subset of itself.
prop_strict_subset rs = not (rs -<- rs)
prop_subset :: DiscreteOrdered a => RSet a -> BoolRanged-sets Data.Ranged.RangedSet A set is the non-strict subset of itself.
prop_subset rs = rs -<=- rs
prop_union_strict_superset :: DiscreteOrdered a => RSet a -> RSet a -> PropertyRanged-sets Data.Ranged.RangedSet If rs1 - rs2 is not empty then the union of rs1 and rs2 will be a strict superset of rs2.
prop_union_strict_superset rs1 rs2 = (not $ rSetIsEmpty (rs1 -!- rs2)) ==> (rs2 -<- (rs1 -\/- rs2))
prop_union_superset :: DiscreteOrdered a => RSet a -> RSet a -> BoolRanged-sets Data.Ranged.RangedSet The union of two sets is the non-strict superset of both.
prop_union_superset rs1 rs2 = rs1 -<=- u && rs2 -<=- u where u = rs1 -\/- rs2