@stryke/helpers 0.10.12 → 0.10.13

package/dist/match-sorter.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"match-sorter.mjs","names":["defaultBaseSortFn: BaseSorter<unknown>","value: string | Array<string> | null | unknown","values: ValueA","nestedValues: ValueA","allValues: Array<{ itemValue: string; attributes: KeyAttributes }>"],"sources":["../src/match-sorter.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nimport { removeAccents } from \"./remove-accents\";\n\n/**\n * Forked from match-sorter by Kent C. Dodds\n */\n\ninterface 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\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 items - the items to sort\n * @param value - the value to use for ranking\n * @param options - Some options to configure the sorter\n * @returns - 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(\n    (ret: Array<RankedItem<ItemType>>, item: ItemType, index: number) =>\n      reduceItemsToRanked(ret, item, index),\n    []\n  );\n\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({\n        ...rankingInfo,\n        item,\n        index\n      });\n    }\n    return matches;\n  }\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 keys - the keys to get values from the item for the ranking\n * @param value - the value to rank against\n * @param options - options to control the ranking\n * @returns 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\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\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 as 0;\n        keyIndex = i;\n        keyThreshold = threshold;\n        newRankedValue = itemValue;\n      }\n      return {\n        rankedValue: newRankedValue,\n        rank,\n        keyIndex,\n        keyThreshold\n      };\n    },\n    {\n      rankedValue: item as unknown as string,\n      rank: rankings.NO_MATCH,\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 testString - the string to test against\n * @param stringToRank - the string to rank\n * @param options - options for the match (like keepDiacritics for comparison)\n * @returns 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 value - the string for which to produce the acronym\n * @returns the acronym\n */\nfunction getAcronym(value: string): string {\n  let acronym = \"\";\n  const wordsInString = value.split(\" \");\n  for (const wordInString of wordsInString) {\n    const splitByHyphenWords = wordInString.split(\"-\");\n    for (const splitByHyphenWord of splitByHyphenWords) {\n      acronym += splitByHyphenWord.slice(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 testString - the string to test against\n * @param stringToRank - the string to rank\n * @returns 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\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\n  return getRanking(spread);\n}\n\n/**\n * Sorts items that have a rank, index, and keyIndex\n * @param a - the first item to sort\n * @param b - the second item to sort\n * @returns -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    }\n    return aKeyIndex < bKeyIndex ? aFirst : bFirst;\n  }\n  return aRank > bRank ? aFirst : bFirst;\n}\n\n/**\n * Prepares value for comparison by stringifying it, removing diacritics (if specified)\n * @param value - the value to clean\n * @param options - options for the match (like keepDiacritics for comparison)\n * @returns the prepared value\n */\nfunction prepareValueForComparison<ItemType>(\n  value: string,\n  options: 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 (!options.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 item - the item\n * @param key - the potentially nested keypath or property callback\n * @returns - 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    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 *\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) {\n        continue;\n      }\n\n      if (nestedKey && 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 (nestedItem && nestedKey === \"*\") {\n        // ensure that values is an array\n        nestedValues = [...nestedValues, 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\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 * @returns 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 * @returns 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 {\n    ...defaultKeyAttributes,\n    ...key\n  };\n}\n\nexport { defaultBaseSortFn, matchSorter, rankings };\n\nexport type {\n  KeyAttributes,\n  KeyAttributesOptions,\n  KeyOption,\n  MatchSorterOptions,\n  RankingInfo,\n  ValueGetterKey\n};\n"],"mappings":";;;AA0EA,MAAM,WAAW;CACf,sBAAsB;CACtB,OAAO;CACP,aAAa;CACb,kBAAkB;CAClB,UAAU;CACV,SAAS;CACT,SAAS;CACT,UAAU;CACX;AAID,MAAMA,qBAA0C,GAAG,MACjD,OAAO,EAAE,YAAY,CAAC,cAAc,OAAO,EAAE,YAAY,CAAC;;;;;;;;AAS5D,SAAS,YACP,OACA,OACA,UAAwC,EAAE,EACzB;CACjB,MAAM,EACJ,MACA,YAAY,SAAS,SACrB,WAAW,mBACX,UAAS,iBACP,aAAa,MAAM,GAAG,MAAM,iBAAiB,GAAG,GAAG,SAAS,CAAC,KAC7D;AAOJ,QAAO,OANc,MAAM,QACxB,KAAkC,MAAgB,UACjD,oBAAoB,KAAK,MAAM,MAAM,EACvC,EAAE,CACH,CAE0B,CAAC,KAAK,EAAE,WAAW,KAAK;CAEnD,SAAS,oBACP,SACA,MACA,OAC6B;EAC7B,MAAM,cAAc,kBAAkB,MAAM,MAAM,OAAO,QAAQ;EACjE,MAAM,EAAE,MAAM,eAAe,cAAc;AAC3C,MAAI,QAAQ,aACV,SAAQ,KAAK;GACX,GAAG;GACH;GACA;GACD,CAAC;AAEJ,SAAO;;;AAIX,YAAY,WAAW;;;;;;;;;AAUvB,SAAS,kBACP,MACA,MACA,OACA,SACa;AACb,KAAI,CAAC,MAAM;EAET,MAAM,aAAa;AAEnB,SAAO;GAEL,aAAa;GACb,MAAM,gBAAgB,YAAY,OAAO,QAAQ;GACjD,UAAU;GACV,cAAc,QAAQ;GACvB;;AAIH,QAFqB,mBAAmB,MAAM,KAAK,CAE/B,QAEhB,EAAE,MAAM,aAAa,UAAU,gBAC/B,EAAE,WAAW,cACb,MACG;EACH,IAAI,UAAU,gBAAgB,WAAW,OAAO,QAAQ;EACxD,IAAI,iBAAiB;EACrB,MAAM,EAAE,YAAY,YAAY,cAAc;AAC9C,MAAI,UAAU,cAAc,WAAW,SAAS,QAC9C,WAAU;WACD,UAAU,WACnB,WAAU;AAEZ,MAAI,UAAU,MAAM;AAClB,UAAO;AACP,cAAW;AACX,kBAAe;AACf,oBAAiB;;AAEnB,SAAO;GACL,aAAa;GACb;GACA;GACA;GACD;IAEH;EACE,aAAa;EACb,MAAM,SAAS;EACf,UAAU;EACV,cAAc,QAAQ;EACvB,CACF;;;;;;;;;AAUH,SAAS,gBACP,YACA,cACA,SACS;AACT,cAAa,0BAA0B,YAAY,QAAQ;AAC3D,gBAAe,0BAA0B,cAAc,QAAQ;AAG/D,KAAI,aAAa,SAAS,WAAW,OACnC,QAAO,SAAS;AAIlB,KAAI,eAAe,aACjB,QAAO,SAAS;AAIlB,cAAa,WAAW,aAAa;AACrC,gBAAe,aAAa,aAAa;AAGzC,KAAI,eAAe,aACjB,QAAO,SAAS;AAIlB,KAAI,WAAW,WAAW,aAAa,CACrC,QAAO,SAAS;AAIlB,KAAI,WAAW,SAAS,IAAI,eAAe,CACzC,QAAO,SAAS;AAIlB,KAAI,WAAW,SAAS,aAAa,CACnC,QAAO,SAAS;UACP,aAAa,WAAW,EAIjC,QAAO,SAAS;AAIlB,KAAI,WAAW,WAAW,CAAC,SAAS,aAAa,CAC/C,QAAO,SAAS;AAKlB,QAAO,oBAAoB,YAAY,aAAa;;;;;;;;AAStD,SAAS,WAAW,OAAuB;CACzC,IAAI,UAAU;CACd,MAAM,gBAAgB,MAAM,MAAM,IAAI;AACtC,MAAK,MAAM,gBAAgB,eAAe;EACxC,MAAM,qBAAqB,aAAa,MAAM,IAAI;AAClD,OAAK,MAAM,qBAAqB,mBAC9B,YAAW,kBAAkB,MAAM,GAAG,EAAE;;AAG5C,QAAO;;;;;;;;;;;;AAaT,SAAS,oBACP,YACA,cACS;CACT,IAAI,2BAA2B;CAC/B,IAAI,aAAa;CACjB,SAAS,sBACP,WACA,QACA,OACA;AACA,OAAK,IAAI,IAAI,OAAO,IAAI,OAAO,QAAQ,IAAI,GAAG,IAE5C,KADmB,OAAO,OACP,WAAW;AAC5B,+BAA4B;AAC5B,UAAO,IAAI;;AAGf,SAAO;;CAET,SAAS,WAAW,QAAgB;EAClC,MAAM,mBAAmB,IAAI;EAC7B,MAAM,oBAAoB,2BAA2B,aAAa;AAGlE,SAFgB,SAAS,UAAU,oBAAoB;;CAIzD,MAAM,aAAa,sBAAsB,aAAa,IAAK,YAAY,EAAE;AACzE,KAAI,aAAa,EACf,QAAO,SAAS;AAElB,cAAa;AACb,MAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,IAAI,GAAG,KAAK;EACnD,MAAM,YAAY,aAAa;AAC/B,eAAa,sBAAsB,WAAY,YAAY,WAAW;AAEtE,MAAI,EADU,aAAa,IAEzB,QAAO,SAAS;;AAMpB,QAAO,WAFQ,aAAa,WAEH;;;;;;;;AAS3B,SAAS,iBACP,GACA,GACA,UACQ;CACR,MAAM,SAAS;CACf,MAAM,SAAS;CACf,MAAM,EAAE,MAAM,OAAO,UAAU,cAAc;CAC7C,MAAM,EAAE,MAAM,OAAO,UAAU,cAAc;AAE7C,KADa,UAAU,OACb;AACR,MAAI,cAAc,UAEhB,QAAO,SAAS,GAAG,EAAE;AAEvB,SAAO,YAAY,YAAY,SAAS;;AAE1C,QAAO,QAAQ,QAAQ,SAAS;;;;;;;;AASlC,SAAS,0BACP,OACA,SACQ;AAGR,SAAQ,GAAG;AACX,KAAI,CAAC,QAAQ,eACX,SAAQ,cAAc,MAAM;AAE9B,QAAO;;;;;;;;AAST,SAAS,cACP,MACA,KACe;AACf,KAAI,OAAO,QAAQ,SACjB,OAAM,IAAI;CAEZ,IAAIC;AACJ,KAAI,OAAO,QAAQ,WACjB,SAAQ,IAAI,KAAK;UACR,SAAS,KAClB,SAAQ;UACC,OAAO,eAAe,KAAK,MAAM,IAAI,CAC9C,SAAS,KAA2B;UAC3B,IAAI,SAAS,IAAI,CAC1B,QAAO,gBAA0B,KAAK,KAAK;KAE3C,SAAQ;AAIV,KAAI,UAAU,KACZ,QAAO,EAAE;AAEX,KAAI,MAAM,QAAQ,MAAM,CACtB,QAAO;AAET,QAAO,CAAC,OAAO,MAAM,CAAC;;;;;;;;;;AAWxB,SAAS,gBACP,MACA,MACe;CACf,MAAM,OAAO,KAAK,MAAM,IAAI;CAG5B,IAAIC,SAAiB,CAAC,KAAK;AAE3B,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;EAC3C,MAAM,YAAY,KAAK;EACvB,IAAIC,eAAuB,EAAE;AAE7B,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;GAC7C,MAAM,aAAa,OAAO;AAE1B,OAAI,eAAe,KACjB;AAGF,OAAI,aAAa,OAAO,eAAe,KAAK,YAAY,UAAU,EAAE;IAClE,MAAM,cAAe,WAAiC;AACtD,QAAI,gBAAgB,KAClB,cAAa,KAAK,YAA0C;cAErD,cAAc,cAAc,IAErC,gBAAe,CAAC,GAAG,cAAc,WAAW;;AAIhD,WAAS;;AAGX,KAAI,MAAM,QAAQ,OAAO,GAAG,CAK1B,QAF8B,EAAE,CAElB,OAAO,GAAI,OAAyB;AAIpD,QAAO;;;;;;;;AAST,SAAS,mBACP,MACA,MACA;CACA,MAAMC,YAAqE,EAAE;AAC7E,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;EAC3C,MAAM,MAAM,KAAK;EACjB,MAAM,aAAa,iBAAiB,IAAK;EACzC,MAAM,aAAa,cAAc,MAAM,IAAK;AAC5C,OAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,IAAI,GAAG,IAC5C,WAAU,KAAK;GACb,WAAW,WAAW;GACtB;GACD,CAAC;;AAGN,QAAO;;AAGT,MAAM,uBAAuB;CAC3B,YAAY;CACZ,YAAY;CACb;;;;;;AAMD,SAAS,iBAA2B,KAAyC;AAC3E,KAAI,OAAO,QAAQ,SACjB,QAAO;AAET,QAAO;EACL,GAAG;EACH,GAAG;EACJ"}
+{"version":3,"file":"match-sorter.mjs","names":[],"sources":["../src/match-sorter.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nimport { removeAccents } from \"./remove-accents\";\n\n/**\n * Forked from match-sorter by Kent C. Dodds\n */\n\ninterface 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\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 items - the items to sort\n * @param value - the value to use for ranking\n * @param options - Some options to configure the sorter\n * @returns - 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(\n    (ret: Array<RankedItem<ItemType>>, item: ItemType, index: number) =>\n      reduceItemsToRanked(ret, item, index),\n    []\n  );\n\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({\n        ...rankingInfo,\n        item,\n        index\n      });\n    }\n    return matches;\n  }\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 keys - the keys to get values from the item for the ranking\n * @param value - the value to rank against\n * @param options - options to control the ranking\n * @returns 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\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\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 as 0;\n        keyIndex = i;\n        keyThreshold = threshold;\n        newRankedValue = itemValue;\n      }\n      return {\n        rankedValue: newRankedValue,\n        rank,\n        keyIndex,\n        keyThreshold\n      };\n    },\n    {\n      rankedValue: item as unknown as string,\n      rank: rankings.NO_MATCH,\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 testString - the string to test against\n * @param stringToRank - the string to rank\n * @param options - options for the match (like keepDiacritics for comparison)\n * @returns 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 value - the string for which to produce the acronym\n * @returns the acronym\n */\nfunction getAcronym(value: string): string {\n  let acronym = \"\";\n  const wordsInString = value.split(\" \");\n  for (const wordInString of wordsInString) {\n    const splitByHyphenWords = wordInString.split(\"-\");\n    for (const splitByHyphenWord of splitByHyphenWords) {\n      acronym += splitByHyphenWord.slice(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 testString - the string to test against\n * @param stringToRank - the string to rank\n * @returns 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\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\n  return getRanking(spread);\n}\n\n/**\n * Sorts items that have a rank, index, and keyIndex\n * @param a - the first item to sort\n * @param b - the second item to sort\n * @returns -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    }\n    return aKeyIndex < bKeyIndex ? aFirst : bFirst;\n  }\n  return aRank > bRank ? aFirst : bFirst;\n}\n\n/**\n * Prepares value for comparison by stringifying it, removing diacritics (if specified)\n * @param value - the value to clean\n * @param options - options for the match (like keepDiacritics for comparison)\n * @returns the prepared value\n */\nfunction prepareValueForComparison<ItemType>(\n  value: string,\n  options: 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 (!options.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 item - the item\n * @param key - the potentially nested keypath or property callback\n * @returns - 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    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 *\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) {\n        continue;\n      }\n\n      if (nestedKey && 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 (nestedItem && nestedKey === \"*\") {\n        // ensure that values is an array\n        nestedValues = [...nestedValues, 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\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 * @returns 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 * @returns 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 {\n    ...defaultKeyAttributes,\n    ...key\n  };\n}\n\nexport { defaultBaseSortFn, matchSorter, rankings };\n\nexport type {\n  KeyAttributes,\n  KeyAttributesOptions,\n  KeyOption,\n  MatchSorterOptions,\n  RankingInfo,\n  ValueGetterKey\n};\n"],"mappings":";;;AA0EA,MAAM,WAAW;CACf,sBAAsB;CACtB,OAAO;CACP,aAAa;CACb,kBAAkB;CAClB,UAAU;CACV,SAAS;CACT,SAAS;CACT,UAAU;CACX;AAID,MAAM,qBAA0C,GAAG,MACjD,OAAO,EAAE,YAAY,CAAC,cAAc,OAAO,EAAE,YAAY,CAAC;;;;;;;;AAS5D,SAAS,YACP,OACA,OACA,UAAwC,EAAE,EACzB;CACjB,MAAM,EACJ,MACA,YAAY,SAAS,SACrB,WAAW,mBACX,UAAS,iBACP,aAAa,MAAM,GAAG,MAAM,iBAAiB,GAAG,GAAG,SAAS,CAAC,KAC7D;AAOJ,QAAO,OANc,MAAM,QACxB,KAAkC,MAAgB,UACjD,oBAAoB,KAAK,MAAM,MAAM,EACvC,EAAE,CAGsB,CAAC,CAAC,KAAK,EAAE,WAAW,KAAK;CAEnD,SAAS,oBACP,SACA,MACA,OAC6B;EAC7B,MAAM,cAAc,kBAAkB,MAAM,MAAM,OAAO,QAAQ;EACjE,MAAM,EAAE,MAAM,eAAe,cAAc;AAC3C,MAAI,QAAQ,aACV,SAAQ,KAAK;GACX,GAAG;GACH;GACA;GACD,CAAC;AAEJ,SAAO;;;AAIX,YAAY,WAAW;;;;;;;;;AAUvB,SAAS,kBACP,MACA,MACA,OACA,SACa;AACb,KAAI,CAAC,MAAM;EAET,MAAM,aAAa;AAEnB,SAAO;GAEL,aAAa;GACb,MAAM,gBAAgB,YAAY,OAAO,QAAQ;GACjD,UAAU;GACV,cAAc,QAAQ;GACvB;;AAIH,QAFqB,mBAAmB,MAAM,KAE3B,CAAC,QAEhB,EAAE,MAAM,aAAa,UAAU,gBAC/B,EAAE,WAAW,cACb,MACG;EACH,IAAI,UAAU,gBAAgB,WAAW,OAAO,QAAQ;EACxD,IAAI,iBAAiB;EACrB,MAAM,EAAE,YAAY,YAAY,cAAc;AAC9C,MAAI,UAAU,cAAc,WAAW,SAAS,QAC9C,WAAU;WACD,UAAU,WACnB,WAAU;AAEZ,MAAI,UAAU,MAAM;AAClB,UAAO;AACP,cAAW;AACX,kBAAe;AACf,oBAAiB;;AAEnB,SAAO;GACL,aAAa;GACb;GACA;GACA;GACD;IAEH;EACE,aAAa;EACb,MAAM,SAAS;EACf,UAAU;EACV,cAAc,QAAQ;EACvB,CACF;;;;;;;;;AAUH,SAAS,gBACP,YACA,cACA,SACS;AACT,cAAa,0BAA0B,YAAY,QAAQ;AAC3D,gBAAe,0BAA0B,cAAc,QAAQ;AAG/D,KAAI,aAAa,SAAS,WAAW,OACnC,QAAO,SAAS;AAIlB,KAAI,eAAe,aACjB,QAAO,SAAS;AAIlB,cAAa,WAAW,aAAa;AACrC,gBAAe,aAAa,aAAa;AAGzC,KAAI,eAAe,aACjB,QAAO,SAAS;AAIlB,KAAI,WAAW,WAAW,aAAa,CACrC,QAAO,SAAS;AAIlB,KAAI,WAAW,SAAS,IAAI,eAAe,CACzC,QAAO,SAAS;AAIlB,KAAI,WAAW,SAAS,aAAa,CACnC,QAAO,SAAS;UACP,aAAa,WAAW,EAIjC,QAAO,SAAS;AAIlB,KAAI,WAAW,WAAW,CAAC,SAAS,aAAa,CAC/C,QAAO,SAAS;AAKlB,QAAO,oBAAoB,YAAY,aAAa;;;;;;;;AAStD,SAAS,WAAW,OAAuB;CACzC,IAAI,UAAU;CACd,MAAM,gBAAgB,MAAM,MAAM,IAAI;AACtC,MAAK,MAAM,gBAAgB,eAAe;EACxC,MAAM,qBAAqB,aAAa,MAAM,IAAI;AAClD,OAAK,MAAM,qBAAqB,mBAC9B,YAAW,kBAAkB,MAAM,GAAG,EAAE;;AAG5C,QAAO;;;;;;;;;;;;AAaT,SAAS,oBACP,YACA,cACS;CACT,IAAI,2BAA2B;CAC/B,IAAI,aAAa;CACjB,SAAS,sBACP,WACA,QACA,OACA;AACA,OAAK,IAAI,IAAI,OAAO,IAAI,OAAO,QAAQ,IAAI,GAAG,IAE5C,KADmB,OAAO,OACP,WAAW;AAC5B,+BAA4B;AAC5B,UAAO,IAAI;;AAGf,SAAO;;CAET,SAAS,WAAW,QAAgB;EAClC,MAAM,mBAAmB,IAAI;EAC7B,MAAM,oBAAoB,2BAA2B,aAAa;AAGlE,SAFgB,SAAS,UAAU,oBAAoB;;CAIzD,MAAM,aAAa,sBAAsB,aAAa,IAAK,YAAY,EAAE;AACzE,KAAI,aAAa,EACf,QAAO,SAAS;AAElB,cAAa;AACb,MAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,IAAI,GAAG,KAAK;EACnD,MAAM,YAAY,aAAa;AAC/B,eAAa,sBAAsB,WAAY,YAAY,WAAW;AAEtE,MAAI,EADU,aAAa,IAEzB,QAAO,SAAS;;AAMpB,QAAO,WAFQ,aAAa,WAEH;;;;;;;;AAS3B,SAAS,iBACP,GACA,GACA,UACQ;CACR,MAAM,SAAS;CACf,MAAM,SAAS;CACf,MAAM,EAAE,MAAM,OAAO,UAAU,cAAc;CAC7C,MAAM,EAAE,MAAM,OAAO,UAAU,cAAc;AAE7C,KADa,UAAU,OACb;AACR,MAAI,cAAc,UAEhB,QAAO,SAAS,GAAG,EAAE;AAEvB,SAAO,YAAY,YAAY,SAAS;;AAE1C,QAAO,QAAQ,QAAQ,SAAS;;;;;;;;AASlC,SAAS,0BACP,OACA,SACQ;AAGR,SAAQ,GAAG;AACX,KAAI,CAAC,QAAQ,eACX,SAAQ,cAAc,MAAM;AAE9B,QAAO;;;;;;;;AAST,SAAS,cACP,MACA,KACe;AACf,KAAI,OAAO,QAAQ,SACjB,OAAM,IAAI;CAEZ,IAAI;AACJ,KAAI,OAAO,QAAQ,WACjB,SAAQ,IAAI,KAAK;UACR,SAAS,KAClB,SAAQ;UACC,OAAO,eAAe,KAAK,MAAM,IAAI,CAC9C,SAAS,KAA2B;UAC3B,IAAI,SAAS,IAAI,CAC1B,QAAO,gBAA0B,KAAK,KAAK;KAE3C,SAAQ;AAIV,KAAI,UAAU,KACZ,QAAO,EAAE;AAEX,KAAI,MAAM,QAAQ,MAAM,CACtB,QAAO;AAET,QAAO,CAAC,OAAO,MAAM,CAAC;;;;;;;;;;AAWxB,SAAS,gBACP,MACA,MACe;CACf,MAAM,OAAO,KAAK,MAAM,IAAI;CAG5B,IAAI,SAAiB,CAAC,KAAK;AAE3B,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;EAC3C,MAAM,YAAY,KAAK;EACvB,IAAI,eAAuB,EAAE;AAE7B,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;GAC7C,MAAM,aAAa,OAAO;AAE1B,OAAI,eAAe,KACjB;AAGF,OAAI,aAAa,OAAO,eAAe,KAAK,YAAY,UAAU,EAAE;IAClE,MAAM,cAAe,WAAiC;AACtD,QAAI,gBAAgB,KAClB,cAAa,KAAK,YAA0C;cAErD,cAAc,cAAc,IAErC,gBAAe,CAAC,GAAG,cAAc,WAAW;;AAIhD,WAAS;;AAGX,KAAI,MAAM,QAAQ,OAAO,GAAG,CAK1B,QAAO,EAAM,CAAC,OAAO,GAAI,OAAyB;AAIpD,QAAO;;;;;;;;AAST,SAAS,mBACP,MACA,MACA;CACA,MAAM,YAAqE,EAAE;AAC7E,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;EAC3C,MAAM,MAAM,KAAK;EACjB,MAAM,aAAa,iBAAiB,IAAK;EACzC,MAAM,aAAa,cAAc,MAAM,IAAK;AAC5C,OAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,IAAI,GAAG,IAC5C,WAAU,KAAK;GACb,WAAW,WAAW;GACtB;GACD,CAAC;;AAGN,QAAO;;AAGT,MAAM,uBAAuB;CAC3B,YAAY;CACZ,YAAY;CACb;;;;;;AAMD,SAAS,iBAA2B,KAAyC;AAC3E,KAAI,OAAO,QAAQ,SACjB,QAAO;AAET,QAAO;EACL,GAAG;EACH,GAAG;EACJ"}

