Copyright	(c) Amy de Buitléir 2012-2016
License	BSD-style
Maintainer	amy@nualeargais.ie
Stability	experimental
Portability	portable
Safe Haskell	Safe
Language	Haskell2010

Math.Geometry.Grid.Triangular

Contents

Unbounded grid with triangular tiles
Triangular grid with triangular tiles
Parallelogram-shaped grid with triangular tiles
Rectangular grid with triangular tiles
Toroidal grid with triangular tiles
Cylindrical grids with triangular tiles

Description

A regular arrangement of triangular tiles. The userguide, with illustrations, is available at https://github.com/mhwombat/grid/wiki. Also see Math.Geometry.Grid for examples of how to use this class.

Synopsis

Unbounded grid with triangular tiles

data UnboundedTriGrid Source #

An unbounded grid with triangular tiles. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Constructors

UnboundedTriGrid

Instances

Eq UnboundedTriGrid Source #
Methods (==) :: UnboundedTriGrid -> UnboundedTriGrid -> Bool # (/=) :: UnboundedTriGrid -> UnboundedTriGrid -> Bool #
Show UnboundedTriGrid Source #
Methods showsPrec :: Int -> UnboundedTriGrid -> ShowS # show :: UnboundedTriGrid -> String # showList :: [UnboundedTriGrid] -> ShowS #
Generic UnboundedTriGrid Source #
Associated Types type Rep UnboundedTriGrid :: * -> * # Methods from :: UnboundedTriGrid -> Rep UnboundedTriGrid x # to :: Rep UnboundedTriGrid x -> UnboundedTriGrid #
Grid UnboundedTriGrid Source #
Associated Types type Index UnboundedTriGrid :: * Source # type Direction UnboundedTriGrid :: * Source # Methods indices :: UnboundedTriGrid -> [Index UnboundedTriGrid] Source # distance :: UnboundedTriGrid -> Index UnboundedTriGrid -> Index UnboundedTriGrid -> Int Source # minDistance :: UnboundedTriGrid -> [Index UnboundedTriGrid] -> Index UnboundedTriGrid -> Int Source # neighbours :: UnboundedTriGrid -> Index UnboundedTriGrid -> [Index UnboundedTriGrid] Source # neighboursOfSet :: UnboundedTriGrid -> [Index UnboundedTriGrid] -> [Index UnboundedTriGrid] Source # neighbour :: UnboundedTriGrid -> Index UnboundedTriGrid -> Direction UnboundedTriGrid -> Maybe (Index UnboundedTriGrid) Source # numNeighbours :: UnboundedTriGrid -> Index UnboundedTriGrid -> Int Source # contains :: UnboundedTriGrid -> Index UnboundedTriGrid -> Bool Source # tileCount :: UnboundedTriGrid -> Int Source # null :: UnboundedTriGrid -> Bool Source # nonNull :: UnboundedTriGrid -> Bool Source # edges :: UnboundedTriGrid -> [(Index UnboundedTriGrid, Index UnboundedTriGrid)] Source # viewpoint :: UnboundedTriGrid -> Index UnboundedTriGrid -> [(Index UnboundedTriGrid, Int)] Source # isAdjacent :: UnboundedTriGrid -> Index UnboundedTriGrid -> Index UnboundedTriGrid -> Bool Source # adjacentTilesToward :: UnboundedTriGrid -> Index UnboundedTriGrid -> Index UnboundedTriGrid -> [Index UnboundedTriGrid] Source # minimalPaths :: UnboundedTriGrid -> Index UnboundedTriGrid -> Index UnboundedTriGrid -> [[Index UnboundedTriGrid]] Source # directionTo :: UnboundedTriGrid -> Index UnboundedTriGrid -> Index UnboundedTriGrid -> [Direction UnboundedTriGrid] Source # defaultMinDistance :: UnboundedTriGrid -> [Index UnboundedTriGrid] -> Index UnboundedTriGrid -> Int Source # defaultNeighbours :: UnboundedTriGrid -> Index UnboundedTriGrid -> [Index UnboundedTriGrid] Source # defaultNeighboursOfSet :: UnboundedTriGrid -> [Index UnboundedTriGrid] -> [Index UnboundedTriGrid] Source # defaultNeighbour :: UnboundedTriGrid -> Index UnboundedTriGrid -> Direction UnboundedTriGrid -> Maybe (Index UnboundedTriGrid) Source # defaultTileCount :: UnboundedTriGrid -> Int Source # defaultEdges :: UnboundedTriGrid -> [(Index UnboundedTriGrid, Index UnboundedTriGrid)] Source # defaultIsAdjacent :: UnboundedTriGrid -> Index UnboundedTriGrid -> Index UnboundedTriGrid -> Bool Source # defaultAdjacentTilesToward :: UnboundedTriGrid -> Index UnboundedTriGrid -> Index UnboundedTriGrid -> [Index UnboundedTriGrid] Source # defaultMinimalPaths :: UnboundedTriGrid -> Index UnboundedTriGrid -> Index UnboundedTriGrid -> [[Index UnboundedTriGrid]] Source #
type Rep UnboundedTriGrid Source #
type Rep UnboundedTriGrid = D1 (MetaData "UnboundedTriGrid" "Math.Geometry.Grid.TriangularInternal" "grid-7.8.9-493WVnciudpA8BEkzyf2sN" False) (C1 (MetaCons "UnboundedTriGrid" PrefixI False) U1)
type Index UnboundedTriGrid Source #
type Index UnboundedTriGrid = (Int, Int)
type Direction UnboundedTriGrid Source #
type Direction UnboundedTriGrid = TriDirection

