Documentation

The type of locations on the 2D level map, heavily optimized.

We represent the (level map on the) screen as a linear framebuffer, where Point is an Int offset counted from the first cell. We do bounds check for the X size whenever we convert between representations and each subsequent array access performs another check, effectively for Y size. After dungeon is generated (using PointXY, not Point), and converted to the Point representation, points are used mainly as keys and not constructed often, so the performance will improve due to smaller save files, the use of IntMap and cheaper array indexing, including cheaper bounds checks. We don't defin Point as a newtype to avoid the trouble with using EnumMap in place of IntMap, etc.

Conversion from cartesian coordinates to Point.

Print a point as a tuple of cartesian coordinates.

The top-left corner location of the level.

The distance between two points in the chessboard metric.

Checks whether two points are adjacent on the map (horizontally, vertically or diagonally).

Returns the 8, or less, surrounding locations of a given location.

Returns the 4, or less, surrounding locations in cardinal directions from a given location.

Checks that a point belongs to an area.

Calculate the displacement vector from a location to another.

Bresenham's line algorithm generalized to arbitrary starting eps (eps value of 0 gives the standard BLA). Skips the source point and goes through the second point to the edge of the level. GIves Nothing if the points are equal.