@undp/data-viz 2.5.4 → 2.6.1

package/dist/esm-D23XoYrV.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"esm-D23XoYrV.js","names":[],"sources":["../node_modules/@turf/helpers/dist/esm/index.js","../node_modules/@turf/meta/dist/esm/index.js","../node_modules/rbush/rbush.min.js","../node_modules/tinyqueue/index.js","../node_modules/point-in-polygon/flat.js","../node_modules/point-in-polygon/nested.js","../node_modules/point-in-polygon/index.js","../node_modules/robust-predicates/umd/orient2d.min.js","../node_modules/concaveman/index.js","../node_modules/@turf/convex/dist/esm/index.js","../node_modules/@turf/centroid/dist/esm/index.js","../node_modules/@turf/invariant/dist/esm/index.js","../node_modules/@turf/center-of-mass/dist/esm/index.js"],"sourcesContent":["// index.ts\nvar earthRadius = 63710088e-1;\nvar factors = {\n  centimeters: earthRadius * 100,\n  centimetres: earthRadius * 100,\n  degrees: 360 / (2 * Math.PI),\n  feet: earthRadius * 3.28084,\n  inches: earthRadius * 39.37,\n  kilometers: earthRadius / 1e3,\n  kilometres: earthRadius / 1e3,\n  meters: earthRadius,\n  metres: earthRadius,\n  miles: earthRadius / 1609.344,\n  millimeters: earthRadius * 1e3,\n  millimetres: earthRadius * 1e3,\n  nauticalmiles: earthRadius / 1852,\n  radians: 1,\n  yards: earthRadius * 1.0936\n};\nvar areaFactors = {\n  acres: 247105e-9,\n  centimeters: 1e4,\n  centimetres: 1e4,\n  feet: 10.763910417,\n  hectares: 1e-4,\n  inches: 1550.003100006,\n  kilometers: 1e-6,\n  kilometres: 1e-6,\n  meters: 1,\n  metres: 1,\n  miles: 386e-9,\n  nauticalmiles: 29155334959812285e-23,\n  millimeters: 1e6,\n  millimetres: 1e6,\n  yards: 1.195990046\n};\nfunction feature(geom, properties, options = {}) {\n  const feat = { type: \"Feature\" };\n  if (options.id === 0 || options.id) {\n    feat.id = options.id;\n  }\n  if (options.bbox) {\n    feat.bbox = options.bbox;\n  }\n  feat.properties = properties || {};\n  feat.geometry = geom;\n  return feat;\n}\nfunction geometry(type, coordinates, _options = {}) {\n  switch (type) {\n    case \"Point\":\n      return point(coordinates).geometry;\n    case \"LineString\":\n      return lineString(coordinates).geometry;\n    case \"Polygon\":\n      return polygon(coordinates).geometry;\n    case \"MultiPoint\":\n      return multiPoint(coordinates).geometry;\n    case \"MultiLineString\":\n      return multiLineString(coordinates).geometry;\n    case \"MultiPolygon\":\n      return multiPolygon(coordinates).geometry;\n    default:\n      throw new Error(type + \" is invalid\");\n  }\n}\nfunction point(coordinates, properties, options = {}) {\n  if (!coordinates) {\n    throw new Error(\"coordinates is required\");\n  }\n  if (!Array.isArray(coordinates)) {\n    throw new Error(\"coordinates must be an Array\");\n  }\n  if (coordinates.length < 2) {\n    throw new Error(\"coordinates must be at least 2 numbers long\");\n  }\n  if (!isNumber(coordinates[0]) || !isNumber(coordinates[1])) {\n    throw new Error(\"coordinates must contain numbers\");\n  }\n  const geom = {\n    type: \"Point\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction points(coordinates, properties, options = {}) {\n  return featureCollection(\n    coordinates.map((coords) => {\n      return point(coords, properties);\n    }),\n    options\n  );\n}\nfunction polygon(coordinates, properties, options = {}) {\n  for (const ring of coordinates) {\n    if (ring.length < 4) {\n      throw new Error(\n        \"Each LinearRing of a Polygon must have 4 or more Positions.\"\n      );\n    }\n    if (ring[ring.length - 1].length !== ring[0].length) {\n      throw new Error(\"First and last Position are not equivalent.\");\n    }\n    for (let j = 0; j < ring[ring.length - 1].length; j++) {\n      if (ring[ring.length - 1][j] !== ring[0][j]) {\n        throw new Error(\"First and last Position are not equivalent.\");\n      }\n    }\n  }\n  const geom = {\n    type: \"Polygon\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction polygons(coordinates, properties, options = {}) {\n  return featureCollection(\n    coordinates.map((coords) => {\n      return polygon(coords, properties);\n    }),\n    options\n  );\n}\nfunction lineString(coordinates, properties, options = {}) {\n  if (coordinates.length < 2) {\n    throw new Error(\"coordinates must be an array of two or more positions\");\n  }\n  const geom = {\n    type: \"LineString\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction lineStrings(coordinates, properties, options = {}) {\n  return featureCollection(\n    coordinates.map((coords) => {\n      return lineString(coords, properties);\n    }),\n    options\n  );\n}\nfunction featureCollection(features, options = {}) {\n  const fc = { type: \"FeatureCollection\" };\n  if (options.id) {\n    fc.id = options.id;\n  }\n  if (options.bbox) {\n    fc.bbox = options.bbox;\n  }\n  fc.features = features;\n  return fc;\n}\nfunction multiLineString(coordinates, properties, options = {}) {\n  const geom = {\n    type: \"MultiLineString\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction multiPoint(coordinates, properties, options = {}) {\n  const geom = {\n    type: \"MultiPoint\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction multiPolygon(coordinates, properties, options = {}) {\n  const geom = {\n    type: \"MultiPolygon\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction geometryCollection(geometries, properties, options = {}) {\n  const geom = {\n    type: \"GeometryCollection\",\n    geometries\n  };\n  return feature(geom, properties, options);\n}\nfunction round(num, precision = 0) {\n  if (precision && !(precision >= 0)) {\n    throw new Error(\"precision must be a positive number\");\n  }\n  const multiplier = Math.pow(10, precision || 0);\n  return Math.round(num * multiplier) / multiplier;\n}\nfunction radiansToLength(radians, units = \"kilometers\") {\n  const factor = factors[units];\n  if (!factor) {\n    throw new Error(units + \" units is invalid\");\n  }\n  return radians * factor;\n}\nfunction lengthToRadians(distance, units = \"kilometers\") {\n  const factor = factors[units];\n  if (!factor) {\n    throw new Error(units + \" units is invalid\");\n  }\n  return distance / factor;\n}\nfunction lengthToDegrees(distance, units) {\n  return radiansToDegrees(lengthToRadians(distance, units));\n}\nfunction bearingToAzimuth(bearing) {\n  let angle = bearing % 360;\n  if (angle < 0) {\n    angle += 360;\n  }\n  return angle;\n}\nfunction azimuthToBearing(angle) {\n  angle = angle % 360;\n  if (angle > 180) {\n    return angle - 360;\n  } else if (angle < -180) {\n    return angle + 360;\n  }\n  return angle;\n}\nfunction radiansToDegrees(radians) {\n  const normalisedRadians = radians % (2 * Math.PI);\n  return normalisedRadians * 180 / Math.PI;\n}\nfunction degreesToRadians(degrees) {\n  const normalisedDegrees = degrees % 360;\n  return normalisedDegrees * Math.PI / 180;\n}\nfunction convertLength(length, originalUnit = \"kilometers\", finalUnit = \"kilometers\") {\n  if (!(length >= 0)) {\n    throw new Error(\"length must be a positive number\");\n  }\n  return radiansToLength(lengthToRadians(length, originalUnit), finalUnit);\n}\nfunction convertArea(area, originalUnit = \"meters\", finalUnit = \"kilometers\") {\n  if (!(area >= 0)) {\n    throw new Error(\"area must be a positive number\");\n  }\n  const startFactor = areaFactors[originalUnit];\n  if (!startFactor) {\n    throw new Error(\"invalid original units\");\n  }\n  const finalFactor = areaFactors[finalUnit];\n  if (!finalFactor) {\n    throw new Error(\"invalid final units\");\n  }\n  return area / startFactor * finalFactor;\n}\nfunction isNumber(num) {\n  return !isNaN(num) && num !== null && !Array.isArray(num);\n}\nfunction isObject(input) {\n  return input !== null && typeof input === \"object\" && !Array.isArray(input);\n}\nfunction validateBBox(bbox) {\n  if (!bbox) {\n    throw new Error(\"bbox is required\");\n  }\n  if (!Array.isArray(bbox)) {\n    throw new Error(\"bbox must be an Array\");\n  }\n  if (bbox.length !== 4 && bbox.length !== 6) {\n    throw new Error(\"bbox must be an Array of 4 or 6 numbers\");\n  }\n  bbox.forEach((num) => {\n    if (!isNumber(num)) {\n      throw new Error(\"bbox must only contain numbers\");\n    }\n  });\n}\nfunction validateId(id) {\n  if (!id) {\n    throw new Error(\"id is required\");\n  }\n  if ([\"string\", \"number\"].indexOf(typeof id) === -1) {\n    throw new Error(\"id must be a number or a string\");\n  }\n}\nexport {\n  areaFactors,\n  azimuthToBearing,\n  bearingToAzimuth,\n  convertArea,\n  convertLength,\n  degreesToRadians,\n  earthRadius,\n  factors,\n  feature,\n  featureCollection,\n  geometry,\n  geometryCollection,\n  isNumber,\n  isObject,\n  lengthToDegrees,\n  lengthToRadians,\n  lineString,\n  lineStrings,\n  multiLineString,\n  multiPoint,\n  multiPolygon,\n  point,\n  points,\n  polygon,\n  polygons,\n  radiansToDegrees,\n  radiansToLength,\n  round,\n  validateBBox,\n  validateId\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { feature, point, lineString, isObject } from \"@turf/helpers\";\nfunction coordEach(geojson, callback, excludeWrapCoord) {\n  if (geojson === null) return;\n  var j, k, l, geometry, stopG, coords, geometryMaybeCollection, wrapShrink = 0, coordIndex = 0, isGeometryCollection, type = geojson.type, isFeatureCollection = type === \"FeatureCollection\", isFeature = type === \"Feature\", stop = isFeatureCollection ? geojson.features.length : 1;\n  for (var featureIndex = 0; featureIndex < stop; featureIndex++) {\n    geometryMaybeCollection = isFeatureCollection ? (\n      // @ts-expect-error: Known type conflict\n      geojson.features[featureIndex].geometry\n    ) : isFeature ? (\n      // @ts-expect-error: Known type conflict\n      geojson.geometry\n    ) : geojson;\n    isGeometryCollection = geometryMaybeCollection ? geometryMaybeCollection.type === \"GeometryCollection\" : false;\n    stopG = isGeometryCollection ? geometryMaybeCollection.geometries.length : 1;\n    for (var geomIndex = 0; geomIndex < stopG; geomIndex++) {\n      var multiFeatureIndex = 0;\n      var geometryIndex = 0;\n      geometry = isGeometryCollection ? geometryMaybeCollection.geometries[geomIndex] : geometryMaybeCollection;\n      if (geometry === null) continue;\n      coords = geometry.coordinates;\n      var geomType = geometry.type;\n      wrapShrink = excludeWrapCoord && (geomType === \"Polygon\" || geomType === \"MultiPolygon\") ? 1 : 0;\n      switch (geomType) {\n        case null:\n          break;\n        case \"Point\":\n          if (\n            // @ts-expect-error: Known type conflict\n            callback(\n              coords,\n              coordIndex,\n              featureIndex,\n              multiFeatureIndex,\n              geometryIndex\n            ) === false\n          )\n            return false;\n          coordIndex++;\n          multiFeatureIndex++;\n          break;\n        case \"LineString\":\n        case \"MultiPoint\":\n          for (j = 0; j < coords.length; j++) {\n            if (\n              // @ts-expect-error: Known type conflict\n              callback(\n                coords[j],\n                coordIndex,\n                featureIndex,\n                multiFeatureIndex,\n                geometryIndex\n              ) === false\n            )\n              return false;\n            coordIndex++;\n            if (geomType === \"MultiPoint\") multiFeatureIndex++;\n          }\n          if (geomType === \"LineString\") multiFeatureIndex++;\n          break;\n        case \"Polygon\":\n        case \"MultiLineString\":\n          for (j = 0; j < coords.length; j++) {\n            for (k = 0; k < coords[j].length - wrapShrink; k++) {\n              if (\n                // @ts-expect-error: Known type conflict\n                callback(\n                  coords[j][k],\n                  coordIndex,\n                  featureIndex,\n                  multiFeatureIndex,\n                  geometryIndex\n                ) === false\n              )\n                return false;\n              coordIndex++;\n            }\n            if (geomType === \"MultiLineString\") multiFeatureIndex++;\n            if (geomType === \"Polygon\") geometryIndex++;\n          }\n          if (geomType === \"Polygon\") multiFeatureIndex++;\n          break;\n        case \"MultiPolygon\":\n          for (j = 0; j < coords.length; j++) {\n            geometryIndex = 0;\n            for (k = 0; k < coords[j].length; k++) {\n              for (l = 0; l < coords[j][k].length - wrapShrink; l++) {\n                if (\n                  // @ts-expect-error: Known type conflict\n                  callback(\n                    coords[j][k][l],\n                    coordIndex,\n                    featureIndex,\n                    multiFeatureIndex,\n                    geometryIndex\n                  ) === false\n                )\n                  return false;\n                coordIndex++;\n              }\n              geometryIndex++;\n            }\n            multiFeatureIndex++;\n          }\n          break;\n        case \"GeometryCollection\":\n          for (j = 0; j < geometry.geometries.length; j++)\n            if (\n              // @ts-expect-error: Known type conflict\n              coordEach(geometry.geometries[j], callback, excludeWrapCoord) === false\n            )\n              return false;\n          break;\n        default:\n          throw new Error(\"Unknown Geometry Type\");\n      }\n    }\n  }\n}\nfunction coordReduce(geojson, callback, initialValue, excludeWrapCoord) {\n  var previousValue = initialValue;\n  coordEach(\n    geojson,\n    function(currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {\n      if (coordIndex === 0 && initialValue === void 0)\n        previousValue = currentCoord;\n      else\n        previousValue = callback(\n          // @ts-expect-error: Known type conflict\n          previousValue,\n          currentCoord,\n          coordIndex,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex\n        );\n    },\n    excludeWrapCoord\n  );\n  return previousValue;\n}\nfunction propEach(geojson, callback) {\n  var i;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      for (i = 0; i < geojson.features.length; i++) {\n        if (callback(geojson.features[i].properties, i) === false) break;\n      }\n      break;\n    case \"Feature\":\n      callback(geojson.properties, 0);\n      break;\n  }\n}\nfunction propReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  propEach(geojson, function(currentProperties, featureIndex) {\n    if (featureIndex === 0 && initialValue === void 0)\n      previousValue = currentProperties;\n    else\n      previousValue = callback(previousValue, currentProperties, featureIndex);\n  });\n  return previousValue;\n}\nfunction featureEach(geojson, callback) {\n  if (geojson.type === \"Feature\") {\n    callback(geojson, 0);\n  } else if (geojson.type === \"FeatureCollection\") {\n    for (var i = 0; i < geojson.features.length; i++) {\n      if (callback(geojson.features[i], i) === false) break;\n    }\n  }\n}\nfunction featureReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  featureEach(geojson, function(currentFeature, featureIndex) {\n    if (featureIndex === 0 && initialValue === void 0)\n      previousValue = currentFeature;\n    else previousValue = callback(previousValue, currentFeature, featureIndex);\n  });\n  return previousValue;\n}\nfunction coordAll(geojson) {\n  var coords = [];\n  coordEach(geojson, function(coord) {\n    coords.push(coord);\n  });\n  return coords;\n}\nfunction geomEach(geojson, callback) {\n  var i, j, g, geometry, stopG, geometryMaybeCollection, isGeometryCollection, featureProperties, featureBBox, featureId, featureIndex = 0, isFeatureCollection = geojson.type === \"FeatureCollection\", isFeature = geojson.type === \"Feature\", stop = isFeatureCollection ? geojson.features.length : 1;\n  for (i = 0; i < stop; i++) {\n    geometryMaybeCollection = isFeatureCollection ? (\n      // @ts-expect-error: Known type conflict\n      geojson.features[i].geometry\n    ) : isFeature ? (\n      // @ts-expect-error: Known type conflict\n      geojson.geometry\n    ) : geojson;\n    featureProperties = isFeatureCollection ? (\n      // @ts-expect-error: Known type conflict\n      geojson.features[i].properties\n    ) : isFeature ? (\n      // @ts-expect-error: Known type conflict\n      geojson.properties\n    ) : {};\n    featureBBox = isFeatureCollection ? (\n      // @ts-expect-error: Known type conflict\n      geojson.features[i].bbox\n    ) : isFeature ? (\n      // @ts-expect-error: Known type conflict\n      geojson.bbox\n    ) : void 0;\n    featureId = isFeatureCollection ? (\n      // @ts-expect-error: Known type conflict\n      geojson.features[i].id\n    ) : isFeature ? (\n      // @ts-expect-error: Known type conflict\n      geojson.id\n    ) : void 0;\n    isGeometryCollection = geometryMaybeCollection ? geometryMaybeCollection.type === \"GeometryCollection\" : false;\n    stopG = isGeometryCollection ? geometryMaybeCollection.geometries.length : 1;\n    for (g = 0; g < stopG; g++) {\n      geometry = isGeometryCollection ? geometryMaybeCollection.geometries[g] : geometryMaybeCollection;\n      if (geometry === null) {\n        if (\n          // @ts-expect-error: Known type conflict\n          callback(\n            // @ts-expect-error: Known type conflict\n            null,\n            featureIndex,\n            featureProperties,\n            featureBBox,\n            featureId\n          ) === false\n        )\n          return false;\n        continue;\n      }\n      switch (geometry.type) {\n        case \"Point\":\n        case \"LineString\":\n        case \"MultiPoint\":\n        case \"Polygon\":\n        case \"MultiLineString\":\n        case \"MultiPolygon\": {\n          if (\n            // @ts-expect-error: Known type conflict\n            callback(\n              geometry,\n              featureIndex,\n              featureProperties,\n              featureBBox,\n              featureId\n            ) === false\n          )\n            return false;\n          break;\n        }\n        case \"GeometryCollection\": {\n          for (j = 0; j < geometry.geometries.length; j++) {\n            if (\n              // @ts-expect-error: Known type conflict\n              callback(\n                geometry.geometries[j],\n                featureIndex,\n                featureProperties,\n                featureBBox,\n                featureId\n              ) === false\n            )\n              return false;\n          }\n          break;\n        }\n        default:\n          throw new Error(\"Unknown Geometry Type\");\n      }\n    }\n    featureIndex++;\n  }\n}\nfunction geomReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  geomEach(\n    geojson,\n    function(currentGeometry, featureIndex, featureProperties, featureBBox, featureId) {\n      if (featureIndex === 0 && initialValue === void 0)\n        previousValue = currentGeometry;\n      else\n        previousValue = callback(\n          // @ts-expect-error: Known type conflict\n          previousValue,\n          currentGeometry,\n          featureIndex,\n          featureProperties,\n          featureBBox,\n          featureId\n        );\n    }\n  );\n  return previousValue;\n}\nfunction flattenEach(geojson, callback) {\n  geomEach(geojson, function(geometry, featureIndex, properties, bbox, id) {\n    var type = geometry === null ? null : geometry.type;\n    switch (type) {\n      case null:\n      case \"Point\":\n      case \"LineString\":\n      case \"Polygon\":\n        if (\n          // @ts-expect-error: Known type conflict\n          callback(\n            feature(geometry, properties, { bbox, id }),\n            featureIndex,\n            0\n          ) === false\n        )\n          return false;\n        return;\n    }\n    var geomType;\n    switch (type) {\n      case \"MultiPoint\":\n        geomType = \"Point\";\n        break;\n      case \"MultiLineString\":\n        geomType = \"LineString\";\n        break;\n      case \"MultiPolygon\":\n        geomType = \"Polygon\";\n        break;\n    }\n    for (\n      var multiFeatureIndex = 0;\n      // @ts-expect-error: Known type conflict\n      multiFeatureIndex < geometry.coordinates.length;\n      multiFeatureIndex++\n    ) {\n      var coordinate = geometry.coordinates[multiFeatureIndex];\n      var geom = {\n        type: geomType,\n        coordinates: coordinate\n      };\n      if (\n        // @ts-expect-error: Known type conflict\n        callback(feature(geom, properties), featureIndex, multiFeatureIndex) === false\n      )\n        return false;\n    }\n  });\n}\nfunction flattenReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  flattenEach(\n    geojson,\n    function(currentFeature, featureIndex, multiFeatureIndex) {\n      if (featureIndex === 0 && multiFeatureIndex === 0 && initialValue === void 0)\n        previousValue = currentFeature;\n      else\n        previousValue = callback(\n          // @ts-expect-error: Known type conflict\n          previousValue,\n          currentFeature,\n          featureIndex,\n          multiFeatureIndex\n        );\n    }\n  );\n  return previousValue;\n}\nfunction segmentEach(geojson, callback) {\n  flattenEach(geojson, function(feature2, featureIndex, multiFeatureIndex) {\n    var segmentIndex = 0;\n    if (!feature2.geometry) return;\n    var type = feature2.geometry.type;\n    if (type === \"Point\" || type === \"MultiPoint\") return;\n    var previousCoords;\n    var previousFeatureIndex = 0;\n    var previousMultiIndex = 0;\n    var prevGeomIndex = 0;\n    if (\n      // @ts-expect-error: Known type conflict\n      coordEach(\n        feature2,\n        function(currentCoord, coordIndex, featureIndexCoord, multiPartIndexCoord, geometryIndex) {\n          if (\n            // @ts-expect-error: Known type conflict\n            previousCoords === void 0 || featureIndex > previousFeatureIndex || multiPartIndexCoord > previousMultiIndex || geometryIndex > prevGeomIndex\n          ) {\n            previousCoords = currentCoord;\n            previousFeatureIndex = featureIndex;\n            previousMultiIndex = multiPartIndexCoord;\n            prevGeomIndex = geometryIndex;\n            segmentIndex = 0;\n            return;\n          }\n          var currentSegment = lineString(\n            // @ts-expect-error: Known type conflict\n            [previousCoords, currentCoord],\n            feature2.properties\n          );\n          if (\n            // @ts-expect-error: Known type conflict\n            callback(\n              // @ts-expect-error: Known type conflict\n              currentSegment,\n              featureIndex,\n              multiFeatureIndex,\n              geometryIndex,\n              segmentIndex\n            ) === false\n          )\n            return false;\n          segmentIndex++;\n          previousCoords = currentCoord;\n        }\n      ) === false\n    )\n      return false;\n  });\n}\nfunction segmentReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  var started = false;\n  segmentEach(\n    geojson,\n    function(currentSegment, featureIndex, multiFeatureIndex, geometryIndex, segmentIndex) {\n      if (started === false && initialValue === void 0)\n        previousValue = currentSegment;\n      else\n        previousValue = callback(\n          previousValue,\n          // @ts-expect-error: Known type conflict\n          currentSegment,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex,\n          segmentIndex\n        );\n      started = true;\n    }\n  );\n  return previousValue;\n}\nfunction lineEach(geojson, callback) {\n  if (!geojson) throw new Error(\"geojson is required\");\n  flattenEach(geojson, function(feature2, featureIndex, multiFeatureIndex) {\n    if (feature2.geometry === null) return;\n    var type = feature2.geometry.type;\n    var coords = feature2.geometry.coordinates;\n    switch (type) {\n      case \"LineString\":\n        if (callback(feature2, featureIndex, multiFeatureIndex, 0, 0) === false)\n          return false;\n        break;\n      case \"Polygon\":\n        for (var geometryIndex = 0; geometryIndex < coords.length; geometryIndex++) {\n          if (\n            // @ts-expect-error: Known type conflict\n            callback(\n              // @ts-expect-error: Known type conflict\n              lineString(coords[geometryIndex], feature2.properties),\n              featureIndex,\n              multiFeatureIndex,\n              geometryIndex\n            ) === false\n          )\n            return false;\n        }\n        break;\n    }\n  });\n}\nfunction lineReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  lineEach(\n    geojson,\n    function(currentLine, featureIndex, multiFeatureIndex, geometryIndex) {\n      if (featureIndex === 0 && initialValue === void 0)\n        previousValue = currentLine;\n      else\n        previousValue = callback(\n          previousValue,\n          currentLine,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex\n        );\n    }\n  );\n  return previousValue;\n}\nfunction findSegment(geojson, options) {\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  var featureIndex = options.featureIndex || 0;\n  var multiFeatureIndex = options.multiFeatureIndex || 0;\n  var geometryIndex = options.geometryIndex || 0;\n  var segmentIndex = options.segmentIndex || 0;\n  var properties = options.properties;\n  var geometry;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      if (featureIndex < 0)\n        featureIndex = geojson.features.length + featureIndex;\n      properties = properties || geojson.features[featureIndex].properties;\n      geometry = geojson.features[featureIndex].geometry;\n      break;\n    case \"Feature\":\n      properties = properties || geojson.properties;\n      geometry = geojson.geometry;\n      break;\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n    case \"Polygon\":\n    case \"MultiLineString\":\n    case \"MultiPolygon\":\n      geometry = geojson;\n      break;\n    default:\n      throw new Error(\"geojson is invalid\");\n  }\n  if (geometry === null) return null;\n  var coords = geometry.coordinates;\n  switch (geometry.type) {\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n      if (segmentIndex < 0) segmentIndex = coords.length + segmentIndex - 1;\n      return lineString(\n        // @ts-expect-error: Known type conflict\n        [coords[segmentIndex], coords[segmentIndex + 1]],\n        properties,\n        options\n      );\n    case \"Polygon\":\n      if (geometryIndex < 0) geometryIndex = coords.length + geometryIndex;\n      if (segmentIndex < 0)\n        segmentIndex = coords[geometryIndex].length + segmentIndex - 1;\n      return lineString(\n        [\n          // @ts-expect-error: Known type conflict\n          coords[geometryIndex][segmentIndex],\n          // @ts-expect-error: Known type conflict\n          coords[geometryIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n    case \"MultiLineString\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (segmentIndex < 0)\n        segmentIndex = coords[multiFeatureIndex].length + segmentIndex - 1;\n      return lineString(\n        [\n          // @ts-expect-error: Known type conflict\n          coords[multiFeatureIndex][segmentIndex],\n          // @ts-expect-error: Known type conflict\n          coords[multiFeatureIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n    case \"MultiPolygon\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (geometryIndex < 0)\n        geometryIndex = coords[multiFeatureIndex].length + geometryIndex;\n      if (segmentIndex < 0)\n        segmentIndex = // @ts-expect-error: Known type conflict\n        coords[multiFeatureIndex][geometryIndex].length - segmentIndex - 1;\n      return lineString(\n        [\n          // @ts-expect-error: Known type conflict\n          coords[multiFeatureIndex][geometryIndex][segmentIndex],\n          // @ts-expect-error: Known type conflict\n          coords[multiFeatureIndex][geometryIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n  }\n  throw new Error(\"geojson is invalid\");\n}\nfunction findPoint(geojson, options) {\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  var featureIndex = options.featureIndex || 0;\n  var multiFeatureIndex = options.multiFeatureIndex || 0;\n  var geometryIndex = options.geometryIndex || 0;\n  var coordIndex = options.coordIndex || 0;\n  var properties = options.properties;\n  var geometry;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      if (featureIndex < 0)\n        featureIndex = geojson.features.length + featureIndex;\n      properties = properties || geojson.features[featureIndex].properties;\n      geometry = geojson.features[featureIndex].geometry;\n      break;\n    case \"Feature\":\n      properties = properties || geojson.properties;\n      geometry = geojson.geometry;\n      break;\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n    case \"Polygon\":\n    case \"MultiLineString\":\n    case \"MultiPolygon\":\n      geometry = geojson;\n      break;\n    default:\n      throw new Error(\"geojson is invalid\");\n  }\n  if (geometry === null) return null;\n  var coords = geometry.coordinates;\n  switch (geometry.type) {\n    case \"Point\":\n      return point(coords, properties, options);\n    case \"MultiPoint\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      return point(coords[multiFeatureIndex], properties, options);\n    case \"LineString\":\n      if (coordIndex < 0) coordIndex = coords.length + coordIndex;\n      return point(coords[coordIndex], properties, options);\n    case \"Polygon\":\n      if (geometryIndex < 0) geometryIndex = coords.length + geometryIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[geometryIndex].length + coordIndex;\n      return point(coords[geometryIndex][coordIndex], properties, options);\n    case \"MultiLineString\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[multiFeatureIndex].length + coordIndex;\n      return point(coords[multiFeatureIndex][coordIndex], properties, options);\n    case \"MultiPolygon\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (geometryIndex < 0)\n        geometryIndex = coords[multiFeatureIndex].length + geometryIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[multiFeatureIndex][geometryIndex].length - coordIndex;\n      return point(\n        coords[multiFeatureIndex][geometryIndex][coordIndex],\n        properties,\n        options\n      );\n  }\n  throw new Error(\"geojson is invalid\");\n}\nexport {\n  coordAll,\n  coordEach,\n  coordReduce,\n  featureEach,\n  featureReduce,\n  findPoint,\n  findSegment,\n  flattenEach,\n  flattenReduce,\n  geomEach,\n  geomReduce,\n  lineEach,\n  lineReduce,\n  propEach,\n  propReduce,\n  segmentEach,\n  segmentReduce\n};\n//# sourceMappingURL=index.js.map","!function(t,i){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=i():\"function\"==typeof define&&define.amd?define(i):(t=t||self).RBush=i()}(this,function(){\"use strict\";function t(t,r,e,a,h){!function t(n,r,e,a,h){for(;a>e;){if(a-e>600){var o=a-e+1,s=r-e+1,l=Math.log(o),f=.5*Math.exp(2*l/3),u=.5*Math.sqrt(l*f*(o-f)/o)*(s-o/2<0?-1:1),m=Math.max(e,Math.floor(r-s*f/o+u)),c=Math.min(a,Math.floor(r+(o-s)*f/o+u));t(n,r,m,c,h)}var p=n[r],d=e,x=a;for(i(n,e,r),h(n[a],p)>0&&i(n,e,a);d<x;){for(i(n,d,x),d++,x--;h(n[d],p)<0;)d++;for(;h(n[x],p)>0;)x--}0===h(n[e],p)?i(n,e,x):i(n,++x,a),x<=r&&(e=x+1),r<=x&&(a=x-1)}}(t,r,e||0,a||t.length-1,h||n)}function i(t,i,n){var r=t[i];t[i]=t[n],t[n]=r}function n(t,i){return t<i?-1:t>i?1:0}var r=function(t){void 0===t&&(t=9),this._maxEntries=Math.max(4,t),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()};function e(t,i,n){if(!n)return i.indexOf(t);for(var r=0;r<i.length;r++)if(n(t,i[r]))return r;return-1}function a(t,i){h(t,0,t.children.length,i,t)}function h(t,i,n,r,e){e||(e=p(null)),e.minX=1/0,e.minY=1/0,e.maxX=-1/0,e.maxY=-1/0;for(var a=i;a<n;a++){var h=t.children[a];o(e,t.leaf?r(h):h)}return e}function o(t,i){return t.minX=Math.min(t.minX,i.minX),t.minY=Math.min(t.minY,i.minY),t.maxX=Math.max(t.maxX,i.maxX),t.maxY=Math.max(t.maxY,i.maxY),t}function s(t,i){return t.minX-i.minX}function l(t,i){return t.minY-i.minY}function f(t){return(t.maxX-t.minX)*(t.maxY-t.minY)}function u(t){return t.maxX-t.minX+(t.maxY-t.minY)}function m(t,i){return t.minX<=i.minX&&t.minY<=i.minY&&i.maxX<=t.maxX&&i.maxY<=t.maxY}function c(t,i){return i.minX<=t.maxX&&i.minY<=t.maxY&&i.maxX>=t.minX&&i.maxY>=t.minY}function p(t){return{children:t,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function d(i,n,r,e,a){for(var h=[n,r];h.length;)if(!((r=h.pop())-(n=h.pop())<=e)){var o=n+Math.ceil((r-n)/e/2)*e;t(i,o,n,r,a),h.push(n,o,o,r)}}return r.prototype.all=function(){return this._all(this.data,[])},r.prototype.search=function(t){var i=this.data,n=[];if(!c(t,i))return n;for(var r=this.toBBox,e=[];i;){for(var a=0;a<i.children.length;a++){var h=i.children[a],o=i.leaf?r(h):h;c(t,o)&&(i.leaf?n.push(h):m(t,o)?this._all(h,n):e.push(h))}i=e.pop()}return n},r.prototype.collides=function(t){var i=this.data;if(!c(t,i))return!1;for(var n=[];i;){for(var r=0;r<i.children.length;r++){var e=i.children[r],a=i.leaf?this.toBBox(e):e;if(c(t,a)){if(i.leaf||m(t,a))return!0;n.push(e)}}i=n.pop()}return!1},r.prototype.load=function(t){if(!t||!t.length)return this;if(t.length<this._minEntries){for(var i=0;i<t.length;i++)this.insert(t[i]);return this}var n=this._build(t.slice(),0,t.length-1,0);if(this.data.children.length)if(this.data.height===n.height)this._splitRoot(this.data,n);else{if(this.data.height<n.height){var r=this.data;this.data=n,n=r}this._insert(n,this.data.height-n.height-1,!0)}else this.data=n;return this},r.prototype.insert=function(t){return t&&this._insert(t,this.data.height-1),this},r.prototype.clear=function(){return this.data=p([]),this},r.prototype.remove=function(t,i){if(!t)return this;for(var n,r,a,h=this.data,o=this.toBBox(t),s=[],l=[];h||s.length;){if(h||(h=s.pop(),r=s[s.length-1],n=l.pop(),a=!0),h.leaf){var f=e(t,h.children,i);if(-1!==f)return h.children.splice(f,1),s.push(h),this._condense(s),this}a||h.leaf||!m(h,o)?r?(n++,h=r.children[n],a=!1):h=null:(s.push(h),l.push(n),n=0,r=h,h=h.children[0])}return this},r.prototype.toBBox=function(t){return t},r.prototype.compareMinX=function(t,i){return t.minX-i.minX},r.prototype.compareMinY=function(t,i){return t.minY-i.minY},r.prototype.toJSON=function(){return this.data},r.prototype.fromJSON=function(t){return this.data=t,this},r.prototype._all=function(t,i){for(var n=[];t;)t.leaf?i.push.apply(i,t.children):n.push.apply(n,t.children),t=n.pop();return i},r.prototype._build=function(t,i,n,r){var e,h=n-i+1,o=this._maxEntries;if(h<=o)return a(e=p(t.slice(i,n+1)),this.toBBox),e;r||(r=Math.ceil(Math.log(h)/Math.log(o)),o=Math.ceil(h/Math.pow(o,r-1))),(e=p([])).leaf=!1,e.height=r;var s=Math.ceil(h/o),l=s*Math.ceil(Math.sqrt(o));d(t,i,n,l,this.compareMinX);for(var f=i;f<=n;f+=l){var u=Math.min(f+l-1,n);d(t,f,u,s,this.compareMinY);for(var m=f;m<=u;m+=s){var c=Math.min(m+s-1,u);e.children.push(this._build(t,m,c,r-1))}}return a(e,this.toBBox),e},r.prototype._chooseSubtree=function(t,i,n,r){for(;r.push(i),!i.leaf&&r.length-1!==n;){for(var e=1/0,a=1/0,h=void 0,o=0;o<i.children.length;o++){var s=i.children[o],l=f(s),u=(m=t,c=s,(Math.max(c.maxX,m.maxX)-Math.min(c.minX,m.minX))*(Math.max(c.maxY,m.maxY)-Math.min(c.minY,m.minY))-l);u<a?(a=u,e=l<e?l:e,h=s):u===a&&l<e&&(e=l,h=s)}i=h||i.children[0]}var m,c;return i},r.prototype._insert=function(t,i,n){var r=n?t:this.toBBox(t),e=[],a=this._chooseSubtree(r,this.data,i,e);for(a.children.push(t),o(a,r);i>=0&&e[i].children.length>this._maxEntries;)this._split(e,i),i--;this._adjustParentBBoxes(r,e,i)},r.prototype._split=function(t,i){var n=t[i],r=n.children.length,e=this._minEntries;this._chooseSplitAxis(n,e,r);var h=this._chooseSplitIndex(n,e,r),o=p(n.children.splice(h,n.children.length-h));o.height=n.height,o.leaf=n.leaf,a(n,this.toBBox),a(o,this.toBBox),i?t[i-1].children.push(o):this._splitRoot(n,o)},r.prototype._splitRoot=function(t,i){this.data=p([t,i]),this.data.height=t.height+1,this.data.leaf=!1,a(this.data,this.toBBox)},r.prototype._chooseSplitIndex=function(t,i,n){for(var r,e,a,o,s,l,u,m=1/0,c=1/0,p=i;p<=n-i;p++){var d=h(t,0,p,this.toBBox),x=h(t,p,n,this.toBBox),v=(e=d,a=x,o=void 0,s=void 0,l=void 0,u=void 0,o=Math.max(e.minX,a.minX),s=Math.max(e.minY,a.minY),l=Math.min(e.maxX,a.maxX),u=Math.min(e.maxY,a.maxY),Math.max(0,l-o)*Math.max(0,u-s)),M=f(d)+f(x);v<m?(m=v,r=p,c=M<c?M:c):v===m&&M<c&&(c=M,r=p)}return r||n-i},r.prototype._chooseSplitAxis=function(t,i,n){var r=t.leaf?this.compareMinX:s,e=t.leaf?this.compareMinY:l;this._allDistMargin(t,i,n,r)<this._allDistMargin(t,i,n,e)&&t.children.sort(r)},r.prototype._allDistMargin=function(t,i,n,r){t.children.sort(r);for(var e=this.toBBox,a=h(t,0,i,e),s=h(t,n-i,n,e),l=u(a)+u(s),f=i;f<n-i;f++){var m=t.children[f];o(a,t.leaf?e(m):m),l+=u(a)}for(var c=n-i-1;c>=i;c--){var p=t.children[c];o(s,t.leaf?e(p):p),l+=u(s)}return l},r.prototype._adjustParentBBoxes=function(t,i,n){for(var r=n;r>=0;r--)o(i[r],t)},r.prototype._condense=function(t){for(var i=t.length-1,n=void 0;i>=0;i--)0===t[i].children.length?i>0?(n=t[i-1].children).splice(n.indexOf(t[i]),1):this.clear():a(t[i],this.toBBox)},r});\n","\nexport default class TinyQueue {\n    constructor(data = [], compare = defaultCompare) {\n        this.data = data;\n        this.length = this.data.length;\n        this.compare = compare;\n\n        if (this.length > 0) {\n            for (let i = (this.length >> 1) - 1; i >= 0; i--) this._down(i);\n        }\n    }\n\n    push(item) {\n        this.data.push(item);\n        this.length++;\n        this._up(this.length - 1);\n    }\n\n    pop() {\n        if (this.length === 0) return undefined;\n\n        const top = this.data[0];\n        const bottom = this.data.pop();\n        this.length--;\n\n        if (this.length > 0) {\n            this.data[0] = bottom;\n            this._down(0);\n        }\n\n        return top;\n    }\n\n    peek() {\n        return this.data[0];\n    }\n\n    _up(pos) {\n        const {data, compare} = this;\n        const item = data[pos];\n\n        while (pos > 0) {\n            const parent = (pos - 1) >> 1;\n            const current = data[parent];\n            if (compare(item, current) >= 0) break;\n            data[pos] = current;\n            pos = parent;\n        }\n\n        data[pos] = item;\n    }\n\n    _down(pos) {\n        const {data, compare} = this;\n        const halfLength = this.length >> 1;\n        const item = data[pos];\n\n        while (pos < halfLength) {\n            let left = (pos << 1) + 1;\n            let best = data[left];\n            const right = left + 1;\n\n            if (right < this.length && compare(data[right], best) < 0) {\n                left = right;\n                best = data[right];\n            }\n            if (compare(best, item) >= 0) break;\n\n            data[pos] = best;\n            pos = left;\n        }\n\n        data[pos] = item;\n    }\n}\n\nfunction defaultCompare(a, b) {\n    return a < b ? -1 : a > b ? 1 : 0;\n}\n","module.exports = function pointInPolygonFlat (point, vs, start, end) {\n    var x = point[0], y = point[1];\n    var inside = false;\n    if (start === undefined) start = 0;\n    if (end === undefined) end = vs.length;\n    var len = (end-start)/2;\n    for (var i = 0, j = len - 1; i < len; j = i++) {\n        var xi = vs[start+i*2+0], yi = vs[start+i*2+1];\n        var xj = vs[start+j*2+0], yj = vs[start+j*2+1];\n        var intersect = ((yi > y) !== (yj > y))\n            && (x < (xj - xi) * (y - yi) / (yj - yi) + xi);\n        if (intersect) inside = !inside;\n    }\n    return inside;\n};\n","// ray-casting algorithm based on\n// https://wrf.ecse.rpi.edu/Research/Short_Notes/pnpoly.html\n\nmodule.exports = function pointInPolygonNested (point, vs, start, end) {\n    var x = point[0], y = point[1];\n    var inside = false;\n    if (start === undefined) start = 0;\n    if (end === undefined) end = vs.length;\n    var len = end - start;\n    for (var i = 0, j = len - 1; i < len; j = i++) {\n        var xi = vs[i+start][0], yi = vs[i+start][1];\n        var xj = vs[j+start][0], yj = vs[j+start][1];\n        var intersect = ((yi > y) !== (yj > y))\n            && (x < (xj - xi) * (y - yi) / (yj - yi) + xi);\n        if (intersect) inside = !inside;\n    }\n    return inside;\n};\n","var pointInPolygonFlat = require('./flat.js')\nvar pointInPolygonNested = require('./nested.js')\n\nmodule.exports = function pointInPolygon (point, vs, start, end) {\n    if (vs.length > 0 && Array.isArray(vs[0])) {\n        return pointInPolygonNested(point, vs, start, end);\n    } else {\n        return pointInPolygonFlat(point, vs, start, end);\n    }\n}\nmodule.exports.nested = pointInPolygonNested\nmodule.exports.flat = pointInPolygonFlat\n","!function(t,e){\"object\"==typeof exports&&\"undefined\"!=typeof module?e(exports):\"function\"==typeof define&&define.amd?define([\"exports\"],e):e((t=t||self).predicates={})}(this,function(t){\"use strict\";const e=134217729,n=33306690738754706e-32;function r(t,e,n,r,o){let f,i,u,c,s=e[0],a=r[0],d=0,l=0;a>s==a>-s?(f=s,s=e[++d]):(f=a,a=r[++l]);let p=0;if(d<t&&l<n)for(a>s==a>-s?(u=f-((i=s+f)-s),s=e[++d]):(u=f-((i=a+f)-a),a=r[++l]),f=i,0!==u&&(o[p++]=u);d<t&&l<n;)a>s==a>-s?(u=f-((i=f+s)-(c=i-f))+(s-c),s=e[++d]):(u=f-((i=f+a)-(c=i-f))+(a-c),a=r[++l]),f=i,0!==u&&(o[p++]=u);for(;d<t;)u=f-((i=f+s)-(c=i-f))+(s-c),s=e[++d],f=i,0!==u&&(o[p++]=u);for(;l<n;)u=f-((i=f+a)-(c=i-f))+(a-c),a=r[++l],f=i,0!==u&&(o[p++]=u);return 0===f&&0!==p||(o[p++]=f),p}function o(t){return new Float64Array(t)}const f=33306690738754716e-32,i=22204460492503146e-32,u=11093356479670487e-47,c=o(4),s=o(8),a=o(12),d=o(16),l=o(4);t.orient2d=function(t,o,p,b,y,h){const M=(o-h)*(p-y),x=(t-y)*(b-h),j=M-x;if(0===M||0===x||M>0!=x>0)return j;const m=Math.abs(M+x);return Math.abs(j)>=f*m?j:-function(t,o,f,p,b,y,h){let M,x,j,m,_,v,w,A,F,O,P,g,k,q,z,B,C,D;const E=t-b,G=f-b,H=o-y,I=p-y;_=(z=(A=E-(w=(v=e*E)-(v-E)))*(O=I-(F=(v=e*I)-(v-I)))-((q=E*I)-w*F-A*F-w*O))-(P=z-(C=(A=H-(w=(v=e*H)-(v-H)))*(O=G-(F=(v=e*G)-(v-G)))-((B=H*G)-w*F-A*F-w*O))),c[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),c[1]=k-(P+_)+(_-B),_=(D=g+P)-g,c[2]=g-(D-_)+(P-_),c[3]=D;let J=function(t,e){let n=e[0];for(let r=1;r<t;r++)n+=e[r];return n}(4,c),K=i*h;if(J>=K||-J>=K)return J;if(M=t-(E+(_=t-E))+(_-b),j=f-(G+(_=f-G))+(_-b),x=o-(H+(_=o-H))+(_-y),m=p-(I+(_=p-I))+(_-y),0===M&&0===x&&0===j&&0===m)return J;if(K=u*h+n*Math.abs(J),(J+=E*m+I*M-(H*j+G*x))>=K||-J>=K)return J;_=(z=(A=M-(w=(v=e*M)-(v-M)))*(O=I-(F=(v=e*I)-(v-I)))-((q=M*I)-w*F-A*F-w*O))-(P=z-(C=(A=x-(w=(v=e*x)-(v-x)))*(O=G-(F=(v=e*G)-(v-G)))-((B=x*G)-w*F-A*F-w*O))),l[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),l[1]=k-(P+_)+(_-B),_=(D=g+P)-g,l[2]=g-(D-_)+(P-_),l[3]=D;const L=r(4,c,4,l,s);_=(z=(A=E-(w=(v=e*E)-(v-E)))*(O=m-(F=(v=e*m)-(v-m)))-((q=E*m)-w*F-A*F-w*O))-(P=z-(C=(A=H-(w=(v=e*H)-(v-H)))*(O=j-(F=(v=e*j)-(v-j)))-((B=H*j)-w*F-A*F-w*O))),l[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),l[1]=k-(P+_)+(_-B),_=(D=g+P)-g,l[2]=g-(D-_)+(P-_),l[3]=D;const N=r(L,s,4,l,a);_=(z=(A=M-(w=(v=e*M)-(v-M)))*(O=m-(F=(v=e*m)-(v-m)))-((q=M*m)-w*F-A*F-w*O))-(P=z-(C=(A=x-(w=(v=e*x)-(v-x)))*(O=j-(F=(v=e*j)-(v-j)))-((B=x*j)-w*F-A*F-w*O))),l[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),l[1]=k-(P+_)+(_-B),_=(D=g+P)-g,l[2]=g-(D-_)+(P-_),l[3]=D;const Q=r(N,a,4,l,d);return d[Q-1]}(t,o,p,b,y,h,m)},t.orient2dfast=function(t,e,n,r,o,f){return(e-f)*(n-o)-(t-o)*(r-f)},Object.defineProperty(t,\"__esModule\",{value:!0})});\n","'use strict';\n\nvar RBush = require('rbush');\nvar Queue = require('tinyqueue');\nvar pointInPolygon = require('point-in-polygon');\nvar orient = require('robust-predicates/umd/orient2d.min.js').orient2d;\n\n// Fix for require issue in webpack https://github.com/mapbox/concaveman/issues/18\nif (Queue.default) {\n    Queue = Queue.default;\n}\n\nmodule.exports = concaveman;\nmodule.exports.default = concaveman;\n\nfunction concaveman(points, concavity, lengthThreshold) {\n    // a relative measure of concavity; higher value means simpler hull\n    concavity = Math.max(0, concavity === undefined ? 2 : concavity);\n\n    // when a segment goes below this length threshold, it won't be drilled down further\n    lengthThreshold = lengthThreshold || 0;\n\n    // start with a convex hull of the points\n    var hull = fastConvexHull(points);\n\n    // index the points with an R-tree\n    var tree = new RBush(16);\n    tree.toBBox = function (a) {\n        return {\n            minX: a[0],\n            minY: a[1],\n            maxX: a[0],\n            maxY: a[1]\n        };\n    };\n    tree.compareMinX = function (a, b) { return a[0] - b[0]; };\n    tree.compareMinY = function (a, b) { return a[1] - b[1]; };\n\n    tree.load(points);\n\n    // turn the convex hull into a linked list and populate the initial edge queue with the nodes\n    var queue = [];\n    for (var i = 0, last; i < hull.length; i++) {\n        var p = hull[i];\n        tree.remove(p);\n        last = insertNode(p, last);\n        queue.push(last);\n    }\n\n    // index the segments with an R-tree (for intersection checks)\n    var segTree = new RBush(16);\n    for (i = 0; i < queue.length; i++) segTree.insert(updateBBox(queue[i]));\n\n    var sqConcavity = concavity * concavity;\n    var sqLenThreshold = lengthThreshold * lengthThreshold;\n\n    // process edges one by one\n    while (queue.length) {\n        var node = queue.shift();\n        var a = node.p;\n        var b = node.next.p;\n\n        // skip the edge if it's already short enough\n        var sqLen = getSqDist(a, b);\n        if (sqLen < sqLenThreshold) continue;\n\n        var maxSqLen = sqLen / sqConcavity;\n\n        // find the best connection point for the current edge to flex inward to\n        p = findCandidate(tree, node.prev.p, a, b, node.next.next.p, maxSqLen, segTree);\n\n        // if we found a connection and it satisfies our concavity measure\n        if (p && Math.min(getSqDist(p, a), getSqDist(p, b)) <= maxSqLen) {\n            // connect the edge endpoints through this point and add 2 new edges to the queue\n            queue.push(node);\n            queue.push(insertNode(p, node));\n\n            // update point and segment indexes\n            tree.remove(p);\n            segTree.remove(node);\n            segTree.insert(updateBBox(node));\n            segTree.insert(updateBBox(node.next));\n        }\n    }\n\n    // convert the resulting hull linked list to an array of points\n    node = last;\n    var concave = [];\n    do {\n        concave.push(node.p);\n        node = node.next;\n    } while (node !== last);\n\n    concave.push(node.p);\n\n    return concave;\n}\n\nfunction findCandidate(tree, a, b, c, d, maxDist, segTree) {\n    var queue = new Queue([], compareDist);\n    var node = tree.data;\n\n    // search through the point R-tree with a depth-first search using a priority queue\n    // in the order of distance to the edge (b, c)\n    while (node) {\n        for (var i = 0; i < node.children.length; i++) {\n            var child = node.children[i];\n\n            var dist = node.leaf ? sqSegDist(child, b, c) : sqSegBoxDist(b, c, child);\n            if (dist > maxDist) continue; // skip the node if it's farther than we ever need\n\n            queue.push({\n                node: child,\n                dist: dist\n            });\n        }\n\n        while (queue.length && !queue.peek().node.children) {\n            var item = queue.pop();\n            var p = item.node;\n\n            // skip all points that are as close to adjacent edges (a,b) and (c,d),\n            // and points that would introduce self-intersections when connected\n            var d0 = sqSegDist(p, a, b);\n            var d1 = sqSegDist(p, c, d);\n            if (item.dist < d0 && item.dist < d1 &&\n                noIntersections(b, p, segTree) &&\n                noIntersections(c, p, segTree)) return p;\n        }\n\n        node = queue.pop();\n        if (node) node = node.node;\n    }\n\n    return null;\n}\n\nfunction compareDist(a, b) {\n    return a.dist - b.dist;\n}\n\n// square distance from a segment bounding box to the given one\nfunction sqSegBoxDist(a, b, bbox) {\n    if (inside(a, bbox) || inside(b, bbox)) return 0;\n    var d1 = sqSegSegDist(a[0], a[1], b[0], b[1], bbox.minX, bbox.minY, bbox.maxX, bbox.minY);\n    if (d1 === 0) return 0;\n    var d2 = sqSegSegDist(a[0], a[1], b[0], b[1], bbox.minX, bbox.minY, bbox.minX, bbox.maxY);\n    if (d2 === 0) return 0;\n    var d3 = sqSegSegDist(a[0], a[1], b[0], b[1], bbox.maxX, bbox.minY, bbox.maxX, bbox.maxY);\n    if (d3 === 0) return 0;\n    var d4 = sqSegSegDist(a[0], a[1], b[0], b[1], bbox.minX, bbox.maxY, bbox.maxX, bbox.maxY);\n    if (d4 === 0) return 0;\n    return Math.min(d1, d2, d3, d4);\n}\n\nfunction inside(a, bbox) {\n    return a[0] >= bbox.minX &&\n           a[0] <= bbox.maxX &&\n           a[1] >= bbox.minY &&\n           a[1] <= bbox.maxY;\n}\n\n// check if the edge (a,b) doesn't intersect any other edges\nfunction noIntersections(a, b, segTree) {\n    var minX = Math.min(a[0], b[0]);\n    var minY = Math.min(a[1], b[1]);\n    var maxX = Math.max(a[0], b[0]);\n    var maxY = Math.max(a[1], b[1]);\n\n    var edges = segTree.search({minX: minX, minY: minY, maxX: maxX, maxY: maxY});\n    for (var i = 0; i < edges.length; i++) {\n        if (intersects(edges[i].p, edges[i].next.p, a, b)) return false;\n    }\n    return true;\n}\n\nfunction cross(p1, p2, p3) {\n    return orient(p1[0], p1[1], p2[0], p2[1], p3[0], p3[1]);\n}\n\n// check if the edges (p1,q1) and (p2,q2) intersect\nfunction intersects(p1, q1, p2, q2) {\n    return p1 !== q2 && q1 !== p2 &&\n        cross(p1, q1, p2) > 0 !== cross(p1, q1, q2) > 0 &&\n        cross(p2, q2, p1) > 0 !== cross(p2, q2, q1) > 0;\n}\n\n// update the bounding box of a node's edge\nfunction updateBBox(node) {\n    var p1 = node.p;\n    var p2 = node.next.p;\n    node.minX = Math.min(p1[0], p2[0]);\n    node.minY = Math.min(p1[1], p2[1]);\n    node.maxX = Math.max(p1[0], p2[0]);\n    node.maxY = Math.max(p1[1], p2[1]);\n    return node;\n}\n\n// speed up convex hull by filtering out points inside quadrilateral formed by 4 extreme points\nfunction fastConvexHull(points) {\n    var left = points[0];\n    var top = points[0];\n    var right = points[0];\n    var bottom = points[0];\n\n    // find the leftmost, rightmost, topmost and bottommost points\n    for (var i = 0; i < points.length; i++) {\n        var p = points[i];\n        if (p[0] < left[0]) left = p;\n        if (p[0] > right[0]) right = p;\n        if (p[1] < top[1]) top = p;\n        if (p[1] > bottom[1]) bottom = p;\n    }\n\n    // filter out points that are inside the resulting quadrilateral\n    var cull = [left, top, right, bottom];\n    var filtered = cull.slice();\n    for (i = 0; i < points.length; i++) {\n        if (!pointInPolygon(points[i], cull)) filtered.push(points[i]);\n    }\n\n    // get convex hull around the filtered points\n    return convexHull(filtered);\n}\n\n// create a new node in a doubly linked list\nfunction insertNode(p, prev) {\n    var node = {\n        p: p,\n        prev: null,\n        next: null,\n        minX: 0,\n        minY: 0,\n        maxX: 0,\n        maxY: 0\n    };\n\n    if (!prev) {\n        node.prev = node;\n        node.next = node;\n\n    } else {\n        node.next = prev.next;\n        node.prev = prev;\n        prev.next.prev = node;\n        prev.next = node;\n    }\n    return node;\n}\n\n// square distance between 2 points\nfunction getSqDist(p1, p2) {\n\n    var dx = p1[0] - p2[0],\n        dy = p1[1] - p2[1];\n\n    return dx * dx + dy * dy;\n}\n\n// square distance from a point to a segment\nfunction sqSegDist(p, p1, p2) {\n\n    var x = p1[0],\n        y = p1[1],\n        dx = p2[0] - x,\n        dy = p2[1] - y;\n\n    if (dx !== 0 || dy !== 0) {\n\n        var t = ((p[0] - x) * dx + (p[1] - y) * dy) / (dx * dx + dy * dy);\n\n        if (t > 1) {\n            x = p2[0];\n            y = p2[1];\n\n        } else if (t > 0) {\n            x += dx * t;\n            y += dy * t;\n        }\n    }\n\n    dx = p[0] - x;\n    dy = p[1] - y;\n\n    return dx * dx + dy * dy;\n}\n\n// segment to segment distance, ported from http://geomalgorithms.com/a07-_distance.html by Dan Sunday\nfunction sqSegSegDist(x0, y0, x1, y1, x2, y2, x3, y3) {\n    var ux = x1 - x0;\n    var uy = y1 - y0;\n    var vx = x3 - x2;\n    var vy = y3 - y2;\n    var wx = x0 - x2;\n    var wy = y0 - y2;\n    var a = ux * ux + uy * uy;\n    var b = ux * vx + uy * vy;\n    var c = vx * vx + vy * vy;\n    var d = ux * wx + uy * wy;\n    var e = vx * wx + vy * wy;\n    var D = a * c - b * b;\n\n    var sc, sN, tc, tN;\n    var sD = D;\n    var tD = D;\n\n    if (D === 0) {\n        sN = 0;\n        sD = 1;\n        tN = e;\n        tD = c;\n    } else {\n        sN = b * e - c * d;\n        tN = a * e - b * d;\n        if (sN < 0) {\n            sN = 0;\n            tN = e;\n            tD = c;\n        } else if (sN > sD) {\n            sN = sD;\n            tN = e + b;\n            tD = c;\n        }\n    }\n\n    if (tN < 0.0) {\n        tN = 0.0;\n        if (-d < 0.0) sN = 0.0;\n        else if (-d > a) sN = sD;\n        else {\n            sN = -d;\n            sD = a;\n        }\n    } else if (tN > tD) {\n        tN = tD;\n        if ((-d + b) < 0.0) sN = 0;\n        else if (-d + b > a) sN = sD;\n        else {\n            sN = -d + b;\n            sD = a;\n        }\n    }\n\n    sc = sN === 0 ? 0 : sN / sD;\n    tc = tN === 0 ? 0 : tN / tD;\n\n    var cx = (1 - sc) * x0 + sc * x1;\n    var cy = (1 - sc) * y0 + sc * y1;\n    var cx2 = (1 - tc) * x2 + tc * x3;\n    var cy2 = (1 - tc) * y2 + tc * y3;\n    var dx = cx2 - cx;\n    var dy = cy2 - cy;\n\n    return dx * dx + dy * dy;\n}\n\nfunction compareByX(a, b) {\n    return a[0] === b[0] ? a[1] - b[1] : a[0] - b[0];\n}\n\nfunction convexHull(points) {\n    points.sort(compareByX);\n\n    var lower = [];\n    for (var i = 0; i < points.length; i++) {\n        while (lower.length >= 2 && cross(lower[lower.length - 2], lower[lower.length - 1], points[i]) <= 0) {\n            lower.pop();\n        }\n        lower.push(points[i]);\n    }\n\n    var upper = [];\n    for (var ii = points.length - 1; ii >= 0; ii--) {\n        while (upper.length >= 2 && cross(upper[upper.length - 2], upper[upper.length - 1], points[ii]) <= 0) {\n            upper.pop();\n        }\n        upper.push(points[ii]);\n    }\n\n    upper.pop();\n    lower.pop();\n    return lower.concat(upper);\n}\n","// index.ts\nimport { polygon } from \"@turf/helpers\";\nimport { coordEach } from \"@turf/meta\";\nimport concaveman from \"concaveman\";\nfunction convex(geojson, options = {}) {\n  options.concavity = options.concavity || Infinity;\n  const points = [];\n  coordEach(geojson, (coord) => {\n    points.push([coord[0], coord[1]]);\n  });\n  if (!points.length) {\n    return null;\n  }\n  const convexHull = concaveman(points, options.concavity);\n  if (convexHull.length > 3) {\n    return polygon([convexHull]);\n  }\n  return null;\n}\nvar index_default = convex;\nexport {\n  convex,\n  index_default as default\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { point } from \"@turf/helpers\";\nimport { coordEach } from \"@turf/meta\";\nfunction centroid(geojson, options = {}) {\n  let xSum = 0;\n  let ySum = 0;\n  let len = 0;\n  coordEach(\n    geojson,\n    function(coord) {\n      xSum += coord[0];\n      ySum += coord[1];\n      len++;\n    },\n    true\n  );\n  return point([xSum / len, ySum / len], options.properties);\n}\nvar index_default = centroid;\nexport {\n  centroid,\n  index_default as default\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { isNumber } from \"@turf/helpers\";\nfunction getCoord(coord) {\n  if (!coord) {\n    throw new Error(\"coord is required\");\n  }\n  if (!Array.isArray(coord)) {\n    if (coord.type === \"Feature\" && coord.geometry !== null && coord.geometry.type === \"Point\") {\n      return [...coord.geometry.coordinates];\n    }\n    if (coord.type === \"Point\") {\n      return [...coord.coordinates];\n    }\n  }\n  if (Array.isArray(coord) && coord.length >= 2 && !Array.isArray(coord[0]) && !Array.isArray(coord[1])) {\n    return [...coord];\n  }\n  throw new Error(\"coord must be GeoJSON Point or an Array of numbers\");\n}\nfunction getCoords(coords) {\n  if (Array.isArray(coords)) {\n    return coords;\n  }\n  if (coords.type === \"Feature\") {\n    if (coords.geometry !== null) {\n      return coords.geometry.coordinates;\n    }\n  } else {\n    if (coords.coordinates) {\n      return coords.coordinates;\n    }\n  }\n  throw new Error(\n    \"coords must be GeoJSON Feature, Geometry Object or an Array\"\n  );\n}\nfunction containsNumber(coordinates) {\n  if (coordinates.length > 1 && isNumber(coordinates[0]) && isNumber(coordinates[1])) {\n    return true;\n  }\n  if (Array.isArray(coordinates[0]) && coordinates[0].length) {\n    return containsNumber(coordinates[0]);\n  }\n  throw new Error(\"coordinates must only contain numbers\");\n}\nfunction geojsonType(value, type, name) {\n  if (!type || !name) {\n    throw new Error(\"type and name required\");\n  }\n  if (!value || value.type !== type) {\n    throw new Error(\n      \"Invalid input to \" + name + \": must be a \" + type + \", given \" + value.type\n    );\n  }\n}\nfunction featureOf(feature, type, name) {\n  if (!feature) {\n    throw new Error(\"No feature passed\");\n  }\n  if (!name) {\n    throw new Error(\".featureOf() requires a name\");\n  }\n  if (!feature || feature.type !== \"Feature\" || !feature.geometry) {\n    throw new Error(\n      \"Invalid input to \" + name + \", Feature with geometry required\"\n    );\n  }\n  if (!feature.geometry || feature.geometry.type !== type) {\n    throw new Error(\n      \"Invalid input to \" + name + \": must be a \" + type + \", given \" + feature.geometry.type\n    );\n  }\n}\nfunction collectionOf(featureCollection, type, name) {\n  if (!featureCollection) {\n    throw new Error(\"No featureCollection passed\");\n  }\n  if (!name) {\n    throw new Error(\".collectionOf() requires a name\");\n  }\n  if (!featureCollection || featureCollection.type !== \"FeatureCollection\") {\n    throw new Error(\n      \"Invalid input to \" + name + \", FeatureCollection required\"\n    );\n  }\n  for (const feature of featureCollection.features) {\n    if (!feature || feature.type !== \"Feature\" || !feature.geometry) {\n      throw new Error(\n        \"Invalid input to \" + name + \", Feature with geometry required\"\n      );\n    }\n    if (!feature.geometry || feature.geometry.type !== type) {\n      throw new Error(\n        \"Invalid input to \" + name + \": must be a \" + type + \", given \" + feature.geometry.type\n      );\n    }\n  }\n}\nfunction getGeom(geojson) {\n  if (geojson.type === \"Feature\") {\n    return geojson.geometry;\n  }\n  return geojson;\n}\nfunction getType(geojson, _name) {\n  if (geojson.type === \"FeatureCollection\") {\n    return \"FeatureCollection\";\n  }\n  if (geojson.type === \"GeometryCollection\") {\n    return \"GeometryCollection\";\n  }\n  if (geojson.type === \"Feature\" && geojson.geometry !== null) {\n    return geojson.geometry.type;\n  }\n  return geojson.type;\n}\nexport {\n  collectionOf,\n  containsNumber,\n  featureOf,\n  geojsonType,\n  getCoord,\n  getCoords,\n  getGeom,\n  getType\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { convex } from \"@turf/convex\";\nimport { centroid } from \"@turf/centroid\";\nimport { point } from \"@turf/helpers\";\nimport { getType, getCoord } from \"@turf/invariant\";\nimport { coordEach } from \"@turf/meta\";\nfunction centerOfMass(geojson, options = {}) {\n  switch (getType(geojson)) {\n    case \"Point\":\n      return point(getCoord(geojson), options.properties);\n    case \"Polygon\":\n      var coords = [];\n      coordEach(geojson, function(coord) {\n        coords.push(coord);\n      });\n      var centre = centroid(geojson, { properties: options.properties });\n      var translation = centre.geometry.coordinates;\n      var sx = 0;\n      var sy = 0;\n      var sArea = 0;\n      var i, pi, pj, xi, xj, yi, yj, a;\n      var neutralizedPoints = coords.map(function(point2) {\n        return [point2[0] - translation[0], point2[1] - translation[1]];\n      });\n      for (i = 0; i < coords.length - 1; i++) {\n        pi = neutralizedPoints[i];\n        xi = pi[0];\n        yi = pi[1];\n        pj = neutralizedPoints[i + 1];\n        xj = pj[0];\n        yj = pj[1];\n        a = xi * yj - xj * yi;\n        sArea += a;\n        sx += (xi + xj) * a;\n        sy += (yi + yj) * a;\n      }\n      if (sArea === 0) {\n        return centre;\n      } else {\n        var area = sArea * 0.5;\n        var areaFactor = 1 / (6 * area);\n        return point(\n          [translation[0] + areaFactor * sx, translation[1] + areaFactor * sy],\n          options.properties\n        );\n      }\n    default:\n      var hull = convex(geojson);\n      if (hull) return centerOfMass(hull, { properties: options.properties });\n      else return centroid(geojson, { properties: options.properties });\n  }\n}\nvar index_default = centerOfMass;\nexport {\n  centerOfMass,\n  index_default as default\n};\n//# sourceMappingURL=index.js.map"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12],"mappings":";;AACA,IAAI,IAAc;AAEH,IAAc,KACd,IAAc,KAClB,OAAO,IAAI,KAAK,KACnB,IAAc,SACZ,IAAc,OACV,IAAc,KACd,IAAc,KAGnB,IAAc,UACR,IAAc,KACd,IAAc,KACZ,IAAc,MAEtB,IAAc;AAmBvB,SAAS,EAAQ,GAAM,GAAY,IAAU,CAAC,GAAG;CAC/C,IAAM,IAAO,EAAE,MAAM,UAAU;CAS/B,QARI,EAAQ,OAAO,KAAK,EAAQ,QAC9B,EAAK,KAAK,EAAQ,KAEhB,EAAQ,SACV,EAAK,OAAO,EAAQ,OAEtB,EAAK,aAAa,KAAc,CAAC,GACjC,EAAK,WAAW,GACT;AACT;AAmBA,SAAS,EAAM,GAAa,GAAY,IAAU,CAAC,GAAG;CACpD,IAAI,CAAC,GACH,MAAU,MAAM,yBAAyB;CAE3C,IAAI,CAAC,MAAM,QAAQ,CAAW,GAC5B,MAAU,MAAM,8BAA8B;CAEhD,IAAI,EAAY,SAAS,GACvB,MAAU,MAAM,6CAA6C;CAE/D,IAAI,CAAC,EAAS,EAAY,EAAE,KAAK,CAAC,EAAS,EAAY,EAAE,GACvD,MAAU,MAAM,kCAAkC;CAMpD,OAAO,EAAQ;EAHb,MAAM;EACN;CAEgB,GAAG,GAAY,CAAO;AAC1C;AASA,SAAS,EAAQ,GAAa,GAAY,IAAU,CAAC,GAAG;CACtD,KAAK,IAAM,KAAQ,GAAa;EAC9B,IAAI,EAAK,SAAS,GAChB,MAAU,MACR,6DACF;EAEF,IAAI,EAAK,EAAK,SAAS,GAAG,WAAW,EAAK,GAAG,QAC3C,MAAU,MAAM,6CAA6C;EAE/D,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,EAAK,SAAS,GAAG,QAAQ,KAChD,IAAI,EAAK,EAAK,SAAS,GAAG,OAAO,EAAK,GAAG,IACvC,MAAU,MAAM,6CAA6C;CAGnE;CAKA,OAAO,EAAQ;EAHb,MAAM;EACN;CAEgB,GAAG,GAAY,CAAO;AAC1C;AAsIA,SAAS,EAAS,GAAK;CACrB,OAAO,CAAC,MAAM,CAAG,KAAK,MAAQ,QAAQ,CAAC,MAAM,QAAQ,CAAG;AAC1D;;;ACxPA,SAAS,EAAU,GAAS,GAAU,GAAkB;CAClD,UAAY,MAEhB,KAAK,IADD,GAAG,GAAG,GAAG,GAAU,GAAO,GAAQ,GAAyB,IAAa,GAAG,IAAa,GAAG,GAAsB,IAAO,EAAQ,MAAM,IAAsB,MAAS,qBAAqB,IAAY,MAAS,WAAW,IAAO,IAAsB,EAAQ,SAAS,SAAS,GAC5Q,IAAe,GAAG,IAAe,GAAM,KAAgB;EAS9D,AARA,IAA0B,IAExB,EAAQ,SAAS,GAAc,WAC7B,IAEF,EAAQ,WACN,GACJ,IAAuB,IAA0B,EAAwB,SAAS,uBAAuB,IACzG,IAAQ,IAAuB,EAAwB,WAAW,SAAS;EAC3E,KAAK,IAAI,IAAY,GAAG,IAAY,GAAO,KAAa;GACtD,IAAI,IAAoB,GACpB,IAAgB;GACpB,QAAW,IAAuB,EAAwB,WAAW,KAAa,GAC9E,MAAa,MACjB;QAAS,EAAS;IAClB,IAAI,IAAW,EAAS;IAExB,QADA,IAAa,MAAqB,MAAa,aAAa,MAAa,kBAAkB,IAAI,GACvF,GAAR;KACE,KAAK,MACH;KACF,KAAK;MACH,IAEE,EACE,GACA,GACA,GACA,GACA,CACF,MAAM,IAEN,OAAO;MAET,AADA,KACA;MACA;KACF,KAAK;KACL,KAAK;MACH,KAAK,IAAI,GAAG,IAAI,EAAO,QAAQ,KAAK;OAClC,IAEE,EACE,EAAO,IACP,GACA,GACA,GACA,CACF,MAAM,IAEN,OAAO;OAET,AADA,KACI,MAAa,gBAAc;MACjC;MACA,AAAI,MAAa,gBAAc;MAC/B;KACF,KAAK;KACL,KAAK;MACH,KAAK,IAAI,GAAG,IAAI,EAAO,QAAQ,KAAK;OAClC,KAAK,IAAI,GAAG,IAAI,EAAO,GAAG,SAAS,GAAY,KAAK;QAClD,IAEE,EACE,EAAO,GAAG,IACV,GACA,GACA,GACA,CACF,MAAM,IAEN,OAAO;QACT;OACF;OAEA,AADI,MAAa,qBAAmB,KAChC,MAAa,aAAW;MAC9B;MACA,AAAI,MAAa,aAAW;MAC5B;KACF,KAAK;MACH,KAAK,IAAI,GAAG,IAAI,EAAO,QAAQ,KAAK;OAElC,KADA,IAAgB,GACX,IAAI,GAAG,IAAI,EAAO,GAAG,QAAQ,KAAK;QACrC,KAAK,IAAI,GAAG,IAAI,EAAO,GAAG,GAAG,SAAS,GAAY,KAAK;SACrD,IAEE,EACE,EAAO,GAAG,GAAG,IACb,GACA,GACA,GACA,CACF,MAAM,IAEN,OAAO;SACT;QACF;QACA;OACF;OACA;MACF;MACA;KACF,KAAK;MACH,KAAK,IAAI,GAAG,IAAI,EAAS,WAAW,QAAQ,KAC1C,IAEE,EAAU,EAAS,WAAW,IAAI,GAAU,CAAgB,MAAM,IAElE,OAAO;MACX;KACF,SACE,MAAU,MAAM,uBAAuB;IAC3C;GA/FkB;EAgGpB;CACF;AACF;AAuEA,SAAS,EAAS,GAAS,GAAU;CACnC,IAAI,GAAG,GAAG,GAAG,GAAU,GAAO,GAAyB,GAAsB,GAAmB,GAAa,GAAW,IAAe,GAAG,IAAsB,EAAQ,SAAS,qBAAqB,IAAY,EAAQ,SAAS,WAAW,IAAO,IAAsB,EAAQ,SAAS,SAAS;CACrS,KAAK,IAAI,GAAG,IAAI,GAAM,KAAK;EA+BzB,KA9BA,IAA0B,IAExB,EAAQ,SAAS,GAAG,WAClB,IAEF,EAAQ,WACN,GACJ,IAAoB,IAElB,EAAQ,SAAS,GAAG,aAClB,IAEF,EAAQ,aACN,CAAC,GACL,IAAc,IAEZ,EAAQ,SAAS,GAAG,OAClB,IAEF,EAAQ,OACN,KAAK,GACT,IAAY,IAEV,EAAQ,SAAS,GAAG,KAClB,IAEF,EAAQ,KACN,KAAK,GACT,IAAuB,IAA0B,EAAwB,SAAS,uBAAuB,IACzG,IAAQ,IAAuB,EAAwB,WAAW,SAAS,GACtE,IAAI,GAAG,IAAI,GAAO,KAAK;GAE1B,IADA,IAAW,IAAuB,EAAwB,WAAW,KAAK,GACtE,MAAa,MAAM;IACrB,IAEE,EAEE,MACA,GACA,GACA,GACA,CACF,MAAM,IAEN,OAAO;IACT;GACF;GACA,QAAQ,EAAS,MAAjB;IACE,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;KACH,IAEE,EACE,GACA,GACA,GACA,GACA,CACF,MAAM,IAEN,OAAO;KACT;IAEF,KAAK;KACH,KAAK,IAAI,GAAG,IAAI,EAAS,WAAW,QAAQ,KAC1C,IAEE,EACE,EAAS,WAAW,IACpB,GACA,GACA,GACA,CACF,MAAM,IAEN,OAAO;KAEX;IAEF,SACE,MAAU,MAAM,uBAAuB;GAC3C;EACF;EACA;CACF;AACF;AACA,SAAS,EAAW,GAAS,GAAU,GAAc;CACnD,IAAI,IAAgB;CAkBpB,OAjBA,EACE,GACA,SAAS,GAAiB,GAAc,GAAmB,GAAa,GAAW;EACjF,AAGE,IAHE,MAAiB,KAAK,MAAiB,KAAK,IAC9B,IAEA,EAEd,GACA,GACA,GACA,GACA,GACA,CACF;CACJ,CACF,GACO;AACT;;;;CC9SA,CAAC,SAAS,GAAE,GAAE;EAAC,AAAU,OAAO,KAAjB,YAA8C,MAApB,SAA2B,EAAO,UAAQ,EAAE,IAAc,OAAO,UAAnB,cAA2B,OAAO,MAAI,OAAO,CAAC,IAAE,CAAC,MAAK,MAAM,QAAM,EAAE;CAAC,GAAA,GAAO,WAAU;EAAc,SAAS,EAAE,GAAE,GAAE,GAAE,GAAE,GAAE;GAAC,CAAC,SAAS,EAAE,GAAE,GAAE,GAAE,GAAE,GAAE;IAAC,OAAK,IAAE,IAAG;KAAC,IAAG,IAAE,IAAE,KAAI;MAAC,IAAI,IAAE,IAAE,IAAE,GAAE,IAAE,IAAE,IAAE,GAAE,IAAE,KAAK,IAAI,CAAC,GAAE,IAAE,KAAG,KAAK,IAAI,IAAE,IAAE,CAAC,GAAE,IAAE,KAAG,KAAK,KAAK,IAAE,KAAG,IAAE,KAAG,CAAC,KAAG,IAAE,IAAE,IAAE,IAAE,KAAG;MAA+E,EAAE,GAAE,GAA9E,KAAK,IAAI,GAAE,KAAK,MAAM,IAAE,IAAE,IAAE,IAAE,CAAC,CAAiD,GAA5C,KAAK,IAAI,GAAE,KAAK,MAAM,KAAG,IAAE,KAAG,IAAE,IAAE,CAAC,CAAW,GAAE,CAAC;KAAC;KAAC,IAAI,IAAE,EAAE,IAAG,IAAE,GAAE,IAAE;KAAE,KAAI,EAAE,GAAE,GAAE,CAAC,GAAE,EAAE,EAAE,IAAG,CAAC,IAAE,KAAG,EAAE,GAAE,GAAE,CAAC,GAAE,IAAE,IAAG;MAAC,KAAI,EAAE,GAAE,GAAE,CAAC,GAAE,KAAI,KAAI,EAAE,EAAE,IAAG,CAAC,IAAE,IAAG;MAAI,OAAK,EAAE,EAAE,IAAG,CAAC,IAAE,IAAG;KAAG;KAAC,AAAI,EAAE,EAAE,IAAG,CAAC,MAAZ,IAAc,EAAE,GAAE,GAAE,CAAC,IAAE,EAAE,GAAE,EAAE,GAAE,CAAC,GAAE,KAAG,MAAI,IAAE,IAAE,IAAG,KAAG,MAAI,IAAE,IAAE;IAAE;GAAC,GAAE,GAAE,GAAE,KAAG,GAAE,KAAG,EAAE,SAAO,GAAE,KAAG,CAAC;EAAC;EAAC,SAAS,EAAE,GAAE,GAAE,GAAE;GAAC,IAAI,IAAE,EAAE;GAAG,EAAE,KAAG,EAAE,IAAG,EAAE,KAAG;EAAC;EAAC,SAAS,EAAE,GAAE,GAAE;GAAC,OAAO,IAAE,IAAE,KAAG,MAAE;EAAK;EAAC,IAAI,IAAE,SAAS,GAAE;GAAC,AAAS,MAAT,KAAK,MAAQ,IAAE,IAAG,KAAK,cAAY,KAAK,IAAI,GAAE,CAAC,GAAE,KAAK,cAAY,KAAK,IAAI,GAAE,KAAK,KAAK,KAAG,KAAK,WAAW,CAAC,GAAE,KAAK,MAAM;EAAC;EAAE,SAAS,EAAE,GAAE,GAAE,GAAE;GAAC,IAAG,CAAC,GAAE,OAAO,EAAE,QAAQ,CAAC;GAAE,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,QAAO,KAAI,IAAG,EAAE,GAAE,EAAE,EAAE,GAAE,OAAO;GAAE,OAAM;EAAE;EAAC,SAAS,EAAE,GAAE,GAAE;GAAC,EAAE,GAAE,GAAE,EAAE,SAAS,QAAO,GAAE,CAAC;EAAC;EAAC,SAAS,EAAE,GAAE,GAAE,GAAE,GAAE,GAAE;GAAC,AAAI,MAAE,EAAE,IAAI,GAAG,EAAE,OAAK,UAAI,EAAE,OAAK,UAAI,EAAE,OAAK,WAAK,EAAE,OAAK;GAAK,KAAI,IAAI,IAAE,GAAE,IAAE,GAAE,KAAI;IAAC,IAAI,IAAE,EAAE,SAAS;IAAG,EAAE,GAAE,EAAE,OAAK,EAAE,CAAC,IAAE,CAAC;GAAC;GAAC,OAAO;EAAC;EAAC,SAAS,EAAE,GAAE,GAAE;GAAC,OAAO,EAAE,OAAK,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,GAAE,EAAE,OAAK,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,GAAE,EAAE,OAAK,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,GAAE,EAAE,OAAK,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,GAAE;EAAC;EAAC,SAAS,EAAE,GAAE,GAAE;GAAC,OAAO,EAAE,OAAK,EAAE;EAAI;EAAC,SAAS,EAAE,GAAE,GAAE;GAAC,OAAO,EAAE,OAAK,EAAE;EAAI;EAAC,SAAS,EAAE,GAAE;GAAC,QAAO,EAAE,OAAK,EAAE,SAAO,EAAE,OAAK,EAAE;EAAK;EAAC,SAAS,EAAE,GAAE;GAAC,OAAO,EAAE,OAAK,EAAE,QAAM,EAAE,OAAK,EAAE;EAAK;EAAC,SAAS,EAAE,GAAE,GAAE;GAAC,OAAO,EAAE,QAAM,EAAE,QAAM,EAAE,QAAM,EAAE,QAAM,EAAE,QAAM,EAAE,QAAM,EAAE,QAAM,EAAE;EAAI;EAAC,SAAS,EAAE,GAAE,GAAE;GAAC,OAAO,EAAE,QAAM,EAAE,QAAM,EAAE,QAAM,EAAE,QAAM,EAAE,QAAM,EAAE,QAAM,EAAE,QAAM,EAAE;EAAI;EAAC,SAAS,EAAE,GAAE;GAAC,OAAM;IAAC,UAAS;IAAE,QAAO;IAAE,MAAK,CAAC;IAAE,MAAK;IAAI,MAAK;IAAI,MAAK;IAAK,MAAK;GAAI;EAAC;EAAC,SAAS,EAAE,GAAE,GAAE,GAAE,GAAE,GAAE;GAAC,KAAI,IAAI,IAAE,CAAC,GAAE,CAAC,GAAE,EAAE,SAAQ,IAAG,GAAG,IAAE,EAAE,IAAI,MAAI,IAAE,EAAE,IAAI,MAAI,IAAG;IAAC,IAAI,IAAE,IAAE,KAAK,MAAM,IAAE,KAAG,IAAE,CAAC,IAAE;IAAE,EAAE,GAAE,GAAE,GAAE,GAAE,CAAC,GAAE,EAAE,KAAK,GAAE,GAAE,GAAE,CAAC;GAAC;EAAC;EAAC,OAAO,EAAE,UAAU,MAAI,WAAU;GAAC,OAAO,KAAK,KAAK,KAAK,MAAK,CAAC,CAAC;EAAC,GAAE,EAAE,UAAU,SAAO,SAAS,GAAE;GAAC,IAAI,IAAE,KAAK,MAAK,IAAE,CAAC;GAAE,IAAG,CAAC,EAAE,GAAE,CAAC,GAAE,OAAO;GAAE,KAAI,IAAI,IAAE,KAAK,QAAO,IAAE,CAAC,GAAE,IAAG;IAAC,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,SAAS,QAAO,KAAI;KAAC,IAAI,IAAE,EAAE,SAAS,IAAG,IAAE,EAAE,OAAK,EAAE,CAAC,IAAE;KAAE,EAAE,GAAE,CAAC,MAAI,EAAE,OAAK,EAAE,KAAK,CAAC,IAAE,EAAE,GAAE,CAAC,IAAE,KAAK,KAAK,GAAE,CAAC,IAAE,EAAE,KAAK,CAAC;IAAE;IAAC,IAAE,EAAE,IAAI;GAAC;GAAC,OAAO;EAAC,GAAE,EAAE,UAAU,WAAS,SAAS,GAAE;GAAC,IAAI,IAAE,KAAK;GAAK,IAAG,CAAC,EAAE,GAAE,CAAC,GAAE,OAAM,CAAC;GAAE,KAAI,IAAI,IAAE,CAAC,GAAE,IAAG;IAAC,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,SAAS,QAAO,KAAI;KAAC,IAAI,IAAE,EAAE,SAAS,IAAG,IAAE,EAAE,OAAK,KAAK,OAAO,CAAC,IAAE;KAAE,IAAG,EAAE,GAAE,CAAC,GAAE;MAAC,IAAG,EAAE,QAAM,EAAE,GAAE,CAAC,GAAE,OAAM,CAAC;MAAE,EAAE,KAAK,CAAC;KAAC;IAAC;IAAC,IAAE,EAAE,IAAI;GAAC;GAAC,OAAM,CAAC;EAAC,GAAE,EAAE,UAAU,OAAK,SAAS,GAAE;GAAC,IAAG,CAAC,KAAG,CAAC,EAAE,QAAO,OAAO;GAAK,IAAG,EAAE,SAAO,KAAK,aAAY;IAAC,KAAI,IAAI,IAAE,GAAE,IAAE,EAAE,QAAO,KAAI,KAAK,OAAO,EAAE,EAAE;IAAE,OAAO;GAAI;GAAC,IAAI,IAAE,KAAK,OAAO,EAAE,MAAM,GAAE,GAAE,EAAE,SAAO,GAAE,CAAC;GAAE,IAAG,KAAK,KAAK,SAAS,QAAO,IAAG,KAAK,KAAK,WAAS,EAAE,QAAO,KAAK,WAAW,KAAK,MAAK,CAAC;QAAM;IAAC,IAAG,KAAK,KAAK,SAAO,EAAE,QAAO;KAAC,IAAI,IAAE,KAAK;KAAK,KAAK,OAAK,GAAE,IAAE;IAAC;IAAC,KAAK,QAAQ,GAAE,KAAK,KAAK,SAAO,EAAE,SAAO,GAAE,CAAC,CAAC;GAAC;QAAM,KAAK,OAAK;GAAE,OAAO;EAAI,GAAE,EAAE,UAAU,SAAO,SAAS,GAAE;GAAC,OAAO,KAAG,KAAK,QAAQ,GAAE,KAAK,KAAK,SAAO,CAAC,GAAE;EAAI,GAAE,EAAE,UAAU,QAAM,WAAU;GAAC,OAAO,KAAK,OAAK,EAAE,CAAC,CAAC,GAAE;EAAI,GAAE,EAAE,UAAU,SAAO,SAAS,GAAE,GAAE;GAAC,IAAG,CAAC,GAAE,OAAO;GAAK,KAAI,IAAI,GAAE,GAAE,GAAE,IAAE,KAAK,MAAK,IAAE,KAAK,OAAO,CAAC,GAAE,IAAE,CAAC,GAAE,IAAE,CAAC,GAAE,KAAG,EAAE,SAAQ;IAAC,IAAG,MAAI,IAAE,EAAE,IAAI,GAAE,IAAE,EAAE,EAAE,SAAO,IAAG,IAAE,EAAE,IAAI,GAAE,IAAE,CAAC,IAAG,EAAE,MAAK;KAAC,IAAI,IAAE,EAAE,GAAE,EAAE,UAAS,CAAC;KAAE,IAAQ,MAAL,IAAO,OAAO,EAAE,SAAS,OAAO,GAAE,CAAC,GAAE,EAAE,KAAK,CAAC,GAAE,KAAK,UAAU,CAAC,GAAE;IAAI;IAAC,KAAG,EAAE,QAAM,CAAC,EAAE,GAAE,CAAC,IAAE,KAAG,KAAI,IAAE,EAAE,SAAS,IAAG,IAAE,CAAC,KAAG,IAAE,QAAM,EAAE,KAAK,CAAC,GAAE,EAAE,KAAK,CAAC,GAAE,IAAE,GAAE,IAAE,GAAE,IAAE,EAAE,SAAS;GAAG;GAAC,OAAO;EAAI,GAAE,EAAE,UAAU,SAAO,SAAS,GAAE;GAAC,OAAO;EAAC,GAAE,EAAE,UAAU,cAAY,SAAS,GAAE,GAAE;GAAC,OAAO,EAAE,OAAK,EAAE;EAAI,GAAE,EAAE,UAAU,cAAY,SAAS,GAAE,GAAE;GAAC,OAAO,EAAE,OAAK,EAAE;EAAI,GAAE,EAAE,UAAU,SAAO,WAAU;GAAC,OAAO,KAAK;EAAI,GAAE,EAAE,UAAU,WAAS,SAAS,GAAE;GAAC,OAAO,KAAK,OAAK,GAAE;EAAI,GAAE,EAAE,UAAU,OAAK,SAAS,GAAE,GAAE;GAAC,KAAI,IAAI,IAAE,CAAC,GAAE,IAAG,EAAE,OAAK,EAAE,KAAK,MAAM,GAAE,EAAE,QAAQ,IAAE,EAAE,KAAK,MAAM,GAAE,EAAE,QAAQ,GAAE,IAAE,EAAE,IAAI;GAAE,OAAO;EAAC,GAAE,EAAE,UAAU,SAAO,SAAS,GAAE,GAAE,GAAE,GAAE;GAAC,IAAI,GAAE,IAAE,IAAE,IAAE,GAAE,IAAE,KAAK;GAAY,IAAG,KAAG,GAAE,OAAO,EAAE,IAAE,EAAE,EAAE,MAAM,GAAE,IAAE,CAAC,CAAC,GAAE,KAAK,MAAM,GAAE;GAAE,MAAI,IAAE,KAAK,KAAK,KAAK,IAAI,CAAC,IAAE,KAAK,IAAI,CAAC,CAAC,GAAE,IAAE,KAAK,KAAK,IAAW,MAAE,IAAE,EAAE,IAAG,CAAC,IAAE,EAAE,CAAC,CAAC,GAAG,OAAK,CAAC,GAAE,EAAE,SAAO;GAAE,IAAI,IAAE,KAAK,KAAK,IAAE,CAAC,GAAE,IAAE,IAAE,KAAK,KAAK,KAAK,KAAK,CAAC,CAAC;GAAE,EAAE,GAAE,GAAE,GAAE,GAAE,KAAK,WAAW;GAAE,KAAI,IAAI,IAAE,GAAE,KAAG,GAAE,KAAG,GAAE;IAAC,IAAI,IAAE,KAAK,IAAI,IAAE,IAAE,GAAE,CAAC;IAAE,EAAE,GAAE,GAAE,GAAE,GAAE,KAAK,WAAW;IAAE,KAAI,IAAI,IAAE,GAAE,KAAG,GAAE,KAAG,GAAE;KAAC,IAAI,IAAE,KAAK,IAAI,IAAE,IAAE,GAAE,CAAC;KAAE,EAAE,SAAS,KAAK,KAAK,OAAO,GAAE,GAAE,GAAE,IAAE,CAAC,CAAC;IAAC;GAAC;GAAC,OAAO,EAAE,GAAE,KAAK,MAAM,GAAE;EAAC,GAAE,EAAE,UAAU,iBAAe,SAAS,GAAE,GAAE,GAAE,GAAE;GAAC,OAAK,EAAE,KAAK,CAAC,GAAE,CAAC,EAAE,QAAM,EAAE,SAAO,MAAI,IAAG;IAAC,KAAI,IAAI,IAAE,UAAI,IAAE,UAAI,IAAE,KAAK,GAAE,IAAE,GAAE,IAAE,EAAE,SAAS,QAAO,KAAI;KAAC,IAAI,IAAE,EAAE,SAAS,IAAG,IAAE,EAAE,CAAC,GAAE,KAAG,IAAE,GAAE,IAAE,IAAG,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,IAAE,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,MAAI,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,IAAE,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,KAAG;KAAG,IAAE,KAAG,IAAE,GAAE,IAAE,IAAE,IAAE,IAAE,GAAE,IAAE,KAAG,MAAI,KAAG,IAAE,MAAI,IAAE,GAAE,IAAE;IAAE;IAAC,IAAE,KAAG,EAAE,SAAS;GAAE;GAAC,IAAI,GAAE;GAAE,OAAO;EAAC,GAAE,EAAE,UAAU,UAAQ,SAAS,GAAE,GAAE,GAAE;GAAC,IAAI,IAAE,IAAE,IAAE,KAAK,OAAO,CAAC,GAAE,IAAE,CAAC,GAAE,IAAE,KAAK,eAAe,GAAE,KAAK,MAAK,GAAE,CAAC;GAAE,KAAI,EAAE,SAAS,KAAK,CAAC,GAAE,EAAE,GAAE,CAAC,GAAE,KAAG,KAAG,EAAE,GAAG,SAAS,SAAO,KAAK,cAAa,KAAK,OAAO,GAAE,CAAC,GAAE;GAAI,KAAK,oBAAoB,GAAE,GAAE,CAAC;EAAC,GAAE,EAAE,UAAU,SAAO,SAAS,GAAE,GAAE;GAAC,IAAI,IAAE,EAAE,IAAG,IAAE,EAAE,SAAS,QAAO,IAAE,KAAK;GAAY,KAAK,iBAAiB,GAAE,GAAE,CAAC;GAAE,IAAI,IAAE,KAAK,kBAAkB,GAAE,GAAE,CAAC,GAAE,IAAE,EAAE,EAAE,SAAS,OAAO,GAAE,EAAE,SAAS,SAAO,CAAC,CAAC;GAAE,EAAE,SAAO,EAAE,QAAO,EAAE,OAAK,EAAE,MAAK,EAAE,GAAE,KAAK,MAAM,GAAE,EAAE,GAAE,KAAK,MAAM,GAAE,IAAE,EAAE,IAAE,GAAG,SAAS,KAAK,CAAC,IAAE,KAAK,WAAW,GAAE,CAAC;EAAC,GAAE,EAAE,UAAU,aAAW,SAAS,GAAE,GAAE;GAAC,KAAK,OAAK,EAAE,CAAC,GAAE,CAAC,CAAC,GAAE,KAAK,KAAK,SAAO,EAAE,SAAO,GAAE,KAAK,KAAK,OAAK,CAAC,GAAE,EAAE,KAAK,MAAK,KAAK,MAAM;EAAC,GAAE,EAAE,UAAU,oBAAkB,SAAS,GAAE,GAAE,GAAE;GAAC,KAAI,IAAI,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,IAAE,UAAI,IAAE,UAAI,IAAE,GAAE,KAAG,IAAE,GAAE,KAAI;IAAC,IAAI,IAAE,EAAE,GAAE,GAAE,GAAE,KAAK,MAAM,GAAE,IAAE,EAAE,GAAE,GAAE,GAAE,KAAK,MAAM,GAAE,KAAG,IAAE,GAAE,IAAE,GAAE,IAAE,KAAK,GAAE,IAAE,KAAK,GAAE,IAAE,KAAK,GAAE,IAAE,KAAK,GAAE,IAAE,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,GAAE,IAAE,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,GAAE,IAAE,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,GAAE,IAAE,KAAK,IAAI,EAAE,MAAK,EAAE,IAAI,GAAE,KAAK,IAAI,GAAE,IAAE,CAAC,IAAE,KAAK,IAAI,GAAE,IAAE,CAAC,IAAG,IAAE,EAAE,CAAC,IAAE,EAAE,CAAC;IAAE,IAAE,KAAG,IAAE,GAAE,IAAE,GAAE,IAAE,IAAE,IAAE,IAAE,KAAG,MAAI,KAAG,IAAE,MAAI,IAAE,GAAE,IAAE;GAAE;GAAC,OAAO,KAAG,IAAE;EAAC,GAAE,EAAE,UAAU,mBAAiB,SAAS,GAAE,GAAE,GAAE;GAAC,IAAI,IAAE,EAAE,OAAK,KAAK,cAAY,GAAE,IAAE,EAAE,OAAK,KAAK,cAAY;GAAE,KAAK,eAAe,GAAE,GAAE,GAAE,CAAC,IAAE,KAAK,eAAe,GAAE,GAAE,GAAE,CAAC,KAAG,EAAE,SAAS,KAAK,CAAC;EAAC,GAAE,EAAE,UAAU,iBAAe,SAAS,GAAE,GAAE,GAAE,GAAE;GAAC,EAAE,SAAS,KAAK,CAAC;GAAE,KAAI,IAAI,IAAE,KAAK,QAAO,IAAE,EAAE,GAAE,GAAE,GAAE,CAAC,GAAE,IAAE,EAAE,GAAE,IAAE,GAAE,GAAE,CAAC,GAAE,IAAE,EAAE,CAAC,IAAE,EAAE,CAAC,GAAE,IAAE,GAAE,IAAE,IAAE,GAAE,KAAI;IAAC,IAAI,IAAE,EAAE,SAAS;IAAG,EAAE,GAAE,EAAE,OAAK,EAAE,CAAC,IAAE,CAAC,GAAE,KAAG,EAAE,CAAC;GAAC;GAAC,KAAI,IAAI,IAAE,IAAE,IAAE,GAAE,KAAG,GAAE,KAAI;IAAC,IAAI,IAAE,EAAE,SAAS;IAAG,EAAE,GAAE,EAAE,OAAK,EAAE,CAAC,IAAE,CAAC,GAAE,KAAG,EAAE,CAAC;GAAC;GAAC,OAAO;EAAC,GAAE,EAAE,UAAU,sBAAoB,SAAS,GAAE,GAAE,GAAE;GAAC,KAAI,IAAI,IAAE,GAAE,KAAG,GAAE,KAAI,EAAE,EAAE,IAAG,CAAC;EAAC,GAAE,EAAE,UAAU,YAAU,SAAS,GAAE;GAAC,KAAI,IAAI,IAAE,EAAE,SAAO,GAAE,IAAE,KAAK,GAAE,KAAG,GAAE,KAAI,AAAI,EAAE,GAAG,SAAS,WAAlB,IAAyB,IAAE,KAAG,IAAE,EAAE,IAAE,GAAG,UAAU,OAAO,EAAE,QAAQ,EAAE,EAAE,GAAE,CAAC,IAAE,KAAK,MAAM,IAAE,EAAE,EAAE,IAAG,KAAK,MAAM;EAAC,GAAE;CAAC,CAAC;;AC4E7zM,SAAS,EAAe,GAAG,GAAG;CAC1B,OAAO,IAAI,IAAI,KAAK,MAAI;AAC5B;;CA7EqB,IAArB,MAA+B;EAC3B,YAAY,IAAO,CAAC,GAAG,IAAU,GAAgB;GAK7C,IAJA,KAAK,OAAO,GACZ,KAAK,SAAS,KAAK,KAAK,QACxB,KAAK,UAAU,GAEX,KAAK,SAAS,GACd,KAAK,IAAI,KAAK,KAAK,UAAU,KAAK,GAAG,KAAK,GAAG,KAAK,KAAK,MAAM,CAAC;EAEtE;EAEA,KAAK,GAAM;GAGP,AAFA,KAAK,KAAK,KAAK,CAAI,GACnB,KAAK,UACL,KAAK,IAAI,KAAK,SAAS,CAAC;EAC5B;EAEA,MAAM;GACF,IAAI,KAAK,WAAW,GAAG;GAEvB,IAAM,IAAM,KAAK,KAAK,IAChB,IAAS,KAAK,KAAK,IAAI;GAQ7B,OAPA,KAAK,UAED,KAAK,SAAS,MACd,KAAK,KAAK,KAAK,GACf,KAAK,MAAM,CAAC,IAGT;EACX;EAEA,OAAO;GACH,OAAO,KAAK,KAAK;EACrB;EAEA,IAAI,GAAK;GACL,IAAM,EAAC,SAAM,eAAW,MAClB,IAAO,EAAK;GAElB,OAAO,IAAM,IAAG;IACZ,IAAM,IAAU,IAAM,KAAM,GACtB,IAAU,EAAK;IACrB,IAAI,EAAQ,GAAM,CAAO,KAAK,GAAG;IAEjC,AADA,EAAK,KAAO,GACZ,IAAM;GACV;GAEA,EAAK,KAAO;EAChB;EAEA,MAAM,GAAK;GACP,IAAM,EAAC,SAAM,eAAW,MAClB,IAAa,KAAK,UAAU,GAC5B,IAAO,EAAK;GAElB,OAAO,IAAM,IAAY;IACrB,IAAI,KAAQ,KAAO,KAAK,GACpB,IAAO,EAAK,IACV,IAAQ,IAAO;IAMrB,IAJI,IAAQ,KAAK,UAAU,EAAQ,EAAK,IAAQ,CAAI,IAAI,MACpD,IAAO,GACP,IAAO,EAAK,KAEZ,EAAQ,GAAM,CAAI,KAAK,GAAG;IAG9B,AADA,EAAK,KAAO,GACZ,IAAM;GACV;GAEA,EAAK,KAAO;EAChB;CACJ;;CC1EA,EAAO,UAAU,SAA6B,GAAO,GAAI,GAAO,GAAK;EACjE,IAAI,IAAI,EAAM,IAAI,IAAI,EAAM,IACxB,IAAS;EAEb,AADI,MAAU,KAAA,MAAW,IAAQ,IAC7B,MAAQ,KAAA,MAAW,IAAM,EAAG;EAEhC,KAAK,IADD,KAAO,IAAI,KAAO,GACb,IAAI,GAAG,IAAI,IAAM,GAAG,IAAI,GAAK,IAAI,KAAK;GAC3C,IAAI,IAAK,EAAG,IAAM,IAAE,IAAE,IAAI,IAAK,EAAG,IAAM,IAAE,IAAE,IACxC,IAAK,EAAG,IAAM,IAAE,IAAE,IAAI,IAAK,EAAG,IAAM,IAAE,IAAE;GAG5C,AAFkB,IAAK,KAAQ,IAAK,KAC5B,KAAK,IAAK,MAAO,IAAI,MAAO,IAAK,KAAM,MAChC,IAAS,CAAC;EAC7B;EACA,OAAO;CACX;;CCXA,EAAO,UAAU,SAA+B,GAAO,GAAI,GAAO,GAAK;EACnE,IAAI,IAAI,EAAM,IAAI,IAAI,EAAM,IACxB,IAAS;EAEb,AADI,MAAU,KAAA,MAAW,IAAQ,IAC7B,MAAQ,KAAA,MAAW,IAAM,EAAG;EAEhC,KAAK,IADD,IAAM,IAAM,GACP,IAAI,GAAG,IAAI,IAAM,GAAG,IAAI,GAAK,IAAI,KAAK;GAC3C,IAAI,IAAK,EAAG,IAAE,GAAO,IAAI,IAAK,EAAG,IAAE,GAAO,IACtC,IAAK,EAAG,IAAE,GAAO,IAAI,IAAK,EAAG,IAAE,GAAO;GAG1C,AAFkB,IAAK,KAAQ,IAAK,KAC5B,KAAK,IAAK,MAAO,IAAI,MAAO,IAAK,KAAM,MAChC,IAAS,CAAC;EAC7B;EACA,OAAO;CACX;;CCjBA,IAAI,IAAA,EAAA,GACA,IAAA,EAAA;CAUJ,AARA,EAAO,UAAU,SAAyB,GAAO,GAAI,GAAO,GAAK;EAIzD,OAHA,EAAG,SAAS,KAAK,MAAM,QAAQ,EAAG,EAAE,IAC7B,EAAqB,GAAO,GAAI,GAAO,CAAG,IAE1C,EAAmB,GAAO,GAAI,GAAO,CAAG;CAEvD,GACA,EAAO,QAAQ,SAAS,GACxB,EAAO,QAAQ,OAAO;;CCXtB,CAAC,SAAS,GAAE,GAAE;EAAC,AAAU,OAAO,KAAjB,YAA8C,MAApB,SAA2B,EAAE,CAAO,IAAc,OAAO,UAAnB,cAA2B,OAAO,MAAI,OAAO,CAAC,SAAS,GAAE,CAAC,IAAE,EAAE,CAAC,MAAK,MAAM,aAAW,CAAC,CAAC;CAAC,GAAA,GAAO,SAAS,GAAE;EAAc,IAAM,IAAE;EAAkC,SAAS,EAAE,GAAE,GAAE,GAAE,GAAE,GAAE;GAAC,IAAI,GAAE,GAAE,GAAE,GAAE,IAAE,EAAE,IAAG,IAAE,EAAE,IAAG,IAAE,GAAE,IAAE;GAAE,IAAE,KAAG,IAAE,CAAC,KAAG,IAAE,GAAE,IAAE,EAAE,EAAE,OAAK,IAAE,GAAE,IAAE,EAAE,EAAE;GAAI,IAAI,IAAE;GAAE,IAAG,IAAE,KAAG,IAAE,GAAE,KAAI,IAAE,KAAG,IAAE,CAAC,KAAG,IAAE,MAAI,IAAE,IAAE,KAAG,IAAG,IAAE,EAAE,EAAE,OAAK,IAAE,MAAI,IAAE,IAAE,KAAG,IAAG,IAAE,EAAE,EAAE,KAAI,IAAE,GAAM,MAAJ,MAAQ,EAAE,OAAK,IAAG,IAAE,KAAG,IAAE,IAAG,IAAE,KAAG,IAAE,CAAC,KAAG,IAAE,MAAI,IAAE,IAAE,MAAI,IAAE,IAAE,OAAK,IAAE,IAAG,IAAE,EAAE,EAAE,OAAK,IAAE,MAAI,IAAE,IAAE,MAAI,IAAE,IAAE,OAAK,IAAE,IAAG,IAAE,EAAE,EAAE,KAAI,IAAE,GAAM,MAAJ,MAAQ,EAAE,OAAK;GAAG,OAAK,IAAE,IAAG,IAAE,MAAI,IAAE,IAAE,MAAI,IAAE,IAAE,OAAK,IAAE,IAAG,IAAE,EAAE,EAAE,IAAG,IAAE,GAAM,MAAJ,MAAQ,EAAE,OAAK;GAAG,OAAK,IAAE,IAAG,IAAE,MAAI,IAAE,IAAE,MAAI,IAAE,IAAE,OAAK,IAAE,IAAG,IAAE,EAAE,EAAE,IAAG,IAAE,GAAM,MAAJ,MAAQ,EAAE,OAAK;GAAG,OAAW,MAAJ,KAAW,MAAJ,MAAQ,EAAE,OAAK,IAAG;EAAC;EAAC,SAAS,EAAE,GAAE;GAAC,OAAO,IAAI,aAAa,CAAC;EAAC;EAAC,IAA8E,IAAE,EAAE,CAAC,GAAE,IAAE,EAAE,CAAC,GAAE,IAAE,EAAE,EAAE,GAAE,IAAE,EAAE,EAAE,GAAE,IAAE,EAAE,CAAC;EAAE,EAAE,WAAS,SAAS,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE;GAAC,IAAM,KAAG,IAAE,MAAI,IAAE,IAAG,KAAG,IAAE,MAAI,IAAE,IAAG,IAAE,IAAE;GAAE,IAAO,MAAJ,KAAW,MAAJ,KAAO,IAAE,KAAG,IAAE,GAAE,OAAO;GAAE,IAAM,IAAE,KAAK,IAAI,IAAE,CAAC;GAAE,OAAO,KAAK,IAAI,CAAC,KAAG,wBAAE,IAAE,IAAE,CAAC,SAAS,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE;IAAC,IAAI,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAQ,IAAE,IAAE,GAAE,IAAE,IAAE,GAAE,IAAE,IAAE,GAAE,IAAE,IAAE;IAAE,KAAG,KAAG,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,QAAM,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,SAAO,IAAE,IAAE,KAAG,IAAE,IAAE,IAAE,IAAE,IAAE,OAAK,IAAE,KAAG,KAAG,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,QAAM,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,SAAO,IAAE,IAAE,KAAG,IAAE,IAAE,IAAE,IAAE,IAAE,MAAK,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,KAAG,IAAE,MAAI,IAAE,IAAE,MAAI,IAAE,IAAE,OAAK,IAAE,OAAK,IAAE,IAAE,IAAG,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,KAAG,IAAE,IAAE,KAAG,GAAE,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,EAAE,KAAG;IAAE,IAAI,IAAE,SAAS,GAAE,GAAE;KAAC,IAAI,IAAE,EAAE;KAAG,KAAI,IAAI,IAAE,GAAE,IAAE,GAAE,KAAI,KAAG,EAAE;KAAG,OAAO;IAAC,EAAE,GAAE,CAAC,GAAE,IAAE,wBAAE;IAAyJ,IAApJ,KAAG,KAAG,CAAC,KAAG,MAAc,IAAE,KAAG,KAAG,IAAE,IAAE,OAAK,IAAE,IAAG,IAAE,KAAG,KAAG,IAAE,IAAE,OAAK,IAAE,IAAG,IAAE,KAAG,KAAG,IAAE,IAAE,OAAK,IAAE,IAAG,IAAE,KAAG,KAAG,IAAE,IAAE,OAAK,IAAE,IAAO,MAAJ,KAAW,MAAJ,KAAW,MAAJ,KAAW,MAAJ,OAAkB,IAAE,wBAAE,IAAE,wBAAE,KAAK,IAAI,CAAC,IAAG,KAAG,IAAE,IAAE,IAAE,KAAG,IAAE,IAAE,IAAE,OAAK,KAAG,CAAC,KAAG,IAAE,OAAO;IAAE,KAAG,KAAG,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,QAAM,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,SAAO,IAAE,IAAE,KAAG,IAAE,IAAE,IAAE,IAAE,IAAE,OAAK,IAAE,KAAG,KAAG,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,QAAM,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,SAAO,IAAE,IAAE,KAAG,IAAE,IAAE,IAAE,IAAE,IAAE,MAAK,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,KAAG,IAAE,MAAI,IAAE,IAAE,MAAI,IAAE,IAAE,OAAK,IAAE,OAAK,IAAE,IAAE,IAAG,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,KAAG,IAAE,IAAE,KAAG,GAAE,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,EAAE,KAAG;IAAE,IAAM,IAAE,EAAE,GAAE,GAAE,GAAE,GAAE,CAAC;IAAE,KAAG,KAAG,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,QAAM,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,SAAO,IAAE,IAAE,KAAG,IAAE,IAAE,IAAE,IAAE,IAAE,OAAK,IAAE,KAAG,KAAG,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,QAAM,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,SAAO,IAAE,IAAE,KAAG,IAAE,IAAE,IAAE,IAAE,IAAE,MAAK,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,KAAG,IAAE,MAAI,IAAE,IAAE,MAAI,IAAE,IAAE,OAAK,IAAE,OAAK,IAAE,IAAE,IAAG,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,KAAG,IAAE,IAAE,KAAG,GAAE,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,EAAE,KAAG;IAAE,IAAM,IAAE,EAAE,GAAE,GAAE,GAAE,GAAE,CAAC;IAAuS,OAArS,KAAG,KAAG,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,QAAM,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,SAAO,IAAE,IAAE,KAAG,IAAE,IAAE,IAAE,IAAE,IAAE,OAAK,IAAE,KAAG,KAAG,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,QAAM,IAAE,KAAG,KAAG,IAAE,IAAE,MAAI,IAAE,SAAO,IAAE,IAAE,KAAG,IAAE,IAAE,IAAE,IAAE,IAAE,MAAK,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,KAAG,IAAE,MAAI,IAAE,IAAE,MAAI,IAAE,IAAE,OAAK,IAAE,OAAK,IAAE,IAAE,IAAG,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,KAAG,IAAE,IAAE,KAAG,GAAE,EAAE,KAAG,KAAG,IAAE,MAAI,IAAE,IAAG,EAAE,KAAG,GAA8B,EAApB,EAAE,GAAE,GAAE,GAAE,GAAE,CAAY,IAAE;GAAE,EAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC;EAAC,GAAE,EAAE,eAAa,SAAS,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE;GAAC,QAAO,IAAE,MAAI,IAAE,MAAI,IAAE,MAAI,IAAE;EAAE,GAAE,OAAO,eAAe,GAAE,cAAa,EAAC,OAAM,CAAC,EAAC,CAAC;CAAC,CAAC;;CCErrF,IAAI,IAAA,EAAA,GACA,KAAA,EAAA,GAAA,EAAA,CAAA,IACA,IAAA,EAAA,GACA,IAAA,EAAA,EAA0D;CAQ9D,AALI,EAAM,YACN,IAAQ,EAAM,UAGlB,EAAO,UAAU,GACjB,EAAO,QAAQ,UAAU;CAEzB,SAAS,EAAW,GAAQ,GAAW,GAAiB;EAKpD,AAHA,IAAY,KAAK,IAAI,GAAG,MAAc,KAAA,IAAY,IAAI,CAAS,GAG/D,MAAqC;EAGrC,IAAI,IAAO,EAAe,CAAM,GAG5B,IAAO,IAAI,EAAM,EAAE;EAYvB,AAXA,EAAK,SAAS,SAAU,GAAG;GACvB,OAAO;IACH,MAAM,EAAE;IACR,MAAM,EAAE;IACR,MAAM,EAAE;IACR,MAAM,EAAE;GACZ;EACJ,GACA,EAAK,cAAc,SAAU,GAAG,GAAG;GAAE,OAAO,EAAE,KAAK,EAAE;EAAI,GACzD,EAAK,cAAc,SAAU,GAAG,GAAG;GAAE,OAAO,EAAE,KAAK,EAAE;EAAI,GAEzD,EAAK,KAAK,CAAM;EAIhB,KAAK,IADD,IAAQ,CAAC,GACJ,IAAI,GAAG,GAAM,IAAI,EAAK,QAAQ,KAAK;GACxC,IAAI,IAAI,EAAK;GAGb,AAFA,EAAK,OAAO,CAAC,GACb,IAAO,EAAW,GAAG,CAAI,GACzB,EAAM,KAAK,CAAI;EACnB;EAGA,IAAI,IAAU,IAAI,EAAM,EAAE;EAC1B,KAAK,IAAI,GAAG,IAAI,EAAM,QAAQ,KAAK,EAAQ,OAAO,EAAW,EAAM,EAAE,CAAC;EAMtE,KAJA,IAAI,IAAc,IAAY,GAC1B,IAAiB,IAAkB,GAGhC,EAAM,SAAQ;GACjB,IAAI,IAAO,EAAM,MAAM,GACnB,IAAI,EAAK,GACT,IAAI,EAAK,KAAK,GAGd,IAAQ,EAAU,GAAG,CAAC;GACtB,UAAQ,IAEZ;QAAI,IAAW,IAAQ;IAMvB,AAHA,IAAI,EAAc,GAAM,EAAK,KAAK,GAAG,GAAG,GAAG,EAAK,KAAK,KAAK,GAAG,GAAU,CAAO,GAG1E,KAAK,KAAK,IAAI,EAAU,GAAG,CAAC,GAAG,EAAU,GAAG,CAAC,CAAC,KAAK,MAEnD,EAAM,KAAK,CAAI,GACf,EAAM,KAAK,EAAW,GAAG,CAAI,CAAC,GAG9B,EAAK,OAAO,CAAC,GACb,EAAQ,OAAO,CAAI,GACnB,EAAQ,OAAO,EAAW,CAAI,CAAC,GAC/B,EAAQ,OAAO,EAAW,EAAK,IAAI,CAAC;GAfjB;EAiB3B;EAGA,IAAO;EACP,IAAI,IAAU,CAAC;EACf;GAEI,AADA,EAAQ,KAAK,EAAK,CAAC,GACnB,IAAO,EAAK;SACP,MAAS;EAIlB,OAFA,EAAQ,KAAK,EAAK,CAAC,GAEZ;CACX;CAEA,SAAS,EAAc,GAAM,GAAG,GAAG,GAAG,GAAG,GAAS,GAAS;EAMvD,KALA,IAAI,IAAQ,IAAI,EAAM,CAAC,GAAG,CAAW,GACjC,IAAO,EAAK,MAIT,IAAM;GACT,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,SAAS,QAAQ,KAAK;IAC3C,IAAI,IAAQ,EAAK,SAAS,IAEtB,IAAO,EAAK,OAAO,EAAU,GAAO,GAAG,CAAC,IAAI,EAAa,GAAG,GAAG,CAAK;IACpE,IAAO,KAEX,EAAM,KAAK;KACP,MAAM;KACA;IACV,CAAC;GACL;GAEA,OAAO,EAAM,UAAU,CAAC,EAAM,KAAK,EAAE,KAAK,WAAU;IAChD,IAAI,IAAO,EAAM,IAAI,GACjB,IAAI,EAAK,MAIT,IAAK,EAAU,GAAG,GAAG,CAAC,GACtB,IAAK,EAAU,GAAG,GAAG,CAAC;IAC1B,IAAI,EAAK,OAAO,KAAM,EAAK,OAAO,KAC9B,EAAgB,GAAG,GAAG,CAAO,KAC7B,EAAgB,GAAG,GAAG,CAAO,GAAG,OAAO;GAC/C;GAGA,AADA,IAAO,EAAM,IAAI,GACjB,AAAU,MAAO,EAAK;EAC1B;EAEA,OAAO;CACX;CAEA,SAAS,EAAY,GAAG,GAAG;EACvB,OAAO,EAAE,OAAO,EAAE;CACtB;CAGA,SAAS,EAAa,GAAG,GAAG,GAAM;EAC9B,IAAI,EAAO,GAAG,CAAI,KAAK,EAAO,GAAG,CAAI,GAAG,OAAO;EAC/C,IAAI,IAAK,EAAa,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAK,MAAM,EAAK,MAAM,EAAK,MAAM,EAAK,IAAI;EACxF,IAAI,MAAO,GAAG,OAAO;EACrB,IAAI,IAAK,EAAa,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAK,MAAM,EAAK,MAAM,EAAK,MAAM,EAAK,IAAI;EACxF,IAAI,MAAO,GAAG,OAAO;EACrB,IAAI,IAAK,EAAa,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAK,MAAM,EAAK,MAAM,EAAK,MAAM,EAAK,IAAI;EACxF,IAAI,MAAO,GAAG,OAAO;EACrB,IAAI,IAAK,EAAa,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAK,MAAM,EAAK,MAAM,EAAK,MAAM,EAAK,IAAI;EAExF,OADI,MAAO,IAAU,IACd,KAAK,IAAI,GAAI,GAAI,GAAI,CAAE;CAClC;CAEA,SAAS,EAAO,GAAG,GAAM;EACrB,OAAO,EAAE,MAAM,EAAK,QACb,EAAE,MAAM,EAAK,QACb,EAAE,MAAM,EAAK,QACb,EAAE,MAAM,EAAK;CACxB;CAGA,SAAS,EAAgB,GAAG,GAAG,GAAS;EAOpC,KAAK,IAND,IAAO,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,GAC1B,IAAO,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,GAC1B,IAAO,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,GAC1B,IAAO,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,GAE1B,IAAQ,EAAQ,OAAO;GAAO;GAAY;GAAY;GAAY;EAAI,CAAC,GAClE,IAAI,GAAG,IAAI,EAAM,QAAQ,KAC9B,IAAI,EAAW,EAAM,GAAG,GAAG,EAAM,GAAG,KAAK,GAAG,GAAG,CAAC,GAAG,OAAO;EAE9D,OAAO;CACX;CAEA,SAAS,EAAM,GAAI,GAAI,GAAI;EACvB,OAAO,EAAO,EAAG,IAAI,EAAG,IAAI,EAAG,IAAI,EAAG,IAAI,EAAG,IAAI,EAAG,EAAE;CAC1D;CAGA,SAAS,EAAW,GAAI,GAAI,GAAI,GAAI;EAChC,OAAO,MAAO,KAAM,MAAO,KACvB,EAAM,GAAI,GAAI,CAAE,IAAI,KAAM,EAAM,GAAI,GAAI,CAAE,IAAI,KAC9C,EAAM,GAAI,GAAI,CAAE,IAAI,KAAM,EAAM,GAAI,GAAI,CAAE,IAAI;CACtD;CAGA,SAAS,EAAW,GAAM;EACtB,IAAI,IAAK,EAAK,GACV,IAAK,EAAK,KAAK;EAKnB,OAJA,EAAK,OAAO,KAAK,IAAI,EAAG,IAAI,EAAG,EAAE,GACjC,EAAK,OAAO,KAAK,IAAI,EAAG,IAAI,EAAG,EAAE,GACjC,EAAK,OAAO,KAAK,IAAI,EAAG,IAAI,EAAG,EAAE,GACjC,EAAK,OAAO,KAAK,IAAI,EAAG,IAAI,EAAG,EAAE,GAC1B;CACX;CAGA,SAAS,EAAe,GAAQ;EAO5B,KAAK,IAND,IAAO,EAAO,IACd,IAAM,EAAO,IACb,IAAQ,EAAO,IACf,IAAS,EAAO,IAGX,IAAI,GAAG,IAAI,EAAO,QAAQ,KAAK;GACpC,IAAI,IAAI,EAAO;GAIf,AAHI,EAAE,KAAK,EAAK,OAAI,IAAO,IACvB,EAAE,KAAK,EAAM,OAAI,IAAQ,IACzB,EAAE,KAAK,EAAI,OAAI,IAAM,IACrB,EAAE,KAAK,EAAO,OAAI,IAAS;EACnC;EAGA,IAAI,IAAO;GAAC;GAAM;GAAK;GAAO;EAAM,GAChC,IAAW,EAAK,MAAM;EAC1B,KAAK,IAAI,GAAG,IAAI,EAAO,QAAQ,KAC3B,AAAK,EAAe,EAAO,IAAI,CAAI,KAAG,EAAS,KAAK,EAAO,EAAE;EAIjE,OAAO,EAAW,CAAQ;CAC9B;CAGA,SAAS,EAAW,GAAG,GAAM;EACzB,IAAI,IAAO;GACJ;GACH,MAAM;GACN,MAAM;GACN,MAAM;GACN,MAAM;GACN,MAAM;GACN,MAAM;EACV;EAYA,OAVK,KAKD,EAAK,OAAO,EAAK,MACjB,EAAK,OAAO,GACZ,EAAK,KAAK,OAAO,GACjB,EAAK,OAAO,MAPZ,EAAK,OAAO,GACZ,EAAK,OAAO,IAQT;CACX;CAGA,SAAS,EAAU,GAAI,GAAI;EAEvB,IAAI,IAAK,EAAG,KAAK,EAAG,IAChB,IAAK,EAAG,KAAK,EAAG;EAEpB,OAAO,IAAK,IAAK,IAAK;CAC1B;CAGA,SAAS,EAAU,GAAG,GAAI,GAAI;EAE1B,IAAI,IAAI,EAAG,IACP,IAAI,EAAG,IACP,IAAK,EAAG,KAAK,GACb,IAAK,EAAG,KAAK;EAEjB,IAAI,MAAO,KAAK,MAAO,GAAG;GAEtB,IAAI,MAAM,EAAE,KAAK,KAAK,KAAM,EAAE,KAAK,KAAK,MAAO,IAAK,IAAK,IAAK;GAE9D,AAAI,IAAI,KACJ,IAAI,EAAG,IACP,IAAI,EAAG,MAEA,IAAI,MACX,KAAK,IAAK,GACV,KAAK,IAAK;EAElB;EAKA,OAHA,IAAK,EAAE,KAAK,GACZ,IAAK,EAAE,KAAK,GAEL,IAAK,IAAK,IAAK;CAC1B;CAGA,SAAS,EAAa,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI;EAClD,IAAI,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAI,IAAK,IAAK,IAAK,GACnB,IAAI,IAAK,IAAK,IAAK,GACnB,IAAI,IAAK,IAAK,IAAK,GACnB,IAAI,IAAK,IAAK,IAAK,GACnB,IAAI,IAAK,IAAK,IAAK,GACnB,IAAI,IAAI,IAAI,IAAI,GAEhB,GAAI,GAAI,GAAI,GACZ,IAAK,GACL,IAAK;EAwCT,AAtCI,MAAM,KACN,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,MAEL,IAAK,IAAI,IAAI,IAAI,GACjB,IAAK,IAAI,IAAI,IAAI,GACb,IAAK,KACL,IAAK,GACL,IAAK,GACL,IAAK,KACE,IAAK,MACZ,IAAK,GACL,IAAK,IAAI,GACT,IAAK,KAIT,IAAK,KACL,IAAK,GACD,CAAC,IAAI,IAAK,IAAK,IACV,CAAC,IAAI,IAAG,IAAK,KAElB,IAAK,CAAC,GACN,IAAK,MAEF,IAAK,MACZ,IAAK,GACA,CAAC,IAAI,IAAK,IAAK,IAAK,IAChB,CAAC,IAAI,IAAI,IAAG,IAAK,KAEtB,IAAK,CAAC,IAAI,GACV,IAAK,KAIb,IAAK,MAAO,IAAI,IAAI,IAAK,GACzB,IAAK,MAAO,IAAI,IAAI,IAAK;EAEzB,IAAI,KAAM,IAAI,KAAM,IAAK,IAAK,GAC1B,KAAM,IAAI,KAAM,IAAK,IAAK,GAC1B,KAAO,IAAI,KAAM,IAAK,IAAK,GAC3B,KAAO,IAAI,KAAM,IAAK,IAAK,GAC3B,IAAK,IAAM,GACX,IAAK,IAAM;EAEf,OAAO,IAAK,IAAK,IAAK;CAC1B;CAEA,SAAS,EAAW,GAAG,GAAG;EACtB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE;CAClD;CAEA,SAAS,EAAW,GAAQ;EACxB,EAAO,KAAK,CAAU;EAGtB,KAAK,IADD,IAAQ,CAAC,GACJ,IAAI,GAAG,IAAI,EAAO,QAAQ,KAAK;GACpC,OAAO,EAAM,UAAU,KAAK,EAAM,EAAM,EAAM,SAAS,IAAI,EAAM,EAAM,SAAS,IAAI,EAAO,EAAE,KAAK,IAC9F,EAAM,IAAI;GAEd,EAAM,KAAK,EAAO,EAAE;EACxB;EAGA,KAAK,IADD,IAAQ,CAAC,GACJ,IAAK,EAAO,SAAS,GAAG,KAAM,GAAG,KAAM;GAC5C,OAAO,EAAM,UAAU,KAAK,EAAM,EAAM,EAAM,SAAS,IAAI,EAAM,EAAM,SAAS,IAAI,EAAO,EAAG,KAAK,IAC/F,EAAM,IAAI;GAEd,EAAM,KAAK,EAAO,EAAG;EACzB;EAIA,OAFA,EAAM,IAAI,GACV,EAAM,IAAI,GACH,EAAM,OAAO,CAAK;CAC7B;;AC1XA,SAAS,EAAO,GAAS,IAAU,CAAC,GAAG;CACrC,EAAQ,YAAY,EAAQ,aAAa;CACzC,IAAM,IAAS,CAAC;CAIhB,IAHA,EAAU,IAAU,MAAU;EAC5B,EAAO,KAAK,CAAC,EAAM,IAAI,EAAM,EAAE,CAAC;CAClC,CAAC,GACG,CAAC,EAAO,QACV,OAAO;CAET,IAAM,KAAA,GAAA,EAAA,SAAwB,GAAQ,EAAQ,SAAS;CAIvD,OAHI,EAAW,SAAS,IACf,EAAQ,CAAC,CAAU,CAAC,IAEtB;AACT;;;ACfA,SAAS,EAAS,GAAS,IAAU,CAAC,GAAG;CACvC,IAAI,IAAO,GACP,IAAO,GACP,IAAM;CAUV,OATA,EACE,GACA,SAAS,GAAO;EAGd,AAFA,KAAQ,EAAM,IACd,KAAQ,EAAM,IACd;CACF,GACA,EACF,GACO,EAAM,CAAC,IAAO,GAAK,IAAO,CAAG,GAAG,EAAQ,UAAU;AAC3D;;;ACfA,SAAS,EAAS,GAAO;CACvB,IAAI,CAAC,GACH,MAAU,MAAM,mBAAmB;CAErC,IAAI,CAAC,MAAM,QAAQ,CAAK,GAAG;EACzB,IAAI,EAAM,SAAS,aAAa,EAAM,aAAa,QAAQ,EAAM,SAAS,SAAS,SACjF,OAAO,CAAC,GAAG,EAAM,SAAS,WAAW;EAEvC,IAAI,EAAM,SAAS,SACjB,OAAO,CAAC,GAAG,EAAM,WAAW;CAEhC;CACA,IAAI,MAAM,QAAQ,CAAK,KAAK,EAAM,UAAU,KAAK,CAAC,MAAM,QAAQ,EAAM,EAAE,KAAK,CAAC,MAAM,QAAQ,EAAM,EAAE,GAClG,OAAO,CAAC,GAAG,CAAK;CAElB,MAAU,MAAM,oDAAoD;AACtE;AAsFA,SAAS,EAAQ,GAAS,GAAO;CAU/B,OATI,EAAQ,SAAS,sBACZ,sBAEL,EAAQ,SAAS,uBACZ,uBAEL,EAAQ,SAAS,aAAa,EAAQ,aAAa,OAC9C,EAAQ,SAAS,OAEnB,EAAQ;AACjB;;;AC7GA,SAAS,EAAa,GAAS,IAAU,CAAC,GAAG;CAC3C,QAAQ,EAAQ,CAAO,GAAvB;EACE,KAAK,SACH,OAAO,EAAM,EAAS,CAAO,GAAG,EAAQ,UAAU;EACpD,KAAK;GACH,IAAI,IAAS,CAAC;GACd,EAAU,GAAS,SAAS,GAAO;IACjC,EAAO,KAAK,CAAK;GACnB,CAAC;GACD,IAAI,IAAS,EAAS,GAAS,EAAE,YAAY,EAAQ,WAAW,CAAC,GAC7D,IAAc,EAAO,SAAS,aAC9B,IAAK,GACL,IAAK,GACL,IAAQ,GACR,GAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC3B,IAAoB,EAAO,IAAI,SAAS,GAAQ;IAClD,OAAO,CAAC,EAAO,KAAK,EAAY,IAAI,EAAO,KAAK,EAAY,EAAE;GAChE,CAAC;GACD,KAAK,IAAI,GAAG,IAAI,EAAO,SAAS,GAAG,KAUjC,AATA,IAAK,EAAkB,IACvB,IAAK,EAAG,IACR,IAAK,EAAG,IACR,IAAK,EAAkB,IAAI,IAC3B,IAAK,EAAG,IACR,IAAK,EAAG,IACR,IAAI,IAAK,IAAK,IAAK,GACnB,KAAS,GACT,MAAO,IAAK,KAAM,GAClB,MAAO,IAAK,KAAM;GAEpB,IAAI,MAAU,GACZ,OAAO;GAGP,IAAI,IAAa,KADN,IAAQ,KACG;GACtB,OAAO,EACL,CAAC,EAAY,KAAK,IAAa,GAAI,EAAY,KAAK,IAAa,CAAE,GACnE,EAAQ,UACV;EAEJ;GACE,IAAI,IAAO,EAAO,CAAO;GAEpB,OADD,IAAa,EAAa,GAAM,EAAE,YAAY,EAAQ,WAAW,CAAC,IAC1D,EAAS,GAAS,EAAE,YAAY,EAAQ,WAAW,CAAC;CACpE;AACF;AACA,IAAI,IAAgB"}

