venue-js 1.4.0-next.16 → 1.4.0-next.17

package/dist/data/index.mjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/data/index.ts","../../src/data/constant.ts","../../src/data/api/delivery-project.ts","../../src/data/utils/geometry-validator.ts","../../src/data/utils/match-filters.ts","../../src/data/utils/occupant-helper.ts","../../src/data/utils/lodash/compact.ts","../../src/data/getDataClient.ts","../../src/data/populator/index.ts","../../../../node_modules/fuse.js/dist/fuse.mjs","../../src/data/search/utils/sanitizeInput.ts","../../src/data/search/getSearchClient.ts"],"sourcesContent":["export { QueryObserver } from \"@tanstack/query-core\"\n\nexport * from \"./types\"\nexport * from \"./constant\"\nexport * from \"./api/delivery-project\"\nexport * from './utils'\nexport * from \"./getDataClient\"\nexport * from './search/getSearchClient'","import { FeatureQueryOptions } from \"./types\"\nimport { FeatureType } from \"./types/feature-api\"\n\nexport const DEFAULT_BASE_URL = \"https://service.venue.in.th/api\"\n\nexport const IMDF_FEATURE_TYPES: FeatureType[] = [\n  \"address\",\n  \"amenity\",\n  \"anchor\",\n  \"building\",\n  \"detail\",\n  \"fixture\",\n  \"footprint\",\n  \"geofence\",\n  \"kiosk\",\n  \"level\",\n  \"occupant\",\n  \"opening\",\n  \"relationship\",\n  \"section\",\n  \"unit\",\n  \"venue\",\n]\n\nexport const NONIMDF_FEATURE_TYPES: FeatureType[] = [\n  \"taxonomy\",\n  \"event\",\n  \"promotion\",\n  \"label\",\n  \"privilege\",\n]\n\nexport const GEOJSON_FEATURE_TYPES: FeatureType[] = [\n  ...IMDF_FEATURE_TYPES,\n  ...NONIMDF_FEATURE_TYPES,\n]\n\nexport const ALL_FEATURE_TYPES: FeatureType[] = [\n  ...GEOJSON_FEATURE_TYPES,\n  \"sponsored-content\",\n  \"element\",\n]\n\nexport const defaultFeatureQueryOptionsMap: Record<\n  FeatureType,\n  FeatureQueryOptions\n> = {\n  // IMDF\n  address: {},\n  amenity: {},\n  anchor: {},\n  building: {},\n  detail: { enabled: false },\n  fixture: {},\n  footprint: {},\n  geofence: { enabled: false },\n  kiosk: {},\n  level: {},\n  occupant: {\n    refetchInterval: 5 * 60 * 1000, // refresh every 5 min\n    staleTime: 5 * 60 * 1000,\n  },\n  opening: {},\n  relationship: {},\n  section: {},\n  unit: {},\n  venue: {},\n\n  // OTHERS GEOJSON\n  taxonomy: {},\n  privilege: {},\n  event: {},\n  promotion: {\n    refetchInterval: 0.5 * 60 * 1000, // refresh every 5 min\n    staleTime: 0.5 * 60 * 1000,\n  },\n  label: {},\n\n  // NON GEOJSON\n  \"sponsored-content\": {\n    refetchInterval: 1 * 60 * 1000, // refresh every 5 min\n  },\n  element: {},\n  page: {},\n  model3d: {}\n}\n","import type {\n  FeatureResponseMap,\n  FeatureType,\n  SponsoredContentStrapiV4ApiResponse,\n} from \"../types/feature-api\"\nimport { DEFAULT_BASE_URL } from \"../constant\"\n\nexport async function fetchDeliveryApi<T extends FeatureType = FeatureType>(\n  projectId: string,\n  apiKey: string,\n  featureType: FeatureType,\n  baseUrl: string = DEFAULT_BASE_URL,\n): Promise<FeatureResponseMap[T][]> {\n  // TODO: Update Label Endpoint to match other endpoints\n  switch (featureType) {\n    case \"label\":\n    case \"element\": {\n      const pluralFeatureType = `${featureType}s`\n      const res = await fetch(\n        `${baseUrl}/delivery/projects/${projectId}/${pluralFeatureType}.geojson?api-key=${apiKey}`\n      )\n      if (res.status !== 200) return []\n      const items = await res.json()\n      return items\n    }\n\n    case \"model3d\": {\n      const res = await fetch(\n        `${baseUrl}/delivery/projects/${projectId}/${featureType}.geojson?api-key=${apiKey}`\n      )\n      if (res.status !== 200) return []\n      const items = await res.json()\n      return items.features\n    }\n\n    case \"sponsored-content\": {\n      const res = await fetch(\n        `${baseUrl}/delivery/projects/${projectId}/sponsored-content.json?api-key=${apiKey}`\n      )\n      if (res.status !== 200) return []\n      const jsonRes = await res.json()\n      const items = jsonRes.data as SponsoredContentStrapiV4ApiResponse[]\n      return items.map((item) => ({\n        id: item.id,\n        ...item.attributes,\n      })) as FeatureResponseMap[T][]\n    }\n\n    default: {\n      const res = await fetch(\n        `${baseUrl}/delivery/projects/${projectId}/imdf/${featureType}.geojson?api-key=${apiKey}`\n      )\n      if (res.status !== 200) return []\n      const collections = await res.json()\n      return collections.features\n    }\n  }\n}\n\n\nexport async function fetchPreviewApi<T extends FeatureType = FeatureType>(\n  projectId: string,\n  previewToken: string,\n  featureType: FeatureType,\n  baseUrl: string = DEFAULT_BASE_URL,\n): Promise<FeatureResponseMap[T][]> {\n  // TODO: Update Label Endpoint to match other endpoints\n  switch (featureType) {\n    case \"label\":\n    case \"element\": {\n      const pluralFeatureType = `${featureType}s`\n      const res = await fetch(\n        `${baseUrl}/preview/projects/${projectId}/${pluralFeatureType}.geojson`, {\n          headers: {\n            Authorization: `Bearer ${previewToken}`\n          }\n        }\n      )\n      if (res.status !== 200) return []\n      const items = await res.json()\n      return items\n    }\n\n    case \"sponsored-content\": {\n      const res = await fetch(\n        `${baseUrl}/preview/projects/${projectId}/sponsored-content.json`, {\n          headers: {\n            Authorization: `Bearer ${previewToken}`\n          }\n        }\n      )\n      if (res.status !== 200) return []\n      const jsonRes = await res.json()\n      const items = jsonRes.data as SponsoredContentStrapiV4ApiResponse[]\n      return items.map((item) => ({\n        id: item.id,\n        ...item.attributes,\n      })) as FeatureResponseMap[T][]\n    }\n\n    default: {\n      const res = await fetch(\n        `${baseUrl}/preview/projects/${projectId}/imdf/${featureType}.geojson`, {\n          headers: {\n            Authorization: `Bearer ${previewToken}`\n          }\n        }\n      )\n      if (res.status !== 200) return []\n      const collections = await res.json()\n      return collections.features\n    }\n  }\n}\n\nexport const safeFetchFeature = async <T extends FeatureType = FeatureType>(\n  featureType: FeatureType,\n  params: { \n    mode: 'delivery' | 'preview',\n    projectId: string,\n    apiKey: string,\n    previewToken?: string,\n    baseUrl: string\n  } \n): Promise<FeatureResponseMap[T][]> => {\n  const mode = params.mode ?? 'delivery'\n  const projectId = params.projectId\n  const apiKey = params.apiKey\n  const previewToken = params.previewToken\n  const baseUrl = params.baseUrl ?? DEFAULT_BASE_URL\n\n  try {\n    let result = []\n    \n    if (mode === 'delivery') {\n      result = await fetchDeliveryApi<T>(\n        projectId,\n        apiKey,\n        featureType,\n        baseUrl\n      )\n    } else if (mode === 'preview') {\n      result = await fetchPreviewApi<T>(\n        projectId,\n        previewToken,\n        featureType,\n        baseUrl\n      )\n    }\n    return result ?? []\n  } catch (e) {\n    // Suppress error and return []\n    return Promise.resolve([])\n  }\n}\n","import { Geometry, GeometryCollection, Position } from \"geojson\"\n\n/**\n * Checks if a point is a valid coordinate pair.\n *\n * @param point - The point to be checked.\n * @return True if the point is a valid coordinate pair, false otherwise.\n */\nexport const isValidCoordinate = (point: Position): boolean => {\n  return point.length === 2 && point.every((coord) => typeof coord === \"number\")\n}\n\n/**\n * Checks if a set of points forms a valid linear ring (closed and simple polygon).\n *\n * @param ring - The array of points representing a linear ring.\n * @return True if the linear ring is valid, false otherwise.\n */\nfunction isValidLinearRingCoordinates(ring: Position[]): boolean {\n  if (ring.length < 4) {\n    return false\n  }\n\n  return (\n    ring.every(isValidCoordinate) &&\n    ring[0][0] === ring[ring.length - 1][0] &&\n    ring[0][1] === ring[ring.length - 1][1]\n  )\n}\n\n/**\n * Checks if an input represents a valid polygon, which may include holes.\n * The input can be a single array of coordinates for simple polygons, or\n * an array of arrays of coordinates for polygons with holes.\n *\n * @param polygon - The input representing a polygon.\n * @return True if the polygon is valid, false otherwise.\n */\nexport const isValidPolygonCoordinates = (\n  polygon: Position[] | Position[][]\n): boolean => {\n  // Check if it's a simple polygon (without holes)\n  if (\n    Array.isArray(polygon[0]) &&\n    (polygon[0].length === 0 || typeof polygon[0][0] === \"number\")\n  ) {\n    return isValidLinearRingCoordinates(polygon as Position[])\n  }\n\n  // Check if it's a polygon with holes\n  if (\n    Array.isArray(polygon) &&\n    polygon.length > 0 &&\n    Array.isArray(polygon[0])\n  ) {\n    // Check the outer ring\n    if (!isValidLinearRingCoordinates(polygon[0] as Position[])) {\n      return false\n    }\n\n    // Check each hole\n    for (let i = 1; i < polygon.length; i++) {\n      if (!isValidLinearRingCoordinates(polygon[i] as Position[])) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  return false\n}\n\n/**\n * Checks if an array of polygons forms a valid MultiPolygon.\n *\n * @param multipolygon - The array of polygons.\n * @return True if the multipolygon is valid, false otherwise.\n */\nexport const isValidMultiPolygonCoordinates = (\n  multipolygon: Position[][][]\n): boolean => {\n  return multipolygon.every(isValidPolygonCoordinates)\n}\n\n/**\n * Checks if a set of points forms a valid LineString.\n * A valid LineString must have at least two points, each point must be a valid coordinate,\n * and it should not form a closed loop.\n *\n * @param lineString - The array of points representing a LineString.\n * @return True if the LineString is valid, false otherwise.\n */\nexport const isValidLineStringCoordinates = (\n  lineString: Position[]\n): boolean => {\n  if (!Array.isArray(lineString) || lineString.length < 2) {\n    return false\n  }\n\n  // Check if the first and last points are the same, which would make it a polygon\n  const firstPoint = lineString[0]\n  const lastPoint = lineString[lineString.length - 1]\n  if (firstPoint[0] === lastPoint[0] && firstPoint[1] === lastPoint[1]) {\n    return false\n  }\n\n  return lineString.every(isValidCoordinate)\n}\n\nexport const isValidMultiPolygon = (\n  geometry: Exclude<Geometry, GeometryCollection>\n): boolean => {\n  const { type, coordinates } = geometry\n  return type === \"MultiPolygon\" && isValidMultiPolygonCoordinates(coordinates)\n}\n\nexport const isValidPolygon = (\n  geometry: Exclude<Geometry, GeometryCollection>\n): boolean => {\n  const { type, coordinates } = geometry\n  return type === \"Polygon\" && isValidPolygonCoordinates(coordinates)\n}\n\nexport const isValidLineString = (\n  geometry: Exclude<Geometry, GeometryCollection>\n): boolean => {\n  const { type, coordinates } = geometry\n  return type === \"LineString\" && isValidLineStringCoordinates(coordinates)\n}\n\nexport const isValidPoint = (\n  geometry: Exclude<Geometry, GeometryCollection>\n): boolean => {\n  const { type, coordinates } = geometry\n  return type === \"Point\" && isValidCoordinate(coordinates)\n}\n","import type { Value, InFilter, Filter, Filters } from '../types/match-filters'\n\nfunction isInFilter(filter: Filter): filter is InFilter {\n  return (\n    typeof filter === \"object\" &&\n    filter !== null &&\n    \"$in\" in filter &&\n    Array.isArray((filter as any).$in)\n  );\n}\n\nconst someIntersect = (a: Value[], b: Value[]) => a.some(v => b.includes(v));\n\nexport function matchFilter(value: Value | Value[], filter: Filter) {\n\n  if (Array.isArray(value)) {\n    if (isInFilter(filter)) return someIntersect(value, filter.$in);\n  \n    // Equal\n    return value.includes(filter as Value);\n  \n  } else {\n    if (isInFilter(filter)) return filter.$in.includes(value);\n  \n    // Equal\n    return value === filter;\n  }\n}\n\nexport function matchFilters<T extends Record<string, any>>(item: T, filters: Filters): boolean {\n  return Object.entries(filters).every(([key, filter]) => {\n    return matchFilter(item.properties[key], filter)\n  });\n}","import { compact } from \"../utils/lodash\"\nimport { KioskFeaturePopulated, OccupantFeaturePopulated, UnitFeaturePopulated } from \"../types\";\n\nexport const getOccupantMainLocation = (occupant: OccupantFeaturePopulated): UnitFeaturePopulated | KioskFeaturePopulated => {\n  return occupant.properties.kiosk || occupant.properties.unit\n}\n\nexport const getOccupantCorrelatedLocations = (occupant: OccupantFeaturePopulated): Array<UnitFeaturePopulated | KioskFeaturePopulated> => {\n\n  const allCorrelatedLocations = [\n    ...occupant.properties.units,\n    ...occupant.properties.kiosks,\n  ]\n\n  return compact(allCorrelatedLocations)\n}\n\nexport type OccupantMarkerPlacementType = 'ONCE_PER_LEVEL' | 'ALL_LOCATIONS'\n\nexport const getOccupantMarkerLocations = (occupant: OccupantFeaturePopulated, options?: { type: OccupantMarkerPlacementType }): Array<UnitFeaturePopulated | KioskFeaturePopulated> => {\n\n  /**\n   * Use optiosn.type first\n   *   THEN occupant.show_name_on_all_units  \n   */\n  const placementType = options?.type ? options.type : occupant.properties.show_name_on_all_units ? 'ALL_LOCATIONS' : 'ONCE_PER_LEVEL'\n\n  const mainLocation = getOccupantMainLocation(occupant)\n\n  const mainLocationLevel = mainLocation?.properties?.level_id\n  const allCorrelatedLocations = getOccupantCorrelatedLocations(occupant)\n\n  // IF showNameonAllLocations = true, Show All \n  if (placementType === 'ALL_LOCATIONS') {\n    return compact([mainLocation, ...allCorrelatedLocations])\n  }\n  \n  // ELSE Show Once per level\n  const otherLevelLocations = allCorrelatedLocations.filter((f) => f.properties.level_id !== mainLocationLevel)\n  const onePerLevelLocations = [...new Map(otherLevelLocations.map(loc => [loc.properties.level_id, loc])).values()]\n  return compact([mainLocation, ...onePerLevelLocations])\n}\n","export const compact = <T extends unknown = unknown>(arr: T[]): T[] => arr.filter(item => Boolean(item));\n","import { safeFetchFeature } from \"./api/delivery-project\"\nimport { FeatureResponseMap, FeatureType, ImdfFeature } from \"./types/feature-api\"\nimport {\n  EnsureQueryDataOptions,\n  QueryClient,\n  QueryObserver,\n} from \"@tanstack/query-core\"\nimport {\n  FeatureQueryOptions,\n  FilterParams,\n  FindParams,\n  InternalFilterByType,\n  InternalFindById,\n  PopulatedParams,\n  SearchClient,\n  VenueClientOptions,\n  VenueDataClient,\n} from \"./types/VenueDataClient\"\nimport { createPopulator } from \"./populator\"\nimport { FeaturePopulatedResponseMap } from \"./types\"\nimport { matchFilters } from \"./utils/match-filters\"\nimport { FuseResult } from \"fuse.js\"\nimport { getSearchClient } from \"./search/getSearchClient\"\n\nexport const getDataClient = (options: VenueClientOptions): VenueDataClient => {\n  let searchClient: SearchClient;\n\n  const observers = new Map<\n    FeatureType,\n    { observer: QueryObserver<any, any>, unsubscribe: () => void }\n  >()\n\n  const queryClient = options.queryClient ?? new QueryClient()\n  const { mode = 'delivery', projectId, apiKey, baseUrl, previewToken } = options\n\n  if (!projectId)\n    throw new Error(\n      \"Cannot create VenueDataClient. Reason: `projectId` is missing\"\n    )\n    \n  if (mode === 'delivery' && !apiKey)\n    throw new Error(\n      \"Cannot create VenueDataClient. Reason: `apiKey` is missing\"\n    )\n\n  if (mode === 'preview' && !previewToken)\n    throw new Error(\n      \"Cannot create VenueDataClient. Reason: `previewToken` is missing\"\n    )\n\n  const createDeliveryApiQueryOptions = <T extends FeatureType = FeatureType>(\n    featureType: T\n  ) => ({\n    queryKey: [\"_deliveryapi\", featureType] as const,\n    queryFn: () => safeFetchFeature<T>(featureType, { mode, projectId, apiKey, previewToken, baseUrl }),\n  })\n\n  /**\n   * Internal Functions\n   * ***********************************/\n  const internalFilterByType: InternalFilterByType = async <T extends FeatureType = FeatureType>(\n    featureType: T\n  ) => {\n\n    try {\n      const features = await queryClient.ensureQueryData<\n        FeatureResponseMap[T][],\n        unknown,\n        FeatureResponseMap[T][]\n      >(createDeliveryApiQueryOptions(featureType))\n      return features\n    } catch (error) {\n      throw error\n    }\n  }\n\n  const internalFindById: InternalFindById = async <T extends FeatureType = FeatureType>(\n    id: string\n  ) => {\n    if (id === null || id === undefined) return null\n    const featureType = id.slice(0, id.lastIndexOf(\"-\")) as FeatureType\n    const feature = await queryClient.ensureQueryData<FeatureResponseMap[T]>({\n      queryKey: [\"_deliveryapi\", featureType, id],\n      queryFn: async () => {\n        const features = await internalFilterByType(featureType)\n        const feature = features.find(\n          (f) => f.id === id\n        ) as FeatureResponseMap[T]\n        return feature ?? null\n      },\n    })\n    return feature\n  }\n\n  // Create `Feature Populator` with internal functions\n  const populator = createPopulator({ internalFindById, internalFilterByType })\n\n  /**\n   * Public Functions\n   * ***********************************/\n  const registerObserver = (\n    featureType: FeatureType,\n    refetchInterval: number\n  ) => {\n    if (observers.has(featureType)) {\n      console.warn(`Observer for ${featureType} already exists`)\n      const record = observers.get(featureType)\n      return record.observer\n    }\n    const options = createDeliveryApiQueryOptions(featureType)\n    const observer = new QueryObserver(queryClient, {\n      ...options,\n      refetchInterval,\n    })\n    const unsubscribe = observer.subscribe(() => {\n      console.log(`[venue-js] Listening to ${featureType} changes (interval = ${refetchInterval}ms)`)\n      // TODO: add logs or what to do after subscribe\n    })\n    observers.set(featureType, { observer, unsubscribe })\n\n    return observer\n  }\n\n  const destroyObserver = (featureType: FeatureType) => {\n    const record = observers.get(featureType)\n    if (!record) return\n\n    record.unsubscribe()\n    observers.delete(featureType)\n  }\n\n  const destroyObservers = () => {\n    observers.forEach(({ observer, unsubscribe }) => {\n      unsubscribe()\n      observer.destroy()\n    })\n    observers.clear()\n  }\n\n  const createFilterByTypeQueryOptions = <T extends FeatureType = FeatureType>(\n    featureType: T,\n    params: FilterParams = {},\n    options: FeatureQueryOptions = {}\n  ): EnsureQueryDataOptions<FeatureResponseMap[T][] | FeaturePopulatedResponseMap[T][]> => ({\n    queryKey: [featureType, \"list\", params] as const,\n    queryFn: async () => {\n      const features = await internalFilterByType<T>(featureType)\n      \n      // Filter \n      const filters = params.filters ?? {}\n      let result = features\n      if (params.filters) {\n        result = features.filter(f => matchFilters(f, filters))\n      }\n\n      // Populate\n      return params.populate === true\n        ? await Promise.all(result.map((f) => populator[featureType](f)))\n        : result\n    },\n    ...(options ?? {}),\n  })\n\n  const createFindByIdQueryOptions = <T extends FeatureType = FeatureType>(\n    featureType: T,\n    id: string,\n    params: FindParams = {},\n    options: FeatureQueryOptions = {}\n  ): EnsureQueryDataOptions<FeatureResponseMap[T] | FeaturePopulatedResponseMap[T]> => ({\n    queryKey: [featureType, \"detail\", id, params] as const,\n    queryFn: async () => {\n      const feature = await internalFindById<T>(id)\n      return params.populate === true\n        ? await populator[featureType](feature)\n        : Promise.resolve(feature)\n    },\n    ...(options ?? {}),\n  })\n\n  async function filterByType<T extends FeatureType>(featureType: T, params: FilterParams & PopulatedParams): Promise<FeaturePopulatedResponseMap[T][]>\n  async function filterByType<T extends FeatureType>(featureType: T, params?: FilterParams): Promise<FeatureResponseMap[T][]>\n  async function filterByType<T extends FeatureType>(featureType: T, params?: FilterParams) {\n    const filterQueryOptions = createFilterByTypeQueryOptions<T>(\n      featureType,\n      params\n    )\n    const features = await queryClient.ensureQueryData(filterQueryOptions)\n    return (params?.populate === true) ? features as FeaturePopulatedResponseMap[T][] : features as FeatureResponseMap[T][]\n  }\n\n  async function findById<T extends FeatureType>(featureType: T, id: string, params: FindParams & PopulatedParams): Promise<FeaturePopulatedResponseMap[T]>\n  async function findById<T extends FeatureType>(featureType: T, id: string, params?: FindParams): Promise<FeatureResponseMap[T]>\n  async function findById<T extends FeatureType>( featureType: T, id: string, params?: FindParams) {\n    const findQueryOptions = createFindByIdQueryOptions<T>(\n      featureType,\n      id,\n      params\n    )\n    const feature = await queryClient.ensureQueryData(findQueryOptions)\n    return feature\n  }\n\n  const searchFn = async (txt: string): Promise<FuseResult<ImdfFeature>[]> => {\n    if (!searchClient) {\n      const [occupants, amenities] = await Promise.all([\n        filterByType(\"occupant\"),\n        filterByType(\"amenity\")\n      ])\n      const haystack = { occupants, amenities }\n      searchClient = getSearchClient(haystack)\n    }\n    return searchClient.search(txt)\n  }\n\n  return {\n    projectId,\n    queryClient,\n    registerObserver,\n    destroyObserver,\n    destroyObservers,\n    createFilterByTypeQueryOptions,\n    createFindByIdQueryOptions,\n    _internalFindById: internalFindById,\n    filterByType,\n    findById,\n    search: searchFn,\n  }\n}\n","import {\n  FeatureResponseMap,\n  FeaturePopulatedResponseMap,\n  InternalFindById,\n  InternalFilterByType,\n  SectionFeature,\n} from \"../types\"\nimport { compact } from '../utils/lodash'\n\nimport { booleanWithin } from \"@turf/boolean-within\"\n\ntype CreatePopulatorOptions = {\n  internalFindById: InternalFindById\n  internalFilterByType: InternalFilterByType\n}\n\ntype PopulatableFeatureType = Extract<\n  keyof FeatureResponseMap,\n  keyof FeaturePopulatedResponseMap\n>\ntype PopulatorFn<T extends PopulatableFeatureType> = (\n  f: FeatureResponseMap[T]\n) => Promise<FeaturePopulatedResponseMap[T]>\n\nexport type Populator = {\n  [K in PopulatableFeatureType]?: PopulatorFn<K>\n}\n\nexport const createPopulator = ({\n  internalFindById,\n  internalFilterByType,\n}: CreatePopulatorOptions): Populator => {\n  const populateAddress: PopulatorFn<\"address\"> = (address) =>\n    Promise.resolve(address)\n  const populateBuilding: PopulatorFn<\"building\"> = (building) =>\n    Promise.resolve(building)\n  const populateDetail: PopulatorFn<\"detail\"> = (detail) =>\n    Promise.resolve(detail)\n  const populateFootprint: PopulatorFn<\"footprint\"> = (footprint) =>\n    Promise.resolve(footprint)\n  const populateGeofence: PopulatorFn<\"geofence\"> = (geofence) =>\n    Promise.resolve(geofence)\n  const populateRelationship: PopulatorFn<\"relationship\"> = (relationship) =>\n    Promise.resolve(relationship)\n  const populatePrivilege: PopulatorFn<\"privilege\"> = (privilege) =>\n    Promise.resolve(privilege)\n  const populateEvent: PopulatorFn<\"event\"> = (event) => Promise.resolve(event)\n\n  const populatePromotion: PopulatorFn<\"promotion\"> = async (promotion) => {\n    const venue = await internalFindById<\"venue\">(promotion.properties.venue_id)\n    return {\n      ...promotion,\n      properties: {\n        ...promotion.properties,\n        venue,\n      },\n    }\n  }\n\n  const populateAmenity: PopulatorFn<\"amenity\"> = async (amenity) => {\n    const units = await Promise.all(\n      amenity.properties.unit_ids.map(internalFindById<\"unit\">)\n    )\n\n    const populatedUnits = await Promise.all(units.map(populateUnit))\n\n    const venue = await internalFindById<\"venue\">(amenity.properties.venue_id)\n\n    const defaultLevel = populatedUnits[0].properties.level\n\n    const kiosks = await internalFilterByType<\"kiosk\">(\"kiosk\")\n    const ordinalKiosks = kiosks.filter(\n      (kiosk) => kiosk.properties.level_id === defaultLevel.id\n    )\n    const kiosk = ordinalKiosks.find((kiosk) => booleanWithin(amenity, kiosk))\n    return {\n      ...amenity,\n      properties: {\n        ...amenity.properties,\n        ordinal: defaultLevel.properties.ordinal,\n        level_name: defaultLevel.properties.name.en,\n        level: defaultLevel,\n        units: populatedUnits,\n        venue,\n        _experimental_kiosk: kiosk ? await populateKiosk(kiosk) : null,\n      },\n    }\n  }\n\n  const populateAnchor: PopulatorFn<\"anchor\"> = async (anchor) => {\n    const unit = await internalFindById<\"unit\">(anchor.properties.unit_id)\n    const venue = await internalFindById<\"venue\">(unit.properties.venue_id)\n    const level = await internalFindById<\"level\">(unit.properties.level_id)\n\n    const sections = await internalFilterByType<\"section\">(\"section\")\n    const section = sections.find((section) => booleanWithin(anchor, section))\n\n    return {\n      ...anchor,\n      properties: {\n        ...anchor.properties,\n        level: await populateLevel(level),\n        unit: await populateUnit(unit),\n        section: section ? await populateSection(section) : null,\n        venue: await populateVenue(venue),\n        ordinal: level.properties.ordinal,\n      },\n    }\n  }\n\n  const populateFixture: PopulatorFn<\"fixture\"> = async (fixture) => {\n    const level = await internalFindById<\"level\">(fixture.properties.level_id)\n    const venue = await internalFindById<\"venue\">(fixture.properties.venue_id)\n    const anchor = await internalFindById<\"anchor\">(fixture.properties.anchor_id)\n\n    return {\n      ...fixture,\n      properties: {\n        ...fixture.properties,\n        anchor: anchor ? await populateAnchor(anchor) : null,\n        level: await populateLevel(level),\n        venue: await populateVenue(venue),\n        ordinal: level.properties.ordinal,\n      }\n    }\n  }\n\n  const populateKiosk: PopulatorFn<\"kiosk\"> = async (kiosk) => {\n    const level = await internalFindById<\"level\">(kiosk.properties.level_id)\n    const venue = await internalFindById<\"venue\">(kiosk.properties.venue_id)\n    const anchor = await internalFindById<\"anchor\">(kiosk.properties.anchor_id)\n\n    // Find Kiosk's Unit\n    const units = await internalFilterByType<\"unit\">(\"unit\")\n    const unit = units.find(\n      (unit) => {\n        try {\n          return unit.properties.category === \"walkway\"\n            && unit.properties.level_id === kiosk.properties.level_id\n            && booleanWithin(kiosk, unit)\n        } catch (e) {\n          console.log(`Cannot find kiosk(${kiosk.id})'s units:`, e.message)\n          return false\n        }\n      }\n    )\n\n    let section: SectionFeature | null = null\n\n    if (anchor) {\n      const sections = await internalFilterByType<\"section\">(\"section\")\n      section = sections.find((section) => booleanWithin(anchor, section))\n    }\n\n    return {\n      ...kiosk,\n      properties: {\n        ...kiosk.properties,\n        anchor: anchor ? await populateAnchor(anchor) : null,\n        level: await populateLevel(level),\n        venue: await populateVenue(venue),\n        ordinal: level.properties.ordinal,\n\n        unit: unit ? await populateUnit(unit) : null,\n        section: section ? await populateSection(section) : null,\n      },\n    }\n  }\n\n  const populateLevel: PopulatorFn<\"level\"> = async (level) => {\n    const venue = await internalFindById<\"venue\">(level.properties.venue_id)\n    return {\n      ...level,\n      properties: {\n        ...level.properties,\n        venue,\n      },\n    }\n  }\n\n  const populateOccupant: PopulatorFn<\"occupant\"> = async (occupant) => {\n    const {\n      anchor_id,\n      venue_id,\n      local_category_ids,\n      promotion_ids = [],\n      privilege_ids = [],\n      kiosk_id,\n      unit_id,\n      kiosk_ids = [],\n      unit_ids = [],\n    } = occupant.properties\n    const anchor = await internalFindById<\"anchor\">(anchor_id)\n    const venue = await internalFindById<\"venue\">(venue_id)\n\n    const localCategories = await Promise.all(\n      local_category_ids.map(internalFindById<\"taxonomy\">)\n    )\n    const promotions = await Promise.all(\n      promotion_ids.map(internalFindById<\"promotion\">)\n    )\n    const privileges = await Promise.all(\n      privilege_ids.map(internalFindById<\"privilege\">)\n    )\n    const kiosk = await internalFindById<\"kiosk\">(kiosk_id)\n    const unit = await internalFindById<\"unit\">(unit_id)\n\n    const kiosks = await Promise.all(kiosk_ids.map(internalFindById<\"kiosk\">))\n    const units = await Promise.all(unit_ids.map(internalFindById<\"unit\">))\n    return {\n      ...occupant,\n      properties: {\n        ...occupant.properties,\n        anchor: anchor ? await populateAnchor(anchor) : null,\n        local_categories: await Promise.all(\n          compact(localCategories).map(populateTaxonomy)\n        ),\n        venue,\n        promotions,\n        privileges,\n\n        kiosk: kiosk ? await populateKiosk(kiosk) : null,\n        unit: unit ? await populateUnit(unit) : null,\n        kiosks: await Promise.all(kiosks.map(populateKiosk)),\n        units: await Promise.all(units.map(populateUnit)),\n      },\n    }\n  }\n\n  const populateOpening: PopulatorFn<\"opening\"> = async (opening) => {\n    const venue = await internalFindById<\"venue\">(opening.properties.venue_id)\n    const level = await internalFindById<\"level\">(opening.properties.level_id)\n    return {\n      ...opening,\n      properties: {\n        venue,\n        level: await populateLevel(level),\n        ordinal: level.properties.ordinal,\n      }\n    }\n  }\n\n  const populateSection: PopulatorFn<\"section\"> = async (section) => {\n    const venue = await internalFindById<\"venue\">(section.properties.venue_id)\n    const level = await internalFindById<\"level\">(section.properties.level_id)\n    return {\n      ...section,\n      properties: {\n        ...section.properties,\n        venue,\n        level: await populateLevel(level),\n        ordinal: level.properties.ordinal,\n      },\n    }\n  }\n\n  const populateUnit: PopulatorFn<\"unit\"> = async (unit) => {\n    const venue = await internalFindById<\"venue\">(unit.properties.venue_id)\n    const level = await internalFindById<\"level\">(unit.properties.level_id)\n\n    const sections = await internalFilterByType<\"section\">(\"section\")\n    try {\n      const section = unit.geometry.type !== 'MultiPolygon' ? sections.find((section) => booleanWithin(unit, section)) : null\n      return {\n        ...unit,\n        properties: {\n          ...unit.properties,\n          venue,\n          ordinal: level.properties.ordinal,\n          level: await populateLevel(level),\n          section: section ? await populateSection(section) : null,\n        },\n      }\n    } catch (err) {\n      console.log(`error finding section `, { unit, sections })\n    }\n  }\n\n  const populateVenue: PopulatorFn<\"venue\"> = (venue) => {\n    return Promise.resolve(venue)\n  }\n\n  const populateTaxonomy: PopulatorFn<\"taxonomy\"> = async (taxonomy) => {\n    const venue = await internalFindById<\"venue\">(taxonomy.properties.venue_id)\n    return {\n      ...taxonomy,\n      properties: {\n        ...taxonomy.properties,\n        venue: venue ? await populateVenue(venue) : null,\n      },\n    }\n  }\n\n  const populateModel3D: PopulatorFn<\"model3d\"> = async (model3d) => {\n    const level = await internalFindById<\"level\">(model3d.properties.level_id)\n    try {\n      return {\n        ...model3d,\n        properties: {\n          ...model3d.properties,\n          level: await populateLevel(level),\n        },\n      }\n    } catch (err) {\n      console.log(`error finding level`, { model3d, level })\n    }\n  }\n\n  const populateFeature = (feature) => Promise.resolve(feature)\n\n  return {\n    address: populateAddress,\n    building: populateBuilding,\n    detail: populateDetail,\n    fixture: populateFixture,\n    footprint: populateFootprint,\n    geofence: populateGeofence,\n    opening: populateOpening,\n    relationship: populateRelationship,\n    privilege: populatePrivilege,\n    promotion: populatePromotion,\n    event: populateEvent,\n    label: populateFeature,\n    element: populateFeature,\n    page: populateFeature,\n\n    amenity: populateAmenity,\n    anchor: populateAnchor,\n    kiosk: populateKiosk,\n    level: populateLevel,\n    occupant: populateOccupant,\n    section: populateSection,\n    unit: populateUnit,\n    venue: populateVenue,\n    taxonomy: populateTaxonomy,\n\n    model3d: populateModel3D,\n  }\n}\n","/**\n * Fuse.js v7.1.0 - Lightweight fuzzy-search (http://fusejs.io)\n *\n * Copyright (c) 2025 Kiro Risk (http://kiro.me)\n * All Rights Reserved. Apache Software License 2.0\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n */\n\nfunction isArray(value) {\n  return !Array.isArray\n    ? getTag(value) === '[object Array]'\n    : Array.isArray(value)\n}\n\n// Adapted from: https://github.com/lodash/lodash/blob/master/.internal/baseToString.js\nconst INFINITY = 1 / 0;\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value\n  }\n  let result = value + '';\n  return result == '0' && 1 / value == -INFINITY ? '-0' : result\n}\n\nfunction toString(value) {\n  return value == null ? '' : baseToString(value)\n}\n\nfunction isString(value) {\n  return typeof value === 'string'\n}\n\nfunction isNumber(value) {\n  return typeof value === 'number'\n}\n\n// Adapted from: https://github.com/lodash/lodash/blob/master/isBoolean.js\nfunction isBoolean(value) {\n  return (\n    value === true ||\n    value === false ||\n    (isObjectLike(value) && getTag(value) == '[object Boolean]')\n  )\n}\n\nfunction isObject(value) {\n  return typeof value === 'object'\n}\n\n// Checks if `value` is object-like.\nfunction isObjectLike(value) {\n  return isObject(value) && value !== null\n}\n\nfunction isDefined(value) {\n  return value !== undefined && value !== null\n}\n\nfunction isBlank(value) {\n  return !value.trim().length\n}\n\n// Gets the `toStringTag` of `value`.\n// Adapted from: https://github.com/lodash/lodash/blob/master/.internal/getTag.js\nfunction getTag(value) {\n  return value == null\n    ? value === undefined\n      ? '[object Undefined]'\n      : '[object Null]'\n    : Object.prototype.toString.call(value)\n}\n\nconst EXTENDED_SEARCH_UNAVAILABLE = 'Extended search is not available';\n\nconst INCORRECT_INDEX_TYPE = \"Incorrect 'index' type\";\n\nconst LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY = (key) =>\n  `Invalid value for key ${key}`;\n\nconst PATTERN_LENGTH_TOO_LARGE = (max) =>\n  `Pattern length exceeds max of ${max}.`;\n\nconst MISSING_KEY_PROPERTY = (name) => `Missing ${name} property in key`;\n\nconst INVALID_KEY_WEIGHT_VALUE = (key) =>\n  `Property 'weight' in key '${key}' must be a positive integer`;\n\nconst hasOwn = Object.prototype.hasOwnProperty;\n\nclass KeyStore {\n  constructor(keys) {\n    this._keys = [];\n    this._keyMap = {};\n\n    let totalWeight = 0;\n\n    keys.forEach((key) => {\n      let obj = createKey(key);\n\n      this._keys.push(obj);\n      this._keyMap[obj.id] = obj;\n\n      totalWeight += obj.weight;\n    });\n\n    // Normalize weights so that their sum is equal to 1\n    this._keys.forEach((key) => {\n      key.weight /= totalWeight;\n    });\n  }\n  get(keyId) {\n    return this._keyMap[keyId]\n  }\n  keys() {\n    return this._keys\n  }\n  toJSON() {\n    return JSON.stringify(this._keys)\n  }\n}\n\nfunction createKey(key) {\n  let path = null;\n  let id = null;\n  let src = null;\n  let weight = 1;\n  let getFn = null;\n\n  if (isString(key) || isArray(key)) {\n    src = key;\n    path = createKeyPath(key);\n    id = createKeyId(key);\n  } else {\n    if (!hasOwn.call(key, 'name')) {\n      throw new Error(MISSING_KEY_PROPERTY('name'))\n    }\n\n    const name = key.name;\n    src = name;\n\n    if (hasOwn.call(key, 'weight')) {\n      weight = key.weight;\n\n      if (weight <= 0) {\n        throw new Error(INVALID_KEY_WEIGHT_VALUE(name))\n      }\n    }\n\n    path = createKeyPath(name);\n    id = createKeyId(name);\n    getFn = key.getFn;\n  }\n\n  return { path, id, weight, src, getFn }\n}\n\nfunction createKeyPath(key) {\n  return isArray(key) ? key : key.split('.')\n}\n\nfunction createKeyId(key) {\n  return isArray(key) ? key.join('.') : key\n}\n\nfunction get(obj, path) {\n  let list = [];\n  let arr = false;\n\n  const deepGet = (obj, path, index) => {\n    if (!isDefined(obj)) {\n      return\n    }\n    if (!path[index]) {\n      // If there's no path left, we've arrived at the object we care about.\n      list.push(obj);\n    } else {\n      let key = path[index];\n\n      const value = obj[key];\n\n      if (!isDefined(value)) {\n        return\n      }\n\n      // If we're at the last value in the path, and if it's a string/number/bool,\n      // add it to the list\n      if (\n        index === path.length - 1 &&\n        (isString(value) || isNumber(value) || isBoolean(value))\n      ) {\n        list.push(toString(value));\n      } else if (isArray(value)) {\n        arr = true;\n        // Search each item in the array.\n        for (let i = 0, len = value.length; i < len; i += 1) {\n          deepGet(value[i], path, index + 1);\n        }\n      } else if (path.length) {\n        // An object. Recurse further.\n        deepGet(value, path, index + 1);\n      }\n    }\n  };\n\n  // Backwards compatibility (since path used to be a string)\n  deepGet(obj, isString(path) ? path.split('.') : path, 0);\n\n  return arr ? list : list[0]\n}\n\nconst MatchOptions = {\n  // Whether the matches should be included in the result set. When `true`, each record in the result\n  // set will include the indices of the matched characters.\n  // These can consequently be used for highlighting purposes.\n  includeMatches: false,\n  // When `true`, the matching function will continue to the end of a search pattern even if\n  // a perfect match has already been located in the string.\n  findAllMatches: false,\n  // Minimum number of characters that must be matched before a result is considered a match\n  minMatchCharLength: 1\n};\n\nconst BasicOptions = {\n  // When `true`, the algorithm continues searching to the end of the input even if a perfect\n  // match is found before the end of the same input.\n  isCaseSensitive: false,\n  // When `true`, the algorithm will ignore diacritics (accents) in comparisons\n  ignoreDiacritics: false,\n  // When true, the matching function will continue to the end of a search pattern even if\n  includeScore: false,\n  // List of properties that will be searched. This also supports nested properties.\n  keys: [],\n  // Whether to sort the result list, by score\n  shouldSort: true,\n  // Default sort function: sort by ascending score, ascending index\n  sortFn: (a, b) =>\n    a.score === b.score ? (a.idx < b.idx ? -1 : 1) : a.score < b.score ? -1 : 1\n};\n\nconst FuzzyOptions = {\n  // Approximately where in the text is the pattern expected to be found?\n  location: 0,\n  // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match\n  // (of both letters and location), a threshold of '1.0' would match anything.\n  threshold: 0.6,\n  // Determines how close the match must be to the fuzzy location (specified above).\n  // An exact letter match which is 'distance' characters away from the fuzzy location\n  // would score as a complete mismatch. A distance of '0' requires the match be at\n  // the exact location specified, a threshold of '1000' would require a perfect match\n  // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.\n  distance: 100\n};\n\nconst AdvancedOptions = {\n  // When `true`, it enables the use of unix-like search commands\n  useExtendedSearch: false,\n  // The get function to use when fetching an object's properties.\n  // The default will search nested paths *ie foo.bar.baz*\n  getFn: get,\n  // When `true`, search will ignore `location` and `distance`, so it won't matter\n  // where in the string the pattern appears.\n  // More info: https://fusejs.io/concepts/scoring-theory.html#fuzziness-score\n  ignoreLocation: false,\n  // When `true`, the calculation for the relevance score (used for sorting) will\n  // ignore the field-length norm.\n  // More info: https://fusejs.io/concepts/scoring-theory.html#field-length-norm\n  ignoreFieldNorm: false,\n  // The weight to determine how much field length norm effects scoring.\n  fieldNormWeight: 1\n};\n\nvar Config = {\n  ...BasicOptions,\n  ...MatchOptions,\n  ...FuzzyOptions,\n  ...AdvancedOptions\n};\n\nconst SPACE = /[^ ]+/g;\n\n// Field-length norm: the shorter the field, the higher the weight.\n// Set to 3 decimals to reduce index size.\nfunction norm(weight = 1, mantissa = 3) {\n  const cache = new Map();\n  const m = Math.pow(10, mantissa);\n\n  return {\n    get(value) {\n      const numTokens = value.match(SPACE).length;\n\n      if (cache.has(numTokens)) {\n        return cache.get(numTokens)\n      }\n\n      // Default function is 1/sqrt(x), weight makes that variable\n      const norm = 1 / Math.pow(numTokens, 0.5 * weight);\n\n      // In place of `toFixed(mantissa)`, for faster computation\n      const n = parseFloat(Math.round(norm * m) / m);\n\n      cache.set(numTokens, n);\n\n      return n\n    },\n    clear() {\n      cache.clear();\n    }\n  }\n}\n\nclass FuseIndex {\n  constructor({\n    getFn = Config.getFn,\n    fieldNormWeight = Config.fieldNormWeight\n  } = {}) {\n    this.norm = norm(fieldNormWeight, 3);\n    this.getFn = getFn;\n    this.isCreated = false;\n\n    this.setIndexRecords();\n  }\n  setSources(docs = []) {\n    this.docs = docs;\n  }\n  setIndexRecords(records = []) {\n    this.records = records;\n  }\n  setKeys(keys = []) {\n    this.keys = keys;\n    this._keysMap = {};\n    keys.forEach((key, idx) => {\n      this._keysMap[key.id] = idx;\n    });\n  }\n  create() {\n    if (this.isCreated || !this.docs.length) {\n      return\n    }\n\n    this.isCreated = true;\n\n    // List is Array<String>\n    if (isString(this.docs[0])) {\n      this.docs.forEach((doc, docIndex) => {\n        this._addString(doc, docIndex);\n      });\n    } else {\n      // List is Array<Object>\n      this.docs.forEach((doc, docIndex) => {\n        this._addObject(doc, docIndex);\n      });\n    }\n\n    this.norm.clear();\n  }\n  // Adds a doc to the end of the index\n  add(doc) {\n    const idx = this.size();\n\n    if (isString(doc)) {\n      this._addString(doc, idx);\n    } else {\n      this._addObject(doc, idx);\n    }\n  }\n  // Removes the doc at the specified index of the index\n  removeAt(idx) {\n    this.records.splice(idx, 1);\n\n    // Change ref index of every subsquent doc\n    for (let i = idx, len = this.size(); i < len; i += 1) {\n      this.records[i].i -= 1;\n    }\n  }\n  getValueForItemAtKeyId(item, keyId) {\n    return item[this._keysMap[keyId]]\n  }\n  size() {\n    return this.records.length\n  }\n  _addString(doc, docIndex) {\n    if (!isDefined(doc) || isBlank(doc)) {\n      return\n    }\n\n    let record = {\n      v: doc,\n      i: docIndex,\n      n: this.norm.get(doc)\n    };\n\n    this.records.push(record);\n  }\n  _addObject(doc, docIndex) {\n    let record = { i: docIndex, $: {} };\n\n    // Iterate over every key (i.e, path), and fetch the value at that key\n    this.keys.forEach((key, keyIndex) => {\n      let value = key.getFn ? key.getFn(doc) : this.getFn(doc, key.path);\n\n      if (!isDefined(value)) {\n        return\n      }\n\n      if (isArray(value)) {\n        let subRecords = [];\n        const stack = [{ nestedArrIndex: -1, value }];\n\n        while (stack.length) {\n          const { nestedArrIndex, value } = stack.pop();\n\n          if (!isDefined(value)) {\n            continue\n          }\n\n          if (isString(value) && !isBlank(value)) {\n            let subRecord = {\n              v: value,\n              i: nestedArrIndex,\n              n: this.norm.get(value)\n            };\n\n            subRecords.push(subRecord);\n          } else if (isArray(value)) {\n            value.forEach((item, k) => {\n              stack.push({\n                nestedArrIndex: k,\n                value: item\n              });\n            });\n          } else ;\n        }\n        record.$[keyIndex] = subRecords;\n      } else if (isString(value) && !isBlank(value)) {\n        let subRecord = {\n          v: value,\n          n: this.norm.get(value)\n        };\n\n        record.$[keyIndex] = subRecord;\n      }\n    });\n\n    this.records.push(record);\n  }\n  toJSON() {\n    return {\n      keys: this.keys,\n      records: this.records\n    }\n  }\n}\n\nfunction createIndex(\n  keys,\n  docs,\n  { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}\n) {\n  const myIndex = new FuseIndex({ getFn, fieldNormWeight });\n  myIndex.setKeys(keys.map(createKey));\n  myIndex.setSources(docs);\n  myIndex.create();\n  return myIndex\n}\n\nfunction parseIndex(\n  data,\n  { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}\n) {\n  const { keys, records } = data;\n  const myIndex = new FuseIndex({ getFn, fieldNormWeight });\n  myIndex.setKeys(keys);\n  myIndex.setIndexRecords(records);\n  return myIndex\n}\n\nfunction computeScore$1(\n  pattern,\n  {\n    errors = 0,\n    currentLocation = 0,\n    expectedLocation = 0,\n    distance = Config.distance,\n    ignoreLocation = Config.ignoreLocation\n  } = {}\n) {\n  const accuracy = errors / pattern.length;\n\n  if (ignoreLocation) {\n    return accuracy\n  }\n\n  const proximity = Math.abs(expectedLocation - currentLocation);\n\n  if (!distance) {\n    // Dodge divide by zero error.\n    return proximity ? 1.0 : accuracy\n  }\n\n  return accuracy + proximity / distance\n}\n\nfunction convertMaskToIndices(\n  matchmask = [],\n  minMatchCharLength = Config.minMatchCharLength\n) {\n  let indices = [];\n  let start = -1;\n  let end = -1;\n  let i = 0;\n\n  for (let len = matchmask.length; i < len; i += 1) {\n    let match = matchmask[i];\n    if (match && start === -1) {\n      start = i;\n    } else if (!match && start !== -1) {\n      end = i - 1;\n      if (end - start + 1 >= minMatchCharLength) {\n        indices.push([start, end]);\n      }\n      start = -1;\n    }\n  }\n\n  // (i-1 - start) + 1 => i - start\n  if (matchmask[i - 1] && i - start >= minMatchCharLength) {\n    indices.push([start, i - 1]);\n  }\n\n  return indices\n}\n\n// Machine word size\nconst MAX_BITS = 32;\n\nfunction search(\n  text,\n  pattern,\n  patternAlphabet,\n  {\n    location = Config.location,\n    distance = Config.distance,\n    threshold = Config.threshold,\n    findAllMatches = Config.findAllMatches,\n    minMatchCharLength = Config.minMatchCharLength,\n    includeMatches = Config.includeMatches,\n    ignoreLocation = Config.ignoreLocation\n  } = {}\n) {\n  if (pattern.length > MAX_BITS) {\n    throw new Error(PATTERN_LENGTH_TOO_LARGE(MAX_BITS))\n  }\n\n  const patternLen = pattern.length;\n  // Set starting location at beginning text and initialize the alphabet.\n  const textLen = text.length;\n  // Handle the case when location > text.length\n  const expectedLocation = Math.max(0, Math.min(location, textLen));\n  // Highest score beyond which we give up.\n  let currentThreshold = threshold;\n  // Is there a nearby exact match? (speedup)\n  let bestLocation = expectedLocation;\n\n  // Performance: only computer matches when the minMatchCharLength > 1\n  // OR if `includeMatches` is true.\n  const computeMatches = minMatchCharLength > 1 || includeMatches;\n  // A mask of the matches, used for building the indices\n  const matchMask = computeMatches ? Array(textLen) : [];\n\n  let index;\n\n  // Get all exact matches, here for speed up\n  while ((index = text.indexOf(pattern, bestLocation)) > -1) {\n    let score = computeScore$1(pattern, {\n      currentLocation: index,\n      expectedLocation,\n      distance,\n      ignoreLocation\n    });\n\n    currentThreshold = Math.min(score, currentThreshold);\n    bestLocation = index + patternLen;\n\n    if (computeMatches) {\n      let i = 0;\n      while (i < patternLen) {\n        matchMask[index + i] = 1;\n        i += 1;\n      }\n    }\n  }\n\n  // Reset the best location\n  bestLocation = -1;\n\n  let lastBitArr = [];\n  let finalScore = 1;\n  let binMax = patternLen + textLen;\n\n  const mask = 1 << (patternLen - 1);\n\n  for (let i = 0; i < patternLen; i += 1) {\n    // Scan for the best match; each iteration allows for one more error.\n    // Run a binary search to determine how far from the match location we can stray\n    // at this error level.\n    let binMin = 0;\n    let binMid = binMax;\n\n    while (binMin < binMid) {\n      const score = computeScore$1(pattern, {\n        errors: i,\n        currentLocation: expectedLocation + binMid,\n        expectedLocation,\n        distance,\n        ignoreLocation\n      });\n\n      if (score <= currentThreshold) {\n        binMin = binMid;\n      } else {\n        binMax = binMid;\n      }\n\n      binMid = Math.floor((binMax - binMin) / 2 + binMin);\n    }\n\n    // Use the result from this iteration as the maximum for the next.\n    binMax = binMid;\n\n    let start = Math.max(1, expectedLocation - binMid + 1);\n    let finish = findAllMatches\n      ? textLen\n      : Math.min(expectedLocation + binMid, textLen) + patternLen;\n\n    // Initialize the bit array\n    let bitArr = Array(finish + 2);\n\n    bitArr[finish + 1] = (1 << i) - 1;\n\n    for (let j = finish; j >= start; j -= 1) {\n      let currentLocation = j - 1;\n      let charMatch = patternAlphabet[text.charAt(currentLocation)];\n\n      if (computeMatches) {\n        // Speed up: quick bool to int conversion (i.e, `charMatch ? 1 : 0`)\n        matchMask[currentLocation] = +!!charMatch;\n      }\n\n      // First pass: exact match\n      bitArr[j] = ((bitArr[j + 1] << 1) | 1) & charMatch;\n\n      // Subsequent passes: fuzzy match\n      if (i) {\n        bitArr[j] |=\n          ((lastBitArr[j + 1] | lastBitArr[j]) << 1) | 1 | lastBitArr[j + 1];\n      }\n\n      if (bitArr[j] & mask) {\n        finalScore = computeScore$1(pattern, {\n          errors: i,\n          currentLocation,\n          expectedLocation,\n          distance,\n          ignoreLocation\n        });\n\n        // This match will almost certainly be better than any existing match.\n        // But check anyway.\n        if (finalScore <= currentThreshold) {\n          // Indeed it is\n          currentThreshold = finalScore;\n          bestLocation = currentLocation;\n\n          // Already passed `loc`, downhill from here on in.\n          if (bestLocation <= expectedLocation) {\n            break\n          }\n\n          // When passing `bestLocation`, don't exceed our current distance from `expectedLocation`.\n          start = Math.max(1, 2 * expectedLocation - bestLocation);\n        }\n      }\n    }\n\n    // No hope for a (better) match at greater error levels.\n    const score = computeScore$1(pattern, {\n      errors: i + 1,\n      currentLocation: expectedLocation,\n      expectedLocation,\n      distance,\n      ignoreLocation\n    });\n\n    if (score > currentThreshold) {\n      break\n    }\n\n    lastBitArr = bitArr;\n  }\n\n  const result = {\n    isMatch: bestLocation >= 0,\n    // Count exact matches (those with a score of 0) to be \"almost\" exact\n    score: Math.max(0.001, finalScore)\n  };\n\n  if (computeMatches) {\n    const indices = convertMaskToIndices(matchMask, minMatchCharLength);\n    if (!indices.length) {\n      result.isMatch = false;\n    } else if (includeMatches) {\n      result.indices = indices;\n    }\n  }\n\n  return result\n}\n\nfunction createPatternAlphabet(pattern) {\n  let mask = {};\n\n  for (let i = 0, len = pattern.length; i < len; i += 1) {\n    const char = pattern.charAt(i);\n    mask[char] = (mask[char] || 0) | (1 << (len - i - 1));\n  }\n\n  return mask\n}\n\nconst stripDiacritics = String.prototype.normalize\n    ? ((str) => str.normalize('NFD').replace(/[\\u0300-\\u036F\\u0483-\\u0489\\u0591-\\u05BD\\u05BF\\u05C1\\u05C2\\u05C4\\u05C5\\u05C7\\u0610-\\u061A\\u064B-\\u065F\\u0670\\u06D6-\\u06DC\\u06DF-\\u06E4\\u06E7\\u06E8\\u06EA-\\u06ED\\u0711\\u0730-\\u074A\\u07A6-\\u07B0\\u07EB-\\u07F3\\u07FD\\u0816-\\u0819\\u081B-\\u0823\\u0825-\\u0827\\u0829-\\u082D\\u0859-\\u085B\\u08D3-\\u08E1\\u08E3-\\u0903\\u093A-\\u093C\\u093E-\\u094F\\u0951-\\u0957\\u0962\\u0963\\u0981-\\u0983\\u09BC\\u09BE-\\u09C4\\u09C7\\u09C8\\u09CB-\\u09CD\\u09D7\\u09E2\\u09E3\\u09FE\\u0A01-\\u0A03\\u0A3C\\u0A3E-\\u0A42\\u0A47\\u0A48\\u0A4B-\\u0A4D\\u0A51\\u0A70\\u0A71\\u0A75\\u0A81-\\u0A83\\u0ABC\\u0ABE-\\u0AC5\\u0AC7-\\u0AC9\\u0ACB-\\u0ACD\\u0AE2\\u0AE3\\u0AFA-\\u0AFF\\u0B01-\\u0B03\\u0B3C\\u0B3E-\\u0B44\\u0B47\\u0B48\\u0B4B-\\u0B4D\\u0B56\\u0B57\\u0B62\\u0B63\\u0B82\\u0BBE-\\u0BC2\\u0BC6-\\u0BC8\\u0BCA-\\u0BCD\\u0BD7\\u0C00-\\u0C04\\u0C3E-\\u0C44\\u0C46-\\u0C48\\u0C4A-\\u0C4D\\u0C55\\u0C56\\u0C62\\u0C63\\u0C81-\\u0C83\\u0CBC\\u0CBE-\\u0CC4\\u0CC6-\\u0CC8\\u0CCA-\\u0CCD\\u0CD5\\u0CD6\\u0CE2\\u0CE3\\u0D00-\\u0D03\\u0D3B\\u0D3C\\u0D3E-\\u0D44\\u0D46-\\u0D48\\u0D4A-\\u0D4D\\u0D57\\u0D62\\u0D63\\u0D82\\u0D83\\u0DCA\\u0DCF-\\u0DD4\\u0DD6\\u0DD8-\\u0DDF\\u0DF2\\u0DF3\\u0E31\\u0E34-\\u0E3A\\u0E47-\\u0E4E\\u0EB1\\u0EB4-\\u0EB9\\u0EBB\\u0EBC\\u0EC8-\\u0ECD\\u0F18\\u0F19\\u0F35\\u0F37\\u0F39\\u0F3E\\u0F3F\\u0F71-\\u0F84\\u0F86\\u0F87\\u0F8D-\\u0F97\\u0F99-\\u0FBC\\u0FC6\\u102B-\\u103E\\u1056-\\u1059\\u105E-\\u1060\\u1062-\\u1064\\u1067-\\u106D\\u1071-\\u1074\\u1082-\\u108D\\u108F\\u109A-\\u109D\\u135D-\\u135F\\u1712-\\u1714\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17B4-\\u17D3\\u17DD\\u180B-\\u180D\\u1885\\u1886\\u18A9\\u1920-\\u192B\\u1930-\\u193B\\u1A17-\\u1A1B\\u1A55-\\u1A5E\\u1A60-\\u1A7C\\u1A7F\\u1AB0-\\u1ABE\\u1B00-\\u1B04\\u1B34-\\u1B44\\u1B6B-\\u1B73\\u1B80-\\u1B82\\u1BA1-\\u1BAD\\u1BE6-\\u1BF3\\u1C24-\\u1C37\\u1CD0-\\u1CD2\\u1CD4-\\u1CE8\\u1CED\\u1CF2-\\u1CF4\\u1CF7-\\u1CF9\\u1DC0-\\u1DF9\\u1DFB-\\u1DFF\\u20D0-\\u20F0\\u2CEF-\\u2CF1\\u2D7F\\u2DE0-\\u2DFF\\u302A-\\u302F\\u3099\\u309A\\uA66F-\\uA672\\uA674-\\uA67D\\uA69E\\uA69F\\uA6F0\\uA6F1\\uA802\\uA806\\uA80B\\uA823-\\uA827\\uA880\\uA881\\uA8B4-\\uA8C5\\uA8E0-\\uA8F1\\uA8FF\\uA926-\\uA92D\\uA947-\\uA953\\uA980-\\uA983\\uA9B3-\\uA9C0\\uA9E5\\uAA29-\\uAA36\\uAA43\\uAA4C\\uAA4D\\uAA7B-\\uAA7D\\uAAB0\\uAAB2-\\uAAB4\\uAAB7\\uAAB8\\uAABE\\uAABF\\uAAC1\\uAAEB-\\uAAEF\\uAAF5\\uAAF6\\uABE3-\\uABEA\\uABEC\\uABED\\uFB1E\\uFE00-\\uFE0F\\uFE20-\\uFE2F]/g, ''))\n    : ((str) => str);\n\nclass BitapSearch {\n  constructor(\n    pattern,\n    {\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance,\n      includeMatches = Config.includeMatches,\n      findAllMatches = Config.findAllMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      isCaseSensitive = Config.isCaseSensitive,\n      ignoreDiacritics = Config.ignoreDiacritics,\n      ignoreLocation = Config.ignoreLocation\n    } = {}\n  ) {\n    this.options = {\n      location,\n      threshold,\n      distance,\n      includeMatches,\n      findAllMatches,\n      minMatchCharLength,\n      isCaseSensitive,\n      ignoreDiacritics,\n      ignoreLocation\n    };\n\n    pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n    pattern = ignoreDiacritics ? stripDiacritics(pattern) : pattern;\n    this.pattern = pattern;\n\n    this.chunks = [];\n\n    if (!this.pattern.length) {\n      return\n    }\n\n    const addChunk = (pattern, startIndex) => {\n      this.chunks.push({\n        pattern,\n        alphabet: createPatternAlphabet(pattern),\n        startIndex\n      });\n    };\n\n    const len = this.pattern.length;\n\n    if (len > MAX_BITS) {\n      let i = 0;\n      const remainder = len % MAX_BITS;\n      const end = len - remainder;\n\n      while (i < end) {\n        addChunk(this.pattern.substr(i, MAX_BITS), i);\n        i += MAX_BITS;\n      }\n\n      if (remainder) {\n        const startIndex = len - MAX_BITS;\n        addChunk(this.pattern.substr(startIndex), startIndex);\n      }\n    } else {\n      addChunk(this.pattern, 0);\n    }\n  }\n\n  searchIn(text) {\n    const { isCaseSensitive, ignoreDiacritics, includeMatches } = this.options;\n\n    text = isCaseSensitive ? text : text.toLowerCase();\n    text = ignoreDiacritics ? stripDiacritics(text) : text;\n\n    // Exact match\n    if (this.pattern === text) {\n      let result = {\n        isMatch: true,\n        score: 0\n      };\n\n      if (includeMatches) {\n        result.indices = [[0, text.length - 1]];\n      }\n\n      return result\n    }\n\n    // Otherwise, use Bitap algorithm\n    const {\n      location,\n      distance,\n      threshold,\n      findAllMatches,\n      minMatchCharLength,\n      ignoreLocation\n    } = this.options;\n\n    let allIndices = [];\n    let totalScore = 0;\n    let hasMatches = false;\n\n    this.chunks.forEach(({ pattern, alphabet, startIndex }) => {\n      const { isMatch, score, indices } = search(text, pattern, alphabet, {\n        location: location + startIndex,\n        distance,\n        threshold,\n        findAllMatches,\n        minMatchCharLength,\n        includeMatches,\n        ignoreLocation\n      });\n\n      if (isMatch) {\n        hasMatches = true;\n      }\n\n      totalScore += score;\n\n      if (isMatch && indices) {\n        allIndices = [...allIndices, ...indices];\n      }\n    });\n\n    let result = {\n      isMatch: hasMatches,\n      score: hasMatches ? totalScore / this.chunks.length : 1\n    };\n\n    if (hasMatches && includeMatches) {\n      result.indices = allIndices;\n    }\n\n    return result\n  }\n}\n\nclass BaseMatch {\n  constructor(pattern) {\n    this.pattern = pattern;\n  }\n  static isMultiMatch(pattern) {\n    return getMatch(pattern, this.multiRegex)\n  }\n  static isSingleMatch(pattern) {\n    return getMatch(pattern, this.singleRegex)\n  }\n  search(/*text*/) {}\n}\n\nfunction getMatch(pattern, exp) {\n  const matches = pattern.match(exp);\n  return matches ? matches[1] : null\n}\n\n// Token: 'file\n\nclass ExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'exact'\n  }\n  static get multiRegex() {\n    return /^=\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^=(.*)$/\n  }\n  search(text) {\n    const isMatch = text === this.pattern;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, this.pattern.length - 1]\n    }\n  }\n}\n\n// Token: !fire\n\nclass InverseExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-exact'\n  }\n  static get multiRegex() {\n    return /^!\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^!(.*)$/\n  }\n  search(text) {\n    const index = text.indexOf(this.pattern);\n    const isMatch = index === -1;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\n// Token: ^file\n\nclass PrefixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'prefix-exact'\n  }\n  static get multiRegex() {\n    return /^\\^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^\\^(.*)$/\n  }\n  search(text) {\n    const isMatch = text.startsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, this.pattern.length - 1]\n    }\n  }\n}\n\n// Token: !^fire\n\nclass InversePrefixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-prefix-exact'\n  }\n  static get multiRegex() {\n    return /^!\\^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^!\\^(.*)$/\n  }\n  search(text) {\n    const isMatch = !text.startsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\n// Token: .file$\n\nclass SuffixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'suffix-exact'\n  }\n  static get multiRegex() {\n    return /^\"(.*)\"\\$$/\n  }\n  static get singleRegex() {\n    return /^(.*)\\$$/\n  }\n  search(text) {\n    const isMatch = text.endsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [text.length - this.pattern.length, text.length - 1]\n    }\n  }\n}\n\n// Token: !.file$\n\nclass InverseSuffixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-suffix-exact'\n  }\n  static get multiRegex() {\n    return /^!\"(.*)\"\\$$/\n  }\n  static get singleRegex() {\n    return /^!(.*)\\$$/\n  }\n  search(text) {\n    const isMatch = !text.endsWith(this.pattern);\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\nclass FuzzyMatch extends BaseMatch {\n  constructor(\n    pattern,\n    {\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance,\n      includeMatches = Config.includeMatches,\n      findAllMatches = Config.findAllMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      isCaseSensitive = Config.isCaseSensitive,\n      ignoreDiacritics = Config.ignoreDiacritics,\n      ignoreLocation = Config.ignoreLocation\n    } = {}\n  ) {\n    super(pattern);\n    this._bitapSearch = new BitapSearch(pattern, {\n      location,\n      threshold,\n      distance,\n      includeMatches,\n      findAllMatches,\n      minMatchCharLength,\n      isCaseSensitive,\n      ignoreDiacritics,\n      ignoreLocation\n    });\n  }\n  static get type() {\n    return 'fuzzy'\n  }\n  static get multiRegex() {\n    return /^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^(.*)$/\n  }\n  search(text) {\n    return this._bitapSearch.searchIn(text)\n  }\n}\n\n// Token: 'file\n\nclass IncludeMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'include'\n  }\n  static get multiRegex() {\n    return /^'\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^'(.*)$/\n  }\n  search(text) {\n    let location = 0;\n    let index;\n\n    const indices = [];\n    const patternLen = this.pattern.length;\n\n    // Get all exact matches\n    while ((index = text.indexOf(this.pattern, location)) > -1) {\n      location = index + patternLen;\n      indices.push([index, location - 1]);\n    }\n\n    const isMatch = !!indices.length;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices\n    }\n  }\n}\n\n// ❗Order is important. DO NOT CHANGE.\nconst searchers = [\n  ExactMatch,\n  IncludeMatch,\n  PrefixExactMatch,\n  InversePrefixExactMatch,\n  InverseSuffixExactMatch,\n  SuffixExactMatch,\n  InverseExactMatch,\n  FuzzyMatch\n];\n\nconst searchersLen = searchers.length;\n\n// Regex to split by spaces, but keep anything in quotes together\nconst SPACE_RE = / +(?=(?:[^\\\"]*\\\"[^\\\"]*\\\")*[^\\\"]*$)/;\nconst OR_TOKEN = '|';\n\n// Return a 2D array representation of the query, for simpler parsing.\n// Example:\n// \"^core go$ | rb$ | py$ xy$\" => [[\"^core\", \"go$\"], [\"rb$\"], [\"py$\", \"xy$\"]]\nfunction parseQuery(pattern, options = {}) {\n  return pattern.split(OR_TOKEN).map((item) => {\n    let query = item\n      .trim()\n      .split(SPACE_RE)\n      .filter((item) => item && !!item.trim());\n\n    let results = [];\n    for (let i = 0, len = query.length; i < len; i += 1) {\n      const queryItem = query[i];\n\n      // 1. Handle multiple query match (i.e, once that are quoted, like `\"hello world\"`)\n      let found = false;\n      let idx = -1;\n      while (!found && ++idx < searchersLen) {\n        const searcher = searchers[idx];\n        let token = searcher.isMultiMatch(queryItem);\n        if (token) {\n          results.push(new searcher(token, options));\n          found = true;\n        }\n      }\n\n      if (found) {\n        continue\n      }\n\n      // 2. Handle single query matches (i.e, once that are *not* quoted)\n      idx = -1;\n      while (++idx < searchersLen) {\n        const searcher = searchers[idx];\n        let token = searcher.isSingleMatch(queryItem);\n        if (token) {\n          results.push(new searcher(token, options));\n          break\n        }\n      }\n    }\n\n    return results\n  })\n}\n\n// These extended matchers can return an array of matches, as opposed\n// to a singl match\nconst MultiMatchSet = new Set([FuzzyMatch.type, IncludeMatch.type]);\n\n/**\n * Command-like searching\n * ======================\n *\n * Given multiple search terms delimited by spaces.e.g. `^jscript .python$ ruby !java`,\n * search in a given text.\n *\n * Search syntax:\n *\n * | Token       | Match type                 | Description                            |\n * | ----------- | -------------------------- | -------------------------------------- |\n * | `jscript`   | fuzzy-match                | Items that fuzzy match `jscript`       |\n * | `=scheme`   | exact-match                | Items that are `scheme`                |\n * | `'python`   | include-match              | Items that include `python`            |\n * | `!ruby`     | inverse-exact-match        | Items that do not include `ruby`       |\n * | `^java`     | prefix-exact-match         | Items that start with `java`           |\n * | `!^earlang` | inverse-prefix-exact-match | Items that do not start with `earlang` |\n * | `.js$`      | suffix-exact-match         | Items that end with `.js`              |\n * | `!.go$`     | inverse-suffix-exact-match | Items that do not end with `.go`       |\n *\n * A single pipe character acts as an OR operator. For example, the following\n * query matches entries that start with `core` and end with either`go`, `rb`,\n * or`py`.\n *\n * ```\n * ^core go$ | rb$ | py$\n * ```\n */\nclass ExtendedSearch {\n  constructor(\n    pattern,\n    {\n      isCaseSensitive = Config.isCaseSensitive,\n      ignoreDiacritics = Config.ignoreDiacritics,\n      includeMatches = Config.includeMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      ignoreLocation = Config.ignoreLocation,\n      findAllMatches = Config.findAllMatches,\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance\n    } = {}\n  ) {\n    this.query = null;\n    this.options = {\n      isCaseSensitive,\n      ignoreDiacritics,\n      includeMatches,\n      minMatchCharLength,\n      findAllMatches,\n      ignoreLocation,\n      location,\n      threshold,\n      distance\n    };\n\n    pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n    pattern = ignoreDiacritics ? stripDiacritics(pattern) : pattern;\n    this.pattern = pattern;\n    this.query = parseQuery(this.pattern, this.options);\n  }\n\n  static condition(_, options) {\n    return options.useExtendedSearch\n  }\n\n  searchIn(text) {\n    const query = this.query;\n\n    if (!query) {\n      return {\n        isMatch: false,\n        score: 1\n      }\n    }\n\n    const { includeMatches, isCaseSensitive, ignoreDiacritics } = this.options;\n\n    text = isCaseSensitive ? text : text.toLowerCase();\n    text = ignoreDiacritics ? stripDiacritics(text) : text;\n\n    let numMatches = 0;\n    let allIndices = [];\n    let totalScore = 0;\n\n    // ORs\n    for (let i = 0, qLen = query.length; i < qLen; i += 1) {\n      const searchers = query[i];\n\n      // Reset indices\n      allIndices.length = 0;\n      numMatches = 0;\n\n      // ANDs\n      for (let j = 0, pLen = searchers.length; j < pLen; j += 1) {\n        const searcher = searchers[j];\n        const { isMatch, indices, score } = searcher.search(text);\n\n        if (isMatch) {\n          numMatches += 1;\n          totalScore += score;\n          if (includeMatches) {\n            const type = searcher.constructor.type;\n            if (MultiMatchSet.has(type)) {\n              allIndices = [...allIndices, ...indices];\n            } else {\n              allIndices.push(indices);\n            }\n          }\n        } else {\n          totalScore = 0;\n          numMatches = 0;\n          allIndices.length = 0;\n          break\n        }\n      }\n\n      // OR condition, so if TRUE, return\n      if (numMatches) {\n        let result = {\n          isMatch: true,\n          score: totalScore / numMatches\n        };\n\n        if (includeMatches) {\n          result.indices = allIndices;\n        }\n\n        return result\n      }\n    }\n\n    // Nothing was matched\n    return {\n      isMatch: false,\n      score: 1\n    }\n  }\n}\n\nconst registeredSearchers = [];\n\nfunction register(...args) {\n  registeredSearchers.push(...args);\n}\n\nfunction createSearcher(pattern, options) {\n  for (let i = 0, len = registeredSearchers.length; i < len; i += 1) {\n    let searcherClass = registeredSearchers[i];\n    if (searcherClass.condition(pattern, options)) {\n      return new searcherClass(pattern, options)\n    }\n  }\n\n  return new BitapSearch(pattern, options)\n}\n\nconst LogicalOperator = {\n  AND: '$and',\n  OR: '$or'\n};\n\nconst KeyType = {\n  PATH: '$path',\n  PATTERN: '$val'\n};\n\nconst isExpression = (query) =>\n  !!(query[LogicalOperator.AND] || query[LogicalOperator.OR]);\n\nconst isPath = (query) => !!query[KeyType.PATH];\n\nconst isLeaf = (query) =>\n  !isArray(query) && isObject(query) && !isExpression(query);\n\nconst convertToExplicit = (query) => ({\n  [LogicalOperator.AND]: Object.keys(query).map((key) => ({\n    [key]: query[key]\n  }))\n});\n\n// When `auto` is `true`, the parse function will infer and initialize and add\n// the appropriate `Searcher` instance\nfunction parse(query, options, { auto = true } = {}) {\n  const next = (query) => {\n    let keys = Object.keys(query);\n\n    const isQueryPath = isPath(query);\n\n    if (!isQueryPath && keys.length > 1 && !isExpression(query)) {\n      return next(convertToExplicit(query))\n    }\n\n    if (isLeaf(query)) {\n      const key = isQueryPath ? query[KeyType.PATH] : keys[0];\n\n      const pattern = isQueryPath ? query[KeyType.PATTERN] : query[key];\n\n      if (!isString(pattern)) {\n        throw new Error(LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY(key))\n      }\n\n      const obj = {\n        keyId: createKeyId(key),\n        pattern\n      };\n\n      if (auto) {\n        obj.searcher = createSearcher(pattern, options);\n      }\n\n      return obj\n    }\n\n    let node = {\n      children: [],\n      operator: keys[0]\n    };\n\n    keys.forEach((key) => {\n      const value = query[key];\n\n      if (isArray(value)) {\n        value.forEach((item) => {\n          node.children.push(next(item));\n        });\n      }\n    });\n\n    return node\n  };\n\n  if (!isExpression(query)) {\n    query = convertToExplicit(query);\n  }\n\n  return next(query)\n}\n\n// Practical scoring function\nfunction computeScore(\n  results,\n  { ignoreFieldNorm = Config.ignoreFieldNorm }\n) {\n  results.forEach((result) => {\n    let totalScore = 1;\n\n    result.matches.forEach(({ key, norm, score }) => {\n      const weight = key ? key.weight : null;\n\n      totalScore *= Math.pow(\n        score === 0 && weight ? Number.EPSILON : score,\n        (weight || 1) * (ignoreFieldNorm ? 1 : norm)\n      );\n    });\n\n    result.score = totalScore;\n  });\n}\n\nfunction transformMatches(result, data) {\n  const matches = result.matches;\n  data.matches = [];\n\n  if (!isDefined(matches)) {\n    return\n  }\n\n  matches.forEach((match) => {\n    if (!isDefined(match.indices) || !match.indices.length) {\n      return\n    }\n\n    const { indices, value } = match;\n\n    let obj = {\n      indices,\n      value\n    };\n\n    if (match.key) {\n      obj.key = match.key.src;\n    }\n\n    if (match.idx > -1) {\n      obj.refIndex = match.idx;\n    }\n\n    data.matches.push(obj);\n  });\n}\n\nfunction transformScore(result, data) {\n  data.score = result.score;\n}\n\nfunction format(\n  results,\n  docs,\n  {\n    includeMatches = Config.includeMatches,\n    includeScore = Config.includeScore\n  } = {}\n) {\n  const transformers = [];\n\n  if (includeMatches) transformers.push(transformMatches);\n  if (includeScore) transformers.push(transformScore);\n\n  return results.map((result) => {\n    const { idx } = result;\n\n    const data = {\n      item: docs[idx],\n      refIndex: idx\n    };\n\n    if (transformers.length) {\n      transformers.forEach((transformer) => {\n        transformer(result, data);\n      });\n    }\n\n    return data\n  })\n}\n\nclass Fuse {\n  constructor(docs, options = {}, index) {\n    this.options = { ...Config, ...options };\n\n    if (\n      this.options.useExtendedSearch &&\n      !true\n    ) {\n      throw new Error(EXTENDED_SEARCH_UNAVAILABLE)\n    }\n\n    this._keyStore = new KeyStore(this.options.keys);\n\n    this.setCollection(docs, index);\n  }\n\n  setCollection(docs, index) {\n    this._docs = docs;\n\n    if (index && !(index instanceof FuseIndex)) {\n      throw new Error(INCORRECT_INDEX_TYPE)\n    }\n\n    this._myIndex =\n      index ||\n      createIndex(this.options.keys, this._docs, {\n        getFn: this.options.getFn,\n        fieldNormWeight: this.options.fieldNormWeight\n      });\n  }\n\n  add(doc) {\n    if (!isDefined(doc)) {\n      return\n    }\n\n    this._docs.push(doc);\n    this._myIndex.add(doc);\n  }\n\n  remove(predicate = (/* doc, idx */) => false) {\n    const results = [];\n\n    for (let i = 0, len = this._docs.length; i < len; i += 1) {\n      const doc = this._docs[i];\n      if (predicate(doc, i)) {\n        this.removeAt(i);\n        i -= 1;\n        len -= 1;\n\n        results.push(doc);\n      }\n    }\n\n    return results\n  }\n\n  removeAt(idx) {\n    this._docs.splice(idx, 1);\n    this._myIndex.removeAt(idx);\n  }\n\n  getIndex() {\n    return this._myIndex\n  }\n\n  search(query, { limit = -1 } = {}) {\n    const {\n      includeMatches,\n      includeScore,\n      shouldSort,\n      sortFn,\n      ignoreFieldNorm\n    } = this.options;\n\n    let results = isString(query)\n      ? isString(this._docs[0])\n        ? this._searchStringList(query)\n        : this._searchObjectList(query)\n      : this._searchLogical(query);\n\n    computeScore(results, { ignoreFieldNorm });\n\n    if (shouldSort) {\n      results.sort(sortFn);\n    }\n\n    if (isNumber(limit) && limit > -1) {\n      results = results.slice(0, limit);\n    }\n\n    return format(results, this._docs, {\n      includeMatches,\n      includeScore\n    })\n  }\n\n  _searchStringList(query) {\n    const searcher = createSearcher(query, this.options);\n    const { records } = this._myIndex;\n    const results = [];\n\n    // Iterate over every string in the index\n    records.forEach(({ v: text, i: idx, n: norm }) => {\n      if (!isDefined(text)) {\n        return\n      }\n\n      const { isMatch, score, indices } = searcher.searchIn(text);\n\n      if (isMatch) {\n        results.push({\n          item: text,\n          idx,\n          matches: [{ score, value: text, norm, indices }]\n        });\n      }\n    });\n\n    return results\n  }\n\n  _searchLogical(query) {\n\n    const expression = parse(query, this.options);\n\n    const evaluate = (node, item, idx) => {\n      if (!node.children) {\n        const { keyId, searcher } = node;\n\n        const matches = this._findMatches({\n          key: this._keyStore.get(keyId),\n          value: this._myIndex.getValueForItemAtKeyId(item, keyId),\n          searcher\n        });\n\n        if (matches && matches.length) {\n          return [\n            {\n              idx,\n              item,\n              matches\n            }\n          ]\n        }\n\n        return []\n      }\n\n      const res = [];\n      for (let i = 0, len = node.children.length; i < len; i += 1) {\n        const child = node.children[i];\n        const result = evaluate(child, item, idx);\n        if (result.length) {\n          res.push(...result);\n        } else if (node.operator === LogicalOperator.AND) {\n          return []\n        }\n      }\n      return res\n    };\n\n    const records = this._myIndex.records;\n    const resultMap = {};\n    const results = [];\n\n    records.forEach(({ $: item, i: idx }) => {\n      if (isDefined(item)) {\n        let expResults = evaluate(expression, item, idx);\n\n        if (expResults.length) {\n          // Dedupe when adding\n          if (!resultMap[idx]) {\n            resultMap[idx] = { idx, item, matches: [] };\n            results.push(resultMap[idx]);\n          }\n          expResults.forEach(({ matches }) => {\n            resultMap[idx].matches.push(...matches);\n          });\n        }\n      }\n    });\n\n    return results\n  }\n\n  _searchObjectList(query) {\n    const searcher = createSearcher(query, this.options);\n    const { keys, records } = this._myIndex;\n    const results = [];\n\n    // List is Array<Object>\n    records.forEach(({ $: item, i: idx }) => {\n      if (!isDefined(item)) {\n        return\n      }\n\n      let matches = [];\n\n      // Iterate over every key (i.e, path), and fetch the value at that key\n      keys.forEach((key, keyIndex) => {\n        matches.push(\n          ...this._findMatches({\n            key,\n            value: item[keyIndex],\n            searcher\n          })\n        );\n      });\n\n      if (matches.length) {\n        results.push({\n          idx,\n          item,\n          matches\n        });\n      }\n    });\n\n    return results\n  }\n  _findMatches({ key, value, searcher }) {\n    if (!isDefined(value)) {\n      return []\n    }\n\n    let matches = [];\n\n    if (isArray(value)) {\n      value.forEach(({ v: text, i: idx, n: norm }) => {\n        if (!isDefined(text)) {\n          return\n        }\n\n        const { isMatch, score, indices } = searcher.searchIn(text);\n\n        if (isMatch) {\n          matches.push({\n            score,\n            key,\n            value: text,\n            idx,\n            norm,\n            indices\n          });\n        }\n      });\n    } else {\n      const { v: text, n: norm } = value;\n\n      const { isMatch, score, indices } = searcher.searchIn(text);\n\n      if (isMatch) {\n        matches.push({ score, key, value: text, norm, indices });\n      }\n    }\n\n    return matches\n  }\n}\n\nFuse.version = '7.1.0';\nFuse.createIndex = createIndex;\nFuse.parseIndex = parseIndex;\nFuse.config = Config;\n\n{\n  Fuse.parseQuery = parse;\n}\n\n{\n  register(ExtendedSearch);\n}\n\nexport { Fuse as default };\n","// Switching languages might inject invisible characters like Zero Width Non-Joiners (\\u200C) or directionality marks (\\u200E, \\u200F)\nexport const sanitizeInput = (str: string) =>\n  str\n    .replace(/[\\u200E\\u200F\\u202A-\\u202E\\u2066-\\u2069]/g, \"\")\n    .replace(/[\\-–—_./()]+/g, '') // remove separators only // remove hyphens, spaces, symbols\n    .normalize(\"NFC\")\n    .trim()","import Fuse, { FuseResult } from \"fuse.js\"\nimport { AmenityFeature, ImdfFeature, OccupantFeature, SearchClient } from \"../types\"\nimport { sanitizeInput } from \"./utils/sanitizeInput\"\n\nexport const getSearchClient = ({ occupants, amenities }: { occupants: OccupantFeature[], amenities: AmenityFeature[] }): SearchClient => {\n  \n  //** Create fuse instances once on init */\n  const fuseAmenities = new Fuse(amenities, {\n    threshold: 0.2,\n    keys: [\n      { name: \"properties.name\", \"weight\": 1, getFn: (obj) => Object.values(obj.properties.name || {}) },\n      { name: \"properties.category\", \"weight\": 1 },\n    ]\n  })\n  const fuseOccupants = new Fuse(occupants, {\n    threshold: 0.25, // 0.2 is too strict (can't find Mo-Mo Paradise with \"momo\" search string)\n    includeScore: true,\n    shouldSort: true,\n    keys: [\n      { name: \"properties.name\", \"weight\": 4, getFn: (obj) => Object.values(obj.properties.name || {}) },\n      { name: \"properties.keywords\", \"weight\": 0.5 },\n      { name: \"properties.category\", \"weight\": 0.25 },\n      { name: \"properties.local_category_names\",  \"weight\": 0.25 },\n      { name: \"properties.description\", \"weight\": 0.25, getFn: occ => Object.values(occ.properties.description || {}) },\n      { name: \"properties.unit_name\", \"weight\": 0.25 },\n      { name: \"properties.kiosk_name\", \"weight\": 0.25 }\n    ]\n  })\n\n  const search = (value: string): FuseResult<ImdfFeature>[] => {\n\n    const sanitizedValue = sanitizeInput(value)\n    \n    // 01. Search amenities\n    const matchedAmenities = fuseAmenities.search(sanitizedValue)\n\n    // 02. Search Occupants\n    const matchedOccupants = fuseOccupants.search(sanitizedValue)\n\n    return [...matchedAmenities, ...matchedOccupants]\n  }\n\n  return {\n    search\n  }\n}"],"mappings":";;;;;;;AAAA,SAAS,iBAAAA,sBAAqB;;;ACGvB,IAAM,mBAAmB;AAEzB,IAAM,qBAAoC;AAAA,EAC/C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,IAAM,wBAAuC;AAAA,EAClD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,IAAM,wBAAuC;AAAA,EAClD,GAAG;AAAA,EACH,GAAG;AACL;AAEO,IAAM,oBAAmC;AAAA,EAC9C,GAAG;AAAA,EACH;AAAA,EACA;AACF;AAEO,IAAM,gCAGT;AAAA;AAAA,EAEF,SAAS,CAAC;AAAA,EACV,SAAS,CAAC;AAAA,EACV,QAAQ,CAAC;AAAA,EACT,UAAU,CAAC;AAAA,EACX,QAAQ,EAAE,SAAS,MAAM;AAAA,EACzB,SAAS,CAAC;AAAA,EACV,WAAW,CAAC;AAAA,EACZ,UAAU,EAAE,SAAS,MAAM;AAAA,EAC3B,OAAO,CAAC;AAAA,EACR,OAAO,CAAC;AAAA,EACR,UAAU;AAAA,IACR,iBAAiB,IAAI,KAAK;AAAA;AAAA,IAC1B,WAAW,IAAI,KAAK;AAAA,EACtB;AAAA,EACA,SAAS,CAAC;AAAA,EACV,cAAc,CAAC;AAAA,EACf,SAAS,CAAC;AAAA,EACV,MAAM,CAAC;AAAA,EACP,OAAO,CAAC;AAAA;AAAA,EAGR,UAAU,CAAC;AAAA,EACX,WAAW,CAAC;AAAA,EACZ,OAAO,CAAC;AAAA,EACR,WAAW;AAAA,IACT,iBAAiB,MAAM,KAAK;AAAA;AAAA,IAC5B,WAAW,MAAM,KAAK;AAAA,EACxB;AAAA,EACA,OAAO,CAAC;AAAA;AAAA,EAGR,qBAAqB;AAAA,IACnB,iBAAiB,IAAI,KAAK;AAAA;AAAA,EAC5B;AAAA,EACA,SAAS,CAAC;AAAA,EACV,MAAM,CAAC;AAAA,EACP,SAAS,CAAC;AACZ;;;AC9EA,eAAsB,iBACpB,WACA,QACA,aACA,UAAkB,kBACgB;AAElC,UAAQ,aAAa;AAAA,IACnB,KAAK;AAAA,IACL,KAAK,WAAW;AACd,YAAM,oBAAoB,GAAG,WAAW;AACxC,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,sBAAsB,SAAS,IAAI,iBAAiB,oBAAoB,MAAM;AAAA,MAC1F;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,aAAO;AAAA,IACT;AAAA,IAEA,KAAK,WAAW;AACd,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,sBAAsB,SAAS,IAAI,WAAW,oBAAoB,MAAM;AAAA,MACpF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,aAAO,MAAM;AAAA,IACf;AAAA,IAEA,KAAK,qBAAqB;AACxB,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,sBAAsB,SAAS,mCAAmC,MAAM;AAAA,MACpF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,UAAU,MAAM,IAAI,KAAK;AAC/B,YAAM,QAAQ,QAAQ;AACtB,aAAO,MAAM,IAAI,CAAC,UAAU;AAAA,QAC1B,IAAI,KAAK;AAAA,QACT,GAAG,KAAK;AAAA,MACV,EAAE;AAAA,IACJ;AAAA,IAEA,SAAS;AACP,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,sBAAsB,SAAS,SAAS,WAAW,oBAAoB,MAAM;AAAA,MACzF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,cAAc,MAAM,IAAI,KAAK;AACnC,aAAO,YAAY;AAAA,IACrB;AAAA,EACF;AACF;AAGA,eAAsB,gBACpB,WACA,cACA,aACA,UAAkB,kBACgB;AAElC,UAAQ,aAAa;AAAA,IACnB,KAAK;AAAA,IACL,KAAK,WAAW;AACd,YAAM,oBAAoB,GAAG,WAAW;AACxC,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,qBAAqB,SAAS,IAAI,iBAAiB;AAAA,QAAY;AAAA,UACvE,SAAS;AAAA,YACP,eAAe,UAAU,YAAY;AAAA,UACvC;AAAA,QACF;AAAA,MACF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,aAAO;AAAA,IACT;AAAA,IAEA,KAAK,qBAAqB;AACxB,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,qBAAqB,SAAS;AAAA,QAA2B;AAAA,UACjE,SAAS;AAAA,YACP,eAAe,UAAU,YAAY;AAAA,UACvC;AAAA,QACF;AAAA,MACF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,UAAU,MAAM,IAAI,KAAK;AAC/B,YAAM,QAAQ,QAAQ;AACtB,aAAO,MAAM,IAAI,CAAC,UAAU;AAAA,QAC1B,IAAI,KAAK;AAAA,QACT,GAAG,KAAK;AAAA,MACV,EAAE;AAAA,IACJ;AAAA,IAEA,SAAS;AACP,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,qBAAqB,SAAS,SAAS,WAAW;AAAA,QAAY;AAAA,UACtE,SAAS;AAAA,YACP,eAAe,UAAU,YAAY;AAAA,UACvC;AAAA,QACF;AAAA,MACF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,cAAc,MAAM,IAAI,KAAK;AACnC,aAAO,YAAY;AAAA,IACrB;AAAA,EACF;AACF;AAEO,IAAM,mBAAmB,OAC9B,aACA,WAOqC;AACrC,QAAM,OAAO,OAAO,QAAQ;AAC5B,QAAM,YAAY,OAAO;AACzB,QAAM,SAAS,OAAO;AACtB,QAAM,eAAe,OAAO;AAC5B,QAAM,UAAU,OAAO,WAAW;AAElC,MAAI;AACF,QAAI,SAAS,CAAC;AAEd,QAAI,SAAS,YAAY;AACvB,eAAS,MAAM;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,WAAW,SAAS,WAAW;AAC7B,eAAS,MAAM;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,WAAO,UAAU,CAAC;AAAA,EACpB,SAAS,GAAG;AAEV,WAAO,QAAQ,QAAQ,CAAC,CAAC;AAAA,EAC3B;AACF;;;AClJO,IAAM,oBAAoB,CAAC,UAA6B;AAC7D,SAAO,MAAM,WAAW,KAAK,MAAM,MAAM,CAAC,UAAU,OAAO,UAAU,QAAQ;AAC/E;AAQA,SAAS,6BAA6B,MAA2B;AAC/D,MAAI,KAAK,SAAS,GAAG;AACnB,WAAO;AAAA,EACT;AAEA,SACE,KAAK,MAAM,iBAAiB,KAC5B,KAAK,CAAC,EAAE,CAAC,MAAM,KAAK,KAAK,SAAS,CAAC,EAAE,CAAC,KACtC,KAAK,CAAC,EAAE,CAAC,MAAM,KAAK,KAAK,SAAS,CAAC,EAAE,CAAC;AAE1C;AAUO,IAAM,4BAA4B,CACvC,YACY;AAEZ,MACE,MAAM,QAAQ,QAAQ,CAAC,CAAC,MACvB,QAAQ,CAAC,EAAE,WAAW,KAAK,OAAO,QAAQ,CAAC,EAAE,CAAC,MAAM,WACrD;AACA,WAAO,6BAA6B,OAAqB;AAAA,EAC3D;AAGA,MACE,MAAM,QAAQ,OAAO,KACrB,QAAQ,SAAS,KACjB,MAAM,QAAQ,QAAQ,CAAC,CAAC,GACxB;AAEA,QAAI,CAAC,6BAA6B,QAAQ,CAAC,CAAe,GAAG;AAC3D,aAAO;AAAA,IACT;AAGA,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAI,CAAC,6BAA6B,QAAQ,CAAC,CAAe,GAAG;AAC3D,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAQO,IAAM,iCAAiC,CAC5C,iBACY;AACZ,SAAO,aAAa,MAAM,yBAAyB;AACrD;AAUO,IAAM,+BAA+B,CAC1C,eACY;AACZ,MAAI,CAAC,MAAM,QAAQ,UAAU,KAAK,WAAW,SAAS,GAAG;AACvD,WAAO;AAAA,EACT;AAGA,QAAM,aAAa,WAAW,CAAC;AAC/B,QAAM,YAAY,WAAW,WAAW,SAAS,CAAC;AAClD,MAAI,WAAW,CAAC,MAAM,UAAU,CAAC,KAAK,WAAW,CAAC,MAAM,UAAU,CAAC,GAAG;AACpE,WAAO;AAAA,EACT;AAEA,SAAO,WAAW,MAAM,iBAAiB;AAC3C;AAEO,IAAM,sBAAsB,CACjC,aACY;AACZ,QAAM,EAAE,MAAM,YAAY,IAAI;AAC9B,SAAO,SAAS,kBAAkB,+BAA+B,WAAW;AAC9E;AAEO,IAAM,iBAAiB,CAC5B,aACY;AACZ,QAAM,EAAE,MAAM,YAAY,IAAI;AAC9B,SAAO,SAAS,aAAa,0BAA0B,WAAW;AACpE;AAEO,IAAM,oBAAoB,CAC/B,aACY;AACZ,QAAM,EAAE,MAAM,YAAY,IAAI;AAC9B,SAAO,SAAS,gBAAgB,6BAA6B,WAAW;AAC1E;AAEO,IAAM,eAAe,CAC1B,aACY;AACZ,QAAM,EAAE,MAAM,YAAY,IAAI;AAC9B,SAAO,SAAS,WAAW,kBAAkB,WAAW;AAC1D;;;ACtIA,SAAS,WAAW,QAAoC;AACtD,SACE,OAAO,WAAW,YAClB,WAAW,QACX,SAAS,UACT,MAAM,QAAS,OAAe,GAAG;AAErC;AAEA,IAAM,gBAAgB,CAAC,GAAY,MAAe,EAAE,KAAK,OAAK,EAAE,SAAS,CAAC,CAAC;AAEpE,SAAS,YAAY,OAAwB,QAAgB;AAElE,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,QAAI,WAAW,MAAM,EAAG,QAAO,cAAc,OAAO,OAAO,GAAG;AAG9D,WAAO,MAAM,SAAS,MAAe;AAAA,EAEvC,OAAO;AACL,QAAI,WAAW,MAAM,EAAG,QAAO,OAAO,IAAI,SAAS,KAAK;AAGxD,WAAO,UAAU;AAAA,EACnB;AACF;AAEO,SAAS,aAA4C,MAAS,SAA2B;AAC9F,SAAO,OAAO,QAAQ,OAAO,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,MAAM;AACtD,WAAO,YAAY,KAAK,WAAW,GAAG,GAAG,MAAM;AAAA,EACjD,CAAC;AACH;;;ACjCA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAO,IAAM,UAAU,CAA8B,QAAkB,IAAI,OAAO,UAAQ,QAAQ,IAAI,CAAC;;;ADGhG,IAAM,0BAA0B,CAAC,aAAqF;AAC3H,SAAO,SAAS,WAAW,SAAS,SAAS,WAAW;AAC1D;AAEO,IAAM,iCAAiC,CAAC,aAA4F;AAEzI,QAAM,yBAAyB;AAAA,IAC7B,GAAG,SAAS,WAAW;AAAA,IACvB,GAAG,SAAS,WAAW;AAAA,EACzB;AAEA,SAAO,QAAQ,sBAAsB;AACvC;AAIO,IAAM,6BAA6B,CAAC,UAAoC,YAAyG;AAMtL,QAAM,gBAAgB,SAAS,OAAO,QAAQ,OAAO,SAAS,WAAW,yBAAyB,kBAAkB;AAEpH,QAAM,eAAe,wBAAwB,QAAQ;AAErD,QAAM,oBAAoB,cAAc,YAAY;AACpD,QAAM,yBAAyB,+BAA+B,QAAQ;AAGtE,MAAI,kBAAkB,iBAAiB;AACrC,WAAO,QAAQ,CAAC,cAAc,GAAG,sBAAsB,CAAC;AAAA,EAC1D;AAGA,QAAM,sBAAsB,uBAAuB,OAAO,CAAC,MAAM,EAAE,WAAW,aAAa,iBAAiB;AAC5G,QAAM,uBAAuB,CAAC,GAAG,IAAI,IAAI,oBAAoB,IAAI,SAAO,CAAC,IAAI,WAAW,UAAU,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC;AACjH,SAAO,QAAQ,CAAC,cAAc,GAAG,oBAAoB,CAAC;AACxD;;;AEvCA;AAAA,EAEE;AAAA,EACA;AAAA,OACK;;;ACGP,SAAS,qBAAqB;AAmBvB,IAAM,kBAAkB,CAAC;AAAA,EAC9B;AAAA,EACA;AACF,MAAyC;AACvC,QAAM,kBAA0C,CAAC,YAC/C,QAAQ,QAAQ,OAAO;AACzB,QAAM,mBAA4C,CAAC,aACjD,QAAQ,QAAQ,QAAQ;AAC1B,QAAM,iBAAwC,CAAC,WAC7C,QAAQ,QAAQ,MAAM;AACxB,QAAM,oBAA8C,CAAC,cACnD,QAAQ,QAAQ,SAAS;AAC3B,QAAM,mBAA4C,CAAC,aACjD,QAAQ,QAAQ,QAAQ;AAC1B,QAAM,uBAAoD,CAAC,iBACzD,QAAQ,QAAQ,YAAY;AAC9B,QAAM,oBAA8C,CAAC,cACnD,QAAQ,QAAQ,SAAS;AAC3B,QAAM,gBAAsC,CAAC,UAAU,QAAQ,QAAQ,KAAK;AAE5E,QAAM,oBAA8C,OAAO,cAAc;AACvE,UAAM,QAAQ,MAAM,iBAA0B,UAAU,WAAW,QAAQ;AAC3E,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,UAAU;AAAA,QACb;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAA0C,OAAO,YAAY;AACjE,UAAM,QAAQ,MAAM,QAAQ;AAAA,MAC1B,QAAQ,WAAW,SAAS,IAAI,gBAAwB;AAAA,IAC1D;AAEA,UAAM,iBAAiB,MAAM,QAAQ,IAAI,MAAM,IAAI,YAAY,CAAC;AAEhE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AAEzE,UAAM,eAAe,eAAe,CAAC,EAAE,WAAW;AAElD,UAAM,SAAS,MAAM,qBAA8B,OAAO;AAC1D,UAAM,gBAAgB,OAAO;AAAA,MAC3B,CAACC,WAAUA,OAAM,WAAW,aAAa,aAAa;AAAA,IACxD;AACA,UAAM,QAAQ,cAAc,KAAK,CAACA,WAAU,cAAc,SAASA,MAAK,CAAC;AACzE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,QAAQ;AAAA,QACX,SAAS,aAAa,WAAW;AAAA,QACjC,YAAY,aAAa,WAAW,KAAK;AAAA,QACzC,OAAO;AAAA,QACP,OAAO;AAAA,QACP;AAAA,QACA,qBAAqB,QAAQ,MAAM,cAAc,KAAK,IAAI;AAAA,MAC5D;AAAA,IACF;AAAA,EACF;AAEA,QAAM,iBAAwC,OAAO,WAAW;AAC9D,UAAM,OAAO,MAAM,iBAAyB,OAAO,WAAW,OAAO;AACrE,UAAM,QAAQ,MAAM,iBAA0B,KAAK,WAAW,QAAQ;AACtE,UAAM,QAAQ,MAAM,iBAA0B,KAAK,WAAW,QAAQ;AAEtE,UAAM,WAAW,MAAM,qBAAgC,SAAS;AAChE,UAAM,UAAU,SAAS,KAAK,CAACC,aAAY,cAAc,QAAQA,QAAO,CAAC;AAEzE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,OAAO;AAAA,QACV,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,MAAM,MAAM,aAAa,IAAI;AAAA,QAC7B,SAAS,UAAU,MAAM,gBAAgB,OAAO,IAAI;AAAA,QACpD,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,SAAS,MAAM,WAAW;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAA0C,OAAO,YAAY;AACjE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,UAAM,SAAS,MAAM,iBAA2B,QAAQ,WAAW,SAAS;AAE5E,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,QAAQ;AAAA,QACX,QAAQ,SAAS,MAAM,eAAe,MAAM,IAAI;AAAA,QAChD,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,SAAS,MAAM,WAAW;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,gBAAsC,OAAO,UAAU;AAC3D,UAAM,QAAQ,MAAM,iBAA0B,MAAM,WAAW,QAAQ;AACvE,UAAM,QAAQ,MAAM,iBAA0B,MAAM,WAAW,QAAQ;AACvE,UAAM,SAAS,MAAM,iBAA2B,MAAM,WAAW,SAAS;AAG1E,UAAM,QAAQ,MAAM,qBAA6B,MAAM;AACvD,UAAM,OAAO,MAAM;AAAA,MACjB,CAACC,UAAS;AACR,YAAI;AACF,iBAAOA,MAAK,WAAW,aAAa,aAC/BA,MAAK,WAAW,aAAa,MAAM,WAAW,YAC9C,cAAc,OAAOA,KAAI;AAAA,QAChC,SAAS,GAAG;AACV,kBAAQ,IAAI,qBAAqB,MAAM,EAAE,cAAc,EAAE,OAAO;AAChE,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAEA,QAAI,UAAiC;AAErC,QAAI,QAAQ;AACV,YAAM,WAAW,MAAM,qBAAgC,SAAS;AAChE,gBAAU,SAAS,KAAK,CAACD,aAAY,cAAc,QAAQA,QAAO,CAAC;AAAA,IACrE;AAEA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,MAAM;AAAA,QACT,QAAQ,SAAS,MAAM,eAAe,MAAM,IAAI;AAAA,QAChD,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,SAAS,MAAM,WAAW;AAAA,QAE1B,MAAM,OAAO,MAAM,aAAa,IAAI,IAAI;AAAA,QACxC,SAAS,UAAU,MAAM,gBAAgB,OAAO,IAAI;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAEA,QAAM,gBAAsC,OAAO,UAAU;AAC3D,UAAM,QAAQ,MAAM,iBAA0B,MAAM,WAAW,QAAQ;AACvE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,MAAM;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,mBAA4C,OAAO,aAAa;AACpE,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,gBAAgB,CAAC;AAAA,MACjB,gBAAgB,CAAC;AAAA,MACjB;AAAA,MACA;AAAA,MACA,YAAY,CAAC;AAAA,MACb,WAAW,CAAC;AAAA,IACd,IAAI,SAAS;AACb,UAAM,SAAS,MAAM,iBAA2B,SAAS;AACzD,UAAM,QAAQ,MAAM,iBAA0B,QAAQ;AAEtD,UAAM,kBAAkB,MAAM,QAAQ;AAAA,MACpC,mBAAmB,IAAI,gBAA4B;AAAA,IACrD;AACA,UAAM,aAAa,MAAM,QAAQ;AAAA,MAC/B,cAAc,IAAI,gBAA6B;AAAA,IACjD;AACA,UAAM,aAAa,MAAM,QAAQ;AAAA,MAC/B,cAAc,IAAI,gBAA6B;AAAA,IACjD;AACA,UAAM,QAAQ,MAAM,iBAA0B,QAAQ;AACtD,UAAM,OAAO,MAAM,iBAAyB,OAAO;AAEnD,UAAM,SAAS,MAAM,QAAQ,IAAI,UAAU,IAAI,gBAAyB,CAAC;AACzE,UAAM,QAAQ,MAAM,QAAQ,IAAI,SAAS,IAAI,gBAAwB,CAAC;AACtE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,SAAS;AAAA,QACZ,QAAQ,SAAS,MAAM,eAAe,MAAM,IAAI;AAAA,QAChD,kBAAkB,MAAM,QAAQ;AAAA,UAC9B,QAAQ,eAAe,EAAE,IAAI,gBAAgB;AAAA,QAC/C;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QAEA,OAAO,QAAQ,MAAM,cAAc,KAAK,IAAI;AAAA,QAC5C,MAAM,OAAO,MAAM,aAAa,IAAI,IAAI;AAAA,QACxC,QAAQ,MAAM,QAAQ,IAAI,OAAO,IAAI,aAAa,CAAC;AAAA,QACnD,OAAO,MAAM,QAAQ,IAAI,MAAM,IAAI,YAAY,CAAC;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAA0C,OAAO,YAAY;AACjE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV;AAAA,QACA,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,SAAS,MAAM,WAAW;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAA0C,OAAO,YAAY;AACjE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,QAAQ;AAAA,QACX;AAAA,QACA,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,SAAS,MAAM,WAAW;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAoC,OAAO,SAAS;AACxD,UAAM,QAAQ,MAAM,iBAA0B,KAAK,WAAW,QAAQ;AACtE,UAAM,QAAQ,MAAM,iBAA0B,KAAK,WAAW,QAAQ;AAEtE,UAAM,WAAW,MAAM,qBAAgC,SAAS;AAChE,QAAI;AACF,YAAM,UAAU,KAAK,SAAS,SAAS,iBAAiB,SAAS,KAAK,CAACA,aAAY,cAAc,MAAMA,QAAO,CAAC,IAAI;AACnH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,YAAY;AAAA,UACV,GAAG,KAAK;AAAA,UACR;AAAA,UACA,SAAS,MAAM,WAAW;AAAA,UAC1B,OAAO,MAAM,cAAc,KAAK;AAAA,UAChC,SAAS,UAAU,MAAM,gBAAgB,OAAO,IAAI;AAAA,QACtD;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AACZ,cAAQ,IAAI,0BAA0B,EAAE,MAAM,SAAS,CAAC;AAAA,IAC1D;AAAA,EACF;AAEA,QAAM,gBAAsC,CAAC,UAAU;AACrD,WAAO,QAAQ,QAAQ,KAAK;AAAA,EAC9B;AAEA,QAAM,mBAA4C,OAAO,aAAa;AACpE,UAAM,QAAQ,MAAM,iBAA0B,SAAS,WAAW,QAAQ;AAC1E,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,SAAS;AAAA,QACZ,OAAO,QAAQ,MAAM,cAAc,KAAK,IAAI;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAA0C,OAAO,YAAY;AACjE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,QAAI;AACF,aAAO;AAAA,QACL,GAAG;AAAA,QACH,YAAY;AAAA,UACV,GAAG,QAAQ;AAAA,UACX,OAAO,MAAM,cAAc,KAAK;AAAA,QAClC;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AACZ,cAAQ,IAAI,uBAAuB,EAAE,SAAS,MAAM,CAAC;AAAA,IACvD;AAAA,EACF;AAEA,QAAM,kBAAkB,CAAC,YAAY,QAAQ,QAAQ,OAAO;AAE5D,SAAO;AAAA,IACL,SAAS;AAAA,IACT,UAAU;AAAA,IACV,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,WAAW;AAAA,IACX,UAAU;AAAA,IACV,SAAS;AAAA,IACT,cAAc;AAAA,IACd,WAAW;AAAA,IACX,WAAW;AAAA,IACX,OAAO;AAAA,IACP,OAAO;AAAA,IACP,SAAS;AAAA,IACT,MAAM;AAAA,IAEN,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,IACV,SAAS;AAAA,IACT,MAAM;AAAA,IACN,OAAO;AAAA,IACP,UAAU;AAAA,IAEV,SAAS;AAAA,EACX;AACF;;;ACzUA,SAAS,QAAQ,OAAO;AACtB,SAAO,CAAC,MAAM,UACV,OAAO,KAAK,MAAM,mBAClB,MAAM,QAAQ,KAAK;AACzB;AAGA,IAAM,WAAW,IAAI;AACrB,SAAS,aAAa,OAAO;AAE3B,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO;AAAA,EACT;AACA,MAAI,SAAS,QAAQ;AACrB,SAAO,UAAU,OAAO,IAAI,SAAS,CAAC,WAAW,OAAO;AAC1D;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,SAAS,OAAO,KAAK,aAAa,KAAK;AAChD;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,UAAU;AAC1B;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,UAAU;AAC1B;AAGA,SAAS,UAAU,OAAO;AACxB,SACE,UAAU,QACV,UAAU,SACT,aAAa,KAAK,KAAK,OAAO,KAAK,KAAK;AAE7C;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,UAAU;AAC1B;AAGA,SAAS,aAAa,OAAO;AAC3B,SAAO,SAAS,KAAK,KAAK,UAAU;AACtC;AAEA,SAAS,UAAU,OAAO;AACxB,SAAO,UAAU,UAAa,UAAU;AAC1C;AAEA,SAAS,QAAQ,OAAO;AACtB,SAAO,CAAC,MAAM,KAAK,EAAE;AACvB;AAIA,SAAS,OAAO,OAAO;AACrB,SAAO,SAAS,OACZ,UAAU,SACR,uBACA,kBACF,OAAO,UAAU,SAAS,KAAK,KAAK;AAC1C;AAIA,IAAM,uBAAuB;AAE7B,IAAM,uCAAuC,CAAC,QAC5C,yBAAyB,GAAG;AAE9B,IAAM,2BAA2B,CAAC,QAChC,iCAAiC,GAAG;AAEtC,IAAM,uBAAuB,CAAC,SAAS,WAAW,IAAI;AAEtD,IAAM,2BAA2B,CAAC,QAChC,6BAA6B,GAAG;AAElC,IAAM,SAAS,OAAO,UAAU;AAEhC,IAAM,WAAN,MAAe;AAAA,EACb,YAAY,MAAM;AAChB,SAAK,QAAQ,CAAC;AACd,SAAK,UAAU,CAAC;AAEhB,QAAI,cAAc;AAElB,SAAK,QAAQ,CAAC,QAAQ;AACpB,UAAI,MAAM,UAAU,GAAG;AAEvB,WAAK,MAAM,KAAK,GAAG;AACnB,WAAK,QAAQ,IAAI,EAAE,IAAI;AAEvB,qBAAe,IAAI;AAAA,IACrB,CAAC;AAGD,SAAK,MAAM,QAAQ,CAAC,QAAQ;AAC1B,UAAI,UAAU;AAAA,IAChB,CAAC;AAAA,EACH;AAAA,EACA,IAAI,OAAO;AACT,WAAO,KAAK,QAAQ,KAAK;AAAA,EAC3B;AAAA,EACA,OAAO;AACL,WAAO,KAAK;AAAA,EACd;AAAA,EACA,SAAS;AACP,WAAO,KAAK,UAAU,KAAK,KAAK;AAAA,EAClC;AACF;AAEA,SAAS,UAAU,KAAK;AACtB,MAAI,OAAO;AACX,MAAI,KAAK;AACT,MAAI,MAAM;AACV,MAAI,SAAS;AACb,MAAI,QAAQ;AAEZ,MAAI,SAAS,GAAG,KAAK,QAAQ,GAAG,GAAG;AACjC,UAAM;AACN,WAAO,cAAc,GAAG;AACxB,SAAK,YAAY,GAAG;AAAA,EACtB,OAAO;AACL,QAAI,CAAC,OAAO,KAAK,KAAK,MAAM,GAAG;AAC7B,YAAM,IAAI,MAAM,qBAAqB,MAAM,CAAC;AAAA,IAC9C;AAEA,UAAM,OAAO,IAAI;AACjB,UAAM;AAEN,QAAI,OAAO,KAAK,KAAK,QAAQ,GAAG;AAC9B,eAAS,IAAI;AAEb,UAAI,UAAU,GAAG;AACf,cAAM,IAAI,MAAM,yBAAyB,IAAI,CAAC;AAAA,MAChD;AAAA,IACF;AAEA,WAAO,cAAc,IAAI;AACzB,SAAK,YAAY,IAAI;AACrB,YAAQ,IAAI;AAAA,EACd;AAEA,SAAO,EAAE,MAAM,IAAI,QAAQ,KAAK,MAAM;AACxC;AAEA,SAAS,cAAc,KAAK;AAC1B,SAAO,QAAQ,GAAG,IAAI,MAAM,IAAI,MAAM,GAAG;AAC3C;AAEA,SAAS,YAAY,KAAK;AACxB,SAAO,QAAQ,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI;AACxC;AAEA,SAAS,IAAI,KAAK,MAAM;AACtB,MAAI,OAAO,CAAC;AACZ,MAAI,MAAM;AAEV,QAAM,UAAU,CAACE,MAAKC,OAAM,UAAU;AACpC,QAAI,CAAC,UAAUD,IAAG,GAAG;AACnB;AAAA,IACF;AACA,QAAI,CAACC,MAAK,KAAK,GAAG;AAEhB,WAAK,KAAKD,IAAG;AAAA,IACf,OAAO;AACL,UAAI,MAAMC,MAAK,KAAK;AAEpB,YAAM,QAAQD,KAAI,GAAG;AAErB,UAAI,CAAC,UAAU,KAAK,GAAG;AACrB;AAAA,MACF;AAIA,UACE,UAAUC,MAAK,SAAS,MACvB,SAAS,KAAK,KAAK,SAAS,KAAK,KAAK,UAAU,KAAK,IACtD;AACA,aAAK,KAAK,SAAS,KAAK,CAAC;AAAA,MAC3B,WAAW,QAAQ,KAAK,GAAG;AACzB,cAAM;AAEN,iBAAS,IAAI,GAAG,MAAM,MAAM,QAAQ,IAAI,KAAK,KAAK,GAAG;AACnD,kBAAQ,MAAM,CAAC,GAAGA,OAAM,QAAQ,CAAC;AAAA,QACnC;AAAA,MACF,WAAWA,MAAK,QAAQ;AAEtB,gBAAQ,OAAOA,OAAM,QAAQ,CAAC;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AAGA,UAAQ,KAAK,SAAS,IAAI,IAAI,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC;AAEvD,SAAO,MAAM,OAAO,KAAK,CAAC;AAC5B;AAEA,IAAM,eAAe;AAAA;AAAA;AAAA;AAAA,EAInB,gBAAgB;AAAA;AAAA;AAAA,EAGhB,gBAAgB;AAAA;AAAA,EAEhB,oBAAoB;AACtB;AAEA,IAAM,eAAe;AAAA;AAAA;AAAA,EAGnB,iBAAiB;AAAA;AAAA,EAEjB,kBAAkB;AAAA;AAAA,EAElB,cAAc;AAAA;AAAA,EAEd,MAAM,CAAC;AAAA;AAAA,EAEP,YAAY;AAAA;AAAA,EAEZ,QAAQ,CAAC,GAAG,MACV,EAAE,UAAU,EAAE,QAAS,EAAE,MAAM,EAAE,MAAM,KAAK,IAAK,EAAE,QAAQ,EAAE,QAAQ,KAAK;AAC9E;AAEA,IAAM,eAAe;AAAA;AAAA,EAEnB,UAAU;AAAA;AAAA;AAAA,EAGV,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMX,UAAU;AACZ;AAEA,IAAM,kBAAkB;AAAA;AAAA,EAEtB,mBAAmB;AAAA;AAAA;AAAA,EAGnB,OAAO;AAAA;AAAA;AAAA;AAAA,EAIP,gBAAgB;AAAA;AAAA;AAAA;AAAA,EAIhB,iBAAiB;AAAA;AAAA,EAEjB,iBAAiB;AACnB;AAEA,IAAI,SAAS;AAAA,EACX,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AACL;AAEA,IAAM,QAAQ;AAId,SAAS,KAAK,SAAS,GAAG,WAAW,GAAG;AACtC,QAAM,QAAQ,oBAAI,IAAI;AACtB,QAAM,IAAI,KAAK,IAAI,IAAI,QAAQ;AAE/B,SAAO;AAAA,IACL,IAAI,OAAO;AACT,YAAM,YAAY,MAAM,MAAM,KAAK,EAAE;AAErC,UAAI,MAAM,IAAI,SAAS,GAAG;AACxB,eAAO,MAAM,IAAI,SAAS;AAAA,MAC5B;AAGA,YAAMC,QAAO,IAAI,KAAK,IAAI,WAAW,MAAM,MAAM;AAGjD,YAAM,IAAI,WAAW,KAAK,MAAMA,QAAO,CAAC,IAAI,CAAC;AAE7C,YAAM,IAAI,WAAW,CAAC;AAEtB,aAAO;AAAA,IACT;AAAA,IACA,QAAQ;AACN,YAAM,MAAM;AAAA,IACd;AAAA,EACF;AACF;AAEA,IAAM,YAAN,MAAgB;AAAA,EACd,YAAY;AAAA,IACV,QAAQ,OAAO;AAAA,IACf,kBAAkB,OAAO;AAAA,EAC3B,IAAI,CAAC,GAAG;AACN,SAAK,OAAO,KAAK,iBAAiB,CAAC;AACnC,SAAK,QAAQ;AACb,SAAK,YAAY;AAEjB,SAAK,gBAAgB;AAAA,EACvB;AAAA,EACA,WAAW,OAAO,CAAC,GAAG;AACpB,SAAK,OAAO;AAAA,EACd;AAAA,EACA,gBAAgB,UAAU,CAAC,GAAG;AAC5B,SAAK,UAAU;AAAA,EACjB;AAAA,EACA,QAAQ,OAAO,CAAC,GAAG;AACjB,SAAK,OAAO;AACZ,SAAK,WAAW,CAAC;AACjB,SAAK,QAAQ,CAAC,KAAK,QAAQ;AACzB,WAAK,SAAS,IAAI,EAAE,IAAI;AAAA,IAC1B,CAAC;AAAA,EACH;AAAA,EACA,SAAS;AACP,QAAI,KAAK,aAAa,CAAC,KAAK,KAAK,QAAQ;AACvC;AAAA,IACF;AAEA,SAAK,YAAY;AAGjB,QAAI,SAAS,KAAK,KAAK,CAAC,CAAC,GAAG;AAC1B,WAAK,KAAK,QAAQ,CAAC,KAAK,aAAa;AACnC,aAAK,WAAW,KAAK,QAAQ;AAAA,MAC/B,CAAC;AAAA,IACH,OAAO;AAEL,WAAK,KAAK,QAAQ,CAAC,KAAK,aAAa;AACnC,aAAK,WAAW,KAAK,QAAQ;AAAA,MAC/B,CAAC;AAAA,IACH;AAEA,SAAK,KAAK,MAAM;AAAA,EAClB;AAAA;AAAA,EAEA,IAAI,KAAK;AACP,UAAM,MAAM,KAAK,KAAK;AAEtB,QAAI,SAAS,GAAG,GAAG;AACjB,WAAK,WAAW,KAAK,GAAG;AAAA,IAC1B,OAAO;AACL,WAAK,WAAW,KAAK,GAAG;AAAA,IAC1B;AAAA,EACF;AAAA;AAAA,EAEA,SAAS,KAAK;AACZ,SAAK,QAAQ,OAAO,KAAK,CAAC;AAG1B,aAAS,IAAI,KAAK,MAAM,KAAK,KAAK,GAAG,IAAI,KAAK,KAAK,GAAG;AACpD,WAAK,QAAQ,CAAC,EAAE,KAAK;AAAA,IACvB;AAAA,EACF;AAAA,EACA,uBAAuB,MAAM,OAAO;AAClC,WAAO,KAAK,KAAK,SAAS,KAAK,CAAC;AAAA,EAClC;AAAA,EACA,OAAO;AACL,WAAO,KAAK,QAAQ;AAAA,EACtB;AAAA,EACA,WAAW,KAAK,UAAU;AACxB,QAAI,CAAC,UAAU,GAAG,KAAK,QAAQ,GAAG,GAAG;AACnC;AAAA,IACF;AAEA,QAAI,SAAS;AAAA,MACX,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG,KAAK,KAAK,IAAI,GAAG;AAAA,IACtB;AAEA,SAAK,QAAQ,KAAK,MAAM;AAAA,EAC1B;AAAA,EACA,WAAW,KAAK,UAAU;AACxB,QAAI,SAAS,EAAE,GAAG,UAAU,GAAG,CAAC,EAAE;AAGlC,SAAK,KAAK,QAAQ,CAAC,KAAK,aAAa;AACnC,UAAI,QAAQ,IAAI,QAAQ,IAAI,MAAM,GAAG,IAAI,KAAK,MAAM,KAAK,IAAI,IAAI;AAEjE,UAAI,CAAC,UAAU,KAAK,GAAG;AACrB;AAAA,MACF;AAEA,UAAI,QAAQ,KAAK,GAAG;AAClB,YAAI,aAAa,CAAC;AAClB,cAAM,QAAQ,CAAC,EAAE,gBAAgB,IAAI,MAAM,CAAC;AAE5C,eAAO,MAAM,QAAQ;AACnB,gBAAM,EAAE,gBAAgB,OAAAC,OAAM,IAAI,MAAM,IAAI;AAE5C,cAAI,CAAC,UAAUA,MAAK,GAAG;AACrB;AAAA,UACF;AAEA,cAAI,SAASA,MAAK,KAAK,CAAC,QAAQA,MAAK,GAAG;AACtC,gBAAI,YAAY;AAAA,cACd,GAAGA;AAAA,cACH,GAAG;AAAA,cACH,GAAG,KAAK,KAAK,IAAIA,MAAK;AAAA,YACxB;AAEA,uBAAW,KAAK,SAAS;AAAA,UAC3B,WAAW,QAAQA,MAAK,GAAG;AACzB,YAAAA,OAAM,QAAQ,CAAC,MAAM,MAAM;AACzB,oBAAM,KAAK;AAAA,gBACT,gBAAgB;AAAA,gBAChB,OAAO;AAAA,cACT,CAAC;AAAA,YACH,CAAC;AAAA,UACH,MAAO;AAAA,QACT;AACA,eAAO,EAAE,QAAQ,IAAI;AAAA,MACvB,WAAW,SAAS,KAAK,KAAK,CAAC,QAAQ,KAAK,GAAG;AAC7C,YAAI,YAAY;AAAA,UACd,GAAG;AAAA,UACH,GAAG,KAAK,KAAK,IAAI,KAAK;AAAA,QACxB;AAEA,eAAO,EAAE,QAAQ,IAAI;AAAA,MACvB;AAAA,IACF,CAAC;AAED,SAAK,QAAQ,KAAK,MAAM;AAAA,EAC1B;AAAA,EACA,SAAS;AACP,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,SAAS,KAAK;AAAA,IAChB;AAAA,EACF;AACF;AAEA,SAAS,YACP,MACA,MACA,EAAE,QAAQ,OAAO,OAAO,kBAAkB,OAAO,gBAAgB,IAAI,CAAC,GACtE;AACA,QAAM,UAAU,IAAI,UAAU,EAAE,OAAO,gBAAgB,CAAC;AACxD,UAAQ,QAAQ,KAAK,IAAI,SAAS,CAAC;AACnC,UAAQ,WAAW,IAAI;AACvB,UAAQ,OAAO;AACf,SAAO;AACT;AAEA,SAAS,WACP,MACA,EAAE,QAAQ,OAAO,OAAO,kBAAkB,OAAO,gBAAgB,IAAI,CAAC,GACtE;AACA,QAAM,EAAE,MAAM,QAAQ,IAAI;AAC1B,QAAM,UAAU,IAAI,UAAU,EAAE,OAAO,gBAAgB,CAAC;AACxD,UAAQ,QAAQ,IAAI;AACpB,UAAQ,gBAAgB,OAAO;AAC/B,SAAO;AACT;AAEA,SAAS,eACP,SACA;AAAA,EACE,SAAS;AAAA,EACT,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,WAAW,OAAO;AAAA,EAClB,iBAAiB,OAAO;AAC1B,IAAI,CAAC,GACL;AACA,QAAM,WAAW,SAAS,QAAQ;AAElC,MAAI,gBAAgB;AAClB,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,KAAK,IAAI,mBAAmB,eAAe;AAE7D,MAAI,CAAC,UAAU;AAEb,WAAO,YAAY,IAAM;AAAA,EAC3B;AAEA,SAAO,WAAW,YAAY;AAChC;AAEA,SAAS,qBACP,YAAY,CAAC,GACb,qBAAqB,OAAO,oBAC5B;AACA,MAAI,UAAU,CAAC;AACf,MAAI,QAAQ;AACZ,MAAI,MAAM;AACV,MAAI,IAAI;AAER,WAAS,MAAM,UAAU,QAAQ,IAAI,KAAK,KAAK,GAAG;AAChD,QAAI,QAAQ,UAAU,CAAC;AACvB,QAAI,SAAS,UAAU,IAAI;AACzB,cAAQ;AAAA,IACV,WAAW,CAAC,SAAS,UAAU,IAAI;AACjC,YAAM,IAAI;AACV,UAAI,MAAM,QAAQ,KAAK,oBAAoB;AACzC,gBAAQ,KAAK,CAAC,OAAO,GAAG,CAAC;AAAA,MAC3B;AACA,cAAQ;AAAA,IACV;AAAA,EACF;AAGA,MAAI,UAAU,IAAI,CAAC,KAAK,IAAI,SAAS,oBAAoB;AACvD,YAAQ,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;AAAA,EAC7B;AAEA,SAAO;AACT;AAGA,IAAM,WAAW;AAEjB,SAAS,OACP,MACA,SACA,iBACA;AAAA,EACE,WAAW,OAAO;AAAA,EAClB,WAAW,OAAO;AAAA,EAClB,YAAY,OAAO;AAAA,EACnB,iBAAiB,OAAO;AAAA,EACxB,qBAAqB,OAAO;AAAA,EAC5B,iBAAiB,OAAO;AAAA,EACxB,iBAAiB,OAAO;AAC1B,IAAI,CAAC,GACL;AACA,MAAI,QAAQ,SAAS,UAAU;AAC7B,UAAM,IAAI,MAAM,yBAAyB,QAAQ,CAAC;AAAA,EACpD;AAEA,QAAM,aAAa,QAAQ;AAE3B,QAAM,UAAU,KAAK;AAErB,QAAM,mBAAmB,KAAK,IAAI,GAAG,KAAK,IAAI,UAAU,OAAO,CAAC;AAEhE,MAAI,mBAAmB;AAEvB,MAAI,eAAe;AAInB,QAAM,iBAAiB,qBAAqB,KAAK;AAEjD,QAAM,YAAY,iBAAiB,MAAM,OAAO,IAAI,CAAC;AAErD,MAAI;AAGJ,UAAQ,QAAQ,KAAK,QAAQ,SAAS,YAAY,KAAK,IAAI;AACzD,QAAI,QAAQ,eAAe,SAAS;AAAA,MAClC,iBAAiB;AAAA,MACjB;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAED,uBAAmB,KAAK,IAAI,OAAO,gBAAgB;AACnD,mBAAe,QAAQ;AAEvB,QAAI,gBAAgB;AAClB,UAAI,IAAI;AACR,aAAO,IAAI,YAAY;AACrB,kBAAU,QAAQ,CAAC,IAAI;AACvB,aAAK;AAAA,MACP;AAAA,IACF;AAAA,EACF;AAGA,iBAAe;AAEf,MAAI,aAAa,CAAC;AAClB,MAAI,aAAa;AACjB,MAAI,SAAS,aAAa;AAE1B,QAAM,OAAO,KAAM,aAAa;AAEhC,WAAS,IAAI,GAAG,IAAI,YAAY,KAAK,GAAG;AAItC,QAAI,SAAS;AACb,QAAI,SAAS;AAEb,WAAO,SAAS,QAAQ;AACtB,YAAMC,SAAQ,eAAe,SAAS;AAAA,QACpC,QAAQ;AAAA,QACR,iBAAiB,mBAAmB;AAAA,QACpC;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AAED,UAAIA,UAAS,kBAAkB;AAC7B,iBAAS;AAAA,MACX,OAAO;AACL,iBAAS;AAAA,MACX;AAEA,eAAS,KAAK,OAAO,SAAS,UAAU,IAAI,MAAM;AAAA,IACpD;AAGA,aAAS;AAET,QAAI,QAAQ,KAAK,IAAI,GAAG,mBAAmB,SAAS,CAAC;AACrD,QAAI,SAAS,iBACT,UACA,KAAK,IAAI,mBAAmB,QAAQ,OAAO,IAAI;AAGnD,QAAI,SAAS,MAAM,SAAS,CAAC;AAE7B,WAAO,SAAS,CAAC,KAAK,KAAK,KAAK;AAEhC,aAAS,IAAI,QAAQ,KAAK,OAAO,KAAK,GAAG;AACvC,UAAI,kBAAkB,IAAI;AAC1B,UAAI,YAAY,gBAAgB,KAAK,OAAO,eAAe,CAAC;AAE5D,UAAI,gBAAgB;AAElB,kBAAU,eAAe,IAAI,CAAC,CAAC,CAAC;AAAA,MAClC;AAGA,aAAO,CAAC,KAAM,OAAO,IAAI,CAAC,KAAK,IAAK,KAAK;AAGzC,UAAI,GAAG;AACL,eAAO,CAAC,MACJ,WAAW,IAAI,CAAC,IAAI,WAAW,CAAC,MAAM,IAAK,IAAI,WAAW,IAAI,CAAC;AAAA,MACrE;AAEA,UAAI,OAAO,CAAC,IAAI,MAAM;AACpB,qBAAa,eAAe,SAAS;AAAA,UACnC,QAAQ;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AAID,YAAI,cAAc,kBAAkB;AAElC,6BAAmB;AACnB,yBAAe;AAGf,cAAI,gBAAgB,kBAAkB;AACpC;AAAA,UACF;AAGA,kBAAQ,KAAK,IAAI,GAAG,IAAI,mBAAmB,YAAY;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAGA,UAAM,QAAQ,eAAe,SAAS;AAAA,MACpC,QAAQ,IAAI;AAAA,MACZ,iBAAiB;AAAA,MACjB;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAED,QAAI,QAAQ,kBAAkB;AAC5B;AAAA,IACF;AAEA,iBAAa;AAAA,EACf;AAEA,QAAM,SAAS;AAAA,IACb,SAAS,gBAAgB;AAAA;AAAA,IAEzB,OAAO,KAAK,IAAI,MAAO,UAAU;AAAA,EACnC;AAEA,MAAI,gBAAgB;AAClB,UAAM,UAAU,qBAAqB,WAAW,kBAAkB;AAClE,QAAI,CAAC,QAAQ,QAAQ;AACnB,aAAO,UAAU;AAAA,IACnB,WAAW,gBAAgB;AACzB,aAAO,UAAU;AAAA,IACnB;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,sBAAsB,SAAS;AACtC,MAAI,OAAO,CAAC;AAEZ,WAAS,IAAI,GAAG,MAAM,QAAQ,QAAQ,IAAI,KAAK,KAAK,GAAG;AACrD,UAAM,OAAO,QAAQ,OAAO,CAAC;AAC7B,SAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAM,KAAM,MAAM,IAAI;AAAA,EACpD;AAEA,SAAO;AACT;AAEA,IAAM,kBAAkB,OAAO,UAAU,aAClC,CAAC,QAAQ,IAAI,UAAU,KAAK,EAAE,QAAQ,0kEAA0kE,EAAE,MAClnE,CAAC,QAAQ;AAEhB,IAAM,cAAN,MAAkB;AAAA,EAChB,YACE,SACA;AAAA,IACE,WAAW,OAAO;AAAA,IAClB,YAAY,OAAO;AAAA,IACnB,WAAW,OAAO;AAAA,IAClB,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,IACxB,qBAAqB,OAAO;AAAA,IAC5B,kBAAkB,OAAO;AAAA,IACzB,mBAAmB,OAAO;AAAA,IAC1B,iBAAiB,OAAO;AAAA,EAC1B,IAAI,CAAC,GACL;AACA,SAAK,UAAU;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,cAAU,kBAAkB,UAAU,QAAQ,YAAY;AAC1D,cAAU,mBAAmB,gBAAgB,OAAO,IAAI;AACxD,SAAK,UAAU;AAEf,SAAK,SAAS,CAAC;AAEf,QAAI,CAAC,KAAK,QAAQ,QAAQ;AACxB;AAAA,IACF;AAEA,UAAM,WAAW,CAACC,UAAS,eAAe;AACxC,WAAK,OAAO,KAAK;AAAA,QACf,SAAAA;AAAA,QACA,UAAU,sBAAsBA,QAAO;AAAA,QACvC;AAAA,MACF,CAAC;AAAA,IACH;AAEA,UAAM,MAAM,KAAK,QAAQ;AAEzB,QAAI,MAAM,UAAU;AAClB,UAAI,IAAI;AACR,YAAM,YAAY,MAAM;AACxB,YAAM,MAAM,MAAM;AAElB,aAAO,IAAI,KAAK;AACd,iBAAS,KAAK,QAAQ,OAAO,GAAG,QAAQ,GAAG,CAAC;AAC5C,aAAK;AAAA,MACP;AAEA,UAAI,WAAW;AACb,cAAM,aAAa,MAAM;AACzB,iBAAS,KAAK,QAAQ,OAAO,UAAU,GAAG,UAAU;AAAA,MACtD;AAAA,IACF,OAAO;AACL,eAAS,KAAK,SAAS,CAAC;AAAA,IAC1B;AAAA,EACF;AAAA,EAEA,SAAS,MAAM;AACb,UAAM,EAAE,iBAAiB,kBAAkB,eAAe,IAAI,KAAK;AAEnE,WAAO,kBAAkB,OAAO,KAAK,YAAY;AACjD,WAAO,mBAAmB,gBAAgB,IAAI,IAAI;AAGlD,QAAI,KAAK,YAAY,MAAM;AACzB,UAAIC,UAAS;AAAA,QACX,SAAS;AAAA,QACT,OAAO;AAAA,MACT;AAEA,UAAI,gBAAgB;AAClB,QAAAA,QAAO,UAAU,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC;AAAA,MACxC;AAEA,aAAOA;AAAA,IACT;AAGA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI,KAAK;AAET,QAAI,aAAa,CAAC;AAClB,QAAI,aAAa;AACjB,QAAI,aAAa;AAEjB,SAAK,OAAO,QAAQ,CAAC,EAAE,SAAS,UAAU,WAAW,MAAM;AACzD,YAAM,EAAE,SAAS,OAAO,QAAQ,IAAI,OAAO,MAAM,SAAS,UAAU;AAAA,QAClE,UAAU,WAAW;AAAA,QACrB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AAED,UAAI,SAAS;AACX,qBAAa;AAAA,MACf;AAEA,oBAAc;AAEd,UAAI,WAAW,SAAS;AACtB,qBAAa,CAAC,GAAG,YAAY,GAAG,OAAO;AAAA,MACzC;AAAA,IACF,CAAC;AAED,QAAI,SAAS;AAAA,MACX,SAAS;AAAA,MACT,OAAO,aAAa,aAAa,KAAK,OAAO,SAAS;AAAA,IACxD;AAEA,QAAI,cAAc,gBAAgB;AAChC,aAAO,UAAU;AAAA,IACnB;AAEA,WAAO;AAAA,EACT;AACF;AAEA,IAAM,YAAN,MAAgB;AAAA,EACd,YAAY,SAAS;AACnB,SAAK,UAAU;AAAA,EACjB;AAAA,EACA,OAAO,aAAa,SAAS;AAC3B,WAAO,SAAS,SAAS,KAAK,UAAU;AAAA,EAC1C;AAAA,EACA,OAAO,cAAc,SAAS;AAC5B,WAAO,SAAS,SAAS,KAAK,WAAW;AAAA,EAC3C;AAAA,EACA,SAAiB;AAAA,EAAC;AACpB;AAEA,SAAS,SAAS,SAAS,KAAK;AAC9B,QAAM,UAAU,QAAQ,MAAM,GAAG;AACjC,SAAO,UAAU,QAAQ,CAAC,IAAI;AAChC;AAIA,IAAM,aAAN,cAAyB,UAAU;AAAA,EACjC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,UAAU,SAAS,KAAK;AAE9B,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,QAAQ,SAAS,CAAC;AAAA,IACtC;AAAA,EACF;AACF;AAIA,IAAM,oBAAN,cAAgC,UAAU;AAAA,EACxC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,QAAQ,KAAK,QAAQ,KAAK,OAAO;AACvC,UAAM,UAAU,UAAU;AAE1B,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC;AAAA,IAC9B;AAAA,EACF;AACF;AAIA,IAAM,mBAAN,cAA+B,UAAU;AAAA,EACvC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,UAAU,KAAK,WAAW,KAAK,OAAO;AAE5C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,QAAQ,SAAS,CAAC;AAAA,IACtC;AAAA,EACF;AACF;AAIA,IAAM,0BAAN,cAAsC,UAAU;AAAA,EAC9C,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,UAAU,CAAC,KAAK,WAAW,KAAK,OAAO;AAE7C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC;AAAA,IAC9B;AAAA,EACF;AACF;AAIA,IAAM,mBAAN,cAA+B,UAAU;AAAA,EACvC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,UAAU,KAAK,SAAS,KAAK,OAAO;AAE1C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,KAAK,SAAS,KAAK,QAAQ,QAAQ,KAAK,SAAS,CAAC;AAAA,IAC9D;AAAA,EACF;AACF;AAIA,IAAM,0BAAN,cAAsC,UAAU;AAAA,EAC9C,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,UAAU,CAAC,KAAK,SAAS,KAAK,OAAO;AAC3C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC;AAAA,IAC9B;AAAA,EACF;AACF;AAEA,IAAM,aAAN,cAAyB,UAAU;AAAA,EACjC,YACE,SACA;AAAA,IACE,WAAW,OAAO;AAAA,IAClB,YAAY,OAAO;AAAA,IACnB,WAAW,OAAO;AAAA,IAClB,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,IACxB,qBAAqB,OAAO;AAAA,IAC5B,kBAAkB,OAAO;AAAA,IACzB,mBAAmB,OAAO;AAAA,IAC1B,iBAAiB,OAAO;AAAA,EAC1B,IAAI,CAAC,GACL;AACA,UAAM,OAAO;AACb,SAAK,eAAe,IAAI,YAAY,SAAS;AAAA,MAC3C;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,WAAO,KAAK,aAAa,SAAS,IAAI;AAAA,EACxC;AACF;AAIA,IAAM,eAAN,cAA2B,UAAU;AAAA,EACnC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,QAAI,WAAW;AACf,QAAI;AAEJ,UAAM,UAAU,CAAC;AACjB,UAAM,aAAa,KAAK,QAAQ;AAGhC,YAAQ,QAAQ,KAAK,QAAQ,KAAK,SAAS,QAAQ,KAAK,IAAI;AAC1D,iBAAW,QAAQ;AACnB,cAAQ,KAAK,CAAC,OAAO,WAAW,CAAC,CAAC;AAAA,IACpC;AAEA,UAAM,UAAU,CAAC,CAAC,QAAQ;AAE1B,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AACF;AAGA,IAAM,YAAY;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,eAAe,UAAU;AAG/B,IAAM,WAAW;AACjB,IAAM,WAAW;AAKjB,SAAS,WAAW,SAAS,UAAU,CAAC,GAAG;AACzC,SAAO,QAAQ,MAAM,QAAQ,EAAE,IAAI,CAAC,SAAS;AAC3C,QAAI,QAAQ,KACT,KAAK,EACL,MAAM,QAAQ,EACd,OAAO,CAACC,UAASA,SAAQ,CAAC,CAACA,MAAK,KAAK,CAAC;AAEzC,QAAI,UAAU,CAAC;AACf,aAAS,IAAI,GAAG,MAAM,MAAM,QAAQ,IAAI,KAAK,KAAK,GAAG;AACnD,YAAM,YAAY,MAAM,CAAC;AAGzB,UAAI,QAAQ;AACZ,UAAI,MAAM;AACV,aAAO,CAAC,SAAS,EAAE,MAAM,cAAc;AACrC,cAAM,WAAW,UAAU,GAAG;AAC9B,YAAI,QAAQ,SAAS,aAAa,SAAS;AAC3C,YAAI,OAAO;AACT,kBAAQ,KAAK,IAAI,SAAS,OAAO,OAAO,CAAC;AACzC,kBAAQ;AAAA,QACV;AAAA,MACF;AAEA,UAAI,OAAO;AACT;AAAA,MACF;AAGA,YAAM;AACN,aAAO,EAAE,MAAM,cAAc;AAC3B,cAAM,WAAW,UAAU,GAAG;AAC9B,YAAI,QAAQ,SAAS,cAAc,SAAS;AAC5C,YAAI,OAAO;AACT,kBAAQ,KAAK,IAAI,SAAS,OAAO,OAAO,CAAC;AACzC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AACH;AAIA,IAAM,gBAAgB,oBAAI,IAAI,CAAC,WAAW,MAAM,aAAa,IAAI,CAAC;AA8BlE,IAAM,iBAAN,MAAqB;AAAA,EACnB,YACE,SACA;AAAA,IACE,kBAAkB,OAAO;AAAA,IACzB,mBAAmB,OAAO;AAAA,IAC1B,iBAAiB,OAAO;AAAA,IACxB,qBAAqB,OAAO;AAAA,IAC5B,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,IACxB,WAAW,OAAO;AAAA,IAClB,YAAY,OAAO;AAAA,IACnB,WAAW,OAAO;AAAA,EACpB,IAAI,CAAC,GACL;AACA,SAAK,QAAQ;AACb,SAAK,UAAU;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,cAAU,kBAAkB,UAAU,QAAQ,YAAY;AAC1D,cAAU,mBAAmB,gBAAgB,OAAO,IAAI;AACxD,SAAK,UAAU;AACf,SAAK,QAAQ,WAAW,KAAK,SAAS,KAAK,OAAO;AAAA,EACpD;AAAA,EAEA,OAAO,UAAU,GAAG,SAAS;AAC3B,WAAO,QAAQ;AAAA,EACjB;AAAA,EAEA,SAAS,MAAM;AACb,UAAM,QAAQ,KAAK;AAEnB,QAAI,CAAC,OAAO;AACV,aAAO;AAAA,QACL,SAAS;AAAA,QACT,OAAO;AAAA,MACT;AAAA,IACF;AAEA,UAAM,EAAE,gBAAgB,iBAAiB,iBAAiB,IAAI,KAAK;AAEnE,WAAO,kBAAkB,OAAO,KAAK,YAAY;AACjD,WAAO,mBAAmB,gBAAgB,IAAI,IAAI;AAElD,QAAI,aAAa;AACjB,QAAI,aAAa,CAAC;AAClB,QAAI,aAAa;AAGjB,aAAS,IAAI,GAAG,OAAO,MAAM,QAAQ,IAAI,MAAM,KAAK,GAAG;AACrD,YAAMC,aAAY,MAAM,CAAC;AAGzB,iBAAW,SAAS;AACpB,mBAAa;AAGb,eAAS,IAAI,GAAG,OAAOA,WAAU,QAAQ,IAAI,MAAM,KAAK,GAAG;AACzD,cAAM,WAAWA,WAAU,CAAC;AAC5B,cAAM,EAAE,SAAS,SAAS,MAAM,IAAI,SAAS,OAAO,IAAI;AAExD,YAAI,SAAS;AACX,wBAAc;AACd,wBAAc;AACd,cAAI,gBAAgB;AAClB,kBAAM,OAAO,SAAS,YAAY;AAClC,gBAAI,cAAc,IAAI,IAAI,GAAG;AAC3B,2BAAa,CAAC,GAAG,YAAY,GAAG,OAAO;AAAA,YACzC,OAAO;AACL,yBAAW,KAAK,OAAO;AAAA,YACzB;AAAA,UACF;AAAA,QACF,OAAO;AACL,uBAAa;AACb,uBAAa;AACb,qBAAW,SAAS;AACpB;AAAA,QACF;AAAA,MACF;AAGA,UAAI,YAAY;AACd,YAAI,SAAS;AAAA,UACX,SAAS;AAAA,UACT,OAAO,aAAa;AAAA,QACtB;AAEA,YAAI,gBAAgB;AAClB,iBAAO,UAAU;AAAA,QACnB;AAEA,eAAO;AAAA,MACT;AAAA,IACF;AAGA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,IAAM,sBAAsB,CAAC;AAE7B,SAAS,YAAY,MAAM;AACzB,sBAAoB,KAAK,GAAG,IAAI;AAClC;AAEA,SAAS,eAAe,SAAS,SAAS;AACxC,WAAS,IAAI,GAAG,MAAM,oBAAoB,QAAQ,IAAI,KAAK,KAAK,GAAG;AACjE,QAAI,gBAAgB,oBAAoB,CAAC;AACzC,QAAI,cAAc,UAAU,SAAS,OAAO,GAAG;AAC7C,aAAO,IAAI,cAAc,SAAS,OAAO;AAAA,IAC3C;AAAA,EACF;AAEA,SAAO,IAAI,YAAY,SAAS,OAAO;AACzC;AAEA,IAAM,kBAAkB;AAAA,EACtB,KAAK;AAAA,EACL,IAAI;AACN;AAEA,IAAM,UAAU;AAAA,EACd,MAAM;AAAA,EACN,SAAS;AACX;AAEA,IAAM,eAAe,CAAC,UACpB,CAAC,EAAE,MAAM,gBAAgB,GAAG,KAAK,MAAM,gBAAgB,EAAE;AAE3D,IAAM,SAAS,CAAC,UAAU,CAAC,CAAC,MAAM,QAAQ,IAAI;AAE9C,IAAM,SAAS,CAAC,UACd,CAAC,QAAQ,KAAK,KAAK,SAAS,KAAK,KAAK,CAAC,aAAa,KAAK;AAE3D,IAAM,oBAAoB,CAAC,WAAW;AAAA,EACpC,CAAC,gBAAgB,GAAG,GAAG,OAAO,KAAK,KAAK,EAAE,IAAI,CAAC,SAAS;AAAA,IACtD,CAAC,GAAG,GAAG,MAAM,GAAG;AAAA,EAClB,EAAE;AACJ;AAIA,SAAS,MAAM,OAAO,SAAS,EAAE,OAAO,KAAK,IAAI,CAAC,GAAG;AACnD,QAAM,OAAO,CAACC,WAAU;AACtB,QAAI,OAAO,OAAO,KAAKA,MAAK;AAE5B,UAAM,cAAc,OAAOA,MAAK;AAEhC,QAAI,CAAC,eAAe,KAAK,SAAS,KAAK,CAAC,aAAaA,MAAK,GAAG;AAC3D,aAAO,KAAK,kBAAkBA,MAAK,CAAC;AAAA,IACtC;AAEA,QAAI,OAAOA,MAAK,GAAG;AACjB,YAAM,MAAM,cAAcA,OAAM,QAAQ,IAAI,IAAI,KAAK,CAAC;AAEtD,YAAM,UAAU,cAAcA,OAAM,QAAQ,OAAO,IAAIA,OAAM,GAAG;AAEhE,UAAI,CAAC,SAAS,OAAO,GAAG;AACtB,cAAM,IAAI,MAAM,qCAAqC,GAAG,CAAC;AAAA,MAC3D;AAEA,YAAM,MAAM;AAAA,QACV,OAAO,YAAY,GAAG;AAAA,QACtB;AAAA,MACF;AAEA,UAAI,MAAM;AACR,YAAI,WAAW,eAAe,SAAS,OAAO;AAAA,MAChD;AAEA,aAAO;AAAA,IACT;AAEA,QAAI,OAAO;AAAA,MACT,UAAU,CAAC;AAAA,MACX,UAAU,KAAK,CAAC;AAAA,IAClB;AAEA,SAAK,QAAQ,CAAC,QAAQ;AACpB,YAAM,QAAQA,OAAM,GAAG;AAEvB,UAAI,QAAQ,KAAK,GAAG;AAClB,cAAM,QAAQ,CAAC,SAAS;AACtB,eAAK,SAAS,KAAK,KAAK,IAAI,CAAC;AAAA,QAC/B,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,aAAa,KAAK,GAAG;AACxB,YAAQ,kBAAkB,KAAK;AAAA,EACjC;AAEA,SAAO,KAAK,KAAK;AACnB;AAGA,SAAS,aACP,SACA,EAAE,kBAAkB,OAAO,gBAAgB,GAC3C;AACA,UAAQ,QAAQ,CAAC,WAAW;AAC1B,QAAI,aAAa;AAEjB,WAAO,QAAQ,QAAQ,CAAC,EAAE,KAAK,MAAAP,OAAM,MAAM,MAAM;AAC/C,YAAM,SAAS,MAAM,IAAI,SAAS;AAElC,oBAAc,KAAK;AAAA,QACjB,UAAU,KAAK,SAAS,OAAO,UAAU;AAAA,SACxC,UAAU,MAAM,kBAAkB,IAAIA;AAAA,MACzC;AAAA,IACF,CAAC;AAED,WAAO,QAAQ;AAAA,EACjB,CAAC;AACH;AAEA,SAAS,iBAAiB,QAAQ,MAAM;AACtC,QAAM,UAAU,OAAO;AACvB,OAAK,UAAU,CAAC;AAEhB,MAAI,CAAC,UAAU,OAAO,GAAG;AACvB;AAAA,EACF;AAEA,UAAQ,QAAQ,CAAC,UAAU;AACzB,QAAI,CAAC,UAAU,MAAM,OAAO,KAAK,CAAC,MAAM,QAAQ,QAAQ;AACtD;AAAA,IACF;AAEA,UAAM,EAAE,SAAS,MAAM,IAAI;AAE3B,QAAI,MAAM;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAEA,QAAI,MAAM,KAAK;AACb,UAAI,MAAM,MAAM,IAAI;AAAA,IACtB;AAEA,QAAI,MAAM,MAAM,IAAI;AAClB,UAAI,WAAW,MAAM;AAAA,IACvB;AAEA,SAAK,QAAQ,KAAK,GAAG;AAAA,EACvB,CAAC;AACH;AAEA,SAAS,eAAe,QAAQ,MAAM;AACpC,OAAK,QAAQ,OAAO;AACtB;AAEA,SAAS,OACP,SACA,MACA;AAAA,EACE,iBAAiB,OAAO;AAAA,EACxB,eAAe,OAAO;AACxB,IAAI,CAAC,GACL;AACA,QAAM,eAAe,CAAC;AAEtB,MAAI,eAAgB,cAAa,KAAK,gBAAgB;AACtD,MAAI,aAAc,cAAa,KAAK,cAAc;AAElD,SAAO,QAAQ,IAAI,CAAC,WAAW;AAC7B,UAAM,EAAE,IAAI,IAAI;AAEhB,UAAM,OAAO;AAAA,MACX,MAAM,KAAK,GAAG;AAAA,MACd,UAAU;AAAA,IACZ;AAEA,QAAI,aAAa,QAAQ;AACvB,mBAAa,QAAQ,CAAC,gBAAgB;AACpC,oBAAY,QAAQ,IAAI;AAAA,MAC1B,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,IAAM,OAAN,MAAW;AAAA,EACT,YAAY,MAAM,UAAU,CAAC,GAAG,OAAO;AACrC,SAAK,UAAU,EAAE,GAAG,QAAQ,GAAG,QAAQ;AAEvC,QACE,KAAK,QAAQ,qBACb,OACA;AACA,YAAM,IAAI,MAAM,2BAA2B;AAAA,IAC7C;AAEA,SAAK,YAAY,IAAI,SAAS,KAAK,QAAQ,IAAI;AAE/C,SAAK,cAAc,MAAM,KAAK;AAAA,EAChC;AAAA,EAEA,cAAc,MAAM,OAAO;AACzB,SAAK,QAAQ;AAEb,QAAI,SAAS,EAAE,iBAAiB,YAAY;AAC1C,YAAM,IAAI,MAAM,oBAAoB;AAAA,IACtC;AAEA,SAAK,WACH,SACA,YAAY,KAAK,QAAQ,MAAM,KAAK,OAAO;AAAA,MACzC,OAAO,KAAK,QAAQ;AAAA,MACpB,iBAAiB,KAAK,QAAQ;AAAA,IAChC,CAAC;AAAA,EACL;AAAA,EAEA,IAAI,KAAK;AACP,QAAI,CAAC,UAAU,GAAG,GAAG;AACnB;AAAA,IACF;AAEA,SAAK,MAAM,KAAK,GAAG;AACnB,SAAK,SAAS,IAAI,GAAG;AAAA,EACvB;AAAA,EAEA,OAAO,YAAY,MAAoB,OAAO;AAC5C,UAAM,UAAU,CAAC;AAEjB,aAAS,IAAI,GAAG,MAAM,KAAK,MAAM,QAAQ,IAAI,KAAK,KAAK,GAAG;AACxD,YAAM,MAAM,KAAK,MAAM,CAAC;AACxB,UAAI,UAAU,KAAK,CAAC,GAAG;AACrB,aAAK,SAAS,CAAC;AACf,aAAK;AACL,eAAO;AAEP,gBAAQ,KAAK,GAAG;AAAA,MAClB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,SAAS,KAAK;AACZ,SAAK,MAAM,OAAO,KAAK,CAAC;AACxB,SAAK,SAAS,SAAS,GAAG;AAAA,EAC5B;AAAA,EAEA,WAAW;AACT,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,OAAO,OAAO,EAAE,QAAQ,GAAG,IAAI,CAAC,GAAG;AACjC,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI,KAAK;AAET,QAAI,UAAU,SAAS,KAAK,IACxB,SAAS,KAAK,MAAM,CAAC,CAAC,IACpB,KAAK,kBAAkB,KAAK,IAC5B,KAAK,kBAAkB,KAAK,IAC9B,KAAK,eAAe,KAAK;AAE7B,iBAAa,SAAS,EAAE,gBAAgB,CAAC;AAEzC,QAAI,YAAY;AACd,cAAQ,KAAK,MAAM;AAAA,IACrB;AAEA,QAAI,SAAS,KAAK,KAAK,QAAQ,IAAI;AACjC,gBAAU,QAAQ,MAAM,GAAG,KAAK;AAAA,IAClC;AAEA,WAAO,OAAO,SAAS,KAAK,OAAO;AAAA,MACjC;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,kBAAkB,OAAO;AACvB,UAAM,WAAW,eAAe,OAAO,KAAK,OAAO;AACnD,UAAM,EAAE,QAAQ,IAAI,KAAK;AACzB,UAAM,UAAU,CAAC;AAGjB,YAAQ,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,KAAK,GAAGA,MAAK,MAAM;AAChD,UAAI,CAAC,UAAU,IAAI,GAAG;AACpB;AAAA,MACF;AAEA,YAAM,EAAE,SAAS,OAAO,QAAQ,IAAI,SAAS,SAAS,IAAI;AAE1D,UAAI,SAAS;AACX,gBAAQ,KAAK;AAAA,UACX,MAAM;AAAA,UACN;AAAA,UACA,SAAS,CAAC,EAAE,OAAO,OAAO,MAAM,MAAAA,OAAM,QAAQ,CAAC;AAAA,QACjD,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAAA,EAEA,eAAe,OAAO;AAEpB,UAAM,aAAa,MAAM,OAAO,KAAK,OAAO;AAE5C,UAAM,WAAW,CAAC,MAAM,MAAM,QAAQ;AACpC,UAAI,CAAC,KAAK,UAAU;AAClB,cAAM,EAAE,OAAO,SAAS,IAAI;AAE5B,cAAM,UAAU,KAAK,aAAa;AAAA,UAChC,KAAK,KAAK,UAAU,IAAI,KAAK;AAAA,UAC7B,OAAO,KAAK,SAAS,uBAAuB,MAAM,KAAK;AAAA,UACvD;AAAA,QACF,CAAC;AAED,YAAI,WAAW,QAAQ,QAAQ;AAC7B,iBAAO;AAAA,YACL;AAAA,cACE;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,eAAO,CAAC;AAAA,MACV;AAEA,YAAM,MAAM,CAAC;AACb,eAAS,IAAI,GAAG,MAAM,KAAK,SAAS,QAAQ,IAAI,KAAK,KAAK,GAAG;AAC3D,cAAM,QAAQ,KAAK,SAAS,CAAC;AAC7B,cAAM,SAAS,SAAS,OAAO,MAAM,GAAG;AACxC,YAAI,OAAO,QAAQ;AACjB,cAAI,KAAK,GAAG,MAAM;AAAA,QACpB,WAAW,KAAK,aAAa,gBAAgB,KAAK;AAChD,iBAAO,CAAC;AAAA,QACV;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,UAAM,UAAU,KAAK,SAAS;AAC9B,UAAM,YAAY,CAAC;AACnB,UAAM,UAAU,CAAC;AAEjB,YAAQ,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,IAAI,MAAM;AACvC,UAAI,UAAU,IAAI,GAAG;AACnB,YAAI,aAAa,SAAS,YAAY,MAAM,GAAG;AAE/C,YAAI,WAAW,QAAQ;AAErB,cAAI,CAAC,UAAU,GAAG,GAAG;AACnB,sBAAU,GAAG,IAAI,EAAE,KAAK,MAAM,SAAS,CAAC,EAAE;AAC1C,oBAAQ,KAAK,UAAU,GAAG,CAAC;AAAA,UAC7B;AACA,qBAAW,QAAQ,CAAC,EAAE,QAAQ,MAAM;AAClC,sBAAU,GAAG,EAAE,QAAQ,KAAK,GAAG,OAAO;AAAA,UACxC,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkB,OAAO;AACvB,UAAM,WAAW,eAAe,OAAO,KAAK,OAAO;AACnD,UAAM,EAAE,MAAM,QAAQ,IAAI,KAAK;AAC/B,UAAM,UAAU,CAAC;AAGjB,YAAQ,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,IAAI,MAAM;AACvC,UAAI,CAAC,UAAU,IAAI,GAAG;AACpB;AAAA,MACF;AAEA,UAAI,UAAU,CAAC;AAGf,WAAK,QAAQ,CAAC,KAAK,aAAa;AAC9B,gBAAQ;AAAA,UACN,GAAG,KAAK,aAAa;AAAA,YACnB;AAAA,YACA,OAAO,KAAK,QAAQ;AAAA,YACpB;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF,CAAC;AAED,UAAI,QAAQ,QAAQ;AAClB,gBAAQ,KAAK;AAAA,UACX;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAAA,EACA,aAAa,EAAE,KAAK,OAAO,SAAS,GAAG;AACrC,QAAI,CAAC,UAAU,KAAK,GAAG;AACrB,aAAO,CAAC;AAAA,IACV;AAEA,QAAI,UAAU,CAAC;AAEf,QAAI,QAAQ,KAAK,GAAG;AAClB,YAAM,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,KAAK,GAAGA,MAAK,MAAM;AAC9C,YAAI,CAAC,UAAU,IAAI,GAAG;AACpB;AAAA,QACF;AAEA,cAAM,EAAE,SAAS,OAAO,QAAQ,IAAI,SAAS,SAAS,IAAI;AAE1D,YAAI,SAAS;AACX,kBAAQ,KAAK;AAAA,YACX;AAAA,YACA;AAAA,YACA,OAAO;AAAA,YACP;AAAA,YACA,MAAAA;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF,CAAC;AAAA,IACH,OAAO;AACL,YAAM,EAAE,GAAG,MAAM,GAAGA,MAAK,IAAI;AAE7B,YAAM,EAAE,SAAS,OAAO,QAAQ,IAAI,SAAS,SAAS,IAAI;AAE1D,UAAI,SAAS;AACX,gBAAQ,KAAK,EAAE,OAAO,KAAK,OAAO,MAAM,MAAAA,OAAM,QAAQ,CAAC;AAAA,MACzD;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAEA,KAAK,UAAU;AACf,KAAK,cAAc;AACnB,KAAK,aAAa;AAClB,KAAK,SAAS;AAEd;AACE,OAAK,aAAa;AACpB;AAEA;AACE,WAAS,cAAc;AACzB;;;AC9vDO,IAAM,gBAAgB,CAAC,QAC5B,IACG,QAAQ,6CAA6C,EAAE,EACvD,QAAQ,iBAAiB,EAAE,EAC3B,UAAU,KAAK,EACf,KAAK;;;ACFH,IAAM,kBAAkB,CAAC,EAAE,WAAW,UAAU,MAAmF;AAGxI,QAAM,gBAAgB,IAAI,KAAK,WAAW;AAAA,IACxC,WAAW;AAAA,IACX,MAAM;AAAA,MACJ,EAAE,MAAM,mBAAmB,UAAU,GAAG,OAAO,CAAC,QAAQ,OAAO,OAAO,IAAI,WAAW,QAAQ,CAAC,CAAC,EAAE;AAAA,MACjG,EAAE,MAAM,uBAAuB,UAAU,EAAE;AAAA,IAC7C;AAAA,EACF,CAAC;AACD,QAAM,gBAAgB,IAAI,KAAK,WAAW;AAAA,IACxC,WAAW;AAAA;AAAA,IACX,cAAc;AAAA,IACd,YAAY;AAAA,IACZ,MAAM;AAAA,MACJ,EAAE,MAAM,mBAAmB,UAAU,GAAG,OAAO,CAAC,QAAQ,OAAO,OAAO,IAAI,WAAW,QAAQ,CAAC,CAAC,EAAE;AAAA,MACjG,EAAE,MAAM,uBAAuB,UAAU,IAAI;AAAA,MAC7C,EAAE,MAAM,uBAAuB,UAAU,KAAK;AAAA,MAC9C,EAAE,MAAM,mCAAoC,UAAU,KAAK;AAAA,MAC3D,EAAE,MAAM,0BAA0B,UAAU,MAAM,OAAO,SAAO,OAAO,OAAO,IAAI,WAAW,eAAe,CAAC,CAAC,EAAE;AAAA,MAChH,EAAE,MAAM,wBAAwB,UAAU,KAAK;AAAA,MAC/C,EAAE,MAAM,yBAAyB,UAAU,KAAK;AAAA,IAClD;AAAA,EACF,CAAC;AAED,QAAMQ,UAAS,CAAC,UAA6C;AAE3D,UAAM,iBAAiB,cAAc,KAAK;AAG1C,UAAM,mBAAmB,cAAc,OAAO,cAAc;AAG5D,UAAM,mBAAmB,cAAc,OAAO,cAAc;AAE5D,WAAO,CAAC,GAAG,kBAAkB,GAAG,gBAAgB;AAAA,EAClD;AAEA,SAAO;AAAA,IACL,QAAAA;AAAA,EACF;AACF;;;AJrBO,IAAM,gBAAgB,CAAC,YAAiD;AAC7E,MAAI;AAEJ,QAAM,YAAY,oBAAI,IAGpB;AAEF,QAAM,cAAc,QAAQ,eAAe,IAAI,YAAY;AAC3D,QAAM,EAAE,OAAO,YAAY,WAAW,QAAQ,SAAS,aAAa,IAAI;AAExE,MAAI,CAAC;AACH,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAEF,MAAI,SAAS,cAAc,CAAC;AAC1B,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAEF,MAAI,SAAS,aAAa,CAAC;AACzB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAEF,QAAM,gCAAgC,CACpC,iBACI;AAAA,IACJ,UAAU,CAAC,gBAAgB,WAAW;AAAA,IACtC,SAAS,MAAM,iBAAoB,aAAa,EAAE,MAAM,WAAW,QAAQ,cAAc,QAAQ,CAAC;AAAA,EACpG;AAKA,QAAM,uBAA6C,OACjD,gBACG;AAEH,QAAI;AACF,YAAM,WAAW,MAAM,YAAY,gBAIjC,8BAA8B,WAAW,CAAC;AAC5C,aAAO;AAAA,IACT,SAAS,OAAO;AACd,YAAM;AAAA,IACR;AAAA,EACF;AAEA,QAAM,mBAAqC,OACzC,OACG;AACH,QAAI,OAAO,QAAQ,OAAO,OAAW,QAAO;AAC5C,UAAM,cAAc,GAAG,MAAM,GAAG,GAAG,YAAY,GAAG,CAAC;AACnD,UAAM,UAAU,MAAM,YAAY,gBAAuC;AAAA,MACvE,UAAU,CAAC,gBAAgB,aAAa,EAAE;AAAA,MAC1C,SAAS,YAAY;AACnB,cAAM,WAAW,MAAM,qBAAqB,WAAW;AACvD,cAAMC,WAAU,SAAS;AAAA,UACvB,CAAC,MAAM,EAAE,OAAO;AAAA,QAClB;AACA,eAAOA,YAAW;AAAA,MACpB;AAAA,IACF,CAAC;AACD,WAAO;AAAA,EACT;AAGA,QAAM,YAAY,gBAAgB,EAAE,kBAAkB,qBAAqB,CAAC;AAK5E,QAAM,mBAAmB,CACvB,aACA,oBACG;AACH,QAAI,UAAU,IAAI,WAAW,GAAG;AAC9B,cAAQ,KAAK,gBAAgB,WAAW,iBAAiB;AACzD,YAAM,SAAS,UAAU,IAAI,WAAW;AACxC,aAAO,OAAO;AAAA,IAChB;AACA,UAAMC,WAAU,8BAA8B,WAAW;AACzD,UAAM,WAAW,IAAI,cAAc,aAAa;AAAA,MAC9C,GAAGA;AAAA,MACH;AAAA,IACF,CAAC;AACD,UAAM,cAAc,SAAS,UAAU,MAAM;AAC3C,cAAQ,IAAI,2BAA2B,WAAW,wBAAwB,eAAe,KAAK;AAAA,IAEhG,CAAC;AACD,cAAU,IAAI,aAAa,EAAE,UAAU,YAAY,CAAC;AAEpD,WAAO;AAAA,EACT;AAEA,QAAM,kBAAkB,CAAC,gBAA6B;AACpD,UAAM,SAAS,UAAU,IAAI,WAAW;AACxC,QAAI,CAAC,OAAQ;AAEb,WAAO,YAAY;AACnB,cAAU,OAAO,WAAW;AAAA,EAC9B;AAEA,QAAM,mBAAmB,MAAM;AAC7B,cAAU,QAAQ,CAAC,EAAE,UAAU,YAAY,MAAM;AAC/C,kBAAY;AACZ,eAAS,QAAQ;AAAA,IACnB,CAAC;AACD,cAAU,MAAM;AAAA,EAClB;AAEA,QAAM,iCAAiC,CACrC,aACA,SAAuB,CAAC,GACxBA,WAA+B,CAAC,OACwD;AAAA,IACxF,UAAU,CAAC,aAAa,QAAQ,MAAM;AAAA,IACtC,SAAS,YAAY;AACnB,YAAM,WAAW,MAAM,qBAAwB,WAAW;AAG1D,YAAM,UAAU,OAAO,WAAW,CAAC;AACnC,UAAI,SAAS;AACb,UAAI,OAAO,SAAS;AAClB,iBAAS,SAAS,OAAO,OAAK,aAAa,GAAG,OAAO,CAAC;AAAA,MACxD;AAGA,aAAO,OAAO,aAAa,OACvB,MAAM,QAAQ,IAAI,OAAO,IAAI,CAAC,MAAM,UAAU,WAAW,EAAE,CAAC,CAAC,CAAC,IAC9D;AAAA,IACN;AAAA,IACA,GAAIA,YAAW,CAAC;AAAA,EAClB;AAEA,QAAM,6BAA6B,CACjC,aACA,IACA,SAAqB,CAAC,GACtBA,WAA+B,CAAC,OACoD;AAAA,IACpF,UAAU,CAAC,aAAa,UAAU,IAAI,MAAM;AAAA,IAC5C,SAAS,YAAY;AACnB,YAAM,UAAU,MAAM,iBAAoB,EAAE;AAC5C,aAAO,OAAO,aAAa,OACvB,MAAM,UAAU,WAAW,EAAE,OAAO,IACpC,QAAQ,QAAQ,OAAO;AAAA,IAC7B;AAAA,IACA,GAAIA,YAAW,CAAC;AAAA,EAClB;AAIA,iBAAe,aAAoC,aAAgB,QAAuB;AACxF,UAAM,qBAAqB;AAAA,MACzB;AAAA,MACA;AAAA,IACF;AACA,UAAM,WAAW,MAAM,YAAY,gBAAgB,kBAAkB;AACrE,WAAQ,QAAQ,aAAa,OAAQ,WAA+C;AAAA,EACtF;AAIA,iBAAe,SAAiC,aAAgB,IAAY,QAAqB;AAC/F,UAAM,mBAAmB;AAAA,MACvB;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,UAAM,UAAU,MAAM,YAAY,gBAAgB,gBAAgB;AAClE,WAAO;AAAA,EACT;AAEA,QAAM,WAAW,OAAO,QAAoD;AAC1E,QAAI,CAAC,cAAc;AACjB,YAAM,CAAC,WAAW,SAAS,IAAI,MAAM,QAAQ,IAAI;AAAA,QAC/C,aAAa,UAAU;AAAA,QACvB,aAAa,SAAS;AAAA,MACxB,CAAC;AACD,YAAM,WAAW,EAAE,WAAW,UAAU;AACxC,qBAAe,gBAAgB,QAAQ;AAAA,IACzC;AACA,WAAO,aAAa,OAAO,GAAG;AAAA,EAChC;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,mBAAmB;AAAA,IACnB;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,EACV;AACF;","names":["QueryObserver","kiosk","section","unit","obj","path","norm","value","score","pattern","result","item","searchers","query","search","feature","options"]}
+{"version":3,"sources":["../../src/data/index.ts","../../src/data/constant.ts","../../src/data/api/delivery-project.ts","../../src/data/utils/geometry-validator.ts","../../src/data/utils/match-filters.ts","../../src/data/utils/occupant-helper.ts","../../src/data/utils/lodash/compact.ts","../../src/data/getDataClient.ts","../../src/data/populator/index.ts","../../src/data/utils/findContaining.ts","../../../../node_modules/fuse.js/dist/fuse.mjs","../../src/data/search/utils/sanitizeInput.ts","../../src/data/search/getSearchClient.ts"],"sourcesContent":["export { QueryObserver } from \"@tanstack/query-core\"\n\nexport * from \"./types\"\nexport * from \"./constant\"\nexport * from \"./api/delivery-project\"\nexport * from './utils'\nexport * from \"./getDataClient\"\nexport * from './search/getSearchClient'","import { FeatureQueryOptions } from \"./types\"\nimport { FeatureType } from \"./types/feature-api\"\n\nexport const DEFAULT_BASE_URL = \"https://service.venue.in.th/api\"\n\nexport const IMDF_FEATURE_TYPES: FeatureType[] = [\n  \"address\",\n  \"amenity\",\n  \"anchor\",\n  \"building\",\n  \"detail\",\n  \"fixture\",\n  \"footprint\",\n  \"geofence\",\n  \"kiosk\",\n  \"level\",\n  \"occupant\",\n  \"opening\",\n  \"relationship\",\n  \"section\",\n  \"unit\",\n  \"venue\",\n]\n\nexport const IMDF_UNIT_CATEGORIES: string[] = [\n  'auditorium',\n  'brick',\n  'classroom',\n  'column',\n  'concrete',\n  'conferenceroom',\n  'drywall',\n  'elevator',\n  'escalator',\n  'fieldofplay',\n  'firstaid',\n  'fitnessroom',\n  'foodservice',\n  'footbridge',\n  'glass',\n  'huddleroom',\n  'kitchen',\n  'laboratory',\n  'library',\n  'lobby',\n  'lounge',\n  'mailroom',\n  'mothersroom',\n  'movietheater',\n  'movingwalkway',\n  'nonpublic',\n  'office',\n  'opentobelow',\n  'parking',\n  'phoneroom',\n  'platform',\n  'privatelounge',\n  'ramp',\n  'recreation',\n  'restroom',\n  'restroom.family',\n  'restroom.female',\n  'restroom.female.wheelchair',\n  'restroom.male',\n  'restroom.male.wheelchair',\n  'restroom.transgender',\n  'restroom.transgender.wheelchair',\n  'restroom.unisex',\n  'restroom.unisex.wheelchair',\n  'restroom.wheelchair',\n  'road',\n  'room',\n  'serverroom',\n  'shower',\n  'smokingarea',\n  'stairs',\n  'steps',\n  'storage',\n  'structure',\n  'terrace',\n  'theater',\n  'unenclosedarea',\n  'unspecified',\n  'vegetation',\n  'waitingroom',\n  'walkway',\n  'walkway.island',\n  'wood',\n];\n\nexport const NONIMDF_FEATURE_TYPES: FeatureType[] = [\n  \"taxonomy\",\n  \"event\",\n  \"promotion\",\n  \"label\",\n  \"privilege\",\n]\n\nexport const GEOJSON_FEATURE_TYPES: FeatureType[] = [\n  ...IMDF_FEATURE_TYPES,\n  ...NONIMDF_FEATURE_TYPES,\n]\n\nexport const ALL_FEATURE_TYPES: FeatureType[] = [\n  ...GEOJSON_FEATURE_TYPES,\n  \"sponsored-content\",\n  \"element\",\n]\n\nexport const defaultFeatureQueryOptionsMap: Record<\n  FeatureType,\n  FeatureQueryOptions\n> = {\n  // IMDF\n  address: {},\n  amenity: {},\n  anchor: {},\n  building: {},\n  detail: { enabled: false },\n  fixture: {},\n  footprint: {},\n  geofence: { enabled: false },\n  kiosk: {},\n  level: {},\n  occupant: {\n    refetchInterval: 5 * 60 * 1000, // refresh every 5 min\n    staleTime: 5 * 60 * 1000,\n  },\n  opening: {},\n  relationship: {},\n  section: {},\n  unit: {},\n  venue: {},\n\n  // OTHERS GEOJSON\n  taxonomy: {},\n  privilege: {},\n  event: {},\n  promotion: {\n    refetchInterval: 0.5 * 60 * 1000, // refresh every 5 min\n    staleTime: 0.5 * 60 * 1000,\n  },\n  label: {},\n\n  // NON GEOJSON\n  \"sponsored-content\": {\n    refetchInterval: 1 * 60 * 1000, // refresh every 5 min\n  },\n  element: {},\n  page: {},\n  model3d: {}\n}\n","import type {\n  FeatureResponseMap,\n  FeatureType,\n  SponsoredContentStrapiV4ApiResponse,\n} from \"../types/feature-api\"\nimport { DEFAULT_BASE_URL } from \"../constant\"\n\nexport async function fetchDeliveryApi<T extends FeatureType = FeatureType>(\n  projectId: string,\n  apiKey: string,\n  featureType: FeatureType,\n  baseUrl: string = DEFAULT_BASE_URL,\n): Promise<FeatureResponseMap[T][]> {\n  // TODO: Update Label Endpoint to match other endpoints\n  switch (featureType) {\n    case \"label\":\n    case \"element\": {\n      const pluralFeatureType = `${featureType}s`\n      const res = await fetch(\n        `${baseUrl}/delivery/projects/${projectId}/${pluralFeatureType}.geojson?api-key=${apiKey}`\n      )\n      if (res.status !== 200) return []\n      const items = await res.json()\n      return items\n    }\n\n    case \"model3d\": {\n      const res = await fetch(\n        `${baseUrl}/delivery/projects/${projectId}/${featureType}.geojson?api-key=${apiKey}`\n      )\n      if (res.status !== 200) return []\n      const items = await res.json()\n      return items.features\n    }\n\n    case \"sponsored-content\": {\n      const res = await fetch(\n        `${baseUrl}/delivery/projects/${projectId}/sponsored-content.json?api-key=${apiKey}`\n      )\n      if (res.status !== 200) return []\n      const jsonRes = await res.json()\n      const items = jsonRes.data as SponsoredContentStrapiV4ApiResponse[]\n      return items.map((item) => ({\n        id: item.id,\n        ...item.attributes,\n      })) as FeatureResponseMap[T][]\n    }\n\n    default: {\n      const res = await fetch(\n        `${baseUrl}/delivery/projects/${projectId}/imdf/${featureType}.geojson?api-key=${apiKey}`\n      )\n      if (res.status !== 200) return []\n      const collections = await res.json()\n      return collections.features\n    }\n  }\n}\n\n\nexport async function fetchPreviewApi<T extends FeatureType = FeatureType>(\n  projectId: string,\n  previewToken: string,\n  featureType: FeatureType,\n  baseUrl: string = DEFAULT_BASE_URL,\n): Promise<FeatureResponseMap[T][]> {\n  // TODO: Update Label Endpoint to match other endpoints\n  switch (featureType) {\n    case \"label\":\n    case \"element\": {\n      const pluralFeatureType = `${featureType}s`\n      const res = await fetch(\n        `${baseUrl}/preview/projects/${projectId}/${pluralFeatureType}.geojson`, {\n          headers: {\n            Authorization: `Bearer ${previewToken}`\n          }\n        }\n      )\n      if (res.status !== 200) return []\n      const items = await res.json()\n      return items\n    }\n\n    case \"sponsored-content\": {\n      const res = await fetch(\n        `${baseUrl}/preview/projects/${projectId}/sponsored-content.json`, {\n          headers: {\n            Authorization: `Bearer ${previewToken}`\n          }\n        }\n      )\n      if (res.status !== 200) return []\n      const jsonRes = await res.json()\n      const items = jsonRes.data as SponsoredContentStrapiV4ApiResponse[]\n      return items.map((item) => ({\n        id: item.id,\n        ...item.attributes,\n      })) as FeatureResponseMap[T][]\n    }\n\n    default: {\n      const res = await fetch(\n        `${baseUrl}/preview/projects/${projectId}/imdf/${featureType}.geojson`, {\n          headers: {\n            Authorization: `Bearer ${previewToken}`\n          }\n        }\n      )\n      if (res.status !== 200) return []\n      const collections = await res.json()\n      return collections.features\n    }\n  }\n}\n\nexport const safeFetchFeature = async <T extends FeatureType = FeatureType>(\n  featureType: FeatureType,\n  params: { \n    mode: 'delivery' | 'preview',\n    projectId: string,\n    apiKey: string,\n    previewToken?: string,\n    baseUrl: string\n  } \n): Promise<FeatureResponseMap[T][]> => {\n  const mode = params.mode ?? 'delivery'\n  const projectId = params.projectId\n  const apiKey = params.apiKey\n  const previewToken = params.previewToken\n  const baseUrl = params.baseUrl ?? DEFAULT_BASE_URL\n\n  try {\n    let result = []\n    \n    if (mode === 'delivery') {\n      result = await fetchDeliveryApi<T>(\n        projectId,\n        apiKey,\n        featureType,\n        baseUrl\n      )\n    } else if (mode === 'preview') {\n      result = await fetchPreviewApi<T>(\n        projectId,\n        previewToken,\n        featureType,\n        baseUrl\n      )\n    }\n    return result ?? []\n  } catch (e) {\n    // Suppress error and return []\n    return Promise.resolve([])\n  }\n}\n","import { Geometry, GeometryCollection, Position } from \"geojson\"\n\n/**\n * Checks if a point is a valid coordinate pair.\n *\n * @param point - The point to be checked.\n * @return True if the point is a valid coordinate pair, false otherwise.\n */\nexport const isValidCoordinate = (point: Position): boolean => {\n  return point.length === 2 && point.every((coord) => typeof coord === \"number\")\n}\n\n/**\n * Checks if a set of points forms a valid linear ring (closed and simple polygon).\n *\n * @param ring - The array of points representing a linear ring.\n * @return True if the linear ring is valid, false otherwise.\n */\nfunction isValidLinearRingCoordinates(ring: Position[]): boolean {\n  if (ring.length < 4) {\n    return false\n  }\n\n  return (\n    ring.every(isValidCoordinate) &&\n    ring[0][0] === ring[ring.length - 1][0] &&\n    ring[0][1] === ring[ring.length - 1][1]\n  )\n}\n\n/**\n * Checks if an input represents a valid polygon, which may include holes.\n * The input can be a single array of coordinates for simple polygons, or\n * an array of arrays of coordinates for polygons with holes.\n *\n * @param polygon - The input representing a polygon.\n * @return True if the polygon is valid, false otherwise.\n */\nexport const isValidPolygonCoordinates = (\n  polygon: Position[] | Position[][]\n): boolean => {\n  // Check if it's a simple polygon (without holes)\n  if (\n    Array.isArray(polygon[0]) &&\n    (polygon[0].length === 0 || typeof polygon[0][0] === \"number\")\n  ) {\n    return isValidLinearRingCoordinates(polygon as Position[])\n  }\n\n  // Check if it's a polygon with holes\n  if (\n    Array.isArray(polygon) &&\n    polygon.length > 0 &&\n    Array.isArray(polygon[0])\n  ) {\n    // Check the outer ring\n    if (!isValidLinearRingCoordinates(polygon[0] as Position[])) {\n      return false\n    }\n\n    // Check each hole\n    for (let i = 1; i < polygon.length; i++) {\n      if (!isValidLinearRingCoordinates(polygon[i] as Position[])) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  return false\n}\n\n/**\n * Checks if an array of polygons forms a valid MultiPolygon.\n *\n * @param multipolygon - The array of polygons.\n * @return True if the multipolygon is valid, false otherwise.\n */\nexport const isValidMultiPolygonCoordinates = (\n  multipolygon: Position[][][]\n): boolean => {\n  return multipolygon.every(isValidPolygonCoordinates)\n}\n\n/**\n * Checks if a set of points forms a valid LineString.\n * A valid LineString must have at least two points, each point must be a valid coordinate,\n * and it should not form a closed loop.\n *\n * @param lineString - The array of points representing a LineString.\n * @return True if the LineString is valid, false otherwise.\n */\nexport const isValidLineStringCoordinates = (\n  lineString: Position[]\n): boolean => {\n  if (!Array.isArray(lineString) || lineString.length < 2) {\n    return false\n  }\n\n  // Check if the first and last points are the same, which would make it a polygon\n  const firstPoint = lineString[0]\n  const lastPoint = lineString[lineString.length - 1]\n  if (firstPoint[0] === lastPoint[0] && firstPoint[1] === lastPoint[1]) {\n    return false\n  }\n\n  return lineString.every(isValidCoordinate)\n}\n\nexport const isValidMultiPolygon = (\n  geometry: Exclude<Geometry, GeometryCollection>\n): boolean => {\n  const { type, coordinates } = geometry\n  return type === \"MultiPolygon\" && isValidMultiPolygonCoordinates(coordinates)\n}\n\nexport const isValidPolygon = (\n  geometry: Exclude<Geometry, GeometryCollection>\n): boolean => {\n  const { type, coordinates } = geometry\n  return type === \"Polygon\" && isValidPolygonCoordinates(coordinates)\n}\n\nexport const isValidLineString = (\n  geometry: Exclude<Geometry, GeometryCollection>\n): boolean => {\n  const { type, coordinates } = geometry\n  return type === \"LineString\" && isValidLineStringCoordinates(coordinates)\n}\n\nexport const isValidPoint = (\n  geometry: Exclude<Geometry, GeometryCollection>\n): boolean => {\n  const { type, coordinates } = geometry\n  return type === \"Point\" && isValidCoordinate(coordinates)\n}\n","import type { Value, InFilter, Filter, Filters } from '../types/match-filters'\n\nfunction isInFilter(filter: Filter): filter is InFilter {\n  return (\n    typeof filter === \"object\" &&\n    filter !== null &&\n    \"$in\" in filter &&\n    Array.isArray((filter as any).$in)\n  );\n}\n\nconst someIntersect = (a: Value[], b: Value[]) => a.some(v => b.includes(v));\n\nexport function matchFilter(value: Value | Value[], filter: Filter) {\n\n  if (Array.isArray(value)) {\n    if (isInFilter(filter)) return someIntersect(value, filter.$in);\n  \n    // Equal\n    return value.includes(filter as Value);\n  \n  } else {\n    if (isInFilter(filter)) return filter.$in.includes(value);\n  \n    // Equal\n    return value === filter;\n  }\n}\n\nexport function matchFilters<T extends Record<string, any>>(item: T, filters: Filters): boolean {\n  return Object.entries(filters).every(([key, filter]) => {\n    return matchFilter(item.properties[key], filter)\n  });\n}","import { compact } from \"../utils/lodash\"\nimport { KioskFeaturePopulated, OccupantFeaturePopulated, UnitFeaturePopulated } from \"../types\";\n\nexport const getOccupantMainLocation = (occupant: OccupantFeaturePopulated): UnitFeaturePopulated | KioskFeaturePopulated => {\n  return occupant.properties.kiosk || occupant.properties.unit\n}\n\nexport const getOccupantCorrelatedLocations = (occupant: OccupantFeaturePopulated): Array<UnitFeaturePopulated | KioskFeaturePopulated> => {\n\n  const allCorrelatedLocations = [\n    ...occupant.properties.units,\n    ...occupant.properties.kiosks,\n  ]\n\n  return compact(allCorrelatedLocations)\n}\n\nexport type OccupantMarkerPlacementType = 'ONCE_PER_LEVEL' | 'ALL_LOCATIONS'\n\nexport const getOccupantMarkerLocations = (occupant: OccupantFeaturePopulated, options?: { type: OccupantMarkerPlacementType }): Array<UnitFeaturePopulated | KioskFeaturePopulated> => {\n\n  /**\n   * Use optiosn.type first\n   *   THEN occupant.show_name_on_all_units  \n   */\n  const placementType = options?.type ? options.type : occupant.properties.show_name_on_all_units ? 'ALL_LOCATIONS' : 'ONCE_PER_LEVEL'\n\n  const mainLocation = getOccupantMainLocation(occupant)\n\n  const mainLocationLevel = mainLocation?.properties?.level_id\n  const allCorrelatedLocations = getOccupantCorrelatedLocations(occupant)\n\n  // IF showNameonAllLocations = true, Show All \n  if (placementType === 'ALL_LOCATIONS') {\n    return compact([mainLocation, ...allCorrelatedLocations])\n  }\n  \n  // ELSE Show Once per level\n  const otherLevelLocations = allCorrelatedLocations.filter((f) => f.properties.level_id !== mainLocationLevel)\n  const onePerLevelLocations = [...new Map(otherLevelLocations.map(loc => [loc.properties.level_id, loc])).values()]\n  return compact([mainLocation, ...onePerLevelLocations])\n}\n","export const compact = <T extends unknown = unknown>(arr: T[]): T[] => arr.filter(item => Boolean(item));\n","import { safeFetchFeature } from \"./api/delivery-project\"\nimport { FeatureResponseMap, FeatureType, ImdfFeature } from \"./types/feature-api\"\nimport {\n  EnsureQueryDataOptions,\n  QueryClient,\n  QueryObserver,\n} from \"@tanstack/query-core\"\nimport {\n  FeatureQueryOptions,\n  FilterParams,\n  FindParams,\n  InternalFilterByType,\n  InternalFindById,\n  PopulatedParams,\n  SearchClient,\n  VenueClientOptions,\n  VenueDataClient,\n} from \"./types/VenueDataClient\"\nimport { createPopulator } from \"./populator\"\nimport { FeaturePopulatedResponseMap } from \"./types\"\nimport { matchFilters } from \"./utils/match-filters\"\nimport { FuseResult } from \"fuse.js\"\nimport { getSearchClient } from \"./search/getSearchClient\"\n\nexport const getDataClient = (options: VenueClientOptions): VenueDataClient => {\n  let searchClient: SearchClient;\n\n  const observers = new Map<\n    FeatureType,\n    { observer: QueryObserver<any, any>, unsubscribe: () => void }\n  >()\n\n  const queryClient = options.queryClient ?? new QueryClient()\n  const { mode = 'delivery', projectId, apiKey, baseUrl, previewToken } = options\n\n  if (!projectId)\n    throw new Error(\n      \"Cannot create VenueDataClient. Reason: `projectId` is missing\"\n    )\n    \n  if (mode === 'delivery' && !apiKey)\n    throw new Error(\n      \"Cannot create VenueDataClient. Reason: `apiKey` is missing\"\n    )\n\n  if (mode === 'preview' && !previewToken)\n    throw new Error(\n      \"Cannot create VenueDataClient. Reason: `previewToken` is missing\"\n    )\n\n  const createDeliveryApiQueryOptions = <T extends FeatureType = FeatureType>(\n    featureType: T\n  ) => ({\n    queryKey: [\"_deliveryapi\", featureType] as const,\n    queryFn: () => safeFetchFeature<T>(featureType, { mode, projectId, apiKey, previewToken, baseUrl }),\n  })\n\n  /**\n   * Internal Functions\n   * ***********************************/\n  const internalFilterByType: InternalFilterByType = async <T extends FeatureType = FeatureType>(\n    featureType: T\n  ) => {\n\n    try {\n      const features = await queryClient.ensureQueryData<\n        FeatureResponseMap[T][],\n        unknown,\n        FeatureResponseMap[T][]\n      >(createDeliveryApiQueryOptions(featureType))\n      return features\n    } catch (error) {\n      throw error\n    }\n  }\n\n  const internalFindById: InternalFindById = async <T extends FeatureType = FeatureType>(\n    id: string\n  ) => {\n    if (id === null || id === undefined) return null\n    const featureType = id.slice(0, id.lastIndexOf(\"-\")) as FeatureType\n    const feature = await queryClient.ensureQueryData<FeatureResponseMap[T]>({\n      queryKey: [\"_deliveryapi\", featureType, id],\n      queryFn: async () => {\n        const features = await internalFilterByType(featureType)\n        const feature = features.find(\n          (f) => f.id === id\n        ) as FeatureResponseMap[T]\n        return feature ?? null\n      },\n    })\n    return feature\n  }\n\n  // Create `Feature Populator` with internal functions\n  const populator = createPopulator({ internalFindById, internalFilterByType })\n\n  /**\n   * Public Functions\n   * ***********************************/\n  const registerObserver = (\n    featureType: FeatureType,\n    refetchInterval: number\n  ) => {\n    if (observers.has(featureType)) {\n      console.warn(`Observer for ${featureType} already exists`)\n      const record = observers.get(featureType)\n      return record.observer\n    }\n    const options = createDeliveryApiQueryOptions(featureType)\n    const observer = new QueryObserver(queryClient, {\n      ...options,\n      refetchInterval,\n    })\n    const unsubscribe = observer.subscribe(() => {\n      console.log(`[venue-js] Listening to ${featureType} changes (interval = ${refetchInterval}ms)`)\n      // TODO: add logs or what to do after subscribe\n    })\n    observers.set(featureType, { observer, unsubscribe })\n\n    return observer\n  }\n\n  const destroyObserver = (featureType: FeatureType) => {\n    const record = observers.get(featureType)\n    if (!record) return\n\n    record.unsubscribe()\n    observers.delete(featureType)\n  }\n\n  const destroyObservers = () => {\n    observers.forEach(({ observer, unsubscribe }) => {\n      unsubscribe()\n      observer.destroy()\n    })\n    observers.clear()\n  }\n\n  const createFilterByTypeQueryOptions = <T extends FeatureType = FeatureType>(\n    featureType: T,\n    params: FilterParams = {},\n    options: FeatureQueryOptions = {}\n  ): EnsureQueryDataOptions<FeatureResponseMap[T][] | FeaturePopulatedResponseMap[T][]> => ({\n    queryKey: [featureType, \"list\", params] as const,\n    queryFn: async () => {\n      const features = await internalFilterByType<T>(featureType)\n      \n      // Filter \n      const filters = params.filters ?? {}\n      let result = features\n      if (params.filters) {\n        result = features.filter(f => matchFilters(f, filters))\n      }\n\n      // Populate\n      return params.populate === true\n        ? await Promise.all(result.map((f) => populator[featureType](f)))\n        : result\n    },\n    ...(options ?? {}),\n  })\n\n  const createFindByIdQueryOptions = <T extends FeatureType = FeatureType>(\n    featureType: T,\n    id: string,\n    params: FindParams = {},\n    options: FeatureQueryOptions = {}\n  ): EnsureQueryDataOptions<FeatureResponseMap[T] | FeaturePopulatedResponseMap[T]> => ({\n    queryKey: [featureType, \"detail\", id, params] as const,\n    queryFn: async () => {\n      const feature = await internalFindById<T>(id)\n      return params.populate === true\n        ? await populator[featureType](feature)\n        : Promise.resolve(feature)\n    },\n    ...(options ?? {}),\n  })\n\n  async function filterByType<T extends FeatureType>(featureType: T, params: FilterParams & PopulatedParams): Promise<FeaturePopulatedResponseMap[T][]>\n  async function filterByType<T extends FeatureType>(featureType: T, params?: FilterParams): Promise<FeatureResponseMap[T][]>\n  async function filterByType<T extends FeatureType>(featureType: T, params?: FilterParams) {\n    const filterQueryOptions = createFilterByTypeQueryOptions<T>(\n      featureType,\n      params\n    )\n    const features = await queryClient.ensureQueryData(filterQueryOptions)\n    return (params?.populate === true) ? features as FeaturePopulatedResponseMap[T][] : features as FeatureResponseMap[T][]\n  }\n\n  async function findById<T extends FeatureType>(featureType: T, id: string, params: FindParams & PopulatedParams): Promise<FeaturePopulatedResponseMap[T]>\n  async function findById<T extends FeatureType>(featureType: T, id: string, params?: FindParams): Promise<FeatureResponseMap[T]>\n  async function findById<T extends FeatureType>( featureType: T, id: string, params?: FindParams) {\n    const findQueryOptions = createFindByIdQueryOptions<T>(\n      featureType,\n      id,\n      params\n    )\n    const feature = await queryClient.ensureQueryData(findQueryOptions)\n    return feature\n  }\n\n  const searchFn = async (txt: string): Promise<FuseResult<ImdfFeature>[]> => {\n    if (!searchClient) {\n      const [occupants, amenities] = await Promise.all([\n        filterByType(\"occupant\"),\n        filterByType(\"amenity\")\n      ])\n      const haystack = { occupants, amenities }\n      searchClient = getSearchClient(haystack)\n    }\n    return searchClient.search(txt)\n  }\n\n  return {\n    projectId,\n    queryClient,\n    registerObserver,\n    destroyObserver,\n    destroyObservers,\n    createFilterByTypeQueryOptions,\n    createFindByIdQueryOptions,\n    _internalFindById: internalFindById,\n    filterByType,\n    findById,\n    search: searchFn,\n  }\n}\n","import {\n  FeatureResponseMap,\n  FeaturePopulatedResponseMap,\n  InternalFindById,\n  InternalFilterByType,\n  SectionFeature,\n} from \"../types\"\nimport { compact } from '../utils/lodash'\n\nimport { center } from '@turf/center'\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { findContainingUnit } from \"../utils/findContaining\";\n\ntype CreatePopulatorOptions = {\n  internalFindById: InternalFindById\n  internalFilterByType: InternalFilterByType\n}\n\ntype PopulatableFeatureType = Extract<\n  keyof FeatureResponseMap,\n  keyof FeaturePopulatedResponseMap\n>\ntype PopulatorFn<T extends PopulatableFeatureType> = (\n  f: FeatureResponseMap[T]\n) => Promise<FeaturePopulatedResponseMap[T]>\n\nexport type Populator = {\n  [K in PopulatableFeatureType]?: PopulatorFn<K>\n}\n\nexport const createPopulator = ({\n  internalFindById,\n  internalFilterByType,\n}: CreatePopulatorOptions): Populator => {\n  const populateAddress: PopulatorFn<\"address\"> = (address) =>\n    Promise.resolve(address)\n  const populateBuilding: PopulatorFn<\"building\"> = (building) =>\n    Promise.resolve(building)\n  const populateDetail: PopulatorFn<\"detail\"> = (detail) =>\n    Promise.resolve(detail)\n  const populateFootprint: PopulatorFn<\"footprint\"> = (footprint) =>\n    Promise.resolve(footprint)\n  const populateGeofence: PopulatorFn<\"geofence\"> = (geofence) =>\n    Promise.resolve(geofence)\n\n  const populatePrivilege: PopulatorFn<\"privilege\"> = (privilege) =>\n    Promise.resolve(privilege)\n  const populateEvent: PopulatorFn<\"event\"> = (event) => Promise.resolve(event)\n\n  const populatePromotion: PopulatorFn<\"promotion\"> = async (promotion) => {\n    const venue = await internalFindById<\"venue\">(promotion.properties.venue_id)\n    return {\n      ...promotion,\n      properties: {\n        ...promotion.properties,\n        venue,\n      },\n    }\n  }\n\n  const populateAmenity: PopulatorFn<\"amenity\"> = async (amenity) => {\n    const units = await Promise.all(\n      amenity.properties.unit_ids.map(internalFindById<\"unit\">)\n    )\n\n    const populatedUnits = await Promise.all(units.map(populateUnit))\n\n    const venue = await internalFindById<\"venue\">(amenity.properties.venue_id)\n\n    const defaultLevel = populatedUnits[0].properties.level\n\n    const kiosks = await internalFilterByType<\"kiosk\">(\"kiosk\")\n    const ordinalKiosks = kiosks.filter(\n      (kiosk) => kiosk.properties.level_id === defaultLevel.id\n    )\n    const kiosk = ordinalKiosks.find((kiosk) => booleanPointInPolygon(amenity, kiosk))\n    return {\n      ...amenity,\n      properties: {\n        ...amenity.properties,\n        ordinal: defaultLevel.properties.ordinal,\n        level_name: defaultLevel.properties.name.en,\n        level: defaultLevel,\n        units: populatedUnits,\n        venue,\n        _experimental_kiosk: kiosk ? await populateKiosk(kiosk) : null,\n      },\n    }\n  }\n\n  const populateAnchor: PopulatorFn<\"anchor\"> = async (anchor) => {\n    const unit = await internalFindById<\"unit\">(anchor.properties.unit_id)\n    const venue = await internalFindById<\"venue\">(unit.properties.venue_id)\n    const level = await internalFindById<\"level\">(unit.properties.level_id)\n\n    const sections = await internalFilterByType<\"section\">(\"section\")\n    const section = sections.find((section) => booleanPointInPolygon(anchor, section))\n\n    return {\n      ...anchor,\n      properties: {\n        ...anchor.properties,\n        level: await populateLevel(level),\n        unit: await populateUnit(unit),\n        section: section ? await populateSection(section) : null,\n        venue: await populateVenue(venue),\n        ordinal: level.properties.ordinal,\n      },\n    }\n  }\n\n  const populateFixture: PopulatorFn<\"fixture\"> = async (fixture) => {\n    const level = await internalFindById<\"level\">(fixture.properties.level_id)\n    const venue = await internalFindById<\"venue\">(fixture.properties.venue_id)\n    const anchor = await internalFindById<\"anchor\">(fixture.properties.anchor_id)\n\n    return {\n      ...fixture,\n      properties: {\n        ...fixture.properties,\n        anchor: anchor ? await populateAnchor(anchor) : null,\n        level: await populateLevel(level),\n        venue: await populateVenue(venue),\n        ordinal: level.properties.ordinal,\n      }\n    }\n  }\n\n  const populateKiosk: PopulatorFn<\"kiosk\"> = async (kiosk) => {\n    const level = await internalFindById<\"level\">(kiosk.properties.level_id)\n    const venue = await internalFindById<\"venue\">(kiosk.properties.venue_id)\n    const anchor = await internalFindById<\"anchor\">(kiosk.properties.anchor_id)\n\n    // Find Kiosk's Unit\n    const units = await internalFilterByType<\"unit\">(\"unit\")\n    const unit = findContainingUnit(kiosk, units.filter(unit => unit.properties.category === \"walkway\"))\n\n    let section: SectionFeature | null = null\n\n    if (anchor) {\n      const sections = await internalFilterByType<\"section\">(\"section\")\n      section = sections.find((section) => booleanPointInPolygon(anchor, section))\n    }\n\n    return {\n      ...kiosk,\n      properties: {\n        ...kiosk.properties,\n        anchor: anchor ? await populateAnchor(anchor) : null,\n        level: await populateLevel(level),\n        venue: await populateVenue(venue),\n        ordinal: level.properties.ordinal,\n\n        unit: unit ? await populateUnit(unit) : null,\n        section: section ? await populateSection(section) : null,\n      },\n    }\n  }\n\n  const populateLevel: PopulatorFn<\"level\"> = async (level) => {\n    const venue = await internalFindById<\"venue\">(level.properties.venue_id)\n    return {\n      ...level,\n      properties: {\n        ...level.properties,\n        venue,\n      },\n    }\n  }\n\n  const populateOccupant: PopulatorFn<\"occupant\"> = async (occupant) => {\n    const {\n      anchor_id,\n      venue_id,\n      local_category_ids,\n      promotion_ids = [],\n      privilege_ids = [],\n      kiosk_id,\n      unit_id,\n      kiosk_ids = [],\n      unit_ids = [],\n    } = occupant.properties\n    const anchor = await internalFindById<\"anchor\">(anchor_id)\n    const venue = await internalFindById<\"venue\">(venue_id)\n\n    const localCategories = await Promise.all(\n      local_category_ids.map(internalFindById<\"taxonomy\">)\n    )\n    const promotions = await Promise.all(\n      promotion_ids.map(internalFindById<\"promotion\">)\n    )\n    const privileges = await Promise.all(\n      privilege_ids.map(internalFindById<\"privilege\">)\n    )\n    const kiosk = await internalFindById<\"kiosk\">(kiosk_id)\n    const unit = await internalFindById<\"unit\">(unit_id)\n\n    const kiosks = await Promise.all(kiosk_ids.map(internalFindById<\"kiosk\">))\n    const units = await Promise.all(unit_ids.map(internalFindById<\"unit\">))\n    return {\n      ...occupant,\n      properties: {\n        ...occupant.properties,\n        anchor: anchor ? await populateAnchor(anchor) : null,\n        local_categories: await Promise.all(\n          compact(localCategories).map(populateTaxonomy)\n        ),\n        venue,\n        promotions,\n        privileges,\n\n        kiosk: kiosk ? await populateKiosk(kiosk) : null,\n        unit: unit ? await populateUnit(unit) : null,\n        kiosks: await Promise.all(kiosks.map(populateKiosk)),\n        units: await Promise.all(units.map(populateUnit)),\n      },\n    }\n  }\n\n  const populateOpening: PopulatorFn<\"opening\"> = async (opening) => {\n    const venue = await internalFindById<\"venue\">(opening.properties.venue_id)\n    const level = await internalFindById<\"level\">(opening.properties.level_id)\n    return {\n      ...opening,\n      properties: {\n        venue,\n        level: await populateLevel(level),\n        ordinal: level.properties.ordinal,\n      }\n    }\n  }\n\n  const populateRelationship: PopulatorFn<\"relationship\"> = async (relationship) => {\n    const originId = relationship.properties.origin?.id\n    const destinationId = relationship.properties.destination?.id\n    const origin = originId ? await internalFindById<\"opening\" | \"unit\">(originId) : null\n    const destination = destinationId ? await internalFindById<\"opening\" | \"unit\">(destinationId) : null\n    const intermediary_ids = (relationship.properties.intermediary || []).map(({ id }) => id)\n    const intermediary = await Promise.all(intermediary_ids.map(internalFindById<\"opening\" | \"unit\">))\n\n    return {\n      ...relationship,\n      properties: {\n        ...relationship.properties,\n        origin,\n        destination,\n        intermediary,\n      }\n    }\n  }\n\n  const populateSection: PopulatorFn<\"section\"> = async (section) => {\n    const venue = await internalFindById<\"venue\">(section.properties.venue_id)\n    const level = await internalFindById<\"level\">(section.properties.level_id)\n    return {\n      ...section,\n      properties: {\n        ...section.properties,\n        venue,\n        level: await populateLevel(level),\n        ordinal: level.properties.ordinal,\n      },\n    }\n  }\n\n  const populateUnit: PopulatorFn<\"unit\"> = async (unit) => {\n    const venue = await internalFindById<\"venue\">(unit.properties.venue_id)\n    const level = await internalFindById<\"level\">(unit.properties.level_id)\n\n    const sections = await internalFilterByType<\"section\">(\"section\")\n    try {\n      const section = unit.geometry.type !== 'MultiPolygon' ? sections.find((section) => booleanPointInPolygon(center(unit), section)) : null\n      return {\n        ...unit,\n        properties: {\n          ...unit.properties,\n          venue,\n          ordinal: level.properties.ordinal,\n          level: await populateLevel(level),\n          section: section ? await populateSection(section) : null,\n        },\n      }\n    } catch (err) {\n      console.log(`error finding section `, { unit, sections })\n    }\n  }\n\n  const populateVenue: PopulatorFn<\"venue\"> = (venue) => {\n    return Promise.resolve(venue)\n  }\n\n  const populateTaxonomy: PopulatorFn<\"taxonomy\"> = async (taxonomy) => {\n    const venue = await internalFindById<\"venue\">(taxonomy.properties.venue_id)\n    return {\n      ...taxonomy,\n      properties: {\n        ...taxonomy.properties,\n        venue: venue ? await populateVenue(venue) : null,\n      },\n    }\n  }\n\n  const populateModel3D: PopulatorFn<\"model3d\"> = async (model3d) => {\n    const level = await internalFindById<\"level\">(model3d.properties.level_id)\n    try {\n      return {\n        ...model3d,\n        properties: {\n          ...model3d.properties,\n          level: await populateLevel(level),\n        },\n      }\n    } catch (err) {\n      console.log(`error finding level`, { model3d, level })\n    }\n  }\n\n  const populateFeature = (feature) => Promise.resolve(feature)\n\n  return {\n    address: populateAddress,\n    building: populateBuilding,\n    detail: populateDetail,\n    fixture: populateFixture,\n    footprint: populateFootprint,\n    geofence: populateGeofence,\n    opening: populateOpening,\n    relationship: populateRelationship,\n    privilege: populatePrivilege,\n    promotion: populatePromotion,\n    event: populateEvent,\n    label: populateFeature,\n    element: populateFeature,\n    page: populateFeature,\n\n    amenity: populateAmenity,\n    anchor: populateAnchor,\n    kiosk: populateKiosk,\n    level: populateLevel,\n    occupant: populateOccupant,\n    section: populateSection,\n    unit: populateUnit,\n    venue: populateVenue,\n    taxonomy: populateTaxonomy,\n\n    model3d: populateModel3D,\n  }\n}\n","import { center } from '@turf/center'\nimport { booleanPointInPolygon } from \"@turf/boolean-point-in-polygon\";\nimport { AmenityFeature, KioskFeature, UnitFeature } from \"../types\"\n\nexport const findContainingUnit = (poi: KioskFeature | AmenityFeature, units: UnitFeature[]): UnitFeature | null => {\n  const unit = units.find(\n    (unit) => {\n      try {\n        return unit.properties.level_id === poi.properties.level_id\n          && booleanPointInPolygon(center(poi), unit)\n      } catch (e) {\n        console.log(`Cannot find containing unit of (${poi.id}):`, e.message)\n        return false\n      }\n    }\n  )\n  return unit\n}\n","/**\n * Fuse.js v7.1.0 - Lightweight fuzzy-search (http://fusejs.io)\n *\n * Copyright (c) 2025 Kiro Risk (http://kiro.me)\n * All Rights Reserved. Apache Software License 2.0\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n */\n\nfunction isArray(value) {\n  return !Array.isArray\n    ? getTag(value) === '[object Array]'\n    : Array.isArray(value)\n}\n\n// Adapted from: https://github.com/lodash/lodash/blob/master/.internal/baseToString.js\nconst INFINITY = 1 / 0;\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value\n  }\n  let result = value + '';\n  return result == '0' && 1 / value == -INFINITY ? '-0' : result\n}\n\nfunction toString(value) {\n  return value == null ? '' : baseToString(value)\n}\n\nfunction isString(value) {\n  return typeof value === 'string'\n}\n\nfunction isNumber(value) {\n  return typeof value === 'number'\n}\n\n// Adapted from: https://github.com/lodash/lodash/blob/master/isBoolean.js\nfunction isBoolean(value) {\n  return (\n    value === true ||\n    value === false ||\n    (isObjectLike(value) && getTag(value) == '[object Boolean]')\n  )\n}\n\nfunction isObject(value) {\n  return typeof value === 'object'\n}\n\n// Checks if `value` is object-like.\nfunction isObjectLike(value) {\n  return isObject(value) && value !== null\n}\n\nfunction isDefined(value) {\n  return value !== undefined && value !== null\n}\n\nfunction isBlank(value) {\n  return !value.trim().length\n}\n\n// Gets the `toStringTag` of `value`.\n// Adapted from: https://github.com/lodash/lodash/blob/master/.internal/getTag.js\nfunction getTag(value) {\n  return value == null\n    ? value === undefined\n      ? '[object Undefined]'\n      : '[object Null]'\n    : Object.prototype.toString.call(value)\n}\n\nconst EXTENDED_SEARCH_UNAVAILABLE = 'Extended search is not available';\n\nconst INCORRECT_INDEX_TYPE = \"Incorrect 'index' type\";\n\nconst LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY = (key) =>\n  `Invalid value for key ${key}`;\n\nconst PATTERN_LENGTH_TOO_LARGE = (max) =>\n  `Pattern length exceeds max of ${max}.`;\n\nconst MISSING_KEY_PROPERTY = (name) => `Missing ${name} property in key`;\n\nconst INVALID_KEY_WEIGHT_VALUE = (key) =>\n  `Property 'weight' in key '${key}' must be a positive integer`;\n\nconst hasOwn = Object.prototype.hasOwnProperty;\n\nclass KeyStore {\n  constructor(keys) {\n    this._keys = [];\n    this._keyMap = {};\n\n    let totalWeight = 0;\n\n    keys.forEach((key) => {\n      let obj = createKey(key);\n\n      this._keys.push(obj);\n      this._keyMap[obj.id] = obj;\n\n      totalWeight += obj.weight;\n    });\n\n    // Normalize weights so that their sum is equal to 1\n    this._keys.forEach((key) => {\n      key.weight /= totalWeight;\n    });\n  }\n  get(keyId) {\n    return this._keyMap[keyId]\n  }\n  keys() {\n    return this._keys\n  }\n  toJSON() {\n    return JSON.stringify(this._keys)\n  }\n}\n\nfunction createKey(key) {\n  let path = null;\n  let id = null;\n  let src = null;\n  let weight = 1;\n  let getFn = null;\n\n  if (isString(key) || isArray(key)) {\n    src = key;\n    path = createKeyPath(key);\n    id = createKeyId(key);\n  } else {\n    if (!hasOwn.call(key, 'name')) {\n      throw new Error(MISSING_KEY_PROPERTY('name'))\n    }\n\n    const name = key.name;\n    src = name;\n\n    if (hasOwn.call(key, 'weight')) {\n      weight = key.weight;\n\n      if (weight <= 0) {\n        throw new Error(INVALID_KEY_WEIGHT_VALUE(name))\n      }\n    }\n\n    path = createKeyPath(name);\n    id = createKeyId(name);\n    getFn = key.getFn;\n  }\n\n  return { path, id, weight, src, getFn }\n}\n\nfunction createKeyPath(key) {\n  return isArray(key) ? key : key.split('.')\n}\n\nfunction createKeyId(key) {\n  return isArray(key) ? key.join('.') : key\n}\n\nfunction get(obj, path) {\n  let list = [];\n  let arr = false;\n\n  const deepGet = (obj, path, index) => {\n    if (!isDefined(obj)) {\n      return\n    }\n    if (!path[index]) {\n      // If there's no path left, we've arrived at the object we care about.\n      list.push(obj);\n    } else {\n      let key = path[index];\n\n      const value = obj[key];\n\n      if (!isDefined(value)) {\n        return\n      }\n\n      // If we're at the last value in the path, and if it's a string/number/bool,\n      // add it to the list\n      if (\n        index === path.length - 1 &&\n        (isString(value) || isNumber(value) || isBoolean(value))\n      ) {\n        list.push(toString(value));\n      } else if (isArray(value)) {\n        arr = true;\n        // Search each item in the array.\n        for (let i = 0, len = value.length; i < len; i += 1) {\n          deepGet(value[i], path, index + 1);\n        }\n      } else if (path.length) {\n        // An object. Recurse further.\n        deepGet(value, path, index + 1);\n      }\n    }\n  };\n\n  // Backwards compatibility (since path used to be a string)\n  deepGet(obj, isString(path) ? path.split('.') : path, 0);\n\n  return arr ? list : list[0]\n}\n\nconst MatchOptions = {\n  // Whether the matches should be included in the result set. When `true`, each record in the result\n  // set will include the indices of the matched characters.\n  // These can consequently be used for highlighting purposes.\n  includeMatches: false,\n  // When `true`, the matching function will continue to the end of a search pattern even if\n  // a perfect match has already been located in the string.\n  findAllMatches: false,\n  // Minimum number of characters that must be matched before a result is considered a match\n  minMatchCharLength: 1\n};\n\nconst BasicOptions = {\n  // When `true`, the algorithm continues searching to the end of the input even if a perfect\n  // match is found before the end of the same input.\n  isCaseSensitive: false,\n  // When `true`, the algorithm will ignore diacritics (accents) in comparisons\n  ignoreDiacritics: false,\n  // When true, the matching function will continue to the end of a search pattern even if\n  includeScore: false,\n  // List of properties that will be searched. This also supports nested properties.\n  keys: [],\n  // Whether to sort the result list, by score\n  shouldSort: true,\n  // Default sort function: sort by ascending score, ascending index\n  sortFn: (a, b) =>\n    a.score === b.score ? (a.idx < b.idx ? -1 : 1) : a.score < b.score ? -1 : 1\n};\n\nconst FuzzyOptions = {\n  // Approximately where in the text is the pattern expected to be found?\n  location: 0,\n  // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match\n  // (of both letters and location), a threshold of '1.0' would match anything.\n  threshold: 0.6,\n  // Determines how close the match must be to the fuzzy location (specified above).\n  // An exact letter match which is 'distance' characters away from the fuzzy location\n  // would score as a complete mismatch. A distance of '0' requires the match be at\n  // the exact location specified, a threshold of '1000' would require a perfect match\n  // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.\n  distance: 100\n};\n\nconst AdvancedOptions = {\n  // When `true`, it enables the use of unix-like search commands\n  useExtendedSearch: false,\n  // The get function to use when fetching an object's properties.\n  // The default will search nested paths *ie foo.bar.baz*\n  getFn: get,\n  // When `true`, search will ignore `location` and `distance`, so it won't matter\n  // where in the string the pattern appears.\n  // More info: https://fusejs.io/concepts/scoring-theory.html#fuzziness-score\n  ignoreLocation: false,\n  // When `true`, the calculation for the relevance score (used for sorting) will\n  // ignore the field-length norm.\n  // More info: https://fusejs.io/concepts/scoring-theory.html#field-length-norm\n  ignoreFieldNorm: false,\n  // The weight to determine how much field length norm effects scoring.\n  fieldNormWeight: 1\n};\n\nvar Config = {\n  ...BasicOptions,\n  ...MatchOptions,\n  ...FuzzyOptions,\n  ...AdvancedOptions\n};\n\nconst SPACE = /[^ ]+/g;\n\n// Field-length norm: the shorter the field, the higher the weight.\n// Set to 3 decimals to reduce index size.\nfunction norm(weight = 1, mantissa = 3) {\n  const cache = new Map();\n  const m = Math.pow(10, mantissa);\n\n  return {\n    get(value) {\n      const numTokens = value.match(SPACE).length;\n\n      if (cache.has(numTokens)) {\n        return cache.get(numTokens)\n      }\n\n      // Default function is 1/sqrt(x), weight makes that variable\n      const norm = 1 / Math.pow(numTokens, 0.5 * weight);\n\n      // In place of `toFixed(mantissa)`, for faster computation\n      const n = parseFloat(Math.round(norm * m) / m);\n\n      cache.set(numTokens, n);\n\n      return n\n    },\n    clear() {\n      cache.clear();\n    }\n  }\n}\n\nclass FuseIndex {\n  constructor({\n    getFn = Config.getFn,\n    fieldNormWeight = Config.fieldNormWeight\n  } = {}) {\n    this.norm = norm(fieldNormWeight, 3);\n    this.getFn = getFn;\n    this.isCreated = false;\n\n    this.setIndexRecords();\n  }\n  setSources(docs = []) {\n    this.docs = docs;\n  }\n  setIndexRecords(records = []) {\n    this.records = records;\n  }\n  setKeys(keys = []) {\n    this.keys = keys;\n    this._keysMap = {};\n    keys.forEach((key, idx) => {\n      this._keysMap[key.id] = idx;\n    });\n  }\n  create() {\n    if (this.isCreated || !this.docs.length) {\n      return\n    }\n\n    this.isCreated = true;\n\n    // List is Array<String>\n    if (isString(this.docs[0])) {\n      this.docs.forEach((doc, docIndex) => {\n        this._addString(doc, docIndex);\n      });\n    } else {\n      // List is Array<Object>\n      this.docs.forEach((doc, docIndex) => {\n        this._addObject(doc, docIndex);\n      });\n    }\n\n    this.norm.clear();\n  }\n  // Adds a doc to the end of the index\n  add(doc) {\n    const idx = this.size();\n\n    if (isString(doc)) {\n      this._addString(doc, idx);\n    } else {\n      this._addObject(doc, idx);\n    }\n  }\n  // Removes the doc at the specified index of the index\n  removeAt(idx) {\n    this.records.splice(idx, 1);\n\n    // Change ref index of every subsquent doc\n    for (let i = idx, len = this.size(); i < len; i += 1) {\n      this.records[i].i -= 1;\n    }\n  }\n  getValueForItemAtKeyId(item, keyId) {\n    return item[this._keysMap[keyId]]\n  }\n  size() {\n    return this.records.length\n  }\n  _addString(doc, docIndex) {\n    if (!isDefined(doc) || isBlank(doc)) {\n      return\n    }\n\n    let record = {\n      v: doc,\n      i: docIndex,\n      n: this.norm.get(doc)\n    };\n\n    this.records.push(record);\n  }\n  _addObject(doc, docIndex) {\n    let record = { i: docIndex, $: {} };\n\n    // Iterate over every key (i.e, path), and fetch the value at that key\n    this.keys.forEach((key, keyIndex) => {\n      let value = key.getFn ? key.getFn(doc) : this.getFn(doc, key.path);\n\n      if (!isDefined(value)) {\n        return\n      }\n\n      if (isArray(value)) {\n        let subRecords = [];\n        const stack = [{ nestedArrIndex: -1, value }];\n\n        while (stack.length) {\n          const { nestedArrIndex, value } = stack.pop();\n\n          if (!isDefined(value)) {\n            continue\n          }\n\n          if (isString(value) && !isBlank(value)) {\n            let subRecord = {\n              v: value,\n              i: nestedArrIndex,\n              n: this.norm.get(value)\n            };\n\n            subRecords.push(subRecord);\n          } else if (isArray(value)) {\n            value.forEach((item, k) => {\n              stack.push({\n                nestedArrIndex: k,\n                value: item\n              });\n            });\n          } else ;\n        }\n        record.$[keyIndex] = subRecords;\n      } else if (isString(value) && !isBlank(value)) {\n        let subRecord = {\n          v: value,\n          n: this.norm.get(value)\n        };\n\n        record.$[keyIndex] = subRecord;\n      }\n    });\n\n    this.records.push(record);\n  }\n  toJSON() {\n    return {\n      keys: this.keys,\n      records: this.records\n    }\n  }\n}\n\nfunction createIndex(\n  keys,\n  docs,\n  { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}\n) {\n  const myIndex = new FuseIndex({ getFn, fieldNormWeight });\n  myIndex.setKeys(keys.map(createKey));\n  myIndex.setSources(docs);\n  myIndex.create();\n  return myIndex\n}\n\nfunction parseIndex(\n  data,\n  { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}\n) {\n  const { keys, records } = data;\n  const myIndex = new FuseIndex({ getFn, fieldNormWeight });\n  myIndex.setKeys(keys);\n  myIndex.setIndexRecords(records);\n  return myIndex\n}\n\nfunction computeScore$1(\n  pattern,\n  {\n    errors = 0,\n    currentLocation = 0,\n    expectedLocation = 0,\n    distance = Config.distance,\n    ignoreLocation = Config.ignoreLocation\n  } = {}\n) {\n  const accuracy = errors / pattern.length;\n\n  if (ignoreLocation) {\n    return accuracy\n  }\n\n  const proximity = Math.abs(expectedLocation - currentLocation);\n\n  if (!distance) {\n    // Dodge divide by zero error.\n    return proximity ? 1.0 : accuracy\n  }\n\n  return accuracy + proximity / distance\n}\n\nfunction convertMaskToIndices(\n  matchmask = [],\n  minMatchCharLength = Config.minMatchCharLength\n) {\n  let indices = [];\n  let start = -1;\n  let end = -1;\n  let i = 0;\n\n  for (let len = matchmask.length; i < len; i += 1) {\n    let match = matchmask[i];\n    if (match && start === -1) {\n      start = i;\n    } else if (!match && start !== -1) {\n      end = i - 1;\n      if (end - start + 1 >= minMatchCharLength) {\n        indices.push([start, end]);\n      }\n      start = -1;\n    }\n  }\n\n  // (i-1 - start) + 1 => i - start\n  if (matchmask[i - 1] && i - start >= minMatchCharLength) {\n    indices.push([start, i - 1]);\n  }\n\n  return indices\n}\n\n// Machine word size\nconst MAX_BITS = 32;\n\nfunction search(\n  text,\n  pattern,\n  patternAlphabet,\n  {\n    location = Config.location,\n    distance = Config.distance,\n    threshold = Config.threshold,\n    findAllMatches = Config.findAllMatches,\n    minMatchCharLength = Config.minMatchCharLength,\n    includeMatches = Config.includeMatches,\n    ignoreLocation = Config.ignoreLocation\n  } = {}\n) {\n  if (pattern.length > MAX_BITS) {\n    throw new Error(PATTERN_LENGTH_TOO_LARGE(MAX_BITS))\n  }\n\n  const patternLen = pattern.length;\n  // Set starting location at beginning text and initialize the alphabet.\n  const textLen = text.length;\n  // Handle the case when location > text.length\n  const expectedLocation = Math.max(0, Math.min(location, textLen));\n  // Highest score beyond which we give up.\n  let currentThreshold = threshold;\n  // Is there a nearby exact match? (speedup)\n  let bestLocation = expectedLocation;\n\n  // Performance: only computer matches when the minMatchCharLength > 1\n  // OR if `includeMatches` is true.\n  const computeMatches = minMatchCharLength > 1 || includeMatches;\n  // A mask of the matches, used for building the indices\n  const matchMask = computeMatches ? Array(textLen) : [];\n\n  let index;\n\n  // Get all exact matches, here for speed up\n  while ((index = text.indexOf(pattern, bestLocation)) > -1) {\n    let score = computeScore$1(pattern, {\n      currentLocation: index,\n      expectedLocation,\n      distance,\n      ignoreLocation\n    });\n\n    currentThreshold = Math.min(score, currentThreshold);\n    bestLocation = index + patternLen;\n\n    if (computeMatches) {\n      let i = 0;\n      while (i < patternLen) {\n        matchMask[index + i] = 1;\n        i += 1;\n      }\n    }\n  }\n\n  // Reset the best location\n  bestLocation = -1;\n\n  let lastBitArr = [];\n  let finalScore = 1;\n  let binMax = patternLen + textLen;\n\n  const mask = 1 << (patternLen - 1);\n\n  for (let i = 0; i < patternLen; i += 1) {\n    // Scan for the best match; each iteration allows for one more error.\n    // Run a binary search to determine how far from the match location we can stray\n    // at this error level.\n    let binMin = 0;\n    let binMid = binMax;\n\n    while (binMin < binMid) {\n      const score = computeScore$1(pattern, {\n        errors: i,\n        currentLocation: expectedLocation + binMid,\n        expectedLocation,\n        distance,\n        ignoreLocation\n      });\n\n      if (score <= currentThreshold) {\n        binMin = binMid;\n      } else {\n        binMax = binMid;\n      }\n\n      binMid = Math.floor((binMax - binMin) / 2 + binMin);\n    }\n\n    // Use the result from this iteration as the maximum for the next.\n    binMax = binMid;\n\n    let start = Math.max(1, expectedLocation - binMid + 1);\n    let finish = findAllMatches\n      ? textLen\n      : Math.min(expectedLocation + binMid, textLen) + patternLen;\n\n    // Initialize the bit array\n    let bitArr = Array(finish + 2);\n\n    bitArr[finish + 1] = (1 << i) - 1;\n\n    for (let j = finish; j >= start; j -= 1) {\n      let currentLocation = j - 1;\n      let charMatch = patternAlphabet[text.charAt(currentLocation)];\n\n      if (computeMatches) {\n        // Speed up: quick bool to int conversion (i.e, `charMatch ? 1 : 0`)\n        matchMask[currentLocation] = +!!charMatch;\n      }\n\n      // First pass: exact match\n      bitArr[j] = ((bitArr[j + 1] << 1) | 1) & charMatch;\n\n      // Subsequent passes: fuzzy match\n      if (i) {\n        bitArr[j] |=\n          ((lastBitArr[j + 1] | lastBitArr[j]) << 1) | 1 | lastBitArr[j + 1];\n      }\n\n      if (bitArr[j] & mask) {\n        finalScore = computeScore$1(pattern, {\n          errors: i,\n          currentLocation,\n          expectedLocation,\n          distance,\n          ignoreLocation\n        });\n\n        // This match will almost certainly be better than any existing match.\n        // But check anyway.\n        if (finalScore <= currentThreshold) {\n          // Indeed it is\n          currentThreshold = finalScore;\n          bestLocation = currentLocation;\n\n          // Already passed `loc`, downhill from here on in.\n          if (bestLocation <= expectedLocation) {\n            break\n          }\n\n          // When passing `bestLocation`, don't exceed our current distance from `expectedLocation`.\n          start = Math.max(1, 2 * expectedLocation - bestLocation);\n        }\n      }\n    }\n\n    // No hope for a (better) match at greater error levels.\n    const score = computeScore$1(pattern, {\n      errors: i + 1,\n      currentLocation: expectedLocation,\n      expectedLocation,\n      distance,\n      ignoreLocation\n    });\n\n    if (score > currentThreshold) {\n      break\n    }\n\n    lastBitArr = bitArr;\n  }\n\n  const result = {\n    isMatch: bestLocation >= 0,\n    // Count exact matches (those with a score of 0) to be \"almost\" exact\n    score: Math.max(0.001, finalScore)\n  };\n\n  if (computeMatches) {\n    const indices = convertMaskToIndices(matchMask, minMatchCharLength);\n    if (!indices.length) {\n      result.isMatch = false;\n    } else if (includeMatches) {\n      result.indices = indices;\n    }\n  }\n\n  return result\n}\n\nfunction createPatternAlphabet(pattern) {\n  let mask = {};\n\n  for (let i = 0, len = pattern.length; i < len; i += 1) {\n    const char = pattern.charAt(i);\n    mask[char] = (mask[char] || 0) | (1 << (len - i - 1));\n  }\n\n  return mask\n}\n\nconst stripDiacritics = String.prototype.normalize\n    ? ((str) => str.normalize('NFD').replace(/[\\u0300-\\u036F\\u0483-\\u0489\\u0591-\\u05BD\\u05BF\\u05C1\\u05C2\\u05C4\\u05C5\\u05C7\\u0610-\\u061A\\u064B-\\u065F\\u0670\\u06D6-\\u06DC\\u06DF-\\u06E4\\u06E7\\u06E8\\u06EA-\\u06ED\\u0711\\u0730-\\u074A\\u07A6-\\u07B0\\u07EB-\\u07F3\\u07FD\\u0816-\\u0819\\u081B-\\u0823\\u0825-\\u0827\\u0829-\\u082D\\u0859-\\u085B\\u08D3-\\u08E1\\u08E3-\\u0903\\u093A-\\u093C\\u093E-\\u094F\\u0951-\\u0957\\u0962\\u0963\\u0981-\\u0983\\u09BC\\u09BE-\\u09C4\\u09C7\\u09C8\\u09CB-\\u09CD\\u09D7\\u09E2\\u09E3\\u09FE\\u0A01-\\u0A03\\u0A3C\\u0A3E-\\u0A42\\u0A47\\u0A48\\u0A4B-\\u0A4D\\u0A51\\u0A70\\u0A71\\u0A75\\u0A81-\\u0A83\\u0ABC\\u0ABE-\\u0AC5\\u0AC7-\\u0AC9\\u0ACB-\\u0ACD\\u0AE2\\u0AE3\\u0AFA-\\u0AFF\\u0B01-\\u0B03\\u0B3C\\u0B3E-\\u0B44\\u0B47\\u0B48\\u0B4B-\\u0B4D\\u0B56\\u0B57\\u0B62\\u0B63\\u0B82\\u0BBE-\\u0BC2\\u0BC6-\\u0BC8\\u0BCA-\\u0BCD\\u0BD7\\u0C00-\\u0C04\\u0C3E-\\u0C44\\u0C46-\\u0C48\\u0C4A-\\u0C4D\\u0C55\\u0C56\\u0C62\\u0C63\\u0C81-\\u0C83\\u0CBC\\u0CBE-\\u0CC4\\u0CC6-\\u0CC8\\u0CCA-\\u0CCD\\u0CD5\\u0CD6\\u0CE2\\u0CE3\\u0D00-\\u0D03\\u0D3B\\u0D3C\\u0D3E-\\u0D44\\u0D46-\\u0D48\\u0D4A-\\u0D4D\\u0D57\\u0D62\\u0D63\\u0D82\\u0D83\\u0DCA\\u0DCF-\\u0DD4\\u0DD6\\u0DD8-\\u0DDF\\u0DF2\\u0DF3\\u0E31\\u0E34-\\u0E3A\\u0E47-\\u0E4E\\u0EB1\\u0EB4-\\u0EB9\\u0EBB\\u0EBC\\u0EC8-\\u0ECD\\u0F18\\u0F19\\u0F35\\u0F37\\u0F39\\u0F3E\\u0F3F\\u0F71-\\u0F84\\u0F86\\u0F87\\u0F8D-\\u0F97\\u0F99-\\u0FBC\\u0FC6\\u102B-\\u103E\\u1056-\\u1059\\u105E-\\u1060\\u1062-\\u1064\\u1067-\\u106D\\u1071-\\u1074\\u1082-\\u108D\\u108F\\u109A-\\u109D\\u135D-\\u135F\\u1712-\\u1714\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17B4-\\u17D3\\u17DD\\u180B-\\u180D\\u1885\\u1886\\u18A9\\u1920-\\u192B\\u1930-\\u193B\\u1A17-\\u1A1B\\u1A55-\\u1A5E\\u1A60-\\u1A7C\\u1A7F\\u1AB0-\\u1ABE\\u1B00-\\u1B04\\u1B34-\\u1B44\\u1B6B-\\u1B73\\u1B80-\\u1B82\\u1BA1-\\u1BAD\\u1BE6-\\u1BF3\\u1C24-\\u1C37\\u1CD0-\\u1CD2\\u1CD4-\\u1CE8\\u1CED\\u1CF2-\\u1CF4\\u1CF7-\\u1CF9\\u1DC0-\\u1DF9\\u1DFB-\\u1DFF\\u20D0-\\u20F0\\u2CEF-\\u2CF1\\u2D7F\\u2DE0-\\u2DFF\\u302A-\\u302F\\u3099\\u309A\\uA66F-\\uA672\\uA674-\\uA67D\\uA69E\\uA69F\\uA6F0\\uA6F1\\uA802\\uA806\\uA80B\\uA823-\\uA827\\uA880\\uA881\\uA8B4-\\uA8C5\\uA8E0-\\uA8F1\\uA8FF\\uA926-\\uA92D\\uA947-\\uA953\\uA980-\\uA983\\uA9B3-\\uA9C0\\uA9E5\\uAA29-\\uAA36\\uAA43\\uAA4C\\uAA4D\\uAA7B-\\uAA7D\\uAAB0\\uAAB2-\\uAAB4\\uAAB7\\uAAB8\\uAABE\\uAABF\\uAAC1\\uAAEB-\\uAAEF\\uAAF5\\uAAF6\\uABE3-\\uABEA\\uABEC\\uABED\\uFB1E\\uFE00-\\uFE0F\\uFE20-\\uFE2F]/g, ''))\n    : ((str) => str);\n\nclass BitapSearch {\n  constructor(\n    pattern,\n    {\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance,\n      includeMatches = Config.includeMatches,\n      findAllMatches = Config.findAllMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      isCaseSensitive = Config.isCaseSensitive,\n      ignoreDiacritics = Config.ignoreDiacritics,\n      ignoreLocation = Config.ignoreLocation\n    } = {}\n  ) {\n    this.options = {\n      location,\n      threshold,\n      distance,\n      includeMatches,\n      findAllMatches,\n      minMatchCharLength,\n      isCaseSensitive,\n      ignoreDiacritics,\n      ignoreLocation\n    };\n\n    pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n    pattern = ignoreDiacritics ? stripDiacritics(pattern) : pattern;\n    this.pattern = pattern;\n\n    this.chunks = [];\n\n    if (!this.pattern.length) {\n      return\n    }\n\n    const addChunk = (pattern, startIndex) => {\n      this.chunks.push({\n        pattern,\n        alphabet: createPatternAlphabet(pattern),\n        startIndex\n      });\n    };\n\n    const len = this.pattern.length;\n\n    if (len > MAX_BITS) {\n      let i = 0;\n      const remainder = len % MAX_BITS;\n      const end = len - remainder;\n\n      while (i < end) {\n        addChunk(this.pattern.substr(i, MAX_BITS), i);\n        i += MAX_BITS;\n      }\n\n      if (remainder) {\n        const startIndex = len - MAX_BITS;\n        addChunk(this.pattern.substr(startIndex), startIndex);\n      }\n    } else {\n      addChunk(this.pattern, 0);\n    }\n  }\n\n  searchIn(text) {\n    const { isCaseSensitive, ignoreDiacritics, includeMatches } = this.options;\n\n    text = isCaseSensitive ? text : text.toLowerCase();\n    text = ignoreDiacritics ? stripDiacritics(text) : text;\n\n    // Exact match\n    if (this.pattern === text) {\n      let result = {\n        isMatch: true,\n        score: 0\n      };\n\n      if (includeMatches) {\n        result.indices = [[0, text.length - 1]];\n      }\n\n      return result\n    }\n\n    // Otherwise, use Bitap algorithm\n    const {\n      location,\n      distance,\n      threshold,\n      findAllMatches,\n      minMatchCharLength,\n      ignoreLocation\n    } = this.options;\n\n    let allIndices = [];\n    let totalScore = 0;\n    let hasMatches = false;\n\n    this.chunks.forEach(({ pattern, alphabet, startIndex }) => {\n      const { isMatch, score, indices } = search(text, pattern, alphabet, {\n        location: location + startIndex,\n        distance,\n        threshold,\n        findAllMatches,\n        minMatchCharLength,\n        includeMatches,\n        ignoreLocation\n      });\n\n      if (isMatch) {\n        hasMatches = true;\n      }\n\n      totalScore += score;\n\n      if (isMatch && indices) {\n        allIndices = [...allIndices, ...indices];\n      }\n    });\n\n    let result = {\n      isMatch: hasMatches,\n      score: hasMatches ? totalScore / this.chunks.length : 1\n    };\n\n    if (hasMatches && includeMatches) {\n      result.indices = allIndices;\n    }\n\n    return result\n  }\n}\n\nclass BaseMatch {\n  constructor(pattern) {\n    this.pattern = pattern;\n  }\n  static isMultiMatch(pattern) {\n    return getMatch(pattern, this.multiRegex)\n  }\n  static isSingleMatch(pattern) {\n    return getMatch(pattern, this.singleRegex)\n  }\n  search(/*text*/) {}\n}\n\nfunction getMatch(pattern, exp) {\n  const matches = pattern.match(exp);\n  return matches ? matches[1] : null\n}\n\n// Token: 'file\n\nclass ExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'exact'\n  }\n  static get multiRegex() {\n    return /^=\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^=(.*)$/\n  }\n  search(text) {\n    const isMatch = text === this.pattern;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, this.pattern.length - 1]\n    }\n  }\n}\n\n// Token: !fire\n\nclass InverseExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-exact'\n  }\n  static get multiRegex() {\n    return /^!\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^!(.*)$/\n  }\n  search(text) {\n    const index = text.indexOf(this.pattern);\n    const isMatch = index === -1;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\n// Token: ^file\n\nclass PrefixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'prefix-exact'\n  }\n  static get multiRegex() {\n    return /^\\^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^\\^(.*)$/\n  }\n  search(text) {\n    const isMatch = text.startsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, this.pattern.length - 1]\n    }\n  }\n}\n\n// Token: !^fire\n\nclass InversePrefixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-prefix-exact'\n  }\n  static get multiRegex() {\n    return /^!\\^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^!\\^(.*)$/\n  }\n  search(text) {\n    const isMatch = !text.startsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\n// Token: .file$\n\nclass SuffixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'suffix-exact'\n  }\n  static get multiRegex() {\n    return /^\"(.*)\"\\$$/\n  }\n  static get singleRegex() {\n    return /^(.*)\\$$/\n  }\n  search(text) {\n    const isMatch = text.endsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [text.length - this.pattern.length, text.length - 1]\n    }\n  }\n}\n\n// Token: !.file$\n\nclass InverseSuffixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-suffix-exact'\n  }\n  static get multiRegex() {\n    return /^!\"(.*)\"\\$$/\n  }\n  static get singleRegex() {\n    return /^!(.*)\\$$/\n  }\n  search(text) {\n    const isMatch = !text.endsWith(this.pattern);\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\nclass FuzzyMatch extends BaseMatch {\n  constructor(\n    pattern,\n    {\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance,\n      includeMatches = Config.includeMatches,\n      findAllMatches = Config.findAllMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      isCaseSensitive = Config.isCaseSensitive,\n      ignoreDiacritics = Config.ignoreDiacritics,\n      ignoreLocation = Config.ignoreLocation\n    } = {}\n  ) {\n    super(pattern);\n    this._bitapSearch = new BitapSearch(pattern, {\n      location,\n      threshold,\n      distance,\n      includeMatches,\n      findAllMatches,\n      minMatchCharLength,\n      isCaseSensitive,\n      ignoreDiacritics,\n      ignoreLocation\n    });\n  }\n  static get type() {\n    return 'fuzzy'\n  }\n  static get multiRegex() {\n    return /^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^(.*)$/\n  }\n  search(text) {\n    return this._bitapSearch.searchIn(text)\n  }\n}\n\n// Token: 'file\n\nclass IncludeMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'include'\n  }\n  static get multiRegex() {\n    return /^'\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^'(.*)$/\n  }\n  search(text) {\n    let location = 0;\n    let index;\n\n    const indices = [];\n    const patternLen = this.pattern.length;\n\n    // Get all exact matches\n    while ((index = text.indexOf(this.pattern, location)) > -1) {\n      location = index + patternLen;\n      indices.push([index, location - 1]);\n    }\n\n    const isMatch = !!indices.length;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices\n    }\n  }\n}\n\n// ❗Order is important. DO NOT CHANGE.\nconst searchers = [\n  ExactMatch,\n  IncludeMatch,\n  PrefixExactMatch,\n  InversePrefixExactMatch,\n  InverseSuffixExactMatch,\n  SuffixExactMatch,\n  InverseExactMatch,\n  FuzzyMatch\n];\n\nconst searchersLen = searchers.length;\n\n// Regex to split by spaces, but keep anything in quotes together\nconst SPACE_RE = / +(?=(?:[^\\\"]*\\\"[^\\\"]*\\\")*[^\\\"]*$)/;\nconst OR_TOKEN = '|';\n\n// Return a 2D array representation of the query, for simpler parsing.\n// Example:\n// \"^core go$ | rb$ | py$ xy$\" => [[\"^core\", \"go$\"], [\"rb$\"], [\"py$\", \"xy$\"]]\nfunction parseQuery(pattern, options = {}) {\n  return pattern.split(OR_TOKEN).map((item) => {\n    let query = item\n      .trim()\n      .split(SPACE_RE)\n      .filter((item) => item && !!item.trim());\n\n    let results = [];\n    for (let i = 0, len = query.length; i < len; i += 1) {\n      const queryItem = query[i];\n\n      // 1. Handle multiple query match (i.e, once that are quoted, like `\"hello world\"`)\n      let found = false;\n      let idx = -1;\n      while (!found && ++idx < searchersLen) {\n        const searcher = searchers[idx];\n        let token = searcher.isMultiMatch(queryItem);\n        if (token) {\n          results.push(new searcher(token, options));\n          found = true;\n        }\n      }\n\n      if (found) {\n        continue\n      }\n\n      // 2. Handle single query matches (i.e, once that are *not* quoted)\n      idx = -1;\n      while (++idx < searchersLen) {\n        const searcher = searchers[idx];\n        let token = searcher.isSingleMatch(queryItem);\n        if (token) {\n          results.push(new searcher(token, options));\n          break\n        }\n      }\n    }\n\n    return results\n  })\n}\n\n// These extended matchers can return an array of matches, as opposed\n// to a singl match\nconst MultiMatchSet = new Set([FuzzyMatch.type, IncludeMatch.type]);\n\n/**\n * Command-like searching\n * ======================\n *\n * Given multiple search terms delimited by spaces.e.g. `^jscript .python$ ruby !java`,\n * search in a given text.\n *\n * Search syntax:\n *\n * | Token       | Match type                 | Description                            |\n * | ----------- | -------------------------- | -------------------------------------- |\n * | `jscript`   | fuzzy-match                | Items that fuzzy match `jscript`       |\n * | `=scheme`   | exact-match                | Items that are `scheme`                |\n * | `'python`   | include-match              | Items that include `python`            |\n * | `!ruby`     | inverse-exact-match        | Items that do not include `ruby`       |\n * | `^java`     | prefix-exact-match         | Items that start with `java`           |\n * | `!^earlang` | inverse-prefix-exact-match | Items that do not start with `earlang` |\n * | `.js$`      | suffix-exact-match         | Items that end with `.js`              |\n * | `!.go$`     | inverse-suffix-exact-match | Items that do not end with `.go`       |\n *\n * A single pipe character acts as an OR operator. For example, the following\n * query matches entries that start with `core` and end with either`go`, `rb`,\n * or`py`.\n *\n * ```\n * ^core go$ | rb$ | py$\n * ```\n */\nclass ExtendedSearch {\n  constructor(\n    pattern,\n    {\n      isCaseSensitive = Config.isCaseSensitive,\n      ignoreDiacritics = Config.ignoreDiacritics,\n      includeMatches = Config.includeMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      ignoreLocation = Config.ignoreLocation,\n      findAllMatches = Config.findAllMatches,\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance\n    } = {}\n  ) {\n    this.query = null;\n    this.options = {\n      isCaseSensitive,\n      ignoreDiacritics,\n      includeMatches,\n      minMatchCharLength,\n      findAllMatches,\n      ignoreLocation,\n      location,\n      threshold,\n      distance\n    };\n\n    pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n    pattern = ignoreDiacritics ? stripDiacritics(pattern) : pattern;\n    this.pattern = pattern;\n    this.query = parseQuery(this.pattern, this.options);\n  }\n\n  static condition(_, options) {\n    return options.useExtendedSearch\n  }\n\n  searchIn(text) {\n    const query = this.query;\n\n    if (!query) {\n      return {\n        isMatch: false,\n        score: 1\n      }\n    }\n\n    const { includeMatches, isCaseSensitive, ignoreDiacritics } = this.options;\n\n    text = isCaseSensitive ? text : text.toLowerCase();\n    text = ignoreDiacritics ? stripDiacritics(text) : text;\n\n    let numMatches = 0;\n    let allIndices = [];\n    let totalScore = 0;\n\n    // ORs\n    for (let i = 0, qLen = query.length; i < qLen; i += 1) {\n      const searchers = query[i];\n\n      // Reset indices\n      allIndices.length = 0;\n      numMatches = 0;\n\n      // ANDs\n      for (let j = 0, pLen = searchers.length; j < pLen; j += 1) {\n        const searcher = searchers[j];\n        const { isMatch, indices, score } = searcher.search(text);\n\n        if (isMatch) {\n          numMatches += 1;\n          totalScore += score;\n          if (includeMatches) {\n            const type = searcher.constructor.type;\n            if (MultiMatchSet.has(type)) {\n              allIndices = [...allIndices, ...indices];\n            } else {\n              allIndices.push(indices);\n            }\n          }\n        } else {\n          totalScore = 0;\n          numMatches = 0;\n          allIndices.length = 0;\n          break\n        }\n      }\n\n      // OR condition, so if TRUE, return\n      if (numMatches) {\n        let result = {\n          isMatch: true,\n          score: totalScore / numMatches\n        };\n\n        if (includeMatches) {\n          result.indices = allIndices;\n        }\n\n        return result\n      }\n    }\n\n    // Nothing was matched\n    return {\n      isMatch: false,\n      score: 1\n    }\n  }\n}\n\nconst registeredSearchers = [];\n\nfunction register(...args) {\n  registeredSearchers.push(...args);\n}\n\nfunction createSearcher(pattern, options) {\n  for (let i = 0, len = registeredSearchers.length; i < len; i += 1) {\n    let searcherClass = registeredSearchers[i];\n    if (searcherClass.condition(pattern, options)) {\n      return new searcherClass(pattern, options)\n    }\n  }\n\n  return new BitapSearch(pattern, options)\n}\n\nconst LogicalOperator = {\n  AND: '$and',\n  OR: '$or'\n};\n\nconst KeyType = {\n  PATH: '$path',\n  PATTERN: '$val'\n};\n\nconst isExpression = (query) =>\n  !!(query[LogicalOperator.AND] || query[LogicalOperator.OR]);\n\nconst isPath = (query) => !!query[KeyType.PATH];\n\nconst isLeaf = (query) =>\n  !isArray(query) && isObject(query) && !isExpression(query);\n\nconst convertToExplicit = (query) => ({\n  [LogicalOperator.AND]: Object.keys(query).map((key) => ({\n    [key]: query[key]\n  }))\n});\n\n// When `auto` is `true`, the parse function will infer and initialize and add\n// the appropriate `Searcher` instance\nfunction parse(query, options, { auto = true } = {}) {\n  const next = (query) => {\n    let keys = Object.keys(query);\n\n    const isQueryPath = isPath(query);\n\n    if (!isQueryPath && keys.length > 1 && !isExpression(query)) {\n      return next(convertToExplicit(query))\n    }\n\n    if (isLeaf(query)) {\n      const key = isQueryPath ? query[KeyType.PATH] : keys[0];\n\n      const pattern = isQueryPath ? query[KeyType.PATTERN] : query[key];\n\n      if (!isString(pattern)) {\n        throw new Error(LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY(key))\n      }\n\n      const obj = {\n        keyId: createKeyId(key),\n        pattern\n      };\n\n      if (auto) {\n        obj.searcher = createSearcher(pattern, options);\n      }\n\n      return obj\n    }\n\n    let node = {\n      children: [],\n      operator: keys[0]\n    };\n\n    keys.forEach((key) => {\n      const value = query[key];\n\n      if (isArray(value)) {\n        value.forEach((item) => {\n          node.children.push(next(item));\n        });\n      }\n    });\n\n    return node\n  };\n\n  if (!isExpression(query)) {\n    query = convertToExplicit(query);\n  }\n\n  return next(query)\n}\n\n// Practical scoring function\nfunction computeScore(\n  results,\n  { ignoreFieldNorm = Config.ignoreFieldNorm }\n) {\n  results.forEach((result) => {\n    let totalScore = 1;\n\n    result.matches.forEach(({ key, norm, score }) => {\n      const weight = key ? key.weight : null;\n\n      totalScore *= Math.pow(\n        score === 0 && weight ? Number.EPSILON : score,\n        (weight || 1) * (ignoreFieldNorm ? 1 : norm)\n      );\n    });\n\n    result.score = totalScore;\n  });\n}\n\nfunction transformMatches(result, data) {\n  const matches = result.matches;\n  data.matches = [];\n\n  if (!isDefined(matches)) {\n    return\n  }\n\n  matches.forEach((match) => {\n    if (!isDefined(match.indices) || !match.indices.length) {\n      return\n    }\n\n    const { indices, value } = match;\n\n    let obj = {\n      indices,\n      value\n    };\n\n    if (match.key) {\n      obj.key = match.key.src;\n    }\n\n    if (match.idx > -1) {\n      obj.refIndex = match.idx;\n    }\n\n    data.matches.push(obj);\n  });\n}\n\nfunction transformScore(result, data) {\n  data.score = result.score;\n}\n\nfunction format(\n  results,\n  docs,\n  {\n    includeMatches = Config.includeMatches,\n    includeScore = Config.includeScore\n  } = {}\n) {\n  const transformers = [];\n\n  if (includeMatches) transformers.push(transformMatches);\n  if (includeScore) transformers.push(transformScore);\n\n  return results.map((result) => {\n    const { idx } = result;\n\n    const data = {\n      item: docs[idx],\n      refIndex: idx\n    };\n\n    if (transformers.length) {\n      transformers.forEach((transformer) => {\n        transformer(result, data);\n      });\n    }\n\n    return data\n  })\n}\n\nclass Fuse {\n  constructor(docs, options = {}, index) {\n    this.options = { ...Config, ...options };\n\n    if (\n      this.options.useExtendedSearch &&\n      !true\n    ) {\n      throw new Error(EXTENDED_SEARCH_UNAVAILABLE)\n    }\n\n    this._keyStore = new KeyStore(this.options.keys);\n\n    this.setCollection(docs, index);\n  }\n\n  setCollection(docs, index) {\n    this._docs = docs;\n\n    if (index && !(index instanceof FuseIndex)) {\n      throw new Error(INCORRECT_INDEX_TYPE)\n    }\n\n    this._myIndex =\n      index ||\n      createIndex(this.options.keys, this._docs, {\n        getFn: this.options.getFn,\n        fieldNormWeight: this.options.fieldNormWeight\n      });\n  }\n\n  add(doc) {\n    if (!isDefined(doc)) {\n      return\n    }\n\n    this._docs.push(doc);\n    this._myIndex.add(doc);\n  }\n\n  remove(predicate = (/* doc, idx */) => false) {\n    const results = [];\n\n    for (let i = 0, len = this._docs.length; i < len; i += 1) {\n      const doc = this._docs[i];\n      if (predicate(doc, i)) {\n        this.removeAt(i);\n        i -= 1;\n        len -= 1;\n\n        results.push(doc);\n      }\n    }\n\n    return results\n  }\n\n  removeAt(idx) {\n    this._docs.splice(idx, 1);\n    this._myIndex.removeAt(idx);\n  }\n\n  getIndex() {\n    return this._myIndex\n  }\n\n  search(query, { limit = -1 } = {}) {\n    const {\n      includeMatches,\n      includeScore,\n      shouldSort,\n      sortFn,\n      ignoreFieldNorm\n    } = this.options;\n\n    let results = isString(query)\n      ? isString(this._docs[0])\n        ? this._searchStringList(query)\n        : this._searchObjectList(query)\n      : this._searchLogical(query);\n\n    computeScore(results, { ignoreFieldNorm });\n\n    if (shouldSort) {\n      results.sort(sortFn);\n    }\n\n    if (isNumber(limit) && limit > -1) {\n      results = results.slice(0, limit);\n    }\n\n    return format(results, this._docs, {\n      includeMatches,\n      includeScore\n    })\n  }\n\n  _searchStringList(query) {\n    const searcher = createSearcher(query, this.options);\n    const { records } = this._myIndex;\n    const results = [];\n\n    // Iterate over every string in the index\n    records.forEach(({ v: text, i: idx, n: norm }) => {\n      if (!isDefined(text)) {\n        return\n      }\n\n      const { isMatch, score, indices } = searcher.searchIn(text);\n\n      if (isMatch) {\n        results.push({\n          item: text,\n          idx,\n          matches: [{ score, value: text, norm, indices }]\n        });\n      }\n    });\n\n    return results\n  }\n\n  _searchLogical(query) {\n\n    const expression = parse(query, this.options);\n\n    const evaluate = (node, item, idx) => {\n      if (!node.children) {\n        const { keyId, searcher } = node;\n\n        const matches = this._findMatches({\n          key: this._keyStore.get(keyId),\n          value: this._myIndex.getValueForItemAtKeyId(item, keyId),\n          searcher\n        });\n\n        if (matches && matches.length) {\n          return [\n            {\n              idx,\n              item,\n              matches\n            }\n          ]\n        }\n\n        return []\n      }\n\n      const res = [];\n      for (let i = 0, len = node.children.length; i < len; i += 1) {\n        const child = node.children[i];\n        const result = evaluate(child, item, idx);\n        if (result.length) {\n          res.push(...result);\n        } else if (node.operator === LogicalOperator.AND) {\n          return []\n        }\n      }\n      return res\n    };\n\n    const records = this._myIndex.records;\n    const resultMap = {};\n    const results = [];\n\n    records.forEach(({ $: item, i: idx }) => {\n      if (isDefined(item)) {\n        let expResults = evaluate(expression, item, idx);\n\n        if (expResults.length) {\n          // Dedupe when adding\n          if (!resultMap[idx]) {\n            resultMap[idx] = { idx, item, matches: [] };\n            results.push(resultMap[idx]);\n          }\n          expResults.forEach(({ matches }) => {\n            resultMap[idx].matches.push(...matches);\n          });\n        }\n      }\n    });\n\n    return results\n  }\n\n  _searchObjectList(query) {\n    const searcher = createSearcher(query, this.options);\n    const { keys, records } = this._myIndex;\n    const results = [];\n\n    // List is Array<Object>\n    records.forEach(({ $: item, i: idx }) => {\n      if (!isDefined(item)) {\n        return\n      }\n\n      let matches = [];\n\n      // Iterate over every key (i.e, path), and fetch the value at that key\n      keys.forEach((key, keyIndex) => {\n        matches.push(\n          ...this._findMatches({\n            key,\n            value: item[keyIndex],\n            searcher\n          })\n        );\n      });\n\n      if (matches.length) {\n        results.push({\n          idx,\n          item,\n          matches\n        });\n      }\n    });\n\n    return results\n  }\n  _findMatches({ key, value, searcher }) {\n    if (!isDefined(value)) {\n      return []\n    }\n\n    let matches = [];\n\n    if (isArray(value)) {\n      value.forEach(({ v: text, i: idx, n: norm }) => {\n        if (!isDefined(text)) {\n          return\n        }\n\n        const { isMatch, score, indices } = searcher.searchIn(text);\n\n        if (isMatch) {\n          matches.push({\n            score,\n            key,\n            value: text,\n            idx,\n            norm,\n            indices\n          });\n        }\n      });\n    } else {\n      const { v: text, n: norm } = value;\n\n      const { isMatch, score, indices } = searcher.searchIn(text);\n\n      if (isMatch) {\n        matches.push({ score, key, value: text, norm, indices });\n      }\n    }\n\n    return matches\n  }\n}\n\nFuse.version = '7.1.0';\nFuse.createIndex = createIndex;\nFuse.parseIndex = parseIndex;\nFuse.config = Config;\n\n{\n  Fuse.parseQuery = parse;\n}\n\n{\n  register(ExtendedSearch);\n}\n\nexport { Fuse as default };\n","// Switching languages might inject invisible characters like Zero Width Non-Joiners (\\u200C) or directionality marks (\\u200E, \\u200F)\nexport const sanitizeInput = (str: string) =>\n  str\n    .replace(/[\\u200E\\u200F\\u202A-\\u202E\\u2066-\\u2069]/g, \"\")\n    .replace(/[\\-–—_./()]+/g, '') // remove separators only // remove hyphens, spaces, symbols\n    .normalize(\"NFC\")\n    .trim()","import Fuse, { FuseResult } from \"fuse.js\"\nimport { AmenityFeature, ImdfFeature, OccupantFeature, SearchClient } from \"../types\"\nimport { sanitizeInput } from \"./utils/sanitizeInput\"\n\nexport const getSearchClient = ({ occupants, amenities }: { occupants: OccupantFeature[], amenities: AmenityFeature[] }): SearchClient => {\n  \n  //** Create fuse instances once on init */\n  const fuseAmenities = new Fuse(amenities, {\n    threshold: 0.2,\n    keys: [\n      { name: \"properties.name\", \"weight\": 1, getFn: (obj) => Object.values(obj.properties.name || {}) },\n      { name: \"properties.category\", \"weight\": 1 },\n    ]\n  })\n  const fuseOccupants = new Fuse(occupants, {\n    threshold: 0.25, // 0.2 is too strict (can't find Mo-Mo Paradise with \"momo\" search string)\n    includeScore: true,\n    shouldSort: true,\n    keys: [\n      { name: \"properties.name\", \"weight\": 4, getFn: (obj) => Object.values(obj.properties.name || {}) },\n      { name: \"properties.keywords\", \"weight\": 0.5 },\n      { name: \"properties.category\", \"weight\": 0.25 },\n      { name: \"properties.local_category_names\",  \"weight\": 0.25 },\n      { name: \"properties.description\", \"weight\": 0.25, getFn: occ => Object.values(occ.properties.description || {}) },\n      { name: \"properties.unit_name\", \"weight\": 0.25 },\n      { name: \"properties.kiosk_name\", \"weight\": 0.25 }\n    ]\n  })\n\n  const search = (value: string): FuseResult<ImdfFeature>[] => {\n\n    const sanitizedValue = sanitizeInput(value)\n    \n    // 01. Search amenities\n    const matchedAmenities = fuseAmenities.search(sanitizedValue)\n\n    // 02. Search Occupants\n    const matchedOccupants = fuseOccupants.search(sanitizedValue)\n\n    return [...matchedAmenities, ...matchedOccupants]\n  }\n\n  return {\n    search\n  }\n}"],"mappings":";;;;;;;AAAA,SAAS,iBAAAA,sBAAqB;;;ACGvB,IAAM,mBAAmB;AAEzB,IAAM,qBAAoC;AAAA,EAC/C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,IAAM,uBAAiC;AAAA,EAC5C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,IAAM,wBAAuC;AAAA,EAClD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,IAAM,wBAAuC;AAAA,EAClD,GAAG;AAAA,EACH,GAAG;AACL;AAEO,IAAM,oBAAmC;AAAA,EAC9C,GAAG;AAAA,EACH;AAAA,EACA;AACF;AAEO,IAAM,gCAGT;AAAA;AAAA,EAEF,SAAS,CAAC;AAAA,EACV,SAAS,CAAC;AAAA,EACV,QAAQ,CAAC;AAAA,EACT,UAAU,CAAC;AAAA,EACX,QAAQ,EAAE,SAAS,MAAM;AAAA,EACzB,SAAS,CAAC;AAAA,EACV,WAAW,CAAC;AAAA,EACZ,UAAU,EAAE,SAAS,MAAM;AAAA,EAC3B,OAAO,CAAC;AAAA,EACR,OAAO,CAAC;AAAA,EACR,UAAU;AAAA,IACR,iBAAiB,IAAI,KAAK;AAAA;AAAA,IAC1B,WAAW,IAAI,KAAK;AAAA,EACtB;AAAA,EACA,SAAS,CAAC;AAAA,EACV,cAAc,CAAC;AAAA,EACf,SAAS,CAAC;AAAA,EACV,MAAM,CAAC;AAAA,EACP,OAAO,CAAC;AAAA;AAAA,EAGR,UAAU,CAAC;AAAA,EACX,WAAW,CAAC;AAAA,EACZ,OAAO,CAAC;AAAA,EACR,WAAW;AAAA,IACT,iBAAiB,MAAM,KAAK;AAAA;AAAA,IAC5B,WAAW,MAAM,KAAK;AAAA,EACxB;AAAA,EACA,OAAO,CAAC;AAAA;AAAA,EAGR,qBAAqB;AAAA,IACnB,iBAAiB,IAAI,KAAK;AAAA;AAAA,EAC5B;AAAA,EACA,SAAS,CAAC;AAAA,EACV,MAAM,CAAC;AAAA,EACP,SAAS,CAAC;AACZ;;;AChJA,eAAsB,iBACpB,WACA,QACA,aACA,UAAkB,kBACgB;AAElC,UAAQ,aAAa;AAAA,IACnB,KAAK;AAAA,IACL,KAAK,WAAW;AACd,YAAM,oBAAoB,GAAG,WAAW;AACxC,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,sBAAsB,SAAS,IAAI,iBAAiB,oBAAoB,MAAM;AAAA,MAC1F;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,aAAO;AAAA,IACT;AAAA,IAEA,KAAK,WAAW;AACd,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,sBAAsB,SAAS,IAAI,WAAW,oBAAoB,MAAM;AAAA,MACpF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,aAAO,MAAM;AAAA,IACf;AAAA,IAEA,KAAK,qBAAqB;AACxB,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,sBAAsB,SAAS,mCAAmC,MAAM;AAAA,MACpF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,UAAU,MAAM,IAAI,KAAK;AAC/B,YAAM,QAAQ,QAAQ;AACtB,aAAO,MAAM,IAAI,CAAC,UAAU;AAAA,QAC1B,IAAI,KAAK;AAAA,QACT,GAAG,KAAK;AAAA,MACV,EAAE;AAAA,IACJ;AAAA,IAEA,SAAS;AACP,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,sBAAsB,SAAS,SAAS,WAAW,oBAAoB,MAAM;AAAA,MACzF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,cAAc,MAAM,IAAI,KAAK;AACnC,aAAO,YAAY;AAAA,IACrB;AAAA,EACF;AACF;AAGA,eAAsB,gBACpB,WACA,cACA,aACA,UAAkB,kBACgB;AAElC,UAAQ,aAAa;AAAA,IACnB,KAAK;AAAA,IACL,KAAK,WAAW;AACd,YAAM,oBAAoB,GAAG,WAAW;AACxC,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,qBAAqB,SAAS,IAAI,iBAAiB;AAAA,QAAY;AAAA,UACvE,SAAS;AAAA,YACP,eAAe,UAAU,YAAY;AAAA,UACvC;AAAA,QACF;AAAA,MACF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,aAAO;AAAA,IACT;AAAA,IAEA,KAAK,qBAAqB;AACxB,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,qBAAqB,SAAS;AAAA,QAA2B;AAAA,UACjE,SAAS;AAAA,YACP,eAAe,UAAU,YAAY;AAAA,UACvC;AAAA,QACF;AAAA,MACF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,UAAU,MAAM,IAAI,KAAK;AAC/B,YAAM,QAAQ,QAAQ;AACtB,aAAO,MAAM,IAAI,CAAC,UAAU;AAAA,QAC1B,IAAI,KAAK;AAAA,QACT,GAAG,KAAK;AAAA,MACV,EAAE;AAAA,IACJ;AAAA,IAEA,SAAS;AACP,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO,qBAAqB,SAAS,SAAS,WAAW;AAAA,QAAY;AAAA,UACtE,SAAS;AAAA,YACP,eAAe,UAAU,YAAY;AAAA,UACvC;AAAA,QACF;AAAA,MACF;AACA,UAAI,IAAI,WAAW,IAAK,QAAO,CAAC;AAChC,YAAM,cAAc,MAAM,IAAI,KAAK;AACnC,aAAO,YAAY;AAAA,IACrB;AAAA,EACF;AACF;AAEO,IAAM,mBAAmB,OAC9B,aACA,WAOqC;AACrC,QAAM,OAAO,OAAO,QAAQ;AAC5B,QAAM,YAAY,OAAO;AACzB,QAAM,SAAS,OAAO;AACtB,QAAM,eAAe,OAAO;AAC5B,QAAM,UAAU,OAAO,WAAW;AAElC,MAAI;AACF,QAAI,SAAS,CAAC;AAEd,QAAI,SAAS,YAAY;AACvB,eAAS,MAAM;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,WAAW,SAAS,WAAW;AAC7B,eAAS,MAAM;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,WAAO,UAAU,CAAC;AAAA,EACpB,SAAS,GAAG;AAEV,WAAO,QAAQ,QAAQ,CAAC,CAAC;AAAA,EAC3B;AACF;;;AClJO,IAAM,oBAAoB,CAAC,UAA6B;AAC7D,SAAO,MAAM,WAAW,KAAK,MAAM,MAAM,CAAC,UAAU,OAAO,UAAU,QAAQ;AAC/E;AAQA,SAAS,6BAA6B,MAA2B;AAC/D,MAAI,KAAK,SAAS,GAAG;AACnB,WAAO;AAAA,EACT;AAEA,SACE,KAAK,MAAM,iBAAiB,KAC5B,KAAK,CAAC,EAAE,CAAC,MAAM,KAAK,KAAK,SAAS,CAAC,EAAE,CAAC,KACtC,KAAK,CAAC,EAAE,CAAC,MAAM,KAAK,KAAK,SAAS,CAAC,EAAE,CAAC;AAE1C;AAUO,IAAM,4BAA4B,CACvC,YACY;AAEZ,MACE,MAAM,QAAQ,QAAQ,CAAC,CAAC,MACvB,QAAQ,CAAC,EAAE,WAAW,KAAK,OAAO,QAAQ,CAAC,EAAE,CAAC,MAAM,WACrD;AACA,WAAO,6BAA6B,OAAqB;AAAA,EAC3D;AAGA,MACE,MAAM,QAAQ,OAAO,KACrB,QAAQ,SAAS,KACjB,MAAM,QAAQ,QAAQ,CAAC,CAAC,GACxB;AAEA,QAAI,CAAC,6BAA6B,QAAQ,CAAC,CAAe,GAAG;AAC3D,aAAO;AAAA,IACT;AAGA,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAI,CAAC,6BAA6B,QAAQ,CAAC,CAAe,GAAG;AAC3D,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAQO,IAAM,iCAAiC,CAC5C,iBACY;AACZ,SAAO,aAAa,MAAM,yBAAyB;AACrD;AAUO,IAAM,+BAA+B,CAC1C,eACY;AACZ,MAAI,CAAC,MAAM,QAAQ,UAAU,KAAK,WAAW,SAAS,GAAG;AACvD,WAAO;AAAA,EACT;AAGA,QAAM,aAAa,WAAW,CAAC;AAC/B,QAAM,YAAY,WAAW,WAAW,SAAS,CAAC;AAClD,MAAI,WAAW,CAAC,MAAM,UAAU,CAAC,KAAK,WAAW,CAAC,MAAM,UAAU,CAAC,GAAG;AACpE,WAAO;AAAA,EACT;AAEA,SAAO,WAAW,MAAM,iBAAiB;AAC3C;AAEO,IAAM,sBAAsB,CACjC,aACY;AACZ,QAAM,EAAE,MAAM,YAAY,IAAI;AAC9B,SAAO,SAAS,kBAAkB,+BAA+B,WAAW;AAC9E;AAEO,IAAM,iBAAiB,CAC5B,aACY;AACZ,QAAM,EAAE,MAAM,YAAY,IAAI;AAC9B,SAAO,SAAS,aAAa,0BAA0B,WAAW;AACpE;AAEO,IAAM,oBAAoB,CAC/B,aACY;AACZ,QAAM,EAAE,MAAM,YAAY,IAAI;AAC9B,SAAO,SAAS,gBAAgB,6BAA6B,WAAW;AAC1E;AAEO,IAAM,eAAe,CAC1B,aACY;AACZ,QAAM,EAAE,MAAM,YAAY,IAAI;AAC9B,SAAO,SAAS,WAAW,kBAAkB,WAAW;AAC1D;;;ACtIA,SAAS,WAAW,QAAoC;AACtD,SACE,OAAO,WAAW,YAClB,WAAW,QACX,SAAS,UACT,MAAM,QAAS,OAAe,GAAG;AAErC;AAEA,IAAM,gBAAgB,CAAC,GAAY,MAAe,EAAE,KAAK,OAAK,EAAE,SAAS,CAAC,CAAC;AAEpE,SAAS,YAAY,OAAwB,QAAgB;AAElE,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,QAAI,WAAW,MAAM,EAAG,QAAO,cAAc,OAAO,OAAO,GAAG;AAG9D,WAAO,MAAM,SAAS,MAAe;AAAA,EAEvC,OAAO;AACL,QAAI,WAAW,MAAM,EAAG,QAAO,OAAO,IAAI,SAAS,KAAK;AAGxD,WAAO,UAAU;AAAA,EACnB;AACF;AAEO,SAAS,aAA4C,MAAS,SAA2B;AAC9F,SAAO,OAAO,QAAQ,OAAO,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,MAAM;AACtD,WAAO,YAAY,KAAK,WAAW,GAAG,GAAG,MAAM;AAAA,EACjD,CAAC;AACH;;;ACjCA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAO,IAAM,UAAU,CAA8B,QAAkB,IAAI,OAAO,UAAQ,QAAQ,IAAI,CAAC;;;ADGhG,IAAM,0BAA0B,CAAC,aAAqF;AAC3H,SAAO,SAAS,WAAW,SAAS,SAAS,WAAW;AAC1D;AAEO,IAAM,iCAAiC,CAAC,aAA4F;AAEzI,QAAM,yBAAyB;AAAA,IAC7B,GAAG,SAAS,WAAW;AAAA,IACvB,GAAG,SAAS,WAAW;AAAA,EACzB;AAEA,SAAO,QAAQ,sBAAsB;AACvC;AAIO,IAAM,6BAA6B,CAAC,UAAoC,YAAyG;AAMtL,QAAM,gBAAgB,SAAS,OAAO,QAAQ,OAAO,SAAS,WAAW,yBAAyB,kBAAkB;AAEpH,QAAM,eAAe,wBAAwB,QAAQ;AAErD,QAAM,oBAAoB,cAAc,YAAY;AACpD,QAAM,yBAAyB,+BAA+B,QAAQ;AAGtE,MAAI,kBAAkB,iBAAiB;AACrC,WAAO,QAAQ,CAAC,cAAc,GAAG,sBAAsB,CAAC;AAAA,EAC1D;AAGA,QAAM,sBAAsB,uBAAuB,OAAO,CAAC,MAAM,EAAE,WAAW,aAAa,iBAAiB;AAC5G,QAAM,uBAAuB,CAAC,GAAG,IAAI,IAAI,oBAAoB,IAAI,SAAO,CAAC,IAAI,WAAW,UAAU,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC;AACjH,SAAO,QAAQ,CAAC,cAAc,GAAG,oBAAoB,CAAC;AACxD;;;AEvCA;AAAA,EAEE;AAAA,EACA;AAAA,OACK;;;ACGP,SAAS,UAAAC,eAAc;AACvB,SAAS,yBAAAC,8BAA6B;;;ACVtC,SAAS,cAAc;AACvB,SAAS,6BAA6B;AAG/B,IAAM,qBAAqB,CAAC,KAAoC,UAA6C;AAClH,QAAM,OAAO,MAAM;AAAA,IACjB,CAACC,UAAS;AACR,UAAI;AACF,eAAOA,MAAK,WAAW,aAAa,IAAI,WAAW,YAC9C,sBAAsB,OAAO,GAAG,GAAGA,KAAI;AAAA,MAC9C,SAAS,GAAG;AACV,gBAAQ,IAAI,mCAAmC,IAAI,EAAE,MAAM,EAAE,OAAO;AACpE,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;ADaO,IAAM,kBAAkB,CAAC;AAAA,EAC9B;AAAA,EACA;AACF,MAAyC;AACvC,QAAM,kBAA0C,CAAC,YAC/C,QAAQ,QAAQ,OAAO;AACzB,QAAM,mBAA4C,CAAC,aACjD,QAAQ,QAAQ,QAAQ;AAC1B,QAAM,iBAAwC,CAAC,WAC7C,QAAQ,QAAQ,MAAM;AACxB,QAAM,oBAA8C,CAAC,cACnD,QAAQ,QAAQ,SAAS;AAC3B,QAAM,mBAA4C,CAAC,aACjD,QAAQ,QAAQ,QAAQ;AAE1B,QAAM,oBAA8C,CAAC,cACnD,QAAQ,QAAQ,SAAS;AAC3B,QAAM,gBAAsC,CAAC,UAAU,QAAQ,QAAQ,KAAK;AAE5E,QAAM,oBAA8C,OAAO,cAAc;AACvE,UAAM,QAAQ,MAAM,iBAA0B,UAAU,WAAW,QAAQ;AAC3E,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,UAAU;AAAA,QACb;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAA0C,OAAO,YAAY;AACjE,UAAM,QAAQ,MAAM,QAAQ;AAAA,MAC1B,QAAQ,WAAW,SAAS,IAAI,gBAAwB;AAAA,IAC1D;AAEA,UAAM,iBAAiB,MAAM,QAAQ,IAAI,MAAM,IAAI,YAAY,CAAC;AAEhE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AAEzE,UAAM,eAAe,eAAe,CAAC,EAAE,WAAW;AAElD,UAAM,SAAS,MAAM,qBAA8B,OAAO;AAC1D,UAAM,gBAAgB,OAAO;AAAA,MAC3B,CAACC,WAAUA,OAAM,WAAW,aAAa,aAAa;AAAA,IACxD;AACA,UAAM,QAAQ,cAAc,KAAK,CAACA,WAAUC,uBAAsB,SAASD,MAAK,CAAC;AACjF,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,QAAQ;AAAA,QACX,SAAS,aAAa,WAAW;AAAA,QACjC,YAAY,aAAa,WAAW,KAAK;AAAA,QACzC,OAAO;AAAA,QACP,OAAO;AAAA,QACP;AAAA,QACA,qBAAqB,QAAQ,MAAM,cAAc,KAAK,IAAI;AAAA,MAC5D;AAAA,IACF;AAAA,EACF;AAEA,QAAM,iBAAwC,OAAO,WAAW;AAC9D,UAAM,OAAO,MAAM,iBAAyB,OAAO,WAAW,OAAO;AACrE,UAAM,QAAQ,MAAM,iBAA0B,KAAK,WAAW,QAAQ;AACtE,UAAM,QAAQ,MAAM,iBAA0B,KAAK,WAAW,QAAQ;AAEtE,UAAM,WAAW,MAAM,qBAAgC,SAAS;AAChE,UAAM,UAAU,SAAS,KAAK,CAACE,aAAYD,uBAAsB,QAAQC,QAAO,CAAC;AAEjF,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,OAAO;AAAA,QACV,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,MAAM,MAAM,aAAa,IAAI;AAAA,QAC7B,SAAS,UAAU,MAAM,gBAAgB,OAAO,IAAI;AAAA,QACpD,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,SAAS,MAAM,WAAW;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAA0C,OAAO,YAAY;AACjE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,UAAM,SAAS,MAAM,iBAA2B,QAAQ,WAAW,SAAS;AAE5E,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,QAAQ;AAAA,QACX,QAAQ,SAAS,MAAM,eAAe,MAAM,IAAI;AAAA,QAChD,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,SAAS,MAAM,WAAW;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,gBAAsC,OAAO,UAAU;AAC3D,UAAM,QAAQ,MAAM,iBAA0B,MAAM,WAAW,QAAQ;AACvE,UAAM,QAAQ,MAAM,iBAA0B,MAAM,WAAW,QAAQ;AACvE,UAAM,SAAS,MAAM,iBAA2B,MAAM,WAAW,SAAS;AAG1E,UAAM,QAAQ,MAAM,qBAA6B,MAAM;AACvD,UAAM,OAAO,mBAAmB,OAAO,MAAM,OAAO,CAAAC,UAAQA,MAAK,WAAW,aAAa,SAAS,CAAC;AAEnG,QAAI,UAAiC;AAErC,QAAI,QAAQ;AACV,YAAM,WAAW,MAAM,qBAAgC,SAAS;AAChE,gBAAU,SAAS,KAAK,CAACD,aAAYD,uBAAsB,QAAQC,QAAO,CAAC;AAAA,IAC7E;AAEA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,MAAM;AAAA,QACT,QAAQ,SAAS,MAAM,eAAe,MAAM,IAAI;AAAA,QAChD,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,SAAS,MAAM,WAAW;AAAA,QAE1B,MAAM,OAAO,MAAM,aAAa,IAAI,IAAI;AAAA,QACxC,SAAS,UAAU,MAAM,gBAAgB,OAAO,IAAI;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAEA,QAAM,gBAAsC,OAAO,UAAU;AAC3D,UAAM,QAAQ,MAAM,iBAA0B,MAAM,WAAW,QAAQ;AACvE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,MAAM;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,mBAA4C,OAAO,aAAa;AACpE,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,gBAAgB,CAAC;AAAA,MACjB,gBAAgB,CAAC;AAAA,MACjB;AAAA,MACA;AAAA,MACA,YAAY,CAAC;AAAA,MACb,WAAW,CAAC;AAAA,IACd,IAAI,SAAS;AACb,UAAM,SAAS,MAAM,iBAA2B,SAAS;AACzD,UAAM,QAAQ,MAAM,iBAA0B,QAAQ;AAEtD,UAAM,kBAAkB,MAAM,QAAQ;AAAA,MACpC,mBAAmB,IAAI,gBAA4B;AAAA,IACrD;AACA,UAAM,aAAa,MAAM,QAAQ;AAAA,MAC/B,cAAc,IAAI,gBAA6B;AAAA,IACjD;AACA,UAAM,aAAa,MAAM,QAAQ;AAAA,MAC/B,cAAc,IAAI,gBAA6B;AAAA,IACjD;AACA,UAAM,QAAQ,MAAM,iBAA0B,QAAQ;AACtD,UAAM,OAAO,MAAM,iBAAyB,OAAO;AAEnD,UAAM,SAAS,MAAM,QAAQ,IAAI,UAAU,IAAI,gBAAyB,CAAC;AACzE,UAAM,QAAQ,MAAM,QAAQ,IAAI,SAAS,IAAI,gBAAwB,CAAC;AACtE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,SAAS;AAAA,QACZ,QAAQ,SAAS,MAAM,eAAe,MAAM,IAAI;AAAA,QAChD,kBAAkB,MAAM,QAAQ;AAAA,UAC9B,QAAQ,eAAe,EAAE,IAAI,gBAAgB;AAAA,QAC/C;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QAEA,OAAO,QAAQ,MAAM,cAAc,KAAK,IAAI;AAAA,QAC5C,MAAM,OAAO,MAAM,aAAa,IAAI,IAAI;AAAA,QACxC,QAAQ,MAAM,QAAQ,IAAI,OAAO,IAAI,aAAa,CAAC;AAAA,QACnD,OAAO,MAAM,QAAQ,IAAI,MAAM,IAAI,YAAY,CAAC;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAA0C,OAAO,YAAY;AACjE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV;AAAA,QACA,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,SAAS,MAAM,WAAW;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,uBAAoD,OAAO,iBAAiB;AAChF,UAAM,WAAW,aAAa,WAAW,QAAQ;AACjD,UAAM,gBAAgB,aAAa,WAAW,aAAa;AAC3D,UAAM,SAAS,WAAW,MAAM,iBAAqC,QAAQ,IAAI;AACjF,UAAM,cAAc,gBAAgB,MAAM,iBAAqC,aAAa,IAAI;AAChG,UAAM,oBAAoB,aAAa,WAAW,gBAAgB,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,MAAM,EAAE;AACxF,UAAM,eAAe,MAAM,QAAQ,IAAI,iBAAiB,IAAI,gBAAoC,CAAC;AAEjG,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,aAAa;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAA0C,OAAO,YAAY;AACjE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,QAAQ;AAAA,QACX;AAAA,QACA,OAAO,MAAM,cAAc,KAAK;AAAA,QAChC,SAAS,MAAM,WAAW;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAoC,OAAO,SAAS;AACxD,UAAM,QAAQ,MAAM,iBAA0B,KAAK,WAAW,QAAQ;AACtE,UAAM,QAAQ,MAAM,iBAA0B,KAAK,WAAW,QAAQ;AAEtE,UAAM,WAAW,MAAM,qBAAgC,SAAS;AAChE,QAAI;AACF,YAAM,UAAU,KAAK,SAAS,SAAS,iBAAiB,SAAS,KAAK,CAACA,aAAYD,uBAAsBG,QAAO,IAAI,GAAGF,QAAO,CAAC,IAAI;AACnI,aAAO;AAAA,QACL,GAAG;AAAA,QACH,YAAY;AAAA,UACV,GAAG,KAAK;AAAA,UACR;AAAA,UACA,SAAS,MAAM,WAAW;AAAA,UAC1B,OAAO,MAAM,cAAc,KAAK;AAAA,UAChC,SAAS,UAAU,MAAM,gBAAgB,OAAO,IAAI;AAAA,QACtD;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AACZ,cAAQ,IAAI,0BAA0B,EAAE,MAAM,SAAS,CAAC;AAAA,IAC1D;AAAA,EACF;AAEA,QAAM,gBAAsC,CAAC,UAAU;AACrD,WAAO,QAAQ,QAAQ,KAAK;AAAA,EAC9B;AAEA,QAAM,mBAA4C,OAAO,aAAa;AACpE,UAAM,QAAQ,MAAM,iBAA0B,SAAS,WAAW,QAAQ;AAC1E,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY;AAAA,QACV,GAAG,SAAS;AAAA,QACZ,OAAO,QAAQ,MAAM,cAAc,KAAK,IAAI;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAA0C,OAAO,YAAY;AACjE,UAAM,QAAQ,MAAM,iBAA0B,QAAQ,WAAW,QAAQ;AACzE,QAAI;AACF,aAAO;AAAA,QACL,GAAG;AAAA,QACH,YAAY;AAAA,UACV,GAAG,QAAQ;AAAA,UACX,OAAO,MAAM,cAAc,KAAK;AAAA,QAClC;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AACZ,cAAQ,IAAI,uBAAuB,EAAE,SAAS,MAAM,CAAC;AAAA,IACvD;AAAA,EACF;AAEA,QAAM,kBAAkB,CAAC,YAAY,QAAQ,QAAQ,OAAO;AAE5D,SAAO;AAAA,IACL,SAAS;AAAA,IACT,UAAU;AAAA,IACV,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,WAAW;AAAA,IACX,UAAU;AAAA,IACV,SAAS;AAAA,IACT,cAAc;AAAA,IACd,WAAW;AAAA,IACX,WAAW;AAAA,IACX,OAAO;AAAA,IACP,OAAO;AAAA,IACP,SAAS;AAAA,IACT,MAAM;AAAA,IAEN,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,IACV,SAAS;AAAA,IACT,MAAM;AAAA,IACN,OAAO;AAAA,IACP,UAAU;AAAA,IAEV,SAAS;AAAA,EACX;AACF;;;AElVA,SAAS,QAAQ,OAAO;AACtB,SAAO,CAAC,MAAM,UACV,OAAO,KAAK,MAAM,mBAClB,MAAM,QAAQ,KAAK;AACzB;AAGA,IAAM,WAAW,IAAI;AACrB,SAAS,aAAa,OAAO;AAE3B,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO;AAAA,EACT;AACA,MAAI,SAAS,QAAQ;AACrB,SAAO,UAAU,OAAO,IAAI,SAAS,CAAC,WAAW,OAAO;AAC1D;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,SAAS,OAAO,KAAK,aAAa,KAAK;AAChD;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,UAAU;AAC1B;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,UAAU;AAC1B;AAGA,SAAS,UAAU,OAAO;AACxB,SACE,UAAU,QACV,UAAU,SACT,aAAa,KAAK,KAAK,OAAO,KAAK,KAAK;AAE7C;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,UAAU;AAC1B;AAGA,SAAS,aAAa,OAAO;AAC3B,SAAO,SAAS,KAAK,KAAK,UAAU;AACtC;AAEA,SAAS,UAAU,OAAO;AACxB,SAAO,UAAU,UAAa,UAAU;AAC1C;AAEA,SAAS,QAAQ,OAAO;AACtB,SAAO,CAAC,MAAM,KAAK,EAAE;AACvB;AAIA,SAAS,OAAO,OAAO;AACrB,SAAO,SAAS,OACZ,UAAU,SACR,uBACA,kBACF,OAAO,UAAU,SAAS,KAAK,KAAK;AAC1C;AAIA,IAAM,uBAAuB;AAE7B,IAAM,uCAAuC,CAAC,QAC5C,yBAAyB,GAAG;AAE9B,IAAM,2BAA2B,CAAC,QAChC,iCAAiC,GAAG;AAEtC,IAAM,uBAAuB,CAAC,SAAS,WAAW,IAAI;AAEtD,IAAM,2BAA2B,CAAC,QAChC,6BAA6B,GAAG;AAElC,IAAM,SAAS,OAAO,UAAU;AAEhC,IAAM,WAAN,MAAe;AAAA,EACb,YAAY,MAAM;AAChB,SAAK,QAAQ,CAAC;AACd,SAAK,UAAU,CAAC;AAEhB,QAAI,cAAc;AAElB,SAAK,QAAQ,CAAC,QAAQ;AACpB,UAAI,MAAM,UAAU,GAAG;AAEvB,WAAK,MAAM,KAAK,GAAG;AACnB,WAAK,QAAQ,IAAI,EAAE,IAAI;AAEvB,qBAAe,IAAI;AAAA,IACrB,CAAC;AAGD,SAAK,MAAM,QAAQ,CAAC,QAAQ;AAC1B,UAAI,UAAU;AAAA,IAChB,CAAC;AAAA,EACH;AAAA,EACA,IAAI,OAAO;AACT,WAAO,KAAK,QAAQ,KAAK;AAAA,EAC3B;AAAA,EACA,OAAO;AACL,WAAO,KAAK;AAAA,EACd;AAAA,EACA,SAAS;AACP,WAAO,KAAK,UAAU,KAAK,KAAK;AAAA,EAClC;AACF;AAEA,SAAS,UAAU,KAAK;AACtB,MAAI,OAAO;AACX,MAAI,KAAK;AACT,MAAI,MAAM;AACV,MAAI,SAAS;AACb,MAAI,QAAQ;AAEZ,MAAI,SAAS,GAAG,KAAK,QAAQ,GAAG,GAAG;AACjC,UAAM;AACN,WAAO,cAAc,GAAG;AACxB,SAAK,YAAY,GAAG;AAAA,EACtB,OAAO;AACL,QAAI,CAAC,OAAO,KAAK,KAAK,MAAM,GAAG;AAC7B,YAAM,IAAI,MAAM,qBAAqB,MAAM,CAAC;AAAA,IAC9C;AAEA,UAAM,OAAO,IAAI;AACjB,UAAM;AAEN,QAAI,OAAO,KAAK,KAAK,QAAQ,GAAG;AAC9B,eAAS,IAAI;AAEb,UAAI,UAAU,GAAG;AACf,cAAM,IAAI,MAAM,yBAAyB,IAAI,CAAC;AAAA,MAChD;AAAA,IACF;AAEA,WAAO,cAAc,IAAI;AACzB,SAAK,YAAY,IAAI;AACrB,YAAQ,IAAI;AAAA,EACd;AAEA,SAAO,EAAE,MAAM,IAAI,QAAQ,KAAK,MAAM;AACxC;AAEA,SAAS,cAAc,KAAK;AAC1B,SAAO,QAAQ,GAAG,IAAI,MAAM,IAAI,MAAM,GAAG;AAC3C;AAEA,SAAS,YAAY,KAAK;AACxB,SAAO,QAAQ,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI;AACxC;AAEA,SAAS,IAAI,KAAK,MAAM;AACtB,MAAI,OAAO,CAAC;AACZ,MAAI,MAAM;AAEV,QAAM,UAAU,CAACG,MAAKC,OAAM,UAAU;AACpC,QAAI,CAAC,UAAUD,IAAG,GAAG;AACnB;AAAA,IACF;AACA,QAAI,CAACC,MAAK,KAAK,GAAG;AAEhB,WAAK,KAAKD,IAAG;AAAA,IACf,OAAO;AACL,UAAI,MAAMC,MAAK,KAAK;AAEpB,YAAM,QAAQD,KAAI,GAAG;AAErB,UAAI,CAAC,UAAU,KAAK,GAAG;AACrB;AAAA,MACF;AAIA,UACE,UAAUC,MAAK,SAAS,MACvB,SAAS,KAAK,KAAK,SAAS,KAAK,KAAK,UAAU,KAAK,IACtD;AACA,aAAK,KAAK,SAAS,KAAK,CAAC;AAAA,MAC3B,WAAW,QAAQ,KAAK,GAAG;AACzB,cAAM;AAEN,iBAAS,IAAI,GAAG,MAAM,MAAM,QAAQ,IAAI,KAAK,KAAK,GAAG;AACnD,kBAAQ,MAAM,CAAC,GAAGA,OAAM,QAAQ,CAAC;AAAA,QACnC;AAAA,MACF,WAAWA,MAAK,QAAQ;AAEtB,gBAAQ,OAAOA,OAAM,QAAQ,CAAC;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AAGA,UAAQ,KAAK,SAAS,IAAI,IAAI,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC;AAEvD,SAAO,MAAM,OAAO,KAAK,CAAC;AAC5B;AAEA,IAAM,eAAe;AAAA;AAAA;AAAA;AAAA,EAInB,gBAAgB;AAAA;AAAA;AAAA,EAGhB,gBAAgB;AAAA;AAAA,EAEhB,oBAAoB;AACtB;AAEA,IAAM,eAAe;AAAA;AAAA;AAAA,EAGnB,iBAAiB;AAAA;AAAA,EAEjB,kBAAkB;AAAA;AAAA,EAElB,cAAc;AAAA;AAAA,EAEd,MAAM,CAAC;AAAA;AAAA,EAEP,YAAY;AAAA;AAAA,EAEZ,QAAQ,CAAC,GAAG,MACV,EAAE,UAAU,EAAE,QAAS,EAAE,MAAM,EAAE,MAAM,KAAK,IAAK,EAAE,QAAQ,EAAE,QAAQ,KAAK;AAC9E;AAEA,IAAM,eAAe;AAAA;AAAA,EAEnB,UAAU;AAAA;AAAA;AAAA,EAGV,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMX,UAAU;AACZ;AAEA,IAAM,kBAAkB;AAAA;AAAA,EAEtB,mBAAmB;AAAA;AAAA;AAAA,EAGnB,OAAO;AAAA;AAAA;AAAA;AAAA,EAIP,gBAAgB;AAAA;AAAA;AAAA;AAAA,EAIhB,iBAAiB;AAAA;AAAA,EAEjB,iBAAiB;AACnB;AAEA,IAAI,SAAS;AAAA,EACX,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AACL;AAEA,IAAM,QAAQ;AAId,SAAS,KAAK,SAAS,GAAG,WAAW,GAAG;AACtC,QAAM,QAAQ,oBAAI,IAAI;AACtB,QAAM,IAAI,KAAK,IAAI,IAAI,QAAQ;AAE/B,SAAO;AAAA,IACL,IAAI,OAAO;AACT,YAAM,YAAY,MAAM,MAAM,KAAK,EAAE;AAErC,UAAI,MAAM,IAAI,SAAS,GAAG;AACxB,eAAO,MAAM,IAAI,SAAS;AAAA,MAC5B;AAGA,YAAMC,QAAO,IAAI,KAAK,IAAI,WAAW,MAAM,MAAM;AAGjD,YAAM,IAAI,WAAW,KAAK,MAAMA,QAAO,CAAC,IAAI,CAAC;AAE7C,YAAM,IAAI,WAAW,CAAC;AAEtB,aAAO;AAAA,IACT;AAAA,IACA,QAAQ;AACN,YAAM,MAAM;AAAA,IACd;AAAA,EACF;AACF;AAEA,IAAM,YAAN,MAAgB;AAAA,EACd,YAAY;AAAA,IACV,QAAQ,OAAO;AAAA,IACf,kBAAkB,OAAO;AAAA,EAC3B,IAAI,CAAC,GAAG;AACN,SAAK,OAAO,KAAK,iBAAiB,CAAC;AACnC,SAAK,QAAQ;AACb,SAAK,YAAY;AAEjB,SAAK,gBAAgB;AAAA,EACvB;AAAA,EACA,WAAW,OAAO,CAAC,GAAG;AACpB,SAAK,OAAO;AAAA,EACd;AAAA,EACA,gBAAgB,UAAU,CAAC,GAAG;AAC5B,SAAK,UAAU;AAAA,EACjB;AAAA,EACA,QAAQ,OAAO,CAAC,GAAG;AACjB,SAAK,OAAO;AACZ,SAAK,WAAW,CAAC;AACjB,SAAK,QAAQ,CAAC,KAAK,QAAQ;AACzB,WAAK,SAAS,IAAI,EAAE,IAAI;AAAA,IAC1B,CAAC;AAAA,EACH;AAAA,EACA,SAAS;AACP,QAAI,KAAK,aAAa,CAAC,KAAK,KAAK,QAAQ;AACvC;AAAA,IACF;AAEA,SAAK,YAAY;AAGjB,QAAI,SAAS,KAAK,KAAK,CAAC,CAAC,GAAG;AAC1B,WAAK,KAAK,QAAQ,CAAC,KAAK,aAAa;AACnC,aAAK,WAAW,KAAK,QAAQ;AAAA,MAC/B,CAAC;AAAA,IACH,OAAO;AAEL,WAAK,KAAK,QAAQ,CAAC,KAAK,aAAa;AACnC,aAAK,WAAW,KAAK,QAAQ;AAAA,MAC/B,CAAC;AAAA,IACH;AAEA,SAAK,KAAK,MAAM;AAAA,EAClB;AAAA;AAAA,EAEA,IAAI,KAAK;AACP,UAAM,MAAM,KAAK,KAAK;AAEtB,QAAI,SAAS,GAAG,GAAG;AACjB,WAAK,WAAW,KAAK,GAAG;AAAA,IAC1B,OAAO;AACL,WAAK,WAAW,KAAK,GAAG;AAAA,IAC1B;AAAA,EACF;AAAA;AAAA,EAEA,SAAS,KAAK;AACZ,SAAK,QAAQ,OAAO,KAAK,CAAC;AAG1B,aAAS,IAAI,KAAK,MAAM,KAAK,KAAK,GAAG,IAAI,KAAK,KAAK,GAAG;AACpD,WAAK,QAAQ,CAAC,EAAE,KAAK;AAAA,IACvB;AAAA,EACF;AAAA,EACA,uBAAuB,MAAM,OAAO;AAClC,WAAO,KAAK,KAAK,SAAS,KAAK,CAAC;AAAA,EAClC;AAAA,EACA,OAAO;AACL,WAAO,KAAK,QAAQ;AAAA,EACtB;AAAA,EACA,WAAW,KAAK,UAAU;AACxB,QAAI,CAAC,UAAU,GAAG,KAAK,QAAQ,GAAG,GAAG;AACnC;AAAA,IACF;AAEA,QAAI,SAAS;AAAA,MACX,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG,KAAK,KAAK,IAAI,GAAG;AAAA,IACtB;AAEA,SAAK,QAAQ,KAAK,MAAM;AAAA,EAC1B;AAAA,EACA,WAAW,KAAK,UAAU;AACxB,QAAI,SAAS,EAAE,GAAG,UAAU,GAAG,CAAC,EAAE;AAGlC,SAAK,KAAK,QAAQ,CAAC,KAAK,aAAa;AACnC,UAAI,QAAQ,IAAI,QAAQ,IAAI,MAAM,GAAG,IAAI,KAAK,MAAM,KAAK,IAAI,IAAI;AAEjE,UAAI,CAAC,UAAU,KAAK,GAAG;AACrB;AAAA,MACF;AAEA,UAAI,QAAQ,KAAK,GAAG;AAClB,YAAI,aAAa,CAAC;AAClB,cAAM,QAAQ,CAAC,EAAE,gBAAgB,IAAI,MAAM,CAAC;AAE5C,eAAO,MAAM,QAAQ;AACnB,gBAAM,EAAE,gBAAgB,OAAAC,OAAM,IAAI,MAAM,IAAI;AAE5C,cAAI,CAAC,UAAUA,MAAK,GAAG;AACrB;AAAA,UACF;AAEA,cAAI,SAASA,MAAK,KAAK,CAAC,QAAQA,MAAK,GAAG;AACtC,gBAAI,YAAY;AAAA,cACd,GAAGA;AAAA,cACH,GAAG;AAAA,cACH,GAAG,KAAK,KAAK,IAAIA,MAAK;AAAA,YACxB;AAEA,uBAAW,KAAK,SAAS;AAAA,UAC3B,WAAW,QAAQA,MAAK,GAAG;AACzB,YAAAA,OAAM,QAAQ,CAAC,MAAM,MAAM;AACzB,oBAAM,KAAK;AAAA,gBACT,gBAAgB;AAAA,gBAChB,OAAO;AAAA,cACT,CAAC;AAAA,YACH,CAAC;AAAA,UACH,MAAO;AAAA,QACT;AACA,eAAO,EAAE,QAAQ,IAAI;AAAA,MACvB,WAAW,SAAS,KAAK,KAAK,CAAC,QAAQ,KAAK,GAAG;AAC7C,YAAI,YAAY;AAAA,UACd,GAAG;AAAA,UACH,GAAG,KAAK,KAAK,IAAI,KAAK;AAAA,QACxB;AAEA,eAAO,EAAE,QAAQ,IAAI;AAAA,MACvB;AAAA,IACF,CAAC;AAED,SAAK,QAAQ,KAAK,MAAM;AAAA,EAC1B;AAAA,EACA,SAAS;AACP,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,SAAS,KAAK;AAAA,IAChB;AAAA,EACF;AACF;AAEA,SAAS,YACP,MACA,MACA,EAAE,QAAQ,OAAO,OAAO,kBAAkB,OAAO,gBAAgB,IAAI,CAAC,GACtE;AACA,QAAM,UAAU,IAAI,UAAU,EAAE,OAAO,gBAAgB,CAAC;AACxD,UAAQ,QAAQ,KAAK,IAAI,SAAS,CAAC;AACnC,UAAQ,WAAW,IAAI;AACvB,UAAQ,OAAO;AACf,SAAO;AACT;AAEA,SAAS,WACP,MACA,EAAE,QAAQ,OAAO,OAAO,kBAAkB,OAAO,gBAAgB,IAAI,CAAC,GACtE;AACA,QAAM,EAAE,MAAM,QAAQ,IAAI;AAC1B,QAAM,UAAU,IAAI,UAAU,EAAE,OAAO,gBAAgB,CAAC;AACxD,UAAQ,QAAQ,IAAI;AACpB,UAAQ,gBAAgB,OAAO;AAC/B,SAAO;AACT;AAEA,SAAS,eACP,SACA;AAAA,EACE,SAAS;AAAA,EACT,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,WAAW,OAAO;AAAA,EAClB,iBAAiB,OAAO;AAC1B,IAAI,CAAC,GACL;AACA,QAAM,WAAW,SAAS,QAAQ;AAElC,MAAI,gBAAgB;AAClB,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,KAAK,IAAI,mBAAmB,eAAe;AAE7D,MAAI,CAAC,UAAU;AAEb,WAAO,YAAY,IAAM;AAAA,EAC3B;AAEA,SAAO,WAAW,YAAY;AAChC;AAEA,SAAS,qBACP,YAAY,CAAC,GACb,qBAAqB,OAAO,oBAC5B;AACA,MAAI,UAAU,CAAC;AACf,MAAI,QAAQ;AACZ,MAAI,MAAM;AACV,MAAI,IAAI;AAER,WAAS,MAAM,UAAU,QAAQ,IAAI,KAAK,KAAK,GAAG;AAChD,QAAI,QAAQ,UAAU,CAAC;AACvB,QAAI,SAAS,UAAU,IAAI;AACzB,cAAQ;AAAA,IACV,WAAW,CAAC,SAAS,UAAU,IAAI;AACjC,YAAM,IAAI;AACV,UAAI,MAAM,QAAQ,KAAK,oBAAoB;AACzC,gBAAQ,KAAK,CAAC,OAAO,GAAG,CAAC;AAAA,MAC3B;AACA,cAAQ;AAAA,IACV;AAAA,EACF;AAGA,MAAI,UAAU,IAAI,CAAC,KAAK,IAAI,SAAS,oBAAoB;AACvD,YAAQ,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;AAAA,EAC7B;AAEA,SAAO;AACT;AAGA,IAAM,WAAW;AAEjB,SAAS,OACP,MACA,SACA,iBACA;AAAA,EACE,WAAW,OAAO;AAAA,EAClB,WAAW,OAAO;AAAA,EAClB,YAAY,OAAO;AAAA,EACnB,iBAAiB,OAAO;AAAA,EACxB,qBAAqB,OAAO;AAAA,EAC5B,iBAAiB,OAAO;AAAA,EACxB,iBAAiB,OAAO;AAC1B,IAAI,CAAC,GACL;AACA,MAAI,QAAQ,SAAS,UAAU;AAC7B,UAAM,IAAI,MAAM,yBAAyB,QAAQ,CAAC;AAAA,EACpD;AAEA,QAAM,aAAa,QAAQ;AAE3B,QAAM,UAAU,KAAK;AAErB,QAAM,mBAAmB,KAAK,IAAI,GAAG,KAAK,IAAI,UAAU,OAAO,CAAC;AAEhE,MAAI,mBAAmB;AAEvB,MAAI,eAAe;AAInB,QAAM,iBAAiB,qBAAqB,KAAK;AAEjD,QAAM,YAAY,iBAAiB,MAAM,OAAO,IAAI,CAAC;AAErD,MAAI;AAGJ,UAAQ,QAAQ,KAAK,QAAQ,SAAS,YAAY,KAAK,IAAI;AACzD,QAAI,QAAQ,eAAe,SAAS;AAAA,MAClC,iBAAiB;AAAA,MACjB;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAED,uBAAmB,KAAK,IAAI,OAAO,gBAAgB;AACnD,mBAAe,QAAQ;AAEvB,QAAI,gBAAgB;AAClB,UAAI,IAAI;AACR,aAAO,IAAI,YAAY;AACrB,kBAAU,QAAQ,CAAC,IAAI;AACvB,aAAK;AAAA,MACP;AAAA,IACF;AAAA,EACF;AAGA,iBAAe;AAEf,MAAI,aAAa,CAAC;AAClB,MAAI,aAAa;AACjB,MAAI,SAAS,aAAa;AAE1B,QAAM,OAAO,KAAM,aAAa;AAEhC,WAAS,IAAI,GAAG,IAAI,YAAY,KAAK,GAAG;AAItC,QAAI,SAAS;AACb,QAAI,SAAS;AAEb,WAAO,SAAS,QAAQ;AACtB,YAAMC,SAAQ,eAAe,SAAS;AAAA,QACpC,QAAQ;AAAA,QACR,iBAAiB,mBAAmB;AAAA,QACpC;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AAED,UAAIA,UAAS,kBAAkB;AAC7B,iBAAS;AAAA,MACX,OAAO;AACL,iBAAS;AAAA,MACX;AAEA,eAAS,KAAK,OAAO,SAAS,UAAU,IAAI,MAAM;AAAA,IACpD;AAGA,aAAS;AAET,QAAI,QAAQ,KAAK,IAAI,GAAG,mBAAmB,SAAS,CAAC;AACrD,QAAI,SAAS,iBACT,UACA,KAAK,IAAI,mBAAmB,QAAQ,OAAO,IAAI;AAGnD,QAAI,SAAS,MAAM,SAAS,CAAC;AAE7B,WAAO,SAAS,CAAC,KAAK,KAAK,KAAK;AAEhC,aAAS,IAAI,QAAQ,KAAK,OAAO,KAAK,GAAG;AACvC,UAAI,kBAAkB,IAAI;AAC1B,UAAI,YAAY,gBAAgB,KAAK,OAAO,eAAe,CAAC;AAE5D,UAAI,gBAAgB;AAElB,kBAAU,eAAe,IAAI,CAAC,CAAC,CAAC;AAAA,MAClC;AAGA,aAAO,CAAC,KAAM,OAAO,IAAI,CAAC,KAAK,IAAK,KAAK;AAGzC,UAAI,GAAG;AACL,eAAO,CAAC,MACJ,WAAW,IAAI,CAAC,IAAI,WAAW,CAAC,MAAM,IAAK,IAAI,WAAW,IAAI,CAAC;AAAA,MACrE;AAEA,UAAI,OAAO,CAAC,IAAI,MAAM;AACpB,qBAAa,eAAe,SAAS;AAAA,UACnC,QAAQ;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AAID,YAAI,cAAc,kBAAkB;AAElC,6BAAmB;AACnB,yBAAe;AAGf,cAAI,gBAAgB,kBAAkB;AACpC;AAAA,UACF;AAGA,kBAAQ,KAAK,IAAI,GAAG,IAAI,mBAAmB,YAAY;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAGA,UAAM,QAAQ,eAAe,SAAS;AAAA,MACpC,QAAQ,IAAI;AAAA,MACZ,iBAAiB;AAAA,MACjB;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAED,QAAI,QAAQ,kBAAkB;AAC5B;AAAA,IACF;AAEA,iBAAa;AAAA,EACf;AAEA,QAAM,SAAS;AAAA,IACb,SAAS,gBAAgB;AAAA;AAAA,IAEzB,OAAO,KAAK,IAAI,MAAO,UAAU;AAAA,EACnC;AAEA,MAAI,gBAAgB;AAClB,UAAM,UAAU,qBAAqB,WAAW,kBAAkB;AAClE,QAAI,CAAC,QAAQ,QAAQ;AACnB,aAAO,UAAU;AAAA,IACnB,WAAW,gBAAgB;AACzB,aAAO,UAAU;AAAA,IACnB;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,sBAAsB,SAAS;AACtC,MAAI,OAAO,CAAC;AAEZ,WAAS,IAAI,GAAG,MAAM,QAAQ,QAAQ,IAAI,KAAK,KAAK,GAAG;AACrD,UAAM,OAAO,QAAQ,OAAO,CAAC;AAC7B,SAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAM,KAAM,MAAM,IAAI;AAAA,EACpD;AAEA,SAAO;AACT;AAEA,IAAM,kBAAkB,OAAO,UAAU,aAClC,CAAC,QAAQ,IAAI,UAAU,KAAK,EAAE,QAAQ,0kEAA0kE,EAAE,MAClnE,CAAC,QAAQ;AAEhB,IAAM,cAAN,MAAkB;AAAA,EAChB,YACE,SACA;AAAA,IACE,WAAW,OAAO;AAAA,IAClB,YAAY,OAAO;AAAA,IACnB,WAAW,OAAO;AAAA,IAClB,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,IACxB,qBAAqB,OAAO;AAAA,IAC5B,kBAAkB,OAAO;AAAA,IACzB,mBAAmB,OAAO;AAAA,IAC1B,iBAAiB,OAAO;AAAA,EAC1B,IAAI,CAAC,GACL;AACA,SAAK,UAAU;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,cAAU,kBAAkB,UAAU,QAAQ,YAAY;AAC1D,cAAU,mBAAmB,gBAAgB,OAAO,IAAI;AACxD,SAAK,UAAU;AAEf,SAAK,SAAS,CAAC;AAEf,QAAI,CAAC,KAAK,QAAQ,QAAQ;AACxB;AAAA,IACF;AAEA,UAAM,WAAW,CAACC,UAAS,eAAe;AACxC,WAAK,OAAO,KAAK;AAAA,QACf,SAAAA;AAAA,QACA,UAAU,sBAAsBA,QAAO;AAAA,QACvC;AAAA,MACF,CAAC;AAAA,IACH;AAEA,UAAM,MAAM,KAAK,QAAQ;AAEzB,QAAI,MAAM,UAAU;AAClB,UAAI,IAAI;AACR,YAAM,YAAY,MAAM;AACxB,YAAM,MAAM,MAAM;AAElB,aAAO,IAAI,KAAK;AACd,iBAAS,KAAK,QAAQ,OAAO,GAAG,QAAQ,GAAG,CAAC;AAC5C,aAAK;AAAA,MACP;AAEA,UAAI,WAAW;AACb,cAAM,aAAa,MAAM;AACzB,iBAAS,KAAK,QAAQ,OAAO,UAAU,GAAG,UAAU;AAAA,MACtD;AAAA,IACF,OAAO;AACL,eAAS,KAAK,SAAS,CAAC;AAAA,IAC1B;AAAA,EACF;AAAA,EAEA,SAAS,MAAM;AACb,UAAM,EAAE,iBAAiB,kBAAkB,eAAe,IAAI,KAAK;AAEnE,WAAO,kBAAkB,OAAO,KAAK,YAAY;AACjD,WAAO,mBAAmB,gBAAgB,IAAI,IAAI;AAGlD,QAAI,KAAK,YAAY,MAAM;AACzB,UAAIC,UAAS;AAAA,QACX,SAAS;AAAA,QACT,OAAO;AAAA,MACT;AAEA,UAAI,gBAAgB;AAClB,QAAAA,QAAO,UAAU,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC;AAAA,MACxC;AAEA,aAAOA;AAAA,IACT;AAGA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI,KAAK;AAET,QAAI,aAAa,CAAC;AAClB,QAAI,aAAa;AACjB,QAAI,aAAa;AAEjB,SAAK,OAAO,QAAQ,CAAC,EAAE,SAAS,UAAU,WAAW,MAAM;AACzD,YAAM,EAAE,SAAS,OAAO,QAAQ,IAAI,OAAO,MAAM,SAAS,UAAU;AAAA,QAClE,UAAU,WAAW;AAAA,QACrB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AAED,UAAI,SAAS;AACX,qBAAa;AAAA,MACf;AAEA,oBAAc;AAEd,UAAI,WAAW,SAAS;AACtB,qBAAa,CAAC,GAAG,YAAY,GAAG,OAAO;AAAA,MACzC;AAAA,IACF,CAAC;AAED,QAAI,SAAS;AAAA,MACX,SAAS;AAAA,MACT,OAAO,aAAa,aAAa,KAAK,OAAO,SAAS;AAAA,IACxD;AAEA,QAAI,cAAc,gBAAgB;AAChC,aAAO,UAAU;AAAA,IACnB;AAEA,WAAO;AAAA,EACT;AACF;AAEA,IAAM,YAAN,MAAgB;AAAA,EACd,YAAY,SAAS;AACnB,SAAK,UAAU;AAAA,EACjB;AAAA,EACA,OAAO,aAAa,SAAS;AAC3B,WAAO,SAAS,SAAS,KAAK,UAAU;AAAA,EAC1C;AAAA,EACA,OAAO,cAAc,SAAS;AAC5B,WAAO,SAAS,SAAS,KAAK,WAAW;AAAA,EAC3C;AAAA,EACA,SAAiB;AAAA,EAAC;AACpB;AAEA,SAAS,SAAS,SAAS,KAAK;AAC9B,QAAM,UAAU,QAAQ,MAAM,GAAG;AACjC,SAAO,UAAU,QAAQ,CAAC,IAAI;AAChC;AAIA,IAAM,aAAN,cAAyB,UAAU;AAAA,EACjC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,UAAU,SAAS,KAAK;AAE9B,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,QAAQ,SAAS,CAAC;AAAA,IACtC;AAAA,EACF;AACF;AAIA,IAAM,oBAAN,cAAgC,UAAU;AAAA,EACxC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,QAAQ,KAAK,QAAQ,KAAK,OAAO;AACvC,UAAM,UAAU,UAAU;AAE1B,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC;AAAA,IAC9B;AAAA,EACF;AACF;AAIA,IAAM,mBAAN,cAA+B,UAAU;AAAA,EACvC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,UAAU,KAAK,WAAW,KAAK,OAAO;AAE5C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,QAAQ,SAAS,CAAC;AAAA,IACtC;AAAA,EACF;AACF;AAIA,IAAM,0BAAN,cAAsC,UAAU;AAAA,EAC9C,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,UAAU,CAAC,KAAK,WAAW,KAAK,OAAO;AAE7C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC;AAAA,IAC9B;AAAA,EACF;AACF;AAIA,IAAM,mBAAN,cAA+B,UAAU;AAAA,EACvC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,UAAU,KAAK,SAAS,KAAK,OAAO;AAE1C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,KAAK,SAAS,KAAK,QAAQ,QAAQ,KAAK,SAAS,CAAC;AAAA,IAC9D;AAAA,EACF;AACF;AAIA,IAAM,0BAAN,cAAsC,UAAU;AAAA,EAC9C,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,UAAM,UAAU,CAAC,KAAK,SAAS,KAAK,OAAO;AAC3C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC;AAAA,IAC9B;AAAA,EACF;AACF;AAEA,IAAM,aAAN,cAAyB,UAAU;AAAA,EACjC,YACE,SACA;AAAA,IACE,WAAW,OAAO;AAAA,IAClB,YAAY,OAAO;AAAA,IACnB,WAAW,OAAO;AAAA,IAClB,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,IACxB,qBAAqB,OAAO;AAAA,IAC5B,kBAAkB,OAAO;AAAA,IACzB,mBAAmB,OAAO;AAAA,IAC1B,iBAAiB,OAAO;AAAA,EAC1B,IAAI,CAAC,GACL;AACA,UAAM,OAAO;AACb,SAAK,eAAe,IAAI,YAAY,SAAS;AAAA,MAC3C;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,WAAO,KAAK,aAAa,SAAS,IAAI;AAAA,EACxC;AACF;AAIA,IAAM,eAAN,cAA2B,UAAU;AAAA,EACnC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACf;AAAA,EACA,WAAW,OAAO;AAChB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,aAAa;AACtB,WAAO;AAAA,EACT;AAAA,EACA,WAAW,cAAc;AACvB,WAAO;AAAA,EACT;AAAA,EACA,OAAO,MAAM;AACX,QAAI,WAAW;AACf,QAAI;AAEJ,UAAM,UAAU,CAAC;AACjB,UAAM,aAAa,KAAK,QAAQ;AAGhC,YAAQ,QAAQ,KAAK,QAAQ,KAAK,SAAS,QAAQ,KAAK,IAAI;AAC1D,iBAAW,QAAQ;AACnB,cAAQ,KAAK,CAAC,OAAO,WAAW,CAAC,CAAC;AAAA,IACpC;AAEA,UAAM,UAAU,CAAC,CAAC,QAAQ;AAE1B,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AACF;AAGA,IAAM,YAAY;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,eAAe,UAAU;AAG/B,IAAM,WAAW;AACjB,IAAM,WAAW;AAKjB,SAAS,WAAW,SAAS,UAAU,CAAC,GAAG;AACzC,SAAO,QAAQ,MAAM,QAAQ,EAAE,IAAI,CAAC,SAAS;AAC3C,QAAI,QAAQ,KACT,KAAK,EACL,MAAM,QAAQ,EACd,OAAO,CAACC,UAASA,SAAQ,CAAC,CAACA,MAAK,KAAK,CAAC;AAEzC,QAAI,UAAU,CAAC;AACf,aAAS,IAAI,GAAG,MAAM,MAAM,QAAQ,IAAI,KAAK,KAAK,GAAG;AACnD,YAAM,YAAY,MAAM,CAAC;AAGzB,UAAI,QAAQ;AACZ,UAAI,MAAM;AACV,aAAO,CAAC,SAAS,EAAE,MAAM,cAAc;AACrC,cAAM,WAAW,UAAU,GAAG;AAC9B,YAAI,QAAQ,SAAS,aAAa,SAAS;AAC3C,YAAI,OAAO;AACT,kBAAQ,KAAK,IAAI,SAAS,OAAO,OAAO,CAAC;AACzC,kBAAQ;AAAA,QACV;AAAA,MACF;AAEA,UAAI,OAAO;AACT;AAAA,MACF;AAGA,YAAM;AACN,aAAO,EAAE,MAAM,cAAc;AAC3B,cAAM,WAAW,UAAU,GAAG;AAC9B,YAAI,QAAQ,SAAS,cAAc,SAAS;AAC5C,YAAI,OAAO;AACT,kBAAQ,KAAK,IAAI,SAAS,OAAO,OAAO,CAAC;AACzC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AACH;AAIA,IAAM,gBAAgB,oBAAI,IAAI,CAAC,WAAW,MAAM,aAAa,IAAI,CAAC;AA8BlE,IAAM,iBAAN,MAAqB;AAAA,EACnB,YACE,SACA;AAAA,IACE,kBAAkB,OAAO;AAAA,IACzB,mBAAmB,OAAO;AAAA,IAC1B,iBAAiB,OAAO;AAAA,IACxB,qBAAqB,OAAO;AAAA,IAC5B,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,IACxB,WAAW,OAAO;AAAA,IAClB,YAAY,OAAO;AAAA,IACnB,WAAW,OAAO;AAAA,EACpB,IAAI,CAAC,GACL;AACA,SAAK,QAAQ;AACb,SAAK,UAAU;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,cAAU,kBAAkB,UAAU,QAAQ,YAAY;AAC1D,cAAU,mBAAmB,gBAAgB,OAAO,IAAI;AACxD,SAAK,UAAU;AACf,SAAK,QAAQ,WAAW,KAAK,SAAS,KAAK,OAAO;AAAA,EACpD;AAAA,EAEA,OAAO,UAAU,GAAG,SAAS;AAC3B,WAAO,QAAQ;AAAA,EACjB;AAAA,EAEA,SAAS,MAAM;AACb,UAAM,QAAQ,KAAK;AAEnB,QAAI,CAAC,OAAO;AACV,aAAO;AAAA,QACL,SAAS;AAAA,QACT,OAAO;AAAA,MACT;AAAA,IACF;AAEA,UAAM,EAAE,gBAAgB,iBAAiB,iBAAiB,IAAI,KAAK;AAEnE,WAAO,kBAAkB,OAAO,KAAK,YAAY;AACjD,WAAO,mBAAmB,gBAAgB,IAAI,IAAI;AAElD,QAAI,aAAa;AACjB,QAAI,aAAa,CAAC;AAClB,QAAI,aAAa;AAGjB,aAAS,IAAI,GAAG,OAAO,MAAM,QAAQ,IAAI,MAAM,KAAK,GAAG;AACrD,YAAMC,aAAY,MAAM,CAAC;AAGzB,iBAAW,SAAS;AACpB,mBAAa;AAGb,eAAS,IAAI,GAAG,OAAOA,WAAU,QAAQ,IAAI,MAAM,KAAK,GAAG;AACzD,cAAM,WAAWA,WAAU,CAAC;AAC5B,cAAM,EAAE,SAAS,SAAS,MAAM,IAAI,SAAS,OAAO,IAAI;AAExD,YAAI,SAAS;AACX,wBAAc;AACd,wBAAc;AACd,cAAI,gBAAgB;AAClB,kBAAM,OAAO,SAAS,YAAY;AAClC,gBAAI,cAAc,IAAI,IAAI,GAAG;AAC3B,2BAAa,CAAC,GAAG,YAAY,GAAG,OAAO;AAAA,YACzC,OAAO;AACL,yBAAW,KAAK,OAAO;AAAA,YACzB;AAAA,UACF;AAAA,QACF,OAAO;AACL,uBAAa;AACb,uBAAa;AACb,qBAAW,SAAS;AACpB;AAAA,QACF;AAAA,MACF;AAGA,UAAI,YAAY;AACd,YAAI,SAAS;AAAA,UACX,SAAS;AAAA,UACT,OAAO,aAAa;AAAA,QACtB;AAEA,YAAI,gBAAgB;AAClB,iBAAO,UAAU;AAAA,QACnB;AAEA,eAAO;AAAA,MACT;AAAA,IACF;AAGA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,IAAM,sBAAsB,CAAC;AAE7B,SAAS,YAAY,MAAM;AACzB,sBAAoB,KAAK,GAAG,IAAI;AAClC;AAEA,SAAS,eAAe,SAAS,SAAS;AACxC,WAAS,IAAI,GAAG,MAAM,oBAAoB,QAAQ,IAAI,KAAK,KAAK,GAAG;AACjE,QAAI,gBAAgB,oBAAoB,CAAC;AACzC,QAAI,cAAc,UAAU,SAAS,OAAO,GAAG;AAC7C,aAAO,IAAI,cAAc,SAAS,OAAO;AAAA,IAC3C;AAAA,EACF;AAEA,SAAO,IAAI,YAAY,SAAS,OAAO;AACzC;AAEA,IAAM,kBAAkB;AAAA,EACtB,KAAK;AAAA,EACL,IAAI;AACN;AAEA,IAAM,UAAU;AAAA,EACd,MAAM;AAAA,EACN,SAAS;AACX;AAEA,IAAM,eAAe,CAAC,UACpB,CAAC,EAAE,MAAM,gBAAgB,GAAG,KAAK,MAAM,gBAAgB,EAAE;AAE3D,IAAM,SAAS,CAAC,UAAU,CAAC,CAAC,MAAM,QAAQ,IAAI;AAE9C,IAAM,SAAS,CAAC,UACd,CAAC,QAAQ,KAAK,KAAK,SAAS,KAAK,KAAK,CAAC,aAAa,KAAK;AAE3D,IAAM,oBAAoB,CAAC,WAAW;AAAA,EACpC,CAAC,gBAAgB,GAAG,GAAG,OAAO,KAAK,KAAK,EAAE,IAAI,CAAC,SAAS;AAAA,IACtD,CAAC,GAAG,GAAG,MAAM,GAAG;AAAA,EAClB,EAAE;AACJ;AAIA,SAAS,MAAM,OAAO,SAAS,EAAE,OAAO,KAAK,IAAI,CAAC,GAAG;AACnD,QAAM,OAAO,CAACC,WAAU;AACtB,QAAI,OAAO,OAAO,KAAKA,MAAK;AAE5B,UAAM,cAAc,OAAOA,MAAK;AAEhC,QAAI,CAAC,eAAe,KAAK,SAAS,KAAK,CAAC,aAAaA,MAAK,GAAG;AAC3D,aAAO,KAAK,kBAAkBA,MAAK,CAAC;AAAA,IACtC;AAEA,QAAI,OAAOA,MAAK,GAAG;AACjB,YAAM,MAAM,cAAcA,OAAM,QAAQ,IAAI,IAAI,KAAK,CAAC;AAEtD,YAAM,UAAU,cAAcA,OAAM,QAAQ,OAAO,IAAIA,OAAM,GAAG;AAEhE,UAAI,CAAC,SAAS,OAAO,GAAG;AACtB,cAAM,IAAI,MAAM,qCAAqC,GAAG,CAAC;AAAA,MAC3D;AAEA,YAAM,MAAM;AAAA,QACV,OAAO,YAAY,GAAG;AAAA,QACtB;AAAA,MACF;AAEA,UAAI,MAAM;AACR,YAAI,WAAW,eAAe,SAAS,OAAO;AAAA,MAChD;AAEA,aAAO;AAAA,IACT;AAEA,QAAI,OAAO;AAAA,MACT,UAAU,CAAC;AAAA,MACX,UAAU,KAAK,CAAC;AAAA,IAClB;AAEA,SAAK,QAAQ,CAAC,QAAQ;AACpB,YAAM,QAAQA,OAAM,GAAG;AAEvB,UAAI,QAAQ,KAAK,GAAG;AAClB,cAAM,QAAQ,CAAC,SAAS;AACtB,eAAK,SAAS,KAAK,KAAK,IAAI,CAAC;AAAA,QAC/B,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,aAAa,KAAK,GAAG;AACxB,YAAQ,kBAAkB,KAAK;AAAA,EACjC;AAEA,SAAO,KAAK,KAAK;AACnB;AAGA,SAAS,aACP,SACA,EAAE,kBAAkB,OAAO,gBAAgB,GAC3C;AACA,UAAQ,QAAQ,CAAC,WAAW;AAC1B,QAAI,aAAa;AAEjB,WAAO,QAAQ,QAAQ,CAAC,EAAE,KAAK,MAAAP,OAAM,MAAM,MAAM;AAC/C,YAAM,SAAS,MAAM,IAAI,SAAS;AAElC,oBAAc,KAAK;AAAA,QACjB,UAAU,KAAK,SAAS,OAAO,UAAU;AAAA,SACxC,UAAU,MAAM,kBAAkB,IAAIA;AAAA,MACzC;AAAA,IACF,CAAC;AAED,WAAO,QAAQ;AAAA,EACjB,CAAC;AACH;AAEA,SAAS,iBAAiB,QAAQ,MAAM;AACtC,QAAM,UAAU,OAAO;AACvB,OAAK,UAAU,CAAC;AAEhB,MAAI,CAAC,UAAU,OAAO,GAAG;AACvB;AAAA,EACF;AAEA,UAAQ,QAAQ,CAAC,UAAU;AACzB,QAAI,CAAC,UAAU,MAAM,OAAO,KAAK,CAAC,MAAM,QAAQ,QAAQ;AACtD;AAAA,IACF;AAEA,UAAM,EAAE,SAAS,MAAM,IAAI;AAE3B,QAAI,MAAM;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAEA,QAAI,MAAM,KAAK;AACb,UAAI,MAAM,MAAM,IAAI;AAAA,IACtB;AAEA,QAAI,MAAM,MAAM,IAAI;AAClB,UAAI,WAAW,MAAM;AAAA,IACvB;AAEA,SAAK,QAAQ,KAAK,GAAG;AAAA,EACvB,CAAC;AACH;AAEA,SAAS,eAAe,QAAQ,MAAM;AACpC,OAAK,QAAQ,OAAO;AACtB;AAEA,SAAS,OACP,SACA,MACA;AAAA,EACE,iBAAiB,OAAO;AAAA,EACxB,eAAe,OAAO;AACxB,IAAI,CAAC,GACL;AACA,QAAM,eAAe,CAAC;AAEtB,MAAI,eAAgB,cAAa,KAAK,gBAAgB;AACtD,MAAI,aAAc,cAAa,KAAK,cAAc;AAElD,SAAO,QAAQ,IAAI,CAAC,WAAW;AAC7B,UAAM,EAAE,IAAI,IAAI;AAEhB,UAAM,OAAO;AAAA,MACX,MAAM,KAAK,GAAG;AAAA,MACd,UAAU;AAAA,IACZ;AAEA,QAAI,aAAa,QAAQ;AACvB,mBAAa,QAAQ,CAAC,gBAAgB;AACpC,oBAAY,QAAQ,IAAI;AAAA,MAC1B,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,IAAM,OAAN,MAAW;AAAA,EACT,YAAY,MAAM,UAAU,CAAC,GAAG,OAAO;AACrC,SAAK,UAAU,EAAE,GAAG,QAAQ,GAAG,QAAQ;AAEvC,QACE,KAAK,QAAQ,qBACb,OACA;AACA,YAAM,IAAI,MAAM,2BAA2B;AAAA,IAC7C;AAEA,SAAK,YAAY,IAAI,SAAS,KAAK,QAAQ,IAAI;AAE/C,SAAK,cAAc,MAAM,KAAK;AAAA,EAChC;AAAA,EAEA,cAAc,MAAM,OAAO;AACzB,SAAK,QAAQ;AAEb,QAAI,SAAS,EAAE,iBAAiB,YAAY;AAC1C,YAAM,IAAI,MAAM,oBAAoB;AAAA,IACtC;AAEA,SAAK,WACH,SACA,YAAY,KAAK,QAAQ,MAAM,KAAK,OAAO;AAAA,MACzC,OAAO,KAAK,QAAQ;AAAA,MACpB,iBAAiB,KAAK,QAAQ;AAAA,IAChC,CAAC;AAAA,EACL;AAAA,EAEA,IAAI,KAAK;AACP,QAAI,CAAC,UAAU,GAAG,GAAG;AACnB;AAAA,IACF;AAEA,SAAK,MAAM,KAAK,GAAG;AACnB,SAAK,SAAS,IAAI,GAAG;AAAA,EACvB;AAAA,EAEA,OAAO,YAAY,MAAoB,OAAO;AAC5C,UAAM,UAAU,CAAC;AAEjB,aAAS,IAAI,GAAG,MAAM,KAAK,MAAM,QAAQ,IAAI,KAAK,KAAK,GAAG;AACxD,YAAM,MAAM,KAAK,MAAM,CAAC;AACxB,UAAI,UAAU,KAAK,CAAC,GAAG;AACrB,aAAK,SAAS,CAAC;AACf,aAAK;AACL,eAAO;AAEP,gBAAQ,KAAK,GAAG;AAAA,MAClB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,SAAS,KAAK;AACZ,SAAK,MAAM,OAAO,KAAK,CAAC;AACxB,SAAK,SAAS,SAAS,GAAG;AAAA,EAC5B;AAAA,EAEA,WAAW;AACT,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,OAAO,OAAO,EAAE,QAAQ,GAAG,IAAI,CAAC,GAAG;AACjC,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI,KAAK;AAET,QAAI,UAAU,SAAS,KAAK,IACxB,SAAS,KAAK,MAAM,CAAC,CAAC,IACpB,KAAK,kBAAkB,KAAK,IAC5B,KAAK,kBAAkB,KAAK,IAC9B,KAAK,eAAe,KAAK;AAE7B,iBAAa,SAAS,EAAE,gBAAgB,CAAC;AAEzC,QAAI,YAAY;AACd,cAAQ,KAAK,MAAM;AAAA,IACrB;AAEA,QAAI,SAAS,KAAK,KAAK,QAAQ,IAAI;AACjC,gBAAU,QAAQ,MAAM,GAAG,KAAK;AAAA,IAClC;AAEA,WAAO,OAAO,SAAS,KAAK,OAAO;AAAA,MACjC;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,kBAAkB,OAAO;AACvB,UAAM,WAAW,eAAe,OAAO,KAAK,OAAO;AACnD,UAAM,EAAE,QAAQ,IAAI,KAAK;AACzB,UAAM,UAAU,CAAC;AAGjB,YAAQ,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,KAAK,GAAGA,MAAK,MAAM;AAChD,UAAI,CAAC,UAAU,IAAI,GAAG;AACpB;AAAA,MACF;AAEA,YAAM,EAAE,SAAS,OAAO,QAAQ,IAAI,SAAS,SAAS,IAAI;AAE1D,UAAI,SAAS;AACX,gBAAQ,KAAK;AAAA,UACX,MAAM;AAAA,UACN;AAAA,UACA,SAAS,CAAC,EAAE,OAAO,OAAO,MAAM,MAAAA,OAAM,QAAQ,CAAC;AAAA,QACjD,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAAA,EAEA,eAAe,OAAO;AAEpB,UAAM,aAAa,MAAM,OAAO,KAAK,OAAO;AAE5C,UAAM,WAAW,CAAC,MAAM,MAAM,QAAQ;AACpC,UAAI,CAAC,KAAK,UAAU;AAClB,cAAM,EAAE,OAAO,SAAS,IAAI;AAE5B,cAAM,UAAU,KAAK,aAAa;AAAA,UAChC,KAAK,KAAK,UAAU,IAAI,KAAK;AAAA,UAC7B,OAAO,KAAK,SAAS,uBAAuB,MAAM,KAAK;AAAA,UACvD;AAAA,QACF,CAAC;AAED,YAAI,WAAW,QAAQ,QAAQ;AAC7B,iBAAO;AAAA,YACL;AAAA,cACE;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,eAAO,CAAC;AAAA,MACV;AAEA,YAAM,MAAM,CAAC;AACb,eAAS,IAAI,GAAG,MAAM,KAAK,SAAS,QAAQ,IAAI,KAAK,KAAK,GAAG;AAC3D,cAAM,QAAQ,KAAK,SAAS,CAAC;AAC7B,cAAM,SAAS,SAAS,OAAO,MAAM,GAAG;AACxC,YAAI,OAAO,QAAQ;AACjB,cAAI,KAAK,GAAG,MAAM;AAAA,QACpB,WAAW,KAAK,aAAa,gBAAgB,KAAK;AAChD,iBAAO,CAAC;AAAA,QACV;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,UAAM,UAAU,KAAK,SAAS;AAC9B,UAAM,YAAY,CAAC;AACnB,UAAM,UAAU,CAAC;AAEjB,YAAQ,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,IAAI,MAAM;AACvC,UAAI,UAAU,IAAI,GAAG;AACnB,YAAI,aAAa,SAAS,YAAY,MAAM,GAAG;AAE/C,YAAI,WAAW,QAAQ;AAErB,cAAI,CAAC,UAAU,GAAG,GAAG;AACnB,sBAAU,GAAG,IAAI,EAAE,KAAK,MAAM,SAAS,CAAC,EAAE;AAC1C,oBAAQ,KAAK,UAAU,GAAG,CAAC;AAAA,UAC7B;AACA,qBAAW,QAAQ,CAAC,EAAE,QAAQ,MAAM;AAClC,sBAAU,GAAG,EAAE,QAAQ,KAAK,GAAG,OAAO;AAAA,UACxC,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkB,OAAO;AACvB,UAAM,WAAW,eAAe,OAAO,KAAK,OAAO;AACnD,UAAM,EAAE,MAAM,QAAQ,IAAI,KAAK;AAC/B,UAAM,UAAU,CAAC;AAGjB,YAAQ,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,IAAI,MAAM;AACvC,UAAI,CAAC,UAAU,IAAI,GAAG;AACpB;AAAA,MACF;AAEA,UAAI,UAAU,CAAC;AAGf,WAAK,QAAQ,CAAC,KAAK,aAAa;AAC9B,gBAAQ;AAAA,UACN,GAAG,KAAK,aAAa;AAAA,YACnB;AAAA,YACA,OAAO,KAAK,QAAQ;AAAA,YACpB;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF,CAAC;AAED,UAAI,QAAQ,QAAQ;AAClB,gBAAQ,KAAK;AAAA,UACX;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAAA,EACA,aAAa,EAAE,KAAK,OAAO,SAAS,GAAG;AACrC,QAAI,CAAC,UAAU,KAAK,GAAG;AACrB,aAAO,CAAC;AAAA,IACV;AAEA,QAAI,UAAU,CAAC;AAEf,QAAI,QAAQ,KAAK,GAAG;AAClB,YAAM,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,KAAK,GAAGA,MAAK,MAAM;AAC9C,YAAI,CAAC,UAAU,IAAI,GAAG;AACpB;AAAA,QACF;AAEA,cAAM,EAAE,SAAS,OAAO,QAAQ,IAAI,SAAS,SAAS,IAAI;AAE1D,YAAI,SAAS;AACX,kBAAQ,KAAK;AAAA,YACX;AAAA,YACA;AAAA,YACA,OAAO;AAAA,YACP;AAAA,YACA,MAAAA;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF,CAAC;AAAA,IACH,OAAO;AACL,YAAM,EAAE,GAAG,MAAM,GAAGA,MAAK,IAAI;AAE7B,YAAM,EAAE,SAAS,OAAO,QAAQ,IAAI,SAAS,SAAS,IAAI;AAE1D,UAAI,SAAS;AACX,gBAAQ,KAAK,EAAE,OAAO,KAAK,OAAO,MAAM,MAAAA,OAAM,QAAQ,CAAC;AAAA,MACzD;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAEA,KAAK,UAAU;AACf,KAAK,cAAc;AACnB,KAAK,aAAa;AAClB,KAAK,SAAS;AAEd;AACE,OAAK,aAAa;AACpB;AAEA;AACE,WAAS,cAAc;AACzB;;;AC9vDO,IAAM,gBAAgB,CAAC,QAC5B,IACG,QAAQ,6CAA6C,EAAE,EACvD,QAAQ,iBAAiB,EAAE,EAC3B,UAAU,KAAK,EACf,KAAK;;;ACFH,IAAM,kBAAkB,CAAC,EAAE,WAAW,UAAU,MAAmF;AAGxI,QAAM,gBAAgB,IAAI,KAAK,WAAW;AAAA,IACxC,WAAW;AAAA,IACX,MAAM;AAAA,MACJ,EAAE,MAAM,mBAAmB,UAAU,GAAG,OAAO,CAAC,QAAQ,OAAO,OAAO,IAAI,WAAW,QAAQ,CAAC,CAAC,EAAE;AAAA,MACjG,EAAE,MAAM,uBAAuB,UAAU,EAAE;AAAA,IAC7C;AAAA,EACF,CAAC;AACD,QAAM,gBAAgB,IAAI,KAAK,WAAW;AAAA,IACxC,WAAW;AAAA;AAAA,IACX,cAAc;AAAA,IACd,YAAY;AAAA,IACZ,MAAM;AAAA,MACJ,EAAE,MAAM,mBAAmB,UAAU,GAAG,OAAO,CAAC,QAAQ,OAAO,OAAO,IAAI,WAAW,QAAQ,CAAC,CAAC,EAAE;AAAA,MACjG,EAAE,MAAM,uBAAuB,UAAU,IAAI;AAAA,MAC7C,EAAE,MAAM,uBAAuB,UAAU,KAAK;AAAA,MAC9C,EAAE,MAAM,mCAAoC,UAAU,KAAK;AAAA,MAC3D,EAAE,MAAM,0BAA0B,UAAU,MAAM,OAAO,SAAO,OAAO,OAAO,IAAI,WAAW,eAAe,CAAC,CAAC,EAAE;AAAA,MAChH,EAAE,MAAM,wBAAwB,UAAU,KAAK;AAAA,MAC/C,EAAE,MAAM,yBAAyB,UAAU,KAAK;AAAA,IAClD;AAAA,EACF,CAAC;AAED,QAAMQ,UAAS,CAAC,UAA6C;AAE3D,UAAM,iBAAiB,cAAc,KAAK;AAG1C,UAAM,mBAAmB,cAAc,OAAO,cAAc;AAG5D,UAAM,mBAAmB,cAAc,OAAO,cAAc;AAE5D,WAAO,CAAC,GAAG,kBAAkB,GAAG,gBAAgB;AAAA,EAClD;AAEA,SAAO;AAAA,IACL,QAAAA;AAAA,EACF;AACF;;;ALrBO,IAAM,gBAAgB,CAAC,YAAiD;AAC7E,MAAI;AAEJ,QAAM,YAAY,oBAAI,IAGpB;AAEF,QAAM,cAAc,QAAQ,eAAe,IAAI,YAAY;AAC3D,QAAM,EAAE,OAAO,YAAY,WAAW,QAAQ,SAAS,aAAa,IAAI;AAExE,MAAI,CAAC;AACH,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAEF,MAAI,SAAS,cAAc,CAAC;AAC1B,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAEF,MAAI,SAAS,aAAa,CAAC;AACzB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAEF,QAAM,gCAAgC,CACpC,iBACI;AAAA,IACJ,UAAU,CAAC,gBAAgB,WAAW;AAAA,IACtC,SAAS,MAAM,iBAAoB,aAAa,EAAE,MAAM,WAAW,QAAQ,cAAc,QAAQ,CAAC;AAAA,EACpG;AAKA,QAAM,uBAA6C,OACjD,gBACG;AAEH,QAAI;AACF,YAAM,WAAW,MAAM,YAAY,gBAIjC,8BAA8B,WAAW,CAAC;AAC5C,aAAO;AAAA,IACT,SAAS,OAAO;AACd,YAAM;AAAA,IACR;AAAA,EACF;AAEA,QAAM,mBAAqC,OACzC,OACG;AACH,QAAI,OAAO,QAAQ,OAAO,OAAW,QAAO;AAC5C,UAAM,cAAc,GAAG,MAAM,GAAG,GAAG,YAAY,GAAG,CAAC;AACnD,UAAM,UAAU,MAAM,YAAY,gBAAuC;AAAA,MACvE,UAAU,CAAC,gBAAgB,aAAa,EAAE;AAAA,MAC1C,SAAS,YAAY;AACnB,cAAM,WAAW,MAAM,qBAAqB,WAAW;AACvD,cAAMC,WAAU,SAAS;AAAA,UACvB,CAAC,MAAM,EAAE,OAAO;AAAA,QAClB;AACA,eAAOA,YAAW;AAAA,MACpB;AAAA,IACF,CAAC;AACD,WAAO;AAAA,EACT;AAGA,QAAM,YAAY,gBAAgB,EAAE,kBAAkB,qBAAqB,CAAC;AAK5E,QAAM,mBAAmB,CACvB,aACA,oBACG;AACH,QAAI,UAAU,IAAI,WAAW,GAAG;AAC9B,cAAQ,KAAK,gBAAgB,WAAW,iBAAiB;AACzD,YAAM,SAAS,UAAU,IAAI,WAAW;AACxC,aAAO,OAAO;AAAA,IAChB;AACA,UAAMC,WAAU,8BAA8B,WAAW;AACzD,UAAM,WAAW,IAAI,cAAc,aAAa;AAAA,MAC9C,GAAGA;AAAA,MACH;AAAA,IACF,CAAC;AACD,UAAM,cAAc,SAAS,UAAU,MAAM;AAC3C,cAAQ,IAAI,2BAA2B,WAAW,wBAAwB,eAAe,KAAK;AAAA,IAEhG,CAAC;AACD,cAAU,IAAI,aAAa,EAAE,UAAU,YAAY,CAAC;AAEpD,WAAO;AAAA,EACT;AAEA,QAAM,kBAAkB,CAAC,gBAA6B;AACpD,UAAM,SAAS,UAAU,IAAI,WAAW;AACxC,QAAI,CAAC,OAAQ;AAEb,WAAO,YAAY;AACnB,cAAU,OAAO,WAAW;AAAA,EAC9B;AAEA,QAAM,mBAAmB,MAAM;AAC7B,cAAU,QAAQ,CAAC,EAAE,UAAU,YAAY,MAAM;AAC/C,kBAAY;AACZ,eAAS,QAAQ;AAAA,IACnB,CAAC;AACD,cAAU,MAAM;AAAA,EAClB;AAEA,QAAM,iCAAiC,CACrC,aACA,SAAuB,CAAC,GACxBA,WAA+B,CAAC,OACwD;AAAA,IACxF,UAAU,CAAC,aAAa,QAAQ,MAAM;AAAA,IACtC,SAAS,YAAY;AACnB,YAAM,WAAW,MAAM,qBAAwB,WAAW;AAG1D,YAAM,UAAU,OAAO,WAAW,CAAC;AACnC,UAAI,SAAS;AACb,UAAI,OAAO,SAAS;AAClB,iBAAS,SAAS,OAAO,OAAK,aAAa,GAAG,OAAO,CAAC;AAAA,MACxD;AAGA,aAAO,OAAO,aAAa,OACvB,MAAM,QAAQ,IAAI,OAAO,IAAI,CAAC,MAAM,UAAU,WAAW,EAAE,CAAC,CAAC,CAAC,IAC9D;AAAA,IACN;AAAA,IACA,GAAIA,YAAW,CAAC;AAAA,EAClB;AAEA,QAAM,6BAA6B,CACjC,aACA,IACA,SAAqB,CAAC,GACtBA,WAA+B,CAAC,OACoD;AAAA,IACpF,UAAU,CAAC,aAAa,UAAU,IAAI,MAAM;AAAA,IAC5C,SAAS,YAAY;AACnB,YAAM,UAAU,MAAM,iBAAoB,EAAE;AAC5C,aAAO,OAAO,aAAa,OACvB,MAAM,UAAU,WAAW,EAAE,OAAO,IACpC,QAAQ,QAAQ,OAAO;AAAA,IAC7B;AAAA,IACA,GAAIA,YAAW,CAAC;AAAA,EAClB;AAIA,iBAAe,aAAoC,aAAgB,QAAuB;AACxF,UAAM,qBAAqB;AAAA,MACzB;AAAA,MACA;AAAA,IACF;AACA,UAAM,WAAW,MAAM,YAAY,gBAAgB,kBAAkB;AACrE,WAAQ,QAAQ,aAAa,OAAQ,WAA+C;AAAA,EACtF;AAIA,iBAAe,SAAiC,aAAgB,IAAY,QAAqB;AAC/F,UAAM,mBAAmB;AAAA,MACvB;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,UAAM,UAAU,MAAM,YAAY,gBAAgB,gBAAgB;AAClE,WAAO;AAAA,EACT;AAEA,QAAM,WAAW,OAAO,QAAoD;AAC1E,QAAI,CAAC,cAAc;AACjB,YAAM,CAAC,WAAW,SAAS,IAAI,MAAM,QAAQ,IAAI;AAAA,QAC/C,aAAa,UAAU;AAAA,QACvB,aAAa,SAAS;AAAA,MACxB,CAAC;AACD,YAAM,WAAW,EAAE,WAAW,UAAU;AACxC,qBAAe,gBAAgB,QAAQ;AAAA,IACzC;AACA,WAAO,aAAa,OAAO,GAAG;AAAA,EAChC;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,mBAAmB;AAAA,IACnB;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,EACV;AACF;","names":["QueryObserver","center","booleanPointInPolygon","unit","kiosk","booleanPointInPolygon","section","unit","center","obj","path","norm","value","score","pattern","result","item","searchers","query","search","feature","options"]}