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
#[derive(Default, Debug, Clone)]
pub struct RectangleMapEntry {
x: u32,
y: u32,
width: u32,
height: u32,
}
#[derive(Debug, Clone)]
pub enum RectangleMapNodeType {
Branch,
FilledLeaf,
EmptyLeaf,
}
impl Default for RectangleMapNodeType {
fn default() -> Self {
Self::EmptyLeaf
}
}
#[derive(Default, Debug, Clone)]
pub struct RectangleMapNode {
kind: RectangleMapNodeType,
rectangle: RectangleMapEntry,
largest_gap: u32,
parent: Option<Box<RectangleMapNode>>,
// union
// {
// /* Fields used when this is a branch */
// struct
// {
// RectangleMapNode *left;
// RectangleMapNode *right;
// } branch;
// /* Field used when this is a filled leaf */
// void *data;
// } d;
}
#[derive(Default, Debug, Clone)]
pub struct RectangleMapStackEntry {
// The node to search
node: Option<RectangleMapNode>,
// Index of next branch of this node to explore. Basically either 0
// to go left or 1 to go right
next_index: bool,
}
#[derive(Default, Debug, Clone)]
pub struct RectangleMap {
root: Option<RectangleMapNode>,
n_rectangles: u32,
space_remaining: u32,
// value_destroy_func: GDestroyNotify,
// Stack used for walking the structure. This is only used during
// the lifetime of a single fn call but it is kept here as an
// optimisation to avoid reallocating it every time it is needed */
// stack: Option<Vec<>>,
}
impl RectangleMap {
pub fn new() -> Self {
unimplemented!()
}
pub fn stack_push() {}
pub fn stack_pop() {}
pub fn stack_get_top() {}
pub fn node_split_horizontally() {}
pub fn node_split_vertically() {}
pub fn verify_recursive() {}
pub fn space_remaining_recursive() {}
pub fn verify() {}
pub fn add() {}
pub fn remove() {}
pub fn width() {}
pub fn height() {}
pub fn remaining_space() {}
pub fn n_rectangles() {}
pub fn internal_foreach() {}
pub fn foreach_cb() {}
pub fn foreach() {}
pub fn free_cb() {}
pub fn dump_image_cb() {}
pub fn dump_image() {}
}
// pub struct RectangleMapForeachClosure {
// RectangleMapCallback callback;
// void *data;
// }