package/dist/excelDownload-CVpK5TPY.cjs

@@ -0,0 +1,2 @@
+const e=require(`./chunk-gGpyby2o.cjs`);let t=require(`file-saver`);t=e.a(t,1);let n=require(`xlsx`);n=e.a(n,1);var r=(e,r,i,a,o)=>{let s=n.utils.json_to_sheet([a],{header:i,skipHeader:!0});s[`!cols`]=o,n.utils.sheet_add_json(s,e,{header:i,skipHeader:!0,origin:-1});let c={Sheets:{data:s},SheetNames:[`data`]},l=n.write(c,{bookType:`xlsx`,type:`array`}),u=new Blob([l],{type:`application/vnd.openxmlformats-officedocument.spreadsheetml.sheet;charset=UTF-8`});t.default.saveAs(u,`${r}.xlsx`)};Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return r}});
+//# sourceMappingURL=excelDownload-CVpK5TPY.cjs.map

package/dist/excelDownload-CVpK5TPY.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"excelDownload-CVpK5TPY.cjs","names":[],"sources":["../src/Utils/excelDownload.ts"],"sourcesContent":["import FileSaver from 'file-saver';\nimport * as XLSX from 'xlsx';\n\ninterface WsColInterface {\n  wch: number;\n}\n/**\n * Downloads CSV data as an Excel file with specified headers and column widths.\n *\n * The function converts JSON data (`csvData`) to an Excel sheet, adds headers, and applies custom column widths.\n * The resulting file is then downloaded using `file-saver` as an `.xlsx` file.\n *\n * @param csvData - The data to be exported as an Excel sheet, represented as an array of objects.\n * @param fileName - The name of the file to be downloaded (without extension).\n * @param headers - The headers for the Excel sheet.\n * @param xlsxHeader - The header data to be used for the Excel file (should match `headers`).\n * @param wscols - The column width configuration, where each item corresponds to a column.\n *\n * @example\n * const data = [{ name: 'Alice', age: 25 }, { name: 'Bob', age: 30 }];\n * const headers = ['name', 'age'];\n * const xlsxHeader = {\n *  name: \"Full Name\",\n *  age: \"Age\",\n * };\n * const columnWidths = [{ wch: 10 }, { wch: 5 }];\n * excelDownload(data, 'user_data', headers, xlsxHeader, columnWidths);\n */\n\nexport const excelDownload = (\n  // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n  csvData: any,\n  fileName: string,\n  headers: string[],\n  xlsxHeader: {\n    [key: string]: string;\n  },\n  wscols: WsColInterface[],\n) => {\n  const fileType =\n    'application/vnd.openxmlformats-officedocument.spreadsheetml.sheet;charset=UTF-8';\n  const ws = XLSX.utils.json_to_sheet([xlsxHeader], {\n    header: headers,\n    skipHeader: true,\n  });\n\n  ws['!cols'] = wscols;\n  XLSX.utils.sheet_add_json(ws, csvData, {\n    header: headers,\n    skipHeader: true,\n    origin: -1,\n  });\n  const wb = { Sheets: { data: ws }, SheetNames: ['data'] };\n  const excelBuffer = XLSX.write(wb, { bookType: 'xlsx', type: 'array' });\n  const dataForExcel = new Blob([excelBuffer], { type: fileType });\n  FileSaver.saveAs(dataForExcel, `${fileName}.xlsx`);\n};\n"],"mappings":"gHA6BA,IAAa,GAEX,EACA,EACA,EACA,EAGA,IACG,CACH,IAEM,EAAK,EAAK,MAAM,cAAc,CAAC,CAAU,EAAG,CAChD,OAAQ,EACR,WAAY,EACd,CAAC,EAED,EAAG,SAAW,EACd,EAAK,MAAM,eAAe,EAAI,EAAS,CACrC,OAAQ,EACR,WAAY,GACZ,OAAQ,EACV,CAAC,EACD,IAAM,EAAK,CAAE,OAAQ,CAAE,KAAM,CAAG,EAAG,WAAY,CAAC,MAAM,CAAE,EAClD,EAAc,EAAK,MAAM,EAAI,CAAE,SAAU,OAAQ,KAAM,OAAQ,CAAC,EAChE,EAAe,IAAI,KAAK,CAAC,CAAW,EAAG,CAAE,KAAM,iFAAS,CAAC,EAC/D,EAAA,QAAU,OAAO,EAAc,GAAG,EAAS,MAAM,CACnD"}

