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

use crate::{Area, BspaNode};

impl Area for BspaNode {
    #[inline]
    fn area(&self) -> u64 {
        Area::area(&self)
    }

    #[inline]
    fn fill_area(&self) -> u64 {
        Area::fill_area(&self)
    }

    #[inline]
    fn w(&self) -> u32 {
        Area::w(&self)
    }

    #[inline]
    fn h(&self) -> u32 {
        Area::h(&self)
    }
}

impl Area for &BspaNode {
    #[inline]
    fn area(&self) -> u64 {
        self.w() as u64 * self.h() as u64
    }

    #[inline]
    fn fill_area(&self) -> u64 {
        self.blocks.iter().map(|x| x.item.area()).sum()
    }

    #[inline]
    fn w(&self) -> u32 {
        let xmin = self.blocks.iter().map(|p| p.x).min().unwrap();
        let xmax = self.blocks.iter().map(|p| p.x + p.w()).max().unwrap();
        xmax - xmin
    }

    #[inline]
    fn h(&self) -> u32 {
        let ymin = self.blocks.iter().map(|p| p.y).min().unwrap();
        let ymax = self.blocks.iter().map(|p| p.y + p.h()).max().unwrap();
        ymax - ymin
    }
}