typescript client

node_modules/has-flag/package.json

+{
+	"name": "has-flag",
+	"version": "4.0.0",
+	"description": "Check if argv has a specific flag",
+	"license": "MIT",
+	"repository": "sindresorhus/has-flag",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=8"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"has",
+		"check",
+		"detect",
+		"contains",
+		"find",
+		"flag",
+		"cli",
+		"command-line",
+		"argv",
+		"process",
+		"arg",
+		"args",
+		"argument",
+		"arguments",
+		"getopt",
+		"minimist",
+		"optimist"
+	],
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}

node_modules/has-flag/readme.md

+# has-flag [![Build Status](https://travis-ci.org/sindresorhus/has-flag.svg?branch=master)](https://travis-ci.org/sindresorhus/has-flag)
+
+> Check if [`argv`](https://nodejs.org/docs/latest/api/process.html#process_process_argv) has a specific flag
+
+Correctly stops looking after an `--` argument terminator.
+
+---
+
+<div align="center">
+	<b>
+		<a href="https://tidelift.com/subscription/pkg/npm-has-flag?utm_source=npm-has-flag&utm_medium=referral&utm_campaign=readme">Get professional support for this package with a Tidelift subscription</a>
+	</b>
+	<br>
+	<sub>
+		Tidelift helps make open source sustainable for maintainers while giving companies<br>assurances about security, maintenance, and licensing for their dependencies.
+	</sub>
+</div>
+
+---
+
+
+## Install
+
+```
+$ npm install has-flag
+```
+
+
+## Usage
+
+```js
+// foo.js
+const hasFlag = require('has-flag');
+
+hasFlag('unicorn');
+//=> true
+
+hasFlag('--unicorn');
+//=> true
+
+hasFlag('f');
+//=> true
+
+hasFlag('-f');
+//=> true
+
+hasFlag('foo=bar');
+//=> true
+
+hasFlag('foo');
+//=> false
+
+hasFlag('rainbow');
+//=> false
+```
+
+```
+$ node foo.js -f --unicorn --foo=bar -- --rainbow
+```
+
+
+## API
+
+### hasFlag(flag, [argv])
+
+Returns a boolean for whether the flag exists.
+
+#### flag
+
+Type: `string`
+
+CLI flag to look for. The `--` prefix is optional.
+
+#### argv
+
+Type: `string[]`<br>
+Default: `process.argv`
+
+CLI arguments.
+
+
+## Security
+
+To report a security vulnerability, please use the [Tidelift security contact](https://tidelift.com/security). Tidelift will coordinate the fix and disclosure.
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)

node_modules/jest-diff/LICENSE

+MIT License
+
+Copyright (c) Facebook, Inc. and its affiliates.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

node_modules/jest-diff/README.md

+# jest-diff
+
+Display differences clearly so people can review changes confidently.
+
+The default export serializes JavaScript **values**, compares them line-by-line, and returns a string which includes comparison lines.
+
+Two named exports compare **strings** character-by-character:
+
+- `diffStringsUnified` returns a string.
+- `diffStringsRaw` returns an array of `Diff` objects.
+
+Three named exports compare **arrays of strings** line-by-line:
+
+- `diffLinesUnified` and `diffLinesUnified2` return a string.
+- `diffLinesRaw` returns an array of `Diff` objects.
+
+## Installation
+
+To add this package as a dependency of a project, run either of the following commands:
+
+- `npm install jest-diff`
+- `yarn add jest-diff`
+
+## Usage of default export
+
+Given JavaScript **values**, `diffDefault(a, b, options?)` does the following:
+
+1. **serialize** the values as strings using the `pretty-format` package
+2. **compare** the strings line-by-line using the `diff-sequences` package
+3. **format** the changed or common lines using the `chalk` package
+
+To use this function, write either of the following:
+
+- `const diffDefault = require('jest-diff').default;` in CommonJS modules
+- `import diffDefault from 'jest-diff';` in ECMAScript modules
+
+### Example of default export
+
+```js
+const a = ['delete', 'common', 'changed from'];
+const b = ['common', 'changed to', 'insert'];
+
+const difference = diffDefault(a, b);
+```
+
+The returned **string** consists of:
+
+- annotation lines: describe the two change indicators with labels, and a blank line
+- comparison lines: similar to “unified” view on GitHub, but `Expected` lines are green, `Received` lines are red, and common lines are dim (by default, see Options)
+
+```diff
+- Expected
++ Received
+
+  Array [
+-   "delete",
+    "common",
+-   "changed from",
++   "changed to",
++   "insert",
+  ]
+```
+
+### Edge cases of default export
+
+Here are edge cases for the return value:
+
+- `' Comparing two different types of values. …'` if the arguments have **different types** according to the `jest-get-type` package (instances of different classes have the same `'object'` type)
+- `'Compared values have no visual difference.'` if the arguments have either **referential identity** according to `Object.is` method or **same serialization** according to the `pretty-format` package
+- `null` if either argument is a so-called **asymmetric matcher** in Jasmine or Jest
+
+## Usage of diffStringsUnified
+
+Given **strings**, `diffStringsUnified(a, b, options?)` does the following:
+
+1. **compare** the strings character-by-character using the `diff-sequences` package
+2. **clean up** small (often coincidental) common substrings, also known as chaff
+3. **format** the changed or common lines using the `chalk` package
+
+Although the function is mainly for **multiline** strings, it compares any strings.
+
+Write either of the following:
+
+- `const {diffStringsUnified} = require('jest-diff');` in CommonJS modules
+- `import {diffStringsUnified} from 'jest-diff';` in ECMAScript modules
+
+### Example of diffStringsUnified
+
+```js
+const a = 'common\nchanged from';
+const b = 'common\nchanged to';
+
+const difference = diffStringsUnified(a, b);
+```
+
+The returned **string** consists of:
+
+- annotation lines: describe the two change indicators with labels, and a blank line
+- comparison lines: similar to “unified” view on GitHub, and **changed substrings** have **inverse** foreground and background colors (that is, `from` has white-on-green and `to` has white-on-red, which the following example does not show)
+
+```diff
+- Expected
++ Received
+
+  common
+- changed from
++ changed to
+```
+
+### Performance of diffStringsUnified
+
+To get the benefit of **changed substrings** within the comparison lines, a character-by-character comparison has a higher computational cost (in time and space) than a line-by-line comparison.
+
+If the input strings can have **arbitrary length**, we recommend that the calling code set a limit, beyond which splits the strings, and then calls `diffLinesUnified` instead. For example, Jest falls back to line-by-line comparison if either string has length greater than 20K characters.
+
+## Usage of diffLinesUnified
+
+Given **arrays of strings**, `diffLinesUnified(aLines, bLines, options?)` does the following:
+
+1. **compare** the arrays line-by-line using the `diff-sequences` package
+2. **format** the changed or common lines using the `chalk` package
+
+You might call this function when strings have been split into lines and you do not need to see changed substrings within lines.
+
+### Example of diffLinesUnified
+
+```js
+const aLines = ['delete', 'common', 'changed from'];
+const bLines = ['common', 'changed to', 'insert'];
+
+const difference = diffLinesUnified(aLines, bLines);
+```
+
+```diff
+- Expected
++ Received
+
+- delete
+  common
+- changed from
++ changed to
++ insert
+```
+
+### Edge cases of diffLinesUnified or diffStringsUnified
+
+Here are edge cases for arguments and return values:
+
+- both `a` and `b` are empty strings: no comparison lines
+- only `a` is empty string: all comparison lines have `bColor` and `bIndicator` (see Options)
+- only `b` is empty string: all comparison lines have `aColor` and `aIndicator` (see Options)
+- `a` and `b` are equal non-empty strings: all comparison lines have `commonColor` and `commonIndicator` (see Options)
+
+## Usage of diffLinesUnified2
+
+Given two **pairs** of arrays of strings, `diffLinesUnified2(aLinesDisplay, bLinesDisplay, aLinesCompare, bLinesCompare, options?)` does the following:
+
+1. **compare** the pair of `Compare` arrays line-by-line using the `diff-sequences` package
+2. **format** the corresponding lines in the pair of `Display` arrays using the `chalk` package
+
+Jest calls this function to consider lines as common instead of changed if the only difference is indentation.
+
+You might call this function for case insensitive or Unicode equivalence comparison of lines.
+
+### Example of diffLinesUnified2
+
+```js
+import format from 'pretty-format';
+
+const a = {
+  text: 'Ignore indentation in serialized object',
+  time: '2019-09-19T12:34:56.000Z',
+  type: 'CREATE_ITEM',
+};
+const b = {
+  payload: {
+    text: 'Ignore indentation in serialized object',
+    time: '2019-09-19T12:34:56.000Z',
+  },
+  type: 'CREATE_ITEM',
+};
+
+const difference = diffLinesUnified2(
+  // serialize with indentation to display lines
+  format(a).split('\n'),
+  format(b).split('\n'),
+  // serialize without indentation to compare lines
+  format(a, {indent: 0}).split('\n'),
+  format(b, {indent: 0}).split('\n'),
+);
+```
+
+The `text` and `time` properties are common, because their only difference is indentation:
+
+```diff
+- Expected
++ Received
+
+  Object {
++   payload: Object {
+      text: 'Ignore indentation in serialized object',
+      time: '2019-09-19T12:34:56.000Z',
++   },
+    type: 'CREATE_ITEM',
+  }
+```
+
+The preceding example illustrates why (at least for indentation) it seems more intuitive that the function returns the common line from the `bLinesDisplay` array instead of from the `aLinesDisplay` array.
+
+## Usage of diffStringsRaw
+
+Given **strings** and a boolean option, `diffStringsRaw(a, b, cleanup)` does the following:
+
+1. **compare** the strings character-by-character using the `diff-sequences` package
+2. optionally **clean up** small (often coincidental) common substrings, also known as chaff
+
+Because `diffStringsRaw` returns the difference as **data** instead of a string, you can format it as your application requires (for example, enclosed in HTML markup for browser instead of escape sequences for console).
+
+The returned **array** describes substrings as instances of the `Diff` class, which calling code can access like array tuples:
+
+The value at index `0` is one of the following:
+
+| value | named export  | description           |
+| ----: | :------------ | :-------------------- |
+|   `0` | `DIFF_EQUAL`  | in `a` and in `b`     |
+|  `-1` | `DIFF_DELETE` | in `a` but not in `b` |
+|   `1` | `DIFF_INSERT` | in `b` but not in `a` |
+
+The value at index `1` is a substring of `a` or `b` or both.
+
+### Example of diffStringsRaw with cleanup
+
+```js
+const diffs = diffStringsRaw('changed from', 'changed to', true);
+```
+
+| `i` | `diffs[i][0]` | `diffs[i][1]` |
+| --: | ------------: | :------------ |
+| `0` |           `0` | `'changed '`  |
+| `1` |          `-1` | `'from'`      |
+| `2` |           `1` | `'to'`        |
+
+### Example of diffStringsRaw without cleanup
+
+```js
+const diffs = diffStringsRaw('changed from', 'changed to', false);
+```
+
+| `i` | `diffs[i][0]` | `diffs[i][1]` |
+| --: | ------------: | :------------ |
+| `0` |           `0` | `'changed '`  |
+| `1` |          `-1` | `'fr'`        |
+| `2` |           `1` | `'t'`         |
+| `3` |           `0` | `'o'`         |
+| `4` |          `-1` | `'m'`         |
+
+### Advanced import for diffStringsRaw
+
+Here are all the named imports that you might need for the `diffStringsRaw` function:
+
+- `const {DIFF_DELETE, DIFF_EQUAL, DIFF_INSERT, Diff, diffStringsRaw} = require('jest-diff');` in CommonJS modules
+- `import {DIFF_DELETE, DIFF_EQUAL, DIFF_INSERT, Diff, diffStringsRaw} from 'jest-diff';` in ECMAScript modules
+
+To write a **formatting** function, you might need the named constants (and `Diff` in TypeScript annotations).
+
+If you write an application-specific **cleanup** algorithm, then you might need to call the `Diff` constructor:
+
+```js
+const diffCommon = new Diff(DIFF_EQUAL, 'changed ');
+const diffDelete = new Diff(DIFF_DELETE, 'from');
+const diffInsert = new Diff(DIFF_INSERT, 'to');
+```
+
+## Usage of diffLinesRaw
+
+Given **arrays of strings**, `diffLinesRaw(aLines, bLines)` does the following:
+
+- **compare** the arrays line-by-line using the `diff-sequences` package
+
+Because `diffLinesRaw` returns the difference as **data** instead of a string, you can format it as your application requires.
+
+### Example of diffLinesRaw
+
+```js
+const aLines = ['delete', 'common', 'changed from'];
+const bLines = ['common', 'changed to', 'insert'];
+
+const diffs = diffLinesRaw(aLines, bLines);
+```
+
+| `i` | `diffs[i][0]` | `diffs[i][1]`    |
+| --: | ------------: | :--------------- |
+| `0` |          `-1` | `'delete'`       |
+| `1` |           `0` | `'common'`       |
+| `2` |          `-1` | `'changed from'` |
+| `3` |           `1` | `'changed to'`   |
+| `4` |           `1` | `'insert'`       |
+
+### Edge case of diffLinesRaw
+
+If you call `string.split('\n')` for an empty string:
+
+- the result is `['']` an array which contains an empty string
+- instead of `[]` an empty array
+
+Depending of your application, you might call `diffLinesRaw` with either array.
+
+### Example of split method
+
+```js
+import {diffLinesRaw} from 'jest-diff';
+
+const a = 'non-empty string';
+const b = '';
+
+const diffs = diffLinesRaw(a.split('\n'), b.split('\n'));
+```
+
+| `i` | `diffs[i][0]` | `diffs[i][1]`        |
+| --: | ------------: | :------------------- |
+| `0` |          `-1` | `'non-empty string'` |
+| `1` |           `1` | `''`                 |
+
+Which you might format as follows:
+
+```diff
+- Expected  - 1
++ Received  + 1
+
+- non-empty string
++
+```
+
+### Example of splitLines0 function
+
+For edge case behavior like the `diffLinesUnified` function, you might define a `splitLines0` function, which given an empty string, returns `[]` an empty array:
+
+```js
+export const splitLines0 = string =>
+  string.length === 0 ? [] : string.split('\n');
+```
+
+```js
+import {diffLinesRaw} from 'jest-diff';
+
+const a = '';
+const b = 'line 1\nline 2\nline 3';
+
+const diffs = diffLinesRaw(a.split('\n'), b.split('\n'));
+```
+
+| `i` | `diffs[i][0]` | `diffs[i][1]` |
+| --: | ------------: | :------------ |
+| `0` |           `1` | `'line 1'`    |
+| `1` |           `1` | `'line 2'`    |
+| `2` |           `1` | `'line 3'`    |
+
+Which you might format as follows:
+
+```diff
+- Expected  - 0
++ Received  + 3
+
++ line 1
++ line 2
++ line 3
+```
+
+In contrast to the `diffLinesRaw` function, the `diffLinesUnified` and `diffLinesUnified2` functions **automatically** convert array arguments computed by string `split` method, so callers do **not** need a `splitLine0` function.
+
+## Options
+
+The default options are for the report when an assertion fails from the `expect` package used by Jest.
+
+For other applications, you can provide an options object as a third argument:
+
+- `diffDefault(a, b, options)`
+- `diffStringsUnified(a, b, options)`
+- `diffLinesUnified(aLines, bLines, options)`
+- `diffLinesUnified2(aLinesDisplay, bLinesDisplay, aLinesCompare, bLinesCompare, options)`
+
+### Properties of options object
+
+| name                              | default            |
+| :-------------------------------- | :----------------- |
+| `aAnnotation`                     | `'Expected'`       |
+| `aColor`                          | `chalk.green`      |
+| `aIndicator`                      | `'-'`              |
+| `bAnnotation`                     | `'Received'`       |
+| `bColor`                          | `chalk.red`        |
+| `bIndicator`                      | `'+'`              |
+| `changeColor`                     | `chalk.inverse`    |
+| `changeLineTrailingSpaceColor`    | `string => string` |
+| `commonColor`                     | `chalk.dim`        |
+| `commonIndicator`                 | `' '`              |
+| `commonLineTrailingSpaceColor`    | `string => string` |
+| `contextLines`                    | `5`                |
+| `emptyFirstOrLastLinePlaceholder` | `''`               |
+| `expand`                          | `true`             |
+| `includeChangeCounts`             | `false`            |
+| `omitAnnotationLines`             | `false`            |
+| `patchColor`                      | `chalk.yellow`     |
+
+For more information about the options, see the following examples.
+
+### Example of options for labels
+
+If the application is code modification, you might replace the labels:
+
+```js
+const options = {
+  aAnnotation: 'Original',
+  bAnnotation: 'Modified',
+};
+```
+
+```diff
+- Original
++ Modified
+
+  common
+- changed from
++ changed to
+```
+
+The `jest-diff` package does not assume that the 2 labels have equal length.
+
+### Example of options for colors of changed lines
+
+For consistency with most diff tools, you might exchange the colors:
+
+```ts
+import chalk = require('chalk');
+
+const options = {
+  aColor: chalk.red,
+  bColor: chalk.green,
+};
+```
+
+### Example of option for color of changed substrings
+
+Although the default inverse of foreground and background colors is hard to beat for changed substrings **within lines**, especially because it highlights spaces, if you want bold font weight on yellow background color:
+
+```ts
+import chalk = require('chalk');
+
+const options = {
+  changeColor: chalk.bold.bgYellowBright,
+};
+```
+
+### Example of option to format trailing spaces
+
+Because the default export does not display substring differences within lines, formatting can help you see when lines differ by the presence or absence of trailing spaces found by `/\s+$/` regular expression.
+
+- If change lines have a background color, then you can see trailing spaces.
+- If common lines have default dim color, then you cannot see trailing spaces. You might want yellowish background color to see them.
+
+```js
+const options = {
+  aColor: chalk.rgb(128, 0, 128).bgRgb(255, 215, 255), // magenta
+  bColor: chalk.rgb(0, 95, 0).bgRgb(215, 255, 215), // green
+  commonLineTrailingSpaceColor: chalk.bgYellow,
+};
+```
+
+The value of a Color option is a function, which given a string, returns a string.
+
+If you want to replace trailing spaces with middle dot characters:
+
+```js
+const replaceSpacesWithMiddleDot = string => '·'.repeat(string.length);
+
+const options = {
+  changeLineTrailingSpaceColor: replaceSpacesWithMiddleDot,
+  commonLineTrailingSpaceColor: replaceSpacesWithMiddleDot,
+};
+```
+
+If you need the TypeScript type of a Color option:
+
+```ts
+import {DiffOptionsColor} from 'jest-diff';
+```
+
+### Example of options for no colors
+
+To store the difference in a file without escape codes for colors, provide an identity function:
+
+```js
+const noColor = string => string;
+
+const options = {
+  aColor: noColor,
+  bColor: noColor,
+  changeColor: noColor,
+  commonColor: noColor,
+  patchColor: noColor,
+};
+```
+
+### Example of options for indicators
+
+For consistency with the `diff` command, you might replace the indicators:
+
+```js
+const options = {
+  aIndicator: '<',
+  bIndicator: '>',
+};
+```
+
+The `jest-diff` package assumes (but does not enforce) that the 3 indicators have equal length.
+
+### Example of options to limit common lines
+
+By default, the output includes all common lines.
+
+To emphasize the changes, you might limit the number of common “context” lines:
+
+```js
+const options = {
+  contextLines: 1,
+  expand: false,
+};
+```
+
+A patch mark like `@@ -12,7 +12,9 @@` accounts for omitted common lines.
+
+### Example of option for color of patch marks
+
+If you want patch marks to have the same dim color as common lines:
+
+```ts
+import chalk = require('chalk');
+
+const options = {
+  expand: false,
+  patchColor: chalk.dim,
+};
+```
+
+### Example of option to include change counts
+
+To display the number of changed lines at the right of annotation lines:
+
+```js
+const a = ['common', 'changed from'];
+const b = ['common', 'changed to', 'insert'];
+
+const options = {
+  includeChangeCounts: true,
+};
+
+const difference = diffDefault(a, b, options);
+```
+
+```diff
+- Expected  - 1
++ Received  + 2
+
+  Array [
+    "common",
+-   "changed from",
++   "changed to",
++   "insert",
+  ]
+```
+
+### Example of option to omit annotation lines
+
+To display only the comparison lines:
+
+```js
+const a = 'common\nchanged from';
+const b = 'common\nchanged to';
+
+const options = {
+  omitAnnotationLines: true,
+};
+
+const difference = diffStringsUnified(a, b, options);
+```
+
+```diff
+  common
+- changed from
++ changed to
+```
+
+### Example of option for empty first or last lines
+
+If the **first** or **last** comparison line is **empty**, because the content is empty and the indicator is a space, you might not notice it.
+
+The replacement option is a string whose default value is `''` empty string.
+
+Because Jest trims the report when a matcher fails, it deletes an empty last line.
+
+Therefore, Jest uses as placeholder the downwards arrow with corner leftwards:
+
+```js
+const options = {
+  emptyFirstOrLastLinePlaceholder: '↵', // U+21B5
+};
+```
+
+If a content line is empty, then the corresponding comparison line is automatically trimmed to remove the margin space (represented as a middle dot below) for the default indicators:
+
+|         Indicator | untrimmed | trimmed |
+| ----------------: | :-------- | :------ |
+|      `aIndicator` | `'-·'`    | `'-'`   |
+|      `bIndicator` | `'+·'`    | `'+'`   |
+| `commonIndicator` | `' ·'`    | `''`    |

node_modules/jest-diff/build/cleanupSemantic.d.ts

+/**
+ * Diff Match and Patch
+ * Copyright 2018 The diff-match-patch Authors.
+ * https://github.com/google/diff-match-patch
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * @fileoverview Computes the difference between two texts to create a patch.
+ * Applies the patch onto another text, allowing for errors.
+ * @author fraser@google.com (Neil Fraser)
+ */
+/**
+ * CHANGES by pedrottimark to diff_match_patch_uncompressed.ts file:
+ *
+ * 1. Delete anything not needed to use diff_cleanupSemantic method
+ * 2. Convert from prototype properties to var declarations
+ * 3. Convert Diff to class from constructor and prototype
+ * 4. Add type annotations for arguments and return values
+ * 5. Add exports
+ */
+/**
+ * The data structure representing a diff is an array of tuples:
+ * [[DIFF_DELETE, 'Hello'], [DIFF_INSERT, 'Goodbye'], [DIFF_EQUAL, ' world.']]
+ * which means: delete 'Hello', add 'Goodbye' and keep ' world.'
+ */
+declare var DIFF_DELETE: number;
+declare var DIFF_INSERT: number;
+declare var DIFF_EQUAL: number;
+/**
+ * Class representing one diff tuple.
+ * Attempts to look like a two-element array (which is what this used to be).
+ * @param {number} op Operation, one of: DIFF_DELETE, DIFF_INSERT, DIFF_EQUAL.
+ * @param {string} text Text to be deleted, inserted, or retained.
+ * @constructor
+ */
+declare class Diff {
+    0: number;
+    1: string;
+    constructor(op: number, text: string);
+}
+/**
+ * Reduce the number of edits by eliminating semantically trivial equalities.
+ * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.
+ */
+declare var diff_cleanupSemantic: (diffs: Array<Diff>) => void;
+export { Diff, DIFF_EQUAL, DIFF_DELETE, DIFF_INSERT, diff_cleanupSemantic as cleanupSemantic, };

node_modules/jest-diff/build/cleanupSemantic.js

+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.cleanupSemantic = exports.DIFF_INSERT = exports.DIFF_DELETE = exports.DIFF_EQUAL = exports.Diff = void 0;
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+/**
+ * Diff Match and Patch
+ * Copyright 2018 The diff-match-patch Authors.
+ * https://github.com/google/diff-match-patch
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * @fileoverview Computes the difference between two texts to create a patch.
+ * Applies the patch onto another text, allowing for errors.
+ * @author fraser@google.com (Neil Fraser)
+ */
+
+/**
+ * CHANGES by pedrottimark to diff_match_patch_uncompressed.ts file:
+ *
+ * 1. Delete anything not needed to use diff_cleanupSemantic method
+ * 2. Convert from prototype properties to var declarations
+ * 3. Convert Diff to class from constructor and prototype
+ * 4. Add type annotations for arguments and return values
+ * 5. Add exports
+ */
+
+/**
+ * The data structure representing a diff is an array of tuples:
+ * [[DIFF_DELETE, 'Hello'], [DIFF_INSERT, 'Goodbye'], [DIFF_EQUAL, ' world.']]
+ * which means: delete 'Hello', add 'Goodbye' and keep ' world.'
+ */
+var DIFF_DELETE = -1;
+exports.DIFF_DELETE = DIFF_DELETE;
+var DIFF_INSERT = 1;
+exports.DIFF_INSERT = DIFF_INSERT;
+var DIFF_EQUAL = 0;
+/**
+ * Class representing one diff tuple.
+ * Attempts to look like a two-element array (which is what this used to be).
+ * @param {number} op Operation, one of: DIFF_DELETE, DIFF_INSERT, DIFF_EQUAL.
+ * @param {string} text Text to be deleted, inserted, or retained.
+ * @constructor
+ */
+
+exports.DIFF_EQUAL = DIFF_EQUAL;
+
+class Diff {
+  constructor(op, text) {
+    _defineProperty(this, 0, void 0);
+
+    _defineProperty(this, 1, void 0);
+
+    this[0] = op;
+    this[1] = text;
+  }
+}
+/**
+ * Determine the common prefix of two strings.
+ * @param {string} text1 First string.
+ * @param {string} text2 Second string.
+ * @return {number} The number of characters common to the start of each
+ *     string.
+ */
+
+exports.Diff = Diff;
+
+var diff_commonPrefix = function (text1, text2) {
+  // Quick check for common null cases.
+  if (!text1 || !text2 || text1.charAt(0) != text2.charAt(0)) {
+    return 0;
+  } // Binary search.
+  // Performance analysis: https://neil.fraser.name/news/2007/10/09/
+
+  var pointermin = 0;
+  var pointermax = Math.min(text1.length, text2.length);
+  var pointermid = pointermax;
+  var pointerstart = 0;
+
+  while (pointermin < pointermid) {
+    if (
+      text1.substring(pointerstart, pointermid) ==
+      text2.substring(pointerstart, pointermid)
+    ) {
+      pointermin = pointermid;
+      pointerstart = pointermin;
+    } else {
+      pointermax = pointermid;
+    }
+
+    pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);
+  }
+
+  return pointermid;
+};
+/**
+ * Determine the common suffix of two strings.
+ * @param {string} text1 First string.
+ * @param {string} text2 Second string.
+ * @return {number} The number of characters common to the end of each string.
+ */
+
+var diff_commonSuffix = function (text1, text2) {
+  // Quick check for common null cases.
+  if (
+    !text1 ||
+    !text2 ||
+    text1.charAt(text1.length - 1) != text2.charAt(text2.length - 1)
+  ) {
+    return 0;
+  } // Binary search.
+  // Performance analysis: https://neil.fraser.name/news/2007/10/09/
+
+  var pointermin = 0;
+  var pointermax = Math.min(text1.length, text2.length);
+  var pointermid = pointermax;
+  var pointerend = 0;
+
+  while (pointermin < pointermid) {
+    if (
+      text1.substring(text1.length - pointermid, text1.length - pointerend) ==
+      text2.substring(text2.length - pointermid, text2.length - pointerend)
+    ) {
+      pointermin = pointermid;
+      pointerend = pointermin;
+    } else {
+      pointermax = pointermid;
+    }
+
+    pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);
+  }
+
+  return pointermid;
+};
+/**
+ * Determine if the suffix of one string is the prefix of another.
+ * @param {string} text1 First string.
+ * @param {string} text2 Second string.
+ * @return {number} The number of characters common to the end of the first
+ *     string and the start of the second string.
+ * @private
+ */
+
+var diff_commonOverlap_ = function (text1, text2) {
+  // Cache the text lengths to prevent multiple calls.
+  var text1_length = text1.length;
+  var text2_length = text2.length; // Eliminate the null case.
+
+  if (text1_length == 0 || text2_length == 0) {
+    return 0;
+  } // Truncate the longer string.
+
+  if (text1_length > text2_length) {
+    text1 = text1.substring(text1_length - text2_length);
+  } else if (text1_length < text2_length) {
+    text2 = text2.substring(0, text1_length);
+  }
+
+  var text_length = Math.min(text1_length, text2_length); // Quick check for the worst case.
+
+  if (text1 == text2) {
+    return text_length;
+  } // Start by looking for a single character match
+  // and increase length until no match is found.
+  // Performance analysis: https://neil.fraser.name/news/2010/11/04/
+
+  var best = 0;
+  var length = 1;
+
+  while (true) {
+    var pattern = text1.substring(text_length - length);
+    var found = text2.indexOf(pattern);
+
+    if (found == -1) {
+      return best;
+    }
+
+    length += found;
+
+    if (
+      found == 0 ||
+      text1.substring(text_length - length) == text2.substring(0, length)
+    ) {
+      best = length;
+      length++;
+    }
+  }
+};
+/**
+ * Reduce the number of edits by eliminating semantically trivial equalities.
+ * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.
+ */
+
+var diff_cleanupSemantic = function (diffs) {
+  var changes = false;
+  var equalities = []; // Stack of indices where equalities are found.
+
+  var equalitiesLength = 0; // Keeping our own length var is faster in JS.
+
+  /** @type {?string} */
+
+  var lastEquality = null; // Always equal to diffs[equalities[equalitiesLength - 1]][1]
+
+  var pointer = 0; // Index of current position.
+  // Number of characters that changed prior to the equality.
+
+  var length_insertions1 = 0;
+  var length_deletions1 = 0; // Number of characters that changed after the equality.
+
+  var length_insertions2 = 0;
+  var length_deletions2 = 0;
+
+  while (pointer < diffs.length) {
+    if (diffs[pointer][0] == DIFF_EQUAL) {
+      // Equality found.
+      equalities[equalitiesLength++] = pointer;
+      length_insertions1 = length_insertions2;
+      length_deletions1 = length_deletions2;
+      length_insertions2 = 0;
+      length_deletions2 = 0;
+      lastEquality = diffs[pointer][1];
+    } else {
+      // An insertion or deletion.
+      if (diffs[pointer][0] == DIFF_INSERT) {
+        length_insertions2 += diffs[pointer][1].length;
+      } else {
+        length_deletions2 += diffs[pointer][1].length;
+      } // Eliminate an equality that is smaller or equal to the edits on both
+      // sides of it.
+
+      if (
+        lastEquality &&
+        lastEquality.length <=
+          Math.max(length_insertions1, length_deletions1) &&
+        lastEquality.length <= Math.max(length_insertions2, length_deletions2)
+      ) {
+        // Duplicate record.
+        diffs.splice(
+          equalities[equalitiesLength - 1],
+          0,
+          new Diff(DIFF_DELETE, lastEquality)
+        ); // Change second copy to insert.
+
+        diffs[equalities[equalitiesLength - 1] + 1][0] = DIFF_INSERT; // Throw away the equality we just deleted.
+
+        equalitiesLength--; // Throw away the previous equality (it needs to be reevaluated).
+
+        equalitiesLength--;
+        pointer = equalitiesLength > 0 ? equalities[equalitiesLength - 1] : -1;
+        length_insertions1 = 0; // Reset the counters.
+
+        length_deletions1 = 0;
+        length_insertions2 = 0;
+        length_deletions2 = 0;
+        lastEquality = null;
+        changes = true;
+      }
+    }
+
+    pointer++;
+  } // Normalize the diff.
+
+  if (changes) {
+    diff_cleanupMerge(diffs);
+  }
+
+  diff_cleanupSemanticLossless(diffs); // Find any overlaps between deletions and insertions.
+  // e.g: <del>abcxxx</del><ins>xxxdef</ins>
+  //   -> <del>abc</del>xxx<ins>def</ins>
+  // e.g: <del>xxxabc</del><ins>defxxx</ins>
+  //   -> <ins>def</ins>xxx<del>abc</del>
+  // Only extract an overlap if it is as big as the edit ahead or behind it.
+
+  pointer = 1;
+
+  while (pointer < diffs.length) {
+    if (
+      diffs[pointer - 1][0] == DIFF_DELETE &&
+      diffs[pointer][0] == DIFF_INSERT
+    ) {
+      var deletion = diffs[pointer - 1][1];
+      var insertion = diffs[pointer][1];
+      var overlap_length1 = diff_commonOverlap_(deletion, insertion);
+      var overlap_length2 = diff_commonOverlap_(insertion, deletion);
+
+      if (overlap_length1 >= overlap_length2) {
+        if (
+          overlap_length1 >= deletion.length / 2 ||
+          overlap_length1 >= insertion.length / 2
+        ) {
+          // Overlap found.  Insert an equality and trim the surrounding edits.
+          diffs.splice(
+            pointer,
+            0,
+            new Diff(DIFF_EQUAL, insertion.substring(0, overlap_length1))
+          );
+          diffs[pointer - 1][1] = deletion.substring(
+            0,
+            deletion.length - overlap_length1
+          );
+          diffs[pointer + 1][1] = insertion.substring(overlap_length1);
+          pointer++;
+        }
+      } else {
+        if (
+          overlap_length2 >= deletion.length / 2 ||
+          overlap_length2 >= insertion.length / 2
+        ) {
+          // Reverse overlap found.
+          // Insert an equality and swap and trim the surrounding edits.
+          diffs.splice(
+            pointer,
+            0,
+            new Diff(DIFF_EQUAL, deletion.substring(0, overlap_length2))
+          );
+          diffs[pointer - 1][0] = DIFF_INSERT;
+          diffs[pointer - 1][1] = insertion.substring(
+            0,
+            insertion.length - overlap_length2
+          );
+          diffs[pointer + 1][0] = DIFF_DELETE;
+          diffs[pointer + 1][1] = deletion.substring(overlap_length2);
+          pointer++;
+        }
+      }
+
+      pointer++;
+    }
+
+    pointer++;
+  }
+};
+/**
+ * Look for single edits surrounded on both sides by equalities
+ * which can be shifted sideways to align the edit to a word boundary.
+ * e.g: The c<ins>at c</ins>ame. -> The <ins>cat </ins>came.
+ * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.
+ */
+
+exports.cleanupSemantic = diff_cleanupSemantic;
+
+var diff_cleanupSemanticLossless = function (diffs) {
+  /**
+   * Given two strings, compute a score representing whether the internal
+   * boundary falls on logical boundaries.
+   * Scores range from 6 (best) to 0 (worst).
+   * Closure, but does not reference any external variables.
+   * @param {string} one First string.
+   * @param {string} two Second string.
+   * @return {number} The score.
+   * @private
+   */
+  function diff_cleanupSemanticScore_(one, two) {
+    if (!one || !two) {
+      // Edges are the best.
+      return 6;
+    } // Each port of this function behaves slightly differently due to
+    // subtle differences in each language's definition of things like
+    // 'whitespace'.  Since this function's purpose is largely cosmetic,
+    // the choice has been made to use each language's native features
+    // rather than force total conformity.
+
+    var char1 = one.charAt(one.length - 1);
+    var char2 = two.charAt(0);
+    var nonAlphaNumeric1 = char1.match(nonAlphaNumericRegex_);
+    var nonAlphaNumeric2 = char2.match(nonAlphaNumericRegex_);
+    var whitespace1 = nonAlphaNumeric1 && char1.match(whitespaceRegex_);
+    var whitespace2 = nonAlphaNumeric2 && char2.match(whitespaceRegex_);
+    var lineBreak1 = whitespace1 && char1.match(linebreakRegex_);
+    var lineBreak2 = whitespace2 && char2.match(linebreakRegex_);
+    var blankLine1 = lineBreak1 && one.match(blanklineEndRegex_);
+    var blankLine2 = lineBreak2 && two.match(blanklineStartRegex_);
+
+    if (blankLine1 || blankLine2) {
+      // Five points for blank lines.
+      return 5;
+    } else if (lineBreak1 || lineBreak2) {
+      // Four points for line breaks.
+      return 4;
+    } else if (nonAlphaNumeric1 && !whitespace1 && whitespace2) {
+      // Three points for end of sentences.
+      return 3;
+    } else if (whitespace1 || whitespace2) {
+      // Two points for whitespace.
+      return 2;
+    } else if (nonAlphaNumeric1 || nonAlphaNumeric2) {
+      // One point for non-alphanumeric.
+      return 1;
+    }
+
+    return 0;
+  }
+
+  var pointer = 1; // Intentionally ignore the first and last element (don't need checking).
+
+  while (pointer < diffs.length - 1) {
+    if (
+      diffs[pointer - 1][0] == DIFF_EQUAL &&
+      diffs[pointer + 1][0] == DIFF_EQUAL
+    ) {
+      // This is a single edit surrounded by equalities.
+      var equality1 = diffs[pointer - 1][1];
+      var edit = diffs[pointer][1];
+      var equality2 = diffs[pointer + 1][1]; // First, shift the edit as far left as possible.
+
+      var commonOffset = diff_commonSuffix(equality1, edit);
+
+      if (commonOffset) {
+        var commonString = edit.substring(edit.length - commonOffset);
+        equality1 = equality1.substring(0, equality1.length - commonOffset);
+        edit = commonString + edit.substring(0, edit.length - commonOffset);
+        equality2 = commonString + equality2;
+      } // Second, step character by character right, looking for the best fit.
+
+      var bestEquality1 = equality1;
+      var bestEdit = edit;
+      var bestEquality2 = equality2;
+      var bestScore =
+        diff_cleanupSemanticScore_(equality1, edit) +
+        diff_cleanupSemanticScore_(edit, equality2);
+
+      while (edit.charAt(0) === equality2.charAt(0)) {
+        equality1 += edit.charAt(0);
+        edit = edit.substring(1) + equality2.charAt(0);
+        equality2 = equality2.substring(1);
+        var score =
+          diff_cleanupSemanticScore_(equality1, edit) +
+          diff_cleanupSemanticScore_(edit, equality2); // The >= encourages trailing rather than leading whitespace on edits.
+
+        if (score >= bestScore) {
+          bestScore = score;
+          bestEquality1 = equality1;
+          bestEdit = edit;
+          bestEquality2 = equality2;
+        }
+      }
+
+      if (diffs[pointer - 1][1] != bestEquality1) {
+        // We have an improvement, save it back to the diff.
+        if (bestEquality1) {
+          diffs[pointer - 1][1] = bestEquality1;
+        } else {
+          diffs.splice(pointer - 1, 1);
+          pointer--;
+        }
+
+        diffs[pointer][1] = bestEdit;
+
+        if (bestEquality2) {
+          diffs[pointer + 1][1] = bestEquality2;
+        } else {
+          diffs.splice(pointer + 1, 1);
+          pointer--;
+        }
+      }
+    }
+
+    pointer++;
+  }
+}; // Define some regex patterns for matching boundaries.
+
+var nonAlphaNumericRegex_ = /[^a-zA-Z0-9]/;
+var whitespaceRegex_ = /\s/;
+var linebreakRegex_ = /[\r\n]/;
+var blanklineEndRegex_ = /\n\r?\n$/;
+var blanklineStartRegex_ = /^\r?\n\r?\n/;
+/**
+ * Reorder and merge like edit sections.  Merge equalities.
+ * Any edit section can move as long as it doesn't cross an equality.
+ * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.
+ */
+
+var diff_cleanupMerge = function (diffs) {
+  // Add a dummy entry at the end.
+  diffs.push(new Diff(DIFF_EQUAL, ''));
+  var pointer = 0;
+  var count_delete = 0;
+  var count_insert = 0;
+  var text_delete = '';
+  var text_insert = '';
+  var commonlength;
+
+  while (pointer < diffs.length) {
+    switch (diffs[pointer][0]) {
+      case DIFF_INSERT:
+        count_insert++;
+        text_insert += diffs[pointer][1];
+        pointer++;
+        break;
+
+      case DIFF_DELETE:
+        count_delete++;
+        text_delete += diffs[pointer][1];
+        pointer++;
+        break;
+
+      case DIFF_EQUAL:
+        // Upon reaching an equality, check for prior redundancies.
+        if (count_delete + count_insert > 1) {
+          if (count_delete !== 0 && count_insert !== 0) {
+            // Factor out any common prefixies.
+            commonlength = diff_commonPrefix(text_insert, text_delete);
+
+            if (commonlength !== 0) {
+              if (
+                pointer - count_delete - count_insert > 0 &&
+                diffs[pointer - count_delete - count_insert - 1][0] ==
+                  DIFF_EQUAL
+              ) {
+                diffs[
+                  pointer - count_delete - count_insert - 1
+                ][1] += text_insert.substring(0, commonlength);
+              } else {
+                diffs.splice(
+                  0,
+                  0,
+                  new Diff(DIFF_EQUAL, text_insert.substring(0, commonlength))
+                );
+                pointer++;
+              }
+
+              text_insert = text_insert.substring(commonlength);
+              text_delete = text_delete.substring(commonlength);
+            } // Factor out any common suffixies.
+
+            commonlength = diff_commonSuffix(text_insert, text_delete);
+
+            if (commonlength !== 0) {
+              diffs[pointer][1] =
+                text_insert.substring(text_insert.length - commonlength) +
+                diffs[pointer][1];
+              text_insert = text_insert.substring(
+                0,
+                text_insert.length - commonlength
+              );
+              text_delete = text_delete.substring(
+                0,
+                text_delete.length - commonlength
+              );
+            }
+          } // Delete the offending records and add the merged ones.
+
+          pointer -= count_delete + count_insert;
+          diffs.splice(pointer, count_delete + count_insert);
+
+          if (text_delete.length) {
+            diffs.splice(pointer, 0, new Diff(DIFF_DELETE, text_delete));
+            pointer++;
+          }
+
+          if (text_insert.length) {
+            diffs.splice(pointer, 0, new Diff(DIFF_INSERT, text_insert));
+            pointer++;
+          }
+
+          pointer++;
+        } else if (pointer !== 0 && diffs[pointer - 1][0] == DIFF_EQUAL) {
+          // Merge this equality with the previous one.
+          diffs[pointer - 1][1] += diffs[pointer][1];
+          diffs.splice(pointer, 1);
+        } else {
+          pointer++;
+        }
+
+        count_insert = 0;
+        count_delete = 0;
+        text_delete = '';
+        text_insert = '';
+        break;
+    }
+  }
+
+  if (diffs[diffs.length - 1][1] === '') {
+    diffs.pop(); // Remove the dummy entry at the end.
+  } // Second pass: look for single edits surrounded on both sides by equalities
+  // which can be shifted sideways to eliminate an equality.
+  // e.g: A<ins>BA</ins>C -> <ins>AB</ins>AC
+
+  var changes = false;
+  pointer = 1; // Intentionally ignore the first and last element (don't need checking).
+
+  while (pointer < diffs.length - 1) {
+    if (
+      diffs[pointer - 1][0] == DIFF_EQUAL &&
+      diffs[pointer + 1][0] == DIFF_EQUAL
+    ) {
+      // This is a single edit surrounded by equalities.
+      if (
+        diffs[pointer][1].substring(
+          diffs[pointer][1].length - diffs[pointer - 1][1].length
+        ) == diffs[pointer - 1][1]
+      ) {
+        // Shift the edit over the previous equality.
+        diffs[pointer][1] =
+          diffs[pointer - 1][1] +
+          diffs[pointer][1].substring(
+            0,
+            diffs[pointer][1].length - diffs[pointer - 1][1].length
+          );
+        diffs[pointer + 1][1] = diffs[pointer - 1][1] + diffs[pointer + 1][1];
+        diffs.splice(pointer - 1, 1);
+        changes = true;
+      } else if (
+        diffs[pointer][1].substring(0, diffs[pointer + 1][1].length) ==
+        diffs[pointer + 1][1]
+      ) {
+        // Shift the edit over the next equality.
+        diffs[pointer - 1][1] += diffs[pointer + 1][1];
+        diffs[pointer][1] =
+          diffs[pointer][1].substring(diffs[pointer + 1][1].length) +
+          diffs[pointer + 1][1];
+        diffs.splice(pointer + 1, 1);
+        changes = true;
+      }
+    }
+
+    pointer++;
+  } // If shifts were made, the diff needs reordering and another shift sweep.
+
+  if (changes) {
+    diff_cleanupMerge(diffs);
+  }
+};