package/dist/memoize.cjs

@@ -1,3 +1,4 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 
 //#region src/memoize.ts
 /**

package/dist/memoize.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"memoize.d.cts","names":[],"sources":["../src/memoize.ts"],"sourcesContent":[],"mappings":";;AAwBA;;;;;cAAa,qCAAsC,sBAKnB"}
+{"version":3,"file":"memoize.d.cts","names":[],"sources":["../src/memoize.ts"],"mappings":";;AAwBA;;;;;cAAa,WAAA,MAAkB,EAAA,GAAK,EAAA,aAAe,CAAA,MAAC,EAAA,aAKpB,CAAA"}

package/dist/memoize.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"memoize.d.mts","names":[],"sources":["../src/memoize.ts"],"sourcesContent":[],"mappings":";;AAwBA;;;;;cAAa,qCAAsC,sBAKnB"}
+{"version":3,"file":"memoize.d.mts","names":[],"sources":["../src/memoize.ts"],"mappings":";;AAwBA;;;;;cAAa,WAAA,MAAkB,EAAA,GAAK,EAAA,aAAe,CAAA,MAAC,EAAA,aAKpB,CAAA"}

package/dist/memoize.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"memoize.mjs","names":["results: Record<string, T>"],"sources":["../src/memoize.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\n/**\n * Memoizes a function based on its string identifier.\n *\n * @param fn - The function to memoize.\n * @returns A memoized version of the input function.\n */\nexport const memoizeOnId = <T>(fn: (id: string) => T) => {\n  // eslint-disable-next-line ts/unbound-method\n  const hasOwnProperty = Object.prototype.hasOwnProperty;\n  const results: Record<string, T> = {};\n\n  const memoizedFn = (id: string) => {\n    if (hasOwnProperty.call(results, id)) {\n      return results[id];\n    }\n    return (results[id] = fn(id));\n  };\n\n  return memoizedFn;\n};\n"],"mappings":";;;;;;;AAwBA,MAAa,eAAkB,OAA0B;CAEvD,MAAM,iBAAiB,OAAO,UAAU;CACxC,MAAMA,UAA6B,EAAE;CAErC,MAAM,cAAc,OAAe;AACjC,MAAI,eAAe,KAAK,SAAS,GAAG,CAClC,QAAO,QAAQ;AAEjB,SAAQ,QAAQ,MAAM,GAAG,GAAG;;AAG9B,QAAO"}
+{"version":3,"file":"memoize.mjs","names":[],"sources":["../src/memoize.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\n/**\n * Memoizes a function based on its string identifier.\n *\n * @param fn - The function to memoize.\n * @returns A memoized version of the input function.\n */\nexport const memoizeOnId = <T>(fn: (id: string) => T) => {\n  // eslint-disable-next-line ts/unbound-method\n  const hasOwnProperty = Object.prototype.hasOwnProperty;\n  const results: Record<string, T> = {};\n\n  const memoizedFn = (id: string) => {\n    if (hasOwnProperty.call(results, id)) {\n      return results[id];\n    }\n    return (results[id] = fn(id));\n  };\n\n  return memoizedFn;\n};\n"],"mappings":";;;;;;;AAwBA,MAAa,eAAkB,OAA0B;CAEvD,MAAM,iBAAiB,OAAO,UAAU;CACxC,MAAM,UAA6B,EAAE;CAErC,MAAM,cAAc,OAAe;AACjC,MAAI,eAAe,KAAK,SAAS,GAAG,CAClC,QAAO,QAAQ;AAEjB,SAAQ,QAAQ,MAAM,GAAG,GAAG;;AAG9B,QAAO"}

package/dist/noop.cjs

@@ -1,3 +1,4 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 
 //#region src/noop.ts
 /**

package/dist/noop.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"noop.d.cts","names":[],"sources":["../src/noop.ts"],"sourcesContent":[],"mappings":";;AAyBA;AAWA;;;;;cAXa;;;;;;;;;;iBAWS,SAAA,qBAA8B"}
+{"version":3,"file":"noop.d.cts","names":[],"sources":["../src/noop.ts"],"mappings":";;AAyBA;;;;;AAWA;cAXa,IAAA,GAAQ,OAAA;;;;;;;;;;iBAWC,SAAA,CAAU,OAAA,aAAoB,OAAA"}

package/dist/noop.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"noop.d.mts","names":[],"sources":["../src/noop.ts"],"sourcesContent":[],"mappings":";;AAyBA;AAWA;;;;;cAXa;;;;;;;;;;iBAWS,SAAA,qBAA8B"}
+{"version":3,"file":"noop.d.mts","names":[],"sources":["../src/noop.ts"],"mappings":";;AAyBA;;;;;AAWA;cAXa,IAAA,GAAQ,OAAA;;;;;;;;;;iBAWC,SAAA,CAAU,OAAA,aAAoB,OAAA"}

package/dist/omit.cjs

@@ -1,3 +1,4 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 
 //#region src/omit.ts
 /**

package/dist/omit.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"omit.d.cts","names":[],"sources":["../src/omit.ts"],"sourcesContent":[],"mappings":";;AAmCA;;;;;;;;;;;;;;;;iBAAgB,eAAe,qCAAqC,QAC7D,kBACU,MACd,KAAK,GAAG"}
+{"version":3,"file":"omit.d.cts","names":[],"sources":["../src/omit.ts"],"mappings":";;AAmCA;;;;;;;;;;;;;;;;iBAAgB,IAAA,WAAe,MAAA,+BAAqC,CAAA,CAAA,CAClE,GAAA,EAAK,CAAA,EACL,IAAA,WAAe,CAAA,KACd,IAAA,CAAK,CAAA,EAAG,CAAA"}

package/dist/omit.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"omit.d.mts","names":[],"sources":["../src/omit.ts"],"sourcesContent":[],"mappings":";;AAmCA;;;;;;;;;;;;;;;;iBAAgB,eAAe,qCAAqC,QAC7D,kBACU,MACd,KAAK,GAAG"}
+{"version":3,"file":"omit.d.mts","names":[],"sources":["../src/omit.ts"],"mappings":";;AAmCA;;;;;;;;;;;;;;;;iBAAgB,IAAA,WAAe,MAAA,+BAAqC,CAAA,CAAA,CAClE,GAAA,EAAK,CAAA,EACL,IAAA,WAAe,CAAA,KACd,IAAA,CAAK,CAAA,EAAG,CAAA"}

package/dist/pick.cjs

@@ -1,3 +1,4 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 
 //#region src/pick.ts
 /**

package/dist/pick.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"pick.d.cts","names":[],"sources":["../src/pick.ts"],"sourcesContent":[],"mappings":";;AAmCA;;;;;;;;;;;;;;;;iBAAgB,eAAe,qCAAqC,QAC7D,kBACU,MACd,KAAK,GAAG"}
+{"version":3,"file":"pick.d.cts","names":[],"sources":["../src/pick.ts"],"mappings":";;AAmCA;;;;;;;;;;;;;;;;iBAAgB,IAAA,WAAe,MAAA,+BAAqC,CAAA,CAAA,CAClE,GAAA,EAAK,CAAA,EACL,IAAA,WAAe,CAAA,KACd,IAAA,CAAK,CAAA,EAAG,CAAA"}

package/dist/pick.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"pick.d.mts","names":[],"sources":["../src/pick.ts"],"sourcesContent":[],"mappings":";;AAmCA;;;;;;;;;;;;;;;;iBAAgB,eAAe,qCAAqC,QAC7D,kBACU,MACd,KAAK,GAAG"}
+{"version":3,"file":"pick.d.mts","names":[],"sources":["../src/pick.ts"],"mappings":";;AAmCA;;;;;;;;;;;;;;;;iBAAgB,IAAA,WAAe,MAAA,+BAAqC,CAAA,CAAA,CAClE,GAAA,EAAK,CAAA,EACL,IAAA,WAAe,CAAA,KACd,IAAA,CAAK,CAAA,EAAG,CAAA"}

package/dist/remove-accents.cjs

@@ -1,3 +1,4 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 
 //#region src/remove-accents.ts
 const characterMap = {

package/dist/remove-accents.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"remove-accents.d.cts","names":[],"sources":["../src/remove-accents.ts"],"sourcesContent":[],"mappings":";cAkBa,cAAc;AAA3B;AAwZA;;;;;cAAa"}
+{"version":3,"file":"remove-accents.d.cts","names":[],"sources":["../src/remove-accents.ts"],"mappings":";cAkBa,YAAA,EAAc,MAAA;AAA3B;;;;;AAwZA;AAxZA,cAwZa,aAAA,GAAiB,GAAA"}

package/dist/remove-accents.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"remove-accents.d.mts","names":[],"sources":["../src/remove-accents.ts"],"sourcesContent":[],"mappings":";cAkBa,cAAc;AAA3B;AAwZA;;;;;cAAa"}
+{"version":3,"file":"remove-accents.d.mts","names":[],"sources":["../src/remove-accents.ts"],"mappings":";cAkBa,YAAA,EAAc,MAAA;AAA3B;;;;;AAwZA;AAxZA,cAwZa,aAAA,GAAiB,GAAA"}

package/dist/remove-accents.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"remove-accents.mjs","names":["characterMap: Record<string, string>"],"sources":["../src/remove-accents.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nexport const characterMap: Record<string, string> = {\n  À: \"A\",\n  Á: \"A\",\n  Â: \"A\",\n  Ã: \"A\",\n  Ä: \"A\",\n  Å: \"A\",\n  Ấ: \"A\",\n  Ắ: \"A\",\n  Ẳ: \"A\",\n  Ẵ: \"A\",\n  Ặ: \"A\",\n  Æ: \"AE\",\n  Ầ: \"A\",\n  Ằ: \"A\",\n  Ȃ: \"A\",\n  Ç: \"C\",\n  Ḉ: \"C\",\n  È: \"E\",\n  É: \"E\",\n  Ê: \"E\",\n  Ë: \"E\",\n  Ế: \"E\",\n  Ḗ: \"E\",\n  Ề: \"E\",\n  Ḕ: \"E\",\n  Ḝ: \"E\",\n  Ȇ: \"E\",\n  Ì: \"I\",\n  Í: \"I\",\n  Î: \"I\",\n  Ï: \"I\",\n  Ḯ: \"I\",\n  Ȋ: \"I\",\n  Ð: \"D\",\n  Ñ: \"N\",\n  Ò: \"O\",\n  Ó: \"O\",\n  Ô: \"O\",\n  Õ: \"O\",\n  Ö: \"O\",\n  Ø: \"O\",\n  Ố: \"O\",\n  Ṍ: \"O\",\n  Ṓ: \"O\",\n  Ȏ: \"O\",\n  Ù: \"U\",\n  Ú: \"U\",\n  Û: \"U\",\n  Ü: \"U\",\n  Ý: \"Y\",\n  à: \"a\",\n  á: \"a\",\n  â: \"a\",\n  ã: \"a\",\n  ä: \"a\",\n  å: \"a\",\n  ấ: \"a\",\n  ắ: \"a\",\n  ẳ: \"a\",\n  ẵ: \"a\",\n  ặ: \"a\",\n  æ: \"ae\",\n  ầ: \"a\",\n  ằ: \"a\",\n  ȃ: \"a\",\n  ç: \"c\",\n  ḉ: \"c\",\n  è: \"e\",\n  é: \"e\",\n  ê: \"e\",\n  ë: \"e\",\n  ế: \"e\",\n  ḗ: \"e\",\n  ề: \"e\",\n  ḕ: \"e\",\n  ḝ: \"e\",\n  ȇ: \"e\",\n  ì: \"i\",\n  í: \"i\",\n  î: \"i\",\n  ï: \"i\",\n  ḯ: \"i\",\n  ȋ: \"i\",\n  ð: \"d\",\n  ñ: \"n\",\n  ò: \"o\",\n  ó: \"o\",\n  ô: \"o\",\n  õ: \"o\",\n  ö: \"o\",\n  ø: \"o\",\n  ố: \"o\",\n  ṍ: \"o\",\n  ṓ: \"o\",\n  ȏ: \"o\",\n  ù: \"u\",\n  ú: \"u\",\n  û: \"u\",\n  ü: \"u\",\n  ý: \"y\",\n  ÿ: \"y\",\n  Ā: \"A\",\n  ā: \"a\",\n  Ă: \"A\",\n  ă: \"a\",\n  Ą: \"A\",\n  ą: \"a\",\n  Ć: \"C\",\n  ć: \"c\",\n  Ĉ: \"C\",\n  ĉ: \"c\",\n  Ċ: \"C\",\n  ċ: \"c\",\n  Č: \"C\",\n  č: \"c\",\n  C̆: \"C\",\n  c̆: \"c\",\n  Ď: \"D\",\n  ď: \"d\",\n  Đ: \"D\",\n  đ: \"d\",\n  Ē: \"E\",\n  ē: \"e\",\n  Ĕ: \"E\",\n  ĕ: \"e\",\n  Ė: \"E\",\n  ė: \"e\",\n  Ę: \"E\",\n  ę: \"e\",\n  Ě: \"E\",\n  ě: \"e\",\n  Ĝ: \"G\",\n  Ǵ: \"G\",\n  ĝ: \"g\",\n  ǵ: \"g\",\n  Ğ: \"G\",\n  ğ: \"g\",\n  Ġ: \"G\",\n  ġ: \"g\",\n  Ģ: \"G\",\n  ģ: \"g\",\n  Ĥ: \"H\",\n  ĥ: \"h\",\n  Ħ: \"H\",\n  ħ: \"h\",\n  Ḫ: \"H\",\n  ḫ: \"h\",\n  Ĩ: \"I\",\n  ĩ: \"i\",\n  Ī: \"I\",\n  ī: \"i\",\n  Ĭ: \"I\",\n  ĭ: \"i\",\n  Į: \"I\",\n  į: \"i\",\n  İ: \"I\",\n  ı: \"i\",\n  IJ: \"IJ\",\n  ij: \"ij\",\n  Ĵ: \"J\",\n  ĵ: \"j\",\n  Ķ: \"K\",\n  ķ: \"k\",\n  Ḱ: \"K\",\n  ḱ: \"k\",\n  K̆: \"K\",\n  k̆: \"k\",\n  Ĺ: \"L\",\n  ĺ: \"l\",\n  Ļ: \"L\",\n  ļ: \"l\",\n  Ľ: \"L\",\n  ľ: \"l\",\n  Ŀ: \"L\",\n  ŀ: \"l\",\n  Ł: \"l\",\n  ł: \"l\",\n  Ḿ: \"M\",\n  ḿ: \"m\",\n  M̆: \"M\",\n  m̆: \"m\",\n  Ń: \"N\",\n  ń: \"n\",\n  Ņ: \"N\",\n  ņ: \"n\",\n  Ň: \"N\",\n  ň: \"n\",\n  ʼn: \"n\",\n  N̆: \"N\",\n  n̆: \"n\",\n  Ō: \"O\",\n  ō: \"o\",\n  Ŏ: \"O\",\n  ŏ: \"o\",\n  Ő: \"O\",\n  ő: \"o\",\n  Œ: \"OE\",\n  œ: \"oe\",\n  P̆: \"P\",\n  p̆: \"p\",\n  Ŕ: \"R\",\n  ŕ: \"r\",\n  Ŗ: \"R\",\n  ŗ: \"r\",\n  Ř: \"R\",\n  ř: \"r\",\n  R̆: \"R\",\n  r̆: \"r\",\n  Ȓ: \"R\",\n  ȓ: \"r\",\n  Ś: \"S\",\n  ś: \"s\",\n  Ŝ: \"S\",\n  ŝ: \"s\",\n  Ş: \"S\",\n  Ș: \"S\",\n  ș: \"s\",\n  ş: \"s\",\n  Š: \"S\",\n  š: \"s\",\n  Ţ: \"T\",\n  ţ: \"t\",\n  ț: \"t\",\n  Ț: \"T\",\n  Ť: \"T\",\n  ť: \"t\",\n  Ŧ: \"T\",\n  ŧ: \"t\",\n  T̆: \"T\",\n  t̆: \"t\",\n  Ũ: \"U\",\n  ũ: \"u\",\n  Ū: \"U\",\n  ū: \"u\",\n  Ŭ: \"U\",\n  ŭ: \"u\",\n  Ů: \"U\",\n  ů: \"u\",\n  Ű: \"U\",\n  ű: \"u\",\n  Ų: \"U\",\n  ų: \"u\",\n  Ȗ: \"U\",\n  ȗ: \"u\",\n  V̆: \"V\",\n  v̆: \"v\",\n  Ŵ: \"W\",\n  ŵ: \"w\",\n  Ẃ: \"W\",\n  ẃ: \"w\",\n  X̆: \"X\",\n  x̆: \"x\",\n  Ŷ: \"Y\",\n  ŷ: \"y\",\n  Ÿ: \"Y\",\n  Y̆: \"Y\",\n  y̆: \"y\",\n  Ź: \"Z\",\n  ź: \"z\",\n  Ż: \"Z\",\n  ż: \"z\",\n  Ž: \"Z\",\n  ž: \"z\",\n  ſ: \"s\",\n  ƒ: \"f\",\n  Ơ: \"O\",\n  ơ: \"o\",\n  Ư: \"U\",\n  ư: \"u\",\n  Ǎ: \"A\",\n  ǎ: \"a\",\n  Ǐ: \"I\",\n  ǐ: \"i\",\n  Ǒ: \"O\",\n  ǒ: \"o\",\n  Ǔ: \"U\",\n  ǔ: \"u\",\n  Ǖ: \"U\",\n  ǖ: \"u\",\n  Ǘ: \"U\",\n  ǘ: \"u\",\n  Ǚ: \"U\",\n  ǚ: \"u\",\n  Ǜ: \"U\",\n  ǜ: \"u\",\n  Ứ: \"U\",\n  ứ: \"u\",\n  Ṹ: \"U\",\n  ṹ: \"u\",\n  Ǻ: \"A\",\n  ǻ: \"a\",\n  Ǽ: \"AE\",\n  ǽ: \"ae\",\n  Ǿ: \"O\",\n  ǿ: \"o\",\n  Þ: \"TH\",\n  þ: \"th\",\n  Ṕ: \"P\",\n  ṕ: \"p\",\n  Ṥ: \"S\",\n  ṥ: \"s\",\n  X́: \"X\",\n  x́: \"x\",\n  Ѓ: \"Г\",\n  ѓ: \"г\",\n  Ќ: \"К\",\n  ќ: \"к\",\n  A̋: \"A\",\n  a̋: \"a\",\n  E̋: \"E\",\n  e̋: \"e\",\n  I̋: \"I\",\n  i̋: \"i\",\n  Ǹ: \"N\",\n  ǹ: \"n\",\n  Ồ: \"O\",\n  ồ: \"o\",\n  Ṑ: \"O\",\n  ṑ: \"o\",\n  Ừ: \"U\",\n  ừ: \"u\",\n  Ẁ: \"W\",\n  ẁ: \"w\",\n  Ỳ: \"Y\",\n  ỳ: \"y\",\n  Ȁ: \"A\",\n  ȁ: \"a\",\n  Ȅ: \"E\",\n  ȅ: \"e\",\n  Ȉ: \"I\",\n  ȉ: \"i\",\n  Ȍ: \"O\",\n  ȍ: \"o\",\n  Ȑ: \"R\",\n  ȑ: \"r\",\n  Ȕ: \"U\",\n  ȕ: \"u\",\n  B̌: \"B\",\n  b̌: \"b\",\n  Č̣: \"C\",\n  č̣: \"c\",\n  Ê̌: \"E\",\n  ê̌: \"e\",\n  F̌: \"F\",\n  f̌: \"f\",\n  Ǧ: \"G\",\n  ǧ: \"g\",\n  Ȟ: \"H\",\n  ȟ: \"h\",\n  J̌: \"J\",\n  ǰ: \"j\",\n  Ǩ: \"K\",\n  ǩ: \"k\",\n  M̌: \"M\",\n  m̌: \"m\",\n  P̌: \"P\",\n  p̌: \"p\",\n  Q̌: \"Q\",\n  q̌: \"q\",\n  Ř̩: \"R\",\n  ř̩: \"r\",\n  Ṧ: \"S\",\n  ṧ: \"s\",\n  V̌: \"V\",\n  v̌: \"v\",\n  W̌: \"W\",\n  w̌: \"w\",\n  X̌: \"X\",\n  x̌: \"x\",\n  Y̌: \"Y\",\n  y̌: \"y\",\n  A̧: \"A\",\n  a̧: \"a\",\n  B̧: \"B\",\n  b̧: \"b\",\n  Ḑ: \"D\",\n  ḑ: \"d\",\n  Ȩ: \"E\",\n  ȩ: \"e\",\n  Ɛ̧: \"E\",\n  ɛ̧: \"e\",\n  Ḩ: \"H\",\n  ḩ: \"h\",\n  I̧: \"I\",\n  i̧: \"i\",\n  Ɨ̧: \"I\",\n  ɨ̧: \"i\",\n  M̧: \"M\",\n  m̧: \"m\",\n  O̧: \"O\",\n  o̧: \"o\",\n  Q̧: \"Q\",\n  q̧: \"q\",\n  U̧: \"U\",\n  u̧: \"u\",\n  X̧: \"X\",\n  x̧: \"x\",\n  Z̧: \"Z\",\n  z̧: \"z\"\n};\n\n/**\n * Removes accents from a string.\n *\n * @param str - The string to remove accents from\n * @returns The string without accents\n */\nexport const removeAccents = (str: string) =>\n  str.replace(\n    // eslint-disable-next-line regexp/no-dupe-disjunctions, regexp/prefer-character-class\n    new RegExp(Object.keys(characterMap).join(\"|\"), \"g\"),\n    match => characterMap[match]!\n  );\n"],"mappings":";AAkBA,MAAaA,eAAuC;CAClD,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACL;;;;;;;AAQD,MAAa,iBAAiB,QAC5B,IAAI,QAEF,IAAI,OAAO,OAAO,KAAK,aAAa,CAAC,KAAK,IAAI,EAAE,IAAI,GACpD,UAAS,aAAa,OACvB"}
+{"version":3,"file":"remove-accents.mjs","names":[],"sources":["../src/remove-accents.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nexport const characterMap: Record<string, string> = {\n  À: \"A\",\n  Á: \"A\",\n  Â: \"A\",\n  Ã: \"A\",\n  Ä: \"A\",\n  Å: \"A\",\n  Ấ: \"A\",\n  Ắ: \"A\",\n  Ẳ: \"A\",\n  Ẵ: \"A\",\n  Ặ: \"A\",\n  Æ: \"AE\",\n  Ầ: \"A\",\n  Ằ: \"A\",\n  Ȃ: \"A\",\n  Ç: \"C\",\n  Ḉ: \"C\",\n  È: \"E\",\n  É: \"E\",\n  Ê: \"E\",\n  Ë: \"E\",\n  Ế: \"E\",\n  Ḗ: \"E\",\n  Ề: \"E\",\n  Ḕ: \"E\",\n  Ḝ: \"E\",\n  Ȇ: \"E\",\n  Ì: \"I\",\n  Í: \"I\",\n  Î: \"I\",\n  Ï: \"I\",\n  Ḯ: \"I\",\n  Ȋ: \"I\",\n  Ð: \"D\",\n  Ñ: \"N\",\n  Ò: \"O\",\n  Ó: \"O\",\n  Ô: \"O\",\n  Õ: \"O\",\n  Ö: \"O\",\n  Ø: \"O\",\n  Ố: \"O\",\n  Ṍ: \"O\",\n  Ṓ: \"O\",\n  Ȏ: \"O\",\n  Ù: \"U\",\n  Ú: \"U\",\n  Û: \"U\",\n  Ü: \"U\",\n  Ý: \"Y\",\n  à: \"a\",\n  á: \"a\",\n  â: \"a\",\n  ã: \"a\",\n  ä: \"a\",\n  å: \"a\",\n  ấ: \"a\",\n  ắ: \"a\",\n  ẳ: \"a\",\n  ẵ: \"a\",\n  ặ: \"a\",\n  æ: \"ae\",\n  ầ: \"a\",\n  ằ: \"a\",\n  ȃ: \"a\",\n  ç: \"c\",\n  ḉ: \"c\",\n  è: \"e\",\n  é: \"e\",\n  ê: \"e\",\n  ë: \"e\",\n  ế: \"e\",\n  ḗ: \"e\",\n  ề: \"e\",\n  ḕ: \"e\",\n  ḝ: \"e\",\n  ȇ: \"e\",\n  ì: \"i\",\n  í: \"i\",\n  î: \"i\",\n  ï: \"i\",\n  ḯ: \"i\",\n  ȋ: \"i\",\n  ð: \"d\",\n  ñ: \"n\",\n  ò: \"o\",\n  ó: \"o\",\n  ô: \"o\",\n  õ: \"o\",\n  ö: \"o\",\n  ø: \"o\",\n  ố: \"o\",\n  ṍ: \"o\",\n  ṓ: \"o\",\n  ȏ: \"o\",\n  ù: \"u\",\n  ú: \"u\",\n  û: \"u\",\n  ü: \"u\",\n  ý: \"y\",\n  ÿ: \"y\",\n  Ā: \"A\",\n  ā: \"a\",\n  Ă: \"A\",\n  ă: \"a\",\n  Ą: \"A\",\n  ą: \"a\",\n  Ć: \"C\",\n  ć: \"c\",\n  Ĉ: \"C\",\n  ĉ: \"c\",\n  Ċ: \"C\",\n  ċ: \"c\",\n  Č: \"C\",\n  č: \"c\",\n  C̆: \"C\",\n  c̆: \"c\",\n  Ď: \"D\",\n  ď: \"d\",\n  Đ: \"D\",\n  đ: \"d\",\n  Ē: \"E\",\n  ē: \"e\",\n  Ĕ: \"E\",\n  ĕ: \"e\",\n  Ė: \"E\",\n  ė: \"e\",\n  Ę: \"E\",\n  ę: \"e\",\n  Ě: \"E\",\n  ě: \"e\",\n  Ĝ: \"G\",\n  Ǵ: \"G\",\n  ĝ: \"g\",\n  ǵ: \"g\",\n  Ğ: \"G\",\n  ğ: \"g\",\n  Ġ: \"G\",\n  ġ: \"g\",\n  Ģ: \"G\",\n  ģ: \"g\",\n  Ĥ: \"H\",\n  ĥ: \"h\",\n  Ħ: \"H\",\n  ħ: \"h\",\n  Ḫ: \"H\",\n  ḫ: \"h\",\n  Ĩ: \"I\",\n  ĩ: \"i\",\n  Ī: \"I\",\n  ī: \"i\",\n  Ĭ: \"I\",\n  ĭ: \"i\",\n  Į: \"I\",\n  į: \"i\",\n  İ: \"I\",\n  ı: \"i\",\n  IJ: \"IJ\",\n  ij: \"ij\",\n  Ĵ: \"J\",\n  ĵ: \"j\",\n  Ķ: \"K\",\n  ķ: \"k\",\n  Ḱ: \"K\",\n  ḱ: \"k\",\n  K̆: \"K\",\n  k̆: \"k\",\n  Ĺ: \"L\",\n  ĺ: \"l\",\n  Ļ: \"L\",\n  ļ: \"l\",\n  Ľ: \"L\",\n  ľ: \"l\",\n  Ŀ: \"L\",\n  ŀ: \"l\",\n  Ł: \"l\",\n  ł: \"l\",\n  Ḿ: \"M\",\n  ḿ: \"m\",\n  M̆: \"M\",\n  m̆: \"m\",\n  Ń: \"N\",\n  ń: \"n\",\n  Ņ: \"N\",\n  ņ: \"n\",\n  Ň: \"N\",\n  ň: \"n\",\n  ʼn: \"n\",\n  N̆: \"N\",\n  n̆: \"n\",\n  Ō: \"O\",\n  ō: \"o\",\n  Ŏ: \"O\",\n  ŏ: \"o\",\n  Ő: \"O\",\n  ő: \"o\",\n  Œ: \"OE\",\n  œ: \"oe\",\n  P̆: \"P\",\n  p̆: \"p\",\n  Ŕ: \"R\",\n  ŕ: \"r\",\n  Ŗ: \"R\",\n  ŗ: \"r\",\n  Ř: \"R\",\n  ř: \"r\",\n  R̆: \"R\",\n  r̆: \"r\",\n  Ȓ: \"R\",\n  ȓ: \"r\",\n  Ś: \"S\",\n  ś: \"s\",\n  Ŝ: \"S\",\n  ŝ: \"s\",\n  Ş: \"S\",\n  Ș: \"S\",\n  ș: \"s\",\n  ş: \"s\",\n  Š: \"S\",\n  š: \"s\",\n  Ţ: \"T\",\n  ţ: \"t\",\n  ț: \"t\",\n  Ț: \"T\",\n  Ť: \"T\",\n  ť: \"t\",\n  Ŧ: \"T\",\n  ŧ: \"t\",\n  T̆: \"T\",\n  t̆: \"t\",\n  Ũ: \"U\",\n  ũ: \"u\",\n  Ū: \"U\",\n  ū: \"u\",\n  Ŭ: \"U\",\n  ŭ: \"u\",\n  Ů: \"U\",\n  ů: \"u\",\n  Ű: \"U\",\n  ű: \"u\",\n  Ų: \"U\",\n  ų: \"u\",\n  Ȗ: \"U\",\n  ȗ: \"u\",\n  V̆: \"V\",\n  v̆: \"v\",\n  Ŵ: \"W\",\n  ŵ: \"w\",\n  Ẃ: \"W\",\n  ẃ: \"w\",\n  X̆: \"X\",\n  x̆: \"x\",\n  Ŷ: \"Y\",\n  ŷ: \"y\",\n  Ÿ: \"Y\",\n  Y̆: \"Y\",\n  y̆: \"y\",\n  Ź: \"Z\",\n  ź: \"z\",\n  Ż: \"Z\",\n  ż: \"z\",\n  Ž: \"Z\",\n  ž: \"z\",\n  ſ: \"s\",\n  ƒ: \"f\",\n  Ơ: \"O\",\n  ơ: \"o\",\n  Ư: \"U\",\n  ư: \"u\",\n  Ǎ: \"A\",\n  ǎ: \"a\",\n  Ǐ: \"I\",\n  ǐ: \"i\",\n  Ǒ: \"O\",\n  ǒ: \"o\",\n  Ǔ: \"U\",\n  ǔ: \"u\",\n  Ǖ: \"U\",\n  ǖ: \"u\",\n  Ǘ: \"U\",\n  ǘ: \"u\",\n  Ǚ: \"U\",\n  ǚ: \"u\",\n  Ǜ: \"U\",\n  ǜ: \"u\",\n  Ứ: \"U\",\n  ứ: \"u\",\n  Ṹ: \"U\",\n  ṹ: \"u\",\n  Ǻ: \"A\",\n  ǻ: \"a\",\n  Ǽ: \"AE\",\n  ǽ: \"ae\",\n  Ǿ: \"O\",\n  ǿ: \"o\",\n  Þ: \"TH\",\n  þ: \"th\",\n  Ṕ: \"P\",\n  ṕ: \"p\",\n  Ṥ: \"S\",\n  ṥ: \"s\",\n  X́: \"X\",\n  x́: \"x\",\n  Ѓ: \"Г\",\n  ѓ: \"г\",\n  Ќ: \"К\",\n  ќ: \"к\",\n  A̋: \"A\",\n  a̋: \"a\",\n  E̋: \"E\",\n  e̋: \"e\",\n  I̋: \"I\",\n  i̋: \"i\",\n  Ǹ: \"N\",\n  ǹ: \"n\",\n  Ồ: \"O\",\n  ồ: \"o\",\n  Ṑ: \"O\",\n  ṑ: \"o\",\n  Ừ: \"U\",\n  ừ: \"u\",\n  Ẁ: \"W\",\n  ẁ: \"w\",\n  Ỳ: \"Y\",\n  ỳ: \"y\",\n  Ȁ: \"A\",\n  ȁ: \"a\",\n  Ȅ: \"E\",\n  ȅ: \"e\",\n  Ȉ: \"I\",\n  ȉ: \"i\",\n  Ȍ: \"O\",\n  ȍ: \"o\",\n  Ȑ: \"R\",\n  ȑ: \"r\",\n  Ȕ: \"U\",\n  ȕ: \"u\",\n  B̌: \"B\",\n  b̌: \"b\",\n  Č̣: \"C\",\n  č̣: \"c\",\n  Ê̌: \"E\",\n  ê̌: \"e\",\n  F̌: \"F\",\n  f̌: \"f\",\n  Ǧ: \"G\",\n  ǧ: \"g\",\n  Ȟ: \"H\",\n  ȟ: \"h\",\n  J̌: \"J\",\n  ǰ: \"j\",\n  Ǩ: \"K\",\n  ǩ: \"k\",\n  M̌: \"M\",\n  m̌: \"m\",\n  P̌: \"P\",\n  p̌: \"p\",\n  Q̌: \"Q\",\n  q̌: \"q\",\n  Ř̩: \"R\",\n  ř̩: \"r\",\n  Ṧ: \"S\",\n  ṧ: \"s\",\n  V̌: \"V\",\n  v̌: \"v\",\n  W̌: \"W\",\n  w̌: \"w\",\n  X̌: \"X\",\n  x̌: \"x\",\n  Y̌: \"Y\",\n  y̌: \"y\",\n  A̧: \"A\",\n  a̧: \"a\",\n  B̧: \"B\",\n  b̧: \"b\",\n  Ḑ: \"D\",\n  ḑ: \"d\",\n  Ȩ: \"E\",\n  ȩ: \"e\",\n  Ɛ̧: \"E\",\n  ɛ̧: \"e\",\n  Ḩ: \"H\",\n  ḩ: \"h\",\n  I̧: \"I\",\n  i̧: \"i\",\n  Ɨ̧: \"I\",\n  ɨ̧: \"i\",\n  M̧: \"M\",\n  m̧: \"m\",\n  O̧: \"O\",\n  o̧: \"o\",\n  Q̧: \"Q\",\n  q̧: \"q\",\n  U̧: \"U\",\n  u̧: \"u\",\n  X̧: \"X\",\n  x̧: \"x\",\n  Z̧: \"Z\",\n  z̧: \"z\"\n};\n\n/**\n * Removes accents from a string.\n *\n * @param str - The string to remove accents from\n * @returns The string without accents\n */\nexport const removeAccents = (str: string) =>\n  str.replace(\n    // eslint-disable-next-line regexp/no-dupe-disjunctions, regexp/prefer-character-class\n    new RegExp(Object.keys(characterMap).join(\"|\"), \"g\"),\n    match => characterMap[match]!\n  );\n"],"mappings":";AAkBA,MAAa,eAAuC;CAClD,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACL;;;;;;;AAQD,MAAa,iBAAiB,QAC5B,IAAI,QAEF,IAAI,OAAO,OAAO,KAAK,aAAa,CAAC,KAAK,IAAI,EAAE,IAAI,GACpD,UAAS,aAAa,OACvB"}

package/dist/remove-empty-items.cjs

@@ -1,3 +1,4 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 
 //#region src/remove-empty-items.ts
 /**

package/dist/remove-empty-items.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"remove-empty-items.d.cts","names":[],"sources":["../src/remove-empty-items.ts"],"sourcesContent":[],"mappings":";;AAwBA;;;;;cAAa,kCACL,4BACL,YAAY"}
+{"version":3,"file":"remove-empty-items.d.cts","names":[],"sources":["../src/remove-empty-items.ts"],"mappings":";;AAwBA;;;;;cAAa,gBAAA,YACX,GAAA,GAAM,CAAA,2BACL,WAAA,CAAY,CAAA"}

package/dist/remove-empty-items.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"remove-empty-items.d.mts","names":[],"sources":["../src/remove-empty-items.ts"],"sourcesContent":[],"mappings":";;AAwBA;;;;;cAAa,kCACL,4BACL,YAAY"}
+{"version":3,"file":"remove-empty-items.d.mts","names":[],"sources":["../src/remove-empty-items.ts"],"mappings":";;AAwBA;;;;;cAAa,gBAAA,YACX,GAAA,GAAM,CAAA,2BACL,WAAA,CAAY,CAAA"}

package/dist/set-field.cjs

@@ -1,3 +1,4 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 const require_is_string = require('./type-checks/src/is-string.cjs');
 const require_is_object_index = require('./type-checks/src/is-object-index.cjs');
 const require_to_path = require('./to-path.cjs');

package/dist/set-field.d.cts

@@ -1,7 +1,6 @@
 import { DeepKey } from "./types/src/object.cjs";
 
 //#region src/set-field.d.ts
-
 /**
  * Sets a value at a given deep path in an object.
  *

package/dist/set-field.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"set-field.d.cts","names":[],"sources":["../src/set-field.ts"],"sourcesContent":[],"mappings":";;;;;;AA+BA;;;;;;AAE4D,iBAF5C,QAE4C,CAAA,gBAD1C,MAC0C,CAAA,MAAA,EAAA,GAAA,CAAA,GADpB,MACoB,CAAA,MAAA,EAAA,GAAA,CAAA,CAAA,CAAA,MAAA,EAAlD,OAAkD,EAAA,IAAA,EAAnC,OAAmC,CAA3B,OAA2B,CAAA,EAAA,KAAA,EAAA,OAAA,CAAA,EAAA,OAAA"}
+{"version":3,"file":"set-field.d.cts","names":[],"sources":["../src/set-field.ts"],"mappings":";;;;;AA+BA;;;;;;iBAAgB,QAAA,iBACE,MAAA,gBAAsB,MAAA,cAAA,CACtC,MAAA,EAAQ,OAAA,EAAS,IAAA,EAAM,OAAA,CAAQ,OAAA,GAAU,KAAA,YAAiB,OAAA"}

package/dist/set-field.d.mts

@@ -1,7 +1,6 @@
 import { DeepKey } from "./types/src/object.mjs";
 
 //#region src/set-field.d.ts
-
 /**
  * Sets a value at a given deep path in an object.
  *

package/dist/set-field.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"set-field.d.mts","names":[],"sources":["../src/set-field.ts"],"sourcesContent":[],"mappings":";;;;;;AA+BA;;;;;;AAE4D,iBAF5C,QAE4C,CAAA,gBAD1C,MAC0C,CAAA,MAAA,EAAA,GAAA,CAAA,GADpB,MACoB,CAAA,MAAA,EAAA,GAAA,CAAA,CAAA,CAAA,MAAA,EAAlD,OAAkD,EAAA,IAAA,EAAnC,OAAmC,CAA3B,OAA2B,CAAA,EAAA,KAAA,EAAA,OAAA,CAAA,EAAA,OAAA"}
+{"version":3,"file":"set-field.d.mts","names":[],"sources":["../src/set-field.ts"],"mappings":";;;;;AA+BA;;;;;;iBAAgB,QAAA,iBACE,MAAA,gBAAsB,MAAA,cAAA,CACtC,MAAA,EAAQ,OAAA,EAAS,IAAA,EAAM,OAAA,CAAQ,OAAA,GAAU,KAAA,YAAiB,OAAA"}

package/dist/set-field.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"set-field.mjs","names":["current: any"],"sources":["../src/set-field.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nimport { isObjectIndex } from \"@stryke/type-checks/is-object-index\";\nimport { isString } from \"@stryke/type-checks/is-string\";\nimport type { DeepKey } from \"@stryke/types/object\";\nimport { toPath } from \"./to-path\";\n\n/**\n * Sets a value at a given deep path in an object.\n *\n * @param object - The object to set the value in.\n * @param path - The deep path to set the value at.\n * @param value - The value to set.\n * @returns The object with the value set at the given deep path.\n */\nexport function setField<\n  TObject extends Record<string, any> = Record<string, any>\n>(object: TObject, path: DeepKey<TObject>, value: unknown): TObject {\n  const resolvedPath = Array.isArray(path)\n    ? path\n    : isString(path)\n      ? toPath(path)\n      : [path];\n\n  // Validate resolvedPath to prevent prototype pollution\n  for (const key of resolvedPath) {\n    if (key === \"__proto__\" || key === \"constructor\" || key === \"prototype\") {\n      throw new Error(`Invalid key in path: ${key}`);\n    }\n  }\n\n  let current: any = object;\n  for (let i = 0; i < resolvedPath.length - 1; i++) {\n    const key = resolvedPath[i];\n    const nextKey = resolvedPath[i + 1];\n\n    if (current[key] === null) {\n      current[key] = isObjectIndex(nextKey) ? [] : {};\n    }\n\n    current = current[key];\n  }\n\n  const lastKey = resolvedPath.at(-1);\n  if (lastKey) {\n    current[lastKey] = value;\n  }\n\n  return object;\n}\n"],"mappings":";;;;;;;;;;;;;AA+BA,SAAgB,SAEd,QAAiB,MAAwB,OAAyB;CAClE,MAAM,eAAe,MAAM,QAAQ,KAAK,GACpC,OACA,SAAS,KAAK,GACZ,OAAO,KAAK,GACZ,CAAC,KAAK;AAGZ,MAAK,MAAM,OAAO,aAChB,KAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,YAC1D,OAAM,IAAI,MAAM,wBAAwB,MAAM;CAIlD,IAAIA,UAAe;AACnB,MAAK,IAAI,IAAI,GAAG,IAAI,aAAa,SAAS,GAAG,KAAK;EAChD,MAAM,MAAM,aAAa;EACzB,MAAM,UAAU,aAAa,IAAI;AAEjC,MAAI,QAAQ,SAAS,KACnB,SAAQ,OAAO,cAAc,QAAQ,GAAG,EAAE,GAAG,EAAE;AAGjD,YAAU,QAAQ;;CAGpB,MAAM,UAAU,aAAa,GAAG,GAAG;AACnC,KAAI,QACF,SAAQ,WAAW;AAGrB,QAAO"}
+{"version":3,"file":"set-field.mjs","names":[],"sources":["../src/set-field.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nimport { isObjectIndex } from \"@stryke/type-checks/is-object-index\";\nimport { isString } from \"@stryke/type-checks/is-string\";\nimport type { DeepKey } from \"@stryke/types/object\";\nimport { toPath } from \"./to-path\";\n\n/**\n * Sets a value at a given deep path in an object.\n *\n * @param object - The object to set the value in.\n * @param path - The deep path to set the value at.\n * @param value - The value to set.\n * @returns The object with the value set at the given deep path.\n */\nexport function setField<\n  TObject extends Record<string, any> = Record<string, any>\n>(object: TObject, path: DeepKey<TObject>, value: unknown): TObject {\n  const resolvedPath = Array.isArray(path)\n    ? path\n    : isString(path)\n      ? toPath(path)\n      : [path];\n\n  // Validate resolvedPath to prevent prototype pollution\n  for (const key of resolvedPath) {\n    if (key === \"__proto__\" || key === \"constructor\" || key === \"prototype\") {\n      throw new Error(`Invalid key in path: ${key}`);\n    }\n  }\n\n  let current: any = object;\n  for (let i = 0; i < resolvedPath.length - 1; i++) {\n    const key = resolvedPath[i];\n    const nextKey = resolvedPath[i + 1];\n\n    if (current[key] === null) {\n      current[key] = isObjectIndex(nextKey) ? [] : {};\n    }\n\n    current = current[key];\n  }\n\n  const lastKey = resolvedPath.at(-1);\n  if (lastKey) {\n    current[lastKey] = value;\n  }\n\n  return object;\n}\n"],"mappings":";;;;;;;;;;;;;AA+BA,SAAgB,SAEd,QAAiB,MAAwB,OAAyB;CAClE,MAAM,eAAe,MAAM,QAAQ,KAAK,GACpC,OACA,SAAS,KAAK,GACZ,OAAO,KAAK,GACZ,CAAC,KAAK;AAGZ,MAAK,MAAM,OAAO,aAChB,KAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,YAC1D,OAAM,IAAI,MAAM,wBAAwB,MAAM;CAIlD,IAAI,UAAe;AACnB,MAAK,IAAI,IAAI,GAAG,IAAI,aAAa,SAAS,GAAG,KAAK;EAChD,MAAM,MAAM,aAAa;EACzB,MAAM,UAAU,aAAa,IAAI;AAEjC,MAAI,QAAQ,SAAS,KACnB,SAAQ,OAAO,cAAc,QAAQ,GAAG,EAAE,GAAG,EAAE;AAGjD,YAAU,QAAQ;;CAGpB,MAAM,UAAU,aAAa,GAAG,GAAG;AACnC,KAAI,QACF,SAAQ,WAAW;AAGrB,QAAO"}

package/dist/to-deep-key.cjs

@@ -1,3 +1,4 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 const require_is_number = require('./type-checks/src/is-number.cjs');
 const require_is_set_string = require('./type-checks/src/is-set-string.cjs');
 

package/dist/to-deep-key.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"to-deep-key.d.cts","names":[],"sources":["../src/to-deep-key.ts"],"sourcesContent":[],"mappings":";;AAqCA;AA0BA;;;;;;;;;;;;;;iBA1BgB,SAAA;;;;;;;;;;;;;;;;;;;;;iBA0BA,gBAAA"}
+{"version":3,"file":"to-deep-key.d.cts","names":[],"sources":["../src/to-deep-key.ts"],"mappings":";;AAqCA;;;;;AA0BA;;;;;;;;;;iBA1BgB,SAAA,CAAU,IAAA;;;;;;;;;;;;;;;;;;;;;iBA0BV,gBAAA,CACd,OAAA,UACA,IAAA"}

package/dist/to-deep-key.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"to-deep-key.d.mts","names":[],"sources":["../src/to-deep-key.ts"],"sourcesContent":[],"mappings":";;AAqCA;AA0BA;;;;;;;;;;;;;;iBA1BgB,SAAA;;;;;;;;;;;;;;;;;;;;;iBA0BA,gBAAA"}
+{"version":3,"file":"to-deep-key.d.mts","names":[],"sources":["../src/to-deep-key.ts"],"mappings":";;AAqCA;;;;;AA0BA;;;;;;;;;;iBA1BgB,SAAA,CAAU,IAAA;;;;;;;;;;;;;;;;;;;;;iBA0BV,gBAAA,CACd,OAAA,UACA,IAAA"}

package/dist/to-path.cjs

@@ -1,3 +1,4 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 
 //#region src/to-path.ts
 const DOTS_KEY = /^[\w.]+$/g;

package/dist/to-path.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"to-path.d.cts","names":[],"sources":["../src/to-path.ts"],"sourcesContent":[],"mappings":";;AAyDA;;;;;;;;;;;;;;;;;;iBAAgB,MAAA"}
+{"version":3,"file":"to-path.d.cts","names":[],"sources":["../src/to-path.ts"],"mappings":";;AAyDA;;;;;;;;;;;;;;;;;;iBAAgB,MAAA,CAAO,OAAA"}