Triangular grid with triangular tiles

data TriTriGrid Source #

A triangular grid with triangular tiles. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Instances

Eq TriTriGrid Source #
Methods (==) :: TriTriGrid -> TriTriGrid -> Bool # (/=) :: TriTriGrid -> TriTriGrid -> Bool #
Show TriTriGrid Source #
Methods showsPrec :: Int -> TriTriGrid -> ShowS # show :: TriTriGrid -> String # showList :: [TriTriGrid] -> ShowS #
Generic TriTriGrid Source #
Associated Types type Rep TriTriGrid :: * -> * # Methods from :: TriTriGrid -> Rep TriTriGrid x # to :: Rep TriTriGrid x -> TriTriGrid #
BoundedGrid TriTriGrid Source #
Methods tileSideCount :: TriTriGrid -> Int Source # boundary :: TriTriGrid -> [Index TriTriGrid] Source # isBoundary :: TriTriGrid -> Index TriTriGrid -> Bool Source # centre :: TriTriGrid -> [Index TriTriGrid] Source # isCentre :: TriTriGrid -> Index TriTriGrid -> Bool Source # defaultBoundary :: TriTriGrid -> [Index TriTriGrid] Source # defaultIsBoundary :: TriTriGrid -> Index TriTriGrid -> Bool Source # defaultCentre :: TriTriGrid -> [Index TriTriGrid] Source # defaultIsCentre :: TriTriGrid -> Index TriTriGrid -> Bool Source #
FiniteGrid TriTriGrid Source #
Associated Types type Size TriTriGrid :: * Source # Methods size :: TriTriGrid -> Size TriTriGrid Source # maxPossibleDistance :: TriTriGrid -> Int Source #
Grid TriTriGrid Source #
Associated Types type Index TriTriGrid :: * Source # type Direction TriTriGrid :: * Source # Methods indices :: TriTriGrid -> [Index TriTriGrid] Source # distance :: TriTriGrid -> Index TriTriGrid -> Index TriTriGrid -> Int Source # minDistance :: TriTriGrid -> [Index TriTriGrid] -> Index TriTriGrid -> Int Source # neighbours :: TriTriGrid -> Index TriTriGrid -> [Index TriTriGrid] Source # neighboursOfSet :: TriTriGrid -> [Index TriTriGrid] -> [Index TriTriGrid] Source # neighbour :: TriTriGrid -> Index TriTriGrid -> Direction TriTriGrid -> Maybe (Index TriTriGrid) Source # numNeighbours :: TriTriGrid -> Index TriTriGrid -> Int Source # contains :: TriTriGrid -> Index TriTriGrid -> Bool Source # tileCount :: TriTriGrid -> Int Source # null :: TriTriGrid -> Bool Source # nonNull :: TriTriGrid -> Bool Source # edges :: TriTriGrid -> [(Index TriTriGrid, Index TriTriGrid)] Source # viewpoint :: TriTriGrid -> Index TriTriGrid -> [(Index TriTriGrid, Int)] Source # isAdjacent :: TriTriGrid -> Index TriTriGrid -> Index TriTriGrid -> Bool Source # adjacentTilesToward :: TriTriGrid -> Index TriTriGrid -> Index TriTriGrid -> [Index TriTriGrid] Source # minimalPaths :: TriTriGrid -> Index TriTriGrid -> Index TriTriGrid -> [[Index TriTriGrid]] Source # directionTo :: TriTriGrid -> Index TriTriGrid -> Index TriTriGrid -> [Direction TriTriGrid] Source # defaultMinDistance :: TriTriGrid -> [Index TriTriGrid] -> Index TriTriGrid -> Int Source # defaultNeighbours :: TriTriGrid -> Index TriTriGrid -> [Index TriTriGrid] Source # defaultNeighboursOfSet :: TriTriGrid -> [Index TriTriGrid] -> [Index TriTriGrid] Source # defaultNeighbour :: TriTriGrid -> Index TriTriGrid -> Direction TriTriGrid -> Maybe (Index TriTriGrid) Source # defaultTileCount :: TriTriGrid -> Int Source # defaultEdges :: TriTriGrid -> [(Index TriTriGrid, Index TriTriGrid)] Source # defaultIsAdjacent :: TriTriGrid -> Index TriTriGrid -> Index TriTriGrid -> Bool Source # defaultAdjacentTilesToward :: TriTriGrid -> Index TriTriGrid -> Index TriTriGrid -> [Index TriTriGrid] Source # defaultMinimalPaths :: TriTriGrid -> Index TriTriGrid -> Index TriTriGrid -> [[Index TriTriGrid]] Source #
type Rep TriTriGrid Source #
type Rep TriTriGrid = D1 (MetaData "TriTriGrid" "Math.Geometry.Grid.TriangularInternal" "grid-7.8.9-493WVnciudpA8BEkzyf2sN" False) (C1 (MetaCons "TriTriGrid" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [(Int, Int)]))))
type Size TriTriGrid Source #
type Size TriTriGrid = Int
type Index TriTriGrid Source #
type Index TriTriGrid = (Int, Int)
type Direction TriTriGrid Source #
type Direction TriTriGrid = TriDirection

