Copyright | (c) Amy de Buitléir 2012-2017 |
---|---|
License | BSD-style |
Maintainer | amy@nualeargais.ie |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell2010 |
A module containing private HexGrid2
internals. Most developers
should use HexGrid2
instead. This module is subject to change
without notice.
Synopsis
- data HexDirection
- data UnboundedHexGrid = UnboundedHexGrid
- data HexHexGrid = HexHexGrid Int [(Int, Int)]
- hexHexGrid :: Int -> HexHexGrid
- data RectHexGrid = RectHexGrid (Int, Int) [(Int, Int)]
- rectHexGrid :: Int -> Int -> RectHexGrid
- rectHexGridY :: Int -> Int -> Int
Documentation
data HexDirection Source #
Instances
data UnboundedHexGrid Source #
An unbounded grid with hexagonal tiles The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.
Instances
data HexHexGrid Source #
A hexagonal grid with hexagonal tiles The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.
HexHexGrid Int [(Int, Int)] |
Instances
hexHexGrid :: Int -> HexHexGrid Source #
returns a grid of hexagonal shape, with
sides of length hexHexGrid
ss
, using hexagonal tiles. If s
is nonnegative, the
resulting grid will have 3*s*(s-1) + 1
tiles. Otherwise, the resulting
grid will be null and the list of indices will be null.
data RectHexGrid Source #
A rectangular grid with hexagonal tiles The grid and its indexing scheme are illustrated in the user guide, available at https://github.com/mhwombat/grid/wiki.
RectHexGrid (Int, Int) [(Int, Int)] |
Instances
rectHexGrid :: Int -> Int -> RectHexGrid Source #
returns a grid in the shape of a
parallelogram with rectHexGrid
r cr
rows and c
columns, using hexagonal tiles.
If r
and c
are both nonnegative, the resulting grid will have
r*c
tiles. Otherwise, the resulting grid will be null and the
list of indices will be null.