package/dist/excelDownload-lQy9nEu2.js

@@ -0,0 +1,26 @@
+import e from "file-saver";
+import * as t from "xlsx";
+//#region src/Utils/excelDownload.ts
+var n = (n, r, i, a, o) => {
+	let s = t.utils.json_to_sheet([a], {
+		header: i,
+		skipHeader: !0
+	});
+	s["!cols"] = o, t.utils.sheet_add_json(s, n, {
+		header: i,
+		skipHeader: !0,
+		origin: -1
+	});
+	let c = {
+		Sheets: { data: s },
+		SheetNames: ["data"]
+	}, l = t.write(c, {
+		bookType: "xlsx",
+		type: "array"
+	}), u = new Blob([l], { type: "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet;charset=UTF-8" });
+	e.saveAs(u, `${r}.xlsx`);
+};
+//#endregion
+export { n as t };
+
+//# sourceMappingURL=excelDownload-lQy9nEu2.js.map

package/dist/excelDownload-lQy9nEu2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"excelDownload-lQy9nEu2.js","names":[],"sources":["../src/Utils/excelDownload.ts"],"sourcesContent":["import FileSaver from 'file-saver';\nimport * as XLSX from 'xlsx';\n\ninterface WsColInterface {\n  wch: number;\n}\n/**\n * Downloads CSV data as an Excel file with specified headers and column widths.\n *\n * The function converts JSON data (`csvData`) to an Excel sheet, adds headers, and applies custom column widths.\n * The resulting file is then downloaded using `file-saver` as an `.xlsx` file.\n *\n * @param csvData - The data to be exported as an Excel sheet, represented as an array of objects.\n * @param fileName - The name of the file to be downloaded (without extension).\n * @param headers - The headers for the Excel sheet.\n * @param xlsxHeader - The header data to be used for the Excel file (should match `headers`).\n * @param wscols - The column width configuration, where each item corresponds to a column.\n *\n * @example\n * const data = [{ name: 'Alice', age: 25 }, { name: 'Bob', age: 30 }];\n * const headers = ['name', 'age'];\n * const xlsxHeader = {\n *  name: \"Full Name\",\n *  age: \"Age\",\n * };\n * const columnWidths = [{ wch: 10 }, { wch: 5 }];\n * excelDownload(data, 'user_data', headers, xlsxHeader, columnWidths);\n */\n\nexport const excelDownload = (\n  // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n  csvData: any,\n  fileName: string,\n  headers: string[],\n  xlsxHeader: {\n    [key: string]: string;\n  },\n  wscols: WsColInterface[],\n) => {\n  const fileType =\n    'application/vnd.openxmlformats-officedocument.spreadsheetml.sheet;charset=UTF-8';\n  const ws = XLSX.utils.json_to_sheet([xlsxHeader], {\n    header: headers,\n    skipHeader: true,\n  });\n\n  ws['!cols'] = wscols;\n  XLSX.utils.sheet_add_json(ws, csvData, {\n    header: headers,\n    skipHeader: true,\n    origin: -1,\n  });\n  const wb = { Sheets: { data: ws }, SheetNames: ['data'] };\n  const excelBuffer = XLSX.write(wb, { bookType: 'xlsx', type: 'array' });\n  const dataForExcel = new Blob([excelBuffer], { type: fileType });\n  FileSaver.saveAs(dataForExcel, `${fileName}.xlsx`);\n};\n"],"mappings":";;;AA6BA,IAAa,KAEX,GACA,GACA,GACA,GAGA,MACG;CACH,IAEM,IAAK,EAAK,MAAM,cAAc,CAAC,CAAU,GAAG;EAChD,QAAQ;EACR,YAAY;CACd,CAAC;CAGD,AADA,EAAG,WAAW,GACd,EAAK,MAAM,eAAe,GAAI,GAAS;EACrC,QAAQ;EACR,YAAY;EACZ,QAAQ;CACV,CAAC;CACD,IAAM,IAAK;EAAE,QAAQ,EAAE,MAAM,EAAG;EAAG,YAAY,CAAC,MAAM;CAAE,GAClD,IAAc,EAAK,MAAM,GAAI;EAAE,UAAU;EAAQ,MAAM;CAAQ,CAAC,GAChE,IAAe,IAAI,KAAK,CAAC,CAAW,GAAG,EAAE,MAAM,kFAAS,CAAC;CAC/D,EAAU,OAAO,GAAc,GAAG,EAAS,MAAM;AACnD"}

