Copyright	(C) Frank Staals
License	see the LICENSE file
Maintainer	Frank Staals
Safe Haskell	None
Language	Haskell2010

Algorithms.Geometry.SmallestEnclosingBall.Types

Description

Types to represent the smallest enclosing disk of a set of points in $\mathbb{R}^2$

Synopsis

data TwoOrThree a
- = Two !a !a
- | Three !a !a !a
fromList :: [a] -> Either String (TwoOrThree a)
data DiskResult p r = DiskResult {
- _enclosingDisk :: Disk () r
- _definingPoints :: TwoOrThree (Point 2 r :+ p)
}
enclosingDisk :: forall p r. Lens' (DiskResult p r) (Disk () r)
definingPoints :: forall p r p. Lens (DiskResult p r) (DiskResult p r) (TwoOrThree ((:+) (Point 2 r) p)) (TwoOrThree ((:+) (Point 2 r) p))

Documentation

data TwoOrThree a Source #

List of two or three elements

Constructors

Two !a !a
Three !a !a !a

Instances

Functor TwoOrThree Source #
Instance details Defined in Algorithms.Geometry.SmallestEnclosingBall.Types Methods fmap :: (a -> b) -> TwoOrThree a -> TwoOrThree b # (<$) :: a -> TwoOrThree b -> TwoOrThree a #
Foldable TwoOrThree Source #
Instance details Defined in Algorithms.Geometry.SmallestEnclosingBall.Types Methods fold :: Monoid m => TwoOrThree m -> m # foldMap :: Monoid m => (a -> m) -> TwoOrThree a -> m # foldr :: (a -> b -> b) -> b -> TwoOrThree a -> b # foldr' :: (a -> b -> b) -> b -> TwoOrThree a -> b # foldl :: (b -> a -> b) -> b -> TwoOrThree a -> b # foldl' :: (b -> a -> b) -> b -> TwoOrThree a -> b # foldr1 :: (a -> a -> a) -> TwoOrThree a -> a # foldl1 :: (a -> a -> a) -> TwoOrThree a -> a # toList :: TwoOrThree a -> [a] # null :: TwoOrThree a -> Bool # length :: TwoOrThree a -> Int # elem :: Eq a => a -> TwoOrThree a -> Bool # maximum :: Ord a => TwoOrThree a -> a # minimum :: Ord a => TwoOrThree a -> a # sum :: Num a => TwoOrThree a -> a # product :: Num a => TwoOrThree a -> a #
Eq a => Eq (TwoOrThree a) Source #
Instance details Defined in Algorithms.Geometry.SmallestEnclosingBall.Types Methods (==) :: TwoOrThree a -> TwoOrThree a -> Bool # (/=) :: TwoOrThree a -> TwoOrThree a -> Bool #
Ord a => Ord (TwoOrThree a) Source #
Instance details Defined in Algorithms.Geometry.SmallestEnclosingBall.Types Methods compare :: TwoOrThree a -> TwoOrThree a -> Ordering # (<) :: TwoOrThree a -> TwoOrThree a -> Bool # (<=) :: TwoOrThree a -> TwoOrThree a -> Bool # (>) :: TwoOrThree a -> TwoOrThree a -> Bool # (>=) :: TwoOrThree a -> TwoOrThree a -> Bool # max :: TwoOrThree a -> TwoOrThree a -> TwoOrThree a # min :: TwoOrThree a -> TwoOrThree a -> TwoOrThree a #
Read a => Read (TwoOrThree a) Source #
Instance details Defined in Algorithms.Geometry.SmallestEnclosingBall.Types Methods readsPrec :: Int -> ReadS (TwoOrThree a) # readList :: ReadS [TwoOrThree a] # readPrec :: ReadPrec (TwoOrThree a) # readListPrec :: ReadPrec [TwoOrThree a] #
Show a => Show (TwoOrThree a) Source #
Instance details Defined in Algorithms.Geometry.SmallestEnclosingBall.Types Methods showsPrec :: Int -> TwoOrThree a -> ShowS # show :: TwoOrThree a -> String # showList :: [TwoOrThree a] -> ShowS #

fromList :: [a] -> Either String (TwoOrThree a) Source #

data DiskResult p r Source #

The result of a smallest enclosing disk computation: The smallest ball and the points defining it

Constructors

DiskResult
Fields _enclosingDisk :: Disk () r _definingPoints :: TwoOrThree (Point 2 r :+ p)

enclosingDisk :: forall p r. Lens' (DiskResult p r) (Disk () r) Source #

definingPoints :: forall p r p. Lens (DiskResult p r) (DiskResult p r) (TwoOrThree ((:+) (Point 2 r) p)) (TwoOrThree ((:+) (Point 2 r) p)) Source #