@ynput/ayon-frontend-shared 0.2.7 → 0.2.9

package/dist/node_modules/decode-named-character-reference/index.dom.cjs.js

@@ -4,11 +4,15 @@ const element = document.createElement("i");
 function decodeNamedCharacterReference(value) {
   const characterReference = "&" + value + ";";
   element.innerHTML = characterReference;
-  const char = element.textContent;
-  if (char.charCodeAt(char.length - 1) === 59 && value !== "semi") {
+  const character = element.textContent;
+  if (
+    // @ts-expect-error: TypeScript is wrong that `textContent` on elements can
+    // yield `null`.
+    character.charCodeAt(character.length - 1) === 59 && value !== "semi"
+  ) {
     return false;
   }
-  return char === characterReference ? false : char;
+  return character === characterReference ? false : character;
 }
 exports.decodeNamedCharacterReference = decodeNamedCharacterReference;
 //# sourceMappingURL=index.dom.cjs.js.map

package/dist/node_modules/decode-named-character-reference/index.dom.cjs.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.dom.cjs.js","sources":["../../../../node_modules/decode-named-character-reference/index.dom.js"],"sourcesContent":["/// <reference lib=\"dom\" />\n\n/* eslint-env browser */\n\nconst element = document.createElement('i')\n\n/**\n * @param {string} value\n * @returns {string|false}\n */\nexport function decodeNamedCharacterReference(value) {\n  const characterReference = '&' + value + ';'\n  element.innerHTML = characterReference\n  const char = element.textContent\n\n  // Some named character references do not require the closing semicolon\n  // (`&not`, for instance), which leads to situations where parsing the assumed\n  // named reference of `&notit;` will result in the string `¬it;`.\n  // When we encounter a trailing semicolon after parsing, and the character\n  // reference to decode was not a semicolon (`&semi;`), we can assume that the\n  // matching was not complete.\n  // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n  // yield `null`.\n  if (char.charCodeAt(char.length - 1) === 59 /* `;` */ && value !== 'semi') {\n    return false\n  }\n\n  // If the decoded string is equal to the input, the character reference was\n  // not valid.\n  // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n  // yield `null`.\n  return char === characterReference ? false : char\n}\n"],"names":[],"mappings":";;AAIA,MAAM,UAAU,SAAS,cAAc,GAAG;AAMnC,SAAS,8BAA8B,OAAO;AACnD,QAAM,qBAAqB,MAAM,QAAQ;AACzC,UAAQ,YAAY;AACpB,QAAM,OAAO,QAAQ;AAUrB,MAAI,KAAK,WAAW,KAAK,SAAS,CAAC,MAAM,MAAgB,UAAU,QAAQ;AACzE,WAAO;AAAA,EACX;AAME,SAAO,SAAS,qBAAqB,QAAQ;AAC/C;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.dom.cjs.js","sources":["../../../../node_modules/decode-named-character-reference/index.dom.js"],"sourcesContent":["/// <reference lib=\"dom\" />\n\n/* eslint-env browser */\n\nconst element = document.createElement('i')\n\n/**\n * @param {string} value\n * @returns {string | false}\n */\nexport function decodeNamedCharacterReference(value) {\n  const characterReference = '&' + value + ';'\n  element.innerHTML = characterReference\n  const character = element.textContent\n\n  // Some named character references do not require the closing semicolon\n  // (`&not`, for instance), which leads to situations where parsing the assumed\n  // named reference of `&notit;` will result in the string `¬it;`.\n  // When we encounter a trailing semicolon after parsing, and the character\n  // reference to decode was not a semicolon (`&semi;`), we can assume that the\n  // matching was not complete.\n  if (\n    // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n    // yield `null`.\n    character.charCodeAt(character.length - 1) === 59 /* `;` */ &&\n    value !== 'semi'\n  ) {\n    return false\n  }\n\n  // If the decoded string is equal to the input, the character reference was\n  // not valid.\n  // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n  // yield `null`.\n  return character === characterReference ? false : character\n}\n"],"names":[],"mappings":";;AAIA,MAAM,UAAU,SAAS,cAAc,GAAG;AAMnC,SAAS,8BAA8B,OAAO;AACnD,QAAM,qBAAqB,MAAM,QAAQ;AACzC,UAAQ,YAAY;AACpB,QAAM,YAAY,QAAQ;AAQ1B;AAAA;AAAA;AAAA,IAGE,UAAU,WAAW,UAAU,SAAS,CAAC,MAAM,MAC/C,UAAU;AAAA,IACV;AACA,WAAO;AAAA,EACX;AAME,SAAO,cAAc,qBAAqB,QAAQ;AACpD;;","x_google_ignoreList":[0]}

package/dist/node_modules/decode-named-character-reference/index.dom.es.js

@@ -2,11 +2,15 @@ const element = document.createElement("i");
 function decodeNamedCharacterReference(value) {
   const characterReference = "&" + value + ";";
   element.innerHTML = characterReference;
-  const char = element.textContent;
-  if (char.charCodeAt(char.length - 1) === 59 && value !== "semi") {
+  const character = element.textContent;
+  if (
+    // @ts-expect-error: TypeScript is wrong that `textContent` on elements can
+    // yield `null`.
+    character.charCodeAt(character.length - 1) === 59 && value !== "semi"
+  ) {
     return false;
   }
-  return char === characterReference ? false : char;
+  return character === characterReference ? false : character;
 }
 export {
   decodeNamedCharacterReference

package/dist/node_modules/decode-named-character-reference/index.dom.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.dom.es.js","sources":["../../../../node_modules/decode-named-character-reference/index.dom.js"],"sourcesContent":["/// <reference lib=\"dom\" />\n\n/* eslint-env browser */\n\nconst element = document.createElement('i')\n\n/**\n * @param {string} value\n * @returns {string|false}\n */\nexport function decodeNamedCharacterReference(value) {\n  const characterReference = '&' + value + ';'\n  element.innerHTML = characterReference\n  const char = element.textContent\n\n  // Some named character references do not require the closing semicolon\n  // (`&not`, for instance), which leads to situations where parsing the assumed\n  // named reference of `&notit;` will result in the string `¬it;`.\n  // When we encounter a trailing semicolon after parsing, and the character\n  // reference to decode was not a semicolon (`&semi;`), we can assume that the\n  // matching was not complete.\n  // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n  // yield `null`.\n  if (char.charCodeAt(char.length - 1) === 59 /* `;` */ && value !== 'semi') {\n    return false\n  }\n\n  // If the decoded string is equal to the input, the character reference was\n  // not valid.\n  // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n  // yield `null`.\n  return char === characterReference ? false : char\n}\n"],"names":[],"mappings":"AAIA,MAAM,UAAU,SAAS,cAAc,GAAG;AAMnC,SAAS,8BAA8B,OAAO;AACnD,QAAM,qBAAqB,MAAM,QAAQ;AACzC,UAAQ,YAAY;AACpB,QAAM,OAAO,QAAQ;AAUrB,MAAI,KAAK,WAAW,KAAK,SAAS,CAAC,MAAM,MAAgB,UAAU,QAAQ;AACzE,WAAO;AAAA,EACX;AAME,SAAO,SAAS,qBAAqB,QAAQ;AAC/C;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.dom.es.js","sources":["../../../../node_modules/decode-named-character-reference/index.dom.js"],"sourcesContent":["/// <reference lib=\"dom\" />\n\n/* eslint-env browser */\n\nconst element = document.createElement('i')\n\n/**\n * @param {string} value\n * @returns {string | false}\n */\nexport function decodeNamedCharacterReference(value) {\n  const characterReference = '&' + value + ';'\n  element.innerHTML = characterReference\n  const character = element.textContent\n\n  // Some named character references do not require the closing semicolon\n  // (`&not`, for instance), which leads to situations where parsing the assumed\n  // named reference of `&notit;` will result in the string `¬it;`.\n  // When we encounter a trailing semicolon after parsing, and the character\n  // reference to decode was not a semicolon (`&semi;`), we can assume that the\n  // matching was not complete.\n  if (\n    // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n    // yield `null`.\n    character.charCodeAt(character.length - 1) === 59 /* `;` */ &&\n    value !== 'semi'\n  ) {\n    return false\n  }\n\n  // If the decoded string is equal to the input, the character reference was\n  // not valid.\n  // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n  // yield `null`.\n  return character === characterReference ? false : character\n}\n"],"names":[],"mappings":"AAIA,MAAM,UAAU,SAAS,cAAc,GAAG;AAMnC,SAAS,8BAA8B,OAAO;AACnD,QAAM,qBAAqB,MAAM,QAAQ;AACzC,UAAQ,YAAY;AACpB,QAAM,YAAY,QAAQ;AAQ1B;AAAA;AAAA;AAAA,IAGE,UAAU,WAAW,UAAU,SAAS,CAAC,MAAM,MAC/C,UAAU;AAAA,IACV;AACA,WAAO;AAAA,EACX;AAME,SAAO,cAAc,qBAAqB,QAAQ;AACpD;","x_google_ignoreList":[0]}

package/dist/node_modules/graphql/language/visitor.cjs.js

@@ -42,10 +42,7 @@ function visit(root, visitor, visitorKeys = ast.QueryDocumentKeys) {
             }
           }
         } else {
-          node = Object.defineProperties(
-            {},
-            Object.getOwnPropertyDescriptors(node)
-          );
+          node = { ...node };
           for (const [editKey, editValue] of edits) {
             node[editKey] = editValue;
           }

package/dist/node_modules/graphql/language/visitor.cjs.js.map

@@ -1 +1 @@
-{"version":3,"file":"visitor.cjs.js","sources":["../../../../../node_modules/graphql/language/visitor.mjs"],"sourcesContent":["import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { isNode, QueryDocumentKeys } from './ast.mjs';\nimport { Kind } from './kinds.mjs';\n/**\n * A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n */\n\nexport const BREAK = Object.freeze({});\n/**\n * visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n *\n * By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n *\n * When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n *\n * ```ts\n * const editedAST = visit(ast, {\n *   enter(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: skip visiting this node\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   },\n *   leave(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: no action\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   }\n * });\n * ```\n *\n * Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to three permutations of the\n * visitor API:\n *\n * 1) Named visitors triggered when entering a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind(node) {\n *     // enter the \"Kind\" node\n *   }\n * })\n * ```\n *\n * 2) Named visitors that trigger upon entering and leaving a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind: {\n *     enter(node) {\n *       // enter the \"Kind\" node\n *     }\n *     leave(node) {\n *       // leave the \"Kind\" node\n *     }\n *   }\n * })\n * ```\n *\n * 3) Generic visitors that trigger upon entering and leaving any node.\n *\n * ```ts\n * visit(ast, {\n *   enter(node) {\n *     // enter any node\n *   },\n *   leave(node) {\n *     // leave any node\n *   }\n * })\n * ```\n */\n\nexport function visit(root, visitor, visitorKeys = QueryDocumentKeys) {\n  const enterLeaveMap = new Map();\n\n  for (const kind of Object.values(Kind)) {\n    enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));\n  }\n  /* eslint-disable no-undef-init */\n\n  let stack = undefined;\n  let inArray = Array.isArray(root);\n  let keys = [root];\n  let index = -1;\n  let edits = [];\n  let node = root;\n  let key = undefined;\n  let parent = undefined;\n  const path = [];\n  const ancestors = [];\n  /* eslint-enable no-undef-init */\n\n  do {\n    index++;\n    const isLeaving = index === keys.length;\n    const isEdited = isLeaving && edits.length !== 0;\n\n    if (isLeaving) {\n      key = ancestors.length === 0 ? undefined : path[path.length - 1];\n      node = parent;\n      parent = ancestors.pop();\n\n      if (isEdited) {\n        if (inArray) {\n          node = node.slice();\n          let editOffset = 0;\n\n          for (const [editKey, editValue] of edits) {\n            const arrayKey = editKey - editOffset;\n\n            if (editValue === null) {\n              node.splice(arrayKey, 1);\n              editOffset++;\n            } else {\n              node[arrayKey] = editValue;\n            }\n          }\n        } else {\n          node = Object.defineProperties(\n            {},\n            Object.getOwnPropertyDescriptors(node),\n          );\n\n          for (const [editKey, editValue] of edits) {\n            node[editKey] = editValue;\n          }\n        }\n      }\n\n      index = stack.index;\n      keys = stack.keys;\n      edits = stack.edits;\n      inArray = stack.inArray;\n      stack = stack.prev;\n    } else if (parent) {\n      key = inArray ? index : keys[index];\n      node = parent[key];\n\n      if (node === null || node === undefined) {\n        continue;\n      }\n\n      path.push(key);\n    }\n\n    let result;\n\n    if (!Array.isArray(node)) {\n      var _enterLeaveMap$get, _enterLeaveMap$get2;\n\n      isNode(node) || devAssert(false, `Invalid AST Node: ${inspect(node)}.`);\n      const visitFn = isLeaving\n        ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get === void 0\n          ? void 0\n          : _enterLeaveMap$get.leave\n        : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get2 === void 0\n        ? void 0\n        : _enterLeaveMap$get2.enter;\n      result =\n        visitFn === null || visitFn === void 0\n          ? void 0\n          : visitFn.call(visitor, node, key, parent, path, ancestors);\n\n      if (result === BREAK) {\n        break;\n      }\n\n      if (result === false) {\n        if (!isLeaving) {\n          path.pop();\n          continue;\n        }\n      } else if (result !== undefined) {\n        edits.push([key, result]);\n\n        if (!isLeaving) {\n          if (isNode(result)) {\n            node = result;\n          } else {\n            path.pop();\n            continue;\n          }\n        }\n      }\n    }\n\n    if (result === undefined && isEdited) {\n      edits.push([key, node]);\n    }\n\n    if (isLeaving) {\n      path.pop();\n    } else {\n      var _node$kind;\n\n      stack = {\n        inArray,\n        index,\n        keys,\n        edits,\n        prev: stack,\n      };\n      inArray = Array.isArray(node);\n      keys = inArray\n        ? node\n        : (_node$kind = visitorKeys[node.kind]) !== null &&\n          _node$kind !== void 0\n        ? _node$kind\n        : [];\n      index = -1;\n      edits = [];\n\n      if (parent) {\n        ancestors.push(parent);\n      }\n\n      parent = node;\n    }\n  } while (stack !== undefined);\n\n  if (edits.length !== 0) {\n    // New root\n    return edits[edits.length - 1][1];\n  }\n\n  return root;\n}\n/**\n * Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n *\n * If a prior visitor edits a node, no following visitors will see that node.\n */\n\nexport function visitInParallel(visitors) {\n  const skipping = new Array(visitors.length).fill(null);\n  const mergedVisitor = Object.create(null);\n\n  for (const kind of Object.values(Kind)) {\n    let hasVisitor = false;\n    const enterList = new Array(visitors.length).fill(undefined);\n    const leaveList = new Array(visitors.length).fill(undefined);\n\n    for (let i = 0; i < visitors.length; ++i) {\n      const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);\n      hasVisitor || (hasVisitor = enter != null || leave != null);\n      enterList[i] = enter;\n      leaveList[i] = leave;\n    }\n\n    if (!hasVisitor) {\n      continue;\n    }\n\n    const mergedEnterLeave = {\n      enter(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _enterList$i;\n\n            const result =\n              (_enterList$i = enterList[i]) === null || _enterList$i === void 0\n                ? void 0\n                : _enterList$i.apply(visitors[i], args);\n\n            if (result === false) {\n              skipping[i] = node;\n            } else if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined) {\n              return result;\n            }\n          }\n        }\n      },\n\n      leave(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _leaveList$i;\n\n            const result =\n              (_leaveList$i = leaveList[i]) === null || _leaveList$i === void 0\n                ? void 0\n                : _leaveList$i.apply(visitors[i], args);\n\n            if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined && result !== false) {\n              return result;\n            }\n          } else if (skipping[i] === node) {\n            skipping[i] = null;\n          }\n        }\n      },\n    };\n    mergedVisitor[kind] = mergedEnterLeave;\n  }\n\n  return mergedVisitor;\n}\n/**\n * Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.\n */\n\nexport function getEnterLeaveForKind(visitor, kind) {\n  const kindVisitor = visitor[kind];\n\n  if (typeof kindVisitor === 'object') {\n    // { Kind: { enter() {}, leave() {} } }\n    return kindVisitor;\n  } else if (typeof kindVisitor === 'function') {\n    // { Kind() {} }\n    return {\n      enter: kindVisitor,\n      leave: undefined,\n    };\n  } // { enter() {}, leave() {} }\n\n  return {\n    enter: visitor.enter,\n    leave: visitor.leave,\n  };\n}\n/**\n * Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n *\n * @deprecated Please use `getEnterLeaveForKind` instead. Will be removed in v17\n */\n\n/* c8 ignore next 8 */\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n  const { enter, leave } = getEnterLeaveForKind(visitor, kind);\n  return isLeaving ? leave : enter;\n}\n"],"names":["QueryDocumentKeys","Kind","isNode","devAssert","inspect"],"mappings":";;;;;;AASY,MAAC,QAAQ,OAAO,OAAO,CAAE,CAAA;AAgF9B,SAAS,MAAM,MAAM,SAAS,cAAcA,IAAAA,mBAAmB;AACpE,QAAM,gBAAgB,oBAAI,IAAK;AAE/B,aAAW,QAAQ,OAAO,OAAOC,MAAI,IAAA,GAAG;AACtC,kBAAc,IAAI,MAAM,qBAAqB,SAAS,IAAI,CAAC;AAAA,EAC/D;AAGE,MAAI,QAAQ;AACZ,MAAI,UAAU,MAAM,QAAQ,IAAI;AAChC,MAAI,OAAO,CAAC,IAAI;AAChB,MAAI,QAAQ;AACZ,MAAI,QAAQ,CAAE;AACd,MAAI,OAAO;AACX,MAAI,MAAM;AACV,MAAI,SAAS;AACb,QAAM,OAAO,CAAE;AACf,QAAM,YAAY,CAAE;AAGpB,KAAG;AACD;AACA,UAAM,YAAY,UAAU,KAAK;AACjC,UAAM,WAAW,aAAa,MAAM,WAAW;AAE/C,QAAI,WAAW;AACb,YAAM,UAAU,WAAW,IAAI,SAAY,KAAK,KAAK,SAAS,CAAC;AAC/D,aAAO;AACP,eAAS,UAAU,IAAK;AAExB,UAAI,UAAU;AACZ,YAAI,SAAS;AACX,iBAAO,KAAK,MAAO;AACnB,cAAI,aAAa;AAEjB,qBAAW,CAAC,SAAS,SAAS,KAAK,OAAO;AACxC,kBAAM,WAAW,UAAU;AAE3B,gBAAI,cAAc,MAAM;AACtB,mBAAK,OAAO,UAAU,CAAC;AACvB;AAAA,YACd,OAAmB;AACL,mBAAK,QAAQ,IAAI;AAAA,YAC/B;AAAA,UACA;AAAA,QACA,OAAe;AACL,iBAAO,OAAO;AAAA,YACZ,CAAE;AAAA,YACF,OAAO,0BAA0B,IAAI;AAAA,UACtC;AAED,qBAAW,CAAC,SAAS,SAAS,KAAK,OAAO;AACxC,iBAAK,OAAO,IAAI;AAAA,UAC5B;AAAA,QACA;AAAA,MACA;AAEM,cAAQ,MAAM;AACd,aAAO,MAAM;AACb,cAAQ,MAAM;AACd,gBAAU,MAAM;AAChB,cAAQ,MAAM;AAAA,IACf,WAAU,QAAQ;AACjB,YAAM,UAAU,QAAQ,KAAK,KAAK;AAClC,aAAO,OAAO,GAAG;AAEjB,UAAI,SAAS,QAAQ,SAAS,QAAW;AACvC;AAAA,MACR;AAEM,WAAK,KAAK,GAAG;AAAA,IACnB;AAEI,QAAI;AAEJ,QAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,UAAI,oBAAoB;AAExBC,iBAAO,IAAI,KAAKC,UAAAA,UAAU,OAAO,qBAAqBC,gBAAQ,IAAI,CAAC,GAAG;AACtE,YAAM,UAAU,aACX,qBAAqB,cAAc,IAAI,KAAK,IAAI,OAAO,QACxD,uBAAuB,SACrB,SACA,mBAAmB,SACpB,sBAAsB,cAAc,IAAI,KAAK,IAAI,OAAO,QACzD,wBAAwB,SACxB,SACA,oBAAoB;AACxB,eACE,YAAY,QAAQ,YAAY,SAC5B,SACA,QAAQ,KAAK,SAAS,MAAM,KAAK,QAAQ,MAAM,SAAS;AAE9D,UAAI,WAAW,OAAO;AACpB;AAAA,MACR;AAEM,UAAI,WAAW,OAAO;AACpB,YAAI,CAAC,WAAW;AACd,eAAK,IAAK;AACV;AAAA,QACV;AAAA,MACA,WAAiB,WAAW,QAAW;AAC/B,cAAM,KAAK,CAAC,KAAK,MAAM,CAAC;AAExB,YAAI,CAAC,WAAW;AACd,cAAIF,IAAAA,OAAO,MAAM,GAAG;AAClB,mBAAO;AAAA,UACnB,OAAiB;AACL,iBAAK,IAAK;AACV;AAAA,UACZ;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAEI,QAAI,WAAW,UAAa,UAAU;AACpC,YAAM,KAAK,CAAC,KAAK,IAAI,CAAC;AAAA,IAC5B;AAEI,QAAI,WAAW;AACb,WAAK,IAAK;AAAA,IAChB,OAAW;AACL,UAAI;AAEJ,cAAQ;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,MAAM;AAAA,MACP;AACD,gBAAU,MAAM,QAAQ,IAAI;AAC5B,aAAO,UACH,QACC,aAAa,YAAY,KAAK,IAAI,OAAO,QAC1C,eAAe,SACf,aACA,CAAE;AACN,cAAQ;AACR,cAAQ,CAAE;AAEV,UAAI,QAAQ;AACV,kBAAU,KAAK,MAAM;AAAA,MAC7B;AAEM,eAAS;AAAA,IACf;AAAA,EACG,SAAQ,UAAU;AAEnB,MAAI,MAAM,WAAW,GAAG;AAEtB,WAAO,MAAM,MAAM,SAAS,CAAC,EAAE,CAAC;AAAA,EACpC;AAEE,SAAO;AACT;AAoFO,SAAS,qBAAqB,SAAS,MAAM;AAClD,QAAM,cAAc,QAAQ,IAAI;AAEhC,MAAI,OAAO,gBAAgB,UAAU;AAEnC,WAAO;AAAA,EACX,WAAa,OAAO,gBAAgB,YAAY;AAE5C,WAAO;AAAA,MACL,OAAO;AAAA,MACP,OAAO;AAAA,IACR;AAAA,EACF;AAED,SAAO;AAAA,IACL,OAAO,QAAQ;AAAA,IACf,OAAO,QAAQ;AAAA,EAChB;AACH;;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"visitor.cjs.js","sources":["../../../../../node_modules/graphql/language/visitor.mjs"],"sourcesContent":["import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { isNode, QueryDocumentKeys } from './ast.mjs';\nimport { Kind } from './kinds.mjs';\n/**\n * A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n */\n\nexport const BREAK = Object.freeze({});\n/**\n * visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n *\n * By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n *\n * When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n *\n * ```ts\n * const editedAST = visit(ast, {\n *   enter(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: skip visiting this node\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   },\n *   leave(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: no action\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   }\n * });\n * ```\n *\n * Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to three permutations of the\n * visitor API:\n *\n * 1) Named visitors triggered when entering a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind(node) {\n *     // enter the \"Kind\" node\n *   }\n * })\n * ```\n *\n * 2) Named visitors that trigger upon entering and leaving a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind: {\n *     enter(node) {\n *       // enter the \"Kind\" node\n *     }\n *     leave(node) {\n *       // leave the \"Kind\" node\n *     }\n *   }\n * })\n * ```\n *\n * 3) Generic visitors that trigger upon entering and leaving any node.\n *\n * ```ts\n * visit(ast, {\n *   enter(node) {\n *     // enter any node\n *   },\n *   leave(node) {\n *     // leave any node\n *   }\n * })\n * ```\n */\n\nexport function visit(root, visitor, visitorKeys = QueryDocumentKeys) {\n  const enterLeaveMap = new Map();\n\n  for (const kind of Object.values(Kind)) {\n    enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));\n  }\n  /* eslint-disable no-undef-init */\n\n  let stack = undefined;\n  let inArray = Array.isArray(root);\n  let keys = [root];\n  let index = -1;\n  let edits = [];\n  let node = root;\n  let key = undefined;\n  let parent = undefined;\n  const path = [];\n  const ancestors = [];\n  /* eslint-enable no-undef-init */\n\n  do {\n    index++;\n    const isLeaving = index === keys.length;\n    const isEdited = isLeaving && edits.length !== 0;\n\n    if (isLeaving) {\n      key = ancestors.length === 0 ? undefined : path[path.length - 1];\n      node = parent;\n      parent = ancestors.pop();\n\n      if (isEdited) {\n        if (inArray) {\n          node = node.slice();\n          let editOffset = 0;\n\n          for (const [editKey, editValue] of edits) {\n            const arrayKey = editKey - editOffset;\n\n            if (editValue === null) {\n              node.splice(arrayKey, 1);\n              editOffset++;\n            } else {\n              node[arrayKey] = editValue;\n            }\n          }\n        } else {\n          node = { ...node };\n\n          for (const [editKey, editValue] of edits) {\n            node[editKey] = editValue;\n          }\n        }\n      }\n\n      index = stack.index;\n      keys = stack.keys;\n      edits = stack.edits;\n      inArray = stack.inArray;\n      stack = stack.prev;\n    } else if (parent) {\n      key = inArray ? index : keys[index];\n      node = parent[key];\n\n      if (node === null || node === undefined) {\n        continue;\n      }\n\n      path.push(key);\n    }\n\n    let result;\n\n    if (!Array.isArray(node)) {\n      var _enterLeaveMap$get, _enterLeaveMap$get2;\n\n      isNode(node) || devAssert(false, `Invalid AST Node: ${inspect(node)}.`);\n      const visitFn = isLeaving\n        ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get === void 0\n          ? void 0\n          : _enterLeaveMap$get.leave\n        : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get2 === void 0\n        ? void 0\n        : _enterLeaveMap$get2.enter;\n      result =\n        visitFn === null || visitFn === void 0\n          ? void 0\n          : visitFn.call(visitor, node, key, parent, path, ancestors);\n\n      if (result === BREAK) {\n        break;\n      }\n\n      if (result === false) {\n        if (!isLeaving) {\n          path.pop();\n          continue;\n        }\n      } else if (result !== undefined) {\n        edits.push([key, result]);\n\n        if (!isLeaving) {\n          if (isNode(result)) {\n            node = result;\n          } else {\n            path.pop();\n            continue;\n          }\n        }\n      }\n    }\n\n    if (result === undefined && isEdited) {\n      edits.push([key, node]);\n    }\n\n    if (isLeaving) {\n      path.pop();\n    } else {\n      var _node$kind;\n\n      stack = {\n        inArray,\n        index,\n        keys,\n        edits,\n        prev: stack,\n      };\n      inArray = Array.isArray(node);\n      keys = inArray\n        ? node\n        : (_node$kind = visitorKeys[node.kind]) !== null &&\n          _node$kind !== void 0\n        ? _node$kind\n        : [];\n      index = -1;\n      edits = [];\n\n      if (parent) {\n        ancestors.push(parent);\n      }\n\n      parent = node;\n    }\n  } while (stack !== undefined);\n\n  if (edits.length !== 0) {\n    // New root\n    return edits[edits.length - 1][1];\n  }\n\n  return root;\n}\n/**\n * Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n *\n * If a prior visitor edits a node, no following visitors will see that node.\n */\n\nexport function visitInParallel(visitors) {\n  const skipping = new Array(visitors.length).fill(null);\n  const mergedVisitor = Object.create(null);\n\n  for (const kind of Object.values(Kind)) {\n    let hasVisitor = false;\n    const enterList = new Array(visitors.length).fill(undefined);\n    const leaveList = new Array(visitors.length).fill(undefined);\n\n    for (let i = 0; i < visitors.length; ++i) {\n      const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);\n      hasVisitor || (hasVisitor = enter != null || leave != null);\n      enterList[i] = enter;\n      leaveList[i] = leave;\n    }\n\n    if (!hasVisitor) {\n      continue;\n    }\n\n    const mergedEnterLeave = {\n      enter(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _enterList$i;\n\n            const result =\n              (_enterList$i = enterList[i]) === null || _enterList$i === void 0\n                ? void 0\n                : _enterList$i.apply(visitors[i], args);\n\n            if (result === false) {\n              skipping[i] = node;\n            } else if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined) {\n              return result;\n            }\n          }\n        }\n      },\n\n      leave(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _leaveList$i;\n\n            const result =\n              (_leaveList$i = leaveList[i]) === null || _leaveList$i === void 0\n                ? void 0\n                : _leaveList$i.apply(visitors[i], args);\n\n            if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined && result !== false) {\n              return result;\n            }\n          } else if (skipping[i] === node) {\n            skipping[i] = null;\n          }\n        }\n      },\n    };\n    mergedVisitor[kind] = mergedEnterLeave;\n  }\n\n  return mergedVisitor;\n}\n/**\n * Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.\n */\n\nexport function getEnterLeaveForKind(visitor, kind) {\n  const kindVisitor = visitor[kind];\n\n  if (typeof kindVisitor === 'object') {\n    // { Kind: { enter() {}, leave() {} } }\n    return kindVisitor;\n  } else if (typeof kindVisitor === 'function') {\n    // { Kind() {} }\n    return {\n      enter: kindVisitor,\n      leave: undefined,\n    };\n  } // { enter() {}, leave() {} }\n\n  return {\n    enter: visitor.enter,\n    leave: visitor.leave,\n  };\n}\n/**\n * Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n *\n * @deprecated Please use `getEnterLeaveForKind` instead. Will be removed in v17\n */\n\n/* c8 ignore next 8 */\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n  const { enter, leave } = getEnterLeaveForKind(visitor, kind);\n  return isLeaving ? leave : enter;\n}\n"],"names":["QueryDocumentKeys","Kind","isNode","devAssert","inspect"],"mappings":";;;;;;AASY,MAAC,QAAQ,OAAO,OAAO,CAAE,CAAA;AAgF9B,SAAS,MAAM,MAAM,SAAS,cAAcA,IAAAA,mBAAmB;AACpE,QAAM,gBAAgB,oBAAI,IAAK;AAE/B,aAAW,QAAQ,OAAO,OAAOC,MAAI,IAAA,GAAG;AACtC,kBAAc,IAAI,MAAM,qBAAqB,SAAS,IAAI,CAAC;AAAA,EAC/D;AAGE,MAAI,QAAQ;AACZ,MAAI,UAAU,MAAM,QAAQ,IAAI;AAChC,MAAI,OAAO,CAAC,IAAI;AAChB,MAAI,QAAQ;AACZ,MAAI,QAAQ,CAAE;AACd,MAAI,OAAO;AACX,MAAI,MAAM;AACV,MAAI,SAAS;AACb,QAAM,OAAO,CAAE;AACf,QAAM,YAAY,CAAE;AAGpB,KAAG;AACD;AACA,UAAM,YAAY,UAAU,KAAK;AACjC,UAAM,WAAW,aAAa,MAAM,WAAW;AAE/C,QAAI,WAAW;AACb,YAAM,UAAU,WAAW,IAAI,SAAY,KAAK,KAAK,SAAS,CAAC;AAC/D,aAAO;AACP,eAAS,UAAU,IAAK;AAExB,UAAI,UAAU;AACZ,YAAI,SAAS;AACX,iBAAO,KAAK,MAAO;AACnB,cAAI,aAAa;AAEjB,qBAAW,CAAC,SAAS,SAAS,KAAK,OAAO;AACxC,kBAAM,WAAW,UAAU;AAE3B,gBAAI,cAAc,MAAM;AACtB,mBAAK,OAAO,UAAU,CAAC;AACvB;AAAA,YACd,OAAmB;AACL,mBAAK,QAAQ,IAAI;AAAA,YAC/B;AAAA,UACA;AAAA,QACA,OAAe;AACL,iBAAO,EAAE,GAAG,KAAM;AAElB,qBAAW,CAAC,SAAS,SAAS,KAAK,OAAO;AACxC,iBAAK,OAAO,IAAI;AAAA,UAC5B;AAAA,QACA;AAAA,MACA;AAEM,cAAQ,MAAM;AACd,aAAO,MAAM;AACb,cAAQ,MAAM;AACd,gBAAU,MAAM;AAChB,cAAQ,MAAM;AAAA,IACf,WAAU,QAAQ;AACjB,YAAM,UAAU,QAAQ,KAAK,KAAK;AAClC,aAAO,OAAO,GAAG;AAEjB,UAAI,SAAS,QAAQ,SAAS,QAAW;AACvC;AAAA,MACR;AAEM,WAAK,KAAK,GAAG;AAAA,IACnB;AAEI,QAAI;AAEJ,QAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,UAAI,oBAAoB;AAExBC,iBAAO,IAAI,KAAKC,UAAAA,UAAU,OAAO,qBAAqBC,gBAAQ,IAAI,CAAC,GAAG;AACtE,YAAM,UAAU,aACX,qBAAqB,cAAc,IAAI,KAAK,IAAI,OAAO,QACxD,uBAAuB,SACrB,SACA,mBAAmB,SACpB,sBAAsB,cAAc,IAAI,KAAK,IAAI,OAAO,QACzD,wBAAwB,SACxB,SACA,oBAAoB;AACxB,eACE,YAAY,QAAQ,YAAY,SAC5B,SACA,QAAQ,KAAK,SAAS,MAAM,KAAK,QAAQ,MAAM,SAAS;AAE9D,UAAI,WAAW,OAAO;AACpB;AAAA,MACR;AAEM,UAAI,WAAW,OAAO;AACpB,YAAI,CAAC,WAAW;AACd,eAAK,IAAK;AACV;AAAA,QACV;AAAA,MACA,WAAiB,WAAW,QAAW;AAC/B,cAAM,KAAK,CAAC,KAAK,MAAM,CAAC;AAExB,YAAI,CAAC,WAAW;AACd,cAAIF,IAAAA,OAAO,MAAM,GAAG;AAClB,mBAAO;AAAA,UACnB,OAAiB;AACL,iBAAK,IAAK;AACV;AAAA,UACZ;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAEI,QAAI,WAAW,UAAa,UAAU;AACpC,YAAM,KAAK,CAAC,KAAK,IAAI,CAAC;AAAA,IAC5B;AAEI,QAAI,WAAW;AACb,WAAK,IAAK;AAAA,IAChB,OAAW;AACL,UAAI;AAEJ,cAAQ;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,MAAM;AAAA,MACP;AACD,gBAAU,MAAM,QAAQ,IAAI;AAC5B,aAAO,UACH,QACC,aAAa,YAAY,KAAK,IAAI,OAAO,QAC1C,eAAe,SACf,aACA,CAAE;AACN,cAAQ;AACR,cAAQ,CAAE;AAEV,UAAI,QAAQ;AACV,kBAAU,KAAK,MAAM;AAAA,MAC7B;AAEM,eAAS;AAAA,IACf;AAAA,EACG,SAAQ,UAAU;AAEnB,MAAI,MAAM,WAAW,GAAG;AAEtB,WAAO,MAAM,MAAM,SAAS,CAAC,EAAE,CAAC;AAAA,EACpC;AAEE,SAAO;AACT;AAoFO,SAAS,qBAAqB,SAAS,MAAM;AAClD,QAAM,cAAc,QAAQ,IAAI;AAEhC,MAAI,OAAO,gBAAgB,UAAU;AAEnC,WAAO;AAAA,EACX,WAAa,OAAO,gBAAgB,YAAY;AAE5C,WAAO;AAAA,MACL,OAAO;AAAA,MACP,OAAO;AAAA,IACR;AAAA,EACF;AAED,SAAO;AAAA,IACL,OAAO,QAAQ;AAAA,IACf,OAAO,QAAQ;AAAA,EAChB;AACH;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/graphql/language/visitor.es.js

@@ -40,10 +40,7 @@ function visit(root, visitor, visitorKeys = QueryDocumentKeys) {
             }
           }
         } else {
-          node = Object.defineProperties(
-            {},
-            Object.getOwnPropertyDescriptors(node)
-          );
+          node = { ...node };
           for (const [editKey, editValue] of edits) {
             node[editKey] = editValue;
           }

package/dist/node_modules/graphql/language/visitor.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"visitor.es.js","sources":["../../../../../node_modules/graphql/language/visitor.mjs"],"sourcesContent":["import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { isNode, QueryDocumentKeys } from './ast.mjs';\nimport { Kind } from './kinds.mjs';\n/**\n * A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n */\n\nexport const BREAK = Object.freeze({});\n/**\n * visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n *\n * By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n *\n * When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n *\n * ```ts\n * const editedAST = visit(ast, {\n *   enter(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: skip visiting this node\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   },\n *   leave(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: no action\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   }\n * });\n * ```\n *\n * Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to three permutations of the\n * visitor API:\n *\n * 1) Named visitors triggered when entering a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind(node) {\n *     // enter the \"Kind\" node\n *   }\n * })\n * ```\n *\n * 2) Named visitors that trigger upon entering and leaving a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind: {\n *     enter(node) {\n *       // enter the \"Kind\" node\n *     }\n *     leave(node) {\n *       // leave the \"Kind\" node\n *     }\n *   }\n * })\n * ```\n *\n * 3) Generic visitors that trigger upon entering and leaving any node.\n *\n * ```ts\n * visit(ast, {\n *   enter(node) {\n *     // enter any node\n *   },\n *   leave(node) {\n *     // leave any node\n *   }\n * })\n * ```\n */\n\nexport function visit(root, visitor, visitorKeys = QueryDocumentKeys) {\n  const enterLeaveMap = new Map();\n\n  for (const kind of Object.values(Kind)) {\n    enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));\n  }\n  /* eslint-disable no-undef-init */\n\n  let stack = undefined;\n  let inArray = Array.isArray(root);\n  let keys = [root];\n  let index = -1;\n  let edits = [];\n  let node = root;\n  let key = undefined;\n  let parent = undefined;\n  const path = [];\n  const ancestors = [];\n  /* eslint-enable no-undef-init */\n\n  do {\n    index++;\n    const isLeaving = index === keys.length;\n    const isEdited = isLeaving && edits.length !== 0;\n\n    if (isLeaving) {\n      key = ancestors.length === 0 ? undefined : path[path.length - 1];\n      node = parent;\n      parent = ancestors.pop();\n\n      if (isEdited) {\n        if (inArray) {\n          node = node.slice();\n          let editOffset = 0;\n\n          for (const [editKey, editValue] of edits) {\n            const arrayKey = editKey - editOffset;\n\n            if (editValue === null) {\n              node.splice(arrayKey, 1);\n              editOffset++;\n            } else {\n              node[arrayKey] = editValue;\n            }\n          }\n        } else {\n          node = Object.defineProperties(\n            {},\n            Object.getOwnPropertyDescriptors(node),\n          );\n\n          for (const [editKey, editValue] of edits) {\n            node[editKey] = editValue;\n          }\n        }\n      }\n\n      index = stack.index;\n      keys = stack.keys;\n      edits = stack.edits;\n      inArray = stack.inArray;\n      stack = stack.prev;\n    } else if (parent) {\n      key = inArray ? index : keys[index];\n      node = parent[key];\n\n      if (node === null || node === undefined) {\n        continue;\n      }\n\n      path.push(key);\n    }\n\n    let result;\n\n    if (!Array.isArray(node)) {\n      var _enterLeaveMap$get, _enterLeaveMap$get2;\n\n      isNode(node) || devAssert(false, `Invalid AST Node: ${inspect(node)}.`);\n      const visitFn = isLeaving\n        ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get === void 0\n          ? void 0\n          : _enterLeaveMap$get.leave\n        : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get2 === void 0\n        ? void 0\n        : _enterLeaveMap$get2.enter;\n      result =\n        visitFn === null || visitFn === void 0\n          ? void 0\n          : visitFn.call(visitor, node, key, parent, path, ancestors);\n\n      if (result === BREAK) {\n        break;\n      }\n\n      if (result === false) {\n        if (!isLeaving) {\n          path.pop();\n          continue;\n        }\n      } else if (result !== undefined) {\n        edits.push([key, result]);\n\n        if (!isLeaving) {\n          if (isNode(result)) {\n            node = result;\n          } else {\n            path.pop();\n            continue;\n          }\n        }\n      }\n    }\n\n    if (result === undefined && isEdited) {\n      edits.push([key, node]);\n    }\n\n    if (isLeaving) {\n      path.pop();\n    } else {\n      var _node$kind;\n\n      stack = {\n        inArray,\n        index,\n        keys,\n        edits,\n        prev: stack,\n      };\n      inArray = Array.isArray(node);\n      keys = inArray\n        ? node\n        : (_node$kind = visitorKeys[node.kind]) !== null &&\n          _node$kind !== void 0\n        ? _node$kind\n        : [];\n      index = -1;\n      edits = [];\n\n      if (parent) {\n        ancestors.push(parent);\n      }\n\n      parent = node;\n    }\n  } while (stack !== undefined);\n\n  if (edits.length !== 0) {\n    // New root\n    return edits[edits.length - 1][1];\n  }\n\n  return root;\n}\n/**\n * Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n *\n * If a prior visitor edits a node, no following visitors will see that node.\n */\n\nexport function visitInParallel(visitors) {\n  const skipping = new Array(visitors.length).fill(null);\n  const mergedVisitor = Object.create(null);\n\n  for (const kind of Object.values(Kind)) {\n    let hasVisitor = false;\n    const enterList = new Array(visitors.length).fill(undefined);\n    const leaveList = new Array(visitors.length).fill(undefined);\n\n    for (let i = 0; i < visitors.length; ++i) {\n      const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);\n      hasVisitor || (hasVisitor = enter != null || leave != null);\n      enterList[i] = enter;\n      leaveList[i] = leave;\n    }\n\n    if (!hasVisitor) {\n      continue;\n    }\n\n    const mergedEnterLeave = {\n      enter(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _enterList$i;\n\n            const result =\n              (_enterList$i = enterList[i]) === null || _enterList$i === void 0\n                ? void 0\n                : _enterList$i.apply(visitors[i], args);\n\n            if (result === false) {\n              skipping[i] = node;\n            } else if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined) {\n              return result;\n            }\n          }\n        }\n      },\n\n      leave(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _leaveList$i;\n\n            const result =\n              (_leaveList$i = leaveList[i]) === null || _leaveList$i === void 0\n                ? void 0\n                : _leaveList$i.apply(visitors[i], args);\n\n            if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined && result !== false) {\n              return result;\n            }\n          } else if (skipping[i] === node) {\n            skipping[i] = null;\n          }\n        }\n      },\n    };\n    mergedVisitor[kind] = mergedEnterLeave;\n  }\n\n  return mergedVisitor;\n}\n/**\n * Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.\n */\n\nexport function getEnterLeaveForKind(visitor, kind) {\n  const kindVisitor = visitor[kind];\n\n  if (typeof kindVisitor === 'object') {\n    // { Kind: { enter() {}, leave() {} } }\n    return kindVisitor;\n  } else if (typeof kindVisitor === 'function') {\n    // { Kind() {} }\n    return {\n      enter: kindVisitor,\n      leave: undefined,\n    };\n  } // { enter() {}, leave() {} }\n\n  return {\n    enter: visitor.enter,\n    leave: visitor.leave,\n  };\n}\n/**\n * Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n *\n * @deprecated Please use `getEnterLeaveForKind` instead. Will be removed in v17\n */\n\n/* c8 ignore next 8 */\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n  const { enter, leave } = getEnterLeaveForKind(visitor, kind);\n  return isLeaving ? leave : enter;\n}\n"],"names":[],"mappings":";;;;AASY,MAAC,QAAQ,OAAO,OAAO,CAAE,CAAA;AAgF9B,SAAS,MAAM,MAAM,SAAS,cAAc,mBAAmB;AACpE,QAAM,gBAAgB,oBAAI,IAAK;AAE/B,aAAW,QAAQ,OAAO,OAAO,IAAI,GAAG;AACtC,kBAAc,IAAI,MAAM,qBAAqB,SAAS,IAAI,CAAC;AAAA,EAC/D;AAGE,MAAI,QAAQ;AACZ,MAAI,UAAU,MAAM,QAAQ,IAAI;AAChC,MAAI,OAAO,CAAC,IAAI;AAChB,MAAI,QAAQ;AACZ,MAAI,QAAQ,CAAE;AACd,MAAI,OAAO;AACX,MAAI,MAAM;AACV,MAAI,SAAS;AACb,QAAM,OAAO,CAAE;AACf,QAAM,YAAY,CAAE;AAGpB,KAAG;AACD;AACA,UAAM,YAAY,UAAU,KAAK;AACjC,UAAM,WAAW,aAAa,MAAM,WAAW;AAE/C,QAAI,WAAW;AACb,YAAM,UAAU,WAAW,IAAI,SAAY,KAAK,KAAK,SAAS,CAAC;AAC/D,aAAO;AACP,eAAS,UAAU,IAAK;AAExB,UAAI,UAAU;AACZ,YAAI,SAAS;AACX,iBAAO,KAAK,MAAO;AACnB,cAAI,aAAa;AAEjB,qBAAW,CAAC,SAAS,SAAS,KAAK,OAAO;AACxC,kBAAM,WAAW,UAAU;AAE3B,gBAAI,cAAc,MAAM;AACtB,mBAAK,OAAO,UAAU,CAAC;AACvB;AAAA,YACd,OAAmB;AACL,mBAAK,QAAQ,IAAI;AAAA,YAC/B;AAAA,UACA;AAAA,QACA,OAAe;AACL,iBAAO,OAAO;AAAA,YACZ,CAAE;AAAA,YACF,OAAO,0BAA0B,IAAI;AAAA,UACtC;AAED,qBAAW,CAAC,SAAS,SAAS,KAAK,OAAO;AACxC,iBAAK,OAAO,IAAI;AAAA,UAC5B;AAAA,QACA;AAAA,MACA;AAEM,cAAQ,MAAM;AACd,aAAO,MAAM;AACb,cAAQ,MAAM;AACd,gBAAU,MAAM;AAChB,cAAQ,MAAM;AAAA,IACf,WAAU,QAAQ;AACjB,YAAM,UAAU,QAAQ,KAAK,KAAK;AAClC,aAAO,OAAO,GAAG;AAEjB,UAAI,SAAS,QAAQ,SAAS,QAAW;AACvC;AAAA,MACR;AAEM,WAAK,KAAK,GAAG;AAAA,IACnB;AAEI,QAAI;AAEJ,QAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,UAAI,oBAAoB;AAExB,aAAO,IAAI,KAAK,UAAU,OAAO,qBAAqB,QAAQ,IAAI,CAAC,GAAG;AACtE,YAAM,UAAU,aACX,qBAAqB,cAAc,IAAI,KAAK,IAAI,OAAO,QACxD,uBAAuB,SACrB,SACA,mBAAmB,SACpB,sBAAsB,cAAc,IAAI,KAAK,IAAI,OAAO,QACzD,wBAAwB,SACxB,SACA,oBAAoB;AACxB,eACE,YAAY,QAAQ,YAAY,SAC5B,SACA,QAAQ,KAAK,SAAS,MAAM,KAAK,QAAQ,MAAM,SAAS;AAE9D,UAAI,WAAW,OAAO;AACpB;AAAA,MACR;AAEM,UAAI,WAAW,OAAO;AACpB,YAAI,CAAC,WAAW;AACd,eAAK,IAAK;AACV;AAAA,QACV;AAAA,MACA,WAAiB,WAAW,QAAW;AAC/B,cAAM,KAAK,CAAC,KAAK,MAAM,CAAC;AAExB,YAAI,CAAC,WAAW;AACd,cAAI,OAAO,MAAM,GAAG;AAClB,mBAAO;AAAA,UACnB,OAAiB;AACL,iBAAK,IAAK;AACV;AAAA,UACZ;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAEI,QAAI,WAAW,UAAa,UAAU;AACpC,YAAM,KAAK,CAAC,KAAK,IAAI,CAAC;AAAA,IAC5B;AAEI,QAAI,WAAW;AACb,WAAK,IAAK;AAAA,IAChB,OAAW;AACL,UAAI;AAEJ,cAAQ;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,MAAM;AAAA,MACP;AACD,gBAAU,MAAM,QAAQ,IAAI;AAC5B,aAAO,UACH,QACC,aAAa,YAAY,KAAK,IAAI,OAAO,QAC1C,eAAe,SACf,aACA,CAAE;AACN,cAAQ;AACR,cAAQ,CAAE;AAEV,UAAI,QAAQ;AACV,kBAAU,KAAK,MAAM;AAAA,MAC7B;AAEM,eAAS;AAAA,IACf;AAAA,EACG,SAAQ,UAAU;AAEnB,MAAI,MAAM,WAAW,GAAG;AAEtB,WAAO,MAAM,MAAM,SAAS,CAAC,EAAE,CAAC;AAAA,EACpC;AAEE,SAAO;AACT;AAoFO,SAAS,qBAAqB,SAAS,MAAM;AAClD,QAAM,cAAc,QAAQ,IAAI;AAEhC,MAAI,OAAO,gBAAgB,UAAU;AAEnC,WAAO;AAAA,EACX,WAAa,OAAO,gBAAgB,YAAY;AAE5C,WAAO;AAAA,MACL,OAAO;AAAA,MACP,OAAO;AAAA,IACR;AAAA,EACF;AAED,SAAO;AAAA,IACL,OAAO,QAAQ;AAAA,IACf,OAAO,QAAQ;AAAA,EAChB;AACH;","x_google_ignoreList":[0]}
+{"version":3,"file":"visitor.es.js","sources":["../../../../../node_modules/graphql/language/visitor.mjs"],"sourcesContent":["import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { isNode, QueryDocumentKeys } from './ast.mjs';\nimport { Kind } from './kinds.mjs';\n/**\n * A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n */\n\nexport const BREAK = Object.freeze({});\n/**\n * visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n *\n * By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n *\n * When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n *\n * ```ts\n * const editedAST = visit(ast, {\n *   enter(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: skip visiting this node\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   },\n *   leave(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: no action\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   }\n * });\n * ```\n *\n * Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to three permutations of the\n * visitor API:\n *\n * 1) Named visitors triggered when entering a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind(node) {\n *     // enter the \"Kind\" node\n *   }\n * })\n * ```\n *\n * 2) Named visitors that trigger upon entering and leaving a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind: {\n *     enter(node) {\n *       // enter the \"Kind\" node\n *     }\n *     leave(node) {\n *       // leave the \"Kind\" node\n *     }\n *   }\n * })\n * ```\n *\n * 3) Generic visitors that trigger upon entering and leaving any node.\n *\n * ```ts\n * visit(ast, {\n *   enter(node) {\n *     // enter any node\n *   },\n *   leave(node) {\n *     // leave any node\n *   }\n * })\n * ```\n */\n\nexport function visit(root, visitor, visitorKeys = QueryDocumentKeys) {\n  const enterLeaveMap = new Map();\n\n  for (const kind of Object.values(Kind)) {\n    enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));\n  }\n  /* eslint-disable no-undef-init */\n\n  let stack = undefined;\n  let inArray = Array.isArray(root);\n  let keys = [root];\n  let index = -1;\n  let edits = [];\n  let node = root;\n  let key = undefined;\n  let parent = undefined;\n  const path = [];\n  const ancestors = [];\n  /* eslint-enable no-undef-init */\n\n  do {\n    index++;\n    const isLeaving = index === keys.length;\n    const isEdited = isLeaving && edits.length !== 0;\n\n    if (isLeaving) {\n      key = ancestors.length === 0 ? undefined : path[path.length - 1];\n      node = parent;\n      parent = ancestors.pop();\n\n      if (isEdited) {\n        if (inArray) {\n          node = node.slice();\n          let editOffset = 0;\n\n          for (const [editKey, editValue] of edits) {\n            const arrayKey = editKey - editOffset;\n\n            if (editValue === null) {\n              node.splice(arrayKey, 1);\n              editOffset++;\n            } else {\n              node[arrayKey] = editValue;\n            }\n          }\n        } else {\n          node = { ...node };\n\n          for (const [editKey, editValue] of edits) {\n            node[editKey] = editValue;\n          }\n        }\n      }\n\n      index = stack.index;\n      keys = stack.keys;\n      edits = stack.edits;\n      inArray = stack.inArray;\n      stack = stack.prev;\n    } else if (parent) {\n      key = inArray ? index : keys[index];\n      node = parent[key];\n\n      if (node === null || node === undefined) {\n        continue;\n      }\n\n      path.push(key);\n    }\n\n    let result;\n\n    if (!Array.isArray(node)) {\n      var _enterLeaveMap$get, _enterLeaveMap$get2;\n\n      isNode(node) || devAssert(false, `Invalid AST Node: ${inspect(node)}.`);\n      const visitFn = isLeaving\n        ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get === void 0\n          ? void 0\n          : _enterLeaveMap$get.leave\n        : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get2 === void 0\n        ? void 0\n        : _enterLeaveMap$get2.enter;\n      result =\n        visitFn === null || visitFn === void 0\n          ? void 0\n          : visitFn.call(visitor, node, key, parent, path, ancestors);\n\n      if (result === BREAK) {\n        break;\n      }\n\n      if (result === false) {\n        if (!isLeaving) {\n          path.pop();\n          continue;\n        }\n      } else if (result !== undefined) {\n        edits.push([key, result]);\n\n        if (!isLeaving) {\n          if (isNode(result)) {\n            node = result;\n          } else {\n            path.pop();\n            continue;\n          }\n        }\n      }\n    }\n\n    if (result === undefined && isEdited) {\n      edits.push([key, node]);\n    }\n\n    if (isLeaving) {\n      path.pop();\n    } else {\n      var _node$kind;\n\n      stack = {\n        inArray,\n        index,\n        keys,\n        edits,\n        prev: stack,\n      };\n      inArray = Array.isArray(node);\n      keys = inArray\n        ? node\n        : (_node$kind = visitorKeys[node.kind]) !== null &&\n          _node$kind !== void 0\n        ? _node$kind\n        : [];\n      index = -1;\n      edits = [];\n\n      if (parent) {\n        ancestors.push(parent);\n      }\n\n      parent = node;\n    }\n  } while (stack !== undefined);\n\n  if (edits.length !== 0) {\n    // New root\n    return edits[edits.length - 1][1];\n  }\n\n  return root;\n}\n/**\n * Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n *\n * If a prior visitor edits a node, no following visitors will see that node.\n */\n\nexport function visitInParallel(visitors) {\n  const skipping = new Array(visitors.length).fill(null);\n  const mergedVisitor = Object.create(null);\n\n  for (const kind of Object.values(Kind)) {\n    let hasVisitor = false;\n    const enterList = new Array(visitors.length).fill(undefined);\n    const leaveList = new Array(visitors.length).fill(undefined);\n\n    for (let i = 0; i < visitors.length; ++i) {\n      const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);\n      hasVisitor || (hasVisitor = enter != null || leave != null);\n      enterList[i] = enter;\n      leaveList[i] = leave;\n    }\n\n    if (!hasVisitor) {\n      continue;\n    }\n\n    const mergedEnterLeave = {\n      enter(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _enterList$i;\n\n            const result =\n              (_enterList$i = enterList[i]) === null || _enterList$i === void 0\n                ? void 0\n                : _enterList$i.apply(visitors[i], args);\n\n            if (result === false) {\n              skipping[i] = node;\n            } else if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined) {\n              return result;\n            }\n          }\n        }\n      },\n\n      leave(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _leaveList$i;\n\n            const result =\n              (_leaveList$i = leaveList[i]) === null || _leaveList$i === void 0\n                ? void 0\n                : _leaveList$i.apply(visitors[i], args);\n\n            if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined && result !== false) {\n              return result;\n            }\n          } else if (skipping[i] === node) {\n            skipping[i] = null;\n          }\n        }\n      },\n    };\n    mergedVisitor[kind] = mergedEnterLeave;\n  }\n\n  return mergedVisitor;\n}\n/**\n * Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.\n */\n\nexport function getEnterLeaveForKind(visitor, kind) {\n  const kindVisitor = visitor[kind];\n\n  if (typeof kindVisitor === 'object') {\n    // { Kind: { enter() {}, leave() {} } }\n    return kindVisitor;\n  } else if (typeof kindVisitor === 'function') {\n    // { Kind() {} }\n    return {\n      enter: kindVisitor,\n      leave: undefined,\n    };\n  } // { enter() {}, leave() {} }\n\n  return {\n    enter: visitor.enter,\n    leave: visitor.leave,\n  };\n}\n/**\n * Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n *\n * @deprecated Please use `getEnterLeaveForKind` instead. Will be removed in v17\n */\n\n/* c8 ignore next 8 */\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n  const { enter, leave } = getEnterLeaveForKind(visitor, kind);\n  return isLeaving ? leave : enter;\n}\n"],"names":[],"mappings":";;;;AASY,MAAC,QAAQ,OAAO,OAAO,CAAE,CAAA;AAgF9B,SAAS,MAAM,MAAM,SAAS,cAAc,mBAAmB;AACpE,QAAM,gBAAgB,oBAAI,IAAK;AAE/B,aAAW,QAAQ,OAAO,OAAO,IAAI,GAAG;AACtC,kBAAc,IAAI,MAAM,qBAAqB,SAAS,IAAI,CAAC;AAAA,EAC/D;AAGE,MAAI,QAAQ;AACZ,MAAI,UAAU,MAAM,QAAQ,IAAI;AAChC,MAAI,OAAO,CAAC,IAAI;AAChB,MAAI,QAAQ;AACZ,MAAI,QAAQ,CAAE;AACd,MAAI,OAAO;AACX,MAAI,MAAM;AACV,MAAI,SAAS;AACb,QAAM,OAAO,CAAE;AACf,QAAM,YAAY,CAAE;AAGpB,KAAG;AACD;AACA,UAAM,YAAY,UAAU,KAAK;AACjC,UAAM,WAAW,aAAa,MAAM,WAAW;AAE/C,QAAI,WAAW;AACb,YAAM,UAAU,WAAW,IAAI,SAAY,KAAK,KAAK,SAAS,CAAC;AAC/D,aAAO;AACP,eAAS,UAAU,IAAK;AAExB,UAAI,UAAU;AACZ,YAAI,SAAS;AACX,iBAAO,KAAK,MAAO;AACnB,cAAI,aAAa;AAEjB,qBAAW,CAAC,SAAS,SAAS,KAAK,OAAO;AACxC,kBAAM,WAAW,UAAU;AAE3B,gBAAI,cAAc,MAAM;AACtB,mBAAK,OAAO,UAAU,CAAC;AACvB;AAAA,YACd,OAAmB;AACL,mBAAK,QAAQ,IAAI;AAAA,YAC/B;AAAA,UACA;AAAA,QACA,OAAe;AACL,iBAAO,EAAE,GAAG,KAAM;AAElB,qBAAW,CAAC,SAAS,SAAS,KAAK,OAAO;AACxC,iBAAK,OAAO,IAAI;AAAA,UAC5B;AAAA,QACA;AAAA,MACA;AAEM,cAAQ,MAAM;AACd,aAAO,MAAM;AACb,cAAQ,MAAM;AACd,gBAAU,MAAM;AAChB,cAAQ,MAAM;AAAA,IACf,WAAU,QAAQ;AACjB,YAAM,UAAU,QAAQ,KAAK,KAAK;AAClC,aAAO,OAAO,GAAG;AAEjB,UAAI,SAAS,QAAQ,SAAS,QAAW;AACvC;AAAA,MACR;AAEM,WAAK,KAAK,GAAG;AAAA,IACnB;AAEI,QAAI;AAEJ,QAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,UAAI,oBAAoB;AAExB,aAAO,IAAI,KAAK,UAAU,OAAO,qBAAqB,QAAQ,IAAI,CAAC,GAAG;AACtE,YAAM,UAAU,aACX,qBAAqB,cAAc,IAAI,KAAK,IAAI,OAAO,QACxD,uBAAuB,SACrB,SACA,mBAAmB,SACpB,sBAAsB,cAAc,IAAI,KAAK,IAAI,OAAO,QACzD,wBAAwB,SACxB,SACA,oBAAoB;AACxB,eACE,YAAY,QAAQ,YAAY,SAC5B,SACA,QAAQ,KAAK,SAAS,MAAM,KAAK,QAAQ,MAAM,SAAS;AAE9D,UAAI,WAAW,OAAO;AACpB;AAAA,MACR;AAEM,UAAI,WAAW,OAAO;AACpB,YAAI,CAAC,WAAW;AACd,eAAK,IAAK;AACV;AAAA,QACV;AAAA,MACA,WAAiB,WAAW,QAAW;AAC/B,cAAM,KAAK,CAAC,KAAK,MAAM,CAAC;AAExB,YAAI,CAAC,WAAW;AACd,cAAI,OAAO,MAAM,GAAG;AAClB,mBAAO;AAAA,UACnB,OAAiB;AACL,iBAAK,IAAK;AACV;AAAA,UACZ;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAEI,QAAI,WAAW,UAAa,UAAU;AACpC,YAAM,KAAK,CAAC,KAAK,IAAI,CAAC;AAAA,IAC5B;AAEI,QAAI,WAAW;AACb,WAAK,IAAK;AAAA,IAChB,OAAW;AACL,UAAI;AAEJ,cAAQ;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,MAAM;AAAA,MACP;AACD,gBAAU,MAAM,QAAQ,IAAI;AAC5B,aAAO,UACH,QACC,aAAa,YAAY,KAAK,IAAI,OAAO,QAC1C,eAAe,SACf,aACA,CAAE;AACN,cAAQ;AACR,cAAQ,CAAE;AAEV,UAAI,QAAQ;AACV,kBAAU,KAAK,MAAM;AAAA,MAC7B;AAEM,eAAS;AAAA,IACf;AAAA,EACG,SAAQ,UAAU;AAEnB,MAAI,MAAM,WAAW,GAAG;AAEtB,WAAO,MAAM,MAAM,SAAS,CAAC,EAAE,CAAC;AAAA,EACpC;AAEE,SAAO;AACT;AAoFO,SAAS,qBAAqB,SAAS,MAAM;AAClD,QAAM,cAAc,QAAQ,IAAI;AAEhC,MAAI,OAAO,gBAAgB,UAAU;AAEnC,WAAO;AAAA,EACX,WAAa,OAAO,gBAAgB,YAAY;AAE5C,WAAO;AAAA,MACL,OAAO;AAAA,MACP,OAAO;AAAA,IACR;AAAA,EACF;AAED,SAAO;AAAA,IACL,OAAO,QAAQ;AAAA,IACf,OAAO,QAAQ;AAAA,EAChB;AACH;","x_google_ignoreList":[0]}

package/dist/node_modules/match-sorter/dist/match-sorter.esm.cjs.js

@@ -149,7 +149,6 @@ function getAcronym(string) {
 }
 function getClosenessRanking(testString, stringToRank) {
   let matchingInOrderCharCount = 0;
-  let charNumber = 0;
   function findMatchingCharacter(matchChar, string, index2) {
     for (let j = index2, J = string.length; j < J; j++) {
       const stringChar = string[j];
@@ -160,23 +159,30 @@ function getClosenessRanking(testString, stringToRank) {
     }
     return -1;
   }
+  let skipped = 0;
   function getRanking(spread2) {
     const spreadPercentage = 1 / spread2;
     const inOrderPercentage = matchingInOrderCharCount / stringToRank.length;
-    const ranking = rankings.MATCHES + inOrderPercentage * spreadPercentage;
+    const matchPercentage = (stringToRank.length - skipped) / stringToRank.length;
+    const ranking = rankings.MATCHES + inOrderPercentage * spreadPercentage * matchPercentage;
     return ranking;
   }
-  const firstIndex = findMatchingCharacter(stringToRank[0], testString, 0);
-  if (firstIndex < 0) {
-    return rankings.NO_MATCH;
-  }
-  charNumber = firstIndex;
-  for (let i = 1, I = stringToRank.length; i < I; i++) {
+  let firstIndex = 0;
+  let charNumber = 0;
+  let nextCharNumber = 0;
+  for (let i = 0, I = stringToRank.length; i < I; i++) {
     const matchChar = stringToRank[i];
-    charNumber = findMatchingCharacter(matchChar, testString, charNumber);
-    const found = charNumber > -1;
-    if (!found) {
+    nextCharNumber = findMatchingCharacter(matchChar, testString, charNumber);
+    const found = nextCharNumber > -1;
+    if (found) {
+      charNumber = nextCharNumber;
+      if (i === 0) {
+        firstIndex = charNumber;
+      }
+    } else if (skipped > 0 || stringToRank.length <= 3) {
       return rankings.NO_MATCH;
+    } else {
+      skipped += 1;
     }
   }
   const spread = charNumber - firstIndex;

package/dist/node_modules/match-sorter/dist/match-sorter.esm.cjs.js.map

@@ -1 +1 @@
-{"version":3,"file":"match-sorter.esm.cjs.js","sources":["../../../../../node_modules/match-sorter/dist/match-sorter.esm.js"],"sourcesContent":["import removeAccents from 'remove-accents';\n\n/**\n * @name match-sorter\n * @license MIT license.\n * @copyright (c) 2020 Kent C. Dodds\n * @author Kent C. Dodds <me@kentcdodds.com> (https://kentcdodds.com)\n */\nconst rankings = {\n  CASE_SENSITIVE_EQUAL: 7,\n  EQUAL: 6,\n  STARTS_WITH: 5,\n  WORD_STARTS_WITH: 4,\n  CONTAINS: 3,\n  ACRONYM: 2,\n  MATCHES: 1,\n  NO_MATCH: 0\n};\nconst defaultBaseSortFn = (a, b) => String(a.rankedValue).localeCompare(String(b.rankedValue));\n\n/**\n * Takes an array of items and a value and returns a new array with the items that match the given value\n * @param {Array} items - the items to sort\n * @param {String} value - the value to use for ranking\n * @param {Object} options - Some options to configure the sorter\n * @return {Array} - the new sorted array\n */\nfunction matchSorter(items, value, options) {\n  if (options === void 0) {\n    options = {};\n  }\n  const {\n    keys,\n    threshold = rankings.MATCHES,\n    baseSort = defaultBaseSortFn,\n    sorter = matchedItems => matchedItems.sort((a, b) => sortRankedValues(a, b, baseSort))\n  } = options;\n  const matchedItems = items.reduce(reduceItemsToRanked, []);\n  return sorter(matchedItems).map(_ref => {\n    let {\n      item\n    } = _ref;\n    return item;\n  });\n  function reduceItemsToRanked(matches, item, index) {\n    const rankingInfo = getHighestRanking(item, keys, value, options);\n    const {\n      rank,\n      keyThreshold = threshold\n    } = rankingInfo;\n    if (rank >= keyThreshold) {\n      matches.push({\n        ...rankingInfo,\n        item,\n        index\n      });\n    }\n    return matches;\n  }\n}\nmatchSorter.rankings = rankings;\n\n/**\n * Gets the highest ranking for value for the given item based on its values for the given keys\n * @param {*} item - the item to rank\n * @param {Array} keys - the keys to get values from the item for the ranking\n * @param {String} value - the value to rank against\n * @param {Object} options - options to control the ranking\n * @return {{rank: Number, keyIndex: Number, keyThreshold: Number}} - the highest ranking\n */\nfunction getHighestRanking(item, keys, value, options) {\n  if (!keys) {\n    // if keys is not specified, then we assume the item given is ready to be matched\n    const stringItem = item;\n    return {\n      // ends up being duplicate of 'item' in matches but consistent\n      rankedValue: stringItem,\n      rank: getMatchRanking(stringItem, value, options),\n      keyIndex: -1,\n      keyThreshold: options.threshold\n    };\n  }\n  const valuesToRank = getAllValuesToRank(item, keys);\n  return valuesToRank.reduce((_ref2, _ref3, i) => {\n    let {\n      rank,\n      rankedValue,\n      keyIndex,\n      keyThreshold\n    } = _ref2;\n    let {\n      itemValue,\n      attributes\n    } = _ref3;\n    let newRank = getMatchRanking(itemValue, value, options);\n    let newRankedValue = rankedValue;\n    const {\n      minRanking,\n      maxRanking,\n      threshold\n    } = attributes;\n    if (newRank < minRanking && newRank >= rankings.MATCHES) {\n      newRank = minRanking;\n    } else if (newRank > maxRanking) {\n      newRank = maxRanking;\n    }\n    if (newRank > rank) {\n      rank = newRank;\n      keyIndex = i;\n      keyThreshold = threshold;\n      newRankedValue = itemValue;\n    }\n    return {\n      rankedValue: newRankedValue,\n      rank,\n      keyIndex,\n      keyThreshold\n    };\n  }, {\n    rankedValue: item,\n    rank: rankings.NO_MATCH,\n    keyIndex: -1,\n    keyThreshold: options.threshold\n  });\n}\n\n/**\n * Gives a rankings score based on how well the two strings match.\n * @param {String} testString - the string to test against\n * @param {String} stringToRank - the string to rank\n * @param {Object} options - options for the match (like keepDiacritics for comparison)\n * @returns {Number} the ranking for how well stringToRank matches testString\n */\nfunction getMatchRanking(testString, stringToRank, options) {\n  testString = prepareValueForComparison(testString, options);\n  stringToRank = prepareValueForComparison(stringToRank, options);\n\n  // too long\n  if (stringToRank.length > testString.length) {\n    return rankings.NO_MATCH;\n  }\n\n  // case sensitive equals\n  if (testString === stringToRank) {\n    return rankings.CASE_SENSITIVE_EQUAL;\n  }\n\n  // Lower casing before further comparison\n  testString = testString.toLowerCase();\n  stringToRank = stringToRank.toLowerCase();\n\n  // case insensitive equals\n  if (testString === stringToRank) {\n    return rankings.EQUAL;\n  }\n\n  // starts with\n  if (testString.startsWith(stringToRank)) {\n    return rankings.STARTS_WITH;\n  }\n\n  // word starts with\n  if (testString.includes(` ${stringToRank}`)) {\n    return rankings.WORD_STARTS_WITH;\n  }\n\n  // contains\n  if (testString.includes(stringToRank)) {\n    return rankings.CONTAINS;\n  } else if (stringToRank.length === 1) {\n    // If the only character in the given stringToRank\n    //   isn't even contained in the testString, then\n    //   it's definitely not a match.\n    return rankings.NO_MATCH;\n  }\n\n  // acronym\n  if (getAcronym(testString).includes(stringToRank)) {\n    return rankings.ACRONYM;\n  }\n\n  // will return a number between rankings.MATCHES and\n  // rankings.MATCHES + 1 depending  on how close of a match it is.\n  return getClosenessRanking(testString, stringToRank);\n}\n\n/**\n * Generates an acronym for a string.\n *\n * @param {String} string the string for which to produce the acronym\n * @returns {String} the acronym\n */\nfunction getAcronym(string) {\n  let acronym = '';\n  const wordsInString = string.split(' ');\n  wordsInString.forEach(wordInString => {\n    const splitByHyphenWords = wordInString.split('-');\n    splitByHyphenWords.forEach(splitByHyphenWord => {\n      acronym += splitByHyphenWord.substr(0, 1);\n    });\n  });\n  return acronym;\n}\n\n/**\n * Returns a score based on how spread apart the\n * characters from the stringToRank are within the testString.\n * A number close to rankings.MATCHES represents a loose match. A number close\n * to rankings.MATCHES + 1 represents a tighter match.\n * @param {String} testString - the string to test against\n * @param {String} stringToRank - the string to rank\n * @returns {Number} the number between rankings.MATCHES and\n * rankings.MATCHES + 1 for how well stringToRank matches testString\n */\nfunction getClosenessRanking(testString, stringToRank) {\n  let matchingInOrderCharCount = 0;\n  let charNumber = 0;\n  function findMatchingCharacter(matchChar, string, index) {\n    for (let j = index, J = string.length; j < J; j++) {\n      const stringChar = string[j];\n      if (stringChar === matchChar) {\n        matchingInOrderCharCount += 1;\n        return j + 1;\n      }\n    }\n    return -1;\n  }\n  function getRanking(spread) {\n    const spreadPercentage = 1 / spread;\n    const inOrderPercentage = matchingInOrderCharCount / stringToRank.length;\n    const ranking = rankings.MATCHES + inOrderPercentage * spreadPercentage;\n    return ranking;\n  }\n  const firstIndex = findMatchingCharacter(stringToRank[0], testString, 0);\n  if (firstIndex < 0) {\n    return rankings.NO_MATCH;\n  }\n  charNumber = firstIndex;\n  for (let i = 1, I = stringToRank.length; i < I; i++) {\n    const matchChar = stringToRank[i];\n    charNumber = findMatchingCharacter(matchChar, testString, charNumber);\n    const found = charNumber > -1;\n    if (!found) {\n      return rankings.NO_MATCH;\n    }\n  }\n  const spread = charNumber - firstIndex;\n  return getRanking(spread);\n}\n\n/**\n * Sorts items that have a rank, index, and keyIndex\n * @param {Object} a - the first item to sort\n * @param {Object} b - the second item to sort\n * @return {Number} -1 if a should come first, 1 if b should come first, 0 if equal\n */\nfunction sortRankedValues(a, b, baseSort) {\n  const aFirst = -1;\n  const bFirst = 1;\n  const {\n    rank: aRank,\n    keyIndex: aKeyIndex\n  } = a;\n  const {\n    rank: bRank,\n    keyIndex: bKeyIndex\n  } = b;\n  const same = aRank === bRank;\n  if (same) {\n    if (aKeyIndex === bKeyIndex) {\n      // use the base sort function as a tie-breaker\n      return baseSort(a, b);\n    } else {\n      return aKeyIndex < bKeyIndex ? aFirst : bFirst;\n    }\n  } else {\n    return aRank > bRank ? aFirst : bFirst;\n  }\n}\n\n/**\n * Prepares value for comparison by stringifying it, removing diacritics (if specified)\n * @param {String} value - the value to clean\n * @param {Object} options - {keepDiacritics: whether to remove diacritics}\n * @return {String} the prepared value\n */\nfunction prepareValueForComparison(value, _ref4) {\n  let {\n    keepDiacritics\n  } = _ref4;\n  // value might not actually be a string at this point (we don't get to choose)\n  // so part of preparing the value for comparison is ensure that it is a string\n  value = `${value}`; // toString\n  if (!keepDiacritics) {\n    value = removeAccents(value);\n  }\n  return value;\n}\n\n/**\n * Gets value for key in item at arbitrarily nested keypath\n * @param {Object} item - the item\n * @param {Object|Function} key - the potentially nested keypath or property callback\n * @return {Array} - an array containing the value(s) at the nested keypath\n */\nfunction getItemValues(item, key) {\n  if (typeof key === 'object') {\n    key = key.key;\n  }\n  let value;\n  if (typeof key === 'function') {\n    value = key(item);\n  } else if (item == null) {\n    value = null;\n  } else if (Object.hasOwnProperty.call(item, key)) {\n    value = item[key];\n  } else if (key.includes('.')) {\n    // eslint-disable-next-line @typescript-eslint/no-unsafe-call\n    return getNestedValues(key, item);\n  } else {\n    value = null;\n  }\n\n  // because `value` can also be undefined\n  if (value == null) {\n    return [];\n  }\n  if (Array.isArray(value)) {\n    return value;\n  }\n  return [String(value)];\n}\n\n/**\n * Given path: \"foo.bar.baz\"\n * And item: {foo: {bar: {baz: 'buzz'}}}\n *   -> 'buzz'\n * @param path a dot-separated set of keys\n * @param item the item to get the value from\n */\nfunction getNestedValues(path, item) {\n  const keys = path.split('.');\n  let values = [item];\n  for (let i = 0, I = keys.length; i < I; i++) {\n    const nestedKey = keys[i];\n    let nestedValues = [];\n    for (let j = 0, J = values.length; j < J; j++) {\n      const nestedItem = values[j];\n      if (nestedItem == null) continue;\n      if (Object.hasOwnProperty.call(nestedItem, nestedKey)) {\n        const nestedValue = nestedItem[nestedKey];\n        if (nestedValue != null) {\n          nestedValues.push(nestedValue);\n        }\n      } else if (nestedKey === '*') {\n        // ensure that values is an array\n        nestedValues = nestedValues.concat(nestedItem);\n      }\n    }\n    values = nestedValues;\n  }\n  if (Array.isArray(values[0])) {\n    // keep allowing the implicit wildcard for an array of strings at the end of\n    // the path; don't use `.flat()` because that's not available in node.js v10\n    const result = [];\n    return result.concat(...values);\n  }\n  // Based on our logic it should be an array of strings by now...\n  // assuming the user's path terminated in strings\n  return values;\n}\n\n/**\n * Gets all the values for the given keys in the given item and returns an array of those values\n * @param item - the item from which the values will be retrieved\n * @param keys - the keys to use to retrieve the values\n * @return objects with {itemValue, attributes}\n */\nfunction getAllValuesToRank(item, keys) {\n  const allValues = [];\n  for (let j = 0, J = keys.length; j < J; j++) {\n    const key = keys[j];\n    const attributes = getKeyAttributes(key);\n    const itemValues = getItemValues(item, key);\n    for (let i = 0, I = itemValues.length; i < I; i++) {\n      allValues.push({\n        itemValue: itemValues[i],\n        attributes\n      });\n    }\n  }\n  return allValues;\n}\nconst defaultKeyAttributes = {\n  maxRanking: Infinity,\n  minRanking: -Infinity\n};\n/**\n * Gets all the attributes for the given key\n * @param key - the key from which the attributes will be retrieved\n * @return object containing the key's attributes\n */\nfunction getKeyAttributes(key) {\n  if (typeof key === 'string') {\n    return defaultKeyAttributes;\n  }\n  return {\n    ...defaultKeyAttributes,\n    ...key\n  };\n}\n\n/*\neslint\n  no-continue: \"off\",\n*/\n\nexport { defaultBaseSortFn, matchSorter, rankings };\n"],"names":["matchedItems","index","spread","removeAccents"],"mappings":";;;AAEA;AAAA;AAAA;AAAA;AAAA;AAAA;AAMK,MAAC,WAAW;AAAA,EACf,sBAAsB;AAAA,EACtB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,UAAU;AAAA,EACV,SAAS;AAAA,EACT,SAAS;AAAA,EACT,UAAU;AACZ;AACK,MAAC,oBAAoB,CAAC,GAAG,MAAM,OAAO,EAAE,WAAW,EAAE,cAAc,OAAO,EAAE,WAAW,CAAC;AAS7F,SAAS,YAAY,OAAO,OAAO,SAAS;AAC1C,MAAI,YAAY,QAAQ;AACtB,cAAU,CAAE;AAAA,EAChB;AACE,QAAM;AAAA,IACJ;AAAA,IACA,YAAY,SAAS;AAAA,IACrB,WAAW;AAAA,IACX,SAAS,CAAAA,kBAAgBA,cAAa,KAAK,CAAC,GAAG,MAAM,iBAAiB,GAAG,GAAG,QAAQ,CAAC;AAAA,EACzF,IAAM;AACJ,QAAM,eAAe,MAAM,OAAO,qBAAqB,CAAA,CAAE;AACzD,SAAO,OAAO,YAAY,EAAE,IAAI,UAAQ;AACtC,QAAI;AAAA,MACF;AAAA,IACN,IAAQ;AACJ,WAAO;AAAA,EACX,CAAG;AACD,WAAS,oBAAoB,SAAS,MAAMC,QAAO;AACjD,UAAM,cAAc,kBAAkB,MAAM,MAAM,OAAO,OAAO;AAChE,UAAM;AAAA,MACJ;AAAA,MACA,eAAe;AAAA,IACrB,IAAQ;AACJ,QAAI,QAAQ,cAAc;AACxB,cAAQ,KAAK;AAAA,QACX,GAAG;AAAA,QACH;AAAA,QACA,OAAAA;AAAA,MACR,CAAO;AAAA,IACP;AACI,WAAO;AAAA,EACX;AACA;AACA,YAAY,WAAW;AAUvB,SAAS,kBAAkB,MAAM,MAAM,OAAO,SAAS;AACrD,MAAI,CAAC,MAAM;AAET,UAAM,aAAa;AACnB,WAAO;AAAA;AAAA,MAEL,aAAa;AAAA,MACb,MAAM,gBAAgB,YAAY,OAAO,OAAO;AAAA,MAChD,UAAU;AAAA,MACV,cAAc,QAAQ;AAAA,IACvB;AAAA,EACL;AACE,QAAM,eAAe,mBAAmB,MAAM,IAAI;AAClD,SAAO,aAAa,OAAO,CAAC,OAAO,OAAO,MAAM;AAC9C,QAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI;AAAA,MACF;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI,UAAU,gBAAgB,WAAW,OAAO,OAAO;AACvD,QAAI,iBAAiB;AACrB,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI,UAAU,cAAc,WAAW,SAAS,SAAS;AACvD,gBAAU;AAAA,IAChB,WAAe,UAAU,YAAY;AAC/B,gBAAU;AAAA,IAChB;AACI,QAAI,UAAU,MAAM;AAClB,aAAO;AACP,iBAAW;AACX,qBAAe;AACf,uBAAiB;AAAA,IACvB;AACI,WAAO;AAAA,MACL,aAAa;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,IACD;AAAA,EACL,GAAK;AAAA,IACD,aAAa;AAAA,IACb,MAAM,SAAS;AAAA,IACf,UAAU;AAAA,IACV,cAAc,QAAQ;AAAA,EAC1B,CAAG;AACH;AASA,SAAS,gBAAgB,YAAY,cAAc,SAAS;AAC1D,eAAa,0BAA0B,YAAY,OAAO;AAC1D,iBAAe,0BAA0B,cAAc,OAAO;AAG9D,MAAI,aAAa,SAAS,WAAW,QAAQ;AAC3C,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,eAAe,cAAc;AAC/B,WAAO,SAAS;AAAA,EACpB;AAGE,eAAa,WAAW,YAAa;AACrC,iBAAe,aAAa,YAAa;AAGzC,MAAI,eAAe,cAAc;AAC/B,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,WAAW,YAAY,GAAG;AACvC,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,SAAS,IAAI,YAAY,EAAE,GAAG;AAC3C,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,SAAS,YAAY,GAAG;AACrC,WAAO,SAAS;AAAA,EACpB,WAAa,aAAa,WAAW,GAAG;AAIpC,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,UAAU,EAAE,SAAS,YAAY,GAAG;AACjD,WAAO,SAAS;AAAA,EACpB;AAIE,SAAO,oBAAoB,YAAY,YAAY;AACrD;AAQA,SAAS,WAAW,QAAQ;AAC1B,MAAI,UAAU;AACd,QAAM,gBAAgB,OAAO,MAAM,GAAG;AACtC,gBAAc,QAAQ,kBAAgB;AACpC,UAAM,qBAAqB,aAAa,MAAM,GAAG;AACjD,uBAAmB,QAAQ,uBAAqB;AAC9C,iBAAW,kBAAkB,OAAO,GAAG,CAAC;AAAA,IAC9C,CAAK;AAAA,EACL,CAAG;AACD,SAAO;AACT;AAYA,SAAS,oBAAoB,YAAY,cAAc;AACrD,MAAI,2BAA2B;AAC/B,MAAI,aAAa;AACjB,WAAS,sBAAsB,WAAW,QAAQA,QAAO;AACvD,aAAS,IAAIA,QAAO,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AACjD,YAAM,aAAa,OAAO,CAAC;AAC3B,UAAI,eAAe,WAAW;AAC5B,oCAA4B;AAC5B,eAAO,IAAI;AAAA,MACnB;AAAA,IACA;AACI,WAAO;AAAA,EACX;AACE,WAAS,WAAWC,SAAQ;AAC1B,UAAM,mBAAmB,IAAIA;AAC7B,UAAM,oBAAoB,2BAA2B,aAAa;AAClE,UAAM,UAAU,SAAS,UAAU,oBAAoB;AACvD,WAAO;AAAA,EACX;AACE,QAAM,aAAa,sBAAsB,aAAa,CAAC,GAAG,YAAY,CAAC;AACvE,MAAI,aAAa,GAAG;AAClB,WAAO,SAAS;AAAA,EACpB;AACE,eAAa;AACb,WAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,IAAI,GAAG,KAAK;AACnD,UAAM,YAAY,aAAa,CAAC;AAChC,iBAAa,sBAAsB,WAAW,YAAY,UAAU;AACpE,UAAM,QAAQ,aAAa;AAC3B,QAAI,CAAC,OAAO;AACV,aAAO,SAAS;AAAA,IACtB;AAAA,EACA;AACE,QAAM,SAAS,aAAa;AAC5B,SAAO,WAAW,MAAM;AAC1B;AAQA,SAAS,iBAAiB,GAAG,GAAG,UAAU;AACxC,QAAM,SAAS;AACf,QAAM,SAAS;AACf,QAAM;AAAA,IACJ,MAAM;AAAA,IACN,UAAU;AAAA,EACd,IAAM;AACJ,QAAM;AAAA,IACJ,MAAM;AAAA,IACN,UAAU;AAAA,EACd,IAAM;AACJ,QAAM,OAAO,UAAU;AACvB,MAAI,MAAM;AACR,QAAI,cAAc,WAAW;AAE3B,aAAO,SAAS,GAAG,CAAC;AAAA,IAC1B,OAAW;AACL,aAAO,YAAY,YAAY,SAAS;AAAA,IAC9C;AAAA,EACA,OAAS;AACL,WAAO,QAAQ,QAAQ,SAAS;AAAA,EACpC;AACA;AAQA,SAAS,0BAA0B,OAAO,OAAO;AAC/C,MAAI;AAAA,IACF;AAAA,EACJ,IAAM;AAGJ,UAAQ,GAAG,KAAK;AAChB,MAAI,CAAC,gBAAgB;AACnB,YAAQC,MAAc,KAAK;AAAA,EAC/B;AACE,SAAO;AACT;AAQA,SAAS,cAAc,MAAM,KAAK;AAChC,MAAI,OAAO,QAAQ,UAAU;AAC3B,UAAM,IAAI;AAAA,EACd;AACE,MAAI;AACJ,MAAI,OAAO,QAAQ,YAAY;AAC7B,YAAQ,IAAI,IAAI;AAAA,EACpB,WAAa,QAAQ,MAAM;AACvB,YAAQ;AAAA,EACZ,WAAa,OAAO,eAAe,KAAK,MAAM,GAAG,GAAG;AAChD,YAAQ,KAAK,GAAG;AAAA,EACjB,WAAU,IAAI,SAAS,GAAG,GAAG;AAE5B,WAAO,gBAAgB,KAAK,IAAI;AAAA,EACpC,OAAS;AACL,YAAQ;AAAA,EACZ;AAGE,MAAI,SAAS,MAAM;AACjB,WAAO,CAAE;AAAA,EACb;AACE,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO;AAAA,EACX;AACE,SAAO,CAAC,OAAO,KAAK,CAAC;AACvB;AASA,SAAS,gBAAgB,MAAM,MAAM;AACnC,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,MAAI,SAAS,CAAC,IAAI;AAClB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;AAC3C,UAAM,YAAY,KAAK,CAAC;AACxB,QAAI,eAAe,CAAE;AACrB,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AAC7C,YAAM,aAAa,OAAO,CAAC;AAC3B,UAAI,cAAc,KAAM;AACxB,UAAI,OAAO,eAAe,KAAK,YAAY,SAAS,GAAG;AACrD,cAAM,cAAc,WAAW,SAAS;AACxC,YAAI,eAAe,MAAM;AACvB,uBAAa,KAAK,WAAW;AAAA,QACvC;AAAA,MACA,WAAiB,cAAc,KAAK;AAE5B,uBAAe,aAAa,OAAO,UAAU;AAAA,MACrD;AAAA,IACA;AACI,aAAS;AAAA,EACb;AACE,MAAI,MAAM,QAAQ,OAAO,CAAC,CAAC,GAAG;AAG5B,UAAM,SAAS,CAAE;AACjB,WAAO,OAAO,OAAO,GAAG,MAAM;AAAA,EAClC;AAGE,SAAO;AACT;AAQA,SAAS,mBAAmB,MAAM,MAAM;AACtC,QAAM,YAAY,CAAE;AACpB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;AAC3C,UAAM,MAAM,KAAK,CAAC;AAClB,UAAM,aAAa,iBAAiB,GAAG;AACvC,UAAM,aAAa,cAAc,MAAM,GAAG;AAC1C,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,IAAI,GAAG,KAAK;AACjD,gBAAU,KAAK;AAAA,QACb,WAAW,WAAW,CAAC;AAAA,QACvB;AAAA,MACR,CAAO;AAAA,IACP;AAAA,EACA;AACE,SAAO;AACT;AACA,MAAM,uBAAuB;AAAA,EAC3B,YAAY;AAAA,EACZ,YAAY;AACd;AAMA,SAAS,iBAAiB,KAAK;AAC7B,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;AAAA,EACX;AACE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG;AAAA,EACJ;AACH;;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"match-sorter.esm.cjs.js","sources":["../../../../../node_modules/match-sorter/dist/match-sorter.esm.js"],"sourcesContent":["import removeAccents from 'remove-accents';\n\n/**\n * @name match-sorter\n * @license MIT license.\n * @copyright (c) 2020 Kent C. Dodds\n * @author Kent C. Dodds <me@kentcdodds.com> (https://kentcdodds.com)\n */\nconst rankings = {\n  CASE_SENSITIVE_EQUAL: 7,\n  EQUAL: 6,\n  STARTS_WITH: 5,\n  WORD_STARTS_WITH: 4,\n  CONTAINS: 3,\n  ACRONYM: 2,\n  MATCHES: 1,\n  NO_MATCH: 0\n};\nconst defaultBaseSortFn = (a, b) => String(a.rankedValue).localeCompare(String(b.rankedValue));\n\n/**\n * Takes an array of items and a value and returns a new array with the items that match the given value\n * @param {Array} items - the items to sort\n * @param {String} value - the value to use for ranking\n * @param {Object} options - Some options to configure the sorter\n * @return {Array} - the new sorted array\n */\nfunction matchSorter(items, value, options) {\n  if (options === void 0) {\n    options = {};\n  }\n  const {\n    keys,\n    threshold = rankings.MATCHES,\n    baseSort = defaultBaseSortFn,\n    sorter = matchedItems => matchedItems.sort((a, b) => sortRankedValues(a, b, baseSort))\n  } = options;\n  const matchedItems = items.reduce(reduceItemsToRanked, []);\n  return sorter(matchedItems).map(_ref => {\n    let {\n      item\n    } = _ref;\n    return item;\n  });\n  function reduceItemsToRanked(matches, item, index) {\n    const rankingInfo = getHighestRanking(item, keys, value, options);\n    const {\n      rank,\n      keyThreshold = threshold\n    } = rankingInfo;\n    if (rank >= keyThreshold) {\n      matches.push({\n        ...rankingInfo,\n        item,\n        index\n      });\n    }\n    return matches;\n  }\n}\nmatchSorter.rankings = rankings;\n\n/**\n * Gets the highest ranking for value for the given item based on its values for the given keys\n * @param {*} item - the item to rank\n * @param {Array} keys - the keys to get values from the item for the ranking\n * @param {String} value - the value to rank against\n * @param {Object} options - options to control the ranking\n * @return {{rank: Number, keyIndex: Number, keyThreshold: Number}} - the highest ranking\n */\nfunction getHighestRanking(item, keys, value, options) {\n  if (!keys) {\n    // if keys is not specified, then we assume the item given is ready to be matched\n    const stringItem = item;\n    return {\n      // ends up being duplicate of 'item' in matches but consistent\n      rankedValue: stringItem,\n      rank: getMatchRanking(stringItem, value, options),\n      keyIndex: -1,\n      keyThreshold: options.threshold\n    };\n  }\n  const valuesToRank = getAllValuesToRank(item, keys);\n  return valuesToRank.reduce((_ref2, _ref3, i) => {\n    let {\n      rank,\n      rankedValue,\n      keyIndex,\n      keyThreshold\n    } = _ref2;\n    let {\n      itemValue,\n      attributes\n    } = _ref3;\n    let newRank = getMatchRanking(itemValue, value, options);\n    let newRankedValue = rankedValue;\n    const {\n      minRanking,\n      maxRanking,\n      threshold\n    } = attributes;\n    if (newRank < minRanking && newRank >= rankings.MATCHES) {\n      newRank = minRanking;\n    } else if (newRank > maxRanking) {\n      newRank = maxRanking;\n    }\n    if (newRank > rank) {\n      rank = newRank;\n      keyIndex = i;\n      keyThreshold = threshold;\n      newRankedValue = itemValue;\n    }\n    return {\n      rankedValue: newRankedValue,\n      rank,\n      keyIndex,\n      keyThreshold\n    };\n  }, {\n    rankedValue: item,\n    rank: rankings.NO_MATCH,\n    keyIndex: -1,\n    keyThreshold: options.threshold\n  });\n}\n\n/**\n * Gives a rankings score based on how well the two strings match.\n * @param {String} testString - the string to test against\n * @param {String} stringToRank - the string to rank\n * @param {Object} options - options for the match (like keepDiacritics for comparison)\n * @returns {Number} the ranking for how well stringToRank matches testString\n */\nfunction getMatchRanking(testString, stringToRank, options) {\n  testString = prepareValueForComparison(testString, options);\n  stringToRank = prepareValueForComparison(stringToRank, options);\n\n  // too long\n  if (stringToRank.length > testString.length) {\n    return rankings.NO_MATCH;\n  }\n\n  // case sensitive equals\n  if (testString === stringToRank) {\n    return rankings.CASE_SENSITIVE_EQUAL;\n  }\n\n  // Lower casing before further comparison\n  testString = testString.toLowerCase();\n  stringToRank = stringToRank.toLowerCase();\n\n  // case insensitive equals\n  if (testString === stringToRank) {\n    return rankings.EQUAL;\n  }\n\n  // starts with\n  if (testString.startsWith(stringToRank)) {\n    return rankings.STARTS_WITH;\n  }\n\n  // word starts with\n  if (testString.includes(` ${stringToRank}`)) {\n    return rankings.WORD_STARTS_WITH;\n  }\n\n  // contains\n  if (testString.includes(stringToRank)) {\n    return rankings.CONTAINS;\n  } else if (stringToRank.length === 1) {\n    // If the only character in the given stringToRank\n    //   isn't even contained in the testString, then\n    //   it's definitely not a match.\n    return rankings.NO_MATCH;\n  }\n\n  // acronym\n  if (getAcronym(testString).includes(stringToRank)) {\n    return rankings.ACRONYM;\n  }\n\n  // will return a number between rankings.MATCHES and\n  // rankings.MATCHES + 1 depending  on how close of a match it is.\n  return getClosenessRanking(testString, stringToRank);\n}\n\n/**\n * Generates an acronym for a string.\n *\n * @param {String} string the string for which to produce the acronym\n * @returns {String} the acronym\n */\nfunction getAcronym(string) {\n  let acronym = '';\n  const wordsInString = string.split(' ');\n  wordsInString.forEach(wordInString => {\n    const splitByHyphenWords = wordInString.split('-');\n    splitByHyphenWords.forEach(splitByHyphenWord => {\n      acronym += splitByHyphenWord.substr(0, 1);\n    });\n  });\n  return acronym;\n}\n\n/**\n * Returns a score based on how spread apart the\n * characters from the stringToRank are within the testString.\n * A number close to rankings.MATCHES represents a loose match. A number close\n * to rankings.MATCHES + 1 represents a tighter match.\n * @param {String} testString - the string to test against\n * @param {String} stringToRank - the string to rank\n * @returns {Number} the number between rankings.MATCHES and\n * rankings.MATCHES + 1 for how well stringToRank matches testString\n */\nfunction getClosenessRanking(testString, stringToRank) {\n  let matchingInOrderCharCount = 0;\n  function findMatchingCharacter(matchChar, string, index) {\n    for (let j = index, J = string.length; j < J; j++) {\n      const stringChar = string[j];\n      if (stringChar === matchChar) {\n        matchingInOrderCharCount += 1;\n        return j + 1;\n      }\n    }\n    return -1;\n  }\n  let skipped = 0;\n  function getRanking(spread) {\n    const spreadPercentage = 1 / spread;\n    const inOrderPercentage = matchingInOrderCharCount / stringToRank.length;\n    const matchPercentage = (stringToRank.length - skipped) / stringToRank.length;\n    const ranking = rankings.MATCHES + inOrderPercentage * spreadPercentage * matchPercentage;\n    return ranking;\n  }\n  let firstIndex = 0;\n  let charNumber = 0;\n  let nextCharNumber = 0;\n  for (let i = 0, I = stringToRank.length; i < I; i++) {\n    const matchChar = stringToRank[i];\n    nextCharNumber = findMatchingCharacter(matchChar, testString, charNumber);\n    const found = nextCharNumber > -1;\n    if (found) {\n      charNumber = nextCharNumber;\n      if (i === 0) {\n        firstIndex = charNumber;\n      }\n    } else if (skipped > 0 || stringToRank.length <= 3) {\n      // if search term is short, require finding all characters\n      return rankings.NO_MATCH;\n    } else {\n      skipped += 1;\n    }\n  }\n  const spread = charNumber - firstIndex;\n  return getRanking(spread);\n}\n\n/**\n * Sorts items that have a rank, index, and keyIndex\n * @param {Object} a - the first item to sort\n * @param {Object} b - the second item to sort\n * @return {Number} -1 if a should come first, 1 if b should come first, 0 if equal\n */\nfunction sortRankedValues(a, b, baseSort) {\n  const aFirst = -1;\n  const bFirst = 1;\n  const {\n    rank: aRank,\n    keyIndex: aKeyIndex\n  } = a;\n  const {\n    rank: bRank,\n    keyIndex: bKeyIndex\n  } = b;\n  const same = aRank === bRank;\n  if (same) {\n    if (aKeyIndex === bKeyIndex) {\n      // use the base sort function as a tie-breaker\n      return baseSort(a, b);\n    } else {\n      return aKeyIndex < bKeyIndex ? aFirst : bFirst;\n    }\n  } else {\n    return aRank > bRank ? aFirst : bFirst;\n  }\n}\n\n/**\n * Prepares value for comparison by stringifying it, removing diacritics (if specified)\n * @param {String} value - the value to clean\n * @param {Object} options - {keepDiacritics: whether to remove diacritics}\n * @return {String} the prepared value\n */\nfunction prepareValueForComparison(value, _ref4) {\n  let {\n    keepDiacritics\n  } = _ref4;\n  // value might not actually be a string at this point (we don't get to choose)\n  // so part of preparing the value for comparison is ensure that it is a string\n  value = `${value}`; // toString\n  if (!keepDiacritics) {\n    value = removeAccents(value);\n  }\n  return value;\n}\n\n/**\n * Gets value for key in item at arbitrarily nested keypath\n * @param {Object} item - the item\n * @param {Object|Function} key - the potentially nested keypath or property callback\n * @return {Array} - an array containing the value(s) at the nested keypath\n */\nfunction getItemValues(item, key) {\n  if (typeof key === 'object') {\n    key = key.key;\n  }\n  let value;\n  if (typeof key === 'function') {\n    value = key(item);\n  } else if (item == null) {\n    value = null;\n  } else if (Object.hasOwnProperty.call(item, key)) {\n    value = item[key];\n  } else if (key.includes('.')) {\n    // eslint-disable-next-line @typescript-eslint/no-unsafe-call\n    return getNestedValues(key, item);\n  } else {\n    value = null;\n  }\n\n  // because `value` can also be undefined\n  if (value == null) {\n    return [];\n  }\n  if (Array.isArray(value)) {\n    return value;\n  }\n  return [String(value)];\n}\n\n/**\n * Given path: \"foo.bar.baz\"\n * And item: {foo: {bar: {baz: 'buzz'}}}\n *   -> 'buzz'\n * @param path a dot-separated set of keys\n * @param item the item to get the value from\n */\nfunction getNestedValues(path, item) {\n  const keys = path.split('.');\n  let values = [item];\n  for (let i = 0, I = keys.length; i < I; i++) {\n    const nestedKey = keys[i];\n    let nestedValues = [];\n    for (let j = 0, J = values.length; j < J; j++) {\n      const nestedItem = values[j];\n      if (nestedItem == null) continue;\n      if (Object.hasOwnProperty.call(nestedItem, nestedKey)) {\n        const nestedValue = nestedItem[nestedKey];\n        if (nestedValue != null) {\n          nestedValues.push(nestedValue);\n        }\n      } else if (nestedKey === '*') {\n        // ensure that values is an array\n        nestedValues = nestedValues.concat(nestedItem);\n      }\n    }\n    values = nestedValues;\n  }\n  if (Array.isArray(values[0])) {\n    // keep allowing the implicit wildcard for an array of strings at the end of\n    // the path; don't use `.flat()` because that's not available in node.js v10\n    const result = [];\n    return result.concat(...values);\n  }\n  // Based on our logic it should be an array of strings by now...\n  // assuming the user's path terminated in strings\n  return values;\n}\n\n/**\n * Gets all the values for the given keys in the given item and returns an array of those values\n * @param item - the item from which the values will be retrieved\n * @param keys - the keys to use to retrieve the values\n * @return objects with {itemValue, attributes}\n */\nfunction getAllValuesToRank(item, keys) {\n  const allValues = [];\n  for (let j = 0, J = keys.length; j < J; j++) {\n    const key = keys[j];\n    const attributes = getKeyAttributes(key);\n    const itemValues = getItemValues(item, key);\n    for (let i = 0, I = itemValues.length; i < I; i++) {\n      allValues.push({\n        itemValue: itemValues[i],\n        attributes\n      });\n    }\n  }\n  return allValues;\n}\nconst defaultKeyAttributes = {\n  maxRanking: Infinity,\n  minRanking: -Infinity\n};\n/**\n * Gets all the attributes for the given key\n * @param key - the key from which the attributes will be retrieved\n * @return object containing the key's attributes\n */\nfunction getKeyAttributes(key) {\n  if (typeof key === 'string') {\n    return defaultKeyAttributes;\n  }\n  return {\n    ...defaultKeyAttributes,\n    ...key\n  };\n}\n\n/*\neslint\n  no-continue: \"off\",\n*/\n\nexport { defaultBaseSortFn, matchSorter, rankings };\n"],"names":["matchedItems","index","spread","removeAccents"],"mappings":";;;AAEA;AAAA;AAAA;AAAA;AAAA;AAAA;AAMK,MAAC,WAAW;AAAA,EACf,sBAAsB;AAAA,EACtB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,UAAU;AAAA,EACV,SAAS;AAAA,EACT,SAAS;AAAA,EACT,UAAU;AACZ;AACK,MAAC,oBAAoB,CAAC,GAAG,MAAM,OAAO,EAAE,WAAW,EAAE,cAAc,OAAO,EAAE,WAAW,CAAC;AAS7F,SAAS,YAAY,OAAO,OAAO,SAAS;AAC1C,MAAI,YAAY,QAAQ;AACtB,cAAU,CAAE;AAAA,EAChB;AACE,QAAM;AAAA,IACJ;AAAA,IACA,YAAY,SAAS;AAAA,IACrB,WAAW;AAAA,IACX,SAAS,CAAAA,kBAAgBA,cAAa,KAAK,CAAC,GAAG,MAAM,iBAAiB,GAAG,GAAG,QAAQ,CAAC;AAAA,EACzF,IAAM;AACJ,QAAM,eAAe,MAAM,OAAO,qBAAqB,CAAA,CAAE;AACzD,SAAO,OAAO,YAAY,EAAE,IAAI,UAAQ;AACtC,QAAI;AAAA,MACF;AAAA,IACN,IAAQ;AACJ,WAAO;AAAA,EACX,CAAG;AACD,WAAS,oBAAoB,SAAS,MAAMC,QAAO;AACjD,UAAM,cAAc,kBAAkB,MAAM,MAAM,OAAO,OAAO;AAChE,UAAM;AAAA,MACJ;AAAA,MACA,eAAe;AAAA,IACrB,IAAQ;AACJ,QAAI,QAAQ,cAAc;AACxB,cAAQ,KAAK;AAAA,QACX,GAAG;AAAA,QACH;AAAA,QACA,OAAAA;AAAA,MACR,CAAO;AAAA,IACP;AACI,WAAO;AAAA,EACX;AACA;AACA,YAAY,WAAW;AAUvB,SAAS,kBAAkB,MAAM,MAAM,OAAO,SAAS;AACrD,MAAI,CAAC,MAAM;AAET,UAAM,aAAa;AACnB,WAAO;AAAA;AAAA,MAEL,aAAa;AAAA,MACb,MAAM,gBAAgB,YAAY,OAAO,OAAO;AAAA,MAChD,UAAU;AAAA,MACV,cAAc,QAAQ;AAAA,IACvB;AAAA,EACL;AACE,QAAM,eAAe,mBAAmB,MAAM,IAAI;AAClD,SAAO,aAAa,OAAO,CAAC,OAAO,OAAO,MAAM;AAC9C,QAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI;AAAA,MACF;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI,UAAU,gBAAgB,WAAW,OAAO,OAAO;AACvD,QAAI,iBAAiB;AACrB,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI,UAAU,cAAc,WAAW,SAAS,SAAS;AACvD,gBAAU;AAAA,IAChB,WAAe,UAAU,YAAY;AAC/B,gBAAU;AAAA,IAChB;AACI,QAAI,UAAU,MAAM;AAClB,aAAO;AACP,iBAAW;AACX,qBAAe;AACf,uBAAiB;AAAA,IACvB;AACI,WAAO;AAAA,MACL,aAAa;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,IACD;AAAA,EACL,GAAK;AAAA,IACD,aAAa;AAAA,IACb,MAAM,SAAS;AAAA,IACf,UAAU;AAAA,IACV,cAAc,QAAQ;AAAA,EAC1B,CAAG;AACH;AASA,SAAS,gBAAgB,YAAY,cAAc,SAAS;AAC1D,eAAa,0BAA0B,YAAY,OAAO;AAC1D,iBAAe,0BAA0B,cAAc,OAAO;AAG9D,MAAI,aAAa,SAAS,WAAW,QAAQ;AAC3C,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,eAAe,cAAc;AAC/B,WAAO,SAAS;AAAA,EACpB;AAGE,eAAa,WAAW,YAAa;AACrC,iBAAe,aAAa,YAAa;AAGzC,MAAI,eAAe,cAAc;AAC/B,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,WAAW,YAAY,GAAG;AACvC,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,SAAS,IAAI,YAAY,EAAE,GAAG;AAC3C,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,SAAS,YAAY,GAAG;AACrC,WAAO,SAAS;AAAA,EACpB,WAAa,aAAa,WAAW,GAAG;AAIpC,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,UAAU,EAAE,SAAS,YAAY,GAAG;AACjD,WAAO,SAAS;AAAA,EACpB;AAIE,SAAO,oBAAoB,YAAY,YAAY;AACrD;AAQA,SAAS,WAAW,QAAQ;AAC1B,MAAI,UAAU;AACd,QAAM,gBAAgB,OAAO,MAAM,GAAG;AACtC,gBAAc,QAAQ,kBAAgB;AACpC,UAAM,qBAAqB,aAAa,MAAM,GAAG;AACjD,uBAAmB,QAAQ,uBAAqB;AAC9C,iBAAW,kBAAkB,OAAO,GAAG,CAAC;AAAA,IAC9C,CAAK;AAAA,EACL,CAAG;AACD,SAAO;AACT;AAYA,SAAS,oBAAoB,YAAY,cAAc;AACrD,MAAI,2BAA2B;AAC/B,WAAS,sBAAsB,WAAW,QAAQA,QAAO;AACvD,aAAS,IAAIA,QAAO,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AACjD,YAAM,aAAa,OAAO,CAAC;AAC3B,UAAI,eAAe,WAAW;AAC5B,oCAA4B;AAC5B,eAAO,IAAI;AAAA,MACnB;AAAA,IACA;AACI,WAAO;AAAA,EACX;AACE,MAAI,UAAU;AACd,WAAS,WAAWC,SAAQ;AAC1B,UAAM,mBAAmB,IAAIA;AAC7B,UAAM,oBAAoB,2BAA2B,aAAa;AAClE,UAAM,mBAAmB,aAAa,SAAS,WAAW,aAAa;AACvE,UAAM,UAAU,SAAS,UAAU,oBAAoB,mBAAmB;AAC1E,WAAO;AAAA,EACX;AACE,MAAI,aAAa;AACjB,MAAI,aAAa;AACjB,MAAI,iBAAiB;AACrB,WAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,IAAI,GAAG,KAAK;AACnD,UAAM,YAAY,aAAa,CAAC;AAChC,qBAAiB,sBAAsB,WAAW,YAAY,UAAU;AACxE,UAAM,QAAQ,iBAAiB;AAC/B,QAAI,OAAO;AACT,mBAAa;AACb,UAAI,MAAM,GAAG;AACX,qBAAa;AAAA,MACrB;AAAA,IACK,WAAU,UAAU,KAAK,aAAa,UAAU,GAAG;AAElD,aAAO,SAAS;AAAA,IACtB,OAAW;AACL,iBAAW;AAAA,IACjB;AAAA,EACA;AACE,QAAM,SAAS,aAAa;AAC5B,SAAO,WAAW,MAAM;AAC1B;AAQA,SAAS,iBAAiB,GAAG,GAAG,UAAU;AACxC,QAAM,SAAS;AACf,QAAM,SAAS;AACf,QAAM;AAAA,IACJ,MAAM;AAAA,IACN,UAAU;AAAA,EACd,IAAM;AACJ,QAAM;AAAA,IACJ,MAAM;AAAA,IACN,UAAU;AAAA,EACd,IAAM;AACJ,QAAM,OAAO,UAAU;AACvB,MAAI,MAAM;AACR,QAAI,cAAc,WAAW;AAE3B,aAAO,SAAS,GAAG,CAAC;AAAA,IAC1B,OAAW;AACL,aAAO,YAAY,YAAY,SAAS;AAAA,IAC9C;AAAA,EACA,OAAS;AACL,WAAO,QAAQ,QAAQ,SAAS;AAAA,EACpC;AACA;AAQA,SAAS,0BAA0B,OAAO,OAAO;AAC/C,MAAI;AAAA,IACF;AAAA,EACJ,IAAM;AAGJ,UAAQ,GAAG,KAAK;AAChB,MAAI,CAAC,gBAAgB;AACnB,YAAQC,MAAc,KAAK;AAAA,EAC/B;AACE,SAAO;AACT;AAQA,SAAS,cAAc,MAAM,KAAK;AAChC,MAAI,OAAO,QAAQ,UAAU;AAC3B,UAAM,IAAI;AAAA,EACd;AACE,MAAI;AACJ,MAAI,OAAO,QAAQ,YAAY;AAC7B,YAAQ,IAAI,IAAI;AAAA,EACpB,WAAa,QAAQ,MAAM;AACvB,YAAQ;AAAA,EACZ,WAAa,OAAO,eAAe,KAAK,MAAM,GAAG,GAAG;AAChD,YAAQ,KAAK,GAAG;AAAA,EACjB,WAAU,IAAI,SAAS,GAAG,GAAG;AAE5B,WAAO,gBAAgB,KAAK,IAAI;AAAA,EACpC,OAAS;AACL,YAAQ;AAAA,EACZ;AAGE,MAAI,SAAS,MAAM;AACjB,WAAO,CAAE;AAAA,EACb;AACE,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO;AAAA,EACX;AACE,SAAO,CAAC,OAAO,KAAK,CAAC;AACvB;AASA,SAAS,gBAAgB,MAAM,MAAM;AACnC,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,MAAI,SAAS,CAAC,IAAI;AAClB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;AAC3C,UAAM,YAAY,KAAK,CAAC;AACxB,QAAI,eAAe,CAAE;AACrB,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AAC7C,YAAM,aAAa,OAAO,CAAC;AAC3B,UAAI,cAAc,KAAM;AACxB,UAAI,OAAO,eAAe,KAAK,YAAY,SAAS,GAAG;AACrD,cAAM,cAAc,WAAW,SAAS;AACxC,YAAI,eAAe,MAAM;AACvB,uBAAa,KAAK,WAAW;AAAA,QACvC;AAAA,MACA,WAAiB,cAAc,KAAK;AAE5B,uBAAe,aAAa,OAAO,UAAU;AAAA,MACrD;AAAA,IACA;AACI,aAAS;AAAA,EACb;AACE,MAAI,MAAM,QAAQ,OAAO,CAAC,CAAC,GAAG;AAG5B,UAAM,SAAS,CAAE;AACjB,WAAO,OAAO,OAAO,GAAG,MAAM;AAAA,EAClC;AAGE,SAAO;AACT;AAQA,SAAS,mBAAmB,MAAM,MAAM;AACtC,QAAM,YAAY,CAAE;AACpB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;AAC3C,UAAM,MAAM,KAAK,CAAC;AAClB,UAAM,aAAa,iBAAiB,GAAG;AACvC,UAAM,aAAa,cAAc,MAAM,GAAG;AAC1C,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,IAAI,GAAG,KAAK;AACjD,gBAAU,KAAK;AAAA,QACb,WAAW,WAAW,CAAC;AAAA,QACvB;AAAA,MACR,CAAO;AAAA,IACP;AAAA,EACA;AACE,SAAO;AACT;AACA,MAAM,uBAAuB;AAAA,EAC3B,YAAY;AAAA,EACZ,YAAY;AACd;AAMA,SAAS,iBAAiB,KAAK;AAC7B,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;AAAA,EACX;AACE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG;AAAA,EACJ;AACH;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/match-sorter/dist/match-sorter.esm.es.js

@@ -147,7 +147,6 @@ function getAcronym(string) {
 }
 function getClosenessRanking(testString, stringToRank) {
   let matchingInOrderCharCount = 0;
-  let charNumber = 0;
   function findMatchingCharacter(matchChar, string, index) {
     for (let j = index, J = string.length; j < J; j++) {
       const stringChar = string[j];
@@ -158,23 +157,30 @@ function getClosenessRanking(testString, stringToRank) {
     }
     return -1;
   }
+  let skipped = 0;
   function getRanking(spread2) {
     const spreadPercentage = 1 / spread2;
     const inOrderPercentage = matchingInOrderCharCount / stringToRank.length;
-    const ranking = rankings.MATCHES + inOrderPercentage * spreadPercentage;
+    const matchPercentage = (stringToRank.length - skipped) / stringToRank.length;
+    const ranking = rankings.MATCHES + inOrderPercentage * spreadPercentage * matchPercentage;
     return ranking;
   }
-  const firstIndex = findMatchingCharacter(stringToRank[0], testString, 0);
-  if (firstIndex < 0) {
-    return rankings.NO_MATCH;
-  }
-  charNumber = firstIndex;
-  for (let i = 1, I = stringToRank.length; i < I; i++) {
+  let firstIndex = 0;
+  let charNumber = 0;
+  let nextCharNumber = 0;
+  for (let i = 0, I = stringToRank.length; i < I; i++) {
     const matchChar = stringToRank[i];
-    charNumber = findMatchingCharacter(matchChar, testString, charNumber);
-    const found = charNumber > -1;
-    if (!found) {
+    nextCharNumber = findMatchingCharacter(matchChar, testString, charNumber);
+    const found = nextCharNumber > -1;
+    if (found) {
+      charNumber = nextCharNumber;
+      if (i === 0) {
+        firstIndex = charNumber;
+      }
+    } else if (skipped > 0 || stringToRank.length <= 3) {
       return rankings.NO_MATCH;
+    } else {
+      skipped += 1;
     }
   }
   const spread = charNumber - firstIndex;

package/dist/node_modules/match-sorter/dist/match-sorter.esm.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"match-sorter.esm.es.js","sources":["../../../../../node_modules/match-sorter/dist/match-sorter.esm.js"],"sourcesContent":["import removeAccents from 'remove-accents';\n\n/**\n * @name match-sorter\n * @license MIT license.\n * @copyright (c) 2020 Kent C. Dodds\n * @author Kent C. Dodds <me@kentcdodds.com> (https://kentcdodds.com)\n */\nconst rankings = {\n  CASE_SENSITIVE_EQUAL: 7,\n  EQUAL: 6,\n  STARTS_WITH: 5,\n  WORD_STARTS_WITH: 4,\n  CONTAINS: 3,\n  ACRONYM: 2,\n  MATCHES: 1,\n  NO_MATCH: 0\n};\nconst defaultBaseSortFn = (a, b) => String(a.rankedValue).localeCompare(String(b.rankedValue));\n\n/**\n * Takes an array of items and a value and returns a new array with the items that match the given value\n * @param {Array} items - the items to sort\n * @param {String} value - the value to use for ranking\n * @param {Object} options - Some options to configure the sorter\n * @return {Array} - the new sorted array\n */\nfunction matchSorter(items, value, options) {\n  if (options === void 0) {\n    options = {};\n  }\n  const {\n    keys,\n    threshold = rankings.MATCHES,\n    baseSort = defaultBaseSortFn,\n    sorter = matchedItems => matchedItems.sort((a, b) => sortRankedValues(a, b, baseSort))\n  } = options;\n  const matchedItems = items.reduce(reduceItemsToRanked, []);\n  return sorter(matchedItems).map(_ref => {\n    let {\n      item\n    } = _ref;\n    return item;\n  });\n  function reduceItemsToRanked(matches, item, index) {\n    const rankingInfo = getHighestRanking(item, keys, value, options);\n    const {\n      rank,\n      keyThreshold = threshold\n    } = rankingInfo;\n    if (rank >= keyThreshold) {\n      matches.push({\n        ...rankingInfo,\n        item,\n        index\n      });\n    }\n    return matches;\n  }\n}\nmatchSorter.rankings = rankings;\n\n/**\n * Gets the highest ranking for value for the given item based on its values for the given keys\n * @param {*} item - the item to rank\n * @param {Array} keys - the keys to get values from the item for the ranking\n * @param {String} value - the value to rank against\n * @param {Object} options - options to control the ranking\n * @return {{rank: Number, keyIndex: Number, keyThreshold: Number}} - the highest ranking\n */\nfunction getHighestRanking(item, keys, value, options) {\n  if (!keys) {\n    // if keys is not specified, then we assume the item given is ready to be matched\n    const stringItem = item;\n    return {\n      // ends up being duplicate of 'item' in matches but consistent\n      rankedValue: stringItem,\n      rank: getMatchRanking(stringItem, value, options),\n      keyIndex: -1,\n      keyThreshold: options.threshold\n    };\n  }\n  const valuesToRank = getAllValuesToRank(item, keys);\n  return valuesToRank.reduce((_ref2, _ref3, i) => {\n    let {\n      rank,\n      rankedValue,\n      keyIndex,\n      keyThreshold\n    } = _ref2;\n    let {\n      itemValue,\n      attributes\n    } = _ref3;\n    let newRank = getMatchRanking(itemValue, value, options);\n    let newRankedValue = rankedValue;\n    const {\n      minRanking,\n      maxRanking,\n      threshold\n    } = attributes;\n    if (newRank < minRanking && newRank >= rankings.MATCHES) {\n      newRank = minRanking;\n    } else if (newRank > maxRanking) {\n      newRank = maxRanking;\n    }\n    if (newRank > rank) {\n      rank = newRank;\n      keyIndex = i;\n      keyThreshold = threshold;\n      newRankedValue = itemValue;\n    }\n    return {\n      rankedValue: newRankedValue,\n      rank,\n      keyIndex,\n      keyThreshold\n    };\n  }, {\n    rankedValue: item,\n    rank: rankings.NO_MATCH,\n    keyIndex: -1,\n    keyThreshold: options.threshold\n  });\n}\n\n/**\n * Gives a rankings score based on how well the two strings match.\n * @param {String} testString - the string to test against\n * @param {String} stringToRank - the string to rank\n * @param {Object} options - options for the match (like keepDiacritics for comparison)\n * @returns {Number} the ranking for how well stringToRank matches testString\n */\nfunction getMatchRanking(testString, stringToRank, options) {\n  testString = prepareValueForComparison(testString, options);\n  stringToRank = prepareValueForComparison(stringToRank, options);\n\n  // too long\n  if (stringToRank.length > testString.length) {\n    return rankings.NO_MATCH;\n  }\n\n  // case sensitive equals\n  if (testString === stringToRank) {\n    return rankings.CASE_SENSITIVE_EQUAL;\n  }\n\n  // Lower casing before further comparison\n  testString = testString.toLowerCase();\n  stringToRank = stringToRank.toLowerCase();\n\n  // case insensitive equals\n  if (testString === stringToRank) {\n    return rankings.EQUAL;\n  }\n\n  // starts with\n  if (testString.startsWith(stringToRank)) {\n    return rankings.STARTS_WITH;\n  }\n\n  // word starts with\n  if (testString.includes(` ${stringToRank}`)) {\n    return rankings.WORD_STARTS_WITH;\n  }\n\n  // contains\n  if (testString.includes(stringToRank)) {\n    return rankings.CONTAINS;\n  } else if (stringToRank.length === 1) {\n    // If the only character in the given stringToRank\n    //   isn't even contained in the testString, then\n    //   it's definitely not a match.\n    return rankings.NO_MATCH;\n  }\n\n  // acronym\n  if (getAcronym(testString).includes(stringToRank)) {\n    return rankings.ACRONYM;\n  }\n\n  // will return a number between rankings.MATCHES and\n  // rankings.MATCHES + 1 depending  on how close of a match it is.\n  return getClosenessRanking(testString, stringToRank);\n}\n\n/**\n * Generates an acronym for a string.\n *\n * @param {String} string the string for which to produce the acronym\n * @returns {String} the acronym\n */\nfunction getAcronym(string) {\n  let acronym = '';\n  const wordsInString = string.split(' ');\n  wordsInString.forEach(wordInString => {\n    const splitByHyphenWords = wordInString.split('-');\n    splitByHyphenWords.forEach(splitByHyphenWord => {\n      acronym += splitByHyphenWord.substr(0, 1);\n    });\n  });\n  return acronym;\n}\n\n/**\n * Returns a score based on how spread apart the\n * characters from the stringToRank are within the testString.\n * A number close to rankings.MATCHES represents a loose match. A number close\n * to rankings.MATCHES + 1 represents a tighter match.\n * @param {String} testString - the string to test against\n * @param {String} stringToRank - the string to rank\n * @returns {Number} the number between rankings.MATCHES and\n * rankings.MATCHES + 1 for how well stringToRank matches testString\n */\nfunction getClosenessRanking(testString, stringToRank) {\n  let matchingInOrderCharCount = 0;\n  let charNumber = 0;\n  function findMatchingCharacter(matchChar, string, index) {\n    for (let j = index, J = string.length; j < J; j++) {\n      const stringChar = string[j];\n      if (stringChar === matchChar) {\n        matchingInOrderCharCount += 1;\n        return j + 1;\n      }\n    }\n    return -1;\n  }\n  function getRanking(spread) {\n    const spreadPercentage = 1 / spread;\n    const inOrderPercentage = matchingInOrderCharCount / stringToRank.length;\n    const ranking = rankings.MATCHES + inOrderPercentage * spreadPercentage;\n    return ranking;\n  }\n  const firstIndex = findMatchingCharacter(stringToRank[0], testString, 0);\n  if (firstIndex < 0) {\n    return rankings.NO_MATCH;\n  }\n  charNumber = firstIndex;\n  for (let i = 1, I = stringToRank.length; i < I; i++) {\n    const matchChar = stringToRank[i];\n    charNumber = findMatchingCharacter(matchChar, testString, charNumber);\n    const found = charNumber > -1;\n    if (!found) {\n      return rankings.NO_MATCH;\n    }\n  }\n  const spread = charNumber - firstIndex;\n  return getRanking(spread);\n}\n\n/**\n * Sorts items that have a rank, index, and keyIndex\n * @param {Object} a - the first item to sort\n * @param {Object} b - the second item to sort\n * @return {Number} -1 if a should come first, 1 if b should come first, 0 if equal\n */\nfunction sortRankedValues(a, b, baseSort) {\n  const aFirst = -1;\n  const bFirst = 1;\n  const {\n    rank: aRank,\n    keyIndex: aKeyIndex\n  } = a;\n  const {\n    rank: bRank,\n    keyIndex: bKeyIndex\n  } = b;\n  const same = aRank === bRank;\n  if (same) {\n    if (aKeyIndex === bKeyIndex) {\n      // use the base sort function as a tie-breaker\n      return baseSort(a, b);\n    } else {\n      return aKeyIndex < bKeyIndex ? aFirst : bFirst;\n    }\n  } else {\n    return aRank > bRank ? aFirst : bFirst;\n  }\n}\n\n/**\n * Prepares value for comparison by stringifying it, removing diacritics (if specified)\n * @param {String} value - the value to clean\n * @param {Object} options - {keepDiacritics: whether to remove diacritics}\n * @return {String} the prepared value\n */\nfunction prepareValueForComparison(value, _ref4) {\n  let {\n    keepDiacritics\n  } = _ref4;\n  // value might not actually be a string at this point (we don't get to choose)\n  // so part of preparing the value for comparison is ensure that it is a string\n  value = `${value}`; // toString\n  if (!keepDiacritics) {\n    value = removeAccents(value);\n  }\n  return value;\n}\n\n/**\n * Gets value for key in item at arbitrarily nested keypath\n * @param {Object} item - the item\n * @param {Object|Function} key - the potentially nested keypath or property callback\n * @return {Array} - an array containing the value(s) at the nested keypath\n */\nfunction getItemValues(item, key) {\n  if (typeof key === 'object') {\n    key = key.key;\n  }\n  let value;\n  if (typeof key === 'function') {\n    value = key(item);\n  } else if (item == null) {\n    value = null;\n  } else if (Object.hasOwnProperty.call(item, key)) {\n    value = item[key];\n  } else if (key.includes('.')) {\n    // eslint-disable-next-line @typescript-eslint/no-unsafe-call\n    return getNestedValues(key, item);\n  } else {\n    value = null;\n  }\n\n  // because `value` can also be undefined\n  if (value == null) {\n    return [];\n  }\n  if (Array.isArray(value)) {\n    return value;\n  }\n  return [String(value)];\n}\n\n/**\n * Given path: \"foo.bar.baz\"\n * And item: {foo: {bar: {baz: 'buzz'}}}\n *   -> 'buzz'\n * @param path a dot-separated set of keys\n * @param item the item to get the value from\n */\nfunction getNestedValues(path, item) {\n  const keys = path.split('.');\n  let values = [item];\n  for (let i = 0, I = keys.length; i < I; i++) {\n    const nestedKey = keys[i];\n    let nestedValues = [];\n    for (let j = 0, J = values.length; j < J; j++) {\n      const nestedItem = values[j];\n      if (nestedItem == null) continue;\n      if (Object.hasOwnProperty.call(nestedItem, nestedKey)) {\n        const nestedValue = nestedItem[nestedKey];\n        if (nestedValue != null) {\n          nestedValues.push(nestedValue);\n        }\n      } else if (nestedKey === '*') {\n        // ensure that values is an array\n        nestedValues = nestedValues.concat(nestedItem);\n      }\n    }\n    values = nestedValues;\n  }\n  if (Array.isArray(values[0])) {\n    // keep allowing the implicit wildcard for an array of strings at the end of\n    // the path; don't use `.flat()` because that's not available in node.js v10\n    const result = [];\n    return result.concat(...values);\n  }\n  // Based on our logic it should be an array of strings by now...\n  // assuming the user's path terminated in strings\n  return values;\n}\n\n/**\n * Gets all the values for the given keys in the given item and returns an array of those values\n * @param item - the item from which the values will be retrieved\n * @param keys - the keys to use to retrieve the values\n * @return objects with {itemValue, attributes}\n */\nfunction getAllValuesToRank(item, keys) {\n  const allValues = [];\n  for (let j = 0, J = keys.length; j < J; j++) {\n    const key = keys[j];\n    const attributes = getKeyAttributes(key);\n    const itemValues = getItemValues(item, key);\n    for (let i = 0, I = itemValues.length; i < I; i++) {\n      allValues.push({\n        itemValue: itemValues[i],\n        attributes\n      });\n    }\n  }\n  return allValues;\n}\nconst defaultKeyAttributes = {\n  maxRanking: Infinity,\n  minRanking: -Infinity\n};\n/**\n * Gets all the attributes for the given key\n * @param key - the key from which the attributes will be retrieved\n * @return object containing the key's attributes\n */\nfunction getKeyAttributes(key) {\n  if (typeof key === 'string') {\n    return defaultKeyAttributes;\n  }\n  return {\n    ...defaultKeyAttributes,\n    ...key\n  };\n}\n\n/*\neslint\n  no-continue: \"off\",\n*/\n\nexport { defaultBaseSortFn, matchSorter, rankings };\n"],"names":["matchedItems","spread"],"mappings":";AAEA;AAAA;AAAA;AAAA;AAAA;AAAA;AAMK,MAAC,WAAW;AAAA,EACf,sBAAsB;AAAA,EACtB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,UAAU;AAAA,EACV,SAAS;AAAA,EACT,SAAS;AAAA,EACT,UAAU;AACZ;AACK,MAAC,oBAAoB,CAAC,GAAG,MAAM,OAAO,EAAE,WAAW,EAAE,cAAc,OAAO,EAAE,WAAW,CAAC;AAS7F,SAAS,YAAY,OAAO,OAAO,SAAS;AAC1C,MAAI,YAAY,QAAQ;AACtB,cAAU,CAAE;AAAA,EAChB;AACE,QAAM;AAAA,IACJ;AAAA,IACA,YAAY,SAAS;AAAA,IACrB,WAAW;AAAA,IACX,SAAS,CAAAA,kBAAgBA,cAAa,KAAK,CAAC,GAAG,MAAM,iBAAiB,GAAG,GAAG,QAAQ,CAAC;AAAA,EACzF,IAAM;AACJ,QAAM,eAAe,MAAM,OAAO,qBAAqB,CAAA,CAAE;AACzD,SAAO,OAAO,YAAY,EAAE,IAAI,UAAQ;AACtC,QAAI;AAAA,MACF;AAAA,IACN,IAAQ;AACJ,WAAO;AAAA,EACX,CAAG;AACD,WAAS,oBAAoB,SAAS,MAAM,OAAO;AACjD,UAAM,cAAc,kBAAkB,MAAM,MAAM,OAAO,OAAO;AAChE,UAAM;AAAA,MACJ;AAAA,MACA,eAAe;AAAA,IACrB,IAAQ;AACJ,QAAI,QAAQ,cAAc;AACxB,cAAQ,KAAK;AAAA,QACX,GAAG;AAAA,QACH;AAAA,QACA;AAAA,MACR,CAAO;AAAA,IACP;AACI,WAAO;AAAA,EACX;AACA;AACA,YAAY,WAAW;AAUvB,SAAS,kBAAkB,MAAM,MAAM,OAAO,SAAS;AACrD,MAAI,CAAC,MAAM;AAET,UAAM,aAAa;AACnB,WAAO;AAAA;AAAA,MAEL,aAAa;AAAA,MACb,MAAM,gBAAgB,YAAY,OAAO,OAAO;AAAA,MAChD,UAAU;AAAA,MACV,cAAc,QAAQ;AAAA,IACvB;AAAA,EACL;AACE,QAAM,eAAe,mBAAmB,MAAM,IAAI;AAClD,SAAO,aAAa,OAAO,CAAC,OAAO,OAAO,MAAM;AAC9C,QAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI;AAAA,MACF;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI,UAAU,gBAAgB,WAAW,OAAO,OAAO;AACvD,QAAI,iBAAiB;AACrB,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI,UAAU,cAAc,WAAW,SAAS,SAAS;AACvD,gBAAU;AAAA,IAChB,WAAe,UAAU,YAAY;AAC/B,gBAAU;AAAA,IAChB;AACI,QAAI,UAAU,MAAM;AAClB,aAAO;AACP,iBAAW;AACX,qBAAe;AACf,uBAAiB;AAAA,IACvB;AACI,WAAO;AAAA,MACL,aAAa;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,IACD;AAAA,EACL,GAAK;AAAA,IACD,aAAa;AAAA,IACb,MAAM,SAAS;AAAA,IACf,UAAU;AAAA,IACV,cAAc,QAAQ;AAAA,EAC1B,CAAG;AACH;AASA,SAAS,gBAAgB,YAAY,cAAc,SAAS;AAC1D,eAAa,0BAA0B,YAAY,OAAO;AAC1D,iBAAe,0BAA0B,cAAc,OAAO;AAG9D,MAAI,aAAa,SAAS,WAAW,QAAQ;AAC3C,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,eAAe,cAAc;AAC/B,WAAO,SAAS;AAAA,EACpB;AAGE,eAAa,WAAW,YAAa;AACrC,iBAAe,aAAa,YAAa;AAGzC,MAAI,eAAe,cAAc;AAC/B,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,WAAW,YAAY,GAAG;AACvC,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,SAAS,IAAI,YAAY,EAAE,GAAG;AAC3C,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,SAAS,YAAY,GAAG;AACrC,WAAO,SAAS;AAAA,EACpB,WAAa,aAAa,WAAW,GAAG;AAIpC,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,UAAU,EAAE,SAAS,YAAY,GAAG;AACjD,WAAO,SAAS;AAAA,EACpB;AAIE,SAAO,oBAAoB,YAAY,YAAY;AACrD;AAQA,SAAS,WAAW,QAAQ;AAC1B,MAAI,UAAU;AACd,QAAM,gBAAgB,OAAO,MAAM,GAAG;AACtC,gBAAc,QAAQ,kBAAgB;AACpC,UAAM,qBAAqB,aAAa,MAAM,GAAG;AACjD,uBAAmB,QAAQ,uBAAqB;AAC9C,iBAAW,kBAAkB,OAAO,GAAG,CAAC;AAAA,IAC9C,CAAK;AAAA,EACL,CAAG;AACD,SAAO;AACT;AAYA,SAAS,oBAAoB,YAAY,cAAc;AACrD,MAAI,2BAA2B;AAC/B,MAAI,aAAa;AACjB,WAAS,sBAAsB,WAAW,QAAQ,OAAO;AACvD,aAAS,IAAI,OAAO,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AACjD,YAAM,aAAa,OAAO,CAAC;AAC3B,UAAI,eAAe,WAAW;AAC5B,oCAA4B;AAC5B,eAAO,IAAI;AAAA,MACnB;AAAA,IACA;AACI,WAAO;AAAA,EACX;AACE,WAAS,WAAWC,SAAQ;AAC1B,UAAM,mBAAmB,IAAIA;AAC7B,UAAM,oBAAoB,2BAA2B,aAAa;AAClE,UAAM,UAAU,SAAS,UAAU,oBAAoB;AACvD,WAAO;AAAA,EACX;AACE,QAAM,aAAa,sBAAsB,aAAa,CAAC,GAAG,YAAY,CAAC;AACvE,MAAI,aAAa,GAAG;AAClB,WAAO,SAAS;AAAA,EACpB;AACE,eAAa;AACb,WAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,IAAI,GAAG,KAAK;AACnD,UAAM,YAAY,aAAa,CAAC;AAChC,iBAAa,sBAAsB,WAAW,YAAY,UAAU;AACpE,UAAM,QAAQ,aAAa;AAC3B,QAAI,CAAC,OAAO;AACV,aAAO,SAAS;AAAA,IACtB;AAAA,EACA;AACE,QAAM,SAAS,aAAa;AAC5B,SAAO,WAAW,MAAM;AAC1B;AAQA,SAAS,iBAAiB,GAAG,GAAG,UAAU;AACxC,QAAM,SAAS;AACf,QAAM,SAAS;AACf,QAAM;AAAA,IACJ,MAAM;AAAA,IACN,UAAU;AAAA,EACd,IAAM;AACJ,QAAM;AAAA,IACJ,MAAM;AAAA,IACN,UAAU;AAAA,EACd,IAAM;AACJ,QAAM,OAAO,UAAU;AACvB,MAAI,MAAM;AACR,QAAI,cAAc,WAAW;AAE3B,aAAO,SAAS,GAAG,CAAC;AAAA,IAC1B,OAAW;AACL,aAAO,YAAY,YAAY,SAAS;AAAA,IAC9C;AAAA,EACA,OAAS;AACL,WAAO,QAAQ,QAAQ,SAAS;AAAA,EACpC;AACA;AAQA,SAAS,0BAA0B,OAAO,OAAO;AAC/C,MAAI;AAAA,IACF;AAAA,EACJ,IAAM;AAGJ,UAAQ,GAAG,KAAK;AAChB,MAAI,CAAC,gBAAgB;AACnB,YAAQ,cAAc,KAAK;AAAA,EAC/B;AACE,SAAO;AACT;AAQA,SAAS,cAAc,MAAM,KAAK;AAChC,MAAI,OAAO,QAAQ,UAAU;AAC3B,UAAM,IAAI;AAAA,EACd;AACE,MAAI;AACJ,MAAI,OAAO,QAAQ,YAAY;AAC7B,YAAQ,IAAI,IAAI;AAAA,EACpB,WAAa,QAAQ,MAAM;AACvB,YAAQ;AAAA,EACZ,WAAa,OAAO,eAAe,KAAK,MAAM,GAAG,GAAG;AAChD,YAAQ,KAAK,GAAG;AAAA,EACjB,WAAU,IAAI,SAAS,GAAG,GAAG;AAE5B,WAAO,gBAAgB,KAAK,IAAI;AAAA,EACpC,OAAS;AACL,YAAQ;AAAA,EACZ;AAGE,MAAI,SAAS,MAAM;AACjB,WAAO,CAAE;AAAA,EACb;AACE,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO;AAAA,EACX;AACE,SAAO,CAAC,OAAO,KAAK,CAAC;AACvB;AASA,SAAS,gBAAgB,MAAM,MAAM;AACnC,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,MAAI,SAAS,CAAC,IAAI;AAClB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;AAC3C,UAAM,YAAY,KAAK,CAAC;AACxB,QAAI,eAAe,CAAE;AACrB,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AAC7C,YAAM,aAAa,OAAO,CAAC;AAC3B,UAAI,cAAc,KAAM;AACxB,UAAI,OAAO,eAAe,KAAK,YAAY,SAAS,GAAG;AACrD,cAAM,cAAc,WAAW,SAAS;AACxC,YAAI,eAAe,MAAM;AACvB,uBAAa,KAAK,WAAW;AAAA,QACvC;AAAA,MACA,WAAiB,cAAc,KAAK;AAE5B,uBAAe,aAAa,OAAO,UAAU;AAAA,MACrD;AAAA,IACA;AACI,aAAS;AAAA,EACb;AACE,MAAI,MAAM,QAAQ,OAAO,CAAC,CAAC,GAAG;AAG5B,UAAM,SAAS,CAAE;AACjB,WAAO,OAAO,OAAO,GAAG,MAAM;AAAA,EAClC;AAGE,SAAO;AACT;AAQA,SAAS,mBAAmB,MAAM,MAAM;AACtC,QAAM,YAAY,CAAE;AACpB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;AAC3C,UAAM,MAAM,KAAK,CAAC;AAClB,UAAM,aAAa,iBAAiB,GAAG;AACvC,UAAM,aAAa,cAAc,MAAM,GAAG;AAC1C,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,IAAI,GAAG,KAAK;AACjD,gBAAU,KAAK;AAAA,QACb,WAAW,WAAW,CAAC;AAAA,QACvB;AAAA,MACR,CAAO;AAAA,IACP;AAAA,EACA;AACE,SAAO;AACT;AACA,MAAM,uBAAuB;AAAA,EAC3B,YAAY;AAAA,EACZ,YAAY;AACd;AAMA,SAAS,iBAAiB,KAAK;AAC7B,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;AAAA,EACX;AACE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG;AAAA,EACJ;AACH;","x_google_ignoreList":[0]}
+{"version":3,"file":"match-sorter.esm.es.js","sources":["../../../../../node_modules/match-sorter/dist/match-sorter.esm.js"],"sourcesContent":["import removeAccents from 'remove-accents';\n\n/**\n * @name match-sorter\n * @license MIT license.\n * @copyright (c) 2020 Kent C. Dodds\n * @author Kent C. Dodds <me@kentcdodds.com> (https://kentcdodds.com)\n */\nconst rankings = {\n  CASE_SENSITIVE_EQUAL: 7,\n  EQUAL: 6,\n  STARTS_WITH: 5,\n  WORD_STARTS_WITH: 4,\n  CONTAINS: 3,\n  ACRONYM: 2,\n  MATCHES: 1,\n  NO_MATCH: 0\n};\nconst defaultBaseSortFn = (a, b) => String(a.rankedValue).localeCompare(String(b.rankedValue));\n\n/**\n * Takes an array of items and a value and returns a new array with the items that match the given value\n * @param {Array} items - the items to sort\n * @param {String} value - the value to use for ranking\n * @param {Object} options - Some options to configure the sorter\n * @return {Array} - the new sorted array\n */\nfunction matchSorter(items, value, options) {\n  if (options === void 0) {\n    options = {};\n  }\n  const {\n    keys,\n    threshold = rankings.MATCHES,\n    baseSort = defaultBaseSortFn,\n    sorter = matchedItems => matchedItems.sort((a, b) => sortRankedValues(a, b, baseSort))\n  } = options;\n  const matchedItems = items.reduce(reduceItemsToRanked, []);\n  return sorter(matchedItems).map(_ref => {\n    let {\n      item\n    } = _ref;\n    return item;\n  });\n  function reduceItemsToRanked(matches, item, index) {\n    const rankingInfo = getHighestRanking(item, keys, value, options);\n    const {\n      rank,\n      keyThreshold = threshold\n    } = rankingInfo;\n    if (rank >= keyThreshold) {\n      matches.push({\n        ...rankingInfo,\n        item,\n        index\n      });\n    }\n    return matches;\n  }\n}\nmatchSorter.rankings = rankings;\n\n/**\n * Gets the highest ranking for value for the given item based on its values for the given keys\n * @param {*} item - the item to rank\n * @param {Array} keys - the keys to get values from the item for the ranking\n * @param {String} value - the value to rank against\n * @param {Object} options - options to control the ranking\n * @return {{rank: Number, keyIndex: Number, keyThreshold: Number}} - the highest ranking\n */\nfunction getHighestRanking(item, keys, value, options) {\n  if (!keys) {\n    // if keys is not specified, then we assume the item given is ready to be matched\n    const stringItem = item;\n    return {\n      // ends up being duplicate of 'item' in matches but consistent\n      rankedValue: stringItem,\n      rank: getMatchRanking(stringItem, value, options),\n      keyIndex: -1,\n      keyThreshold: options.threshold\n    };\n  }\n  const valuesToRank = getAllValuesToRank(item, keys);\n  return valuesToRank.reduce((_ref2, _ref3, i) => {\n    let {\n      rank,\n      rankedValue,\n      keyIndex,\n      keyThreshold\n    } = _ref2;\n    let {\n      itemValue,\n      attributes\n    } = _ref3;\n    let newRank = getMatchRanking(itemValue, value, options);\n    let newRankedValue = rankedValue;\n    const {\n      minRanking,\n      maxRanking,\n      threshold\n    } = attributes;\n    if (newRank < minRanking && newRank >= rankings.MATCHES) {\n      newRank = minRanking;\n    } else if (newRank > maxRanking) {\n      newRank = maxRanking;\n    }\n    if (newRank > rank) {\n      rank = newRank;\n      keyIndex = i;\n      keyThreshold = threshold;\n      newRankedValue = itemValue;\n    }\n    return {\n      rankedValue: newRankedValue,\n      rank,\n      keyIndex,\n      keyThreshold\n    };\n  }, {\n    rankedValue: item,\n    rank: rankings.NO_MATCH,\n    keyIndex: -1,\n    keyThreshold: options.threshold\n  });\n}\n\n/**\n * Gives a rankings score based on how well the two strings match.\n * @param {String} testString - the string to test against\n * @param {String} stringToRank - the string to rank\n * @param {Object} options - options for the match (like keepDiacritics for comparison)\n * @returns {Number} the ranking for how well stringToRank matches testString\n */\nfunction getMatchRanking(testString, stringToRank, options) {\n  testString = prepareValueForComparison(testString, options);\n  stringToRank = prepareValueForComparison(stringToRank, options);\n\n  // too long\n  if (stringToRank.length > testString.length) {\n    return rankings.NO_MATCH;\n  }\n\n  // case sensitive equals\n  if (testString === stringToRank) {\n    return rankings.CASE_SENSITIVE_EQUAL;\n  }\n\n  // Lower casing before further comparison\n  testString = testString.toLowerCase();\n  stringToRank = stringToRank.toLowerCase();\n\n  // case insensitive equals\n  if (testString === stringToRank) {\n    return rankings.EQUAL;\n  }\n\n  // starts with\n  if (testString.startsWith(stringToRank)) {\n    return rankings.STARTS_WITH;\n  }\n\n  // word starts with\n  if (testString.includes(` ${stringToRank}`)) {\n    return rankings.WORD_STARTS_WITH;\n  }\n\n  // contains\n  if (testString.includes(stringToRank)) {\n    return rankings.CONTAINS;\n  } else if (stringToRank.length === 1) {\n    // If the only character in the given stringToRank\n    //   isn't even contained in the testString, then\n    //   it's definitely not a match.\n    return rankings.NO_MATCH;\n  }\n\n  // acronym\n  if (getAcronym(testString).includes(stringToRank)) {\n    return rankings.ACRONYM;\n  }\n\n  // will return a number between rankings.MATCHES and\n  // rankings.MATCHES + 1 depending  on how close of a match it is.\n  return getClosenessRanking(testString, stringToRank);\n}\n\n/**\n * Generates an acronym for a string.\n *\n * @param {String} string the string for which to produce the acronym\n * @returns {String} the acronym\n */\nfunction getAcronym(string) {\n  let acronym = '';\n  const wordsInString = string.split(' ');\n  wordsInString.forEach(wordInString => {\n    const splitByHyphenWords = wordInString.split('-');\n    splitByHyphenWords.forEach(splitByHyphenWord => {\n      acronym += splitByHyphenWord.substr(0, 1);\n    });\n  });\n  return acronym;\n}\n\n/**\n * Returns a score based on how spread apart the\n * characters from the stringToRank are within the testString.\n * A number close to rankings.MATCHES represents a loose match. A number close\n * to rankings.MATCHES + 1 represents a tighter match.\n * @param {String} testString - the string to test against\n * @param {String} stringToRank - the string to rank\n * @returns {Number} the number between rankings.MATCHES and\n * rankings.MATCHES + 1 for how well stringToRank matches testString\n */\nfunction getClosenessRanking(testString, stringToRank) {\n  let matchingInOrderCharCount = 0;\n  function findMatchingCharacter(matchChar, string, index) {\n    for (let j = index, J = string.length; j < J; j++) {\n      const stringChar = string[j];\n      if (stringChar === matchChar) {\n        matchingInOrderCharCount += 1;\n        return j + 1;\n      }\n    }\n    return -1;\n  }\n  let skipped = 0;\n  function getRanking(spread) {\n    const spreadPercentage = 1 / spread;\n    const inOrderPercentage = matchingInOrderCharCount / stringToRank.length;\n    const matchPercentage = (stringToRank.length - skipped) / stringToRank.length;\n    const ranking = rankings.MATCHES + inOrderPercentage * spreadPercentage * matchPercentage;\n    return ranking;\n  }\n  let firstIndex = 0;\n  let charNumber = 0;\n  let nextCharNumber = 0;\n  for (let i = 0, I = stringToRank.length; i < I; i++) {\n    const matchChar = stringToRank[i];\n    nextCharNumber = findMatchingCharacter(matchChar, testString, charNumber);\n    const found = nextCharNumber > -1;\n    if (found) {\n      charNumber = nextCharNumber;\n      if (i === 0) {\n        firstIndex = charNumber;\n      }\n    } else if (skipped > 0 || stringToRank.length <= 3) {\n      // if search term is short, require finding all characters\n      return rankings.NO_MATCH;\n    } else {\n      skipped += 1;\n    }\n  }\n  const spread = charNumber - firstIndex;\n  return getRanking(spread);\n}\n\n/**\n * Sorts items that have a rank, index, and keyIndex\n * @param {Object} a - the first item to sort\n * @param {Object} b - the second item to sort\n * @return {Number} -1 if a should come first, 1 if b should come first, 0 if equal\n */\nfunction sortRankedValues(a, b, baseSort) {\n  const aFirst = -1;\n  const bFirst = 1;\n  const {\n    rank: aRank,\n    keyIndex: aKeyIndex\n  } = a;\n  const {\n    rank: bRank,\n    keyIndex: bKeyIndex\n  } = b;\n  const same = aRank === bRank;\n  if (same) {\n    if (aKeyIndex === bKeyIndex) {\n      // use the base sort function as a tie-breaker\n      return baseSort(a, b);\n    } else {\n      return aKeyIndex < bKeyIndex ? aFirst : bFirst;\n    }\n  } else {\n    return aRank > bRank ? aFirst : bFirst;\n  }\n}\n\n/**\n * Prepares value for comparison by stringifying it, removing diacritics (if specified)\n * @param {String} value - the value to clean\n * @param {Object} options - {keepDiacritics: whether to remove diacritics}\n * @return {String} the prepared value\n */\nfunction prepareValueForComparison(value, _ref4) {\n  let {\n    keepDiacritics\n  } = _ref4;\n  // value might not actually be a string at this point (we don't get to choose)\n  // so part of preparing the value for comparison is ensure that it is a string\n  value = `${value}`; // toString\n  if (!keepDiacritics) {\n    value = removeAccents(value);\n  }\n  return value;\n}\n\n/**\n * Gets value for key in item at arbitrarily nested keypath\n * @param {Object} item - the item\n * @param {Object|Function} key - the potentially nested keypath or property callback\n * @return {Array} - an array containing the value(s) at the nested keypath\n */\nfunction getItemValues(item, key) {\n  if (typeof key === 'object') {\n    key = key.key;\n  }\n  let value;\n  if (typeof key === 'function') {\n    value = key(item);\n  } else if (item == null) {\n    value = null;\n  } else if (Object.hasOwnProperty.call(item, key)) {\n    value = item[key];\n  } else if (key.includes('.')) {\n    // eslint-disable-next-line @typescript-eslint/no-unsafe-call\n    return getNestedValues(key, item);\n  } else {\n    value = null;\n  }\n\n  // because `value` can also be undefined\n  if (value == null) {\n    return [];\n  }\n  if (Array.isArray(value)) {\n    return value;\n  }\n  return [String(value)];\n}\n\n/**\n * Given path: \"foo.bar.baz\"\n * And item: {foo: {bar: {baz: 'buzz'}}}\n *   -> 'buzz'\n * @param path a dot-separated set of keys\n * @param item the item to get the value from\n */\nfunction getNestedValues(path, item) {\n  const keys = path.split('.');\n  let values = [item];\n  for (let i = 0, I = keys.length; i < I; i++) {\n    const nestedKey = keys[i];\n    let nestedValues = [];\n    for (let j = 0, J = values.length; j < J; j++) {\n      const nestedItem = values[j];\n      if (nestedItem == null) continue;\n      if (Object.hasOwnProperty.call(nestedItem, nestedKey)) {\n        const nestedValue = nestedItem[nestedKey];\n        if (nestedValue != null) {\n          nestedValues.push(nestedValue);\n        }\n      } else if (nestedKey === '*') {\n        // ensure that values is an array\n        nestedValues = nestedValues.concat(nestedItem);\n      }\n    }\n    values = nestedValues;\n  }\n  if (Array.isArray(values[0])) {\n    // keep allowing the implicit wildcard for an array of strings at the end of\n    // the path; don't use `.flat()` because that's not available in node.js v10\n    const result = [];\n    return result.concat(...values);\n  }\n  // Based on our logic it should be an array of strings by now...\n  // assuming the user's path terminated in strings\n  return values;\n}\n\n/**\n * Gets all the values for the given keys in the given item and returns an array of those values\n * @param item - the item from which the values will be retrieved\n * @param keys - the keys to use to retrieve the values\n * @return objects with {itemValue, attributes}\n */\nfunction getAllValuesToRank(item, keys) {\n  const allValues = [];\n  for (let j = 0, J = keys.length; j < J; j++) {\n    const key = keys[j];\n    const attributes = getKeyAttributes(key);\n    const itemValues = getItemValues(item, key);\n    for (let i = 0, I = itemValues.length; i < I; i++) {\n      allValues.push({\n        itemValue: itemValues[i],\n        attributes\n      });\n    }\n  }\n  return allValues;\n}\nconst defaultKeyAttributes = {\n  maxRanking: Infinity,\n  minRanking: -Infinity\n};\n/**\n * Gets all the attributes for the given key\n * @param key - the key from which the attributes will be retrieved\n * @return object containing the key's attributes\n */\nfunction getKeyAttributes(key) {\n  if (typeof key === 'string') {\n    return defaultKeyAttributes;\n  }\n  return {\n    ...defaultKeyAttributes,\n    ...key\n  };\n}\n\n/*\neslint\n  no-continue: \"off\",\n*/\n\nexport { defaultBaseSortFn, matchSorter, rankings };\n"],"names":["matchedItems","spread"],"mappings":";AAEA;AAAA;AAAA;AAAA;AAAA;AAAA;AAMK,MAAC,WAAW;AAAA,EACf,sBAAsB;AAAA,EACtB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,UAAU;AAAA,EACV,SAAS;AAAA,EACT,SAAS;AAAA,EACT,UAAU;AACZ;AACK,MAAC,oBAAoB,CAAC,GAAG,MAAM,OAAO,EAAE,WAAW,EAAE,cAAc,OAAO,EAAE,WAAW,CAAC;AAS7F,SAAS,YAAY,OAAO,OAAO,SAAS;AAC1C,MAAI,YAAY,QAAQ;AACtB,cAAU,CAAE;AAAA,EAChB;AACE,QAAM;AAAA,IACJ;AAAA,IACA,YAAY,SAAS;AAAA,IACrB,WAAW;AAAA,IACX,SAAS,CAAAA,kBAAgBA,cAAa,KAAK,CAAC,GAAG,MAAM,iBAAiB,GAAG,GAAG,QAAQ,CAAC;AAAA,EACzF,IAAM;AACJ,QAAM,eAAe,MAAM,OAAO,qBAAqB,CAAA,CAAE;AACzD,SAAO,OAAO,YAAY,EAAE,IAAI,UAAQ;AACtC,QAAI;AAAA,MACF;AAAA,IACN,IAAQ;AACJ,WAAO;AAAA,EACX,CAAG;AACD,WAAS,oBAAoB,SAAS,MAAM,OAAO;AACjD,UAAM,cAAc,kBAAkB,MAAM,MAAM,OAAO,OAAO;AAChE,UAAM;AAAA,MACJ;AAAA,MACA,eAAe;AAAA,IACrB,IAAQ;AACJ,QAAI,QAAQ,cAAc;AACxB,cAAQ,KAAK;AAAA,QACX,GAAG;AAAA,QACH;AAAA,QACA;AAAA,MACR,CAAO;AAAA,IACP;AACI,WAAO;AAAA,EACX;AACA;AACA,YAAY,WAAW;AAUvB,SAAS,kBAAkB,MAAM,MAAM,OAAO,SAAS;AACrD,MAAI,CAAC,MAAM;AAET,UAAM,aAAa;AACnB,WAAO;AAAA;AAAA,MAEL,aAAa;AAAA,MACb,MAAM,gBAAgB,YAAY,OAAO,OAAO;AAAA,MAChD,UAAU;AAAA,MACV,cAAc,QAAQ;AAAA,IACvB;AAAA,EACL;AACE,QAAM,eAAe,mBAAmB,MAAM,IAAI;AAClD,SAAO,aAAa,OAAO,CAAC,OAAO,OAAO,MAAM;AAC9C,QAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI;AAAA,MACF;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI,UAAU,gBAAgB,WAAW,OAAO,OAAO;AACvD,QAAI,iBAAiB;AACrB,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,IACN,IAAQ;AACJ,QAAI,UAAU,cAAc,WAAW,SAAS,SAAS;AACvD,gBAAU;AAAA,IAChB,WAAe,UAAU,YAAY;AAC/B,gBAAU;AAAA,IAChB;AACI,QAAI,UAAU,MAAM;AAClB,aAAO;AACP,iBAAW;AACX,qBAAe;AACf,uBAAiB;AAAA,IACvB;AACI,WAAO;AAAA,MACL,aAAa;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,IACD;AAAA,EACL,GAAK;AAAA,IACD,aAAa;AAAA,IACb,MAAM,SAAS;AAAA,IACf,UAAU;AAAA,IACV,cAAc,QAAQ;AAAA,EAC1B,CAAG;AACH;AASA,SAAS,gBAAgB,YAAY,cAAc,SAAS;AAC1D,eAAa,0BAA0B,YAAY,OAAO;AAC1D,iBAAe,0BAA0B,cAAc,OAAO;AAG9D,MAAI,aAAa,SAAS,WAAW,QAAQ;AAC3C,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,eAAe,cAAc;AAC/B,WAAO,SAAS;AAAA,EACpB;AAGE,eAAa,WAAW,YAAa;AACrC,iBAAe,aAAa,YAAa;AAGzC,MAAI,eAAe,cAAc;AAC/B,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,WAAW,YAAY,GAAG;AACvC,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,SAAS,IAAI,YAAY,EAAE,GAAG;AAC3C,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,SAAS,YAAY,GAAG;AACrC,WAAO,SAAS;AAAA,EACpB,WAAa,aAAa,WAAW,GAAG;AAIpC,WAAO,SAAS;AAAA,EACpB;AAGE,MAAI,WAAW,UAAU,EAAE,SAAS,YAAY,GAAG;AACjD,WAAO,SAAS;AAAA,EACpB;AAIE,SAAO,oBAAoB,YAAY,YAAY;AACrD;AAQA,SAAS,WAAW,QAAQ;AAC1B,MAAI,UAAU;AACd,QAAM,gBAAgB,OAAO,MAAM,GAAG;AACtC,gBAAc,QAAQ,kBAAgB;AACpC,UAAM,qBAAqB,aAAa,MAAM,GAAG;AACjD,uBAAmB,QAAQ,uBAAqB;AAC9C,iBAAW,kBAAkB,OAAO,GAAG,CAAC;AAAA,IAC9C,CAAK;AAAA,EACL,CAAG;AACD,SAAO;AACT;AAYA,SAAS,oBAAoB,YAAY,cAAc;AACrD,MAAI,2BAA2B;AAC/B,WAAS,sBAAsB,WAAW,QAAQ,OAAO;AACvD,aAAS,IAAI,OAAO,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AACjD,YAAM,aAAa,OAAO,CAAC;AAC3B,UAAI,eAAe,WAAW;AAC5B,oCAA4B;AAC5B,eAAO,IAAI;AAAA,MACnB;AAAA,IACA;AACI,WAAO;AAAA,EACX;AACE,MAAI,UAAU;AACd,WAAS,WAAWC,SAAQ;AAC1B,UAAM,mBAAmB,IAAIA;AAC7B,UAAM,oBAAoB,2BAA2B,aAAa;AAClE,UAAM,mBAAmB,aAAa,SAAS,WAAW,aAAa;AACvE,UAAM,UAAU,SAAS,UAAU,oBAAoB,mBAAmB;AAC1E,WAAO;AAAA,EACX;AACE,MAAI,aAAa;AACjB,MAAI,aAAa;AACjB,MAAI,iBAAiB;AACrB,WAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,IAAI,GAAG,KAAK;AACnD,UAAM,YAAY,aAAa,CAAC;AAChC,qBAAiB,sBAAsB,WAAW,YAAY,UAAU;AACxE,UAAM,QAAQ,iBAAiB;AAC/B,QAAI,OAAO;AACT,mBAAa;AACb,UAAI,MAAM,GAAG;AACX,qBAAa;AAAA,MACrB;AAAA,IACK,WAAU,UAAU,KAAK,aAAa,UAAU,GAAG;AAElD,aAAO,SAAS;AAAA,IACtB,OAAW;AACL,iBAAW;AAAA,IACjB;AAAA,EACA;AACE,QAAM,SAAS,aAAa;AAC5B,SAAO,WAAW,MAAM;AAC1B;AAQA,SAAS,iBAAiB,GAAG,GAAG,UAAU;AACxC,QAAM,SAAS;AACf,QAAM,SAAS;AACf,QAAM;AAAA,IACJ,MAAM;AAAA,IACN,UAAU;AAAA,EACd,IAAM;AACJ,QAAM;AAAA,IACJ,MAAM;AAAA,IACN,UAAU;AAAA,EACd,IAAM;AACJ,QAAM,OAAO,UAAU;AACvB,MAAI,MAAM;AACR,QAAI,cAAc,WAAW;AAE3B,aAAO,SAAS,GAAG,CAAC;AAAA,IAC1B,OAAW;AACL,aAAO,YAAY,YAAY,SAAS;AAAA,IAC9C;AAAA,EACA,OAAS;AACL,WAAO,QAAQ,QAAQ,SAAS;AAAA,EACpC;AACA;AAQA,SAAS,0BAA0B,OAAO,OAAO;AAC/C,MAAI;AAAA,IACF;AAAA,EACJ,IAAM;AAGJ,UAAQ,GAAG,KAAK;AAChB,MAAI,CAAC,gBAAgB;AACnB,YAAQ,cAAc,KAAK;AAAA,EAC/B;AACE,SAAO;AACT;AAQA,SAAS,cAAc,MAAM,KAAK;AAChC,MAAI,OAAO,QAAQ,UAAU;AAC3B,UAAM,IAAI;AAAA,EACd;AACE,MAAI;AACJ,MAAI,OAAO,QAAQ,YAAY;AAC7B,YAAQ,IAAI,IAAI;AAAA,EACpB,WAAa,QAAQ,MAAM;AACvB,YAAQ;AAAA,EACZ,WAAa,OAAO,eAAe,KAAK,MAAM,GAAG,GAAG;AAChD,YAAQ,KAAK,GAAG;AAAA,EACjB,WAAU,IAAI,SAAS,GAAG,GAAG;AAE5B,WAAO,gBAAgB,KAAK,IAAI;AAAA,EACpC,OAAS;AACL,YAAQ;AAAA,EACZ;AAGE,MAAI,SAAS,MAAM;AACjB,WAAO,CAAE;AAAA,EACb;AACE,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO;AAAA,EACX;AACE,SAAO,CAAC,OAAO,KAAK,CAAC;AACvB;AASA,SAAS,gBAAgB,MAAM,MAAM;AACnC,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,MAAI,SAAS,CAAC,IAAI;AAClB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;AAC3C,UAAM,YAAY,KAAK,CAAC;AACxB,QAAI,eAAe,CAAE;AACrB,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AAC7C,YAAM,aAAa,OAAO,CAAC;AAC3B,UAAI,cAAc,KAAM;AACxB,UAAI,OAAO,eAAe,KAAK,YAAY,SAAS,GAAG;AACrD,cAAM,cAAc,WAAW,SAAS;AACxC,YAAI,eAAe,MAAM;AACvB,uBAAa,KAAK,WAAW;AAAA,QACvC;AAAA,MACA,WAAiB,cAAc,KAAK;AAE5B,uBAAe,aAAa,OAAO,UAAU;AAAA,MACrD;AAAA,IACA;AACI,aAAS;AAAA,EACb;AACE,MAAI,MAAM,QAAQ,OAAO,CAAC,CAAC,GAAG;AAG5B,UAAM,SAAS,CAAE;AACjB,WAAO,OAAO,OAAO,GAAG,MAAM;AAAA,EAClC;AAGE,SAAO;AACT;AAQA,SAAS,mBAAmB,MAAM,MAAM;AACtC,QAAM,YAAY,CAAE;AACpB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;AAC3C,UAAM,MAAM,KAAK,CAAC;AAClB,UAAM,aAAa,iBAAiB,GAAG;AACvC,UAAM,aAAa,cAAc,MAAM,GAAG;AAC1C,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,IAAI,GAAG,KAAK;AACjD,gBAAU,KAAK;AAAA,QACb,WAAW,WAAW,CAAC;AAAA,QACvB;AAAA,MACR,CAAO;AAAA,IACP;AAAA,EACA;AACE,SAAO;AACT;AACA,MAAM,uBAAuB;AAAA,EAC3B,YAAY;AAAA,EACZ,YAAY;AACd;AAMA,SAAS,iBAAiB,KAAK;AAC7B,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;AAAA,EACX;AACE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG;AAAA,EACJ;AACH;","x_google_ignoreList":[0]}