package/dist/to-path.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"to-path.d.mts","names":[],"sources":["../src/to-path.ts"],"sourcesContent":[],"mappings":";;AAyDA;;;;;;;;;;;;;;;;;;iBAAgB,MAAA"}
+{"version":3,"file":"to-path.d.mts","names":[],"sources":["../src/to-path.ts"],"mappings":";;AAyDA;;;;;;;;;;;;;;;;;;iBAAgB,MAAA,CAAO,OAAA"}

package/dist/to-path.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"to-path.mjs","names":["result: string[]"],"sources":["../src/to-path.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nconst DOTS_KEY = /^[\\w.]+$/g;\n\nconst ESCAPE_REGEXP = /\\\\(?<temp1>\\\\)?/g;\nconst PROPERTY_REGEXP = new RegExp(\n  // Match anything that isn't a dot or bracket.\n  `${String.raw`[^.[\\]]+`}|${\n    // Or match property names within brackets.\n    String.raw`\\[(?:`\n    // Match a non-string expression.\n  }([^\"'][^[]*)` +\n    `|${\n      // Or match strings (supports escaping characters).\n      String.raw`([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2`\n    }${String.raw`)\\]`}|${\n      // Or match \"\" as the space between consecutive dots or empty brackets.\n      String.raw`(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))`\n    }`,\n  \"g\"\n);\n\n/**\n * Converts a deep key string into an array of path segments.\n *\n * @remarks\n * This function takes a string representing a deep key (e.g., 'a.b.c' or 'a[b][c]') and breaks it down into an array of strings, each representing a segment of the path.\n *\n * @example\n * ```ts\n * toPath('a.b.c') // Returns ['a', 'b', 'c']\n * toPath('a[b][c]') // Returns ['a', 'b', 'c']\n * toPath('.a.b.c') // Returns ['', 'a', 'b', 'c']\n * toPath('a[\"b.c\"].d') // Returns ['a', 'b.c', 'd']\n * toPath('') // Returns []\n * toPath('.a[b].c.d[e][\"f.g\"].h') // Returns ['', 'a', 'b', 'c', 'd', 'e', 'f.g', 'h']\n * ```\n *\n * @param deepKey - The deep key string to convert.\n * @returns An array of strings, each representing a segment of the path.\n */\nexport function toPath(deepKey: string): string[] {\n  if (DOTS_KEY.test(deepKey)) {\n    return deepKey.split(\".\");\n  }\n\n  const result: string[] = [];\n\n  if (deepKey[0] === \".\") {\n    result.push(\"\");\n  }\n\n  const matches = deepKey.matchAll(PROPERTY_REGEXP);\n\n  for (const match of matches) {\n    let key = match[0];\n    const expr = match[1];\n    const quote = match[2];\n    const substr = match[3];\n\n    if (quote && substr) {\n      key = substr.replace(ESCAPE_REGEXP, \"$1\");\n    } else if (expr) {\n      key = expr;\n    }\n\n    result.push(key);\n  }\n\n  return result;\n}\n"],"mappings":";AAkBA,MAAM,WAAW;AAEjB,MAAM,gBAAgB;AACtB,MAAM,kBAAkB,IAAI,OAE1B,GAAG,OAAO,GAAG,WAAW,GAEtB,OAAO,GAAG,QAEX,eAGG,OAAO,GAAG,oCACT,OAAO,GAAG,MAAM,GAEjB,OAAO,GAAG,kCAEd,IACD;;;;;;;;;;;;;;;;;;;;AAqBD,SAAgB,OAAO,SAA2B;AAChD,KAAI,SAAS,KAAK,QAAQ,CACxB,QAAO,QAAQ,MAAM,IAAI;CAG3B,MAAMA,SAAmB,EAAE;AAE3B,KAAI,QAAQ,OAAO,IACjB,QAAO,KAAK,GAAG;CAGjB,MAAM,UAAU,QAAQ,SAAS,gBAAgB;AAEjD,MAAK,MAAM,SAAS,SAAS;EAC3B,IAAI,MAAM,MAAM;EAChB,MAAM,OAAO,MAAM;EACnB,MAAM,QAAQ,MAAM;EACpB,MAAM,SAAS,MAAM;AAErB,MAAI,SAAS,OACX,OAAM,OAAO,QAAQ,eAAe,KAAK;WAChC,KACT,OAAM;AAGR,SAAO,KAAK,IAAI;;AAGlB,QAAO"}
+{"version":3,"file":"to-path.mjs","names":[],"sources":["../src/to-path.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nconst DOTS_KEY = /^[\\w.]+$/g;\n\nconst ESCAPE_REGEXP = /\\\\(?<temp1>\\\\)?/g;\nconst PROPERTY_REGEXP = new RegExp(\n  // Match anything that isn't a dot or bracket.\n  `${String.raw`[^.[\\]]+`}|${\n    // Or match property names within brackets.\n    String.raw`\\[(?:`\n    // Match a non-string expression.\n  }([^\"'][^[]*)` +\n    `|${\n      // Or match strings (supports escaping characters).\n      String.raw`([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2`\n    }${String.raw`)\\]`}|${\n      // Or match \"\" as the space between consecutive dots or empty brackets.\n      String.raw`(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))`\n    }`,\n  \"g\"\n);\n\n/**\n * Converts a deep key string into an array of path segments.\n *\n * @remarks\n * This function takes a string representing a deep key (e.g., 'a.b.c' or 'a[b][c]') and breaks it down into an array of strings, each representing a segment of the path.\n *\n * @example\n * ```ts\n * toPath('a.b.c') // Returns ['a', 'b', 'c']\n * toPath('a[b][c]') // Returns ['a', 'b', 'c']\n * toPath('.a.b.c') // Returns ['', 'a', 'b', 'c']\n * toPath('a[\"b.c\"].d') // Returns ['a', 'b.c', 'd']\n * toPath('') // Returns []\n * toPath('.a[b].c.d[e][\"f.g\"].h') // Returns ['', 'a', 'b', 'c', 'd', 'e', 'f.g', 'h']\n * ```\n *\n * @param deepKey - The deep key string to convert.\n * @returns An array of strings, each representing a segment of the path.\n */\nexport function toPath(deepKey: string): string[] {\n  if (DOTS_KEY.test(deepKey)) {\n    return deepKey.split(\".\");\n  }\n\n  const result: string[] = [];\n\n  if (deepKey[0] === \".\") {\n    result.push(\"\");\n  }\n\n  const matches = deepKey.matchAll(PROPERTY_REGEXP);\n\n  for (const match of matches) {\n    let key = match[0];\n    const expr = match[1];\n    const quote = match[2];\n    const substr = match[3];\n\n    if (quote && substr) {\n      key = substr.replace(ESCAPE_REGEXP, \"$1\");\n    } else if (expr) {\n      key = expr;\n    }\n\n    result.push(key);\n  }\n\n  return result;\n}\n"],"mappings":";AAkBA,MAAM,WAAW;AAEjB,MAAM,gBAAgB;AACtB,MAAM,kBAAkB,IAAI,OAE1B,GAAG,OAAO,GAAG,WAAW,GAEtB,OAAO,GAAG,QAEX,eAGG,OAAO,GAAG,oCACT,OAAO,GAAG,MAAM,GAEjB,OAAO,GAAG,kCAEd,IACD;;;;;;;;;;;;;;;;;;;;AAqBD,SAAgB,OAAO,SAA2B;AAChD,KAAI,SAAS,KAAK,QAAQ,CACxB,QAAO,QAAQ,MAAM,IAAI;CAG3B,MAAM,SAAmB,EAAE;AAE3B,KAAI,QAAQ,OAAO,IACjB,QAAO,KAAK,GAAG;CAGjB,MAAM,UAAU,QAAQ,SAAS,gBAAgB;AAEjD,MAAK,MAAM,SAAS,SAAS;EAC3B,IAAI,MAAM,MAAM;EAChB,MAAM,OAAO,MAAM;EACnB,MAAM,QAAQ,MAAM;EACpB,MAAM,SAAS,MAAM;AAErB,MAAI,SAAS,OACX,OAAM,OAAO,QAAQ,eAAe,KAAK;WAChC,KACT,OAAM;AAGR,SAAO,KAAK,IAAI;;AAGlB,QAAO"}