node_modules/jest-diff/build/constants.d.ts

+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export declare const NO_DIFF_MESSAGE = "Compared values have no visual difference.";
+export declare const SIMILAR_MESSAGE: string;

node_modules/jest-diff/build/constants.js

+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.SIMILAR_MESSAGE = exports.NO_DIFF_MESSAGE = void 0;
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+const NO_DIFF_MESSAGE = 'Compared values have no visual difference.';
+exports.NO_DIFF_MESSAGE = NO_DIFF_MESSAGE;
+const SIMILAR_MESSAGE =
+  'Compared values serialize to the same structure.\n' +
+  'Printing internal object structure without calling `toJSON` instead.';
+exports.SIMILAR_MESSAGE = SIMILAR_MESSAGE;

node_modules/jest-diff/build/diffLines.d.ts

+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import { Diff } from './cleanupSemantic';
+import type { DiffOptions } from './types';
+export declare const diffLinesUnified: (aLines: Array<string>, bLines: Array<string>, options?: DiffOptions | undefined) => string;
+export declare const diffLinesUnified2: (aLinesDisplay: Array<string>, bLinesDisplay: Array<string>, aLinesCompare: Array<string>, bLinesCompare: Array<string>, options?: DiffOptions | undefined) => string;
+export declare const diffLinesRaw: (aLines: Array<string>, bLines: Array<string>) => Array<Diff>;

