Geometry.Tile.Neighbors
data Neighbors a Source #
Constructors
Fields
Defined in Geometry.Tile.Neighbors
Methods
fold :: Monoid m => Neighbors m -> m #
foldMap :: Monoid m => (a -> m) -> Neighbors a -> m #
foldMap' :: Monoid m => (a -> m) -> Neighbors a -> m #
foldr :: (a -> b -> b) -> b -> Neighbors a -> b #
foldr' :: (a -> b -> b) -> b -> Neighbors a -> b #
foldl :: (b -> a -> b) -> b -> Neighbors a -> b #
foldl' :: (b -> a -> b) -> b -> Neighbors a -> b #
foldr1 :: (a -> a -> a) -> Neighbors a -> a #
foldl1 :: (a -> a -> a) -> Neighbors a -> a #
toList :: Neighbors a -> [a] #
null :: Neighbors a -> Bool #
length :: Neighbors a -> Int #
elem :: Eq a => a -> Neighbors a -> Bool #
maximum :: Ord a => Neighbors a -> a #
minimum :: Ord a => Neighbors a -> a #
sum :: Num a => Neighbors a -> a #
product :: Num a => Neighbors a -> a #
traverse :: Applicative f => (a -> f b) -> Neighbors a -> f (Neighbors b) #
sequenceA :: Applicative f => Neighbors (f a) -> f (Neighbors a) #
mapM :: Monad m => (a -> m b) -> Neighbors a -> m (Neighbors b) #
sequence :: Monad m => Neighbors (m a) -> m (Neighbors a) #
pure :: a -> Neighbors a #
(<*>) :: Neighbors (a -> b) -> Neighbors a -> Neighbors b #
liftA2 :: (a -> b -> c) -> Neighbors a -> Neighbors b -> Neighbors c #
(*>) :: Neighbors a -> Neighbors b -> Neighbors b #
(<*) :: Neighbors a -> Neighbors b -> Neighbors a #
fmap :: (a -> b) -> Neighbors a -> Neighbors b #
(<$) :: a -> Neighbors b -> Neighbors a #
showsPrec :: Int -> Neighbors a -> ShowS #
show :: Neighbors a -> String #
showList :: [Neighbors a] -> ShowS #
(==) :: Neighbors a -> Neighbors a -> Bool #
(/=) :: Neighbors a -> Neighbors a -> Bool #
compare :: Neighbors a -> Neighbors a -> Ordering #
(<) :: Neighbors a -> Neighbors a -> Bool #
(<=) :: Neighbors a -> Neighbors a -> Bool #
(>) :: Neighbors a -> Neighbors a -> Bool #
(>=) :: Neighbors a -> Neighbors a -> Bool #
max :: Neighbors a -> Neighbors a -> Neighbors a #
min :: Neighbors a -> Neighbors a -> Neighbors a #
Associated Types
type Rep1 Neighbors :: k -> Type #
from1 :: forall (a :: k). Neighbors a -> Rep1 Neighbors a #
to1 :: forall (a :: k). Rep1 Neighbors a -> Neighbors a #
nobody :: Neighbors Bool Source #
everyone :: Neighbors Bool Source #
bitsNW :: Neighbors Int Source #
testBitsNW :: Bits a => Neighbors (a -> Bool) Source #
fromBitsNW :: Bits a => a -> Neighbors Bool Source #
toBitsNW :: Neighbors Bool -> Int Source #
directionsWith :: Num a => (a -> a -> b) -> Neighbors b Source #
isCorner :: Neighbors Bool Source #
names :: IsString a => Neighbors a Source #