triTriGrid :: Int -> TriTriGrid Source #

triTriGrid s returns a triangular grid with sides of length s, using triangular tiles. If s is nonnegative, the resulting grid will have s^2 tiles. Otherwise, the resulting grid will be null and the list of indices will be null.

Parallelogram-shaped grid with triangular tiles

data ParaTriGrid Source #

A Parallelogrammatical grid with triangular tiles. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Instances

Eq ParaTriGrid Source #
Methods (==) :: ParaTriGrid -> ParaTriGrid -> Bool # (/=) :: ParaTriGrid -> ParaTriGrid -> Bool #
Show ParaTriGrid Source #
Methods showsPrec :: Int -> ParaTriGrid -> ShowS # show :: ParaTriGrid -> String # showList :: [ParaTriGrid] -> ShowS #
Generic ParaTriGrid Source #
Associated Types type Rep ParaTriGrid :: * -> * # Methods from :: ParaTriGrid -> Rep ParaTriGrid x # to :: Rep ParaTriGrid x -> ParaTriGrid #
BoundedGrid ParaTriGrid Source #
Methods tileSideCount :: ParaTriGrid -> Int Source # boundary :: ParaTriGrid -> [Index ParaTriGrid] Source # isBoundary :: ParaTriGrid -> Index ParaTriGrid -> Bool Source # centre :: ParaTriGrid -> [Index ParaTriGrid] Source # isCentre :: ParaTriGrid -> Index ParaTriGrid -> Bool Source # defaultBoundary :: ParaTriGrid -> [Index ParaTriGrid] Source # defaultIsBoundary :: ParaTriGrid -> Index ParaTriGrid -> Bool Source # defaultCentre :: ParaTriGrid -> [Index ParaTriGrid] Source # defaultIsCentre :: ParaTriGrid -> Index ParaTriGrid -> Bool Source #
FiniteGrid ParaTriGrid Source #
Associated Types type Size ParaTriGrid :: * Source # Methods size :: ParaTriGrid -> Size ParaTriGrid Source # maxPossibleDistance :: ParaTriGrid -> Int Source #
Grid ParaTriGrid Source #
Associated Types type Index ParaTriGrid :: * Source # type Direction ParaTriGrid :: * Source # Methods indices :: ParaTriGrid -> [Index ParaTriGrid] Source # distance :: ParaTriGrid -> Index ParaTriGrid -> Index ParaTriGrid -> Int Source # minDistance :: ParaTriGrid -> [Index ParaTriGrid] -> Index ParaTriGrid -> Int Source # neighbours :: ParaTriGrid -> Index ParaTriGrid -> [Index ParaTriGrid] Source # neighboursOfSet :: ParaTriGrid -> [Index ParaTriGrid] -> [Index ParaTriGrid] Source # neighbour :: ParaTriGrid -> Index ParaTriGrid -> Direction ParaTriGrid -> Maybe (Index ParaTriGrid) Source # numNeighbours :: ParaTriGrid -> Index ParaTriGrid -> Int Source # contains :: ParaTriGrid -> Index ParaTriGrid -> Bool Source # tileCount :: ParaTriGrid -> Int Source # null :: ParaTriGrid -> Bool Source # nonNull :: ParaTriGrid -> Bool Source # edges :: ParaTriGrid -> [(Index ParaTriGrid, Index ParaTriGrid)] Source # viewpoint :: ParaTriGrid -> Index ParaTriGrid -> [(Index ParaTriGrid, Int)] Source # isAdjacent :: ParaTriGrid -> Index ParaTriGrid -> Index ParaTriGrid -> Bool Source # adjacentTilesToward :: ParaTriGrid -> Index ParaTriGrid -> Index ParaTriGrid -> [Index ParaTriGrid] Source # minimalPaths :: ParaTriGrid -> Index ParaTriGrid -> Index ParaTriGrid -> [[Index ParaTriGrid]] Source # directionTo :: ParaTriGrid -> Index ParaTriGrid -> Index ParaTriGrid -> [Direction ParaTriGrid] Source # defaultMinDistance :: ParaTriGrid -> [Index ParaTriGrid] -> Index ParaTriGrid -> Int Source # defaultNeighbours :: ParaTriGrid -> Index ParaTriGrid -> [Index ParaTriGrid] Source # defaultNeighboursOfSet :: ParaTriGrid -> [Index ParaTriGrid] -> [Index ParaTriGrid] Source # defaultNeighbour :: ParaTriGrid -> Index ParaTriGrid -> Direction ParaTriGrid -> Maybe (Index ParaTriGrid) Source # defaultTileCount :: ParaTriGrid -> Int Source # defaultEdges :: ParaTriGrid -> [(Index ParaTriGrid, Index ParaTriGrid)] Source # defaultIsAdjacent :: ParaTriGrid -> Index ParaTriGrid -> Index ParaTriGrid -> Bool Source # defaultAdjacentTilesToward :: ParaTriGrid -> Index ParaTriGrid -> Index ParaTriGrid -> [Index ParaTriGrid] Source # defaultMinimalPaths :: ParaTriGrid -> Index ParaTriGrid -> Index ParaTriGrid -> [[Index ParaTriGrid]] Source #
type Rep ParaTriGrid Source #
type Rep ParaTriGrid = D1 (MetaData "ParaTriGrid" "Math.Geometry.Grid.TriangularInternal" "grid-7.8.9-493WVnciudpA8BEkzyf2sN" False) (C1 (MetaCons "ParaTriGrid" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Int, Int))) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [(Int, Int)]))))
type Size ParaTriGrid Source #
type Size ParaTriGrid = (Int, Int)
type Index ParaTriGrid Source #
type Index ParaTriGrid = (Int, Int)
type Direction ParaTriGrid Source #
type Direction ParaTriGrid = TriDirection

