bspa 0.1.1

Beam search packing algorithm
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164

mod area;
#[cfg(test)]
mod tests;

use std::hash::Hash;

#[cfg(feature = "rayon")]
use rayon::prelude::*;

use crate::{Area, Rect, RectGroup};

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct Placement<T: Area> {
    pub x: u32,
    pub y: u32,
    pub item: T,
}

impl<T: Area> Placement<T> {
    pub fn overlaps<U: Area>(&self, rhs: &Placement<U>) -> bool {
        let l_x = self.x + self.item.w();
        let l_y = self.y + self.item.h();
        let r_x = rhs.x + rhs.item.w();
        let r_y = rhs.y + rhs.item.h();

        ((rhs.x < l_x) & (r_x > self.x)) & ((rhs.y < l_y) & (r_y > self.y))
    }

    /// Split in `y` positive direction
    pub fn split_n<U: Area>(&self, rhs: &Placement<U>) -> Option<Placement<Rect>> {
        std::hint::select_unpredictable(
            rhs.y > self.y,
            Some(Placement {
                x: self.x,
                y: self.y,
                item: Rect::new(self.item.w(), rhs.y.saturating_sub(self.y)),
            }),
            None,
        )
    }

    /// Split in `y` negative direction
    pub fn split_s<U: Area>(&self, rhs: &Placement<U>) -> Option<Placement<Rect>> {
        std::hint::select_unpredictable(
            rhs.y + rhs.item.h() < self.y + self.item.h(),
            Some(Placement {
                x: self.x,
                y: rhs.y + rhs.item.h(),
                item: Rect::new(
                    self.item.w(),
                    (self.y + self.item.h()).saturating_sub(rhs.y + rhs.item.h()),
                ),
            }),
            None,
        )
    }

    /// Split in `x` positive direction
    pub fn split_e<U: Area>(&self, rhs: &Placement<U>) -> Option<Placement<Rect>> {
        std::hint::select_unpredictable(
            rhs.x > self.x,
            Some(Placement {
                x: self.x,
                y: self.y,
                item: Rect::new(rhs.x.saturating_sub(self.x), self.item.h()),
            }),
            None,
        )
    }

    /// Split in `x` negative direction
    pub fn split_w<U: Area>(&self, rhs: &Placement<U>) -> Option<Placement<Rect>> {
        std::hint::select_unpredictable(
            rhs.x + rhs.item.w() < self.x + self.item.w(),
            Some(Placement {
                x: rhs.x + rhs.item.w(),
                y: self.y,
                item: Rect::new(
                    (self.x + self.item.w()).saturating_sub(rhs.x + rhs.item.w()),
                    self.item.h(),
                ),
            }),
            None,
        )
    }

    #[allow(dead_code)]
    pub fn substract<U: Area>(self, rhs: &Placement<U>) -> impl Iterator<Item = Placement<Rect>>
    where
        T: Copy,
    {
        [
            self.split_n(rhs),
            self.split_s(rhs),
            self.split_e(rhs),
            self.split_w(rhs),
        ]
        .into_iter()
        .filter_map(|x| x.filter(|c| c.item.area() > 0))
    }

    #[cfg(feature = "rayon")]
    pub fn par_substract<U: Area + Sync>(
        self,
        rhs: &Placement<U>,
    ) -> impl ParallelIterator<Item = Placement<Rect>>
    where
        T: Sync,
    {
        [
            self.split_n(rhs),
            self.split_s(rhs),
            self.split_e(rhs),
            self.split_w(rhs),
        ]
        .into_par_iter()
        .filter_map(|x| x.filter(|c| c.item.area() > 0))
    }
}

impl Placement<RectGroup> {
    #[cfg(not(feature = "rayon"))]
    pub fn into_placed_rects(self) -> impl Iterator<Item = Placement<Rect>> {
        self.item.list.into_iter().map(move |p| Placement {
            x: self.x + p.x,
            y: self.y + p.y,
            item: p.item,
        })
    }

    #[cfg(feature = "rayon")]
    pub fn into_placed_rects(self) -> impl ParallelIterator<Item = Placement<Rect>> {
        self.item
            .list
            .into_iter()
            .map(move |p| Placement {
                x: self.x + p.x,
                y: self.y + p.y,
                item: p.item,
            })
            .par_bridge()
    }
}

impl<T: Area + PartialEq + Eq> PartialOrd for Placement<T> {
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        Some(self.cmp(other))
    }
}

impl<T: Area + Eq> Ord for Placement<T> {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        // min `y` then min `x` order
        ((self.x as u64) | ((self.y as u64) << 8))
            .cmp(&((other.x as u64) | ((other.y as u64) << 8)))
    }
}

impl<T: Area + Hash> Hash for Placement<T> {
    fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
        self.item.hash(state);
        state.write_u64((self.x as u64) | ((self.y as u64) << 8));
    }
}