pixel_map 0.4.0

A map of pixels implemented by an MX quadtree.
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126

use crate::{iline, ILine};
use bevy_math::{ivec2, uvec2, vec2, IRect, IVec2, Rect, URect, UVec2, Vec2};

/// Find the distance squared between two points.
#[inline]
#[must_use]
pub fn distance_squared_to_upoint(a: UVec2, b: UVec2) -> f32 {
    a.as_vec2().distance_squared(b.as_vec2())
}

/// Find the distance between two points.
#[inline]
#[must_use]
pub fn distance_to_upoint(a: UVec2, b: UVec2) -> f32 {
    distance_squared_to_upoint(a, b).sqrt()
}

#[inline]
#[must_use]
pub fn distance_squared_to_line(p: Vec2, line: &[Vec2; 2]) -> f32 {
    let v = line[0];
    let w = line[1];

    if v == w {
        return p.distance_squared(v);
    }

    let l2 = v.distance_squared(w);

    let t = ((p - v).dot(w - v) / l2).clamp(0., 1.);
    let projection = v + t * (w - v);
    p.distance_squared(projection)
}

#[inline]
#[must_use]
pub fn distance_to_line(p: Vec2, line: &[Vec2; 2]) -> f32 {
    distance_squared_to_line(p, line).sqrt()
}

/// Get the four points that make up the corners of the given `rect`.
#[inline]
#[must_use]
pub fn rect_points(rect: &Rect) -> [Vec2; 4] {
    [
        rect.min,
        rect.min + vec2(rect.width(), 0.),
        rect.max,
        rect.min + vec2(0., rect.height()),
    ]
}

/// Get the four points that make up the corners of the given `rect`.
#[inline]
#[must_use]
pub fn irect_points(rect: &IRect) -> [IVec2; 4] {
    [
        rect.min,
        rect.min + ivec2(rect.width(), 0),
        rect.max,
        rect.min + ivec2(0, rect.height()),
    ]
}

/// Get the four points that make up the corners of the given `rect`.
#[inline]
#[must_use]
pub fn urect_points(rect: &URect) -> [UVec2; 4] {
    [
        rect.min,
        rect.min + uvec2(rect.width(), 0),
        rect.max,
        rect.min + uvec2(0, rect.height()),
    ]
}

/// Get the four lines that make up the edges of this rectangle.
#[inline]
#[must_use]
pub fn irect_edges(rect: &IRect) -> [ILine; 4] {
    let min = rect.min;
    let max = rect.max;
    let width = rect.width();
    let height = rect.height();
    [
        iline(min, min + ivec2(width, 0)),
        iline(min + ivec2(width, 0), max),
        iline(max, min + ivec2(0, height)),
        iline(min + ivec2(0, height), min),
    ]
}

/// Convert the given `IRect` into a `URect`, without wrapping negative values,
/// effectively cropping the rectangle to the positive quadrant.
#[inline]
#[must_use]
pub fn to_cropped_urect(rect: &IRect) -> URect {
    URect::from_corners(
        rect.min.max(IVec2::ZERO).as_uvec2(),
        rect.max.max(IVec2::ZERO).as_uvec2(),
    )
}

/// Subtract one from the maximum point of the given `rect`, allowing
/// for exclusive handling with `contains`, for example.
#[inline]
#[must_use]
pub fn exclusive_irect(rect: &IRect) -> IRect {
    if rect.is_empty() {
        return *rect;
    }
    let max = rect.max - IVec2::ONE;
    IRect::from_corners(rect.min, max.max(rect.min))
}

/// Subtract one from the maximum point of the given `rect`, allowing
/// for exclusive handling with `contains`, for example.
#[inline]
#[must_use]
pub fn exclusive_urect(rect: &URect) -> URect {
    if rect.is_empty() || rect.max.x == 0 || rect.max.y == 0 {
        return *rect;
    }
    let max = rect.max - UVec2::ONE;
    URect::from_corners(rect.min, max.max(rect.min))
}