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
use super::*;
impl Table {
/// Insert a row at position y.
///
/// # Example
/// ```
/// table.insert_y(2);
/// println!("TABLE:\n{}", table);
/// ```
pub fn insert_y(&mut self, y: usize) {
let raw_table = &mut self.raw_table;
let tree_table = &mut self.tree_table;
let ref_src_table = &mut self.ref_src_table;
let dependents_table = &mut self.dependents_table;
let calculated_table = &mut self.calculated_table;
raw_table.insert(
y,
if let Some(last) = raw_table.last() {
(0..last.len()).map(|_| String::new()).collect()
} else {
vec![]
},
);
tree_table.insert(
y,
if let Some(last) = tree_table.last() {
(0..last.len())
.map(|_| Box::new(Value::Empty) as Box<ThreadSafeNode>)
.collect()
} else {
vec![]
},
);
ref_src_table.push(if let Some(last) = ref_src_table.last() {
(0..last.len()).map(|_| vec![]).collect()
} else {
vec![]
});
dependents_table.insert(
y,
if let Some(last) = dependents_table.last() {
(0..last.len()).map(|_| HashMap::new()).collect()
} else {
vec![]
},
);
calculated_table.insert(
y,
if let Some(last) = calculated_table.last() {
(0..last.len()).map(|_| Value::Empty).collect()
} else {
vec![]
},
);
*ref_src_table = ref_src_table
.iter()
.map(|refs_row| {
refs_row
.iter()
.map(|refs| {
refs.iter()
.map(|&(x_of_target, y_of_target)| {
if y_of_target >= y {
(x_of_target, y_of_target + 1)
} else {
(x_of_target, y_of_target)
}
})
.collect()
})
.collect()
})
.collect();
for y_of_src in (y + 1)..ref_src_table.len() {
for x_of_src in 0..ref_src_table[y_of_src].len() {
for i in 0..ref_src_table[y_of_src][x_of_src].len() {
let (x, y) = ref_src_table[y_of_src][x_of_src][i];
Self::calc(
x,
y,
tree_table,
ref_src_table,
dependents_table,
calculated_table,
&mut vec![],
);
}
}
}
}
/// Insert a column at position x.
///
/// # Example
/// ```
/// table.insert_x(2);
/// println!("TABLE:\n{}", table);
/// ```
pub fn insert_x(&mut self, x: usize) {
let raw_table = &mut self.raw_table;
let tree_table = &mut self.tree_table;
let ref_src_table = &mut self.ref_src_table;
let dependents_table = &mut self.dependents_table;
let calculated_table = &mut self.calculated_table;
for line in raw_table.iter_mut() {
line.insert(x, String::new());
}
for line in tree_table.iter_mut() {
line.insert(x, Box::new(Value::Empty));
}
for line in ref_src_table.iter_mut() {
line.push(vec![]);
}
for line in dependents_table.iter_mut() {
line.insert(x, HashMap::new());
}
for line in calculated_table.iter_mut() {
line.insert(x, Value::Empty);
}
*ref_src_table = ref_src_table
.iter()
.map(|refs_row| {
refs_row
.iter()
.map(|refs| {
refs.iter()
.map(|&(x_of_target, y_of_target)| {
if x_of_target >= x {
(x_of_target + 1, y_of_target)
} else {
(x_of_target, y_of_target)
}
})
.collect()
})
.collect()
})
.collect();
for y_of_src in 0..ref_src_table.len() {
for x_of_src in (x + 1)..ref_src_table[y_of_src].len() {
for i in 0..ref_src_table[y_of_src][x_of_src].len() {
let (x, y) = ref_src_table[y_of_src][x_of_src][i];
Self::calc(
x,
y,
tree_table,
ref_src_table,
dependents_table,
calculated_table,
&mut vec![],
);
}
}
}
}
}