package/dist/type-checks/src/is-buffer.cjs

@@ -5,7 +5,7 @@ const isBufferExists = typeof node_buffer.Buffer !== "undefined";
 /**
 * Check if the provided value's type is `Buffer`
 */
-const isBuffer = isBufferExists ? node_buffer.Buffer.isBuffer.bind(node_buffer.Buffer) : function isBuffer$1(_) {
+const isBuffer = isBufferExists ? node_buffer.Buffer.isBuffer.bind(node_buffer.Buffer) : function isBuffer(_) {
 	return false;
 };
 

package/dist/type-checks/src/is-buffer.mjs

@@ -5,7 +5,7 @@ const isBufferExists = typeof Buffer !== "undefined";
 /**
 * Check if the provided value's type is `Buffer`
 */
-const isBuffer = isBufferExists ? Buffer.isBuffer.bind(Buffer) : function isBuffer$1(_) {
+const isBuffer = isBufferExists ? Buffer.isBuffer.bind(Buffer) : function isBuffer(_) {
 	return false;
 };
 

package/dist/type-checks/src/is-buffer.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"is-buffer.mjs","names":["isBuffer: typeof Buffer.isBuffer","isBuffer"],"sources":["../../../../type-checks/src/is-buffer.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nimport { Buffer } from \"node:buffer\";\n\nexport const isBufferExists = typeof Buffer !== \"undefined\";\n\n/**\n * Check if the provided value's type is `Buffer`\n */\nexport const isBuffer: typeof Buffer.isBuffer = isBufferExists\n  ? Buffer.isBuffer.bind(Buffer)\n  : /**\n   * Check if the provided value's type is `Buffer`\n\n   * @param _ - The value to type check\n   * @returns An indicator specifying if the value provided is of type `Buffer`\n   */\n    function isBuffer(_: Parameters<typeof Buffer.isBuffer>[0]): _ is Buffer {\n      return false;\n    };\n"],"mappings":";;;AAoBA,MAAa,iBAAiB,OAAO,WAAW;;;;AAKhD,MAAaA,WAAmC,iBAC5C,OAAO,SAAS,KAAK,OAAO,GAO5B,SAASC,WAAS,GAAuD;AACvE,QAAO"}
+{"version":3,"file":"is-buffer.mjs","names":[],"sources":["../../../../type-checks/src/is-buffer.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nimport { Buffer } from \"node:buffer\";\n\nexport const isBufferExists = typeof Buffer !== \"undefined\";\n\n/**\n * Check if the provided value's type is `Buffer`\n */\nexport const isBuffer: typeof Buffer.isBuffer = isBufferExists\n  ? Buffer.isBuffer.bind(Buffer)\n  : /**\n   * Check if the provided value's type is `Buffer`\n\n   * @param _ - The value to type check\n   * @returns An indicator specifying if the value provided is of type `Buffer`\n   */\n    function isBuffer(_: Parameters<typeof Buffer.isBuffer>[0]): _ is Buffer {\n      return false;\n    };\n"],"mappings":";;;AAoBA,MAAa,iBAAiB,OAAO,WAAW;;;;AAKhD,MAAa,WAAmC,iBAC5C,OAAO,SAAS,KAAK,OAAO,GAO5B,SAAS,SAAS,GAAuD;AACvE,QAAO"}

package/dist/type-checks/src/is-deep-key.cjs

@@ -21,11 +21,6 @@ function isDeepKey(key) {
 		case "number":
 		case "symbol": return false;
 		case "string": return key.includes(".") || key.includes("[") || key.includes("]");
-		case "bigint":
-		case "boolean":
-		case "function":
-		case "object":
-		case "undefined":
 		default: return false;
 	}
 }

