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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
|
//! Unit tests for the set module
use std::collections::HashSet;
use meta_affine::{ValidSet, Value};
use meta_affine::set::*;
// ========================================================================
// VALID SET CREATION TESTS
// ========================================================================
#[test]
fn test_new_empty_set() {
let set = ValidSet::new();
assert_eq!(set.size(), 0);
assert!(set.is_valid()); // Empty set is vacuously valid
}
#[test]
fn test_origin_set() {
let set = ValidSet::origin_set();
assert_eq!(set.size(), 1);
assert!(set.contains(&Value::origin()));
assert!(set.is_valid());
}
#[test]
fn test_from_values_valid() {
let mut values = HashSet::new();
values.insert(Value::new(0, 0));
values.insert(Value::new(1, 0));
values.insert(Value::new(1, 1));
let set = ValidSet::from_values(values).unwrap();
assert_eq!(set.size(), 3);
assert!(set.is_valid());
}
#[test]
fn test_from_values_invalid() {
// Missing (1,0) - not downward closed
let mut values = HashSet::new();
values.insert(Value::new(0, 0));
values.insert(Value::new(1, 1));
let result = ValidSet::from_values(values);
assert!(result.is_err());
}
#[test]
fn test_from_values_invalid_missing_origin() {
// Missing origin
let mut values = HashSet::new();
values.insert(Value::new(1, 0));
let result = ValidSet::from_values(values);
assert!(result.is_err());
}
// ========================================================================
// VALIDITY CHECKING TESTS
// ========================================================================
#[test]
fn test_is_valid_simple_cases() {
// {(0,0)}
let set1 = ValidSet::origin_set();
assert!(set1.is_valid());
// {(0,0), (1,0)}
let mut values = HashSet::new();
values.insert(Value::new(0, 0));
values.insert(Value::new(1, 0));
let set2 = ValidSet::from_values(values).unwrap();
assert!(set2.is_valid());
// {(0,0), (0,1)}
let mut values = HashSet::new();
values.insert(Value::new(0, 0));
values.insert(Value::new(0, 1));
let set3 = ValidSet::from_values(values).unwrap();
assert!(set3.is_valid());
}
#[test]
fn test_is_valid_complex_path() {
// {(0,0), (1,0), (2,0), (2,1), (2,2), (2,3)}
let mut values = HashSet::new();
values.insert(Value::new(0, 0));
values.insert(Value::new(1, 0));
values.insert(Value::new(2, 0));
values.insert(Value::new(2, 1));
values.insert(Value::new(2, 2));
values.insert(Value::new(2, 3));
let set = ValidSet::from_values(values).unwrap();
assert!(set.is_valid());
}
#[test]
fn test_is_valid_negative_values() {
// {(0,0), (-1,0), (-1,-1)}
let mut values = HashSet::new();
values.insert(Value::new(0, 0));
values.insert(Value::new(-1, 0));
values.insert(Value::new(-1, -1));
let set = ValidSet::from_values(values).unwrap();
assert!(set.is_valid());
}
#[test]
fn test_invalid_missing_intermediate() {
// Missing (1,0) - should be invalid
let mut values = HashSet::new();
values.insert(Value::new(0, 0));
values.insert(Value::new(2, 0));
let result = ValidSet::from_values(values);
assert!(result.is_err());
}
// ========================================================================
// SET OPERATIONS TESTS
// ========================================================================
#[test]
fn test_add_value() {
let set = ValidSet::origin_set();
// Add (1,0) to {(0,0)}
let set2 = set.add_value(Value::new(1, 0)).unwrap();
assert_eq!(set2.size(), 2);
assert!(set2.contains(&Value::new(1, 0)));
// Original set unchanged (immutability)
assert_eq!(set.size(), 1);
}
#[test]
fn test_add_value_invalid() {
let set = ValidSet::origin_set();
// Try to add (2,0) without (1,0) - should fail
let result = set.add_value(Value::new(2, 0));
assert!(result.is_err());
}
#[test]
fn test_add_value_with_dependencies() {
let set = ValidSet::new();
// Add (2,3) with all dependencies
let set2 = set.add_value_with_dependencies(Value::new(2, 3));
// Should contain: (0,0), (1,0), (2,0), (2,1), (2,2), (2,3)
assert_eq!(set2.size(), 6);
assert!(set2.contains(&Value::new(0, 0)));
assert!(set2.contains(&Value::new(1, 0)));
assert!(set2.contains(&Value::new(2, 0)));
assert!(set2.contains(&Value::new(2, 1)));
assert!(set2.contains(&Value::new(2, 2)));
assert!(set2.contains(&Value::new(2, 3)));
assert!(set2.is_valid());
}
#[test]
fn test_contains() {
let set = ValidSet::origin_set();
assert!(set.contains(&Value::origin()));
assert!(!set.contains(&Value::new(1, 0)));
}
#[test]
fn test_size() {
let set = ValidSet::origin_set();
assert_eq!(set.size(), 1);
let set2 = set.add_value(Value::new(1, 0)).unwrap();
assert_eq!(set2.size(), 2);
}
#[test]
fn test_values_iterator() {
let mut values = HashSet::new();
values.insert(Value::new(0, 0));
values.insert(Value::new(1, 0));
values.insert(Value::new(0, 1));
let set = ValidSet::from_values(values.clone()).unwrap();
let collected: HashSet<Value> = set.values().copied().collect();
assert_eq!(collected, values);
}
#[test]
fn test_values_sorted() {
let mut values = HashSet::new();
values.insert(Value::new(1, 0));
values.insert(Value::new(0, 1));
values.insert(Value::new(0, 0));
values.insert(Value::new(-1, 0));
let set = ValidSet::from_values(values).unwrap();
let sorted = set.values_sorted();
// Should be sorted by (outer, inner)
assert_eq!(sorted[0], Value::new(-1, 0));
assert_eq!(sorted[1], Value::new(0, 0));
assert_eq!(sorted[2], Value::new(0, 1));
assert_eq!(sorted[3], Value::new(1, 0));
}
// ========================================================================
// SET GENERATION TESTS
// ========================================================================
#[test]
fn test_generate_valid_sets_size_1() {
let sets = generate_valid_sets(1);
// Should only have {(0,0)}
assert_eq!(sets.len(), 1);
assert_eq!(sets[0].size(), 1);
assert!(sets[0].contains(&Value::origin()));
}
#[test]
fn test_generate_valid_sets_size_2() {
let sets = generate_valid_sets(2);
// Should include:
// {(0,0)}
// {(0,0), (1,0)}
// {(0,0), (-1,0)}
// {(0,0), (0,1)}
// {(0,0), (0,-1)}
assert!(sets.len() >= 5);
// Check that all generated sets are valid
for set in &sets {
assert!(set.is_valid(), "Generated set is not valid: {:?}", set);
}
// Check specific sets exist
let has_origin_plus_1_0 = sets.iter().any(|s| {
s.size() == 2 && s.contains(&Value::origin()) && s.contains(&Value::new(1, 0))
});
assert!(has_origin_plus_1_0);
let has_origin_plus_0_1 = sets.iter().any(|s| {
s.size() == 2 && s.contains(&Value::origin()) && s.contains(&Value::new(0, 1))
});
assert!(has_origin_plus_0_1);
}
#[test]
fn test_generate_valid_sets_size_3() {
let sets = generate_valid_sets(3);
// Should include all from size 2, plus new size-3 sets
assert!(sets.len() > 5);
// All sets should be valid
for set in &sets {
assert!(set.is_valid(), "Generated set is not valid");
}
// Check a specific size-3 set exists: {(0,0), (1,0), (1,1)}
let has_target_set = sets.iter().any(|s| {
s.size() == 3
&& s.contains(&Value::new(0, 0))
&& s.contains(&Value::new(1, 0))
&& s.contains(&Value::new(1, 1))
});
assert!(has_target_set);
}
#[test]
fn test_generate_valid_sets_all_valid() {
// Generate sets up to size 4 and verify all are valid
let sets = generate_valid_sets(4);
for set in &sets {
assert!(set.is_valid(), "Generated invalid set: {:?}", set);
}
// Should have generated multiple sets
assert!(sets.len() > 10);
}
#[test]
fn test_generate_valid_sets_no_duplicates() {
let sets = generate_valid_sets(4);
// Check for duplicates manually
for i in 0..sets.len() {
for j in (i + 1)..sets.len() {
assert_ne!(&sets[i], &sets[j], "Found duplicate sets at indices {} and {}", i, j);
}
}
}
#[test]
fn test_generate_valid_sets_of_size() {
let sets = generate_valid_sets_of_size(3);
// All sets should have size exactly 3
for set in &sets {
assert_eq!(set.size(), 3);
assert!(set.is_valid());
}
// Should have multiple size-3 sets
assert!(sets.len() > 3);
}
// ========================================================================
// PROPERTY-BASED TESTS
// ========================================================================
#[test]
fn test_all_generated_sets_contain_origin() {
let sets = generate_valid_sets(5);
for set in &sets {
if set.size() > 0 {
assert!(
set.contains(&Value::origin()),
"Non-empty valid set must contain origin"
);
}
}
}
#[test]
fn test_downward_closure_property() {
// For any value in a generated set, all values in its path must be in the set
let sets = generate_valid_sets(5);
for set in &sets {
for &value in set.values() {
let path = meta_affine::value::get_minimum_derivation_path(value);
for dep in path {
assert!(
set.contains(&dep),
"Set {:?} contains {} but missing dependency {}",
set.values_sorted(),
value,
dep
);
}
}
}
}
#[test]
fn test_immutability_of_operations() {
let set1 = ValidSet::origin_set();
let original_size = set1.size();
// Add a value
let _set2 = set1.add_value(Value::new(1, 0)).unwrap();
// Original set should be unchanged
assert_eq!(set1.size(), original_size);
assert!(!set1.contains(&Value::new(1, 0)));
}
// ========================================================================
// EDGE CASES
// ========================================================================
#[test]
fn test_empty_set_is_valid() {
let set = ValidSet::new();
assert!(set.is_valid());
}
#[test]
fn test_generate_sets_size_zero() {
let sets = generate_valid_sets(0);
assert_eq!(sets.len(), 1);
assert_eq!(sets[0].size(), 0);
}
#[test]
fn test_large_value_with_dependencies() {
// Test that adding a "far" value includes all intermediate values
let set = ValidSet::new();
let set2 = set.add_value_with_dependencies(Value::new(3, 4));
// Path length for (3,4) is 3 + 4 + 1 = 8
assert_eq!(set2.size(), 8);
assert!(set2.is_valid());
}
#[test]
fn test_negative_coordinates() {
let set = ValidSet::new();
let set2 = set.add_value_with_dependencies(Value::new(-2, -3));
// Should contain: (0,0), (-1,0), (-2,0), (-2,-1), (-2,-2), (-2,-3)
assert_eq!(set2.size(), 6);
assert!(set2.contains(&Value::new(-1, 0)));
assert!(set2.contains(&Value::new(-2, -1)));
assert!(set2.is_valid());
}
#[test]
fn test_mixed_signs() {
let set = ValidSet::new();
let set2 = set.add_value_with_dependencies(Value::new(2, -3));
// Path: (0,0), (1,0), (2,0), (2,-1), (2,-2), (2,-3)
assert_eq!(set2.size(), 6);
assert!(set2.is_valid());
}
|