latkit 0.2.0

Columnar data drawn as vertices, edges, lines, and areas on the GPU.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

//! Boxes on the plane, least x and y then greatest, and the points they hold.

/// A point on the plane.
pub(crate) type Point = [f64; 2];

/// A box: least x, least y, greatest x, greatest y.
pub(crate) type Rect = [f64; 4];

/// A box holding nothing, which any union replaces.
pub(crate) const EMPTY: Rect = [f64::INFINITY, f64::INFINITY, f64::NEG_INFINITY, f64::NEG_INFINITY];

/// The box holding `a` and `b`.
pub(crate) fn union(a: Rect, b: Rect) -> Rect {
    [a[0].min(b[0]), a[1].min(b[1]), a[2].max(b[2]), a[3].max(b[3])]
}

/// The box holding only `p`.
pub(crate) fn dot(p: Point) -> Rect {
    [p[0], p[1], p[0], p[1]]
}

/// The box `half` its width and height each way about `center`.
pub(crate) fn around(center: Point, half: Point) -> Rect {
    [center[0] - half[0], center[1] - half[1], center[0] + half[0], center[1] + half[1]]
}

/// `r` grown by `by` on every side.
pub(crate) fn grow(r: Rect, by: f64) -> Rect {
    [r[0] - by, r[1] - by, r[2] + by, r[3] + by]
}

/// Whether two boxes meet, touching included.
pub(crate) fn meets(a: &Rect, b: &Rect) -> bool {
    a[0] <= b[2] && a[2] >= b[0] && a[1] <= b[3] && a[3] >= b[1]
}