package/dist/fast-deep-equal--80N92KJ.js

@@ -0,0 +1,31 @@
+import { t as e } from "./chunk-foFoljWS.js";
+//#region node_modules/fast-deep-equal/index.js
+var t = /* @__PURE__ */ e(((e, t) => {
+	t.exports = function e(t, n) {
+		if (t === n) return !0;
+		if (t && n && typeof t == "object" && typeof n == "object") {
+			if (t.constructor !== n.constructor) return !1;
+			var r, i, a;
+			if (Array.isArray(t)) {
+				if (r = t.length, r != n.length) return !1;
+				for (i = r; i-- !== 0;) if (!e(t[i], n[i])) return !1;
+				return !0;
+			}
+			if (t.constructor === RegExp) return t.source === n.source && t.flags === n.flags;
+			if (t.valueOf !== Object.prototype.valueOf) return t.valueOf() === n.valueOf();
+			if (t.toString !== Object.prototype.toString) return t.toString() === n.toString();
+			if (a = Object.keys(t), r = a.length, r !== Object.keys(n).length) return !1;
+			for (i = r; i-- !== 0;) if (!Object.prototype.hasOwnProperty.call(n, a[i])) return !1;
+			for (i = r; i-- !== 0;) {
+				var o = a[i];
+				if (!e(t[o], n[o])) return !1;
+			}
+			return !0;
+		}
+		return t !== t && n !== n;
+	};
+}));
+//#endregion
+export { t };
+
+//# sourceMappingURL=fast-deep-equal--80N92KJ.js.map