package/dist/type-checks/src/is-deep-key.mjs

@@ -20,11 +20,6 @@ function isDeepKey(key) {
 		case "number":
 		case "symbol": return false;
 		case "string": return key.includes(".") || key.includes("[") || key.includes("]");
-		case "bigint":
-		case "boolean":
-		case "function":
-		case "object":
-		case "undefined":
 		default: return false;
 	}
 }

package/dist/type-checks/src/is-deep-key.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"is-deep-key.mjs","names":[],"sources":["../../../../type-checks/src/is-deep-key.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nimport type { DeepKey } from \"@stryke/types\";\n\n/**\n * Checks if a given key is a deep key.\n *\n * A deep key is a string that contains a dot (.) or square brackets with a property accessor.\n *\n * @example\n * isDeepKey('a.b') // true\n * isDeepKey('a[b]') // true\n * isDeepKey('a') // false\n * isDeepKey(123) // false\n * isDeepKey('a.b.c') // true\n * isDeepKey('a[b][c]') // true\n *\n * @param key - The key to check.\n * @returns Returns true if the key is a deep key, otherwise false.\n */\nexport function isDeepKey(key: PropertyKey): key is DeepKey<any> {\n  switch (typeof key) {\n    case \"number\":\n    case \"symbol\": {\n      return false;\n    }\n    case \"string\": {\n      return key.includes(\".\") || key.includes(\"[\") || key.includes(\"]\");\n    }\n    case \"bigint\":\n    case \"boolean\":\n    case \"function\":\n    case \"object\":\n    case \"undefined\":\n    default: {\n      return false;\n    }\n  }\n}\n\n/**\n * Checks if a given key is a deep key or normal (shallow key).\n *\n * A deep key is a string that contains a dot (.) or square brackets with a property accessor.\n *\n * @example\n * isDeepKey('a.b') // true\n * isDeepKey('a[b]') // true\n * isDeepKey('a') // true\n * isDeepKey(123) // false\n * isDeepKey('a.b.c') // true\n * isDeepKey('a[b][c]') // true\n *\n * @param key - The key to check.\n * @returns Returns true if the key is a deep key, otherwise false.\n */\nexport function isKeyOrDeepKey(key: PropertyKey): key is DeepKey<any> {\n  switch (typeof key) {\n    case \"number\": {\n      return true;\n    }\n    case \"symbol\": {\n      return false;\n    }\n    case \"string\": {\n      return true;\n    }\n    case \"bigint\":\n    case \"boolean\":\n    case \"function\":\n    case \"object\":\n    case \"undefined\":\n    default: {\n      return false;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAAgB,UAAU,KAAuC;AAC/D,SAAQ,OAAO,KAAf;EACE,KAAK;EACL,KAAK,SACH,QAAO;EAET,KAAK,SACH,QAAO,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,IAAI;EAEpE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,QACE,QAAO"}
+{"version":3,"file":"is-deep-key.mjs","names":[],"sources":["../../../../type-checks/src/is-deep-key.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nimport type { DeepKey } from \"@stryke/types\";\n\n/**\n * Checks if a given key is a deep key.\n *\n * A deep key is a string that contains a dot (.) or square brackets with a property accessor.\n *\n * @example\n * isDeepKey('a.b') // true\n * isDeepKey('a[b]') // true\n * isDeepKey('a') // false\n * isDeepKey(123) // false\n * isDeepKey('a.b.c') // true\n * isDeepKey('a[b][c]') // true\n *\n * @param key - The key to check.\n * @returns Returns true if the key is a deep key, otherwise false.\n */\nexport function isDeepKey(key: PropertyKey): key is DeepKey<any> {\n  switch (typeof key) {\n    case \"number\":\n    case \"symbol\": {\n      return false;\n    }\n    case \"string\": {\n      return key.includes(\".\") || key.includes(\"[\") || key.includes(\"]\");\n    }\n    case \"bigint\":\n    case \"boolean\":\n    case \"function\":\n    case \"object\":\n    case \"undefined\":\n    default: {\n      return false;\n    }\n  }\n}\n\n/**\n * Checks if a given key is a deep key or normal (shallow key).\n *\n * A deep key is a string that contains a dot (.) or square brackets with a property accessor.\n *\n * @example\n * isDeepKey('a.b') // true\n * isDeepKey('a[b]') // true\n * isDeepKey('a') // true\n * isDeepKey(123) // false\n * isDeepKey('a.b.c') // true\n * isDeepKey('a[b][c]') // true\n *\n * @param key - The key to check.\n * @returns Returns true if the key is a deep key, otherwise false.\n */\nexport function isKeyOrDeepKey(key: PropertyKey): key is DeepKey<any> {\n  switch (typeof key) {\n    case \"number\": {\n      return true;\n    }\n    case \"symbol\": {\n      return false;\n    }\n    case \"string\": {\n      return true;\n    }\n    case \"bigint\":\n    case \"boolean\":\n    case \"function\":\n    case \"object\":\n    case \"undefined\":\n    default: {\n      return false;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAAgB,UAAU,KAAuC;AAC/D,SAAQ,OAAO,KAAf;EACE,KAAK;EACL,KAAK,SACH,QAAO;EAET,KAAK,SACH,QAAO,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,IAAI;EAOpE,QACE,QAAO"}

package/dist/type-checks/src/is-object-index.cjs

@@ -12,11 +12,6 @@ function isObjectIndex(value) {
 		case "number": return Number.isInteger(value) && value >= 0 && value < Number.MAX_SAFE_INTEGER;
 		case "symbol": return false;
 		case "string": return IS_UNSIGNED_INTEGER.test(value);
-		case "bigint":
-		case "boolean":
-		case "function":
-		case "object":
-		case "undefined":
 		default: return false;
 	}
 }

