Algorithms.Geometry.Sweep

Helper types and functions for implementing Sweep line algorithms.

Documentation

newtype Tagged (s :: *) a

Constructors

Tagged

Fields

• unTag :: a

Instances

Eq a => Eq (Tagged s a)

Defined in Algorithms.Geometry.Sweep

Methods

(==) :: Tagged s a -> Tagged s a -> Bool

(/=) :: Tagged s a -> Tagged s a -> Bool

Ord a => Ord (Tagged s a)

Defined in Algorithms.Geometry.Sweep

Methods

compare :: Tagged s a -> Tagged s a -> Ordering

(<) :: Tagged s a -> Tagged s a -> Bool

(<=) :: Tagged s a -> Tagged s a -> Bool

(>) :: Tagged s a -> Tagged s a -> Bool

(>=) :: Tagged s a -> Tagged s a -> Bool

max :: Tagged s a -> Tagged s a -> Tagged s a

min :: Tagged s a -> Tagged s a -> Tagged s a

Show a => Show (Tagged s a)

Defined in Algorithms.Geometry.Sweep

Methods

showsPrec :: Int -> Tagged s a -> ShowS

show :: Tagged s a -> String

showList :: [Tagged s a] -> ShowS

tag :: proxy s -> a -> Tagged s a

newtype Timed s t a

Represent a computation that needs a particular time as input.

Constructors

Timed

Fields

• atTime :: Tagged s t -> a

Instances

(Reifies s t, Ord k) => Eq (Timed s t k)

Defined in Algorithms.Geometry.Sweep

Methods

(==) :: Timed s t k -> Timed s t k -> Bool

(/=) :: Timed s t k -> Timed s t k -> Bool

(Reifies s t, Ord k) => Ord (Timed s t k)

Defined in Algorithms.Geometry.Sweep

Methods

compare :: Timed s t k -> Timed s t k -> Ordering

(<) :: Timed s t k -> Timed s t k -> Bool

(<=) :: Timed s t k -> Timed s t k -> Bool

(>) :: Timed s t k -> Timed s t k -> Bool

(>=) :: Timed s t k -> Timed s t k -> Bool

max :: Timed s t k -> Timed s t k -> Timed s t k

min :: Timed s t k -> Timed s t k -> Timed s t k

compare_ :: forall s t k. (Ord k, Reifies s t) => Timed s t k -> Timed s t k -> Ordering

Comparison function for timed values

coerceTo :: proxy s -> f (Timed s' t k) v -> f (Timed s t k) v

Coerce timed values

unTagged :: f (Timed s t k) v -> f (Timed () t k) v

runAt :: forall s0 t k r f v. Ord k => t -> f (Timed s0 t k) v -> (forall s. Reifies s t => f (Timed s t k) v -> r) -> r

Runs a computation at a given time.

getTime :: Timed s Int Int

constT :: proxy s -> Int -> Timed s Int Int

test1 :: Int -> Bool

test2M :: Reifies s Int => proxy s -> Map (Timed s Int Int) String

query :: forall s v. Ord (Timed s Int Int) => Map (Timed s Int Int) v -> Maybe v

test2 :: Int -> Maybe String