package/dist/fast-deep-equal--80N92KJ.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fast-deep-equal--80N92KJ.js","names":[],"sources":["../node_modules/fast-deep-equal/index.js"],"sourcesContent":["'use strict';\n\n// do not edit .js files directly - edit src/index.jst\n\n\n\nmodule.exports = function equal(a, b) {\n  if (a === b) return true;\n\n  if (a && b && typeof a == 'object' && typeof b == 'object') {\n    if (a.constructor !== b.constructor) return false;\n\n    var length, i, keys;\n    if (Array.isArray(a)) {\n      length = a.length;\n      if (length != b.length) return false;\n      for (i = length; i-- !== 0;)\n        if (!equal(a[i], b[i])) return false;\n      return true;\n    }\n\n\n\n    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n    keys = Object.keys(a);\n    length = keys.length;\n    if (length !== Object.keys(b).length) return false;\n\n    for (i = length; i-- !== 0;)\n      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n\n    for (i = length; i-- !== 0;) {\n      var key = keys[i];\n\n      if (!equal(a[key], b[key])) return false;\n    }\n\n    return true;\n  }\n\n  // true if both NaN, false otherwise\n  return a!==a && b!==b;\n};\n"],"x_google_ignoreList":[0],"mappings":";;;CAMA,EAAO,UAAU,SAAS,EAAM,GAAG,GAAG;EACpC,IAAI,MAAM,GAAG,OAAO;EAEpB,IAAI,KAAK,KAAK,OAAO,KAAK,YAAY,OAAO,KAAK,UAAU;GAC1D,IAAI,EAAE,gBAAgB,EAAE,aAAa,OAAO;GAE5C,IAAI,GAAQ,GAAG;GACf,IAAI,MAAM,QAAQ,CAAC,GAAG;IAEpB,IADA,IAAS,EAAE,QACP,KAAU,EAAE,QAAQ,OAAO;IAC/B,KAAK,IAAI,GAAQ,QAAQ,IACvB,IAAI,CAAC,EAAM,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO;IACjC,OAAO;GACT;GAIA,IAAI,EAAE,gBAAgB,QAAQ,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;GAC5E,IAAI,EAAE,YAAY,OAAO,UAAU,SAAS,OAAO,EAAE,QAAQ,MAAM,EAAE,QAAQ;GAC7E,IAAI,EAAE,aAAa,OAAO,UAAU,UAAU,OAAO,EAAE,SAAS,MAAM,EAAE,SAAS;GAIjF,IAFA,IAAO,OAAO,KAAK,CAAC,GACpB,IAAS,EAAK,QACV,MAAW,OAAO,KAAK,CAAC,EAAE,QAAQ,OAAO;GAE7C,KAAK,IAAI,GAAQ,QAAQ,IACvB,IAAI,CAAC,OAAO,UAAU,eAAe,KAAK,GAAG,EAAK,EAAE,GAAG,OAAO;GAEhE,KAAK,IAAI,GAAQ,QAAQ,IAAI;IAC3B,IAAI,IAAM,EAAK;IAEf,IAAI,CAAC,EAAM,EAAE,IAAM,EAAE,EAAI,GAAG,OAAO;GACrC;GAEA,OAAO;EACT;EAGA,OAAO,MAAI,KAAK,MAAI;CACtB"}