node_modules/jest-diff/build/diffLines.js

+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.diffLinesRaw = exports.diffLinesUnified2 = exports.diffLinesUnified = void 0;
+
+var _diffSequences = _interopRequireDefault(require('diff-sequences'));
+
+var _cleanupSemantic = require('./cleanupSemantic');
+
+var _normalizeDiffOptions = require('./normalizeDiffOptions');
+
+var _printDiffs = require('./printDiffs');
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+const isEmptyString = lines => lines.length === 1 && lines[0].length === 0; // Compare two arrays of strings line-by-line. Format as comparison lines.
+
+const diffLinesUnified = (aLines, bLines, options) =>
+  (0, _printDiffs.printDiffLines)(
+    diffLinesRaw(
+      isEmptyString(aLines) ? [] : aLines,
+      isEmptyString(bLines) ? [] : bLines
+    ),
+    (0, _normalizeDiffOptions.normalizeDiffOptions)(options)
+  ); // Given two pairs of arrays of strings:
+// Compare the pair of comparison arrays line-by-line.
+// Format the corresponding lines in the pair of displayable arrays.
+
+exports.diffLinesUnified = diffLinesUnified;
+
+const diffLinesUnified2 = (
+  aLinesDisplay,
+  bLinesDisplay,
+  aLinesCompare,
+  bLinesCompare,
+  options
+) => {
+  if (isEmptyString(aLinesDisplay) && isEmptyString(aLinesCompare)) {
+    aLinesDisplay = [];
+    aLinesCompare = [];
+  }
+
+  if (isEmptyString(bLinesDisplay) && isEmptyString(bLinesCompare)) {
+    bLinesDisplay = [];
+    bLinesCompare = [];
+  }
+
+  if (
+    aLinesDisplay.length !== aLinesCompare.length ||
+    bLinesDisplay.length !== bLinesCompare.length
+  ) {
+    // Fall back to diff of display lines.
+    return diffLinesUnified(aLinesDisplay, bLinesDisplay, options);
+  }
+
+  const diffs = diffLinesRaw(aLinesCompare, bLinesCompare); // Replace comparison lines with displayable lines.
+
+  let aIndex = 0;
+  let bIndex = 0;
+  diffs.forEach(diff => {
+    switch (diff[0]) {
+      case _cleanupSemantic.DIFF_DELETE:
+        diff[1] = aLinesDisplay[aIndex];
+        aIndex += 1;
+        break;
+
+      case _cleanupSemantic.DIFF_INSERT:
+        diff[1] = bLinesDisplay[bIndex];
+        bIndex += 1;
+        break;
+
+      default:
+        diff[1] = bLinesDisplay[bIndex];
+        aIndex += 1;
+        bIndex += 1;
+    }
+  });
+  return (0, _printDiffs.printDiffLines)(
+    diffs,
+    (0, _normalizeDiffOptions.normalizeDiffOptions)(options)
+  );
+}; // Compare two arrays of strings line-by-line.
+
+exports.diffLinesUnified2 = diffLinesUnified2;
+
+const diffLinesRaw = (aLines, bLines) => {
+  const aLength = aLines.length;
+  const bLength = bLines.length;
+
+  const isCommon = (aIndex, bIndex) => aLines[aIndex] === bLines[bIndex];
+
+  const diffs = [];
+  let aIndex = 0;
+  let bIndex = 0;
+
+  const foundSubsequence = (nCommon, aCommon, bCommon) => {
+    for (; aIndex !== aCommon; aIndex += 1) {
+      diffs.push(
+        new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_DELETE, aLines[aIndex])
+      );
+    }
+
+    for (; bIndex !== bCommon; bIndex += 1) {
+      diffs.push(
+        new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_INSERT, bLines[bIndex])
+      );
+    }
+
+    for (; nCommon !== 0; nCommon -= 1, aIndex += 1, bIndex += 1) {
+      diffs.push(
+        new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_EQUAL, bLines[bIndex])
+      );
+    }
+  };
+
+  (0, _diffSequences.default)(aLength, bLength, isCommon, foundSubsequence); // After the last common subsequence, push remaining change items.
+
+  for (; aIndex !== aLength; aIndex += 1) {
+    diffs.push(
+      new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_DELETE, aLines[aIndex])
+    );
+  }
+
+  for (; bIndex !== bLength; bIndex += 1) {
+    diffs.push(
+      new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_INSERT, bLines[bIndex])
+    );
+  }
+
+  return diffs;
+};
+
+exports.diffLinesRaw = diffLinesRaw;

