Data.Geometry.Interval

1 dimensional Intervals

newtype Interval a r

An Interval is essentially a Range but with possible payload

Constructors

GInterval

Fields

• _unInterval :: Range (r :+ a)

Instances

Bifunctor Interval

Methods

bimap :: (a -> b) -> (c -> d) -> Interval a c -> Interval b d

first :: (a -> b) -> Interval a c -> Interval b c

second :: (b -> c) -> Interval a b -> Interval a c

Functor (Interval a)

Methods

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

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

Foldable (Interval a)

Methods

fold :: Monoid m => Interval a m -> m

foldMap :: Monoid m => (a -> m) -> Interval a a -> m

foldr :: (a -> b -> b) -> b -> Interval a a -> b

foldr' :: (a -> b -> b) -> b -> Interval a a -> b

foldl :: (b -> a -> b) -> b -> Interval a a -> b

foldl' :: (b -> a -> b) -> b -> Interval a a -> b

foldr1 :: (a -> a -> a) -> Interval a a -> a

foldl1 :: (a -> a -> a) -> Interval a a -> a

toList :: Interval a a -> [a]

null :: Interval a a -> Bool

length :: Interval a a -> Int

elem :: Eq a => a -> Interval a a -> Bool

maximum :: Ord a => Interval a a -> a

minimum :: Ord a => Interval a a -> a

sum :: Num a => Interval a a -> a

product :: Num a => Interval a a -> a

Traversable (Interval a)

Methods

traverse :: Applicative f => (a -> f b) -> Interval a a -> f (Interval a b)

sequenceA :: Applicative f => Interval a (f a) -> f (Interval a a)

mapM :: Monad m => (a -> m b) -> Interval a a -> m (Interval a b)

sequence :: Monad m => Interval a (m a) -> m (Interval a a)

(Eq r, Eq a) => Eq (Interval a r)

Methods

(==) :: Interval a r -> Interval a r -> Bool

(/=) :: Interval a r -> Interval a r -> Bool

(Show a, Show r) => Show (Interval a r)

Methods

showsPrec :: Int -> Interval a r -> ShowS

show :: Interval a r -> String

showList :: [Interval a r] -> ShowS

Generic (Interval a r)

Associated Types

type Rep (Interval a r) :: * -> *

Methods

from :: Interval a r -> Rep (Interval a r) x

to :: Rep (Interval a r) x -> Interval a r

(NFData a, NFData r) => NFData (Interval a r)

Methods

rnf :: Interval a r -> ()

HasEnd (Interval a r)

Associated Types

type EndCore (Interval a r) :: *

type EndExtra (Interval a r) :: *

Methods

end :: Lens' (Interval a r) (EndCore (Interval a r) :+ EndExtra (Interval a r))

HasStart (Interval a r)

Associated Types

type StartCore (Interval a r) :: *

type StartExtra (Interval a r) :: *

Methods

start :: Lens' (Interval a r) (StartCore (Interval a r) :+ StartExtra (Interval a r))

IntervalLike (Interval p r)

Methods

toRange :: Interval p r -> Range (NumType (Interval p r))

Ord r => IsIntersectableWith (Interval a r) (Interval a r)

Methods

intersect :: Interval a r -> Interval a r -> Intersection (Interval a r) (Interval a r)

intersects :: Interval a r -> Interval a r -> Bool

nonEmptyIntersection :: proxy (Interval a r) -> proxy (Interval a r) -> Intersection (Interval a r) (Interval a r) -> Bool

type Rep (Interval a r)

type Rep (Interval a r) = D1 (MetaData "Interval" "Data.Geometry.Interval" "hgeometry-0.6.0.0-ODn7ZyBfwj6IkLPAAzetJ" True) (C1 (MetaCons "GInterval" PrefixI True) (S1 (MetaSel (Just Symbol "_unInterval") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Range ((:+) r a)))))

type NumType (Interval a r)

type NumType (Interval a r) = r

type Dimension (Interval a r)

type Dimension (Interval a r) = 1

type EndCore (Interval a r)

type EndCore (Interval a r) = r

type EndExtra (Interval a r)

type EndExtra (Interval a r) = a

type StartCore (Interval a r)

type StartCore (Interval a r) = r

type StartExtra (Interval a r)

type StartExtra (Interval a r) = a

type IntersectionOf (Interval a r) (Interval a r)

type IntersectionOf (Interval a r) (Interval a r) = (:) * NoIntersection ((:) * (Interval a r) ([] *))

pattern OpenInterval :: forall r a. (:+) r a -> (:+) r a -> Interval a r

pattern ClosedInterval :: forall r a. (:+) r a -> (:+) r a -> Interval a r

pattern Interval :: forall r a. EndPoint ((:+) r a) -> EndPoint ((:+) r a) -> Interval a r

querying the start and end of intervals

class HasStart t where

Minimal complete definition

start

Associated Types

type StartCore t

type StartExtra t

Methods

start :: Lens' t (StartCore t :+ StartExtra t)

Instances

HasStart (Interval a r)

Associated Types

type StartCore (Interval a r) :: *

type StartExtra (Interval a r) :: *

Methods

start :: Lens' (Interval a r) (StartCore (Interval a r) :+ StartExtra (Interval a r))

HasStart (HalfLine d r)

Associated Types

type StartCore (HalfLine d r) :: *

type StartExtra (HalfLine d r) :: *

Methods

start :: Lens' (HalfLine d r) (StartCore (HalfLine d r) :+ StartExtra (HalfLine d r))

HasStart (LineSegment d p r)

Associated Types

type StartCore (LineSegment d p r) :: *

type StartExtra (LineSegment d p r) :: *

Methods

start :: Lens' (LineSegment d p r) (StartCore (LineSegment d p r) :+ StartExtra (LineSegment d p r))

class HasEnd t where

Minimal complete definition

end

Associated Types

type EndCore t

type EndExtra t

Methods

end :: Lens' t (EndCore t :+ EndExtra t)

Instances

HasEnd (Interval a r)

Associated Types

type EndCore (Interval a r) :: *

type EndExtra (Interval a r) :: *

Methods

end :: Lens' (Interval a r) (EndCore (Interval a r) :+ EndExtra (Interval a r))

HasEnd (LineSegment d p r)

Associated Types

type EndCore (LineSegment d p r) :: *

type EndExtra (LineSegment d p r) :: *

Methods

end :: Lens' (LineSegment d p r) (EndCore (LineSegment d p r) :+ EndExtra (LineSegment d p r))

Working with intervals

inInterval :: Ord r => r -> Interval a r -> Bool

Test if a value lies in an interval. Note that the difference between inInterval and inRange is that the extra value is *not* used in the comparison with inInterval, whereas it is in inRange.

shiftLeft' :: Num r => r -> Interval a r -> Interval a r

module Data.Range