oxedyne/fe2o3/fe2o3_data/tests/map3.rs
2.3 KiB, 1 run
created by r1870400018:76453, which is this file's identity for as long as the history lasts, whatever it is later renamed to
download · who wrote it · its history
| 1 | //! Tests for the three-way map merge, one per cell of its table. |
| 2 | |
| 3 | use oxedyne_fe2o3_data::map3::{ |
| 4 | merge3, |
| 5 | Merge3, |
| 6 | }; |
| 7 | |
| 8 | use std::collections::{ |
| 9 | BTreeMap, |
| 10 | BTreeSet, |
| 11 | }; |
| 12 | |
| 13 | |
| 14 | fn map(kv: &[(&'static str, u8)]) -> BTreeMap<&'static str, u8> { |
| 15 | kv.iter().cloned().collect() |
| 16 | } |
| 17 | |
| 18 | fn set(ks: &[&'static str]) -> BTreeSet<&'static str> { |
| 19 | ks.iter().cloned().collect() |
| 20 | } |
| 21 | |
| 22 | #[test] |
| 23 | fn unchanged_both_sides_is_in_no_set() { |
| 24 | let b = map(&[("a", 1)]); |
| 25 | let m = merge3(&b, &b, &b); |
| 26 | assert_eq!(m, Merge3::default()); |
| 27 | assert!(m.is_clean()); |
| 28 | } |
| 29 | |
| 30 | #[test] |
| 31 | fn theirs_changed_alone_is_taken() { |
| 32 | let b = map(&[("a", 1), ("d", 4)]); |
| 33 | let o = b.clone(); |
| 34 | let t = map(&[("a", 2), ("n", 9)]); // a edited, d deleted, n added |
| 35 | let m = merge3(&b, &o, &t); |
| 36 | assert_eq!(m.take, set(&["a", "d", "n"])); |
| 37 | assert!(m.keep.is_empty()); |
| 38 | assert!(m.is_clean()); |
| 39 | } |
| 40 | |
| 41 | #[test] |
| 42 | fn ours_changed_alone_is_kept() { |
| 43 | let b = map(&[("a", 1), ("d", 4)]); |
| 44 | let o = map(&[("a", 2), ("n", 9)]); |
| 45 | let t = b.clone(); |
| 46 | let m = merge3(&b, &o, &t); |
| 47 | assert_eq!(m.keep, set(&["a", "d", "n"])); |
| 48 | assert!(m.take.is_empty()); |
| 49 | assert!(m.is_clean()); |
| 50 | } |
| 51 | |
| 52 | #[test] |
| 53 | fn both_changed_differently_conflicts() { |
| 54 | let b = map(&[("a", 1), ("d", 4)]); |
| 55 | let o = map(&[("a", 2), ("n", 7)]); // d deleted here |
| 56 | let t = map(&[("a", 3), ("d", 5), ("n", 8)]); // d edited there |
| 57 | let m = merge3(&b, &o, &t); |
| 58 | assert_eq!(m.conflict, set(&["a", "d", "n"])); |
| 59 | assert!(m.take.is_empty()); |
| 60 | assert!(m.keep.is_empty()); |
| 61 | assert!(!m.is_clean()); |
| 62 | } |
| 63 | |
| 64 | #[test] |
| 65 | fn both_deleted_is_kept_without_conflict() { |
| 66 | let b = map(&[("a", 1), ("s", 2)]); |
| 67 | let o = map(&[("s", 2)]); |
| 68 | let t = map(&[("s", 2)]); |
| 69 | let m = merge3(&b, &o, &t); |
| 70 | assert_eq!(m.keep, set(&["a"])); |
| 71 | assert!(m.take.is_empty()); |
| 72 | assert!(m.is_clean()); |
| 73 | } |
| 74 | |
| 75 | #[test] |
| 76 | fn same_bytes_both_sides_is_kept_without_conflict() { |
| 77 | let b = map(&[("a", 1)]); |
| 78 | let o = map(&[("a", 2), ("n", 9)]); |
| 79 | let t = map(&[("a", 2), ("n", 9)]); |
| 80 | let m = merge3(&b, &o, &t); |
| 81 | assert_eq!(m.keep, set(&["a", "n"])); |
| 82 | assert!(m.take.is_empty()); |
| 83 | assert!(m.is_clean()); |
| 84 | } |
| 85 | |
| 86 | #[test] |
| 87 | fn mixed_keys_sort_independently() { |
| 88 | let b = map(&[("k", 1), ("t", 1), ("c", 1), ("u", 1)]); |
| 89 | let o = map(&[("k", 2), ("t", 1), ("c", 2), ("u", 1)]); |
| 90 | let t = map(&[("k", 1), ("t", 2), ("c", 3), ("u", 1)]); |
| 91 | let m = merge3(&b, &o, &t); |
| 92 | assert_eq!(m.take, set(&["t"])); |
| 93 | assert_eq!(m.keep, set(&["k"])); |
| 94 | assert_eq!(m.conflict, set(&["c"])); |
| 95 | } |