node_modules/jest-diff/build/diffStrings.d.ts

+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import { Diff } from './cleanupSemantic';
+declare const diffStrings: (a: string, b: string) => Array<Diff>;
+export default diffStrings;

node_modules/jest-diff/build/diffStrings.js

+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+var _diffSequences = _interopRequireDefault(require('diff-sequences'));
+
+var _cleanupSemantic = require('./cleanupSemantic');
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+const diffStrings = (a, b) => {
+  const isCommon = (aIndex, bIndex) => a[aIndex] === b[bIndex];
+
+  let aIndex = 0;
+  let bIndex = 0;
+  const diffs = [];
+
+  const foundSubsequence = (nCommon, aCommon, bCommon) => {
+    if (aIndex !== aCommon) {
+      diffs.push(
+        new _cleanupSemantic.Diff(
+          _cleanupSemantic.DIFF_DELETE,
+          a.slice(aIndex, aCommon)
+        )
+      );
+    }
+
+    if (bIndex !== bCommon) {
+      diffs.push(
+        new _cleanupSemantic.Diff(
+          _cleanupSemantic.DIFF_INSERT,
+          b.slice(bIndex, bCommon)
+        )
+      );
+    }
+
+    aIndex = aCommon + nCommon; // number of characters compared in a
+
+    bIndex = bCommon + nCommon; // number of characters compared in b
+
+    diffs.push(
+      new _cleanupSemantic.Diff(
+        _cleanupSemantic.DIFF_EQUAL,
+        b.slice(bCommon, bIndex)
+      )
+    );
+  };
+
+  (0, _diffSequences.default)(a.length, b.length, isCommon, foundSubsequence); // After the last common subsequence, push remaining change items.
+
+  if (aIndex !== a.length) {
+    diffs.push(
+      new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_DELETE, a.slice(aIndex))
+    );
+  }
+
+  if (bIndex !== b.length) {
+    diffs.push(
+      new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_INSERT, b.slice(bIndex))
+    );
+  }
+
+  return diffs;
+};
+
+var _default = diffStrings;
+exports.default = _default;

