Algorithms.Geometry.Sweep

Description

Helper types and functions for implementing Sweep line algorithms.

Synopsis

newtype Tagged (s :: *) a = Tagged {
- unTag :: a
}
tag :: proxy s -> a -> Tagged s a
newtype Timed s t a = Timed {
- atTime :: Tagged s t -> a
}
compare_ :: forall s t k. (Ord k, Reifies s t) => Timed s t k -> Timed s t k -> Ordering
coerceTo :: proxy s -> f (Timed s' t k) v -> f (Timed s t k) v
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
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

Documentation

newtype Tagged (s :: *) a Source #

Constructors

Tagged
Fields unTag :: a

Instances

Eq a => Eq (Tagged s a) Source #
Instance details 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) Source #
Instance details 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) Source #
Instance details 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 Source #

newtype Timed s t a Source #

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) Source #
Instance details 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) Source #
Instance details 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 Source #

Comparison function for timed values

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

Coerce timed values

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

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 Source #

Runs a computation at a given time.