@leaflink/stash 51.11.0 → 51.12.0

package/dist/parseISO-wlfIB_QJ.js.map

@@ -1 +1 @@
-{"version":3,"file":"parseISO-wlfIB_QJ.js","sources":["../node_modules/date-fns/constants.mjs","../node_modules/date-fns/parseISO.mjs"],"sourcesContent":["/**\n * @module constants\n * @summary Useful constants\n * @description\n * Collection of useful date constants.\n *\n * The constants could be imported from `date-fns/constants`:\n *\n * ```ts\n * import { maxTime, minTime } from \"./constants/date-fns/constants\";\n *\n * function isAllowedTime(time) {\n *   return time <= maxTime && time >= minTime;\n * }\n * ```\n */\n\n/**\n * @constant\n * @name daysInWeek\n * @summary Days in 1 week.\n */\nexport const daysInWeek = 7;\n\n/**\n * @constant\n * @name daysInYear\n * @summary Days in 1 year.\n *\n * @description\n * How many days in a year.\n *\n * One years equals 365.2425 days according to the formula:\n *\n * > Leap year occures every 4 years, except for years that are divisable by 100 and not divisable by 400.\n * > 1 mean year = (365+1/4-1/100+1/400) days = 365.2425 days\n */\nexport const daysInYear = 365.2425;\n\n/**\n * @constant\n * @name maxTime\n * @summary Maximum allowed time.\n *\n * @example\n * import { maxTime } from \"./constants/date-fns/constants\";\n *\n * const isValid = 8640000000000001 <= maxTime;\n * //=> false\n *\n * new Date(8640000000000001);\n * //=> Invalid Date\n */\nexport const maxTime = Math.pow(10, 8) * 24 * 60 * 60 * 1000;\n\n/**\n * @constant\n * @name minTime\n * @summary Minimum allowed time.\n *\n * @example\n * import { minTime } from \"./constants/date-fns/constants\";\n *\n * const isValid = -8640000000000001 >= minTime;\n * //=> false\n *\n * new Date(-8640000000000001)\n * //=> Invalid Date\n */\nexport const minTime = -maxTime;\n\n/**\n * @constant\n * @name millisecondsInWeek\n * @summary Milliseconds in 1 week.\n */\nexport const millisecondsInWeek = 604800000;\n\n/**\n * @constant\n * @name millisecondsInDay\n * @summary Milliseconds in 1 day.\n */\nexport const millisecondsInDay = 86400000;\n\n/**\n * @constant\n * @name millisecondsInMinute\n * @summary Milliseconds in 1 minute\n */\nexport const millisecondsInMinute = 60000;\n\n/**\n * @constant\n * @name millisecondsInHour\n * @summary Milliseconds in 1 hour\n */\nexport const millisecondsInHour = 3600000;\n\n/**\n * @constant\n * @name millisecondsInSecond\n * @summary Milliseconds in 1 second\n */\nexport const millisecondsInSecond = 1000;\n\n/**\n * @constant\n * @name minutesInYear\n * @summary Minutes in 1 year.\n */\nexport const minutesInYear = 525600;\n\n/**\n * @constant\n * @name minutesInMonth\n * @summary Minutes in 1 month.\n */\nexport const minutesInMonth = 43200;\n\n/**\n * @constant\n * @name minutesInDay\n * @summary Minutes in 1 day.\n */\nexport const minutesInDay = 1440;\n\n/**\n * @constant\n * @name minutesInHour\n * @summary Minutes in 1 hour.\n */\nexport const minutesInHour = 60;\n\n/**\n * @constant\n * @name monthsInQuarter\n * @summary Months in 1 quarter.\n */\nexport const monthsInQuarter = 3;\n\n/**\n * @constant\n * @name monthsInYear\n * @summary Months in 1 year.\n */\nexport const monthsInYear = 12;\n\n/**\n * @constant\n * @name quartersInYear\n * @summary Quarters in 1 year\n */\nexport const quartersInYear = 4;\n\n/**\n * @constant\n * @name secondsInHour\n * @summary Seconds in 1 hour.\n */\nexport const secondsInHour = 3600;\n\n/**\n * @constant\n * @name secondsInMinute\n * @summary Seconds in 1 minute.\n */\nexport const secondsInMinute = 60;\n\n/**\n * @constant\n * @name secondsInDay\n * @summary Seconds in 1 day.\n */\nexport const secondsInDay = secondsInHour * 24;\n\n/**\n * @constant\n * @name secondsInWeek\n * @summary Seconds in 1 week.\n */\nexport const secondsInWeek = secondsInDay * 7;\n\n/**\n * @constant\n * @name secondsInYear\n * @summary Seconds in 1 year.\n */\nexport const secondsInYear = secondsInDay * daysInYear;\n\n/**\n * @constant\n * @name secondsInMonth\n * @summary Seconds in 1 month\n */\nexport const secondsInMonth = secondsInYear / 12;\n\n/**\n * @constant\n * @name secondsInQuarter\n * @summary Seconds in 1 quarter.\n */\nexport const secondsInQuarter = secondsInMonth * 3;\n","import { millisecondsInHour, millisecondsInMinute } from \"./constants.mjs\";\n\n/**\n * The {@link parseISO} function options.\n */\n\n/**\n * @name parseISO\n * @category Common Helpers\n * @summary Parse ISO string\n *\n * @description\n * Parse the given string in ISO 8601 format and return an instance of Date.\n *\n * Function accepts complete ISO 8601 formats as well as partial implementations.\n * ISO 8601: http://en.wikipedia.org/wiki/ISO_8601\n *\n * If the argument isn't a string, the function cannot parse the string or\n * the values are invalid, it returns Invalid Date.\n *\n * @typeParam DateType - The `Date` type, the function operates on. Gets inferred from passed arguments. Allows to use extensions like [`UTCDate`](https://github.com/date-fns/utc).\n *\n * @param argument - The value to convert\n * @param options - An object with options\n *\n * @returns The parsed date in the local time zone\n *\n * @example\n * // Convert string '2014-02-11T11:30:30' to date:\n * const result = parseISO('2014-02-11T11:30:30')\n * //=> Tue Feb 11 2014 11:30:30\n *\n * @example\n * // Convert string '+02014101' to date,\n * // if the additional number of digits in the extended year format is 1:\n * const result = parseISO('+02014101', { additionalDigits: 1 })\n * //=> Fri Apr 11 2014 00:00:00\n */\nexport function parseISO(argument, options) {\n  const additionalDigits = options?.additionalDigits ?? 2;\n  const dateStrings = splitDateString(argument);\n\n  let date;\n  if (dateStrings.date) {\n    const parseYearResult = parseYear(dateStrings.date, additionalDigits);\n    date = parseDate(parseYearResult.restDateString, parseYearResult.year);\n  }\n\n  if (!date || isNaN(date.getTime())) {\n    return new Date(NaN);\n  }\n\n  const timestamp = date.getTime();\n  let time = 0;\n  let offset;\n\n  if (dateStrings.time) {\n    time = parseTime(dateStrings.time);\n    if (isNaN(time)) {\n      return new Date(NaN);\n    }\n  }\n\n  if (dateStrings.timezone) {\n    offset = parseTimezone(dateStrings.timezone);\n    if (isNaN(offset)) {\n      return new Date(NaN);\n    }\n  } else {\n    const dirtyDate = new Date(timestamp + time);\n    // JS parsed string assuming it's in UTC timezone\n    // but we need it to be parsed in our timezone\n    // so we use utc values to build date in our timezone.\n    // Year values from 0 to 99 map to the years 1900 to 1999\n    // so set year explicitly with setFullYear.\n    const result = new Date(0);\n    result.setFullYear(\n      dirtyDate.getUTCFullYear(),\n      dirtyDate.getUTCMonth(),\n      dirtyDate.getUTCDate(),\n    );\n    result.setHours(\n      dirtyDate.getUTCHours(),\n      dirtyDate.getUTCMinutes(),\n      dirtyDate.getUTCSeconds(),\n      dirtyDate.getUTCMilliseconds(),\n    );\n    return result;\n  }\n\n  return new Date(timestamp + time + offset);\n}\n\nconst patterns = {\n  dateTimeDelimiter: /[T ]/,\n  timeZoneDelimiter: /[Z ]/i,\n  timezone: /([Z+-].*)$/,\n};\n\nconst dateRegex =\n  /^-?(?:(\\d{3})|(\\d{2})(?:-?(\\d{2}))?|W(\\d{2})(?:-?(\\d{1}))?|)$/;\nconst timeRegex =\n  /^(\\d{2}(?:[.,]\\d*)?)(?::?(\\d{2}(?:[.,]\\d*)?))?(?::?(\\d{2}(?:[.,]\\d*)?))?$/;\nconst timezoneRegex = /^([+-])(\\d{2})(?::?(\\d{2}))?$/;\n\nfunction splitDateString(dateString) {\n  const dateStrings = {};\n  const array = dateString.split(patterns.dateTimeDelimiter);\n  let timeString;\n\n  // The regex match should only return at maximum two array elements.\n  // [date], [time], or [date, time].\n  if (array.length > 2) {\n    return dateStrings;\n  }\n\n  if (/:/.test(array[0])) {\n    timeString = array[0];\n  } else {\n    dateStrings.date = array[0];\n    timeString = array[1];\n    if (patterns.timeZoneDelimiter.test(dateStrings.date)) {\n      dateStrings.date = dateString.split(patterns.timeZoneDelimiter)[0];\n      timeString = dateString.substr(\n        dateStrings.date.length,\n        dateString.length,\n      );\n    }\n  }\n\n  if (timeString) {\n    const token = patterns.timezone.exec(timeString);\n    if (token) {\n      dateStrings.time = timeString.replace(token[1], \"\");\n      dateStrings.timezone = token[1];\n    } else {\n      dateStrings.time = timeString;\n    }\n  }\n\n  return dateStrings;\n}\n\nfunction parseYear(dateString, additionalDigits) {\n  const regex = new RegExp(\n    \"^(?:(\\\\d{4}|[+-]\\\\d{\" +\n      (4 + additionalDigits) +\n      \"})|(\\\\d{2}|[+-]\\\\d{\" +\n      (2 + additionalDigits) +\n      \"})$)\",\n  );\n\n  const captures = dateString.match(regex);\n  // Invalid ISO-formatted year\n  if (!captures) return { year: NaN, restDateString: \"\" };\n\n  const year = captures[1] ? parseInt(captures[1]) : null;\n  const century = captures[2] ? parseInt(captures[2]) : null;\n\n  // either year or century is null, not both\n  return {\n    year: century === null ? year : century * 100,\n    restDateString: dateString.slice((captures[1] || captures[2]).length),\n  };\n}\n\nfunction parseDate(dateString, year) {\n  // Invalid ISO-formatted year\n  if (year === null) return new Date(NaN);\n\n  const captures = dateString.match(dateRegex);\n  // Invalid ISO-formatted string\n  if (!captures) return new Date(NaN);\n\n  const isWeekDate = !!captures[4];\n  const dayOfYear = parseDateUnit(captures[1]);\n  const month = parseDateUnit(captures[2]) - 1;\n  const day = parseDateUnit(captures[3]);\n  const week = parseDateUnit(captures[4]);\n  const dayOfWeek = parseDateUnit(captures[5]) - 1;\n\n  if (isWeekDate) {\n    if (!validateWeekDate(year, week, dayOfWeek)) {\n      return new Date(NaN);\n    }\n    return dayOfISOWeekYear(year, week, dayOfWeek);\n  } else {\n    const date = new Date(0);\n    if (\n      !validateDate(year, month, day) ||\n      !validateDayOfYearDate(year, dayOfYear)\n    ) {\n      return new Date(NaN);\n    }\n    date.setUTCFullYear(year, month, Math.max(dayOfYear, day));\n    return date;\n  }\n}\n\nfunction parseDateUnit(value) {\n  return value ? parseInt(value) : 1;\n}\n\nfunction parseTime(timeString) {\n  const captures = timeString.match(timeRegex);\n  if (!captures) return NaN; // Invalid ISO-formatted time\n\n  const hours = parseTimeUnit(captures[1]);\n  const minutes = parseTimeUnit(captures[2]);\n  const seconds = parseTimeUnit(captures[3]);\n\n  if (!validateTime(hours, minutes, seconds)) {\n    return NaN;\n  }\n\n  return (\n    hours * millisecondsInHour + minutes * millisecondsInMinute + seconds * 1000\n  );\n}\n\nfunction parseTimeUnit(value) {\n  return (value && parseFloat(value.replace(\",\", \".\"))) || 0;\n}\n\nfunction parseTimezone(timezoneString) {\n  if (timezoneString === \"Z\") return 0;\n\n  const captures = timezoneString.match(timezoneRegex);\n  if (!captures) return 0;\n\n  const sign = captures[1] === \"+\" ? -1 : 1;\n  const hours = parseInt(captures[2]);\n  const minutes = (captures[3] && parseInt(captures[3])) || 0;\n\n  if (!validateTimezone(hours, minutes)) {\n    return NaN;\n  }\n\n  return sign * (hours * millisecondsInHour + minutes * millisecondsInMinute);\n}\n\nfunction dayOfISOWeekYear(isoWeekYear, week, day) {\n  const date = new Date(0);\n  date.setUTCFullYear(isoWeekYear, 0, 4);\n  const fourthOfJanuaryDay = date.getUTCDay() || 7;\n  const diff = (week - 1) * 7 + day + 1 - fourthOfJanuaryDay;\n  date.setUTCDate(date.getUTCDate() + diff);\n  return date;\n}\n\n// Validation functions\n\n// February is null to handle the leap year (using ||)\nconst daysInMonths = [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];\n\nfunction isLeapYearIndex(year) {\n  return year % 400 === 0 || (year % 4 === 0 && year % 100 !== 0);\n}\n\nfunction validateDate(year, month, date) {\n  return (\n    month >= 0 &&\n    month <= 11 &&\n    date >= 1 &&\n    date <= (daysInMonths[month] || (isLeapYearIndex(year) ? 29 : 28))\n  );\n}\n\nfunction validateDayOfYearDate(year, dayOfYear) {\n  return dayOfYear >= 1 && dayOfYear <= (isLeapYearIndex(year) ? 366 : 365);\n}\n\nfunction validateWeekDate(_year, week, day) {\n  return week >= 1 && week <= 53 && day >= 0 && day <= 6;\n}\n\nfunction validateTime(hours, minutes, seconds) {\n  if (hours === 24) {\n    return minutes === 0 && seconds === 0;\n  }\n\n  return (\n    seconds >= 0 &&\n    seconds < 60 &&\n    minutes >= 0 &&\n    minutes < 60 &&\n    hours >= 0 &&\n    hours < 25\n  );\n}\n\nfunction validateTimezone(_hours, minutes) {\n  return minutes >= 0 && minutes <= 59;\n}\n\n// Fallback for modularized imports:\nexport default parseISO;\n"],"names":["millisecondsInWeek","millisecondsInDay","millisecondsInMinute","millisecondsInHour","millisecondsInSecond","parseISO","argument","options","dateStrings","splitDateString","date","parseYearResult","parseYear","parseDate","timestamp","time","offset","parseTime","parseTimezone","dirtyDate","result","patterns","dateRegex","timeRegex","timezoneRegex","dateString","array","timeString","token","additionalDigits","regex","captures","year","century","isWeekDate","dayOfYear","parseDateUnit","month","day","week","dayOfWeek","validateWeekDate","dayOfISOWeekYear","validateDate","validateDayOfYearDate","value","hours","parseTimeUnit","minutes","seconds","validateTime","timezoneString","sign","validateTimezone","isoWeekYear","fourthOfJanuaryDay","diff","daysInMonths","isLeapYearIndex","_year","_hours"],"mappings":"AA4EY,MAACA,IAAqB,QAOrBC,IAAoB,OAOpBC,IAAuB,KAOvBC,IAAqB,MAOrBC,IAAuB;AClE7B,SAASC,EAASC,GAAUC,GAAS;AAE1C,QAAMC,IAAcC,EAAgBH,CAAQ;AAE5C,MAAII;AACJ,MAAIF,EAAY,MAAM;AACpB,UAAMG,IAAkBC,EAAUJ,EAAY,MAAM,CAAgB;AACpE,IAAAE,IAAOG,EAAUF,EAAgB,gBAAgBA,EAAgB,IAAI;AAAA,EACvE;AAEA,MAAI,CAACD,KAAQ,MAAMA,EAAK,QAAO,CAAE;AAC/B,WAAO,oBAAI,KAAK,GAAG;AAGrB,QAAMI,IAAYJ,EAAK,QAAO;AAC9B,MAAIK,IAAO,GACPC;AAEJ,MAAIR,EAAY,SACdO,IAAOE,EAAUT,EAAY,IAAI,GAC7B,MAAMO,CAAI;AACZ,WAAO,oBAAI,KAAK,GAAG;AAIvB,MAAIP,EAAY;AAEd,QADAQ,IAASE,EAAcV,EAAY,QAAQ,GACvC,MAAMQ,CAAM;AACd,aAAO,oBAAI,KAAK,GAAG;AAAA,SAEhB;AACL,UAAMG,IAAY,IAAI,KAAKL,IAAYC,CAAI,GAMrCK,IAAS,oBAAI,KAAK,CAAC;AACzB,WAAAA,EAAO;AAAA,MACLD,EAAU,eAAc;AAAA,MACxBA,EAAU,YAAW;AAAA,MACrBA,EAAU,WAAU;AAAA,IAC1B,GACIC,EAAO;AAAA,MACLD,EAAU,YAAW;AAAA,MACrBA,EAAU,cAAa;AAAA,MACvBA,EAAU,cAAa;AAAA,MACvBA,EAAU,mBAAkB;AAAA,IAClC,GACWC;AAAA,EACT;AAEA,SAAO,IAAI,KAAKN,IAAYC,IAAOC,CAAM;AAC3C;AAEA,MAAMK,IAAW;AAAA,EACf,mBAAmB;AAAA,EACnB,mBAAmB;AAAA,EACnB,UAAU;AACZ,GAEMC,IACJ,iEACIC,IACJ,6EACIC,IAAgB;AAEtB,SAASf,EAAgBgB,GAAY;AACnC,QAAMjB,IAAc,CAAA,GACdkB,IAAQD,EAAW,MAAMJ,EAAS,iBAAiB;AACzD,MAAIM;AAIJ,MAAID,EAAM,SAAS;AACjB,WAAOlB;AAiBT,MAdI,IAAI,KAAKkB,EAAM,CAAC,CAAC,IACnBC,IAAaD,EAAM,CAAC,KAEpBlB,EAAY,OAAOkB,EAAM,CAAC,GAC1BC,IAAaD,EAAM,CAAC,GAChBL,EAAS,kBAAkB,KAAKb,EAAY,IAAI,MAClDA,EAAY,OAAOiB,EAAW,MAAMJ,EAAS,iBAAiB,EAAE,CAAC,GACjEM,IAAaF,EAAW;AAAA,IACtBjB,EAAY,KAAK;AAAA,IACjBiB,EAAW;AAAA,EACnB,KAIME,GAAY;AACd,UAAMC,IAAQP,EAAS,SAAS,KAAKM,CAAU;AAC/C,IAAIC,KACFpB,EAAY,OAAOmB,EAAW,QAAQC,EAAM,CAAC,GAAG,EAAE,GAClDpB,EAAY,WAAWoB,EAAM,CAAC,KAE9BpB,EAAY,OAAOmB;AAAA,EAEvB;AAEA,SAAOnB;AACT;AAEA,SAASI,EAAUa,GAAYI,GAAkB;AAC/C,QAAMC,IAAQ,IAAI;AAAA,IAChB,0BACG,IAAID,KACL,yBACC,IAAIA,KACL;AAAA,EACN,GAEQE,IAAWN,EAAW,MAAMK,CAAK;AAEvC,MAAI,CAACC,EAAU,QAAO,EAAE,MAAM,KAAK,gBAAgB,GAAE;AAErD,QAAMC,IAAOD,EAAS,CAAC,IAAI,SAASA,EAAS,CAAC,CAAC,IAAI,MAC7CE,IAAUF,EAAS,CAAC,IAAI,SAASA,EAAS,CAAC,CAAC,IAAI;AAGtD,SAAO;AAAA,IACL,MAAME,MAAY,OAAOD,IAAOC,IAAU;AAAA,IAC1C,gBAAgBR,EAAW,OAAOM,EAAS,CAAC,KAAKA,EAAS,CAAC,GAAG,MAAM;AAAA,EACxE;AACA;AAEA,SAASlB,EAAUY,GAAYO,GAAM;AAEnC,MAAIA,MAAS,KAAM,QAAO,oBAAI,KAAK,GAAG;AAEtC,QAAMD,IAAWN,EAAW,MAAMH,CAAS;AAE3C,MAAI,CAACS,EAAU,QAAO,oBAAI,KAAK,GAAG;AAElC,QAAMG,IAAa,CAAC,CAACH,EAAS,CAAC,GACzBI,IAAYC,EAAcL,EAAS,CAAC,CAAC,GACrCM,IAAQD,EAAcL,EAAS,CAAC,CAAC,IAAI,GACrCO,IAAMF,EAAcL,EAAS,CAAC,CAAC,GAC/BQ,IAAOH,EAAcL,EAAS,CAAC,CAAC,GAChCS,IAAYJ,EAAcL,EAAS,CAAC,CAAC,IAAI;AAE/C,MAAIG;AACF,WAAKO,EAAiBT,GAAMO,GAAMC,CAAS,IAGpCE,EAAiBV,GAAMO,GAAMC,CAAS,IAFpC,oBAAI,KAAK,GAAG;AAGhB;AACL,UAAM9B,IAAO,oBAAI,KAAK,CAAC;AACvB,WACE,CAACiC,EAAaX,GAAMK,GAAOC,CAAG,KAC9B,CAACM,EAAsBZ,GAAMG,CAAS,IAE/B,oBAAI,KAAK,GAAG,KAErBzB,EAAK,eAAesB,GAAMK,GAAO,KAAK,IAAIF,GAAWG,CAAG,CAAC,GAClD5B;AAAA,EACT;AACF;AAEA,SAAS0B,EAAcS,GAAO;AAC5B,SAAOA,IAAQ,SAASA,CAAK,IAAI;AACnC;AAEA,SAAS5B,EAAUU,GAAY;AAC7B,QAAMI,IAAWJ,EAAW,MAAMJ,CAAS;AAC3C,MAAI,CAACQ,EAAU,QAAO;AAEtB,QAAMe,IAAQC,EAAchB,EAAS,CAAC,CAAC,GACjCiB,IAAUD,EAAchB,EAAS,CAAC,CAAC,GACnCkB,IAAUF,EAAchB,EAAS,CAAC,CAAC;AAEzC,SAAKmB,EAAaJ,GAAOE,GAASC,CAAO,IAKvCH,IAAQ,OAAqBE,IAAU,MAAuBC,IAAU,MAJjE;AAMX;AAEA,SAASF,EAAcF,GAAO;AAC5B,SAAQA,KAAS,WAAWA,EAAM,QAAQ,KAAK,GAAG,CAAC,KAAM;AAC3D;AAEA,SAAS3B,EAAciC,GAAgB;AACrC,MAAIA,MAAmB,IAAK,QAAO;AAEnC,QAAMpB,IAAWoB,EAAe,MAAM3B,CAAa;AACnD,MAAI,CAACO,EAAU,QAAO;AAEtB,QAAMqB,IAAOrB,EAAS,CAAC,MAAM,MAAM,KAAK,GAClCe,IAAQ,SAASf,EAAS,CAAC,CAAC,GAC5BiB,IAAWjB,EAAS,CAAC,KAAK,SAASA,EAAS,CAAC,CAAC,KAAM;AAE1D,SAAKsB,EAAiBP,GAAOE,CAAO,IAI7BI,KAAQN,IAAQ,OAAqBE,IAAU,OAH7C;AAIX;AAEA,SAASN,EAAiBY,GAAaf,GAAMD,GAAK;AAChD,QAAM5B,IAAO,oBAAI,KAAK,CAAC;AACvB,EAAAA,EAAK,eAAe4C,GAAa,GAAG,CAAC;AACrC,QAAMC,IAAqB7C,EAAK,UAAS,KAAM,GACzC8C,KAAQjB,IAAO,KAAK,IAAID,IAAM,IAAIiB;AACxC,SAAA7C,EAAK,WAAWA,EAAK,WAAU,IAAK8C,CAAI,GACjC9C;AACT;AAKA,MAAM+C,IAAe,CAAC,IAAI,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAEtE,SAASC,EAAgB1B,GAAM;AAC7B,SAAOA,IAAO,QAAQ,KAAMA,IAAO,MAAM,KAAKA,IAAO,QAAQ;AAC/D;AAEA,SAASW,EAAaX,GAAMK,GAAO3B,GAAM;AACvC,SACE2B,KAAS,KACTA,KAAS,MACT3B,KAAQ,KACRA,MAAS+C,EAAapB,CAAK,MAAMqB,EAAgB1B,CAAI,IAAI,KAAK;AAElE;AAEA,SAASY,EAAsBZ,GAAMG,GAAW;AAC9C,SAAOA,KAAa,KAAKA,MAAcuB,EAAgB1B,CAAI,IAAI,MAAM;AACvE;AAEA,SAASS,EAAiBkB,GAAOpB,GAAMD,GAAK;AAC1C,SAAOC,KAAQ,KAAKA,KAAQ,MAAMD,KAAO,KAAKA,KAAO;AACvD;AAEA,SAASY,EAAaJ,GAAOE,GAASC,GAAS;AAC7C,SAAIH,MAAU,KACLE,MAAY,KAAKC,MAAY,IAIpCA,KAAW,KACXA,IAAU,MACVD,KAAW,KACXA,IAAU,MACVF,KAAS,KACTA,IAAQ;AAEZ;AAEA,SAASO,EAAiBO,GAAQZ,GAAS;AACzC,SAAOA,KAAW,KAAKA,KAAW;AACpC;","x_google_ignoreList":[0,1]}
+{"version":3,"file":"parseISO-wlfIB_QJ.js","sources":["../node_modules/.pnpm/date-fns@3.6.0/node_modules/date-fns/constants.mjs","../node_modules/.pnpm/date-fns@3.6.0/node_modules/date-fns/parseISO.mjs"],"sourcesContent":["/**\n * @module constants\n * @summary Useful constants\n * @description\n * Collection of useful date constants.\n *\n * The constants could be imported from `date-fns/constants`:\n *\n * ```ts\n * import { maxTime, minTime } from \"./constants/date-fns/constants\";\n *\n * function isAllowedTime(time) {\n *   return time <= maxTime && time >= minTime;\n * }\n * ```\n */\n\n/**\n * @constant\n * @name daysInWeek\n * @summary Days in 1 week.\n */\nexport const daysInWeek = 7;\n\n/**\n * @constant\n * @name daysInYear\n * @summary Days in 1 year.\n *\n * @description\n * How many days in a year.\n *\n * One years equals 365.2425 days according to the formula:\n *\n * > Leap year occures every 4 years, except for years that are divisable by 100 and not divisable by 400.\n * > 1 mean year = (365+1/4-1/100+1/400) days = 365.2425 days\n */\nexport const daysInYear = 365.2425;\n\n/**\n * @constant\n * @name maxTime\n * @summary Maximum allowed time.\n *\n * @example\n * import { maxTime } from \"./constants/date-fns/constants\";\n *\n * const isValid = 8640000000000001 <= maxTime;\n * //=> false\n *\n * new Date(8640000000000001);\n * //=> Invalid Date\n */\nexport const maxTime = Math.pow(10, 8) * 24 * 60 * 60 * 1000;\n\n/**\n * @constant\n * @name minTime\n * @summary Minimum allowed time.\n *\n * @example\n * import { minTime } from \"./constants/date-fns/constants\";\n *\n * const isValid = -8640000000000001 >= minTime;\n * //=> false\n *\n * new Date(-8640000000000001)\n * //=> Invalid Date\n */\nexport const minTime = -maxTime;\n\n/**\n * @constant\n * @name millisecondsInWeek\n * @summary Milliseconds in 1 week.\n */\nexport const millisecondsInWeek = 604800000;\n\n/**\n * @constant\n * @name millisecondsInDay\n * @summary Milliseconds in 1 day.\n */\nexport const millisecondsInDay = 86400000;\n\n/**\n * @constant\n * @name millisecondsInMinute\n * @summary Milliseconds in 1 minute\n */\nexport const millisecondsInMinute = 60000;\n\n/**\n * @constant\n * @name millisecondsInHour\n * @summary Milliseconds in 1 hour\n */\nexport const millisecondsInHour = 3600000;\n\n/**\n * @constant\n * @name millisecondsInSecond\n * @summary Milliseconds in 1 second\n */\nexport const millisecondsInSecond = 1000;\n\n/**\n * @constant\n * @name minutesInYear\n * @summary Minutes in 1 year.\n */\nexport const minutesInYear = 525600;\n\n/**\n * @constant\n * @name minutesInMonth\n * @summary Minutes in 1 month.\n */\nexport const minutesInMonth = 43200;\n\n/**\n * @constant\n * @name minutesInDay\n * @summary Minutes in 1 day.\n */\nexport const minutesInDay = 1440;\n\n/**\n * @constant\n * @name minutesInHour\n * @summary Minutes in 1 hour.\n */\nexport const minutesInHour = 60;\n\n/**\n * @constant\n * @name monthsInQuarter\n * @summary Months in 1 quarter.\n */\nexport const monthsInQuarter = 3;\n\n/**\n * @constant\n * @name monthsInYear\n * @summary Months in 1 year.\n */\nexport const monthsInYear = 12;\n\n/**\n * @constant\n * @name quartersInYear\n * @summary Quarters in 1 year\n */\nexport const quartersInYear = 4;\n\n/**\n * @constant\n * @name secondsInHour\n * @summary Seconds in 1 hour.\n */\nexport const secondsInHour = 3600;\n\n/**\n * @constant\n * @name secondsInMinute\n * @summary Seconds in 1 minute.\n */\nexport const secondsInMinute = 60;\n\n/**\n * @constant\n * @name secondsInDay\n * @summary Seconds in 1 day.\n */\nexport const secondsInDay = secondsInHour * 24;\n\n/**\n * @constant\n * @name secondsInWeek\n * @summary Seconds in 1 week.\n */\nexport const secondsInWeek = secondsInDay * 7;\n\n/**\n * @constant\n * @name secondsInYear\n * @summary Seconds in 1 year.\n */\nexport const secondsInYear = secondsInDay * daysInYear;\n\n/**\n * @constant\n * @name secondsInMonth\n * @summary Seconds in 1 month\n */\nexport const secondsInMonth = secondsInYear / 12;\n\n/**\n * @constant\n * @name secondsInQuarter\n * @summary Seconds in 1 quarter.\n */\nexport const secondsInQuarter = secondsInMonth * 3;\n","import { millisecondsInHour, millisecondsInMinute } from \"./constants.mjs\";\n\n/**\n * The {@link parseISO} function options.\n */\n\n/**\n * @name parseISO\n * @category Common Helpers\n * @summary Parse ISO string\n *\n * @description\n * Parse the given string in ISO 8601 format and return an instance of Date.\n *\n * Function accepts complete ISO 8601 formats as well as partial implementations.\n * ISO 8601: http://en.wikipedia.org/wiki/ISO_8601\n *\n * If the argument isn't a string, the function cannot parse the string or\n * the values are invalid, it returns Invalid Date.\n *\n * @typeParam DateType - The `Date` type, the function operates on. Gets inferred from passed arguments. Allows to use extensions like [`UTCDate`](https://github.com/date-fns/utc).\n *\n * @param argument - The value to convert\n * @param options - An object with options\n *\n * @returns The parsed date in the local time zone\n *\n * @example\n * // Convert string '2014-02-11T11:30:30' to date:\n * const result = parseISO('2014-02-11T11:30:30')\n * //=> Tue Feb 11 2014 11:30:30\n *\n * @example\n * // Convert string '+02014101' to date,\n * // if the additional number of digits in the extended year format is 1:\n * const result = parseISO('+02014101', { additionalDigits: 1 })\n * //=> Fri Apr 11 2014 00:00:00\n */\nexport function parseISO(argument, options) {\n  const additionalDigits = options?.additionalDigits ?? 2;\n  const dateStrings = splitDateString(argument);\n\n  let date;\n  if (dateStrings.date) {\n    const parseYearResult = parseYear(dateStrings.date, additionalDigits);\n    date = parseDate(parseYearResult.restDateString, parseYearResult.year);\n  }\n\n  if (!date || isNaN(date.getTime())) {\n    return new Date(NaN);\n  }\n\n  const timestamp = date.getTime();\n  let time = 0;\n  let offset;\n\n  if (dateStrings.time) {\n    time = parseTime(dateStrings.time);\n    if (isNaN(time)) {\n      return new Date(NaN);\n    }\n  }\n\n  if (dateStrings.timezone) {\n    offset = parseTimezone(dateStrings.timezone);\n    if (isNaN(offset)) {\n      return new Date(NaN);\n    }\n  } else {\n    const dirtyDate = new Date(timestamp + time);\n    // JS parsed string assuming it's in UTC timezone\n    // but we need it to be parsed in our timezone\n    // so we use utc values to build date in our timezone.\n    // Year values from 0 to 99 map to the years 1900 to 1999\n    // so set year explicitly with setFullYear.\n    const result = new Date(0);\n    result.setFullYear(\n      dirtyDate.getUTCFullYear(),\n      dirtyDate.getUTCMonth(),\n      dirtyDate.getUTCDate(),\n    );\n    result.setHours(\n      dirtyDate.getUTCHours(),\n      dirtyDate.getUTCMinutes(),\n      dirtyDate.getUTCSeconds(),\n      dirtyDate.getUTCMilliseconds(),\n    );\n    return result;\n  }\n\n  return new Date(timestamp + time + offset);\n}\n\nconst patterns = {\n  dateTimeDelimiter: /[T ]/,\n  timeZoneDelimiter: /[Z ]/i,\n  timezone: /([Z+-].*)$/,\n};\n\nconst dateRegex =\n  /^-?(?:(\\d{3})|(\\d{2})(?:-?(\\d{2}))?|W(\\d{2})(?:-?(\\d{1}))?|)$/;\nconst timeRegex =\n  /^(\\d{2}(?:[.,]\\d*)?)(?::?(\\d{2}(?:[.,]\\d*)?))?(?::?(\\d{2}(?:[.,]\\d*)?))?$/;\nconst timezoneRegex = /^([+-])(\\d{2})(?::?(\\d{2}))?$/;\n\nfunction splitDateString(dateString) {\n  const dateStrings = {};\n  const array = dateString.split(patterns.dateTimeDelimiter);\n  let timeString;\n\n  // The regex match should only return at maximum two array elements.\n  // [date], [time], or [date, time].\n  if (array.length > 2) {\n    return dateStrings;\n  }\n\n  if (/:/.test(array[0])) {\n    timeString = array[0];\n  } else {\n    dateStrings.date = array[0];\n    timeString = array[1];\n    if (patterns.timeZoneDelimiter.test(dateStrings.date)) {\n      dateStrings.date = dateString.split(patterns.timeZoneDelimiter)[0];\n      timeString = dateString.substr(\n        dateStrings.date.length,\n        dateString.length,\n      );\n    }\n  }\n\n  if (timeString) {\n    const token = patterns.timezone.exec(timeString);\n    if (token) {\n      dateStrings.time = timeString.replace(token[1], \"\");\n      dateStrings.timezone = token[1];\n    } else {\n      dateStrings.time = timeString;\n    }\n  }\n\n  return dateStrings;\n}\n\nfunction parseYear(dateString, additionalDigits) {\n  const regex = new RegExp(\n    \"^(?:(\\\\d{4}|[+-]\\\\d{\" +\n      (4 + additionalDigits) +\n      \"})|(\\\\d{2}|[+-]\\\\d{\" +\n      (2 + additionalDigits) +\n      \"})$)\",\n  );\n\n  const captures = dateString.match(regex);\n  // Invalid ISO-formatted year\n  if (!captures) return { year: NaN, restDateString: \"\" };\n\n  const year = captures[1] ? parseInt(captures[1]) : null;\n  const century = captures[2] ? parseInt(captures[2]) : null;\n\n  // either year or century is null, not both\n  return {\n    year: century === null ? year : century * 100,\n    restDateString: dateString.slice((captures[1] || captures[2]).length),\n  };\n}\n\nfunction parseDate(dateString, year) {\n  // Invalid ISO-formatted year\n  if (year === null) return new Date(NaN);\n\n  const captures = dateString.match(dateRegex);\n  // Invalid ISO-formatted string\n  if (!captures) return new Date(NaN);\n\n  const isWeekDate = !!captures[4];\n  const dayOfYear = parseDateUnit(captures[1]);\n  const month = parseDateUnit(captures[2]) - 1;\n  const day = parseDateUnit(captures[3]);\n  const week = parseDateUnit(captures[4]);\n  const dayOfWeek = parseDateUnit(captures[5]) - 1;\n\n  if (isWeekDate) {\n    if (!validateWeekDate(year, week, dayOfWeek)) {\n      return new Date(NaN);\n    }\n    return dayOfISOWeekYear(year, week, dayOfWeek);\n  } else {\n    const date = new Date(0);\n    if (\n      !validateDate(year, month, day) ||\n      !validateDayOfYearDate(year, dayOfYear)\n    ) {\n      return new Date(NaN);\n    }\n    date.setUTCFullYear(year, month, Math.max(dayOfYear, day));\n    return date;\n  }\n}\n\nfunction parseDateUnit(value) {\n  return value ? parseInt(value) : 1;\n}\n\nfunction parseTime(timeString) {\n  const captures = timeString.match(timeRegex);\n  if (!captures) return NaN; // Invalid ISO-formatted time\n\n  const hours = parseTimeUnit(captures[1]);\n  const minutes = parseTimeUnit(captures[2]);\n  const seconds = parseTimeUnit(captures[3]);\n\n  if (!validateTime(hours, minutes, seconds)) {\n    return NaN;\n  }\n\n  return (\n    hours * millisecondsInHour + minutes * millisecondsInMinute + seconds * 1000\n  );\n}\n\nfunction parseTimeUnit(value) {\n  return (value && parseFloat(value.replace(\",\", \".\"))) || 0;\n}\n\nfunction parseTimezone(timezoneString) {\n  if (timezoneString === \"Z\") return 0;\n\n  const captures = timezoneString.match(timezoneRegex);\n  if (!captures) return 0;\n\n  const sign = captures[1] === \"+\" ? -1 : 1;\n  const hours = parseInt(captures[2]);\n  const minutes = (captures[3] && parseInt(captures[3])) || 0;\n\n  if (!validateTimezone(hours, minutes)) {\n    return NaN;\n  }\n\n  return sign * (hours * millisecondsInHour + minutes * millisecondsInMinute);\n}\n\nfunction dayOfISOWeekYear(isoWeekYear, week, day) {\n  const date = new Date(0);\n  date.setUTCFullYear(isoWeekYear, 0, 4);\n  const fourthOfJanuaryDay = date.getUTCDay() || 7;\n  const diff = (week - 1) * 7 + day + 1 - fourthOfJanuaryDay;\n  date.setUTCDate(date.getUTCDate() + diff);\n  return date;\n}\n\n// Validation functions\n\n// February is null to handle the leap year (using ||)\nconst daysInMonths = [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];\n\nfunction isLeapYearIndex(year) {\n  return year % 400 === 0 || (year % 4 === 0 && year % 100 !== 0);\n}\n\nfunction validateDate(year, month, date) {\n  return (\n    month >= 0 &&\n    month <= 11 &&\n    date >= 1 &&\n    date <= (daysInMonths[month] || (isLeapYearIndex(year) ? 29 : 28))\n  );\n}\n\nfunction validateDayOfYearDate(year, dayOfYear) {\n  return dayOfYear >= 1 && dayOfYear <= (isLeapYearIndex(year) ? 366 : 365);\n}\n\nfunction validateWeekDate(_year, week, day) {\n  return week >= 1 && week <= 53 && day >= 0 && day <= 6;\n}\n\nfunction validateTime(hours, minutes, seconds) {\n  if (hours === 24) {\n    return minutes === 0 && seconds === 0;\n  }\n\n  return (\n    seconds >= 0 &&\n    seconds < 60 &&\n    minutes >= 0 &&\n    minutes < 60 &&\n    hours >= 0 &&\n    hours < 25\n  );\n}\n\nfunction validateTimezone(_hours, minutes) {\n  return minutes >= 0 && minutes <= 59;\n}\n\n// Fallback for modularized imports:\nexport default parseISO;\n"],"names":["millisecondsInWeek","millisecondsInDay","millisecondsInMinute","millisecondsInHour","millisecondsInSecond","parseISO","argument","options","dateStrings","splitDateString","date","parseYearResult","parseYear","parseDate","timestamp","time","offset","parseTime","parseTimezone","dirtyDate","result","patterns","dateRegex","timeRegex","timezoneRegex","dateString","array","timeString","token","additionalDigits","regex","captures","year","century","isWeekDate","dayOfYear","parseDateUnit","month","day","week","dayOfWeek","validateWeekDate","dayOfISOWeekYear","validateDate","validateDayOfYearDate","value","hours","parseTimeUnit","minutes","seconds","validateTime","timezoneString","sign","validateTimezone","isoWeekYear","fourthOfJanuaryDay","diff","daysInMonths","isLeapYearIndex","_year","_hours"],"mappings":"AA4EY,MAACA,IAAqB,QAOrBC,IAAoB,OAOpBC,IAAuB,KAOvBC,IAAqB,MAOrBC,IAAuB;AClE7B,SAASC,EAASC,GAAUC,GAAS;AAE1C,QAAMC,IAAcC,EAAgBH,CAAQ;AAE5C,MAAII;AACJ,MAAIF,EAAY,MAAM;AACpB,UAAMG,IAAkBC,EAAUJ,EAAY,MAAM,CAAgB;AACpE,IAAAE,IAAOG,EAAUF,EAAgB,gBAAgBA,EAAgB,IAAI;AAAA,EACvE;AAEA,MAAI,CAACD,KAAQ,MAAMA,EAAK,QAAO,CAAE;AAC/B,WAAO,oBAAI,KAAK,GAAG;AAGrB,QAAMI,IAAYJ,EAAK,QAAO;AAC9B,MAAIK,IAAO,GACPC;AAEJ,MAAIR,EAAY,SACdO,IAAOE,EAAUT,EAAY,IAAI,GAC7B,MAAMO,CAAI;AACZ,WAAO,oBAAI,KAAK,GAAG;AAIvB,MAAIP,EAAY;AAEd,QADAQ,IAASE,EAAcV,EAAY,QAAQ,GACvC,MAAMQ,CAAM;AACd,aAAO,oBAAI,KAAK,GAAG;AAAA,SAEhB;AACL,UAAMG,IAAY,IAAI,KAAKL,IAAYC,CAAI,GAMrCK,IAAS,oBAAI,KAAK,CAAC;AACzB,WAAAA,EAAO;AAAA,MACLD,EAAU,eAAc;AAAA,MACxBA,EAAU,YAAW;AAAA,MACrBA,EAAU,WAAU;AAAA,IAC1B,GACIC,EAAO;AAAA,MACLD,EAAU,YAAW;AAAA,MACrBA,EAAU,cAAa;AAAA,MACvBA,EAAU,cAAa;AAAA,MACvBA,EAAU,mBAAkB;AAAA,IAClC,GACWC;AAAA,EACT;AAEA,SAAO,IAAI,KAAKN,IAAYC,IAAOC,CAAM;AAC3C;AAEA,MAAMK,IAAW;AAAA,EACf,mBAAmB;AAAA,EACnB,mBAAmB;AAAA,EACnB,UAAU;AACZ,GAEMC,IACJ,iEACIC,IACJ,6EACIC,IAAgB;AAEtB,SAASf,EAAgBgB,GAAY;AACnC,QAAMjB,IAAc,CAAA,GACdkB,IAAQD,EAAW,MAAMJ,EAAS,iBAAiB;AACzD,MAAIM;AAIJ,MAAID,EAAM,SAAS;AACjB,WAAOlB;AAiBT,MAdI,IAAI,KAAKkB,EAAM,CAAC,CAAC,IACnBC,IAAaD,EAAM,CAAC,KAEpBlB,EAAY,OAAOkB,EAAM,CAAC,GAC1BC,IAAaD,EAAM,CAAC,GAChBL,EAAS,kBAAkB,KAAKb,EAAY,IAAI,MAClDA,EAAY,OAAOiB,EAAW,MAAMJ,EAAS,iBAAiB,EAAE,CAAC,GACjEM,IAAaF,EAAW;AAAA,IACtBjB,EAAY,KAAK;AAAA,IACjBiB,EAAW;AAAA,EACnB,KAIME,GAAY;AACd,UAAMC,IAAQP,EAAS,SAAS,KAAKM,CAAU;AAC/C,IAAIC,KACFpB,EAAY,OAAOmB,EAAW,QAAQC,EAAM,CAAC,GAAG,EAAE,GAClDpB,EAAY,WAAWoB,EAAM,CAAC,KAE9BpB,EAAY,OAAOmB;AAAA,EAEvB;AAEA,SAAOnB;AACT;AAEA,SAASI,EAAUa,GAAYI,GAAkB;AAC/C,QAAMC,IAAQ,IAAI;AAAA,IAChB,0BACG,IAAID,KACL,yBACC,IAAIA,KACL;AAAA,EACN,GAEQE,IAAWN,EAAW,MAAMK,CAAK;AAEvC,MAAI,CAACC,EAAU,QAAO,EAAE,MAAM,KAAK,gBAAgB,GAAE;AAErD,QAAMC,IAAOD,EAAS,CAAC,IAAI,SAASA,EAAS,CAAC,CAAC,IAAI,MAC7CE,IAAUF,EAAS,CAAC,IAAI,SAASA,EAAS,CAAC,CAAC,IAAI;AAGtD,SAAO;AAAA,IACL,MAAME,MAAY,OAAOD,IAAOC,IAAU;AAAA,IAC1C,gBAAgBR,EAAW,OAAOM,EAAS,CAAC,KAAKA,EAAS,CAAC,GAAG,MAAM;AAAA,EACxE;AACA;AAEA,SAASlB,EAAUY,GAAYO,GAAM;AAEnC,MAAIA,MAAS,KAAM,QAAO,oBAAI,KAAK,GAAG;AAEtC,QAAMD,IAAWN,EAAW,MAAMH,CAAS;AAE3C,MAAI,CAACS,EAAU,QAAO,oBAAI,KAAK,GAAG;AAElC,QAAMG,IAAa,CAAC,CAACH,EAAS,CAAC,GACzBI,IAAYC,EAAcL,EAAS,CAAC,CAAC,GACrCM,IAAQD,EAAcL,EAAS,CAAC,CAAC,IAAI,GACrCO,IAAMF,EAAcL,EAAS,CAAC,CAAC,GAC/BQ,IAAOH,EAAcL,EAAS,CAAC,CAAC,GAChCS,IAAYJ,EAAcL,EAAS,CAAC,CAAC,IAAI;AAE/C,MAAIG;AACF,WAAKO,EAAiBT,GAAMO,GAAMC,CAAS,IAGpCE,EAAiBV,GAAMO,GAAMC,CAAS,IAFpC,oBAAI,KAAK,GAAG;AAGhB;AACL,UAAM9B,IAAO,oBAAI,KAAK,CAAC;AACvB,WACE,CAACiC,EAAaX,GAAMK,GAAOC,CAAG,KAC9B,CAACM,EAAsBZ,GAAMG,CAAS,IAE/B,oBAAI,KAAK,GAAG,KAErBzB,EAAK,eAAesB,GAAMK,GAAO,KAAK,IAAIF,GAAWG,CAAG,CAAC,GAClD5B;AAAA,EACT;AACF;AAEA,SAAS0B,EAAcS,GAAO;AAC5B,SAAOA,IAAQ,SAASA,CAAK,IAAI;AACnC;AAEA,SAAS5B,EAAUU,GAAY;AAC7B,QAAMI,IAAWJ,EAAW,MAAMJ,CAAS;AAC3C,MAAI,CAACQ,EAAU,QAAO;AAEtB,QAAMe,IAAQC,EAAchB,EAAS,CAAC,CAAC,GACjCiB,IAAUD,EAAchB,EAAS,CAAC,CAAC,GACnCkB,IAAUF,EAAchB,EAAS,CAAC,CAAC;AAEzC,SAAKmB,EAAaJ,GAAOE,GAASC,CAAO,IAKvCH,IAAQ,OAAqBE,IAAU,MAAuBC,IAAU,MAJjE;AAMX;AAEA,SAASF,EAAcF,GAAO;AAC5B,SAAQA,KAAS,WAAWA,EAAM,QAAQ,KAAK,GAAG,CAAC,KAAM;AAC3D;AAEA,SAAS3B,EAAciC,GAAgB;AACrC,MAAIA,MAAmB,IAAK,QAAO;AAEnC,QAAMpB,IAAWoB,EAAe,MAAM3B,CAAa;AACnD,MAAI,CAACO,EAAU,QAAO;AAEtB,QAAMqB,IAAOrB,EAAS,CAAC,MAAM,MAAM,KAAK,GAClCe,IAAQ,SAASf,EAAS,CAAC,CAAC,GAC5BiB,IAAWjB,EAAS,CAAC,KAAK,SAASA,EAAS,CAAC,CAAC,KAAM;AAE1D,SAAKsB,EAAiBP,GAAOE,CAAO,IAI7BI,KAAQN,IAAQ,OAAqBE,IAAU,OAH7C;AAIX;AAEA,SAASN,EAAiBY,GAAaf,GAAMD,GAAK;AAChD,QAAM5B,IAAO,oBAAI,KAAK,CAAC;AACvB,EAAAA,EAAK,eAAe4C,GAAa,GAAG,CAAC;AACrC,QAAMC,IAAqB7C,EAAK,UAAS,KAAM,GACzC8C,KAAQjB,IAAO,KAAK,IAAID,IAAM,IAAIiB;AACxC,SAAA7C,EAAK,WAAWA,EAAK,WAAU,IAAK8C,CAAI,GACjC9C;AACT;AAKA,MAAM+C,IAAe,CAAC,IAAI,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAEtE,SAASC,EAAgB1B,GAAM;AAC7B,SAAOA,IAAO,QAAQ,KAAMA,IAAO,MAAM,KAAKA,IAAO,QAAQ;AAC/D;AAEA,SAASW,EAAaX,GAAMK,GAAO3B,GAAM;AACvC,SACE2B,KAAS,KACTA,KAAS,MACT3B,KAAQ,KACRA,MAAS+C,EAAapB,CAAK,MAAMqB,EAAgB1B,CAAI,IAAI,KAAK;AAElE;AAEA,SAASY,EAAsBZ,GAAMG,GAAW;AAC9C,SAAOA,KAAa,KAAKA,MAAcuB,EAAgB1B,CAAI,IAAI,MAAM;AACvE;AAEA,SAASS,EAAiBkB,GAAOpB,GAAMD,GAAK;AAC1C,SAAOC,KAAQ,KAAKA,KAAQ,MAAMD,KAAO,KAAKA,KAAO;AACvD;AAEA,SAASY,EAAaJ,GAAOE,GAASC,GAAS;AAC7C,SAAIH,MAAU,KACLE,MAAY,KAAKC,MAAY,IAIpCA,KAAW,KACXA,IAAU,MACVD,KAAW,KACXA,IAAU,MACVF,KAAS,KACTA,IAAQ;AAEZ;AAEA,SAASO,EAAiBO,GAAQZ,GAAS;AACzC,SAAOA,KAAW,KAAKA,KAAW;AACpC;","x_google_ignoreList":[0,1]}