node_modules/jest-diff/build/getAlignedDiffs.d.ts

+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import { Diff } from './cleanupSemantic';
+import type { DiffOptionsColor } from './types';
+declare const getAlignedDiffs: (diffs: Array<Diff>, changeColor: DiffOptionsColor) => Array<Diff>;
+export default getAlignedDiffs;

node_modules/jest-diff/build/getAlignedDiffs.js

+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+var _cleanupSemantic = require('./cleanupSemantic');
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+// Given change op and array of diffs, return concatenated string:
+// * include common strings
+// * include change strings which have argument op with changeColor
+// * exclude change strings which have opposite op
+const concatenateRelevantDiffs = (op, diffs, changeColor) =>
+  diffs.reduce(
+    (reduced, diff) =>
+      reduced +
+      (diff[0] === _cleanupSemantic.DIFF_EQUAL
+        ? diff[1]
+        : diff[0] === op && diff[1].length !== 0 // empty if change is newline
+        ? changeColor(diff[1])
+        : ''),
+    ''
+  ); // Encapsulate change lines until either a common newline or the end.
+
+class ChangeBuffer {
+  // incomplete line
+  // complete lines
+  constructor(op, changeColor) {
+    _defineProperty(this, 'op', void 0);
+
+    _defineProperty(this, 'line', void 0);
+
+    _defineProperty(this, 'lines', void 0);
+
+    _defineProperty(this, 'changeColor', void 0);
+
+    this.op = op;
+    this.line = [];
+    this.lines = [];
+    this.changeColor = changeColor;
+  }
+
+  pushSubstring(substring) {
+    this.pushDiff(new _cleanupSemantic.Diff(this.op, substring));
+  }
+
+  pushLine() {
+    // Assume call only if line has at least one diff,
+    // therefore an empty line must have a diff which has an empty string.
+    // If line has multiple diffs, then assume it has a common diff,
+    // therefore change diffs have change color;
+    // otherwise then it has line color only.
+    this.lines.push(
+      this.line.length !== 1
+        ? new _cleanupSemantic.Diff(
+            this.op,
+            concatenateRelevantDiffs(this.op, this.line, this.changeColor)
+          )
+        : this.line[0][0] === this.op
+        ? this.line[0] // can use instance
+        : new _cleanupSemantic.Diff(this.op, this.line[0][1]) // was common diff
+    );
+    this.line.length = 0;
+  }
+
+  isLineEmpty() {
+    return this.line.length === 0;
+  } // Minor input to buffer.
+
+  pushDiff(diff) {
+    this.line.push(diff);
+  } // Main input to buffer.
+
+  align(diff) {
+    const string = diff[1];
+
+    if (string.includes('\n')) {
+      const substrings = string.split('\n');
+      const iLast = substrings.length - 1;
+      substrings.forEach((substring, i) => {
+        if (i < iLast) {
+          // The first substring completes the current change line.
+          // A middle substring is a change line.
+          this.pushSubstring(substring);
+          this.pushLine();
+        } else if (substring.length !== 0) {
+          // The last substring starts a change line, if it is not empty.
+          // Important: This non-empty condition also automatically omits
+          // the newline appended to the end of expected and received strings.
+          this.pushSubstring(substring);
+        }
+      });
+    } else {
+      // Append non-multiline string to current change line.
+      this.pushDiff(diff);
+    }
+  } // Output from buffer.
+
+  moveLinesTo(lines) {
+    if (!this.isLineEmpty()) {
+      this.pushLine();
+    }
+
+    lines.push(...this.lines);
+    this.lines.length = 0;
+  }
+} // Encapsulate common and change lines.
+
+class CommonBuffer {
+  constructor(deleteBuffer, insertBuffer) {
+    _defineProperty(this, 'deleteBuffer', void 0);
+
+    _defineProperty(this, 'insertBuffer', void 0);
+
+    _defineProperty(this, 'lines', void 0);
+
+    this.deleteBuffer = deleteBuffer;
+    this.insertBuffer = insertBuffer;
+    this.lines = [];
+  }
+
+  pushDiffCommonLine(diff) {
+    this.lines.push(diff);
+  }
+
+  pushDiffChangeLines(diff) {
+    const isDiffEmpty = diff[1].length === 0; // An empty diff string is redundant, unless a change line is empty.
+
+    if (!isDiffEmpty || this.deleteBuffer.isLineEmpty()) {
+      this.deleteBuffer.pushDiff(diff);
+    }
+
+    if (!isDiffEmpty || this.insertBuffer.isLineEmpty()) {
+      this.insertBuffer.pushDiff(diff);
+    }
+  }
+
+  flushChangeLines() {
+    this.deleteBuffer.moveLinesTo(this.lines);
+    this.insertBuffer.moveLinesTo(this.lines);
+  } // Input to buffer.
+
+  align(diff) {
+    const op = diff[0];
+    const string = diff[1];
+
+    if (string.includes('\n')) {
+      const substrings = string.split('\n');
+      const iLast = substrings.length - 1;
+      substrings.forEach((substring, i) => {
+        if (i === 0) {
+          const subdiff = new _cleanupSemantic.Diff(op, substring);
+
+          if (
+            this.deleteBuffer.isLineEmpty() &&
+            this.insertBuffer.isLineEmpty()
+          ) {
+            // If both current change lines are empty,
+            // then the first substring is a common line.
+            this.flushChangeLines();
+            this.pushDiffCommonLine(subdiff);
+          } else {
+            // If either current change line is non-empty,
+            // then the first substring completes the change lines.
+            this.pushDiffChangeLines(subdiff);
+            this.flushChangeLines();
+          }
+        } else if (i < iLast) {
+          // A middle substring is a common line.
+          this.pushDiffCommonLine(new _cleanupSemantic.Diff(op, substring));
+        } else if (substring.length !== 0) {
+          // The last substring starts a change line, if it is not empty.
+          // Important: This non-empty condition also automatically omits
+          // the newline appended to the end of expected and received strings.
+          this.pushDiffChangeLines(new _cleanupSemantic.Diff(op, substring));
+        }
+      });
+    } else {
+      // Append non-multiline string to current change lines.
+      // Important: It cannot be at the end following empty change lines,
+      // because newline appended to the end of expected and received strings.
+      this.pushDiffChangeLines(diff);
+    }
+  } // Output from buffer.
+
+  getLines() {
+    this.flushChangeLines();
+    return this.lines;
+  }
+} // Given diffs from expected and received strings,
+// return new array of diffs split or joined into lines.
+//
+// To correctly align a change line at the end, the algorithm:
+// * assumes that a newline was appended to the strings
+// * omits the last newline from the output array
+//
+// Assume the function is not called:
+// * if either expected or received is empty string
+// * if neither expected nor received is multiline string
+
+const getAlignedDiffs = (diffs, changeColor) => {
+  const deleteBuffer = new ChangeBuffer(
+    _cleanupSemantic.DIFF_DELETE,
+    changeColor
+  );
+  const insertBuffer = new ChangeBuffer(
+    _cleanupSemantic.DIFF_INSERT,
+    changeColor
+  );
+  const commonBuffer = new CommonBuffer(deleteBuffer, insertBuffer);
+  diffs.forEach(diff => {
+    switch (diff[0]) {
+      case _cleanupSemantic.DIFF_DELETE:
+        deleteBuffer.align(diff);
+        break;
+
+      case _cleanupSemantic.DIFF_INSERT:
+        insertBuffer.align(diff);
+        break;
+
+      default:
+        commonBuffer.align(diff);
+    }
+  });
+  return commonBuffer.getLines();
+};
+
+var _default = getAlignedDiffs;
+exports.default = _default;

