binpack-3d 0.1.0

A high-performance, deterministic 3D bin packing library written in Rust.
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

use binpack_3d::{
    algorithmen::Algorithmen3DBinPackaging,
    bin::Bin,
    items::Item,
    second_algorithmen::SecondAlgorithmen,
    vector::Vector3,
};
use rand::RngExt;

// Helper to generate random valid items and bin
fn generate_valid_test_case() -> (Bin, Vec<Item>) {
    let mut rng = rand::rng();

    // Generate bin with random dimensions (10-100 units) and capacity
    let bin_size = Vector3::new(
        rng.random_range(10..100),
        rng.random_range(10..100),
        rng.random_range(10..100),
    );
    let bin_weight_capacity = rng.random_range(1000..10000);
    let bin = Bin::new(1, bin_size, bin_weight_capacity, 0);

    // Generate 5-20 items with dimensions < bin and total volume/weight < bin
    let item_count = rng.random_range(5..20);
    let mut items = Vec::with_capacity(item_count);
    let mut total_volume = 0u32;
    let mut total_weight = 0u32;

    for _ in 0..item_count {
        // Ensure item dimensions are smaller than bin in all axes
        let item_size = Vector3::new(
            rng.random_range(1..bin_size.x),
            rng.random_range(1..bin_size.y),
            rng.random_range(1..bin_size.z),
        );
        let item_weight = rng.random_range(1..100);

        let item_volume = item_size.x * item_size.y * item_size.z;

        // Ensure we don't exceed 90% of bin capacity for buffer
        if ((total_volume + item_volume) as f32)
            < ((bin_size.x * bin_size.y * bin_size.z) as f32) * 0.9
        {
            items.push(Item::new(1, item_size, item_weight, 0));
            total_volume += item_volume;
            total_weight += item_weight;
        }
    }

    (bin, items)
}

#[test]
fn algorithmenfirst_random_valid() {
    let (bin, items) = generate_valid_test_case();
    let algorithmen_in = SecondAlgorithmen::create_algorithmen(items, bin).unwrap();
    let result = algorithmen_in.calculate();
    dbg!(&result);
    assert!(result.is_ok());
}

#[test]
fn algorithmenfirst_random_invalid() {
    let mut rng = rand::rng();

    // Generate bin with random dimensions
    let bin_size = Vector3::new(
        rng.random_range(10..100),
        rng.random_range(10..100),
        rng.random_range(10..100),
    );
    let bin_weight_capacity = rng.random_range(1000..10000);
    let bin = Bin::new(1, bin_size, bin_weight_capacity, 0);

    // Generate items that definitely exceed bin capacity
    let item = Item::new(
        1,
        bin_size + Vector3::new(1, 1, 1), // Slightly larger than bin
        bin_weight_capacity + 1,
        0,
    );
    let items = vec![item];

    let result = SecondAlgorithmen::check_fit_quick(&items, &bin);
    dbg!(&result);
    assert!(!result.0);
}

#[test]
fn algorithmenfirst_random_edge_cases() {
    // Test exact fit
    let bin_size = Vector3::new(10, 10, 10);
    let bin = Bin::new(1, bin_size, 1000, 0);
    let item = Item::new(1, bin_size, 1000, 0);
    let result = SecondAlgorithmen::create_algorithmen(vec![item], bin).unwrap();
    assert!(result.calculate().is_ok());

    // Test single item that fits
    let bin = Bin::new(1, Vector3::new(20, 20, 20), 8000, 0);
    let item = Item::new(1, Vector3::new(10, 10, 10), 100, 0);
    let result = SecondAlgorithmen::create_algorithmen(vec![item], bin).unwrap();
    assert!(result.calculate().is_ok());
}