Data.IntervalSet

Interval datatype and interval arithmetic.

IntervalSet type

data IntervalSet r

A set comprising zero or more non-empty, disconnected intervals.

Any connected intervals are merged together, and empty intervals are ignored.

Instances

(Ord r, Data r) => Data (IntervalSet r)

Defined in Data.IntervalSet

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IntervalSet r -> c (IntervalSet r)

gunfold :: (forall b r0. Data b => c (b -> r0) -> c r0) -> (forall r1. r1 -> c r1) -> Constr -> c (IntervalSet r)

toConstr :: IntervalSet r -> Constr

dataTypeOf :: IntervalSet r -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (IntervalSet r))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (IntervalSet r))

gmapT :: (forall b. Data b => b -> b) -> IntervalSet r -> IntervalSet r

gmapQl :: (r0 -> r' -> r0) -> r0 -> (forall d. Data d => d -> r') -> IntervalSet r -> r0

gmapQr :: forall r0 r'. (r' -> r0 -> r0) -> r0 -> (forall d. Data d => d -> r') -> IntervalSet r -> r0

gmapQ :: (forall d. Data d => d -> u) -> IntervalSet r -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> IntervalSet r -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IntervalSet r -> m (IntervalSet r)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IntervalSet r -> m (IntervalSet r)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IntervalSet r -> m (IntervalSet r)

Ord r => Monoid (IntervalSet r)

Defined in Data.IntervalSet

Methods

mempty :: IntervalSet r

mappend :: IntervalSet r -> IntervalSet r -> IntervalSet r

mconcat :: [IntervalSet r] -> IntervalSet r

Ord r => Semigroup (IntervalSet r)

Defined in Data.IntervalSet

Methods

(<>) :: IntervalSet r -> IntervalSet r -> IntervalSet r

sconcat :: NonEmpty (IntervalSet r) -> IntervalSet r

stimes :: Integral b => b -> IntervalSet r -> IntervalSet r

Ord r => IsList (IntervalSet r)

Defined in Data.IntervalSet

Associated Types

type Item (IntervalSet r)

Methods

fromList :: [Item (IntervalSet r)] -> IntervalSet r

fromListN :: Int -> [Item (IntervalSet r)] -> IntervalSet r

toList :: IntervalSet r -> [Item (IntervalSet r)]

(Num r, Ord r) => Num (IntervalSet r)

Defined in Data.IntervalSet

Methods

(+) :: IntervalSet r -> IntervalSet r -> IntervalSet r

(-) :: IntervalSet r -> IntervalSet r -> IntervalSet r

(*) :: IntervalSet r -> IntervalSet r -> IntervalSet r

negate :: IntervalSet r -> IntervalSet r

abs :: IntervalSet r -> IntervalSet r

signum :: IntervalSet r -> IntervalSet r

fromInteger :: Integer -> IntervalSet r

(Ord r, Read r) => Read (IntervalSet r)

Defined in Data.IntervalSet

Methods

readsPrec :: Int -> ReadS (IntervalSet r)

readList :: ReadS [IntervalSet r]

readPrec :: ReadPrec (IntervalSet r)

readListPrec :: ReadPrec [IntervalSet r]

(Real r, Fractional r) => Fractional (IntervalSet r)

recip (recip xs) == delete 0 xs

Defined in Data.IntervalSet

Methods

(/) :: IntervalSet r -> IntervalSet r -> IntervalSet r

recip :: IntervalSet r -> IntervalSet r

fromRational :: Rational -> IntervalSet r

(Ord r, Show r) => Show (IntervalSet r)

Defined in Data.IntervalSet

Methods

showsPrec :: Int -> IntervalSet r -> ShowS

show :: IntervalSet r -> String

showList :: [IntervalSet r] -> ShowS

NFData r => NFData (IntervalSet r)

Defined in Data.IntervalSet

Methods

rnf :: IntervalSet r -> ()

Eq r => Eq (IntervalSet r)

Defined in Data.IntervalSet

Methods

(==) :: IntervalSet r -> IntervalSet r -> Bool

(/=) :: IntervalSet r -> IntervalSet r -> Bool

Ord r => Ord (IntervalSet r)

Note that this Ord is derived and not semantically meaningful. The primary intended use case is to allow using IntervalSet in maps and sets that require ordering.

Defined in Data.IntervalSet

Methods

compare :: IntervalSet r -> IntervalSet r -> Ordering

(<) :: IntervalSet r -> IntervalSet r -> Bool

(<=) :: IntervalSet r -> IntervalSet r -> Bool

(>) :: IntervalSet r -> IntervalSet r -> Bool

(>=) :: IntervalSet r -> IntervalSet r -> Bool

max :: IntervalSet r -> IntervalSet r -> IntervalSet r

min :: IntervalSet r -> IntervalSet r -> IntervalSet r

Hashable r => Hashable (IntervalSet r)

Defined in Data.IntervalSet

Methods

hashWithSalt :: Int -> IntervalSet r -> Int

hash :: IntervalSet r -> Int

Ord r => BoundedJoinSemiLattice (IntervalSet r)

Defined in Data.IntervalSet

Methods

bottom :: IntervalSet r

Ord r => BoundedMeetSemiLattice (IntervalSet r)

Defined in Data.IntervalSet

Methods

top :: IntervalSet r

Ord r => Lattice (IntervalSet r)

Defined in Data.IntervalSet

Methods

(\/) :: IntervalSet r -> IntervalSet r -> IntervalSet r

(/\) :: IntervalSet r -> IntervalSet r -> IntervalSet r

type Item (IntervalSet r)

Defined in Data.IntervalSet

type Item (IntervalSet r) = Interval r

module Data.ExtendedReal

Construction

whole :: Ord r => IntervalSet r

whole real number line (-∞, ∞)

empty :: Ord r => IntervalSet r

empty interval set

singleton :: Ord r => Interval r -> IntervalSet r

single interval

Query

null :: IntervalSet r -> Bool

Is the interval set empty?

member :: Ord r => r -> IntervalSet r -> Bool

Is the element in the interval set?

notMember :: Ord r => r -> IntervalSet r -> Bool

Is the element not in the interval set?

isSubsetOf :: Ord r => IntervalSet r -> IntervalSet r -> Bool

Is this a subset? (is1 `isSubsetOf` is2) tells whether is1 is a subset of is2.

isProperSubsetOf :: Ord r => IntervalSet r -> IntervalSet r -> Bool

Is this a proper subset? (i.e. a subset but not equal).

span :: Ord r => IntervalSet r -> Interval r

convex hull of a set of intervals.

Construction

complement :: Ord r => IntervalSet r -> IntervalSet r

Complement the interval set.

insert :: Ord r => Interval r -> IntervalSet r -> IntervalSet r

Insert a new interval into the interval set.

delete :: Ord r => Interval r -> IntervalSet r -> IntervalSet r

Delete an interval from the interval set.

Combine

union :: Ord r => IntervalSet r -> IntervalSet r -> IntervalSet r

union of two interval sets

unions :: Ord r => [IntervalSet r] -> IntervalSet r

union of a list of interval sets

intersection :: Ord r => IntervalSet r -> IntervalSet r -> IntervalSet r

intersection of two interval sets

intersections :: Ord r => [IntervalSet r] -> IntervalSet r

intersection of a list of interval sets

difference :: Ord r => IntervalSet r -> IntervalSet r -> IntervalSet r

difference of two interval sets

Conversion

List

fromList :: Ord r => [Interval r] -> IntervalSet r

Build a interval set from a list of intervals.

toList :: Ord r => IntervalSet r -> [Interval r]

Convert a interval set into a list of intervals.

Ordered list

toAscList :: Ord r => IntervalSet r -> [Interval r]

Convert a interval set into a list of intervals in ascending order.

toDescList :: Ord r => IntervalSet r -> [Interval r]

Convert a interval set into a list of intervals in descending order.

fromAscList :: Ord r => [Interval r] -> IntervalSet r

Build a map from an ascending list of intervals. The precondition is not checked.