package/dist/fast-deep-equal-DN3ilkVq.cjs

@@ -0,0 +1,2 @@
+var e=require(`./chunk-gGpyby2o.cjs`).t(((e,t)=>{t.exports=function e(t,n){if(t===n)return!0;if(t&&n&&typeof t==`object`&&typeof n==`object`){if(t.constructor!==n.constructor)return!1;var r,i,a;if(Array.isArray(t)){if(r=t.length,r!=n.length)return!1;for(i=r;i--!==0;)if(!e(t[i],n[i]))return!1;return!0}if(t.constructor===RegExp)return t.source===n.source&&t.flags===n.flags;if(t.valueOf!==Object.prototype.valueOf)return t.valueOf()===n.valueOf();if(t.toString!==Object.prototype.toString)return t.toString()===n.toString();if(a=Object.keys(t),r=a.length,r!==Object.keys(n).length)return!1;for(i=r;i--!==0;)if(!Object.prototype.hasOwnProperty.call(n,a[i]))return!1;for(i=r;i--!==0;){var o=a[i];if(!e(t[o],n[o]))return!1}return!0}return t!==t&&n!==n}}));Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return e}});
+//# sourceMappingURL=fast-deep-equal-DN3ilkVq.cjs.map

package/dist/fast-deep-equal-DN3ilkVq.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"fast-deep-equal-DN3ilkVq.cjs","names":[],"sources":["../node_modules/fast-deep-equal/index.js"],"sourcesContent":["'use strict';\n\n// do not edit .js files directly - edit src/index.jst\n\n\n\nmodule.exports = function equal(a, b) {\n  if (a === b) return true;\n\n  if (a && b && typeof a == 'object' && typeof b == 'object') {\n    if (a.constructor !== b.constructor) return false;\n\n    var length, i, keys;\n    if (Array.isArray(a)) {\n      length = a.length;\n      if (length != b.length) return false;\n      for (i = length; i-- !== 0;)\n        if (!equal(a[i], b[i])) return false;\n      return true;\n    }\n\n\n\n    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n    keys = Object.keys(a);\n    length = keys.length;\n    if (length !== Object.keys(b).length) return false;\n\n    for (i = length; i-- !== 0;)\n      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n\n    for (i = length; i-- !== 0;) {\n      var key = keys[i];\n\n      if (!equal(a[key], b[key])) return false;\n    }\n\n    return true;\n  }\n\n  // true if both NaN, false otherwise\n  return a!==a && b!==b;\n};\n"],"x_google_ignoreList":[0],"mappings":"iDAMA,EAAO,QAAU,SAAS,EAAM,EAAG,EAAG,CACpC,GAAI,IAAM,EAAG,MAAO,GAEpB,GAAI,GAAK,GAAK,OAAO,GAAK,UAAY,OAAO,GAAK,SAAU,CAC1D,GAAI,EAAE,cAAgB,EAAE,YAAa,MAAO,GAE5C,IAAI,EAAQ,EAAG,EACf,GAAI,MAAM,QAAQ,CAAC,EAAG,CAEpB,GADA,EAAS,EAAE,OACP,GAAU,EAAE,OAAQ,MAAO,GAC/B,IAAK,EAAI,EAAQ,MAAQ,GACvB,GAAI,CAAC,EAAM,EAAE,GAAI,EAAE,EAAE,EAAG,MAAO,GACjC,MAAO,EACT,CAIA,GAAI,EAAE,cAAgB,OAAQ,OAAO,EAAE,SAAW,EAAE,QAAU,EAAE,QAAU,EAAE,MAC5E,GAAI,EAAE,UAAY,OAAO,UAAU,QAAS,OAAO,EAAE,QAAQ,IAAM,EAAE,QAAQ,EAC7E,GAAI,EAAE,WAAa,OAAO,UAAU,SAAU,OAAO,EAAE,SAAS,IAAM,EAAE,SAAS,EAIjF,GAFA,EAAO,OAAO,KAAK,CAAC,EACpB,EAAS,EAAK,OACV,IAAW,OAAO,KAAK,CAAC,EAAE,OAAQ,MAAO,GAE7C,IAAK,EAAI,EAAQ,MAAQ,GACvB,GAAI,CAAC,OAAO,UAAU,eAAe,KAAK,EAAG,EAAK,EAAE,EAAG,MAAO,GAEhE,IAAK,EAAI,EAAQ,MAAQ,GAAI,CAC3B,IAAI,EAAM,EAAK,GAEf,GAAI,CAAC,EAAM,EAAE,GAAM,EAAE,EAAI,EAAG,MAAO,EACrC,CAEA,MAAO,EACT,CAGA,OAAO,IAAI,GAAK,IAAI,CACtB"}