oxedyne/fe2o3/fe2o3_data/tests/diff.rs
2.3 KiB, 2 runs
created by r1870400018:70655, 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 shortest edit script. |
| 2 | |
| 3 | use oxedyne_fe2o3_data::diff::{ |
| 4 | changed_runs, |
| 5 | matches, |
| 6 | Change, |
| 7 | }; |
| 8 | |
| 9 | |
| 10 | #[test] |
| 11 | fn empty_sides_match_nothing() { |
| 12 | let e: [u8; 0] = []; |
| 13 | assert_eq!(matches(&e, &e, 10), Some(Vec::new())); |
| 14 | assert_eq!(changed_runs(&e, &e, 10), Some(Vec::new())); |
| 15 | assert_eq!(matches(&e, b"abc", 10), Some(Vec::new())); |
| 16 | assert_eq!(changed_runs(b"abc", &e, 0), Some(vec![Change { a: 0..3, b: 0..0 }])); |
| 17 | assert_eq!(changed_runs(&e, b"abc", 0), Some(vec![Change { a: 0..0, b: 0..3 }])); |
| 18 | } |
| 19 | |
| 20 | #[test] |
| 21 | fn equal_sides_match_everywhere() { |
| 22 | let a = b"abcdef"; |
| 23 | assert_eq!(matches(a, a, 0), Some((0..6).map(|i| (i, i)).collect())); |
| 24 | assert_eq!(changed_runs(a, a, 0), Some(Vec::new())); |
| 25 | } |
| 26 | |
| 27 | #[test] |
| 28 | fn disjoint_sides_are_one_change() { |
| 29 | let (a, b) = (b"abc", b"xyzw"); |
| 30 | assert_eq!(matches(a, b, 7), Some(Vec::new())); |
| 31 | assert_eq!(changed_runs(a, b, 7), Some(vec![Change { a: 0..3, b: 0..4 }])); |
| 32 | } |
| 33 | |
| 34 | #[test] |
| 35 | fn budget_exceeded_gives_none() { |
| 36 | let (a, b) = (b"abc", b"xyz"); |
| 37 | // Six edits are needed, so five is one short. |
| 38 | assert_eq!(matches(a, b, 5), None); |
| 39 | assert!(matches(a, b, 6).is_some()); |
| 40 | assert_eq!(changed_runs(b"pabcq", b"pxyzq", 5), None); |
| 41 | } |
| 42 | |
| 43 | #[test] |
| 44 | fn shortest_script_keeps_the_common_subsequence() { |
| 45 | let (a, b) = (b"ABCABBA", b"CBABAC"); |
| 46 | let m = match matches(a, b, 100) { |
| 47 | Some(m) => m, |
| 48 | None => panic!("budget of 100 refused"), |
| 49 | }; |
| 50 | // The longest common subsequence has length four, so D = 13 - 8 = 5. |
| 51 | assert_eq!(m.len(), 4); |
| 52 | assert!(matches(a, b, 4).is_none()); |
| 53 | for w in m.windows(2) { |
| 54 | assert!(w[0].0 < w[1].0 && w[0].1 < w[1].1); |
| 55 | } |
| 56 | for (i, j) in &m { |
| 57 | assert_eq!(a[*i], b[*j]); |
| 58 | } |
| 59 | } |
| 60 | |
| 61 | #[test] |
| 62 | fn changed_runs_cover_only_what_changed() { |
| 63 | let a = ["one", "two", "three", "four"]; |
| 64 | let b = ["one", "2", "three", "four", "five"]; |
| 65 | assert_eq!(changed_runs(&a, &b, 10), Some(vec![ |
| 66 | Change { a: 1..2, b: 1..2 }, |
| 67 | Change { a: 4..4, b: 4..5 }, |
| 68 | ])); |
| 69 | } |
| 70 | |
| 71 | #[test] |
| 72 | fn hunks_hold_context_and_join_near_runs() { |
| 73 | use oxedyne_fe2o3_data::diff::{hunks, Hunk}; |
| 74 | let a: Vec<u32> = (0..20).collect(); |
| 75 | let mut b = a.clone(); |
| 76 | (b[2], b[5], b[17]) = (100, 101, 102); |
| 77 | let runs = changed_runs(&a, &b, 20).unwrap_or_default(); |
| 78 | assert_eq!(runs.len(), 3); |
| 79 | let h = hunks(&runs, a.len(), b.len(), 2); |
| 80 | assert_eq!(h, vec![ |
| 81 | Hunk { a: 0..8, b: 0..8, runs: runs[..2].to_vec() }, |
| 82 | Hunk { a: 15..20, b: 15..20, runs: runs[2..].to_vec() }, |
| 83 | ]); |
| 84 | assert!(hunks(&[], 5, 5, 3).is_empty()); |
| 85 | } |