Game.LambdaHack.Common.Point

Basic operations on 2D points represented as linear offsets.

Documentation

type X = Int

Spacial dimension for points and vectors.

type Y = Int

Spacial dimension for points and vectors.

data Point

2D points in cartesian representation. Coordinates grow to the right and down, so that the (0, 0) point is in the top-left corner of the screen. Coordinates are never negative.

Constructors

Point

Fields

• px :: !X
• py :: !Y

Instances

Enum Point

Methods

succ :: Point -> Point

pred :: Point -> Point

toEnum :: Int -> Point

fromEnum :: Point -> Int

enumFrom :: Point -> [Point]

enumFromThen :: Point -> Point -> [Point]

enumFromTo :: Point -> Point -> [Point]

enumFromThenTo :: Point -> Point -> Point -> [Point]

Eq Point

Methods

(==) :: Point -> Point -> Bool

(/=) :: Point -> Point -> Bool

Ord Point

Methods

compare :: Point -> Point -> Ordering

(<) :: Point -> Point -> Bool

(<=) :: Point -> Point -> Bool

(>) :: Point -> Point -> Bool

(>=) :: Point -> Point -> Bool

max :: Point -> Point -> Point

min :: Point -> Point -> Point

Show Point

Methods

showsPrec :: Int -> Point -> ShowS

show :: Point -> String

showList :: [Point] -> ShowS

Generic Point

Associated Types

type Rep Point :: * -> *

Methods

from :: Point -> Rep Point x

to :: Rep Point x -> Point

Binary Point

Methods

put :: Point -> Put

get :: Get Point

putList :: [Point] -> Put

NFData Point

Methods

rnf :: Point -> ()

type Rep Point

type Rep Point = D1 (MetaData "Point" "Game.LambdaHack.Common.Point" "LambdaHack-0.6.0.0-KKqNxYnoEMa5Wo2qfudFog" False) (C1 (MetaCons "Point" PrefixI True) ((:*:) (S1 (MetaSel (Just Symbol "px") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 X)) (S1 (MetaSel (Just Symbol "py") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 Y))))

maxLevelDimExponent :: Int

The maximum number of bits for level X and Y dimension (16). The value is chosen to support architectures with 32-bit Ints.

chessDist :: Point -> Point -> Int

The distance between two points in the chessboard metric.

euclidDistSq :: Point -> Point -> Int

Squared euclidean distance between two points.

adjacent :: Point -> Point -> Bool

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

inside :: Point -> (X, Y, X, Y) -> Bool

Checks that a point belongs to an area.

bla :: X -> Y -> Int -> Point -> Point -> Maybe [Point]

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. The target is given as Point to permit aiming out of the level, e.g., to get uniform distributions of directions for explosions close to the edge of the level.

fromTo :: Point -> Point -> [Point]

A list of all points on a straight vertical or straight horizontal line between two points. Fails if no such line exists.

originPoint :: Point