paraTriGrid :: Int -> Int -> ParaTriGrid Source #

paraTriGrid r c returns a grid in the shape of a parallelogram with r rows and c columns, using triangular tiles. If r and c are both nonnegative, the resulting grid will have 2*r*c tiles. Otherwise, the resulting grid will be null and the list of indices will be null.

Rectangular grid with triangular tiles

data RectTriGrid Source #

A rectangular grid with triangular tiles. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Instances

Eq RectTriGrid Source #
Methods (==) :: RectTriGrid -> RectTriGrid -> Bool # (/=) :: RectTriGrid -> RectTriGrid -> Bool #
Show RectTriGrid Source #
Methods showsPrec :: Int -> RectTriGrid -> ShowS # show :: RectTriGrid -> String # showList :: [RectTriGrid] -> ShowS #
Generic RectTriGrid Source #
Associated Types type Rep RectTriGrid :: * -> * # Methods from :: RectTriGrid -> Rep RectTriGrid x # to :: Rep RectTriGrid x -> RectTriGrid #
BoundedGrid RectTriGrid Source #
Methods tileSideCount :: RectTriGrid -> Int Source # boundary :: RectTriGrid -> [Index RectTriGrid] Source # isBoundary :: RectTriGrid -> Index RectTriGrid -> Bool Source # centre :: RectTriGrid -> [Index RectTriGrid] Source # isCentre :: RectTriGrid -> Index RectTriGrid -> Bool Source # defaultBoundary :: RectTriGrid -> [Index RectTriGrid] Source # defaultIsBoundary :: RectTriGrid -> Index RectTriGrid -> Bool Source # defaultCentre :: RectTriGrid -> [Index RectTriGrid] Source # defaultIsCentre :: RectTriGrid -> Index RectTriGrid -> Bool Source #
FiniteGrid RectTriGrid Source #
Associated Types type Size RectTriGrid :: * Source # Methods size :: RectTriGrid -> Size RectTriGrid Source # maxPossibleDistance :: RectTriGrid -> Int Source #
Grid RectTriGrid Source #
Associated Types type Index RectTriGrid :: * Source # type Direction RectTriGrid :: * Source # Methods indices :: RectTriGrid -> [Index RectTriGrid] Source # distance :: RectTriGrid -> Index RectTriGrid -> Index RectTriGrid -> Int Source # minDistance :: RectTriGrid -> [Index RectTriGrid] -> Index RectTriGrid -> Int Source # neighbours :: RectTriGrid -> Index RectTriGrid -> [Index RectTriGrid] Source # neighboursOfSet :: RectTriGrid -> [Index RectTriGrid] -> [Index RectTriGrid] Source # neighbour :: RectTriGrid -> Index RectTriGrid -> Direction RectTriGrid -> Maybe (Index RectTriGrid) Source # numNeighbours :: RectTriGrid -> Index RectTriGrid -> Int Source # contains :: RectTriGrid -> Index RectTriGrid -> Bool Source # tileCount :: RectTriGrid -> Int Source # null :: RectTriGrid -> Bool Source # nonNull :: RectTriGrid -> Bool Source # edges :: RectTriGrid -> [(Index RectTriGrid, Index RectTriGrid)] Source # viewpoint :: RectTriGrid -> Index RectTriGrid -> [(Index RectTriGrid, Int)] Source # isAdjacent :: RectTriGrid -> Index RectTriGrid -> Index RectTriGrid -> Bool Source # adjacentTilesToward :: RectTriGrid -> Index RectTriGrid -> Index RectTriGrid -> [Index RectTriGrid] Source # minimalPaths :: RectTriGrid -> Index RectTriGrid -> Index RectTriGrid -> [[Index RectTriGrid]] Source # directionTo :: RectTriGrid -> Index RectTriGrid -> Index RectTriGrid -> [Direction RectTriGrid] Source # defaultMinDistance :: RectTriGrid -> [Index RectTriGrid] -> Index RectTriGrid -> Int Source # defaultNeighbours :: RectTriGrid -> Index RectTriGrid -> [Index RectTriGrid] Source # defaultNeighboursOfSet :: RectTriGrid -> [Index RectTriGrid] -> [Index RectTriGrid] Source # defaultNeighbour :: RectTriGrid -> Index RectTriGrid -> Direction RectTriGrid -> Maybe (Index RectTriGrid) Source # defaultTileCount :: RectTriGrid -> Int Source # defaultEdges :: RectTriGrid -> [(Index RectTriGrid, Index RectTriGrid)] Source # defaultIsAdjacent :: RectTriGrid -> Index RectTriGrid -> Index RectTriGrid -> Bool Source # defaultAdjacentTilesToward :: RectTriGrid -> Index RectTriGrid -> Index RectTriGrid -> [Index RectTriGrid] Source # defaultMinimalPaths :: RectTriGrid -> Index RectTriGrid -> Index RectTriGrid -> [[Index RectTriGrid]] Source #
type Rep RectTriGrid Source #
type Rep RectTriGrid = D1 (MetaData "RectTriGrid" "Math.Geometry.Grid.TriangularInternal" "grid-7.8.9-493WVnciudpA8BEkzyf2sN" False) (C1 (MetaCons "RectTriGrid" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Int, Int))) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [(Int, Int)]))))
type Size RectTriGrid Source #
type Size RectTriGrid = (Int, Int)
type Index RectTriGrid Source #
type Index RectTriGrid = (Int, Int)
type Direction RectTriGrid Source #
type Direction RectTriGrid = TriDirection