package/dist/type-checks/src/is-object-index.mjs

@@ -11,11 +11,6 @@ function isObjectIndex(value) {
 		case "number": return Number.isInteger(value) && value >= 0 && value < Number.MAX_SAFE_INTEGER;
 		case "symbol": return false;
 		case "string": return IS_UNSIGNED_INTEGER.test(value);
-		case "bigint":
-		case "boolean":
-		case "function":
-		case "object":
-		case "undefined":
 		default: return false;
 	}
 }

package/dist/type-checks/src/is-object-index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"is-object-index.mjs","names":[],"sources":["../../../../type-checks/src/is-object-index.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nconst IS_UNSIGNED_INTEGER = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if the given value is an object index.\n *\n * @param value - The value to check.\n * @returns Returns `true` if the value is an object index, otherwise `false`.\n */\nexport function isObjectIndex(\n  value: PropertyKey\n): value is string | number | symbol {\n  switch (typeof value) {\n    case \"number\": {\n      return (\n        Number.isInteger(value) && value >= 0 && value < Number.MAX_SAFE_INTEGER\n      );\n    }\n    case \"symbol\": {\n      return false;\n    }\n    case \"string\": {\n      return IS_UNSIGNED_INTEGER.test(value);\n    }\n    case \"bigint\":\n    case \"boolean\":\n    case \"function\":\n    case \"object\":\n    case \"undefined\":\n    default: {\n      return false;\n    }\n  }\n}\n"],"mappings":";AAkBA,MAAM,sBAAsB;;;;;;;AAQ5B,SAAgB,cACd,OACmC;AACnC,SAAQ,OAAO,OAAf;EACE,KAAK,SACH,QACE,OAAO,UAAU,MAAM,IAAI,SAAS,KAAK,QAAQ,OAAO;EAG5D,KAAK,SACH,QAAO;EAET,KAAK,SACH,QAAO,oBAAoB,KAAK,MAAM;EAExC,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,QACE,QAAO"}
+{"version":3,"file":"is-object-index.mjs","names":[],"sources":["../../../../type-checks/src/is-object-index.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nconst IS_UNSIGNED_INTEGER = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if the given value is an object index.\n *\n * @param value - The value to check.\n * @returns Returns `true` if the value is an object index, otherwise `false`.\n */\nexport function isObjectIndex(\n  value: PropertyKey\n): value is string | number | symbol {\n  switch (typeof value) {\n    case \"number\": {\n      return (\n        Number.isInteger(value) && value >= 0 && value < Number.MAX_SAFE_INTEGER\n      );\n    }\n    case \"symbol\": {\n      return false;\n    }\n    case \"string\": {\n      return IS_UNSIGNED_INTEGER.test(value);\n    }\n    case \"bigint\":\n    case \"boolean\":\n    case \"function\":\n    case \"object\":\n    case \"undefined\":\n    default: {\n      return false;\n    }\n  }\n}\n"],"mappings":";AAkBA,MAAM,sBAAsB;;;;;;;AAQ5B,SAAgB,cACd,OACmC;AACnC,SAAQ,OAAO,OAAf;EACE,KAAK,SACH,QACE,OAAO,UAAU,MAAM,IAAI,SAAS,KAAK,QAAQ,OAAO;EAG5D,KAAK,SACH,QAAO;EAET,KAAK,SACH,QAAO,oBAAoB,KAAK,MAAM;EAOxC,QACE,QAAO"}