node_modules/jest-diff/build/index.d.ts

+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import { DIFF_DELETE, DIFF_EQUAL, DIFF_INSERT, Diff } from './cleanupSemantic';
+import { diffLinesRaw, diffLinesUnified, diffLinesUnified2 } from './diffLines';
+import { diffStringsRaw, diffStringsUnified } from './printDiffs';
+import type { DiffOptions } from './types';
+export type { DiffOptions, DiffOptionsColor } from './types';
+export { diffLinesRaw, diffLinesUnified, diffLinesUnified2 };
+export { diffStringsRaw, diffStringsUnified };
+export { DIFF_DELETE, DIFF_EQUAL, DIFF_INSERT, Diff };
+declare function diff(a: any, b: any, options?: DiffOptions): string | null;
+export default diff;

node_modules/jest-diff/build/index.js

+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+Object.defineProperty(exports, 'DIFF_DELETE', {
+  enumerable: true,
+  get: function () {
+    return _cleanupSemantic.DIFF_DELETE;
+  }
+});
+Object.defineProperty(exports, 'DIFF_EQUAL', {
+  enumerable: true,
+  get: function () {
+    return _cleanupSemantic.DIFF_EQUAL;
+  }
+});
+Object.defineProperty(exports, 'DIFF_INSERT', {
+  enumerable: true,
+  get: function () {
+    return _cleanupSemantic.DIFF_INSERT;
+  }
+});
+Object.defineProperty(exports, 'Diff', {
+  enumerable: true,
+  get: function () {
+    return _cleanupSemantic.Diff;
+  }
+});
+Object.defineProperty(exports, 'diffLinesRaw', {
+  enumerable: true,
+  get: function () {
+    return _diffLines.diffLinesRaw;
+  }
+});
+Object.defineProperty(exports, 'diffLinesUnified', {
+  enumerable: true,
+  get: function () {
+    return _diffLines.diffLinesUnified;
+  }
+});
+Object.defineProperty(exports, 'diffLinesUnified2', {
+  enumerable: true,
+  get: function () {
+    return _diffLines.diffLinesUnified2;
+  }
+});
+Object.defineProperty(exports, 'diffStringsRaw', {
+  enumerable: true,
+  get: function () {
+    return _printDiffs.diffStringsRaw;
+  }
+});
+Object.defineProperty(exports, 'diffStringsUnified', {
+  enumerable: true,
+  get: function () {
+    return _printDiffs.diffStringsUnified;
+  }
+});
+exports.default = void 0;
+
+var _chalk = _interopRequireDefault(require('chalk'));
+
+var _jestGetType = _interopRequireDefault(require('jest-get-type'));
+
+var _prettyFormat = _interopRequireDefault(require('pretty-format'));
+
+var _cleanupSemantic = require('./cleanupSemantic');
+
+var _constants = require('./constants');
+
+var _diffLines = require('./diffLines');
+
+var _normalizeDiffOptions = require('./normalizeDiffOptions');
+
+var _printDiffs = require('./printDiffs');
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+var Symbol = global['jest-symbol-do-not-touch'] || global.Symbol;
+
+const getCommonMessage = (message, options) => {
+  const {commonColor} = (0, _normalizeDiffOptions.normalizeDiffOptions)(
+    options
+  );
+  return commonColor(message);
+};
+
+const {
+  AsymmetricMatcher,
+  DOMCollection,
+  DOMElement,
+  Immutable,
+  ReactElement,
+  ReactTestComponent
+} = _prettyFormat.default.plugins;
+const PLUGINS = [
+  ReactTestComponent,
+  ReactElement,
+  DOMElement,
+  DOMCollection,
+  Immutable,
+  AsymmetricMatcher
+];
+const FORMAT_OPTIONS = {
+  plugins: PLUGINS
+};
+const FORMAT_OPTIONS_0 = {...FORMAT_OPTIONS, indent: 0};
+const FALLBACK_FORMAT_OPTIONS = {
+  callToJSON: false,
+  maxDepth: 10,
+  plugins: PLUGINS
+};
+const FALLBACK_FORMAT_OPTIONS_0 = {...FALLBACK_FORMAT_OPTIONS, indent: 0}; // Generate a string that will highlight the difference between two values
+// with green and red. (similar to how github does code diffing)
+// eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types
+
+function diff(a, b, options) {
+  if (Object.is(a, b)) {
+    return getCommonMessage(_constants.NO_DIFF_MESSAGE, options);
+  }
+
+  const aType = (0, _jestGetType.default)(a);
+  let expectedType = aType;
+  let omitDifference = false;
+
+  if (aType === 'object' && typeof a.asymmetricMatch === 'function') {
+    if (a.$$typeof !== Symbol.for('jest.asymmetricMatcher')) {
+      // Do not know expected type of user-defined asymmetric matcher.
+      return null;
+    }
+
+    if (typeof a.getExpectedType !== 'function') {
+      // For example, expect.anything() matches either null or undefined
+      return null;
+    }
+
+    expectedType = a.getExpectedType(); // Primitive types boolean and number omit difference below.
+    // For example, omit difference for expect.stringMatching(regexp)
+
+    omitDifference = expectedType === 'string';
+  }
+
+  if (expectedType !== (0, _jestGetType.default)(b)) {
+    return (
+      '  Comparing two different types of values.' +
+      ` Expected ${_chalk.default.green(expectedType)} but ` +
+      `received ${_chalk.default.red((0, _jestGetType.default)(b))}.`
+    );
+  }
+
+  if (omitDifference) {
+    return null;
+  }
+
+  switch (aType) {
+    case 'string':
+      return (0, _diffLines.diffLinesUnified)(
+        a.split('\n'),
+        b.split('\n'),
+        options
+      );
+
+    case 'boolean':
+    case 'number':
+      return comparePrimitive(a, b, options);
+
+    case 'map':
+      return compareObjects(sortMap(a), sortMap(b), options);
+
+    case 'set':
+      return compareObjects(sortSet(a), sortSet(b), options);
+
+    default:
+      return compareObjects(a, b, options);
+  }
+}
+
+function comparePrimitive(a, b, options) {
+  const aFormat = (0, _prettyFormat.default)(a, FORMAT_OPTIONS);
+  const bFormat = (0, _prettyFormat.default)(b, FORMAT_OPTIONS);
+  return aFormat === bFormat
+    ? getCommonMessage(_constants.NO_DIFF_MESSAGE, options)
+    : (0, _diffLines.diffLinesUnified)(
+        aFormat.split('\n'),
+        bFormat.split('\n'),
+        options
+      );
+}
+
+function sortMap(map) {
+  return new Map(Array.from(map.entries()).sort());
+}
+
+function sortSet(set) {
+  return new Set(Array.from(set.values()).sort());
+}
+
+function compareObjects(a, b, options) {
+  let difference;
+  let hasThrown = false;
+  const noDiffMessage = getCommonMessage(_constants.NO_DIFF_MESSAGE, options);
+
+  try {
+    const aCompare = (0, _prettyFormat.default)(a, FORMAT_OPTIONS_0);
+    const bCompare = (0, _prettyFormat.default)(b, FORMAT_OPTIONS_0);
+
+    if (aCompare === bCompare) {
+      difference = noDiffMessage;
+    } else {
+      const aDisplay = (0, _prettyFormat.default)(a, FORMAT_OPTIONS);
+      const bDisplay = (0, _prettyFormat.default)(b, FORMAT_OPTIONS);
+      difference = (0, _diffLines.diffLinesUnified2)(
+        aDisplay.split('\n'),
+        bDisplay.split('\n'),
+        aCompare.split('\n'),
+        bCompare.split('\n'),
+        options
+      );
+    }
+  } catch {
+    hasThrown = true;
+  } // If the comparison yields no results, compare again but this time
+  // without calling `toJSON`. It's also possible that toJSON might throw.
+
+  if (difference === undefined || difference === noDiffMessage) {
+    const aCompare = (0, _prettyFormat.default)(a, FALLBACK_FORMAT_OPTIONS_0);
+    const bCompare = (0, _prettyFormat.default)(b, FALLBACK_FORMAT_OPTIONS_0);
+
+    if (aCompare === bCompare) {
+      difference = noDiffMessage;
+    } else {
+      const aDisplay = (0, _prettyFormat.default)(a, FALLBACK_FORMAT_OPTIONS);
+      const bDisplay = (0, _prettyFormat.default)(b, FALLBACK_FORMAT_OPTIONS);
+      difference = (0, _diffLines.diffLinesUnified2)(
+        aDisplay.split('\n'),
+        bDisplay.split('\n'),
+        aCompare.split('\n'),
+        bCompare.split('\n'),
+        options
+      );
+    }
+
+    if (difference !== noDiffMessage && !hasThrown) {
+      difference =
+        getCommonMessage(_constants.SIMILAR_MESSAGE, options) +
+        '\n\n' +
+        difference;
+    }
+  }
+
+  return difference;
+}
+
+var _default = diff;
+exports.default = _default;

