Data.Ranges

This module provides a simpler interface than the Range module, allowing you to work with multiple ranges at the same time.

One of the main advantages of this module is that it implements Monoid for Ranges which lets you write code like:

Range creation

(+=+) :: a -> a -> Ranges a

(+=*) :: a -> a -> Ranges a

(*=+) :: a -> a -> Ranges a

(*=*) :: a -> a -> Ranges a

lbi :: a -> Ranges a

lbe :: a -> Ranges a

ubi :: a -> Ranges a

ube :: a -> Ranges a

inf :: Ranges a

Comparison functions

inRanges :: Ord a => Ranges a -> a -> Bool

aboveRanges :: Ord a => Ranges a -> a -> Bool

Checks if the value provided is above all of the ranges provided.

belowRanges :: Ord a => Ranges a -> a -> Bool

Checks if the value provided is below all of the ranges provided.

Set operations

union :: Ord a => Ranges a -> Ranges a -> Ranges a

intersection :: Ord a => Ranges a -> Ranges a -> Ranges a

difference :: Ord a => Ranges a -> Ranges a -> Ranges a

invert :: Ord a => Ranges a -> Ranges a

Enumerable methods

fromRanges :: (Ord a, Enum a) => Ranges a -> [a]

joinRanges :: (Ord a, Enum a) => Ranges a -> Ranges a

Data types

newtype Ranges a

Constructors

Ranges

Fields

• unRanges :: [Range a]

Instances

Functor Ranges

Defined in Data.Ranges

Methods

fmap :: (a -> b) -> Ranges a -> Ranges b

(<$) :: a -> Ranges b -> Ranges a

Show a => Show (Ranges a)

Defined in Data.Ranges

Methods

showsPrec :: Int -> Ranges a -> ShowS

show :: Ranges a -> String

showList :: [Ranges a] -> ShowS

Ord a => Semigroup (Ranges a)

Defined in Data.Ranges

Methods

(<>) :: Ranges a -> Ranges a -> Ranges a

sconcat :: NonEmpty (Ranges a) -> Ranges a

stimes :: Integral b => b -> Ranges a -> Ranges a

Ord a => Monoid (Ranges a)

Defined in Data.Ranges

Methods

mempty :: Ranges a

mappend :: Ranges a -> Ranges a -> Ranges a

mconcat :: [Ranges a] -> Ranges a