package/dist/types/src/base.d.cts

@@ -1,5 +1,4 @@
 //#region ../types/src/base.d.ts
-
 type Nullish = undefined | null;
 type ComputeRange<N extends number, Result extends unknown[] = []> = Result["length"] extends N ? Result : ComputeRange<N, [...Result, Result["length"]]>;
 type Index40 = ComputeRange<40>[number];

package/dist/types/src/base.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"base.d.cts","names":[],"sources":["../../../../types/src/base.ts"],"sourcesContent":[],"mappings":";;KAuIY,OAAA;KA2OA,gEAGR,yBAAyB,IACzB,SACA,aAAa,OAAO,QAAQ;KAEpB,OAAA,GAAU"}
+{"version":3,"file":"base.d.cts","names":[],"sources":["../../../../types/src/base.ts"],"mappings":";KAuIY,OAAA;AAAA,KA2OA,YAAA,oDAGR,MAAA,mBAAyB,CAAA,GACzB,MAAA,GACA,YAAA,CAAa,CAAA,MAAO,MAAA,EAAQ,MAAA;AAAA,KAEpB,OAAA,GAAU,YAAA"}

package/dist/types/src/base.d.mts

@@ -1,5 +1,4 @@
 //#region ../types/src/base.d.ts
-
 type Nullish = undefined | null;
 type ComputeRange<N extends number, Result extends unknown[] = []> = Result["length"] extends N ? Result : ComputeRange<N, [...Result, Result["length"]]>;
 type Index40 = ComputeRange<40>[number];