node_modules/jest-diff/build/joinAlignedDiffs.d.ts

+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import { Diff } from './cleanupSemantic';
+import type { DiffOptionsNormalized } from './types';
+export declare const joinAlignedDiffsNoExpand: (diffs: Array<Diff>, options: DiffOptionsNormalized) => string;
+export declare const joinAlignedDiffsExpand: (diffs: Array<Diff>, options: DiffOptionsNormalized) => string;

node_modules/jest-diff/build/joinAlignedDiffs.js

+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.joinAlignedDiffsExpand = exports.joinAlignedDiffsNoExpand = void 0;
+
+var _cleanupSemantic = require('./cleanupSemantic');
+
+var _printDiffs = require('./printDiffs');
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+// jest --no-expand
+//
+// Given array of aligned strings with inverse highlight formatting,
+// return joined lines with diff formatting (and patch marks, if needed).
+const joinAlignedDiffsNoExpand = (diffs, options) => {
+  const iLength = diffs.length;
+  const nContextLines = options.contextLines;
+  const nContextLines2 = nContextLines + nContextLines; // First pass: count output lines and see if it has patches.
+
+  let jLength = iLength;
+  let hasExcessAtStartOrEnd = false;
+  let nExcessesBetweenChanges = 0;
+  let i = 0;
+
+  while (i !== iLength) {
+    const iStart = i;
+
+    while (i !== iLength && diffs[i][0] === _cleanupSemantic.DIFF_EQUAL) {
+      i += 1;
+    }
+
+    if (iStart !== i) {
+      if (iStart === 0) {
+        // at start
+        if (i > nContextLines) {
+          jLength -= i - nContextLines; // subtract excess common lines
+
+          hasExcessAtStartOrEnd = true;
+        }
+      } else if (i === iLength) {
+        // at end
+        const n = i - iStart;
+
+        if (n > nContextLines) {
+          jLength -= n - nContextLines; // subtract excess common lines
+
+          hasExcessAtStartOrEnd = true;
+        }
+      } else {
+        // between changes
+        const n = i - iStart;
+
+        if (n > nContextLines2) {
+          jLength -= n - nContextLines2; // subtract excess common lines
+
+          nExcessesBetweenChanges += 1;
+        }
+      }
+    }
+
+    while (i !== iLength && diffs[i][0] !== _cleanupSemantic.DIFF_EQUAL) {
+      i += 1;
+    }
+  }
+
+  const hasPatch = nExcessesBetweenChanges !== 0 || hasExcessAtStartOrEnd;
+
+  if (nExcessesBetweenChanges !== 0) {
+    jLength += nExcessesBetweenChanges + 1; // add patch lines
+  } else if (hasExcessAtStartOrEnd) {
+    jLength += 1; // add patch line
+  }
+
+  const jLast = jLength - 1;
+  const lines = [];
+  let jPatchMark = 0; // index of placeholder line for current patch mark
+
+  if (hasPatch) {
+    lines.push(''); // placeholder line for first patch mark
+  } // Indexes of expected or received lines in current patch:
+
+  let aStart = 0;
+  let bStart = 0;
+  let aEnd = 0;
+  let bEnd = 0;
+
+  const pushCommonLine = line => {
+    const j = lines.length;
+    lines.push(
+      (0, _printDiffs.printCommonLine)(line, j === 0 || j === jLast, options)
+    );
+    aEnd += 1;
+    bEnd += 1;
+  };
+
+  const pushDeleteLine = line => {
+    const j = lines.length;
+    lines.push(
+      (0, _printDiffs.printDeleteLine)(line, j === 0 || j === jLast, options)
+    );
+    aEnd += 1;
+  };
+
+  const pushInsertLine = line => {
+    const j = lines.length;
+    lines.push(
+      (0, _printDiffs.printInsertLine)(line, j === 0 || j === jLast, options)
+    );
+    bEnd += 1;
+  }; // Second pass: push lines with diff formatting (and patch marks, if needed).
+
+  i = 0;
+
+  while (i !== iLength) {
+    let iStart = i;
+
+    while (i !== iLength && diffs[i][0] === _cleanupSemantic.DIFF_EQUAL) {
+      i += 1;
+    }
+
+    if (iStart !== i) {
+      if (iStart === 0) {
+        // at beginning
+        if (i > nContextLines) {
+          iStart = i - nContextLines;
+          aStart = iStart;
+          bStart = iStart;
+          aEnd = aStart;
+          bEnd = bStart;
+        }
+
+        for (let iCommon = iStart; iCommon !== i; iCommon += 1) {
+          pushCommonLine(diffs[iCommon][1]);
+        }
+      } else if (i === iLength) {
+        // at end
+        const iEnd = i - iStart > nContextLines ? iStart + nContextLines : i;
+
+        for (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) {
+          pushCommonLine(diffs[iCommon][1]);
+        }
+      } else {
+        // between changes
+        const nCommon = i - iStart;
+
+        if (nCommon > nContextLines2) {
+          const iEnd = iStart + nContextLines;
+
+          for (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) {
+            pushCommonLine(diffs[iCommon][1]);
+          }
+
+          lines[jPatchMark] = (0, _printDiffs.createPatchMark)(
+            aStart,
+            aEnd,
+            bStart,
+            bEnd,
+            options
+          );
+          jPatchMark = lines.length;
+          lines.push(''); // placeholder line for next patch mark
+
+          const nOmit = nCommon - nContextLines2;
+          aStart = aEnd + nOmit;
+          bStart = bEnd + nOmit;
+          aEnd = aStart;
+          bEnd = bStart;
+
+          for (let iCommon = i - nContextLines; iCommon !== i; iCommon += 1) {
+            pushCommonLine(diffs[iCommon][1]);
+          }
+        } else {
+          for (let iCommon = iStart; iCommon !== i; iCommon += 1) {
+            pushCommonLine(diffs[iCommon][1]);
+          }
+        }
+      }
+    }
+
+    while (i !== iLength && diffs[i][0] === _cleanupSemantic.DIFF_DELETE) {
+      pushDeleteLine(diffs[i][1]);
+      i += 1;
+    }
+
+    while (i !== iLength && diffs[i][0] === _cleanupSemantic.DIFF_INSERT) {
+      pushInsertLine(diffs[i][1]);
+      i += 1;
+    }
+  }
+
+  if (hasPatch) {
+    lines[jPatchMark] = (0, _printDiffs.createPatchMark)(
+      aStart,
+      aEnd,
+      bStart,
+      bEnd,
+      options
+    );
+  }
+
+  return lines.join('\n');
+}; // jest --expand
+//
+// Given array of aligned strings with inverse highlight formatting,
+// return joined lines with diff formatting.
+
+exports.joinAlignedDiffsNoExpand = joinAlignedDiffsNoExpand;
+
+const joinAlignedDiffsExpand = (diffs, options) =>
+  diffs
+    .map((diff, i, diffs) => {
+      const line = diff[1];
+      const isFirstOrLast = i === 0 || i === diffs.length - 1;
+
+      switch (diff[0]) {
+        case _cleanupSemantic.DIFF_DELETE:
+          return (0, _printDiffs.printDeleteLine)(line, isFirstOrLast, options);
+
+        case _cleanupSemantic.DIFF_INSERT:
+          return (0, _printDiffs.printInsertLine)(line, isFirstOrLast, options);
+
+        default:
+          return (0, _printDiffs.printCommonLine)(line, isFirstOrLast, options);
+      }
+    })
+    .join('\n');
+
+exports.joinAlignedDiffsExpand = joinAlignedDiffsExpand;