rectTriGrid :: Int -> Int -> RectTriGrid Source #

rectTriGrid r c returns a grid in the shape of a rectangle (with jagged edges) that has r rows and c columns, using triangular tiles. If r and c are both nonnegative, the resulting grid will have 2*r*c tiles. Otherwise, the resulting grid will be null and the list of indices will be null.

Toroidal grid with triangular tiles

data TorTriGrid Source #

A toroidal grid with triangular tiles. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Instances

Eq TorTriGrid Source #
Methods (==) :: TorTriGrid -> TorTriGrid -> Bool # (/=) :: TorTriGrid -> TorTriGrid -> Bool #
Show TorTriGrid Source #
Methods showsPrec :: Int -> TorTriGrid -> ShowS # show :: TorTriGrid -> String # showList :: [TorTriGrid] -> ShowS #
Generic TorTriGrid Source #
Associated Types type Rep TorTriGrid :: * -> * # Methods from :: TorTriGrid -> Rep TorTriGrid x # to :: Rep TorTriGrid x -> TorTriGrid #
WrappedGrid TorTriGrid Source #
Methods normalise :: TorTriGrid -> Index TorTriGrid -> Index TorTriGrid Source # denormalise :: TorTriGrid -> Index TorTriGrid -> [Index TorTriGrid] Source #
FiniteGrid TorTriGrid Source #
Associated Types type Size TorTriGrid :: * Source # Methods size :: TorTriGrid -> Size TorTriGrid Source # maxPossibleDistance :: TorTriGrid -> Int Source #
Grid TorTriGrid Source #
Associated Types type Index TorTriGrid :: * Source # type Direction TorTriGrid :: * Source # Methods indices :: TorTriGrid -> [Index TorTriGrid] Source # distance :: TorTriGrid -> Index TorTriGrid -> Index TorTriGrid -> Int Source # minDistance :: TorTriGrid -> [Index TorTriGrid] -> Index TorTriGrid -> Int Source # neighbours :: TorTriGrid -> Index TorTriGrid -> [Index TorTriGrid] Source # neighboursOfSet :: TorTriGrid -> [Index TorTriGrid] -> [Index TorTriGrid] Source # neighbour :: TorTriGrid -> Index TorTriGrid -> Direction TorTriGrid -> Maybe (Index TorTriGrid) Source # numNeighbours :: TorTriGrid -> Index TorTriGrid -> Int Source # contains :: TorTriGrid -> Index TorTriGrid -> Bool Source # tileCount :: TorTriGrid -> Int Source # null :: TorTriGrid -> Bool Source # nonNull :: TorTriGrid -> Bool Source # edges :: TorTriGrid -> [(Index TorTriGrid, Index TorTriGrid)] Source # viewpoint :: TorTriGrid -> Index TorTriGrid -> [(Index TorTriGrid, Int)] Source # isAdjacent :: TorTriGrid -> Index TorTriGrid -> Index TorTriGrid -> Bool Source # adjacentTilesToward :: TorTriGrid -> Index TorTriGrid -> Index TorTriGrid -> [Index TorTriGrid] Source # minimalPaths :: TorTriGrid -> Index TorTriGrid -> Index TorTriGrid -> [[Index TorTriGrid]] Source # directionTo :: TorTriGrid -> Index TorTriGrid -> Index TorTriGrid -> [Direction TorTriGrid] Source # defaultMinDistance :: TorTriGrid -> [Index TorTriGrid] -> Index TorTriGrid -> Int Source # defaultNeighbours :: TorTriGrid -> Index TorTriGrid -> [Index TorTriGrid] Source # defaultNeighboursOfSet :: TorTriGrid -> [Index TorTriGrid] -> [Index TorTriGrid] Source # defaultNeighbour :: TorTriGrid -> Index TorTriGrid -> Direction TorTriGrid -> Maybe (Index TorTriGrid) Source # defaultTileCount :: TorTriGrid -> Int Source # defaultEdges :: TorTriGrid -> [(Index TorTriGrid, Index TorTriGrid)] Source # defaultIsAdjacent :: TorTriGrid -> Index TorTriGrid -> Index TorTriGrid -> Bool Source # defaultAdjacentTilesToward :: TorTriGrid -> Index TorTriGrid -> Index TorTriGrid -> [Index TorTriGrid] Source # defaultMinimalPaths :: TorTriGrid -> Index TorTriGrid -> Index TorTriGrid -> [[Index TorTriGrid]] Source #
type Rep TorTriGrid Source #
type Rep TorTriGrid = D1 (MetaData "TorTriGrid" "Math.Geometry.Grid.TriangularInternal" "grid-7.8.9-493WVnciudpA8BEkzyf2sN" False) (C1 (MetaCons "TorTriGrid" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Int, Int))) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [(Int, Int)]))))
type Size TorTriGrid Source #
type Size TorTriGrid = (Int, Int)
type Index TorTriGrid Source #
type Index TorTriGrid = (Int, Int)
type Direction TorTriGrid Source #
type Direction TorTriGrid = TriDirection