package/dist/types/src/base.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"base.d.mts","names":[],"sources":["../../../../types/src/base.ts"],"sourcesContent":[],"mappings":";;KAuIY,OAAA;KA2OA,gEAGR,yBAAyB,IACzB,SACA,aAAa,OAAO,QAAQ;KAEpB,OAAA,GAAU"}
+{"version":3,"file":"base.d.mts","names":[],"sources":["../../../../types/src/base.ts"],"mappings":";KAuIY,OAAA;AAAA,KA2OA,YAAA,oDAGR,MAAA,mBAAyB,CAAA,GACzB,MAAA,GACA,YAAA,CAAa,CAAA,MAAO,MAAA,EAAQ,MAAA;AAAA,KAEpB,OAAA,GAAU,YAAA"}

package/dist/types/src/json.d.cts

@@ -1,5 +1,4 @@
 //#region ../types/src/json.d.ts
-
 /**
  * Get keys of the given type as strings.
  *

package/dist/types/src/json.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"json.d.cts","names":[],"sources":["../../../../types/src/json.ts"],"sourcesContent":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;KA2FY,2BACP,cAAc"}
+{"version":3,"file":"json.d.cts","names":[],"sources":["../../../../types/src/json.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;KA2FY,WAAA,gBACP,OAAA,OAAc,QAAA"}

package/dist/types/src/json.d.mts

@@ -1,5 +1,4 @@
 //#region ../types/src/json.d.ts
-
 /**
  * Get keys of the given type as strings.
  *

package/dist/types/src/json.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"json.d.mts","names":[],"sources":["../../../../types/src/json.ts"],"sourcesContent":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;KA2FY,2BACP,cAAc"}
+{"version":3,"file":"json.d.mts","names":[],"sources":["../../../../types/src/json.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;KA2FY,WAAA,gBACP,OAAA,OAAc,QAAA"}