package/dist/searchFuzzy-B3TsUO-V.js

@@ -0,0 +1,409 @@
+import { g as ye } from "./_commonjsHelpers-DaMA6jEr.js";
+import me from "lodash-es/isPlainObject";
+import "vue";
+import { normalizeText as Ie } from "./utils/helpers.js";
+function ze(A) {
+  return Array.isArray(A) && typeof A[0] == "string";
+}
+function Be(A) {
+  return Array.isArray(A) && me(A[0]);
+}
+var j = { exports: {} }, Ce = j.exports, he;
+function ke() {
+  return he || (he = 1, (function(A) {
+    ((E, k) => {
+      A.exports ? A.exports = k() : E.fuzzysort = k();
+    })(Ce, (E) => {
+      var k = (r, e) => {
+        if (!r || !e) return b;
+        var a = _e(r);
+        V(e) || (e = q(e));
+        var i = a.bitflags;
+        return (i & e._bitflags) !== i ? b : $(a, e);
+      }, ve = (r, e, a) => {
+        if (!r) return a != null && a.all ? de(e, a) : fe;
+        var i = _e(r), v = i.bitflags, f = i.containsSpace, n = Q((a == null ? void 0 : a.threshold) || 0), s = (a == null ? void 0 : a.limit) || ne, t = 0, _ = 0, u = e.length;
+        function I(Y) {
+          t < s ? (U.add(Y), ++t) : (++_, Y._score > U.peek()._score && U.replaceTop(Y));
+        }
+        if (a != null && a.key)
+          for (var L = a.key, g = 0; g < u; ++g) {
+            var m = e[g], h = Z(m, L);
+            if (h && (V(h) || (h = q(h)), (v & h._bitflags) === v)) {
+              var d = $(i, h);
+              d !== b && (d._score < n || (d.obj = m, I(d)));
+            }
+          }
+        else if (a != null && a.keys) {
+          var O = a.keys, C = O.length;
+          e: for (var g = 0; g < u; ++g) {
+            var m = e[g];
+            {
+              for (var y = 0, c = 0; c < C; ++c) {
+                var L = O[c], h = Z(m, L);
+                if (!h) {
+                  ae[c] = H;
+                  continue;
+                }
+                V(h) || (h = q(h)), ae[c] = h, y |= h._bitflags;
+              }
+              if ((v & y) !== v) continue;
+            }
+            if (f) for (let o = 0; o < i.spaceSearches.length; o++) T[o] = z;
+            for (var c = 0; c < C; ++c) {
+              if (h = ae[c], h === H) {
+                D[c] = H;
+                continue;
+              }
+              if (D[c] = $(
+                i,
+                h,
+                /*allowSpaces=*/
+                !1,
+                /*allowPartialMatch=*/
+                f
+              ), D[c] === b) {
+                D[c] = H;
+                continue;
+              }
+              if (f) for (let x = 0; x < i.spaceSearches.length; x++) {
+                if (G[x] > -1e3 && T[x] > z) {
+                  var S = (T[x] + G[x]) / 4;
+                  S > T[x] && (T[x] = S);
+                }
+                G[x] > T[x] && (T[x] = G[x]);
+              }
+            }
+            if (f) {
+              for (let o = 0; o < i.spaceSearches.length; o++)
+                if (T[o] === z) continue e;
+            } else {
+              var l = !1;
+              for (let o = 0; o < C; o++)
+                if (D[o]._score !== z) {
+                  l = !0;
+                  break;
+                }
+              if (!l) continue;
+            }
+            var B = new se(C);
+            for (let o = 0; o < C; o++)
+              B[o] = D[o];
+            if (f) {
+              var w = 0;
+              for (let o = 0; o < i.spaceSearches.length; o++) w += T[o];
+            } else {
+              var w = z;
+              for (let x = 0; x < C; x++) {
+                var d = B[x];
+                if (d._score > -1e3 && w > z) {
+                  var S = (w + d._score) / 4;
+                  S > w && (w = S);
+                }
+                d._score > w && (w = d._score);
+              }
+            }
+            if (B.obj = m, B._score = w, a != null && a.scoreFn) {
+              if (w = a.scoreFn(B), !w) continue;
+              w = Q(w), B._score = w;
+            }
+            w < n || I(B);
+          }
+        } else
+          for (var g = 0; g < u; ++g) {
+            var h = e[g];
+            if (h && (V(h) || (h = q(h)), (v & h._bitflags) === v)) {
+              var d = $(i, h);
+              d !== b && (d._score < n || I(d));
+            }
+          }
+        if (t === 0) return fe;
+        for (var M = new Array(t), g = t - 1; g >= 0; --g) M[g] = U.poll();
+        return M.total = t + _, M;
+      }, J = (r, e = "<b>", a = "</b>") => {
+        for (var i = typeof e == "function" ? e : void 0, v = r.target, f = v.length, n = r.indexes, s = "", t = 0, _ = 0, u = !1, I = [], L = 0; L < f; ++L) {
+          var g = v[L];
+          if (n[_] === L) {
+            if (++_, u || (u = !0, i ? (I.push(s), s = "") : s += e), _ === n.length) {
+              i ? (s += g, I.push(i(s, t++)), s = "", I.push(v.substr(L + 1))) : s += g + a + v.substr(L + 1);
+              break;
+            }
+          } else
+            u && (u = !1, i ? (I.push(i(s, t++)), s = "") : s += a);
+          s += g;
+        }
+        return i ? I : s;
+      }, P = (r) => {
+        typeof r == "number" ? r = "" + r : typeof r != "string" && (r = "");
+        var e = p(r);
+        return le(r, { _targetLower: e._lower, _targetLowerCodes: e.lowerCodes, _bitflags: e.bitflags });
+      }, K = () => {
+        ee.clear(), re.clear();
+      };
+      class te {
+        get indexes() {
+          return this._indexes.slice(0, this._indexes.len).sort((e, a) => e - a);
+        }
+        set indexes(e) {
+          return this._indexes = e;
+        }
+        highlight(e, a) {
+          return J(this, e, a);
+        }
+        get score() {
+          return ue(this._score);
+        }
+        set score(e) {
+          this._score = Q(e);
+        }
+      }
+      class se extends Array {
+        get score() {
+          return ue(this._score);
+        }
+        set score(e) {
+          this._score = Q(e);
+        }
+      }
+      var le = (r, e) => {
+        const a = new te();
+        return a.target = r, a.obj = e.obj ?? b, a._score = e._score ?? z, a._indexes = e._indexes ?? [], a._targetLower = e._targetLower ?? "", a._targetLowerCodes = e._targetLowerCodes ?? b, a._nextBeginningIndexes = e._nextBeginningIndexes ?? b, a._bitflags = e._bitflags ?? 0, a;
+      }, ue = (r) => r === z ? 0 : r > 1 ? r : Math.E ** (((-r + 1) ** 0.04307 - 1) * -2), Q = (r) => r === 0 ? z : r > 1 ? r : 1 - Math.pow(Math.log(r) / -2 + 1, 1 / 0.04307), ce = (r) => {
+        typeof r == "number" ? r = "" + r : typeof r != "string" && (r = ""), r = r.trim();
+        var e = p(r), a = [];
+        if (e.containsSpace) {
+          var i = r.split(/\s+/);
+          i = [...new Set(i)];
+          for (var v = 0; v < i.length; v++)
+            if (i[v] !== "") {
+              var f = p(i[v]);
+              a.push({ lowerCodes: f.lowerCodes, _lower: i[v].toLowerCase(), containsSpace: !1 });
+            }
+        }
+        return { lowerCodes: e.lowerCodes, _lower: e._lower, containsSpace: e.containsSpace, bitflags: e.bitflags, spaceSearches: a };
+      }, q = (r) => {
+        if (r.length > 999) return P(r);
+        var e = ee.get(r);
+        return e !== void 0 || (e = P(r), ee.set(r, e)), e;
+      }, _e = (r) => {
+        if (r.length > 999) return ce(r);
+        var e = re.get(r);
+        return e !== void 0 || (e = ce(r), re.set(r, e)), e;
+      }, de = (r, e) => {
+        var a = [];
+        a.total = r.length;
+        var i = (e == null ? void 0 : e.limit) || ne;
+        if (e != null && e.key)
+          for (var v = 0; v < r.length; v++) {
+            var f = r[v], n = Z(f, e.key);
+            if (n != b) {
+              V(n) || (n = q(n));
+              var s = le(n.target, { _score: n._score, obj: f });
+              if (a.push(s), a.length >= i) return a;
+            }
+          }
+        else if (e != null && e.keys)
+          for (var v = 0; v < r.length; v++) {
+            for (var f = r[v], t = new se(e.keys.length), _ = e.keys.length - 1; _ >= 0; --_) {
+              var n = Z(f, e.keys[_]);
+              if (!n) {
+                t[_] = H;
+                continue;
+              }
+              V(n) || (n = q(n)), n._score = z, n._indexes.len = 0, t[_] = n;
+            }
+            if (t.obj = f, t._score = z, a.push(t), a.length >= i) return a;
+          }
+        else
+          for (var v = 0; v < r.length; v++) {
+            var n = r[v];
+            if (n != b && (V(n) || (n = q(n)), n._score = z, n._indexes.len = 0, a.push(n), a.length >= i))
+              return a;
+          }
+        return a;
+      }, $ = (r, e, a = !1, i = !1) => {
+        if (a === !1 && r.containsSpace) return xe(r, e, i);
+        for (var v = r._lower, f = r.lowerCodes, n = f[0], s = e._targetLowerCodes, t = f.length, _ = s.length, g = 0, u = 0, I = 0; ; ) {
+          var L = n === s[u];
+          if (L) {
+            if (N[I++] = u, ++g, g === t) break;
+            n = f[g];
+          }
+          if (++u, u >= _) return b;
+        }
+        var g = 0, m = !1, h = 0, d = e._nextBeginningIndexes;
+        d === b && (d = e._nextBeginningIndexes = be(e.target)), u = N[0] === 0 ? 0 : d[N[0] - 1];
+        var O = 0;
+        if (u !== _) for (; ; )
+          if (u >= _) {
+            if (g <= 0 || (++O, O > 200)) break;
+            --g;
+            var C = W[--h];
+            u = d[C];
+          } else {
+            var L = f[g] === s[u];
+            if (L) {
+              if (W[h++] = u, ++g, g === t) {
+                m = !0;
+                break;
+              }
+              ++u;
+            } else
+              u = d[u];
+          }
+        var y = t <= 1 ? -1 : e._targetLower.indexOf(v, N[0]), c = !!~y, S = c ? y === 0 || e._nextBeginningIndexes[y - 1] === y : !1;
+        if (c && !S) {
+          for (var l = 0; l < d.length; l = d[l])
+            if (!(l <= y)) {
+              for (var B = 0; B < t && f[B] === e._targetLowerCodes[l + B]; B++) ;
+              if (B === t) {
+                y = l, S = !0;
+                break;
+              }
+            }
+        }
+        var w = (o) => {
+          for (var x = 0, ge = 0, F = 1; F < t; ++F)
+            o[F] - o[F - 1] !== 1 && (x -= o[F], ++ge);
+          var Le = o[t - 1] - o[0] - (t - 1);
+          if (x -= (12 + Le) * ge, o[0] !== 0 && (x -= o[0] * o[0] * 0.2), !m)
+            x *= 1e3;
+          else {
+            for (var ie = 1, F = d[0]; F < _; F = d[F]) ++ie;
+            ie > 24 && (x *= (ie - 24) * 10);
+          }
+          return x -= (_ - t) / 2, c && (x /= 1 + t * t * 1), S && (x /= 1 + t * t * 1), x -= (_ - t) / 2, x;
+        };
+        if (m)
+          if (S) {
+            for (var l = 0; l < t; ++l) N[l] = y + l;
+            var M = N, Y = w(N);
+          } else
+            var M = W, Y = w(W);
+        else {
+          if (c) for (var l = 0; l < t; ++l) N[l] = y + l;
+          var M = N, Y = w(M);
+        }
+        e._score = Y;
+        for (var l = 0; l < t; ++l) e._indexes[l] = M[l];
+        e._indexes.len = t;
+        const R = new te();
+        return R.target = e.target, R._score = e._score, R._indexes = e._indexes, R;
+      }, xe = (r, e, a) => {
+        for (var i = /* @__PURE__ */ new Set(), v = 0, f = b, n = 0, s = r.spaceSearches, t = s.length, _ = 0, u = () => {
+          for (let S = _ - 1; S >= 0; S--) e._nextBeginningIndexes[X[S * 2 + 0]] = X[S * 2 + 1];
+        }, I = !1, c = 0; c < t; ++c) {
+          G[c] = z;
+          var L = s[c];
+          if (f = $(L, e), a) {
+            if (f === b) continue;
+            I = !0;
+          } else if (f === b)
+            return u(), b;
+          var g = c === t - 1;
+          if (!g) {
+            var m = f._indexes, h = !0;
+            for (let l = 0; l < m.len - 1; l++)
+              if (m[l + 1] - m[l] !== 1) {
+                h = !1;
+                break;
+              }
+            if (h) {
+              var d = m[m.len - 1] + 1, O = e._nextBeginningIndexes[d - 1];
+              for (let l = d - 1; l >= 0 && O === e._nextBeginningIndexes[l]; l--)
+                e._nextBeginningIndexes[l] = d, X[_ * 2 + 0] = l, X[_ * 2 + 1] = O, _++;
+            }
+          }
+          v += f._score / t, G[c] = f._score / t, f._indexes[0] < n && (v -= (n - f._indexes[0]) * 2), n = f._indexes[0];
+          for (var C = 0; C < f._indexes.len; ++C) i.add(f._indexes[C]);
+        }
+        if (a && !I) return b;
+        u();
+        var y = $(
+          r,
+          e,
+          /*allowSpaces=*/
+          !0
+        );
+        if (y !== b && y._score > v) {
+          if (a)
+            for (var c = 0; c < t; ++c)
+              G[c] = y._score / t;
+          return y;
+        }
+        a && (f = e), f._score = v;
+        var c = 0;
+        for (let S of i) f._indexes[c++] = S;
+        return f._indexes.len = c, f;
+      }, p = (r) => {
+        for (var e = r.length, a = r.toLowerCase(), i = [], v = 0, f = !1, n = 0; n < e; ++n) {
+          var s = i[n] = a.charCodeAt(n);
+          if (s === 32) {
+            f = !0;
+            continue;
+          }
+          var t = s >= 97 && s <= 122 ? s - 97 : s >= 48 && s <= 57 ? 26 : s <= 127 ? 30 : 31;
+          v |= 1 << t;
+        }
+        return { lowerCodes: i, bitflags: v, containsSpace: f, _lower: a };
+      }, we = (r) => {
+        for (var e = r.length, a = [], i = 0, v = !1, f = !1, n = 0; n < e; ++n) {
+          var s = r.charCodeAt(n), t = s >= 65 && s <= 90, _ = t || s >= 97 && s <= 122 || s >= 48 && s <= 57, u = t && !v || !f || !_;
+          v = t, f = _, u && (a[i++] = n);
+        }
+        return a;
+      }, be = (r) => {
+        for (var e = r.length, a = we(r), i = [], v = a[0], f = 0, n = 0; n < e; ++n)
+          v > n ? i[n] = v : (v = a[++f], i[n] = v === void 0 ? e : v);
+        return i;
+      }, ee = /* @__PURE__ */ new Map(), re = /* @__PURE__ */ new Map(), N = [], W = [], X = [], T = [], G = [], ae = [], D = [], Z = (r, e) => {
+        var a = r[e];
+        if (a !== void 0) return a;
+        if (typeof e == "function") return e(r);
+        var i = e;
+        Array.isArray(e) || (i = e.split("."));
+        for (var v = i.length, f = -1; r && ++f < v; ) r = r[i[f]];
+        return r;
+      }, V = (r) => typeof r == "object" && typeof r._bitflags == "number", ne = 1 / 0, z = -ne, fe = [];
+      fe.total = 0;
+      var b = null, H = P(""), Se = (r) => {
+        var e = [], a = 0, i = {}, v = (f) => {
+          for (var n = 0, s = e[n], t = 1; t < a; ) {
+            var _ = t + 1;
+            n = t, _ < a && e[_]._score < e[t]._score && (n = _), e[n - 1 >> 1] = e[n], t = 1 + (n << 1);
+          }
+          for (var u = n - 1 >> 1; n > 0 && s._score < e[u]._score; u = (n = u) - 1 >> 1) e[n] = e[u];
+          e[n] = s;
+        };
+        return i.add = ((f) => {
+          var n = a;
+          e[a++] = f;
+          for (var s = n - 1 >> 1; n > 0 && f._score < e[s]._score; s = (n = s) - 1 >> 1) e[n] = e[s];
+          e[n] = f;
+        }), i.poll = ((f) => {
+          if (a !== 0) {
+            var n = e[0];
+            return e[0] = e[--a], v(), n;
+          }
+        }), i.peek = ((f) => {
+          if (a !== 0) return e[0];
+        }), i.replaceTop = ((f) => {
+          e[0] = f, v();
+        }), i;
+      }, U = Se();
+      return { single: k, go: ve, prepare: P, cleanup: K };
+    });
+  })(j)), j.exports;
+}
+var Ae = ke();
+const oe = /* @__PURE__ */ ye(Ae);
+function Oe(A, E, k) {
+  var P;
+  const J = Ie(A).replace(/[^\w\s]/gi, "").toLowerCase();
+  return ze(E) ? oe.go(J, E, { all: !0, threshold: -1e5 }).map((K) => K.target) : Be(E) && ((P = k == null ? void 0 : k.fieldNames) != null && P.length) ? oe.go(J, E, { all: !0, threshold: -1e5, keys: k == null ? void 0 : k.fieldNames }).map((K) => K.obj) : E;
+}
+export {
+  Be as i,
+  Oe as s
+};
+//# sourceMappingURL=searchFuzzy-B3TsUO-V.js.map