torTriGrid :: Int -> Int -> TorTriGrid Source #

torTriGrid r c returns a toroidal grid with r rows and c columns, using triangular tiles. The indexing method is the same as for ParaTriGrid. If r and c are both nonnegative, the resulting grid will have 2*r*c tiles. Otherwise, the resulting grid will be null and the list of indices will be null.

Cylindrical grids with triangular tiles

data YCylTriGrid Source #

A cylindrical grid with triangular tiles, where the cylinder is along the y-axis. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Instances

Eq YCylTriGrid Source #
Methods (==) :: YCylTriGrid -> YCylTriGrid -> Bool # (/=) :: YCylTriGrid -> YCylTriGrid -> Bool #
Show YCylTriGrid Source #
Methods showsPrec :: Int -> YCylTriGrid -> ShowS # show :: YCylTriGrid -> String # showList :: [YCylTriGrid] -> ShowS #
Generic YCylTriGrid Source #
Associated Types type Rep YCylTriGrid :: * -> * # Methods from :: YCylTriGrid -> Rep YCylTriGrid x # to :: Rep YCylTriGrid x -> YCylTriGrid #
WrappedGrid YCylTriGrid Source #
Methods normalise :: YCylTriGrid -> Index YCylTriGrid -> Index YCylTriGrid Source # denormalise :: YCylTriGrid -> Index YCylTriGrid -> [Index YCylTriGrid] Source #
FiniteGrid YCylTriGrid Source #
Associated Types type Size YCylTriGrid :: * Source # Methods size :: YCylTriGrid -> Size YCylTriGrid Source # maxPossibleDistance :: YCylTriGrid -> Int Source #
Grid YCylTriGrid Source #
Associated Types type Index YCylTriGrid :: * Source # type Direction YCylTriGrid :: * Source # Methods indices :: YCylTriGrid -> [Index YCylTriGrid] Source # distance :: YCylTriGrid -> Index YCylTriGrid -> Index YCylTriGrid -> Int Source # minDistance :: YCylTriGrid -> [Index YCylTriGrid] -> Index YCylTriGrid -> Int Source # neighbours :: YCylTriGrid -> Index YCylTriGrid -> [Index YCylTriGrid] Source # neighboursOfSet :: YCylTriGrid -> [Index YCylTriGrid] -> [Index YCylTriGrid] Source # neighbour :: YCylTriGrid -> Index YCylTriGrid -> Direction YCylTriGrid -> Maybe (Index YCylTriGrid) Source # numNeighbours :: YCylTriGrid -> Index YCylTriGrid -> Int Source # contains :: YCylTriGrid -> Index YCylTriGrid -> Bool Source # tileCount :: YCylTriGrid -> Int Source # null :: YCylTriGrid -> Bool Source # nonNull :: YCylTriGrid -> Bool Source # edges :: YCylTriGrid -> [(Index YCylTriGrid, Index YCylTriGrid)] Source # viewpoint :: YCylTriGrid -> Index YCylTriGrid -> [(Index YCylTriGrid, Int)] Source # isAdjacent :: YCylTriGrid -> Index YCylTriGrid -> Index YCylTriGrid -> Bool Source # adjacentTilesToward :: YCylTriGrid -> Index YCylTriGrid -> Index YCylTriGrid -> [Index YCylTriGrid] Source # minimalPaths :: YCylTriGrid -> Index YCylTriGrid -> Index YCylTriGrid -> [[Index YCylTriGrid]] Source # directionTo :: YCylTriGrid -> Index YCylTriGrid -> Index YCylTriGrid -> [Direction YCylTriGrid] Source # defaultMinDistance :: YCylTriGrid -> [Index YCylTriGrid] -> Index YCylTriGrid -> Int Source # defaultNeighbours :: YCylTriGrid -> Index YCylTriGrid -> [Index YCylTriGrid] Source # defaultNeighboursOfSet :: YCylTriGrid -> [Index YCylTriGrid] -> [Index YCylTriGrid] Source # defaultNeighbour :: YCylTriGrid -> Index YCylTriGrid -> Direction YCylTriGrid -> Maybe (Index YCylTriGrid) Source # defaultTileCount :: YCylTriGrid -> Int Source # defaultEdges :: YCylTriGrid -> [(Index YCylTriGrid, Index YCylTriGrid)] Source # defaultIsAdjacent :: YCylTriGrid -> Index YCylTriGrid -> Index YCylTriGrid -> Bool Source # defaultAdjacentTilesToward :: YCylTriGrid -> Index YCylTriGrid -> Index YCylTriGrid -> [Index YCylTriGrid] Source # defaultMinimalPaths :: YCylTriGrid -> Index YCylTriGrid -> Index YCylTriGrid -> [[Index YCylTriGrid]] Source #
type Rep YCylTriGrid Source #
type Rep YCylTriGrid = D1 (MetaData "YCylTriGrid" "Math.Geometry.Grid.TriangularInternal" "grid-7.8.9-493WVnciudpA8BEkzyf2sN" False) (C1 (MetaCons "YCylTriGrid" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Int, Int))) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [(Int, Int)]))))
type Size YCylTriGrid Source #
type Size YCylTriGrid = (Int, Int)
type Index YCylTriGrid Source #
type Index YCylTriGrid = (Int, Int)
type Direction YCylTriGrid Source #
type Direction YCylTriGrid = TriDirection