node_modules/jest-diff/build/normalizeDiffOptions.d.ts

+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import type { DiffOptions, DiffOptionsNormalized } from './types';
+export declare const noColor: (string: string) => string;
+export declare const normalizeDiffOptions: (options?: DiffOptions) => DiffOptionsNormalized;

node_modules/jest-diff/build/normalizeDiffOptions.js

+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.normalizeDiffOptions = exports.noColor = void 0;
+
+var _chalk = _interopRequireDefault(require('chalk'));
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+const noColor = string => string;
+
+exports.noColor = noColor;
+const DIFF_CONTEXT_DEFAULT = 5;
+const OPTIONS_DEFAULT = {
+  aAnnotation: 'Expected',
+  aColor: _chalk.default.green,
+  aIndicator: '-',
+  bAnnotation: 'Received',
+  bColor: _chalk.default.red,
+  bIndicator: '+',
+  changeColor: _chalk.default.inverse,
+  changeLineTrailingSpaceColor: noColor,
+  commonColor: _chalk.default.dim,
+  commonIndicator: ' ',
+  commonLineTrailingSpaceColor: noColor,
+  contextLines: DIFF_CONTEXT_DEFAULT,
+  emptyFirstOrLastLinePlaceholder: '',
+  expand: true,
+  includeChangeCounts: false,
+  omitAnnotationLines: false,
+  patchColor: _chalk.default.yellow
+};
+
+const getContextLines = contextLines =>
+  typeof contextLines === 'number' &&
+  Number.isSafeInteger(contextLines) &&
+  contextLines >= 0
+    ? contextLines
+    : DIFF_CONTEXT_DEFAULT; // Pure function returns options with all properties.
+
+const normalizeDiffOptions = (options = {}) => ({
+  ...OPTIONS_DEFAULT,
+  ...options,
+  contextLines: getContextLines(options.contextLines)
+});
+
+exports.normalizeDiffOptions = normalizeDiffOptions;