Homec4science
Diffusion Open Access Compliance Check Tool (OACCT) (issn4frontend) Browse

rOACCT/node_modules/match-sorter/dist/match-sorter.umd.min.js.map
49c99f97fe9aissn4frontend

Last Change
Raw File

match-sorter.umd.min.js.map
View Options

{
"version": 3,
"file": "match-sorter.umd.min.js",
"sources": [
"../node_modules/@babel/runtime/helpers/esm/extends.js",
"../node_modules/remove-accents/index.js",
"../src/index.ts"
],
"sourcesContent": [
"export default function _extends() {\n _extends = Object.assign || function (target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i];\n\n for (var key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n\n return target;\n };\n\n return _extends.apply(this, arguments);\n}",
"var characterMap = {\r\n\t\"\u00c0\": \"A\",\r\n\t\"\u00c1\": \"A\",\r\n\t\"\u00c2\": \"A\",\r\n\t\"\u00c3\": \"A\",\r\n\t\"\u00c4\": \"A\",\r\n\t\"\u00c5\": \"A\",\r\n\t\"\u1ea4\": \"A\",\r\n\t\"\u1eae\": \"A\",\r\n\t\"\u1eb2\": \"A\",\r\n\t\"\u1eb4\": \"A\",\r\n\t\"\u1eb6\": \"A\",\r\n\t\"\u00c6\": \"AE\",\r\n\t\"\u1ea6\": \"A\",\r\n\t\"\u1eb0\": \"A\",\r\n\t\"\u0202\": \"A\",\r\n\t\"\u00c7\": \"C\",\r\n\t\"\u1e08\": \"C\",\r\n\t\"\u00c8\": \"E\",\r\n\t\"\u00c9\": \"E\",\r\n\t\"\u00ca\": \"E\",\r\n\t\"\u00cb\": \"E\",\r\n\t\"\u1ebe\": \"E\",\r\n\t\"\u1e16\": \"E\",\r\n\t\"\u1ec0\": \"E\",\r\n\t\"\u1e14\": \"E\",\r\n\t\"\u1e1c\": \"E\",\r\n\t\"\u0206\": \"E\",\r\n\t\"\u00cc\": \"I\",\r\n\t\"\u00cd\": \"I\",\r\n\t\"\u00ce\": \"I\",\r\n\t\"\u00cf\": \"I\",\r\n\t\"\u1e2e\": \"I\",\r\n\t\"\u020a\": \"I\",\r\n\t\"\u00d0\": \"D\",\r\n\t\"\u00d1\": \"N\",\r\n\t\"\u00d2\": \"O\",\r\n\t\"\u00d3\": \"O\",\r\n\t\"\u00d4\": \"O\",\r\n\t\"\u00d5\": \"O\",\r\n\t\"\u00d6\": \"O\",\r\n\t\"\u00d8\": \"O\",\r\n\t\"\u1ed0\": \"O\",\r\n\t\"\u1e4c\": \"O\",\r\n\t\"\u1e52\": \"O\",\r\n\t\"\u020e\": \"O\",\r\n\t\"\u00d9\": \"U\",\r\n\t\"\u00da\": \"U\",\r\n\t\"\u00db\": \"U\",\r\n\t\"\u00dc\": \"U\",\r\n\t\"\u00dd\": \"Y\",\r\n\t\"\u00e0\": \"a\",\r\n\t\"\u00e1\": \"a\",\r\n\t\"\u00e2\": \"a\",\r\n\t\"\u00e3\": \"a\",\r\n\t\"\u00e4\": \"a\",\r\n\t\"\u00e5\": \"a\",\r\n\t\"\u1ea5\": \"a\",\r\n\t\"\u1eaf\": \"a\",\r\n\t\"\u1eb3\": \"a\",\r\n\t\"\u1eb5\": \"a\",\r\n\t\"\u1eb7\": \"a\",\r\n\t\"\u00e6\": \"ae\",\r\n\t\"\u1ea7\": \"a\",\r\n\t\"\u1eb1\": \"a\",\r\n\t\"\u0203\": \"a\",\r\n\t\"\u00e7\": \"c\",\r\n\t\"\u1e09\": \"c\",\r\n\t\"\u00e8\": \"e\",\r\n\t\"\u00e9\": \"e\",\r\n\t\"\u00ea\": \"e\",\r\n\t\"\u00eb\": \"e\",\r\n\t\"\u1ebf\": \"e\",\r\n\t\"\u1e17\": \"e\",\r\n\t\"\u1ec1\": \"e\",\r\n\t\"\u1e15\": \"e\",\r\n\t\"\u1e1d\": \"e\",\r\n\t\"\u0207\": \"e\",\r\n\t\"\u00ec\": \"i\",\r\n\t\"\u00ed\": \"i\",\r\n\t\"\u00ee\": \"i\",\r\n\t\"\u00ef\": \"i\",\r\n\t\"\u1e2f\": \"i\",\r\n\t\"\u020b\": \"i\",\r\n\t\"\u00f0\": \"d\",\r\n\t\"\u00f1\": \"n\",\r\n\t\"\u00f2\": \"o\",\r\n\t\"\u00f3\": \"o\",\r\n\t\"\u00f4\": \"o\",\r\n\t\"\u00f5\": \"o\",\r\n\t\"\u00f6\": \"o\",\r\n\t\"\u00f8\": \"o\",\r\n\t\"\u1ed1\": \"o\",\r\n\t\"\u1e4d\": \"o\",\r\n\t\"\u1e53\": \"o\",\r\n\t\"\u020f\": \"o\",\r\n\t\"\u00f9\": \"u\",\r\n\t\"\u00fa\": \"u\",\r\n\t\"\u00fb\": \"u\",\r\n\t\"\u00fc\": \"u\",\r\n\t\"\u00fd\": \"y\",\r\n\t\"\u00ff\": \"y\",\r\n\t\"\u0100\": \"A\",\r\n\t\"\u0101\": \"a\",\r\n\t\"\u0102\": \"A\",\r\n\t\"\u0103\": \"a\",\r\n\t\"\u0104\": \"A\",\r\n\t\"\u0105\": \"a\",\r\n\t\"\u0106\": \"C\",\r\n\t\"\u0107\": \"c\",\r\n\t\"\u0108\": \"C\",\r\n\t\"\u0109\": \"c\",\r\n\t\"\u010a\": \"C\",\r\n\t\"\u010b\": \"c\",\r\n\t\"\u010c\": \"C\",\r\n\t\"\u010d\": \"c\",\r\n\t\"C\u0306\": \"C\",\r\n\t\"c\u0306\": \"c\",\r\n\t\"\u010e\": \"D\",\r\n\t\"\u010f\": \"d\",\r\n\t\"\u0110\": \"D\",\r\n\t\"\u0111\": \"d\",\r\n\t\"\u0112\": \"E\",\r\n\t\"\u0113\": \"e\",\r\n\t\"\u0114\": \"E\",\r\n\t\"\u0115\": \"e\",\r\n\t\"\u0116\": \"E\",\r\n\t\"\u0117\": \"e\",\r\n\t\"\u0118\": \"E\",\r\n\t\"\u0119\": \"e\",\r\n\t\"\u011a\": \"E\",\r\n\t\"\u011b\": \"e\",\r\n\t\"\u011c\": \"G\",\r\n\t\"\u01f4\": \"G\",\r\n\t\"\u011d\": \"g\",\r\n\t\"\u01f5\": \"g\",\r\n\t\"\u011e\": \"G\",\r\n\t\"\u011f\": \"g\",\r\n\t\"\u0120\": \"G\",\r\n\t\"\u0121\": \"g\",\r\n\t\"\u0122\": \"G\",\r\n\t\"\u0123\": \"g\",\r\n\t\"\u0124\": \"H\",\r\n\t\"\u0125\": \"h\",\r\n\t\"\u0126\": \"H\",\r\n\t\"\u0127\": \"h\",\r\n\t\"\u1e2a\": \"H\",\r\n\t\"\u1e2b\": \"h\",\r\n\t\"\u0128\": \"I\",\r\n\t\"\u0129\": \"i\",\r\n\t\"\u012a\": \"I\",\r\n\t\"\u012b\": \"i\",\r\n\t\"\u012c\": \"I\",\r\n\t\"\u012d\": \"i\",\r\n\t\"\u012e\": \"I\",\r\n\t\"\u012f\": \"i\",\r\n\t\"\u0130\": \"I\",\r\n\t\"\u0131\": \"i\",\r\n\t\"\u0132\": \"IJ\",\r\n\t\"\u0133\": \"ij\",\r\n\t\"\u0134\": \"J\",\r\n\t\"\u0135\": \"j\",\r\n\t\"\u0136\": \"K\",\r\n\t\"\u0137\": \"k\",\r\n\t\"\u1e30\": \"K\",\r\n\t\"\u1e31\": \"k\",\r\n\t\"K\u0306\": \"K\",\r\n\t\"k\u0306\": \"k\",\r\n\t\"\u0139\": \"L\",\r\n\t\"\u013a\": \"l\",\r\n\t\"\u013b\": \"L\",\r\n\t\"\u013c\": \"l\",\r\n\t\"\u013d\": \"L\",\r\n\t\"\u013e\": \"l\",\r\n\t\"\u013f\": \"L\",\r\n\t\"\u0140\": \"l\",\r\n\t\"\u0141\": \"l\",\r\n\t\"\u0142\": \"l\",\r\n\t\"\u1e3e\": \"M\",\r\n\t\"\u1e3f\": \"m\",\r\n\t\"M\u0306\": \"M\",\r\n\t\"m\u0306\": \"m\",\r\n\t\"\u0143\": \"N\",\r\n\t\"\u0144\": \"n\",\r\n\t\"\u0145\": \"N\",\r\n\t\"\u0146\": \"n\",\r\n\t\"\u0147\": \"N\",\r\n\t\"\u0148\": \"n\",\r\n\t\"\u0149\": \"n\",\r\n\t\"N\u0306\": \"N\",\r\n\t\"n\u0306\": \"n\",\r\n\t\"\u014c\": \"O\",\r\n\t\"\u014d\": \"o\",\r\n\t\"\u014e\": \"O\",\r\n\t\"\u014f\": \"o\",\r\n\t\"\u0150\": \"O\",\r\n\t\"\u0151\": \"o\",\r\n\t\"\u0152\": \"OE\",\r\n\t\"\u0153\": \"oe\",\r\n\t\"P\u0306\": \"P\",\r\n\t\"p\u0306\": \"p\",\r\n\t\"\u0154\": \"R\",\r\n\t\"\u0155\": \"r\",\r\n\t\"\u0156\": \"R\",\r\n\t\"\u0157\": \"r\",\r\n\t\"\u0158\": \"R\",\r\n\t\"\u0159\": \"r\",\r\n\t\"R\u0306\": \"R\",\r\n\t\"r\u0306\": \"r\",\r\n\t\"\u0212\": \"R\",\r\n\t\"\u0213\": \"r\",\r\n\t\"\u015a\": \"S\",\r\n\t\"\u015b\": \"s\",\r\n\t\"\u015c\": \"S\",\r\n\t\"\u015d\": \"s\",\r\n\t\"\u015e\": \"S\",\r\n\t\"\u0218\": \"S\",\r\n\t\"\u0219\": \"s\",\r\n\t\"\u015f\": \"s\",\r\n\t\"\u0160\": \"S\",\r\n\t\"\u0161\": \"s\",\r\n\t\"\u0162\": \"T\",\r\n\t\"\u0163\": \"t\",\r\n\t\"\u021b\": \"t\",\r\n\t\"\u021a\": \"T\",\r\n\t\"\u0164\": \"T\",\r\n\t\"\u0165\": \"t\",\r\n\t\"\u0166\": \"T\",\r\n\t\"\u0167\": \"t\",\r\n\t\"T\u0306\": \"T\",\r\n\t\"t\u0306\": \"t\",\r\n\t\"\u0168\": \"U\",\r\n\t\"\u0169\": \"u\",\r\n\t\"\u016a\": \"U\",\r\n\t\"\u016b\": \"u\",\r\n\t\"\u016c\": \"U\",\r\n\t\"\u016d\": \"u\",\r\n\t\"\u016e\": \"U\",\r\n\t\"\u016f\": \"u\",\r\n\t\"\u0170\": \"U\",\r\n\t\"\u0171\": \"u\",\r\n\t\"\u0172\": \"U\",\r\n\t\"\u0173\": \"u\",\r\n\t\"\u0216\": \"U\",\r\n\t\"\u0217\": \"u\",\r\n\t\"V\u0306\": \"V\",\r\n\t\"v\u0306\": \"v\",\r\n\t\"\u0174\": \"W\",\r\n\t\"\u0175\": \"w\",\r\n\t\"\u1e82\": \"W\",\r\n\t\"\u1e83\": \"w\",\r\n\t\"X\u0306\": \"X\",\r\n\t\"x\u0306\": \"x\",\r\n\t\"\u0176\": \"Y\",\r\n\t\"\u0177\": \"y\",\r\n\t\"\u0178\": \"Y\",\r\n\t\"Y\u0306\": \"Y\",\r\n\t\"y\u0306\": \"y\",\r\n\t\"\u0179\": \"Z\",\r\n\t\"\u017a\": \"z\",\r\n\t\"\u017b\": \"Z\",\r\n\t\"\u017c\": \"z\",\r\n\t\"\u017d\": \"Z\",\r\n\t\"\u017e\": \"z\",\r\n\t\"\u017f\": \"s\",\r\n\t\"\u0192\": \"f\",\r\n\t\"\u01a0\": \"O\",\r\n\t\"\u01a1\": \"o\",\r\n\t\"\u01af\": \"U\",\r\n\t\"\u01b0\": \"u\",\r\n\t\"\u01cd\": \"A\",\r\n\t\"\u01ce\": \"a\",\r\n\t\"\u01cf\": \"I\",\r\n\t\"\u01d0\": \"i\",\r\n\t\"\u01d1\": \"O\",\r\n\t\"\u01d2\": \"o\",\r\n\t\"\u01d3\": \"U\",\r\n\t\"\u01d4\": \"u\",\r\n\t\"\u01d5\": \"U\",\r\n\t\"\u01d6\": \"u\",\r\n\t\"\u01d7\": \"U\",\r\n\t\"\u01d8\": \"u\",\r\n\t\"\u01d9\": \"U\",\r\n\t\"\u01da\": \"u\",\r\n\t\"\u01db\": \"U\",\r\n\t\"\u01dc\": \"u\",\r\n\t\"\u1ee8\": \"U\",\r\n\t\"\u1ee9\": \"u\",\r\n\t\"\u1e78\": \"U\",\r\n\t\"\u1e79\": \"u\",\r\n\t\"\u01fa\": \"A\",\r\n\t\"\u01fb\": \"a\",\r\n\t\"\u01fc\": \"AE\",\r\n\t\"\u01fd\": \"ae\",\r\n\t\"\u01fe\": \"O\",\r\n\t\"\u01ff\": \"o\",\r\n\t\"\u00de\": \"TH\",\r\n\t\"\u00fe\": \"th\",\r\n\t\"\u1e54\": \"P\",\r\n\t\"\u1e55\": \"p\",\r\n\t\"\u1e64\": \"S\",\r\n\t\"\u1e65\": \"s\",\r\n\t\"X\u0301\": \"X\",\r\n\t\"x\u0301\": \"x\",\r\n\t\"\u0403\": \"\u0413\",\r\n\t\"\u0453\": \"\u0433\",\r\n\t\"\u040c\": \"\u041a\",\r\n\t\"\u045c\": \"\u043a\",\r\n\t\"A\u030b\": \"A\",\r\n\t\"a\u030b\": \"a\",\r\n\t\"E\u030b\": \"E\",\r\n\t\"e\u030b\": \"e\",\r\n\t\"I\u030b\": \"I\",\r\n\t\"i\u030b\": \"i\",\r\n\t\"\u01f8\": \"N\",\r\n\t\"\u01f9\": \"n\",\r\n\t\"\u1ed2\": \"O\",\r\n\t\"\u1ed3\": \"o\",\r\n\t\"\u1e50\": \"O\",\r\n\t\"\u1e51\": \"o\",\r\n\t\"\u1eea\": \"U\",\r\n\t\"\u1eeb\": \"u\",\r\n\t\"\u1e80\": \"W\",\r\n\t\"\u1e81\": \"w\",\r\n\t\"\u1ef2\": \"Y\",\r\n\t\"\u1ef3\": \"y\",\r\n\t\"\u0200\": \"A\",\r\n\t\"\u0201\": \"a\",\r\n\t\"\u0204\": \"E\",\r\n\t\"\u0205\": \"e\",\r\n\t\"\u0208\": \"I\",\r\n\t\"\u0209\": \"i\",\r\n\t\"\u020c\": \"O\",\r\n\t\"\u020d\": \"o\",\r\n\t\"\u0210\": \"R\",\r\n\t\"\u0211\": \"r\",\r\n\t\"\u0214\": \"U\",\r\n\t\"\u0215\": \"u\",\r\n\t\"B\u030c\": \"B\",\r\n\t\"b\u030c\": \"b\",\r\n\t\"\u010c\u0323\": \"C\",\r\n\t\"\u010d\u0323\": \"c\",\r\n\t\"\u00ca\u030c\": \"E\",\r\n\t\"\u00ea\u030c\": \"e\",\r\n\t\"F\u030c\": \"F\",\r\n\t\"f\u030c\": \"f\",\r\n\t\"\u01e6\": \"G\",\r\n\t\"\u01e7\": \"g\",\r\n\t\"\u021e\": \"H\",\r\n\t\"\u021f\": \"h\",\r\n\t\"J\u030c\": \"J\",\r\n\t\"\u01f0\": \"j\",\r\n\t\"\u01e8\": \"K\",\r\n\t\"\u01e9\": \"k\",\r\n\t\"M\u030c\": \"M\",\r\n\t\"m\u030c\": \"m\",\r\n\t\"P\u030c\": \"P\",\r\n\t\"p\u030c\": \"p\",\r\n\t\"Q\u030c\": \"Q\",\r\n\t\"q\u030c\": \"q\",\r\n\t\"\u0158\u0329\": \"R\",\r\n\t\"\u0159\u0329\": \"r\",\r\n\t\"\u1e66\": \"S\",\r\n\t\"\u1e67\": \"s\",\r\n\t\"V\u030c\": \"V\",\r\n\t\"v\u030c\": \"v\",\r\n\t\"W\u030c\": \"W\",\r\n\t\"w\u030c\": \"w\",\r\n\t\"X\u030c\": \"X\",\r\n\t\"x\u030c\": \"x\",\r\n\t\"Y\u030c\": \"Y\",\r\n\t\"y\u030c\": \"y\",\r\n\t\"A\u0327\": \"A\",\r\n\t\"a\u0327\": \"a\",\r\n\t\"B\u0327\": \"B\",\r\n\t\"b\u0327\": \"b\",\r\n\t\"\u1e10\": \"D\",\r\n\t\"\u1e11\": \"d\",\r\n\t\"\u0228\": \"E\",\r\n\t\"\u0229\": \"e\",\r\n\t\"\u0190\u0327\": \"E\",\r\n\t\"\u025b\u0327\": \"e\",\r\n\t\"\u1e28\": \"H\",\r\n\t\"\u1e29\": \"h\",\r\n\t\"I\u0327\": \"I\",\r\n\t\"i\u0327\": \"i\",\r\n\t\"\u0197\u0327\": \"I\",\r\n\t\"\u0268\u0327\": \"i\",\r\n\t\"M\u0327\": \"M\",\r\n\t\"m\u0327\": \"m\",\r\n\t\"O\u0327\": \"O\",\r\n\t\"o\u0327\": \"o\",\r\n\t\"Q\u0327\": \"Q\",\r\n\t\"q\u0327\": \"q\",\r\n\t\"U\u0327\": \"U\",\r\n\t\"u\u0327\": \"u\",\r\n\t\"X\u0327\": \"X\",\r\n\t\"x\u0327\": \"x\",\r\n\t\"Z\u0327\": \"Z\",\r\n\t\"z\u0327\": \"z\",\r\n};\r\n\r\nvar chars = Object.keys(characterMap).join('|');\r\nvar allAccents = new RegExp(chars, 'g');\r\nvar firstAccent = new RegExp(chars, '');\r\n\r\nvar removeAccents = function(string) {\t\r\n\treturn string.replace(allAccents, function(match) {\r\n\t\treturn characterMap[match];\r\n\t});\r\n};\r\n\r\nvar hasAccents = function(string) {\r\n\treturn !!string.match(firstAccent);\r\n};\r\n\r\nmodule.exports = removeAccents;\r\nmodule.exports.has = hasAccents;\r\nmodule.exports.remove = removeAccents;\r\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 */\nimport removeAccents from 'remove-accents'\n\ntype KeyAttributes = {\n threshold?: Ranking\n maxRanking: Ranking\n minRanking: Ranking\n}\ninterface RankingInfo {\n rankedValue: string\n rank: Ranking\n keyIndex: number\n keyThreshold: Ranking | undefined\n}\n\ninterface ValueGetterKey<ItemType> {\n (item: ItemType): string | Array<string>\n}\ninterface IndexedItem<ItemType> {\n item: ItemType\n index: number\n}\ninterface RankedItem<ItemType> extends RankingInfo, IndexedItem<ItemType> {}\n\ninterface BaseSorter<ItemType> {\n (a: RankedItem<ItemType>, b: RankedItem<ItemType>): number\n}\n\ninterface Sorter<ItemType> {\n (matchItems: Array<RankedItem<ItemType>>): Array<RankedItem<ItemType>>\n}\n\ninterface KeyAttributesOptions<ItemType> {\n key?: string | ValueGetterKey<ItemType>\n threshold?: Ranking\n maxRanking?: Ranking\n minRanking?: Ranking\n}\n\ntype KeyOption<ItemType> =\n | KeyAttributesOptions<ItemType>\n | ValueGetterKey<ItemType>\n | string\n\ninterface MatchSorterOptions<ItemType = unknown> {\n keys?: ReadonlyArray<KeyOption<ItemType>>\n threshold?: Ranking\n baseSort?: BaseSorter<ItemType>\n keepDiacritics?: boolean\n sorter?: Sorter<ItemType>\n}\ntype IndexableByString = Record<string, unknown>\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} as const\n\ntype Ranking = typeof rankings[keyof typeof rankings]\n\nmatchSorter.rankings = rankings\n\nconst defaultBaseSortFn: BaseSorter<unknown> = (a, b) =>\n 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<ItemType = string>(\n items: ReadonlyArray<ItemType>,\n value: string,\n options: MatchSorterOptions<ItemType> = {},\n): Array<ItemType> {\n const {\n keys,\n threshold = rankings.MATCHES,\n baseSort = defaultBaseSortFn,\n sorter = matchedItems =>\n matchedItems.sort((a, b) => sortRankedValues(a, b, baseSort)),\n } = options\n const matchedItems = items.reduce(reduceItemsToRanked, [])\n return sorter(matchedItems).map(({item}) => item)\n\n function reduceItemsToRanked(\n matches: Array<RankedItem<ItemType>>,\n item: ItemType,\n index: number,\n ): Array<RankedItem<ItemType>> {\n const rankingInfo = getHighestRanking(item, keys, value, options)\n const {rank, keyThreshold = threshold} = rankingInfo\n if (rank >= keyThreshold) {\n matches.push({...rankingInfo, item, index})\n }\n return matches\n }\n}\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<ItemType>(\n item: ItemType,\n keys: ReadonlyArray<KeyOption<ItemType>> | undefined,\n value: string,\n options: MatchSorterOptions<ItemType>,\n): RankingInfo {\n if (!keys) {\n // if keys is not specified, then we assume the item given is ready to be matched\n const stringItem = (item as unknown) as string\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(\n (\n {rank, rankedValue, keyIndex, keyThreshold},\n {itemValue, attributes},\n i,\n ) => {\n let newRank = getMatchRanking(itemValue, value, options)\n let newRankedValue = rankedValue\n const {minRanking, maxRanking, threshold} = 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 {rankedValue: newRankedValue, rank, keyIndex, keyThreshold}\n },\n {\n rankedValue: (item as unknown) as string,\n rank: rankings.NO_MATCH as Ranking,\n keyIndex: -1,\n keyThreshold: options.threshold,\n },\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<ItemType>(\n testString: string,\n stringToRank: string,\n options: MatchSorterOptions<ItemType>,\n): Ranking {\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: string): 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(\n testString: string,\n stringToRank: string,\n): Ranking {\n let matchingInOrderCharCount = 0\n let charNumber = 0\n function findMatchingCharacter(\n matchChar: string,\n string: string,\n index: number,\n ) {\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: number) {\n const spreadPercentage = 1 / spread\n const inOrderPercentage = matchingInOrderCharCount / stringToRank.length\n const ranking = rankings.MATCHES + inOrderPercentage * spreadPercentage\n return ranking as 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\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<ItemType>(\n a: RankedItem<ItemType>,\n b: RankedItem<ItemType>,\n baseSort: BaseSorter<ItemType>,\n): number {\n const aFirst = -1\n const bFirst = 1\n const {rank: aRank, keyIndex: aKeyIndex} = a\n const {rank: bRank, keyIndex: bKeyIndex} = 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<ItemType>(\n value: string,\n {keepDiacritics}: MatchSorterOptions<ItemType>,\n): string {\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<ItemType>(\n item: ItemType,\n key: KeyOption<ItemType>,\n): Array<string> {\n if (typeof key === 'object') {\n key = key.key as string\n }\n let value: string | Array<string> | null | unknown\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 as IndexableByString)[key]\n } else if (key.includes('.')) {\n // eslint-disable-next-line @typescript-eslint/no-unsafe-call\n return getNestedValues<ItemType>(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<ItemType>(\n path: string,\n item: ItemType,\n): Array<string> {\n const keys = path.split('.')\n\n type ValueA = Array<ItemType | IndexableByString | string>\n let values: ValueA = [item]\n\n for (let i = 0, I = keys.length; i < I; i++) {\n const nestedKey = keys[i]\n let nestedValues: ValueA = []\n\n for (let j = 0, J = values.length; j < J; j++) {\n const nestedItem = values[j]\n\n if (nestedItem == null) continue\n\n if (Object.hasOwnProperty.call(nestedItem, nestedKey)) {\n const nestedValue = (nestedItem as IndexableByString)[nestedKey]\n if (nestedValue != null) {\n nestedValues.push(nestedValue as IndexableByString | string)\n }\n } else if (nestedKey === '*') {\n // ensure that values is an array\n nestedValues = nestedValues.concat(nestedItem)\n }\n }\n\n values = nestedValues\n }\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: Array<string> = []\n return result.concat(...(values as Array<string>))\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 as Array<string>\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<ItemType>(\n item: ItemType,\n keys: ReadonlyArray<KeyOption<ItemType>>,\n) {\n const allValues: Array<{itemValue: string; attributes: KeyAttributes}> = []\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}\n\nconst defaultKeyAttributes = {\n maxRanking: Infinity as Ranking,\n minRanking: -Infinity as Ranking,\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<ItemType>(key: KeyOption<ItemType>): KeyAttributes {\n if (typeof key === 'string') {\n return defaultKeyAttributes\n }\n return {...defaultKeyAttributes, ...key}\n}\n\nexport {matchSorter, rankings, defaultBaseSortFn}\n\nexport type {\n MatchSorterOptions,\n KeyAttributesOptions,\n KeyOption,\n KeyAttributes,\n RankingInfo,\n ValueGetterKey,\n}\n\n/*\neslint\n no-continue: \"off\",\n*/\n"
],
"names": [
"_extends",
"Object",
"assign",
"target",
"i",
"arguments",
"length",
"source",
"key",
"prototype",
"hasOwnProperty",
"call",
"apply",
"this",
"characterMap",
"chars",
"keys",
"join",
"allAccents",
"RegExp",
"firstAccent",
"removeAccents",
"string",
"replace",
"match",
"rankings",
"CASE_SENSITIVE_EQUAL",
"EQUAL",
"STARTS_WITH",
"WORD_STARTS_WITH",
"CONTAINS",
"ACRONYM",
"MATCHES",
"NO_MATCH",
"matchSorter",
"defaultBaseSortFn",
"a",
"b",
"String",
"rankedValue",
"localeCompare",
"items",
"value",
"options",
"threshold",
"baseSort",
"sorter",
"matchedItems",
"sort",
"aFirst",
"bFirst",
"aRank",
"rank",
"aKeyIndex",
"keyIndex",
"bRank",
"bKeyIndex",
"sortRankedValues",
"reduce",
"matches",
"item",
"index",
"rankingInfo",
"getMatchRanking",
"keyThreshold",
"allValues",
"j",
"J",
"attributes",
"getKeyAttributes",
"itemValues",
"getItemValues",
"I",
"push",
"itemValue",
"getAllValuesToRank",
"newRank",
"newRankedValue",
"minRanking",
"maxRanking",
"getHighestRanking",
"map",
"testString",
"stringToRank",
"prepareValueForComparison",
"toLowerCase",
"startsWith",
"includes",
"acronym",
"split",
"forEach",
"wordInString",
"splitByHyphenWord",
"substr",
"matchingInOrderCharCount",
"charNumber",
"findMatchingCharacter",
"matchChar",
"getRanking",
"spread",
"inOrderPercentage",
"firstIndex",
"getClosenessRanking",
"keepDiacritics",
"path",
"values",
"nestedKey",
"nestedValues",
"nestedItem",
"nestedValue",
"concat",
"Array",
"isArray",
"result",
"getNestedValues",
"defaultKeyAttributes",
"Infinity"
],
"mappings": "mPAAe,SAASA,WACtBA,EAAWC,OAAOC,QAAU,SAAUC,OAC/B,IAAIC,EAAI,EAAGA,EAAIC,UAAUC,OAAQF,IAAK,KACrCG,EAASF,UAAUD,OAElB,IAAII,KAAOD,EACVN,OAAOQ,UAAUC,eAAeC,KAAKJ,EAAQC,KAC/CL,EAAOK,GAAOD,EAAOC,WAKpBL,GAGFH,EAASY,MAAMC,KAAMR,WCf9B,IAAIS,EAAe,KACb,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,SACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,SACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,SACC,SACA,QACD,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,SACA,SACA,QACA,QACA,QACA,QACA,QACA,SACC,SACA,QACD,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,SACC,SACA,QACD,QACA,QACA,QACA,QACA,QACA,QACA,SACC,SACA,QACD,QACA,QACA,QACA,QACA,QACA,QACA,SACA,UACC,SACA,QACD,QACA,QACA,QACA,QACA,QACA,SACC,SACA,QACD,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,SACC,SACA,QACD,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,SACC,SACA,QACD,QACA,QACA,QACA,SACC,SACA,QACD,QACA,QACA,SACC,SACA,QACD,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,SACA,SACA,QACA,QACA,SACA,SACA,QACA,QACA,QACA,SACC,SACA,QACD,QACA,QACA,QACA,SACC,SACA,SACA,SACA,SACA,SACA,QACD,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,SACC,SACA,SACA,SACA,SACA,SACA,SACA,SACA,QACD,QACA,QACA,QACA,SACC,QACD,QACA,QACA,SACC,SACA,SACA,SACA,SACA,SACA,SACA,SACA,QACD,QACA,SACC,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,QACD,QACA,QACA,QACA,SACC,SACA,QACD,QACA,SACC,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,KAGHC,EAAQd,OAAOe,KAAKF,GAAcG,KAAK,KACvCC,EAAa,IAAIC,OAAOJ,EAAO,KAC/BK,EAAc,IAAID,OAAOJ,EAAO,IAEhCM,EAAgB,SAASC,UACrBA,EAAOC,QAAQL,GAAY,SAASM,UACnCV,EAAaU,SAQLH,IAJA,SAASC,WAChBA,EAAOE,MAAMJ,MAKCC,yBCxWlBI,EAAW,CACfC,qBAAsB,EACtBC,MAAO,EACPC,YAAa,EACbC,iBAAkB,EAClBC,SAAU,EACVC,QAAS,EACTC,QAAS,EACTC,SAAU,GAKZC,EAAYT,SAAWA,MAEjBU,EAAyC,SAACC,EAAGC,UACjDC,OAAOF,EAAEG,aAAaC,cAAcF,OAAOD,EAAEE,eAS/C,SAASL,EACPO,EACAC,EACAC,YAAAA,IAAAA,EAAwC,UAQpCA,EALF3B,IAAAA,SACA4B,UAAAA,aAAYnB,EAASO,cACrBa,SAAAA,aAAWV,QACXW,OAAAA,aAAS,SAAAC,UACPA,EAAaC,MAAK,SAACZ,EAAGC,UA0N5B,SACED,EACAC,EACAQ,OAEMI,GAAU,EACVC,EAAS,EACFC,EAA8Bf,EAApCgB,KAAuBC,EAAajB,EAAvBkB,SACPC,EAA8BlB,EAApCe,KAAuBI,EAAanB,EAAvBiB,gBACPH,IAAUI,EAEjBF,IAAcG,EAETX,EAAST,EAAGC,GAEZgB,EAAYG,EAAYP,EAASC,EAGnCC,EAAQI,EAAQN,EAASC,EA5OFO,CAAiBrB,EAAGC,EAAGQ,SAEjDE,EAAeN,EAAMiB,iBAIzBC,EACAC,EACAC,OAEMC,EAiBV,SACEF,EACA5C,EACA0B,EACAC,OAEK3B,EAAM,OAGF,CAELuB,YAHkBqB,EAIlBR,KAAMW,EAJYH,EAIgBlB,EAAOC,GACzCW,UAAW,EACXU,aAAcrB,EAAQC,kBAuT5B,SACEgB,EACA5C,WAEMiD,EAAmE,GAChEC,EAAI,EAAGC,EAAInD,EAAKV,OAAQ4D,EAAIC,EAAGD,YAChC1D,EAAMQ,EAAKkD,GACXE,EAAaC,EAAiB7D,GAC9B8D,EAAaC,EAAcX,EAAMpD,GAC9BJ,EAAI,EAAGoE,EAAIF,EAAWhE,OAAQF,EAAIoE,EAAGpE,IAC5C6D,EAAUQ,KAAK,CACbC,UAAWJ,EAAWlE,GACtBgE,WAAAA,WAICH,EApUcU,CAAmBf,EAAM5C,GAC1B0C,QAClB,aAGEtD,OAFCgD,IAAAA,KAAMb,IAAAA,YAAae,IAAAA,SAAUU,IAAAA,aAC7BU,IAAAA,UAAWN,IAAAA,WAGRQ,EAAUb,EAAgBW,EAAWhC,EAAOC,GAC5CkC,EAAiBtC,EACduC,EAAqCV,EAArCU,WAAYC,EAAyBX,EAAzBW,WAAYnC,EAAawB,EAAbxB,iBAC3BgC,EAAUE,GAAcF,GAAWnD,EAASO,QAC9C4C,EAAUE,EACDF,EAAUG,IACnBH,EAAUG,GAERH,EAAUxB,IACZA,EAAOwB,EACPtB,EAAWlD,EACX4D,EAAepB,EACfiC,EAAiBH,GAEZ,CAACnC,YAAasC,EAAgBzB,KAAAA,EAAME,SAAAA,EAAUU,aAAAA,KAEvD,CACEzB,YAAcqB,EACdR,KAAM3B,EAASQ,SACfqB,UAAW,EACXU,aAAcrB,EAAQC,YA7DJoC,CAAkBpB,EAAM5C,EAAM0B,EAAOC,GAClDS,EAAkCU,EAAlCV,OAAkCU,EAA5BE,aACTZ,eADwBR,MAE1Be,EAAQc,UAASX,GAAaF,KAAAA,EAAMC,MAAAA,YAE/BF,IAb8C,WAChDb,EAAOC,GAAckC,KAAI,qBAAErB,QAgFpC,SAASG,EACPmB,EACAC,EACAxC,UAEAuC,EAAaE,EAA0BF,EAAYvC,IACnDwC,EAAeC,EAA0BD,EAAcxC,IAGtCrC,OAAS4E,EAAW5E,OAC5BmB,EAASQ,SAIdiD,IAAeC,EACV1D,EAASC,sBAIlBwD,EAAaA,EAAWG,kBACxBF,EAAeA,EAAaE,eAInB5D,EAASE,MAIduD,EAAWI,WAAWH,GACjB1D,EAASG,YAIdsD,EAAWK,aAAaJ,GACnB1D,EAASI,iBAIdqD,EAAWK,SAASJ,GACf1D,EAASK,SACiB,IAAxBqD,EAAa7E,OAIfmB,EAASQ,UAmBAX,EAfH4D,EAgBXM,EAAU,GACQlE,EAAOmE,MAAM,KACrBC,SAAQ,SAAAC,GACOA,EAAaF,MAAM,KAC3BC,SAAQ,SAAAE,GACzBJ,GAAWI,EAAkBC,OAAO,EAAG,SAGpCL,GAxBoBD,SAASJ,GAC3B1D,EAASM,QAoCpB,SACEmD,EACAC,OAEIW,EAA2B,EAC3BC,EAAa,WACRC,EACPC,EACA3E,EACAuC,OAEK,IAAIK,EAAIL,EAAOM,EAAI7C,EAAOhB,OAAQ4D,EAAIC,EAAGD,IAAK,IAC9B5C,EAAO4C,KACP+B,SACjBH,GAA4B,EACrB5B,EAAI,SAGP,WAEDgC,EAAWC,OAEZC,EAAoBN,EAA2BX,EAAa7E,cAClDmB,EAASO,QAAUoE,GAFV,EAAID,OAKzBE,EAAaL,EAAsBb,EAAa,GAAID,EAAY,MAClEmB,EAAa,SACR5E,EAASQ,SAElB8D,EAAaM,MACR,IAAIjG,EAAI,EAAGoE,EAAIW,EAAa7E,OAAQF,EAAIoE,EAAGpE,IAAK,OAEnD2F,EAAaC,EADKb,EAAa/E,GACe8E,EAAYa,KAC9B,UAEnBtE,EAASQ,gBAKbiE,EADQH,EAAaM,GAvErBC,CAAoBpB,EAAYC,GASzC,IAAoB7D,EACdkE,EAmGN,SAASJ,EACP1C,YAKAA,KAAWA,IAJV6D,iBAMC7D,EAAQrB,EAAcqB,IAEjBA,EAST,SAAS6B,EACPX,EACApD,OAKIkC,KAHe,iBAARlC,IACTA,EAAMA,EAAIA,KAGO,mBAARA,EACTkC,EAAQlC,EAAIoD,QACP,GAAY,MAARA,EACTlB,EAAQ,UACH,GAAIzC,OAAOS,eAAeC,KAAKiD,EAAMpD,GAC1CkC,EAASkB,EAA2BpD,OAC/B,CAAA,GAAIA,EAAI+E,SAAS,YAwB1B,SACEiB,EACA5C,WAEM5C,EAAOwF,EAAKf,MAAM,KAGpBgB,EAAiB,CAAC7C,GAEbxD,EAAI,EAAGoE,EAAIxD,EAAKV,OAAQF,EAAIoE,EAAGpE,IAAK,SACrCsG,EAAY1F,EAAKZ,GACnBuG,EAAuB,GAElBzC,EAAI,EAAGC,EAAIsC,EAAOnG,OAAQ4D,EAAIC,EAAGD,IAAK,KACvC0C,EAAaH,EAAOvC,MAER,MAAd0C,KAEA3G,OAAOS,eAAeC,KAAKiG,EAAYF,GAAY,KAC/CG,EAAeD,EAAiCF,GACnC,MAAfG,GACFF,EAAalC,KAAKoC,OAEG,MAAdH,IAETC,EAAeA,EAAaG,OAAOF,IAIvCH,EAASE,KAGPI,MAAMC,QAAQP,EAAO,IAAK,KAGtBQ,EAAwB,UACvBA,EAAOH,aAAPG,EAAkBR,UAIpBA,EA9DES,CAA0B1G,EAAKoD,GAEtClB,EAAQ,YAIG,MAATA,EACK,GAELqE,MAAMC,QAAQtE,GACTA,EAEF,CAACJ,OAAOI,IA8EjB,IAAMyE,EAAuB,CAC3BpC,WAAYqC,EAAAA,EACZtC,YAAasC,EAAAA,GAOf,SAAS/C,EAA2B7D,SACf,iBAARA,EACF2G,OAEEA,EAAyB3G"
}
c4science · Help