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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
/*
* Copyright (c) Meta Platforms, Inc. and affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
use super::TestDag;
use crate::ops::DagAlgorithm;
use crate::ops::IdConvert;
#[tokio::test]
async fn test_strip_basic() {
// Test strip C (and its descendants D, E), then H.
// C, D are in the master group. E, F::I are in non-master.
let mut dag = TestDag::draw_client(
r#"
A--B--C--D--E
\
F--G--H--I
# master: D"#,
)
.await;
// Note "B" is not known locally - it's lazy.
let state_before_strip = dag.dump_state().await;
assert_eq!(
&state_before_strip,
r#"<spans [F:E+N0:N4, A:D+0:3]>
Lv0: RH0-3[], N0-N3[0], N4-N4[3]
P->C: 0->N0, 3->N4
0->A 3->D N0->F N1->G N2->H N3->I N4->E"#
);
// Strip C.
// Note "B" becomes the new "head" and is currently lazy.
// So strip needs extra work to ensure "B" is non-lazy.
dag.strip("C").await;
let state_after_strip = dag.dump_state().await;
assert_eq!(
&state_after_strip,
r#"<spans [F:I+N0:N3, A:B+0:1]>
Lv0: RH0-1[], N0-N3[0]
P->C: 0->N0
0->A 1->B N0->F N1->G N2->H N3->I"#
);
// Check that strip is persisted and can be seen after reopen.
dag.reopen();
assert_eq!(&dag.dump_state().await, &state_after_strip);
// Strip H. The F-I segment is truncated to F-G.
dag.strip("H").await;
assert_eq!(
dag.dump_state().await,
r#"<spans [F:G+N0:N1, A:B+0:1]>
Lv0: RH0-1[], N0-N1[0]
P->C: 0->N0
0->A 1->B N0->F N1->G"#
);
}
#[tokio::test]
async fn test_strip_branch_and_parent_remains_lazy() {
// Test that stripping a (broken) branch does not resolve
// the branching point. This allows strip to remove "broken"
// branches (ex. removed by server) without resolving new
// vertexes remotely, because the remote protocol might not
// work.
let ascii = r#"
A--B--C--D--E
\
F--G
# master: D F"#;
let dag = TestDag::draw_client(ascii).await;
assert_eq!(
dag.dump_state().await,
r#"<spans [G:E+N0:N1, 0:4]>
Lv0: RH0-3[], 4-4[1], N0-N0[4], N1-N1[3]
P->C: 1->4, 3->N1, 4->N0
3->D 4->F N0->G N1->E"#
);
let strip = |s: &'static str| async move {
let mut dag = TestDag::draw_client(ascii).await;
dag.strip(s).await;
dag.dump_state().await
};
// Strip C. B is still lazy because it's not a head.
assert_eq!(
strip("C").await,
r#"<spans [G+N0, F+4, 0:1]>
Lv0: RH0-1[], 4-4[1], N0-N0[4]
P->C: 1->4, 4->N0
4->F N0->G"#
);
// Strip F. B is still lazy as well.
assert_eq!(
strip("F").await,
"<spans [E+N1, 0:3]>\nLv0: RH0-3[], N1-N1[3]\nP->C: 3->N1\n3->D N1->E"
);
// Strip C+F. B is no longer lazy.
assert_eq!(strip("C F").await, "<spans [0:1]>\nLv0: RH0-1[]\n1->B");
}
#[tokio::test]
async fn test_reinsert_then_create_higher_level() {
// Test re-inserting a stripped "gap" and then creating higher level segments.
//
// Initial state:
//
// Lv0: |0|1|2|3|4|5|6|7|8|9|10|
// Lv1: |-|---|-|---|---|---|
// Lv2: |-----|-|-------|
//
// Strip 3:
//
// Lv0: |0|1|2| |4|5|6|7|8|9|10|
// Lv1: |-|---| |---|---|---|
// Lv2: |-----| |-------|
//
// Reinsert 3 (Note: 3 no longer has Lv1 and Lv2 segments):
//
// Lv0: |0|1|2|3|4|5|6|7|8|9|10|
// Lv1: |-|---| |---|---|---|
// Lv2: |-----| |-------|
//
// Trigger Lv3 segment creation:
//
// Lv0: |0|1|2|3|4|5|6|7|8|9|10|11|12|13|14|
// Lv1: |-|---| |---|---|---|-----|-----|
// Lv2: |-----| |-------|---------|
// Lv3: ? |-----------------|
let mut dag = TestDag::new_with_segment_size(2);
// Use "Z" as an extra parent to avoid merging flat segments.
dag.drawdag("Z", &[]);
for i in 1..=10 {
let ascii = match i {
1 | 3 | 4 => format!("A{i}", i = i),
_ => format!("Z-A{i} A{p}-A{i}", p = i - 1, i = i),
};
dag.drawdag(&ascii, &[]);
}
dag.flush("").await;
assert_eq!(
dag.dump_segments_ascii(),
r#"
Lv0: |N0|N1|N2|N3|N4|N5|N6|N7|N8|N9|N10|
Lv1: |N0|N1 N2|N3|N4 N5|N6 N7|N8 N9|
Lv2: |N0 N1 N2|N3|N4 N5 N6 N7|"#
);
// Strip 3.
dag.strip("A3").await;
assert_eq!(
dag.dump_segments_ascii(),
r#"
Lv0: |N0|N1|N2| |N4|N5|N6|N7|N8|N9|N10|
Lv1: |N0|N1 N2| |N4 N5|N6 N7|N8 N9|
Lv2: |N0 N1 N2| |N4 N5 N6 N7|"#
);
// Reinsert 3. Note A3 does not have Lv1 or Lv2 segments.
dag.drawdag("A2-A3 Z-A3", &[]);
assert_eq!(
dag.dump_segments_ascii(),
r#"
Lv0: |N0|N1|N2|N3|N4|N5|N6|N7|N8|N9|N10|
Lv1: |N0|N1 N2| |N4 N5|N6 N7|N8 N9|
Lv2: |N0 N1 N2| |N4 N5 N6 N7|"#
);
// Try to create Lv3 segments. This does not crash.
dag.drawdag("A10-A11 A3-A11", &[]);
for i in 12..=18 {
let ascii = format!("Z-A{i} A{p}-A{i}", p = i - 1, i = i);
dag.drawdag(&ascii, &[]);
}
assert_eq!(
dag.dump_segments_ascii(),
r#"
Lv0: |N0|N1|N2|N3|N4|N5|N6|N7|N8|N9|N10|N11|N12|N13|N14|N15|N16|N17|N18|
Lv1: |N0|N1 N2| |N4 N5|N6 N7|N8 N9|N10 N11|N12 N13|N14 N15|N16 N17|
Lv2: |N0 N1 N2| |N4 N5 N6 N7|N8 N9 N10 N11|N12 N13 N14 N15|
Lv3: |N0 N1 N2| |N4 N5 N6 N7 N8 N9 N10 N11|"#
);
}
#[tokio::test]
async fn test_strip_update_version() {
let mut t = TestDag::draw_client("A..E").await;
let dag_version = t.dag.dag_version().clone();
let map_version = t.dag.map_version().clone();
// Version is not changed after reopen.
t.reopen();
assert_eq!(&dag_version, t.dag.dag_version());
assert_eq!(&map_version, t.dag.map_version());
// Version is compatible after appending.
t.drawdag("E-F", &[]);
t.flush("").await;
assert!(&dag_version < t.dag.dag_version());
assert!(&map_version < t.dag.map_version());
// Version is incompatible after strip.
t.strip("D").await;
assert_eq!(dag_version.partial_cmp(t.dag.dag_version()), None);
assert_eq!(map_version.partial_cmp(t.dag.map_version()), None);
}