Module bracket_geometry::prelude

Structs

Bresenham	Line-drawing iterator
BresenhamCircle	An implementation of [Bresenham's circle algorithm]. [Bresenham's circle algorithm]: http://members.chello.at/~easyfilter/bresenham.html Derived from the line_drawing crate, but specialized to use BTerm's types.
BresenhamCircleNoDiag	A version of the Bresenham circle that does not make diagonal jumps
Point	Helper struct defining a 2D point in space.
Point3	Helper struct defining a 2D point in space.
Rect
VectorLine

Enums

DistanceAlg	Enumeration of available 2D Distance algorithms
LineAlg	Enumeration of available 2D Distance algorithms

Functions

line2d	Plots a line between two 2D points and returns a vector of points along the line.
line2d_bresenham	Uses a Bresenham's algorithm to plot a line between two points. On some CPUs, this is faster than Bresenham.
line2d_vector	Uses a 2D vector algorithm to plot a line between two points. On some CPUs, this is faster than Bresenham.
project_angle	From a given start point, project forward radius units at an angle of angle_radians degrees. 0 Degrees is north (negative Y), 90 degrees is east (positive X)