package/dist/searchFuzzy-B3TsUO-V.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"searchFuzzy-B3TsUO-V.js","sources":["../types/utils.ts","../node_modules/.pnpm/fuzzysort@3.0.2/node_modules/fuzzysort/fuzzysort.js","../src/utils/searchFuzzy.ts"],"sourcesContent":["import isPlainObject from 'lodash-es/isPlainObject';\nimport { InjectionKey, isRef, Ref } from 'vue';\n\n/**\n * Create a union from an object's values\n *\n * using a plain object:\n * const SHAPE = { CIRCLE: 'circle', SQUARE: 'square' } as const;\n * ValueOf<typeof SHAPE> -> square | circle\n *\n * using a type:\n * type Shape = { SQUARE: string; CIRCLE: string; }\n * ValueOf<Shape>\n */\nexport type ValueOf<T> = T[keyof T];\n\nexport function isListOfStrings(list: unknown): list is string[] {\n  return Array.isArray(list) && typeof list[0] === 'string';\n}\n\nexport function isListOfObjects<T = unknown>(list: unknown): list is T[] {\n  return Array.isArray(list) && isPlainObject(list[0]);\n}\n\nexport interface Injection<T> {\n  key: InjectionKey<T>;\n}\n\nexport interface InjectionWithDefaults<T> extends Injection<T> {\n  defaults: T;\n}\n\n/**\n * Like the MaybeRefOrGetter type from Vue, but without the Maybe. Can be used to ensure the most up-to-date value is available.\n */\nexport type RefOrGetter<T> = Ref<T> | (() => T);\n\n/**\n * A type guard for the RefOrGetter type. Acceptable values include:\n *  - a value created from `ref()`\n *  - a value created from `shallowRef()`\n *  - a value created from `computed()`\n *  - a function that returns a value\n */\nexport function isRefOrGetter<T>(value: RefOrGetter<T> | unknown): value is RefOrGetter<T> {\n  return isRef(value) || typeof value === 'function';\n}\n","// https://github.com/farzher/fuzzysort v3.0.2\r\n\r\n// UMD (Universal Module Definition) for fuzzysort\r\n;((root, UMD) => {\r\n  if(typeof define === 'function' && define.amd) define([], UMD)\r\n  else if(typeof module === 'object' && module.exports) module.exports = UMD()\r\n  else root['fuzzysort'] = UMD()\r\n})(this, _ => {\r\n  'use strict'\r\n\r\n  var single = (search, target) => {\r\n    if(!search || !target) return NULL\r\n\r\n    var preparedSearch = getPreparedSearch(search)\r\n    if(!isPrepared(target)) target = getPrepared(target)\r\n\r\n    var searchBitflags = preparedSearch.bitflags\r\n    if((searchBitflags & target._bitflags) !== searchBitflags) return NULL\r\n\r\n    return algorithm(preparedSearch, target)\r\n  }\r\n\r\n  var go = (search, targets, options) => {\r\n    if(!search) return options?.all ? all(targets, options) : noResults\r\n\r\n    var preparedSearch = getPreparedSearch(search)\r\n    var searchBitflags = preparedSearch.bitflags\r\n    var containsSpace  = preparedSearch.containsSpace\r\n\r\n    var threshold = denormalizeScore( options?.threshold || 0 )\r\n    var limit     = options?.limit || INFINITY\r\n\r\n    var resultsLen = 0; var limitedCount = 0\r\n    var targetsLen = targets.length\r\n\r\n    function push_result(result) {\r\n      if(resultsLen < limit) { q.add(result); ++resultsLen }\r\n      else {\r\n        ++limitedCount\r\n        if(result._score > q.peek()._score) q.replaceTop(result)\r\n      }\r\n    }\r\n\r\n    // This code is copy/pasted 3 times for performance reasons [options.key, options.keys, no keys]\r\n\r\n    // options.key\r\n    if(options?.key) {\r\n      var key = options.key\r\n      for(var i = 0; i < targetsLen; ++i) { var obj = targets[i]\r\n        var target = getValue(obj, key)\r\n        if(!target) continue\r\n        if(!isPrepared(target)) target = getPrepared(target)\r\n\r\n        if((searchBitflags & target._bitflags) !== searchBitflags) continue\r\n        var result = algorithm(preparedSearch, target)\r\n        if(result === NULL) continue\r\n        if(result._score < threshold) continue\r\n\r\n        result.obj = obj\r\n        push_result(result)\r\n      }\r\n\r\n    // options.keys\r\n    } else if(options?.keys) {\r\n      var keys = options.keys\r\n      var keysLen = keys.length\r\n\r\n      outer: for(var i = 0; i < targetsLen; ++i) { var obj = targets[i]\r\n\r\n        { // early out based on bitflags\r\n          var keysBitflags = 0\r\n          for (var keyI = 0; keyI < keysLen; ++keyI) {\r\n            var key = keys[keyI]\r\n            var target = getValue(obj, key)\r\n            if(!target) { tmpTargets[keyI] = noTarget; continue }\r\n            if(!isPrepared(target)) target = getPrepared(target)\r\n            tmpTargets[keyI] = target\r\n\r\n            keysBitflags |= target._bitflags\r\n          }\r\n\r\n          if((searchBitflags & keysBitflags) !== searchBitflags) continue\r\n        }\r\n\r\n        if(containsSpace) for(let i=0; i<preparedSearch.spaceSearches.length; i++) keysSpacesBestScores[i] = NEGATIVE_INFINITY\r\n\r\n        for (var keyI = 0; keyI < keysLen; ++keyI) {\r\n          target = tmpTargets[keyI]\r\n          if(target === noTarget) { tmpResults[keyI] = noTarget; continue }\r\n\r\n          tmpResults[keyI] = algorithm(preparedSearch, target, /*allowSpaces=*/false, /*allowPartialMatch=*/containsSpace)\r\n          if(tmpResults[keyI] === NULL) { tmpResults[keyI] = noTarget; continue }\r\n\r\n          // todo: this seems weird and wrong. like what if our first match wasn't good. this should just replace it instead of averaging with it\r\n          // if our second match isn't good we ignore it instead of averaging with it\r\n          if(containsSpace) for(let i=0; i<preparedSearch.spaceSearches.length; i++) {\r\n            if(allowPartialMatchScores[i] > -1000) {\r\n              if(keysSpacesBestScores[i] > NEGATIVE_INFINITY) {\r\n                var tmp = (keysSpacesBestScores[i] + allowPartialMatchScores[i]) / 4/*bonus score for having multiple matches*/\r\n                if(tmp > keysSpacesBestScores[i]) keysSpacesBestScores[i] = tmp\r\n              }\r\n            }\r\n            if(allowPartialMatchScores[i] > keysSpacesBestScores[i]) keysSpacesBestScores[i] = allowPartialMatchScores[i]\r\n          }\r\n        }\r\n\r\n        if(containsSpace) {\r\n          for(let i=0; i<preparedSearch.spaceSearches.length; i++) { if(keysSpacesBestScores[i] === NEGATIVE_INFINITY) continue outer }\r\n        } else {\r\n          var hasAtLeast1Match = false\r\n          for(let i=0; i < keysLen; i++) { if(tmpResults[i]._score !== NEGATIVE_INFINITY) { hasAtLeast1Match = true; break } }\r\n          if(!hasAtLeast1Match) continue\r\n        }\r\n\r\n        var objResults = new KeysResult(keysLen)\r\n        for(let i=0; i < keysLen; i++) { objResults[i] = tmpResults[i] }\r\n\r\n        if(containsSpace) {\r\n          var score = 0\r\n          for(let i=0; i<preparedSearch.spaceSearches.length; i++) score += keysSpacesBestScores[i]\r\n        } else {\r\n          // todo could rewrite this scoring to be more similar to when there's spaces\r\n          // if we match multiple keys give us bonus points\r\n          var score = NEGATIVE_INFINITY\r\n          for(let i=0; i<keysLen; i++) {\r\n            var result = objResults[i]\r\n            if(result._score > -1000) {\r\n              if(score > NEGATIVE_INFINITY) {\r\n                var tmp = (score + result._score) / 4/*bonus score for having multiple matches*/\r\n                if(tmp > score) score = tmp\r\n              }\r\n            }\r\n            if(result._score > score) score = result._score\r\n          }\r\n        }\r\n\r\n        objResults.obj = obj\r\n        objResults._score = score\r\n        if(options?.scoreFn) {\r\n          score = options.scoreFn(objResults)\r\n          if(!score) continue\r\n          score = denormalizeScore(score)\r\n          objResults._score = score\r\n        }\r\n\r\n        if(score < threshold) continue\r\n        push_result(objResults)\r\n      }\r\n\r\n    // no keys\r\n    } else {\r\n      for(var i = 0; i < targetsLen; ++i) { var target = targets[i]\r\n        if(!target) continue\r\n        if(!isPrepared(target)) target = getPrepared(target)\r\n\r\n        if((searchBitflags & target._bitflags) !== searchBitflags) continue\r\n        var result = algorithm(preparedSearch, target)\r\n        if(result === NULL) continue\r\n        if(result._score < threshold) continue\r\n\r\n        push_result(result)\r\n      }\r\n    }\r\n\r\n    if(resultsLen === 0) return noResults\r\n    var results = new Array(resultsLen)\r\n    for(var i = resultsLen - 1; i >= 0; --i) results[i] = q.poll()\r\n    results.total = resultsLen + limitedCount\r\n    return results\r\n  }\r\n\r\n\r\n  // this is written as 1 function instead of 2 for minification. perf seems fine ...\r\n  // except when minified. the perf is very slow\r\n  var highlight = (result, open='<b>', close='</b>') => {\r\n    var callback = typeof open === 'function' ? open : undefined\r\n\r\n    var target      = result.target\r\n    var targetLen   = target.length\r\n    var indexes     = result.indexes\r\n    var highlighted = ''\r\n    var matchI      = 0\r\n    var indexesI    = 0\r\n    var opened      = false\r\n    var parts       = []\r\n\r\n    for(var i = 0; i < targetLen; ++i) { var char = target[i]\r\n      if(indexes[indexesI] === i) {\r\n        ++indexesI\r\n        if(!opened) { opened = true\r\n          if(callback) {\r\n            parts.push(highlighted); highlighted = ''\r\n          } else {\r\n            highlighted += open\r\n          }\r\n        }\r\n\r\n        if(indexesI === indexes.length) {\r\n          if(callback) {\r\n            highlighted += char\r\n            parts.push(callback(highlighted, matchI++)); highlighted = ''\r\n            parts.push(target.substr(i+1))\r\n          } else {\r\n            highlighted += char + close + target.substr(i+1)\r\n          }\r\n          break\r\n        }\r\n      } else {\r\n        if(opened) { opened = false\r\n          if(callback) {\r\n            parts.push(callback(highlighted, matchI++)); highlighted = ''\r\n          } else {\r\n            highlighted += close\r\n          }\r\n        }\r\n      }\r\n      highlighted += char\r\n    }\r\n\r\n    return callback ? parts : highlighted\r\n  }\r\n\r\n\r\n  var prepare = (target) => {\r\n    if(typeof target === 'number') target = ''+target\r\n    else if(typeof target !== 'string') target = ''\r\n    var info = prepareLowerInfo(target)\r\n    return new_result(target, {_targetLower:info._lower, _targetLowerCodes:info.lowerCodes, _bitflags:info.bitflags})\r\n  }\r\n\r\n  var cleanup = () => { preparedCache.clear(); preparedSearchCache.clear() }\r\n\r\n\r\n  // Below this point is only internal code\r\n  // Below this point is only internal code\r\n  // Below this point is only internal code\r\n  // Below this point is only internal code\r\n\r\n\r\n  class Result {\r\n    get ['indexes']() { return this._indexes.slice(0, this._indexes.len).sort((a,b)=>a-b) }\r\n    set ['indexes'](indexes) { return this._indexes = indexes }\r\n    ['highlight'](open, close) { return highlight(this, open, close) }\r\n    get ['score']() { return normalizeScore(this._score) }\r\n    set ['score'](score) { this._score = denormalizeScore(score) }\r\n  }\r\n\r\n  class KeysResult extends Array {\r\n    get ['score']() { return normalizeScore(this._score) }\r\n    set ['score'](score) { this._score = denormalizeScore(score) }\r\n  }\r\n\r\n  var new_result = (target, options) => {\r\n    const result = new Result()\r\n    result['target']             = target\r\n    result['obj']                = options.obj                   ?? NULL\r\n    result._score                = options._score                ?? NEGATIVE_INFINITY\r\n    result._indexes              = options._indexes              ?? []\r\n    result._targetLower          = options._targetLower          ?? ''\r\n    result._targetLowerCodes     = options._targetLowerCodes     ?? NULL\r\n    result._nextBeginningIndexes = options._nextBeginningIndexes ?? NULL\r\n    result._bitflags             = options._bitflags             ?? 0\r\n    return result\r\n  }\r\n\r\n\r\n  var normalizeScore = score => {\r\n    if(score === NEGATIVE_INFINITY) return 0\r\n    if(score > 1) return score\r\n    return Math.E ** ( ((-score + 1)**.04307 - 1) * -2)\r\n  }\r\n  var denormalizeScore = normalizedScore => {\r\n    if(normalizedScore === 0) return NEGATIVE_INFINITY\r\n    if(normalizedScore > 1) return normalizedScore\r\n    return 1 - Math.pow((Math.log(normalizedScore) / -2 + 1), 1 / 0.04307)\r\n  }\r\n\r\n\r\n  var prepareSearch = (search) => {\r\n    if(typeof search === 'number') search = ''+search\r\n    else if(typeof search !== 'string') search = ''\r\n    search = search.trim()\r\n    var info = prepareLowerInfo(search)\r\n\r\n    var spaceSearches = []\r\n    if(info.containsSpace) {\r\n      var searches = search.split(/\\s+/)\r\n      searches = [...new Set(searches)] // distinct\r\n      for(var i=0; i<searches.length; i++) {\r\n        if(searches[i] === '') continue\r\n        var _info = prepareLowerInfo(searches[i])\r\n        spaceSearches.push({lowerCodes:_info.lowerCodes, _lower:searches[i].toLowerCase(), containsSpace:false})\r\n      }\r\n    }\r\n\r\n    return {lowerCodes: info.lowerCodes, _lower: info._lower, containsSpace: info.containsSpace, bitflags: info.bitflags, spaceSearches: spaceSearches}\r\n  }\r\n\r\n\r\n\r\n  var getPrepared = (target) => {\r\n    if(target.length > 999) return prepare(target) // don't cache huge targets\r\n    var targetPrepared = preparedCache.get(target)\r\n    if(targetPrepared !== undefined) return targetPrepared\r\n    targetPrepared = prepare(target)\r\n    preparedCache.set(target, targetPrepared)\r\n    return targetPrepared\r\n  }\r\n  var getPreparedSearch = (search) => {\r\n    if(search.length > 999) return prepareSearch(search) // don't cache huge searches\r\n    var searchPrepared = preparedSearchCache.get(search)\r\n    if(searchPrepared !== undefined) return searchPrepared\r\n    searchPrepared = prepareSearch(search)\r\n    preparedSearchCache.set(search, searchPrepared)\r\n    return searchPrepared\r\n  }\r\n\r\n\r\n  var all = (targets, options) => {\r\n    var results = []; results.total = targets.length // this total can be wrong if some targets are skipped\r\n\r\n    var limit = options?.limit || INFINITY\r\n\r\n    if(options?.key) {\r\n      for(var i=0;i<targets.length;i++) { var obj = targets[i]\r\n        var target = getValue(obj, options.key)\r\n        if(target == NULL) continue\r\n        if(!isPrepared(target)) target = getPrepared(target)\r\n        var result = new_result(target.target, {_score: target._score, obj: obj})\r\n        results.push(result); if(results.length >= limit) return results\r\n      }\r\n    } else if(options?.keys) {\r\n      for(var i=0;i<targets.length;i++) { var obj = targets[i]\r\n        var objResults = new KeysResult(options.keys.length)\r\n        for (var keyI = options.keys.length - 1; keyI >= 0; --keyI) {\r\n          var target = getValue(obj, options.keys[keyI])\r\n          if(!target) { objResults[keyI] = noTarget; continue }\r\n          if(!isPrepared(target)) target = getPrepared(target)\r\n          target._score = NEGATIVE_INFINITY\r\n          target._indexes.len = 0\r\n          objResults[keyI] = target\r\n        }\r\n        objResults.obj = obj\r\n        objResults._score = NEGATIVE_INFINITY\r\n        results.push(objResults); if(results.length >= limit) return results\r\n      }\r\n    } else {\r\n      for(var i=0;i<targets.length;i++) { var target = targets[i]\r\n        if(target == NULL) continue\r\n        if(!isPrepared(target)) target = getPrepared(target)\r\n        target._score = NEGATIVE_INFINITY\r\n        target._indexes.len = 0\r\n        results.push(target); if(results.length >= limit) return results\r\n      }\r\n    }\r\n\r\n    return results\r\n  }\r\n\r\n\r\n  var algorithm = (preparedSearch, prepared, allowSpaces=false, allowPartialMatch=false) => {\r\n    if(allowSpaces===false && preparedSearch.containsSpace) return algorithmSpaces(preparedSearch, prepared, allowPartialMatch)\r\n\r\n    var searchLower      = preparedSearch._lower\r\n    var searchLowerCodes = preparedSearch.lowerCodes\r\n    var searchLowerCode  = searchLowerCodes[0]\r\n    var targetLowerCodes = prepared._targetLowerCodes\r\n    var searchLen        = searchLowerCodes.length\r\n    var targetLen        = targetLowerCodes.length\r\n    var searchI          = 0 // where we at\r\n    var targetI          = 0 // where you at\r\n    var matchesSimpleLen = 0\r\n\r\n    // very basic fuzzy match; to remove non-matching targets ASAP!\r\n    // walk through target. find sequential matches.\r\n    // if all chars aren't found then exit\r\n    for(;;) {\r\n      var isMatch = searchLowerCode === targetLowerCodes[targetI]\r\n      if(isMatch) {\r\n        matchesSimple[matchesSimpleLen++] = targetI\r\n        ++searchI; if(searchI === searchLen) break\r\n        searchLowerCode = searchLowerCodes[searchI]\r\n      }\r\n      ++targetI; if(targetI >= targetLen) return NULL // Failed to find searchI\r\n    }\r\n\r\n    var searchI = 0\r\n    var successStrict = false\r\n    var matchesStrictLen = 0\r\n\r\n    var nextBeginningIndexes = prepared._nextBeginningIndexes\r\n    if(nextBeginningIndexes === NULL) nextBeginningIndexes = prepared._nextBeginningIndexes = prepareNextBeginningIndexes(prepared.target)\r\n    targetI = matchesSimple[0]===0 ? 0 : nextBeginningIndexes[matchesSimple[0]-1]\r\n\r\n    // Our target string successfully matched all characters in sequence!\r\n    // Let's try a more advanced and strict test to improve the score\r\n    // only count it as a match if it's consecutive or a beginning character!\r\n    var backtrackCount = 0\r\n    if(targetI !== targetLen) for(;;) {\r\n      if(targetI >= targetLen) {\r\n        // We failed to find a good spot for this search char, go back to the previous search char and force it forward\r\n        if(searchI <= 0) break // We failed to push chars forward for a better match\r\n\r\n        ++backtrackCount; if(backtrackCount > 200) break // exponential backtracking is taking too long, just give up and return a bad match\r\n\r\n        --searchI\r\n        var lastMatch = matchesStrict[--matchesStrictLen]\r\n        targetI = nextBeginningIndexes[lastMatch]\r\n\r\n      } else {\r\n        var isMatch = searchLowerCodes[searchI] === targetLowerCodes[targetI]\r\n        if(isMatch) {\r\n          matchesStrict[matchesStrictLen++] = targetI\r\n          ++searchI; if(searchI === searchLen) { successStrict = true; break }\r\n          ++targetI\r\n        } else {\r\n          targetI = nextBeginningIndexes[targetI]\r\n        }\r\n      }\r\n    }\r\n\r\n    // check if it's a substring match\r\n    var substringIndex = searchLen <= 1 ? -1 : prepared._targetLower.indexOf(searchLower, matchesSimple[0]) // perf: this is slow\r\n    var isSubstring = !!~substringIndex\r\n    var isSubstringBeginning = !isSubstring ? false : substringIndex===0 || prepared._nextBeginningIndexes[substringIndex-1] === substringIndex\r\n\r\n    // if it's a substring match but not at a beginning index, let's try to find a substring starting at a beginning index for a better score\r\n    if(isSubstring && !isSubstringBeginning) {\r\n      for(var i=0; i<nextBeginningIndexes.length; i=nextBeginningIndexes[i]) {\r\n        if(i <= substringIndex) continue\r\n\r\n        for(var s=0; s<searchLen; s++) if(searchLowerCodes[s] !== prepared._targetLowerCodes[i+s]) break\r\n        if(s === searchLen) { substringIndex = i; isSubstringBeginning = true; break }\r\n      }\r\n    }\r\n\r\n    // tally up the score & keep track of matches for highlighting later\r\n    // if it's a simple match, we'll switch to a substring match if a substring exists\r\n    // if it's a strict match, we'll switch to a substring match only if that's a better score\r\n\r\n    var calculateScore = matches => {\r\n      var score = 0\r\n\r\n      var extraMatchGroupCount = 0\r\n      for(var i = 1; i < searchLen; ++i) {\r\n        if(matches[i] - matches[i-1] !== 1) {score -= matches[i]; ++extraMatchGroupCount}\r\n      }\r\n      var unmatchedDistance = matches[searchLen-1] - matches[0] - (searchLen-1)\r\n\r\n      score -= (12+unmatchedDistance) * extraMatchGroupCount // penality for more groups\r\n\r\n      if(matches[0] !== 0) score -= matches[0]*matches[0]*.2 // penality for not starting near the beginning\r\n\r\n      if(!successStrict) {\r\n        score *= 1000\r\n      } else {\r\n        // successStrict on a target with too many beginning indexes loses points for being a bad target\r\n        var uniqueBeginningIndexes = 1\r\n        for(var i = nextBeginningIndexes[0]; i < targetLen; i=nextBeginningIndexes[i]) ++uniqueBeginningIndexes\r\n\r\n        if(uniqueBeginningIndexes > 24) score *= (uniqueBeginningIndexes-24)*10 // quite arbitrary numbers here ...\r\n      }\r\n\r\n      score -= (targetLen - searchLen)/2 // penality for longer targets\r\n\r\n      if(isSubstring)          score /= 1+searchLen*searchLen*1 // bonus for being a full substring\r\n      if(isSubstringBeginning) score /= 1+searchLen*searchLen*1 // bonus for substring starting on a beginningIndex\r\n\r\n      score -= (targetLen - searchLen)/2 // penality for longer targets\r\n\r\n      return score\r\n    }\r\n\r\n    if(!successStrict) {\r\n      if(isSubstring) for(var i=0; i<searchLen; ++i) matchesSimple[i] = substringIndex+i // at this point it's safe to overwrite matchehsSimple with substr matches\r\n      var matchesBest = matchesSimple\r\n      var score = calculateScore(matchesBest)\r\n    } else {\r\n      if(isSubstringBeginning) {\r\n        for(var i=0; i<searchLen; ++i) matchesSimple[i] = substringIndex+i // at this point it's safe to overwrite matchehsSimple with substr matches\r\n        var matchesBest = matchesSimple\r\n        var score = calculateScore(matchesSimple)\r\n      } else {\r\n        var matchesBest = matchesStrict\r\n        var score = calculateScore(matchesStrict)\r\n      }\r\n    }\r\n\r\n    prepared._score = score\r\n\r\n    for(var i = 0; i < searchLen; ++i) prepared._indexes[i] = matchesBest[i]\r\n    prepared._indexes.len = searchLen\r\n\r\n    const result    = new Result()\r\n    result.target   = prepared.target\r\n    result._score   = prepared._score\r\n    result._indexes = prepared._indexes\r\n    return result\r\n  }\r\n  var algorithmSpaces = (preparedSearch, target, allowPartialMatch) => {\r\n    var seen_indexes = new Set()\r\n    var score = 0\r\n    var result = NULL\r\n\r\n    var first_seen_index_last_search = 0\r\n    var searches = preparedSearch.spaceSearches\r\n    var searchesLen = searches.length\r\n    var changeslen = 0\r\n\r\n    // Return _nextBeginningIndexes back to its normal state\r\n    var resetNextBeginningIndexes = () => {\r\n      for(let i=changeslen-1; i>=0; i--) target._nextBeginningIndexes[nextBeginningIndexesChanges[i*2 + 0]] = nextBeginningIndexesChanges[i*2 + 1]\r\n    }\r\n\r\n    var hasAtLeast1Match = false\r\n    for(var i=0; i<searchesLen; ++i) {\r\n      allowPartialMatchScores[i] = NEGATIVE_INFINITY\r\n      var search = searches[i]\r\n\r\n      result = algorithm(search, target)\r\n      if(allowPartialMatch) {\r\n        if(result === NULL) continue\r\n        hasAtLeast1Match = true\r\n      } else {\r\n        if(result === NULL) {resetNextBeginningIndexes(); return NULL}\r\n      }\r\n\r\n      // if not the last search, we need to mutate _nextBeginningIndexes for the next search\r\n      var isTheLastSearch = i === searchesLen - 1\r\n      if(!isTheLastSearch) {\r\n        var indexes = result._indexes\r\n\r\n        var indexesIsConsecutiveSubstring = true\r\n        for(let i=0; i<indexes.len-1; i++) {\r\n          if(indexes[i+1] - indexes[i] !== 1) {\r\n            indexesIsConsecutiveSubstring = false; break;\r\n          }\r\n        }\r\n\r\n        if(indexesIsConsecutiveSubstring) {\r\n          var newBeginningIndex = indexes[indexes.len-1] + 1\r\n          var toReplace = target._nextBeginningIndexes[newBeginningIndex-1]\r\n          for(let i=newBeginningIndex-1; i>=0; i--) {\r\n            if(toReplace !== target._nextBeginningIndexes[i]) break\r\n            target._nextBeginningIndexes[i] = newBeginningIndex\r\n            nextBeginningIndexesChanges[changeslen*2 + 0] = i\r\n            nextBeginningIndexesChanges[changeslen*2 + 1] = toReplace\r\n            changeslen++\r\n          }\r\n        }\r\n      }\r\n\r\n      score += result._score / searchesLen\r\n      allowPartialMatchScores[i] = result._score / searchesLen\r\n\r\n      // dock points based on order otherwise \"c man\" returns Manifest.cpp instead of CheatManager.h\r\n      if(result._indexes[0] < first_seen_index_last_search) {\r\n        score -= (first_seen_index_last_search - result._indexes[0]) * 2\r\n      }\r\n      first_seen_index_last_search = result._indexes[0]\r\n\r\n      for(var j=0; j<result._indexes.len; ++j) seen_indexes.add(result._indexes[j])\r\n    }\r\n\r\n    if(allowPartialMatch && !hasAtLeast1Match) return NULL\r\n\r\n    resetNextBeginningIndexes()\r\n\r\n    // allows a search with spaces that's an exact substring to score well\r\n    var allowSpacesResult = algorithm(preparedSearch, target, /*allowSpaces=*/true)\r\n    if(allowSpacesResult !== NULL && allowSpacesResult._score > score) {\r\n      if(allowPartialMatch) {\r\n        for(var i=0; i<searchesLen; ++i) {\r\n          allowPartialMatchScores[i] = allowSpacesResult._score / searchesLen\r\n        }\r\n      }\r\n      return allowSpacesResult\r\n    }\r\n\r\n    if(allowPartialMatch) result = target\r\n    result._score = score\r\n\r\n    var i = 0\r\n    for (let index of seen_indexes) result._indexes[i++] = index\r\n    result._indexes.len = i\r\n\r\n    return result\r\n  }\r\n\r\n\r\n  var prepareLowerInfo = (str) => {\r\n    var strLen = str.length\r\n    var lower = str.toLowerCase()\r\n    var lowerCodes = [] // new Array(strLen)    sparse array is too slow\r\n    var bitflags = 0\r\n    var containsSpace = false // space isn't stored in bitflags because of how searching with a space works\r\n\r\n    for(var i = 0; i < strLen; ++i) {\r\n      var lowerCode = lowerCodes[i] = lower.charCodeAt(i)\r\n\r\n      if(lowerCode === 32) {\r\n        containsSpace = true\r\n        continue // it's important that we don't set any bitflags for space\r\n      }\r\n\r\n      var bit = lowerCode>=97&&lowerCode<=122 ? lowerCode-97 // alphabet\r\n              : lowerCode>=48&&lowerCode<=57  ? 26           // numbers\r\n                                                             // 3 bits available\r\n              : lowerCode<=127                ? 30           // other ascii\r\n              :                                 31           // other utf8\r\n      bitflags |= 1<<bit\r\n    }\r\n\r\n    return {lowerCodes:lowerCodes, bitflags:bitflags, containsSpace:containsSpace, _lower:lower}\r\n  }\r\n  var prepareBeginningIndexes = (target) => {\r\n    var targetLen = target.length\r\n    var beginningIndexes = []; var beginningIndexesLen = 0\r\n    var wasUpper = false\r\n    var wasAlphanum = false\r\n    for(var i = 0; i < targetLen; ++i) {\r\n      var targetCode = target.charCodeAt(i)\r\n      var isUpper = targetCode>=65&&targetCode<=90\r\n      var isAlphanum = isUpper || targetCode>=97&&targetCode<=122 || targetCode>=48&&targetCode<=57\r\n      var isBeginning = isUpper && !wasUpper || !wasAlphanum || !isAlphanum\r\n      wasUpper = isUpper\r\n      wasAlphanum = isAlphanum\r\n      if(isBeginning) beginningIndexes[beginningIndexesLen++] = i\r\n    }\r\n    return beginningIndexes\r\n  }\r\n  var prepareNextBeginningIndexes = (target) => {\r\n    var targetLen = target.length\r\n    var beginningIndexes = prepareBeginningIndexes(target)\r\n    var nextBeginningIndexes = [] // new Array(targetLen)     sparse array is too slow\r\n    var lastIsBeginning = beginningIndexes[0]\r\n    var lastIsBeginningI = 0\r\n    for(var i = 0; i < targetLen; ++i) {\r\n      if(lastIsBeginning > i) {\r\n        nextBeginningIndexes[i] = lastIsBeginning\r\n      } else {\r\n        lastIsBeginning = beginningIndexes[++lastIsBeginningI]\r\n        nextBeginningIndexes[i] = lastIsBeginning===undefined ? targetLen : lastIsBeginning\r\n      }\r\n    }\r\n    return nextBeginningIndexes\r\n  }\r\n\r\n  var preparedCache       = new Map()\r\n  var preparedSearchCache = new Map()\r\n\r\n  // the theory behind these being globals is to reduce garbage collection by not making new arrays\r\n  var matchesSimple = []; var matchesStrict = []\r\n  var nextBeginningIndexesChanges = [] // allows straw berry to match strawberry well, by modifying the end of a substring to be considered a beginning index for the rest of the search\r\n  var keysSpacesBestScores = []; var allowPartialMatchScores = []\r\n  var tmpTargets = []; var tmpResults = []\r\n\r\n  // prop = 'key'                  2.5ms optimized for this case, seems to be about as fast as direct obj[prop]\r\n  // prop = 'key1.key2'            10ms\r\n  // prop = ['key1', 'key2']       27ms\r\n  // prop = obj => obj.tags.join() ??ms\r\n  var getValue = (obj, prop) => {\r\n    var tmp = obj[prop]; if(tmp !== undefined) return tmp\r\n    if(typeof prop === 'function') return prop(obj) // this should run first. but that makes string props slower\r\n    var segs = prop\r\n    if(!Array.isArray(prop)) segs = prop.split('.')\r\n    var len = segs.length\r\n    var i = -1\r\n    while (obj && (++i < len)) obj = obj[segs[i]]\r\n    return obj\r\n  }\r\n\r\n  var isPrepared = (x) => { return typeof x === 'object' && typeof x._bitflags === 'number' }\r\n  var INFINITY = Infinity; var NEGATIVE_INFINITY = -INFINITY\r\n  var noResults = []; noResults.total = 0\r\n  var NULL = null\r\n\r\n  var noTarget = prepare('')\r\n\r\n  // Hacked version of https://github.com/lemire/FastPriorityQueue.js\r\n  var fastpriorityqueue=r=>{var e=[],o=0,a={},v=r=>{for(var a=0,v=e[a],c=1;c<o;){var s=c+1;a=c,s<o&&e[s]._score<e[c]._score&&(a=s),e[a-1>>1]=e[a],c=1+(a<<1)}for(var f=a-1>>1;a>0&&v._score<e[f]._score;f=(a=f)-1>>1)e[a]=e[f];e[a]=v};return a.add=(r=>{var a=o;e[o++]=r;for(var v=a-1>>1;a>0&&r._score<e[v]._score;v=(a=v)-1>>1)e[a]=e[v];e[a]=r}),a.poll=(r=>{if(0!==o){var a=e[0];return e[0]=e[--o],v(),a}}),a.peek=(r=>{if(0!==o)return e[0]}),a.replaceTop=(r=>{e[0]=r,v()}),a}\r\n  var q = fastpriorityqueue() // reuse this\r\n\r\n  // fuzzysort is written this way for minification. all names are mangeled unless quoted\r\n  return {'single':single, 'go':go, 'prepare':prepare, 'cleanup':cleanup}\r\n}) // UMD\r\n","import fuzzysort from 'fuzzysort';\n\nimport { isListOfObjects, isListOfStrings } from '../../types/utils';\nimport { normalizeText } from './helpers';\n\nexport interface Options {\n  fieldNames: string[];\n}\n\nexport function searchFuzzy(searchTerm: string, items: string[]): string[];\n\nexport function searchFuzzy<Item = unknown>(searchTerm: string, items: Item[], options: Options): Item[];\n\nexport function searchFuzzy<Item = unknown>(searchTerm: string, items: Item[], options?: Options) {\n  const threshold = -100000; // 0 returns perfect match\n  const normalizedSearchTerm = normalizeText(searchTerm)\n    .replace(/[^\\w\\s]/gi, '')\n    .toLowerCase();\n\n  if (isListOfStrings(items)) {\n    return fuzzysort.go(normalizedSearchTerm, items, { all: true, threshold }).map((r) => r.target);\n  }\n\n  if (isListOfObjects<Item>(items) && options?.fieldNames?.length) {\n    return fuzzysort\n      .go(normalizedSearchTerm, items, { all: true, threshold, keys: options?.fieldNames })\n      .map((r) => r.obj);\n  }\n\n  return items;\n}\n\nexport default searchFuzzy;\n"],"names":["isListOfStrings","list","isListOfObjects","isPlainObject","root","UMD","module","this","_","single","search","target","NULL","preparedSearch","getPreparedSearch","isPrepared","getPrepared","searchBitflags","algorithm","go","targets","options","all","noResults","containsSpace","threshold","denormalizeScore","limit","INFINITY","resultsLen","limitedCount","targetsLen","push_result","result","q","key","i","obj","getValue","keys","keysLen","outer","keysBitflags","keyI","tmpTargets","noTarget","keysSpacesBestScores","NEGATIVE_INFINITY","tmpResults","allowPartialMatchScores","tmp","hasAtLeast1Match","objResults","KeysResult","score","results","highlight","open","close","callback","targetLen","indexes","highlighted","matchI","indexesI","opened","parts","char","prepare","info","prepareLowerInfo","new_result","cleanup","preparedCache","preparedSearchCache","Result","a","b","normalizeScore","normalizedScore","prepareSearch","spaceSearches","searches","_info","targetPrepared","searchPrepared","prepared","allowSpaces","allowPartialMatch","algorithmSpaces","searchLower","searchLowerCodes","searchLowerCode","targetLowerCodes","searchLen","searchI","targetI","matchesSimpleLen","isMatch","matchesSimple","successStrict","matchesStrictLen","nextBeginningIndexes","prepareNextBeginningIndexes","backtrackCount","lastMatch","matchesStrict","substringIndex","isSubstring","isSubstringBeginning","s","calculateScore","matches","extraMatchGroupCount","unmatchedDistance","uniqueBeginningIndexes","matchesBest","seen_indexes","first_seen_index_last_search","searchesLen","changeslen","resetNextBeginningIndexes","nextBeginningIndexesChanges","isTheLastSearch","indexesIsConsecutiveSubstring","newBeginningIndex","toReplace","j","allowSpacesResult","index","str","strLen","lower","lowerCodes","bitflags","lowerCode","bit","prepareBeginningIndexes","beginningIndexes","beginningIndexesLen","wasUpper","wasAlphanum","targetCode","isUpper","isAlphanum","isBeginning","lastIsBeginning","lastIsBeginningI","prop","segs","len","x","fastpriorityqueue","o","r","v","c","f","searchFuzzy","searchTerm","items","normalizedSearchTerm","normalizeText","fuzzysort","_a"],"mappings":";;;;AAgBO,SAASA,GAAgBC,GAAiC;AAC/D,SAAO,MAAM,QAAQA,CAAI,KAAK,OAAOA,EAAK,CAAC,KAAM;AACnD;AAEO,SAASC,GAA6BD,GAA4B;AACvE,SAAO,MAAM,QAAQA,CAAI,KAAKE,GAAcF,EAAK,CAAC,CAAC;AACrD;;;;ACnBC,KAAC,CAACG,GAAMC,MAAQ;AAEV,MAAiCC,EAAO,UAASA,EAAA,UAAiBD,EAAG,IACrED,EAAK,YAAeC,EAAG;AAAA,IAC9B,GAAGE,IAAM,CAAAC,MAAK;AAGZ,UAAIC,IAAS,CAACC,GAAQC,MAAW;AAC/B,YAAG,CAACD,KAAU,CAACC,EAAQ,QAAOC;AAE9B,YAAIC,IAAiBC,GAAkBJ,CAAM;AAC7C,QAAIK,EAAWJ,CAAM,MAAGA,IAASK,EAAYL,CAAM;AAEnD,YAAIM,IAAiBJ,EAAe;AACpC,gBAAII,IAAiBN,EAAO,eAAeM,IAAuBL,IAE3DM,EAAUL,GAAgBF,CAAM;AAAA,MAC3C,GAEMQ,KAAK,CAACT,GAAQU,GAASC,MAAY;AACrC,YAAG,CAACX,EAAQ,QAAOW,KAAA,QAAAA,EAAS,MAAMC,GAAIF,GAASC,CAAO,IAAIE;AAE1D,YAAIV,IAAiBC,GAAkBJ,CAAM,GACzCO,IAAiBJ,EAAe,UAChCW,IAAiBX,EAAe,eAEhCY,IAAYC,GAAkBL,KAAA,gBAAAA,EAAS,cAAa,CAAC,GACrDM,KAAYN,KAAA,gBAAAA,EAAS,UAASO,IAE9BC,IAAa,GAAOC,IAAe,GACnCC,IAAaX,EAAQ;AAEzB,iBAASY,EAAYC,GAAQ;AAC3B,UAAGJ,IAAaF,KAASO,EAAE,IAAID,CAAM,GAAG,EAAEJ,MAExC,EAAEC,GACCG,EAAO,SAASC,EAAE,KAAI,EAAG,UAAQA,EAAE,WAAWD,CAAM;AAAA,QAE/D;AAKI,YAAGZ,KAAA,QAAAA,EAAS;AAEV,mBADIc,IAAMd,EAAQ,KACVe,IAAI,GAAGA,IAAIL,GAAY,EAAEK,GAAG;AAAE,gBAAIC,IAAMjB,EAAQgB,CAAC,GACnDzB,IAAS2B,EAASD,GAAKF,CAAG;AAC9B,gBAAIxB,MACAI,EAAWJ,CAAM,MAAGA,IAASK,EAAYL,CAAM,KAE/CM,IAAiBN,EAAO,eAAeM,IAC3C;AAAA,kBAAIgB,IAASf,EAAUL,GAAgBF,CAAM;AAC7C,cAAGsB,MAAWrB,MACXqB,EAAO,SAASR,MAEnBQ,EAAO,MAAMI,GACbL,EAAYC,CAAM;AAAA;AAAA,UAC1B;AAAA,iBAGcZ,KAAA,QAAAA,EAAS,MAAM;AACvB,cAAIkB,IAAOlB,EAAQ,MACfmB,IAAUD,EAAK;AAEnB,UAAAE,EAAO,UAAQL,IAAI,GAAGA,IAAIL,GAAY,EAAEK,GAAG;AAAE,gBAAIC,IAAMjB,EAAQgB,CAAC;AAE9D;AAEE,uBADIM,IAAe,GACVC,IAAO,GAAGA,IAAOH,GAAS,EAAEG,GAAM;AACzC,oBAAIR,IAAMI,EAAKI,CAAI,GACfhC,IAAS2B,EAASD,GAAKF,CAAG;AAC9B,oBAAG,CAACxB,GAAQ;AAAE,kBAAAiC,GAAWD,CAAI,IAAIE;AAAU;AAAA,gBAAQ;AACnD,gBAAI9B,EAAWJ,CAAM,MAAGA,IAASK,EAAYL,CAAM,IACnDiC,GAAWD,CAAI,IAAIhC,GAEnB+B,KAAgB/B,EAAO;AAAA,cACnC;AAEU,mBAAIM,IAAiByB,OAAkBzB,EAAgB;AAAA,YACjE;AAEQ,gBAAGO,EAAe,UAAQY,IAAE,GAAGA,IAAEvB,EAAe,cAAc,QAAQuB,IAAK,CAAAU,EAAqBV,CAAC,IAAIW;AAErG,qBAASJ,IAAO,GAAGA,IAAOH,GAAS,EAAEG,GAAM;AAEzC,kBADAhC,IAASiC,GAAWD,CAAI,GACrBhC,MAAWkC,GAAU;AAAE,gBAAAG,EAAWL,CAAI,IAAIE;AAAU;AAAA,cAAQ;AAG/D,kBADAG,EAAWL,CAAI,IAAIzB;AAAA,gBAAUL;AAAA,gBAAgBF;AAAA;AAAA,gBAAwB;AAAA;AAAA,gBAA6Ba;AAAA,cAAa,GAC5GwB,EAAWL,CAAI,MAAM/B,GAAM;AAAE,gBAAAoC,EAAWL,CAAI,IAAIE;AAAU;AAAA,cAAQ;AAIrE,kBAAGrB,EAAe,UAAQY,IAAE,GAAGA,IAAEvB,EAAe,cAAc,QAAQuB,KAAK;AACzE,oBAAGa,EAAwBb,CAAC,IAAI,QAC3BU,EAAqBV,CAAC,IAAIW,GAAmB;AAC9C,sBAAIG,KAAOJ,EAAqBV,CAAC,IAAIa,EAAwBb,CAAC,KAAK;AACnE,kBAAGc,IAAMJ,EAAqBV,CAAC,MAAGU,EAAqBV,CAAC,IAAIc;AAAA,gBAC5E;AAEY,gBAAGD,EAAwBb,CAAC,IAAIU,EAAqBV,CAAC,MAAGU,EAAqBV,CAAC,IAAIa,EAAwBb,CAAC;AAAA,cACxH;AAAA,YACA;AAEQ,gBAAGZ;AACD,uBAAQY,IAAE,GAAGA,IAAEvB,EAAe,cAAc,QAAQuB;AAAO,oBAAGU,EAAqBV,CAAC,MAAMW,EAAmB,UAASN;AAAA,mBACjH;AACL,kBAAIU,IAAmB;AACvB,uBAAQf,IAAE,GAAGA,IAAII,GAASJ;AAAO,oBAAGY,EAAWZ,CAAC,EAAE,WAAWW,GAAmB;AAAE,kBAAAI,IAAmB;AAAM;AAAA;AAC3G,kBAAG,CAACA,EAAkB;AAAA,YAChC;AAEQ,gBAAIC,IAAa,IAAIC,GAAWb,CAAO;AACvC,qBAAQJ,IAAE,GAAGA,IAAII,GAASJ;AAAO,cAAAgB,EAAWhB,CAAC,IAAIY,EAAWZ,CAAC;AAE7D,gBAAGZ,GAAe;AAChB,kBAAI8B,IAAQ;AACZ,uBAAQlB,IAAE,GAAGA,IAAEvB,EAAe,cAAc,QAAQuB,IAAK,CAAAkB,KAASR,EAAqBV,CAAC;AAAA,YAClG,OAAe;AAGL,kBAAIkB,IAAQP;AACZ,uBAAQX,IAAE,GAAGA,IAAEI,GAASJ,KAAK;AAC3B,oBAAIH,IAASmB,EAAWhB,CAAC;AACzB,oBAAGH,EAAO,SAAS,QACdqB,IAAQP,GAAmB;AAC5B,sBAAIG,KAAOI,IAAQrB,EAAO,UAAU;AACpC,kBAAGiB,IAAMI,MAAOA,IAAQJ;AAAA,gBACxC;AAEY,gBAAGjB,EAAO,SAASqB,MAAOA,IAAQrB,EAAO;AAAA,cACrD;AAAA,YACA;AAIQ,gBAFAmB,EAAW,MAAMf,GACjBe,EAAW,SAASE,GACjBjC,KAAA,QAAAA,EAAS,SAAS;AAEnB,kBADAiC,IAAQjC,EAAQ,QAAQ+B,CAAU,GAC/B,CAACE,EAAO;AACX,cAAAA,IAAQ5B,EAAiB4B,CAAK,GAC9BF,EAAW,SAASE;AAAA,YAC9B;AAEQ,YAAGA,IAAQ7B,KACXO,EAAYoB,CAAU;AAAA,UAC9B;AAAA,QAGA;AACM,mBAAQhB,IAAI,GAAGA,IAAIL,GAAY,EAAEK,GAAG;AAAE,gBAAIzB,IAASS,EAAQgB,CAAC;AAC1D,gBAAIzB,MACAI,EAAWJ,CAAM,MAAGA,IAASK,EAAYL,CAAM,KAE/CM,IAAiBN,EAAO,eAAeM,IAC3C;AAAA,kBAAIgB,IAASf,EAAUL,GAAgBF,CAAM;AAC7C,cAAGsB,MAAWrB,MACXqB,EAAO,SAASR,KAEnBO,EAAYC,CAAM;AAAA;AAAA,UAC1B;AAGI,YAAGJ,MAAe,EAAG,QAAON;AAE5B,iBADIgC,IAAU,IAAI,MAAM1B,CAAU,GAC1BO,IAAIP,IAAa,GAAGO,KAAK,GAAG,EAAEA,EAAG,CAAAmB,EAAQnB,CAAC,IAAIF,EAAE,KAAI;AAC5D,eAAAqB,EAAQ,QAAQ1B,IAAaC,GACtByB;AAAA,MACX,GAKMC,IAAY,CAACvB,GAAQwB,IAAK,OAAOC,IAAM,WAAW;AAYpD,iBAXIC,IAAW,OAAOF,KAAS,aAAaA,IAAO,QAE/C9C,IAAcsB,EAAO,QACrB2B,IAAcjD,EAAO,QACrBkD,IAAc5B,EAAO,SACrB6B,IAAc,IACdC,IAAc,GACdC,IAAc,GACdC,IAAc,IACdC,IAAc,CAAA,GAEV9B,IAAI,GAAGA,IAAIwB,GAAW,EAAExB,GAAG;AAAE,cAAI+B,IAAOxD,EAAOyB,CAAC;AACtD,cAAGyB,EAAQG,CAAQ,MAAM5B;AAUvB,gBATA,EAAE4B,GACEC,MAAUA,IAAS,IAClBN,KACDO,EAAM,KAAKJ,CAAW,GAAGA,IAAc,MAEvCA,KAAeL,IAIhBO,MAAaH,EAAQ,QAAQ;AAC9B,cAAGF,KACDG,KAAeK,GACfD,EAAM,KAAKP,EAASG,GAAaC,GAAQ,CAAC,GAAGD,IAAc,IAC3DI,EAAM,KAAKvD,EAAO,OAAOyB,IAAE,CAAC,CAAC,KAE7B0B,KAAeK,IAAOT,IAAQ/C,EAAO,OAAOyB,IAAE,CAAC;AAEjD;AAAA,YACV;AAAA;AAEQ,YAAG6B,MAAUA,IAAS,IACjBN,KACDO,EAAM,KAAKP,EAASG,GAAaC,GAAQ,CAAC,GAAGD,IAAc,MAE3DA,KAAeJ;AAIrB,UAAAI,KAAeK;AAAA,QACrB;AAEI,eAAOR,IAAWO,IAAQJ;AAAA,MAC9B,GAGMM,IAAU,CAACzD,MAAW;AACxB,QAAG,OAAOA,KAAW,WAAUA,IAAS,KAAGA,IACnC,OAAOA,KAAW,aAAUA,IAAS;AAC7C,YAAI0D,IAAOC,EAAiB3D,CAAM;AAClC,eAAO4D,GAAW5D,GAAQ,EAAC,cAAa0D,EAAK,QAAQ,mBAAkBA,EAAK,YAAY,WAAUA,EAAK,SAAQ,CAAC;AAAA,MACpH,GAEMG,IAAU,MAAM;AAAE,QAAAC,GAAc,MAAK,GAAIC,GAAoB,MAAK;AAAA,MAAE;AAAA,MASxE,MAAMC,GAAO;AAAA,QACX,IAAK,UAAa;AAAE,iBAAO,KAAK,SAAS,MAAM,GAAG,KAAK,SAAS,GAAG,EAAE,KAAK,CAACC,GAAEC,MAAID,IAAEC,CAAC;AAAA,QAAC;AAAA,QACrF,IAAK,QAAWhB,GAAS;AAAE,iBAAO,KAAK,WAAWA;AAAA,QAAO;AAAA,QACxD,UAAaJ,GAAMC,GAAO;AAAE,iBAAOF,EAAU,MAAMC,GAAMC,CAAK;AAAA,QAAC;AAAA,QAChE,IAAK,QAAW;AAAE,iBAAOoB,GAAe,KAAK,MAAM;AAAA,QAAC;AAAA,QACpD,IAAK,MAASxB,GAAO;AAAE,eAAK,SAAS5B,EAAiB4B,CAAK;AAAA,QAAC;AAAA;MAG9D,MAAMD,WAAmB,MAAM;AAAA,QAC7B,IAAK,QAAW;AAAE,iBAAOyB,GAAe,KAAK,MAAM;AAAA,QAAC;AAAA,QACpD,IAAK,MAASxB,GAAO;AAAE,eAAK,SAAS5B,EAAiB4B,CAAK;AAAA,QAAC;AAAA;AAG9D,UAAIiB,KAAa,CAAC5D,GAAQU,MAAY;AACpC,cAAMY,IAAS,IAAI0C,GAAM;AACzB,eAAA1C,EAAO,SAAwBtB,GAC/BsB,EAAO,MAAwBZ,EAAQ,OAAyBT,GAChEqB,EAAO,SAAwBZ,EAAQ,UAAyB0B,GAChEd,EAAO,WAAwBZ,EAAQ,YAAyB,CAAA,GAChEY,EAAO,eAAwBZ,EAAQ,gBAAyB,IAChEY,EAAO,oBAAwBZ,EAAQ,qBAAyBT,GAChEqB,EAAO,wBAAwBZ,EAAQ,yBAAyBT,GAChEqB,EAAO,YAAwBZ,EAAQ,aAAyB,GACzDY;AAAA,MACX,GAGM6C,KAAiB,CAAAxB,MAChBA,MAAUP,IAA0B,IACpCO,IAAQ,IAAUA,IACd,KAAK,QAAS,CAACA,IAAQ,MAAI,UAAS,KAAK,KAE9C5B,IAAmB,CAAAqD,MAClBA,MAAoB,IAAUhC,IAC9BgC,IAAkB,IAAUA,IACxB,IAAI,KAAK,IAAK,KAAK,IAAIA,CAAe,IAAI,KAAK,GAAI,IAAI,OAAO,GAInEC,KAAgB,CAACtE,MAAW;AAC9B,QAAG,OAAOA,KAAW,WAAUA,IAAS,KAAGA,IACnC,OAAOA,KAAW,aAAUA,IAAS,KAC7CA,IAASA,EAAO,KAAI;AACpB,YAAI2D,IAAOC,EAAiB5D,CAAM,GAE9BuE,IAAgB,CAAA;AACpB,YAAGZ,EAAK,eAAe;AACrB,cAAIa,IAAWxE,EAAO,MAAM,KAAK;AACjC,UAAAwE,IAAW,CAAC,GAAG,IAAI,IAAIA,CAAQ,CAAC;AAChC,mBAAQ9C,IAAE,GAAGA,IAAE8C,EAAS,QAAQ9C;AAC9B,gBAAG8C,EAAS9C,CAAC,MAAM,IACnB;AAAA,kBAAI+C,IAAQb,EAAiBY,EAAS9C,CAAC,CAAC;AACxC,cAAA6C,EAAc,KAAK,EAAC,YAAWE,EAAM,YAAY,QAAOD,EAAS9C,CAAC,EAAE,YAAW,GAAI,eAAc,GAAK,CAAC;AAAA;AAAA,QAE/G;AAEI,eAAO,EAAC,YAAYiC,EAAK,YAAY,QAAQA,EAAK,QAAQ,eAAeA,EAAK,eAAe,UAAUA,EAAK,UAAU,eAAeY,EAAa;AAAA,MACtJ,GAIMjE,IAAc,CAACL,MAAW;AAC5B,YAAGA,EAAO,SAAS,IAAK,QAAOyD,EAAQzD,CAAM;AAC7C,YAAIyE,IAAiBX,GAAc,IAAI9D,CAAM;AAC7C,eAAGyE,MAAmB,WACtBA,IAAiBhB,EAAQzD,CAAM,GAC/B8D,GAAc,IAAI9D,GAAQyE,CAAc,IACjCA;AAAA,MACX,GACMtE,KAAoB,CAACJ,MAAW;AAClC,YAAGA,EAAO,SAAS,IAAK,QAAOsE,GAActE,CAAM;AACnD,YAAI2E,IAAiBX,GAAoB,IAAIhE,CAAM;AACnD,eAAG2E,MAAmB,WACtBA,IAAiBL,GAActE,CAAM,GACrCgE,GAAoB,IAAIhE,GAAQ2E,CAAc,IACvCA;AAAA,MACX,GAGM/D,KAAM,CAACF,GAASC,MAAY;AAC9B,YAAIkC,IAAU,CAAA;AAAI,QAAAA,EAAQ,QAAQnC,EAAQ;AAE1C,YAAIO,KAAQN,KAAA,gBAAAA,EAAS,UAASO;AAE9B,YAAGP,KAAA,QAAAA,EAAS;AACV,mBAAQe,IAAE,GAAEA,IAAEhB,EAAQ,QAAOgB,KAAK;AAAE,gBAAIC,IAAMjB,EAAQgB,CAAC,GACjDzB,IAAS2B,EAASD,GAAKhB,EAAQ,GAAG;AACtC,gBAAGV,KAAUC,GACb;AAAA,cAAIG,EAAWJ,CAAM,MAAGA,IAASK,EAAYL,CAAM;AACnD,kBAAIsB,IAASsC,GAAW5D,EAAO,QAAQ,EAAC,QAAQA,EAAO,QAAQ,KAAK0B,EAAG,CAAC;AAClD,kBAAtBkB,EAAQ,KAAKtB,CAAM,GAAMsB,EAAQ,UAAU5B,EAAO,QAAO4B;AAAA;AAAA,UACjE;AAAA,iBACclC,KAAA,QAAAA,EAAS;AACjB,mBAAQe,IAAE,GAAEA,IAAEhB,EAAQ,QAAOgB,KAAK;AAEhC,qBAFsCC,IAAMjB,EAAQgB,CAAC,GACjDgB,IAAa,IAAIC,GAAWhC,EAAQ,KAAK,MAAM,GAC1CsB,IAAOtB,EAAQ,KAAK,SAAS,GAAGsB,KAAQ,GAAG,EAAEA,GAAM;AAC1D,kBAAIhC,IAAS2B,EAASD,GAAKhB,EAAQ,KAAKsB,CAAI,CAAC;AAC7C,kBAAG,CAAChC,GAAQ;AAAE,gBAAAyC,EAAWT,CAAI,IAAIE;AAAU;AAAA,cAAQ;AACnD,cAAI9B,EAAWJ,CAAM,MAAGA,IAASK,EAAYL,CAAM,IACnDA,EAAO,SAASoC,GAChBpC,EAAO,SAAS,MAAM,GACtByC,EAAWT,CAAI,IAAIhC;AAAA,YAC7B;AAGkC,gBAF1ByC,EAAW,MAAMf,GACjBe,EAAW,SAASL,GACpBQ,EAAQ,KAAKH,CAAU,GAAMG,EAAQ,UAAU5B,EAAO,QAAO4B;AAAA,UACrE;AAAA;AAEM,mBAAQnB,IAAE,GAAEA,IAAEhB,EAAQ,QAAOgB,KAAK;AAAE,gBAAIzB,IAASS,EAAQgB,CAAC;AACxD,gBAAGzB,KAAUC,MACTG,EAAWJ,CAAM,MAAGA,IAASK,EAAYL,CAAM,IACnDA,EAAO,SAASoC,GAChBpC,EAAO,SAAS,MAAM,GACtB4C,EAAQ,KAAK5C,CAAM,GAAM4C,EAAQ,UAAU5B;AAAO,qBAAO4B;AAAA,UACjE;AAGI,eAAOA;AAAA,MACX,GAGMrC,IAAY,CAACL,GAAgByE,GAAUC,IAAY,IAAOC,IAAkB,OAAU;AACxF,YAAGD,MAAc,MAAS1E,EAAe,cAAe,QAAO4E,GAAgB5E,GAAgByE,GAAUE,CAAiB;AAe1H,iBAbIE,IAAmB7E,EAAe,QAClC8E,IAAmB9E,EAAe,YAClC+E,IAAmBD,EAAiB,CAAC,GACrCE,IAAmBP,EAAS,mBAC5BQ,IAAmBH,EAAiB,QACpC/B,IAAmBiC,EAAiB,QACpCE,IAAmB,GACnBC,IAAmB,GACnBC,IAAmB,OAKf;AACN,cAAIC,IAAUN,MAAoBC,EAAiBG,CAAO;AAC1D,cAAGE,GAAS;AAEC,gBADXC,EAAcF,GAAkB,IAAID,GACpC,EAAED,GAAYA,MAAYD,EAAW;AACrC,YAAAF,IAAkBD,EAAiBI,CAAO;AAAA,UAClD;AACiB,cAAX,EAAEC,GAAYA,KAAWpC,EAAW,QAAOhD;AAAA,QACjD;AAEI,YAAImF,IAAU,GACVK,IAAgB,IAChBC,IAAmB,GAEnBC,IAAuBhB,EAAS;AACpC,QAAGgB,MAAyB1F,MAAM0F,IAAuBhB,EAAS,wBAAwBiB,GAA4BjB,EAAS,MAAM,IACrIU,IAAUG,EAAc,CAAC,MAAI,IAAI,IAAIG,EAAqBH,EAAc,CAAC,IAAE,CAAC;AAK5E,YAAIK,IAAiB;AACrB,YAAGR,MAAYpC,EAAW;AACxB,cAAGoC,KAAWpC,GAAW;AAIL,gBAFfmC,KAAW,MAEd,EAAES,GAAmBA,IAAiB,KAAK;AAE3C,cAAET;AACF,gBAAIU,IAAYC,EAAc,EAAEL,CAAgB;AAChD,YAAAL,IAAUM,EAAqBG,CAAS;AAAA,UAEhD,OAAa;AACL,gBAAIP,IAAUP,EAAiBI,CAAO,MAAMF,EAAiBG,CAAO;AACpE,gBAAGE,GAAS;AAEC,kBADXQ,EAAcL,GAAkB,IAAIL,GACpC,EAAED,GAAYA,MAAYD,GAAW;AAAE,gBAAAM,IAAgB;AAAM;AAAA,cAAK;AAClE,gBAAEJ;AAAA,YACZ;AACU,cAAAA,IAAUM,EAAqBN,CAAO;AAAA,UAEhD;AAII,YAAIW,IAAiBb,KAAa,IAAI,KAAKR,EAAS,aAAa,QAAQI,GAAaS,EAAc,CAAC,CAAC,GAClGS,IAAc,CAAC,CAAC,CAACD,GACjBE,IAAwBD,IAAsBD,MAAiB,KAAKrB,EAAS,sBAAsBqB,IAAe,CAAC,MAAMA,IAAnF;AAG1C,YAAGC,KAAe,CAACC;AACjB,mBAAQzE,IAAE,GAAGA,IAAEkE,EAAqB,QAAQlE,IAAEkE,EAAqBlE,CAAC;AAClE,gBAAG,EAAAA,KAAKuE,IAER;AAAA,uBAAQG,IAAE,GAAGA,IAAEhB,KAAmBH,EAAiBmB,CAAC,MAAMxB,EAAS,kBAAkBlD,IAAE0E,CAAC,GAA9DA,IAAK;AAC/B,kBAAGA,MAAMhB,GAAW;AAAE,gBAAAa,IAAiBvE,GAAGyE,IAAuB;AAAM;AAAA,cAAK;AAAA;AAAA;AAQhF,YAAIE,IAAiB,CAAAC,MAAW;AAI9B,mBAHI1D,IAAQ,GAER2D,KAAuB,GACnB7E,IAAI,GAAGA,IAAI0D,GAAW,EAAE1D;AAC9B,YAAG4E,EAAQ5E,CAAC,IAAI4E,EAAQ5E,IAAE,CAAC,MAAM,MAAIkB,KAAS0D,EAAQ5E,CAAC,GAAG,EAAE6E;AAE9D,cAAIC,KAAoBF,EAAQlB,IAAU,CAAC,IAAIkB,EAAQ,CAAC,KAAKlB,IAAU;AAMvE,cAJAxC,MAAU,KAAG4D,MAAqBD,IAE/BD,EAAQ,CAAC,MAAM,MAAG1D,KAAS0D,EAAQ,CAAC,IAAEA,EAAQ,CAAC,IAAE,MAEjD,CAACZ;AACF,YAAA9C,KAAS;AAAA,eACJ;AAGL,qBADI6D,KAAyB,GACrB/E,IAAIkE,EAAqB,CAAC,GAAGlE,IAAIwB,GAAWxB,IAAEkE,EAAqBlE,CAAC,EAAG,GAAE+E;AAEjF,YAAGA,KAAyB,OAAI7D,MAAU6D,KAAuB,MAAI;AAAA,UAC7E;AAEM,iBAAA7D,MAAUM,IAAYkC,KAAW,GAE9Bc,MAAsBtD,KAAS,IAAEwC,IAAUA,IAAU,IACrDe,MAAsBvD,KAAS,IAAEwC,IAAUA,IAAU,IAExDxC,MAAUM,IAAYkC,KAAW,GAE1BxC;AAAA,QACb;AAEI,YAAI8C;AAKF,cAAGS,GAAsB;AACvB,qBAAQzE,IAAE,GAAGA,IAAE0D,GAAW,EAAE1D,EAAG,CAAA+D,EAAc/D,CAAC,IAAIuE,IAAevE;AACjE,gBAAIgF,IAAcjB,GACd7C,IAAQyD,EAAeZ,CAAa;AAAA,UAChD;AACQ,gBAAIiB,IAAcV,GACdpD,IAAQyD,EAAeL,CAAa;AAAA,aAXzB;AACjB,cAAGE,EAAa,UAAQxE,IAAE,GAAGA,IAAE0D,GAAW,EAAE1D,EAAG,CAAA+D,EAAc/D,CAAC,IAAIuE,IAAevE;AACjF,cAAIgF,IAAcjB,GACd7C,IAAQyD,EAAeK,CAAW;AAAA,QAC5C;AAWI,QAAA9B,EAAS,SAAShC;AAElB,iBAAQlB,IAAI,GAAGA,IAAI0D,GAAW,EAAE1D,EAAG,CAAAkD,EAAS,SAASlD,CAAC,IAAIgF,EAAYhF,CAAC;AACvE,QAAAkD,EAAS,SAAS,MAAMQ;AAExB,cAAM7D,IAAY,IAAI0C,GAAM;AAC5B,eAAA1C,EAAO,SAAWqD,EAAS,QAC3BrD,EAAO,SAAWqD,EAAS,QAC3BrD,EAAO,WAAWqD,EAAS,UACpBrD;AAAA,MACX,GACMwD,KAAkB,CAAC5E,GAAgBF,GAAQ6E,MAAsB;AAgBnE,iBAfI6B,IAAe,oBAAI,IAAG,GACtB/D,IAAQ,GACRrB,IAASrB,GAET0G,IAA+B,GAC/BpC,IAAWrE,EAAe,eAC1B0G,IAAcrC,EAAS,QACvBsC,IAAa,GAGbC,IAA4B,MAAM;AACpC,mBAAQrF,IAAEoF,IAAW,GAAGpF,KAAG,GAAGA,IAAK,CAAAzB,EAAO,sBAAsB+G,EAA4BtF,IAAE,IAAI,CAAC,CAAC,IAAIsF,EAA4BtF,IAAE,IAAI,CAAC;AAAA,QACjJ,GAEQe,IAAmB,IACff,IAAE,GAAGA,IAAEmF,GAAa,EAAEnF,GAAG;AAC/B,UAAAa,EAAwBb,CAAC,IAAIW;AAC7B,cAAIrC,IAASwE,EAAS9C,CAAC;AAGvB,cADAH,IAASf,EAAUR,GAAQC,CAAM,GAC9B6E,GAAmB;AACpB,gBAAGvD,MAAWrB,EAAM;AACpB,YAAAuC,IAAmB;AAAA,UAC3B,WACWlB,MAAWrB;AAAO,mBAAA6G,EAAyB,GAAW7G;AAI3D,cAAI+G,IAAkBvF,MAAMmF,IAAc;AAC1C,cAAG,CAACI,GAAiB;AACnB,gBAAI9D,IAAU5B,EAAO,UAEjB2F,IAAgC;AACpC,qBAAQxF,IAAE,GAAGA,IAAEyB,EAAQ,MAAI,GAAGzB;AAC5B,kBAAGyB,EAAQzB,IAAE,CAAC,IAAIyB,EAAQzB,CAAC,MAAM,GAAG;AAClC,gBAAAwF,IAAgC;AAAO;AAAA,cACnD;AAGQ,gBAAGA,GAA+B;AAChC,kBAAIC,IAAoBhE,EAAQA,EAAQ,MAAI,CAAC,IAAI,GAC7CiE,IAAYnH,EAAO,sBAAsBkH,IAAkB,CAAC;AAChE,uBAAQzF,IAAEyF,IAAkB,GAAGzF,KAAG,KAC7B0F,MAAcnH,EAAO,sBAAsByB,CAAC,GADZA;AAEnC,gBAAAzB,EAAO,sBAAsByB,CAAC,IAAIyF,GAClCH,EAA4BF,IAAW,IAAI,CAAC,IAAIpF,GAChDsF,EAA4BF,IAAW,IAAI,CAAC,IAAIM,GAChDN;AAAA,YAEZ;AAAA,UACA;AAEM,UAAAlE,KAASrB,EAAO,SAASsF,GACzBtE,EAAwBb,CAAC,IAAIH,EAAO,SAASsF,GAG1CtF,EAAO,SAAS,CAAC,IAAIqF,MACtBhE,MAAUgE,IAA+BrF,EAAO,SAAS,CAAC,KAAK,IAEjEqF,IAA+BrF,EAAO,SAAS,CAAC;AAEhD,mBAAQ8F,IAAE,GAAGA,IAAE9F,EAAO,SAAS,KAAK,EAAE8F,EAAG,CAAAV,EAAa,IAAIpF,EAAO,SAAS8F,CAAC,CAAC;AAAA,QAClF;AAEI,YAAGvC,KAAqB,CAACrC,EAAkB,QAAOvC;AAElD,QAAA6G,EAAyB;AAGzB,YAAIO,IAAoB9G;AAAA,UAAUL;AAAA,UAAgBF;AAAA;AAAA,UAAwB;AAAA,QAAI;AAC9E,YAAGqH,MAAsBpH,KAAQoH,EAAkB,SAAS1E,GAAO;AACjE,cAAGkC;AACD,qBAAQpD,IAAE,GAAGA,IAAEmF,GAAa,EAAEnF;AAC5B,cAAAa,EAAwBb,CAAC,IAAI4F,EAAkB,SAAST;AAG5D,iBAAOS;AAAA,QACb;AAEI,QAAGxC,MAAmBvD,IAAStB,IAC/BsB,EAAO,SAASqB;AAEhB,YAAIlB,IAAI;AACR,iBAAS6F,KAASZ,EAAc,CAAApF,EAAO,SAASG,GAAG,IAAI6F;AACvD,eAAAhG,EAAO,SAAS,MAAMG,GAEfH;AAAA,MACX,GAGMqC,IAAmB,CAAC4D,MAAQ;AAO9B,iBANIC,IAASD,EAAI,QACbE,IAAQF,EAAI,YAAW,GACvBG,IAAa,CAAA,GACbC,IAAW,GACX9G,IAAgB,IAEZY,IAAI,GAAGA,IAAI+F,GAAQ,EAAE/F,GAAG;AAC9B,cAAImG,IAAYF,EAAWjG,CAAC,IAAIgG,EAAM,WAAWhG,CAAC;AAElD,cAAGmG,MAAc,IAAI;AACnB,YAAA/G,IAAgB;AAChB;AAAA,UACR;AAEM,cAAIgH,IAAMD,KAAW,MAAIA,KAAW,MAAMA,IAAU,KAC1CA,KAAW,MAAIA,KAAW,KAAM,KAEhCA,KAAW,MAAqB,KACA;AAC1C,UAAAD,KAAY,KAAGE;AAAA,QACrB;AAEI,eAAO,EAAC,YAAWH,GAAY,UAASC,GAAU,eAAc9G,GAAe,QAAO4G,EAAK;AAAA,MAC/F,GACMK,KAA0B,CAAC9H,MAAW;AAKxC,iBAJIiD,IAAYjD,EAAO,QACnB+H,IAAmB,CAAA,GAAQC,IAAsB,GACjDC,IAAW,IACXC,IAAc,IACVzG,IAAI,GAAGA,IAAIwB,GAAW,EAAExB,GAAG;AACjC,cAAI0G,IAAanI,EAAO,WAAWyB,CAAC,GAChC2G,IAAUD,KAAY,MAAIA,KAAY,IACtCE,IAAaD,KAAWD,KAAY,MAAIA,KAAY,OAAOA,KAAY,MAAIA,KAAY,IACvFG,IAAcF,KAAW,CAACH,KAAY,CAACC,KAAe,CAACG;AAC3D,UAAAJ,IAAWG,GACXF,IAAcG,GACXC,MAAaP,EAAiBC,GAAqB,IAAIvG;AAAA,QAChE;AACI,eAAOsG;AAAA,MACX,GACMnC,KAA8B,CAAC5F,MAAW;AAM5C,iBALIiD,IAAYjD,EAAO,QACnB+H,IAAmBD,GAAwB9H,CAAM,GACjD2F,IAAuB,CAAA,GACvB4C,IAAkBR,EAAiB,CAAC,GACpCS,IAAmB,GACf/G,IAAI,GAAGA,IAAIwB,GAAW,EAAExB;AAC9B,UAAG8G,IAAkB9G,IACnBkE,EAAqBlE,CAAC,IAAI8G,KAE1BA,IAAkBR,EAAiB,EAAES,CAAgB,GACrD7C,EAAqBlE,CAAC,IAAI8G,MAAkB,SAAYtF,IAAYsF;AAGxE,eAAO5C;AAAA,MACX,GAEM7B,KAAsB,oBAAI,IAAG,GAC7BC,KAAsB,oBAAI,IAAG,GAG7ByB,IAAgB,CAAA,GAAQO,IAAgB,CAAA,GACxCgB,IAA8B,CAAA,GAC9B5E,IAAuB,CAAA,GAAQG,IAA0B,CAAA,GACzDL,KAAa,CAAA,GAAQI,IAAa,CAAA,GAMlCV,IAAW,CAACD,GAAK+G,MAAS;AAC5B,YAAIlG,IAAMb,EAAI+G,CAAI;AAAG,YAAGlG,MAAQ,OAAW,QAAOA;AAClD,YAAG,OAAOkG,KAAS,WAAY,QAAOA,EAAK/G,CAAG;AAC9C,YAAIgH,IAAOD;AACX,QAAI,MAAM,QAAQA,CAAI,MAAGC,IAAOD,EAAK,MAAM,GAAG;AAG9C,iBAFIE,IAAMD,EAAK,QACXjH,IAAI,IACDC,KAAQ,EAAED,IAAIkH,IAAM,CAAAjH,IAAMA,EAAIgH,EAAKjH,CAAC,CAAC;AAC5C,eAAOC;AAAA,MACX,GAEMtB,IAAa,CAACwI,MAAe,OAAOA,KAAM,YAAY,OAAOA,EAAE,aAAc,UAC7E3H,KAAW,OAAcmB,IAAoB,CAACnB,IAC9CL,KAAY,CAAA;AAAI,MAAAA,GAAU,QAAQ;AACtC,UAAIX,IAAO,MAEPiC,IAAWuB,EAAQ,EAAE,GAGrBoF,KAAkB,OAAG;AAAC,YAAI,IAAE,IAAGC,IAAE,GAAE7E,IAAE,CAAA,GAAG,IAAE,CAAA8E,MAAG;AAAC,mBAAQ9E,IAAE,GAAE+E,IAAE,EAAE/E,CAAC,GAAEgF,IAAE,GAAEA,IAAEH,KAAG;AAAC,gBAAI3C,IAAE8C,IAAE;AAAE,YAAAhF,IAAEgF,GAAE9C,IAAE2C,KAAG,EAAE3C,CAAC,EAAE,SAAO,EAAE8C,CAAC,EAAE,WAAShF,IAAEkC,IAAG,EAAElC,IAAE,KAAG,CAAC,IAAE,EAAEA,CAAC,GAAEgF,IAAE,KAAGhF,KAAG;AAAA,UAAE;AAAC,mBAAQiF,IAAEjF,IAAE,KAAG,GAAEA,IAAE,KAAG+E,EAAE,SAAO,EAAEE,CAAC,EAAE,QAAOA,KAAGjF,IAAEiF,KAAG,KAAG,EAAE,GAAEjF,CAAC,IAAE,EAAEiF,CAAC;AAAE,YAAEjF,CAAC,IAAE+E;AAAA,QAAC;AAAE,eAAO/E,EAAE,OAAK,CAAA8E,MAAG;AAAC,cAAI9E,IAAE6E;AAAE,YAAEA,GAAG,IAAEC;AAAE,mBAAQC,IAAE/E,IAAE,KAAG,GAAEA,IAAE,KAAG8E,EAAE,SAAO,EAAEC,CAAC,EAAE,QAAOA,KAAG/E,IAAE+E,KAAG,KAAG,EAAE,GAAE/E,CAAC,IAAE,EAAE+E,CAAC;AAAE,YAAE/E,CAAC,IAAE8E;AAAA,QAAC,IAAG9E,EAAE,QAAM,CAAA8E,MAAG;AAAC,cAAOD,MAAJ,GAAM;AAAC,gBAAI7E,IAAE,EAAE,CAAC;AAAE,mBAAO,EAAE,CAAC,IAAE,EAAE,EAAE6E,CAAC,GAAE,EAAC,GAAG7E;AAAA,UAAC;AAAA,QAAC,IAAGA,EAAE,QAAM,CAAA8E,MAAG;AAAC,cAAOD,MAAJ,EAAM,QAAO,EAAE,CAAC;AAAA,QAAC,IAAG7E,EAAE,cAAY,CAAA8E,MAAG;AAAC,YAAE,CAAC,IAAEA,GAAE,EAAC;AAAA,QAAE,IAAG9E;AAAA,MAAC,GAC/c1C,IAAIsH,GAAiB;AAGzB,aAAO,EAAC,QAAS/I,GAAQ,IAAKU,IAAI,SAAUiD,GAAS,SAAUI,EAAO;AAAA,IACxE,CAAC;AAAA;;;;AChqBM,SAASsF,GAA4BC,GAAoBC,GAAe3I,GAAmB;;AAEhG,QAAM4I,IAAuBC,GAAcH,CAAU,EAClD,QAAQ,aAAa,EAAE,EACvB,YAAA;AAEH,SAAI/J,GAAgBgK,CAAK,IAChBG,GAAU,GAAGF,GAAsBD,GAAO,EAAE,KAAK,IAAM,gBAAA,CAAW,EAAE,IAAI,CAACN,MAAMA,EAAE,MAAM,IAG5FxJ,GAAsB8J,CAAK,OAAKI,IAAA/I,KAAA,gBAAAA,EAAS,eAAT,QAAA+I,EAAqB,UAChDD,GACJ,GAAGF,GAAsBD,GAAO,EAAE,KAAK,IAAM,iBAAW,MAAM3I,KAAA,gBAAAA,EAAS,YAAY,EACnF,IAAI,CAACqI,MAAMA,EAAE,GAAG,IAGdM;AACT;","x_google_ignoreList":[1]}