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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
use crate::{buffer::Settings, Cell};
pub use direction::Direction;
pub use fragment::Fragment;
pub use fragment_tree::FragmentTree;
use itertools::Itertools;
use std::{
collections::BTreeMap,
ops::{Deref, DerefMut},
};
pub mod direction;
pub mod fragment;
mod fragment_tree;
#[derive(Debug)]
pub struct FragmentBuffer(BTreeMap<Cell, Vec<Fragment>>);
impl Deref for FragmentBuffer {
type Target = BTreeMap<Cell, Vec<Fragment>>;
fn deref(&self) -> &Self::Target {
&self.0
}
}
impl DerefMut for FragmentBuffer {
fn deref_mut(&mut self) -> &mut Self::Target {
&mut self.0
}
}
impl FragmentBuffer {
pub fn new() -> Self {
FragmentBuffer(BTreeMap::new())
}
pub fn dump(&self) -> String {
let mut buff = String::new();
for (cell, shapes) in self.iter() {
buff.push_str(&format!("\ncell: {} ", cell));
for shape in shapes {
buff.push_str(&format!("\n {}", shape));
}
}
buff
}
pub fn add_fragment_to_cell(&mut self, cell: Cell, fragment: Fragment) {
if let Some(existing) = self.get_mut(&cell) {
existing.push(fragment);
} else {
self.insert(cell, vec![fragment]);
}
self.sort_fragments_in_cell(cell);
}
fn sort_fragments_in_cell(&mut self, cell: Cell) {
if let Some(fragments) = &mut self.get_mut(&cell) {
(*fragments).sort();
}
}
fn bounds(&self) -> Option<(Cell, Cell)> {
let xlimits = self.iter().map(|(cell, _)| cell.x).minmax().into_option();
let ylimits = self.iter().map(|(cell, _)| cell.y).minmax().into_option();
match (xlimits, ylimits) {
(Some((min_x, max_x)), Some((min_y, max_y))) => {
Some((Cell::new(min_x, min_y), Cell::new(max_x, max_y)))
}
_ => None,
}
}
pub(crate) fn get_size(&self, settings: &Settings) -> (f32, f32) {
let (top_left, bottom_right) = self.bounds().unwrap_or((Cell::new(0, 0), Cell::new(0, 0)));
let w = settings.scale * (bottom_right.x + 2) as f32 * Cell::width();
let h = settings.scale * (bottom_right.y + 2) as f32 * Cell::height();
(w, h)
}
pub fn add_fragments_to_cell(&mut self, cell: Cell, fragments: Vec<Fragment>) {
if let Some(existing) = self.get_mut(&cell) {
existing.extend(fragments);
} else {
self.insert(cell, fragments);
}
self.sort_fragments_in_cell(cell);
}
pub(crate) fn merge_fragments(&self) -> Vec<Fragment> {
let fragments = self.first_pass_merge();
Self::merge_recursive(fragments)
}
fn first_pass_merge(&self) -> Vec<Fragment> {
let mut merged: Vec<Fragment> = vec![];
for (cell, fragments) in self.iter() {
for frag in fragments.iter() {
let abs_frag = frag.absolute_position(*cell);
let had_merged = merged.iter_mut().rev().any(|mfrag| {
if mfrag.can_merge(&abs_frag) {
if let Some(new_merge) = mfrag.merge(&abs_frag) {
*mfrag = new_merge;
} else {
panic!("Should merged");
}
true
} else {
false
}
});
if !had_merged {
merged.push(abs_frag);
}
}
}
merged
}
fn merge_recursive(fragments: Vec<Fragment>) -> Vec<Fragment> {
let original_len = fragments.len();
let merged = Self::second_pass_merge(fragments);
if merged.len() < original_len {
Self::merge_recursive(merged)
} else {
merged
}
}
fn second_pass_merge(fragments: Vec<Fragment>) -> Vec<Fragment> {
let mut new_fragments: Vec<Fragment> = vec![];
for fragment in fragments.into_iter() {
let is_merged = new_fragments.iter_mut().rev().any(|new_frag| {
if new_frag.can_merge(&fragment) {
*new_frag = new_frag.merge(&fragment).expect("should merge");
true
} else {
false
}
});
if !is_merged {
new_fragments.push(fragment);
}
}
new_fragments
}
}