| b69ab31 | | | 1 | /** |
| b69ab31 | | | 2 | * Copyright (c) Meta Platforms, Inc. and affiliates. |
| b69ab31 | | | 3 | * |
| b69ab31 | | | 4 | * This source code is licensed under the MIT license found in the |
| b69ab31 | | | 5 | * LICENSE file in the root directory of this source tree. |
| b69ab31 | | | 6 | */ |
| b69ab31 | | | 7 | |
| b69ab31 | | | 8 | import type {Block} from '../diff'; |
| b69ab31 | | | 9 | |
| b69ab31 | | | 10 | import { |
| b69ab31 | | | 11 | collapseContextBlocks, |
| b69ab31 | | | 12 | diffBlocks, |
| b69ab31 | | | 13 | mergeBlocks, |
| b69ab31 | | | 14 | readableDiffBlocks, |
| b69ab31 | | | 15 | splitLines, |
| b69ab31 | | | 16 | } from '../diff'; |
| b69ab31 | | | 17 | |
| b69ab31 | | | 18 | describe('diffBlocks', () => { |
| b69ab31 | | | 19 | it('returns a "=" block for unchanged content', () => { |
| b69ab31 | | | 20 | const lines = splitLines('a\nb\nc\nd\ne\n'); |
| b69ab31 | | | 21 | expect(diffBlocks(lines, lines)).toMatchObject([['=', [0, 5, 0, 5]]]); |
| b69ab31 | | | 22 | }); |
| b69ab31 | | | 23 | |
| b69ab31 | | | 24 | it('returns a "!" block for totally different contents', () => { |
| b69ab31 | | | 25 | const aLines = splitLines('x\ny\n'); |
| b69ab31 | | | 26 | const bLines = splitLines('a\nb\nc\n'); |
| b69ab31 | | | 27 | expect(diffBlocks(aLines, bLines)).toMatchObject([['!', [0, 2, 0, 3]]]); |
| b69ab31 | | | 28 | }); |
| b69ab31 | | | 29 | |
| b69ab31 | | | 30 | it('returns "= ! =" blocks when a line was changed in the middle', () => { |
| b69ab31 | | | 31 | const aLines = splitLines('a\nb\nc\nd\ne\n'); |
| b69ab31 | | | 32 | const bLines = splitLines('a\nb\nc\nd1\nd2\ne\n'); |
| b69ab31 | | | 33 | expect(diffBlocks(aLines, bLines)).toMatchObject([ |
| b69ab31 | | | 34 | ['=', [0, 3, 0, 3]], |
| b69ab31 | | | 35 | ['!', [3, 4, 3, 5]], |
| b69ab31 | | | 36 | ['=', [4, 5, 5, 6]], |
| b69ab31 | | | 37 | ]); |
| b69ab31 | | | 38 | }); |
| b69ab31 | | | 39 | |
| b69ab31 | | | 40 | it('matches mdiff.blocks (known good diff algorithm), excluding empty blocks', () => { |
| b69ab31 | | | 41 | // Test cases are generated by: |
| b69ab31 | | | 42 | // |
| b69ab31 | | | 43 | // ``` |
| b69ab31 | | | 44 | // #!sl dbsh |
| b69ab31 | | | 45 | // import json |
| b69ab31 | | | 46 | // allblocks = e.mdiff.allblocks |
| b69ab31 | | | 47 | // cases = [] |
| b69ab31 | | | 48 | // for bits in range(16): |
| b69ab31 | | | 49 | // a = ['a\n', 'b\n', 'c\n', 'd\n'] |
| b69ab31 | | | 50 | // b = [bits & (1 << i) and c.upper() or c for i, c in enumerate(a)] |
| b69ab31 | | | 51 | // a = ''.join(a) |
| b69ab31 | | | 52 | // b = ''.join(b) |
| b69ab31 | | | 53 | // blocks = [[s, l] for l, s in allblocks(a, b) if l[0] < l[1] or l[2] < l[3]] # skip empty blocks |
| b69ab31 | | | 54 | // cases.append(json.dumps(blocks).replace(' ', '')) |
| b69ab31 | | | 55 | // print(' '.join(cases)) |
| b69ab31 | | | 56 | // ``` |
| b69ab31 | | | 57 | // |
| b69ab31 | | | 58 | // String is used to prettier from wrapping lines. |
| b69ab31 | | | 59 | const testCaseStr = |
| b69ab31 | | | 60 | '[["=",[0,4,0,4]]] [["!",[0,1,0,1]],["=",[1,4,1,4]]] [["=",[0,1,0,1]],["!",[1,2,1,2]],["=",[2,4,2,4]]] [["!",[0,2,0,2]],["=",[2,4,2,4]]] [["=",[0,2,0,2]],["!",[2,3,2,3]],["=",[3,4,3,4]]] [["!",[0,1,0,1]],["=",[1,2,1,2]],["!",[2,3,2,3]],["=",[3,4,3,4]]] [["=",[0,1,0,1]],["!",[1,3,1,3]],["=",[3,4,3,4]]] [["!",[0,3,0,3]],["=",[3,4,3,4]]] [["=",[0,3,0,3]],["!",[3,4,3,4]]] [["!",[0,1,0,1]],["=",[1,3,1,3]],["!",[3,4,3,4]]] [["=",[0,1,0,1]],["!",[1,2,1,2]],["=",[2,3,2,3]],["!",[3,4,3,4]]] [["!",[0,2,0,2]],["=",[2,3,2,3]],["!",[3,4,3,4]]] [["=",[0,2,0,2]],["!",[2,4,2,4]]] [["!",[0,1,0,1]],["=",[1,2,1,2]],["!",[2,4,2,4]]] [["=",[0,1,0,1]],["!",[1,4,1,4]]] [["!",[0,4,0,4]]]'; |
| b69ab31 | | | 61 | const testCases: Array<Block[]> = testCaseStr.split(' ').map(s => JSON.parse(s)); |
| b69ab31 | | | 62 | testCases.forEach((expected, bits) => { |
| b69ab31 | | | 63 | // eslint-disable-next-line no-bitwise |
| b69ab31 | | | 64 | const hasBit = (i: number): boolean => (bits & (1 << i)) > 0; |
| b69ab31 | | | 65 | const a = ['a\n', 'b\n', 'c\n', 'd\n']; |
| b69ab31 | | | 66 | const b = a.map((s, i) => (hasBit(i) ? s.toUpperCase() : s)); |
| b69ab31 | | | 67 | const actual = diffBlocks(a, b); |
| b69ab31 | | | 68 | expect(actual).toEqual(expected); |
| b69ab31 | | | 69 | }); |
| b69ab31 | | | 70 | }); |
| b69ab31 | | | 71 | }); |
| b69ab31 | | | 72 | |
| b69ab31 | | | 73 | describe('readableDiffBlocks', () => { |
| b69ab31 | | | 74 | it('prefers changing insignificant lines to insignificant lines 1', () => { |
| b69ab31 | | | 75 | // https://stackoverflow.com/questions/40550751/unexpected-result-in-git-diff |
| b69ab31 | | | 76 | const a = `sub _process_message { |
| b69ab31 | | | 77 | my ($self, $message) = @_; |
| b69ab31 | | | 78 | |
| b69ab31 | | | 79 | my $method = ref($message) eq 'HASH' ? $message->{method} : undef; |
| b69ab31 | | | 80 | |
| b69ab31 | | | 81 | return $self->send_error(ERROR_REQUEST_INVALID) |
| b69ab31 | | | 82 | unless defined($method); |
| b69ab31 | | | 83 | `; |
| b69ab31 | | | 84 | const b = `sub _process_message { |
| b69ab31 | | | 85 | my ($self, $message) = @_; |
| b69ab31 | | | 86 | |
| b69ab31 | | | 87 | my $time = [ gettimeofday ]; |
| b69ab31 | | | 88 | |
| b69ab31 | | | 89 | my $method = ref($message) eq 'HASH' ? $message->{method} : undef; |
| b69ab31 | | | 90 | return $self->send_error(ERROR_REQUEST_INVALID) |
| b69ab31 | | | 91 | unless defined($method); |
| b69ab31 | | | 92 | `; |
| b69ab31 | | | 93 | // Does not produce this: |
| b69ab31 | | | 94 | // sub _process_message { |
| b69ab31 | | | 95 | // my ($self, $message) = @_; |
| b69ab31 | | | 96 | // |
| b69ab31 | | | 97 | // - my $method = ref($message) eq 'HASH' ? $message->{method} : undef; |
| b69ab31 | | | 98 | // + my $time = [ gettimeofday ]; |
| b69ab31 | | | 99 | // |
| b69ab31 | | | 100 | // + my $method = ref($message) eq 'HASH' ? $message->{method} : undef; |
| b69ab31 | | | 101 | // return $self->send_error(ERROR_REQUEST_INVALID) |
| b69ab31 | | | 102 | // unless defined($method); |
| b69ab31 | | | 103 | expect(renderDiff(a, b, readableDiffBlocks)).toMatchInlineSnapshot(` |
| b69ab31 | | | 104 | " sub _process_message { |
| b69ab31 | | | 105 | my ($self, $message) = @_; |
| b69ab31 | | | 106 | |
| b69ab31 | | | 107 | + my $time = [ gettimeofday ]; |
| b69ab31 | | | 108 | + |
| b69ab31 | | | 109 | my $method = ref($message) eq 'HASH' ? $message->{method} : undef; |
| b69ab31 | | | 110 | - |
| b69ab31 | | | 111 | return $self->send_error(ERROR_REQUEST_INVALID) |
| b69ab31 | | | 112 | unless defined($method); |
| b69ab31 | | | 113 | " |
| b69ab31 | | | 114 | `); |
| b69ab31 | | | 115 | }); |
| b69ab31 | | | 116 | |
| b69ab31 | | | 117 | it('prefers changing insignificant lines to insignificant lines 2', () => { |
| b69ab31 | | | 118 | // https://gitlab.com/jssfr/diffsample/-/compare/bob...alice |
| b69ab31 | | | 119 | const a = `void Chunk_copy(Chunk *src, size_t src_start, Chunk *dst, size_t dst_start, size_t n) |
| b69ab31 | | | 120 | { |
| b69ab31 | | | 121 | if (!Chunk_bounds_check(src, src_start, n)) return; |
| b69ab31 | | | 122 | if (!Chunk_bounds_check(dst, dst_start, n)) return; |
| b69ab31 | | | 123 | |
| b69ab31 | | | 124 | memcpy(dst->data + dst_start, src->data + src_start, n); |
| b69ab31 | | | 125 | } |
| b69ab31 | | | 126 | |
| b69ab31 | | | 127 | int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n) |
| b69ab31 | | | 128 | { |
| b69ab31 | | | 129 | if (chunk == NULL) return 0; |
| b69ab31 | | | 130 | |
| b69ab31 | | | 131 | return start <= chunk->length && n <= chunk->length - start; |
| b69ab31 | | | 132 | } |
| b69ab31 | | | 133 | `; |
| b69ab31 | | | 134 | const b = `int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n) |
| b69ab31 | | | 135 | { |
| b69ab31 | | | 136 | if (chunk == NULL) return 0; |
| b69ab31 | | | 137 | |
| b69ab31 | | | 138 | return start <= chunk->length && n <= chunk->length - start; |
| b69ab31 | | | 139 | } |
| b69ab31 | | | 140 | |
| b69ab31 | | | 141 | void Chunk_copy(Chunk *src, size_t src_start, Chunk *dst, size_t dst_start, size_t n) |
| b69ab31 | | | 142 | { |
| b69ab31 | | | 143 | if (!Chunk_bounds_check(src, src_start, n)) return; |
| b69ab31 | | | 144 | if (!Chunk_bounds_check(dst, dst_start, n)) return; |
| b69ab31 | | | 145 | |
| b69ab31 | | | 146 | memcpy(dst->data + dst_start, src->data + src_start, n); |
| b69ab31 | | | 147 | } |
| b69ab31 | | | 148 | `; |
| b69ab31 | | | 149 | // Does not produce this: |
| b69ab31 | | | 150 | // -void Chunk_copy(Chunk *src, size_t src_start, Chunk *dst, size_t dst_start, size_t n) |
| b69ab31 | | | 151 | // +int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n) |
| b69ab31 | | | 152 | // { |
| b69ab31 | | | 153 | // - if (!Chunk_bounds_check(src, src_start, n)) return; |
| b69ab31 | | | 154 | // - if (!Chunk_bounds_check(dst, dst_start, n)) return; |
| b69ab31 | | | 155 | // + if (chunk == NULL) return 0; |
| b69ab31 | | | 156 | // |
| b69ab31 | | | 157 | // - // copy the bytes |
| b69ab31 | | | 158 | // - memcpy(dst->data + dst_start, src->data + src_start, n); |
| b69ab31 | | | 159 | // + return start <= chunk->length && n <= chunk->length - start; |
| b69ab31 | | | 160 | // } |
| b69ab31 | | | 161 | // |
| b69ab31 | | | 162 | // -int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n) |
| b69ab31 | | | 163 | // +void Chunk_copy(Chunk *src, size_t src_start, Chunk *dst, size_t dst_start, size_t n) |
| b69ab31 | | | 164 | // { |
| b69ab31 | | | 165 | // - if (chunk == NULL) return 0; |
| b69ab31 | | | 166 | // + if (!Chunk_bounds_check(src, src_start, n)) return; |
| b69ab31 | | | 167 | // + if (!Chunk_bounds_check(dst, dst_start, n)) return; |
| b69ab31 | | | 168 | // |
| b69ab31 | | | 169 | // - return start <= chunk->length && n <= chunk->length - start; |
| b69ab31 | | | 170 | // + memcpy(dst->data + dst_start, src->data + src_start, n); |
| b69ab31 | | | 171 | // } |
| b69ab31 | | | 172 | expect(renderDiff(a, b, readableDiffBlocks)).toMatchInlineSnapshot(` |
| b69ab31 | | | 173 | "+int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n) |
| b69ab31 | | | 174 | +{ |
| b69ab31 | | | 175 | + if (chunk == NULL) return 0; |
| b69ab31 | | | 176 | + |
| b69ab31 | | | 177 | + return start <= chunk->length && n <= chunk->length - start; |
| b69ab31 | | | 178 | +} |
| b69ab31 | | | 179 | + |
| b69ab31 | | | 180 | void Chunk_copy(Chunk *src, size_t src_start, Chunk *dst, size_t dst_start, size_t n) |
| b69ab31 | | | 181 | { |
| b69ab31 | | | 182 | if (!Chunk_bounds_check(src, src_start, n)) return; |
| b69ab31 | | | 183 | if (!Chunk_bounds_check(dst, dst_start, n)) return; |
| b69ab31 | | | 184 | |
| b69ab31 | | | 185 | memcpy(dst->data + dst_start, src->data + src_start, n); |
| b69ab31 | | | 186 | } |
| b69ab31 | | | 187 | - |
| b69ab31 | | | 188 | -int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n) |
| b69ab31 | | | 189 | -{ |
| b69ab31 | | | 190 | - if (chunk == NULL) return 0; |
| b69ab31 | | | 191 | - |
| b69ab31 | | | 192 | - return start <= chunk->length && n <= chunk->length - start; |
| b69ab31 | | | 193 | -} |
| b69ab31 | | | 194 | " |
| b69ab31 | | | 195 | `); |
| b69ab31 | | | 196 | expect(renderDiff(b, a, readableDiffBlocks)).toMatchInlineSnapshot(` |
| b69ab31 | | | 197 | "-int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n) |
| b69ab31 | | | 198 | -{ |
| b69ab31 | | | 199 | - if (chunk == NULL) return 0; |
| b69ab31 | | | 200 | - |
| b69ab31 | | | 201 | - return start <= chunk->length && n <= chunk->length - start; |
| b69ab31 | | | 202 | -} |
| b69ab31 | | | 203 | - |
| b69ab31 | | | 204 | void Chunk_copy(Chunk *src, size_t src_start, Chunk *dst, size_t dst_start, size_t n) |
| b69ab31 | | | 205 | { |
| b69ab31 | | | 206 | if (!Chunk_bounds_check(src, src_start, n)) return; |
| b69ab31 | | | 207 | if (!Chunk_bounds_check(dst, dst_start, n)) return; |
| b69ab31 | | | 208 | |
| b69ab31 | | | 209 | memcpy(dst->data + dst_start, src->data + src_start, n); |
| b69ab31 | | | 210 | } |
| b69ab31 | | | 211 | + |
| b69ab31 | | | 212 | +int Chunk_bounds_check(Chunk *chunk, size_t start, size_t n) |
| b69ab31 | | | 213 | +{ |
| b69ab31 | | | 214 | + if (chunk == NULL) return 0; |
| b69ab31 | | | 215 | + |
| b69ab31 | | | 216 | + return start <= chunk->length && n <= chunk->length - start; |
| b69ab31 | | | 217 | +} |
| b69ab31 | | | 218 | " |
| b69ab31 | | | 219 | `); |
| b69ab31 | | | 220 | }); |
| b69ab31 | | | 221 | |
| b69ab31 | | | 222 | it('sometimes produces non-minimal diff', () => { |
| b69ab31 | | | 223 | const a = `b |
| b69ab31 | | | 224 | { |
| b69ab31 | | | 225 | b1 |
| b69ab31 | | | 226 | } |
| b69ab31 | | | 227 | |
| b69ab31 | | | 228 | a |
| b69ab31 | | | 229 | { |
| b69ab31 | | | 230 | a1 |
| b69ab31 | | | 231 | } |
| b69ab31 | | | 232 | `; |
| b69ab31 | | | 233 | const b = `a |
| b69ab31 | | | 234 | { |
| b69ab31 | | | 235 | a1 |
| b69ab31 | | | 236 | } |
| b69ab31 | | | 237 | |
| b69ab31 | | | 238 | b |
| b69ab31 | | | 239 | { |
| b69ab31 | | | 240 | b1 |
| b69ab31 | | | 241 | } |
| b69ab31 | | | 242 | `; |
| b69ab31 | | | 243 | // The regular diff produces the minimal diff with 8 changed lines. |
| b69ab31 | | | 244 | expect(renderDiff(a, b, diffBlocks)).toMatchInlineSnapshot(` |
| b69ab31 | | | 245 | "-b |
| b69ab31 | | | 246 | +a |
| b69ab31 | | | 247 | { |
| b69ab31 | | | 248 | - b1 |
| b69ab31 | | | 249 | + a1 |
| b69ab31 | | | 250 | } |
| b69ab31 | | | 251 | |
| b69ab31 | | | 252 | -a |
| b69ab31 | | | 253 | +b |
| b69ab31 | | | 254 | { |
| b69ab31 | | | 255 | - a1 |
| b69ab31 | | | 256 | + b1 |
| b69ab31 | | | 257 | } |
| b69ab31 | | | 258 | " |
| b69ab31 | | | 259 | `); |
| b69ab31 | | | 260 | // The "readable" diff has 10 changed lines, but is easier to read by a human. |
| b69ab31 | | | 261 | expect(renderDiff(a, b, readableDiffBlocks)).toMatchInlineSnapshot(` |
| b69ab31 | | | 262 | "-b |
| b69ab31 | | | 263 | -{ |
| b69ab31 | | | 264 | - b1 |
| b69ab31 | | | 265 | -} |
| b69ab31 | | | 266 | - |
| b69ab31 | | | 267 | a |
| b69ab31 | | | 268 | { |
| b69ab31 | | | 269 | a1 |
| b69ab31 | | | 270 | } |
| b69ab31 | | | 271 | + |
| b69ab31 | | | 272 | +b |
| b69ab31 | | | 273 | +{ |
| b69ab31 | | | 274 | + b1 |
| b69ab31 | | | 275 | +} |
| b69ab31 | | | 276 | " |
| b69ab31 | | | 277 | `); |
| b69ab31 | | | 278 | }); |
| b69ab31 | | | 279 | |
| b69ab31 | | | 280 | it('avoids the pitfall of the patience diff flaw', () => { |
| b69ab31 | | | 281 | // Textbook patience diff will match the unique line "x" unconditionally, |
| b69ab31 | | | 282 | // and produces suboptimal result deleting and inserting multiple |
| b69ab31 | | | 283 | // insignificant lines. Our diff uses a simple heuristic to avoid that. |
| b69ab31 | | | 284 | const a = `{ |
| b69ab31 | | | 285 | { |
| b69ab31 | | | 286 | { |
| b69ab31 | | | 287 | x |
| b69ab31 | | | 288 | `; |
| b69ab31 | | | 289 | const b = `x |
| b69ab31 | | | 290 | { |
| b69ab31 | | | 291 | { |
| b69ab31 | | | 292 | { |
| b69ab31 | | | 293 | `; |
| b69ab31 | | | 294 | |
| b69ab31 | | | 295 | expect(renderDiff(a, b, readableDiffBlocks)).toMatchInlineSnapshot(` |
| b69ab31 | | | 296 | "+x |
| b69ab31 | | | 297 | { |
| b69ab31 | | | 298 | { |
| b69ab31 | | | 299 | { |
| b69ab31 | | | 300 | -x |
| b69ab31 | | | 301 | " |
| b69ab31 | | | 302 | `); |
| b69ab31 | | | 303 | }); |
| b69ab31 | | | 304 | }); |
| b69ab31 | | | 305 | |
| b69ab31 | | | 306 | describe('collapseContextBlocks', () => { |
| b69ab31 | | | 307 | it('collapses everything in a "=" block', () => { |
| b69ab31 | | | 308 | expect(collapseContextBlocks([['=', [0, 5, 0, 5]]], () => false)).toMatchObject([ |
| b69ab31 | | | 309 | ['~', [0, 5, 0, 5]], |
| b69ab31 | | | 310 | ]); |
| b69ab31 | | | 311 | }); |
| b69ab31 | | | 312 | |
| b69ab31 | | | 313 | it('collapses the top part of a "=" block', () => { |
| b69ab31 | | | 314 | expect( |
| b69ab31 | | | 315 | collapseContextBlocks( |
| b69ab31 | | | 316 | [ |
| b69ab31 | | | 317 | ['=', [0, 5, 0, 5]], |
| b69ab31 | | | 318 | ['!', [5, 6, 5, 7]], |
| b69ab31 | | | 319 | ], |
| b69ab31 | | | 320 | () => false, |
| b69ab31 | | | 321 | ), |
| b69ab31 | | | 322 | ).toMatchObject([ |
| b69ab31 | | | 323 | ['~', [0, 2, 0, 2]], |
| b69ab31 | | | 324 | ['=', [2, 5, 2, 5]], |
| b69ab31 | | | 325 | ['!', [5, 6, 5, 7]], |
| b69ab31 | | | 326 | ]); |
| b69ab31 | | | 327 | }); |
| b69ab31 | | | 328 | |
| b69ab31 | | | 329 | it('collapses the bottom part of a "=" block', () => { |
| b69ab31 | | | 330 | expect( |
| b69ab31 | | | 331 | collapseContextBlocks( |
| b69ab31 | | | 332 | [ |
| b69ab31 | | | 333 | ['!', [0, 2, 0, 3]], |
| b69ab31 | | | 334 | ['=', [2, 8, 3, 9]], |
| b69ab31 | | | 335 | ], |
| b69ab31 | | | 336 | () => false, |
| b69ab31 | | | 337 | ), |
| b69ab31 | | | 338 | ).toMatchObject([ |
| b69ab31 | | | 339 | ['!', [0, 2, 0, 3]], |
| b69ab31 | | | 340 | ['=', [2, 5, 3, 6]], |
| b69ab31 | | | 341 | ['~', [5, 8, 6, 9]], |
| b69ab31 | | | 342 | ]); |
| b69ab31 | | | 343 | }); |
| b69ab31 | | | 344 | |
| b69ab31 | | | 345 | it('splits a "=" block in 3 blocks on demand', () => { |
| b69ab31 | | | 346 | expect( |
| b69ab31 | | | 347 | collapseContextBlocks( |
| b69ab31 | | | 348 | [ |
| b69ab31 | | | 349 | ['!', [0, 1, 0, 2]], |
| b69ab31 | | | 350 | ['=', [1, 10, 2, 11]], |
| b69ab31 | | | 351 | ['!', [10, 11, 11, 12]], |
| b69ab31 | | | 352 | ], |
| b69ab31 | | | 353 | () => false, |
| b69ab31 | | | 354 | ), |
| b69ab31 | | | 355 | ).toMatchObject([ |
| b69ab31 | | | 356 | ['!', [0, 1, 0, 2]], |
| b69ab31 | | | 357 | ['=', [1, 4, 2, 5]], |
| b69ab31 | | | 358 | ['~', [4, 7, 5, 8]], |
| b69ab31 | | | 359 | ['=', [7, 10, 8, 11]], |
| b69ab31 | | | 360 | ['!', [10, 11, 11, 12]], |
| b69ab31 | | | 361 | ]); |
| b69ab31 | | | 362 | }); |
| b69ab31 | | | 363 | |
| b69ab31 | | | 364 | it('respects isExpanded function', () => { |
| b69ab31 | | | 365 | expect( |
| b69ab31 | | | 366 | collapseContextBlocks( |
| b69ab31 | | | 367 | [ |
| b69ab31 | | | 368 | ['!', [0, 1, 0, 2]], |
| b69ab31 | | | 369 | ['=', [1, 10, 2, 11]], |
| b69ab31 | | | 370 | ['!', [10, 11, 11, 12]], |
| b69ab31 | | | 371 | ], |
| b69ab31 | | | 372 | (aLine, _bLine) => aLine === 4, |
| b69ab31 | | | 373 | ), |
| b69ab31 | | | 374 | ).toMatchObject([ |
| b69ab31 | | | 375 | ['!', [0, 1, 0, 2]], |
| b69ab31 | | | 376 | ['=', [1, 10, 2, 11]], |
| b69ab31 | | | 377 | ['!', [10, 11, 11, 12]], |
| b69ab31 | | | 378 | ]); |
| b69ab31 | | | 379 | }); |
| b69ab31 | | | 380 | |
| b69ab31 | | | 381 | it('skips "~" if "=" block is too small', () => { |
| b69ab31 | | | 382 | expect( |
| b69ab31 | | | 383 | collapseContextBlocks( |
| b69ab31 | | | 384 | [ |
| b69ab31 | | | 385 | ['!', [0, 1, 0, 2]], |
| b69ab31 | | | 386 | ['=', [1, 7, 2, 8]], |
| b69ab31 | | | 387 | ['!', [7, 8, 8, 9]], |
| b69ab31 | | | 388 | ], |
| b69ab31 | | | 389 | () => false, |
| b69ab31 | | | 390 | ), |
| b69ab31 | | | 391 | ).toMatchObject([ |
| b69ab31 | | | 392 | ['!', [0, 1, 0, 2]], |
| b69ab31 | | | 393 | ['=', [1, 7, 2, 8]], |
| b69ab31 | | | 394 | ['!', [7, 8, 8, 9]], |
| b69ab31 | | | 395 | ]); |
| b69ab31 | | | 396 | }); |
| b69ab31 | | | 397 | |
| b69ab31 | | | 398 | it('preserves context around empty ! block', () => { |
| b69ab31 | | | 399 | expect( |
| b69ab31 | | | 400 | collapseContextBlocks( |
| b69ab31 | | | 401 | [ |
| b69ab31 | | | 402 | ['=', [0, 5, 0, 5]], |
| b69ab31 | | | 403 | ['!', [5, 5, 5, 5]], |
| b69ab31 | | | 404 | ['=', [5, 6, 5, 6]], |
| b69ab31 | | | 405 | ], |
| b69ab31 | | | 406 | () => false, |
| b69ab31 | | | 407 | ), |
| b69ab31 | | | 408 | ).toEqual([ |
| b69ab31 | | | 409 | ['~', [0, 2, 0, 2]], |
| b69ab31 | | | 410 | ['=', [2, 5, 2, 5]], |
| b69ab31 | | | 411 | ['!', [5, 5, 5, 5]], |
| b69ab31 | | | 412 | ['=', [5, 6, 5, 6]], |
| b69ab31 | | | 413 | ]); |
| b69ab31 | | | 414 | }); |
| b69ab31 | | | 415 | |
| b69ab31 | | | 416 | it('handles adjacent "=" blocks', () => { |
| b69ab31 | | | 417 | expect( |
| b69ab31 | | | 418 | collapseContextBlocks( |
| b69ab31 | | | 419 | [ |
| b69ab31 | | | 420 | ['=', [0, 2, 0, 2]], |
| b69ab31 | | | 421 | ['=', [2, 8, 2, 8]], |
| b69ab31 | | | 422 | ], |
| b69ab31 | | | 423 | () => false, |
| b69ab31 | | | 424 | ), |
| b69ab31 | | | 425 | ).toMatchObject([ |
| b69ab31 | | | 426 | ['~', [0, 2, 0, 2]], |
| b69ab31 | | | 427 | ['~', [2, 8, 2, 8]], |
| b69ab31 | | | 428 | ]); |
| b69ab31 | | | 429 | }); |
| b69ab31 | | | 430 | }); |
| b69ab31 | | | 431 | |
| b69ab31 | | | 432 | describe('mergeBlocks', () => { |
| b69ab31 | | | 433 | it('should handle empty blocks', () => { |
| b69ab31 | | | 434 | const result = mergeBlocks([], []); |
| b69ab31 | | | 435 | expect(result).toEqual([]); |
| b69ab31 | | | 436 | }); |
| b69ab31 | | | 437 | |
| b69ab31 | | | 438 | it('should merge blocks', () => { |
| b69ab31 | | | 439 | const abBlocks: Array<Block> = [ |
| b69ab31 | | | 440 | ['!', [0, 0, 0, 1]], |
| b69ab31 | | | 441 | ['!', [0, 0, 1, 4]], |
| b69ab31 | | | 442 | ['!', [0, 0, 4, 7]], |
| b69ab31 | | | 443 | ]; |
| b69ab31 | | | 444 | const cbBlocks: Array<Block> = [ |
| b69ab31 | | | 445 | ['!', [0, 0, 0, 2]], |
| b69ab31 | | | 446 | ['!', [0, 0, 2, 3]], |
| b69ab31 | | | 447 | ['!', [0, 0, 3, 6]], |
| b69ab31 | | | 448 | ['!', [0, 0, 6, 7]], |
| b69ab31 | | | 449 | ]; |
| b69ab31 | | | 450 | const result = mergeBlocks(abBlocks, cbBlocks); |
| b69ab31 | | | 451 | expect(result).toEqual([['!', [0, 7, 0, 7]]]); |
| b69ab31 | | | 452 | }); |
| b69ab31 | | | 453 | |
| b69ab31 | | | 454 | it('should handle blocks with different signs', () => { |
| b69ab31 | | | 455 | let abBlocks: Array<Block> = [ |
| b69ab31 | | | 456 | ['!', [0, 1, 0, 1]], |
| b69ab31 | | | 457 | ['!', [1, 2, 1, 2]], |
| b69ab31 | | | 458 | ['=', [2, 5, 3, 6]], |
| b69ab31 | | | 459 | ]; |
| b69ab31 | | | 460 | let cbBlocks: Array<Block> = [ |
| b69ab31 | | | 461 | ['!', [0, 2, 0, 3]], |
| b69ab31 | | | 462 | ['=', [2, 3, 3, 4]], |
| b69ab31 | | | 463 | ['=', [3, 5, 4, 6]], |
| b69ab31 | | | 464 | ]; |
| b69ab31 | | | 465 | let result = mergeBlocks(abBlocks, cbBlocks); |
| b69ab31 | | | 466 | expect(result).toEqual([ |
| b69ab31 | | | 467 | ['!', [0, 3, 0, 3]], |
| b69ab31 | | | 468 | ['=', [3, 6, 3, 6]], |
| b69ab31 | | | 469 | ]); |
| b69ab31 | | | 470 | |
| b69ab31 | | | 471 | abBlocks = [ |
| b69ab31 | | | 472 | ['!', [0, 0, 0, 3]], |
| b69ab31 | | | 473 | ['=', [0, 4, 3, 7]], |
| b69ab31 | | | 474 | ]; |
| b69ab31 | | | 475 | cbBlocks = [ |
| b69ab31 | | | 476 | ['=', [0, 1, 0, 1]], |
| b69ab31 | | | 477 | ['=', [1, 4, 1, 4]], |
| b69ab31 | | | 478 | ['!', [4, 4, 4, 6]], |
| b69ab31 | | | 479 | ['=', [4, 5, 6, 7]], |
| b69ab31 | | | 480 | ]; |
| b69ab31 | | | 481 | result = mergeBlocks(abBlocks, cbBlocks); |
| b69ab31 | | | 482 | expect(result).toEqual([ |
| b69ab31 | | | 483 | ['!', [0, 3, 0, 3]], |
| b69ab31 | | | 484 | ['=', [3, 4, 3, 4]], |
| b69ab31 | | | 485 | ['!', [4, 6, 4, 6]], |
| b69ab31 | | | 486 | ['=', [6, 7, 6, 7]], |
| b69ab31 | | | 487 | ]); |
| b69ab31 | | | 488 | }); |
| b69ab31 | | | 489 | |
| b69ab31 | | | 490 | it('should preserve empty ranges', () => { |
| b69ab31 | | | 491 | const abBlocks: Array<Block> = [ |
| b69ab31 | | | 492 | ['=', [0, 1, 0, 1]], |
| b69ab31 | | | 493 | ['!', [1, 2, 1, 1]], |
| b69ab31 | | | 494 | ['=', [2, 6, 1, 5]], |
| b69ab31 | | | 495 | ]; |
| b69ab31 | | | 496 | const cbBlocks: Array<Block> = [ |
| b69ab31 | | | 497 | ['=', [0, 4, 0, 4]], |
| b69ab31 | | | 498 | ['!', [4, 5, 4, 4]], |
| b69ab31 | | | 499 | ['=', [5, 6, 4, 5]], |
| b69ab31 | | | 500 | ]; |
| b69ab31 | | | 501 | const result = mergeBlocks(abBlocks, cbBlocks); |
| b69ab31 | | | 502 | expect(result).toEqual([ |
| b69ab31 | | | 503 | ['=', [0, 1, 0, 1]], |
| b69ab31 | | | 504 | ['!', [1, 1, 1, 1]], |
| b69ab31 | | | 505 | ['=', [1, 4, 1, 4]], |
| b69ab31 | | | 506 | ['!', [4, 4, 4, 4]], |
| b69ab31 | | | 507 | ['=', [4, 5, 4, 5]], |
| b69ab31 | | | 508 | ]); |
| b69ab31 | | | 509 | }); |
| b69ab31 | | | 510 | }); |
| b69ab31 | | | 511 | |
| b69ab31 | | | 512 | function renderDiff( |
| b69ab31 | | | 513 | a: string, |
| b69ab31 | | | 514 | b: string, |
| b69ab31 | | | 515 | diffFunc: (aLines: string[], bLines: string[]) => Array<Block>, |
| b69ab31 | | | 516 | ): string { |
| b69ab31 | | | 517 | const aLines = splitLines(a); |
| b69ab31 | | | 518 | const bLines = splitLines(b); |
| b69ab31 | | | 519 | const blocks = diffFunc(aLines, bLines); |
| b69ab31 | | | 520 | return blocks |
| b69ab31 | | | 521 | .flatMap(([sign, [a1, a2, b1, b2]]) => { |
| b69ab31 | | | 522 | if (sign === '=') { |
| b69ab31 | | | 523 | return aLines.slice(a1, a2).map(l => ` ${l}`); |
| b69ab31 | | | 524 | } else { |
| b69ab31 | | | 525 | return aLines |
| b69ab31 | | | 526 | .slice(a1, a2) |
| b69ab31 | | | 527 | .map(l => `-${l}`) |
| b69ab31 | | | 528 | .concat(bLines.slice(b1, b2).map(l => `+${l}`)); |
| b69ab31 | | | 529 | } |
| b69ab31 | | | 530 | }) |
| b69ab31 | | | 531 | .join(''); |
| b69ab31 | | | 532 | } |