keid-geometry-0.1.1.3: Geometry primitives for Keid engine.

Geometry.Tile.Neighbors

# Documentation

data Neighbors a Source #

Constructors

 Neighbors FieldsnorthWest :: a north :: a northEast :: a east :: a southEast :: a south :: a southWest :: a west :: a

#### Instances

Instances details
 Source # Instance detailsDefined in Geometry.Tile.Neighbors Methodsfold :: Monoid m => Neighbors m -> m Source #foldMap :: Monoid m => (a -> m) -> Neighbors a -> m Source #foldMap' :: Monoid m => (a -> m) -> Neighbors a -> m Source #foldr :: (a -> b -> b) -> b -> Neighbors a -> b Source #foldr' :: (a -> b -> b) -> b -> Neighbors a -> b Source #foldl :: (b -> a -> b) -> b -> Neighbors a -> b Source #foldl' :: (b -> a -> b) -> b -> Neighbors a -> b Source #foldr1 :: (a -> a -> a) -> Neighbors a -> a Source #foldl1 :: (a -> a -> a) -> Neighbors a -> a Source #toList :: Neighbors a -> [a] Source #null :: Neighbors a -> Bool Source #elem :: Eq a => a -> Neighbors a -> Bool Source #maximum :: Ord a => Neighbors a -> a Source #minimum :: Ord a => Neighbors a -> a Source #sum :: Num a => Neighbors a -> a Source #product :: Num a => Neighbors a -> a Source # Source # Instance detailsDefined in Geometry.Tile.Neighbors Methodstraverse :: Applicative f => (a -> f b) -> Neighbors a -> f (Neighbors b) Source #sequenceA :: Applicative f => Neighbors (f a) -> f (Neighbors a) Source #mapM :: Monad m => (a -> m b) -> Neighbors a -> m (Neighbors b) Source #sequence :: Monad m => Neighbors (m a) -> m (Neighbors a) Source # Source # Instance detailsDefined in Geometry.Tile.Neighbors Methodspure :: a -> Neighbors a Source #(<*>) :: Neighbors (a -> b) -> Neighbors a -> Neighbors b Source #liftA2 :: (a -> b -> c) -> Neighbors a -> Neighbors b -> Neighbors c Source #(*>) :: Neighbors a -> Neighbors b -> Neighbors b Source #(<*) :: Neighbors a -> Neighbors b -> Neighbors a Source # Source # Instance detailsDefined in Geometry.Tile.Neighbors Methodsfmap :: (a -> b) -> Neighbors a -> Neighbors b Source #(<\$) :: a -> Neighbors b -> Neighbors a Source # Source # Instance detailsDefined in Geometry.Tile.Neighbors Associated Typestype Rep1 Neighbors :: k -> Type Source # Methodsfrom1 :: forall (a :: k). Neighbors a -> Rep1 Neighbors a Source #to1 :: forall (a :: k). Rep1 Neighbors a -> Neighbors a Source # Show a => Show (Neighbors a) Source # Instance detailsDefined in Geometry.Tile.Neighbors MethodsshowList :: [Neighbors a] -> ShowS Source # Eq a => Eq (Neighbors a) Source # Instance detailsDefined in Geometry.Tile.Neighbors Methods(==) :: Neighbors a -> Neighbors a -> Bool Source #(/=) :: Neighbors a -> Neighbors a -> Bool Source # Ord a => Ord (Neighbors a) Source # Instance detailsDefined in Geometry.Tile.Neighbors Methodscompare :: Neighbors a -> Neighbors a -> Ordering Source #(<) :: Neighbors a -> Neighbors a -> Bool Source #(<=) :: Neighbors a -> Neighbors a -> Bool Source #(>) :: Neighbors a -> Neighbors a -> Bool Source #(>=) :: Neighbors a -> Neighbors a -> Bool Source #max :: Neighbors a -> Neighbors a -> Neighbors a Source #min :: Neighbors a -> Neighbors a -> Neighbors a Source # type Rep1 Neighbors Source # Instance detailsDefined in Geometry.Tile.Neighbors type Rep1 Neighbors = D1 ('MetaData "Neighbors" "Geometry.Tile.Neighbors" "keid-geometry-0.1.1.3-inplace" 'False) (C1 ('MetaCons "Neighbors" 'PrefixI 'True) (((S1 ('MetaSel ('Just "northWest") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "north") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1) :*: (S1 ('MetaSel ('Just "northEast") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "east") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1)) :*: ((S1 ('MetaSel ('Just "southEast") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "south") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1) :*: (S1 ('MetaSel ('Just "southWest") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Just "west") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1))))

directionsWith :: Num a => (a -> a -> b) -> Neighbors b Source #

fromPoints :: Vec2 -> Vec2 -> Neighbors Vec2 Source #