yCylTriGrid :: Int -> Int -> YCylTriGrid Source #

yCylTriGrid r c returns a cylindrical grid with r rows and c columns, using triangular tiles, where the cylinder is along the y-axis. The indexing method is the same as for ParaTriGrid. If r and c are both nonnegative, the resulting grid will have 2*r*c tiles. Otherwise, the resulting grid will be null and the list of indices will be null.

data XCylTriGrid Source #

A cylindrical grid with triangular tiles, where the cylinder is along the x-axis. The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.

Instances

Eq XCylTriGrid Source #
Methods (==) :: XCylTriGrid -> XCylTriGrid -> Bool # (/=) :: XCylTriGrid -> XCylTriGrid -> Bool #
Show XCylTriGrid Source #
Methods showsPrec :: Int -> XCylTriGrid -> ShowS # show :: XCylTriGrid -> String # showList :: [XCylTriGrid] -> ShowS #
Generic XCylTriGrid Source #
Associated Types type Rep XCylTriGrid :: * -> * # Methods from :: XCylTriGrid -> Rep XCylTriGrid x # to :: Rep XCylTriGrid x -> XCylTriGrid #
WrappedGrid XCylTriGrid Source #
Methods normalise :: XCylTriGrid -> Index XCylTriGrid -> Index XCylTriGrid Source # denormalise :: XCylTriGrid -> Index XCylTriGrid -> [Index XCylTriGrid] Source #
FiniteGrid XCylTriGrid Source #
Associated Types type Size XCylTriGrid :: * Source # Methods size :: XCylTriGrid -> Size XCylTriGrid Source # maxPossibleDistance :: XCylTriGrid -> Int Source #
Grid XCylTriGrid Source #
Associated Types type Index XCylTriGrid :: * Source # type Direction XCylTriGrid :: * Source # Methods indices :: XCylTriGrid -> [Index XCylTriGrid] Source # distance :: XCylTriGrid -> Index XCylTriGrid -> Index XCylTriGrid -> Int Source # minDistance :: XCylTriGrid -> [Index XCylTriGrid] -> Index XCylTriGrid -> Int Source # neighbours :: XCylTriGrid -> Index XCylTriGrid -> [Index XCylTriGrid] Source # neighboursOfSet :: XCylTriGrid -> [Index XCylTriGrid] -> [Index XCylTriGrid] Source # neighbour :: XCylTriGrid -> Index XCylTriGrid -> Direction XCylTriGrid -> Maybe (Index XCylTriGrid) Source # numNeighbours :: XCylTriGrid -> Index XCylTriGrid -> Int Source # contains :: XCylTriGrid -> Index XCylTriGrid -> Bool Source # tileCount :: XCylTriGrid -> Int Source # null :: XCylTriGrid -> Bool Source # nonNull :: XCylTriGrid -> Bool Source # edges :: XCylTriGrid -> [(Index XCylTriGrid, Index XCylTriGrid)] Source # viewpoint :: XCylTriGrid -> Index XCylTriGrid -> [(Index XCylTriGrid, Int)] Source # isAdjacent :: XCylTriGrid -> Index XCylTriGrid -> Index XCylTriGrid -> Bool Source # adjacentTilesToward :: XCylTriGrid -> Index XCylTriGrid -> Index XCylTriGrid -> [Index XCylTriGrid] Source # minimalPaths :: XCylTriGrid -> Index XCylTriGrid -> Index XCylTriGrid -> [[Index XCylTriGrid]] Source # directionTo :: XCylTriGrid -> Index XCylTriGrid -> Index XCylTriGrid -> [Direction XCylTriGrid] Source # defaultMinDistance :: XCylTriGrid -> [Index XCylTriGrid] -> Index XCylTriGrid -> Int Source # defaultNeighbours :: XCylTriGrid -> Index XCylTriGrid -> [Index XCylTriGrid] Source # defaultNeighboursOfSet :: XCylTriGrid -> [Index XCylTriGrid] -> [Index XCylTriGrid] Source # defaultNeighbour :: XCylTriGrid -> Index XCylTriGrid -> Direction XCylTriGrid -> Maybe (Index XCylTriGrid) Source # defaultTileCount :: XCylTriGrid -> Int Source # defaultEdges :: XCylTriGrid -> [(Index XCylTriGrid, Index XCylTriGrid)] Source # defaultIsAdjacent :: XCylTriGrid -> Index XCylTriGrid -> Index XCylTriGrid -> Bool Source # defaultAdjacentTilesToward :: XCylTriGrid -> Index XCylTriGrid -> Index XCylTriGrid -> [Index XCylTriGrid] Source # defaultMinimalPaths :: XCylTriGrid -> Index XCylTriGrid -> Index XCylTriGrid -> [[Index XCylTriGrid]] Source #
type Rep XCylTriGrid Source #
type Rep XCylTriGrid = D1 (MetaData "XCylTriGrid" "Math.Geometry.Grid.TriangularInternal" "grid-7.8.9-493WVnciudpA8BEkzyf2sN" False) (C1 (MetaCons "XCylTriGrid" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Int, Int))) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [(Int, Int)]))))
type Size XCylTriGrid Source #
type Size XCylTriGrid = (Int, Int)
type Index XCylTriGrid Source #
type Index XCylTriGrid = (Int, Int)
type Direction XCylTriGrid Source #
type Direction XCylTriGrid = TriDirection

xCylTriGrid :: Int -> Int -> XCylTriGrid Source #

xCylTriGrid r c returns a cylindrical grid with r rows and c columns, using triangular tiles, where the cylinder is along the y-axis. The indexing method is the same as for ParaTriGrid. If r and c are both nonnegative, the resulting grid will have 2*r*c tiles. Otherwise, the resulting grid will be null and the list of indices will be null.