@swissgeo/coordinates 1.0.3 → 1.0.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (17) hide show
  1. package/dist/index-CAWonZrD.js +5684 -0
  2. package/dist/index-CAWonZrD.js.map +1 -0
  3. package/dist/index-DySGZKr1.cjs +21 -0
  4. package/dist/index-DySGZKr1.cjs.map +1 -0
  5. package/dist/index.cjs +6 -6
  6. package/dist/index.cjs.map +1 -1
  7. package/dist/index.js +426 -425
  8. package/dist/index.js.map +1 -1
  9. package/dist/ol.cjs +1 -1
  10. package/dist/ol.js +7 -7
  11. package/package.json +8 -8
  12. package/vite.config.ts +7 -5
  13. package/vitest.config.ts +9 -0
  14. package/dist/index-C-LPtO1W.js +0 -10118
  15. package/dist/index-C-LPtO1W.js.map +0 -1
  16. package/dist/index-e9ERo8-f.cjs +0 -24
  17. package/dist/index-e9ERo8-f.cjs.map +0 -1
package/dist/index-C-LPtO1W.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"file":"index-C-LPtO1W.js","sources":["../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/global.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/constants/values.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/constants/PrimeMeridian.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/constants/units.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/match.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projString.js","../../../node_modules/.pnpm/wkt-parser@1.5.2/node_modules/wkt-parser/PROJJSONBuilderBase.js","../../../node_modules/.pnpm/wkt-parser@1.5.2/node_modules/wkt-parser/PROJJSONBuilder2015.js","../../../node_modules/.pnpm/wkt-parser@1.5.2/node_modules/wkt-parser/PROJJSONBuilder2019.js","../../../node_modules/.pnpm/wkt-parser@1.5.2/node_modules/wkt-parser/buildPROJJSON.js","../../../node_modules/.pnpm/wkt-parser@1.5.2/node_modules/wkt-parser/detectWKTVersion.js","../../../node_modules/.pnpm/wkt-parser@1.5.2/node_modules/wkt-parser/parser.js","../../../node_modules/.pnpm/wkt-parser@1.5.2/node_modules/wkt-parser/process.js","../../../node_modules/.pnpm/wkt-parser@1.5.2/node_modules/wkt-parser/util.js","../../../node_modules/.pnpm/wkt-parser@1.5.2/node_modules/wkt-parser/transformPROJJSON.js","../../../node_modules/.pnpm/wkt-parser@1.5.2/node_modules/wkt-parser/index.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/defs.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/parseCode.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/extend.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/msfnz.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/sign.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/adjust_lon.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/tsfnz.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/phi2z.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/merc.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/longlat.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/constants/Ellipsoid.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/deriveConstants.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/constants/Datum.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/datum.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/nadgrid.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/Proj.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/datumUtils.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/datum_transform.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/adjust_axis.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/toPoint.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/checkSanity.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/transform.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/core.js","../../../node_modules/.pnpm/mgrs@1.0.0/node_modules/mgrs/mgrs.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/Point.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/pj_enfn.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/pj_mlfn.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/pj_inv_mlfn.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/tmerc.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/sinh.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/hypot.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/log1py.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/asinhy.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/gatg.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/clens.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/cosh.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/clens_cmplx.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/etmerc.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/adjust_zone.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/utm.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/srat.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/gauss.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/sterea.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/stere.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/somerc.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/omerc.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/lcc.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/krovak.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/mlfn.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/e0fn.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/e1fn.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/e2fn.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/e3fn.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/gN.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/adjust_lat.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/imlfn.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/cass.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/qsfnz.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/laea.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/asinz.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/aea.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/gnom.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/iqsfnz.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/cea.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/eqc.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/poly.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/nzmg.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/mill.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/sinu.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/moll.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/eqdc.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/vandg.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/common/vincenty.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/aeqd.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/ortho.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/qsc.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/robin.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/geocent.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/tpers.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/geos.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/eqearth.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/bonne.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/projections/ob_tran.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/projs.js","../../../node_modules/.pnpm/proj4@2.20.2/node_modules/proj4/lib/index.js","../../numbers/dist/index.js","../../../node_modules/.pnpm/@turf+helpers@7.3.1/node_modules/@turf/helpers/dist/esm/index.js","../../../node_modules/.pnpm/@turf+invariant@7.3.1/node_modules/@turf/invariant/dist/esm/index.js","../../../node_modules/.pnpm/@turf+distance@7.3.1/node_modules/@turf/distance/dist/esm/index.js","../../../node_modules/.pnpm/@turf+meta@7.3.1/node_modules/@turf/meta/dist/esm/index.js","../../../node_modules/.pnpm/@turf+bbox@7.3.1/node_modules/@turf/bbox/dist/esm/index.js","../../../node_modules/.pnpm/@turf+bbox-polygon@7.3.1/node_modules/@turf/bbox-polygon/dist/esm/index.js","../../../node_modules/.pnpm/robust-predicates@3.0.2/node_modules/robust-predicates/esm/util.js","../../../node_modules/.pnpm/robust-predicates@3.0.2/node_modules/robust-predicates/esm/orient2d.js","../../../node_modules/.pnpm/point-in-polygon-hao@1.2.4/node_modules/point-in-polygon-hao/dist/esm/index.js","../../../node_modules/.pnpm/@turf+boolean-point-in-polygon@7.3.1/node_modules/@turf/boolean-point-in-polygon/dist/esm/index.js","../../../node_modules/.pnpm/sweepline-intersections@1.5.0/node_modules/sweepline-intersections/dist/sweeplineIntersections.esm.js","../../../node_modules/.pnpm/@turf+line-intersect@7.3.1/node_modules/@turf/line-intersect/dist/esm/index.js","../../../node_modules/.pnpm/quickselect@2.0.0/node_modules/quickselect/index.js","../../../node_modules/.pnpm/rbush@3.0.1/node_modules/rbush/index.js","../../../node_modules/.pnpm/@turf+geojson-rbush@7.3.1/node_modules/@turf/geojson-rbush/dist/esm/index.js","../../../node_modules/.pnpm/@turf+line-segment@7.3.1/node_modules/@turf/line-segment/dist/esm/index.js","../../../node_modules/.pnpm/@turf+nearest-point-on-line@7.3.1/node_modules/@turf/nearest-point-on-line/dist/esm/index.js","../../../node_modules/.pnpm/@turf+truncate@7.3.1/node_modules/@turf/truncate/dist/esm/index.js","../../../node_modules/.pnpm/@turf+line-split@7.3.1/node_modules/@turf/line-split/dist/esm/index.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/lodash.js","../src/proj/CoordinateSystemBounds.ts","../src/proj/CoordinateSystem.ts","../src/proj/CustomCoordinateSystem.ts","../src/proj/SwissCoordinateSystem.ts","../src/proj/LV03CoordinateSystem.ts","../src/proj/LV95CoordinateSystem.ts","../src/proj/StandardCoordinateSystem.ts","../src/proj/WebMercatorCoordinateSystem.ts","../src/proj/WGS84CoordinateSystem.ts","../src/proj/index.ts"],"sourcesContent":["export default function (defs) {\n defs('EPSG:4326', '+title=WGS 84 (long/lat) +proj=longlat +ellps=WGS84 +datum=WGS84 +units=degrees');\n defs('EPSG:4269', '+title=NAD83 (long/lat) +proj=longlat +a=6378137.0 +b=6356752.31414036 +ellps=GRS80 +datum=NAD83 +units=degrees');\n defs('EPSG:3857', '+title=WGS 84 / Pseudo-Mercator +proj=merc +a=6378137 +b=6378137 +lat_ts=0.0 +lon_0=0.0 +x_0=0.0 +y_0=0 +k=1.0 +units=m +nadgrids=@null +no_defs');\n // UTM WGS84\n for (var i = 1; i <= 60; ++i) {\n defs('EPSG:' + (32600 + i), '+proj=utm +zone=' + i + ' +datum=WGS84 +units=m');\n defs('EPSG:' + (32700 + i), '+proj=utm +zone=' + i + ' +south +datum=WGS84 +units=m');\n }\n defs('EPSG:5041', '+title=WGS 84 / UPS North (E,N) +proj=stere +lat_0=90 +lon_0=0 +k=0.994 +x_0=2000000 +y_0=2000000 +datum=WGS84 +units=m');\n defs('EPSG:5042', '+title=WGS 84 / UPS South (E,N) +proj=stere +lat_0=-90 +lon_0=0 +k=0.994 +x_0=2000000 +y_0=2000000 +datum=WGS84 +units=m');\n\n defs.WGS84 = defs['EPSG:4326'];\n defs['EPSG:3785'] = defs['EPSG:3857']; // maintain backward compat, official code is 3857\n defs.GOOGLE = defs['EPSG:3857'];\n defs['EPSG:900913'] = defs['EPSG:3857'];\n defs['EPSG:102113'] = defs['EPSG:3857'];\n}\n","export var PJD_3PARAM = 1;\nexport var PJD_7PARAM = 2;\nexport var PJD_GRIDSHIFT = 3;\nexport var PJD_WGS84 = 4; // WGS84 or equivalent\nexport var PJD_NODATUM = 5; // WGS84 or equivalent\nexport var SRS_WGS84_SEMIMAJOR = 6378137.0; // only used in grid shift transforms\nexport var SRS_WGS84_SEMIMINOR = 6356752.314; // only used in grid shift transforms\nexport var SRS_WGS84_ESQUARED = 0.0066943799901413165; // only used in grid shift transforms\nexport var SEC_TO_RAD = 4.84813681109535993589914102357e-6;\nexport var HALF_PI = Math.PI / 2;\n// ellipoid pj_set_ell.c\nexport var SIXTH = 0.1666666666666666667;\n/* 1/6 */\nexport var RA4 = 0.04722222222222222222;\n/* 17/360 */\nexport var RA6 = 0.02215608465608465608;\nexport var EPSLN = 1.0e-10;\n// you'd think you could use Number.EPSILON above but that makes\n// Mollweide get into an infinate loop.\n\nexport var D2R = 0.01745329251994329577;\nexport var R2D = 57.29577951308232088;\nexport var FORTPI = Math.PI / 4;\nexport var TWO_PI = Math.PI * 2;\n// SPI is slightly greater than Math.PI, so values that exceed the -180..180\n// degree range by a tiny amount don't get wrapped. This prevents points that\n// have drifted from their original location along the 180th meridian (due to\n// floating point error) from changing their sign.\nexport var SPI = 3.14159265359;\n","var primeMeridian = {};\n\nprimeMeridian.greenwich = 0.0; // \"0dE\",\nprimeMeridian.lisbon = -9.131906111111; // \"9d07'54.862\\\"W\",\nprimeMeridian.paris = 2.337229166667; // \"2d20'14.025\\\"E\",\nprimeMeridian.bogota = -74.080916666667; // \"74d04'51.3\\\"W\",\nprimeMeridian.madrid = -3.687938888889; // \"3d41'16.58\\\"W\",\nprimeMeridian.rome = 12.452333333333; // \"12d27'8.4\\\"E\",\nprimeMeridian.bern = 7.439583333333; // \"7d26'22.5\\\"E\",\nprimeMeridian.jakarta = 106.807719444444; // \"106d48'27.79\\\"E\",\nprimeMeridian.ferro = -17.666666666667; // \"17d40'W\",\nprimeMeridian.brussels = 4.367975; // \"4d22'4.71\\\"E\",\nprimeMeridian.stockholm = 18.058277777778; // \"18d3'29.8\\\"E\",\nprimeMeridian.athens = 23.7163375; // \"23d42'58.815\\\"E\",\nprimeMeridian.oslo = 10.722916666667; // \"10d43'22.5\\\"E\"\n\nexport default primeMeridian;\n","export default {\n mm: { to_meter: 0.001 },\n cm: { to_meter: 0.01 },\n ft: { to_meter: 0.3048 },\n 'us-ft': { to_meter: 1200 / 3937 },\n fath: { to_meter: 1.8288 },\n kmi: { to_meter: 1852 },\n 'us-ch': { to_meter: 20.1168402336805 },\n 'us-mi': { to_meter: 1609.34721869444 },\n km: { to_meter: 1000 },\n 'ind-ft': { to_meter: 0.30479841 },\n 'ind-yd': { to_meter: 0.91439523 },\n mi: { to_meter: 1609.344 },\n yd: { to_meter: 0.9144 },\n ch: { to_meter: 20.1168 },\n link: { to_meter: 0.201168 },\n dm: { to_meter: 0.1 },\n in: { to_meter: 0.0254 },\n 'ind-ch': { to_meter: 20.11669506 },\n 'us-in': { to_meter: 0.025400050800101 },\n 'us-yd': { to_meter: 0.914401828803658 }\n};\n","var ignoredChar = /[\\s_\\-\\/\\(\\)]/g;\nexport default function match(obj, key) {\n if (obj[key]) {\n return obj[key];\n }\n var keys = Object.keys(obj);\n var lkey = key.toLowerCase().replace(ignoredChar, '');\n var i = -1;\n var testkey, processedKey;\n while (++i < keys.length) {\n testkey = keys[i];\n processedKey = testkey.toLowerCase().replace(ignoredChar, '');\n if (processedKey === lkey) {\n return obj[testkey];\n }\n }\n}\n","import { D2R } from './constants/values';\nimport PrimeMeridian from './constants/PrimeMeridian';\nimport units from './constants/units';\nimport match from './match';\n\n/**\n * @param {string} defData\n * @returns {import('./defs').ProjectionDefinition}\n */\nexport default function (defData) {\n /** @type {import('./defs').ProjectionDefinition} */\n var self = {};\n var paramObj = defData.split('+').map(function (v) {\n return v.trim();\n }).filter(function (a) {\n return a;\n }).reduce(function (p, a) {\n /** @type {Array<?>} */\n var split = a.split('=');\n split.push(true);\n p[split[0].toLowerCase()] = split[1];\n return p;\n }, {});\n var paramName, paramVal, paramOutname;\n var params = {\n proj: 'projName',\n datum: 'datumCode',\n rf: function (v) {\n self.rf = parseFloat(v);\n },\n lat_0: function (v) {\n self.lat0 = v * D2R;\n },\n lat_1: function (v) {\n self.lat1 = v * D2R;\n },\n lat_2: function (v) {\n self.lat2 = v * D2R;\n },\n lat_ts: function (v) {\n self.lat_ts = v * D2R;\n },\n lon_0: function (v) {\n self.long0 = v * D2R;\n },\n lon_1: function (v) {\n self.long1 = v * D2R;\n },\n lon_2: function (v) {\n self.long2 = v * D2R;\n },\n alpha: function (v) {\n self.alpha = parseFloat(v) * D2R;\n },\n gamma: function (v) {\n self.rectified_grid_angle = parseFloat(v) * D2R;\n },\n lonc: function (v) {\n self.longc = v * D2R;\n },\n x_0: function (v) {\n self.x0 = parseFloat(v);\n },\n y_0: function (v) {\n self.y0 = parseFloat(v);\n },\n k_0: function (v) {\n self.k0 = parseFloat(v);\n },\n k: function (v) {\n self.k0 = parseFloat(v);\n },\n a: function (v) {\n self.a = parseFloat(v);\n },\n b: function (v) {\n self.b = parseFloat(v);\n },\n r: function (v) {\n self.a = self.b = parseFloat(v);\n },\n r_a: function () {\n self.R_A = true;\n },\n zone: function (v) {\n self.zone = parseInt(v, 10);\n },\n south: function () {\n self.utmSouth = true;\n },\n towgs84: function (v) {\n self.datum_params = v.split(',').map(function (a) {\n return parseFloat(a);\n });\n },\n to_meter: function (v) {\n self.to_meter = parseFloat(v);\n },\n units: function (v) {\n self.units = v;\n var unit = match(units, v);\n if (unit) {\n self.to_meter = unit.to_meter;\n }\n },\n from_greenwich: function (v) {\n self.from_greenwich = v * D2R;\n },\n pm: function (v) {\n var pm = match(PrimeMeridian, v);\n self.from_greenwich = (pm ? pm : parseFloat(v)) * D2R;\n },\n nadgrids: function (v) {\n if (v === '@null') {\n self.datumCode = 'none';\n } else {\n self.nadgrids = v;\n }\n },\n axis: function (v) {\n var legalAxis = 'ewnsud';\n if (v.length === 3 && legalAxis.indexOf(v.substr(0, 1)) !== -1 && legalAxis.indexOf(v.substr(1, 1)) !== -1 && legalAxis.indexOf(v.substr(2, 1)) !== -1) {\n self.axis = v;\n }\n },\n approx: function () {\n self.approx = true;\n },\n over: function () {\n self.over = true;\n }\n };\n for (paramName in paramObj) {\n paramVal = paramObj[paramName];\n if (paramName in params) {\n paramOutname = params[paramName];\n if (typeof paramOutname === 'function') {\n paramOutname(paramVal);\n } else {\n self[paramOutname] = paramVal;\n }\n } else {\n self[paramName] = paramVal;\n }\n }\n if (typeof self.datumCode === 'string' && self.datumCode !== 'WGS84') {\n self.datumCode = self.datumCode.toLowerCase();\n }\n self['projStr'] = defData;\n return self;\n}\n","class PROJJSONBuilderBase {\n static getId(node) {\n const idNode = node.find((child) => Array.isArray(child) && child[0] === 'ID');\n if (idNode && idNode.length >= 3) {\n return {\n authority: idNode[1],\n code: parseInt(idNode[2], 10),\n };\n }\n return null;\n }\n\n static convertUnit(node, type = 'unit') {\n if (!node || node.length < 3) {\n return { type, name: 'unknown', conversion_factor: null };\n }\n\n const name = node[1];\n const conversionFactor = parseFloat(node[2]) || null;\n\n const idNode = node.find((child) => Array.isArray(child) && child[0] === 'ID');\n const id = idNode\n ? {\n authority: idNode[1],\n code: parseInt(idNode[2], 10),\n }\n : null;\n\n return {\n type,\n name,\n conversion_factor: conversionFactor,\n id,\n };\n }\n\n static convertAxis(node) {\n const name = node[1] || 'Unknown';\n\n // Determine the direction\n let direction;\n const abbreviationMatch = name.match(/^\\((.)\\)$/); // Match abbreviations like \"(E)\" or \"(N)\"\n if (abbreviationMatch) {\n // Use the abbreviation to determine the direction\n const abbreviation = abbreviationMatch[1].toUpperCase();\n if (abbreviation === 'E') direction = 'east';\n else if (abbreviation === 'N') direction = 'north';\n else if (abbreviation === 'U') direction = 'up';\n else throw new Error(`Unknown axis abbreviation: ${abbreviation}`);\n } else {\n // Use the explicit direction provided in the AXIS node\n direction = node[2] ? node[2].toLowerCase() : 'unknown';\n }\n\n const orderNode = node.find((child) => Array.isArray(child) && child[0] === 'ORDER');\n const order = orderNode ? parseInt(orderNode[1], 10) : null;\n\n const unitNode = node.find(\n (child) =>\n Array.isArray(child) &&\n (child[0] === 'LENGTHUNIT' || child[0] === 'ANGLEUNIT' || child[0] === 'SCALEUNIT')\n );\n const unit = this.convertUnit(unitNode);\n\n return {\n name,\n direction, // Use the valid PROJJSON direction value\n unit,\n order,\n };\n }\n\n static extractAxes(node) {\n return node\n .filter((child) => Array.isArray(child) && child[0] === 'AXIS')\n .map((axis) => this.convertAxis(axis))\n .sort((a, b) => (a.order || 0) - (b.order || 0)); // Sort by the \"order\" property\n }\n\n static convert(node, result = {}) {\n\n switch (node[0]) {\n case 'PROJCRS':\n result.type = 'ProjectedCRS';\n result.name = node[1];\n result.base_crs = node.find((child) => Array.isArray(child) && child[0] === 'BASEGEOGCRS')\n ? this.convert(node.find((child) => Array.isArray(child) && child[0] === 'BASEGEOGCRS'))\n : null;\n result.conversion = node.find((child) => Array.isArray(child) && child[0] === 'CONVERSION')\n ? this.convert(node.find((child) => Array.isArray(child) && child[0] === 'CONVERSION'))\n : null;\n\n const csNode = node.find((child) => Array.isArray(child) && child[0] === 'CS');\n if (csNode) {\n result.coordinate_system = {\n type: csNode[1],\n axis: this.extractAxes(node),\n };\n }\n\n const lengthUnitNode = node.find((child) => Array.isArray(child) && child[0] === 'LENGTHUNIT');\n if (lengthUnitNode) {\n const unit = this.convertUnit(lengthUnitNode);\n result.coordinate_system.unit = unit; // Add unit to coordinate_system\n }\n\n result.id = this.getId(node);\n break;\n\n case 'BASEGEOGCRS':\n case 'GEOGCRS':\n result.type = 'GeographicCRS';\n result.name = node[1];\n \n // Handle DATUM or ENSEMBLE\n const datumOrEnsembleNode = node.find(\n (child) => Array.isArray(child) && (child[0] === 'DATUM' || child[0] === 'ENSEMBLE')\n );\n if (datumOrEnsembleNode) {\n const datumOrEnsemble = this.convert(datumOrEnsembleNode);\n if (datumOrEnsembleNode[0] === 'ENSEMBLE') {\n result.datum_ensemble = datumOrEnsemble;\n } else {\n result.datum = datumOrEnsemble;\n }\n const primem = node.find((child) => Array.isArray(child) && child[0] === 'PRIMEM');\n if (primem && primem[1] !== 'Greenwich') {\n datumOrEnsemble.prime_meridian = {\n name: primem[1],\n longitude: parseFloat(primem[2]),\n }\n }\n }\n \n result.coordinate_system = {\n type: 'ellipsoidal',\n axis: this.extractAxes(node),\n };\n \n result.id = this.getId(node);\n break;\n\n case 'DATUM':\n result.type = 'GeodeticReferenceFrame';\n result.name = node[1];\n result.ellipsoid = node.find((child) => Array.isArray(child) && child[0] === 'ELLIPSOID')\n ? this.convert(node.find((child) => Array.isArray(child) && child[0] === 'ELLIPSOID'))\n : null;\n break;\n \n case 'ENSEMBLE':\n result.type = 'DatumEnsemble';\n result.name = node[1];\n \n // Extract ensemble members\n result.members = node\n .filter((child) => Array.isArray(child) && child[0] === 'MEMBER')\n .map((member) => ({\n type: 'DatumEnsembleMember',\n name: member[1],\n id: this.getId(member), // Extract ID as { authority, code }\n }));\n \n // Extract accuracy\n const accuracyNode = node.find((child) => Array.isArray(child) && child[0] === 'ENSEMBLEACCURACY');\n if (accuracyNode) {\n result.accuracy = parseFloat(accuracyNode[1]);\n }\n \n // Extract ellipsoid\n const ellipsoidNode = node.find((child) => Array.isArray(child) && child[0] === 'ELLIPSOID');\n if (ellipsoidNode) {\n result.ellipsoid = this.convert(ellipsoidNode); // Convert the ellipsoid node\n }\n \n // Extract identifier for the ensemble\n result.id = this.getId(node);\n break;\n\n case 'ELLIPSOID':\n result.type = 'Ellipsoid';\n result.name = node[1];\n result.semi_major_axis = parseFloat(node[2]);\n result.inverse_flattening = parseFloat(node[3]);\n const units = node.find((child) => Array.isArray(child) && child[0] === 'LENGTHUNIT')\n ? this.convert(node.find((child) => Array.isArray(child) && child[0] === 'LENGTHUNIT'), result)\n : null;\n break;\n\n case 'CONVERSION':\n result.type = 'Conversion';\n result.name = node[1];\n result.method = node.find((child) => Array.isArray(child) && child[0] === 'METHOD')\n ? this.convert(node.find((child) => Array.isArray(child) && child[0] === 'METHOD'))\n : null;\n result.parameters = node\n .filter((child) => Array.isArray(child) && child[0] === 'PARAMETER')\n .map((param) => this.convert(param));\n break;\n\n case 'METHOD':\n result.type = 'Method';\n result.name = node[1];\n result.id = this.getId(node);\n break;\n\n case 'PARAMETER':\n result.type = 'Parameter';\n result.name = node[1];\n result.value = parseFloat(node[2]);\n result.unit = this.convertUnit(\n node.find(\n (child) =>\n Array.isArray(child) &&\n (child[0] === 'LENGTHUNIT' || child[0] === 'ANGLEUNIT' || child[0] === 'SCALEUNIT')\n )\n );\n result.id = this.getId(node);\n break;\n\n case 'BOUNDCRS':\n result.type = 'BoundCRS';\n\n // Process SOURCECRS\n const sourceCrsNode = node.find((child) => Array.isArray(child) && child[0] === 'SOURCECRS');\n if (sourceCrsNode) {\n const sourceCrsContent = sourceCrsNode.find((child) => Array.isArray(child));\n result.source_crs = sourceCrsContent ? this.convert(sourceCrsContent) : null;\n }\n\n // Process TARGETCRS\n const targetCrsNode = node.find((child) => Array.isArray(child) && child[0] === 'TARGETCRS');\n if (targetCrsNode) {\n const targetCrsContent = targetCrsNode.find((child) => Array.isArray(child));\n result.target_crs = targetCrsContent ? this.convert(targetCrsContent) : null;\n }\n\n // Process ABRIDGEDTRANSFORMATION\n const transformationNode = node.find((child) => Array.isArray(child) && child[0] === 'ABRIDGEDTRANSFORMATION');\n if (transformationNode) {\n result.transformation = this.convert(transformationNode);\n } else {\n result.transformation = null;\n }\n break;\n\n case 'ABRIDGEDTRANSFORMATION':\n result.type = 'Transformation';\n result.name = node[1];\n result.method = node.find((child) => Array.isArray(child) && child[0] === 'METHOD')\n ? this.convert(node.find((child) => Array.isArray(child) && child[0] === 'METHOD'))\n : null;\n\n result.parameters = node\n .filter((child) => Array.isArray(child) && (child[0] === 'PARAMETER' || child[0] === 'PARAMETERFILE'))\n .map((param) => {\n if (param[0] === 'PARAMETER') {\n return this.convert(param);\n } else if (param[0] === 'PARAMETERFILE') {\n return {\n name: param[1],\n value: param[2],\n id: {\n 'authority': 'EPSG',\n 'code': 8656\n }\n };\n }\n });\n\n // Adjust the Scale difference parameter if present\n if (result.parameters.length === 7) {\n const scaleDifference = result.parameters[6];\n if (scaleDifference.name === 'Scale difference') {\n scaleDifference.value = Math.round((scaleDifference.value - 1) * 1e12) / 1e6;\n }\n }\n\n result.id = this.getId(node);\n break;\n \n case 'AXIS':\n if (!result.coordinate_system) {\n result.coordinate_system = { type: 'unspecified', axis: [] };\n }\n result.coordinate_system.axis.push(this.convertAxis(node));\n break;\n \n case 'LENGTHUNIT':\n const unit = this.convertUnit(node, 'LinearUnit');\n if (result.coordinate_system && result.coordinate_system.axis) {\n result.coordinate_system.axis.forEach((axis) => {\n if (!axis.unit) {\n axis.unit = unit;\n }\n });\n }\n if (unit.conversion_factor && unit.conversion_factor !== 1) {\n if (result.semi_major_axis) {\n result.semi_major_axis = {\n value: result.semi_major_axis,\n unit,\n }\n }\n }\n break;\n\n default:\n result.keyword = node[0];\n break;\n }\n\n return result;\n }\n}\n\nexport default PROJJSONBuilderBase;","import PROJJSONBuilderBase from './PROJJSONBuilderBase.js';\n\nclass PROJJSONBuilder2015 extends PROJJSONBuilderBase {\n static convert(node, result = {}) {\n super.convert(node, result);\n\n // Skip `CS` and `USAGE` nodes for WKT2-2015\n if (result.coordinate_system && result.coordinate_system.subtype === 'Cartesian') {\n delete result.coordinate_system;\n }\n if (result.usage) {\n delete result.usage;\n }\n\n return result;\n }\n}\n\nexport default PROJJSONBuilder2015;","import PROJJSONBuilderBase from './PROJJSONBuilderBase.js';\n\nclass PROJJSONBuilder2019 extends PROJJSONBuilderBase {\n static convert(node, result = {}) {\n super.convert(node, result);\n\n // Handle `CS` node for WKT2-2019\n const csNode = node.find((child) => Array.isArray(child) && child[0] === 'CS');\n if (csNode) {\n result.coordinate_system = {\n subtype: csNode[1],\n axis: this.extractAxes(node),\n };\n }\n\n // Handle `USAGE` node for WKT2-2019\n const usageNode = node.find((child) => Array.isArray(child) && child[0] === 'USAGE');\n if (usageNode) {\n const scope = usageNode.find((child) => Array.isArray(child) && child[0] === 'SCOPE');\n const area = usageNode.find((child) => Array.isArray(child) && child[0] === 'AREA');\n const bbox = usageNode.find((child) => Array.isArray(child) && child[0] === 'BBOX');\n result.usage = {};\n if (scope) {\n result.usage.scope = scope[1];\n }\n if (area) {\n result.usage.area = area[1];\n }\n if (bbox) {\n result.usage.bbox = bbox.slice(1);\n }\n }\n\n return result;\n }\n}\n\nexport default PROJJSONBuilder2019;","import PROJJSONBuilder2015 from './PROJJSONBuilder2015.js';\nimport PROJJSONBuilder2019 from './PROJJSONBuilder2019.js';\n\n/**\n * Detects the WKT2 version based on the structure of the WKT.\n * @param {Array} root The root WKT array node.\n * @returns {string} The detected version (\"2015\" or \"2019\").\n */\nfunction detectWKT2Version(root) {\n // Check for WKT2-2019-specific nodes\n if (root.find((child) => Array.isArray(child) && child[0] === 'USAGE')) {\n return '2019'; // `USAGE` is specific to WKT2-2019\n }\n\n // Check for WKT2-2015-specific nodes\n if (root.find((child) => Array.isArray(child) && child[0] === 'CS')) {\n return '2015'; // `CS` is valid in both, but default to 2015 unless `USAGE` is present\n }\n\n if (root[0] === 'BOUNDCRS' || root[0] === 'PROJCRS' || root[0] === 'GEOGCRS') {\n return '2015'; // These are valid in both, but default to 2015\n }\n\n // Default to WKT2-2015 if no specific indicators are found\n return '2015';\n}\n\n/**\n * Builds a PROJJSON object from a WKT array structure.\n * @param {Array} root The root WKT array node.\n * @returns {Object} The PROJJSON object.\n */\nexport function buildPROJJSON(root) {\n const version = detectWKT2Version(root);\n const builder = version === '2019' ? PROJJSONBuilder2019 : PROJJSONBuilder2015;\n return builder.convert(root);\n}\n","/**\n * Detects whether the WKT string is WKT1 or WKT2.\n * @param {string} wkt The WKT string.\n * @returns {string} The detected version (\"WKT1\" or \"WKT2\").\n */\nexport function detectWKTVersion(wkt) {\n // Normalize the WKT string for easier keyword matching\n const normalizedWKT = wkt.toUpperCase();\n\n // Check for WKT2-specific keywords\n if (\n normalizedWKT.includes('PROJCRS') ||\n normalizedWKT.includes('GEOGCRS') ||\n normalizedWKT.includes('BOUNDCRS') ||\n normalizedWKT.includes('VERTCRS') ||\n normalizedWKT.includes('LENGTHUNIT') ||\n normalizedWKT.includes('ANGLEUNIT') ||\n normalizedWKT.includes('SCALEUNIT')\n ) {\n return 'WKT2';\n }\n\n // Check for WKT1-specific keywords\n if (\n normalizedWKT.includes('PROJCS') ||\n normalizedWKT.includes('GEOGCS') ||\n normalizedWKT.includes('LOCAL_CS') ||\n normalizedWKT.includes('VERT_CS') ||\n normalizedWKT.includes('UNIT')\n ) {\n return 'WKT1';\n }\n\n // Default to WKT1 if no specific indicators are found\n return 'WKT1';\n}","export default parseString;\n\nvar NEUTRAL = 1;\nvar KEYWORD = 2;\nvar NUMBER = 3;\nvar QUOTED = 4;\nvar AFTERQUOTE = 5;\nvar ENDED = -1;\nvar whitespace = /\\s/;\nvar latin = /[A-Za-z]/;\nvar keyword = /[A-Za-z84_]/;\nvar endThings = /[,\\]]/;\nvar digets = /[\\d\\.E\\-\\+]/;\n// const ignoredChar = /[\\s_\\-\\/\\(\\)]/g;\nfunction Parser(text) {\n if (typeof text !== 'string') {\n throw new Error('not a string');\n }\n this.text = text.trim();\n this.level = 0;\n this.place = 0;\n this.root = null;\n this.stack = [];\n this.currentObject = null;\n this.state = NEUTRAL;\n}\nParser.prototype.readCharicter = function() {\n var char = this.text[this.place++];\n if (this.state !== QUOTED) {\n while (whitespace.test(char)) {\n if (this.place >= this.text.length) {\n return;\n }\n char = this.text[this.place++];\n }\n }\n switch (this.state) {\n case NEUTRAL:\n return this.neutral(char);\n case KEYWORD:\n return this.keyword(char)\n case QUOTED:\n return this.quoted(char);\n case AFTERQUOTE:\n return this.afterquote(char);\n case NUMBER:\n return this.number(char);\n case ENDED:\n return;\n }\n};\nParser.prototype.afterquote = function(char) {\n if (char === '\"') {\n this.word += '\"';\n this.state = QUOTED;\n return;\n }\n if (endThings.test(char)) {\n this.word = this.word.trim();\n this.afterItem(char);\n return;\n }\n throw new Error('havn\\'t handled \"' +char + '\" in afterquote yet, index ' + this.place);\n};\nParser.prototype.afterItem = function(char) {\n if (char === ',') {\n if (this.word !== null) {\n this.currentObject.push(this.word);\n }\n this.word = null;\n this.state = NEUTRAL;\n return;\n }\n if (char === ']') {\n this.level--;\n if (this.word !== null) {\n this.currentObject.push(this.word);\n this.word = null;\n }\n this.state = NEUTRAL;\n this.currentObject = this.stack.pop();\n if (!this.currentObject) {\n this.state = ENDED;\n }\n\n return;\n }\n};\nParser.prototype.number = function(char) {\n if (digets.test(char)) {\n this.word += char;\n return;\n }\n if (endThings.test(char)) {\n this.word = parseFloat(this.word);\n this.afterItem(char);\n return;\n }\n throw new Error('havn\\'t handled \"' +char + '\" in number yet, index ' + this.place);\n};\nParser.prototype.quoted = function(char) {\n if (char === '\"') {\n this.state = AFTERQUOTE;\n return;\n }\n this.word += char;\n return;\n};\nParser.prototype.keyword = function(char) {\n if (keyword.test(char)) {\n this.word += char;\n return;\n }\n if (char === '[') {\n var newObjects = [];\n newObjects.push(this.word);\n this.level++;\n if (this.root === null) {\n this.root = newObjects;\n } else {\n this.currentObject.push(newObjects);\n }\n this.stack.push(this.currentObject);\n this.currentObject = newObjects;\n this.state = NEUTRAL;\n return;\n }\n if (endThings.test(char)) {\n this.afterItem(char);\n return;\n }\n throw new Error('havn\\'t handled \"' +char + '\" in keyword yet, index ' + this.place);\n};\nParser.prototype.neutral = function(char) {\n if (latin.test(char)) {\n this.word = char;\n this.state = KEYWORD;\n return;\n }\n if (char === '\"') {\n this.word = '';\n this.state = QUOTED;\n return;\n }\n if (digets.test(char)) {\n this.word = char;\n this.state = NUMBER;\n return;\n }\n if (endThings.test(char)) {\n this.afterItem(char);\n return;\n }\n throw new Error('havn\\'t handled \"' +char + '\" in neutral yet, index ' + this.place);\n};\nParser.prototype.output = function() {\n while (this.place < this.text.length) {\n this.readCharicter();\n }\n if (this.state === ENDED) {\n return this.root;\n }\n throw new Error('unable to parse string \"' +this.text + '\". State is ' + this.state);\n};\n\nfunction parseString(txt) {\n var parser = new Parser(txt);\n return parser.output();\n}\n","\n\nfunction mapit(obj, key, value) {\n if (Array.isArray(key)) {\n value.unshift(key);\n key = null;\n }\n var thing = key ? {} : obj;\n\n var out = value.reduce(function(newObj, item) {\n sExpr(item, newObj);\n return newObj\n }, thing);\n if (key) {\n obj[key] = out;\n }\n}\n\nexport function sExpr(v, obj) {\n if (!Array.isArray(v)) {\n obj[v] = true;\n return;\n }\n var key = v.shift();\n if (key === 'PARAMETER') {\n key = v.shift();\n }\n if (v.length === 1) {\n if (Array.isArray(v[0])) {\n obj[key] = {};\n sExpr(v[0], obj[key]);\n return;\n }\n obj[key] = v[0];\n return;\n }\n if (!v.length) {\n obj[key] = true;\n return;\n }\n if (key === 'TOWGS84') {\n obj[key] = v;\n return;\n }\n if (key === 'AXIS') {\n if (!(key in obj)) {\n obj[key] = [];\n }\n obj[key].push(v);\n return;\n }\n if (!Array.isArray(key)) {\n obj[key] = {};\n }\n\n var i;\n switch (key) {\n case 'UNIT':\n case 'PRIMEM':\n case 'VERT_DATUM':\n obj[key] = {\n name: v[0].toLowerCase(),\n convert: v[1]\n };\n if (v.length === 3) {\n sExpr(v[2], obj[key]);\n }\n return;\n case 'SPHEROID':\n case 'ELLIPSOID':\n obj[key] = {\n name: v[0],\n a: v[1],\n rf: v[2]\n };\n if (v.length === 4) {\n sExpr(v[3], obj[key]);\n }\n return;\n case 'EDATUM':\n case 'ENGINEERINGDATUM':\n case 'LOCAL_DATUM':\n case 'DATUM':\n case 'VERT_CS':\n case 'VERTCRS':\n case 'VERTICALCRS':\n v[0] = ['name', v[0]];\n mapit(obj, key, v);\n return;\n case 'COMPD_CS':\n case 'COMPOUNDCRS':\n case 'FITTED_CS':\n // the followings are the crs defined in\n // https://github.com/proj4js/proj4js/blob/1da4ed0b865d0fcb51c136090569210cdcc9019e/lib/parseCode.js#L11\n case 'PROJECTEDCRS':\n case 'PROJCRS':\n case 'GEOGCS':\n case 'GEOCCS':\n case 'PROJCS':\n case 'LOCAL_CS':\n case 'GEODCRS':\n case 'GEODETICCRS':\n case 'GEODETICDATUM':\n case 'ENGCRS':\n case 'ENGINEERINGCRS':\n v[0] = ['name', v[0]];\n mapit(obj, key, v);\n obj[key].type = key;\n return;\n default:\n i = -1;\n while (++i < v.length) {\n if (!Array.isArray(v[i])) {\n return sExpr(v, obj[key]);\n }\n }\n return mapit(obj, key, v);\n }\n}\n","var D2R = 0.01745329251994329577;\n\nexport function d2r(input) {\n return input * D2R;\n}\n\nexport function applyProjectionDefaults(wkt) {\n // Normalize projName for WKT2 compatibility\n const normalizedProjName = (wkt.projName || '').toLowerCase().replace(/_/g, ' ');\n\n if (!wkt.long0 && wkt.longc && (normalizedProjName === 'albers conic equal area' || normalizedProjName === 'lambert azimuthal equal area')) {\n wkt.long0 = wkt.longc;\n }\n if (!wkt.lat_ts && wkt.lat1 && (normalizedProjName === 'stereographic south pole' || normalizedProjName === 'polar stereographic (variant b)')) {\n wkt.lat0 = d2r(wkt.lat1 > 0 ? 90 : -90);\n wkt.lat_ts = wkt.lat1;\n delete wkt.lat1;\n } else if (!wkt.lat_ts && wkt.lat0 && (normalizedProjName === 'polar stereographic' || normalizedProjName === 'polar stereographic (variant a)')) {\n wkt.lat_ts = wkt.lat0;\n wkt.lat0 = d2r(wkt.lat0 > 0 ? 90 : -90);\n delete wkt.lat1;\n }\n}","import { applyProjectionDefaults } from './util.js';\n\n// Helper function to process units and to_meter\nfunction processUnit(unit) {\n let result = { units: null, to_meter: undefined };\n\n if (typeof unit === 'string') {\n result.units = unit.toLowerCase();\n if (result.units === 'metre') {\n result.units = 'meter'; // Normalize 'metre' to 'meter'\n }\n if (result.units === 'meter') {\n result.to_meter = 1; // Only set to_meter if units are 'meter'\n }\n } else if (unit && unit.name) {\n result.units = unit.name.toLowerCase();\n if (result.units === 'metre') {\n result.units = 'meter'; // Normalize 'metre' to 'meter'\n }\n result.to_meter = unit.conversion_factor;\n }\n\n return result;\n}\n\nfunction toValue(valueOrObject) {\n if (typeof valueOrObject === 'object') {\n return valueOrObject.value * valueOrObject.unit.conversion_factor;\n }\n return valueOrObject;\n}\n\nfunction calculateEllipsoid(value, result) {\n if (value.ellipsoid.radius) {\n result.a = value.ellipsoid.radius;\n result.rf = 0;\n } else {\n result.a = toValue(value.ellipsoid.semi_major_axis);\n if (value.ellipsoid.inverse_flattening !== undefined) {\n result.rf = value.ellipsoid.inverse_flattening;\n } else if (value.ellipsoid.semi_major_axis !== undefined && value.ellipsoid.semi_minor_axis !== undefined) {\n result.rf = result.a / (result.a - toValue(value.ellipsoid.semi_minor_axis));\n }\n }\n}\n\nexport function transformPROJJSON(projjson, result = {}) {\n if (!projjson || typeof projjson !== 'object') {\n return projjson; // Return primitive values as-is\n }\n\n if (projjson.type === 'BoundCRS') {\n transformPROJJSON(projjson.source_crs, result);\n\n if (projjson.transformation) {\n if (projjson.transformation.method && projjson.transformation.method.name === 'NTv2') {\n // Set nadgrids to the filename from the parameterfile\n result.nadgrids = projjson.transformation.parameters[0].value;\n } else {\n // Populate datum_params if no parameterfile is found\n result.datum_params = projjson.transformation.parameters.map((param) => param.value);\n }\n }\n return result; // Return early for BoundCRS\n }\n\n // Handle specific keys in PROJJSON\n Object.keys(projjson).forEach((key) => {\n const value = projjson[key];\n if (value === null) {\n return;\n }\n\n switch (key) {\n case 'name':\n if (result.srsCode) {\n break;\n }\n result.name = value;\n result.srsCode = value; // Map `name` to `srsCode`\n break;\n\n case 'type':\n if (value === 'GeographicCRS') {\n result.projName = 'longlat';\n } else if (value === 'ProjectedCRS' && projjson.conversion && projjson.conversion.method) {\n result.projName = projjson.conversion.method.name; // Retain original capitalization\n }\n break;\n\n case 'datum':\n case 'datum_ensemble': // Handle both datum and ensemble\n if (value.ellipsoid) {\n // Extract ellipsoid properties\n result.ellps = value.ellipsoid.name;\n calculateEllipsoid(value, result);\n }\n if (value.prime_meridian) {\n result.from_greenwich = value.prime_meridian.longitude * Math.PI / 180; // Convert to radians\n }\n break;\n\n case 'ellipsoid':\n result.ellps = value.name;\n calculateEllipsoid(value, result);\n break;\n\n case 'prime_meridian':\n result.long0 = (value.longitude || 0) * Math.PI / 180; // Convert to radians\n break;\n\n case 'coordinate_system':\n if (value.axis) {\n result.axis = value.axis\n .map((axis) => {\n const direction = axis.direction;\n if (direction === 'east') return 'e';\n if (direction === 'north') return 'n';\n if (direction === 'west') return 'w';\n if (direction === 'south') return 's';\n throw new Error(`Unknown axis direction: ${direction}`);\n })\n .join('') + 'u'; // Combine into a single string (e.g., \"enu\")\n\n if (value.unit) {\n const { units, to_meter } = processUnit(value.unit);\n result.units = units;\n result.to_meter = to_meter;\n } else if (value.axis[0] && value.axis[0].unit) {\n const { units, to_meter } = processUnit(value.axis[0].unit);\n result.units = units;\n result.to_meter = to_meter;\n }\n }\n break;\n \n case 'id':\n if (value.authority && value.code) {\n result.title = value.authority + ':' + value.code;\n }\n break;\n\n case 'conversion':\n if (value.method && value.method.name) {\n result.projName = value.method.name; // Retain original capitalization\n }\n if (value.parameters) {\n value.parameters.forEach((param) => {\n const paramName = param.name.toLowerCase().replace(/\\s+/g, '_');\n const paramValue = param.value;\n if (param.unit && param.unit.conversion_factor) {\n result[paramName] = paramValue * param.unit.conversion_factor; // Convert to radians or meters\n } else if (param.unit === 'degree') {\n result[paramName] = paramValue * Math.PI / 180; // Convert to radians\n } else {\n result[paramName] = paramValue;\n }\n });\n }\n break;\n\n case 'unit':\n if (value.name) {\n result.units = value.name.toLowerCase();\n if (result.units === 'metre') {\n result.units = 'meter';\n }\n }\n if (value.conversion_factor) {\n result.to_meter = value.conversion_factor;\n }\n break;\n\n case 'base_crs':\n transformPROJJSON(value, result); // Pass `result` directly\n result.datumCode = value.id ? value.id.authority + '_' + value.id.code : value.name; // Set datumCode\n break;\n\n default:\n // Ignore irrelevant or unneeded properties\n break;\n }\n });\n\n // Additional calculated properties\n if (result.latitude_of_false_origin !== undefined) {\n result.lat0 = result.latitude_of_false_origin; // Already in radians\n }\n if (result.longitude_of_false_origin !== undefined) {\n result.long0 = result.longitude_of_false_origin;\n }\n if (result.latitude_of_standard_parallel !== undefined) {\n result.lat0 = result.latitude_of_standard_parallel;\n result.lat1 = result.latitude_of_standard_parallel;\n }\n if (result.latitude_of_1st_standard_parallel !== undefined) {\n result.lat1 = result.latitude_of_1st_standard_parallel;\n }\n if (result.latitude_of_2nd_standard_parallel !== undefined) {\n result.lat2 = result.latitude_of_2nd_standard_parallel; \n }\n if (result.latitude_of_projection_centre !== undefined) {\n result.lat0 = result.latitude_of_projection_centre;\n }\n if (result.longitude_of_projection_centre !== undefined) {\n result.longc = result.longitude_of_projection_centre;\n }\n if (result.easting_at_false_origin !== undefined) {\n result.x0 = result.easting_at_false_origin;\n }\n if (result.northing_at_false_origin !== undefined) {\n result.y0 = result.northing_at_false_origin;\n }\n if (result.latitude_of_natural_origin !== undefined) {\n result.lat0 = result.latitude_of_natural_origin;\n }\n if (result.longitude_of_natural_origin !== undefined) {\n result.long0 = result.longitude_of_natural_origin;\n }\n if (result.longitude_of_origin !== undefined) {\n result.long0 = result.longitude_of_origin;\n }\n if (result.false_easting !== undefined) {\n result.x0 = result.false_easting;\n }\n if (result.easting_at_projection_centre) {\n result.x0 = result.easting_at_projection_centre;\n }\n if (result.false_northing !== undefined) {\n result.y0 = result.false_northing;\n }\n if (result.northing_at_projection_centre) {\n result.y0 = result.northing_at_projection_centre;\n }\n if (result.standard_parallel_1 !== undefined) {\n result.lat1 = result.standard_parallel_1;\n }\n if (result.standard_parallel_2 !== undefined) {\n result.lat2 = result.standard_parallel_2;\n }\n if (result.scale_factor_at_natural_origin !== undefined) {\n result.k0 = result.scale_factor_at_natural_origin;\n }\n if (result.scale_factor_at_projection_centre !== undefined) {\n result.k0 = result.scale_factor_at_projection_centre;\n }\n if (result.scale_factor_on_pseudo_standard_parallel !== undefined) { \n result.k0 = result.scale_factor_on_pseudo_standard_parallel;\n }\n if (result.azimuth !== undefined) {\n result.alpha = result.azimuth;\n }\n if (result.azimuth_at_projection_centre !== undefined) {\n result.alpha = result.azimuth_at_projection_centre;\n }\n if (result.angle_from_rectified_to_skew_grid) {\n result.rectified_grid_angle = result.angle_from_rectified_to_skew_grid;\n }\n\n // Apply projection defaults\n applyProjectionDefaults(result);\n\n return result;\n}","import { buildPROJJSON } from './buildPROJJSON.js';\nimport { detectWKTVersion } from './detectWKTVersion.js';\nimport parser from './parser.js';\nimport {sExpr} from './process.js';\nimport { transformPROJJSON } from './transformPROJJSON.js';\nimport { applyProjectionDefaults, d2r } from './util.js';\n\nvar knownTypes = ['PROJECTEDCRS', 'PROJCRS', 'GEOGCS', 'GEOCCS', 'PROJCS', 'LOCAL_CS', 'GEODCRS',\n 'GEODETICCRS', 'GEODETICDATUM', 'ENGCRS', 'ENGINEERINGCRS'];\n\nfunction rename(obj, params) {\n var outName = params[0];\n var inName = params[1];\n if (!(outName in obj) && (inName in obj)) {\n obj[outName] = obj[inName];\n if (params.length === 3) {\n obj[outName] = params[2](obj[outName]);\n }\n }\n}\n\nfunction cleanWKT(wkt) {\n var keys = Object.keys(wkt);\n for (var i = 0, ii = keys.length; i <ii; ++i) {\n var key = keys[i];\n // the followings are the crs defined in\n // https://github.com/proj4js/proj4js/blob/1da4ed0b865d0fcb51c136090569210cdcc9019e/lib/parseCode.js#L11\n if (knownTypes.indexOf(key) !== -1) {\n setPropertiesFromWkt(wkt[key]);\n }\n if (typeof wkt[key] === 'object') {\n cleanWKT(wkt[key]);\n }\n }\n}\n\nfunction setPropertiesFromWkt(wkt) {\n if (wkt.AUTHORITY) {\n var authority = Object.keys(wkt.AUTHORITY)[0];\n if (authority && authority in wkt.AUTHORITY) {\n wkt.title = authority + ':' + wkt.AUTHORITY[authority];\n }\n }\n if (wkt.type === 'GEOGCS') {\n wkt.projName = 'longlat';\n } else if (wkt.type === 'LOCAL_CS') {\n wkt.projName = 'identity';\n wkt.local = true;\n } else {\n if (typeof wkt.PROJECTION === 'object') {\n wkt.projName = Object.keys(wkt.PROJECTION)[0];\n } else {\n wkt.projName = wkt.PROJECTION;\n }\n }\n if (wkt.AXIS) {\n var axisOrder = '';\n for (var i = 0, ii = wkt.AXIS.length; i < ii; ++i) {\n var axis = [wkt.AXIS[i][0].toLowerCase(), wkt.AXIS[i][1].toLowerCase()];\n if (axis[0].indexOf('north') !== -1 || ((axis[0] === 'y' || axis[0] === 'lat') && axis[1] === 'north')) {\n axisOrder += 'n';\n } else if (axis[0].indexOf('south') !== -1 || ((axis[0] === 'y' || axis[0] === 'lat') && axis[1] === 'south')) {\n axisOrder += 's';\n } else if (axis[0].indexOf('east') !== -1 || ((axis[0] === 'x' || axis[0] === 'lon') && axis[1] === 'east')) {\n axisOrder += 'e';\n } else if (axis[0].indexOf('west') !== -1 || ((axis[0] === 'x' || axis[0] === 'lon') && axis[1] === 'west')) {\n axisOrder += 'w';\n }\n }\n if (axisOrder.length === 2) {\n axisOrder += 'u';\n }\n if (axisOrder.length === 3) {\n wkt.axis = axisOrder;\n }\n }\n if (wkt.UNIT) {\n wkt.units = wkt.UNIT.name.toLowerCase();\n if (wkt.units === 'metre') {\n wkt.units = 'meter';\n }\n if (wkt.UNIT.convert) {\n if (wkt.type === 'GEOGCS') {\n if (wkt.DATUM && wkt.DATUM.SPHEROID) {\n wkt.to_meter = wkt.UNIT.convert*wkt.DATUM.SPHEROID.a;\n }\n } else {\n wkt.to_meter = wkt.UNIT.convert;\n }\n }\n }\n var geogcs = wkt.GEOGCS;\n if (wkt.type === 'GEOGCS') {\n geogcs = wkt;\n }\n if (geogcs) {\n //if(wkt.GEOGCS.PRIMEM&&wkt.GEOGCS.PRIMEM.convert){\n // wkt.from_greenwich=wkt.GEOGCS.PRIMEM.convert*D2R;\n //}\n if (geogcs.DATUM) {\n wkt.datumCode = geogcs.DATUM.name.toLowerCase();\n } else {\n wkt.datumCode = geogcs.name.toLowerCase();\n }\n if (wkt.datumCode.slice(0, 2) === 'd_') {\n wkt.datumCode = wkt.datumCode.slice(2);\n }\n if (wkt.datumCode === 'new_zealand_1949') {\n wkt.datumCode = 'nzgd49';\n }\n if (wkt.datumCode === 'wgs_1984' || wkt.datumCode === 'world_geodetic_system_1984') {\n if (wkt.PROJECTION === 'Mercator_Auxiliary_Sphere') {\n wkt.sphere = true;\n }\n wkt.datumCode = 'wgs84';\n }\n if (wkt.datumCode === 'belge_1972') {\n wkt.datumCode = 'rnb72';\n }\n if (geogcs.DATUM && geogcs.DATUM.SPHEROID) {\n wkt.ellps = geogcs.DATUM.SPHEROID.name.replace('_19', '').replace(/[Cc]larke\\_18/, 'clrk');\n if (wkt.ellps.toLowerCase().slice(0, 13) === 'international') {\n wkt.ellps = 'intl';\n }\n\n wkt.a = geogcs.DATUM.SPHEROID.a;\n wkt.rf = parseFloat(geogcs.DATUM.SPHEROID.rf, 10);\n }\n\n if (geogcs.DATUM && geogcs.DATUM.TOWGS84) {\n wkt.datum_params = geogcs.DATUM.TOWGS84;\n }\n if (~wkt.datumCode.indexOf('osgb_1936')) {\n wkt.datumCode = 'osgb36';\n }\n if (~wkt.datumCode.indexOf('osni_1952')) {\n wkt.datumCode = 'osni52';\n }\n if (~wkt.datumCode.indexOf('tm65')\n || ~wkt.datumCode.indexOf('geodetic_datum_of_1965')) {\n wkt.datumCode = 'ire65';\n }\n if (wkt.datumCode === 'ch1903+') {\n wkt.datumCode = 'ch1903';\n }\n if (~wkt.datumCode.indexOf('israel')) {\n wkt.datumCode = 'isr93';\n }\n }\n if (wkt.b && !isFinite(wkt.b)) {\n wkt.b = wkt.a;\n }\n if (wkt.rectified_grid_angle) {\n wkt.rectified_grid_angle = d2r(wkt.rectified_grid_angle);\n }\n\n function toMeter(input) {\n var ratio = wkt.to_meter || 1;\n return input * ratio;\n }\n var renamer = function(a) {\n return rename(wkt, a);\n };\n var list = [\n ['standard_parallel_1', 'Standard_Parallel_1'],\n ['standard_parallel_1', 'Latitude of 1st standard parallel'],\n ['standard_parallel_2', 'Standard_Parallel_2'],\n ['standard_parallel_2', 'Latitude of 2nd standard parallel'],\n ['false_easting', 'False_Easting'],\n ['false_easting', 'False easting'],\n ['false-easting', 'Easting at false origin'],\n ['false_northing', 'False_Northing'],\n ['false_northing', 'False northing'],\n ['false_northing', 'Northing at false origin'],\n ['central_meridian', 'Central_Meridian'],\n ['central_meridian', 'Longitude of natural origin'],\n ['central_meridian', 'Longitude of false origin'],\n ['latitude_of_origin', 'Latitude_Of_Origin'],\n ['latitude_of_origin', 'Central_Parallel'],\n ['latitude_of_origin', 'Latitude of natural origin'],\n ['latitude_of_origin', 'Latitude of false origin'],\n ['scale_factor', 'Scale_Factor'],\n ['k0', 'scale_factor'],\n ['latitude_of_center', 'Latitude_Of_Center'],\n ['latitude_of_center', 'Latitude_of_center'],\n ['lat0', 'latitude_of_center', d2r],\n ['longitude_of_center', 'Longitude_Of_Center'],\n ['longitude_of_center', 'Longitude_of_center'],\n ['longc', 'longitude_of_center', d2r],\n ['x0', 'false_easting', toMeter],\n ['y0', 'false_northing', toMeter],\n ['long0', 'central_meridian', d2r],\n ['lat0', 'latitude_of_origin', d2r],\n ['lat0', 'standard_parallel_1', d2r],\n ['lat1', 'standard_parallel_1', d2r],\n ['lat2', 'standard_parallel_2', d2r],\n ['azimuth', 'Azimuth'],\n ['alpha', 'azimuth', d2r],\n ['srsCode', 'name']\n ];\n list.forEach(renamer);\n applyProjectionDefaults(wkt);\n}\nexport default function(wkt) {\n if (typeof wkt === 'object') {\n return transformPROJJSON(wkt);\n }\n const version = detectWKTVersion(wkt);\n var lisp = parser(wkt);\n if (version === 'WKT2') {\n const projjson = buildPROJJSON(lisp);\n return transformPROJJSON(projjson);\n }\n var type = lisp[0];\n var obj = {};\n sExpr(lisp, obj);\n cleanWKT(obj);\n return obj[type];\n}\n","import globals from './global';\nimport parseProj from './projString';\nimport wkt from 'wkt-parser';\n\n/**\n * @typedef {Object} ProjectionDefinition\n * @property {string} title\n * @property {string} [projName]\n * @property {string} [ellps]\n * @property {import('./Proj.js').DatumDefinition} [datum]\n * @property {string} [datumName]\n * @property {number} [rf]\n * @property {number} [lat0]\n * @property {number} [lat1]\n * @property {number} [lat2]\n * @property {number} [lat_ts]\n * @property {number} [long0]\n * @property {number} [long1]\n * @property {number} [long2]\n * @property {number} [alpha]\n * @property {number} [longc]\n * @property {number} [x0]\n * @property {number} [y0]\n * @property {number} [k0]\n * @property {number} [a]\n * @property {number} [b]\n * @property {true} [R_A]\n * @property {number} [zone]\n * @property {true} [utmSouth]\n * @property {string|Array<number>} [datum_params]\n * @property {number} [to_meter]\n * @property {string} [units]\n * @property {number} [from_greenwich]\n * @property {string} [datumCode]\n * @property {string} [nadgrids]\n * @property {string} [axis]\n * @property {boolean} [sphere]\n * @property {number} [rectified_grid_angle]\n * @property {boolean} [approx]\n * @property {boolean} [over]\n * @property {string} [projStr]\n * @property {<T extends import('./core').TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} inverse\n * @property {<T extends import('./core').TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} forward\n */\n\n/**\n * @overload\n * @param {string} name\n * @param {string|ProjectionDefinition|import('./core.js').PROJJSONDefinition} projection\n * @returns {void}\n */\n/**\n * @overload\n * @param {Array<[string, string]>} name\n * @returns {Array<ProjectionDefinition|undefined>}\n */\n/**\n * @overload\n * @param {string} name\n * @returns {ProjectionDefinition}\n */\n\n/**\n * @param {string | Array<Array<string>> | Partial<Record<'EPSG'|'ESRI'|'IAU2000', ProjectionDefinition>>} name\n * @returns {ProjectionDefinition | Array<ProjectionDefinition|undefined> | void}\n */\nfunction defs(name) {\n /* global console */\n var that = this;\n if (arguments.length === 2) {\n var def = arguments[1];\n if (typeof def === 'string') {\n if (def.charAt(0) === '+') {\n defs[/** @type {string} */ (name)] = parseProj(arguments[1]);\n } else {\n defs[/** @type {string} */ (name)] = wkt(arguments[1]);\n }\n } else if (def && typeof def === 'object' && !('projName' in def)) {\n // PROJJSON\n defs[/** @type {string} */ (name)] = wkt(arguments[1]);\n } else {\n defs[/** @type {string} */ (name)] = def;\n if (!def) {\n delete defs[/** @type {string} */ (name)];\n }\n }\n } else if (arguments.length === 1) {\n if (Array.isArray(name)) {\n return name.map(function (v) {\n if (Array.isArray(v)) {\n return defs.apply(that, v);\n } else {\n return defs(v);\n }\n });\n } else if (typeof name === 'string') {\n if (name in defs) {\n return defs[name];\n }\n } else if ('EPSG' in name) {\n defs['EPSG:' + name.EPSG] = name;\n } else if ('ESRI' in name) {\n defs['ESRI:' + name.ESRI] = name;\n } else if ('IAU2000' in name) {\n defs['IAU2000:' + name.IAU2000] = name;\n } else {\n console.log(name);\n }\n return;\n }\n}\nglobals(defs);\nexport default defs;\n","import defs from './defs';\nimport wkt from 'wkt-parser';\nimport projStr from './projString';\nimport match from './match';\nfunction testObj(code) {\n return typeof code === 'string';\n}\nfunction testDef(code) {\n return code in defs;\n}\nfunction testWKT(code) {\n return (code.indexOf('+') !== 0 && code.indexOf('[') !== -1) || (typeof code === 'object' && !('srsCode' in code));\n}\nvar codes = ['3857', '900913', '3785', '102113'];\nfunction checkMercator(item) {\n var auth = match(item, 'authority');\n if (!auth) {\n return;\n }\n var code = match(auth, 'epsg');\n return code && codes.indexOf(code) > -1;\n}\nfunction checkProjStr(item) {\n var ext = match(item, 'extension');\n if (!ext) {\n return;\n }\n return match(ext, 'proj4');\n}\nfunction testProj(code) {\n return code[0] === '+';\n}\n/**\n * @param {string | import('./core').PROJJSONDefinition | import('./defs').ProjectionDefinition} code\n * @returns {import('./defs').ProjectionDefinition}\n */\nfunction parse(code) {\n if (testObj(code)) {\n // check to see if this is a WKT string\n if (testDef(code)) {\n return defs[code];\n }\n if (testWKT(code)) {\n var out = wkt(code);\n // test of spetial case, due to this being a very common and often malformed\n if (checkMercator(out)) {\n return defs['EPSG:3857'];\n }\n var maybeProjStr = checkProjStr(out);\n if (maybeProjStr) {\n return projStr(maybeProjStr);\n }\n return out;\n }\n if (testProj(code)) {\n return projStr(code);\n }\n } else if (!('projName' in code)) {\n return wkt(code);\n } else {\n return code;\n }\n}\n\nexport default parse;\n","export default function (destination, source) {\n destination = destination || {};\n var value, property;\n if (!source) {\n return destination;\n }\n for (property in source) {\n value = source[property];\n if (value !== undefined) {\n destination[property] = value;\n }\n }\n return destination;\n}\n","export default function (eccent, sinphi, cosphi) {\n var con = eccent * sinphi;\n return cosphi / (Math.sqrt(1 - con * con));\n}\n","export default function (x) {\n return x < 0 ? -1 : 1;\n}\n","import { TWO_PI, SPI } from '../constants/values';\nimport sign from './sign';\n\nexport default function (x, skipAdjust) {\n if (skipAdjust) {\n return x;\n }\n return (Math.abs(x) <= SPI) ? x : (x - (sign(x) * TWO_PI));\n}\n","import { HALF_PI } from '../constants/values';\n\nexport default function (eccent, phi, sinphi) {\n var con = eccent * sinphi;\n var com = 0.5 * eccent;\n con = Math.pow(((1 - con) / (1 + con)), com);\n return (Math.tan(0.5 * (HALF_PI - phi)) / con);\n}\n","import { HALF_PI } from '../constants/values';\n\nexport default function (eccent, ts) {\n var eccnth = 0.5 * eccent;\n var con, dphi;\n var phi = HALF_PI - 2 * Math.atan(ts);\n for (var i = 0; i <= 15; i++) {\n con = eccent * Math.sin(phi);\n dphi = HALF_PI - 2 * Math.atan(ts * (Math.pow(((1 - con) / (1 + con)), eccnth))) - phi;\n phi += dphi;\n if (Math.abs(dphi) <= 0.0000000001) {\n return phi;\n }\n }\n // console.log(\"phi2z has NoConvergence\");\n return -9999;\n}\n","import msfnz from '../common/msfnz';\n\nimport adjust_lon from '../common/adjust_lon';\nimport tsfnz from '../common/tsfnz';\nimport phi2z from '../common/phi2z';\nimport { FORTPI, R2D, EPSLN, HALF_PI } from '../constants/values';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} es\n * @property {number} e\n * @property {number} k\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n var con = this.b / this.a;\n this.es = 1 - con * con;\n if (!('x0' in this)) {\n this.x0 = 0;\n }\n if (!('y0' in this)) {\n this.y0 = 0;\n }\n this.e = Math.sqrt(this.es);\n if (this.lat_ts) {\n if (this.sphere) {\n this.k0 = Math.cos(this.lat_ts);\n } else {\n this.k0 = msfnz(this.e, Math.sin(this.lat_ts), Math.cos(this.lat_ts));\n }\n } else {\n if (!this.k0) {\n if (this.k) {\n this.k0 = this.k;\n } else {\n this.k0 = 1;\n }\n }\n }\n}\n\n/* Mercator forward equations--mapping lat,long to x,y\n -------------------------------------------------- */\n\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n // convert to radians\n if (lat * R2D > 90 && lat * R2D < -90 && lon * R2D > 180 && lon * R2D < -180) {\n return null;\n }\n\n var x, y;\n if (Math.abs(Math.abs(lat) - HALF_PI) <= EPSLN) {\n return null;\n } else {\n if (this.sphere) {\n x = this.x0 + this.a * this.k0 * adjust_lon(lon - this.long0, this.over);\n y = this.y0 + this.a * this.k0 * Math.log(Math.tan(FORTPI + 0.5 * lat));\n } else {\n var sinphi = Math.sin(lat);\n var ts = tsfnz(this.e, lat, sinphi);\n x = this.x0 + this.a * this.k0 * adjust_lon(lon - this.long0, this.over);\n y = this.y0 - this.a * this.k0 * Math.log(ts);\n }\n p.x = x;\n p.y = y;\n return p;\n }\n}\n\n/* Mercator inverse equations--mapping x,y to lat/long\n -------------------------------------------------- */\nexport function inverse(p) {\n var x = p.x - this.x0;\n var y = p.y - this.y0;\n var lon, lat;\n\n if (this.sphere) {\n lat = HALF_PI - 2 * Math.atan(Math.exp(-y / (this.a * this.k0)));\n } else {\n var ts = Math.exp(-y / (this.a * this.k0));\n lat = phi2z(this.e, ts);\n if (lat === -9999) {\n return null;\n }\n }\n lon = adjust_lon(this.long0 + x / (this.a * this.k0), this.over);\n\n p.x = lon;\n p.y = lat;\n return p;\n}\n\nexport var names = ['Mercator', 'Popular Visualisation Pseudo Mercator', 'Mercator_1SP', 'Mercator_Auxiliary_Sphere', 'Mercator_Variant_A', 'merc'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","export function init() {\n // no-op for longlat\n}\n\nfunction identity(pt) {\n return pt;\n}\nexport { identity as forward };\nexport { identity as inverse };\nexport var names = ['longlat', 'identity'];\nexport default {\n init: init,\n forward: identity,\n inverse: identity,\n names: names\n};\n","import merc from './projections/merc';\nimport longlat from './projections/longlat';\n/** @type {Array<Partial<import('./Proj').default>>} */\nvar projs = [merc, longlat];\nvar names = {};\nvar projStore = [];\n\n/**\n * @param {import('./Proj').default} proj\n * @param {number} i\n */\nexport function add(proj, i) {\n var len = projStore.length;\n if (!proj.names) {\n console.log(i);\n return true;\n }\n projStore[len] = proj;\n proj.names.forEach(function (n) {\n names[n.toLowerCase()] = len;\n });\n return this;\n}\n\nexport function getNormalizedProjName(n) {\n return n.replace(/[-\\(\\)\\s]+/g, ' ').trim().replace(/ /g, '_');\n}\n\n/**\n * Get a projection by name.\n * @param {string} name\n * @returns {import('./Proj').default|false}\n */\nexport function get(name) {\n if (!name) {\n return false;\n }\n var n = name.toLowerCase();\n if (typeof names[n] !== 'undefined' && projStore[names[n]]) {\n return projStore[names[n]];\n }\n n = getNormalizedProjName(n);\n if (n in names && projStore[names[n]]) {\n return projStore[names[n]];\n }\n}\n\nexport function start() {\n projs.forEach(add);\n}\nexport default {\n start: start,\n add: add,\n get: get\n};\n","var ellipsoids = {\n MERIT: {\n a: 6378137,\n rf: 298.257,\n ellipseName: 'MERIT 1983'\n },\n SGS85: {\n a: 6378136,\n rf: 298.257,\n ellipseName: 'Soviet Geodetic System 85'\n },\n GRS80: {\n a: 6378137,\n rf: 298.257222101,\n ellipseName: 'GRS 1980(IUGG, 1980)'\n },\n IAU76: {\n a: 6378140,\n rf: 298.257,\n ellipseName: 'IAU 1976'\n },\n airy: {\n a: 6377563.396,\n b: 6356256.91,\n ellipseName: 'Airy 1830'\n },\n APL4: {\n a: 6378137,\n rf: 298.25,\n ellipseName: 'Appl. Physics. 1965'\n },\n NWL9D: {\n a: 6378145,\n rf: 298.25,\n ellipseName: 'Naval Weapons Lab., 1965'\n },\n mod_airy: {\n a: 6377340.189,\n b: 6356034.446,\n ellipseName: 'Modified Airy'\n },\n andrae: {\n a: 6377104.43,\n rf: 300,\n ellipseName: 'Andrae 1876 (Den., Iclnd.)'\n },\n aust_SA: {\n a: 6378160,\n rf: 298.25,\n ellipseName: 'Australian Natl & S. Amer. 1969'\n },\n GRS67: {\n a: 6378160,\n rf: 298.247167427,\n ellipseName: 'GRS 67(IUGG 1967)'\n },\n bessel: {\n a: 6377397.155,\n rf: 299.1528128,\n ellipseName: 'Bessel 1841'\n },\n bess_nam: {\n a: 6377483.865,\n rf: 299.1528128,\n ellipseName: 'Bessel 1841 (Namibia)'\n },\n clrk66: {\n a: 6378206.4,\n b: 6356583.8,\n ellipseName: 'Clarke 1866'\n },\n clrk80: {\n a: 6378249.145,\n rf: 293.4663,\n ellipseName: 'Clarke 1880 mod.'\n },\n clrk80ign: {\n a: 6378249.2,\n b: 6356515,\n rf: 293.4660213,\n ellipseName: 'Clarke 1880 (IGN)'\n },\n clrk58: {\n a: 6378293.645208759,\n rf: 294.2606763692654,\n ellipseName: 'Clarke 1858'\n },\n CPM: {\n a: 6375738.7,\n rf: 334.29,\n ellipseName: 'Comm. des Poids et Mesures 1799'\n },\n delmbr: {\n a: 6376428,\n rf: 311.5,\n ellipseName: 'Delambre 1810 (Belgium)'\n },\n engelis: {\n a: 6378136.05,\n rf: 298.2566,\n ellipseName: 'Engelis 1985'\n },\n evrst30: {\n a: 6377276.345,\n rf: 300.8017,\n ellipseName: 'Everest 1830'\n },\n evrst48: {\n a: 6377304.063,\n rf: 300.8017,\n ellipseName: 'Everest 1948'\n },\n evrst56: {\n a: 6377301.243,\n rf: 300.8017,\n ellipseName: 'Everest 1956'\n },\n evrst69: {\n a: 6377295.664,\n rf: 300.8017,\n ellipseName: 'Everest 1969'\n },\n evrstSS: {\n a: 6377298.556,\n rf: 300.8017,\n ellipseName: 'Everest (Sabah & Sarawak)'\n },\n fschr60: {\n a: 6378166,\n rf: 298.3,\n ellipseName: 'Fischer (Mercury Datum) 1960'\n },\n fschr60m: {\n a: 6378155,\n rf: 298.3,\n ellipseName: 'Fischer 1960'\n },\n fschr68: {\n a: 6378150,\n rf: 298.3,\n ellipseName: 'Fischer 1968'\n },\n helmert: {\n a: 6378200,\n rf: 298.3,\n ellipseName: 'Helmert 1906'\n },\n hough: {\n a: 6378270,\n rf: 297,\n ellipseName: 'Hough'\n },\n intl: {\n a: 6378388,\n rf: 297,\n ellipseName: 'International 1909 (Hayford)'\n },\n kaula: {\n a: 6378163,\n rf: 298.24,\n ellipseName: 'Kaula 1961'\n },\n lerch: {\n a: 6378139,\n rf: 298.257,\n ellipseName: 'Lerch 1979'\n },\n mprts: {\n a: 6397300,\n rf: 191,\n ellipseName: 'Maupertius 1738'\n },\n new_intl: {\n a: 6378157.5,\n b: 6356772.2,\n ellipseName: 'New International 1967'\n },\n plessis: {\n a: 6376523,\n rf: 6355863,\n ellipseName: 'Plessis 1817 (France)'\n },\n krass: {\n a: 6378245,\n rf: 298.3,\n ellipseName: 'Krassovsky, 1942'\n },\n SEasia: {\n a: 6378155,\n b: 6356773.3205,\n ellipseName: 'Southeast Asia'\n },\n walbeck: {\n a: 6376896,\n b: 6355834.8467,\n ellipseName: 'Walbeck'\n },\n WGS60: {\n a: 6378165,\n rf: 298.3,\n ellipseName: 'WGS 60'\n },\n WGS66: {\n a: 6378145,\n rf: 298.25,\n ellipseName: 'WGS 66'\n },\n WGS7: {\n a: 6378135,\n rf: 298.26,\n ellipseName: 'WGS 72'\n },\n WGS84: {\n a: 6378137,\n rf: 298.257223563,\n ellipseName: 'WGS 84'\n },\n sphere: {\n a: 6370997,\n b: 6370997,\n ellipseName: 'Normal Sphere (r=6370997)'\n }\n};\n\nexport default ellipsoids;\n","import { SIXTH, RA4, RA6, EPSLN } from './constants/values';\nimport { default as Ellipsoid } from './constants/Ellipsoid';\nimport match from './match';\n\nconst WGS84 = Ellipsoid.WGS84; // default ellipsoid\n\nexport function eccentricity(a, b, rf, R_A) {\n var a2 = a * a; // used in geocentric\n var b2 = b * b; // used in geocentric\n var es = (a2 - b2) / a2; // e ^ 2\n var e = 0;\n if (R_A) {\n a *= 1 - es * (SIXTH + es * (RA4 + es * RA6));\n a2 = a * a;\n es = 0;\n } else {\n e = Math.sqrt(es); // eccentricity\n }\n var ep2 = (a2 - b2) / b2; // used in geocentric\n return {\n es: es,\n e: e,\n ep2: ep2\n };\n}\nexport function sphere(a, b, rf, ellps, sphere) {\n if (!a) { // do we have an ellipsoid?\n var ellipse = match(Ellipsoid, ellps);\n if (!ellipse) {\n ellipse = WGS84;\n }\n a = ellipse.a;\n b = ellipse.b;\n rf = ellipse.rf;\n }\n\n if (rf && !b) {\n b = (1.0 - 1.0 / rf) * a;\n }\n if (rf === 0 || Math.abs(a - b) < EPSLN) {\n sphere = true;\n b = a;\n }\n return {\n a: a,\n b: b,\n rf: rf,\n sphere: sphere\n };\n}\n","var datums = {\n wgs84: {\n towgs84: '0,0,0',\n ellipse: 'WGS84',\n datumName: 'WGS84'\n },\n ch1903: {\n towgs84: '674.374,15.056,405.346',\n ellipse: 'bessel',\n datumName: 'swiss'\n },\n ggrs87: {\n towgs84: '-199.87,74.79,246.62',\n ellipse: 'GRS80',\n datumName: 'Greek_Geodetic_Reference_System_1987'\n },\n nad83: {\n towgs84: '0,0,0',\n ellipse: 'GRS80',\n datumName: 'North_American_Datum_1983'\n },\n nad27: {\n nadgrids: '@conus,@alaska,@ntv2_0.gsb,@ntv1_can.dat',\n ellipse: 'clrk66',\n datumName: 'North_American_Datum_1927'\n },\n potsdam: {\n towgs84: '598.1,73.7,418.2,0.202,0.045,-2.455,6.7',\n ellipse: 'bessel',\n datumName: 'Potsdam Rauenberg 1950 DHDN'\n },\n carthage: {\n towgs84: '-263.0,6.0,431.0',\n ellipse: 'clark80',\n datumName: 'Carthage 1934 Tunisia'\n },\n hermannskogel: {\n towgs84: '577.326,90.129,463.919,5.137,1.474,5.297,2.4232',\n ellipse: 'bessel',\n datumName: 'Hermannskogel'\n },\n mgi: {\n towgs84: '577.326,90.129,463.919,5.137,1.474,5.297,2.4232',\n ellipse: 'bessel',\n datumName: 'Militar-Geographische Institut'\n },\n osni52: {\n towgs84: '482.530,-130.596,564.557,-1.042,-0.214,-0.631,8.15',\n ellipse: 'airy',\n datumName: 'Irish National'\n },\n ire65: {\n towgs84: '482.530,-130.596,564.557,-1.042,-0.214,-0.631,8.15',\n ellipse: 'mod_airy',\n datumName: 'Ireland 1965'\n },\n rassadiran: {\n towgs84: '-133.63,-157.5,-158.62',\n ellipse: 'intl',\n datumName: 'Rassadiran'\n },\n nzgd49: {\n towgs84: '59.47,-5.04,187.44,0.47,-0.1,1.024,-4.5993',\n ellipse: 'intl',\n datumName: 'New Zealand Geodetic Datum 1949'\n },\n osgb36: {\n towgs84: '446.448,-125.157,542.060,0.1502,0.2470,0.8421,-20.4894',\n ellipse: 'airy',\n datumName: 'Ordnance Survey of Great Britain 1936'\n },\n s_jtsk: {\n towgs84: '589,76,480',\n ellipse: 'bessel',\n datumName: 'S-JTSK (Ferro)'\n },\n beduaram: {\n towgs84: '-106,-87,188',\n ellipse: 'clrk80',\n datumName: 'Beduaram'\n },\n gunung_segara: {\n towgs84: '-403,684,41',\n ellipse: 'bessel',\n datumName: 'Gunung Segara Jakarta'\n },\n rnb72: {\n towgs84: '106.869,-52.2978,103.724,-0.33657,0.456955,-1.84218,1',\n ellipse: 'intl',\n datumName: 'Reseau National Belge 1972'\n },\n EPSG_5451: {\n towgs84: '6.41,-49.05,-11.28,1.5657,0.5242,6.9718,-5.7649'\n },\n IGNF_LURESG: {\n towgs84: '-192.986,13.673,-39.309,-0.4099,-2.9332,2.6881,0.43'\n },\n EPSG_4614: {\n towgs84: '-119.4248,-303.65872,-11.00061,1.164298,0.174458,1.096259,3.657065'\n },\n EPSG_4615: {\n towgs84: '-494.088,-312.129,279.877,-1.423,-1.013,1.59,-0.748'\n },\n ESRI_37241: {\n towgs84: '-76.822,257.457,-12.817,2.136,-0.033,-2.392,-0.031'\n },\n ESRI_37249: {\n towgs84: '-440.296,58.548,296.265,1.128,10.202,4.559,-0.438'\n },\n ESRI_37245: {\n towgs84: '-511.151,-181.269,139.609,1.05,2.703,1.798,3.071'\n },\n EPSG_4178: {\n towgs84: '24.9,-126.4,-93.2,-0.063,-0.247,-0.041,1.01'\n },\n EPSG_4622: {\n towgs84: '-472.29,-5.63,-304.12,0.4362,-0.8374,0.2563,1.8984'\n },\n EPSG_4625: {\n towgs84: '126.93,547.94,130.41,-2.7867,5.1612,-0.8584,13.8227'\n },\n EPSG_5252: {\n towgs84: '0.023,0.036,-0.068,0.00176,0.00912,-0.01136,0.00439'\n },\n EPSG_4314: {\n towgs84: '597.1,71.4,412.1,0.894,0.068,-1.563,7.58'\n },\n EPSG_4282: {\n towgs84: '-178.3,-316.7,-131.5,5.278,6.077,10.979,19.166'\n },\n EPSG_4231: {\n towgs84: '-83.11,-97.38,-117.22,0.0276,-0.2167,0.2147,0.1218'\n },\n EPSG_4274: {\n towgs84: '-230.994,102.591,25.199,0.633,-0.239,0.9,1.95'\n },\n EPSG_4134: {\n towgs84: '-180.624,-225.516,173.919,-0.81,-1.898,8.336,16.71006'\n },\n EPSG_4254: {\n towgs84: '18.38,192.45,96.82,0.056,-0.142,-0.2,-0.0013'\n },\n EPSG_4159: {\n towgs84: '-194.513,-63.978,-25.759,-3.4027,3.756,-3.352,-0.9175'\n },\n EPSG_4687: {\n towgs84: '0.072,-0.507,-0.245,0.0183,-0.0003,0.007,-0.0093'\n },\n EPSG_4227: {\n towgs84: '-83.58,-397.54,458.78,-17.595,-2.847,4.256,3.225'\n },\n EPSG_4746: {\n towgs84: '599.4,72.4,419.2,-0.062,-0.022,-2.723,6.46'\n },\n EPSG_4745: {\n towgs84: '612.4,77,440.2,-0.054,0.057,-2.797,2.55'\n },\n EPSG_6311: {\n towgs84: '8.846,-4.394,-1.122,-0.00237,-0.146528,0.130428,0.783926'\n },\n EPSG_4289: {\n towgs84: '565.7381,50.4018,465.2904,-1.91514,1.60363,-9.09546,4.07244'\n },\n EPSG_4230: {\n towgs84: '-68.863,-134.888,-111.49,-0.53,-0.14,0.57,-3.4'\n },\n EPSG_4154: {\n towgs84: '-123.02,-158.95,-168.47'\n },\n EPSG_4156: {\n towgs84: '570.8,85.7,462.8,4.998,1.587,5.261,3.56'\n },\n EPSG_4299: {\n towgs84: '482.5,-130.6,564.6,-1.042,-0.214,-0.631,8.15'\n },\n EPSG_4179: {\n towgs84: '33.4,-146.6,-76.3,-0.359,-0.053,0.844,-0.84'\n },\n EPSG_4313: {\n towgs84: '-106.8686,52.2978,-103.7239,0.3366,-0.457,1.8422,-1.2747'\n },\n EPSG_4194: {\n towgs84: '163.511,127.533,-159.789'\n },\n EPSG_4195: {\n towgs84: '105,326,-102.5'\n },\n EPSG_4196: {\n towgs84: '-45,417,-3.5'\n },\n EPSG_4611: {\n towgs84: '-162.619,-276.959,-161.764,0.067753,-2.243649,-1.158827,-1.094246'\n },\n EPSG_4633: {\n towgs84: '137.092,131.66,91.475,-1.9436,-11.5993,-4.3321,-7.4824'\n },\n EPSG_4641: {\n towgs84: '-408.809,366.856,-412.987,1.8842,-0.5308,2.1655,-121.0993'\n },\n EPSG_4643: {\n towgs84: '-480.26,-438.32,-643.429,16.3119,20.1721,-4.0349,-111.7002'\n },\n EPSG_4300: {\n towgs84: '482.5,-130.6,564.6,-1.042,-0.214,-0.631,8.15'\n },\n EPSG_4188: {\n towgs84: '482.5,-130.6,564.6,-1.042,-0.214,-0.631,8.15'\n },\n EPSG_4660: {\n towgs84: '982.6087,552.753,-540.873,32.39344,-153.25684,-96.2266,16.805'\n },\n EPSG_4662: {\n towgs84: '97.295,-263.247,310.882,-1.5999,0.8386,3.1409,13.3259'\n },\n EPSG_3906: {\n towgs84: '577.88891,165.22205,391.18289,4.9145,-0.94729,-13.05098,7.78664'\n },\n EPSG_4307: {\n towgs84: '-209.3622,-87.8162,404.6198,0.0046,3.4784,0.5805,-1.4547'\n },\n EPSG_6892: {\n towgs84: '-76.269,-16.683,68.562,-6.275,10.536,-4.286,-13.686'\n },\n EPSG_4690: {\n towgs84: '221.597,152.441,176.523,2.403,1.3893,0.884,11.4648'\n },\n EPSG_4691: {\n towgs84: '218.769,150.75,176.75,3.5231,2.0037,1.288,10.9817'\n },\n EPSG_4629: {\n towgs84: '72.51,345.411,79.241,-1.5862,-0.8826,-0.5495,1.3653'\n },\n EPSG_4630: {\n towgs84: '165.804,216.213,180.26,-0.6251,-0.4515,-0.0721,7.4111'\n },\n EPSG_4692: {\n towgs84: '217.109,86.452,23.711,0.0183,-0.0003,0.007,-0.0093'\n },\n EPSG_9333: {\n towgs84: '0,0,0,-8.393,0.749,-10.276,0'\n },\n EPSG_9059: {\n towgs84: '0,0,0'\n },\n EPSG_4312: {\n towgs84: '601.705,84.263,485.227,4.7354,1.3145,5.393,-2.3887'\n },\n EPSG_4123: {\n towgs84: '-96.062,-82.428,-121.753,4.801,0.345,-1.376,1.496'\n },\n EPSG_4309: {\n towgs84: '-124.45,183.74,44.64,-0.4384,0.5446,-0.9706,-2.1365'\n },\n ESRI_104106: {\n towgs84: '-283.088,-70.693,117.445,-1.157,0.059,-0.652,-4.058'\n },\n EPSG_4281: {\n towgs84: '-219.247,-73.802,269.529'\n },\n EPSG_4322: {\n towgs84: '0,0,4.5'\n },\n EPSG_4324: {\n towgs84: '0,0,1.9'\n },\n EPSG_4284: {\n towgs84: '43.822,-108.842,-119.585,1.455,-0.761,0.737,0.549'\n },\n EPSG_4277: {\n towgs84: '446.448,-125.157,542.06,0.15,0.247,0.842,-20.489'\n },\n EPSG_4207: {\n towgs84: '-282.1,-72.2,120,-1.529,0.145,-0.89,-4.46'\n },\n EPSG_4688: {\n towgs84: '347.175,1077.618,2623.677,33.9058,-70.6776,9.4013,186.0647'\n },\n EPSG_4689: {\n towgs84: '410.793,54.542,80.501,-2.5596,-2.3517,-0.6594,17.3218'\n },\n EPSG_4720: {\n towgs84: '0,0,4.5'\n },\n EPSG_4273: {\n towgs84: '278.3,93,474.5,7.889,0.05,-6.61,6.21'\n },\n EPSG_4240: {\n towgs84: '204.64,834.74,293.8'\n },\n EPSG_4817: {\n towgs84: '278.3,93,474.5,7.889,0.05,-6.61,6.21'\n },\n ESRI_104131: {\n towgs84: '426.62,142.62,460.09,4.98,4.49,-12.42,-17.1'\n },\n EPSG_4265: {\n towgs84: '-104.1,-49.1,-9.9,0.971,-2.917,0.714,-11.68'\n },\n EPSG_4263: {\n towgs84: '-111.92,-87.85,114.5,1.875,0.202,0.219,0.032'\n },\n EPSG_4298: {\n towgs84: '-689.5937,623.84046,-65.93566,-0.02331,1.17094,-0.80054,5.88536'\n },\n EPSG_4270: {\n towgs84: '-253.4392,-148.452,386.5267,0.15605,0.43,-0.1013,-0.0424'\n },\n EPSG_4229: {\n towgs84: '-121.8,98.1,-10.7'\n },\n EPSG_4220: {\n towgs84: '-55.5,-348,-229.2'\n },\n EPSG_4214: {\n towgs84: '12.646,-155.176,-80.863'\n },\n EPSG_4232: {\n towgs84: '-345,3,223'\n },\n EPSG_4238: {\n towgs84: '-1.977,-13.06,-9.993,0.364,0.254,0.689,-1.037'\n },\n EPSG_4168: {\n towgs84: '-170,33,326'\n },\n EPSG_4131: {\n towgs84: '199,931,318.9'\n },\n EPSG_4152: {\n towgs84: '-0.9102,2.0141,0.5602,0.029039,0.010065,0.010101,0'\n },\n EPSG_5228: {\n towgs84: '572.213,85.334,461.94,4.9732,1.529,5.2484,3.5378'\n },\n EPSG_8351: {\n towgs84: '485.021,169.465,483.839,7.786342,4.397554,4.102655,0'\n },\n EPSG_4683: {\n towgs84: '-127.62,-67.24,-47.04,-3.068,4.903,1.578,-1.06'\n },\n EPSG_4133: {\n towgs84: '0,0,0'\n },\n EPSG_7373: {\n towgs84: '0.819,-0.5762,-1.6446,-0.00378,-0.03317,0.00318,0.0693'\n },\n EPSG_9075: {\n towgs84: '-0.9102,2.0141,0.5602,0.029039,0.010065,0.010101,0'\n },\n EPSG_9072: {\n towgs84: '-0.9102,2.0141,0.5602,0.029039,0.010065,0.010101,0'\n },\n EPSG_9294: {\n towgs84: '1.16835,-1.42001,-2.24431,-0.00822,-0.05508,0.01818,0.23388'\n },\n EPSG_4212: {\n towgs84: '-267.434,173.496,181.814,-13.4704,8.7154,7.3926,14.7492'\n },\n EPSG_4191: {\n towgs84: '-44.183,-0.58,-38.489,2.3867,2.7072,-3.5196,-8.2703'\n },\n EPSG_4237: {\n towgs84: '52.684,-71.194,-13.975,-0.312,-0.1063,-0.3729,1.0191'\n },\n EPSG_4740: {\n towgs84: '-1.08,-0.27,-0.9'\n },\n EPSG_4124: {\n towgs84: '419.3836,99.3335,591.3451,0.850389,1.817277,-7.862238,-0.99496'\n },\n EPSG_5681: {\n towgs84: '584.9636,107.7175,413.8067,1.1155,0.2824,-3.1384,7.9922'\n },\n EPSG_4141: {\n towgs84: '23.772,17.49,17.859,-0.3132,-1.85274,1.67299,-5.4262'\n },\n EPSG_4204: {\n towgs84: '-85.645,-273.077,-79.708,2.289,-1.421,2.532,3.194'\n },\n EPSG_4319: {\n towgs84: '226.702,-193.337,-35.371,-2.229,-4.391,9.238,0.9798'\n },\n EPSG_4200: {\n towgs84: '24.82,-131.21,-82.66'\n },\n EPSG_4130: {\n towgs84: '0,0,0'\n },\n EPSG_4127: {\n towgs84: '-82.875,-57.097,-156.768,-2.158,1.524,-0.982,-0.359'\n },\n EPSG_4149: {\n towgs84: '674.374,15.056,405.346'\n },\n EPSG_4617: {\n towgs84: '-0.991,1.9072,0.5129,1.25033e-7,4.6785e-8,5.6529e-8,0'\n },\n EPSG_4663: {\n towgs84: '-210.502,-66.902,-48.476,2.094,-15.067,-5.817,0.485'\n },\n EPSG_4664: {\n towgs84: '-211.939,137.626,58.3,-0.089,0.251,0.079,0.384'\n },\n EPSG_4665: {\n towgs84: '-105.854,165.589,-38.312,-0.003,-0.026,0.024,-0.048'\n },\n EPSG_4666: {\n towgs84: '631.392,-66.551,481.442,1.09,-4.445,-4.487,-4.43'\n },\n EPSG_4756: {\n towgs84: '-192.873,-39.382,-111.202,-0.00205,-0.0005,0.00335,0.0188'\n },\n EPSG_4723: {\n towgs84: '-179.483,-69.379,-27.584,-7.862,8.163,6.042,-13.925'\n },\n EPSG_4726: {\n towgs84: '8.853,-52.644,180.304,-0.393,-2.323,2.96,-24.081'\n },\n EPSG_4267: {\n towgs84: '-8.0,160.0,176.0'\n },\n EPSG_5365: {\n towgs84: '-0.16959,0.35312,0.51846,0.03385,-0.16325,0.03446,0.03693'\n },\n EPSG_4218: {\n towgs84: '304.5,306.5,-318.1'\n },\n EPSG_4242: {\n towgs84: '-33.722,153.789,94.959,-8.581,-4.478,4.54,8.95'\n },\n EPSG_4216: {\n towgs84: '-292.295,248.758,429.447,4.9971,2.99,6.6906,1.0289'\n },\n ESRI_104105: {\n towgs84: '631.392,-66.551,481.442,1.09,-4.445,-4.487,-4.43'\n },\n ESRI_104129: {\n towgs84: '0,0,0'\n },\n EPSG_4673: {\n towgs84: '174.05,-25.49,112.57'\n },\n EPSG_4202: {\n towgs84: '-124,-60,154'\n },\n EPSG_4203: {\n towgs84: '-117.763,-51.51,139.061,0.292,0.443,0.277,-0.191'\n },\n EPSG_3819: {\n towgs84: '595.48,121.69,515.35,4.115,-2.9383,0.853,-3.408'\n },\n EPSG_8694: {\n towgs84: '-93.799,-132.737,-219.073,-1.844,0.648,-6.37,-0.169'\n },\n EPSG_4145: {\n towgs84: '275.57,676.78,229.6'\n },\n EPSG_4283: {\n towgs84: '61.55,-10.87,-40.19,39.4924,32.7221,32.8979,-9.994'\n },\n EPSG_4317: {\n towgs84: '2.3287,-147.0425,-92.0802,-0.3092483,0.32482185,0.49729934,5.68906266'\n },\n EPSG_4272: {\n towgs84: '59.47,-5.04,187.44,0.47,-0.1,1.024,-4.5993'\n },\n EPSG_4248: {\n towgs84: '-307.7,265.3,-363.5'\n },\n EPSG_5561: {\n towgs84: '24,-121,-76'\n },\n EPSG_5233: {\n towgs84: '-0.293,766.95,87.713,0.195704,1.695068,3.473016,-0.039338'\n },\n ESRI_104130: {\n towgs84: '-86,-98,-119'\n },\n ESRI_104102: {\n towgs84: '682,-203,480'\n },\n ESRI_37207: {\n towgs84: '7,-10,-26'\n },\n EPSG_4675: {\n towgs84: '59.935,118.4,-10.871'\n },\n ESRI_104109: {\n towgs84: '-89.121,-348.182,260.871'\n },\n ESRI_104112: {\n towgs84: '-185.583,-230.096,281.361'\n },\n ESRI_104113: {\n towgs84: '25.1,-275.6,222.6'\n },\n IGNF_WGS72G: {\n towgs84: '0,12,6'\n },\n IGNF_NTFG: {\n towgs84: '-168,-60,320'\n },\n IGNF_EFATE57G: {\n towgs84: '-127,-769,472'\n },\n IGNF_PGP50G: {\n towgs84: '324.8,153.6,172.1'\n },\n IGNF_REUN47G: {\n towgs84: '94,-948,-1262'\n },\n IGNF_CSG67G: {\n towgs84: '-186,230,110'\n },\n IGNF_GUAD48G: {\n towgs84: '-467,-16,-300'\n },\n IGNF_TAHI51G: {\n towgs84: '162,117,154'\n },\n IGNF_TAHAAG: {\n towgs84: '65,342,77'\n },\n IGNF_NUKU72G: {\n towgs84: '84,274,65'\n },\n IGNF_PETRELS72G: {\n towgs84: '365,194,166'\n },\n IGNF_WALL78G: {\n towgs84: '253,-133,-127'\n },\n IGNF_MAYO50G: {\n towgs84: '-382,-59,-262'\n },\n IGNF_TANNAG: {\n towgs84: '-139,-967,436'\n },\n IGNF_IGN72G: {\n towgs84: '-13,-348,292'\n },\n IGNF_ATIGG: {\n towgs84: '1118,23,66'\n },\n IGNF_FANGA84G: {\n towgs84: '150.57,158.33,118.32'\n },\n IGNF_RUSAT84G: {\n towgs84: '202.13,174.6,-15.74'\n },\n IGNF_KAUE70G: {\n towgs84: '126.74,300.1,-75.49'\n },\n IGNF_MOP90G: {\n towgs84: '-10.8,-1.8,12.77'\n },\n IGNF_MHPF67G: {\n towgs84: '338.08,212.58,-296.17'\n },\n IGNF_TAHI79G: {\n towgs84: '160.61,116.05,153.69'\n },\n IGNF_ANAA92G: {\n towgs84: '1.5,3.84,4.81'\n },\n IGNF_MARQUI72G: {\n towgs84: '330.91,-13.92,58.56'\n },\n IGNF_APAT86G: {\n towgs84: '143.6,197.82,74.05'\n },\n IGNF_TUBU69G: {\n towgs84: '237.17,171.61,-77.84'\n },\n IGNF_STPM50G: {\n towgs84: '11.363,424.148,373.13'\n },\n EPSG_4150: {\n towgs84: '674.374,15.056,405.346'\n },\n EPSG_4754: {\n towgs84: '-208.4058,-109.8777,-2.5764'\n },\n ESRI_104101: {\n towgs84: '374,150,588'\n },\n EPSG_4693: {\n towgs84: '0,-0.15,0.68'\n },\n EPSG_6207: {\n towgs84: '293.17,726.18,245.36'\n },\n EPSG_4153: {\n towgs84: '-133.63,-157.5,-158.62'\n },\n EPSG_4132: {\n towgs84: '-241.54,-163.64,396.06'\n },\n EPSG_4221: {\n towgs84: '-154.5,150.7,100.4'\n },\n EPSG_4266: {\n towgs84: '-80.7,-132.5,41.1'\n },\n EPSG_4193: {\n towgs84: '-70.9,-151.8,-41.4'\n },\n EPSG_5340: {\n towgs84: '-0.41,0.46,-0.35'\n },\n EPSG_4246: {\n towgs84: '-294.7,-200.1,525.5'\n },\n EPSG_4318: {\n towgs84: '-3.2,-5.7,2.8'\n },\n EPSG_4121: {\n towgs84: '-199.87,74.79,246.62'\n },\n EPSG_4223: {\n towgs84: '-260.1,5.5,432.2'\n },\n EPSG_4158: {\n towgs84: '-0.465,372.095,171.736'\n },\n EPSG_4285: {\n towgs84: '-128.16,-282.42,21.93'\n },\n EPSG_4613: {\n towgs84: '-404.78,685.68,45.47'\n },\n EPSG_4607: {\n towgs84: '195.671,332.517,274.607'\n },\n EPSG_4475: {\n towgs84: '-381.788,-57.501,-256.673'\n },\n EPSG_4208: {\n towgs84: '-157.84,308.54,-146.6'\n },\n EPSG_4743: {\n towgs84: '70.995,-335.916,262.898'\n },\n EPSG_4710: {\n towgs84: '-323.65,551.39,-491.22'\n },\n EPSG_7881: {\n towgs84: '-0.077,0.079,0.086'\n },\n EPSG_4682: {\n towgs84: '283.729,735.942,261.143'\n },\n EPSG_4739: {\n towgs84: '-156,-271,-189'\n },\n EPSG_4679: {\n towgs84: '-80.01,253.26,291.19'\n },\n EPSG_4750: {\n towgs84: '-56.263,16.136,-22.856'\n },\n EPSG_4644: {\n towgs84: '-10.18,-350.43,291.37'\n },\n EPSG_4695: {\n towgs84: '-103.746,-9.614,-255.95'\n },\n EPSG_4292: {\n towgs84: '-355,21,72'\n },\n EPSG_4302: {\n towgs84: '-61.702,284.488,472.052'\n },\n EPSG_4143: {\n towgs84: '-124.76,53,466.79'\n },\n EPSG_4606: {\n towgs84: '-153,153,307'\n },\n EPSG_4699: {\n towgs84: '-770.1,158.4,-498.2'\n },\n EPSG_4247: {\n towgs84: '-273.5,110.6,-357.9'\n },\n EPSG_4160: {\n towgs84: '8.88,184.86,106.69'\n },\n EPSG_4161: {\n towgs84: '-233.43,6.65,173.64'\n },\n EPSG_9251: {\n towgs84: '-9.5,122.9,138.2'\n },\n EPSG_9253: {\n towgs84: '-78.1,101.6,133.3'\n },\n EPSG_4297: {\n towgs84: '-198.383,-240.517,-107.909'\n },\n EPSG_4269: {\n towgs84: '0,0,0'\n },\n EPSG_4301: {\n towgs84: '-147,506,687'\n },\n EPSG_4618: {\n towgs84: '-59,-11,-52'\n },\n EPSG_4612: {\n towgs84: '0,0,0'\n },\n EPSG_4678: {\n towgs84: '44.585,-131.212,-39.544'\n },\n EPSG_4250: {\n towgs84: '-130,29,364'\n },\n EPSG_4144: {\n towgs84: '214,804,268'\n },\n EPSG_4147: {\n towgs84: '-17.51,-108.32,-62.39'\n },\n EPSG_4259: {\n towgs84: '-254.1,-5.36,-100.29'\n },\n EPSG_4164: {\n towgs84: '-76,-138,67'\n },\n EPSG_4211: {\n towgs84: '-378.873,676.002,-46.255'\n },\n EPSG_4182: {\n towgs84: '-422.651,-172.995,84.02'\n },\n EPSG_4224: {\n towgs84: '-143.87,243.37,-33.52'\n },\n EPSG_4225: {\n towgs84: '-205.57,168.77,-4.12'\n },\n EPSG_5527: {\n towgs84: '-67.35,3.88,-38.22'\n },\n EPSG_4752: {\n towgs84: '98,390,-22'\n },\n EPSG_4310: {\n towgs84: '-30,190,89'\n },\n EPSG_9248: {\n towgs84: '-192.26,65.72,132.08'\n },\n EPSG_4680: {\n towgs84: '124.5,-63.5,-281'\n },\n EPSG_4701: {\n towgs84: '-79.9,-158,-168.9'\n },\n EPSG_4706: {\n towgs84: '-146.21,112.63,4.05'\n },\n EPSG_4805: {\n towgs84: '682,-203,480'\n },\n EPSG_4201: {\n towgs84: '-165,-11,206'\n },\n EPSG_4210: {\n towgs84: '-157,-2,-299'\n },\n EPSG_4183: {\n towgs84: '-104,167,-38'\n },\n EPSG_4139: {\n towgs84: '11,72,-101'\n },\n EPSG_4668: {\n towgs84: '-86,-98,-119'\n },\n EPSG_4717: {\n towgs84: '-2,151,181'\n },\n EPSG_4732: {\n towgs84: '102,52,-38'\n },\n EPSG_4280: {\n towgs84: '-377,681,-50'\n },\n EPSG_4209: {\n towgs84: '-138,-105,-289'\n },\n EPSG_4261: {\n towgs84: '31,146,47'\n },\n EPSG_4658: {\n towgs84: '-73,46,-86'\n },\n EPSG_4721: {\n towgs84: '265.025,384.929,-194.046'\n },\n EPSG_4222: {\n towgs84: '-136,-108,-292'\n },\n EPSG_4601: {\n towgs84: '-255,-15,71'\n },\n EPSG_4602: {\n towgs84: '725,685,536'\n },\n EPSG_4603: {\n towgs84: '72,213.7,93'\n },\n EPSG_4605: {\n towgs84: '9,183,236'\n },\n EPSG_4621: {\n towgs84: '137,248,-430'\n },\n EPSG_4657: {\n towgs84: '-28,199,5'\n },\n EPSG_4316: {\n towgs84: '103.25,-100.4,-307.19'\n },\n EPSG_4642: {\n towgs84: '-13,-348,292'\n },\n EPSG_4698: {\n towgs84: '145,-187,103'\n },\n EPSG_4192: {\n towgs84: '-206.1,-174.7,-87.7'\n },\n EPSG_4311: {\n towgs84: '-265,120,-358'\n },\n EPSG_4135: {\n towgs84: '58,-283,-182'\n },\n ESRI_104138: {\n towgs84: '198,-226,-347'\n },\n EPSG_4245: {\n towgs84: '-11,851,5'\n },\n EPSG_4142: {\n towgs84: '-125,53,467'\n },\n EPSG_4213: {\n towgs84: '-106,-87,188'\n },\n EPSG_4253: {\n towgs84: '-133,-77,-51'\n },\n EPSG_4129: {\n towgs84: '-132,-110,-335'\n },\n EPSG_4713: {\n towgs84: '-77,-128,142'\n },\n EPSG_4239: {\n towgs84: '217,823,299'\n },\n EPSG_4146: {\n towgs84: '295,736,257'\n },\n EPSG_4155: {\n towgs84: '-83,37,124'\n },\n EPSG_4165: {\n towgs84: '-173,253,27'\n },\n EPSG_4672: {\n towgs84: '175,-38,113'\n },\n EPSG_4236: {\n towgs84: '-637,-549,-203'\n },\n EPSG_4251: {\n towgs84: '-90,40,88'\n },\n EPSG_4271: {\n towgs84: '-2,374,172'\n },\n EPSG_4175: {\n towgs84: '-88,4,101'\n },\n EPSG_4716: {\n towgs84: '298,-304,-375'\n },\n EPSG_4315: {\n towgs84: '-23,259,-9'\n },\n EPSG_4744: {\n towgs84: '-242.2,-144.9,370.3'\n },\n EPSG_4244: {\n towgs84: '-97,787,86'\n },\n EPSG_4293: {\n towgs84: '616,97,-251'\n },\n EPSG_4714: {\n towgs84: '-127,-769,472'\n },\n EPSG_4736: {\n towgs84: '260,12,-147'\n },\n EPSG_6883: {\n towgs84: '-235,-110,393'\n },\n EPSG_6894: {\n towgs84: '-63,176,185'\n },\n EPSG_4205: {\n towgs84: '-43,-163,45'\n },\n EPSG_4256: {\n towgs84: '41,-220,-134'\n },\n EPSG_4262: {\n towgs84: '639,405,60'\n },\n EPSG_4604: {\n towgs84: '174,359,365'\n },\n EPSG_4169: {\n towgs84: '-115,118,426'\n },\n EPSG_4620: {\n towgs84: '-106,-129,165'\n },\n EPSG_4184: {\n towgs84: '-203,141,53'\n },\n EPSG_4616: {\n towgs84: '-289,-124,60'\n },\n EPSG_9403: {\n towgs84: '-307,-92,127'\n },\n EPSG_4684: {\n towgs84: '-133,-321,50'\n },\n EPSG_4708: {\n towgs84: '-491,-22,435'\n },\n EPSG_4707: {\n towgs84: '114,-116,-333'\n },\n EPSG_4709: {\n towgs84: '145,75,-272'\n },\n EPSG_4712: {\n towgs84: '-205,107,53'\n },\n EPSG_4711: {\n towgs84: '124,-234,-25'\n },\n EPSG_4718: {\n towgs84: '230,-199,-752'\n },\n EPSG_4719: {\n towgs84: '211,147,111'\n },\n EPSG_4724: {\n towgs84: '208,-435,-229'\n },\n EPSG_4725: {\n towgs84: '189,-79,-202'\n },\n EPSG_4735: {\n towgs84: '647,1777,-1124'\n },\n EPSG_4722: {\n towgs84: '-794,119,-298'\n },\n EPSG_4728: {\n towgs84: '-307,-92,127'\n },\n EPSG_4734: {\n towgs84: '-632,438,-609'\n },\n EPSG_4727: {\n towgs84: '912,-58,1227'\n },\n EPSG_4729: {\n towgs84: '185,165,42'\n },\n EPSG_4730: {\n towgs84: '170,42,84'\n },\n EPSG_4733: {\n towgs84: '276,-57,149'\n },\n ESRI_37218: {\n towgs84: '230,-199,-752'\n },\n ESRI_37240: {\n towgs84: '-7,215,225'\n },\n ESRI_37221: {\n towgs84: '252,-209,-751'\n },\n ESRI_4305: {\n towgs84: '-123,-206,219'\n },\n ESRI_104139: {\n towgs84: '-73,-247,227'\n },\n EPSG_4748: {\n towgs84: '51,391,-36'\n },\n EPSG_4219: {\n towgs84: '-384,664,-48'\n },\n EPSG_4255: {\n towgs84: '-333,-222,114'\n },\n EPSG_4257: {\n towgs84: '-587.8,519.75,145.76'\n },\n EPSG_4646: {\n towgs84: '-963,510,-359'\n },\n EPSG_6881: {\n towgs84: '-24,-203,268'\n },\n EPSG_6882: {\n towgs84: '-183,-15,273'\n },\n EPSG_4715: {\n towgs84: '-104,-129,239'\n },\n IGNF_RGF93GDD: {\n towgs84: '0,0,0'\n },\n IGNF_RGM04GDD: {\n towgs84: '0,0,0'\n },\n IGNF_RGSPM06GDD: {\n towgs84: '0,0,0'\n },\n IGNF_RGTAAF07GDD: {\n towgs84: '0,0,0'\n },\n IGNF_RGFG95GDD: {\n towgs84: '0,0,0'\n },\n IGNF_RGNCG: {\n towgs84: '0,0,0'\n },\n IGNF_RGPFGDD: {\n towgs84: '0,0,0'\n },\n IGNF_ETRS89G: {\n towgs84: '0,0,0'\n },\n IGNF_RGR92GDD: {\n towgs84: '0,0,0'\n },\n EPSG_4173: {\n towgs84: '0,0,0'\n },\n EPSG_4180: {\n towgs84: '0,0,0'\n },\n EPSG_4619: {\n towgs84: '0,0,0'\n },\n EPSG_4667: {\n towgs84: '0,0,0'\n },\n EPSG_4075: {\n towgs84: '0,0,0'\n },\n EPSG_6706: {\n towgs84: '0,0,0'\n },\n EPSG_7798: {\n towgs84: '0,0,0'\n },\n EPSG_4661: {\n towgs84: '0,0,0'\n },\n EPSG_4669: {\n towgs84: '0,0,0'\n },\n EPSG_8685: {\n towgs84: '0,0,0'\n },\n EPSG_4151: {\n towgs84: '0,0,0'\n },\n EPSG_9702: {\n towgs84: '0,0,0'\n },\n EPSG_4758: {\n towgs84: '0,0,0'\n },\n EPSG_4761: {\n towgs84: '0,0,0'\n },\n EPSG_4765: {\n towgs84: '0,0,0'\n },\n EPSG_8997: {\n towgs84: '0,0,0'\n },\n EPSG_4023: {\n towgs84: '0,0,0'\n },\n EPSG_4670: {\n towgs84: '0,0,0'\n },\n EPSG_4694: {\n towgs84: '0,0,0'\n },\n EPSG_4148: {\n towgs84: '0,0,0'\n },\n EPSG_4163: {\n towgs84: '0,0,0'\n },\n EPSG_4167: {\n towgs84: '0,0,0'\n },\n EPSG_4189: {\n towgs84: '0,0,0'\n },\n EPSG_4190: {\n towgs84: '0,0,0'\n },\n EPSG_4176: {\n towgs84: '0,0,0'\n },\n EPSG_4659: {\n towgs84: '0,0,0'\n },\n EPSG_3824: {\n towgs84: '0,0,0'\n },\n EPSG_3889: {\n towgs84: '0,0,0'\n },\n EPSG_4046: {\n towgs84: '0,0,0'\n },\n EPSG_4081: {\n towgs84: '0,0,0'\n },\n EPSG_4558: {\n towgs84: '0,0,0'\n },\n EPSG_4483: {\n towgs84: '0,0,0'\n },\n EPSG_5013: {\n towgs84: '0,0,0'\n },\n EPSG_5264: {\n towgs84: '0,0,0'\n },\n EPSG_5324: {\n towgs84: '0,0,0'\n },\n EPSG_5354: {\n towgs84: '0,0,0'\n },\n EPSG_5371: {\n towgs84: '0,0,0'\n },\n EPSG_5373: {\n towgs84: '0,0,0'\n },\n EPSG_5381: {\n towgs84: '0,0,0'\n },\n EPSG_5393: {\n towgs84: '0,0,0'\n },\n EPSG_5489: {\n towgs84: '0,0,0'\n },\n EPSG_5593: {\n towgs84: '0,0,0'\n },\n EPSG_6135: {\n towgs84: '0,0,0'\n },\n EPSG_6365: {\n towgs84: '0,0,0'\n },\n EPSG_5246: {\n towgs84: '0,0,0'\n },\n EPSG_7886: {\n towgs84: '0,0,0'\n },\n EPSG_8431: {\n towgs84: '0,0,0'\n },\n EPSG_8427: {\n towgs84: '0,0,0'\n },\n EPSG_8699: {\n towgs84: '0,0,0'\n },\n EPSG_8818: {\n towgs84: '0,0,0'\n },\n EPSG_4757: {\n towgs84: '0,0,0'\n },\n EPSG_9140: {\n towgs84: '0,0,0'\n },\n EPSG_8086: {\n towgs84: '0,0,0'\n },\n EPSG_4686: {\n towgs84: '0,0,0'\n },\n EPSG_4737: {\n towgs84: '0,0,0'\n },\n EPSG_4702: {\n towgs84: '0,0,0'\n },\n EPSG_4747: {\n towgs84: '0,0,0'\n },\n EPSG_4749: {\n towgs84: '0,0,0'\n },\n EPSG_4674: {\n towgs84: '0,0,0'\n },\n EPSG_4755: {\n towgs84: '0,0,0'\n },\n EPSG_4759: {\n towgs84: '0,0,0'\n },\n EPSG_4762: {\n towgs84: '0,0,0'\n },\n EPSG_4763: {\n towgs84: '0,0,0'\n },\n EPSG_4764: {\n towgs84: '0,0,0'\n },\n EPSG_4166: {\n towgs84: '0,0,0'\n },\n EPSG_4170: {\n towgs84: '0,0,0'\n },\n EPSG_5546: {\n towgs84: '0,0,0'\n },\n EPSG_7844: {\n towgs84: '0,0,0'\n },\n EPSG_4818: {\n towgs84: '589,76,480'\n }\n};\n\nfor (var key in datums) {\n var datum = datums[key];\n if (!datum.datumName) {\n continue;\n }\n datums[datum.datumName] = datum;\n}\n\nexport default datums;\n","import { PJD_3PARAM, PJD_7PARAM, PJD_GRIDSHIFT, PJD_WGS84, PJD_NODATUM, SEC_TO_RAD } from './constants/values';\n\nfunction datum(datumCode, datum_params, a, b, es, ep2, nadgrids) {\n var out = {};\n\n if (datumCode === undefined || datumCode === 'none') {\n out.datum_type = PJD_NODATUM;\n } else {\n out.datum_type = PJD_WGS84;\n }\n\n if (datum_params) {\n out.datum_params = datum_params.map(parseFloat);\n if (out.datum_params[0] !== 0 || out.datum_params[1] !== 0 || out.datum_params[2] !== 0) {\n out.datum_type = PJD_3PARAM;\n }\n if (out.datum_params.length > 3) {\n if (out.datum_params[3] !== 0 || out.datum_params[4] !== 0 || out.datum_params[5] !== 0 || out.datum_params[6] !== 0) {\n out.datum_type = PJD_7PARAM;\n out.datum_params[3] *= SEC_TO_RAD;\n out.datum_params[4] *= SEC_TO_RAD;\n out.datum_params[5] *= SEC_TO_RAD;\n out.datum_params[6] = (out.datum_params[6] / 1000000.0) + 1.0;\n }\n }\n }\n\n if (nadgrids) {\n out.datum_type = PJD_GRIDSHIFT;\n out.grids = nadgrids;\n }\n out.a = a; // datum object also uses these values\n out.b = b;\n out.es = es;\n out.ep2 = ep2;\n return out;\n}\n\nexport default datum;\n","/**\n * Resources for details of NTv2 file formats:\n * - https://web.archive.org/web/20140127204822if_/http://www.mgs.gov.on.ca:80/stdprodconsume/groups/content/@mgs/@iandit/documents/resourcelist/stel02_047447.pdf\n * - http://mimaka.com/help/gs/html/004_NTV2%20Data%20Format.htm\n */\n\n/**\n * @typedef {Object} NadgridInfo\n * @property {string} name The name of the NAD grid or 'null' if not specified.\n * @property {boolean} mandatory Indicates if the grid is mandatory (true) or optional (false).\n * @property {*} grid The loaded NAD grid object, or null if not loaded or not applicable.\n * @property {boolean} isNull True if the grid is explicitly 'null', otherwise false.\n */\n\n/**\n * @typedef {Object} NTV2GridOptions\n * @property {boolean} [includeErrorFields=true] Whether to include error fields in the subgrids.\n */\n\n/**\n * @typedef {Object} NadgridHeader\n * @property {number} [nFields] Number of fields in the header.\n * @property {number} [nSubgridFields] Number of fields in each subgrid header.\n * @property {number} nSubgrids Number of subgrids in the file.\n * @property {string} [shiftType] Type of shift (e.g., \"SECONDS\").\n * @property {number} [fromSemiMajorAxis] Source ellipsoid semi-major axis.\n * @property {number} [fromSemiMinorAxis] Source ellipsoid semi-minor axis.\n * @property {number} [toSemiMajorAxis] Target ellipsoid semi-major axis.\n * @property {number} [toSemiMinorAxis] Target ellipsoid semi-minor axis.\n */\n\n/**\n * @typedef {Object} Subgrid\n * @property {Array<number>} ll Lower left corner of the grid in radians [longitude, latitude].\n * @property {Array<number>} del Grid spacing in radians [longitude interval, latitude interval].\n * @property {Array<number>} lim Number of columns in the grid [longitude columns, latitude columns].\n * @property {number} [count] Total number of grid nodes.\n * @property {Array} cvs Mapped node values for the grid.\n */\n\n/** @typedef {{header: NadgridHeader, subgrids: Array<Subgrid>}} NADGrid */\n\n/**\n * @typedef {Object} GeoTIFF\n * @property {() => Promise<number>} getImageCount - Returns the number of images in the GeoTIFF.\n * @property {(index: number) => Promise<GeoTIFFImage>} getImage - Returns a GeoTIFFImage for the given index.\n */\n\n/**\n * @typedef {Object} GeoTIFFImage\n * @property {() => number} getWidth - Returns the width of the image.\n * @property {() => number} getHeight - Returns the height of the image.\n * @property {() => number[]} getBoundingBox - Returns the bounding box as [minX, minY, maxX, maxY] in degrees.\n * @property {() => Promise<ArrayLike<ArrayLike<number>>>} readRasters - Returns the raster data as an array of bands.\n * @property {Object} fileDirectory - The file directory object containing metadata.\n * @property {Object} fileDirectory.ModelPixelScale - The pixel scale array [scaleX, scaleY, scaleZ] in degrees.\n */\n\nvar loadedNadgrids = {};\n\n/**\n * @overload\n * @param {string} key - The key to associate with the loaded grid.\n * @param {ArrayBuffer} data - The NTv2 grid data as an ArrayBuffer.\n * @param {NTV2GridOptions} [options] - Optional parameters for loading the grid.\n * @returns {NADGrid} - The loaded NAD grid information.\n */\n/**\n * @overload\n * @param {string} key - The key to associate with the loaded grid.\n * @param {GeoTIFF} data - The GeoTIFF instance to read the grid from.\n * @returns {{ready: Promise<NADGrid>}} - A promise that resolves to the loaded grid information.\n */\n/**\n * Load either a NTv2 file (.gsb) or a Geotiff (.tif) to a key that can be used in a proj string like +nadgrids=<key>. Pass the NTv2 file\n * as an ArrayBuffer. Pass Geotiff as a GeoTIFF instance from the geotiff.js library.\n * @param {string} key - The key to associate with the loaded grid.\n * @param {ArrayBuffer|GeoTIFF} data The data to load, either an ArrayBuffer for NTv2 or a GeoTIFF instance.\n * @param {NTV2GridOptions} [options] Optional parameters.\n * @returns {{ready: Promise<NADGrid>}|NADGrid} - A promise that resolves to the loaded grid information.\n */\nexport default function nadgrid(key, data, options) {\n if (data instanceof ArrayBuffer) {\n return readNTV2Grid(key, data, options);\n }\n return { ready: readGeotiffGrid(key, data) };\n}\n\n/**\n * @param {string} key The key to associate with the loaded grid.\n * @param {ArrayBuffer} data The NTv2 grid data as an ArrayBuffer.\n * @param {NTV2GridOptions} [options] Optional parameters for loading the grid.\n * @returns {NADGrid} The loaded NAD grid information.\n */\nfunction readNTV2Grid(key, data, options) {\n var includeErrorFields = true;\n if (options !== undefined && options.includeErrorFields === false) {\n includeErrorFields = false;\n }\n var view = new DataView(data);\n var isLittleEndian = detectLittleEndian(view);\n var header = readHeader(view, isLittleEndian);\n var subgrids = readSubgrids(view, header, isLittleEndian, includeErrorFields);\n var nadgrid = { header: header, subgrids: subgrids };\n loadedNadgrids[key] = nadgrid;\n return nadgrid;\n}\n\n/**\n * @param {string} key The key to associate with the loaded grid.\n * @param {GeoTIFF} tiff The GeoTIFF instance to read the grid from.\n * @returns {Promise<NADGrid>} A promise that resolves to the loaded NAD grid information.\n */\nasync function readGeotiffGrid(key, tiff) {\n var subgrids = [];\n var subGridCount = await tiff.getImageCount();\n // proj produced tiff grid shift files appear to organize lower res subgrids first, higher res/ child subgrids last.\n for (var subgridIndex = subGridCount - 1; subgridIndex >= 0; subgridIndex--) {\n var image = await tiff.getImage(subgridIndex);\n\n var rasters = await image.readRasters();\n var data = rasters;\n var lim = [image.getWidth(), image.getHeight()];\n var imageBBoxRadians = image.getBoundingBox().map(degreesToRadians);\n var del = [image.fileDirectory.ModelPixelScale[0], image.fileDirectory.ModelPixelScale[1]].map(degreesToRadians);\n\n var maxX = imageBBoxRadians[0] + (lim[0] - 1) * del[0];\n var minY = imageBBoxRadians[3] - (lim[1] - 1) * del[1];\n\n var latitudeOffsetBand = data[0];\n var longitudeOffsetBand = data[1];\n var nodes = [];\n\n for (let i = lim[1] - 1; i >= 0; i--) {\n for (let j = lim[0] - 1; j >= 0; j--) {\n var index = i * lim[0] + j;\n nodes.push([-secondsToRadians(longitudeOffsetBand[index]), secondsToRadians(latitudeOffsetBand[index])]);\n }\n }\n\n subgrids.push({\n del: del,\n lim: lim,\n ll: [-maxX, minY],\n cvs: nodes\n });\n }\n\n var tifGrid = {\n header: {\n nSubgrids: subGridCount\n },\n subgrids: subgrids\n };\n loadedNadgrids[key] = tifGrid;\n return tifGrid;\n};\n\n/**\n * Given a proj4 value for nadgrids, return an array of loaded grids\n * @param {string} nadgrids A comma-separated list of grid names, optionally prefixed with '@' to indicate optional grids.\n * @returns\n */\nexport function getNadgrids(nadgrids) {\n // Format details: http://proj.maptools.org/gen_parms.html\n if (nadgrids === undefined) {\n return null;\n }\n var grids = nadgrids.split(',');\n return grids.map(parseNadgridString);\n}\n\n/**\n * @param {string} value The nadgrid string to get information for.\n * @returns {NadgridInfo|null} An object with grid information, or null if the input is empty.\n */\nfunction parseNadgridString(value) {\n if (value.length === 0) {\n return null;\n }\n var optional = value[0] === '@';\n if (optional) {\n value = value.slice(1);\n }\n if (value === 'null') {\n return { name: 'null', mandatory: !optional, grid: null, isNull: true };\n }\n return {\n name: value,\n mandatory: !optional,\n grid: loadedNadgrids[value] || null,\n isNull: false\n };\n}\n\nfunction degreesToRadians(degrees) {\n return (degrees) * Math.PI / 180;\n}\n\nfunction secondsToRadians(seconds) {\n return (seconds / 3600) * Math.PI / 180;\n}\n\nfunction detectLittleEndian(view) {\n var nFields = view.getInt32(8, false);\n if (nFields === 11) {\n return false;\n }\n nFields = view.getInt32(8, true);\n if (nFields !== 11) {\n console.warn('Failed to detect nadgrid endian-ness, defaulting to little-endian');\n }\n return true;\n}\n\nfunction readHeader(view, isLittleEndian) {\n return {\n nFields: view.getInt32(8, isLittleEndian),\n nSubgridFields: view.getInt32(24, isLittleEndian),\n nSubgrids: view.getInt32(40, isLittleEndian),\n shiftType: decodeString(view, 56, 56 + 8).trim(),\n fromSemiMajorAxis: view.getFloat64(120, isLittleEndian),\n fromSemiMinorAxis: view.getFloat64(136, isLittleEndian),\n toSemiMajorAxis: view.getFloat64(152, isLittleEndian),\n toSemiMinorAxis: view.getFloat64(168, isLittleEndian)\n };\n}\n\nfunction decodeString(view, start, end) {\n return String.fromCharCode.apply(null, new Uint8Array(view.buffer.slice(start, end)));\n}\n\nfunction readSubgrids(view, header, isLittleEndian, includeErrorFields) {\n var gridOffset = 176;\n var grids = [];\n for (var i = 0; i < header.nSubgrids; i++) {\n var subHeader = readGridHeader(view, gridOffset, isLittleEndian);\n var nodes = readGridNodes(view, gridOffset, subHeader, isLittleEndian, includeErrorFields);\n var lngColumnCount = Math.round(\n 1 + (subHeader.upperLongitude - subHeader.lowerLongitude) / subHeader.longitudeInterval);\n var latColumnCount = Math.round(\n 1 + (subHeader.upperLatitude - subHeader.lowerLatitude) / subHeader.latitudeInterval);\n // Proj4 operates on radians whereas the coordinates are in seconds in the grid\n grids.push({\n ll: [secondsToRadians(subHeader.lowerLongitude), secondsToRadians(subHeader.lowerLatitude)],\n del: [secondsToRadians(subHeader.longitudeInterval), secondsToRadians(subHeader.latitudeInterval)],\n lim: [lngColumnCount, latColumnCount],\n count: subHeader.gridNodeCount,\n cvs: mapNodes(nodes)\n });\n var rowSize = 16;\n if (includeErrorFields === false) {\n rowSize = 8;\n }\n gridOffset += 176 + subHeader.gridNodeCount * rowSize;\n }\n return grids;\n}\n\n/**\n * @param {*} nodes\n * @returns Array<Array<number>>\n */\nfunction mapNodes(nodes) {\n return nodes.map(function (r) {\n return [secondsToRadians(r.longitudeShift), secondsToRadians(r.latitudeShift)];\n });\n}\n\nfunction readGridHeader(view, offset, isLittleEndian) {\n return {\n name: decodeString(view, offset + 8, offset + 16).trim(),\n parent: decodeString(view, offset + 24, offset + 24 + 8).trim(),\n lowerLatitude: view.getFloat64(offset + 72, isLittleEndian),\n upperLatitude: view.getFloat64(offset + 88, isLittleEndian),\n lowerLongitude: view.getFloat64(offset + 104, isLittleEndian),\n upperLongitude: view.getFloat64(offset + 120, isLittleEndian),\n latitudeInterval: view.getFloat64(offset + 136, isLittleEndian),\n longitudeInterval: view.getFloat64(offset + 152, isLittleEndian),\n gridNodeCount: view.getInt32(offset + 168, isLittleEndian)\n };\n}\n\nfunction readGridNodes(view, offset, gridHeader, isLittleEndian, includeErrorFields) {\n var nodesOffset = offset + 176;\n var gridRecordLength = 16;\n\n if (includeErrorFields === false) {\n gridRecordLength = 8;\n }\n\n var gridShiftRecords = [];\n for (var i = 0; i < gridHeader.gridNodeCount; i++) {\n var record = {\n latitudeShift: view.getFloat32(nodesOffset + i * gridRecordLength, isLittleEndian),\n longitudeShift: view.getFloat32(nodesOffset + i * gridRecordLength + 4, isLittleEndian)\n\n };\n\n if (includeErrorFields !== false) {\n record.latitudeAccuracy = view.getFloat32(nodesOffset + i * gridRecordLength + 8, isLittleEndian);\n record.longitudeAccuracy = view.getFloat32(nodesOffset + i * gridRecordLength + 12, isLittleEndian);\n }\n\n gridShiftRecords.push(record);\n }\n return gridShiftRecords;\n}\n","import parseCode from './parseCode';\nimport extend from './extend';\nimport projections from './projections';\nimport { sphere as dc_sphere, eccentricity as dc_eccentricity } from './deriveConstants';\nimport Datum from './constants/Datum';\nimport datum from './datum';\nimport match from './match';\nimport { getNadgrids } from './nadgrid';\n\n/**\n * @typedef {Object} DatumDefinition\n * @property {number} datum_type - The type of datum.\n * @property {number} a - Semi-major axis of the ellipsoid.\n * @property {number} b - Semi-minor axis of the ellipsoid.\n * @property {number} es - Eccentricity squared of the ellipsoid.\n * @property {number} ep2 - Second eccentricity squared of the ellipsoid.\n */\n\n/**\n * @param {string | import('./core').PROJJSONDefinition | import('./defs').ProjectionDefinition} srsCode\n * @param {(errorMessage?: string, instance?: Projection) => void} [callback]\n */\nfunction Projection(srsCode, callback) {\n if (!(this instanceof Projection)) {\n return new Projection(srsCode);\n }\n /** @type {<T extends import('./core').TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} */\n this.forward = null;\n /** @type {<T extends import('./core').TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} */\n this.inverse = null;\n /** @type {function(): void} */\n this.init = null;\n /** @type {string} */\n this.name;\n /** @type {Array<string>} */\n this.names = null;\n /** @type {string} */\n this.title;\n callback = callback || function (error) {\n if (error) {\n throw error;\n }\n };\n var json = parseCode(srsCode);\n if (typeof json !== 'object') {\n callback('Could not parse to valid json: ' + srsCode);\n return;\n }\n var ourProj = Projection.projections.get(json.projName);\n if (!ourProj) {\n callback('Could not get projection name from: ' + srsCode);\n return;\n }\n if (json.datumCode && json.datumCode !== 'none') {\n var datumDef = match(Datum, json.datumCode);\n if (datumDef) {\n json.datum_params = json.datum_params || (datumDef.towgs84 ? datumDef.towgs84.split(',') : null);\n json.ellps = datumDef.ellipse;\n json.datumName = datumDef.datumName ? datumDef.datumName : json.datumCode;\n }\n }\n json.k0 = json.k0 || 1.0;\n json.axis = json.axis || 'enu';\n json.ellps = json.ellps || 'wgs84';\n json.lat1 = json.lat1 || json.lat0; // Lambert_Conformal_Conic_1SP, for example, needs this\n\n var sphere_ = dc_sphere(json.a, json.b, json.rf, json.ellps, json.sphere);\n var ecc = dc_eccentricity(sphere_.a, sphere_.b, sphere_.rf, json.R_A);\n var nadgrids = getNadgrids(json.nadgrids);\n /** @type {DatumDefinition} */\n var datumObj = json.datum || datum(json.datumCode, json.datum_params, sphere_.a, sphere_.b, ecc.es, ecc.ep2,\n nadgrids);\n\n extend(this, json); // transfer everything over from the projection because we don't know what we'll need\n extend(this, ourProj); // transfer all the methods from the projection\n\n // copy the 4 things over we calculated in deriveConstants.sphere\n this.a = sphere_.a;\n this.b = sphere_.b;\n this.rf = sphere_.rf;\n this.sphere = sphere_.sphere;\n\n // copy the 3 things we calculated in deriveConstants.eccentricity\n this.es = ecc.es;\n this.e = ecc.e;\n this.ep2 = ecc.ep2;\n\n // add in the datum object\n this.datum = datumObj;\n\n // init the projection\n if ('init' in this && typeof this.init === 'function') {\n this.init();\n }\n\n // legecy callback from back in the day when it went to spatialreference.org\n callback(null, this);\n}\nProjection.projections = projections;\nProjection.projections.start();\nexport default Projection;\n","'use strict';\nimport { PJD_3PARAM, PJD_7PARAM, HALF_PI } from './constants/values';\nexport function compareDatums(source, dest) {\n if (source.datum_type !== dest.datum_type) {\n return false; // false, datums are not equal\n } else if (source.a !== dest.a || Math.abs(source.es - dest.es) > 0.000000000050) {\n // the tolerance for es is to ensure that GRS80 and WGS84\n // are considered identical\n return false;\n } else if (source.datum_type === PJD_3PARAM) {\n return (source.datum_params[0] === dest.datum_params[0] && source.datum_params[1] === dest.datum_params[1] && source.datum_params[2] === dest.datum_params[2]);\n } else if (source.datum_type === PJD_7PARAM) {\n return (source.datum_params[0] === dest.datum_params[0] && source.datum_params[1] === dest.datum_params[1] && source.datum_params[2] === dest.datum_params[2] && source.datum_params[3] === dest.datum_params[3] && source.datum_params[4] === dest.datum_params[4] && source.datum_params[5] === dest.datum_params[5] && source.datum_params[6] === dest.datum_params[6]);\n } else {\n return true; // datums are equal\n }\n} // cs_compare_datums()\n\n/*\n * The function Convert_Geodetic_To_Geocentric converts geodetic coordinates\n * (latitude, longitude, and height) to geocentric coordinates (X, Y, Z),\n * according to the current ellipsoid parameters.\n *\n * Latitude : Geodetic latitude in radians (input)\n * Longitude : Geodetic longitude in radians (input)\n * Height : Geodetic height, in meters (input)\n * X : Calculated Geocentric X coordinate, in meters (output)\n * Y : Calculated Geocentric Y coordinate, in meters (output)\n * Z : Calculated Geocentric Z coordinate, in meters (output)\n *\n */\nexport function geodeticToGeocentric(p, es, a) {\n var Longitude = p.x;\n var Latitude = p.y;\n var Height = p.z ? p.z : 0; // Z value not always supplied\n\n var Rn; /* Earth radius at location */\n var Sin_Lat; /* Math.sin(Latitude) */\n var Sin2_Lat; /* Square of Math.sin(Latitude) */\n var Cos_Lat; /* Math.cos(Latitude) */\n\n /*\n ** Don't blow up if Latitude is just a little out of the value\n ** range as it may just be a rounding issue. Also removed longitude\n ** test, it should be wrapped by Math.cos() and Math.sin(). NFW for PROJ.4, Sep/2001.\n */\n if (Latitude < -HALF_PI && Latitude > -1.001 * HALF_PI) {\n Latitude = -HALF_PI;\n } else if (Latitude > HALF_PI && Latitude < 1.001 * HALF_PI) {\n Latitude = HALF_PI;\n } else if (Latitude < -HALF_PI) {\n /* Latitude out of range */\n // ..reportError('geocent:lat out of range:' + Latitude);\n return { x: -Infinity, y: -Infinity, z: p.z };\n } else if (Latitude > HALF_PI) {\n /* Latitude out of range */\n return { x: Infinity, y: Infinity, z: p.z };\n }\n\n if (Longitude > Math.PI) {\n Longitude -= (2 * Math.PI);\n }\n Sin_Lat = Math.sin(Latitude);\n Cos_Lat = Math.cos(Latitude);\n Sin2_Lat = Sin_Lat * Sin_Lat;\n Rn = a / (Math.sqrt(1.0e0 - es * Sin2_Lat));\n return {\n x: (Rn + Height) * Cos_Lat * Math.cos(Longitude),\n y: (Rn + Height) * Cos_Lat * Math.sin(Longitude),\n z: ((Rn * (1 - es)) + Height) * Sin_Lat\n };\n} // cs_geodetic_to_geocentric()\n\nexport function geocentricToGeodetic(p, es, a, b) {\n /* local defintions and variables */\n /* end-criterium of loop, accuracy of sin(Latitude) */\n var genau = 1e-12;\n var genau2 = (genau * genau);\n var maxiter = 30;\n\n var P; /* distance between semi-minor axis and location */\n var RR; /* distance between center and location */\n var CT; /* sin of geocentric latitude */\n var ST; /* cos of geocentric latitude */\n var RX;\n var RK;\n var RN; /* Earth radius at location */\n var CPHI0; /* cos of start or old geodetic latitude in iterations */\n var SPHI0; /* sin of start or old geodetic latitude in iterations */\n var CPHI; /* cos of searched geodetic latitude */\n var SPHI; /* sin of searched geodetic latitude */\n var SDPHI; /* end-criterium: addition-theorem of sin(Latitude(iter)-Latitude(iter-1)) */\n var iter; /* # of continous iteration, max. 30 is always enough (s.a.) */\n\n var X = p.x;\n var Y = p.y;\n var Z = p.z ? p.z : 0.0; // Z value not always supplied\n var Longitude;\n var Latitude;\n var Height;\n\n P = Math.sqrt(X * X + Y * Y);\n RR = Math.sqrt(X * X + Y * Y + Z * Z);\n\n /* special cases for latitude and longitude */\n if (P / a < genau) {\n /* special case, if P=0. (X=0., Y=0.) */\n Longitude = 0.0;\n\n /* if (X,Y,Z)=(0.,0.,0.) then Height becomes semi-minor axis\n * of ellipsoid (=center of mass), Latitude becomes PI/2 */\n if (RR / a < genau) {\n Latitude = HALF_PI;\n Height = -b;\n return {\n x: p.x,\n y: p.y,\n z: p.z\n };\n }\n } else {\n /* ellipsoidal (geodetic) longitude\n * interval: -PI < Longitude <= +PI */\n Longitude = Math.atan2(Y, X);\n }\n\n /* --------------------------------------------------------------\n * Following iterative algorithm was developped by\n * \"Institut for Erdmessung\", University of Hannover, July 1988.\n * Internet: www.ife.uni-hannover.de\n * Iterative computation of CPHI,SPHI and Height.\n * Iteration of CPHI and SPHI to 10**-12 radian resp.\n * 2*10**-7 arcsec.\n * --------------------------------------------------------------\n */\n CT = Z / RR;\n ST = P / RR;\n RX = 1.0 / Math.sqrt(1.0 - es * (2.0 - es) * ST * ST);\n CPHI0 = ST * (1.0 - es) * RX;\n SPHI0 = CT * RX;\n iter = 0;\n\n /* loop to find sin(Latitude) resp. Latitude\n * until |sin(Latitude(iter)-Latitude(iter-1))| < genau */\n do {\n iter++;\n RN = a / Math.sqrt(1.0 - es * SPHI0 * SPHI0);\n\n /* ellipsoidal (geodetic) height */\n Height = P * CPHI0 + Z * SPHI0 - RN * (1.0 - es * SPHI0 * SPHI0);\n\n RK = es * RN / (RN + Height);\n RX = 1.0 / Math.sqrt(1.0 - RK * (2.0 - RK) * ST * ST);\n CPHI = ST * (1.0 - RK) * RX;\n SPHI = CT * RX;\n SDPHI = SPHI * CPHI0 - CPHI * SPHI0;\n CPHI0 = CPHI;\n SPHI0 = SPHI;\n }\n while (SDPHI * SDPHI > genau2 && iter < maxiter);\n\n /* ellipsoidal (geodetic) latitude */\n Latitude = Math.atan(SPHI / Math.abs(CPHI));\n return {\n x: Longitude,\n y: Latitude,\n z: Height\n };\n} // cs_geocentric_to_geodetic()\n\n/****************************************************************/\n// pj_geocentic_to_wgs84( p )\n// p = point to transform in geocentric coordinates (x,y,z)\n\n/** point object, nothing fancy, just allows values to be\n passed back and forth by reference rather than by value.\n Other point classes may be used as long as they have\n x and y properties, which will get modified in the transform method.\n*/\nexport function geocentricToWgs84(p, datum_type, datum_params) {\n if (datum_type === PJD_3PARAM) {\n // if( x[io] === HUGE_VAL )\n // continue;\n return {\n x: p.x + datum_params[0],\n y: p.y + datum_params[1],\n z: p.z + datum_params[2]\n };\n } else if (datum_type === PJD_7PARAM) {\n var Dx_BF = datum_params[0];\n var Dy_BF = datum_params[1];\n var Dz_BF = datum_params[2];\n var Rx_BF = datum_params[3];\n var Ry_BF = datum_params[4];\n var Rz_BF = datum_params[5];\n var M_BF = datum_params[6];\n // if( x[io] === HUGE_VAL )\n // continue;\n return {\n x: M_BF * (p.x - Rz_BF * p.y + Ry_BF * p.z) + Dx_BF,\n y: M_BF * (Rz_BF * p.x + p.y - Rx_BF * p.z) + Dy_BF,\n z: M_BF * (-Ry_BF * p.x + Rx_BF * p.y + p.z) + Dz_BF\n };\n }\n} // cs_geocentric_to_wgs84\n\n/****************************************************************/\n// pj_geocentic_from_wgs84()\n// coordinate system definition,\n// point to transform in geocentric coordinates (x,y,z)\nexport function geocentricFromWgs84(p, datum_type, datum_params) {\n if (datum_type === PJD_3PARAM) {\n // if( x[io] === HUGE_VAL )\n // continue;\n return {\n x: p.x - datum_params[0],\n y: p.y - datum_params[1],\n z: p.z - datum_params[2]\n };\n } else if (datum_type === PJD_7PARAM) {\n var Dx_BF = datum_params[0];\n var Dy_BF = datum_params[1];\n var Dz_BF = datum_params[2];\n var Rx_BF = datum_params[3];\n var Ry_BF = datum_params[4];\n var Rz_BF = datum_params[5];\n var M_BF = datum_params[6];\n var x_tmp = (p.x - Dx_BF) / M_BF;\n var y_tmp = (p.y - Dy_BF) / M_BF;\n var z_tmp = (p.z - Dz_BF) / M_BF;\n // if( x[io] === HUGE_VAL )\n // continue;\n\n return {\n x: x_tmp + Rz_BF * y_tmp - Ry_BF * z_tmp,\n y: -Rz_BF * x_tmp + y_tmp + Rx_BF * z_tmp,\n z: Ry_BF * x_tmp - Rx_BF * y_tmp + z_tmp\n };\n } // cs_geocentric_from_wgs84()\n}\n","import {\n PJD_3PARAM,\n PJD_7PARAM,\n PJD_GRIDSHIFT,\n PJD_NODATUM,\n R2D,\n SRS_WGS84_ESQUARED,\n SRS_WGS84_SEMIMAJOR, SRS_WGS84_SEMIMINOR\n} from './constants/values';\n\nimport { geodeticToGeocentric, geocentricToGeodetic, geocentricToWgs84, geocentricFromWgs84, compareDatums } from './datumUtils';\nimport adjust_lon from './common/adjust_lon';\nfunction checkParams(type) {\n return (type === PJD_3PARAM || type === PJD_7PARAM);\n}\n\nexport default function (source, dest, point) {\n // Short cut if the datums are identical.\n if (compareDatums(source, dest)) {\n return point; // in this case, zero is sucess,\n // whereas cs_compare_datums returns 1 to indicate TRUE\n // confusing, should fix this\n }\n\n // Explicitly skip datum transform by setting 'datum=none' as parameter for either source or dest\n if (source.datum_type === PJD_NODATUM || dest.datum_type === PJD_NODATUM) {\n return point;\n }\n\n // If this datum requires grid shifts, then apply it to geodetic coordinates.\n var source_a = source.a;\n var source_es = source.es;\n if (source.datum_type === PJD_GRIDSHIFT) {\n var gridShiftCode = applyGridShift(source, false, point);\n if (gridShiftCode !== 0) {\n return undefined;\n }\n source_a = SRS_WGS84_SEMIMAJOR;\n source_es = SRS_WGS84_ESQUARED;\n }\n\n var dest_a = dest.a;\n var dest_b = dest.b;\n var dest_es = dest.es;\n if (dest.datum_type === PJD_GRIDSHIFT) {\n dest_a = SRS_WGS84_SEMIMAJOR;\n dest_b = SRS_WGS84_SEMIMINOR;\n dest_es = SRS_WGS84_ESQUARED;\n }\n\n // Do we need to go through geocentric coordinates?\n if (source_es === dest_es && source_a === dest_a && !checkParams(source.datum_type) && !checkParams(dest.datum_type)) {\n return point;\n }\n\n // Convert to geocentric coordinates.\n point = geodeticToGeocentric(point, source_es, source_a);\n // Convert between datums\n if (checkParams(source.datum_type)) {\n point = geocentricToWgs84(point, source.datum_type, source.datum_params);\n }\n if (checkParams(dest.datum_type)) {\n point = geocentricFromWgs84(point, dest.datum_type, dest.datum_params);\n }\n point = geocentricToGeodetic(point, dest_es, dest_a, dest_b);\n\n if (dest.datum_type === PJD_GRIDSHIFT) {\n var destGridShiftResult = applyGridShift(dest, true, point);\n if (destGridShiftResult !== 0) {\n return undefined;\n }\n }\n\n return point;\n}\n\nexport function applyGridShift(source, inverse, point) {\n if (source.grids === null || source.grids.length === 0) {\n console.log('Grid shift grids not found');\n return -1;\n }\n var input = { x: -point.x, y: point.y };\n var output = { x: Number.NaN, y: Number.NaN };\n var attemptedGrids = [];\n outer:\n for (var i = 0; i < source.grids.length; i++) {\n var grid = source.grids[i];\n attemptedGrids.push(grid.name);\n if (grid.isNull) {\n output = input;\n break;\n }\n if (grid.grid === null) {\n if (grid.mandatory) {\n console.log('Unable to find mandatory grid \\'' + grid.name + '\\'');\n return -1;\n }\n continue;\n }\n var subgrids = grid.grid.subgrids;\n for (var j = 0, jj = subgrids.length; j < jj; j++) {\n var subgrid = subgrids[j];\n // skip tables that don't match our point at all\n var epsilon = (Math.abs(subgrid.del[1]) + Math.abs(subgrid.del[0])) / 10000.0;\n var minX = subgrid.ll[0] - epsilon;\n var minY = subgrid.ll[1] - epsilon;\n var maxX = subgrid.ll[0] + (subgrid.lim[0] - 1) * subgrid.del[0] + epsilon;\n var maxY = subgrid.ll[1] + (subgrid.lim[1] - 1) * subgrid.del[1] + epsilon;\n if (minY > input.y || minX > input.x || maxY < input.y || maxX < input.x) {\n continue;\n }\n output = applySubgridShift(input, inverse, subgrid);\n if (!isNaN(output.x)) {\n break outer;\n }\n }\n }\n if (isNaN(output.x)) {\n console.log('Failed to find a grid shift table for location \\''\n + -input.x * R2D + ' ' + input.y * R2D + ' tried: \\'' + attemptedGrids + '\\'');\n return -1;\n }\n point.x = -output.x;\n point.y = output.y;\n return 0;\n}\n\nfunction applySubgridShift(pin, inverse, ct) {\n var val = { x: Number.NaN, y: Number.NaN };\n if (isNaN(pin.x)) {\n return val;\n }\n var tb = { x: pin.x, y: pin.y };\n tb.x -= ct.ll[0];\n tb.y -= ct.ll[1];\n tb.x = adjust_lon(tb.x - Math.PI) + Math.PI;\n var t = nadInterpolate(tb, ct);\n if (inverse) {\n if (isNaN(t.x)) {\n return val;\n }\n t.x = tb.x - t.x;\n t.y = tb.y - t.y;\n var i = 9, tol = 1e-12;\n var dif, del;\n do {\n del = nadInterpolate(t, ct);\n if (isNaN(del.x)) {\n console.log('Inverse grid shift iteration failed, presumably at grid edge. Using first approximation.');\n break;\n }\n dif = { x: tb.x - (del.x + t.x), y: tb.y - (del.y + t.y) };\n t.x += dif.x;\n t.y += dif.y;\n } while (i-- && Math.abs(dif.x) > tol && Math.abs(dif.y) > tol);\n if (i < 0) {\n console.log('Inverse grid shift iterator failed to converge.');\n return val;\n }\n val.x = adjust_lon(t.x + ct.ll[0]);\n val.y = t.y + ct.ll[1];\n } else {\n if (!isNaN(t.x)) {\n val.x = pin.x + t.x;\n val.y = pin.y + t.y;\n }\n }\n return val;\n}\n\nfunction nadInterpolate(pin, ct) {\n var t = { x: pin.x / ct.del[0], y: pin.y / ct.del[1] };\n var indx = { x: Math.floor(t.x), y: Math.floor(t.y) };\n var frct = { x: t.x - 1.0 * indx.x, y: t.y - 1.0 * indx.y };\n var val = { x: Number.NaN, y: Number.NaN };\n var inx;\n if (indx.x < 0 || indx.x >= ct.lim[0]) {\n return val;\n }\n if (indx.y < 0 || indx.y >= ct.lim[1]) {\n return val;\n }\n inx = (indx.y * ct.lim[0]) + indx.x;\n var f00 = { x: ct.cvs[inx][0], y: ct.cvs[inx][1] };\n inx++;\n var f10 = { x: ct.cvs[inx][0], y: ct.cvs[inx][1] };\n inx += ct.lim[0];\n var f11 = { x: ct.cvs[inx][0], y: ct.cvs[inx][1] };\n inx--;\n var f01 = { x: ct.cvs[inx][0], y: ct.cvs[inx][1] };\n var m11 = frct.x * frct.y, m10 = frct.x * (1.0 - frct.y),\n m00 = (1.0 - frct.x) * (1.0 - frct.y), m01 = (1.0 - frct.x) * frct.y;\n val.x = (m00 * f00.x + m10 * f10.x + m01 * f01.x + m11 * f11.x);\n val.y = (m00 * f00.y + m10 * f10.y + m01 * f01.y + m11 * f11.y);\n return val;\n}\n","export default function (crs, denorm, point) {\n var xin = point.x,\n yin = point.y,\n zin = point.z || 0.0;\n var v, t, i;\n /** @type {import(\"./core\").InterfaceCoordinates} */\n var out = {};\n for (i = 0; i < 3; i++) {\n if (denorm && i === 2 && point.z === undefined) {\n continue;\n }\n if (i === 0) {\n v = xin;\n if ('ew'.indexOf(crs.axis[i]) !== -1) {\n t = 'x';\n } else {\n t = 'y';\n }\n } else if (i === 1) {\n v = yin;\n if ('ns'.indexOf(crs.axis[i]) !== -1) {\n t = 'y';\n } else {\n t = 'x';\n }\n } else {\n v = zin;\n t = 'z';\n }\n switch (crs.axis[i]) {\n case 'e':\n out[t] = v;\n break;\n case 'w':\n out[t] = -v;\n break;\n case 'n':\n out[t] = v;\n break;\n case 's':\n out[t] = -v;\n break;\n case 'u':\n if (point[t] !== undefined) {\n out.z = v;\n }\n break;\n case 'd':\n if (point[t] !== undefined) {\n out.z = -v;\n }\n break;\n default:\n // console.log(\"ERROR: unknow axis (\"+crs.axis[i]+\") - check definition of \"+crs.projName);\n return null;\n }\n }\n return out;\n}\n","/**\n * @param {Array<number>} array\n * @returns {import(\"../core\").InterfaceCoordinates}\n */\nexport default function (array) {\n var out = {\n x: array[0],\n y: array[1]\n };\n if (array.length > 2) {\n out.z = array[2];\n }\n if (array.length > 3) {\n out.m = array[3];\n }\n return out;\n}\n","export default function (point) {\n checkCoord(point.x);\n checkCoord(point.y);\n}\nfunction checkCoord(num) {\n if (typeof Number.isFinite === 'function') {\n if (Number.isFinite(num)) {\n return;\n }\n throw new TypeError('coordinates must be finite numbers');\n }\n if (typeof num !== 'number' || num !== num || !isFinite(num)) {\n throw new TypeError('coordinates must be finite numbers');\n }\n}\n","import { D2R, R2D, PJD_3PARAM, PJD_7PARAM, PJD_GRIDSHIFT } from './constants/values';\nimport datum_transform from './datum_transform';\nimport adjust_axis from './adjust_axis';\nimport proj from './Proj';\nimport toPoint from './common/toPoint';\nimport checkSanity from './checkSanity';\n\nfunction checkNotWGS(source, dest) {\n return (\n (source.datum.datum_type === PJD_3PARAM || source.datum.datum_type === PJD_7PARAM || source.datum.datum_type === PJD_GRIDSHIFT) && dest.datumCode !== 'WGS84')\n || ((dest.datum.datum_type === PJD_3PARAM || dest.datum.datum_type === PJD_7PARAM || dest.datum.datum_type === PJD_GRIDSHIFT) && source.datumCode !== 'WGS84');\n}\n\n/**\n * @param {import('./defs').ProjectionDefinition} source\n * @param {import('./defs').ProjectionDefinition} dest\n * @param {import('./core').TemplateCoordinates} point\n * @param {boolean} enforceAxis\n * @returns {import('./core').InterfaceCoordinates | undefined}\n */\nexport default function transform(source, dest, point, enforceAxis) {\n var wgs84;\n if (Array.isArray(point)) {\n point = toPoint(point);\n } else {\n // Clone the point object so inputs don't get modified\n point = {\n x: point.x,\n y: point.y,\n z: point.z,\n m: point.m\n };\n }\n var hasZ = point.z !== undefined;\n checkSanity(point);\n // Workaround for datum shifts towgs84, if either source or destination projection is not wgs84\n if (source.datum && dest.datum && checkNotWGS(source, dest)) {\n wgs84 = new proj('WGS84');\n point = transform(source, wgs84, point, enforceAxis);\n source = wgs84;\n }\n // DGR, 2010/11/12\n if (enforceAxis && source.axis !== 'enu') {\n point = adjust_axis(source, false, point);\n }\n // Transform source points to long/lat, if they aren't already.\n if (source.projName === 'longlat') {\n point = {\n x: point.x * D2R,\n y: point.y * D2R,\n z: point.z || 0\n };\n } else {\n if (source.to_meter) {\n point = {\n x: point.x * source.to_meter,\n y: point.y * source.to_meter,\n z: point.z || 0\n };\n }\n point = source.inverse(point); // Convert Cartesian to longlat\n if (!point) {\n return;\n }\n }\n // Adjust for the prime meridian if necessary\n if (source.from_greenwich) {\n point.x += source.from_greenwich;\n }\n\n // Convert datums if needed, and if possible.\n point = datum_transform(source.datum, dest.datum, point);\n if (!point) {\n return;\n }\n\n point = /** @type {import('./core').InterfaceCoordinates} */ (point);\n\n // Adjust for the prime meridian if necessary\n if (dest.from_greenwich) {\n point = {\n x: point.x - dest.from_greenwich,\n y: point.y,\n z: point.z || 0\n };\n }\n\n if (dest.projName === 'longlat') {\n // convert radians to decimal degrees\n point = {\n x: point.x * R2D,\n y: point.y * R2D,\n z: point.z || 0\n };\n } else { // else project\n point = dest.forward(point);\n if (dest.to_meter) {\n point = {\n x: point.x / dest.to_meter,\n y: point.y / dest.to_meter,\n z: point.z || 0\n };\n }\n }\n\n // DGR, 2010/11/12\n if (enforceAxis && dest.axis !== 'enu') {\n return adjust_axis(dest, true, point);\n }\n\n if (point && !hasZ) {\n delete point.z;\n }\n return point;\n}\n","import proj from './Proj';\nimport transform from './transform';\nvar wgs84 = proj('WGS84');\n\n/**\n * @typedef {{x: number, y: number, z?: number, m?: number}} InterfaceCoordinates\n */\n\n/**\n * @typedef {Array<number> | InterfaceCoordinates} TemplateCoordinates\n */\n\n/**\n * @typedef {Object} Converter\n * @property {<T extends TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} forward\n * @property {<T extends TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} inverse\n * @property {proj} [oProj]\n */\n\n/**\n * @typedef {Object} PROJJSONDefinition\n * @property {string} [$schema]\n * @property {string} type\n * @property {string} [name]\n * @property {{authority: string, code: number}} [id]\n * @property {string} [scope]\n * @property {string} [area]\n * @property {{south_latitude: number, west_longitude: number, north_latitude: number, east_longitude: number}} [bbox]\n * @property {PROJJSONDefinition[]} [components]\n * @property {{type: string, name: string}} [datum]\n * @property {{\n * name: string,\n * members: Array<{\n * name: string,\n * id?: {authority: string, code: number}\n * }>,\n * ellipsoid?: {\n * name: string,\n * semi_major_axis: number,\n * inverse_flattening?: number\n * },\n * accuracy?: string,\n * id?: {authority: string, code: number}\n * }} [datum_ensemble]\n * @property {{\n * subtype: string,\n * axis: Array<{\n * name: string,\n * abbreviation?: string,\n * direction: string,\n * unit: string\n * }>\n * }} [coordinate_system]\n * @property {{\n * name: string,\n * method: {name: string},\n * parameters: Array<{\n * name: string,\n * value: number,\n * unit?: string\n * }>\n * }} [conversion]\n * @property {{\n * name: string,\n * method: {name: string},\n * parameters: Array<{\n * name: string,\n * value: number,\n * unit?: string,\n * type?: string,\n * file_name?: string\n * }>\n * }} [transformation]\n */\n\n/**\n * @template {TemplateCoordinates} T\n * @param {proj} from\n * @param {proj} to\n * @param {T} coords\n * @param {boolean} [enforceAxis]\n * @returns {T}\n */\nfunction transformer(from, to, coords, enforceAxis) {\n var transformedArray, out, keys;\n if (Array.isArray(coords)) {\n transformedArray = transform(from, to, coords, enforceAxis) || { x: NaN, y: NaN };\n if (coords.length > 2) {\n if ((typeof from.name !== 'undefined' && from.name === 'geocent') || (typeof to.name !== 'undefined' && to.name === 'geocent')) {\n if (typeof transformedArray.z === 'number') {\n return /** @type {T} */ ([transformedArray.x, transformedArray.y, transformedArray.z].concat(coords.slice(3)));\n } else {\n return /** @type {T} */ ([transformedArray.x, transformedArray.y, coords[2]].concat(coords.slice(3)));\n }\n } else {\n return /** @type {T} */ ([transformedArray.x, transformedArray.y].concat(coords.slice(2)));\n }\n } else {\n return /** @type {T} */ ([transformedArray.x, transformedArray.y]);\n }\n } else {\n out = transform(from, to, coords, enforceAxis);\n keys = Object.keys(coords);\n if (keys.length === 2) {\n return /** @type {T} */ (out);\n }\n keys.forEach(function (key) {\n if ((typeof from.name !== 'undefined' && from.name === 'geocent') || (typeof to.name !== 'undefined' && to.name === 'geocent')) {\n if (key === 'x' || key === 'y' || key === 'z') {\n return;\n }\n } else {\n if (key === 'x' || key === 'y') {\n return;\n }\n }\n out[key] = coords[key];\n });\n return /** @type {T} */ (out);\n }\n}\n\n/**\n * @param {proj | string | PROJJSONDefinition | Converter} item\n * @returns {import('./Proj').default}\n */\nfunction checkProj(item) {\n if (item instanceof proj) {\n return item;\n }\n if (typeof item === 'object' && 'oProj' in item) {\n return item.oProj;\n }\n return proj(/** @type {string | PROJJSONDefinition} */ (item));\n}\n\n/**\n * @overload\n * @param {string | PROJJSONDefinition | proj} toProj\n * @returns {Converter}\n */\n/**\n * @overload\n * @param {string | PROJJSONDefinition | proj} fromProj\n * @param {string | PROJJSONDefinition | proj} toProj\n * @returns {Converter}\n */\n/**\n * @template {TemplateCoordinates} T\n * @overload\n * @param {string | PROJJSONDefinition | proj} toProj\n * @param {T} coord\n * @returns {T}\n */\n/**\n * @template {TemplateCoordinates} T\n * @overload\n * @param {string | PROJJSONDefinition | proj} fromProj\n * @param {string | PROJJSONDefinition | proj} toProj\n * @param {T} coord\n * @returns {T}\n */\n/**\n * @template {TemplateCoordinates} T\n * @param {string | PROJJSONDefinition | proj} fromProjOrToProj\n * @param {string | PROJJSONDefinition | proj | TemplateCoordinates} [toProjOrCoord]\n * @param {T} [coord]\n * @returns {T|Converter}\n */\nfunction proj4(fromProjOrToProj, toProjOrCoord, coord) {\n /** @type {proj} */\n var fromProj;\n /** @type {proj} */\n var toProj;\n var single = false;\n /** @type {Converter} */\n var obj;\n if (typeof toProjOrCoord === 'undefined') {\n toProj = checkProj(fromProjOrToProj);\n fromProj = wgs84;\n single = true;\n } else if (typeof /** @type {?} */ (toProjOrCoord).x !== 'undefined' || Array.isArray(toProjOrCoord)) {\n coord = /** @type {T} */ (/** @type {?} */ (toProjOrCoord));\n toProj = checkProj(fromProjOrToProj);\n fromProj = wgs84;\n single = true;\n }\n if (!fromProj) {\n fromProj = checkProj(fromProjOrToProj);\n }\n if (!toProj) {\n toProj = checkProj(/** @type {string | PROJJSONDefinition | proj } */ (toProjOrCoord));\n }\n if (coord) {\n return transformer(fromProj, toProj, coord);\n } else {\n obj = {\n /**\n * @template {TemplateCoordinates} T\n * @param {T} coords\n * @param {boolean=} enforceAxis\n * @returns {T}\n */\n forward: function (coords, enforceAxis) {\n return transformer(fromProj, toProj, coords, enforceAxis);\n },\n /**\n * @template {TemplateCoordinates} T\n * @param {T} coords\n * @param {boolean=} enforceAxis\n * @returns {T}\n */\n inverse: function (coords, enforceAxis) {\n return transformer(toProj, fromProj, coords, enforceAxis);\n }\n };\n if (single) {\n obj.oProj = toProj;\n }\n return obj;\n }\n}\n\nexport default proj4;\n","\n\n\n/**\n * UTM zones are grouped, and assigned to one of a group of 6\n * sets.\n *\n * {int} @private\n */\nvar NUM_100K_SETS = 6;\n\n/**\n * The column letters (for easting) of the lower left value, per\n * set.\n *\n * {string} @private\n */\nvar SET_ORIGIN_COLUMN_LETTERS = 'AJSAJS';\n\n/**\n * The row letters (for northing) of the lower left value, per\n * set.\n *\n * {string} @private\n */\nvar SET_ORIGIN_ROW_LETTERS = 'AFAFAF';\n\nvar A = 65; // A\nvar I = 73; // I\nvar O = 79; // O\nvar V = 86; // V\nvar Z = 90; // Z\nexport default {\n forward: forward,\n inverse: inverse,\n toPoint: toPoint\n};\n/**\n * Conversion of lat/lon to MGRS.\n *\n * @param {object} ll Object literal with lat and lon properties on a\n * WGS84 ellipsoid.\n * @param {int} accuracy Accuracy in digits (5 for 1 m, 4 for 10 m, 3 for\n * 100 m, 2 for 1000 m or 1 for 10000 m). Optional, default is 5.\n * @return {string} the MGRS string for the given location and accuracy.\n */\nexport function forward(ll, accuracy) {\n accuracy = accuracy || 5; // default accuracy 1m\n return encode(LLtoUTM({\n lat: ll[1],\n lon: ll[0]\n }), accuracy);\n};\n\n/**\n * Conversion of MGRS to lat/lon.\n *\n * @param {string} mgrs MGRS string.\n * @return {array} An array with left (longitude), bottom (latitude), right\n * (longitude) and top (latitude) values in WGS84, representing the\n * bounding box for the provided MGRS reference.\n */\nexport function inverse(mgrs) {\n var bbox = UTMtoLL(decode(mgrs.toUpperCase()));\n if (bbox.lat && bbox.lon) {\n return [bbox.lon, bbox.lat, bbox.lon, bbox.lat];\n }\n return [bbox.left, bbox.bottom, bbox.right, bbox.top];\n};\n\nexport function toPoint(mgrs) {\n var bbox = UTMtoLL(decode(mgrs.toUpperCase()));\n if (bbox.lat && bbox.lon) {\n return [bbox.lon, bbox.lat];\n }\n return [(bbox.left + bbox.right) / 2, (bbox.top + bbox.bottom) / 2];\n};\n/**\n * Conversion from degrees to radians.\n *\n * @private\n * @param {number} deg the angle in degrees.\n * @return {number} the angle in radians.\n */\nfunction degToRad(deg) {\n return (deg * (Math.PI / 180.0));\n}\n\n/**\n * Conversion from radians to degrees.\n *\n * @private\n * @param {number} rad the angle in radians.\n * @return {number} the angle in degrees.\n */\nfunction radToDeg(rad) {\n return (180.0 * (rad / Math.PI));\n}\n\n/**\n * Converts a set of Longitude and Latitude co-ordinates to UTM\n * using the WGS84 ellipsoid.\n *\n * @private\n * @param {object} ll Object literal with lat and lon properties\n * representing the WGS84 coordinate to be converted.\n * @return {object} Object literal containing the UTM value with easting,\n * northing, zoneNumber and zoneLetter properties, and an optional\n * accuracy property in digits. Returns null if the conversion failed.\n */\nfunction LLtoUTM(ll) {\n var Lat = ll.lat;\n var Long = ll.lon;\n var a = 6378137.0; //ellip.radius;\n var eccSquared = 0.00669438; //ellip.eccsq;\n var k0 = 0.9996;\n var LongOrigin;\n var eccPrimeSquared;\n var N, T, C, A, M;\n var LatRad = degToRad(Lat);\n var LongRad = degToRad(Long);\n var LongOriginRad;\n var ZoneNumber;\n // (int)\n ZoneNumber = Math.floor((Long + 180) / 6) + 1;\n\n //Make sure the longitude 180.00 is in Zone 60\n if (Long === 180) {\n ZoneNumber = 60;\n }\n\n // Special zone for Norway\n if (Lat >= 56.0 && Lat < 64.0 && Long >= 3.0 && Long < 12.0) {\n ZoneNumber = 32;\n }\n\n // Special zones for Svalbard\n if (Lat >= 72.0 && Lat < 84.0) {\n if (Long >= 0.0 && Long < 9.0) {\n ZoneNumber = 31;\n }\n else if (Long >= 9.0 && Long < 21.0) {\n ZoneNumber = 33;\n }\n else if (Long >= 21.0 && Long < 33.0) {\n ZoneNumber = 35;\n }\n else if (Long >= 33.0 && Long < 42.0) {\n ZoneNumber = 37;\n }\n }\n\n LongOrigin = (ZoneNumber - 1) * 6 - 180 + 3; //+3 puts origin\n // in middle of\n // zone\n LongOriginRad = degToRad(LongOrigin);\n\n eccPrimeSquared = (eccSquared) / (1 - eccSquared);\n\n N = a / Math.sqrt(1 - eccSquared * Math.sin(LatRad) * Math.sin(LatRad));\n T = Math.tan(LatRad) * Math.tan(LatRad);\n C = eccPrimeSquared * Math.cos(LatRad) * Math.cos(LatRad);\n A = Math.cos(LatRad) * (LongRad - LongOriginRad);\n\n M = a * ((1 - eccSquared / 4 - 3 * eccSquared * eccSquared / 64 - 5 * eccSquared * eccSquared * eccSquared / 256) * LatRad - (3 * eccSquared / 8 + 3 * eccSquared * eccSquared / 32 + 45 * eccSquared * eccSquared * eccSquared / 1024) * Math.sin(2 * LatRad) + (15 * eccSquared * eccSquared / 256 + 45 * eccSquared * eccSquared * eccSquared / 1024) * Math.sin(4 * LatRad) - (35 * eccSquared * eccSquared * eccSquared / 3072) * Math.sin(6 * LatRad));\n\n var UTMEasting = (k0 * N * (A + (1 - T + C) * A * A * A / 6.0 + (5 - 18 * T + T * T + 72 * C - 58 * eccPrimeSquared) * A * A * A * A * A / 120.0) + 500000.0);\n\n var UTMNorthing = (k0 * (M + N * Math.tan(LatRad) * (A * A / 2 + (5 - T + 9 * C + 4 * C * C) * A * A * A * A / 24.0 + (61 - 58 * T + T * T + 600 * C - 330 * eccPrimeSquared) * A * A * A * A * A * A / 720.0)));\n if (Lat < 0.0) {\n UTMNorthing += 10000000.0; //10000000 meter offset for\n // southern hemisphere\n }\n\n return {\n northing: Math.round(UTMNorthing),\n easting: Math.round(UTMEasting),\n zoneNumber: ZoneNumber,\n zoneLetter: getLetterDesignator(Lat)\n };\n}\n\n/**\n * Converts UTM coords to lat/long, using the WGS84 ellipsoid. This is a convenience\n * class where the Zone can be specified as a single string eg.\"60N\" which\n * is then broken down into the ZoneNumber and ZoneLetter.\n *\n * @private\n * @param {object} utm An object literal with northing, easting, zoneNumber\n * and zoneLetter properties. If an optional accuracy property is\n * provided (in meters), a bounding box will be returned instead of\n * latitude and longitude.\n * @return {object} An object literal containing either lat and lon values\n * (if no accuracy was provided), or top, right, bottom and left values\n * for the bounding box calculated according to the provided accuracy.\n * Returns null if the conversion failed.\n */\nfunction UTMtoLL(utm) {\n\n var UTMNorthing = utm.northing;\n var UTMEasting = utm.easting;\n var zoneLetter = utm.zoneLetter;\n var zoneNumber = utm.zoneNumber;\n // check the ZoneNummber is valid\n if (zoneNumber < 0 || zoneNumber > 60) {\n return null;\n }\n\n var k0 = 0.9996;\n var a = 6378137.0; //ellip.radius;\n var eccSquared = 0.00669438; //ellip.eccsq;\n var eccPrimeSquared;\n var e1 = (1 - Math.sqrt(1 - eccSquared)) / (1 + Math.sqrt(1 - eccSquared));\n var N1, T1, C1, R1, D, M;\n var LongOrigin;\n var mu, phi1Rad;\n\n // remove 500,000 meter offset for longitude\n var x = UTMEasting - 500000.0;\n var y = UTMNorthing;\n\n // We must know somehow if we are in the Northern or Southern\n // hemisphere, this is the only time we use the letter So even\n // if the Zone letter isn't exactly correct it should indicate\n // the hemisphere correctly\n if (zoneLetter < 'N') {\n y -= 10000000.0; // remove 10,000,000 meter offset used\n // for southern hemisphere\n }\n\n // There are 60 zones with zone 1 being at West -180 to -174\n LongOrigin = (zoneNumber - 1) * 6 - 180 + 3; // +3 puts origin\n // in middle of\n // zone\n\n eccPrimeSquared = (eccSquared) / (1 - eccSquared);\n\n M = y / k0;\n mu = M / (a * (1 - eccSquared / 4 - 3 * eccSquared * eccSquared / 64 - 5 * eccSquared * eccSquared * eccSquared / 256));\n\n phi1Rad = mu + (3 * e1 / 2 - 27 * e1 * e1 * e1 / 32) * Math.sin(2 * mu) + (21 * e1 * e1 / 16 - 55 * e1 * e1 * e1 * e1 / 32) * Math.sin(4 * mu) + (151 * e1 * e1 * e1 / 96) * Math.sin(6 * mu);\n // double phi1 = ProjMath.radToDeg(phi1Rad);\n\n N1 = a / Math.sqrt(1 - eccSquared * Math.sin(phi1Rad) * Math.sin(phi1Rad));\n T1 = Math.tan(phi1Rad) * Math.tan(phi1Rad);\n C1 = eccPrimeSquared * Math.cos(phi1Rad) * Math.cos(phi1Rad);\n R1 = a * (1 - eccSquared) / Math.pow(1 - eccSquared * Math.sin(phi1Rad) * Math.sin(phi1Rad), 1.5);\n D = x / (N1 * k0);\n\n var lat = phi1Rad - (N1 * Math.tan(phi1Rad) / R1) * (D * D / 2 - (5 + 3 * T1 + 10 * C1 - 4 * C1 * C1 - 9 * eccPrimeSquared) * D * D * D * D / 24 + (61 + 90 * T1 + 298 * C1 + 45 * T1 * T1 - 252 * eccPrimeSquared - 3 * C1 * C1) * D * D * D * D * D * D / 720);\n lat = radToDeg(lat);\n\n var lon = (D - (1 + 2 * T1 + C1) * D * D * D / 6 + (5 - 2 * C1 + 28 * T1 - 3 * C1 * C1 + 8 * eccPrimeSquared + 24 * T1 * T1) * D * D * D * D * D / 120) / Math.cos(phi1Rad);\n lon = LongOrigin + radToDeg(lon);\n\n var result;\n if (utm.accuracy) {\n var topRight = UTMtoLL({\n northing: utm.northing + utm.accuracy,\n easting: utm.easting + utm.accuracy,\n zoneLetter: utm.zoneLetter,\n zoneNumber: utm.zoneNumber\n });\n result = {\n top: topRight.lat,\n right: topRight.lon,\n bottom: lat,\n left: lon\n };\n }\n else {\n result = {\n lat: lat,\n lon: lon\n };\n }\n return result;\n}\n\n/**\n * Calculates the MGRS letter designator for the given latitude.\n *\n * @private\n * @param {number} lat The latitude in WGS84 to get the letter designator\n * for.\n * @return {char} The letter designator.\n */\nfunction getLetterDesignator(lat) {\n //This is here as an error flag to show that the Latitude is\n //outside MGRS limits\n var LetterDesignator = 'Z';\n\n if ((84 >= lat) && (lat >= 72)) {\n LetterDesignator = 'X';\n }\n else if ((72 > lat) && (lat >= 64)) {\n LetterDesignator = 'W';\n }\n else if ((64 > lat) && (lat >= 56)) {\n LetterDesignator = 'V';\n }\n else if ((56 > lat) && (lat >= 48)) {\n LetterDesignator = 'U';\n }\n else if ((48 > lat) && (lat >= 40)) {\n LetterDesignator = 'T';\n }\n else if ((40 > lat) && (lat >= 32)) {\n LetterDesignator = 'S';\n }\n else if ((32 > lat) && (lat >= 24)) {\n LetterDesignator = 'R';\n }\n else if ((24 > lat) && (lat >= 16)) {\n LetterDesignator = 'Q';\n }\n else if ((16 > lat) && (lat >= 8)) {\n LetterDesignator = 'P';\n }\n else if ((8 > lat) && (lat >= 0)) {\n LetterDesignator = 'N';\n }\n else if ((0 > lat) && (lat >= -8)) {\n LetterDesignator = 'M';\n }\n else if ((-8 > lat) && (lat >= -16)) {\n LetterDesignator = 'L';\n }\n else if ((-16 > lat) && (lat >= -24)) {\n LetterDesignator = 'K';\n }\n else if ((-24 > lat) && (lat >= -32)) {\n LetterDesignator = 'J';\n }\n else if ((-32 > lat) && (lat >= -40)) {\n LetterDesignator = 'H';\n }\n else if ((-40 > lat) && (lat >= -48)) {\n LetterDesignator = 'G';\n }\n else if ((-48 > lat) && (lat >= -56)) {\n LetterDesignator = 'F';\n }\n else if ((-56 > lat) && (lat >= -64)) {\n LetterDesignator = 'E';\n }\n else if ((-64 > lat) && (lat >= -72)) {\n LetterDesignator = 'D';\n }\n else if ((-72 > lat) && (lat >= -80)) {\n LetterDesignator = 'C';\n }\n return LetterDesignator;\n}\n\n/**\n * Encodes a UTM location as MGRS string.\n *\n * @private\n * @param {object} utm An object literal with easting, northing,\n * zoneLetter, zoneNumber\n * @param {number} accuracy Accuracy in digits (1-5).\n * @return {string} MGRS string for the given UTM location.\n */\nfunction encode(utm, accuracy) {\n // prepend with leading zeroes\n var seasting = \"00000\" + utm.easting,\n snorthing = \"00000\" + utm.northing;\n\n return utm.zoneNumber + utm.zoneLetter + get100kID(utm.easting, utm.northing, utm.zoneNumber) + seasting.substr(seasting.length - 5, accuracy) + snorthing.substr(snorthing.length - 5, accuracy);\n}\n\n/**\n * Get the two letter 100k designator for a given UTM easting,\n * northing and zone number value.\n *\n * @private\n * @param {number} easting\n * @param {number} northing\n * @param {number} zoneNumber\n * @return the two letter 100k designator for the given UTM location.\n */\nfunction get100kID(easting, northing, zoneNumber) {\n var setParm = get100kSetForZone(zoneNumber);\n var setColumn = Math.floor(easting / 100000);\n var setRow = Math.floor(northing / 100000) % 20;\n return getLetter100kID(setColumn, setRow, setParm);\n}\n\n/**\n * Given a UTM zone number, figure out the MGRS 100K set it is in.\n *\n * @private\n * @param {number} i An UTM zone number.\n * @return {number} the 100k set the UTM zone is in.\n */\nfunction get100kSetForZone(i) {\n var setParm = i % NUM_100K_SETS;\n if (setParm === 0) {\n setParm = NUM_100K_SETS;\n }\n\n return setParm;\n}\n\n/**\n * Get the two-letter MGRS 100k designator given information\n * translated from the UTM northing, easting and zone number.\n *\n * @private\n * @param {number} column the column index as it relates to the MGRS\n * 100k set spreadsheet, created from the UTM easting.\n * Values are 1-8.\n * @param {number} row the row index as it relates to the MGRS 100k set\n * spreadsheet, created from the UTM northing value. Values\n * are from 0-19.\n * @param {number} parm the set block, as it relates to the MGRS 100k set\n * spreadsheet, created from the UTM zone. Values are from\n * 1-60.\n * @return two letter MGRS 100k code.\n */\nfunction getLetter100kID(column, row, parm) {\n // colOrigin and rowOrigin are the letters at the origin of the set\n var index = parm - 1;\n var colOrigin = SET_ORIGIN_COLUMN_LETTERS.charCodeAt(index);\n var rowOrigin = SET_ORIGIN_ROW_LETTERS.charCodeAt(index);\n\n // colInt and rowInt are the letters to build to return\n var colInt = colOrigin + column - 1;\n var rowInt = rowOrigin + row;\n var rollover = false;\n\n if (colInt > Z) {\n colInt = colInt - Z + A - 1;\n rollover = true;\n }\n\n if (colInt === I || (colOrigin < I && colInt > I) || ((colInt > I || colOrigin < I) && rollover)) {\n colInt++;\n }\n\n if (colInt === O || (colOrigin < O && colInt > O) || ((colInt > O || colOrigin < O) && rollover)) {\n colInt++;\n\n if (colInt === I) {\n colInt++;\n }\n }\n\n if (colInt > Z) {\n colInt = colInt - Z + A - 1;\n }\n\n if (rowInt > V) {\n rowInt = rowInt - V + A - 1;\n rollover = true;\n }\n else {\n rollover = false;\n }\n\n if (((rowInt === I) || ((rowOrigin < I) && (rowInt > I))) || (((rowInt > I) || (rowOrigin < I)) && rollover)) {\n rowInt++;\n }\n\n if (((rowInt === O) || ((rowOrigin < O) && (rowInt > O))) || (((rowInt > O) || (rowOrigin < O)) && rollover)) {\n rowInt++;\n\n if (rowInt === I) {\n rowInt++;\n }\n }\n\n if (rowInt > V) {\n rowInt = rowInt - V + A - 1;\n }\n\n var twoLetter = String.fromCharCode(colInt) + String.fromCharCode(rowInt);\n return twoLetter;\n}\n\n/**\n * Decode the UTM parameters from a MGRS string.\n *\n * @private\n * @param {string} mgrsString an UPPERCASE coordinate string is expected.\n * @return {object} An object literal with easting, northing, zoneLetter,\n * zoneNumber and accuracy (in meters) properties.\n */\nfunction decode(mgrsString) {\n\n if (mgrsString && mgrsString.length === 0) {\n throw (\"MGRSPoint coverting from nothing\");\n }\n\n var length = mgrsString.length;\n\n var hunK = null;\n var sb = \"\";\n var testChar;\n var i = 0;\n\n // get Zone number\n while (!(/[A-Z]/).test(testChar = mgrsString.charAt(i))) {\n if (i >= 2) {\n throw (\"MGRSPoint bad conversion from: \" + mgrsString);\n }\n sb += testChar;\n i++;\n }\n\n var zoneNumber = parseInt(sb, 10);\n\n if (i === 0 || i + 3 > length) {\n // A good MGRS string has to be 4-5 digits long,\n // ##AAA/#AAA at least.\n throw (\"MGRSPoint bad conversion from: \" + mgrsString);\n }\n\n var zoneLetter = mgrsString.charAt(i++);\n\n // Should we check the zone letter here? Why not.\n if (zoneLetter <= 'A' || zoneLetter === 'B' || zoneLetter === 'Y' || zoneLetter >= 'Z' || zoneLetter === 'I' || zoneLetter === 'O') {\n throw (\"MGRSPoint zone letter \" + zoneLetter + \" not handled: \" + mgrsString);\n }\n\n hunK = mgrsString.substring(i, i += 2);\n\n var set = get100kSetForZone(zoneNumber);\n\n var east100k = getEastingFromChar(hunK.charAt(0), set);\n var north100k = getNorthingFromChar(hunK.charAt(1), set);\n\n // We have a bug where the northing may be 2000000 too low.\n // How\n // do we know when to roll over?\n\n while (north100k < getMinNorthing(zoneLetter)) {\n north100k += 2000000;\n }\n\n // calculate the char index for easting/northing separator\n var remainder = length - i;\n\n if (remainder % 2 !== 0) {\n throw (\"MGRSPoint has to have an even number \\nof digits after the zone letter and two 100km letters - front \\nhalf for easting meters, second half for \\nnorthing meters\" + mgrsString);\n }\n\n var sep = remainder / 2;\n\n var sepEasting = 0.0;\n var sepNorthing = 0.0;\n var accuracyBonus, sepEastingString, sepNorthingString, easting, northing;\n if (sep > 0) {\n accuracyBonus = 100000.0 / Math.pow(10, sep);\n sepEastingString = mgrsString.substring(i, i + sep);\n sepEasting = parseFloat(sepEastingString) * accuracyBonus;\n sepNorthingString = mgrsString.substring(i + sep);\n sepNorthing = parseFloat(sepNorthingString) * accuracyBonus;\n }\n\n easting = sepEasting + east100k;\n northing = sepNorthing + north100k;\n\n return {\n easting: easting,\n northing: northing,\n zoneLetter: zoneLetter,\n zoneNumber: zoneNumber,\n accuracy: accuracyBonus\n };\n}\n\n/**\n * Given the first letter from a two-letter MGRS 100k zone, and given the\n * MGRS table set for the zone number, figure out the easting value that\n * should be added to the other, secondary easting value.\n *\n * @private\n * @param {char} e The first letter from a two-letter MGRS 100´k zone.\n * @param {number} set The MGRS table set for the zone number.\n * @return {number} The easting value for the given letter and set.\n */\nfunction getEastingFromChar(e, set) {\n // colOrigin is the letter at the origin of the set for the\n // column\n var curCol = SET_ORIGIN_COLUMN_LETTERS.charCodeAt(set - 1);\n var eastingValue = 100000.0;\n var rewindMarker = false;\n\n while (curCol !== e.charCodeAt(0)) {\n curCol++;\n if (curCol === I) {\n curCol++;\n }\n if (curCol === O) {\n curCol++;\n }\n if (curCol > Z) {\n if (rewindMarker) {\n throw (\"Bad character: \" + e);\n }\n curCol = A;\n rewindMarker = true;\n }\n eastingValue += 100000.0;\n }\n\n return eastingValue;\n}\n\n/**\n * Given the second letter from a two-letter MGRS 100k zone, and given the\n * MGRS table set for the zone number, figure out the northing value that\n * should be added to the other, secondary northing value. You have to\n * remember that Northings are determined from the equator, and the vertical\n * cycle of letters mean a 2000000 additional northing meters. This happens\n * approx. every 18 degrees of latitude. This method does *NOT* count any\n * additional northings. You have to figure out how many 2000000 meters need\n * to be added for the zone letter of the MGRS coordinate.\n *\n * @private\n * @param {char} n Second letter of the MGRS 100k zone\n * @param {number} set The MGRS table set number, which is dependent on the\n * UTM zone number.\n * @return {number} The northing value for the given letter and set.\n */\nfunction getNorthingFromChar(n, set) {\n\n if (n > 'V') {\n throw (\"MGRSPoint given invalid Northing \" + n);\n }\n\n // rowOrigin is the letter at the origin of the set for the\n // column\n var curRow = SET_ORIGIN_ROW_LETTERS.charCodeAt(set - 1);\n var northingValue = 0.0;\n var rewindMarker = false;\n\n while (curRow !== n.charCodeAt(0)) {\n curRow++;\n if (curRow === I) {\n curRow++;\n }\n if (curRow === O) {\n curRow++;\n }\n // fixing a bug making whole application hang in this loop\n // when 'n' is a wrong character\n if (curRow > V) {\n if (rewindMarker) { // making sure that this loop ends\n throw (\"Bad character: \" + n);\n }\n curRow = A;\n rewindMarker = true;\n }\n northingValue += 100000.0;\n }\n\n return northingValue;\n}\n\n/**\n * The function getMinNorthing returns the minimum northing value of a MGRS\n * zone.\n *\n * Ported from Geotrans' c Lattitude_Band_Value structure table.\n *\n * @private\n * @param {char} zoneLetter The MGRS zone to get the min northing for.\n * @return {number}\n */\nfunction getMinNorthing(zoneLetter) {\n var northing;\n switch (zoneLetter) {\n case 'C':\n northing = 1100000.0;\n break;\n case 'D':\n northing = 2000000.0;\n break;\n case 'E':\n northing = 2800000.0;\n break;\n case 'F':\n northing = 3700000.0;\n break;\n case 'G':\n northing = 4600000.0;\n break;\n case 'H':\n northing = 5500000.0;\n break;\n case 'J':\n northing = 6400000.0;\n break;\n case 'K':\n northing = 7300000.0;\n break;\n case 'L':\n northing = 8200000.0;\n break;\n case 'M':\n northing = 9100000.0;\n break;\n case 'N':\n northing = 0.0;\n break;\n case 'P':\n northing = 800000.0;\n break;\n case 'Q':\n northing = 1700000.0;\n break;\n case 'R':\n northing = 2600000.0;\n break;\n case 'S':\n northing = 3500000.0;\n break;\n case 'T':\n northing = 4400000.0;\n break;\n case 'U':\n northing = 5300000.0;\n break;\n case 'V':\n northing = 6200000.0;\n break;\n case 'W':\n northing = 7000000.0;\n break;\n case 'X':\n northing = 7900000.0;\n break;\n default:\n northing = -1.0;\n }\n if (northing >= 0.0) {\n return northing;\n }\n else {\n throw (\"Invalid zone letter: \" + zoneLetter);\n }\n\n}\n","import { toPoint, forward } from 'mgrs';\n\n/**\n * @deprecated v3.0.0 - use proj4.toPoint instead\n * @param {number | import('./core').TemplateCoordinates | string} x\n * @param {number} [y]\n * @param {number} [z]\n */\nfunction Point(x, y, z) {\n if (!(this instanceof Point)) {\n return new Point(x, y, z);\n }\n if (Array.isArray(x)) {\n this.x = x[0];\n this.y = x[1];\n this.z = x[2] || 0.0;\n } else if (typeof x === 'object') {\n this.x = x.x;\n this.y = x.y;\n this.z = x.z || 0.0;\n } else if (typeof x === 'string' && typeof y === 'undefined') {\n var coords = x.split(',');\n this.x = parseFloat(coords[0]);\n this.y = parseFloat(coords[1]);\n this.z = parseFloat(coords[2]) || 0.0;\n } else {\n this.x = x;\n this.y = y;\n this.z = z || 0.0;\n }\n console.warn('proj4.Point will be removed in version 3, use proj4.toPoint');\n}\n\nPoint.fromMGRS = function (mgrsStr) {\n return new Point(toPoint(mgrsStr));\n};\nPoint.prototype.toMGRS = function (accuracy) {\n return forward([this.x, this.y], accuracy);\n};\nexport default Point;\n","var C00 = 1;\nvar C02 = 0.25;\nvar C04 = 0.046875;\nvar C06 = 0.01953125;\nvar C08 = 0.01068115234375;\nvar C22 = 0.75;\nvar C44 = 0.46875;\nvar C46 = 0.01302083333333333333;\nvar C48 = 0.00712076822916666666;\nvar C66 = 0.36458333333333333333;\nvar C68 = 0.00569661458333333333;\nvar C88 = 0.3076171875;\n\nexport default function (es) {\n var en = [];\n en[0] = C00 - es * (C02 + es * (C04 + es * (C06 + es * C08)));\n en[1] = es * (C22 - es * (C04 + es * (C06 + es * C08)));\n var t = es * es;\n en[2] = t * (C44 - es * (C46 + es * C48));\n t *= es;\n en[3] = t * (C66 - es * C68);\n en[4] = t * es * C88;\n return en;\n}\n","export default function (phi, sphi, cphi, en) {\n cphi *= sphi;\n sphi *= sphi;\n return (en[0] * phi - cphi * (en[1] + sphi * (en[2] + sphi * (en[3] + sphi * en[4]))));\n}\n","import pj_mlfn from './pj_mlfn';\nimport { EPSLN } from '../constants/values';\n\nvar MAX_ITER = 20;\n\nexport default function (arg, es, en) {\n var k = 1 / (1 - es);\n var phi = arg;\n for (var i = MAX_ITER; i; --i) { /* rarely goes over 2 iterations */\n var s = Math.sin(phi);\n var t = 1 - es * s * s;\n // t = this.pj_mlfn(phi, s, Math.cos(phi), en) - arg;\n // phi -= t * (t * Math.sqrt(t)) * k;\n t = (pj_mlfn(phi, s, Math.cos(phi), en) - arg) * (t * Math.sqrt(t)) * k;\n phi -= t;\n if (Math.abs(t) < EPSLN) {\n return phi;\n }\n }\n // ..reportError(\"cass:pj_inv_mlfn: Convergence error\");\n return phi;\n}\n","// Heavily based on this tmerc projection implementation\n// https://github.com/mbloch/mapshaper-proj/blob/master/src/projections/tmerc.js\n\nimport pj_enfn from '../common/pj_enfn';\nimport pj_mlfn from '../common/pj_mlfn';\nimport pj_inv_mlfn from '../common/pj_inv_mlfn';\nimport adjust_lon from '../common/adjust_lon';\n\nimport { EPSLN, HALF_PI } from '../constants/values';\nimport sign from '../common/sign';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} es\n * @property {Array<number>} en\n * @property {number} ml0\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n this.x0 = this.x0 !== undefined ? this.x0 : 0;\n this.y0 = this.y0 !== undefined ? this.y0 : 0;\n this.long0 = this.long0 !== undefined ? this.long0 : 0;\n this.lat0 = this.lat0 !== undefined ? this.lat0 : 0;\n\n if (this.es) {\n this.en = pj_enfn(this.es);\n this.ml0 = pj_mlfn(this.lat0, Math.sin(this.lat0), Math.cos(this.lat0), this.en);\n }\n}\n\n/**\n Transverse Mercator Forward - long/lat to x/y\n long/lat in radians\n */\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n\n var delta_lon = adjust_lon(lon - this.long0, this.over);\n var con;\n var x, y;\n var sin_phi = Math.sin(lat);\n var cos_phi = Math.cos(lat);\n\n if (!this.es) {\n var b = cos_phi * Math.sin(delta_lon);\n\n if ((Math.abs(Math.abs(b) - 1)) < EPSLN) {\n return (93);\n } else {\n x = 0.5 * this.a * this.k0 * Math.log((1 + b) / (1 - b)) + this.x0;\n y = cos_phi * Math.cos(delta_lon) / Math.sqrt(1 - Math.pow(b, 2));\n b = Math.abs(y);\n\n if (b >= 1) {\n if ((b - 1) > EPSLN) {\n return (93);\n } else {\n y = 0;\n }\n } else {\n y = Math.acos(y);\n }\n\n if (lat < 0) {\n y = -y;\n }\n\n y = this.a * this.k0 * (y - this.lat0) + this.y0;\n }\n } else {\n var al = cos_phi * delta_lon;\n var als = Math.pow(al, 2);\n var c = this.ep2 * Math.pow(cos_phi, 2);\n var cs = Math.pow(c, 2);\n var tq = Math.abs(cos_phi) > EPSLN ? Math.tan(lat) : 0;\n var t = Math.pow(tq, 2);\n var ts = Math.pow(t, 2);\n con = 1 - this.es * Math.pow(sin_phi, 2);\n al = al / Math.sqrt(con);\n var ml = pj_mlfn(lat, sin_phi, cos_phi, this.en);\n\n x = this.a * (this.k0 * al * (1\n + als / 6 * (1 - t + c\n + als / 20 * (5 - 18 * t + ts + 14 * c - 58 * t * c\n + als / 42 * (61 + 179 * ts - ts * t - 479 * t)))))\n + this.x0;\n\n y = this.a * (this.k0 * (ml - this.ml0\n + sin_phi * delta_lon * al / 2 * (1\n + als / 12 * (5 - t + 9 * c + 4 * cs\n + als / 30 * (61 + ts - 58 * t + 270 * c - 330 * t * c\n + als / 56 * (1385 + 543 * ts - ts * t - 3111 * t))))))\n + this.y0;\n }\n\n p.x = x;\n p.y = y;\n\n return p;\n}\n\n/**\n Transverse Mercator Inverse - x/y to long/lat\n */\nexport function inverse(p) {\n var con, phi;\n var lat, lon;\n var x = (p.x - this.x0) * (1 / this.a);\n var y = (p.y - this.y0) * (1 / this.a);\n\n if (!this.es) {\n var f = Math.exp(x / this.k0);\n var g = 0.5 * (f - 1 / f);\n var temp = this.lat0 + y / this.k0;\n var h = Math.cos(temp);\n con = Math.sqrt((1 - Math.pow(h, 2)) / (1 + Math.pow(g, 2)));\n lat = Math.asin(con);\n\n if (y < 0) {\n lat = -lat;\n }\n\n if ((g === 0) && (h === 0)) {\n lon = 0;\n } else {\n lon = adjust_lon(Math.atan2(g, h) + this.long0, this.over);\n }\n } else { // ellipsoidal form\n con = this.ml0 + y / this.k0;\n phi = pj_inv_mlfn(con, this.es, this.en);\n\n if (Math.abs(phi) < HALF_PI) {\n var sin_phi = Math.sin(phi);\n var cos_phi = Math.cos(phi);\n var tan_phi = Math.abs(cos_phi) > EPSLN ? Math.tan(phi) : 0;\n var c = this.ep2 * Math.pow(cos_phi, 2);\n var cs = Math.pow(c, 2);\n var t = Math.pow(tan_phi, 2);\n var ts = Math.pow(t, 2);\n con = 1 - this.es * Math.pow(sin_phi, 2);\n var d = x * Math.sqrt(con) / this.k0;\n var ds = Math.pow(d, 2);\n con = con * tan_phi;\n\n lat = phi - (con * ds / (1 - this.es)) * 0.5 * (1\n - ds / 12 * (5 + 3 * t - 9 * c * t + c - 4 * cs\n - ds / 30 * (61 + 90 * t - 252 * c * t + 45 * ts + 46 * c\n - ds / 56 * (1385 + 3633 * t + 4095 * ts + 1574 * ts * t))));\n\n lon = adjust_lon(this.long0 + (d * (1\n - ds / 6 * (1 + 2 * t + c\n - ds / 20 * (5 + 28 * t + 24 * ts + 8 * c * t + 6 * c\n - ds / 42 * (61 + 662 * t + 1320 * ts + 720 * ts * t)))) / cos_phi), this.over);\n } else {\n lat = HALF_PI * sign(y);\n lon = 0;\n }\n }\n\n p.x = lon;\n p.y = lat;\n\n return p;\n}\n\nexport var names = ['Fast_Transverse_Mercator', 'Fast Transverse Mercator'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","export default function (x) {\n var r = Math.exp(x);\n r = (r - 1 / r) / 2;\n return r;\n}\n","export default function (x, y) {\n x = Math.abs(x);\n y = Math.abs(y);\n var a = Math.max(x, y);\n var b = Math.min(x, y) / (a ? a : 1);\n\n return a * Math.sqrt(1 + Math.pow(b, 2));\n}\n","export default function (x) {\n var y = 1 + x;\n var z = y - 1;\n\n return z === 0 ? x : x * Math.log(y) / z;\n}\n","import hypot from './hypot';\nimport log1py from './log1py';\n\nexport default function (x) {\n var y = Math.abs(x);\n y = log1py(y * (1 + y / (hypot(1, y) + 1)));\n\n return x < 0 ? -y : y;\n}\n","export default function (pp, B) {\n var cos_2B = 2 * Math.cos(2 * B);\n var i = pp.length - 1;\n var h1 = pp[i];\n var h2 = 0;\n var h;\n\n while (--i >= 0) {\n h = -h2 + cos_2B * h1 + pp[i];\n h2 = h1;\n h1 = h;\n }\n\n return (B + h * Math.sin(2 * B));\n}\n","export default function (pp, arg_r) {\n var r = 2 * Math.cos(arg_r);\n var i = pp.length - 1;\n var hr1 = pp[i];\n var hr2 = 0;\n var hr;\n\n while (--i >= 0) {\n hr = -hr2 + r * hr1 + pp[i];\n hr2 = hr1;\n hr1 = hr;\n }\n\n return Math.sin(arg_r) * hr;\n}\n","export default function (x) {\n var r = Math.exp(x);\n r = (r + 1 / r) / 2;\n return r;\n}\n","import sinh from './sinh';\nimport cosh from './cosh';\n\nexport default function (pp, arg_r, arg_i) {\n var sin_arg_r = Math.sin(arg_r);\n var cos_arg_r = Math.cos(arg_r);\n var sinh_arg_i = sinh(arg_i);\n var cosh_arg_i = cosh(arg_i);\n var r = 2 * cos_arg_r * cosh_arg_i;\n var i = -2 * sin_arg_r * sinh_arg_i;\n var j = pp.length - 1;\n var hr = pp[j];\n var hi1 = 0;\n var hr1 = 0;\n var hi = 0;\n var hr2;\n var hi2;\n\n while (--j >= 0) {\n hr2 = hr1;\n hi2 = hi1;\n hr1 = hr;\n hi1 = hi;\n hr = -hr2 + r * hr1 - i * hi1 + pp[j];\n hi = -hi2 + i * hr1 + r * hi1;\n }\n\n r = sin_arg_r * cosh_arg_i;\n i = cos_arg_r * sinh_arg_i;\n\n return [r * hr - i * hi, r * hi + i * hr];\n}\n","// Heavily based on this etmerc projection implementation\n// https://github.com/mbloch/mapshaper-proj/blob/master/src/projections/etmerc.js\n\nimport tmerc from '../projections/tmerc';\nimport sinh from '../common/sinh';\nimport hypot from '../common/hypot';\nimport asinhy from '../common/asinhy';\nimport gatg from '../common/gatg';\nimport clens from '../common/clens';\nimport clens_cmplx from '../common/clens_cmplx';\nimport adjust_lon from '../common/adjust_lon';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} es\n * @property {Array<number>} cbg\n * @property {Array<number>} cgb\n * @property {Array<number>} utg\n * @property {Array<number>} gtu\n * @property {number} Qn\n * @property {number} Zb\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n if (!this.approx && (isNaN(this.es) || this.es <= 0)) {\n throw new Error('Incorrect elliptical usage. Try using the +approx option in the proj string, or PROJECTION[\"Fast_Transverse_Mercator\"] in the WKT.');\n }\n if (this.approx) {\n // When '+approx' is set, use tmerc instead\n tmerc.init.apply(this);\n this.forward = tmerc.forward;\n this.inverse = tmerc.inverse;\n }\n\n this.x0 = this.x0 !== undefined ? this.x0 : 0;\n this.y0 = this.y0 !== undefined ? this.y0 : 0;\n this.long0 = this.long0 !== undefined ? this.long0 : 0;\n this.lat0 = this.lat0 !== undefined ? this.lat0 : 0;\n\n this.cgb = [];\n this.cbg = [];\n this.utg = [];\n this.gtu = [];\n\n var f = this.es / (1 + Math.sqrt(1 - this.es));\n var n = f / (2 - f);\n var np = n;\n\n this.cgb[0] = n * (2 + n * (-2 / 3 + n * (-2 + n * (116 / 45 + n * (26 / 45 + n * (-2854 / 675))))));\n this.cbg[0] = n * (-2 + n * (2 / 3 + n * (4 / 3 + n * (-82 / 45 + n * (32 / 45 + n * (4642 / 4725))))));\n\n np = np * n;\n this.cgb[1] = np * (7 / 3 + n * (-8 / 5 + n * (-227 / 45 + n * (2704 / 315 + n * (2323 / 945)))));\n this.cbg[1] = np * (5 / 3 + n * (-16 / 15 + n * (-13 / 9 + n * (904 / 315 + n * (-1522 / 945)))));\n\n np = np * n;\n this.cgb[2] = np * (56 / 15 + n * (-136 / 35 + n * (-1262 / 105 + n * (73814 / 2835))));\n this.cbg[2] = np * (-26 / 15 + n * (34 / 21 + n * (8 / 5 + n * (-12686 / 2835))));\n\n np = np * n;\n this.cgb[3] = np * (4279 / 630 + n * (-332 / 35 + n * (-399572 / 14175)));\n this.cbg[3] = np * (1237 / 630 + n * (-12 / 5 + n * (-24832 / 14175)));\n\n np = np * n;\n this.cgb[4] = np * (4174 / 315 + n * (-144838 / 6237));\n this.cbg[4] = np * (-734 / 315 + n * (109598 / 31185));\n\n np = np * n;\n this.cgb[5] = np * (601676 / 22275);\n this.cbg[5] = np * (444337 / 155925);\n\n np = Math.pow(n, 2);\n this.Qn = this.k0 / (1 + n) * (1 + np * (1 / 4 + np * (1 / 64 + np / 256)));\n\n this.utg[0] = n * (-0.5 + n * (2 / 3 + n * (-37 / 96 + n * (1 / 360 + n * (81 / 512 + n * (-96199 / 604800))))));\n this.gtu[0] = n * (0.5 + n * (-2 / 3 + n * (5 / 16 + n * (41 / 180 + n * (-127 / 288 + n * (7891 / 37800))))));\n\n this.utg[1] = np * (-1 / 48 + n * (-1 / 15 + n * (437 / 1440 + n * (-46 / 105 + n * (1118711 / 3870720)))));\n this.gtu[1] = np * (13 / 48 + n * (-3 / 5 + n * (557 / 1440 + n * (281 / 630 + n * (-1983433 / 1935360)))));\n\n np = np * n;\n this.utg[2] = np * (-17 / 480 + n * (37 / 840 + n * (209 / 4480 + n * (-5569 / 90720))));\n this.gtu[2] = np * (61 / 240 + n * (-103 / 140 + n * (15061 / 26880 + n * (167603 / 181440))));\n\n np = np * n;\n this.utg[3] = np * (-4397 / 161280 + n * (11 / 504 + n * (830251 / 7257600)));\n this.gtu[3] = np * (49561 / 161280 + n * (-179 / 168 + n * (6601661 / 7257600)));\n\n np = np * n;\n this.utg[4] = np * (-4583 / 161280 + n * (108847 / 3991680));\n this.gtu[4] = np * (34729 / 80640 + n * (-3418889 / 1995840));\n\n np = np * n;\n this.utg[5] = np * (-20648693 / 638668800);\n this.gtu[5] = np * (212378941 / 319334400);\n\n var Z = gatg(this.cbg, this.lat0);\n this.Zb = -this.Qn * (Z + clens(this.gtu, 2 * Z));\n}\n\nexport function forward(p) {\n var Ce = adjust_lon(p.x - this.long0, this.over);\n var Cn = p.y;\n\n Cn = gatg(this.cbg, Cn);\n var sin_Cn = Math.sin(Cn);\n var cos_Cn = Math.cos(Cn);\n var sin_Ce = Math.sin(Ce);\n var cos_Ce = Math.cos(Ce);\n\n Cn = Math.atan2(sin_Cn, cos_Ce * cos_Cn);\n Ce = Math.atan2(sin_Ce * cos_Cn, hypot(sin_Cn, cos_Cn * cos_Ce));\n Ce = asinhy(Math.tan(Ce));\n\n var tmp = clens_cmplx(this.gtu, 2 * Cn, 2 * Ce);\n\n Cn = Cn + tmp[0];\n Ce = Ce + tmp[1];\n\n var x;\n var y;\n\n if (Math.abs(Ce) <= 2.623395162778) {\n x = this.a * (this.Qn * Ce) + this.x0;\n y = this.a * (this.Qn * Cn + this.Zb) + this.y0;\n } else {\n x = Infinity;\n y = Infinity;\n }\n\n p.x = x;\n p.y = y;\n\n return p;\n}\n\nexport function inverse(p) {\n var Ce = (p.x - this.x0) * (1 / this.a);\n var Cn = (p.y - this.y0) * (1 / this.a);\n\n Cn = (Cn - this.Zb) / this.Qn;\n Ce = Ce / this.Qn;\n\n var lon;\n var lat;\n\n if (Math.abs(Ce) <= 2.623395162778) {\n var tmp = clens_cmplx(this.utg, 2 * Cn, 2 * Ce);\n\n Cn = Cn + tmp[0];\n Ce = Ce + tmp[1];\n Ce = Math.atan(sinh(Ce));\n\n var sin_Cn = Math.sin(Cn);\n var cos_Cn = Math.cos(Cn);\n var sin_Ce = Math.sin(Ce);\n var cos_Ce = Math.cos(Ce);\n\n Cn = Math.atan2(sin_Cn * cos_Ce, hypot(sin_Ce, cos_Ce * cos_Cn));\n Ce = Math.atan2(sin_Ce, cos_Ce * cos_Cn);\n\n lon = adjust_lon(Ce + this.long0, this.over);\n lat = gatg(this.cgb, Cn);\n } else {\n lon = Infinity;\n lat = Infinity;\n }\n\n p.x = lon;\n p.y = lat;\n\n return p;\n}\n\nexport var names = ['Extended_Transverse_Mercator', 'Extended Transverse Mercator', 'etmerc', 'Transverse_Mercator', 'Transverse Mercator', 'Gauss Kruger', 'Gauss_Kruger', 'tmerc'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import adjust_lon from './adjust_lon';\n\nexport default function (zone, lon) {\n if (zone === undefined) {\n zone = Math.floor((adjust_lon(lon) + Math.PI) * 30 / Math.PI) + 1;\n\n if (zone < 0) {\n return 0;\n } else if (zone > 60) {\n return 60;\n }\n }\n return zone;\n}\n","import adjust_zone from '../common/adjust_zone';\nimport etmerc from './etmerc';\nexport var dependsOn = 'etmerc';\nimport { D2R } from '../constants/values';\n\n/** @this {import('../defs.js').ProjectionDefinition} */\nexport function init() {\n var zone = adjust_zone(this.zone, this.long0);\n if (zone === undefined) {\n throw new Error('unknown utm zone');\n }\n this.lat0 = 0;\n this.long0 = ((6 * Math.abs(zone)) - 183) * D2R;\n this.x0 = 500000;\n this.y0 = this.utmSouth ? 10000000 : 0;\n this.k0 = 0.9996;\n\n etmerc.init.apply(this);\n this.forward = etmerc.forward;\n this.inverse = etmerc.inverse;\n}\n\nexport var names = ['Universal Transverse Mercator System', 'utm'];\nexport default {\n init: init,\n names: names,\n dependsOn: dependsOn\n};\n","export default function (esinp, exp) {\n return (Math.pow((1 - esinp) / (1 + esinp), exp));\n}\n","import srat from '../common/srat';\nvar MAX_ITER = 20;\nimport { HALF_PI, FORTPI } from '../constants/values';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} rc\n * @property {number} C\n * @property {number} phic0\n * @property {number} ratexp\n * @property {number} K\n * @property {number} e\n * @property {number} es\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n var sphi = Math.sin(this.lat0);\n var cphi = Math.cos(this.lat0);\n cphi *= cphi;\n this.rc = Math.sqrt(1 - this.es) / (1 - this.es * sphi * sphi);\n this.C = Math.sqrt(1 + this.es * cphi * cphi / (1 - this.es));\n this.phic0 = Math.asin(sphi / this.C);\n this.ratexp = 0.5 * this.C * this.e;\n this.K = Math.tan(0.5 * this.phic0 + FORTPI) / (Math.pow(Math.tan(0.5 * this.lat0 + FORTPI), this.C) * srat(this.e * sphi, this.ratexp));\n}\n\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n\n p.y = 2 * Math.atan(this.K * Math.pow(Math.tan(0.5 * lat + FORTPI), this.C) * srat(this.e * Math.sin(lat), this.ratexp)) - HALF_PI;\n p.x = this.C * lon;\n return p;\n}\n\nexport function inverse(p) {\n var DEL_TOL = 1e-14;\n var lon = p.x / this.C;\n var lat = p.y;\n var num = Math.pow(Math.tan(0.5 * lat + FORTPI) / this.K, 1 / this.C);\n for (var i = MAX_ITER; i > 0; --i) {\n lat = 2 * Math.atan(num * srat(this.e * Math.sin(p.y), -0.5 * this.e)) - HALF_PI;\n if (Math.abs(lat - p.y) < DEL_TOL) {\n break;\n }\n p.y = lat;\n }\n /* convergence failed */\n if (!i) {\n return null;\n }\n p.x = lon;\n p.y = lat;\n return p;\n}\n\nexport var names = ['gauss'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import gauss from './gauss';\nimport adjust_lon from '../common/adjust_lon';\nimport hypot from '../common/hypot';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} sinc0\n * @property {number} cosc0\n * @property {number} R2\n * @property {number} rc\n * @property {number} phic0\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n gauss.init.apply(this);\n if (!this.rc) {\n return;\n }\n this.sinc0 = Math.sin(this.phic0);\n this.cosc0 = Math.cos(this.phic0);\n this.R2 = 2 * this.rc;\n if (!this.title) {\n this.title = 'Oblique Stereographic Alternative';\n }\n}\n\nexport function forward(p) {\n var sinc, cosc, cosl, k;\n p.x = adjust_lon(p.x - this.long0, this.over);\n gauss.forward.apply(this, [p]);\n sinc = Math.sin(p.y);\n cosc = Math.cos(p.y);\n cosl = Math.cos(p.x);\n k = this.k0 * this.R2 / (1 + this.sinc0 * sinc + this.cosc0 * cosc * cosl);\n p.x = k * cosc * Math.sin(p.x);\n p.y = k * (this.cosc0 * sinc - this.sinc0 * cosc * cosl);\n p.x = this.a * p.x + this.x0;\n p.y = this.a * p.y + this.y0;\n return p;\n}\n\nexport function inverse(p) {\n var sinc, cosc, lon, lat, rho;\n p.x = (p.x - this.x0) / this.a;\n p.y = (p.y - this.y0) / this.a;\n\n p.x /= this.k0;\n p.y /= this.k0;\n if ((rho = hypot(p.x, p.y))) {\n var c = 2 * Math.atan2(rho, this.R2);\n sinc = Math.sin(c);\n cosc = Math.cos(c);\n lat = Math.asin(cosc * this.sinc0 + p.y * sinc * this.cosc0 / rho);\n lon = Math.atan2(p.x * sinc, rho * this.cosc0 * cosc - p.y * this.sinc0 * sinc);\n } else {\n lat = this.phic0;\n lon = 0;\n }\n\n p.x = lon;\n p.y = lat;\n gauss.inverse.apply(this, [p]);\n p.x = adjust_lon(p.x + this.long0, this.over);\n return p;\n}\n\nexport var names = ['Stereographic_North_Pole', 'Oblique_Stereographic', 'sterea', 'Oblique Stereographic Alternative', 'Double_Stereographic'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import { EPSLN, HALF_PI } from '../constants/values';\n\nimport sign from '../common/sign';\nimport msfnz from '../common/msfnz';\nimport tsfnz from '../common/tsfnz';\nimport phi2z from '../common/phi2z';\nimport adjust_lon from '../common/adjust_lon';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} coslat0\n * @property {number} sinlat0\n * @property {number} ms1\n * @property {number} X0\n * @property {number} cosX0\n * @property {number} sinX0\n * @property {number} con\n * @property {number} cons\n * @property {number} e\n */\n\nexport function ssfn_(phit, sinphi, eccen) {\n sinphi *= eccen;\n return (Math.tan(0.5 * (HALF_PI + phit)) * Math.pow((1 - sinphi) / (1 + sinphi), 0.5 * eccen));\n}\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n // setting default parameters\n this.x0 = this.x0 || 0;\n this.y0 = this.y0 || 0;\n this.lat0 = this.lat0 || 0;\n this.long0 = this.long0 || 0;\n\n this.coslat0 = Math.cos(this.lat0);\n this.sinlat0 = Math.sin(this.lat0);\n if (this.sphere) {\n if (this.k0 === 1 && !isNaN(this.lat_ts) && Math.abs(this.coslat0) <= EPSLN) {\n this.k0 = 0.5 * (1 + sign(this.lat0) * Math.sin(this.lat_ts));\n }\n } else {\n if (Math.abs(this.coslat0) <= EPSLN) {\n if (this.lat0 > 0) {\n // North pole\n // trace('stere:north pole');\n this.con = 1;\n } else {\n // South pole\n // trace('stere:south pole');\n this.con = -1;\n }\n }\n this.cons = Math.sqrt(Math.pow(1 + this.e, 1 + this.e) * Math.pow(1 - this.e, 1 - this.e));\n if (this.k0 === 1 && !isNaN(this.lat_ts) && Math.abs(this.coslat0) <= EPSLN && Math.abs(Math.cos(this.lat_ts)) > EPSLN) {\n // When k0 is 1 (default value) and lat_ts is a vaild number and lat0 is at a pole and lat_ts is not at a pole\n // Recalculate k0 using formula 21-35 from p161 of Snyder, 1987\n this.k0 = 0.5 * this.cons * msfnz(this.e, Math.sin(this.lat_ts), Math.cos(this.lat_ts)) / tsfnz(this.e, this.con * this.lat_ts, this.con * Math.sin(this.lat_ts));\n }\n this.ms1 = msfnz(this.e, this.sinlat0, this.coslat0);\n this.X0 = 2 * Math.atan(ssfn_(this.lat0, this.sinlat0, this.e)) - HALF_PI;\n this.cosX0 = Math.cos(this.X0);\n this.sinX0 = Math.sin(this.X0);\n }\n}\n\n// Stereographic forward equations--mapping lat,long to x,y\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n var sinlat = Math.sin(lat);\n var coslat = Math.cos(lat);\n var A, X, sinX, cosX, ts, rh;\n var dlon = adjust_lon(lon - this.long0, this.over);\n\n if (Math.abs(Math.abs(lon - this.long0) - Math.PI) <= EPSLN && Math.abs(lat + this.lat0) <= EPSLN) {\n // case of the origine point\n // trace('stere:this is the origin point');\n p.x = NaN;\n p.y = NaN;\n return p;\n }\n if (this.sphere) {\n // trace('stere:sphere case');\n A = 2 * this.k0 / (1 + this.sinlat0 * sinlat + this.coslat0 * coslat * Math.cos(dlon));\n p.x = this.a * A * coslat * Math.sin(dlon) + this.x0;\n p.y = this.a * A * (this.coslat0 * sinlat - this.sinlat0 * coslat * Math.cos(dlon)) + this.y0;\n return p;\n } else {\n X = 2 * Math.atan(ssfn_(lat, sinlat, this.e)) - HALF_PI;\n cosX = Math.cos(X);\n sinX = Math.sin(X);\n if (Math.abs(this.coslat0) <= EPSLN) {\n ts = tsfnz(this.e, lat * this.con, this.con * sinlat);\n rh = 2 * this.a * this.k0 * ts / this.cons;\n p.x = this.x0 + rh * Math.sin(lon - this.long0);\n p.y = this.y0 - this.con * rh * Math.cos(lon - this.long0);\n // trace(p.toString());\n return p;\n } else if (Math.abs(this.sinlat0) < EPSLN) {\n // Eq\n // trace('stere:equateur');\n A = 2 * this.a * this.k0 / (1 + cosX * Math.cos(dlon));\n p.y = A * sinX;\n } else {\n // other case\n // trace('stere:normal case');\n A = 2 * this.a * this.k0 * this.ms1 / (this.cosX0 * (1 + this.sinX0 * sinX + this.cosX0 * cosX * Math.cos(dlon)));\n p.y = A * (this.cosX0 * sinX - this.sinX0 * cosX * Math.cos(dlon)) + this.y0;\n }\n p.x = A * cosX * Math.sin(dlon) + this.x0;\n }\n // trace(p.toString());\n return p;\n}\n\n//* Stereographic inverse equations--mapping x,y to lat/long\nexport function inverse(p) {\n p.x -= this.x0;\n p.y -= this.y0;\n var lon, lat, ts, ce, Chi;\n var rh = Math.sqrt(p.x * p.x + p.y * p.y);\n if (this.sphere) {\n var c = 2 * Math.atan(rh / (2 * this.a * this.k0));\n lon = this.long0;\n lat = this.lat0;\n if (rh <= EPSLN) {\n p.x = lon;\n p.y = lat;\n return p;\n }\n lat = Math.asin(Math.cos(c) * this.sinlat0 + p.y * Math.sin(c) * this.coslat0 / rh);\n if (Math.abs(this.coslat0) < EPSLN) {\n if (this.lat0 > 0) {\n lon = adjust_lon(this.long0 + Math.atan2(p.x, -1 * p.y), this.over);\n } else {\n lon = adjust_lon(this.long0 + Math.atan2(p.x, p.y), this.over);\n }\n } else {\n lon = adjust_lon(this.long0 + Math.atan2(p.x * Math.sin(c), rh * this.coslat0 * Math.cos(c) - p.y * this.sinlat0 * Math.sin(c)), this.over);\n }\n p.x = lon;\n p.y = lat;\n return p;\n } else {\n if (Math.abs(this.coslat0) <= EPSLN) {\n if (rh <= EPSLN) {\n lat = this.lat0;\n lon = this.long0;\n p.x = lon;\n p.y = lat;\n // trace(p.toString());\n return p;\n }\n p.x *= this.con;\n p.y *= this.con;\n ts = rh * this.cons / (2 * this.a * this.k0);\n lat = this.con * phi2z(this.e, ts);\n lon = this.con * adjust_lon(this.con * this.long0 + Math.atan2(p.x, -1 * p.y), this.over);\n } else {\n ce = 2 * Math.atan(rh * this.cosX0 / (2 * this.a * this.k0 * this.ms1));\n lon = this.long0;\n if (rh <= EPSLN) {\n Chi = this.X0;\n } else {\n Chi = Math.asin(Math.cos(ce) * this.sinX0 + p.y * Math.sin(ce) * this.cosX0 / rh);\n lon = adjust_lon(this.long0 + Math.atan2(p.x * Math.sin(ce), rh * this.cosX0 * Math.cos(ce) - p.y * this.sinX0 * Math.sin(ce)), this.over);\n }\n lat = -1 * phi2z(this.e, Math.tan(0.5 * (HALF_PI + Chi)));\n }\n }\n p.x = lon;\n p.y = lat;\n\n // trace(p.toString());\n return p;\n}\n\nexport var names = ['stere', 'Stereographic_South_Pole', 'Polar_Stereographic_variant_A', 'Polar_Stereographic_variant_B', 'Polar_Stereographic'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names,\n ssfn_: ssfn_\n};\n","/*\n references:\n Formules et constantes pour le Calcul pour la\n projection cylindrique conforme à axe oblique et pour la transformation entre\n des systèmes de référence.\n http://www.swisstopo.admin.ch/internet/swisstopo/fr/home/topics/survey/sys/refsys/switzerland.parsysrelated1.31216.downloadList.77004.DownloadFile.tmp/swissprojectionfr.pdf\n */\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} lambda0\n * @property {number} e\n * @property {number} R\n * @property {number} b0\n * @property {number} K\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n var phy0 = this.lat0;\n this.lambda0 = this.long0;\n var sinPhy0 = Math.sin(phy0);\n var semiMajorAxis = this.a;\n var invF = this.rf;\n var flattening = 1 / invF;\n var e2 = 2 * flattening - Math.pow(flattening, 2);\n var e = this.e = Math.sqrt(e2);\n this.R = this.k0 * semiMajorAxis * Math.sqrt(1 - e2) / (1 - e2 * Math.pow(sinPhy0, 2));\n this.alpha = Math.sqrt(1 + e2 / (1 - e2) * Math.pow(Math.cos(phy0), 4));\n this.b0 = Math.asin(sinPhy0 / this.alpha);\n var k1 = Math.log(Math.tan(Math.PI / 4 + this.b0 / 2));\n var k2 = Math.log(Math.tan(Math.PI / 4 + phy0 / 2));\n var k3 = Math.log((1 + e * sinPhy0) / (1 - e * sinPhy0));\n this.K = k1 - this.alpha * k2 + this.alpha * e / 2 * k3;\n}\n\nexport function forward(p) {\n var Sa1 = Math.log(Math.tan(Math.PI / 4 - p.y / 2));\n var Sa2 = this.e / 2 * Math.log((1 + this.e * Math.sin(p.y)) / (1 - this.e * Math.sin(p.y)));\n var S = -this.alpha * (Sa1 + Sa2) + this.K;\n\n // spheric latitude\n var b = 2 * (Math.atan(Math.exp(S)) - Math.PI / 4);\n\n // spheric longitude\n var I = this.alpha * (p.x - this.lambda0);\n\n // psoeudo equatorial rotation\n var rotI = Math.atan(Math.sin(I) / (Math.sin(this.b0) * Math.tan(b) + Math.cos(this.b0) * Math.cos(I)));\n\n var rotB = Math.asin(Math.cos(this.b0) * Math.sin(b) - Math.sin(this.b0) * Math.cos(b) * Math.cos(I));\n\n p.y = this.R / 2 * Math.log((1 + Math.sin(rotB)) / (1 - Math.sin(rotB))) + this.y0;\n p.x = this.R * rotI + this.x0;\n return p;\n}\n\nexport function inverse(p) {\n var Y = p.x - this.x0;\n var X = p.y - this.y0;\n\n var rotI = Y / this.R;\n var rotB = 2 * (Math.atan(Math.exp(X / this.R)) - Math.PI / 4);\n\n var b = Math.asin(Math.cos(this.b0) * Math.sin(rotB) + Math.sin(this.b0) * Math.cos(rotB) * Math.cos(rotI));\n var I = Math.atan(Math.sin(rotI) / (Math.cos(this.b0) * Math.cos(rotI) - Math.sin(this.b0) * Math.tan(rotB)));\n\n var lambda = this.lambda0 + I / this.alpha;\n\n var S = 0;\n var phy = b;\n var prevPhy = -1000;\n var iteration = 0;\n while (Math.abs(phy - prevPhy) > 0.0000001) {\n if (++iteration > 20) {\n // ...reportError(\"omercFwdInfinity\");\n return;\n }\n // S = Math.log(Math.tan(Math.PI / 4 + phy / 2));\n S = 1 / this.alpha * (Math.log(Math.tan(Math.PI / 4 + b / 2)) - this.K) + this.e * Math.log(Math.tan(Math.PI / 4 + Math.asin(this.e * Math.sin(phy)) / 2));\n prevPhy = phy;\n phy = 2 * Math.atan(Math.exp(S)) - Math.PI / 2;\n }\n\n p.x = lambda;\n p.y = phy;\n return p;\n}\n\nexport var names = ['somerc'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import tsfnz from '../common/tsfnz';\nimport adjust_lon from '../common/adjust_lon';\nimport phi2z from '../common/phi2z';\nimport { EPSLN, HALF_PI, TWO_PI, FORTPI } from '../constants/values';\nimport { getNormalizedProjName } from '../projections';\n\n/**\n * @typedef {Object} LocalThis\n * @property {boolean} no_off\n * @property {boolean} no_rot\n * @property {number} rectified_grid_angle\n * @property {number} es\n * @property {number} A\n * @property {number} B\n * @property {number} E\n * @property {number} e\n * @property {number} lam0\n * @property {number} singam\n * @property {number} cosgam\n * @property {number} sinrot\n * @property {number} cosrot\n * @property {number} rB\n * @property {number} ArB\n * @property {number} BrA\n * @property {number} u_0\n * @property {number} v_pole_n\n * @property {number} v_pole_s\n */\n\nvar TOL = 1e-7;\n\nfunction isTypeA(P) {\n var typeAProjections = ['Hotine_Oblique_Mercator', 'Hotine_Oblique_Mercator_variant_A', 'Hotine_Oblique_Mercator_Azimuth_Natural_Origin'];\n var projectionName = typeof P.projName === 'object' ? Object.keys(P.projName)[0] : P.projName;\n\n return 'no_uoff' in P || 'no_off' in P || typeAProjections.indexOf(projectionName) !== -1 || typeAProjections.indexOf(getNormalizedProjName(projectionName)) !== -1;\n}\n\n/**\n * Initialize the Oblique Mercator projection\n * @this {import('../defs.js').ProjectionDefinition & LocalThis}\n */\nexport function init() {\n var con, com, cosph0, D, F, H, L, sinph0, p, J, gamma = 0,\n gamma0, lamc = 0, lam1 = 0, lam2 = 0, phi1 = 0, phi2 = 0, alpha_c = 0;\n\n // only Type A uses the no_off or no_uoff property\n // https://github.com/OSGeo/proj.4/issues/104\n this.no_off = isTypeA(this);\n this.no_rot = 'no_rot' in this;\n\n var alp = false;\n if ('alpha' in this) {\n alp = true;\n }\n\n var gam = false;\n if ('rectified_grid_angle' in this) {\n gam = true;\n }\n\n if (alp) {\n alpha_c = this.alpha;\n }\n\n if (gam) {\n gamma = this.rectified_grid_angle;\n }\n\n if (alp || gam) {\n lamc = this.longc;\n } else {\n lam1 = this.long1;\n phi1 = this.lat1;\n lam2 = this.long2;\n phi2 = this.lat2;\n\n if (Math.abs(phi1 - phi2) <= TOL || (con = Math.abs(phi1)) <= TOL\n || Math.abs(con - HALF_PI) <= TOL || Math.abs(Math.abs(this.lat0) - HALF_PI) <= TOL\n || Math.abs(Math.abs(phi2) - HALF_PI) <= TOL) {\n throw new Error();\n }\n }\n\n var one_es = 1.0 - this.es;\n com = Math.sqrt(one_es);\n\n if (Math.abs(this.lat0) > EPSLN) {\n sinph0 = Math.sin(this.lat0);\n cosph0 = Math.cos(this.lat0);\n con = 1 - this.es * sinph0 * sinph0;\n this.B = cosph0 * cosph0;\n this.B = Math.sqrt(1 + this.es * this.B * this.B / one_es);\n this.A = this.B * this.k0 * com / con;\n D = this.B * com / (cosph0 * Math.sqrt(con));\n F = D * D - 1;\n\n if (F <= 0) {\n F = 0;\n } else {\n F = Math.sqrt(F);\n if (this.lat0 < 0) {\n F = -F;\n }\n }\n\n this.E = F += D;\n this.E *= Math.pow(tsfnz(this.e, this.lat0, sinph0), this.B);\n } else {\n this.B = 1 / com;\n this.A = this.k0;\n this.E = D = F = 1;\n }\n\n if (alp || gam) {\n if (alp) {\n gamma0 = Math.asin(Math.sin(alpha_c) / D);\n if (!gam) {\n gamma = alpha_c;\n }\n } else {\n gamma0 = gamma;\n alpha_c = Math.asin(D * Math.sin(gamma0));\n }\n this.lam0 = lamc - Math.asin(0.5 * (F - 1 / F) * Math.tan(gamma0)) / this.B;\n } else {\n H = Math.pow(tsfnz(this.e, phi1, Math.sin(phi1)), this.B);\n L = Math.pow(tsfnz(this.e, phi2, Math.sin(phi2)), this.B);\n F = this.E / H;\n p = (L - H) / (L + H);\n J = this.E * this.E;\n J = (J - L * H) / (J + L * H);\n con = lam1 - lam2;\n\n if (con < -Math.PI) {\n lam2 -= TWO_PI;\n } else if (con > Math.PI) {\n lam2 += TWO_PI;\n }\n\n this.lam0 = adjust_lon(0.5 * (lam1 + lam2) - Math.atan(J * Math.tan(0.5 * this.B * (lam1 - lam2)) / p) / this.B, this.over);\n gamma0 = Math.atan(2 * Math.sin(this.B * adjust_lon(lam1 - this.lam0, this.over)) / (F - 1 / F));\n gamma = alpha_c = Math.asin(D * Math.sin(gamma0));\n }\n\n this.singam = Math.sin(gamma0);\n this.cosgam = Math.cos(gamma0);\n this.sinrot = Math.sin(gamma);\n this.cosrot = Math.cos(gamma);\n\n this.rB = 1 / this.B;\n this.ArB = this.A * this.rB;\n this.BrA = 1 / this.ArB;\n\n if (this.no_off) {\n this.u_0 = 0;\n } else {\n this.u_0 = Math.abs(this.ArB * Math.atan(Math.sqrt(D * D - 1) / Math.cos(alpha_c)));\n\n if (this.lat0 < 0) {\n this.u_0 = -this.u_0;\n }\n }\n\n F = 0.5 * gamma0;\n this.v_pole_n = this.ArB * Math.log(Math.tan(FORTPI - F));\n this.v_pole_s = this.ArB * Math.log(Math.tan(FORTPI + F));\n}\n\n/* Oblique Mercator forward equations--mapping lat,long to x,y\n ---------------------------------------------------------- */\nexport function forward(p) {\n var coords = {};\n var S, T, U, V, W, temp, u, v;\n p.x = p.x - this.lam0;\n\n if (Math.abs(Math.abs(p.y) - HALF_PI) > EPSLN) {\n W = this.E / Math.pow(tsfnz(this.e, p.y, Math.sin(p.y)), this.B);\n\n temp = 1 / W;\n S = 0.5 * (W - temp);\n T = 0.5 * (W + temp);\n V = Math.sin(this.B * p.x);\n U = (S * this.singam - V * this.cosgam) / T;\n\n if (Math.abs(Math.abs(U) - 1.0) < EPSLN) {\n throw new Error();\n }\n\n v = 0.5 * this.ArB * Math.log((1 - U) / (1 + U));\n temp = Math.cos(this.B * p.x);\n\n if (Math.abs(temp) < TOL) {\n u = this.A * p.x;\n } else {\n u = this.ArB * Math.atan2((S * this.cosgam + V * this.singam), temp);\n }\n } else {\n v = p.y > 0 ? this.v_pole_n : this.v_pole_s;\n u = this.ArB * p.y;\n }\n\n if (this.no_rot) {\n coords.x = u;\n coords.y = v;\n } else {\n u -= this.u_0;\n coords.x = v * this.cosrot + u * this.sinrot;\n coords.y = u * this.cosrot - v * this.sinrot;\n }\n\n coords.x = (this.a * coords.x + this.x0);\n coords.y = (this.a * coords.y + this.y0);\n\n return coords;\n}\n\nexport function inverse(p) {\n var u, v, Qp, Sp, Tp, Vp, Up;\n var coords = {};\n\n p.x = (p.x - this.x0) * (1.0 / this.a);\n p.y = (p.y - this.y0) * (1.0 / this.a);\n\n if (this.no_rot) {\n v = p.y;\n u = p.x;\n } else {\n v = p.x * this.cosrot - p.y * this.sinrot;\n u = p.y * this.cosrot + p.x * this.sinrot + this.u_0;\n }\n\n Qp = Math.exp(-this.BrA * v);\n Sp = 0.5 * (Qp - 1 / Qp);\n Tp = 0.5 * (Qp + 1 / Qp);\n Vp = Math.sin(this.BrA * u);\n Up = (Vp * this.cosgam + Sp * this.singam) / Tp;\n\n if (Math.abs(Math.abs(Up) - 1) < EPSLN) {\n coords.x = 0;\n coords.y = Up < 0 ? -HALF_PI : HALF_PI;\n } else {\n coords.y = this.E / Math.sqrt((1 + Up) / (1 - Up));\n coords.y = phi2z(this.e, Math.pow(coords.y, 1 / this.B));\n\n if (coords.y === Infinity) {\n throw new Error();\n }\n\n coords.x = -this.rB * Math.atan2((Sp * this.cosgam - Vp * this.singam), Math.cos(this.BrA * u));\n }\n\n coords.x += this.lam0;\n\n return coords;\n}\n\nexport var names = ['Hotine_Oblique_Mercator', 'Hotine Oblique Mercator', 'Hotine_Oblique_Mercator_variant_A', 'Hotine_Oblique_Mercator_Variant_B', 'Hotine_Oblique_Mercator_Azimuth_Natural_Origin', 'Hotine_Oblique_Mercator_Two_Point_Natural_Origin', 'Hotine_Oblique_Mercator_Azimuth_Center', 'Oblique_Mercator', 'omerc'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import msfnz from '../common/msfnz';\nimport tsfnz from '../common/tsfnz';\nimport sign from '../common/sign';\nimport adjust_lon from '../common/adjust_lon';\nimport phi2z from '../common/phi2z';\nimport { HALF_PI, EPSLN } from '../constants/values';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} e\n * @property {number} ns\n * @property {number} f0\n * @property {number} rh\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n // double lat0; /* the reference latitude */\n // double long0; /* the reference longitude */\n // double lat1; /* first standard parallel */\n // double lat2; /* second standard parallel */\n // double r_maj; /* major axis */\n // double r_min; /* minor axis */\n // double false_east; /* x offset in meters */\n // double false_north; /* y offset in meters */\n\n // the above value can be set with proj4.defs\n // example: proj4.defs(\"EPSG:2154\",\"+proj=lcc +lat_1=49 +lat_2=44 +lat_0=46.5 +lon_0=3 +x_0=700000 +y_0=6600000 +ellps=GRS80 +towgs84=0,0,0,0,0,0,0 +units=m +no_defs\");\n\n if (!this.lat2) {\n this.lat2 = this.lat1;\n } // if lat2 is not defined\n if (!this.k0) {\n this.k0 = 1;\n }\n this.x0 = this.x0 || 0;\n this.y0 = this.y0 || 0;\n // Standard Parallels cannot be equal and on opposite sides of the equator\n if (Math.abs(this.lat1 + this.lat2) < EPSLN) {\n return;\n }\n\n var temp = this.b / this.a;\n this.e = Math.sqrt(1 - temp * temp);\n\n var sin1 = Math.sin(this.lat1);\n var cos1 = Math.cos(this.lat1);\n var ms1 = msfnz(this.e, sin1, cos1);\n var ts1 = tsfnz(this.e, this.lat1, sin1);\n\n var sin2 = Math.sin(this.lat2);\n var cos2 = Math.cos(this.lat2);\n var ms2 = msfnz(this.e, sin2, cos2);\n var ts2 = tsfnz(this.e, this.lat2, sin2);\n\n var ts0 = Math.abs(Math.abs(this.lat0) - HALF_PI) < EPSLN\n ? 0 // Handle poles by setting ts0 to 0\n : tsfnz(this.e, this.lat0, Math.sin(this.lat0));\n\n if (Math.abs(this.lat1 - this.lat2) > EPSLN) {\n this.ns = Math.log(ms1 / ms2) / Math.log(ts1 / ts2);\n } else {\n this.ns = sin1;\n }\n if (isNaN(this.ns)) {\n this.ns = sin1;\n }\n this.f0 = ms1 / (this.ns * Math.pow(ts1, this.ns));\n this.rh = this.a * this.f0 * Math.pow(ts0, this.ns);\n if (!this.title) {\n this.title = 'Lambert Conformal Conic';\n }\n}\n\n// Lambert Conformal conic forward equations--mapping lat,long to x,y\n// -----------------------------------------------------------------\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n\n // singular cases :\n if (Math.abs(2 * Math.abs(lat) - Math.PI) <= EPSLN) {\n lat = sign(lat) * (HALF_PI - 2 * EPSLN);\n }\n\n var con = Math.abs(Math.abs(lat) - HALF_PI);\n var ts, rh1;\n if (con > EPSLN) {\n ts = tsfnz(this.e, lat, Math.sin(lat));\n rh1 = this.a * this.f0 * Math.pow(ts, this.ns);\n } else {\n con = lat * this.ns;\n if (con <= 0) {\n return null;\n }\n rh1 = 0;\n }\n var theta = this.ns * adjust_lon(lon - this.long0, this.over);\n p.x = this.k0 * (rh1 * Math.sin(theta)) + this.x0;\n p.y = this.k0 * (this.rh - rh1 * Math.cos(theta)) + this.y0;\n\n return p;\n}\n\n// Lambert Conformal Conic inverse equations--mapping x,y to lat/long\n// -----------------------------------------------------------------\nexport function inverse(p) {\n var rh1, con, ts;\n var lat, lon;\n var x = (p.x - this.x0) / this.k0;\n var y = (this.rh - (p.y - this.y0) / this.k0);\n if (this.ns > 0) {\n rh1 = Math.sqrt(x * x + y * y);\n con = 1;\n } else {\n rh1 = -Math.sqrt(x * x + y * y);\n con = -1;\n }\n var theta = 0;\n if (rh1 !== 0) {\n theta = Math.atan2((con * x), (con * y));\n }\n if ((rh1 !== 0) || (this.ns > 0)) {\n con = 1 / this.ns;\n ts = Math.pow((rh1 / (this.a * this.f0)), con);\n lat = phi2z(this.e, ts);\n if (lat === -9999) {\n return null;\n }\n } else {\n lat = -HALF_PI;\n }\n lon = adjust_lon(theta / this.ns + this.long0, this.over);\n\n p.x = lon;\n p.y = lat;\n return p;\n}\n\nexport var names = [\n 'Lambert Tangential Conformal Conic Projection',\n 'Lambert_Conformal_Conic',\n 'Lambert_Conformal_Conic_1SP',\n 'Lambert_Conformal_Conic_2SP',\n 'lcc',\n 'Lambert Conic Conformal (1SP)',\n 'Lambert Conic Conformal (2SP)'\n];\n\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import adjust_lon from '../common/adjust_lon';\n\nexport function init() {\n this.a = 6377397.155;\n this.es = 0.006674372230614;\n this.e = Math.sqrt(this.es);\n if (!this.lat0) {\n this.lat0 = 0.863937979737193;\n }\n if (!this.long0) {\n this.long0 = 0.7417649320975901 - 0.308341501185665;\n }\n /* if scale not set default to 0.9999 */\n if (!this.k0) {\n this.k0 = 0.9999;\n }\n this.s45 = 0.785398163397448; /* 45 */\n this.s90 = 2 * this.s45;\n this.fi0 = this.lat0;\n this.e2 = this.es;\n this.e = Math.sqrt(this.e2);\n this.alfa = Math.sqrt(1 + (this.e2 * Math.pow(Math.cos(this.fi0), 4)) / (1 - this.e2));\n this.uq = 1.04216856380474;\n this.u0 = Math.asin(Math.sin(this.fi0) / this.alfa);\n this.g = Math.pow((1 + this.e * Math.sin(this.fi0)) / (1 - this.e * Math.sin(this.fi0)), this.alfa * this.e / 2);\n this.k = Math.tan(this.u0 / 2 + this.s45) / Math.pow(Math.tan(this.fi0 / 2 + this.s45), this.alfa) * this.g;\n this.k1 = this.k0;\n this.n0 = this.a * Math.sqrt(1 - this.e2) / (1 - this.e2 * Math.pow(Math.sin(this.fi0), 2));\n this.s0 = 1.37008346281555;\n this.n = Math.sin(this.s0);\n this.ro0 = this.k1 * this.n0 / Math.tan(this.s0);\n this.ad = this.s90 - this.uq;\n}\n\n/* ellipsoid */\n/* calculate xy from lat/lon */\n/* Constants, identical to inverse transform function */\nexport function forward(p) {\n var gfi, u, deltav, s, d, eps, ro;\n var lon = p.x;\n var lat = p.y;\n var delta_lon = adjust_lon(lon - this.long0, this.over);\n /* Transformation */\n gfi = Math.pow(((1 + this.e * Math.sin(lat)) / (1 - this.e * Math.sin(lat))), (this.alfa * this.e / 2));\n u = 2 * (Math.atan(this.k * Math.pow(Math.tan(lat / 2 + this.s45), this.alfa) / gfi) - this.s45);\n deltav = -delta_lon * this.alfa;\n s = Math.asin(Math.cos(this.ad) * Math.sin(u) + Math.sin(this.ad) * Math.cos(u) * Math.cos(deltav));\n d = Math.asin(Math.cos(u) * Math.sin(deltav) / Math.cos(s));\n eps = this.n * d;\n ro = this.ro0 * Math.pow(Math.tan(this.s0 / 2 + this.s45), this.n) / Math.pow(Math.tan(s / 2 + this.s45), this.n);\n p.y = ro * Math.cos(eps) / 1;\n p.x = ro * Math.sin(eps) / 1;\n\n if (!this.czech) {\n p.y *= -1;\n p.x *= -1;\n }\n return (p);\n}\n\n/* calculate lat/lon from xy */\nexport function inverse(p) {\n var u, deltav, s, d, eps, ro, fi1;\n var ok;\n\n /* Transformation */\n /* revert y, x */\n var tmp = p.x;\n p.x = p.y;\n p.y = tmp;\n if (!this.czech) {\n p.y *= -1;\n p.x *= -1;\n }\n ro = Math.sqrt(p.x * p.x + p.y * p.y);\n eps = Math.atan2(p.y, p.x);\n d = eps / Math.sin(this.s0);\n s = 2 * (Math.atan(Math.pow(this.ro0 / ro, 1 / this.n) * Math.tan(this.s0 / 2 + this.s45)) - this.s45);\n u = Math.asin(Math.cos(this.ad) * Math.sin(s) - Math.sin(this.ad) * Math.cos(s) * Math.cos(d));\n deltav = Math.asin(Math.cos(s) * Math.sin(d) / Math.cos(u));\n p.x = this.long0 - deltav / this.alfa;\n fi1 = u;\n ok = 0;\n var iter = 0;\n do {\n p.y = 2 * (Math.atan(Math.pow(this.k, -1 / this.alfa) * Math.pow(Math.tan(u / 2 + this.s45), 1 / this.alfa) * Math.pow((1 + this.e * Math.sin(fi1)) / (1 - this.e * Math.sin(fi1)), this.e / 2)) - this.s45);\n if (Math.abs(fi1 - p.y) < 0.0000000001) {\n ok = 1;\n }\n fi1 = p.y;\n iter += 1;\n } while (ok === 0 && iter < 15);\n if (iter >= 15) {\n return null;\n }\n\n return (p);\n}\n\nexport var names = ['Krovak', 'krovak'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","export default function (e0, e1, e2, e3, phi) {\n return (e0 * phi - e1 * Math.sin(2 * phi) + e2 * Math.sin(4 * phi) - e3 * Math.sin(6 * phi));\n}\n","export default function (x) {\n return (1 - 0.25 * x * (1 + x / 16 * (3 + 1.25 * x)));\n}\n","export default function (x) {\n return (0.375 * x * (1 + 0.25 * x * (1 + 0.46875 * x)));\n}\n","export default function (x) {\n return (0.05859375 * x * x * (1 + 0.75 * x));\n}\n","export default function (x) {\n return (x * x * x * (35 / 3072));\n}\n","export default function (a, e, sinphi) {\n var temp = e * sinphi;\n return a / Math.sqrt(1 - temp * temp);\n}\n","import { HALF_PI } from '../constants/values';\nimport sign from './sign';\n\nexport default function (x) {\n return (Math.abs(x) < HALF_PI) ? x : (x - (sign(x) * Math.PI));\n}\n","export default function (ml, e0, e1, e2, e3) {\n var phi;\n var dphi;\n\n phi = ml / e0;\n for (var i = 0; i < 15; i++) {\n dphi = (ml - (e0 * phi - e1 * Math.sin(2 * phi) + e2 * Math.sin(4 * phi) - e3 * Math.sin(6 * phi))) / (e0 - 2 * e1 * Math.cos(2 * phi) + 4 * e2 * Math.cos(4 * phi) - 6 * e3 * Math.cos(6 * phi));\n phi += dphi;\n if (Math.abs(dphi) <= 0.0000000001) {\n return phi;\n }\n }\n\n // ..reportError(\"IMLFN-CONV:Latitude failed to converge after 15 iterations\");\n return NaN;\n}\n","import mlfn from '../common/mlfn';\nimport e0fn from '../common/e0fn';\nimport e1fn from '../common/e1fn';\nimport e2fn from '../common/e2fn';\nimport e3fn from '../common/e3fn';\nimport gN from '../common/gN';\nimport adjust_lon from '../common/adjust_lon';\nimport adjust_lat from '../common/adjust_lat';\nimport imlfn from '../common/imlfn';\nimport { HALF_PI, EPSLN } from '../constants/values';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} es\n * @property {number} e0\n * @property {number} e1\n * @property {number} e2\n * @property {number} e3\n * @property {number} ml0\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n if (!this.sphere) {\n this.e0 = e0fn(this.es);\n this.e1 = e1fn(this.es);\n this.e2 = e2fn(this.es);\n this.e3 = e3fn(this.es);\n this.ml0 = this.a * mlfn(this.e0, this.e1, this.e2, this.e3, this.lat0);\n }\n}\n\n/* Cassini forward equations--mapping lat,long to x,y\n ----------------------------------------------------------------------- */\nexport function forward(p) {\n /* Forward equations\n ----------------- */\n var x, y;\n var lam = p.x;\n var phi = p.y;\n lam = adjust_lon(lam - this.long0, this.over);\n\n if (this.sphere) {\n x = this.a * Math.asin(Math.cos(phi) * Math.sin(lam));\n y = this.a * (Math.atan2(Math.tan(phi), Math.cos(lam)) - this.lat0);\n } else {\n // ellipsoid\n var sinphi = Math.sin(phi);\n var cosphi = Math.cos(phi);\n var nl = gN(this.a, this.e, sinphi);\n var tl = Math.tan(phi) * Math.tan(phi);\n var al = lam * Math.cos(phi);\n var asq = al * al;\n var cl = this.es * cosphi * cosphi / (1 - this.es);\n var ml = this.a * mlfn(this.e0, this.e1, this.e2, this.e3, phi);\n\n x = nl * al * (1 - asq * tl * (1 / 6 - (8 - tl + 8 * cl) * asq / 120));\n y = ml - this.ml0 + nl * sinphi / cosphi * asq * (0.5 + (5 - tl + 6 * cl) * asq / 24);\n }\n\n p.x = x + this.x0;\n p.y = y + this.y0;\n return p;\n}\n\n/* Inverse equations\n ----------------- */\nexport function inverse(p) {\n p.x -= this.x0;\n p.y -= this.y0;\n var x = p.x / this.a;\n var y = p.y / this.a;\n var phi, lam;\n\n if (this.sphere) {\n var dd = y + this.lat0;\n phi = Math.asin(Math.sin(dd) * Math.cos(x));\n lam = Math.atan2(Math.tan(x), Math.cos(dd));\n } else {\n /* ellipsoid */\n var ml1 = this.ml0 / this.a + y;\n var phi1 = imlfn(ml1, this.e0, this.e1, this.e2, this.e3);\n if (Math.abs(Math.abs(phi1) - HALF_PI) <= EPSLN) {\n p.x = this.long0;\n p.y = HALF_PI;\n if (y < 0) {\n p.y *= -1;\n }\n return p;\n }\n var nl1 = gN(this.a, this.e, Math.sin(phi1));\n\n var rl1 = nl1 * nl1 * nl1 / this.a / this.a * (1 - this.es);\n var tl1 = Math.pow(Math.tan(phi1), 2);\n var dl = x * this.a / nl1;\n var dsq = dl * dl;\n phi = phi1 - nl1 * Math.tan(phi1) / rl1 * dl * dl * (0.5 - (1 + 3 * tl1) * dl * dl / 24);\n lam = dl * (1 - dsq * (tl1 / 3 + (1 + 3 * tl1) * tl1 * dsq / 15)) / Math.cos(phi1);\n }\n\n p.x = adjust_lon(lam + this.long0, this.over);\n p.y = adjust_lat(phi);\n return p;\n}\n\nexport var names = ['Cassini', 'Cassini_Soldner', 'cass'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","export default function (eccent, sinphi) {\n var con;\n if (eccent > 1.0e-7) {\n con = eccent * sinphi;\n return ((1 - eccent * eccent) * (sinphi / (1 - con * con) - (0.5 / eccent) * Math.log((1 - con) / (1 + con))));\n } else {\n return (2 * sinphi);\n }\n}\n","import { HALF_PI, EPSLN, FORTPI } from '../constants/values';\n\nimport qsfnz from '../common/qsfnz';\nimport adjust_lon from '../common/adjust_lon';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} mode\n * @property {Array<number>} apa\n * @property {number} dd\n * @property {number} e\n * @property {number} es\n * @property {number} mmf\n * @property {number} rq\n * @property {number} qp\n * @property {number} sinb1\n * @property {number} cosb1\n * @property {number} ymf\n * @property {number} xmf\n * @property {number} sinph0\n * @property {number} cosph0\n */\n\n/*\n reference\n \"New Equal-Area Map Projections for Noncircular Regions\", John P. Snyder,\n The American Cartographer, Vol 15, No. 4, October 1988, pp. 341-355.\n */\n\nexport var S_POLE = 1;\nexport var N_POLE = 2;\nexport var EQUIT = 3;\nexport var OBLIQ = 4;\n\n/**\n * Initialize the Lambert Azimuthal Equal Area projection\n * @this {import('../defs.js').ProjectionDefinition & LocalThis}\n */\nexport function init() {\n var t = Math.abs(this.lat0);\n if (Math.abs(t - HALF_PI) < EPSLN) {\n this.mode = this.lat0 < 0 ? S_POLE : N_POLE;\n } else if (Math.abs(t) < EPSLN) {\n this.mode = EQUIT;\n } else {\n this.mode = OBLIQ;\n }\n if (this.es > 0) {\n var sinphi;\n\n this.qp = qsfnz(this.e, 1);\n this.mmf = 0.5 / (1 - this.es);\n this.apa = authset(this.es);\n switch (this.mode) {\n case N_POLE:\n this.dd = 1;\n break;\n case S_POLE:\n this.dd = 1;\n break;\n case EQUIT:\n this.rq = Math.sqrt(0.5 * this.qp);\n this.dd = 1 / this.rq;\n this.xmf = 1;\n this.ymf = 0.5 * this.qp;\n break;\n case OBLIQ:\n this.rq = Math.sqrt(0.5 * this.qp);\n sinphi = Math.sin(this.lat0);\n this.sinb1 = qsfnz(this.e, sinphi) / this.qp;\n this.cosb1 = Math.sqrt(1 - this.sinb1 * this.sinb1);\n this.dd = Math.cos(this.lat0) / (Math.sqrt(1 - this.es * sinphi * sinphi) * this.rq * this.cosb1);\n this.ymf = (this.xmf = this.rq) / this.dd;\n this.xmf *= this.dd;\n break;\n }\n } else {\n if (this.mode === OBLIQ) {\n this.sinph0 = Math.sin(this.lat0);\n this.cosph0 = Math.cos(this.lat0);\n }\n }\n}\n\n/* Lambert Azimuthal Equal Area forward equations--mapping lat,long to x,y\n ----------------------------------------------------------------------- */\nexport function forward(p) {\n /* Forward equations\n ----------------- */\n var x, y, coslam, sinlam, sinphi, q, sinb, cosb, b, cosphi;\n var lam = p.x;\n var phi = p.y;\n\n lam = adjust_lon(lam - this.long0, this.over);\n if (this.sphere) {\n sinphi = Math.sin(phi);\n cosphi = Math.cos(phi);\n coslam = Math.cos(lam);\n if (this.mode === this.OBLIQ || this.mode === this.EQUIT) {\n y = (this.mode === this.EQUIT) ? 1 + cosphi * coslam : 1 + this.sinph0 * sinphi + this.cosph0 * cosphi * coslam;\n if (y <= EPSLN) {\n return null;\n }\n y = Math.sqrt(2 / y);\n x = y * cosphi * Math.sin(lam);\n y *= (this.mode === this.EQUIT) ? sinphi : this.cosph0 * sinphi - this.sinph0 * cosphi * coslam;\n } else if (this.mode === this.N_POLE || this.mode === this.S_POLE) {\n if (this.mode === this.N_POLE) {\n coslam = -coslam;\n }\n if (Math.abs(phi + this.lat0) < EPSLN) {\n return null;\n }\n y = FORTPI - phi * 0.5;\n y = 2 * ((this.mode === this.S_POLE) ? Math.cos(y) : Math.sin(y));\n x = y * Math.sin(lam);\n y *= coslam;\n }\n } else {\n sinb = 0;\n cosb = 0;\n b = 0;\n coslam = Math.cos(lam);\n sinlam = Math.sin(lam);\n sinphi = Math.sin(phi);\n q = qsfnz(this.e, sinphi);\n if (this.mode === this.OBLIQ || this.mode === this.EQUIT) {\n sinb = q / this.qp;\n cosb = Math.sqrt(1 - sinb * sinb);\n }\n switch (this.mode) {\n case this.OBLIQ:\n b = 1 + this.sinb1 * sinb + this.cosb1 * cosb * coslam;\n break;\n case this.EQUIT:\n b = 1 + cosb * coslam;\n break;\n case this.N_POLE:\n b = HALF_PI + phi;\n q = this.qp - q;\n break;\n case this.S_POLE:\n b = phi - HALF_PI;\n q = this.qp + q;\n break;\n }\n if (Math.abs(b) < EPSLN) {\n return null;\n }\n switch (this.mode) {\n case this.OBLIQ:\n case this.EQUIT:\n b = Math.sqrt(2 / b);\n if (this.mode === this.OBLIQ) {\n y = this.ymf * b * (this.cosb1 * sinb - this.sinb1 * cosb * coslam);\n } else {\n y = (b = Math.sqrt(2 / (1 + cosb * coslam))) * sinb * this.ymf;\n }\n x = this.xmf * b * cosb * sinlam;\n break;\n case this.N_POLE:\n case this.S_POLE:\n if (q >= 0) {\n x = (b = Math.sqrt(q)) * sinlam;\n y = coslam * ((this.mode === this.S_POLE) ? b : -b);\n } else {\n x = y = 0;\n }\n break;\n }\n }\n\n p.x = this.a * x + this.x0;\n p.y = this.a * y + this.y0;\n return p;\n}\n\n/* Inverse equations\n ----------------- */\nexport function inverse(p) {\n p.x -= this.x0;\n p.y -= this.y0;\n var x = p.x / this.a;\n var y = p.y / this.a;\n var lam, phi, cCe, sCe, q, rho, ab;\n if (this.sphere) {\n var cosz = 0,\n rh, sinz = 0;\n\n rh = Math.sqrt(x * x + y * y);\n phi = rh * 0.5;\n if (phi > 1) {\n return null;\n }\n phi = 2 * Math.asin(phi);\n if (this.mode === this.OBLIQ || this.mode === this.EQUIT) {\n sinz = Math.sin(phi);\n cosz = Math.cos(phi);\n }\n switch (this.mode) {\n case this.EQUIT:\n phi = (Math.abs(rh) <= EPSLN) ? 0 : Math.asin(y * sinz / rh);\n x *= sinz;\n y = cosz * rh;\n break;\n case this.OBLIQ:\n phi = (Math.abs(rh) <= EPSLN) ? this.lat0 : Math.asin(cosz * this.sinph0 + y * sinz * this.cosph0 / rh);\n x *= sinz * this.cosph0;\n y = (cosz - Math.sin(phi) * this.sinph0) * rh;\n break;\n case this.N_POLE:\n y = -y;\n phi = HALF_PI - phi;\n break;\n case this.S_POLE:\n phi -= HALF_PI;\n break;\n }\n lam = (y === 0 && (this.mode === this.EQUIT || this.mode === this.OBLIQ)) ? 0 : Math.atan2(x, y);\n } else {\n ab = 0;\n if (this.mode === this.OBLIQ || this.mode === this.EQUIT) {\n x /= this.dd;\n y *= this.dd;\n rho = Math.sqrt(x * x + y * y);\n if (rho < EPSLN) {\n p.x = this.long0;\n p.y = this.lat0;\n return p;\n }\n sCe = 2 * Math.asin(0.5 * rho / this.rq);\n cCe = Math.cos(sCe);\n x *= (sCe = Math.sin(sCe));\n if (this.mode === this.OBLIQ) {\n ab = cCe * this.sinb1 + y * sCe * this.cosb1 / rho;\n q = this.qp * ab;\n y = rho * this.cosb1 * cCe - y * this.sinb1 * sCe;\n } else {\n ab = y * sCe / rho;\n q = this.qp * ab;\n y = rho * cCe;\n }\n } else if (this.mode === this.N_POLE || this.mode === this.S_POLE) {\n if (this.mode === this.N_POLE) {\n y = -y;\n }\n q = (x * x + y * y);\n if (!q) {\n p.x = this.long0;\n p.y = this.lat0;\n return p;\n }\n ab = 1 - q / this.qp;\n if (this.mode === this.S_POLE) {\n ab = -ab;\n }\n }\n lam = Math.atan2(x, y);\n phi = authlat(Math.asin(ab), this.apa);\n }\n\n p.x = adjust_lon(this.long0 + lam, this.over);\n p.y = phi;\n return p;\n}\n\n/* determine latitude from authalic latitude */\nvar P00 = 0.33333333333333333333;\n\nvar P01 = 0.17222222222222222222;\nvar P02 = 0.10257936507936507936;\nvar P10 = 0.06388888888888888888;\nvar P11 = 0.06640211640211640211;\nvar P20 = 0.01641501294219154443;\n\nfunction authset(es) {\n var t;\n var APA = [];\n APA[0] = es * P00;\n t = es * es;\n APA[0] += t * P01;\n APA[1] = t * P10;\n t *= es;\n APA[0] += t * P02;\n APA[1] += t * P11;\n APA[2] = t * P20;\n return APA;\n}\n\nfunction authlat(beta, APA) {\n var t = beta + beta;\n return (beta + APA[0] * Math.sin(t) + APA[1] * Math.sin(t + t) + APA[2] * Math.sin(t + t + t));\n}\n\nexport var names = ['Lambert Azimuthal Equal Area', 'Lambert_Azimuthal_Equal_Area', 'laea'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names,\n S_POLE: S_POLE,\n N_POLE: N_POLE,\n EQUIT: EQUIT,\n OBLIQ: OBLIQ\n};\n","export default function (x) {\n if (Math.abs(x) > 1) {\n x = (x > 1) ? 1 : -1;\n }\n return Math.asin(x);\n}\n","import msfnz from '../common/msfnz';\nimport qsfnz from '../common/qsfnz';\nimport adjust_lon from '../common/adjust_lon';\nimport asinz from '../common/asinz';\nimport { EPSLN } from '../constants/values';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} temp\n * @property {number} es\n * @property {number} e3\n * @property {number} sin_po\n * @property {number} cos_po\n * @property {number} t1\n * @property {number} con\n * @property {number} ms1\n * @property {number} qs1\n * @property {number} t2\n * @property {number} ms2\n * @property {number} qs2\n * @property {number} t3\n * @property {number} qs0\n * @property {number} ns0\n * @property {number} c\n * @property {number} rh\n * @property {number} sin_phi\n * @property {number} cos_phi\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n if (Math.abs(this.lat1 + this.lat2) < EPSLN) {\n return;\n }\n this.temp = this.b / this.a;\n this.es = 1 - Math.pow(this.temp, 2);\n this.e3 = Math.sqrt(this.es);\n\n this.sin_po = Math.sin(this.lat1);\n this.cos_po = Math.cos(this.lat1);\n this.t1 = this.sin_po;\n this.con = this.sin_po;\n this.ms1 = msfnz(this.e3, this.sin_po, this.cos_po);\n this.qs1 = qsfnz(this.e3, this.sin_po);\n\n this.sin_po = Math.sin(this.lat2);\n this.cos_po = Math.cos(this.lat2);\n this.t2 = this.sin_po;\n this.ms2 = msfnz(this.e3, this.sin_po, this.cos_po);\n this.qs2 = qsfnz(this.e3, this.sin_po);\n\n this.sin_po = Math.sin(this.lat0);\n this.cos_po = Math.cos(this.lat0);\n this.t3 = this.sin_po;\n this.qs0 = qsfnz(this.e3, this.sin_po);\n\n if (Math.abs(this.lat1 - this.lat2) > EPSLN) {\n this.ns0 = (this.ms1 * this.ms1 - this.ms2 * this.ms2) / (this.qs2 - this.qs1);\n } else {\n this.ns0 = this.con;\n }\n this.c = this.ms1 * this.ms1 + this.ns0 * this.qs1;\n this.rh = this.a * Math.sqrt(this.c - this.ns0 * this.qs0) / this.ns0;\n}\n\n/* Albers Conical Equal Area forward equations--mapping lat,long to x,y\n ------------------------------------------------------------------- */\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n\n this.sin_phi = Math.sin(lat);\n this.cos_phi = Math.cos(lat);\n\n var qs = qsfnz(this.e3, this.sin_phi);\n var rh1 = this.a * Math.sqrt(this.c - this.ns0 * qs) / this.ns0;\n var theta = this.ns0 * adjust_lon(lon - this.long0, this.over);\n var x = rh1 * Math.sin(theta) + this.x0;\n var y = this.rh - rh1 * Math.cos(theta) + this.y0;\n\n p.x = x;\n p.y = y;\n return p;\n}\n\nexport function inverse(p) {\n var rh1, qs, con, theta, lon, lat;\n\n p.x -= this.x0;\n p.y = this.rh - p.y + this.y0;\n if (this.ns0 >= 0) {\n rh1 = Math.sqrt(p.x * p.x + p.y * p.y);\n con = 1;\n } else {\n rh1 = -Math.sqrt(p.x * p.x + p.y * p.y);\n con = -1;\n }\n theta = 0;\n if (rh1 !== 0) {\n theta = Math.atan2(con * p.x, con * p.y);\n }\n con = rh1 * this.ns0 / this.a;\n if (this.sphere) {\n lat = Math.asin((this.c - con * con) / (2 * this.ns0));\n } else {\n qs = (this.c - con * con) / this.ns0;\n lat = this.phi1z(this.e3, qs);\n }\n\n lon = adjust_lon(theta / this.ns0 + this.long0, this.over);\n p.x = lon;\n p.y = lat;\n return p;\n}\n\n/* Function to compute phi1, the latitude for the inverse of the\n Albers Conical Equal-Area projection.\n------------------------------------------- */\nexport function phi1z(eccent, qs) {\n var sinphi, cosphi, con, com, dphi;\n var phi = asinz(0.5 * qs);\n if (eccent < EPSLN) {\n return phi;\n }\n\n var eccnts = eccent * eccent;\n for (var i = 1; i <= 25; i++) {\n sinphi = Math.sin(phi);\n cosphi = Math.cos(phi);\n con = eccent * sinphi;\n com = 1 - con * con;\n dphi = 0.5 * com * com / cosphi * (qs / (1 - eccnts) - sinphi / com + 0.5 / eccent * Math.log((1 - con) / (1 + con)));\n phi = phi + dphi;\n if (Math.abs(dphi) <= 1e-7) {\n return phi;\n }\n }\n return null;\n}\n\nexport var names = ['Albers_Conic_Equal_Area', 'Albers_Equal_Area', 'Albers', 'aea'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names,\n phi1z: phi1z\n};\n","import adjust_lon from '../common/adjust_lon';\nimport asinz from '../common/asinz';\nimport { EPSLN } from '../constants/values';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} sin_p14\n * @property {number} cos_p14\n * @property {number} infinity_dist\n * @property {number} rc\n */\n\n/**\n reference:\n Wolfram Mathworld \"Gnomonic Projection\"\n http://mathworld.wolfram.com/GnomonicProjection.html\n Accessed: 12th November 2009\n @this {import('../defs.js').ProjectionDefinition & LocalThis}\n */\nexport function init() {\n /* Place parameters in static storage for common use\n ------------------------------------------------- */\n this.sin_p14 = Math.sin(this.lat0);\n this.cos_p14 = Math.cos(this.lat0);\n // Approximation for projecting points to the horizon (infinity)\n this.infinity_dist = 1000 * this.a;\n this.rc = 1;\n}\n\n/* Gnomonic forward equations--mapping lat,long to x,y\n --------------------------------------------------- */\nexport function forward(p) {\n var sinphi, cosphi; /* sin and cos value */\n var dlon; /* delta longitude value */\n var coslon; /* cos of longitude */\n var ksp; /* scale factor */\n var g;\n var x, y;\n var lon = p.x;\n var lat = p.y;\n /* Forward equations\n ----------------- */\n dlon = adjust_lon(lon - this.long0, this.over);\n\n sinphi = Math.sin(lat);\n cosphi = Math.cos(lat);\n\n coslon = Math.cos(dlon);\n g = this.sin_p14 * sinphi + this.cos_p14 * cosphi * coslon;\n ksp = 1;\n if ((g > 0) || (Math.abs(g) <= EPSLN)) {\n x = this.x0 + this.a * ksp * cosphi * Math.sin(dlon) / g;\n y = this.y0 + this.a * ksp * (this.cos_p14 * sinphi - this.sin_p14 * cosphi * coslon) / g;\n } else {\n // Point is in the opposing hemisphere and is unprojectable\n // We still need to return a reasonable point, so we project\n // to infinity, on a bearing\n // equivalent to the northern hemisphere equivalent\n // This is a reasonable approximation for short shapes and lines that\n // straddle the horizon.\n\n x = this.x0 + this.infinity_dist * cosphi * Math.sin(dlon);\n y = this.y0 + this.infinity_dist * (this.cos_p14 * sinphi - this.sin_p14 * cosphi * coslon);\n }\n p.x = x;\n p.y = y;\n return p;\n}\n\nexport function inverse(p) {\n var rh; /* Rho */\n var sinc, cosc;\n var c;\n var lon, lat;\n\n /* Inverse equations\n ----------------- */\n p.x = (p.x - this.x0) / this.a;\n p.y = (p.y - this.y0) / this.a;\n\n p.x /= this.k0;\n p.y /= this.k0;\n\n if ((rh = Math.sqrt(p.x * p.x + p.y * p.y))) {\n c = Math.atan2(rh, this.rc);\n sinc = Math.sin(c);\n cosc = Math.cos(c);\n\n lat = asinz(cosc * this.sin_p14 + (p.y * sinc * this.cos_p14) / rh);\n lon = Math.atan2(p.x * sinc, rh * this.cos_p14 * cosc - p.y * this.sin_p14 * sinc);\n lon = adjust_lon(this.long0 + lon, this.over);\n } else {\n lat = this.phic0;\n lon = 0;\n }\n\n p.x = lon;\n p.y = lat;\n return p;\n}\n\nexport var names = ['gnom'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import { HALF_PI } from '../constants/values';\n\nexport default function (eccent, q) {\n var temp = 1 - (1 - eccent * eccent) / (2 * eccent) * Math.log((1 - eccent) / (1 + eccent));\n if (Math.abs(Math.abs(q) - temp) < 1.0E-6) {\n if (q < 0) {\n return (-1 * HALF_PI);\n } else {\n return HALF_PI;\n }\n }\n // var phi = 0.5* q/(1-eccent*eccent);\n var phi = Math.asin(0.5 * q);\n var dphi;\n var sin_phi;\n var cos_phi;\n var con;\n for (var i = 0; i < 30; i++) {\n sin_phi = Math.sin(phi);\n cos_phi = Math.cos(phi);\n con = eccent * sin_phi;\n dphi = Math.pow(1 - con * con, 2) / (2 * cos_phi) * (q / (1 - eccent * eccent) - sin_phi / (1 - con * con) + 0.5 / eccent * Math.log((1 - con) / (1 + con)));\n phi += dphi;\n if (Math.abs(dphi) <= 0.0000000001) {\n return phi;\n }\n }\n\n // console.log(\"IQSFN-CONV:Latitude failed to converge after 30 iterations\");\n return NaN;\n}\n","import adjust_lon from '../common/adjust_lon';\nimport qsfnz from '../common/qsfnz';\nimport msfnz from '../common/msfnz';\nimport iqsfnz from '../common/iqsfnz';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} e\n */\n\n/**\n reference:\n \"Cartographic Projection Procedures for the UNIX Environment-\n A User's Manual\" by Gerald I. Evenden,\n USGS Open File Report 90-284and Release 4 Interim Reports (2003)\n @this {import('../defs.js').ProjectionDefinition & LocalThis}\n*/\nexport function init() {\n // no-op\n if (!this.sphere) {\n this.k0 = msfnz(this.e, Math.sin(this.lat_ts), Math.cos(this.lat_ts));\n }\n}\n\n/* Cylindrical Equal Area forward equations--mapping lat,long to x,y\n ------------------------------------------------------------ */\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n var x, y;\n /* Forward equations\n ----------------- */\n var dlon = adjust_lon(lon - this.long0, this.over);\n if (this.sphere) {\n x = this.x0 + this.a * dlon * Math.cos(this.lat_ts);\n y = this.y0 + this.a * Math.sin(lat) / Math.cos(this.lat_ts);\n } else {\n var qs = qsfnz(this.e, Math.sin(lat));\n x = this.x0 + this.a * this.k0 * dlon;\n y = this.y0 + this.a * qs * 0.5 / this.k0;\n }\n\n p.x = x;\n p.y = y;\n return p;\n}\n\n/* Cylindrical Equal Area inverse equations--mapping x,y to lat/long\n ------------------------------------------------------------ */\nexport function inverse(p) {\n p.x -= this.x0;\n p.y -= this.y0;\n var lon, lat;\n\n if (this.sphere) {\n lon = adjust_lon(this.long0 + (p.x / this.a) / Math.cos(this.lat_ts), this.over);\n lat = Math.asin((p.y / this.a) * Math.cos(this.lat_ts));\n } else {\n lat = iqsfnz(this.e, 2 * p.y * this.k0 / this.a);\n lon = adjust_lon(this.long0 + p.x / (this.a * this.k0), this.over);\n }\n\n p.x = lon;\n p.y = lat;\n return p;\n}\n\nexport var names = ['cea'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import adjust_lon from '../common/adjust_lon';\nimport adjust_lat from '../common/adjust_lat';\n\nexport function init() {\n this.x0 = this.x0 || 0;\n this.y0 = this.y0 || 0;\n this.lat0 = this.lat0 || 0;\n this.long0 = this.long0 || 0;\n this.lat_ts = this.lat_ts || 0;\n this.title = this.title || 'Equidistant Cylindrical (Plate Carre)';\n\n this.rc = Math.cos(this.lat_ts);\n}\n\n// forward equations--mapping lat,long to x,y\n// -----------------------------------------------------------------\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n\n var dlon = adjust_lon(lon - this.long0, this.over);\n var dlat = adjust_lat(lat - this.lat0);\n p.x = this.x0 + (this.a * dlon * this.rc);\n p.y = this.y0 + (this.a * dlat);\n return p;\n}\n\n// inverse equations--mapping x,y to lat/long\n// -----------------------------------------------------------------\nexport function inverse(p) {\n var x = p.x;\n var y = p.y;\n\n p.x = adjust_lon(this.long0 + ((x - this.x0) / (this.a * this.rc)), this.over);\n p.y = adjust_lat(this.lat0 + ((y - this.y0) / (this.a)));\n return p;\n}\n\nexport var names = ['Equirectangular', 'Equidistant_Cylindrical', 'Equidistant_Cylindrical_Spherical', 'eqc'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import e0fn from '../common/e0fn';\nimport e1fn from '../common/e1fn';\nimport e2fn from '../common/e2fn';\nimport e3fn from '../common/e3fn';\nimport adjust_lon from '../common/adjust_lon';\nimport adjust_lat from '../common/adjust_lat';\nimport mlfn from '../common/mlfn';\nimport { EPSLN } from '../constants/values';\n\nimport gN from '../common/gN';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} temp\n * @property {number} es\n * @property {number} e\n * @property {number} e0\n * @property {number} e1\n * @property {number} e2\n * @property {number} e3\n * @property {number} ml0\n */\n\nvar MAX_ITER = 20;\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n /* Place parameters in static storage for common use\n ------------------------------------------------- */\n this.temp = this.b / this.a;\n this.es = 1 - Math.pow(this.temp, 2); // devait etre dans tmerc.js mais n y est pas donc je commente sinon retour de valeurs nulles\n this.e = Math.sqrt(this.es);\n this.e0 = e0fn(this.es);\n this.e1 = e1fn(this.es);\n this.e2 = e2fn(this.es);\n this.e3 = e3fn(this.es);\n this.ml0 = this.a * mlfn(this.e0, this.e1, this.e2, this.e3, this.lat0); // si que des zeros le calcul ne se fait pas\n}\n\n/* Polyconic forward equations--mapping lat,long to x,y\n --------------------------------------------------- */\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n var x, y, el;\n var dlon = adjust_lon(lon - this.long0, this.over);\n el = dlon * Math.sin(lat);\n if (this.sphere) {\n if (Math.abs(lat) <= EPSLN) {\n x = this.a * dlon;\n y = -1 * this.a * this.lat0;\n } else {\n x = this.a * Math.sin(el) / Math.tan(lat);\n y = this.a * (adjust_lat(lat - this.lat0) + (1 - Math.cos(el)) / Math.tan(lat));\n }\n } else {\n if (Math.abs(lat) <= EPSLN) {\n x = this.a * dlon;\n y = -1 * this.ml0;\n } else {\n var nl = gN(this.a, this.e, Math.sin(lat)) / Math.tan(lat);\n x = nl * Math.sin(el);\n y = this.a * mlfn(this.e0, this.e1, this.e2, this.e3, lat) - this.ml0 + nl * (1 - Math.cos(el));\n }\n }\n p.x = x + this.x0;\n p.y = y + this.y0;\n return p;\n}\n\n/* Inverse equations\n ----------------- */\nexport function inverse(p) {\n var lon, lat, x, y, i;\n var al, bl;\n var phi, dphi;\n x = p.x - this.x0;\n y = p.y - this.y0;\n\n if (this.sphere) {\n if (Math.abs(y + this.a * this.lat0) <= EPSLN) {\n lon = adjust_lon(x / this.a + this.long0, this.over);\n lat = 0;\n } else {\n al = this.lat0 + y / this.a;\n bl = x * x / this.a / this.a + al * al;\n phi = al;\n var tanphi;\n for (i = MAX_ITER; i; --i) {\n tanphi = Math.tan(phi);\n dphi = -1 * (al * (phi * tanphi + 1) - phi - 0.5 * (phi * phi + bl) * tanphi) / ((phi - al) / tanphi - 1);\n phi += dphi;\n if (Math.abs(dphi) <= EPSLN) {\n lat = phi;\n break;\n }\n }\n lon = adjust_lon(this.long0 + (Math.asin(x * Math.tan(phi) / this.a)) / Math.sin(lat), this.over);\n }\n } else {\n if (Math.abs(y + this.ml0) <= EPSLN) {\n lat = 0;\n lon = adjust_lon(this.long0 + x / this.a, this.over);\n } else {\n al = (this.ml0 + y) / this.a;\n bl = x * x / this.a / this.a + al * al;\n phi = al;\n var cl, mln, mlnp, ma;\n var con;\n for (i = MAX_ITER; i; --i) {\n con = this.e * Math.sin(phi);\n cl = Math.sqrt(1 - con * con) * Math.tan(phi);\n mln = this.a * mlfn(this.e0, this.e1, this.e2, this.e3, phi);\n mlnp = this.e0 - 2 * this.e1 * Math.cos(2 * phi) + 4 * this.e2 * Math.cos(4 * phi) - 6 * this.e3 * Math.cos(6 * phi);\n ma = mln / this.a;\n dphi = (al * (cl * ma + 1) - ma - 0.5 * cl * (ma * ma + bl)) / (this.es * Math.sin(2 * phi) * (ma * ma + bl - 2 * al * ma) / (4 * cl) + (al - ma) * (cl * mlnp - 2 / Math.sin(2 * phi)) - mlnp);\n phi -= dphi;\n if (Math.abs(dphi) <= EPSLN) {\n lat = phi;\n break;\n }\n }\n\n // lat=phi4z(this.e,this.e0,this.e1,this.e2,this.e3,al,bl,0,0);\n cl = Math.sqrt(1 - this.es * Math.pow(Math.sin(lat), 2)) * Math.tan(lat);\n lon = adjust_lon(this.long0 + Math.asin(x * cl / this.a) / Math.sin(lat), this.over);\n }\n }\n\n p.x = lon;\n p.y = lat;\n return p;\n}\n\nexport var names = ['Polyconic', 'American_Polyconic', 'poly'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import { SEC_TO_RAD } from '../constants/values';\n\n/*\n reference\n Department of Land and Survey Technical Circular 1973/32\n http://www.linz.govt.nz/docs/miscellaneous/nz-map-definition.pdf\n OSG Technical Report 4.1\n http://www.linz.govt.nz/docs/miscellaneous/nzmg.pdf\n */\n\n/**\n * iterations: Number of iterations to refine inverse transform.\n * 0 -> km accuracy\n * 1 -> m accuracy -- suitable for most mapping applications\n * 2 -> mm accuracy\n */\nexport var iterations = 1;\n\nexport function init() {\n this.A = [];\n this.A[1] = 0.6399175073;\n this.A[2] = -0.1358797613;\n this.A[3] = 0.063294409;\n this.A[4] = -0.02526853;\n this.A[5] = 0.0117879;\n this.A[6] = -0.0055161;\n this.A[7] = 0.0026906;\n this.A[8] = -0.001333;\n this.A[9] = 0.00067;\n this.A[10] = -0.00034;\n\n this.B_re = [];\n this.B_im = [];\n this.B_re[1] = 0.7557853228;\n this.B_im[1] = 0;\n this.B_re[2] = 0.249204646;\n this.B_im[2] = 0.003371507;\n this.B_re[3] = -0.001541739;\n this.B_im[3] = 0.041058560;\n this.B_re[4] = -0.10162907;\n this.B_im[4] = 0.01727609;\n this.B_re[5] = -0.26623489;\n this.B_im[5] = -0.36249218;\n this.B_re[6] = -0.6870983;\n this.B_im[6] = -1.1651967;\n\n this.C_re = [];\n this.C_im = [];\n this.C_re[1] = 1.3231270439;\n this.C_im[1] = 0;\n this.C_re[2] = -0.577245789;\n this.C_im[2] = -0.007809598;\n this.C_re[3] = 0.508307513;\n this.C_im[3] = -0.112208952;\n this.C_re[4] = -0.15094762;\n this.C_im[4] = 0.18200602;\n this.C_re[5] = 1.01418179;\n this.C_im[5] = 1.64497696;\n this.C_re[6] = 1.9660549;\n this.C_im[6] = 2.5127645;\n\n this.D = [];\n this.D[1] = 1.5627014243;\n this.D[2] = 0.5185406398;\n this.D[3] = -0.03333098;\n this.D[4] = -0.1052906;\n this.D[5] = -0.0368594;\n this.D[6] = 0.007317;\n this.D[7] = 0.01220;\n this.D[8] = 0.00394;\n this.D[9] = -0.0013;\n}\n\n/**\n New Zealand Map Grid Forward - long/lat to x/y\n long/lat in radians\n */\nexport function forward(p) {\n var n;\n var lon = p.x;\n var lat = p.y;\n\n var delta_lat = lat - this.lat0;\n var delta_lon = lon - this.long0;\n\n // 1. Calculate d_phi and d_psi ... // and d_lambda\n // For this algorithm, delta_latitude is in seconds of arc x 10-5, so we need to scale to those units. Longitude is radians.\n var d_phi = delta_lat / SEC_TO_RAD * 1E-5;\n var d_lambda = delta_lon;\n var d_phi_n = 1; // d_phi^0\n\n var d_psi = 0;\n for (n = 1; n <= 10; n++) {\n d_phi_n = d_phi_n * d_phi;\n d_psi = d_psi + this.A[n] * d_phi_n;\n }\n\n // 2. Calculate theta\n var th_re = d_psi;\n var th_im = d_lambda;\n\n // 3. Calculate z\n var th_n_re = 1;\n var th_n_im = 0; // theta^0\n var th_n_re1;\n var th_n_im1;\n\n var z_re = 0;\n var z_im = 0;\n for (n = 1; n <= 6; n++) {\n th_n_re1 = th_n_re * th_re - th_n_im * th_im;\n th_n_im1 = th_n_im * th_re + th_n_re * th_im;\n th_n_re = th_n_re1;\n th_n_im = th_n_im1;\n z_re = z_re + this.B_re[n] * th_n_re - this.B_im[n] * th_n_im;\n z_im = z_im + this.B_im[n] * th_n_re + this.B_re[n] * th_n_im;\n }\n\n // 4. Calculate easting and northing\n p.x = (z_im * this.a) + this.x0;\n p.y = (z_re * this.a) + this.y0;\n\n return p;\n}\n\n/**\n New Zealand Map Grid Inverse - x/y to long/lat\n */\nexport function inverse(p) {\n var n;\n var x = p.x;\n var y = p.y;\n\n var delta_x = x - this.x0;\n var delta_y = y - this.y0;\n\n // 1. Calculate z\n var z_re = delta_y / this.a;\n var z_im = delta_x / this.a;\n\n // 2a. Calculate theta - first approximation gives km accuracy\n var z_n_re = 1;\n var z_n_im = 0; // z^0\n var z_n_re1;\n var z_n_im1;\n\n var th_re = 0;\n var th_im = 0;\n for (n = 1; n <= 6; n++) {\n z_n_re1 = z_n_re * z_re - z_n_im * z_im;\n z_n_im1 = z_n_im * z_re + z_n_re * z_im;\n z_n_re = z_n_re1;\n z_n_im = z_n_im1;\n th_re = th_re + this.C_re[n] * z_n_re - this.C_im[n] * z_n_im;\n th_im = th_im + this.C_im[n] * z_n_re + this.C_re[n] * z_n_im;\n }\n\n // 2b. Iterate to refine the accuracy of the calculation\n // 0 iterations gives km accuracy\n // 1 iteration gives m accuracy -- good enough for most mapping applications\n // 2 iterations bives mm accuracy\n for (var i = 0; i < this.iterations; i++) {\n var th_n_re = th_re;\n var th_n_im = th_im;\n var th_n_re1;\n var th_n_im1;\n\n var num_re = z_re;\n var num_im = z_im;\n for (n = 2; n <= 6; n++) {\n th_n_re1 = th_n_re * th_re - th_n_im * th_im;\n th_n_im1 = th_n_im * th_re + th_n_re * th_im;\n th_n_re = th_n_re1;\n th_n_im = th_n_im1;\n num_re = num_re + (n - 1) * (this.B_re[n] * th_n_re - this.B_im[n] * th_n_im);\n num_im = num_im + (n - 1) * (this.B_im[n] * th_n_re + this.B_re[n] * th_n_im);\n }\n\n th_n_re = 1;\n th_n_im = 0;\n var den_re = this.B_re[1];\n var den_im = this.B_im[1];\n for (n = 2; n <= 6; n++) {\n th_n_re1 = th_n_re * th_re - th_n_im * th_im;\n th_n_im1 = th_n_im * th_re + th_n_re * th_im;\n th_n_re = th_n_re1;\n th_n_im = th_n_im1;\n den_re = den_re + n * (this.B_re[n] * th_n_re - this.B_im[n] * th_n_im);\n den_im = den_im + n * (this.B_im[n] * th_n_re + this.B_re[n] * th_n_im);\n }\n\n // Complex division\n var den2 = den_re * den_re + den_im * den_im;\n th_re = (num_re * den_re + num_im * den_im) / den2;\n th_im = (num_im * den_re - num_re * den_im) / den2;\n }\n\n // 3. Calculate d_phi ... // and d_lambda\n var d_psi = th_re;\n var d_lambda = th_im;\n var d_psi_n = 1; // d_psi^0\n\n var d_phi = 0;\n for (n = 1; n <= 9; n++) {\n d_psi_n = d_psi_n * d_psi;\n d_phi = d_phi + this.D[n] * d_psi_n;\n }\n\n // 4. Calculate latitude and longitude\n // d_phi is calcuated in second of arc * 10^-5, so we need to scale back to radians. d_lambda is in radians.\n var lat = this.lat0 + (d_phi * SEC_TO_RAD * 1E5);\n var lon = this.long0 + d_lambda;\n\n p.x = lon;\n p.y = lat;\n\n return p;\n}\n\nexport var names = ['New_Zealand_Map_Grid', 'nzmg'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import adjust_lon from '../common/adjust_lon';\n\n/*\n reference\n \"New Equal-Area Map Projections for Noncircular Regions\", John P. Snyder,\n The American Cartographer, Vol 15, No. 4, October 1988, pp. 341-355.\n */\n\n/* Initialize the Miller Cylindrical projection\n ------------------------------------------- */\nexport function init() {\n // no-op\n}\n\n/* Miller Cylindrical forward equations--mapping lat,long to x,y\n ------------------------------------------------------------ */\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n /* Forward equations\n ----------------- */\n var dlon = adjust_lon(lon - this.long0, this.over);\n var x = this.x0 + this.a * dlon;\n var y = this.y0 + this.a * Math.log(Math.tan((Math.PI / 4) + (lat / 2.5))) * 1.25;\n\n p.x = x;\n p.y = y;\n return p;\n}\n\n/* Miller Cylindrical inverse equations--mapping x,y to lat/long\n ------------------------------------------------------------ */\nexport function inverse(p) {\n p.x -= this.x0;\n p.y -= this.y0;\n\n var lon = adjust_lon(this.long0 + p.x / this.a, this.over);\n var lat = 2.5 * (Math.atan(Math.exp(0.8 * p.y / this.a)) - Math.PI / 4);\n\n p.x = lon;\n p.y = lat;\n return p;\n}\n\nexport var names = ['Miller_Cylindrical', 'mill'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import adjust_lon from '../common/adjust_lon';\nimport adjust_lat from '../common/adjust_lat';\nimport pj_enfn from '../common/pj_enfn';\nvar MAX_ITER = 20;\nimport pj_mlfn from '../common/pj_mlfn';\nimport pj_inv_mlfn from '../common/pj_inv_mlfn';\nimport { EPSLN, HALF_PI } from '../constants/values';\n\nimport asinz from '../common/asinz';\n\n/**\n * @typedef {Object} LocalThis\n * @property {Array<number>} en\n * @property {number} n\n * @property {number} m\n * @property {number} C_y\n * @property {number} C_x\n * @property {number} es\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n /* Place parameters in static storage for common use\n ------------------------------------------------- */\n\n if (!this.sphere) {\n this.en = pj_enfn(this.es);\n } else {\n this.n = 1;\n this.m = 0;\n this.es = 0;\n this.C_y = Math.sqrt((this.m + 1) / this.n);\n this.C_x = this.C_y / (this.m + 1);\n }\n}\n\n/* Sinusoidal forward equations--mapping lat,long to x,y\n ----------------------------------------------------- */\nexport function forward(p) {\n var x, y;\n var lon = p.x;\n var lat = p.y;\n /* Forward equations\n ----------------- */\n lon = adjust_lon(lon - this.long0, this.over);\n\n if (this.sphere) {\n if (!this.m) {\n lat = this.n !== 1 ? Math.asin(this.n * Math.sin(lat)) : lat;\n } else {\n var k = this.n * Math.sin(lat);\n for (var i = MAX_ITER; i; --i) {\n var V = (this.m * lat + Math.sin(lat) - k) / (this.m + Math.cos(lat));\n lat -= V;\n if (Math.abs(V) < EPSLN) {\n break;\n }\n }\n }\n x = this.a * this.C_x * lon * (this.m + Math.cos(lat));\n y = this.a * this.C_y * lat;\n } else {\n var s = Math.sin(lat);\n var c = Math.cos(lat);\n y = this.a * pj_mlfn(lat, s, c, this.en);\n x = this.a * lon * c / Math.sqrt(1 - this.es * s * s);\n }\n\n p.x = x;\n p.y = y;\n return p;\n}\n\nexport function inverse(p) {\n var lat, temp, lon, s;\n\n p.x -= this.x0;\n lon = p.x / this.a;\n p.y -= this.y0;\n lat = p.y / this.a;\n\n if (this.sphere) {\n lat /= this.C_y;\n lon = lon / (this.C_x * (this.m + Math.cos(lat)));\n if (this.m) {\n lat = asinz((this.m * lat + Math.sin(lat)) / this.n);\n } else if (this.n !== 1) {\n lat = asinz(Math.sin(lat) / this.n);\n }\n lon = adjust_lon(lon + this.long0, this.over);\n lat = adjust_lat(lat);\n } else {\n lat = pj_inv_mlfn(p.y / this.a, this.es, this.en);\n s = Math.abs(lat);\n if (s < HALF_PI) {\n s = Math.sin(lat);\n temp = this.long0 + p.x * Math.sqrt(1 - this.es * s * s) / (this.a * Math.cos(lat));\n // temp = this.long0 + p.x / (this.a * Math.cos(lat));\n lon = adjust_lon(temp, this.over);\n } else if ((s - EPSLN) < HALF_PI) {\n lon = this.long0;\n }\n }\n p.x = lon;\n p.y = lat;\n return p;\n}\n\nexport var names = ['Sinusoidal', 'sinu'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import adjust_lon from '../common/adjust_lon';\nimport { EPSLN } from '../constants/values';\n\n/** @this {import('../defs.js').ProjectionDefinition} */\nexport function init() {\n this.x0 = this.x0 !== undefined ? this.x0 : 0;\n this.y0 = this.y0 !== undefined ? this.y0 : 0;\n this.long0 = this.long0 !== undefined ? this.long0 : 0;\n}\n\n/* Mollweide forward equations--mapping lat,long to x,y\n ---------------------------------------------------- */\nexport function forward(p) {\n /* Forward equations\n ----------------- */\n var lon = p.x;\n var lat = p.y;\n\n var delta_lon = adjust_lon(lon - this.long0, this.over);\n var theta = lat;\n var con = Math.PI * Math.sin(lat);\n\n /* Iterate using the Newton-Raphson method to find theta\n ----------------------------------------------------- */\n while (true) {\n var delta_theta = -(theta + Math.sin(theta) - con) / (1 + Math.cos(theta));\n theta += delta_theta;\n if (Math.abs(delta_theta) < EPSLN) {\n break;\n }\n }\n theta /= 2;\n\n /* If the latitude is 90 deg, force the x coordinate to be \"0 + false easting\"\n this is done here because of precision problems with \"cos(theta)\"\n -------------------------------------------------------------------------- */\n if (Math.PI / 2 - Math.abs(lat) < EPSLN) {\n delta_lon = 0;\n }\n var x = 0.900316316158 * this.a * delta_lon * Math.cos(theta) + this.x0;\n var y = 1.4142135623731 * this.a * Math.sin(theta) + this.y0;\n\n p.x = x;\n p.y = y;\n return p;\n}\n\nexport function inverse(p) {\n var theta;\n var arg;\n\n /* Inverse equations\n ----------------- */\n p.x -= this.x0;\n p.y -= this.y0;\n arg = p.y / (1.4142135623731 * this.a);\n\n /* Because of division by zero problems, 'arg' can not be 1. Therefore\n a number very close to one is used instead.\n ------------------------------------------------------------------- */\n if (Math.abs(arg) > 0.999999999999) {\n arg = 0.999999999999;\n }\n theta = Math.asin(arg);\n var lon = adjust_lon(this.long0 + (p.x / (0.900316316158 * this.a * Math.cos(theta))), this.over);\n if (lon < (-Math.PI)) {\n lon = -Math.PI;\n }\n if (lon > Math.PI) {\n lon = Math.PI;\n }\n arg = (2 * theta + Math.sin(2 * theta)) / Math.PI;\n if (Math.abs(arg) > 1) {\n arg = 1;\n }\n var lat = Math.asin(arg);\n\n p.x = lon;\n p.y = lat;\n return p;\n}\n\nexport var names = ['Mollweide', 'moll'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import e0fn from '../common/e0fn';\nimport e1fn from '../common/e1fn';\nimport e2fn from '../common/e2fn';\nimport e3fn from '../common/e3fn';\nimport msfnz from '../common/msfnz';\nimport mlfn from '../common/mlfn';\nimport adjust_lon from '../common/adjust_lon';\nimport adjust_lat from '../common/adjust_lat';\nimport imlfn from '../common/imlfn';\nimport { EPSLN } from '../constants/values';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} temp\n * @property {number} es\n * @property {number} e\n * @property {number} e0\n * @property {number} e1\n * @property {number} e2\n * @property {number} e3\n * @property {number} sin_phi\n * @property {number} cos_phi\n * @property {number} ms1\n * @property {number} ml1\n * @property {number} ms2\n * @property {number} ml2\n * @property {number} ns\n * @property {number} g\n * @property {number} ml0\n * @property {number} rh\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n /* Place parameters in static storage for common use\n ------------------------------------------------- */\n // Standard Parallels cannot be equal and on opposite sides of the equator\n if (Math.abs(this.lat1 + this.lat2) < EPSLN) {\n return;\n }\n this.lat2 = this.lat2 || this.lat1;\n this.temp = this.b / this.a;\n this.es = 1 - Math.pow(this.temp, 2);\n this.e = Math.sqrt(this.es);\n this.e0 = e0fn(this.es);\n this.e1 = e1fn(this.es);\n this.e2 = e2fn(this.es);\n this.e3 = e3fn(this.es);\n\n this.sin_phi = Math.sin(this.lat1);\n this.cos_phi = Math.cos(this.lat1);\n\n this.ms1 = msfnz(this.e, this.sin_phi, this.cos_phi);\n this.ml1 = mlfn(this.e0, this.e1, this.e2, this.e3, this.lat1);\n\n if (Math.abs(this.lat1 - this.lat2) < EPSLN) {\n this.ns = this.sin_phi;\n } else {\n this.sin_phi = Math.sin(this.lat2);\n this.cos_phi = Math.cos(this.lat2);\n this.ms2 = msfnz(this.e, this.sin_phi, this.cos_phi);\n this.ml2 = mlfn(this.e0, this.e1, this.e2, this.e3, this.lat2);\n this.ns = (this.ms1 - this.ms2) / (this.ml2 - this.ml1);\n }\n this.g = this.ml1 + this.ms1 / this.ns;\n this.ml0 = mlfn(this.e0, this.e1, this.e2, this.e3, this.lat0);\n this.rh = this.a * (this.g - this.ml0);\n}\n\n/* Equidistant Conic forward equations--mapping lat,long to x,y\n ----------------------------------------------------------- */\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n var rh1;\n\n /* Forward equations\n ----------------- */\n if (this.sphere) {\n rh1 = this.a * (this.g - lat);\n } else {\n var ml = mlfn(this.e0, this.e1, this.e2, this.e3, lat);\n rh1 = this.a * (this.g - ml);\n }\n var theta = this.ns * adjust_lon(lon - this.long0, this.over);\n var x = this.x0 + rh1 * Math.sin(theta);\n var y = this.y0 + this.rh - rh1 * Math.cos(theta);\n p.x = x;\n p.y = y;\n return p;\n}\n\n/* Inverse equations\n ----------------- */\nexport function inverse(p) {\n p.x -= this.x0;\n p.y = this.rh - p.y + this.y0;\n var con, rh1, lat, lon;\n if (this.ns >= 0) {\n rh1 = Math.sqrt(p.x * p.x + p.y * p.y);\n con = 1;\n } else {\n rh1 = -Math.sqrt(p.x * p.x + p.y * p.y);\n con = -1;\n }\n var theta = 0;\n if (rh1 !== 0) {\n theta = Math.atan2(con * p.x, con * p.y);\n }\n\n if (this.sphere) {\n lon = adjust_lon(this.long0 + theta / this.ns, this.over);\n lat = adjust_lat(this.g - rh1 / this.a);\n p.x = lon;\n p.y = lat;\n return p;\n } else {\n var ml = this.g - rh1 / this.a;\n lat = imlfn(ml, this.e0, this.e1, this.e2, this.e3);\n lon = adjust_lon(this.long0 + theta / this.ns, this.over);\n p.x = lon;\n p.y = lat;\n return p;\n }\n}\n\nexport var names = ['Equidistant_Conic', 'eqdc'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import adjust_lon from '../common/adjust_lon';\n\nimport { HALF_PI, EPSLN } from '../constants/values';\n\nimport asinz from '../common/asinz';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} R - Radius of the Earth\n */\n\n/**\n * Initialize the Van Der Grinten projection\n * @this {import('../defs.js').ProjectionDefinition & LocalThis}\n */\nexport function init() {\n // this.R = 6370997; //Radius of earth\n this.R = this.a;\n}\n\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n\n /* Forward equations\n ----------------- */\n var dlon = adjust_lon(lon - this.long0, this.over);\n var x, y;\n\n if (Math.abs(lat) <= EPSLN) {\n x = this.x0 + this.R * dlon;\n y = this.y0;\n }\n var theta = asinz(2 * Math.abs(lat / Math.PI));\n if ((Math.abs(dlon) <= EPSLN) || (Math.abs(Math.abs(lat) - HALF_PI) <= EPSLN)) {\n x = this.x0;\n if (lat >= 0) {\n y = this.y0 + Math.PI * this.R * Math.tan(0.5 * theta);\n } else {\n y = this.y0 + Math.PI * this.R * -Math.tan(0.5 * theta);\n }\n // return(OK);\n }\n var al = 0.5 * Math.abs((Math.PI / dlon) - (dlon / Math.PI));\n var asq = al * al;\n var sinth = Math.sin(theta);\n var costh = Math.cos(theta);\n\n var g = costh / (sinth + costh - 1);\n var gsq = g * g;\n var m = g * (2 / sinth - 1);\n var msq = m * m;\n var con = Math.PI * this.R * (al * (g - msq) + Math.sqrt(asq * (g - msq) * (g - msq) - (msq + asq) * (gsq - msq))) / (msq + asq);\n if (dlon < 0) {\n con = -con;\n }\n x = this.x0 + con;\n // con = Math.abs(con / (Math.PI * this.R));\n var q = asq + g;\n con = Math.PI * this.R * (m * q - al * Math.sqrt((msq + asq) * (asq + 1) - q * q)) / (msq + asq);\n if (lat >= 0) {\n // y = this.y0 + Math.PI * this.R * Math.sqrt(1 - con * con - 2 * al * con);\n y = this.y0 + con;\n } else {\n // y = this.y0 - Math.PI * this.R * Math.sqrt(1 - con * con - 2 * al * con);\n y = this.y0 - con;\n }\n p.x = x;\n p.y = y;\n return p;\n}\n\n/* Van Der Grinten inverse equations--mapping x,y to lat/long\n --------------------------------------------------------- */\nexport function inverse(p) {\n var lon, lat;\n var xx, yy, xys, c1, c2, c3;\n var a1;\n var m1;\n var con;\n var th1;\n var d;\n\n /* inverse equations\n ----------------- */\n p.x -= this.x0;\n p.y -= this.y0;\n con = Math.PI * this.R;\n xx = p.x / con;\n yy = p.y / con;\n xys = xx * xx + yy * yy;\n c1 = -Math.abs(yy) * (1 + xys);\n c2 = c1 - 2 * yy * yy + xx * xx;\n c3 = -2 * c1 + 1 + 2 * yy * yy + xys * xys;\n d = yy * yy / c3 + (2 * c2 * c2 * c2 / c3 / c3 / c3 - 9 * c1 * c2 / c3 / c3) / 27;\n a1 = (c1 - c2 * c2 / 3 / c3) / c3;\n m1 = 2 * Math.sqrt(-a1 / 3);\n con = ((3 * d) / a1) / m1;\n if (Math.abs(con) > 1) {\n if (con >= 0) {\n con = 1;\n } else {\n con = -1;\n }\n }\n th1 = Math.acos(con) / 3;\n if (p.y >= 0) {\n lat = (-m1 * Math.cos(th1 + Math.PI / 3) - c2 / 3 / c3) * Math.PI;\n } else {\n lat = -(-m1 * Math.cos(th1 + Math.PI / 3) - c2 / 3 / c3) * Math.PI;\n }\n\n if (Math.abs(xx) < EPSLN) {\n lon = this.long0;\n } else {\n lon = adjust_lon(this.long0 + Math.PI * (xys - 1 + Math.sqrt(1 + 2 * (xx * xx - yy * yy) + xys * xys)) / 2 / xx, this.over);\n }\n\n p.x = lon;\n p.y = lat;\n return p;\n}\n\nexport var names = ['Van_der_Grinten_I', 'VanDerGrinten', 'Van_der_Grinten', 'vandg'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","/**\n * Calculates the inverse geodesic problem using Vincenty's formulae.\n * Computes the forward azimuth and ellipsoidal distance between two points\n * specified by latitude and longitude on the surface of an ellipsoid.\n *\n * @param {number} lat1 Latitude of the first point in radians.\n * @param {number} lon1 Longitude of the first point in radians.\n * @param {number} lat2 Latitude of the second point in radians.\n * @param {number} lon2 Longitude of the second point in radians.\n * @param {number} a Semi-major axis of the ellipsoid (meters).\n * @param {number} f Flattening of the ellipsoid.\n * @returns {{ azi1: number, s12: number }} An object containing:\n * - azi1: Forward azimuth from the first point to the second point (radians).\n * - s12: Ellipsoidal distance between the two points (meters).\n */\nexport function vincentyInverse(lat1, lon1, lat2, lon2, a, f) {\n const L = lon2 - lon1;\n const U1 = Math.atan((1 - f) * Math.tan(lat1));\n const U2 = Math.atan((1 - f) * Math.tan(lat2));\n const sinU1 = Math.sin(U1), cosU1 = Math.cos(U1);\n const sinU2 = Math.sin(U2), cosU2 = Math.cos(U2);\n\n let lambda = L, lambdaP, iterLimit = 100;\n let sinLambda, cosLambda, sinSigma, cosSigma, sigma, sinAlpha, cos2Alpha, cos2SigmaM, C;\n let uSq, A, B, deltaSigma, s;\n\n do {\n sinLambda = Math.sin(lambda);\n cosLambda = Math.cos(lambda);\n sinSigma = Math.sqrt(\n (cosU2 * sinLambda) * (cosU2 * sinLambda)\n + (cosU1 * sinU2 - sinU1 * cosU2 * cosLambda)\n * (cosU1 * sinU2 - sinU1 * cosU2 * cosLambda)\n );\n if (sinSigma === 0) {\n return { azi1: 0, s12: 0 }; // coincident points\n }\n cosSigma = sinU1 * sinU2 + cosU1 * cosU2 * cosLambda;\n sigma = Math.atan2(sinSigma, cosSigma);\n sinAlpha = cosU1 * cosU2 * sinLambda / sinSigma;\n cos2Alpha = 1 - sinAlpha * sinAlpha;\n cos2SigmaM = (cos2Alpha !== 0) ? (cosSigma - 2 * sinU1 * sinU2 / cos2Alpha) : 0;\n C = f / 16 * cos2Alpha * (4 + f * (4 - 3 * cos2Alpha));\n lambdaP = lambda;\n lambda = L + (1 - C) * f * sinAlpha\n * (sigma + C * sinSigma * (cos2SigmaM + C * cosSigma * (-1 + 2 * cos2SigmaM * cos2SigmaM)));\n } while (Math.abs(lambda - lambdaP) > 1e-12 && --iterLimit > 0);\n\n if (iterLimit === 0) {\n return { azi1: NaN, s12: NaN }; // formula failed to converge\n }\n\n uSq = cos2Alpha * (a * a - (a * (1 - f)) * (a * (1 - f))) / ((a * (1 - f)) * (a * (1 - f)));\n A = 1 + uSq / 16384 * (4096 + uSq * (-768 + uSq * (320 - 175 * uSq)));\n B = uSq / 1024 * (256 + uSq * (-128 + uSq * (74 - 47 * uSq)));\n deltaSigma = B * sinSigma * (cos2SigmaM + B / 4 * (cosSigma * (-1 + 2 * cos2SigmaM * cos2SigmaM)\n - B / 6 * cos2SigmaM * (-3 + 4 * sinSigma * sinSigma) * (-3 + 4 * cos2SigmaM * cos2SigmaM)));\n\n s = (a * (1 - f)) * A * (sigma - deltaSigma);\n\n // Forward azimuth\n const azi1 = Math.atan2(cosU2 * sinLambda, cosU1 * sinU2 - sinU1 * cosU2 * cosLambda);\n\n return { azi1, s12: s };\n}\n\n/**\n * Solves the direct geodetic problem using Vincenty's formulae.\n * Given a starting point, initial azimuth, and distance, computes the destination point on the ellipsoid.\n *\n * @param {number} lat1 Latitude of the starting point in radians.\n * @param {number} lon1 Longitude of the starting point in radians.\n * @param {number} azi1 Initial azimuth (forward azimuth) in radians.\n * @param {number} s12 Distance to travel from the starting point in meters.\n * @param {number} a Semi-major axis of the ellipsoid in meters.\n * @param {number} f Flattening of the ellipsoid.\n * @returns {{lat2: number, lon2: number}} The latitude and longitude (in radians) of the destination point.\n */\nexport function vincentyDirect(lat1, lon1, azi1, s12, a, f) {\n const U1 = Math.atan((1 - f) * Math.tan(lat1));\n const sinU1 = Math.sin(U1), cosU1 = Math.cos(U1);\n const sinAlpha1 = Math.sin(azi1), cosAlpha1 = Math.cos(azi1);\n\n const sigma1 = Math.atan2(sinU1, cosU1 * cosAlpha1);\n const sinAlpha = cosU1 * sinAlpha1;\n const cos2Alpha = 1 - sinAlpha * sinAlpha;\n const uSq = cos2Alpha * (a * a - (a * (1 - f)) * (a * (1 - f))) / ((a * (1 - f)) * (a * (1 - f)));\n const A = 1 + uSq / 16384 * (4096 + uSq * (-768 + uSq * (320 - 175 * uSq)));\n const B = uSq / 1024 * (256 + uSq * (-128 + uSq * (74 - 47 * uSq)));\n\n let sigma = s12 / ((a * (1 - f)) * A), sigmaP, iterLimit = 100;\n let cos2SigmaM, sinSigma, cosSigma, deltaSigma;\n\n do {\n cos2SigmaM = Math.cos(2 * sigma1 + sigma);\n sinSigma = Math.sin(sigma);\n cosSigma = Math.cos(sigma);\n deltaSigma = B * sinSigma * (cos2SigmaM + B / 4 * (cosSigma * (-1 + 2 * cos2SigmaM * cos2SigmaM)\n - B / 6 * cos2SigmaM * (-3 + 4 * sinSigma * sinSigma) * (-3 + 4 * cos2SigmaM * cos2SigmaM)));\n sigmaP = sigma;\n sigma = s12 / ((a * (1 - f)) * A) + deltaSigma;\n } while (Math.abs(sigma - sigmaP) > 1e-12 && --iterLimit > 0);\n\n if (iterLimit === 0) {\n return { lat2: NaN, lon2: NaN };\n }\n\n const tmp = sinU1 * sinSigma - cosU1 * cosSigma * cosAlpha1;\n const lat2 = Math.atan2(\n sinU1 * cosSigma + cosU1 * sinSigma * cosAlpha1,\n (1 - f) * Math.sqrt(sinAlpha * sinAlpha + tmp * tmp)\n );\n const lambda = Math.atan2(\n sinSigma * sinAlpha1,\n cosU1 * cosSigma - sinU1 * sinSigma * cosAlpha1\n );\n const C = f / 16 * cos2Alpha * (4 + f * (4 - 3 * cos2Alpha));\n const L = lambda - (1 - C) * f * sinAlpha\n * (sigma + C * sinSigma * (cos2SigmaM + C * cosSigma * (-1 + 2 * cos2SigmaM * cos2SigmaM)));\n const lon2 = lon1 + L;\n\n return { lat2, lon2 };\n}\n","import adjust_lon from '../common/adjust_lon';\nimport { HALF_PI, EPSLN } from '../constants/values';\nimport mlfn from '../common/mlfn';\nimport e0fn from '../common/e0fn';\nimport e1fn from '../common/e1fn';\nimport e2fn from '../common/e2fn';\nimport e3fn from '../common/e3fn';\nimport asinz from '../common/asinz';\nimport imlfn from '../common/imlfn';\nimport { vincentyDirect, vincentyInverse } from '../common/vincenty';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} es\n * @property {number} sin_p12\n * @property {number} cos_p12\n * @property {number} a\n * @property {number} f\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n this.sin_p12 = Math.sin(this.lat0);\n this.cos_p12 = Math.cos(this.lat0);\n // flattening for ellipsoid\n this.f = this.es / (1 + Math.sqrt(1 - this.es));\n}\n\nexport function forward(p) {\n var lon = p.x;\n var lat = p.y;\n var sinphi = Math.sin(p.y);\n var cosphi = Math.cos(p.y);\n var dlon = adjust_lon(lon - this.long0, this.over);\n var e0, e1, e2, e3, Mlp, Ml, c, kp, cos_c, vars, azi1;\n if (this.sphere) {\n if (Math.abs(this.sin_p12 - 1) <= EPSLN) {\n // North Pole case\n p.x = this.x0 + this.a * (HALF_PI - lat) * Math.sin(dlon);\n p.y = this.y0 - this.a * (HALF_PI - lat) * Math.cos(dlon);\n return p;\n } else if (Math.abs(this.sin_p12 + 1) <= EPSLN) {\n // South Pole case\n p.x = this.x0 + this.a * (HALF_PI + lat) * Math.sin(dlon);\n p.y = this.y0 + this.a * (HALF_PI + lat) * Math.cos(dlon);\n return p;\n } else {\n // default case\n cos_c = this.sin_p12 * sinphi + this.cos_p12 * cosphi * Math.cos(dlon);\n c = Math.acos(cos_c);\n kp = c ? c / Math.sin(c) : 1;\n p.x = this.x0 + this.a * kp * cosphi * Math.sin(dlon);\n p.y = this.y0 + this.a * kp * (this.cos_p12 * sinphi - this.sin_p12 * cosphi * Math.cos(dlon));\n return p;\n }\n } else {\n e0 = e0fn(this.es);\n e1 = e1fn(this.es);\n e2 = e2fn(this.es);\n e3 = e3fn(this.es);\n if (Math.abs(this.sin_p12 - 1) <= EPSLN) {\n // North Pole case\n Mlp = this.a * mlfn(e0, e1, e2, e3, HALF_PI);\n Ml = this.a * mlfn(e0, e1, e2, e3, lat);\n p.x = this.x0 + (Mlp - Ml) * Math.sin(dlon);\n p.y = this.y0 - (Mlp - Ml) * Math.cos(dlon);\n return p;\n } else if (Math.abs(this.sin_p12 + 1) <= EPSLN) {\n // South Pole case\n Mlp = this.a * mlfn(e0, e1, e2, e3, HALF_PI);\n Ml = this.a * mlfn(e0, e1, e2, e3, lat);\n p.x = this.x0 + (Mlp + Ml) * Math.sin(dlon);\n p.y = this.y0 + (Mlp + Ml) * Math.cos(dlon);\n return p;\n } else {\n // Default case\n if (Math.abs(lon) < EPSLN && Math.abs(lat - this.lat0) < EPSLN) {\n p.x = p.y = 0;\n return p;\n }\n vars = vincentyInverse(this.lat0, this.long0, lat, lon, this.a, this.f);\n azi1 = vars.azi1;\n p.x = vars.s12 * Math.sin(azi1);\n p.y = vars.s12 * Math.cos(azi1);\n return p;\n }\n }\n}\n\nexport function inverse(p) {\n p.x -= this.x0;\n p.y -= this.y0;\n var rh, z, sinz, cosz, lon, lat, con, e0, e1, e2, e3, Mlp, M, azi1, s12, vars;\n if (this.sphere) {\n rh = Math.sqrt(p.x * p.x + p.y * p.y);\n if (rh > (2 * HALF_PI * this.a)) {\n return;\n }\n z = rh / this.a;\n\n sinz = Math.sin(z);\n cosz = Math.cos(z);\n\n lon = this.long0;\n if (Math.abs(rh) <= EPSLN) {\n lat = this.lat0;\n } else {\n lat = asinz(cosz * this.sin_p12 + (p.y * sinz * this.cos_p12) / rh);\n con = Math.abs(this.lat0) - HALF_PI;\n if (Math.abs(con) <= EPSLN) {\n if (this.lat0 >= 0) {\n lon = adjust_lon(this.long0 + Math.atan2(p.x, -p.y), this.over);\n } else {\n lon = adjust_lon(this.long0 - Math.atan2(-p.x, p.y), this.over);\n }\n } else {\n lon = adjust_lon(this.long0 + Math.atan2(p.x * sinz, rh * this.cos_p12 * cosz - p.y * this.sin_p12 * sinz), this.over);\n }\n }\n\n p.x = lon;\n p.y = lat;\n return p;\n } else {\n e0 = e0fn(this.es);\n e1 = e1fn(this.es);\n e2 = e2fn(this.es);\n e3 = e3fn(this.es);\n if (Math.abs(this.sin_p12 - 1) <= EPSLN) {\n // North pole case\n Mlp = this.a * mlfn(e0, e1, e2, e3, HALF_PI);\n rh = Math.sqrt(p.x * p.x + p.y * p.y);\n M = Mlp - rh;\n lat = imlfn(M / this.a, e0, e1, e2, e3);\n lon = adjust_lon(this.long0 + Math.atan2(p.x, -1 * p.y), this.over);\n p.x = lon;\n p.y = lat;\n return p;\n } else if (Math.abs(this.sin_p12 + 1) <= EPSLN) {\n // South pole case\n Mlp = this.a * mlfn(e0, e1, e2, e3, HALF_PI);\n rh = Math.sqrt(p.x * p.x + p.y * p.y);\n M = rh - Mlp;\n\n lat = imlfn(M / this.a, e0, e1, e2, e3);\n lon = adjust_lon(this.long0 + Math.atan2(p.x, p.y), this.over);\n p.x = lon;\n p.y = lat;\n return p;\n } else {\n // default case\n azi1 = Math.atan2(p.x, p.y);\n s12 = Math.sqrt(p.x * p.x + p.y * p.y);\n vars = vincentyDirect(this.lat0, this.long0, azi1, s12, this.a, this.f);\n\n p.x = vars.lon2;\n p.y = vars.lat2;\n return p;\n }\n }\n}\n\nexport var names = ['Azimuthal_Equidistant', 'aeqd'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import adjust_lon from '../common/adjust_lon';\nimport asinz from '../common/asinz';\nimport { EPSLN, HALF_PI } from '../constants/values';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} sin_p14\n * @property {number} cos_p14\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n // double temp; /* temporary variable */\n\n /* Place parameters in static storage for common use\n ------------------------------------------------- */\n this.sin_p14 = Math.sin(this.lat0);\n this.cos_p14 = Math.cos(this.lat0);\n}\n\n/* Orthographic forward equations--mapping lat,long to x,y\n --------------------------------------------------- */\nexport function forward(p) {\n var sinphi, cosphi; /* sin and cos value */\n var dlon; /* delta longitude value */\n var coslon; /* cos of longitude */\n var ksp; /* scale factor */\n var g, x, y;\n var lon = p.x;\n var lat = p.y;\n /* Forward equations\n ----------------- */\n dlon = adjust_lon(lon - this.long0, this.over);\n\n sinphi = Math.sin(lat);\n cosphi = Math.cos(lat);\n\n coslon = Math.cos(dlon);\n g = this.sin_p14 * sinphi + this.cos_p14 * cosphi * coslon;\n ksp = 1;\n if ((g > 0) || (Math.abs(g) <= EPSLN)) {\n x = this.a * ksp * cosphi * Math.sin(dlon);\n y = this.y0 + this.a * ksp * (this.cos_p14 * sinphi - this.sin_p14 * cosphi * coslon);\n }\n p.x = x;\n p.y = y;\n return p;\n}\n\nexport function inverse(p) {\n var rh; /* height above ellipsoid */\n var z; /* angle */\n var sinz, cosz; /* sin of z and cos of z */\n var con;\n var lon, lat;\n /* Inverse equations\n ----------------- */\n p.x -= this.x0;\n p.y -= this.y0;\n rh = Math.sqrt(p.x * p.x + p.y * p.y);\n z = asinz(rh / this.a);\n\n sinz = Math.sin(z);\n cosz = Math.cos(z);\n\n lon = this.long0;\n if (Math.abs(rh) <= EPSLN) {\n lat = this.lat0;\n p.x = lon;\n p.y = lat;\n return p;\n }\n lat = asinz(cosz * this.sin_p14 + (p.y * sinz * this.cos_p14) / rh);\n con = Math.abs(this.lat0) - HALF_PI;\n if (Math.abs(con) <= EPSLN) {\n if (this.lat0 >= 0) {\n lon = adjust_lon(this.long0 + Math.atan2(p.x, -p.y), this.over);\n } else {\n lon = adjust_lon(this.long0 - Math.atan2(-p.x, p.y), this.over);\n }\n p.x = lon;\n p.y = lat;\n return p;\n }\n lon = adjust_lon(this.long0 + Math.atan2((p.x * sinz), rh * this.cos_p14 * cosz - p.y * this.sin_p14 * sinz), this.over);\n p.x = lon;\n p.y = lat;\n return p;\n}\n\nexport var names = ['ortho'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","// QSC projection rewritten from the original PROJ4\n// https://github.com/OSGeo/proj.4/blob/master/src/PJ_qsc.c\n\nimport { EPSLN, TWO_PI, SPI, HALF_PI, FORTPI } from '../constants/values';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} face\n * @property {number} x0\n * @property {number} y0\n * @property {number} es\n * @property {number} one_minus_f\n * @property {number} one_minus_f_squared\n */\n\n/* constants */\nvar FACE_ENUM = {\n FRONT: 1,\n RIGHT: 2,\n BACK: 3,\n LEFT: 4,\n TOP: 5,\n BOTTOM: 6\n};\n\nvar AREA_ENUM = {\n AREA_0: 1,\n AREA_1: 2,\n AREA_2: 3,\n AREA_3: 4\n};\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n this.x0 = this.x0 || 0;\n this.y0 = this.y0 || 0;\n this.lat0 = this.lat0 || 0;\n this.long0 = this.long0 || 0;\n this.lat_ts = this.lat_ts || 0;\n this.title = this.title || 'Quadrilateralized Spherical Cube';\n\n /* Determine the cube face from the center of projection. */\n if (this.lat0 >= HALF_PI - FORTPI / 2.0) {\n this.face = FACE_ENUM.TOP;\n } else if (this.lat0 <= -(HALF_PI - FORTPI / 2.0)) {\n this.face = FACE_ENUM.BOTTOM;\n } else if (Math.abs(this.long0) <= FORTPI) {\n this.face = FACE_ENUM.FRONT;\n } else if (Math.abs(this.long0) <= HALF_PI + FORTPI) {\n this.face = this.long0 > 0.0 ? FACE_ENUM.RIGHT : FACE_ENUM.LEFT;\n } else {\n this.face = FACE_ENUM.BACK;\n }\n\n /* Fill in useful values for the ellipsoid <-> sphere shift\n * described in [LK12]. */\n if (this.es !== 0) {\n this.one_minus_f = 1 - (this.a - this.b) / this.a;\n this.one_minus_f_squared = this.one_minus_f * this.one_minus_f;\n }\n}\n\n// QSC forward equations--mapping lat,long to x,y\n// -----------------------------------------------------------------\nexport function forward(p) {\n var xy = { x: 0, y: 0 };\n var lat, lon;\n var theta, phi;\n var t, mu;\n /* nu; */\n var area = { value: 0 };\n\n // move lon according to projection's lon\n p.x -= this.long0;\n\n /* Convert the geodetic latitude to a geocentric latitude.\n * This corresponds to the shift from the ellipsoid to the sphere\n * described in [LK12]. */\n if (this.es !== 0) { // if (P->es != 0) {\n lat = Math.atan(this.one_minus_f_squared * Math.tan(p.y));\n } else {\n lat = p.y;\n }\n\n /* Convert the input lat, lon into theta, phi as used by QSC.\n * This depends on the cube face and the area on it.\n * For the top and bottom face, we can compute theta and phi\n * directly from phi, lam. For the other faces, we must use\n * unit sphere cartesian coordinates as an intermediate step. */\n lon = p.x; // lon = lp.lam;\n if (this.face === FACE_ENUM.TOP) {\n phi = HALF_PI - lat;\n if (lon >= FORTPI && lon <= HALF_PI + FORTPI) {\n area.value = AREA_ENUM.AREA_0;\n theta = lon - HALF_PI;\n } else if (lon > HALF_PI + FORTPI || lon <= -(HALF_PI + FORTPI)) {\n area.value = AREA_ENUM.AREA_1;\n theta = (lon > 0.0 ? lon - SPI : lon + SPI);\n } else if (lon > -(HALF_PI + FORTPI) && lon <= -FORTPI) {\n area.value = AREA_ENUM.AREA_2;\n theta = lon + HALF_PI;\n } else {\n area.value = AREA_ENUM.AREA_3;\n theta = lon;\n }\n } else if (this.face === FACE_ENUM.BOTTOM) {\n phi = HALF_PI + lat;\n if (lon >= FORTPI && lon <= HALF_PI + FORTPI) {\n area.value = AREA_ENUM.AREA_0;\n theta = -lon + HALF_PI;\n } else if (lon < FORTPI && lon >= -FORTPI) {\n area.value = AREA_ENUM.AREA_1;\n theta = -lon;\n } else if (lon < -FORTPI && lon >= -(HALF_PI + FORTPI)) {\n area.value = AREA_ENUM.AREA_2;\n theta = -lon - HALF_PI;\n } else {\n area.value = AREA_ENUM.AREA_3;\n theta = (lon > 0.0 ? -lon + SPI : -lon - SPI);\n }\n } else {\n var q, r, s;\n var sinlat, coslat;\n var sinlon, coslon;\n\n if (this.face === FACE_ENUM.RIGHT) {\n lon = qsc_shift_lon_origin(lon, +HALF_PI);\n } else if (this.face === FACE_ENUM.BACK) {\n lon = qsc_shift_lon_origin(lon, +SPI);\n } else if (this.face === FACE_ENUM.LEFT) {\n lon = qsc_shift_lon_origin(lon, -HALF_PI);\n }\n sinlat = Math.sin(lat);\n coslat = Math.cos(lat);\n sinlon = Math.sin(lon);\n coslon = Math.cos(lon);\n q = coslat * coslon;\n r = coslat * sinlon;\n s = sinlat;\n\n if (this.face === FACE_ENUM.FRONT) {\n phi = Math.acos(q);\n theta = qsc_fwd_equat_face_theta(phi, s, r, area);\n } else if (this.face === FACE_ENUM.RIGHT) {\n phi = Math.acos(r);\n theta = qsc_fwd_equat_face_theta(phi, s, -q, area);\n } else if (this.face === FACE_ENUM.BACK) {\n phi = Math.acos(-q);\n theta = qsc_fwd_equat_face_theta(phi, s, -r, area);\n } else if (this.face === FACE_ENUM.LEFT) {\n phi = Math.acos(-r);\n theta = qsc_fwd_equat_face_theta(phi, s, q, area);\n } else {\n /* Impossible */\n phi = theta = 0;\n area.value = AREA_ENUM.AREA_0;\n }\n }\n\n /* Compute mu and nu for the area of definition.\n * For mu, see Eq. (3-21) in [OL76], but note the typos:\n * compare with Eq. (3-14). For nu, see Eq. (3-38). */\n mu = Math.atan((12 / SPI) * (theta + Math.acos(Math.sin(theta) * Math.cos(FORTPI)) - HALF_PI));\n t = Math.sqrt((1 - Math.cos(phi)) / (Math.cos(mu) * Math.cos(mu)) / (1 - Math.cos(Math.atan(1 / Math.cos(theta)))));\n\n /* Apply the result to the real area. */\n if (area.value === AREA_ENUM.AREA_1) {\n mu += HALF_PI;\n } else if (area.value === AREA_ENUM.AREA_2) {\n mu += SPI;\n } else if (area.value === AREA_ENUM.AREA_3) {\n mu += 1.5 * SPI;\n }\n\n /* Now compute x, y from mu and nu */\n xy.x = t * Math.cos(mu);\n xy.y = t * Math.sin(mu);\n xy.x = xy.x * this.a + this.x0;\n xy.y = xy.y * this.a + this.y0;\n\n p.x = xy.x;\n p.y = xy.y;\n return p;\n}\n\n// QSC inverse equations--mapping x,y to lat/long\n// -----------------------------------------------------------------\nexport function inverse(p) {\n var lp = { lam: 0, phi: 0 };\n var mu, nu, cosmu, tannu;\n var tantheta, theta, cosphi, phi;\n var t;\n var area = { value: 0 };\n\n /* de-offset */\n p.x = (p.x - this.x0) / this.a;\n p.y = (p.y - this.y0) / this.a;\n\n /* Convert the input x, y to the mu and nu angles as used by QSC.\n * This depends on the area of the cube face. */\n nu = Math.atan(Math.sqrt(p.x * p.x + p.y * p.y));\n mu = Math.atan2(p.y, p.x);\n if (p.x >= 0.0 && p.x >= Math.abs(p.y)) {\n area.value = AREA_ENUM.AREA_0;\n } else if (p.y >= 0.0 && p.y >= Math.abs(p.x)) {\n area.value = AREA_ENUM.AREA_1;\n mu -= HALF_PI;\n } else if (p.x < 0.0 && -p.x >= Math.abs(p.y)) {\n area.value = AREA_ENUM.AREA_2;\n mu = (mu < 0.0 ? mu + SPI : mu - SPI);\n } else {\n area.value = AREA_ENUM.AREA_3;\n mu += HALF_PI;\n }\n\n /* Compute phi and theta for the area of definition.\n * The inverse projection is not described in the original paper, but some\n * good hints can be found here (as of 2011-12-14):\n * http://fits.gsfc.nasa.gov/fitsbits/saf.93/saf.9302\n * (search for \"Message-Id: <9302181759.AA25477 at fits.cv.nrao.edu>\") */\n t = (SPI / 12) * Math.tan(mu);\n tantheta = Math.sin(t) / (Math.cos(t) - (1 / Math.sqrt(2)));\n theta = Math.atan(tantheta);\n cosmu = Math.cos(mu);\n tannu = Math.tan(nu);\n cosphi = 1 - cosmu * cosmu * tannu * tannu * (1 - Math.cos(Math.atan(1 / Math.cos(theta))));\n if (cosphi < -1) {\n cosphi = -1;\n } else if (cosphi > +1) {\n cosphi = +1;\n }\n\n /* Apply the result to the real area on the cube face.\n * For the top and bottom face, we can compute phi and lam directly.\n * For the other faces, we must use unit sphere cartesian coordinates\n * as an intermediate step. */\n if (this.face === FACE_ENUM.TOP) {\n phi = Math.acos(cosphi);\n lp.phi = HALF_PI - phi;\n if (area.value === AREA_ENUM.AREA_0) {\n lp.lam = theta + HALF_PI;\n } else if (area.value === AREA_ENUM.AREA_1) {\n lp.lam = (theta < 0.0 ? theta + SPI : theta - SPI);\n } else if (area.value === AREA_ENUM.AREA_2) {\n lp.lam = theta - HALF_PI;\n } else /* area.value == AREA_ENUM.AREA_3 */ {\n lp.lam = theta;\n }\n } else if (this.face === FACE_ENUM.BOTTOM) {\n phi = Math.acos(cosphi);\n lp.phi = phi - HALF_PI;\n if (area.value === AREA_ENUM.AREA_0) {\n lp.lam = -theta + HALF_PI;\n } else if (area.value === AREA_ENUM.AREA_1) {\n lp.lam = -theta;\n } else if (area.value === AREA_ENUM.AREA_2) {\n lp.lam = -theta - HALF_PI;\n } else /* area.value == AREA_ENUM.AREA_3 */ {\n lp.lam = (theta < 0.0 ? -theta - SPI : -theta + SPI);\n }\n } else {\n /* Compute phi and lam via cartesian unit sphere coordinates. */\n var q, r, s;\n q = cosphi;\n t = q * q;\n if (t >= 1) {\n s = 0;\n } else {\n s = Math.sqrt(1 - t) * Math.sin(theta);\n }\n t += s * s;\n if (t >= 1) {\n r = 0;\n } else {\n r = Math.sqrt(1 - t);\n }\n /* Rotate q,r,s into the correct area. */\n if (area.value === AREA_ENUM.AREA_1) {\n t = r;\n r = -s;\n s = t;\n } else if (area.value === AREA_ENUM.AREA_2) {\n r = -r;\n s = -s;\n } else if (area.value === AREA_ENUM.AREA_3) {\n t = r;\n r = s;\n s = -t;\n }\n /* Rotate q,r,s into the correct cube face. */\n if (this.face === FACE_ENUM.RIGHT) {\n t = q;\n q = -r;\n r = t;\n } else if (this.face === FACE_ENUM.BACK) {\n q = -q;\n r = -r;\n } else if (this.face === FACE_ENUM.LEFT) {\n t = q;\n q = r;\n r = -t;\n }\n /* Now compute phi and lam from the unit sphere coordinates. */\n lp.phi = Math.acos(-s) - HALF_PI;\n lp.lam = Math.atan2(r, q);\n if (this.face === FACE_ENUM.RIGHT) {\n lp.lam = qsc_shift_lon_origin(lp.lam, -HALF_PI);\n } else if (this.face === FACE_ENUM.BACK) {\n lp.lam = qsc_shift_lon_origin(lp.lam, -SPI);\n } else if (this.face === FACE_ENUM.LEFT) {\n lp.lam = qsc_shift_lon_origin(lp.lam, +HALF_PI);\n }\n }\n\n /* Apply the shift from the sphere to the ellipsoid as described\n * in [LK12]. */\n if (this.es !== 0) {\n var invert_sign;\n var tanphi, xa;\n invert_sign = (lp.phi < 0 ? 1 : 0);\n tanphi = Math.tan(lp.phi);\n xa = this.b / Math.sqrt(tanphi * tanphi + this.one_minus_f_squared);\n lp.phi = Math.atan(Math.sqrt(this.a * this.a - xa * xa) / (this.one_minus_f * xa));\n if (invert_sign) {\n lp.phi = -lp.phi;\n }\n }\n\n lp.lam += this.long0;\n p.x = lp.lam;\n p.y = lp.phi;\n return p;\n}\n\n/* Helper function for forward projection: compute the theta angle\n * and determine the area number. */\nfunction qsc_fwd_equat_face_theta(phi, y, x, area) {\n var theta;\n if (phi < EPSLN) {\n area.value = AREA_ENUM.AREA_0;\n theta = 0.0;\n } else {\n theta = Math.atan2(y, x);\n if (Math.abs(theta) <= FORTPI) {\n area.value = AREA_ENUM.AREA_0;\n } else if (theta > FORTPI && theta <= HALF_PI + FORTPI) {\n area.value = AREA_ENUM.AREA_1;\n theta -= HALF_PI;\n } else if (theta > HALF_PI + FORTPI || theta <= -(HALF_PI + FORTPI)) {\n area.value = AREA_ENUM.AREA_2;\n theta = (theta >= 0.0 ? theta - SPI : theta + SPI);\n } else {\n area.value = AREA_ENUM.AREA_3;\n theta += HALF_PI;\n }\n }\n return theta;\n}\n\n/* Helper function: shift the longitude. */\nfunction qsc_shift_lon_origin(lon, offset) {\n var slon = lon + offset;\n if (slon < -SPI) {\n slon += TWO_PI;\n } else if (slon > +SPI) {\n slon -= TWO_PI;\n }\n return slon;\n}\n\nexport var names = ['Quadrilateralized Spherical Cube', 'Quadrilateralized_Spherical_Cube', 'qsc'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","// Robinson projection\n// Based on https://github.com/OSGeo/proj.4/blob/master/src/PJ_robin.c\n// Polynomial coeficients from http://article.gmane.org/gmane.comp.gis.proj-4.devel/6039\n\nimport { HALF_PI, D2R, R2D, EPSLN } from '../constants/values';\nimport adjust_lon from '../common/adjust_lon';\n\nvar COEFS_X = [\n [1.0000, 2.2199e-17, -7.15515e-05, 3.1103e-06],\n [0.9986, -0.000482243, -2.4897e-05, -1.3309e-06],\n [0.9954, -0.00083103, -4.48605e-05, -9.86701e-07],\n [0.9900, -0.00135364, -5.9661e-05, 3.6777e-06],\n [0.9822, -0.00167442, -4.49547e-06, -5.72411e-06],\n [0.9730, -0.00214868, -9.03571e-05, 1.8736e-08],\n [0.9600, -0.00305085, -9.00761e-05, 1.64917e-06],\n [0.9427, -0.00382792, -6.53386e-05, -2.6154e-06],\n [0.9216, -0.00467746, -0.00010457, 4.81243e-06],\n [0.8962, -0.00536223, -3.23831e-05, -5.43432e-06],\n [0.8679, -0.00609363, -0.000113898, 3.32484e-06],\n [0.8350, -0.00698325, -6.40253e-05, 9.34959e-07],\n [0.7986, -0.00755338, -5.00009e-05, 9.35324e-07],\n [0.7597, -0.00798324, -3.5971e-05, -2.27626e-06],\n [0.7186, -0.00851367, -7.01149e-05, -8.6303e-06],\n [0.6732, -0.00986209, -0.000199569, 1.91974e-05],\n [0.6213, -0.010418, 8.83923e-05, 6.24051e-06],\n [0.5722, -0.00906601, 0.000182, 6.24051e-06],\n [0.5322, -0.00677797, 0.000275608, 6.24051e-06]\n];\n\nvar COEFS_Y = [\n [-5.20417e-18, 0.0124, 1.21431e-18, -8.45284e-11],\n [0.0620, 0.0124, -1.26793e-09, 4.22642e-10],\n [0.1240, 0.0124, 5.07171e-09, -1.60604e-09],\n [0.1860, 0.0123999, -1.90189e-08, 6.00152e-09],\n [0.2480, 0.0124002, 7.10039e-08, -2.24e-08],\n [0.3100, 0.0123992, -2.64997e-07, 8.35986e-08],\n [0.3720, 0.0124029, 9.88983e-07, -3.11994e-07],\n [0.4340, 0.0123893, -3.69093e-06, -4.35621e-07],\n [0.4958, 0.0123198, -1.02252e-05, -3.45523e-07],\n [0.5571, 0.0121916, -1.54081e-05, -5.82288e-07],\n [0.6176, 0.0119938, -2.41424e-05, -5.25327e-07],\n [0.6769, 0.011713, -3.20223e-05, -5.16405e-07],\n [0.7346, 0.0113541, -3.97684e-05, -6.09052e-07],\n [0.7903, 0.0109107, -4.89042e-05, -1.04739e-06],\n [0.8435, 0.0103431, -6.4615e-05, -1.40374e-09],\n [0.8936, 0.00969686, -6.4636e-05, -8.547e-06],\n [0.9394, 0.00840947, -0.000192841, -4.2106e-06],\n [0.9761, 0.00616527, -0.000256, -4.2106e-06],\n [1.0000, 0.00328947, -0.000319159, -4.2106e-06]\n];\n\nvar FXC = 0.8487;\nvar FYC = 1.3523;\nvar C1 = R2D / 5; // rad to 5-degree interval\nvar RC1 = 1 / C1;\nvar NODES = 18;\n\nvar poly3_val = function (coefs, x) {\n return coefs[0] + x * (coefs[1] + x * (coefs[2] + x * coefs[3]));\n};\n\nvar poly3_der = function (coefs, x) {\n return coefs[1] + x * (2 * coefs[2] + x * 3 * coefs[3]);\n};\n\nfunction newton_rapshon(f_df, start, max_err, iters) {\n var x = start;\n for (; iters; --iters) {\n var upd = f_df(x);\n x -= upd;\n if (Math.abs(upd) < max_err) {\n break;\n }\n }\n return x;\n}\n\nexport function init() {\n this.x0 = this.x0 || 0;\n this.y0 = this.y0 || 0;\n this.long0 = this.long0 || 0;\n this.es = 0;\n this.title = this.title || 'Robinson';\n}\n\nexport function forward(ll) {\n var lon = adjust_lon(ll.x - this.long0, this.over);\n\n var dphi = Math.abs(ll.y);\n var i = Math.floor(dphi * C1);\n if (i < 0) {\n i = 0;\n } else if (i >= NODES) {\n i = NODES - 1;\n }\n dphi = R2D * (dphi - RC1 * i);\n var xy = {\n x: poly3_val(COEFS_X[i], dphi) * lon,\n y: poly3_val(COEFS_Y[i], dphi)\n };\n if (ll.y < 0) {\n xy.y = -xy.y;\n }\n\n xy.x = xy.x * this.a * FXC + this.x0;\n xy.y = xy.y * this.a * FYC + this.y0;\n return xy;\n}\n\nexport function inverse(xy) {\n var ll = {\n x: (xy.x - this.x0) / (this.a * FXC),\n y: Math.abs(xy.y - this.y0) / (this.a * FYC)\n };\n\n if (ll.y >= 1) { // pathologic case\n ll.x /= COEFS_X[NODES][0];\n ll.y = xy.y < 0 ? -HALF_PI : HALF_PI;\n } else {\n // find table interval\n var i = Math.floor(ll.y * NODES);\n if (i < 0) {\n i = 0;\n } else if (i >= NODES) {\n i = NODES - 1;\n }\n for (;;) {\n if (COEFS_Y[i][0] > ll.y) {\n --i;\n } else if (COEFS_Y[i + 1][0] <= ll.y) {\n ++i;\n } else {\n break;\n }\n }\n // linear interpolation in 5 degree interval\n var coefs = COEFS_Y[i];\n var t = 5 * (ll.y - coefs[0]) / (COEFS_Y[i + 1][0] - coefs[0]);\n // find t so that poly3_val(coefs, t) = ll.y\n t = newton_rapshon(function (x) {\n return (poly3_val(coefs, x) - ll.y) / poly3_der(coefs, x);\n }, t, EPSLN, 100);\n\n ll.x /= poly3_val(COEFS_X[i], t);\n ll.y = (5 * i + t) * D2R;\n if (xy.y < 0) {\n ll.y = -ll.y;\n }\n }\n\n ll.x = adjust_lon(ll.x + this.long0, this.over);\n return ll;\n}\n\nexport var names = ['Robinson', 'robin'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import {\n geodeticToGeocentric,\n geocentricToGeodetic\n} from '../datumUtils';\n\nexport function init() {\n this.name = 'geocent';\n}\n\nexport function forward(p) {\n var point = geodeticToGeocentric(p, this.es, this.a);\n return point;\n}\n\nexport function inverse(p) {\n var point = geocentricToGeodetic(p, this.es, this.a, this.b);\n return point;\n}\n\nexport var names = ['Geocentric', 'geocentric', 'geocent', 'Geocent'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import { D2R, HALF_PI, EPSLN } from '../constants/values';\nimport hypot from '../common/hypot';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} mode\n * @property {number} sinph0\n * @property {number} cosph0\n * @property {number} pn1\n * @property {number} h\n * @property {number} rp\n * @property {number} p\n * @property {number} h1\n * @property {number} pfact\n * @property {number} es\n * @property {number} tilt\n * @property {number} azi\n * @property {number} cg\n * @property {number} sg\n * @property {number} cw\n * @property {number} sw\n */\n\nvar mode = {\n N_POLE: 0,\n S_POLE: 1,\n EQUIT: 2,\n OBLIQ: 3\n};\n\nvar params = {\n h: { def: 100000, num: true }, // default is Karman line, no default in PROJ.7\n azi: { def: 0, num: true, degrees: true }, // default is North\n tilt: { def: 0, num: true, degrees: true }, // default is Nadir\n long0: { def: 0, num: true }, // default is Greenwich, conversion to rad is automatic\n lat0: { def: 0, num: true } // default is Equator, conversion to rad is automatic\n};\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n Object.keys(params).forEach(function (p) {\n if (typeof this[p] === 'undefined') {\n this[p] = params[p].def;\n } else if (params[p].num && isNaN(this[p])) {\n throw new Error('Invalid parameter value, must be numeric ' + p + ' = ' + this[p]);\n } else if (params[p].num) {\n this[p] = parseFloat(this[p]);\n }\n if (params[p].degrees) {\n this[p] = this[p] * D2R;\n }\n }.bind(this));\n\n if (Math.abs((Math.abs(this.lat0) - HALF_PI)) < EPSLN) {\n this.mode = this.lat0 < 0 ? mode.S_POLE : mode.N_POLE;\n } else if (Math.abs(this.lat0) < EPSLN) {\n this.mode = mode.EQUIT;\n } else {\n this.mode = mode.OBLIQ;\n this.sinph0 = Math.sin(this.lat0);\n this.cosph0 = Math.cos(this.lat0);\n }\n\n this.pn1 = this.h / this.a; // Normalize relative to the Earth's radius\n\n if (this.pn1 <= 0 || this.pn1 > 1e10) {\n throw new Error('Invalid height');\n }\n\n this.p = 1 + this.pn1;\n this.rp = 1 / this.p;\n this.h1 = 1 / this.pn1;\n this.pfact = (this.p + 1) * this.h1;\n this.es = 0;\n\n var omega = this.tilt;\n var gamma = this.azi;\n this.cg = Math.cos(gamma);\n this.sg = Math.sin(gamma);\n this.cw = Math.cos(omega);\n this.sw = Math.sin(omega);\n}\n\nexport function forward(p) {\n p.x -= this.long0;\n var sinphi = Math.sin(p.y);\n var cosphi = Math.cos(p.y);\n var coslam = Math.cos(p.x);\n var x, y;\n switch (this.mode) {\n case mode.OBLIQ:\n y = this.sinph0 * sinphi + this.cosph0 * cosphi * coslam;\n break;\n case mode.EQUIT:\n y = cosphi * coslam;\n break;\n case mode.S_POLE:\n y = -sinphi;\n break;\n case mode.N_POLE:\n y = sinphi;\n break;\n }\n y = this.pn1 / (this.p - y);\n x = y * cosphi * Math.sin(p.x);\n\n switch (this.mode) {\n case mode.OBLIQ:\n y *= this.cosph0 * sinphi - this.sinph0 * cosphi * coslam;\n break;\n case mode.EQUIT:\n y *= sinphi;\n break;\n case mode.N_POLE:\n y *= -(cosphi * coslam);\n break;\n case mode.S_POLE:\n y *= cosphi * coslam;\n break;\n }\n\n // Tilt\n var yt, ba;\n yt = y * this.cg + x * this.sg;\n ba = 1 / (yt * this.sw * this.h1 + this.cw);\n x = (x * this.cg - y * this.sg) * this.cw * ba;\n y = yt * ba;\n\n p.x = x * this.a;\n p.y = y * this.a;\n return p;\n}\n\nexport function inverse(p) {\n p.x /= this.a;\n p.y /= this.a;\n var r = { x: p.x, y: p.y };\n\n // Un-Tilt\n var bm, bq, yt;\n yt = 1 / (this.pn1 - p.y * this.sw);\n bm = this.pn1 * p.x * yt;\n bq = this.pn1 * p.y * this.cw * yt;\n p.x = bm * this.cg + bq * this.sg;\n p.y = bq * this.cg - bm * this.sg;\n\n var rh = hypot(p.x, p.y);\n if (Math.abs(rh) < EPSLN) {\n r.x = 0;\n r.y = p.y;\n } else {\n var cosz, sinz;\n sinz = 1 - rh * rh * this.pfact;\n sinz = (this.p - Math.sqrt(sinz)) / (this.pn1 / rh + rh / this.pn1);\n cosz = Math.sqrt(1 - sinz * sinz);\n switch (this.mode) {\n case mode.OBLIQ:\n r.y = Math.asin(cosz * this.sinph0 + p.y * sinz * this.cosph0 / rh);\n p.y = (cosz - this.sinph0 * Math.sin(r.y)) * rh;\n p.x *= sinz * this.cosph0;\n break;\n case mode.EQUIT:\n r.y = Math.asin(p.y * sinz / rh);\n p.y = cosz * rh;\n p.x *= sinz;\n break;\n case mode.N_POLE:\n r.y = Math.asin(cosz);\n p.y = -p.y;\n break;\n case mode.S_POLE:\n r.y = -Math.asin(cosz);\n break;\n }\n r.x = Math.atan2(p.x, p.y);\n }\n\n p.x = r.x + this.long0;\n p.y = r.y;\n return p;\n}\n\nexport var names = ['Tilted_Perspective', 'tpers'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import hypot from '../common/hypot';\n\n/**\n * @typedef {Object} LocalThis\n * @property {1 | 0} flip_axis\n * @property {number} h\n * @property {number} radius_g_1\n * @property {number} radius_g\n * @property {number} radius_p\n * @property {number} radius_p2\n * @property {number} radius_p_inv2\n * @property {'ellipse'|'sphere'} shape\n * @property {number} C\n * @property {string} sweep\n * @property {number} es\n */\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n this.flip_axis = (this.sweep === 'x' ? 1 : 0);\n this.h = Number(this.h);\n this.radius_g_1 = this.h / this.a;\n\n if (this.radius_g_1 <= 0 || this.radius_g_1 > 1e10) {\n throw new Error();\n }\n\n this.radius_g = 1.0 + this.radius_g_1;\n this.C = this.radius_g * this.radius_g - 1.0;\n\n if (this.es !== 0.0) {\n var one_es = 1.0 - this.es;\n var rone_es = 1 / one_es;\n\n this.radius_p = Math.sqrt(one_es);\n this.radius_p2 = one_es;\n this.radius_p_inv2 = rone_es;\n\n this.shape = 'ellipse'; // Use as a condition in the forward and inverse functions.\n } else {\n this.radius_p = 1.0;\n this.radius_p2 = 1.0;\n this.radius_p_inv2 = 1.0;\n\n this.shape = 'sphere'; // Use as a condition in the forward and inverse functions.\n }\n\n if (!this.title) {\n this.title = 'Geostationary Satellite View';\n }\n}\n\nfunction forward(p) {\n var lon = p.x;\n var lat = p.y;\n var tmp, v_x, v_y, v_z;\n lon = lon - this.long0;\n\n if (this.shape === 'ellipse') {\n lat = Math.atan(this.radius_p2 * Math.tan(lat));\n var r = this.radius_p / hypot(this.radius_p * Math.cos(lat), Math.sin(lat));\n\n v_x = r * Math.cos(lon) * Math.cos(lat);\n v_y = r * Math.sin(lon) * Math.cos(lat);\n v_z = r * Math.sin(lat);\n\n if (((this.radius_g - v_x) * v_x - v_y * v_y - v_z * v_z * this.radius_p_inv2) < 0.0) {\n p.x = Number.NaN;\n p.y = Number.NaN;\n return p;\n }\n\n tmp = this.radius_g - v_x;\n if (this.flip_axis) {\n p.x = this.radius_g_1 * Math.atan(v_y / hypot(v_z, tmp));\n p.y = this.radius_g_1 * Math.atan(v_z / tmp);\n } else {\n p.x = this.radius_g_1 * Math.atan(v_y / tmp);\n p.y = this.radius_g_1 * Math.atan(v_z / hypot(v_y, tmp));\n }\n } else if (this.shape === 'sphere') {\n tmp = Math.cos(lat);\n v_x = Math.cos(lon) * tmp;\n v_y = Math.sin(lon) * tmp;\n v_z = Math.sin(lat);\n tmp = this.radius_g - v_x;\n\n if (this.flip_axis) {\n p.x = this.radius_g_1 * Math.atan(v_y / hypot(v_z, tmp));\n p.y = this.radius_g_1 * Math.atan(v_z / tmp);\n } else {\n p.x = this.radius_g_1 * Math.atan(v_y / tmp);\n p.y = this.radius_g_1 * Math.atan(v_z / hypot(v_y, tmp));\n }\n }\n p.x = p.x * this.a;\n p.y = p.y * this.a;\n return p;\n}\n\nfunction inverse(p) {\n var v_x = -1.0;\n var v_y = 0.0;\n var v_z = 0.0;\n var a, b, det, k;\n\n p.x = p.x / this.a;\n p.y = p.y / this.a;\n\n if (this.shape === 'ellipse') {\n if (this.flip_axis) {\n v_z = Math.tan(p.y / this.radius_g_1);\n v_y = Math.tan(p.x / this.radius_g_1) * hypot(1.0, v_z);\n } else {\n v_y = Math.tan(p.x / this.radius_g_1);\n v_z = Math.tan(p.y / this.radius_g_1) * hypot(1.0, v_y);\n }\n\n var v_zp = v_z / this.radius_p;\n a = v_y * v_y + v_zp * v_zp + v_x * v_x;\n b = 2 * this.radius_g * v_x;\n det = (b * b) - 4 * a * this.C;\n\n if (det < 0.0) {\n p.x = Number.NaN;\n p.y = Number.NaN;\n return p;\n }\n\n k = (-b - Math.sqrt(det)) / (2.0 * a);\n v_x = this.radius_g + k * v_x;\n v_y *= k;\n v_z *= k;\n\n p.x = Math.atan2(v_y, v_x);\n p.y = Math.atan(v_z * Math.cos(p.x) / v_x);\n p.y = Math.atan(this.radius_p_inv2 * Math.tan(p.y));\n } else if (this.shape === 'sphere') {\n if (this.flip_axis) {\n v_z = Math.tan(p.y / this.radius_g_1);\n v_y = Math.tan(p.x / this.radius_g_1) * Math.sqrt(1.0 + v_z * v_z);\n } else {\n v_y = Math.tan(p.x / this.radius_g_1);\n v_z = Math.tan(p.y / this.radius_g_1) * Math.sqrt(1.0 + v_y * v_y);\n }\n\n a = v_y * v_y + v_z * v_z + v_x * v_x;\n b = 2 * this.radius_g * v_x;\n det = (b * b) - 4 * a * this.C;\n if (det < 0.0) {\n p.x = Number.NaN;\n p.y = Number.NaN;\n return p;\n }\n\n k = (-b - Math.sqrt(det)) / (2.0 * a);\n v_x = this.radius_g + k * v_x;\n v_y *= k;\n v_z *= k;\n\n p.x = Math.atan2(v_y, v_x);\n p.y = Math.atan(v_z * Math.cos(p.x) / v_x);\n }\n p.x = p.x + this.long0;\n return p;\n}\n\nexport var names = ['Geostationary Satellite View', 'Geostationary_Satellite', 'geos'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","/**\n * Copyright 2018 Bernie Jenny, Monash University, Melbourne, Australia.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * Equal Earth is a projection inspired by the Robinson projection, but unlike\n * the Robinson projection retains the relative size of areas. The projection\n * was designed in 2018 by Bojan Savric, Tom Patterson and Bernhard Jenny.\n *\n * Publication:\n * Bojan Savric, Tom Patterson & Bernhard Jenny (2018). The Equal Earth map\n * projection, International Journal of Geographical Information Science,\n * DOI: 10.1080/13658816.2018.1504949\n *\n * Code released August 2018\n * Ported to JavaScript and adapted for mapshaper-proj by Matthew Bloch August 2018\n * Modified for proj4js by Andreas Hocevar by Andreas Hocevar March 2024\n */\n\nimport adjust_lon from '../common/adjust_lon';\n\nvar A1 = 1.340264,\n A2 = -0.081106,\n A3 = 0.000893,\n A4 = 0.003796,\n M = Math.sqrt(3) / 2.0;\n\nexport function init() {\n this.es = 0;\n this.long0 = this.long0 !== undefined ? this.long0 : 0;\n this.x0 = this.x0 !== undefined ? this.x0 : 0;\n this.y0 = this.y0 !== undefined ? this.y0 : 0;\n}\n\nexport function forward(p) {\n var lam = adjust_lon(p.x - this.long0, this.over);\n var phi = p.y;\n var paramLat = Math.asin(M * Math.sin(phi)),\n paramLatSq = paramLat * paramLat,\n paramLatPow6 = paramLatSq * paramLatSq * paramLatSq;\n p.x = lam * Math.cos(paramLat)\n / (M * (A1 + 3 * A2 * paramLatSq + paramLatPow6 * (7 * A3 + 9 * A4 * paramLatSq)));\n p.y = paramLat * (A1 + A2 * paramLatSq + paramLatPow6 * (A3 + A4 * paramLatSq));\n\n p.x = this.a * p.x + this.x0;\n p.y = this.a * p.y + this.y0;\n return p;\n}\n\nexport function inverse(p) {\n p.x = (p.x - this.x0) / this.a;\n p.y = (p.y - this.y0) / this.a;\n\n var EPS = 1e-9,\n NITER = 12,\n paramLat = p.y,\n paramLatSq, paramLatPow6, fy, fpy, dlat, i;\n\n for (i = 0; i < NITER; ++i) {\n paramLatSq = paramLat * paramLat;\n paramLatPow6 = paramLatSq * paramLatSq * paramLatSq;\n fy = paramLat * (A1 + A2 * paramLatSq + paramLatPow6 * (A3 + A4 * paramLatSq)) - p.y;\n fpy = A1 + 3 * A2 * paramLatSq + paramLatPow6 * (7 * A3 + 9 * A4 * paramLatSq);\n paramLat -= dlat = fy / fpy;\n if (Math.abs(dlat) < EPS) {\n break;\n }\n }\n paramLatSq = paramLat * paramLat;\n paramLatPow6 = paramLatSq * paramLatSq * paramLatSq;\n p.x = M * p.x * (A1 + 3 * A2 * paramLatSq + paramLatPow6 * (7 * A3 + 9 * A4 * paramLatSq))\n / Math.cos(paramLat);\n p.y = Math.asin(Math.sin(paramLat) / M);\n\n p.x = adjust_lon(p.x + this.long0, this.over);\n return p;\n}\n\nexport var names = ['eqearth', 'Equal Earth', 'Equal_Earth'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import adjust_lat from '../common/adjust_lat';\nimport adjust_lon from '../common/adjust_lon';\nimport hypot from '../common/hypot';\nimport pj_enfn from '../common/pj_enfn';\nimport pj_inv_mlfn from '../common/pj_inv_mlfn';\nimport pj_mlfn from '../common/pj_mlfn';\nimport { HALF_PI } from '../constants/values';\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} phi1\n * @property {number} cphi1\n * @property {number} es\n * @property {Array<number>} en\n * @property {number} m1\n * @property {number} am1\n */\n\nvar EPS10 = 1e-10;\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n var c;\n\n this.phi1 = this.lat1;\n if (Math.abs(this.phi1) < EPS10) {\n throw new Error();\n }\n if (this.es) {\n this.en = pj_enfn(this.es);\n this.m1 = pj_mlfn(this.phi1, this.am1 = Math.sin(this.phi1),\n c = Math.cos(this.phi1), this.en);\n this.am1 = c / (Math.sqrt(1 - this.es * this.am1 * this.am1) * this.am1);\n this.inverse = e_inv;\n this.forward = e_fwd;\n } else {\n if (Math.abs(this.phi1) + EPS10 >= HALF_PI) {\n this.cphi1 = 0;\n } else {\n this.cphi1 = 1 / Math.tan(this.phi1);\n }\n this.inverse = s_inv;\n this.forward = s_fwd;\n }\n}\n\nfunction e_fwd(p) {\n var lam = adjust_lon(p.x - (this.long0 || 0), this.over);\n var phi = p.y;\n var rh, E, c;\n rh = this.am1 + this.m1 - pj_mlfn(phi, E = Math.sin(phi), c = Math.cos(phi), this.en);\n E = c * lam / (rh * Math.sqrt(1 - this.es * E * E));\n p.x = rh * Math.sin(E);\n p.y = this.am1 - rh * Math.cos(E);\n\n p.x = this.a * p.x + (this.x0 || 0);\n p.y = this.a * p.y + (this.y0 || 0);\n return p;\n}\n\nfunction e_inv(p) {\n p.x = (p.x - (this.x0 || 0)) / this.a;\n p.y = (p.y - (this.y0 || 0)) / this.a;\n\n var s, rh, lam, phi;\n rh = hypot(p.x, p.y = this.am1 - p.y);\n phi = pj_inv_mlfn(this.am1 + this.m1 - rh, this.es, this.en);\n if ((s = Math.abs(phi)) < HALF_PI) {\n s = Math.sin(phi);\n lam = rh * Math.atan2(p.x, p.y) * Math.sqrt(1 - this.es * s * s) / Math.cos(phi);\n } else if (Math.abs(s - HALF_PI) <= EPS10) {\n lam = 0;\n } else {\n throw new Error();\n }\n p.x = adjust_lon(lam + (this.long0 || 0), this.over);\n p.y = adjust_lat(phi);\n return p;\n}\n\nfunction s_fwd(p) {\n var lam = adjust_lon(p.x - (this.long0 || 0), this.over);\n var phi = p.y;\n var E, rh;\n rh = this.cphi1 + this.phi1 - phi;\n if (Math.abs(rh) > EPS10) {\n p.x = rh * Math.sin(E = lam * Math.cos(phi) / rh);\n p.y = this.cphi1 - rh * Math.cos(E);\n } else {\n p.x = p.y = 0;\n }\n\n p.x = this.a * p.x + (this.x0 || 0);\n p.y = this.a * p.y + (this.y0 || 0);\n return p;\n}\n\nfunction s_inv(p) {\n p.x = (p.x - (this.x0 || 0)) / this.a;\n p.y = (p.y - (this.y0 || 0)) / this.a;\n\n var lam, phi;\n var rh = hypot(p.x, p.y = this.cphi1 - p.y);\n phi = this.cphi1 + this.phi1 - rh;\n if (Math.abs(phi) > HALF_PI) {\n throw new Error();\n }\n if (Math.abs(Math.abs(phi) - HALF_PI) <= EPS10) {\n lam = 0;\n } else {\n lam = rh * Math.atan2(p.x, p.y) / Math.cos(phi);\n }\n p.x = adjust_lon(lam + (this.long0 || 0), this.over);\n p.y = adjust_lat(phi);\n return p;\n}\n\nexport var names = ['bonne', 'Bonne (Werner lat_1=90)'];\nexport default {\n init: init,\n names: names\n};\n","import adjust_lon from '../common/adjust_lon';\nimport { D2R, R2D, HALF_PI, EPSLN } from '../constants/values';\nimport Proj from '../Proj';\nimport { names as longLatNames } from './longlat';\n\n/**\n Original projection implementation:\n https://github.com/OSGeo/PROJ/blob/46c47e9adf6376ae06afabe5d24a0016a05ced82/src/projections/ob_tran.cpp\n\n Documentation:\n https://proj.org/operations/projections/ob_tran.html\n\n References/Formulas:\n https://pubs.usgs.gov/pp/1395/report.pdf\n\n Examples:\n +proj=ob_tran +o_proj=moll +o_lat_p=45 +o_lon_p=-90\n +proj=ob_tran +o_proj=moll +o_lat_p=45 +o_lon_p=-90 +lon_0=60\n +proj=ob_tran +o_proj=moll +o_lat_p=45 +o_lon_p=-90 +lon_0=-90\n*/\n\nconst projectionType = {\n OBLIQUE: {\n forward: forwardOblique,\n inverse: inverseOblique\n },\n TRANSVERSE: {\n forward: forwardTransverse,\n inverse: inverseTransverse\n }\n};\n\n/**\n * @typedef {Object} LocalThis\n * @property {number} lamp\n * @property {number} cphip\n * @property {number} sphip\n * @property {Object} projectionType\n * @property {string | undefined} o_proj\n * @property {string | undefined} o_lon_p\n * @property {string | undefined} o_lat_p\n * @property {string | undefined} o_alpha\n * @property {string | undefined} o_lon_c\n * @property {string | undefined} o_lat_c\n * @property {string | undefined} o_lon_1\n * @property {string | undefined} o_lat_1\n * @property {string | undefined} o_lon_2\n * @property {string | undefined} o_lat_2\n * @property {number | undefined} oLongP\n * @property {number | undefined} oLatP\n * @property {number | undefined} oAlpha\n * @property {number | undefined} oLongC\n * @property {number | undefined} oLatC\n * @property {number | undefined} oLong1\n * @property {number | undefined} oLat1\n * @property {number | undefined} oLong2\n * @property {number | undefined} oLat2\n * @property {boolean} isIdentity\n * @property {import('..').Converter} obliqueProjection\n *\n */\n\n/**\n * Parameters can be from the following sets:\n * New pole --> o_lat_p, o_lon_p\n * Rotate about point --> o_alpha, o_lon_c, o_lat_c\n * New equator points --> lon_1, lat_1, lon_2, lat_2\n *\n * Per the original source code, the parameter sets are\n * checked in the order of the object below.\n */\nconst paramSets = {\n ROTATE: {\n o_alpha: 'oAlpha',\n o_lon_c: 'oLongC',\n o_lat_c: 'oLatC'\n },\n NEW_POLE: {\n o_lat_p: 'oLatP',\n o_lon_p: 'oLongP'\n },\n NEW_EQUATOR: {\n o_lon_1: 'oLong1',\n o_lat_1: 'oLat1',\n o_lon_2: 'oLong2',\n o_lat_2: 'oLat2'\n }\n};\n\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function init() {\n this.x0 = this.x0 || 0;\n this.y0 = this.y0 || 0;\n this.long0 = this.long0 || 0;\n this.title = this.title || 'General Oblique Transformation';\n this.isIdentity = longLatNames.includes(this.o_proj);\n\n /** Verify required parameters exist */\n if (!this.o_proj) {\n throw new Error('Missing parameter: o_proj');\n }\n\n if (this.o_proj === `ob_tran`) {\n throw new Error('Invalid value for o_proj: ' + this.o_proj);\n }\n\n const newProjStr = this.projStr.replace('+proj=ob_tran', '').replace('+o_proj=', '+proj=').trim();\n\n /** @type {import('../defs.js').ProjectionDefinition} */\n const oProj = Proj(newProjStr);\n if (!oProj) {\n throw new Error('Invalid parameter: o_proj. Unknown projection ' + this.o_proj);\n }\n oProj.long0 = 0; // we handle long0 before/after forward/inverse\n this.obliqueProjection = oProj;\n\n let matchedSet;\n const paramSetsKeys = Object.keys(paramSets);\n\n /**\n * parse strings, convert to radians, throw on NaN\n * @param {string} name\n * @returns {number | undefined}\n */\n const parseParam = (name) => {\n if (typeof this[name] === `undefined`) {\n return undefined;\n }\n const val = parseFloat(this[name]) * D2R;\n if (isNaN(val)) {\n throw new Error('Invalid value for ' + name + ': ' + this[name]);\n }\n return val;\n };\n\n for (let i = 0; i < paramSetsKeys.length; i++) {\n const setKey = paramSetsKeys[i];\n const set = paramSets[setKey];\n const params = Object.entries(set);\n const setHasParams = params.some(\n ([p]) => typeof this[p] !== 'undefined'\n );\n if (!setHasParams) {\n continue;\n }\n matchedSet = set;\n for (let ii = 0; ii < params.length; ii++) {\n const [inputParam, param] = params[ii];\n const val = parseParam(inputParam);\n if (typeof val === 'undefined') {\n throw new Error('Missing parameter: ' + inputParam + '.');\n }\n this[param] = val;\n }\n break;\n }\n\n if (!matchedSet) {\n throw new Error('No valid parameters provided for ob_tran projection.');\n }\n\n const { lamp, phip } = createRotation(this, matchedSet);\n this.lamp = lamp;\n\n if (Math.abs(phip) > EPSLN) {\n this.cphip = Math.cos(phip);\n this.sphip = Math.sin(phip);\n this.projectionType = projectionType.OBLIQUE;\n } else {\n this.projectionType = projectionType.TRANSVERSE;\n }\n}\n\n// ob_tran forward equations--mapping (lat,long) to (x,y)\n// transverse (90 degrees from normal orientation) - forwardTransverse\n// or oblique (arbitrary angle) used based on parameters - forwardOblique\n// -----------------------------------------------------------------\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function forward(p) {\n return this.projectionType.forward(this, p);\n}\n\n// inverse equations--mapping (x,y) to (lat,long)\n// transverse: inverseTransverse\n// oblique: inverseOblique\n// -----------------------------------------------------------------\n/** @this {import('../defs.js').ProjectionDefinition & LocalThis} */\nexport function inverse(p) {\n return this.projectionType.inverse(this, p);\n}\n\n/**\n * @param {import('../defs.js').ProjectionDefinition & LocalThis} params - Initialized projection definition\n * @param {Object} how - Transformation method\n * @returns {{phip: number, lamp: number}}\n */\nfunction createRotation(params, how) {\n let phip, lamp;\n if (how === paramSets.ROTATE) {\n let lamc = params.oLongC;\n let phic = params.oLatC;\n let alpha = params.oAlpha;\n if (Math.abs(Math.abs(phic) - HALF_PI) <= EPSLN) {\n throw new Error('Invalid value for o_lat_c: ' + params.o_lat_c + ' should be < 90°');\n }\n lamp = lamc + Math.atan2(-1 * Math.cos(alpha), -1 * Math.sin(alpha) * Math.sin(phic));\n phip = Math.asin(Math.cos(phic) * Math.sin(alpha));\n } else if (how === paramSets.NEW_POLE) {\n lamp = params.oLongP;\n phip = params.oLatP;\n } else {\n let lam1 = params.oLong1;\n let phi1 = params.oLat1;\n let lam2 = params.oLong2;\n let phi2 = params.oLat2;\n let con = Math.abs(phi1);\n\n if (Math.abs(phi1) > HALF_PI - EPSLN) {\n throw new Error('Invalid value for o_lat_1: ' + params.o_lat_1 + ' should be < 90°');\n }\n\n if (Math.abs(phi2) > HALF_PI - EPSLN) {\n throw new Error('Invalid value for o_lat_2: ' + params.o_lat_2 + ' should be < 90°');\n }\n\n if (Math.abs(phi1 - phi2) < EPSLN) {\n throw new Error('Invalid value for o_lat_1 and o_lat_2: o_lat_1 should be different from o_lat_2');\n }\n if (con < EPSLN) {\n throw new Error('Invalid value for o_lat_1: o_lat_1 should be different from zero');\n }\n\n lamp = Math.atan2(\n (Math.cos(phi1) * Math.sin(phi2) * Math.cos(lam1))\n - (Math.sin(phi1) * Math.cos(phi2) * Math.cos(lam2)),\n (Math.sin(phi1) * Math.cos(phi2) * Math.sin(lam2))\n - (Math.cos(phi1) * Math.sin(phi2) * Math.sin(lam1))\n );\n\n phip = Math.atan(-1 * Math.cos(lamp - lam1) / Math.tan(phi1));\n }\n\n return { lamp, phip };\n}\n\n/**\n * Forward (lng, lat) to (x, y) for oblique case\n * @param {import('../defs.js').ProjectionDefinition & LocalThis} self\n * @param {{x: number, y: number}} lp - lambda, phi\n */\nfunction forwardOblique(self, lp) {\n let { x: lam, y: phi } = lp;\n lam += self.long0;\n const coslam = Math.cos(lam);\n const sinphi = Math.sin(phi);\n const cosphi = Math.cos(phi);\n\n lp.x = adjust_lon(\n Math.atan2(\n cosphi * Math.sin(lam),\n (self.sphip * cosphi * coslam) + (self.cphip * sinphi)\n ) + self.lamp\n );\n lp.y = Math.asin(\n (self.sphip * sinphi) - (self.cphip * cosphi * coslam)\n );\n\n const result = self.obliqueProjection.forward(lp);\n if (self.isIdentity) {\n result.x *= R2D;\n result.y *= R2D;\n }\n return result;\n}\n\n/**\n * Forward (lng, lat) to (x, y) for transverse case\n * @param {import('../defs.js').ProjectionDefinition & LocalThis} self\n * @param {{x: number, y: number}} lp - lambda, phi\n */\nfunction forwardTransverse(self, lp) {\n let { x: lam, y: phi } = lp;\n lam += self.long0;\n const cosphi = Math.cos(phi);\n const coslam = Math.cos(lam);\n lp.x = adjust_lon(\n Math.atan2(\n cosphi * Math.sin(lam),\n Math.sin(phi)\n ) + self.lamp\n );\n lp.y = Math.asin(-1 * cosphi * coslam);\n\n const result = self.obliqueProjection.forward(lp);\n\n if (self.isIdentity) {\n result.x *= R2D;\n result.y *= R2D;\n }\n return result;\n}\n\n/**\n * Inverse (x, y) to (lng, lat) for oblique case\n * @param {import('../defs.js').ProjectionDefinition & LocalThis} self\n * @param {{x: number, y: number}} lp - lambda, phi\n */\nfunction inverseOblique(self, lp) {\n if (self.isIdentity) {\n lp.x *= D2R;\n lp.y *= D2R;\n }\n\n const innerLp = self.obliqueProjection.inverse(lp);\n let { x: lam, y: phi } = innerLp;\n\n if (lam < Number.MAX_VALUE) {\n lam -= self.lamp;\n const coslam = Math.cos(lam);\n const sinphi = Math.sin(phi);\n const cosphi = Math.cos(phi);\n lp.x = Math.atan2(\n cosphi * Math.sin(lam),\n (self.sphip * cosphi * coslam) - (self.cphip * sinphi)\n );\n lp.y = Math.asin(\n (self.sphip * sinphi) + (self.cphip * cosphi * coslam)\n );\n }\n\n lp.x = adjust_lon(lp.x + self.long0);\n return lp;\n}\n\n/**\n * Inverse (x, y) to (lng, lat) for transverse case\n * @param {import('../defs.js').ProjectionDefinition & LocalThis} self\n * @param {{x: number, y: number}} lp - lambda, phi\n */\nfunction inverseTransverse(self, lp) {\n if (self.isIdentity) {\n lp.x *= D2R;\n lp.y *= D2R;\n }\n\n const innerLp = self.obliqueProjection.inverse(lp);\n let { x: lam, y: phi } = innerLp;\n\n if (lam < Number.MAX_VALUE) {\n const cosphi = Math.cos(phi);\n lam -= self.lamp;\n lp.x = Math.atan2(\n cosphi * Math.sin(lam),\n -1 * Math.sin(phi)\n );\n lp.y = Math.asin(\n cosphi * Math.cos(lam)\n );\n }\n\n lp.x = adjust_lon(lp.x + self.long0);\n return lp;\n}\n\nexport var names = ['General Oblique Transformation', 'General_Oblique_Transformation', 'ob_tran'];\nexport default {\n init: init,\n forward: forward,\n inverse: inverse,\n names: names\n};\n","import tmerc from './lib/projections/tmerc';\nimport etmerc from './lib/projections/etmerc';\nimport utm from './lib/projections/utm';\nimport sterea from './lib/projections/sterea';\nimport stere from './lib/projections/stere';\nimport somerc from './lib/projections/somerc';\nimport omerc from './lib/projections/omerc';\nimport lcc from './lib/projections/lcc';\nimport krovak from './lib/projections/krovak';\nimport cass from './lib/projections/cass';\nimport laea from './lib/projections/laea';\nimport aea from './lib/projections/aea';\nimport gnom from './lib/projections/gnom';\nimport cea from './lib/projections/cea';\nimport eqc from './lib/projections/eqc';\nimport poly from './lib/projections/poly';\nimport nzmg from './lib/projections/nzmg';\nimport mill from './lib/projections/mill';\nimport sinu from './lib/projections/sinu';\nimport moll from './lib/projections/moll';\nimport eqdc from './lib/projections/eqdc';\nimport vandg from './lib/projections/vandg';\nimport aeqd from './lib/projections/aeqd';\nimport ortho from './lib/projections/ortho';\nimport qsc from './lib/projections/qsc';\nimport robin from './lib/projections/robin';\nimport geocent from './lib/projections/geocent';\nimport tpers from './lib/projections/tpers';\nimport geos from './lib/projections/geos';\nimport eqearth from './lib/projections/eqearth';\nimport bonne from './lib/projections/bonne';\nimport ob_tran from './lib/projections/ob_tran';\nexport default function (proj4) {\n proj4.Proj.projections.add(tmerc);\n proj4.Proj.projections.add(etmerc);\n proj4.Proj.projections.add(utm);\n proj4.Proj.projections.add(sterea);\n proj4.Proj.projections.add(stere);\n proj4.Proj.projections.add(somerc);\n proj4.Proj.projections.add(omerc);\n proj4.Proj.projections.add(lcc);\n proj4.Proj.projections.add(krovak);\n proj4.Proj.projections.add(cass);\n proj4.Proj.projections.add(laea);\n proj4.Proj.projections.add(aea);\n proj4.Proj.projections.add(gnom);\n proj4.Proj.projections.add(cea);\n proj4.Proj.projections.add(eqc);\n proj4.Proj.projections.add(poly);\n proj4.Proj.projections.add(nzmg);\n proj4.Proj.projections.add(mill);\n proj4.Proj.projections.add(sinu);\n proj4.Proj.projections.add(moll);\n proj4.Proj.projections.add(eqdc);\n proj4.Proj.projections.add(vandg);\n proj4.Proj.projections.add(aeqd);\n proj4.Proj.projections.add(ortho);\n proj4.Proj.projections.add(qsc);\n proj4.Proj.projections.add(robin);\n proj4.Proj.projections.add(geocent);\n proj4.Proj.projections.add(tpers);\n proj4.Proj.projections.add(geos);\n proj4.Proj.projections.add(eqearth);\n proj4.Proj.projections.add(bonne);\n proj4.Proj.projections.add(ob_tran);\n}\n","import core from './core';\nimport Proj from './Proj';\nimport Point from './Point';\nimport common from './common/toPoint';\nimport defs from './defs';\nimport nadgrid from './nadgrid';\nimport transform from './transform';\nimport mgrs from 'mgrs';\nimport includedProjections from '../projs';\n\n/**\n * @typedef {Object} Mgrs\n * @property {(lonlat: [number, number]) => string} forward\n * @property {(mgrsString: string) => [number, number, number, number]} inverse\n * @property {(mgrsString: string) => [number, number]} toPoint\n */\n\n/**\n * @typedef {import('./defs').ProjectionDefinition} ProjectionDefinition\n * @typedef {import('./core').TemplateCoordinates} TemplateCoordinates\n * @typedef {import('./core').InterfaceCoordinates} InterfaceCoordinates\n * @typedef {import('./core').Converter} Converter\n * @typedef {import('./Proj').DatumDefinition} DatumDefinition\n */\n\n/**\n * @template {import('./core').TemplateCoordinates} T\n * @type {core<T> & {defaultDatum: string, Proj: typeof Proj, WGS84: Proj, Point: typeof Point, toPoint: typeof common, defs: typeof defs, nadgrid: typeof nadgrid, transform: typeof transform, mgrs: Mgrs, version: string}}\n */\nconst proj4 = Object.assign(core, {\n defaultDatum: 'WGS84',\n Proj,\n WGS84: new Proj('WGS84'),\n Point,\n toPoint: common,\n defs,\n nadgrid,\n transform,\n mgrs,\n version: '__VERSION__'\n});\nincludedProjections(proj4);\nexport default proj4;\n","function s(n, r = 0) {\n if (!i(n))\n return Number.NaN;\n if (r === 0)\n return Math.round(n);\n const t = Math.pow(10, r);\n return Math.round(n * t) / t;\n}\nfunction f(n, r) {\n if (Array.isArray(r) && r.length > 2) {\n const t = r.map((u) => Math.abs(n - u)), e = t.reduce(\n (u, c) => u > c ? c : u\n ), o = t.indexOf(e);\n return typeof r[o] != \"number\" || isNaN(r[o]) ? n : r[o];\n }\n return n;\n}\nfunction i(n) {\n return n != null && !Number.isNaN(Number(n)) && (typeof n != \"string\" || n.length !== 0);\n}\nfunction h(n, r) {\n return !Number.isInteger(n) || !Number.isInteger(r) || r < n ? 0 : Math.floor(Math.random() * (r - n + 1) + n);\n}\nconst a = /\\B(?=(\\d{3})+(?!\\d))/g;\nfunction p(n, r = 2) {\n return i(n) ? `${s(n, r)}`.replace(a, \"'\") : \"\";\n}\nfunction d(n, r = \"'\") {\n const t = \".\", e = `${n}`.split(t);\n return typeof e[0] != \"string\" || e[0].length === 0 ? `${n}` : (e[0] = e[0].replace(a, r), e.join(t));\n}\nfunction m(n) {\n const r = Math.sign(n), t = Math.abs(n);\n return t > 360 ? r * (t % 360) : t === 360 ? 0 : n;\n}\nfunction M(n) {\n return /^\\d{4}(1[0-2]|0[1-9])(0[1-9]|[1-2][0-9]|3[0-1])$/.test(n);\n}\nfunction N(n) {\n if (!Array.isArray(n) || n.some((o) => !i(o)))\n return;\n const r = n.reduce((o, u) => o + Math.cos(u), 0), t = n.reduce((o, u) => o + Math.sin(u), 0);\n let e = Math.atan2(t, r);\n return e < 0 && (e = 6.2831853 + e), e;\n}\nconst b = {\n round: s,\n closest: f,\n isNumber: i,\n randomIntBetween: h,\n format: p,\n formatThousand: d,\n wrapDegrees: m,\n isTimestampYYYYMMDD: M,\n circularMean: N\n};\nexport {\n N as circularMean,\n f as closest,\n b as default,\n p as format,\n d as formatThousand,\n i as isNumber,\n M as isTimestampYYYYMMDD,\n b as numbers,\n h as randomIntBetween,\n s as round,\n m as wrapDegrees\n};\n","// 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 { 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 { getCoord } from \"@turf/invariant\";\nimport { radiansToLength, degreesToRadians } from \"@turf/helpers\";\nfunction distance(from, to, options = {}) {\n var coordinates1 = getCoord(from);\n var coordinates2 = getCoord(to);\n var dLat = degreesToRadians(coordinates2[1] - coordinates1[1]);\n var dLon = degreesToRadians(coordinates2[0] - coordinates1[0]);\n var lat1 = degreesToRadians(coordinates1[1]);\n var lat2 = degreesToRadians(coordinates2[1]);\n var a = Math.pow(Math.sin(dLat / 2), 2) + Math.pow(Math.sin(dLon / 2), 2) * Math.cos(lat1) * Math.cos(lat2);\n return radiansToLength(\n 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a)),\n options.units\n );\n}\nvar index_default = distance;\nexport {\n index_default as default,\n distance\n};\n//# sourceMappingURL=index.js.map","// index.js\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 ? geojson.features[featureIndex].geometry : isFeature ? geojson.geometry : 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 (callback(\n coords,\n coordIndex,\n featureIndex,\n multiFeatureIndex,\n geometryIndex\n ) === false)\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 (callback(\n coords[j],\n coordIndex,\n featureIndex,\n multiFeatureIndex,\n geometryIndex\n ) === false)\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 (callback(\n coords[j][k],\n coordIndex,\n featureIndex,\n multiFeatureIndex,\n geometryIndex\n ) === false)\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 (callback(\n coords[j][k][l],\n coordIndex,\n featureIndex,\n multiFeatureIndex,\n geometryIndex\n ) === false)\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 (coordEach(geometry.geometries[j], callback, excludeWrapCoord) === false)\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 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 ? geojson.features[i].geometry : isFeature ? geojson.geometry : geojson;\n featureProperties = isFeatureCollection ? geojson.features[i].properties : isFeature ? geojson.properties : {};\n featureBBox = isFeatureCollection ? geojson.features[i].bbox : isFeature ? geojson.bbox : void 0;\n featureId = isFeatureCollection ? geojson.features[i].id : isFeature ? geojson.id : 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 (callback(\n null,\n featureIndex,\n featureProperties,\n featureBBox,\n featureId\n ) === false)\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 (callback(\n geometry,\n featureIndex,\n featureProperties,\n featureBBox,\n featureId\n ) === false)\n return false;\n break;\n }\n case \"GeometryCollection\": {\n for (j = 0; j < geometry.geometries.length; j++) {\n if (callback(\n geometry.geometries[j],\n featureIndex,\n featureProperties,\n featureBBox,\n featureId\n ) === false)\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 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 (callback(\n feature(geometry, properties, { bbox, id }),\n featureIndex,\n 0\n ) === false)\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 (var multiFeatureIndex = 0; multiFeatureIndex < geometry.coordinates.length; multiFeatureIndex++) {\n var coordinate = geometry.coordinates[multiFeatureIndex];\n var geom = {\n type: geomType,\n coordinates: coordinate\n };\n if (callback(feature(geom, properties), featureIndex, multiFeatureIndex) === false)\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 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 (coordEach(\n feature2,\n function(currentCoord, coordIndex, featureIndexCoord, multiPartIndexCoord, geometryIndex) {\n if (previousCoords === void 0 || featureIndex > previousFeatureIndex || multiPartIndexCoord > previousMultiIndex || geometryIndex > prevGeomIndex) {\n previousCoords = currentCoord;\n previousFeatureIndex = featureIndex;\n previousMultiIndex = multiPartIndexCoord;\n prevGeomIndex = geometryIndex;\n segmentIndex = 0;\n return;\n }\n var currentSegment = lineString(\n [previousCoords, currentCoord],\n feature2.properties\n );\n if (callback(\n currentSegment,\n featureIndex,\n multiFeatureIndex,\n geometryIndex,\n segmentIndex\n ) === false)\n return false;\n segmentIndex++;\n previousCoords = currentCoord;\n }\n ) === false)\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 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 (callback(\n lineString(coords[geometryIndex], feature2.properties),\n featureIndex,\n multiFeatureIndex,\n geometryIndex\n ) === false)\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 [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 coords[geometryIndex][segmentIndex],\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 coords[multiFeatureIndex][segmentIndex],\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 = coords[multiFeatureIndex][geometryIndex].length - segmentIndex - 1;\n return lineString(\n [\n coords[multiFeatureIndex][geometryIndex][segmentIndex],\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","// index.ts\nimport { coordEach } from \"@turf/meta\";\nfunction bbox(geojson, options = {}) {\n if (geojson.bbox != null && true !== options.recompute) {\n return geojson.bbox;\n }\n const result = [Infinity, Infinity, -Infinity, -Infinity];\n coordEach(geojson, (coord) => {\n if (result[0] > coord[0]) {\n result[0] = coord[0];\n }\n if (result[1] > coord[1]) {\n result[1] = coord[1];\n }\n if (result[2] < coord[0]) {\n result[2] = coord[0];\n }\n if (result[3] < coord[1]) {\n result[3] = coord[1];\n }\n });\n return result;\n}\nvar index_default = bbox;\nexport {\n bbox,\n index_default as default\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { polygon } from \"@turf/helpers\";\nfunction bboxPolygon(bbox, options = {}) {\n const west = Number(bbox[0]);\n const south = Number(bbox[1]);\n const east = Number(bbox[2]);\n const north = Number(bbox[3]);\n if (bbox.length === 6) {\n throw new Error(\n \"@turf/bbox-polygon does not support BBox with 6 positions\"\n );\n }\n const lowLeft = [west, south];\n const topLeft = [west, north];\n const topRight = [east, north];\n const lowRight = [east, south];\n return polygon(\n [[lowLeft, lowRight, topRight, topLeft, lowLeft]],\n options.properties,\n { bbox, id: options.id }\n );\n}\nvar index_default = bboxPolygon;\nexport {\n bboxPolygon,\n index_default as default\n};\n//# sourceMappingURL=index.js.map","export const epsilon = 1.1102230246251565e-16;\nexport const splitter = 134217729;\nexport const resulterrbound = (3 + 8 * epsilon) * epsilon;\n\n// fast_expansion_sum_zeroelim routine from oritinal code\nexport function sum(elen, e, flen, f, h) {\n let Q, Qnew, hh, bvirt;\n let enow = e[0];\n let fnow = f[0];\n let eindex = 0;\n let findex = 0;\n if ((fnow > enow) === (fnow > -enow)) {\n Q = enow;\n enow = e[++eindex];\n } else {\n Q = fnow;\n fnow = f[++findex];\n }\n let hindex = 0;\n if (eindex < elen && findex < flen) {\n if ((fnow > enow) === (fnow > -enow)) {\n Qnew = enow + Q;\n hh = Q - (Qnew - enow);\n enow = e[++eindex];\n } else {\n Qnew = fnow + Q;\n hh = Q - (Qnew - fnow);\n fnow = f[++findex];\n }\n Q = Qnew;\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n while (eindex < elen && findex < flen) {\n if ((fnow > enow) === (fnow > -enow)) {\n Qnew = Q + enow;\n bvirt = Qnew - Q;\n hh = Q - (Qnew - bvirt) + (enow - bvirt);\n enow = e[++eindex];\n } else {\n Qnew = Q + fnow;\n bvirt = Qnew - Q;\n hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n fnow = f[++findex];\n }\n Q = Qnew;\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n }\n }\n while (eindex < elen) {\n Qnew = Q + enow;\n bvirt = Qnew - Q;\n hh = Q - (Qnew - bvirt) + (enow - bvirt);\n enow = e[++eindex];\n Q = Qnew;\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n }\n while (findex < flen) {\n Qnew = Q + fnow;\n bvirt = Qnew - Q;\n hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n fnow = f[++findex];\n Q = Qnew;\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n }\n if (Q !== 0 || hindex === 0) {\n h[hindex++] = Q;\n }\n return hindex;\n}\n\nexport function sum_three(alen, a, blen, b, clen, c, tmp, out) {\n return sum(sum(alen, a, blen, b, tmp), tmp, clen, c, out);\n}\n\n// scale_expansion_zeroelim routine from oritinal code\nexport function scale(elen, e, b, h) {\n let Q, sum, hh, product1, product0;\n let bvirt, c, ahi, alo, bhi, blo;\n\n c = splitter * b;\n bhi = c - (c - b);\n blo = b - bhi;\n let enow = e[0];\n Q = enow * b;\n c = splitter * enow;\n ahi = c - (c - enow);\n alo = enow - ahi;\n hh = alo * blo - (Q - ahi * bhi - alo * bhi - ahi * blo);\n let hindex = 0;\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n for (let i = 1; i < elen; i++) {\n enow = e[i];\n product1 = enow * b;\n c = splitter * enow;\n ahi = c - (c - enow);\n alo = enow - ahi;\n product0 = alo * blo - (product1 - ahi * bhi - alo * bhi - ahi * blo);\n sum = Q + product0;\n bvirt = sum - Q;\n hh = Q - (sum - bvirt) + (product0 - bvirt);\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n Q = product1 + sum;\n hh = sum - (Q - product1);\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n }\n if (Q !== 0 || hindex === 0) {\n h[hindex++] = Q;\n }\n return hindex;\n}\n\nexport function negate(elen, e) {\n for (let i = 0; i < elen; i++) e[i] = -e[i];\n return elen;\n}\n\nexport function estimate(elen, e) {\n let Q = e[0];\n for (let i = 1; i < elen; i++) Q += e[i];\n return Q;\n}\n\nexport function vec(n) {\n return new Float64Array(n);\n}\n","import {epsilon, splitter, resulterrbound, estimate, vec, sum} from './util.js';\n\nconst ccwerrboundA = (3 + 16 * epsilon) * epsilon;\nconst ccwerrboundB = (2 + 12 * epsilon) * epsilon;\nconst ccwerrboundC = (9 + 64 * epsilon) * epsilon * epsilon;\n\nconst B = vec(4);\nconst C1 = vec(8);\nconst C2 = vec(12);\nconst D = vec(16);\nconst u = vec(4);\n\nfunction orient2dadapt(ax, ay, bx, by, cx, cy, detsum) {\n let acxtail, acytail, bcxtail, bcytail;\n let bvirt, c, ahi, alo, bhi, blo, _i, _j, _0, s1, s0, t1, t0, u3;\n\n const acx = ax - cx;\n const bcx = bx - cx;\n const acy = ay - cy;\n const bcy = by - cy;\n\n s1 = acx * bcy;\n c = splitter * acx;\n ahi = c - (c - acx);\n alo = acx - ahi;\n c = splitter * bcy;\n bhi = c - (c - bcy);\n blo = bcy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = acy * bcx;\n c = splitter * acy;\n ahi = c - (c - acy);\n alo = acy - ahi;\n c = splitter * bcx;\n bhi = c - (c - bcx);\n blo = bcx - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n B[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n B[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n B[2] = _j - (u3 - bvirt) + (_i - bvirt);\n B[3] = u3;\n\n let det = estimate(4, B);\n let errbound = ccwerrboundB * detsum;\n if (det >= errbound || -det >= errbound) {\n return det;\n }\n\n bvirt = ax - acx;\n acxtail = ax - (acx + bvirt) + (bvirt - cx);\n bvirt = bx - bcx;\n bcxtail = bx - (bcx + bvirt) + (bvirt - cx);\n bvirt = ay - acy;\n acytail = ay - (acy + bvirt) + (bvirt - cy);\n bvirt = by - bcy;\n bcytail = by - (bcy + bvirt) + (bvirt - cy);\n\n if (acxtail === 0 && acytail === 0 && bcxtail === 0 && bcytail === 0) {\n return det;\n }\n\n errbound = ccwerrboundC * detsum + resulterrbound * Math.abs(det);\n det += (acx * bcytail + bcy * acxtail) - (acy * bcxtail + bcx * acytail);\n if (det >= errbound || -det >= errbound) return det;\n\n s1 = acxtail * bcy;\n c = splitter * acxtail;\n ahi = c - (c - acxtail);\n alo = acxtail - ahi;\n c = splitter * bcy;\n bhi = c - (c - bcy);\n blo = bcy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = acytail * bcx;\n c = splitter * acytail;\n ahi = c - (c - acytail);\n alo = acytail - ahi;\n c = splitter * bcx;\n bhi = c - (c - bcx);\n blo = bcx - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n u[3] = u3;\n const C1len = sum(4, B, 4, u, C1);\n\n s1 = acx * bcytail;\n c = splitter * acx;\n ahi = c - (c - acx);\n alo = acx - ahi;\n c = splitter * bcytail;\n bhi = c - (c - bcytail);\n blo = bcytail - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = acy * bcxtail;\n c = splitter * acy;\n ahi = c - (c - acy);\n alo = acy - ahi;\n c = splitter * bcxtail;\n bhi = c - (c - bcxtail);\n blo = bcxtail - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n u[3] = u3;\n const C2len = sum(C1len, C1, 4, u, C2);\n\n s1 = acxtail * bcytail;\n c = splitter * acxtail;\n ahi = c - (c - acxtail);\n alo = acxtail - ahi;\n c = splitter * bcytail;\n bhi = c - (c - bcytail);\n blo = bcytail - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = acytail * bcxtail;\n c = splitter * acytail;\n ahi = c - (c - acytail);\n alo = acytail - ahi;\n c = splitter * bcxtail;\n bhi = c - (c - bcxtail);\n blo = bcxtail - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n u[3] = u3;\n const Dlen = sum(C2len, C2, 4, u, D);\n\n return D[Dlen - 1];\n}\n\nexport function orient2d(ax, ay, bx, by, cx, cy) {\n const detleft = (ay - cy) * (bx - cx);\n const detright = (ax - cx) * (by - cy);\n const det = detleft - detright;\n\n const detsum = Math.abs(detleft + detright);\n if (Math.abs(det) >= ccwerrboundA * detsum) return det;\n\n return -orient2dadapt(ax, ay, bx, by, cx, cy, detsum);\n}\n\nexport function orient2dfast(ax, ay, bx, by, cx, cy) {\n return (ay - cy) * (bx - cx) - (ax - cx) * (by - cy);\n}\n","import { orient2d } from 'robust-predicates';\n\nfunction pointInPolygon(p, polygon) {\n var i;\n var ii;\n var k = 0;\n var f;\n var u1;\n var v1;\n var u2;\n var v2;\n var currentP;\n var nextP;\n\n var x = p[0];\n var y = p[1];\n\n var numContours = polygon.length;\n for (i = 0; i < numContours; i++) {\n ii = 0;\n var contour = polygon[i];\n var contourLen = contour.length - 1;\n\n currentP = contour[0];\n if (currentP[0] !== contour[contourLen][0] &&\n currentP[1] !== contour[contourLen][1]) {\n throw new Error('First and last coordinates in a ring must be the same')\n }\n\n u1 = currentP[0] - x;\n v1 = currentP[1] - y;\n\n for (ii; ii < contourLen; ii++) {\n nextP = contour[ii + 1];\n\n u2 = nextP[0] - x;\n v2 = nextP[1] - y;\n\n if (v1 === 0 && v2 === 0) {\n if ((u2 <= 0 && u1 >= 0) || (u1 <= 0 && u2 >= 0)) { return 0 }\n } else if ((v2 >= 0 && v1 <= 0) || (v2 <= 0 && v1 >= 0)) {\n f = orient2d(u1, u2, v1, v2, 0, 0);\n if (f === 0) { return 0 }\n if ((f > 0 && v2 > 0 && v1 <= 0) || (f < 0 && v2 <= 0 && v1 > 0)) { k++; }\n }\n currentP = nextP;\n v1 = v2;\n u1 = u2;\n }\n }\n\n if (k % 2 === 0) { return false }\n return true\n}\n\nexport { pointInPolygon as default };\n","// index.ts\nimport pip from \"point-in-polygon-hao\";\nimport { getCoord, getGeom } from \"@turf/invariant\";\nfunction booleanPointInPolygon(point, polygon, options = {}) {\n if (!point) {\n throw new Error(\"point is required\");\n }\n if (!polygon) {\n throw new Error(\"polygon is required\");\n }\n const pt = getCoord(point);\n const geom = getGeom(polygon);\n const type = geom.type;\n const bbox = polygon.bbox;\n let polys = geom.coordinates;\n if (bbox && inBBox(pt, bbox) === false) {\n return false;\n }\n if (type === \"Polygon\") {\n polys = [polys];\n }\n let result = false;\n for (var i = 0; i < polys.length; ++i) {\n const polyResult = pip(pt, polys[i]);\n if (polyResult === 0) return options.ignoreBoundary ? false : true;\n else if (polyResult) result = true;\n }\n return result;\n}\nfunction inBBox(pt, bbox) {\n return bbox[0] <= pt[0] && bbox[1] <= pt[1] && bbox[2] >= pt[0] && bbox[3] >= pt[1];\n}\nvar index_default = booleanPointInPolygon;\nexport {\n booleanPointInPolygon,\n index_default as default\n};\n//# sourceMappingURL=index.js.map","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\nfunction checkWhichEventIsLeft (e1, e2) {\n if (e1.p.x > e2.p.x) return 1\n if (e1.p.x < e2.p.x) return -1\n\n if (e1.p.y !== e2.p.y) return e1.p.y > e2.p.y ? 1 : -1\n return 1\n}\n\nfunction checkWhichSegmentHasRightEndpointFirst (seg1, seg2) {\n if (seg1.rightSweepEvent.p.x > seg2.rightSweepEvent.p.x) return 1\n if (seg1.rightSweepEvent.p.x < seg2.rightSweepEvent.p.x) return -1\n\n if (seg1.rightSweepEvent.p.y !== seg2.rightSweepEvent.p.y) return seg1.rightSweepEvent.p.y < seg2.rightSweepEvent.p.y ? 1 : -1\n return 1\n}\n\nclass Event {\n\n constructor (p, featureId, ringId, eventId) {\n this.p = {\n x: p[0],\n y: p[1]\n };\n this.featureId = featureId;\n this.ringId = ringId;\n this.eventId = eventId;\n\n this.otherEvent = null;\n this.isLeftEndpoint = null;\n }\n\n isSamePoint (eventToCheck) {\n return this.p.x === eventToCheck.p.x && this.p.y === eventToCheck.p.y\n }\n}\n\nfunction fillEventQueue (geojson, eventQueue) {\n if (geojson.type === 'FeatureCollection') {\n const features = geojson.features;\n for (let i = 0; i < features.length; i++) {\n processFeature(features[i], eventQueue);\n }\n } else {\n processFeature(geojson, eventQueue);\n }\n}\n\nlet featureId = 0;\nlet ringId = 0;\nlet eventId = 0;\nfunction processFeature (featureOrGeometry, eventQueue) {\n const geom = featureOrGeometry.type === 'Feature' ? featureOrGeometry.geometry : featureOrGeometry;\n let coords = geom.coordinates;\n // standardise the input\n if (geom.type === 'Polygon' || geom.type === 'MultiLineString') coords = [coords];\n if (geom.type === 'LineString') coords = [[coords]];\n\n for (let i = 0; i < coords.length; i++) {\n for (let ii = 0; ii < coords[i].length; ii++) {\n let currentP = coords[i][ii][0];\n let nextP = null;\n ringId = ringId + 1;\n for (let iii = 0; iii < coords[i][ii].length - 1; iii++) {\n nextP = coords[i][ii][iii + 1];\n\n const e1 = new Event(currentP, featureId, ringId, eventId);\n const e2 = new Event(nextP, featureId, ringId, eventId + 1);\n\n e1.otherEvent = e2;\n e2.otherEvent = e1;\n\n if (checkWhichEventIsLeft(e1, e2) > 0) {\n e2.isLeftEndpoint = true;\n e1.isLeftEndpoint = false;\n } else {\n e1.isLeftEndpoint = true;\n e2.isLeftEndpoint = false;\n }\n eventQueue.push(e1);\n eventQueue.push(e2);\n\n currentP = nextP;\n eventId = eventId + 1;\n }\n }\n }\n featureId = featureId + 1;\n}\n\nclass Segment {\n\n constructor (event) {\n this.leftSweepEvent = event;\n this.rightSweepEvent = event.otherEvent;\n }\n}\n\nfunction testSegmentIntersect (seg1, seg2) {\n if (seg1 === null || seg2 === null) return false\n\n if (seg1.leftSweepEvent.ringId === seg2.leftSweepEvent.ringId &&\n (seg1.rightSweepEvent.isSamePoint(seg2.leftSweepEvent) ||\n seg1.rightSweepEvent.isSamePoint(seg2.leftSweepEvent) ||\n seg1.rightSweepEvent.isSamePoint(seg2.rightSweepEvent) ||\n seg1.leftSweepEvent.isSamePoint(seg2.leftSweepEvent) ||\n seg1.leftSweepEvent.isSamePoint(seg2.rightSweepEvent))) return false\n\n const x1 = seg1.leftSweepEvent.p.x;\n const y1 = seg1.leftSweepEvent.p.y;\n const x2 = seg1.rightSweepEvent.p.x;\n const y2 = seg1.rightSweepEvent.p.y;\n const x3 = seg2.leftSweepEvent.p.x;\n const y3 = seg2.leftSweepEvent.p.y;\n const x4 = seg2.rightSweepEvent.p.x;\n const y4 = seg2.rightSweepEvent.p.y;\n\n const denom = ((y4 - y3) * (x2 - x1)) - ((x4 - x3) * (y2 - y1));\n const numeA = ((x4 - x3) * (y1 - y3)) - ((y4 - y3) * (x1 - x3));\n const numeB = ((x2 - x1) * (y1 - y3)) - ((y2 - y1) * (x1 - x3));\n\n if (denom === 0) {\n if (numeA === 0 && numeB === 0) return false\n return false\n }\n\n const uA = numeA / denom;\n const uB = numeB / denom;\n\n if (uA >= 0 && uA <= 1 && uB >= 0 && uB <= 1) {\n const x = x1 + (uA * (x2 - x1));\n const y = y1 + (uA * (y2 - y1));\n return [x, y]\n }\n return false\n}\n\n// import {debugEventAndSegments, debugRemovingSegment} from './debug'\n\nfunction runCheck (eventQueue, ignoreSelfIntersections) {\n ignoreSelfIntersections = ignoreSelfIntersections ? ignoreSelfIntersections : false;\n\n const intersectionPoints = [];\n const outQueue = new TinyQueue([], checkWhichSegmentHasRightEndpointFirst);\n\n while (eventQueue.length) {\n const event = eventQueue.pop();\n if (event.isLeftEndpoint) {\n // debugEventAndSegments(event.p, outQueue.data)\n const segment = new Segment(event);\n for (let i = 0; i < outQueue.data.length; i++) {\n const otherSeg = outQueue.data[i];\n if (ignoreSelfIntersections) {\n if (otherSeg.leftSweepEvent.featureId === event.featureId) continue\n }\n const intersection = testSegmentIntersect(segment, otherSeg);\n if (intersection !== false) intersectionPoints.push(intersection);\n }\n outQueue.push(segment);\n } else if (event.isLeftEndpoint === false) {\n outQueue.pop();\n // const seg = outQueue.pop()\n // debugRemovingSegment(event.p, seg)\n }\n }\n return intersectionPoints\n}\n\nfunction sweeplineIntersections (geojson, ignoreSelfIntersections) {\n const eventQueue = new TinyQueue([], checkWhichEventIsLeft);\n fillEventQueue(geojson, eventQueue);\n return runCheck(eventQueue, ignoreSelfIntersections)\n}\n\nexport default sweeplineIntersections;\n","// index.ts\nimport { feature, featureCollection, point } from \"@turf/helpers\";\n\n// lib/sweepline-intersections-export.ts\nimport lib from \"sweepline-intersections\";\nvar sweeplineIntersections = lib;\n\n// index.ts\nfunction lineIntersect(line1, line2, options = {}) {\n const { removeDuplicates = true, ignoreSelfIntersections = true } = options;\n let features = [];\n if (line1.type === \"FeatureCollection\")\n features = features.concat(line1.features);\n else if (line1.type === \"Feature\") features.push(line1);\n else if (line1.type === \"LineString\" || line1.type === \"Polygon\" || line1.type === \"MultiLineString\" || line1.type === \"MultiPolygon\") {\n features.push(feature(line1));\n }\n if (line2.type === \"FeatureCollection\")\n features = features.concat(line2.features);\n else if (line2.type === \"Feature\") features.push(line2);\n else if (line2.type === \"LineString\" || line2.type === \"Polygon\" || line2.type === \"MultiLineString\" || line2.type === \"MultiPolygon\") {\n features.push(feature(line2));\n }\n const intersections = sweeplineIntersections(\n featureCollection(features),\n ignoreSelfIntersections\n );\n let results = [];\n if (removeDuplicates) {\n const unique = {};\n intersections.forEach((intersection) => {\n const key = intersection.join(\",\");\n if (!unique[key]) {\n unique[key] = true;\n results.push(intersection);\n }\n });\n } else {\n results = intersections;\n }\n return featureCollection(results.map((r) => point(r)));\n}\nvar index_default = lineIntersect;\nexport {\n index_default as default,\n lineIntersect\n};\n//# sourceMappingURL=index.js.map","\nexport default function quickselect(arr, k, left, right, compare) {\n quickselectStep(arr, k, left || 0, right || (arr.length - 1), compare || defaultCompare);\n}\n\nfunction quickselectStep(arr, k, left, right, compare) {\n\n while (right > left) {\n if (right - left > 600) {\n var n = right - left + 1;\n var m = k - left + 1;\n var z = Math.log(n);\n var s = 0.5 * Math.exp(2 * z / 3);\n var sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n var newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n var newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n quickselectStep(arr, k, newLeft, newRight, compare);\n }\n\n var t = arr[k];\n var i = left;\n var j = right;\n\n swap(arr, left, k);\n if (compare(arr[right], t) > 0) swap(arr, left, right);\n\n while (i < j) {\n swap(arr, i, j);\n i++;\n j--;\n while (compare(arr[i], t) < 0) i++;\n while (compare(arr[j], t) > 0) j--;\n }\n\n if (compare(arr[left], t) === 0) swap(arr, left, j);\n else {\n j++;\n swap(arr, j, right);\n }\n\n if (j <= k) left = j + 1;\n if (k <= j) right = j - 1;\n }\n}\n\nfunction swap(arr, i, j) {\n var tmp = arr[i];\n arr[i] = arr[j];\n arr[j] = tmp;\n}\n\nfunction defaultCompare(a, b) {\n return a < b ? -1 : a > b ? 1 : 0;\n}\n","import quickselect from 'quickselect';\n\nexport default class RBush {\n constructor(maxEntries = 9) {\n // max entries in a node is 9 by default; min node fill is 40% for best performance\n this._maxEntries = Math.max(4, maxEntries);\n this._minEntries = Math.max(2, Math.ceil(this._maxEntries * 0.4));\n this.clear();\n }\n\n all() {\n return this._all(this.data, []);\n }\n\n search(bbox) {\n let node = this.data;\n const result = [];\n\n if (!intersects(bbox, node)) return result;\n\n const toBBox = this.toBBox;\n const nodesToSearch = [];\n\n while (node) {\n for (let i = 0; i < node.children.length; i++) {\n const child = node.children[i];\n const childBBox = node.leaf ? toBBox(child) : child;\n\n if (intersects(bbox, childBBox)) {\n if (node.leaf) result.push(child);\n else if (contains(bbox, childBBox)) this._all(child, result);\n else nodesToSearch.push(child);\n }\n }\n node = nodesToSearch.pop();\n }\n\n return result;\n }\n\n collides(bbox) {\n let node = this.data;\n\n if (!intersects(bbox, node)) return false;\n\n const nodesToSearch = [];\n while (node) {\n for (let i = 0; i < node.children.length; i++) {\n const child = node.children[i];\n const childBBox = node.leaf ? this.toBBox(child) : child;\n\n if (intersects(bbox, childBBox)) {\n if (node.leaf || contains(bbox, childBBox)) return true;\n nodesToSearch.push(child);\n }\n }\n node = nodesToSearch.pop();\n }\n\n return false;\n }\n\n load(data) {\n if (!(data && data.length)) return this;\n\n if (data.length < this._minEntries) {\n for (let i = 0; i < data.length; i++) {\n this.insert(data[i]);\n }\n return this;\n }\n\n // recursively build the tree with the given data from scratch using OMT algorithm\n let node = this._build(data.slice(), 0, data.length - 1, 0);\n\n if (!this.data.children.length) {\n // save as is if tree is empty\n this.data = node;\n\n } else if (this.data.height === node.height) {\n // split root if trees have the same height\n this._splitRoot(this.data, node);\n\n } else {\n if (this.data.height < node.height) {\n // swap trees if inserted one is bigger\n const tmpNode = this.data;\n this.data = node;\n node = tmpNode;\n }\n\n // insert the small tree into the large tree at appropriate level\n this._insert(node, this.data.height - node.height - 1, true);\n }\n\n return this;\n }\n\n insert(item) {\n if (item) this._insert(item, this.data.height - 1);\n return this;\n }\n\n clear() {\n this.data = createNode([]);\n return this;\n }\n\n remove(item, equalsFn) {\n if (!item) return this;\n\n let node = this.data;\n const bbox = this.toBBox(item);\n const path = [];\n const indexes = [];\n let i, parent, goingUp;\n\n // depth-first iterative tree traversal\n while (node || path.length) {\n\n if (!node) { // go up\n node = path.pop();\n parent = path[path.length - 1];\n i = indexes.pop();\n goingUp = true;\n }\n\n if (node.leaf) { // check current node\n const index = findItem(item, node.children, equalsFn);\n\n if (index !== -1) {\n // item found, remove the item and condense tree upwards\n node.children.splice(index, 1);\n path.push(node);\n this._condense(path);\n return this;\n }\n }\n\n if (!goingUp && !node.leaf && contains(node, bbox)) { // go down\n path.push(node);\n indexes.push(i);\n i = 0;\n parent = node;\n node = node.children[0];\n\n } else if (parent) { // go right\n i++;\n node = parent.children[i];\n goingUp = false;\n\n } else node = null; // nothing found\n }\n\n return this;\n }\n\n toBBox(item) { return item; }\n\n compareMinX(a, b) { return a.minX - b.minX; }\n compareMinY(a, b) { return a.minY - b.minY; }\n\n toJSON() { return this.data; }\n\n fromJSON(data) {\n this.data = data;\n return this;\n }\n\n _all(node, result) {\n const nodesToSearch = [];\n while (node) {\n if (node.leaf) result.push(...node.children);\n else nodesToSearch.push(...node.children);\n\n node = nodesToSearch.pop();\n }\n return result;\n }\n\n _build(items, left, right, height) {\n\n const N = right - left + 1;\n let M = this._maxEntries;\n let node;\n\n if (N <= M) {\n // reached leaf level; return leaf\n node = createNode(items.slice(left, right + 1));\n calcBBox(node, this.toBBox);\n return node;\n }\n\n if (!height) {\n // target height of the bulk-loaded tree\n height = Math.ceil(Math.log(N) / Math.log(M));\n\n // target number of root entries to maximize storage utilization\n M = Math.ceil(N / Math.pow(M, height - 1));\n }\n\n node = createNode([]);\n node.leaf = false;\n node.height = height;\n\n // split the items into M mostly square tiles\n\n const N2 = Math.ceil(N / M);\n const N1 = N2 * Math.ceil(Math.sqrt(M));\n\n multiSelect(items, left, right, N1, this.compareMinX);\n\n for (let i = left; i <= right; i += N1) {\n\n const right2 = Math.min(i + N1 - 1, right);\n\n multiSelect(items, i, right2, N2, this.compareMinY);\n\n for (let j = i; j <= right2; j += N2) {\n\n const right3 = Math.min(j + N2 - 1, right2);\n\n // pack each entry recursively\n node.children.push(this._build(items, j, right3, height - 1));\n }\n }\n\n calcBBox(node, this.toBBox);\n\n return node;\n }\n\n _chooseSubtree(bbox, node, level, path) {\n while (true) {\n path.push(node);\n\n if (node.leaf || path.length - 1 === level) break;\n\n let minArea = Infinity;\n let minEnlargement = Infinity;\n let targetNode;\n\n for (let i = 0; i < node.children.length; i++) {\n const child = node.children[i];\n const area = bboxArea(child);\n const enlargement = enlargedArea(bbox, child) - area;\n\n // choose entry with the least area enlargement\n if (enlargement < minEnlargement) {\n minEnlargement = enlargement;\n minArea = area < minArea ? area : minArea;\n targetNode = child;\n\n } else if (enlargement === minEnlargement) {\n // otherwise choose one with the smallest area\n if (area < minArea) {\n minArea = area;\n targetNode = child;\n }\n }\n }\n\n node = targetNode || node.children[0];\n }\n\n return node;\n }\n\n _insert(item, level, isNode) {\n const bbox = isNode ? item : this.toBBox(item);\n const insertPath = [];\n\n // find the best node for accommodating the item, saving all nodes along the path too\n const node = this._chooseSubtree(bbox, this.data, level, insertPath);\n\n // put the item into the node\n node.children.push(item);\n extend(node, bbox);\n\n // split on node overflow; propagate upwards if necessary\n while (level >= 0) {\n if (insertPath[level].children.length > this._maxEntries) {\n this._split(insertPath, level);\n level--;\n } else break;\n }\n\n // adjust bboxes along the insertion path\n this._adjustParentBBoxes(bbox, insertPath, level);\n }\n\n // split overflowed node into two\n _split(insertPath, level) {\n const node = insertPath[level];\n const M = node.children.length;\n const m = this._minEntries;\n\n this._chooseSplitAxis(node, m, M);\n\n const splitIndex = this._chooseSplitIndex(node, m, M);\n\n const newNode = createNode(node.children.splice(splitIndex, node.children.length - splitIndex));\n newNode.height = node.height;\n newNode.leaf = node.leaf;\n\n calcBBox(node, this.toBBox);\n calcBBox(newNode, this.toBBox);\n\n if (level) insertPath[level - 1].children.push(newNode);\n else this._splitRoot(node, newNode);\n }\n\n _splitRoot(node, newNode) {\n // split root node\n this.data = createNode([node, newNode]);\n this.data.height = node.height + 1;\n this.data.leaf = false;\n calcBBox(this.data, this.toBBox);\n }\n\n _chooseSplitIndex(node, m, M) {\n let index;\n let minOverlap = Infinity;\n let minArea = Infinity;\n\n for (let i = m; i <= M - m; i++) {\n const bbox1 = distBBox(node, 0, i, this.toBBox);\n const bbox2 = distBBox(node, i, M, this.toBBox);\n\n const overlap = intersectionArea(bbox1, bbox2);\n const area = bboxArea(bbox1) + bboxArea(bbox2);\n\n // choose distribution with minimum overlap\n if (overlap < minOverlap) {\n minOverlap = overlap;\n index = i;\n\n minArea = area < minArea ? area : minArea;\n\n } else if (overlap === minOverlap) {\n // otherwise choose distribution with minimum area\n if (area < minArea) {\n minArea = area;\n index = i;\n }\n }\n }\n\n return index || M - m;\n }\n\n // sorts node children by the best axis for split\n _chooseSplitAxis(node, m, M) {\n const compareMinX = node.leaf ? this.compareMinX : compareNodeMinX;\n const compareMinY = node.leaf ? this.compareMinY : compareNodeMinY;\n const xMargin = this._allDistMargin(node, m, M, compareMinX);\n const yMargin = this._allDistMargin(node, m, M, compareMinY);\n\n // if total distributions margin value is minimal for x, sort by minX,\n // otherwise it's already sorted by minY\n if (xMargin < yMargin) node.children.sort(compareMinX);\n }\n\n // total margin of all possible split distributions where each node is at least m full\n _allDistMargin(node, m, M, compare) {\n node.children.sort(compare);\n\n const toBBox = this.toBBox;\n const leftBBox = distBBox(node, 0, m, toBBox);\n const rightBBox = distBBox(node, M - m, M, toBBox);\n let margin = bboxMargin(leftBBox) + bboxMargin(rightBBox);\n\n for (let i = m; i < M - m; i++) {\n const child = node.children[i];\n extend(leftBBox, node.leaf ? toBBox(child) : child);\n margin += bboxMargin(leftBBox);\n }\n\n for (let i = M - m - 1; i >= m; i--) {\n const child = node.children[i];\n extend(rightBBox, node.leaf ? toBBox(child) : child);\n margin += bboxMargin(rightBBox);\n }\n\n return margin;\n }\n\n _adjustParentBBoxes(bbox, path, level) {\n // adjust bboxes along the given tree path\n for (let i = level; i >= 0; i--) {\n extend(path[i], bbox);\n }\n }\n\n _condense(path) {\n // go through the path, removing empty nodes and updating bboxes\n for (let i = path.length - 1, siblings; i >= 0; i--) {\n if (path[i].children.length === 0) {\n if (i > 0) {\n siblings = path[i - 1].children;\n siblings.splice(siblings.indexOf(path[i]), 1);\n\n } else this.clear();\n\n } else calcBBox(path[i], this.toBBox);\n }\n }\n}\n\nfunction findItem(item, items, equalsFn) {\n if (!equalsFn) return items.indexOf(item);\n\n for (let i = 0; i < items.length; i++) {\n if (equalsFn(item, items[i])) return i;\n }\n return -1;\n}\n\n// calculate node's bbox from bboxes of its children\nfunction calcBBox(node, toBBox) {\n distBBox(node, 0, node.children.length, toBBox, node);\n}\n\n// min bounding rectangle of node children from k to p-1\nfunction distBBox(node, k, p, toBBox, destNode) {\n if (!destNode) destNode = createNode(null);\n destNode.minX = Infinity;\n destNode.minY = Infinity;\n destNode.maxX = -Infinity;\n destNode.maxY = -Infinity;\n\n for (let i = k; i < p; i++) {\n const child = node.children[i];\n extend(destNode, node.leaf ? toBBox(child) : child);\n }\n\n return destNode;\n}\n\nfunction extend(a, b) {\n a.minX = Math.min(a.minX, b.minX);\n a.minY = Math.min(a.minY, b.minY);\n a.maxX = Math.max(a.maxX, b.maxX);\n a.maxY = Math.max(a.maxY, b.maxY);\n return a;\n}\n\nfunction compareNodeMinX(a, b) { return a.minX - b.minX; }\nfunction compareNodeMinY(a, b) { return a.minY - b.minY; }\n\nfunction bboxArea(a) { return (a.maxX - a.minX) * (a.maxY - a.minY); }\nfunction bboxMargin(a) { return (a.maxX - a.minX) + (a.maxY - a.minY); }\n\nfunction enlargedArea(a, b) {\n return (Math.max(b.maxX, a.maxX) - Math.min(b.minX, a.minX)) *\n (Math.max(b.maxY, a.maxY) - Math.min(b.minY, a.minY));\n}\n\nfunction intersectionArea(a, b) {\n const minX = Math.max(a.minX, b.minX);\n const minY = Math.max(a.minY, b.minY);\n const maxX = Math.min(a.maxX, b.maxX);\n const maxY = Math.min(a.maxY, b.maxY);\n\n return Math.max(0, maxX - minX) *\n Math.max(0, maxY - minY);\n}\n\nfunction contains(a, b) {\n return a.minX <= b.minX &&\n a.minY <= b.minY &&\n b.maxX <= a.maxX &&\n b.maxY <= a.maxY;\n}\n\nfunction intersects(a, b) {\n return b.minX <= a.maxX &&\n b.minY <= a.maxY &&\n b.maxX >= a.minX &&\n b.maxY >= a.minY;\n}\n\nfunction createNode(children) {\n return {\n children,\n height: 1,\n leaf: true,\n minX: Infinity,\n minY: Infinity,\n maxX: -Infinity,\n maxY: -Infinity\n };\n}\n\n// sort an array so that items come in groups of n unsorted items, with groups sorted between each other;\n// combines selection algorithm with binary divide & conquer approach\n\nfunction multiSelect(arr, left, right, n, compare) {\n const stack = [left, right];\n\n while (stack.length) {\n right = stack.pop();\n left = stack.pop();\n\n if (right - left <= n) continue;\n\n const mid = left + Math.ceil((right - left) / n / 2) * n;\n quickselect(arr, mid, left, right, compare);\n\n stack.push(left, mid, mid, right);\n }\n}\n","// index.js\nimport rbush from \"rbush\";\nimport { featureCollection } from \"@turf/helpers\";\nimport { featureEach } from \"@turf/meta\";\nimport { bbox as turfBBox } from \"@turf/bbox\";\nfunction geojsonRbush(maxEntries) {\n var tree = new rbush(maxEntries);\n tree.insert = function(feature) {\n if (feature.type !== \"Feature\") throw new Error(\"invalid feature\");\n feature.bbox = feature.bbox ? feature.bbox : turfBBox(feature);\n return rbush.prototype.insert.call(this, feature);\n };\n tree.load = function(features) {\n var load = [];\n if (Array.isArray(features)) {\n features.forEach(function(feature) {\n if (feature.type !== \"Feature\") throw new Error(\"invalid features\");\n feature.bbox = feature.bbox ? feature.bbox : turfBBox(feature);\n load.push(feature);\n });\n } else {\n featureEach(features, function(feature) {\n if (feature.type !== \"Feature\") throw new Error(\"invalid features\");\n feature.bbox = feature.bbox ? feature.bbox : turfBBox(feature);\n load.push(feature);\n });\n }\n return rbush.prototype.load.call(this, load);\n };\n tree.remove = function(feature, equals) {\n if (feature.type !== \"Feature\") throw new Error(\"invalid feature\");\n feature.bbox = feature.bbox ? feature.bbox : turfBBox(feature);\n return rbush.prototype.remove.call(this, feature, equals);\n };\n tree.clear = function() {\n return rbush.prototype.clear.call(this);\n };\n tree.search = function(geojson) {\n var features = rbush.prototype.search.call(this, this.toBBox(geojson));\n return featureCollection(features);\n };\n tree.collides = function(geojson) {\n return rbush.prototype.collides.call(this, this.toBBox(geojson));\n };\n tree.all = function() {\n var features = rbush.prototype.all.call(this);\n return featureCollection(features);\n };\n tree.toJSON = function() {\n return rbush.prototype.toJSON.call(this);\n };\n tree.fromJSON = function(json) {\n return rbush.prototype.fromJSON.call(this, json);\n };\n tree.toBBox = function(geojson) {\n var bbox;\n if (geojson.bbox) bbox = geojson.bbox;\n else if (Array.isArray(geojson) && geojson.length === 4) bbox = geojson;\n else if (Array.isArray(geojson) && geojson.length === 6)\n bbox = [geojson[0], geojson[1], geojson[3], geojson[4]];\n else if (geojson.type === \"Feature\") bbox = turfBBox(geojson);\n else if (geojson.type === \"FeatureCollection\") bbox = turfBBox(geojson);\n else throw new Error(\"invalid geojson\");\n return {\n minX: bbox[0],\n minY: bbox[1],\n maxX: bbox[2],\n maxY: bbox[3]\n };\n };\n return tree;\n}\nvar index_default = geojsonRbush;\nexport {\n index_default as default,\n geojsonRbush\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { featureCollection, lineString } from \"@turf/helpers\";\nimport { getCoords } from \"@turf/invariant\";\nimport { flattenEach } from \"@turf/meta\";\nfunction lineSegment(geojson) {\n if (!geojson) {\n throw new Error(\"geojson is required\");\n }\n const results = [];\n flattenEach(geojson, (feature) => {\n lineSegmentFeature(feature, results);\n });\n return featureCollection(results);\n}\nfunction lineSegmentFeature(geojson, results) {\n let coords = [];\n const geometry = geojson.geometry;\n if (geometry !== null) {\n switch (geometry.type) {\n case \"Polygon\":\n coords = getCoords(geometry);\n break;\n case \"LineString\":\n coords = [getCoords(geometry)];\n }\n coords.forEach((coord) => {\n const segments = createSegments(coord, geojson.properties);\n segments.forEach((segment) => {\n segment.id = results.length;\n results.push(segment);\n });\n });\n }\n}\nfunction createSegments(coords, properties) {\n const segments = [];\n coords.reduce((previousCoords, currentCoords) => {\n const segment = lineString([previousCoords, currentCoords], properties);\n segment.bbox = bbox(previousCoords, currentCoords);\n segments.push(segment);\n return currentCoords;\n });\n return segments;\n}\nfunction bbox(coords1, coords2) {\n const x1 = coords1[0];\n const y1 = coords1[1];\n const x2 = coords2[0];\n const y2 = coords2[1];\n const west = x1 < x2 ? x1 : x2;\n const south = y1 < y2 ? y1 : y2;\n const east = x1 > x2 ? x1 : x2;\n const north = y1 > y2 ? y1 : y2;\n return [west, south, east, north];\n}\nvar index_default = lineSegment;\nexport {\n index_default as default,\n lineSegment\n};\n//# sourceMappingURL=index.js.map","var __defProp = Object.defineProperty;\nvar __defProps = Object.defineProperties;\nvar __getOwnPropDescs = Object.getOwnPropertyDescriptors;\nvar __getOwnPropSymbols = Object.getOwnPropertySymbols;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __propIsEnum = Object.prototype.propertyIsEnumerable;\nvar __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;\nvar __spreadValues = (a, b) => {\n for (var prop in b || (b = {}))\n if (__hasOwnProp.call(b, prop))\n __defNormalProp(a, prop, b[prop]);\n if (__getOwnPropSymbols)\n for (var prop of __getOwnPropSymbols(b)) {\n if (__propIsEnum.call(b, prop))\n __defNormalProp(a, prop, b[prop]);\n }\n return a;\n};\nvar __spreadProps = (a, b) => __defProps(a, __getOwnPropDescs(b));\n\n// index.ts\nimport { distance } from \"@turf/distance\";\nimport { flattenEach } from \"@turf/meta\";\nimport {\n point,\n degreesToRadians,\n radiansToDegrees\n} from \"@turf/helpers\";\nimport { getCoord, getCoords } from \"@turf/invariant\";\nfunction nearestPointOnLine(lines, pt, options = {}) {\n if (!lines || !pt) {\n throw new Error(\"lines and pt are required arguments\");\n }\n const ptPos = getCoord(pt);\n let closestPt = point([Infinity, Infinity], {\n dist: Infinity,\n index: -1,\n multiFeatureIndex: -1,\n location: -1\n });\n let length = 0;\n flattenEach(\n lines,\n function(line, _featureIndex, multiFeatureIndex) {\n const coords = getCoords(line);\n for (let i = 0; i < coords.length - 1; i++) {\n const start = point(coords[i]);\n const startPos = getCoord(start);\n const stop = point(coords[i + 1]);\n const stopPos = getCoord(stop);\n const sectionLength = distance(start, stop, options);\n let intersectPos;\n let wasEnd;\n if (stopPos[0] === ptPos[0] && stopPos[1] === ptPos[1]) {\n [intersectPos, wasEnd] = [stopPos, true];\n } else if (startPos[0] === ptPos[0] && startPos[1] === ptPos[1]) {\n [intersectPos, wasEnd] = [startPos, false];\n } else {\n [intersectPos, wasEnd] = nearestPointOnSegment(\n startPos,\n stopPos,\n ptPos\n );\n }\n const intersectPt = point(intersectPos, {\n dist: distance(pt, intersectPos, options),\n multiFeatureIndex,\n location: length + distance(start, intersectPos, options)\n });\n if (intersectPt.properties.dist < closestPt.properties.dist) {\n closestPt = __spreadProps(__spreadValues({}, intersectPt), {\n properties: __spreadProps(__spreadValues({}, intersectPt.properties), {\n // Legacy behaviour where index progresses to next segment # if we\n // went with the end point this iteration.\n index: wasEnd ? i + 1 : i\n })\n });\n }\n length += sectionLength;\n }\n }\n );\n return closestPt;\n}\nfunction dot(v1, v2) {\n const [v1x, v1y, v1z] = v1;\n const [v2x, v2y, v2z] = v2;\n return v1x * v2x + v1y * v2y + v1z * v2z;\n}\nfunction cross(v1, v2) {\n const [v1x, v1y, v1z] = v1;\n const [v2x, v2y, v2z] = v2;\n return [v1y * v2z - v1z * v2y, v1z * v2x - v1x * v2z, v1x * v2y - v1y * v2x];\n}\nfunction magnitude(v) {\n return Math.sqrt(Math.pow(v[0], 2) + Math.pow(v[1], 2) + Math.pow(v[2], 2));\n}\nfunction normalize(v) {\n const mag = magnitude(v);\n return [v[0] / mag, v[1] / mag, v[2] / mag];\n}\nfunction lngLatToVector(a) {\n const lat = degreesToRadians(a[1]);\n const lng = degreesToRadians(a[0]);\n return [\n Math.cos(lat) * Math.cos(lng),\n Math.cos(lat) * Math.sin(lng),\n Math.sin(lat)\n ];\n}\nfunction vectorToLngLat(v) {\n const [x, y, z] = v;\n const zClamp = Math.min(Math.max(z, -1), 1);\n const lat = radiansToDegrees(Math.asin(zClamp));\n const lng = radiansToDegrees(Math.atan2(y, x));\n return [lng, lat];\n}\nfunction nearestPointOnSegment(posA, posB, posC) {\n const A = lngLatToVector(posA);\n const B = lngLatToVector(posB);\n const C = lngLatToVector(posC);\n const segmentAxis = cross(A, B);\n if (segmentAxis[0] === 0 && segmentAxis[1] === 0 && segmentAxis[2] === 0) {\n if (dot(A, B) > 0) {\n return [[...posB], true];\n } else {\n return [[...posC], false];\n }\n }\n const targetAxis = cross(segmentAxis, C);\n if (targetAxis[0] === 0 && targetAxis[1] === 0 && targetAxis[2] === 0) {\n return [[...posB], true];\n }\n const intersectionAxis = cross(targetAxis, segmentAxis);\n const I1 = normalize(intersectionAxis);\n const I2 = [-I1[0], -I1[1], -I1[2]];\n const I = dot(C, I1) > dot(C, I2) ? I1 : I2;\n const segmentAxisNorm = normalize(segmentAxis);\n const cmpAI = dot(cross(A, I), segmentAxisNorm);\n const cmpIB = dot(cross(I, B), segmentAxisNorm);\n if (cmpAI >= 0 && cmpIB >= 0) {\n return [vectorToLngLat(I), false];\n }\n if (dot(A, C) > dot(B, C)) {\n return [[...posA], false];\n } else {\n return [[...posB], true];\n }\n}\nvar index_default = nearestPointOnLine;\nexport {\n index_default as default,\n nearestPointOnLine\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { coordEach } from \"@turf/meta\";\nimport { isObject } from \"@turf/helpers\";\nfunction truncate(geojson, options) {\n options = options != null ? options : {};\n if (!isObject(options)) throw new Error(\"options is invalid\");\n var precision = options.precision;\n var coordinates = options.coordinates;\n var mutate = options.mutate;\n precision = precision === void 0 || precision === null || isNaN(precision) ? 6 : precision;\n coordinates = coordinates === void 0 || coordinates === null || isNaN(coordinates) ? 3 : coordinates;\n if (!geojson) throw new Error(\"<geojson> is required\");\n if (typeof precision !== \"number\")\n throw new Error(\"<precision> must be a number\");\n if (typeof coordinates !== \"number\")\n throw new Error(\"<coordinates> must be a number\");\n if (mutate === false || mutate === void 0)\n geojson = JSON.parse(JSON.stringify(geojson));\n var factor = Math.pow(10, precision);\n coordEach(geojson, function(coords) {\n truncateCoords(coords, factor, coordinates);\n });\n return geojson;\n}\nfunction truncateCoords(coords, factor, coordinates) {\n if (coords.length > coordinates) coords.splice(coordinates, coords.length);\n for (var i = 0; i < coords.length; i++) {\n coords[i] = Math.round(coords[i] * factor) / factor;\n }\n return coords;\n}\nvar index_default = truncate;\nexport {\n index_default as default,\n truncate\n};\n//# sourceMappingURL=index.js.map","// index.js\nimport { geojsonRbush as rbush } from \"@turf/geojson-rbush\";\nimport { truncate } from \"@turf/truncate\";\nimport { lineSegment } from \"@turf/line-segment\";\nimport { lineIntersect } from \"@turf/line-intersect\";\nimport { nearestPointOnLine } from \"@turf/nearest-point-on-line\";\nimport { getCoords, getCoord, getType } from \"@turf/invariant\";\nimport { featureEach, featureReduce, flattenEach } from \"@turf/meta\";\nimport { lineString, featureCollection } from \"@turf/helpers\";\nfunction lineSplit(line, splitter) {\n if (!line) throw new Error(\"line is required\");\n if (!splitter) throw new Error(\"splitter is required\");\n var lineType = getType(line);\n var splitterType = getType(splitter);\n if (lineType !== \"LineString\") throw new Error(\"line must be LineString\");\n if (splitterType === \"FeatureCollection\")\n throw new Error(\"splitter cannot be a FeatureCollection\");\n if (splitterType === \"GeometryCollection\")\n throw new Error(\"splitter cannot be a GeometryCollection\");\n var truncatedSplitter = truncate(splitter, { precision: 7 });\n switch (splitterType) {\n case \"Point\":\n return splitLineWithPoint(line, truncatedSplitter);\n case \"MultiPoint\":\n return splitLineWithPoints(line, truncatedSplitter);\n case \"LineString\":\n case \"MultiLineString\":\n case \"Polygon\":\n case \"MultiPolygon\":\n return splitLineWithPoints(\n line,\n lineIntersect(line, truncatedSplitter, {\n ignoreSelfIntersections: true\n })\n );\n }\n}\nfunction splitLineWithPoints(line, splitter) {\n var results = [];\n var tree = rbush();\n flattenEach(splitter, function(point) {\n results.forEach(function(feature, index) {\n feature.id = index;\n });\n if (!results.length) {\n results = splitLineWithPoint(line, point).features;\n tree.load(featureCollection(results));\n } else {\n var search = tree.search(point);\n if (search.features.length) {\n var closestLine = findClosestFeature(point, search);\n results = results.filter(function(feature) {\n return feature.id !== closestLine.id;\n });\n tree.remove(closestLine);\n featureEach(splitLineWithPoint(closestLine, point), function(line2) {\n results.push(line2);\n tree.insert(line2);\n });\n }\n }\n });\n return featureCollection(results);\n}\nfunction splitLineWithPoint(line, splitter) {\n var results = [];\n var startPoint = getCoords(line)[0];\n var endPoint = getCoords(line)[line.geometry.coordinates.length - 1];\n if (pointsEquals(startPoint, getCoord(splitter)) || pointsEquals(endPoint, getCoord(splitter)))\n return featureCollection([line]);\n var tree = rbush();\n var segments = lineSegment(line);\n tree.load(segments);\n var search = tree.search(splitter);\n if (!search.features.length) return featureCollection([line]);\n var closestSegment = findClosestFeature(splitter, search);\n var initialValue = [startPoint];\n var lastCoords = featureReduce(\n segments,\n function(previous, current, index) {\n var currentCoords = getCoords(current)[1];\n var splitterCoords = getCoord(splitter);\n if (index === closestSegment.id) {\n previous.push(splitterCoords);\n results.push(lineString(previous));\n if (pointsEquals(splitterCoords, currentCoords))\n return [splitterCoords];\n return [splitterCoords, currentCoords];\n } else {\n previous.push(currentCoords);\n return previous;\n }\n },\n initialValue\n );\n if (lastCoords.length > 1) {\n results.push(lineString(lastCoords));\n }\n return featureCollection(results);\n}\nfunction findClosestFeature(point, lines) {\n if (!lines.features.length) throw new Error(\"lines must contain features\");\n if (lines.features.length === 1) return lines.features[0];\n var closestFeature;\n var closestDistance = Infinity;\n featureEach(lines, function(segment) {\n var pt = nearestPointOnLine(segment, point);\n var dist = pt.properties.dist;\n if (dist < closestDistance) {\n closestFeature = segment;\n closestDistance = dist;\n }\n });\n return closestFeature;\n}\nfunction pointsEquals(pt1, pt2) {\n return pt1[0] === pt2[0] && pt1[1] === pt2[1];\n}\nvar index_default = lineSplit;\nexport {\n index_default as default,\n lineSplit\n};\n//# sourceMappingURL=index.js.map","/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n var undefined;\n\n /** Used as the semantic version number. */\n var VERSION = '4.17.21';\n\n /** Used as the size to enable large array optimizations. */\n var LARGE_ARRAY_SIZE = 200;\n\n /** Error message constants. */\n var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n FUNC_ERROR_TEXT = 'Expected a function',\n INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';\n\n /** Used to stand-in for `undefined` hash values. */\n var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n /** Used as the maximum memoize cache size. */\n var MAX_MEMOIZE_SIZE = 500;\n\n /** Used as the internal argument placeholder. */\n var PLACEHOLDER = '__lodash_placeholder__';\n\n /** Used to compose bitmasks for cloning. */\n var CLONE_DEEP_FLAG = 1,\n CLONE_FLAT_FLAG = 2,\n CLONE_SYMBOLS_FLAG = 4;\n\n /** Used to compose bitmasks for value comparisons. */\n var COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n /** Used to compose bitmasks for function metadata. */\n var WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_BOUND_FLAG = 4,\n WRAP_CURRY_FLAG = 8,\n WRAP_CURRY_RIGHT_FLAG = 16,\n WRAP_PARTIAL_FLAG = 32,\n WRAP_PARTIAL_RIGHT_FLAG = 64,\n WRAP_ARY_FLAG = 128,\n WRAP_REARG_FLAG = 256,\n WRAP_FLIP_FLAG = 512;\n\n /** Used as default options for `_.truncate`. */\n var DEFAULT_TRUNC_LENGTH = 30,\n DEFAULT_TRUNC_OMISSION = '...';\n\n /** Used to detect hot functions by number of calls within a span of milliseconds. */\n var HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n /** Used to indicate the type of lazy iteratees. */\n var LAZY_FILTER_FLAG = 1,\n LAZY_MAP_FLAG = 2,\n LAZY_WHILE_FLAG = 3;\n\n /** Used as references for various `Number` constants. */\n var INFINITY = 1 / 0,\n MAX_SAFE_INTEGER = 9007199254740991,\n MAX_INTEGER = 1.7976931348623157e+308,\n NAN = 0 / 0;\n\n /** Used as references for the maximum length and index of an array. */\n var MAX_ARRAY_LENGTH = 4294967295,\n MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n /** Used to associate wrap methods with their bit flags. */\n var wrapFlags = [\n ['ary', WRAP_ARY_FLAG],\n ['bind', WRAP_BIND_FLAG],\n ['bindKey', WRAP_BIND_KEY_FLAG],\n ['curry', WRAP_CURRY_FLAG],\n ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n ['flip', WRAP_FLIP_FLAG],\n ['partial', WRAP_PARTIAL_FLAG],\n ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n ['rearg', WRAP_REARG_FLAG]\n ];\n\n /** `Object#toString` result references. */\n var argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n asyncTag = '[object AsyncFunction]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n domExcTag = '[object DOMException]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n nullTag = '[object Null]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n proxyTag = '[object Proxy]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n undefinedTag = '[object Undefined]',\n weakMapTag = '[object WeakMap]',\n weakSetTag = '[object WeakSet]';\n\n var arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n /** Used to match empty string literals in compiled template source. */\n var reEmptyStringLeading = /\\b__p \\+= '';/g,\n reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n /** Used to match HTML entities and HTML characters. */\n var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n reUnescapedHtml = /[&<>\"']/g,\n reHasEscapedHtml = RegExp(reEscapedHtml.source),\n reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n /** Used to match template delimiters. */\n var reEscape = /<%-([\\s\\S]+?)%>/g,\n reEvaluate = /<%([\\s\\S]+?)%>/g,\n reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n /** Used to match property names within property paths. */\n var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/,\n rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n /**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\n var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n reHasRegExpChar = RegExp(reRegExpChar.source);\n\n /** Used to match leading whitespace. */\n var reTrimStart = /^\\s+/;\n\n /** Used to match a single whitespace character. */\n var reWhitespace = /\\s/;\n\n /** Used to match wrap detail comments. */\n var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n reSplitDetails = /,? & /;\n\n /** Used to match words composed of alphanumeric characters. */\n var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n /**\n * Used to validate the `validate` option in `_.template` variable.\n *\n * Forbids characters which could potentially change the meaning of the function argument definition:\n * - \"(),\" (modification of function parameters)\n * - \"=\" (default value)\n * - \"[]{}\" (destructuring of function parameters)\n * - \"/\" (beginning of a comment)\n * - whitespace\n */\n var reForbiddenIdentifierChars = /[()=,{}\\[\\]\\/\\s]/;\n\n /** Used to match backslashes in property paths. */\n var reEscapeChar = /\\\\(\\\\)?/g;\n\n /**\n * Used to match\n * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n */\n var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n /** Used to match `RegExp` flags from their coerced string values. */\n var reFlags = /\\w*$/;\n\n /** Used to detect bad signed hexadecimal string values. */\n var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n /** Used to detect binary string values. */\n var reIsBinary = /^0b[01]+$/i;\n\n /** Used to detect host constructors (Safari). */\n var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n /** Used to detect octal string values. */\n var reIsOctal = /^0o[0-7]+$/i;\n\n /** Used to detect unsigned integer values. */\n var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n /** Used to match Latin Unicode letters (excluding mathematical operators). */\n var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n /** Used to ensure capturing order of template delimiters. */\n var reNoMatch = /($^)/;\n\n /** Used to match unescaped characters in compiled string literals. */\n var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n /** Used to compose unicode character classes. */\n var rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsDingbatRange = '\\\\u2700-\\\\u27bf',\n rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n rsPunctuationRange = '\\\\u2000-\\\\u206f',\n rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n rsVarRange = '\\\\ufe0e\\\\ufe0f',\n rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n /** Used to compose unicode capture groups. */\n var rsApos = \"['\\u2019]\",\n rsAstral = '[' + rsAstralRange + ']',\n rsBreak = '[' + rsBreakRange + ']',\n rsCombo = '[' + rsComboRange + ']',\n rsDigits = '\\\\d+',\n rsDingbat = '[' + rsDingbatRange + ']',\n rsLower = '[' + rsLowerRange + ']',\n rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n rsNonAstral = '[^' + rsAstralRange + ']',\n rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n rsUpper = '[' + rsUpperRange + ']',\n rsZWJ = '\\\\u200d';\n\n /** Used to compose unicode regexes. */\n var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n reOptMod = rsModifier + '?',\n rsOptVar = '[' + rsVarRange + ']?',\n rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n rsSeq = rsOptVar + reOptMod + rsOptJoin,\n rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n /** Used to match apostrophes. */\n var reApos = RegExp(rsApos, 'g');\n\n /**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\n var reComboMark = RegExp(rsCombo, 'g');\n\n /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n /** Used to match complex or compound words. */\n var reUnicodeWord = RegExp([\n rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n rsUpper + '+' + rsOptContrUpper,\n rsOrdUpper,\n rsOrdLower,\n rsDigits,\n rsEmoji\n ].join('|'), 'g');\n\n /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n /** Used to detect strings that need a more robust regexp to match words. */\n var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n /** Used to assign default `context` object properties. */\n var contextProps = [\n 'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n 'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n ];\n\n /** Used to make template sourceURLs easier to identify. */\n var templateCounter = -1;\n\n /** Used to identify `toStringTag` values of typed arrays. */\n var typedArrayTags = {};\n typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n typedArrayTags[uint32Tag] = true;\n typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n typedArrayTags[setTag] = typedArrayTags[stringTag] =\n typedArrayTags[weakMapTag] = false;\n\n /** Used to identify `toStringTag` values supported by `_.clone`. */\n var cloneableTags = {};\n cloneableTags[argsTag] = cloneableTags[arrayTag] =\n cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n cloneableTags[boolTag] = cloneableTags[dateTag] =\n cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n cloneableTags[int32Tag] = cloneableTags[mapTag] =\n cloneableTags[numberTag] = cloneableTags[objectTag] =\n cloneableTags[regexpTag] = cloneableTags[setTag] =\n cloneableTags[stringTag] = cloneableTags[symbolTag] =\n cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n cloneableTags[errorTag] = cloneableTags[funcTag] =\n cloneableTags[weakMapTag] = false;\n\n /** Used to map Latin Unicode letters to basic Latin letters. */\n var deburredLetters = {\n // Latin-1 Supplement block.\n '\\xc0': 'A', '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n '\\xe0': 'a', '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n '\\xc7': 'C', '\\xe7': 'c',\n '\\xd0': 'D', '\\xf0': 'd',\n '\\xc8': 'E', '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n '\\xe8': 'e', '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n '\\xcc': 'I', '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n '\\xec': 'i', '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n '\\xd1': 'N', '\\xf1': 'n',\n '\\xd2': 'O', '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n '\\xf2': 'o', '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n '\\xd9': 'U', '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n '\\xf9': 'u', '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n '\\xdd': 'Y', '\\xfd': 'y', '\\xff': 'y',\n '\\xc6': 'Ae', '\\xe6': 'ae',\n '\\xde': 'Th', '\\xfe': 'th',\n '\\xdf': 'ss',\n // Latin Extended-A block.\n '\\u0100': 'A', '\\u0102': 'A', '\\u0104': 'A',\n '\\u0101': 'a', '\\u0103': 'a', '\\u0105': 'a',\n '\\u0106': 'C', '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n '\\u0107': 'c', '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n '\\u010e': 'D', '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n '\\u0112': 'E', '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n '\\u0113': 'e', '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n '\\u011c': 'G', '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n '\\u011d': 'g', '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n '\\u0124': 'H', '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n '\\u0128': 'I', '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n '\\u0129': 'i', '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n '\\u0134': 'J', '\\u0135': 'j',\n '\\u0136': 'K', '\\u0137': 'k', '\\u0138': 'k',\n '\\u0139': 'L', '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n '\\u013a': 'l', '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n '\\u0143': 'N', '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n '\\u0144': 'n', '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n '\\u014c': 'O', '\\u014e': 'O', '\\u0150': 'O',\n '\\u014d': 'o', '\\u014f': 'o', '\\u0151': 'o',\n '\\u0154': 'R', '\\u0156': 'R', '\\u0158': 'R',\n '\\u0155': 'r', '\\u0157': 'r', '\\u0159': 'r',\n '\\u015a': 'S', '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n '\\u015b': 's', '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n '\\u0162': 'T', '\\u0164': 'T', '\\u0166': 'T',\n '\\u0163': 't', '\\u0165': 't', '\\u0167': 't',\n '\\u0168': 'U', '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n '\\u0169': 'u', '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n '\\u0174': 'W', '\\u0175': 'w',\n '\\u0176': 'Y', '\\u0177': 'y', '\\u0178': 'Y',\n '\\u0179': 'Z', '\\u017b': 'Z', '\\u017d': 'Z',\n '\\u017a': 'z', '\\u017c': 'z', '\\u017e': 'z',\n '\\u0132': 'IJ', '\\u0133': 'ij',\n '\\u0152': 'Oe', '\\u0153': 'oe',\n '\\u0149': \"'n\", '\\u017f': 's'\n };\n\n /** Used to map characters to HTML entities. */\n var htmlEscapes = {\n '&': '&amp;',\n '<': '&lt;',\n '>': '&gt;',\n '\"': '&quot;',\n \"'\": '&#39;'\n };\n\n /** Used to map HTML entities to characters. */\n var htmlUnescapes = {\n '&amp;': '&',\n '&lt;': '<',\n '&gt;': '>',\n '&quot;': '\"',\n '&#39;': \"'\"\n };\n\n /** Used to escape characters for inclusion in compiled string literals. */\n var stringEscapes = {\n '\\\\': '\\\\',\n \"'\": \"'\",\n '\\n': 'n',\n '\\r': 'r',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n /** Built-in method references without a dependency on `root`. */\n var freeParseFloat = parseFloat,\n freeParseInt = parseInt;\n\n /** Detect free variable `global` from Node.js. */\n var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n /** Detect free variable `self`. */\n var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n /** Used as a reference to the global object. */\n var root = freeGlobal || freeSelf || Function('return this')();\n\n /** Detect free variable `exports`. */\n var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n /** Detect free variable `module`. */\n var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n /** Detect the popular CommonJS extension `module.exports`. */\n var moduleExports = freeModule && freeModule.exports === freeExports;\n\n /** Detect free variable `process` from Node.js. */\n var freeProcess = moduleExports && freeGlobal.process;\n\n /** Used to access faster Node.js helpers. */\n var nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n }());\n\n /* Node.js helper references. */\n var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n nodeIsDate = nodeUtil && nodeUtil.isDate,\n nodeIsMap = nodeUtil && nodeUtil.isMap,\n nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n nodeIsSet = nodeUtil && nodeUtil.isSet,\n nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\n function apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n }\n\n /**\n * A specialized version of `baseAggregator` for arrays.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function arrayAggregator(array, setter, iteratee, accumulator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n var value = array[index];\n setter(accumulator, value, iteratee(value), array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.forEachRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEachRight(array, iteratee) {\n var length = array == null ? 0 : array.length;\n\n while (length--) {\n if (iteratee(array[length], length, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n */\n function arrayEvery(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (!predicate(array[index], index, array)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function arrayFilter(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n }\n\n /**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludesWith(array, value, comparator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (comparator(value, array[index])) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n }\n\n /**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\n function arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n }\n\n /**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.reduceRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the last element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n var length = array == null ? 0 : array.length;\n if (initAccum && length) {\n accumulator = array[--length];\n }\n while (length--) {\n accumulator = iteratee(accumulator, array[length], length, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function arraySome(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (predicate(array[index], index, array)) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n var asciiSize = baseProperty('length');\n\n /**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function asciiToArray(string) {\n return string.split('');\n }\n\n /**\n * Splits an ASCII `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function asciiWords(string) {\n return string.match(reAsciiWord) || [];\n }\n\n /**\n * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n * without support for iteratee shorthands, which iterates over `collection`\n * using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the found element or its key, else `undefined`.\n */\n function baseFindKey(collection, predicate, eachFunc) {\n var result;\n eachFunc(collection, function(value, key, collection) {\n if (predicate(value, key, collection)) {\n result = key;\n return false;\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n }\n\n /**\n * This function is like `baseIndexOf` except that it accepts a comparator.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOfWith(array, value, fromIndex, comparator) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (comparator(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\n function baseIsNaN(value) {\n return value !== value;\n }\n\n /**\n * The base implementation of `_.mean` and `_.meanBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the mean.\n */\n function baseMean(array, iteratee) {\n var length = array == null ? 0 : array.length;\n return length ? (baseSum(array, iteratee) / length) : NAN;\n }\n\n /**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyOf(object) {\n return function(key) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n * `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\n function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n eachFunc(collection, function(value, index, collection) {\n accumulator = initAccum\n ? (initAccum = false, value)\n : iteratee(accumulator, value, index, collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\n function baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.sum` and `_.sumBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the sum.\n */\n function baseSum(array, iteratee) {\n var result,\n index = -1,\n length = array.length;\n\n while (++index < length) {\n var current = iteratee(array[index]);\n if (current !== undefined) {\n result = result === undefined ? current : (result + current);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\n function baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n * of key-value pairs for `object` corresponding to the property names of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the key-value pairs.\n */\n function baseToPairs(object, props) {\n return arrayMap(props, function(key) {\n return [key, object[key]];\n });\n }\n\n /**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\n function baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n }\n\n /**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\n function baseUnary(func) {\n return function(value) {\n return func(value);\n };\n }\n\n /**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\n function baseValues(object, props) {\n return arrayMap(props, function(key) {\n return object[key];\n });\n }\n\n /**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function cacheHas(cache, key) {\n return cache.has(key);\n }\n\n /**\n * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n */\n function charsStartIndex(strSymbols, chrSymbols) {\n var index = -1,\n length = strSymbols.length;\n\n while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n */\n function charsEndIndex(strSymbols, chrSymbols) {\n var index = strSymbols.length;\n\n while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Gets the number of `placeholder` occurrences in `array`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} placeholder The placeholder to search for.\n * @returns {number} Returns the placeholder count.\n */\n function countHolders(array, placeholder) {\n var length = array.length,\n result = 0;\n\n while (length--) {\n if (array[length] === placeholder) {\n ++result;\n }\n }\n return result;\n }\n\n /**\n * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\n var deburrLetter = basePropertyOf(deburredLetters);\n\n /**\n * Used by `_.escape` to convert characters to HTML entities.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n /**\n * Used by `_.template` to escape characters for inclusion in compiled string literals.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n function escapeStringChar(chr) {\n return '\\\\' + stringEscapes[chr];\n }\n\n /**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function getValue(object, key) {\n return object == null ? undefined : object[key];\n }\n\n /**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\n function hasUnicode(string) {\n return reHasUnicode.test(string);\n }\n\n /**\n * Checks if `string` contains a word composed of Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a word is found, else `false`.\n */\n function hasUnicodeWord(string) {\n return reHasUnicodeWord.test(string);\n }\n\n /**\n * Converts `iterator` to an array.\n *\n * @private\n * @param {Object} iterator The iterator to convert.\n * @returns {Array} Returns the converted array.\n */\n function iteratorToArray(iterator) {\n var data,\n result = [];\n\n while (!(data = iterator.next()).done) {\n result.push(data.value);\n }\n return result;\n }\n\n /**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\n function mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n }\n\n /**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\n function overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n }\n\n /**\n * Replaces all `placeholder` elements in `array` with an internal placeholder\n * and returns an array of their indexes.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {*} placeholder The placeholder to replace.\n * @returns {Array} Returns the new array of placeholder indexes.\n */\n function replaceHolders(array, placeholder) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value === placeholder || value === PLACEHOLDER) {\n array[index] = PLACEHOLDER;\n result[resIndex++] = index;\n }\n }\n return result;\n }\n\n /**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\n function setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n }\n\n /**\n * Converts `set` to its value-value pairs.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the value-value pairs.\n */\n function setToPairs(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = [value, value];\n });\n return result;\n }\n\n /**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * A specialized version of `_.lastIndexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictLastIndexOf(array, value, fromIndex) {\n var index = fromIndex + 1;\n while (index--) {\n if (array[index] === value) {\n return index;\n }\n }\n return index;\n }\n\n /**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\n function stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n }\n\n /**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function stringToArray(string) {\n return hasUnicode(string)\n ? unicodeToArray(string)\n : asciiToArray(string);\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\n function trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n }\n\n /**\n * Used by `_.unescape` to convert HTML entities to characters.\n *\n * @private\n * @param {string} chr The matched character to unescape.\n * @returns {string} Returns the unescaped character.\n */\n var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n /**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n function unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n }\n\n /**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function unicodeToArray(string) {\n return string.match(reUnicode) || [];\n }\n\n /**\n * Splits a Unicode `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function unicodeWords(string) {\n return string.match(reUnicodeWord) || [];\n }\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * Create a new pristine `lodash` function using the `context` object.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Util\n * @param {Object} [context=root] The context object.\n * @returns {Function} Returns a new `lodash` function.\n * @example\n *\n * _.mixin({ 'foo': _.constant('foo') });\n *\n * var lodash = _.runInContext();\n * lodash.mixin({ 'bar': lodash.constant('bar') });\n *\n * _.isFunction(_.foo);\n * // => true\n * _.isFunction(_.bar);\n * // => false\n *\n * lodash.isFunction(lodash.foo);\n * // => false\n * lodash.isFunction(lodash.bar);\n * // => true\n *\n * // Create a suped-up `defer` in Node.js.\n * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n */\n var runInContext = (function runInContext(context) {\n context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n /** Built-in constructor references. */\n var Array = context.Array,\n Date = context.Date,\n Error = context.Error,\n Function = context.Function,\n Math = context.Math,\n Object = context.Object,\n RegExp = context.RegExp,\n String = context.String,\n TypeError = context.TypeError;\n\n /** Used for built-in method references. */\n var arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n /** Used to detect overreaching core-js shims. */\n var coreJsData = context['__core-js_shared__'];\n\n /** Used to resolve the decompiled source of functions. */\n var funcToString = funcProto.toString;\n\n /** Used to check objects for own properties. */\n var hasOwnProperty = objectProto.hasOwnProperty;\n\n /** Used to generate unique IDs. */\n var idCounter = 0;\n\n /** Used to detect methods masquerading as native. */\n var maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n }());\n\n /**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\n var nativeObjectToString = objectProto.toString;\n\n /** Used to infer the `Object` constructor. */\n var objectCtorString = funcToString.call(Object);\n\n /** Used to restore the original `_` reference in `_.noConflict`. */\n var oldDash = root._;\n\n /** Used to detect if a method is native. */\n var reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n );\n\n /** Built-in value references. */\n var Buffer = moduleExports ? context.Buffer : undefined,\n Symbol = context.Symbol,\n Uint8Array = context.Uint8Array,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice,\n spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n symIterator = Symbol ? Symbol.iterator : undefined,\n symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n var defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n }());\n\n /** Mocked built-ins. */\n var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n ctxNow = Date && Date.now !== root.Date.now && Date.now,\n ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n /* Built-in method references for those with the same name as other `lodash` methods. */\n var nativeCeil = Math.ceil,\n nativeFloor = Math.floor,\n nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeIsFinite = context.isFinite,\n nativeJoin = arrayProto.join,\n nativeKeys = overArg(Object.keys, Object),\n nativeMax = Math.max,\n nativeMin = Math.min,\n nativeNow = Date.now,\n nativeParseInt = context.parseInt,\n nativeRandom = Math.random,\n nativeReverse = arrayProto.reverse;\n\n /* Built-in method references that are verified to be native. */\n var DataView = getNative(context, 'DataView'),\n Map = getNative(context, 'Map'),\n Promise = getNative(context, 'Promise'),\n Set = getNative(context, 'Set'),\n WeakMap = getNative(context, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n /** Used to store function metadata. */\n var metaMap = WeakMap && new WeakMap;\n\n /** Used to lookup unminified function names. */\n var realNames = {};\n\n /** Used to detect maps, sets, and weakmaps. */\n var dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n /** Used to convert symbols to primitives and strings. */\n var symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` object which wraps `value` to enable implicit method\n * chain sequences. Methods that operate on and return arrays, collections,\n * and functions can be chained together. Methods that retrieve a single value\n * or may return a primitive value will automatically end the chain sequence\n * and return the unwrapped value. Otherwise, the value must be unwrapped\n * with `_#value`.\n *\n * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n * enabled using `_.chain`.\n *\n * The execution of chained methods is lazy, that is, it's deferred until\n * `_#value` is implicitly or explicitly called.\n *\n * Lazy evaluation allows several methods to support shortcut fusion.\n * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n * the creation of intermediate arrays and can greatly reduce the number of\n * iteratee executions. Sections of a chain sequence qualify for shortcut\n * fusion if the section is applied to an array and iteratees accept only\n * one argument. The heuristic for whether a section qualifies for shortcut\n * fusion is subject to change.\n *\n * Chaining is supported in custom builds as long as the `_#value` method is\n * directly or indirectly included in the build.\n *\n * In addition to lodash methods, wrappers have `Array` and `String` methods.\n *\n * The wrapper `Array` methods are:\n * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n *\n * The wrapper `String` methods are:\n * `replace` and `split`\n *\n * The wrapper methods that support shortcut fusion are:\n * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n *\n * The chainable wrapper methods are:\n * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n * `zipObject`, `zipObjectDeep`, and `zipWith`\n *\n * The wrapper methods that are **not** chainable by default are:\n * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n * `upperFirst`, `value`, and `words`\n *\n * @name _\n * @constructor\n * @category Seq\n * @param {*} value The value to wrap in a `lodash` instance.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2, 3]);\n *\n * // Returns an unwrapped value.\n * wrapped.reduce(_.add);\n * // => 6\n *\n * // Returns a wrapped value.\n * var squares = wrapped.map(square);\n *\n * _.isArray(squares);\n * // => false\n *\n * _.isArray(squares.value());\n * // => true\n */\n function lodash(value) {\n if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n if (value instanceof LodashWrapper) {\n return value;\n }\n if (hasOwnProperty.call(value, '__wrapped__')) {\n return wrapperClone(value);\n }\n }\n return new LodashWrapper(value);\n }\n\n /**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\n var baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n }());\n\n /**\n * The function whose prototype chain sequence wrappers inherit from.\n *\n * @private\n */\n function baseLodash() {\n // No operation performed.\n }\n\n /**\n * The base constructor for creating `lodash` wrapper objects.\n *\n * @private\n * @param {*} value The value to wrap.\n * @param {boolean} [chainAll] Enable explicit method chain sequences.\n */\n function LodashWrapper(value, chainAll) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__chain__ = !!chainAll;\n this.__index__ = 0;\n this.__values__ = undefined;\n }\n\n /**\n * By default, the template delimiters used by lodash are like those in\n * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n * following template settings to use alternative delimiters.\n *\n * @static\n * @memberOf _\n * @type {Object}\n */\n lodash.templateSettings = {\n\n /**\n * Used to detect `data` property values to be HTML-escaped.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'escape': reEscape,\n\n /**\n * Used to detect code to be evaluated.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'evaluate': reEvaluate,\n\n /**\n * Used to detect `data` property values to inject.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'interpolate': reInterpolate,\n\n /**\n * Used to reference the data object in the template text.\n *\n * @memberOf _.templateSettings\n * @type {string}\n */\n 'variable': '',\n\n /**\n * Used to import variables into the compiled template.\n *\n * @memberOf _.templateSettings\n * @type {Object}\n */\n 'imports': {\n\n /**\n * A reference to the `lodash` function.\n *\n * @memberOf _.templateSettings.imports\n * @type {Function}\n */\n '_': lodash\n }\n };\n\n // Ensure wrappers are instances of `baseLodash`.\n lodash.prototype = baseLodash.prototype;\n lodash.prototype.constructor = lodash;\n\n LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n LodashWrapper.prototype.constructor = LodashWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n *\n * @private\n * @constructor\n * @param {*} value The value to wrap.\n */\n function LazyWrapper(value) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__dir__ = 1;\n this.__filtered__ = false;\n this.__iteratees__ = [];\n this.__takeCount__ = MAX_ARRAY_LENGTH;\n this.__views__ = [];\n }\n\n /**\n * Creates a clone of the lazy wrapper object.\n *\n * @private\n * @name clone\n * @memberOf LazyWrapper\n * @returns {Object} Returns the cloned `LazyWrapper` object.\n */\n function lazyClone() {\n var result = new LazyWrapper(this.__wrapped__);\n result.__actions__ = copyArray(this.__actions__);\n result.__dir__ = this.__dir__;\n result.__filtered__ = this.__filtered__;\n result.__iteratees__ = copyArray(this.__iteratees__);\n result.__takeCount__ = this.__takeCount__;\n result.__views__ = copyArray(this.__views__);\n return result;\n }\n\n /**\n * Reverses the direction of lazy iteration.\n *\n * @private\n * @name reverse\n * @memberOf LazyWrapper\n * @returns {Object} Returns the new reversed `LazyWrapper` object.\n */\n function lazyReverse() {\n if (this.__filtered__) {\n var result = new LazyWrapper(this);\n result.__dir__ = -1;\n result.__filtered__ = true;\n } else {\n result = this.clone();\n result.__dir__ *= -1;\n }\n return result;\n }\n\n /**\n * Extracts the unwrapped value from its lazy wrapper.\n *\n * @private\n * @name value\n * @memberOf LazyWrapper\n * @returns {*} Returns the unwrapped value.\n */\n function lazyValue() {\n var array = this.__wrapped__.value(),\n dir = this.__dir__,\n isArr = isArray(array),\n isRight = dir < 0,\n arrLength = isArr ? array.length : 0,\n view = getView(0, arrLength, this.__views__),\n start = view.start,\n end = view.end,\n length = end - start,\n index = isRight ? end : (start - 1),\n iteratees = this.__iteratees__,\n iterLength = iteratees.length,\n resIndex = 0,\n takeCount = nativeMin(length, this.__takeCount__);\n\n if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n return baseWrapperValue(array, this.__actions__);\n }\n var result = [];\n\n outer:\n while (length-- && resIndex < takeCount) {\n index += dir;\n\n var iterIndex = -1,\n value = array[index];\n\n while (++iterIndex < iterLength) {\n var data = iteratees[iterIndex],\n iteratee = data.iteratee,\n type = data.type,\n computed = iteratee(value);\n\n if (type == LAZY_MAP_FLAG) {\n value = computed;\n } else if (!computed) {\n if (type == LAZY_FILTER_FLAG) {\n continue outer;\n } else {\n break outer;\n }\n }\n }\n result[resIndex++] = value;\n }\n return result;\n }\n\n // Ensure `LazyWrapper` is an instance of `baseLodash`.\n LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n LazyWrapper.prototype.constructor = LazyWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\n function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n }\n\n /**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n }\n\n /**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\n function hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n }\n\n // Add methods to `Hash`.\n Hash.prototype.clear = hashClear;\n Hash.prototype['delete'] = hashDelete;\n Hash.prototype.get = hashGet;\n Hash.prototype.has = hashHas;\n Hash.prototype.set = hashSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\n function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n }\n\n /**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n }\n\n /**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n }\n\n /**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\n function listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n }\n\n // Add methods to `ListCache`.\n ListCache.prototype.clear = listCacheClear;\n ListCache.prototype['delete'] = listCacheDelete;\n ListCache.prototype.get = listCacheGet;\n ListCache.prototype.has = listCacheHas;\n ListCache.prototype.set = listCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\n function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n }\n\n /**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function mapCacheGet(key) {\n return getMapData(this, key).get(key);\n }\n\n /**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function mapCacheHas(key) {\n return getMapData(this, key).has(key);\n }\n\n /**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\n function mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n }\n\n // Add methods to `MapCache`.\n MapCache.prototype.clear = mapCacheClear;\n MapCache.prototype['delete'] = mapCacheDelete;\n MapCache.prototype.get = mapCacheGet;\n MapCache.prototype.has = mapCacheHas;\n MapCache.prototype.set = mapCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\n function SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n }\n\n /**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\n function setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n }\n\n /**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\n function setCacheHas(value) {\n return this.__data__.has(value);\n }\n\n // Add methods to `SetCache`.\n SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n SetCache.prototype.has = setCacheHas;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n }\n\n /**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\n function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n }\n\n /**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function stackGet(key) {\n return this.__data__.get(key);\n }\n\n /**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function stackHas(key) {\n return this.__data__.has(key);\n }\n\n /**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\n function stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n }\n\n // Add methods to `Stack`.\n Stack.prototype.clear = stackClear;\n Stack.prototype['delete'] = stackDelete;\n Stack.prototype.get = stackGet;\n Stack.prototype.has = stackHas;\n Stack.prototype.set = stackSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\n function arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr || isArg || isBuff || isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited || hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' ||\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' || key == 'parent')) ||\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.sample` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @returns {*} Returns the random element.\n */\n function arraySample(array) {\n var length = array.length;\n return length ? array[baseRandom(0, length - 1)] : undefined;\n }\n\n /**\n * A specialized version of `_.sampleSize` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function arraySampleSize(array, n) {\n return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n }\n\n /**\n * A specialized version of `_.shuffle` for arrays.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function arrayShuffle(array) {\n return shuffleSelf(copyArray(array));\n }\n\n /**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n }\n\n /**\n * Aggregates elements of `collection` on `accumulator` with keys transformed\n * by `iteratee` and values set by `setter`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseAggregator(collection, setter, iteratee, accumulator) {\n baseEach(collection, function(value, key, collection) {\n setter(accumulator, value, iteratee(value), collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n }\n\n /**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n }\n\n /**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n }\n\n /**\n * The base implementation of `_.at` without support for individual paths.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {string[]} paths The property paths to pick.\n * @returns {Array} Returns the picked elements.\n */\n function baseAt(object, paths) {\n var index = -1,\n length = paths.length,\n result = Array(length),\n skip = object == null;\n\n while (++index < length) {\n result[index] = skip ? undefined : get(object, paths[index]);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.clamp` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n */\n function baseClamp(number, lower, upper) {\n if (number === number) {\n if (upper !== undefined) {\n number = number <= upper ? number : upper;\n }\n if (lower !== undefined) {\n number = number >= lower ? number : lower;\n }\n }\n return number;\n }\n\n /**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Deep clone\n * 2 - Flatten inherited properties\n * 4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\n function baseClone(value, bitmask, customizer, key, object, stack) {\n var result,\n isDeep = bitmask & CLONE_DEEP_FLAG,\n isFlat = bitmask & CLONE_FLAT_FLAG,\n isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag || tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n result = (isFlat || isFunc) ? {} : initCloneObject(value);\n if (!isDeep) {\n return isFlat\n ? copySymbolsIn(value, baseAssignIn(result, value))\n : copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack || (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (isSet(value)) {\n value.forEach(function(subValue) {\n result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n });\n } else if (isMap(value)) {\n value.forEach(function(subValue, key) {\n result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n }\n\n var keysFunc = isFull\n ? (isFlat ? getAllKeysIn : getAllKeys)\n : (isFlat ? keysIn : keys);\n\n var props = isArr ? undefined : keysFunc(value);\n arrayEach(props || value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n return result;\n }\n\n /**\n * The base implementation of `_.conforms` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n */\n function baseConforms(source) {\n var props = keys(source);\n return function(object) {\n return baseConformsTo(object, source, props);\n };\n }\n\n /**\n * The base implementation of `_.conformsTo` which accepts `props` to check.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n */\n function baseConformsTo(object, source, props) {\n var length = props.length;\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (length--) {\n var key = props[length],\n predicate = source[key],\n value = object[key];\n\n if ((value === undefined && !(key in object)) || !predicate(value)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.delay` and `_.defer` which accepts `args`\n * to provide to `func`.\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {Array} args The arguments to provide to `func`.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n function baseDelay(func, wait, args) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return setTimeout(function() { func.apply(undefined, args); }, wait);\n }\n\n /**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\n function baseDifference(array, values, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n isCommon = true,\n length = array.length,\n result = [],\n valuesLength = values.length;\n\n if (!length) {\n return result;\n }\n if (iteratee) {\n values = arrayMap(values, baseUnary(iteratee));\n }\n if (comparator) {\n includes = arrayIncludesWith;\n isCommon = false;\n }\n else if (values.length >= LARGE_ARRAY_SIZE) {\n includes = cacheHas;\n isCommon = false;\n values = new SetCache(values);\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee == null ? value : iteratee(value);\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var valuesIndex = valuesLength;\n while (valuesIndex--) {\n if (values[valuesIndex] === computed) {\n continue outer;\n }\n }\n result.push(value);\n }\n else if (!includes(values, computed, comparator)) {\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEach = createBaseEach(baseForOwn);\n\n /**\n * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n /**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`\n */\n function baseEvery(collection, predicate) {\n var result = true;\n baseEach(collection, function(value, index, collection) {\n result = !!predicate(value, index, collection);\n return result;\n });\n return result;\n }\n\n /**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\n function baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.fill` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n */\n function baseFill(array, value, start, end) {\n var length = array.length;\n\n start = toInteger(start);\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = (end === undefined || end > length) ? length : toInteger(end);\n if (end < 0) {\n end += length;\n }\n end = start > end ? 0 : toLength(end);\n while (start < end) {\n array[start++] = value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function baseFilter(collection, predicate) {\n var result = [];\n baseEach(collection, function(value, index, collection) {\n if (predicate(value, index, collection)) {\n result.push(value);\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\n function baseFlatten(array, depth, predicate, isStrict, result) {\n var index = -1,\n length = array.length;\n\n predicate || (predicate = isFlattenable);\n result || (result = []);\n\n while (++index < length) {\n var value = array[index];\n if (depth > 0 && predicate(value)) {\n if (depth > 1) {\n // Recursively flatten arrays (susceptible to call stack limits).\n baseFlatten(value, depth - 1, predicate, isStrict, result);\n } else {\n arrayPush(result, value);\n }\n } else if (!isStrict) {\n result[result.length] = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseFor = createBaseFor();\n\n /**\n * This function is like `baseFor` except that it iterates over properties\n * in the opposite order.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseForRight = createBaseFor(true);\n\n /**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwnRight(object, iteratee) {\n return object && baseForRight(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.functions` which creates an array of\n * `object` function property names filtered from `props`.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Array} props The property names to filter.\n * @returns {Array} Returns the function names.\n */\n function baseFunctions(object, props) {\n return arrayFilter(props, function(key) {\n return isFunction(object[key]);\n });\n }\n\n /**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\n function baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n }\n\n /**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n }\n\n /**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n function baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n }\n\n /**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n */\n function baseGt(value, other) {\n return value > other;\n }\n\n /**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n }\n\n /**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHasIn(object, key) {\n return object != null && key in Object(object);\n }\n\n /**\n * The base implementation of `_.inRange` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to check.\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\n function baseInRange(number, start, end) {\n return number >= nativeMin(start, end) && number < nativeMax(start, end);\n }\n\n /**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\n function baseIntersection(arrays, iteratee, comparator) {\n var includes = comparator ? arrayIncludesWith : arrayIncludes,\n length = arrays[0].length,\n othLength = arrays.length,\n othIndex = othLength,\n caches = Array(othLength),\n maxLength = Infinity,\n result = [];\n\n while (othIndex--) {\n var array = arrays[othIndex];\n if (othIndex && iteratee) {\n array = arrayMap(array, baseUnary(iteratee));\n }\n maxLength = nativeMin(array.length, maxLength);\n caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n ? new SetCache(othIndex && array)\n : undefined;\n }\n array = arrays[0];\n\n var index = -1,\n seen = caches[0];\n\n outer:\n while (++index < length && result.length < maxLength) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (!(seen\n ? cacheHas(seen, computed)\n : includes(result, computed, comparator)\n )) {\n othIndex = othLength;\n while (--othIndex) {\n var cache = caches[othIndex];\n if (!(cache\n ? cacheHas(cache, computed)\n : includes(arrays[othIndex], computed, comparator))\n ) {\n continue outer;\n }\n }\n if (seen) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.invert` and `_.invertBy` which inverts\n * `object` with values transformed by `iteratee` and set by `setter`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform values.\n * @param {Object} accumulator The initial inverted object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseInverter(object, setter, iteratee, accumulator) {\n baseForOwn(object, function(value, key, object) {\n setter(accumulator, iteratee(value), key, object);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.invoke` without support for individual\n * method arguments.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {Array} args The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n */\n function baseInvoke(object, path, args) {\n path = castPath(path, object);\n object = parent(object, path);\n var func = object == null ? object : object[toKey(last(path))];\n return func == null ? undefined : apply(func, object, args);\n }\n\n /**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\n function baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n }\n\n /**\n * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n */\n function baseIsArrayBuffer(value) {\n return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n }\n\n /**\n * The base implementation of `_.isDate` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n */\n function baseIsDate(value) {\n return isObjectLike(value) && baseGetTag(value) == dateTag;\n }\n\n /**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Unordered comparison\n * 2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\n function baseIsEqual(value, other, bitmask, customizer, stack) {\n if (value === other) {\n return true;\n }\n if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n return value !== value && other !== other;\n }\n return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n }\n\n /**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n var objIsArr = isArray(object),\n othIsArr = isArray(other),\n objTag = objIsArr ? arrayTag : getTag(object),\n othTag = othIsArr ? arrayTag : getTag(other);\n\n objTag = objTag == argsTag ? objectTag : objTag;\n othTag = othTag == argsTag ? objectTag : othTag;\n\n var objIsObj = objTag == objectTag,\n othIsObj = othTag == objectTag,\n isSameTag = objTag == othTag;\n\n if (isSameTag && isBuffer(object)) {\n if (!isBuffer(other)) {\n return false;\n }\n objIsArr = true;\n objIsObj = false;\n }\n if (isSameTag && !objIsObj) {\n stack || (stack = new Stack);\n return (objIsArr || isTypedArray(object))\n ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n }\n if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n if (objIsWrapped || othIsWrapped) {\n var objUnwrapped = objIsWrapped ? object.value() : object,\n othUnwrapped = othIsWrapped ? other.value() : other;\n\n stack || (stack = new Stack);\n return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n }\n }\n if (!isSameTag) {\n return false;\n }\n stack || (stack = new Stack);\n return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n }\n\n /**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\n function baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n }\n\n /**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\n function baseIsMatch(object, source, matchData, customizer) {\n var index = matchData.length,\n length = index,\n noCustomizer = !customizer;\n\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (index--) {\n var data = matchData[index];\n if ((noCustomizer && data[2])\n ? data[1] !== object[data[0]]\n : !(data[0] in object)\n ) {\n return false;\n }\n }\n while (++index < length) {\n data = matchData[index];\n var key = data[0],\n objValue = object[key],\n srcValue = data[1];\n\n if (noCustomizer && data[2]) {\n if (objValue === undefined && !(key in object)) {\n return false;\n }\n } else {\n var stack = new Stack;\n if (customizer) {\n var result = customizer(objValue, srcValue, key, object, source, stack);\n }\n if (!(result === undefined\n ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n : result\n )) {\n return false;\n }\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\n function baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n }\n\n /**\n * The base implementation of `_.isRegExp` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n */\n function baseIsRegExp(value) {\n return isObjectLike(value) && baseGetTag(value) == regexpTag;\n }\n\n /**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\n function baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n }\n\n /**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\n function baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n }\n\n /**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\n function baseIteratee(value) {\n // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n if (typeof value == 'function') {\n return value;\n }\n if (value == null) {\n return identity;\n }\n if (typeof value == 'object') {\n return isArray(value)\n ? baseMatchesProperty(value[0], value[1])\n : baseMatches(value);\n }\n return property(value);\n }\n\n /**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n */\n function baseLt(value, other) {\n return value < other;\n }\n\n /**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n }\n\n /**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatches(source) {\n var matchData = getMatchData(source);\n if (matchData.length == 1 && matchData[0][2]) {\n return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n }\n return function(object) {\n return object === source || baseIsMatch(object, source, matchData);\n };\n }\n\n /**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatchesProperty(path, srcValue) {\n if (isKey(path) && isStrictComparable(srcValue)) {\n return matchesStrictComparable(toKey(path), srcValue);\n }\n return function(object) {\n var objValue = get(object, path);\n return (objValue === undefined && objValue === srcValue)\n ? hasIn(object, path)\n : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n };\n }\n\n /**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack || (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n }\n\n /**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr || isBuff || isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) || isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n }\n\n /**\n * The base implementation of `_.nth` which doesn't coerce arguments.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {number} n The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n */\n function baseNth(array, n) {\n var length = array.length;\n if (!length) {\n return;\n }\n n += n < 0 ? length : 0;\n return isIndex(n, length) ? array[n] : undefined;\n }\n\n /**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\n function baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n }\n\n /**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\n function basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n }\n\n /**\n * The base implementation of `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\n function basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n }\n\n /**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\n function basePullAll(array, values, iteratee, comparator) {\n var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n index = -1,\n length = values.length,\n seen = array;\n\n if (array === values) {\n values = copyArray(values);\n }\n if (iteratee) {\n seen = arrayMap(array, baseUnary(iteratee));\n }\n while (++index < length) {\n var fromIndex = 0,\n value = values[index],\n computed = iteratee ? iteratee(value) : value;\n\n while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n if (seen !== array) {\n splice.call(seen, fromIndex, 1);\n }\n splice.call(array, fromIndex, 1);\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.pullAt` without support for individual\n * indexes or capturing the removed elements.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {number[]} indexes The indexes of elements to remove.\n * @returns {Array} Returns `array`.\n */\n function basePullAt(array, indexes) {\n var length = array ? indexes.length : 0,\n lastIndex = length - 1;\n\n while (length--) {\n var index = indexes[length];\n if (length == lastIndex || index !== previous) {\n var previous = index;\n if (isIndex(index)) {\n splice.call(array, index, 1);\n } else {\n baseUnset(array, index);\n }\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.random` without support for returning\n * floating-point numbers.\n *\n * @private\n * @param {number} lower The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the random number.\n */\n function baseRandom(lower, upper) {\n return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n }\n\n /**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\n function baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n }\n\n /**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\n function baseRepeat(string, n) {\n var result = '';\n if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n return result;\n }\n // Leverage the exponentiation by squaring algorithm for a faster repeat.\n // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n do {\n if (n % 2) {\n result += string;\n }\n n = nativeFloor(n / 2);\n if (n) {\n string += string;\n }\n } while (n);\n\n return result;\n }\n\n /**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\n function baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n }\n\n /**\n * The base implementation of `_.sample`.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n */\n function baseSample(collection) {\n return arraySample(values(collection));\n }\n\n /**\n * The base implementation of `_.sampleSize` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function baseSampleSize(collection, n) {\n var array = values(collection);\n return shuffleSelf(array, baseClamp(n, 0, array.length));\n }\n\n /**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n }\n\n /**\n * The base implementation of `setData` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var baseSetData = !metaMap ? identity : function(func, data) {\n metaMap.set(func, data);\n return func;\n };\n\n /**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n };\n\n /**\n * The base implementation of `_.shuffle`.\n *\n * @private\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function baseShuffle(collection) {\n return shuffleSelf(values(collection));\n }\n\n /**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseSlice(array, start, end) {\n var index = -1,\n length = array.length;\n\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = end > length ? length : end;\n if (end < 0) {\n end += length;\n }\n length = start > end ? 0 : ((end - start) >>> 0);\n start >>>= 0;\n\n var result = Array(length);\n while (++index < length) {\n result[index] = array[index + start];\n }\n return result;\n }\n\n /**\n * The base implementation of `_.some` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function baseSome(collection, predicate) {\n var result;\n\n baseEach(collection, function(value, index, collection) {\n result = predicate(value, index, collection);\n return !result;\n });\n return !!result;\n }\n\n /**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndex(array, value, retHighest) {\n var low = 0,\n high = array == null ? low : array.length;\n\n if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n while (low < high) {\n var mid = (low + high) >>> 1,\n computed = array[mid];\n\n if (computed !== null && !isSymbol(computed) &&\n (retHighest ? (computed <= value) : (computed < value))) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return high;\n }\n return baseSortedIndexBy(array, value, identity, retHighest);\n }\n\n /**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndexBy(array, value, iteratee, retHighest) {\n var low = 0,\n high = array == null ? 0 : array.length;\n if (high === 0) {\n return 0;\n }\n\n value = iteratee(value);\n var valIsNaN = value !== value,\n valIsNull = value === null,\n valIsSymbol = isSymbol(value),\n valIsUndefined = value === undefined;\n\n while (low < high) {\n var mid = nativeFloor((low + high) / 2),\n computed = iteratee(array[mid]),\n othIsDefined = computed !== undefined,\n othIsNull = computed === null,\n othIsReflexive = computed === computed,\n othIsSymbol = isSymbol(computed);\n\n if (valIsNaN) {\n var setLow = retHighest || othIsReflexive;\n } else if (valIsUndefined) {\n setLow = othIsReflexive && (retHighest || othIsDefined);\n } else if (valIsNull) {\n setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n } else if (valIsSymbol) {\n setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n } else if (othIsNull || othIsSymbol) {\n setLow = false;\n } else {\n setLow = retHighest ? (computed <= value) : (computed < value);\n }\n if (setLow) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return nativeMin(high, MAX_ARRAY_INDEX);\n }\n\n /**\n * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseSortedUniq(array, iteratee) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n if (!index || !eq(computed, seen)) {\n var seen = computed;\n result[resIndex++] = value === 0 ? 0 : value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toNumber` which doesn't ensure correct\n * conversions of binary, hexadecimal, or octal string values.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n */\n function baseToNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n return +value;\n }\n\n /**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\n function baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseUniq(array, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n length = array.length,\n isCommon = true,\n result = [],\n seen = result;\n\n if (comparator) {\n isCommon = false;\n includes = arrayIncludesWith;\n }\n else if (length >= LARGE_ARRAY_SIZE) {\n var set = iteratee ? null : createSet(array);\n if (set) {\n return setToArray(set);\n }\n isCommon = false;\n includes = cacheHas;\n seen = new SetCache;\n }\n else {\n seen = iteratee ? [] : result;\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var seenIndex = seen.length;\n while (seenIndex--) {\n if (seen[seenIndex] === computed) {\n continue outer;\n }\n }\n if (iteratee) {\n seen.push(computed);\n }\n result.push(value);\n }\n else if (!includes(seen, computed, comparator)) {\n if (seen !== result) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\n function baseUnset(object, path) {\n path = castPath(path, object);\n object = parent(object, path);\n return object == null || delete object[toKey(last(path))];\n }\n\n /**\n * The base implementation of `_.update`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to update.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseUpdate(object, path, updater, customizer) {\n return baseSet(object, path, updater(baseGet(object, path)), customizer);\n }\n\n /**\n * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n * without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {Function} predicate The function invoked per iteration.\n * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseWhile(array, predicate, isDrop, fromRight) {\n var length = array.length,\n index = fromRight ? length : -1;\n\n while ((fromRight ? index-- : ++index < length) &&\n predicate(array[index], index, array)) {}\n\n return isDrop\n ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n }\n\n /**\n * The base implementation of `wrapperValue` which returns the result of\n * performing a sequence of actions on the unwrapped `value`, where each\n * successive action is supplied the return value of the previous.\n *\n * @private\n * @param {*} value The unwrapped value.\n * @param {Array} actions Actions to perform to resolve the unwrapped value.\n * @returns {*} Returns the resolved value.\n */\n function baseWrapperValue(value, actions) {\n var result = value;\n if (result instanceof LazyWrapper) {\n result = result.value();\n }\n return arrayReduce(actions, function(result, action) {\n return action.func.apply(action.thisArg, arrayPush([result], action.args));\n }, result);\n }\n\n /**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of values.\n */\n function baseXor(arrays, iteratee, comparator) {\n var length = arrays.length;\n if (length < 2) {\n return length ? baseUniq(arrays[0]) : [];\n }\n var index = -1,\n result = Array(length);\n\n while (++index < length) {\n var array = arrays[index],\n othIndex = -1;\n\n while (++othIndex < length) {\n if (othIndex != index) {\n result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n }\n }\n }\n return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n }\n\n /**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\n function baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n }\n\n /**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\n function castArrayLikeObject(value) {\n return isArrayLikeObject(value) ? value : [];\n }\n\n /**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\n function castFunction(value) {\n return typeof value == 'function' ? value : identity;\n }\n\n /**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\n function castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n }\n\n /**\n * A `baseRest` alias which can be replaced with `identity` by module\n * replacement plugins.\n *\n * @private\n * @type {Function}\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n var castRest = baseRest;\n\n /**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\n function castSlice(array, start, end) {\n var length = array.length;\n end = end === undefined ? length : end;\n return (!start && end >= length) ? array : baseSlice(array, start, end);\n }\n\n /**\n * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n *\n * @private\n * @param {number|Object} id The timer id or timeout object of the timer to clear.\n */\n var clearTimeout = ctxClearTimeout || function(id) {\n return root.clearTimeout(id);\n };\n\n /**\n * Creates a clone of `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\n function cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n }\n\n /**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\n function cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n }\n\n /**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\n function cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n }\n\n /**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\n function cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n }\n\n /**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\n function cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n }\n\n /**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\n function cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n }\n\n /**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\n function compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n (valIsNull && othIsDefined && othIsReflexive) ||\n (!valIsDefined && othIsReflexive) ||\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n (othIsNull && valIsDefined && valIsReflexive) ||\n (!othIsDefined && valIsReflexive) ||\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n }\n\n /**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\n function compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result * (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n }\n\n /**\n * Creates an array that is the composition of partially applied arguments,\n * placeholders, and provided arguments into a single array of arguments.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to prepend to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgs(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersLength = holders.length,\n leftIndex = -1,\n leftLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(leftLength + rangeLength),\n isUncurried = !isCurried;\n\n while (++leftIndex < leftLength) {\n result[leftIndex] = partials[leftIndex];\n }\n while (++argsIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[holders[argsIndex]] = args[argsIndex];\n }\n }\n while (rangeLength--) {\n result[leftIndex++] = args[argsIndex++];\n }\n return result;\n }\n\n /**\n * This function is like `composeArgs` except that the arguments composition\n * is tailored for `_.partialRight`.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to append to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgsRight(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersIndex = -1,\n holdersLength = holders.length,\n rightIndex = -1,\n rightLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(rangeLength + rightLength),\n isUncurried = !isCurried;\n\n while (++argsIndex < rangeLength) {\n result[argsIndex] = args[argsIndex];\n }\n var offset = argsIndex;\n while (++rightIndex < rightLength) {\n result[offset + rightIndex] = partials[rightIndex];\n }\n while (++holdersIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[offset + holders[holdersIndex]] = args[argsIndex++];\n }\n }\n return result;\n }\n\n /**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\n function copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array || (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n }\n\n /**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\n function copyObject(source, props, object, customizer) {\n var isNew = !object;\n object || (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n }\n\n /**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n }\n\n /**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n }\n\n /**\n * Creates a function like `_.groupBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} [initializer] The accumulator object initializer.\n * @returns {Function} Returns the new aggregator function.\n */\n function createAggregator(setter, initializer) {\n return function(collection, iteratee) {\n var func = isArray(collection) ? arrayAggregator : baseAggregator,\n accumulator = initializer ? initializer() : {};\n\n return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n };\n }\n\n /**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\n function createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n }\n\n /**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseEach(eachFunc, fromRight) {\n return function(collection, iteratee) {\n if (collection == null) {\n return collection;\n }\n if (!isArrayLike(collection)) {\n return eachFunc(collection, iteratee);\n }\n var length = collection.length,\n index = fromRight ? length : -1,\n iterable = Object(collection);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (iteratee(iterable[index], index, iterable) === false) {\n break;\n }\n }\n return collection;\n };\n }\n\n /**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the optional `this`\n * binding of `thisArg`.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createBind(func, bitmask, thisArg) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return fn.apply(isBind ? thisArg : this, arguments);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.lowerFirst`.\n *\n * @private\n * @param {string} methodName The name of the `String` case method to use.\n * @returns {Function} Returns the new case function.\n */\n function createCaseFirst(methodName) {\n return function(string) {\n string = toString(string);\n\n var strSymbols = hasUnicode(string)\n ? stringToArray(string)\n : undefined;\n\n var chr = strSymbols\n ? strSymbols[0]\n : string.charAt(0);\n\n var trailing = strSymbols\n ? castSlice(strSymbols, 1).join('')\n : string.slice(1);\n\n return chr[methodName]() + trailing;\n };\n }\n\n /**\n * Creates a function like `_.camelCase`.\n *\n * @private\n * @param {Function} callback The function to combine each word.\n * @returns {Function} Returns the new compounder function.\n */\n function createCompounder(callback) {\n return function(string) {\n return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n };\n }\n\n /**\n * Creates a function that produces an instance of `Ctor` regardless of\n * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n *\n * @private\n * @param {Function} Ctor The constructor to wrap.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCtor(Ctor) {\n return function() {\n // Use a `switch` statement to work with class constructors. See\n // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n // for more details.\n var args = arguments;\n switch (args.length) {\n case 0: return new Ctor;\n case 1: return new Ctor(args[0]);\n case 2: return new Ctor(args[0], args[1]);\n case 3: return new Ctor(args[0], args[1], args[2]);\n case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n }\n var thisBinding = baseCreate(Ctor.prototype),\n result = Ctor.apply(thisBinding, args);\n\n // Mimic the constructor's `return` behavior.\n // See https://es5.github.io/#x13.2.2 for more details.\n return isObject(result) ? result : thisBinding;\n };\n }\n\n /**\n * Creates a function that wraps `func` to enable currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {number} arity The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCurry(func, bitmask, arity) {\n var Ctor = createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length,\n placeholder = getHolder(wrapper);\n\n while (index--) {\n args[index] = arguments[index];\n }\n var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n ? []\n : replaceHolders(args, placeholder);\n\n length -= holders.length;\n if (length < arity) {\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, undefined,\n args, holders, undefined, undefined, arity - length);\n }\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return apply(fn, this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\n function createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = getIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n }\n\n /**\n * Creates a `_.flow` or `_.flowRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new flow function.\n */\n function createFlow(fromRight) {\n return flatRest(function(funcs) {\n var length = funcs.length,\n index = length,\n prereq = LodashWrapper.prototype.thru;\n\n if (fromRight) {\n funcs.reverse();\n }\n while (index--) {\n var func = funcs[index];\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n var wrapper = new LodashWrapper([], true);\n }\n }\n index = wrapper ? index : length;\n while (++index < length) {\n func = funcs[index];\n\n var funcName = getFuncName(func),\n data = funcName == 'wrapper' ? getData(func) : undefined;\n\n if (data && isLaziable(data[0]) &&\n data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n !data[4].length && data[9] == 1\n ) {\n wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n } else {\n wrapper = (func.length == 1 && isLaziable(func))\n ? wrapper[funcName]()\n : wrapper.thru(func);\n }\n }\n return function() {\n var args = arguments,\n value = args[0];\n\n if (wrapper && args.length == 1 && isArray(value)) {\n return wrapper.plant(value).value();\n }\n var index = 0,\n result = length ? funcs[index].apply(this, args) : value;\n\n while (++index < length) {\n result = funcs[index].call(this, result);\n }\n return result;\n };\n });\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with optional `this`\n * binding of `thisArg`, partial application, and currying.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [partialsRight] The arguments to append to those provided\n * to the new function.\n * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n var isAry = bitmask & WRAP_ARY_FLAG,\n isBind = bitmask & WRAP_BIND_FLAG,\n isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n isFlip = bitmask & WRAP_FLIP_FLAG,\n Ctor = isBindKey ? undefined : createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length;\n\n while (index--) {\n args[index] = arguments[index];\n }\n if (isCurried) {\n var placeholder = getHolder(wrapper),\n holdersCount = countHolders(args, placeholder);\n }\n if (partials) {\n args = composeArgs(args, partials, holders, isCurried);\n }\n if (partialsRight) {\n args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n }\n length -= holdersCount;\n if (isCurried && length < arity) {\n var newHolders = replaceHolders(args, placeholder);\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n args, newHolders, argPos, ary, arity - length\n );\n }\n var thisBinding = isBind ? thisArg : this,\n fn = isBindKey ? thisBinding[func] : func;\n\n length = args.length;\n if (argPos) {\n args = reorder(args, argPos);\n } else if (isFlip && length > 1) {\n args.reverse();\n }\n if (isAry && ary < length) {\n args.length = ary;\n }\n if (this && this !== root && this instanceof wrapper) {\n fn = Ctor || createCtor(fn);\n }\n return fn.apply(thisBinding, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.invertBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} toIteratee The function to resolve iteratees.\n * @returns {Function} Returns the new inverter function.\n */\n function createInverter(setter, toIteratee) {\n return function(object, iteratee) {\n return baseInverter(object, setter, toIteratee(iteratee), {});\n };\n }\n\n /**\n * Creates a function that performs a mathematical operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @param {number} [defaultValue] The value used for `undefined` arguments.\n * @returns {Function} Returns the new mathematical operation function.\n */\n function createMathOperation(operator, defaultValue) {\n return function(value, other) {\n var result;\n if (value === undefined && other === undefined) {\n return defaultValue;\n }\n if (value !== undefined) {\n result = value;\n }\n if (other !== undefined) {\n if (result === undefined) {\n return other;\n }\n if (typeof value == 'string' || typeof other == 'string') {\n value = baseToString(value);\n other = baseToString(other);\n } else {\n value = baseToNumber(value);\n other = baseToNumber(other);\n }\n result = operator(value, other);\n }\n return result;\n };\n }\n\n /**\n * Creates a function like `_.over`.\n *\n * @private\n * @param {Function} arrayFunc The function to iterate over iteratees.\n * @returns {Function} Returns the new over function.\n */\n function createOver(arrayFunc) {\n return flatRest(function(iteratees) {\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n return baseRest(function(args) {\n var thisArg = this;\n return arrayFunc(iteratees, function(iteratee) {\n return apply(iteratee, thisArg, args);\n });\n });\n });\n }\n\n /**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\n function createPadding(length, chars) {\n chars = chars === undefined ? ' ' : baseToString(chars);\n\n var charsLength = chars.length;\n if (charsLength < 2) {\n return charsLength ? baseRepeat(chars, length) : chars;\n }\n var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n return hasUnicode(chars)\n ? castSlice(stringToArray(result), 0, length).join('')\n : result.slice(0, length);\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the `this` binding\n * of `thisArg` and `partials` prepended to the arguments it receives.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} partials The arguments to prepend to those provided to\n * the new function.\n * @returns {Function} Returns the new wrapped function.\n */\n function createPartial(func, bitmask, thisArg, partials) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var argsIndex = -1,\n argsLength = arguments.length,\n leftIndex = -1,\n leftLength = partials.length,\n args = Array(leftLength + argsLength),\n fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n while (++leftIndex < leftLength) {\n args[leftIndex] = partials[leftIndex];\n }\n while (argsLength--) {\n args[leftIndex++] = arguments[++argsIndex];\n }\n return apply(fn, isBind ? thisArg : this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\n function createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n }\n\n /**\n * Creates a function that performs a relational operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @returns {Function} Returns the new relational operation function.\n */\n function createRelationalOperation(operator) {\n return function(value, other) {\n if (!(typeof value == 'string' && typeof other == 'string')) {\n value = toNumber(value);\n other = toNumber(other);\n }\n return operator(value, other);\n };\n }\n\n /**\n * Creates a function that wraps `func` to continue currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {Function} wrapFunc The function to create the `func` wrapper.\n * @param {*} placeholder The placeholder value.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n var isCurry = bitmask & WRAP_CURRY_FLAG,\n newHolders = isCurry ? holders : undefined,\n newHoldersRight = isCurry ? undefined : holders,\n newPartials = isCurry ? partials : undefined,\n newPartialsRight = isCurry ? undefined : partials;\n\n bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n }\n var newData = [\n func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n newHoldersRight, argPos, ary, arity\n ];\n\n var result = wrapFunc.apply(undefined, newData);\n if (isLaziable(func)) {\n setData(result, newData);\n }\n result.placeholder = placeholder;\n return setWrapToString(result, func, bitmask);\n }\n\n /**\n * Creates a function like `_.round`.\n *\n * @private\n * @param {string} methodName The name of the `Math` method to use when rounding.\n * @returns {Function} Returns the new round function.\n */\n function createRound(methodName) {\n var func = Math[methodName];\n return function(number, precision) {\n number = toNumber(number);\n precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n if (precision && nativeIsFinite(number)) {\n // Shift with exponential notation to avoid floating-point issues.\n // See [MDN](https://mdn.io/round#Examples) for more details.\n var pair = (toString(number) + 'e').split('e'),\n value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n pair = (toString(value) + 'e').split('e');\n return +(pair[0] + 'e' + (+pair[1] - precision));\n }\n return func(number);\n };\n }\n\n /**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\n var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n };\n\n /**\n * Creates a `_.toPairs` or `_.toPairsIn` function.\n *\n * @private\n * @param {Function} keysFunc The function to get the keys of a given object.\n * @returns {Function} Returns the new pairs function.\n */\n function createToPairs(keysFunc) {\n return function(object) {\n var tag = getTag(object);\n if (tag == mapTag) {\n return mapToArray(object);\n }\n if (tag == setTag) {\n return setToPairs(object);\n }\n return baseToPairs(object, keysFunc(object));\n };\n }\n\n /**\n * Creates a function that either curries or invokes `func` with optional\n * `this` binding and partially applied arguments.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags.\n * 1 - `_.bind`\n * 2 - `_.bindKey`\n * 4 - `_.curry` or `_.curryRight` of a bound function\n * 8 - `_.curry`\n * 16 - `_.curryRight`\n * 32 - `_.partial`\n * 64 - `_.partialRight`\n * 128 - `_.rearg`\n * 256 - `_.ary`\n * 512 - `_.flip`\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to be partially applied.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n if (!isBindKey && typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var length = partials ? partials.length : 0;\n if (!length) {\n bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n partials = holders = undefined;\n }\n ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n arity = arity === undefined ? arity : toInteger(arity);\n length -= holders ? holders.length : 0;\n\n if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n var partialsRight = partials,\n holdersRight = holders;\n\n partials = holders = undefined;\n }\n var data = isBindKey ? undefined : getData(func);\n\n var newData = [\n func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n argPos, ary, arity\n ];\n\n if (data) {\n mergeData(newData, data);\n }\n func = newData[0];\n bitmask = newData[1];\n thisArg = newData[2];\n partials = newData[3];\n holders = newData[4];\n arity = newData[9] = newData[9] === undefined\n ? (isBindKey ? 0 : func.length)\n : nativeMax(newData[9] - length, 0);\n\n if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n }\n if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n var result = createBind(func, bitmask, thisArg);\n } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n result = createCurry(func, bitmask, arity);\n } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n result = createPartial(func, bitmask, thisArg, partials);\n } else {\n result = createHybrid.apply(undefined, newData);\n }\n var setter = data ? baseSetData : setData;\n return setWrapToString(setter(result, newData), func, bitmask);\n }\n\n /**\n * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n * of source objects to the destination object for all destination properties\n * that resolve to `undefined`.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to assign.\n * @param {Object} object The parent object of `objValue`.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsAssignIn(objValue, srcValue, key, object) {\n if (objValue === undefined ||\n (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n return srcValue;\n }\n return objValue;\n }\n\n /**\n * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n * objects into destination objects that are passed thru.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to merge.\n * @param {Object} object The parent object of `objValue`.\n * @param {Object} source The parent object of `srcValue`.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n if (isObject(objValue) && isObject(srcValue)) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, objValue);\n baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n stack['delete'](srcValue);\n }\n return objValue;\n }\n\n /**\n * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n * objects.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {string} key The key of the property to inspect.\n * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n */\n function customOmitClone(value) {\n return isPlainObject(value) ? undefined : value;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\n function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n arrLength = array.length,\n othLength = other.length;\n\n if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n return false;\n }\n // Check that cyclic values are equal.\n var arrStacked = stack.get(array);\n var othStacked = stack.get(other);\n if (arrStacked && othStacked) {\n return arrStacked == other && othStacked == array;\n }\n var index = -1,\n result = true,\n seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n stack.set(array, other);\n stack.set(other, array);\n\n // Ignore non-index properties.\n while (++index < arrLength) {\n var arrValue = array[index],\n othValue = other[index];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, arrValue, index, other, array, stack)\n : customizer(arrValue, othValue, index, array, other, stack);\n }\n if (compared !== undefined) {\n if (compared) {\n continue;\n }\n result = false;\n break;\n }\n // Recursively compare arrays (susceptible to call stack limits).\n if (seen) {\n if (!arraySome(other, function(othValue, othIndex) {\n if (!cacheHas(seen, othIndex) &&\n (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n return seen.push(othIndex);\n }\n })) {\n result = false;\n break;\n }\n } else if (!(\n arrValue === othValue ||\n equalFunc(arrValue, othValue, bitmask, customizer, stack)\n )) {\n result = false;\n break;\n }\n }\n stack['delete'](array);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n switch (tag) {\n case dataViewTag:\n if ((object.byteLength != other.byteLength) ||\n (object.byteOffset != other.byteOffset)) {\n return false;\n }\n object = object.buffer;\n other = other.buffer;\n\n case arrayBufferTag:\n if ((object.byteLength != other.byteLength) ||\n !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n return false;\n }\n return true;\n\n case boolTag:\n case dateTag:\n case numberTag:\n // Coerce booleans to `1` or `0` and dates to milliseconds.\n // Invalid dates are coerced to `NaN`.\n return eq(+object, +other);\n\n case errorTag:\n return object.name == other.name && object.message == other.message;\n\n case regexpTag:\n case stringTag:\n // Coerce regexes to strings and treat strings, primitives and objects,\n // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n // for more details.\n return object == (other + '');\n\n case mapTag:\n var convert = mapToArray;\n\n case setTag:\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n convert || (convert = setToArray);\n\n if (object.size != other.size && !isPartial) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked) {\n return stacked == other;\n }\n bitmask |= COMPARE_UNORDERED_FLAG;\n\n // Recursively compare objects (susceptible to call stack limits).\n stack.set(object, other);\n var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n stack['delete'](object);\n return result;\n\n case symbolTag:\n if (symbolValueOf) {\n return symbolValueOf.call(object) == symbolValueOf.call(other);\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n objProps = getAllKeys(object),\n objLength = objProps.length,\n othProps = getAllKeys(other),\n othLength = othProps.length;\n\n if (objLength != othLength && !isPartial) {\n return false;\n }\n var index = objLength;\n while (index--) {\n var key = objProps[index];\n if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n return false;\n }\n }\n // Check that cyclic values are equal.\n var objStacked = stack.get(object);\n var othStacked = stack.get(other);\n if (objStacked && othStacked) {\n return objStacked == other && othStacked == object;\n }\n var result = true;\n stack.set(object, other);\n stack.set(other, object);\n\n var skipCtor = isPartial;\n while (++index < objLength) {\n key = objProps[index];\n var objValue = object[key],\n othValue = other[key];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, objValue, key, other, object, stack)\n : customizer(objValue, othValue, key, object, other, stack);\n }\n // Recursively compare objects (susceptible to call stack limits).\n if (!(compared === undefined\n ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n : compared\n )) {\n result = false;\n break;\n }\n skipCtor || (skipCtor = key == 'constructor');\n }\n if (result && !skipCtor) {\n var objCtor = object.constructor,\n othCtor = other.constructor;\n\n // Non `Object` object instances with different constructors are not equal.\n if (objCtor != othCtor &&\n ('constructor' in object && 'constructor' in other) &&\n !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n result = false;\n }\n }\n stack['delete'](object);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n function flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n }\n\n /**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n }\n\n /**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n }\n\n /**\n * Gets metadata for `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {*} Returns the metadata for `func`.\n */\n var getData = !metaMap ? noop : function(func) {\n return metaMap.get(func);\n };\n\n /**\n * Gets the name of `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {string} Returns the function name.\n */\n function getFuncName(func) {\n var result = (func.name + ''),\n array = realNames[result],\n length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n while (length--) {\n var data = array[length],\n otherFunc = data.func;\n if (otherFunc == null || otherFunc == func) {\n return data.name;\n }\n }\n return result;\n }\n\n /**\n * Gets the argument placeholder value for `func`.\n *\n * @private\n * @param {Function} func The function to inspect.\n * @returns {*} Returns the placeholder value.\n */\n function getHolder(func) {\n var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n return object.placeholder;\n }\n\n /**\n * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n * this function returns the custom method, otherwise it returns `baseIteratee`.\n * If arguments are provided, the chosen function is invoked with them and\n * its result is returned.\n *\n * @private\n * @param {*} [value] The value to convert to an iteratee.\n * @param {number} [arity] The arity of the created iteratee.\n * @returns {Function} Returns the chosen function or its result.\n */\n function getIteratee() {\n var result = lodash.iteratee || iteratee;\n result = result === iteratee ? baseIteratee : result;\n return arguments.length ? result(arguments[0], arguments[1]) : result;\n }\n\n /**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\n function getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n }\n\n /**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\n function getMatchData(object) {\n var result = keys(object),\n length = result.length;\n\n while (length--) {\n var key = result[length],\n value = object[key];\n\n result[length] = [key, value, isStrictComparable(value)];\n }\n return result;\n }\n\n /**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\n function getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n }\n\n /**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\n function getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n }\n\n /**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n if (object == null) {\n return [];\n }\n object = Object(object);\n return arrayFilter(nativeGetSymbols(object), function(symbol) {\n return propertyIsEnumerable.call(object, symbol);\n });\n };\n\n /**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n var result = [];\n while (object) {\n arrayPush(result, getSymbols(object));\n object = getPrototype(object);\n }\n return result;\n };\n\n /**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n var getTag = baseGetTag;\n\n // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n (Map && getTag(new Map) != mapTag) ||\n (Promise && getTag(Promise.resolve()) != promiseTag) ||\n (Set && getTag(new Set) != setTag) ||\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = baseGetTag(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : '';\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n }\n\n /**\n * Gets the view, applying any `transforms` to the `start` and `end` positions.\n *\n * @private\n * @param {number} start The start of the view.\n * @param {number} end The end of the view.\n * @param {Array} transforms The transformations to apply to the view.\n * @returns {Object} Returns an object containing the `start` and `end`\n * positions of the view.\n */\n function getView(start, end, transforms) {\n var index = -1,\n length = transforms.length;\n\n while (++index < length) {\n var data = transforms[index],\n size = data.size;\n\n switch (data.type) {\n case 'drop': start += size; break;\n case 'dropRight': end -= size; break;\n case 'take': end = nativeMin(end, start + size); break;\n case 'takeRight': start = nativeMax(start, end - size); break;\n }\n }\n return { 'start': start, 'end': end };\n }\n\n /**\n * Extracts wrapper details from the `source` body comment.\n *\n * @private\n * @param {string} source The source to inspect.\n * @returns {Array} Returns the wrapper details.\n */\n function getWrapDetails(source) {\n var match = source.match(reWrapDetails);\n return match ? match[1].split(reSplitDetails) : [];\n }\n\n /**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\n function hasPath(object, path, hasFunc) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n result = false;\n\n while (++index < length) {\n var key = toKey(path[index]);\n if (!(result = object != null && hasFunc(object, key))) {\n break;\n }\n object = object[key];\n }\n if (result || ++index != length) {\n return result;\n }\n length = object == null ? 0 : object.length;\n return !!length && isLength(length) && isIndex(key, length) &&\n (isArray(object) || isArguments(object));\n }\n\n /**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\n function initCloneArray(array) {\n var length = array.length,\n result = new array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n }\n\n /**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n }\n\n /**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneByTag(object, tag, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return new Ctor;\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return new Ctor;\n\n case symbolTag:\n return cloneSymbol(object);\n }\n }\n\n /**\n * Inserts wrapper `details` in a comment at the top of the `source` body.\n *\n * @private\n * @param {string} source The source to modify.\n * @returns {Array} details The details to insert.\n * @returns {string} Returns the modified source.\n */\n function insertWrapDetails(source, details) {\n var length = details.length;\n if (!length) {\n return source;\n }\n var lastIndex = length - 1;\n details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n details = details.join(length > 2 ? ', ' : ' ');\n return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n }\n\n /**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\n function isFlattenable(value) {\n return isArray(value) || isArguments(value) ||\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n }\n\n /**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\n function isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' ||\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n }\n\n /**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n */\n function isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n }\n\n /**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\n function isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n value == null || isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n (object != null && value in Object(object));\n }\n\n /**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\n function isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n }\n\n /**\n * Checks if `func` has a lazy counterpart.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n * else `false`.\n */\n function isLaziable(func) {\n var funcName = getFuncName(func),\n other = lodash[funcName];\n\n if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n return false;\n }\n if (func === other) {\n return true;\n }\n var data = getData(other);\n return !!data && func === data[0];\n }\n\n /**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\n function isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n }\n\n /**\n * Checks if `func` is capable of being masked.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n */\n var isMaskable = coreJsData ? isFunction : stubFalse;\n\n /**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\n function isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n }\n\n /**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n * equality comparisons, else `false`.\n */\n function isStrictComparable(value) {\n return value === value && !isObject(value);\n }\n\n /**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function matchesStrictComparable(key, srcValue) {\n return function(object) {\n if (object == null) {\n return false;\n }\n return object[key] === srcValue &&\n (srcValue !== undefined || (key in Object(object)));\n };\n }\n\n /**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\n function memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n }\n\n /**\n * Merges the function metadata of `source` into `data`.\n *\n * Merging metadata reduces the number of wrappers used to invoke a function.\n * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n * may be applied regardless of execution order. Methods like `_.ary` and\n * `_.rearg` modify function arguments, making the order in which they are\n * executed important, preventing the merging of metadata. However, we make\n * an exception for a safe combined case where curried functions have `_.ary`\n * and or `_.rearg` applied.\n *\n * @private\n * @param {Array} data The destination metadata.\n * @param {Array} source The source metadata.\n * @returns {Array} Returns `data`.\n */\n function mergeData(data, source) {\n var bitmask = data[1],\n srcBitmask = source[1],\n newBitmask = bitmask | srcBitmask,\n isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n var isCombo =\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n // Exit early if metadata can't be merged.\n if (!(isCommon || isCombo)) {\n return data;\n }\n // Use source `thisArg` if available.\n if (srcBitmask & WRAP_BIND_FLAG) {\n data[2] = source[2];\n // Set when currying a bound function.\n newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n }\n // Compose partial arguments.\n var value = source[3];\n if (value) {\n var partials = data[3];\n data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n }\n // Compose partial right arguments.\n value = source[5];\n if (value) {\n partials = data[5];\n data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n }\n // Use source `argPos` if available.\n value = source[7];\n if (value) {\n data[7] = value;\n }\n // Use source `ary` if it's smaller.\n if (srcBitmask & WRAP_ARY_FLAG) {\n data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n }\n // Use source `arity` if one is not provided.\n if (data[9] == null) {\n data[9] = source[9];\n }\n // Use source `func` and merge bitmasks.\n data[0] = source[0];\n data[1] = newBitmask;\n\n return data;\n }\n\n /**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\n function objectToString(value) {\n return nativeObjectToString.call(value);\n }\n\n /**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\n function overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n }\n\n /**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\n function parent(object, path) {\n return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n }\n\n /**\n * Reorder `array` according to the specified indexes where the element at\n * the first index is assigned as the first element, the element at\n * the second index is assigned as the second element, and so on.\n *\n * @private\n * @param {Array} array The array to reorder.\n * @param {Array} indexes The arranged array indexes.\n * @returns {Array} Returns `array`.\n */\n function reorder(array, indexes) {\n var arrLength = array.length,\n length = nativeMin(indexes.length, arrLength),\n oldArray = copyArray(array);\n\n while (length--) {\n var index = indexes[length];\n array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n }\n return array;\n }\n\n /**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n }\n\n /**\n * Sets metadata for `func`.\n *\n * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n * period of time, it will trip its breaker and transition to an identity\n * function to avoid garbage collection pauses in V8. See\n * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n * for more details.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var setData = shortOut(baseSetData);\n\n /**\n * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n var setTimeout = ctxSetTimeout || function(func, wait) {\n return root.setTimeout(func, wait);\n };\n\n /**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var setToString = shortOut(baseSetToString);\n\n /**\n * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n * with wrapper details in a comment at the top of the source body.\n *\n * @private\n * @param {Function} wrapper The function to modify.\n * @param {Function} reference The reference function.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Function} Returns `wrapper`.\n */\n function setWrapToString(wrapper, reference, bitmask) {\n var source = (reference + '');\n return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n }\n\n /**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\n function shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n }\n\n /**\n * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @param {number} [size=array.length] The size of `array`.\n * @returns {Array} Returns `array`.\n */\n function shuffleSelf(array, size) {\n var index = -1,\n length = array.length,\n lastIndex = length - 1;\n\n size = size === undefined ? length : size;\n while (++index < size) {\n var rand = baseRandom(index, lastIndex),\n value = array[rand];\n\n array[rand] = array[index];\n array[index] = value;\n }\n array.length = size;\n return array;\n }\n\n /**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\n var stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 /* . */) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n });\n return result;\n });\n\n /**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\n function toKey(value) {\n if (typeof value == 'string' || isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\n function toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n }\n\n /**\n * Updates wrapper `details` based on `bitmask` flags.\n *\n * @private\n * @returns {Array} details The details to modify.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Array} Returns `details`.\n */\n function updateWrapDetails(details, bitmask) {\n arrayEach(wrapFlags, function(pair) {\n var value = '_.' + pair[0];\n if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n details.push(value);\n }\n });\n return details.sort();\n }\n\n /**\n * Creates a clone of `wrapper`.\n *\n * @private\n * @param {Object} wrapper The wrapper to clone.\n * @returns {Object} Returns the cloned wrapper.\n */\n function wrapperClone(wrapper) {\n if (wrapper instanceof LazyWrapper) {\n return wrapper.clone();\n }\n var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n result.__actions__ = copyArray(wrapper.__actions__);\n result.__index__ = wrapper.__index__;\n result.__values__ = wrapper.__values__;\n return result;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\n function chunk(array, size, guard) {\n if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n size = 1;\n } else {\n size = nativeMax(toInteger(size), 0);\n }\n var length = array == null ? 0 : array.length;\n if (!length || size < 1) {\n return [];\n }\n var index = 0,\n resIndex = 0,\n result = Array(nativeCeil(length / size));\n\n while (index < length) {\n result[resIndex++] = baseSlice(array, index, (index += size));\n }\n return result;\n }\n\n /**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\n function compact(array) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * Creates a new array concatenating `array` with any additional arrays\n * and/or values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to concatenate.\n * @param {...*} [values] The values to concatenate.\n * @returns {Array} Returns the new concatenated array.\n * @example\n *\n * var array = [1];\n * var other = _.concat(array, 2, [3], [[4]]);\n *\n * console.log(other);\n * // => [1, 2, 3, [4]]\n *\n * console.log(array);\n * // => [1]\n */\n function concat() {\n var length = arguments.length;\n if (!length) {\n return [];\n }\n var args = Array(length - 1),\n array = arguments[0],\n index = length;\n\n while (index--) {\n args[index - 1] = arguments[index];\n }\n return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n }\n\n /**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\n var difference = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `iteratee` which\n * is invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var differenceBy = baseRest(function(array, values) {\n var iteratee = last(values);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\n var differenceWith = baseRest(function(array, values) {\n var comparator = last(values);\n if (isArrayLikeObject(comparator)) {\n comparator = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n : [];\n });\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function drop(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function dropRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the end.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.dropRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropRightWhile(users, ['active', false]);\n * // => objects for ['barney']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropRightWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the beginning.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.dropWhile(users, function(o) { return !o.active; });\n * // => objects for ['pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropWhile(users, ['active', false]);\n * // => objects for ['pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true)\n : [];\n }\n\n /**\n * Fills elements of `array` with `value` from `start` up to, but not\n * including, `end`.\n *\n * **Note:** This method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Array\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.fill(array, 'a');\n * console.log(array);\n * // => ['a', 'a', 'a']\n *\n * _.fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * _.fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n */\n function fill(array, value, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n start = 0;\n end = length;\n }\n return baseFill(array, value, start, end);\n }\n\n /**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\n function findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index);\n }\n\n /**\n * This method is like `_.findIndex` except that it iterates over elements\n * of `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n * // => 2\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n * // => 0\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastIndex(users, ['active', false]);\n * // => 2\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastIndex(users, 'active');\n * // => 0\n */\n function findLastIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length - 1;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = fromIndex < 0\n ? nativeMax(length + index, 0)\n : nativeMin(index, length - 1);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n }\n\n /**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\n function flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n }\n\n /**\n * Recursively flattens `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flattenDeep([1, [2, [3, [4]], 5]]);\n * // => [1, 2, 3, 4, 5]\n */\n function flattenDeep(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, INFINITY) : [];\n }\n\n /**\n * Recursively flatten `array` up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * var array = [1, [2, [3, [4]], 5]];\n *\n * _.flattenDepth(array, 1);\n * // => [1, 2, [3, [4]], 5]\n *\n * _.flattenDepth(array, 2);\n * // => [1, 2, 3, [4], 5]\n */\n function flattenDepth(array, depth) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(array, depth);\n }\n\n /**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\n function fromPairs(pairs) {\n var index = -1,\n length = pairs == null ? 0 : pairs.length,\n result = {};\n\n while (++index < length) {\n var pair = pairs[index];\n result[pair[0]] = pair[1];\n }\n return result;\n }\n\n /**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\n function head(array) {\n return (array && array.length) ? array[0] : undefined;\n }\n\n /**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\n function indexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseIndexOf(array, value, index);\n }\n\n /**\n * Gets all but the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.initial([1, 2, 3]);\n * // => [1, 2]\n */\n function initial(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 0, -1) : [];\n }\n\n /**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\n var intersection = baseRest(function(arrays) {\n var mapped = arrayMap(arrays, castArrayLikeObject);\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped)\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `iteratee`\n * which is invoked for each element of each `arrays` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [2.1]\n *\n * // The `_.property` iteratee shorthand.\n * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }]\n */\n var intersectionBy = baseRest(function(arrays) {\n var iteratee = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n if (iteratee === last(mapped)) {\n iteratee = undefined;\n } else {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `comparator`\n * which is invoked to compare elements of `arrays`. The order and references\n * of result values are determined by the first array. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.intersectionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }]\n */\n var intersectionWith = baseRest(function(arrays) {\n var comparator = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n comparator = typeof comparator == 'function' ? comparator : undefined;\n if (comparator) {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, undefined, comparator)\n : [];\n });\n\n /**\n * Converts all elements in `array` into a string separated by `separator`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to convert.\n * @param {string} [separator=','] The element separator.\n * @returns {string} Returns the joined string.\n * @example\n *\n * _.join(['a', 'b', 'c'], '~');\n * // => 'a~b~c'\n */\n function join(array, separator) {\n return array == null ? '' : nativeJoin.call(array, separator);\n }\n\n /**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\n function last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n }\n\n /**\n * This method is like `_.indexOf` except that it iterates over elements of\n * `array` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.lastIndexOf([1, 2, 1, 2], 2);\n * // => 3\n *\n * // Search from the `fromIndex`.\n * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n * // => 1\n */\n function lastIndexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n }\n return value === value\n ? strictLastIndexOf(array, value, index)\n : baseFindIndex(array, baseIsNaN, index, true);\n }\n\n /**\n * Gets the element at index `n` of `array`. If `n` is negative, the nth\n * element from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.11.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=0] The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n *\n * _.nth(array, 1);\n * // => 'b'\n *\n * _.nth(array, -2);\n * // => 'c';\n */\n function nth(array, n) {\n return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n }\n\n /**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\n var pull = baseRest(pullAll);\n\n /**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\n function pullAll(array, values) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values)\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `iteratee` which is\n * invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The iteratee is invoked with one argument: (value).\n *\n * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n *\n * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n * console.log(array);\n * // => [{ 'x': 2 }]\n */\n function pullAllBy(array, values, iteratee) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, getIteratee(iteratee, 2))\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `comparator` which\n * is invoked to compare elements of `array` to `values`. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n *\n * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n * console.log(array);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n */\n function pullAllWith(array, values, comparator) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, undefined, comparator)\n : array;\n }\n\n /**\n * Removes elements from `array` corresponding to `indexes` and returns an\n * array of removed elements.\n *\n * **Note:** Unlike `_.at`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n * var pulled = _.pullAt(array, [1, 3]);\n *\n * console.log(array);\n * // => ['a', 'c']\n *\n * console.log(pulled);\n * // => ['b', 'd']\n */\n var pullAt = flatRest(function(array, indexes) {\n var length = array == null ? 0 : array.length,\n result = baseAt(array, indexes);\n\n basePullAt(array, arrayMap(indexes, function(index) {\n return isIndex(index, length) ? +index : index;\n }).sort(compareAscending));\n\n return result;\n });\n\n /**\n * Removes all elements from `array` that `predicate` returns truthy for\n * and returns an array of the removed elements. The predicate is invoked\n * with three arguments: (value, index, array).\n *\n * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n * to pull elements from an array by value.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = [1, 2, 3, 4];\n * var evens = _.remove(array, function(n) {\n * return n % 2 == 0;\n * });\n *\n * console.log(array);\n * // => [1, 3]\n *\n * console.log(evens);\n * // => [2, 4]\n */\n function remove(array, predicate) {\n var result = [];\n if (!(array && array.length)) {\n return result;\n }\n var index = -1,\n indexes = [],\n length = array.length;\n\n predicate = getIteratee(predicate, 3);\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result.push(value);\n indexes.push(index);\n }\n }\n basePullAt(array, indexes);\n return result;\n }\n\n /**\n * Reverses `array` so that the first element becomes the last, the second\n * element becomes the second to last, and so on.\n *\n * **Note:** This method mutates `array` and is based on\n * [`Array#reverse`](https://mdn.io/Array/reverse).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.reverse(array);\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function reverse(array) {\n return array == null ? array : nativeReverse.call(array);\n }\n\n /**\n * Creates a slice of `array` from `start` up to, but not including, `end`.\n *\n * **Note:** This method is used instead of\n * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n * returned.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function slice(array, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n start = 0;\n end = length;\n }\n else {\n start = start == null ? 0 : toInteger(start);\n end = end === undefined ? length : toInteger(end);\n }\n return baseSlice(array, start, end);\n }\n\n /**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\n function sortedIndex(array, value) {\n return baseSortedIndex(array, value);\n }\n\n /**\n * This method is like `_.sortedIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n * // => 0\n */\n function sortedIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n }\n\n /**\n * This method is like `_.indexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n * // => 1\n */\n function sortedIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value);\n if (index < length && eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.sortedIndex` except that it returns the highest\n * index at which `value` should be inserted into `array` in order to\n * maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n * // => 4\n */\n function sortedLastIndex(array, value) {\n return baseSortedIndex(array, value, true);\n }\n\n /**\n * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 1\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n * // => 1\n */\n function sortedLastIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n }\n\n /**\n * This method is like `_.lastIndexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n * // => 3\n */\n function sortedLastIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value, true) - 1;\n if (eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.uniq` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniq([1, 1, 2]);\n * // => [1, 2]\n */\n function sortedUniq(array) {\n return (array && array.length)\n ? baseSortedUniq(array)\n : [];\n }\n\n /**\n * This method is like `_.uniqBy` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n * // => [1.1, 2.3]\n */\n function sortedUniqBy(array, iteratee) {\n return (array && array.length)\n ? baseSortedUniq(array, getIteratee(iteratee, 2))\n : [];\n }\n\n /**\n * Gets all but the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.tail([1, 2, 3]);\n * // => [2, 3]\n */\n function tail(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 1, length) : [];\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.take([1, 2, 3]);\n * // => [1]\n *\n * _.take([1, 2, 3], 2);\n * // => [1, 2]\n *\n * _.take([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.take([1, 2, 3], 0);\n * // => []\n */\n function take(array, n, guard) {\n if (!(array && array.length)) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.takeRight([1, 2, 3]);\n * // => [3]\n *\n * _.takeRight([1, 2, 3], 2);\n * // => [2, 3]\n *\n * _.takeRight([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.takeRight([1, 2, 3], 0);\n * // => []\n */\n function takeRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with elements taken from the end. Elements are\n * taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.takeRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeRightWhile(users, ['active', false]);\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeRightWhile(users, 'active');\n * // => []\n */\n function takeRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), false, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` with elements taken from the beginning. Elements\n * are taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.takeWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeWhile(users, ['active', false]);\n * // => objects for ['barney', 'fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeWhile(users, 'active');\n * // => []\n */\n function takeWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3))\n : [];\n }\n\n /**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\n var union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n });\n\n /**\n * This method is like `_.union` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which uniqueness is computed. Result values are chosen from the first\n * array in which the value occurs. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n var unionBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.union` except that it accepts `comparator` which\n * is invoked to compare elements of `arrays`. Result values are chosen from\n * the first array in which the value occurs. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.unionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var unionWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n });\n\n /**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\n function uniq(array) {\n return (array && array.length) ? baseUniq(array) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n function uniqBy(array, iteratee) {\n return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `comparator` which\n * is invoked to compare elements of `array`. The order of result values is\n * determined by the order they occur in the array.The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.uniqWith(objects, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n */\n function uniqWith(array, comparator) {\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n }\n\n /**\n * This method is like `_.zip` except that it accepts an array of grouped\n * elements and creates an array regrouping the elements to their pre-zip\n * configuration.\n *\n * @static\n * @memberOf _\n * @since 1.2.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n *\n * _.unzip(zipped);\n * // => [['a', 'b'], [1, 2], [true, false]]\n */\n function unzip(array) {\n if (!(array && array.length)) {\n return [];\n }\n var length = 0;\n array = arrayFilter(array, function(group) {\n if (isArrayLikeObject(group)) {\n length = nativeMax(group.length, length);\n return true;\n }\n });\n return baseTimes(length, function(index) {\n return arrayMap(array, baseProperty(index));\n });\n }\n\n /**\n * This method is like `_.unzip` except that it accepts `iteratee` to specify\n * how regrouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * regrouped values.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n * // => [[1, 10, 100], [2, 20, 200]]\n *\n * _.unzipWith(zipped, _.add);\n * // => [3, 30, 300]\n */\n function unzipWith(array, iteratee) {\n if (!(array && array.length)) {\n return [];\n }\n var result = unzip(array);\n if (iteratee == null) {\n return result;\n }\n return arrayMap(result, function(group) {\n return apply(iteratee, undefined, group);\n });\n }\n\n /**\n * Creates an array excluding all given values using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.pull`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...*} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.xor\n * @example\n *\n * _.without([2, 1, 2, 3], 1, 2);\n * // => [3]\n */\n var without = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, values)\n : [];\n });\n\n /**\n * Creates an array of unique values that is the\n * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n * of the given arrays. The order of result values is determined by the order\n * they occur in the arrays.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.without\n * @example\n *\n * _.xor([2, 1], [2, 3]);\n * // => [1, 3]\n */\n var xor = baseRest(function(arrays) {\n return baseXor(arrayFilter(arrays, isArrayLikeObject));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which by which they're compared. The order of result values is determined\n * by the order they occur in the arrays. The iteratee is invoked with one\n * argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2, 3.4]\n *\n * // The `_.property` iteratee shorthand.\n * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var xorBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var xorWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n });\n\n /**\n * Creates an array of grouped elements, the first of which contains the\n * first elements of the given arrays, the second of which contains the\n * second elements of the given arrays, and so on.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n */\n var zip = baseRest(unzip);\n\n /**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\n function zipObject(props, values) {\n return baseZipObject(props || [], values || [], assignValue);\n }\n\n /**\n * This method is like `_.zipObject` except that it supports property paths.\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\n function zipObjectDeep(props, values) {\n return baseZipObject(props || [], values || [], baseSet);\n }\n\n /**\n * This method is like `_.zip` except that it accepts `iteratee` to specify\n * how grouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * grouped values.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n * return a + b + c;\n * });\n * // => [111, 222]\n */\n var zipWith = baseRest(function(arrays) {\n var length = arrays.length,\n iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n return unzipWith(arrays, iteratee);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n * chain sequences enabled. The result of such sequences must be unwrapped\n * with `_#value`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Seq\n * @param {*} value The value to wrap.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'pebbles', 'age': 1 }\n * ];\n *\n * var youngest = _\n * .chain(users)\n * .sortBy('age')\n * .map(function(o) {\n * return o.user + ' is ' + o.age;\n * })\n * .head()\n * .value();\n * // => 'pebbles is 1'\n */\n function chain(value) {\n var result = lodash(value);\n result.__chain__ = true;\n return result;\n }\n\n /**\n * This method invokes `interceptor` and returns `value`. The interceptor\n * is invoked with one argument; (value). The purpose of this method is to\n * \"tap into\" a method chain sequence in order to modify intermediate results.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns `value`.\n * @example\n *\n * _([1, 2, 3])\n * .tap(function(array) {\n * // Mutate input array.\n * array.pop();\n * })\n * .reverse()\n * .value();\n * // => [2, 1]\n */\n function tap(value, interceptor) {\n interceptor(value);\n return value;\n }\n\n /**\n * This method is like `_.tap` except that it returns the result of `interceptor`.\n * The purpose of this method is to \"pass thru\" values replacing intermediate\n * results in a method chain sequence.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns the result of `interceptor`.\n * @example\n *\n * _(' abc ')\n * .chain()\n * .trim()\n * .thru(function(value) {\n * return [value];\n * })\n * .value();\n * // => ['abc']\n */\n function thru(value, interceptor) {\n return interceptor(value);\n }\n\n /**\n * This method is the wrapper version of `_.at`.\n *\n * @name at\n * @memberOf _\n * @since 1.0.0\n * @category Seq\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _(object).at(['a[0].b.c', 'a[1]']).value();\n * // => [3, 4]\n */\n var wrapperAt = flatRest(function(paths) {\n var length = paths.length,\n start = length ? paths[0] : 0,\n value = this.__wrapped__,\n interceptor = function(object) { return baseAt(object, paths); };\n\n if (length > 1 || this.__actions__.length ||\n !(value instanceof LazyWrapper) || !isIndex(start)) {\n return this.thru(interceptor);\n }\n value = value.slice(start, +start + (length ? 1 : 0));\n value.__actions__.push({\n 'func': thru,\n 'args': [interceptor],\n 'thisArg': undefined\n });\n return new LodashWrapper(value, this.__chain__).thru(function(array) {\n if (length && !array.length) {\n array.push(undefined);\n }\n return array;\n });\n });\n\n /**\n * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n *\n * @name chain\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 }\n * ];\n *\n * // A sequence without explicit chaining.\n * _(users).head();\n * // => { 'user': 'barney', 'age': 36 }\n *\n * // A sequence with explicit chaining.\n * _(users)\n * .chain()\n * .head()\n * .pick('user')\n * .value();\n * // => { 'user': 'barney' }\n */\n function wrapperChain() {\n return chain(this);\n }\n\n /**\n * Executes the chain sequence and returns the wrapped result.\n *\n * @name commit\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2];\n * var wrapped = _(array).push(3);\n *\n * console.log(array);\n * // => [1, 2]\n *\n * wrapped = wrapped.commit();\n * console.log(array);\n * // => [1, 2, 3]\n *\n * wrapped.last();\n * // => 3\n *\n * console.log(array);\n * // => [1, 2, 3]\n */\n function wrapperCommit() {\n return new LodashWrapper(this.value(), this.__chain__);\n }\n\n /**\n * Gets the next value on a wrapped object following the\n * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n *\n * @name next\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the next iterator value.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 1 }\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 2 }\n *\n * wrapped.next();\n * // => { 'done': true, 'value': undefined }\n */\n function wrapperNext() {\n if (this.__values__ === undefined) {\n this.__values__ = toArray(this.value());\n }\n var done = this.__index__ >= this.__values__.length,\n value = done ? undefined : this.__values__[this.__index__++];\n\n return { 'done': done, 'value': value };\n }\n\n /**\n * Enables the wrapper to be iterable.\n *\n * @name Symbol.iterator\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the wrapper object.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped[Symbol.iterator]() === wrapped;\n * // => true\n *\n * Array.from(wrapped);\n * // => [1, 2]\n */\n function wrapperToIterator() {\n return this;\n }\n\n /**\n * Creates a clone of the chain sequence planting `value` as the wrapped value.\n *\n * @name plant\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @param {*} value The value to plant.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2]).map(square);\n * var other = wrapped.plant([3, 4]);\n *\n * other.value();\n * // => [9, 16]\n *\n * wrapped.value();\n * // => [1, 4]\n */\n function wrapperPlant(value) {\n var result,\n parent = this;\n\n while (parent instanceof baseLodash) {\n var clone = wrapperClone(parent);\n clone.__index__ = 0;\n clone.__values__ = undefined;\n if (result) {\n previous.__wrapped__ = clone;\n } else {\n result = clone;\n }\n var previous = clone;\n parent = parent.__wrapped__;\n }\n previous.__wrapped__ = value;\n return result;\n }\n\n /**\n * This method is the wrapper version of `_.reverse`.\n *\n * **Note:** This method mutates the wrapped array.\n *\n * @name reverse\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _(array).reverse().value()\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function wrapperReverse() {\n var value = this.__wrapped__;\n if (value instanceof LazyWrapper) {\n var wrapped = value;\n if (this.__actions__.length) {\n wrapped = new LazyWrapper(this);\n }\n wrapped = wrapped.reverse();\n wrapped.__actions__.push({\n 'func': thru,\n 'args': [reverse],\n 'thisArg': undefined\n });\n return new LodashWrapper(wrapped, this.__chain__);\n }\n return this.thru(reverse);\n }\n\n /**\n * Executes the chain sequence to resolve the unwrapped value.\n *\n * @name value\n * @memberOf _\n * @since 0.1.0\n * @alias toJSON, valueOf\n * @category Seq\n * @returns {*} Returns the resolved unwrapped value.\n * @example\n *\n * _([1, 2, 3]).value();\n * // => [1, 2, 3]\n */\n function wrapperValue() {\n return baseWrapperValue(this.__wrapped__, this.__actions__);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the number of times the key was returned by `iteratee`. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.countBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': 1, '6': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.countBy(['one', 'two', 'three'], 'length');\n * // => { '3': 2, '5': 1 }\n */\n var countBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n ++result[key];\n } else {\n baseAssignValue(result, key, 1);\n }\n });\n\n /**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\n function every(collection, predicate, guard) {\n var func = isArray(collection) ? arrayEvery : baseEvery;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\n function filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\n var find = createFind(findIndex);\n\n /**\n * This method is like `_.find` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=collection.length-1] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * _.findLast([1, 2, 3, 4], function(n) {\n * return n % 2 == 1;\n * });\n * // => 3\n */\n var findLast = createFind(findLastIndex);\n\n /**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMap(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), 1);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDeep([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMapDeep(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), INFINITY);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDepth([1, 2], duplicate, 2);\n * // => [[1, 1], [2, 2]]\n */\n function flatMapDepth(collection, iteratee, depth) {\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(map(collection, iteratee), depth);\n }\n\n /**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forEach` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @alias eachRight\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEach\n * @example\n *\n * _.forEachRight([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `2` then `1`.\n */\n function forEachRight(collection, iteratee) {\n var func = isArray(collection) ? arrayEachRight : baseEachRight;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The order of grouped values\n * is determined by the order they occur in `collection`. The corresponding\n * value of each key is an array of elements responsible for generating the\n * key. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': [4.2], '6': [6.1, 6.3] }\n *\n * // The `_.property` iteratee shorthand.\n * _.groupBy(['one', 'two', 'three'], 'length');\n * // => { '3': ['one', 'two'], '5': ['three'] }\n */\n var groupBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n result[key].push(value);\n } else {\n baseAssignValue(result, key, [value]);\n }\n });\n\n /**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\n function includes(collection, value, fromIndex, guard) {\n collection = isArrayLike(collection) ? collection : values(collection);\n fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n var length = collection.length;\n if (fromIndex < 0) {\n fromIndex = nativeMax(length + fromIndex, 0);\n }\n return isString(collection)\n ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n }\n\n /**\n * Invokes the method at `path` of each element in `collection`, returning\n * an array of the results of each invoked method. Any additional arguments\n * are provided to each invoked method. If `path` is a function, it's invoked\n * for, and `this` bound to, each element in `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array|Function|string} path The path of the method to invoke or\n * the function invoked per iteration.\n * @param {...*} [args] The arguments to invoke each method with.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n * // => [[1, 5, 7], [1, 2, 3]]\n *\n * _.invokeMap([123, 456], String.prototype.split, '');\n * // => [['1', '2', '3'], ['4', '5', '6']]\n */\n var invokeMap = baseRest(function(collection, path, args) {\n var index = -1,\n isFunc = typeof path == 'function',\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value) {\n result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n });\n return result;\n });\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the last element responsible for generating the key. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * var array = [\n * { 'dir': 'left', 'code': 97 },\n * { 'dir': 'right', 'code': 100 }\n * ];\n *\n * _.keyBy(array, function(o) {\n * return String.fromCharCode(o.code);\n * });\n * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n *\n * _.keyBy(array, 'dir');\n * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n */\n var keyBy = createAggregator(function(result, value, key) {\n baseAssignValue(result, key, value);\n });\n\n /**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\n function map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.sortBy` except that it allows specifying the sort\n * orders of the iteratees to sort by. If `orders` is unspecified, all values\n * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n * descending or \"asc\" for ascending sort order of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @param {string[]} [orders] The sort orders of `iteratees`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 34 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'barney', 'age': 36 }\n * ];\n *\n * // Sort by `user` in ascending order and by `age` in descending order.\n * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n */\n function orderBy(collection, iteratees, orders, guard) {\n if (collection == null) {\n return [];\n }\n if (!isArray(iteratees)) {\n iteratees = iteratees == null ? [] : [iteratees];\n }\n orders = guard ? undefined : orders;\n if (!isArray(orders)) {\n orders = orders == null ? [] : [orders];\n }\n return baseOrderBy(collection, iteratees, orders);\n }\n\n /**\n * Creates an array of elements split into two groups, the first of which\n * contains elements `predicate` returns truthy for, the second of which\n * contains elements `predicate` returns falsey for. The predicate is\n * invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of grouped elements.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true },\n * { 'user': 'pebbles', 'age': 1, 'active': false }\n * ];\n *\n * _.partition(users, function(o) { return o.active; });\n * // => objects for [['fred'], ['barney', 'pebbles']]\n *\n * // The `_.matches` iteratee shorthand.\n * _.partition(users, { 'age': 1, 'active': false });\n * // => objects for [['pebbles'], ['barney', 'fred']]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.partition(users, ['active', false]);\n * // => objects for [['barney', 'pebbles'], ['fred']]\n *\n * // The `_.property` iteratee shorthand.\n * _.partition(users, 'active');\n * // => objects for [['fred'], ['barney', 'pebbles']]\n */\n var partition = createAggregator(function(result, value, key) {\n result[key ? 0 : 1].push(value);\n }, function() { return [[], []]; });\n\n /**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n * return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\n function reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n }\n\n /**\n * This method is like `_.reduce` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduce\n * @example\n *\n * var array = [[0, 1], [2, 3], [4, 5]];\n *\n * _.reduceRight(array, function(flattened, other) {\n * return flattened.concat(other);\n * }, []);\n * // => [4, 5, 2, 3, 0, 1]\n */\n function reduceRight(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduceRight : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n }\n\n /**\n * The opposite of `_.filter`; this method returns the elements of `collection`\n * that `predicate` does **not** return truthy for.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.filter\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true }\n * ];\n *\n * _.reject(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.reject(users, { 'age': 40, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.reject(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.reject(users, 'active');\n * // => objects for ['barney']\n */\n function reject(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, negate(getIteratee(predicate, 3)));\n }\n\n /**\n * Gets a random element from `collection`.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n * @example\n *\n * _.sample([1, 2, 3, 4]);\n * // => 2\n */\n function sample(collection) {\n var func = isArray(collection) ? arraySample : baseSample;\n return func(collection);\n }\n\n /**\n * Gets `n` random elements at unique keys from `collection` up to the\n * size of `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @param {number} [n=1] The number of elements to sample.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the random elements.\n * @example\n *\n * _.sampleSize([1, 2, 3], 2);\n * // => [3, 1]\n *\n * _.sampleSize([1, 2, 3], 4);\n * // => [2, 3, 1]\n */\n function sampleSize(collection, n, guard) {\n if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n return func(collection, n);\n }\n\n /**\n * Creates an array of shuffled values, using a version of the\n * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n * @example\n *\n * _.shuffle([1, 2, 3, 4]);\n * // => [4, 1, 3, 2]\n */\n function shuffle(collection) {\n var func = isArray(collection) ? arrayShuffle : baseShuffle;\n return func(collection);\n }\n\n /**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\n function size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag || tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n }\n\n /**\n * Checks if `predicate` returns truthy for **any** element of `collection`.\n * Iteration is stopped once `predicate` returns truthy. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n * @example\n *\n * _.some([null, 0, 'yes', false], Boolean);\n * // => true\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.some(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.some(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.some(users, 'active');\n * // => true\n */\n function some(collection, predicate, guard) {\n var func = isArray(collection) ? arraySome : baseSome;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 30 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\n var sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\n var now = ctxNow || function() {\n return root.Date.now();\n };\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The opposite of `_.before`; this method creates a function that invokes\n * `func` once it's called `n` or more times.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {number} n The number of calls before `func` is invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var saves = ['profile', 'settings'];\n *\n * var done = _.after(saves.length, function() {\n * console.log('done saving!');\n * });\n *\n * _.forEach(saves, function(type) {\n * asyncSave({ 'type': type, 'complete': done });\n * });\n * // => Logs 'done saving!' after the two async saves have completed.\n */\n function after(n, func) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n < 1) {\n return func.apply(this, arguments);\n }\n };\n }\n\n /**\n * Creates a function that invokes `func`, with up to `n` arguments,\n * ignoring any additional arguments.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @param {number} [n=func.length] The arity cap.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n * // => [6, 8, 10]\n */\n function ary(func, n, guard) {\n n = guard ? undefined : n;\n n = (func && n == null) ? func.length : n;\n return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n }\n\n /**\n * Creates a function that invokes `func`, with the `this` binding and arguments\n * of the created function, while it's called less than `n` times. Subsequent\n * calls to the created function return the result of the last `func` invocation.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {number} n The number of calls at which `func` is no longer invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * jQuery(element).on('click', _.before(5, addContactToList));\n * // => Allows adding up to 4 contacts to the list.\n */\n function before(n, func) {\n var result;\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n > 0) {\n result = func.apply(this, arguments);\n }\n if (n <= 1) {\n func = undefined;\n }\n return result;\n };\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of `thisArg`\n * and `partials` prepended to the arguments it receives.\n *\n * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for partially applied arguments.\n *\n * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n * property of bound functions.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to bind.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * function greet(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n *\n * var object = { 'user': 'fred' };\n *\n * var bound = _.bind(greet, object, 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bind(greet, object, _, '!');\n * bound('hi');\n * // => 'hi fred!'\n */\n var bind = baseRest(function(func, thisArg, partials) {\n var bitmask = WRAP_BIND_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bind));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(func, bitmask, thisArg, partials, holders);\n });\n\n /**\n * Creates a function that invokes the method at `object[key]` with `partials`\n * prepended to the arguments it receives.\n *\n * This method differs from `_.bind` by allowing bound functions to reference\n * methods that may be redefined or don't yet exist. See\n * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n * for more details.\n *\n * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Function\n * @param {Object} object The object to invoke the method on.\n * @param {string} key The key of the method.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * var object = {\n * 'user': 'fred',\n * 'greet': function(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n * };\n *\n * var bound = _.bindKey(object, 'greet', 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * object.greet = function(greeting, punctuation) {\n * return greeting + 'ya ' + this.user + punctuation;\n * };\n *\n * bound('!');\n * // => 'hiya fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bindKey(object, 'greet', _, '!');\n * bound('hi');\n * // => 'hiya fred!'\n */\n var bindKey = baseRest(function(object, key, partials) {\n var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bindKey));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(key, bitmask, object, partials, holders);\n });\n\n /**\n * Creates a function that accepts arguments of `func` and either invokes\n * `func` returning its result, if at least `arity` number of arguments have\n * been provided, or returns a function that accepts the remaining `func`\n * arguments, and so on. The arity of `func` may be specified if `func.length`\n * is not sufficient.\n *\n * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curry(abc);\n *\n * curried(1)(2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(1)(_, 3)(2);\n * // => [1, 2, 3]\n */\n function curry(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curry.placeholder;\n return result;\n }\n\n /**\n * This method is like `_.curry` except that arguments are applied to `func`\n * in the manner of `_.partialRight` instead of `_.partial`.\n *\n * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curryRight(abc);\n *\n * curried(3)(2)(1);\n * // => [1, 2, 3]\n *\n * curried(2, 3)(1);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(3)(1, _)(2);\n * // => [1, 2, 3]\n */\n function curryRight(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curryRight.placeholder;\n return result;\n }\n\n /**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n * Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n * The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n * 'leading': true,\n * 'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\n function debounce(func, wait, options) {\n var lastArgs,\n lastThis,\n maxWait,\n result,\n timerId,\n lastCallTime,\n lastInvokeTime = 0,\n leading = false,\n maxing = false,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n wait = toNumber(wait) || 0;\n if (isObject(options)) {\n leading = !!options.leading;\n maxing = 'maxWait' in options;\n maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n\n function invokeFunc(time) {\n var args = lastArgs,\n thisArg = lastThis;\n\n lastArgs = lastThis = undefined;\n lastInvokeTime = time;\n result = func.apply(thisArg, args);\n return result;\n }\n\n function leadingEdge(time) {\n // Reset any `maxWait` timer.\n lastInvokeTime = time;\n // Start the timer for the trailing edge.\n timerId = setTimeout(timerExpired, wait);\n // Invoke the leading edge.\n return leading ? invokeFunc(time) : result;\n }\n\n function remainingWait(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime,\n timeWaiting = wait - timeSinceLastCall;\n\n return maxing\n ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n : timeWaiting;\n }\n\n function shouldInvoke(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime;\n\n // Either this is the first call, activity has stopped and we're at the\n // trailing edge, the system time has gone backwards and we're treating\n // it as the trailing edge, or we've hit the `maxWait` limit.\n return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n }\n\n function timerExpired() {\n var time = now();\n if (shouldInvoke(time)) {\n return trailingEdge(time);\n }\n // Restart the timer.\n timerId = setTimeout(timerExpired, remainingWait(time));\n }\n\n function trailingEdge(time) {\n timerId = undefined;\n\n // Only invoke if we have `lastArgs` which means `func` has been\n // debounced at least once.\n if (trailing && lastArgs) {\n return invokeFunc(time);\n }\n lastArgs = lastThis = undefined;\n return result;\n }\n\n function cancel() {\n if (timerId !== undefined) {\n clearTimeout(timerId);\n }\n lastInvokeTime = 0;\n lastArgs = lastCallTime = lastThis = timerId = undefined;\n }\n\n function flush() {\n return timerId === undefined ? result : trailingEdge(now());\n }\n\n function debounced() {\n var time = now(),\n isInvoking = shouldInvoke(time);\n\n lastArgs = arguments;\n lastThis = this;\n lastCallTime = time;\n\n if (isInvoking) {\n if (timerId === undefined) {\n return leadingEdge(lastCallTime);\n }\n if (maxing) {\n // Handle invocations in a tight loop.\n clearTimeout(timerId);\n timerId = setTimeout(timerExpired, wait);\n return invokeFunc(lastCallTime);\n }\n }\n if (timerId === undefined) {\n timerId = setTimeout(timerExpired, wait);\n }\n return result;\n }\n debounced.cancel = cancel;\n debounced.flush = flush;\n return debounced;\n }\n\n /**\n * Defers invoking the `func` until the current call stack has cleared. Any\n * additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to defer.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.defer(function(text) {\n * console.log(text);\n * }, 'deferred');\n * // => Logs 'deferred' after one millisecond.\n */\n var defer = baseRest(function(func, args) {\n return baseDelay(func, 1, args);\n });\n\n /**\n * Invokes `func` after `wait` milliseconds. Any additional arguments are\n * provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.delay(function(text) {\n * console.log(text);\n * }, 1000, 'later');\n * // => Logs 'later' after one second.\n */\n var delay = baseRest(function(func, wait, args) {\n return baseDelay(func, toNumber(wait) || 0, args);\n });\n\n /**\n * Creates a function that invokes `func` with arguments reversed.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to flip arguments for.\n * @returns {Function} Returns the new flipped function.\n * @example\n *\n * var flipped = _.flip(function() {\n * return _.toArray(arguments);\n * });\n *\n * flipped('a', 'b', 'c', 'd');\n * // => ['d', 'c', 'b', 'a']\n */\n function flip(func) {\n return createWrap(func, WRAP_FLIP_FLAG);\n }\n\n /**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\n function memoize(func, resolver) {\n if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) || cache;\n return result;\n };\n memoized.cache = new (memoize.Cache || MapCache);\n return memoized;\n }\n\n // Expose `MapCache`.\n memoize.Cache = MapCache;\n\n /**\n * Creates a function that negates the result of the predicate `func`. The\n * `func` predicate is invoked with the `this` binding and arguments of the\n * created function.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} predicate The predicate to negate.\n * @returns {Function} Returns the new negated function.\n * @example\n *\n * function isEven(n) {\n * return n % 2 == 0;\n * }\n *\n * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n * // => [1, 3, 5]\n */\n function negate(predicate) {\n if (typeof predicate != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return function() {\n var args = arguments;\n switch (args.length) {\n case 0: return !predicate.call(this);\n case 1: return !predicate.call(this, args[0]);\n case 2: return !predicate.call(this, args[0], args[1]);\n case 3: return !predicate.call(this, args[0], args[1], args[2]);\n }\n return !predicate.apply(this, args);\n };\n }\n\n /**\n * Creates a function that is restricted to invoking `func` once. Repeat calls\n * to the function return the value of the first invocation. The `func` is\n * invoked with the `this` binding and arguments of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var initialize = _.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n */\n function once(func) {\n return before(2, func);\n }\n\n /**\n * Creates a function that invokes `func` with its arguments transformed.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Function\n * @param {Function} func The function to wrap.\n * @param {...(Function|Function[])} [transforms=[_.identity]]\n * The argument transforms.\n * @returns {Function} Returns the new function.\n * @example\n *\n * function doubled(n) {\n * return n * 2;\n * }\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var func = _.overArgs(function(x, y) {\n * return [x, y];\n * }, [square, doubled]);\n *\n * func(9, 3);\n * // => [81, 6]\n *\n * func(10, 5);\n * // => [100, 10]\n */\n var overArgs = castRest(function(func, transforms) {\n transforms = (transforms.length == 1 && isArray(transforms[0]))\n ? arrayMap(transforms[0], baseUnary(getIteratee()))\n : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n var funcsLength = transforms.length;\n return baseRest(function(args) {\n var index = -1,\n length = nativeMin(args.length, funcsLength);\n\n while (++index < length) {\n args[index] = transforms[index].call(this, args[index]);\n }\n return apply(func, this, args);\n });\n });\n\n /**\n * Creates a function that invokes `func` with `partials` prepended to the\n * arguments it receives. This method is like `_.bind` except it does **not**\n * alter the `this` binding.\n *\n * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 0.2.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var sayHelloTo = _.partial(greet, 'hello');\n * sayHelloTo('fred');\n * // => 'hello fred'\n *\n * // Partially applied with placeholders.\n * var greetFred = _.partial(greet, _, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n */\n var partial = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partial));\n return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n });\n\n /**\n * This method is like `_.partial` except that partially applied arguments\n * are appended to the arguments it receives.\n *\n * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var greetFred = _.partialRight(greet, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n *\n * // Partially applied with placeholders.\n * var sayHelloTo = _.partialRight(greet, 'hello', _);\n * sayHelloTo('fred');\n * // => 'hello fred'\n */\n var partialRight = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partialRight));\n return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n });\n\n /**\n * Creates a function that invokes `func` with arguments arranged according\n * to the specified `indexes` where the argument value at the first index is\n * provided as the first argument, the argument value at the second index is\n * provided as the second argument, and so on.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to rearrange arguments for.\n * @param {...(number|number[])} indexes The arranged argument indexes.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var rearged = _.rearg(function(a, b, c) {\n * return [a, b, c];\n * }, [2, 0, 1]);\n *\n * rearged('b', 'c', 'a')\n * // => ['a', 'b', 'c']\n */\n var rearg = flatRest(function(func, indexes) {\n return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n });\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * created function and arguments from `start` and beyond provided as\n * an array.\n *\n * **Note:** This method is based on the\n * [rest parameter](https://mdn.io/rest_parameters).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.rest(function(what, names) {\n * return what + ' ' + _.initial(names).join(', ') +\n * (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n * });\n *\n * say('hello', 'fred', 'barney', 'pebbles');\n * // => 'hello fred, barney, & pebbles'\n */\n function rest(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start === undefined ? start : toInteger(start);\n return baseRest(func, start);\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * create function and an array of arguments much like\n * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n *\n * **Note:** This method is based on the\n * [spread operator](https://mdn.io/spread_operator).\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Function\n * @param {Function} func The function to spread arguments over.\n * @param {number} [start=0] The start position of the spread.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.spread(function(who, what) {\n * return who + ' says ' + what;\n * });\n *\n * say(['fred', 'hello']);\n * // => 'fred says hello'\n *\n * var numbers = Promise.all([\n * Promise.resolve(40),\n * Promise.resolve(36)\n * ]);\n *\n * numbers.then(_.spread(function(x, y) {\n * return x + y;\n * }));\n * // => a Promise of 76\n */\n function spread(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start == null ? 0 : nativeMax(toInteger(start), 0);\n return baseRest(function(args) {\n var array = args[start],\n otherArgs = castSlice(args, 0, start);\n\n if (array) {\n arrayPush(otherArgs, array);\n }\n return apply(func, this, otherArgs);\n });\n }\n\n /**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n * Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\n function throttle(func, wait, options) {\n var leading = true,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (isObject(options)) {\n leading = 'leading' in options ? !!options.leading : leading;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n return debounce(func, wait, {\n 'leading': leading,\n 'maxWait': wait,\n 'trailing': trailing\n });\n }\n\n /**\n * Creates a function that accepts up to one argument, ignoring any\n * additional arguments.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.unary(parseInt));\n * // => [6, 8, 10]\n */\n function unary(func) {\n return ary(func, 1);\n }\n\n /**\n * Creates a function that provides `value` to `wrapper` as its first\n * argument. Any additional arguments provided to the function are appended\n * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n * binding of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {*} value The value to wrap.\n * @param {Function} [wrapper=identity] The wrapper function.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var p = _.wrap(_.escape, function(func, text) {\n * return '<p>' + func(text) + '</p>';\n * });\n *\n * p('fred, barney, & pebbles');\n * // => '<p>fred, barney, &amp; pebbles</p>'\n */\n function wrap(value, wrapper) {\n return partial(castFunction(wrapper), value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Casts `value` as an array if it's not one.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Lang\n * @param {*} value The value to inspect.\n * @returns {Array} Returns the cast array.\n * @example\n *\n * _.castArray(1);\n * // => [1]\n *\n * _.castArray({ 'a': 1 });\n * // => [{ 'a': 1 }]\n *\n * _.castArray('abc');\n * // => ['abc']\n *\n * _.castArray(null);\n * // => [null]\n *\n * _.castArray(undefined);\n * // => [undefined]\n *\n * _.castArray();\n * // => []\n *\n * var array = [1, 2, 3];\n * console.log(_.castArray(array) === array);\n * // => true\n */\n function castArray() {\n if (!arguments.length) {\n return [];\n }\n var value = arguments[0];\n return isArray(value) ? value : [value];\n }\n\n /**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\n function clone(value) {\n return baseClone(value, CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.clone` except that it accepts `customizer` which\n * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n * cloning is handled by the method instead. The `customizer` is invoked with\n * up to four arguments; (value [, index|key, object, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeepWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(false);\n * }\n * }\n *\n * var el = _.cloneWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 0\n */\n function cloneWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\n function cloneDeep(value) {\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.cloneWith` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the deep cloned value.\n * @see _.cloneWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(true);\n * }\n * }\n *\n * var el = _.cloneDeepWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 20\n */\n function cloneDeepWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * Checks if `object` conforms to `source` by invoking the predicate\n * properties of `source` with the corresponding property values of `object`.\n *\n * **Note:** This method is equivalent to `_.conforms` when `source` is\n * partially applied.\n *\n * @static\n * @memberOf _\n * @since 4.14.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n * // => true\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n * // => false\n */\n function conformsTo(object, source) {\n return source == null || baseConformsTo(object, source, keys(source));\n }\n\n /**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\n function eq(value, other) {\n return value === other || (value !== value && other !== other);\n }\n\n /**\n * Checks if `value` is greater than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n * @see _.lt\n * @example\n *\n * _.gt(3, 1);\n * // => true\n *\n * _.gt(3, 3);\n * // => false\n *\n * _.gt(1, 3);\n * // => false\n */\n var gt = createRelationalOperation(baseGt);\n\n /**\n * Checks if `value` is greater than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than or equal to\n * `other`, else `false`.\n * @see _.lte\n * @example\n *\n * _.gte(3, 1);\n * // => true\n *\n * _.gte(3, 3);\n * // => true\n *\n * _.gte(1, 3);\n * // => false\n */\n var gte = createRelationalOperation(function(value, other) {\n return value >= other;\n });\n\n /**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\n var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n };\n\n /**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\n var isArray = Array.isArray;\n\n /**\n * Checks if `value` is classified as an `ArrayBuffer` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n * @example\n *\n * _.isArrayBuffer(new ArrayBuffer(2));\n * // => true\n *\n * _.isArrayBuffer(new Array(2));\n * // => false\n */\n var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\n\n /**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\n function isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n }\n\n /**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\n function isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n }\n\n /**\n * Checks if `value` is classified as a boolean primitive or object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\n * @example\n *\n * _.isBoolean(false);\n * // => true\n *\n * _.isBoolean(null);\n * // => false\n */\n function isBoolean(value) {\n return value === true || value === false ||\n (isObjectLike(value) && baseGetTag(value) == boolTag);\n }\n\n /**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\n var isBuffer = nativeIsBuffer || stubFalse;\n\n /**\n * Checks if `value` is classified as a `Date` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n * @example\n *\n * _.isDate(new Date);\n * // => true\n *\n * _.isDate('Mon April 23 2012');\n * // => false\n */\n var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n /**\n * Checks if `value` is likely a DOM element.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\n * @example\n *\n * _.isElement(document.body);\n * // => true\n *\n * _.isElement('<body>');\n * // => false\n */\n function isElement(value) {\n return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n }\n\n /**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\n function isEmpty(value) {\n if (value == null) {\n return true;\n }\n if (isArrayLike(value) &&\n (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n return !value.length;\n }\n var tag = getTag(value);\n if (tag == mapTag || tag == setTag) {\n return !value.size;\n }\n if (isPrototype(value)) {\n return !baseKeys(value).length;\n }\n for (var key in value) {\n if (hasOwnProperty.call(value, key)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\n function isEqual(value, other) {\n return baseIsEqual(value, other);\n }\n\n /**\n * This method is like `_.isEqual` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with up to\n * six arguments: (objValue, othValue [, index|key, object, other, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, othValue) {\n * if (isGreeting(objValue) && isGreeting(othValue)) {\n * return true;\n * }\n * }\n *\n * var array = ['hello', 'goodbye'];\n * var other = ['hi', 'goodbye'];\n *\n * _.isEqualWith(array, other, customizer);\n * // => true\n */\n function isEqualWith(value, other, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n var result = customizer ? customizer(value, other) : undefined;\n return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n }\n\n /**\n * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n * `SyntaxError`, `TypeError`, or `URIError` object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\n * @example\n *\n * _.isError(new Error);\n * // => true\n *\n * _.isError(Error);\n * // => false\n */\n function isError(value) {\n if (!isObjectLike(value)) {\n return false;\n }\n var tag = baseGetTag(value);\n return tag == errorTag || tag == domExcTag ||\n (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n }\n\n /**\n * Checks if `value` is a finite primitive number.\n *\n * **Note:** This method is based on\n * [`Number.isFinite`](https://mdn.io/Number/isFinite).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\n * @example\n *\n * _.isFinite(3);\n * // => true\n *\n * _.isFinite(Number.MIN_VALUE);\n * // => true\n *\n * _.isFinite(Infinity);\n * // => false\n *\n * _.isFinite('3');\n * // => false\n */\n function isFinite(value) {\n return typeof value == 'number' && nativeIsFinite(value);\n }\n\n /**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\n function isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n }\n\n /**\n * Checks if `value` is an integer.\n *\n * **Note:** This method is based on\n * [`Number.isInteger`](https://mdn.io/Number/isInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\n * @example\n *\n * _.isInteger(3);\n * // => true\n *\n * _.isInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isInteger(Infinity);\n * // => false\n *\n * _.isInteger('3');\n * // => false\n */\n function isInteger(value) {\n return typeof value == 'number' && value == toInteger(value);\n }\n\n /**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\n function isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\n function isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' || type == 'function');\n }\n\n /**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\n function isObjectLike(value) {\n return value != null && typeof value == 'object';\n }\n\n /**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\n var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n /**\n * Performs a partial deep comparison between `object` and `source` to\n * determine if `object` contains equivalent property values.\n *\n * **Note:** This method is equivalent to `_.matches` when `source` is\n * partially applied.\n *\n * Partial comparisons will match empty array and empty object `source`\n * values against any array or object value, respectively. See `_.isEqual`\n * for a list of supported value comparisons.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.isMatch(object, { 'b': 2 });\n * // => true\n *\n * _.isMatch(object, { 'b': 1 });\n * // => false\n */\n function isMatch(object, source) {\n return object === source || baseIsMatch(object, source, getMatchData(source));\n }\n\n /**\n * This method is like `_.isMatch` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with five\n * arguments: (objValue, srcValue, index|key, object, source).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, srcValue) {\n * if (isGreeting(objValue) && isGreeting(srcValue)) {\n * return true;\n * }\n * }\n *\n * var object = { 'greeting': 'hello' };\n * var source = { 'greeting': 'hi' };\n *\n * _.isMatchWith(object, source, customizer);\n * // => true\n */\n function isMatchWith(object, source, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseIsMatch(object, source, getMatchData(source), customizer);\n }\n\n /**\n * Checks if `value` is `NaN`.\n *\n * **Note:** This method is based on\n * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n * `undefined` and other non-number values.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n * @example\n *\n * _.isNaN(NaN);\n * // => true\n *\n * _.isNaN(new Number(NaN));\n * // => true\n *\n * isNaN(undefined);\n * // => true\n *\n * _.isNaN(undefined);\n * // => false\n */\n function isNaN(value) {\n // An `NaN` primitive is the only value that is not equal to itself.\n // Perform the `toStringTag` check first to avoid errors with some\n // ActiveX objects in IE.\n return isNumber(value) && value != +value;\n }\n\n /**\n * Checks if `value` is a pristine native function.\n *\n * **Note:** This method can't reliably detect native functions in the presence\n * of the core-js package because core-js circumvents this kind of detection.\n * Despite multiple requests, the core-js maintainer has made it clear: any\n * attempt to fix the detection will be obstructed. As a result, we're left\n * with little choice but to throw an error. Unfortunately, this also affects\n * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n * which rely on core-js.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n * @example\n *\n * _.isNative(Array.prototype.push);\n * // => true\n *\n * _.isNative(_);\n * // => false\n */\n function isNative(value) {\n if (isMaskable(value)) {\n throw new Error(CORE_ERROR_TEXT);\n }\n return baseIsNative(value);\n }\n\n /**\n * Checks if `value` is `null`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n * @example\n *\n * _.isNull(null);\n * // => true\n *\n * _.isNull(void 0);\n * // => false\n */\n function isNull(value) {\n return value === null;\n }\n\n /**\n * Checks if `value` is `null` or `undefined`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is nullish, else `false`.\n * @example\n *\n * _.isNil(null);\n * // => true\n *\n * _.isNil(void 0);\n * // => true\n *\n * _.isNil(NaN);\n * // => false\n */\n function isNil(value) {\n return value == null;\n }\n\n /**\n * Checks if `value` is classified as a `Number` primitive or object.\n *\n * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n * classified as numbers, use the `_.isFinite` method.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n * @example\n *\n * _.isNumber(3);\n * // => true\n *\n * _.isNumber(Number.MIN_VALUE);\n * // => true\n *\n * _.isNumber(Infinity);\n * // => true\n *\n * _.isNumber('3');\n * // => false\n */\n function isNumber(value) {\n return typeof value == 'number' ||\n (isObjectLike(value) && baseGetTag(value) == numberTag);\n }\n\n /**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\n function isPlainObject(value) {\n if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n return false;\n }\n var proto = getPrototype(value);\n if (proto === null) {\n return true;\n }\n var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n funcToString.call(Ctor) == objectCtorString;\n }\n\n /**\n * Checks if `value` is classified as a `RegExp` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n * @example\n *\n * _.isRegExp(/abc/);\n * // => true\n *\n * _.isRegExp('/abc/');\n * // => false\n */\n var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n /**\n * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n * double precision number which isn't the result of a rounded unsafe integer.\n *\n * **Note:** This method is based on\n * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.\n * @example\n *\n * _.isSafeInteger(3);\n * // => true\n *\n * _.isSafeInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isSafeInteger(Infinity);\n * // => false\n *\n * _.isSafeInteger('3');\n * // => false\n */\n function isSafeInteger(value) {\n return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\n var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\n /**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\n function isString(value) {\n return typeof value == 'string' ||\n (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n }\n\n /**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\n function isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n }\n\n /**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\n var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n /**\n * Checks if `value` is `undefined`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n *\n * _.isUndefined(void 0);\n * // => true\n *\n * _.isUndefined(null);\n * // => false\n */\n function isUndefined(value) {\n return value === undefined;\n }\n\n /**\n * Checks if `value` is classified as a `WeakMap` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.\n * @example\n *\n * _.isWeakMap(new WeakMap);\n * // => true\n *\n * _.isWeakMap(new Map);\n * // => false\n */\n function isWeakMap(value) {\n return isObjectLike(value) && getTag(value) == weakMapTag;\n }\n\n /**\n * Checks if `value` is classified as a `WeakSet` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.\n * @example\n *\n * _.isWeakSet(new WeakSet);\n * // => true\n *\n * _.isWeakSet(new Set);\n * // => false\n */\n function isWeakSet(value) {\n return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n }\n\n /**\n * Checks if `value` is less than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n * @see _.gt\n * @example\n *\n * _.lt(1, 3);\n * // => true\n *\n * _.lt(3, 3);\n * // => false\n *\n * _.lt(3, 1);\n * // => false\n */\n var lt = createRelationalOperation(baseLt);\n\n /**\n * Checks if `value` is less than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than or equal to\n * `other`, else `false`.\n * @see _.gte\n * @example\n *\n * _.lte(1, 3);\n * // => true\n *\n * _.lte(3, 3);\n * // => true\n *\n * _.lte(3, 1);\n * // => false\n */\n var lte = createRelationalOperation(function(value, other) {\n return value <= other;\n });\n\n /**\n * Converts `value` to an array.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Array} Returns the converted array.\n * @example\n *\n * _.toArray({ 'a': 1, 'b': 2 });\n * // => [1, 2]\n *\n * _.toArray('abc');\n * // => ['a', 'b', 'c']\n *\n * _.toArray(1);\n * // => []\n *\n * _.toArray(null);\n * // => []\n */\n function toArray(value) {\n if (!value) {\n return [];\n }\n if (isArrayLike(value)) {\n return isString(value) ? stringToArray(value) : copyArray(value);\n }\n if (symIterator && value[symIterator]) {\n return iteratorToArray(value[symIterator]());\n }\n var tag = getTag(value),\n func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n return func(value);\n }\n\n /**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\n function toFinite(value) {\n if (!value) {\n return value === 0 ? value : 0;\n }\n value = toNumber(value);\n if (value === INFINITY || value === -INFINITY) {\n var sign = (value < 0 ? -1 : 1);\n return sign * MAX_INTEGER;\n }\n return value === value ? value : 0;\n }\n\n /**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\n function toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n }\n\n /**\n * Converts `value` to an integer suitable for use as the length of an\n * array-like object.\n *\n * **Note:** This method is based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toLength(3.2);\n * // => 3\n *\n * _.toLength(Number.MIN_VALUE);\n * // => 0\n *\n * _.toLength(Infinity);\n * // => 4294967295\n *\n * _.toLength('3.2');\n * // => 3\n */\n function toLength(value) {\n return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n }\n\n /**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\n function toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = baseTrim(value);\n var isBinary = reIsBinary.test(value);\n return (isBinary || reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n }\n\n /**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\n function toPlainObject(value) {\n return copyObject(value, keysIn(value));\n }\n\n /**\n * Converts `value` to a safe integer. A safe integer can be compared and\n * represented correctly.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toSafeInteger(3.2);\n * // => 3\n *\n * _.toSafeInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toSafeInteger(Infinity);\n * // => 9007199254740991\n *\n * _.toSafeInteger('3.2');\n * // => 3\n */\n function toSafeInteger(value) {\n return value\n ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n : (value === 0 ? value : 0);\n }\n\n /**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\n function toString(value) {\n return value == null ? '' : baseToString(value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Assigns own enumerable string keyed properties of source objects to the\n * destination object. Source objects are applied from left to right.\n * Subsequent sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object` and is loosely based on\n * [`Object.assign`](https://mdn.io/Object/assign).\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assignIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assign({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'c': 3 }\n */\n var assign = createAssigner(function(object, source) {\n if (isPrototype(source) || isArrayLike(source)) {\n copyObject(source, keys(source), object);\n return;\n }\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n assignValue(object, key, source[key]);\n }\n }\n });\n\n /**\n * This method is like `_.assign` except that it iterates over own and\n * inherited source properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extend\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assign\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n */\n var assignIn = createAssigner(function(object, source) {\n copyObject(source, keysIn(source), object);\n });\n\n /**\n * This method is like `_.assignIn` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extendWith\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignInWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keysIn(source), object, customizer);\n });\n\n /**\n * This method is like `_.assign` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignInWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keys(source), object, customizer);\n });\n\n /**\n * Creates an array of values corresponding to `paths` of `object`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Array} Returns the picked values.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _.at(object, ['a[0].b.c', 'a[1]']);\n * // => [3, 4]\n */\n var at = flatRest(baseAt);\n\n /**\n * Creates an object that inherits from the `prototype` object. If a\n * `properties` object is given, its own enumerable string keyed properties\n * are assigned to the created object.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Object\n * @param {Object} prototype The object to inherit from.\n * @param {Object} [properties] The properties to assign to the object.\n * @returns {Object} Returns the new object.\n * @example\n *\n * function Shape() {\n * this.x = 0;\n * this.y = 0;\n * }\n *\n * function Circle() {\n * Shape.call(this);\n * }\n *\n * Circle.prototype = _.create(Shape.prototype, {\n * 'constructor': Circle\n * });\n *\n * var circle = new Circle;\n * circle instanceof Circle;\n * // => true\n *\n * circle instanceof Shape;\n * // => true\n */\n function create(prototype, properties) {\n var result = baseCreate(prototype);\n return properties == null ? result : baseAssign(result, properties);\n }\n\n /**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var defaults = baseRest(function(object, sources) {\n object = Object(object);\n\n var index = -1;\n var length = sources.length;\n var guard = length > 2 ? sources[2] : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n length = 1;\n }\n\n while (++index < length) {\n var source = sources[index];\n var props = keysIn(source);\n var propsIndex = -1;\n var propsLength = props.length;\n\n while (++propsIndex < propsLength) {\n var key = props[propsIndex];\n var value = object[key];\n\n if (value === undefined ||\n (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n object[key] = source[key];\n }\n }\n }\n\n return object;\n });\n\n /**\n * This method is like `_.defaults` except that it recursively assigns\n * default properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaults\n * @example\n *\n * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n * // => { 'a': { 'b': 2, 'c': 3 } }\n */\n var defaultsDeep = baseRest(function(args) {\n args.push(undefined, customDefaultsMerge);\n return apply(mergeWith, undefined, args);\n });\n\n /**\n * This method is like `_.find` except that it returns the key of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findKey(users, function(o) { return o.age < 40; });\n * // => 'barney' (iteration order is not guaranteed)\n *\n * // The `_.matches` iteratee shorthand.\n * _.findKey(users, { 'age': 1, 'active': true });\n * // => 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findKey(users, 'active');\n * // => 'barney'\n */\n function findKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n }\n\n /**\n * This method is like `_.findKey` except that it iterates over elements of\n * a collection in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findLastKey(users, function(o) { return o.age < 40; });\n * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastKey(users, { 'age': 36, 'active': true });\n * // => 'barney'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastKey(users, 'active');\n * // => 'pebbles'\n */\n function findLastKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n }\n\n /**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\n function forIn(object, iteratee) {\n return object == null\n ? object\n : baseFor(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * This method is like `_.forIn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forInRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n */\n function forInRight(object, iteratee) {\n return object == null\n ? object\n : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * Iterates over own enumerable string keyed properties of an object and\n * invokes `iteratee` for each property. The iteratee is invoked with three\n * arguments: (value, key, object). Iteratee functions may exit iteration\n * early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwnRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forOwn(object, iteratee) {\n return object && baseForOwn(object, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forOwn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwnRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n */\n function forOwnRight(object, iteratee) {\n return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an array of function property names from own enumerable properties\n * of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functionsIn\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functions(new Foo);\n * // => ['a', 'b']\n */\n function functions(object) {\n return object == null ? [] : baseFunctions(object, keys(object));\n }\n\n /**\n * Creates an array of function property names from own and inherited\n * enumerable properties of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functions\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functionsIn(new Foo);\n * // => ['a', 'b', 'c']\n */\n function functionsIn(object) {\n return object == null ? [] : baseFunctions(object, keysIn(object));\n }\n\n /**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\n function get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n }\n\n /**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\n function has(object, path) {\n return object != null && hasPath(object, path, baseHas);\n }\n\n /**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\n function hasIn(object, path) {\n return object != null && hasPath(object, path, baseHasIn);\n }\n\n /**\n * Creates an object composed of the inverted keys and values of `object`.\n * If `object` contains duplicate values, subsequent values overwrite\n * property assignments of previous values.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Object\n * @param {Object} object The object to invert.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invert(object);\n * // => { '1': 'c', '2': 'b' }\n */\n var invert = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n result[value] = key;\n }, constant(identity));\n\n /**\n * This method is like `_.invert` except that the inverted object is generated\n * from the results of running each element of `object` thru `iteratee`. The\n * corresponding inverted value of each inverted key is an array of keys\n * responsible for generating the inverted value. The iteratee is invoked\n * with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Object\n * @param {Object} object The object to invert.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invertBy(object);\n * // => { '1': ['a', 'c'], '2': ['b'] }\n *\n * _.invertBy(object, function(value) {\n * return 'group' + value;\n * });\n * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n */\n var invertBy = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n if (hasOwnProperty.call(result, value)) {\n result[value].push(key);\n } else {\n result[value] = [key];\n }\n }, getIteratee);\n\n /**\n * Invokes the method at `path` of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n *\n * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n * // => [2, 3]\n */\n var invoke = baseRest(baseInvoke);\n\n /**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\n function keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n }\n\n /**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\n function keysIn(object) {\n return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n }\n\n /**\n * The opposite of `_.mapValues`; this method creates an object with the\n * same values as `object` and keys generated by running each own enumerable\n * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n * with three arguments: (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapValues\n * @example\n *\n * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n * return key + value;\n * });\n * // => { 'a1': 1, 'b2': 2 }\n */\n function mapKeys(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, iteratee(value, key, object), value);\n });\n return result;\n }\n\n /**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n * 'fred': { 'user': 'fred', 'age': 40 },\n * 'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\n function mapValues(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, key, iteratee(value, key, object));\n });\n return result;\n }\n\n /**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n * 'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n * 'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\n var merge = createAssigner(function(object, source, srcIndex) {\n baseMerge(object, source, srcIndex);\n });\n\n /**\n * This method is like `_.merge` except that it accepts `customizer` which\n * is invoked to produce the merged values of the destination and source\n * properties. If `customizer` returns `undefined`, merging is handled by the\n * method instead. The `customizer` is invoked with six arguments:\n * (objValue, srcValue, key, object, source, stack).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} customizer The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * function customizer(objValue, srcValue) {\n * if (_.isArray(objValue)) {\n * return objValue.concat(srcValue);\n * }\n * }\n *\n * var object = { 'a': [1], 'b': [2] };\n * var other = { 'a': [3], 'b': [4] };\n *\n * _.mergeWith(object, other, customizer);\n * // => { 'a': [1, 3], 'b': [2, 4] }\n */\n var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n baseMerge(object, source, srcIndex, customizer);\n });\n\n /**\n * The opposite of `_.pick`; this method creates an object composed of the\n * own and inherited enumerable property paths of `object` that are not omitted.\n *\n * **Note:** This method is considerably slower than `_.pick`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to omit.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omit(object, ['a', 'c']);\n * // => { 'b': '2' }\n */\n var omit = flatRest(function(object, paths) {\n var result = {};\n if (object == null) {\n return result;\n }\n var isDeep = false;\n paths = arrayMap(paths, function(path) {\n path = castPath(path, object);\n isDeep || (isDeep = path.length > 1);\n return path;\n });\n copyObject(object, getAllKeysIn(object), result);\n if (isDeep) {\n result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n }\n var length = paths.length;\n while (length--) {\n baseUnset(result, paths[length]);\n }\n return result;\n });\n\n /**\n * The opposite of `_.pickBy`; this method creates an object composed of\n * the own and inherited enumerable string keyed properties of `object` that\n * `predicate` doesn't return truthy for. The predicate is invoked with two\n * arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omitBy(object, _.isNumber);\n * // => { 'b': '2' }\n */\n function omitBy(object, predicate) {\n return pickBy(object, negate(getIteratee(predicate)));\n }\n\n /**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\n var pick = flatRest(function(object, paths) {\n return object == null ? {} : basePick(object, paths);\n });\n\n /**\n * Creates an object composed of the `object` properties `predicate` returns\n * truthy for. The predicate is invoked with two arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pickBy(object, _.isNumber);\n * // => { 'a': 1, 'c': 3 }\n */\n function pickBy(object, predicate) {\n if (object == null) {\n return {};\n }\n var props = arrayMap(getAllKeysIn(object), function(prop) {\n return [prop];\n });\n predicate = getIteratee(predicate);\n return basePickBy(object, props, function(value, path) {\n return predicate(value, path[0]);\n });\n }\n\n /**\n * This method is like `_.get` except that if the resolved value is a\n * function it's invoked with the `this` binding of its parent object and\n * its result is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to resolve.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n *\n * _.result(object, 'a[0].b.c1');\n * // => 3\n *\n * _.result(object, 'a[0].b.c2');\n * // => 4\n *\n * _.result(object, 'a[0].b.c3', 'default');\n * // => 'default'\n *\n * _.result(object, 'a[0].b.c3', _.constant('default'));\n * // => 'default'\n */\n function result(object, path, defaultValue) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length;\n\n // Ensure the loop is entered when path is empty.\n if (!length) {\n length = 1;\n object = undefined;\n }\n while (++index < length) {\n var value = object == null ? undefined : object[toKey(path[index])];\n if (value === undefined) {\n index = length;\n value = defaultValue;\n }\n object = isFunction(value) ? value.call(object) : value;\n }\n return object;\n }\n\n /**\n * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n * it's created. Arrays are created for missing index properties while objects\n * are created for all other missing properties. Use `_.setWith` to customize\n * `path` creation.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.set(object, 'a[0].b.c', 4);\n * console.log(object.a[0].b.c);\n * // => 4\n *\n * _.set(object, ['x', '0', 'y', 'z'], 5);\n * console.log(object.x[0].y.z);\n * // => 5\n */\n function set(object, path, value) {\n return object == null ? object : baseSet(object, path, value);\n }\n\n /**\n * This method is like `_.set` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.setWith(object, '[0][1]', 'a', Object);\n * // => { '0': { '1': 'a' } }\n */\n function setWith(object, path, value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseSet(object, path, value, customizer);\n }\n\n /**\n * Creates an array of own enumerable string keyed-value pairs for `object`\n * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n * entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entries\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairs(new Foo);\n * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n */\n var toPairs = createToPairs(keys);\n\n /**\n * Creates an array of own and inherited enumerable string keyed-value pairs\n * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n * or set, its entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entriesIn\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairsIn(new Foo);\n * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n */\n var toPairsIn = createToPairs(keysIn);\n\n /**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n * result.push(n *= n);\n * return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\n function transform(object, iteratee, accumulator) {\n var isArr = isArray(object),\n isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n iteratee = getIteratee(iteratee, 4);\n if (accumulator == null) {\n var Ctor = object && object.constructor;\n if (isArrLike) {\n accumulator = isArr ? new Ctor : [];\n }\n else if (isObject(object)) {\n accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n }\n else {\n accumulator = {};\n }\n }\n (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n return iteratee(accumulator, value, index, object);\n });\n return accumulator;\n }\n\n /**\n * Removes the property at `path` of `object`.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n * _.unset(object, 'a[0].b.c');\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n *\n * _.unset(object, ['a', '0', 'b', 'c']);\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n */\n function unset(object, path) {\n return object == null ? true : baseUnset(object, path);\n }\n\n /**\n * This method is like `_.set` except that accepts `updater` to produce the\n * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n * is invoked with one argument: (value).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n * console.log(object.a[0].b.c);\n * // => 9\n *\n * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n * console.log(object.x[0].y.z);\n * // => 0\n */\n function update(object, path, updater) {\n return object == null ? object : baseUpdate(object, path, castFunction(updater));\n }\n\n /**\n * This method is like `_.update` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n * // => { '0': { '1': 'a' } }\n */\n function updateWith(object, path, updater, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n }\n\n /**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\n function values(object) {\n return object == null ? [] : baseValues(object, keys(object));\n }\n\n /**\n * Creates an array of the own and inherited enumerable string keyed property\n * values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.valuesIn(new Foo);\n * // => [1, 2, 3] (iteration order is not guaranteed)\n */\n function valuesIn(object) {\n return object == null ? [] : baseValues(object, keysIn(object));\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Clamps `number` within the inclusive `lower` and `upper` bounds.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Number\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n * @example\n *\n * _.clamp(-10, -5, 5);\n * // => -5\n *\n * _.clamp(10, -5, 5);\n * // => 5\n */\n function clamp(number, lower, upper) {\n if (upper === undefined) {\n upper = lower;\n lower = undefined;\n }\n if (upper !== undefined) {\n upper = toNumber(upper);\n upper = upper === upper ? upper : 0;\n }\n if (lower !== undefined) {\n lower = toNumber(lower);\n lower = lower === lower ? lower : 0;\n }\n return baseClamp(toNumber(number), lower, upper);\n }\n\n /**\n * Checks if `n` is between `start` and up to, but not including, `end`. If\n * `end` is not specified, it's set to `start` with `start` then set to `0`.\n * If `start` is greater than `end` the params are swapped to support\n * negative ranges.\n *\n * @static\n * @memberOf _\n * @since 3.3.0\n * @category Number\n * @param {number} number The number to check.\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n * @see _.range, _.rangeRight\n * @example\n *\n * _.inRange(3, 2, 4);\n * // => true\n *\n * _.inRange(4, 8);\n * // => true\n *\n * _.inRange(4, 2);\n * // => false\n *\n * _.inRange(2, 2);\n * // => false\n *\n * _.inRange(1.2, 2);\n * // => true\n *\n * _.inRange(5.2, 4);\n * // => false\n *\n * _.inRange(-3, -2, -6);\n * // => true\n */\n function inRange(number, start, end) {\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n number = toNumber(number);\n return baseInRange(number, start, end);\n }\n\n /**\n * Produces a random number between the inclusive `lower` and `upper` bounds.\n * If only one argument is provided a number between `0` and the given number\n * is returned. If `floating` is `true`, or either `lower` or `upper` are\n * floats, a floating-point number is returned instead of an integer.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Number\n * @param {number} [lower=0] The lower bound.\n * @param {number} [upper=1] The upper bound.\n * @param {boolean} [floating] Specify returning a floating-point number.\n * @returns {number} Returns the random number.\n * @example\n *\n * _.random(0, 5);\n * // => an integer between 0 and 5\n *\n * _.random(5);\n * // => also an integer between 0 and 5\n *\n * _.random(5, true);\n * // => a floating-point number between 0 and 5\n *\n * _.random(1.2, 5.2);\n * // => a floating-point number between 1.2 and 5.2\n */\n function random(lower, upper, floating) {\n if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n upper = floating = undefined;\n }\n if (floating === undefined) {\n if (typeof upper == 'boolean') {\n floating = upper;\n upper = undefined;\n }\n else if (typeof lower == 'boolean') {\n floating = lower;\n lower = undefined;\n }\n }\n if (lower === undefined && upper === undefined) {\n lower = 0;\n upper = 1;\n }\n else {\n lower = toFinite(lower);\n if (upper === undefined) {\n upper = lower;\n lower = 0;\n } else {\n upper = toFinite(upper);\n }\n }\n if (lower > upper) {\n var temp = lower;\n lower = upper;\n upper = temp;\n }\n if (floating || lower % 1 || upper % 1) {\n var rand = nativeRandom();\n return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n }\n return baseRandom(lower, upper);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the camel cased string.\n * @example\n *\n * _.camelCase('Foo Bar');\n * // => 'fooBar'\n *\n * _.camelCase('--foo-bar--');\n * // => 'fooBar'\n *\n * _.camelCase('__FOO_BAR__');\n * // => 'fooBar'\n */\n var camelCase = createCompounder(function(result, word, index) {\n word = word.toLowerCase();\n return result + (index ? capitalize(word) : word);\n });\n\n /**\n * Converts the first character of `string` to upper case and the remaining\n * to lower case.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to capitalize.\n * @returns {string} Returns the capitalized string.\n * @example\n *\n * _.capitalize('FRED');\n * // => 'Fred'\n */\n function capitalize(string) {\n return upperFirst(toString(string).toLowerCase());\n }\n\n /**\n * Deburrs `string` by converting\n * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n * letters to basic Latin letters and removing\n * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to deburr.\n * @returns {string} Returns the deburred string.\n * @example\n *\n * _.deburr('déjà vu');\n * // => 'deja vu'\n */\n function deburr(string) {\n string = toString(string);\n return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n }\n\n /**\n * Checks if `string` ends with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=string.length] The position to search up to.\n * @returns {boolean} Returns `true` if `string` ends with `target`,\n * else `false`.\n * @example\n *\n * _.endsWith('abc', 'c');\n * // => true\n *\n * _.endsWith('abc', 'b');\n * // => false\n *\n * _.endsWith('abc', 'b', 2);\n * // => true\n */\n function endsWith(string, target, position) {\n string = toString(string);\n target = baseToString(target);\n\n var length = string.length;\n position = position === undefined\n ? length\n : baseClamp(toInteger(position), 0, length);\n\n var end = position;\n position -= target.length;\n return position >= 0 && string.slice(position, end) == target;\n }\n\n /**\n * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n * corresponding HTML entities.\n *\n * **Note:** No other characters are escaped. To escape additional\n * characters use a third-party library like [_he_](https://mths.be/he).\n *\n * Though the \">\" character is escaped for symmetry, characters like\n * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n * unless they're part of a tag or unquoted attribute value. See\n * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n * (under \"semi-related fun fact\") for more details.\n *\n * When working with HTML you should always\n * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n * XSS vectors.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escape('fred, barney, & pebbles');\n * // => 'fred, barney, &amp; pebbles'\n */\n function escape(string) {\n string = toString(string);\n return (string && reHasUnescapedHtml.test(string))\n ? string.replace(reUnescapedHtml, escapeHtmlChar)\n : string;\n }\n\n /**\n * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escapeRegExp('[lodash](https://lodash.com/)');\n * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n */\n function escapeRegExp(string) {\n string = toString(string);\n return (string && reHasRegExpChar.test(string))\n ? string.replace(reRegExpChar, '\\\\$&')\n : string;\n }\n\n /**\n * Converts `string` to\n * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the kebab cased string.\n * @example\n *\n * _.kebabCase('Foo Bar');\n * // => 'foo-bar'\n *\n * _.kebabCase('fooBar');\n * // => 'foo-bar'\n *\n * _.kebabCase('__FOO_BAR__');\n * // => 'foo-bar'\n */\n var kebabCase = createCompounder(function(result, word, index) {\n return result + (index ? '-' : '') + word.toLowerCase();\n });\n\n /**\n * Converts `string`, as space separated words, to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the lower cased string.\n * @example\n *\n * _.lowerCase('--Foo-Bar--');\n * // => 'foo bar'\n *\n * _.lowerCase('fooBar');\n * // => 'foo bar'\n *\n * _.lowerCase('__FOO_BAR__');\n * // => 'foo bar'\n */\n var lowerCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + word.toLowerCase();\n });\n\n /**\n * Converts the first character of `string` to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.lowerFirst('Fred');\n * // => 'fred'\n *\n * _.lowerFirst('FRED');\n * // => 'fRED'\n */\n var lowerFirst = createCaseFirst('toLowerCase');\n\n /**\n * Pads `string` on the left and right sides if it's shorter than `length`.\n * Padding characters are truncated if they can't be evenly divided by `length`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.pad('abc', 8);\n * // => ' abc '\n *\n * _.pad('abc', 8, '_-');\n * // => '_-abc_-_'\n *\n * _.pad('abc', 3);\n * // => 'abc'\n */\n function pad(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n if (!length || strLength >= length) {\n return string;\n }\n var mid = (length - strLength) / 2;\n return (\n createPadding(nativeFloor(mid), chars) +\n string +\n createPadding(nativeCeil(mid), chars)\n );\n }\n\n /**\n * Pads `string` on the right side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padEnd('abc', 6);\n * // => 'abc '\n *\n * _.padEnd('abc', 6, '_-');\n * // => 'abc_-_'\n *\n * _.padEnd('abc', 3);\n * // => 'abc'\n */\n function padEnd(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (string + createPadding(length - strLength, chars))\n : string;\n }\n\n /**\n * Pads `string` on the left side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padStart('abc', 6);\n * // => ' abc'\n *\n * _.padStart('abc', 6, '_-');\n * // => '_-_abc'\n *\n * _.padStart('abc', 3);\n * // => 'abc'\n */\n function padStart(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (createPadding(length - strLength, chars) + string)\n : string;\n }\n\n /**\n * Converts `string` to an integer of the specified radix. If `radix` is\n * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n * hexadecimal, in which case a `radix` of `16` is used.\n *\n * **Note:** This method aligns with the\n * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category String\n * @param {string} string The string to convert.\n * @param {number} [radix=10] The radix to interpret `value` by.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.parseInt('08');\n * // => 8\n *\n * _.map(['6', '08', '10'], _.parseInt);\n * // => [6, 8, 10]\n */\n function parseInt(string, radix, guard) {\n if (guard || radix == null) {\n radix = 0;\n } else if (radix) {\n radix = +radix;\n }\n return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n }\n\n /**\n * Repeats the given string `n` times.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to repeat.\n * @param {number} [n=1] The number of times to repeat the string.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the repeated string.\n * @example\n *\n * _.repeat('*', 3);\n * // => '***'\n *\n * _.repeat('abc', 2);\n * // => 'abcabc'\n *\n * _.repeat('abc', 0);\n * // => ''\n */\n function repeat(string, n, guard) {\n if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n return baseRepeat(toString(string), n);\n }\n\n /**\n * Replaces matches for `pattern` in `string` with `replacement`.\n *\n * **Note:** This method is based on\n * [`String#replace`](https://mdn.io/String/replace).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to modify.\n * @param {RegExp|string} pattern The pattern to replace.\n * @param {Function|string} replacement The match replacement.\n * @returns {string} Returns the modified string.\n * @example\n *\n * _.replace('Hi Fred', 'Fred', 'Barney');\n * // => 'Hi Barney'\n */\n function replace() {\n var args = arguments,\n string = toString(args[0]);\n\n return args.length < 3 ? string : string.replace(args[1], args[2]);\n }\n\n /**\n * Converts `string` to\n * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the snake cased string.\n * @example\n *\n * _.snakeCase('Foo Bar');\n * // => 'foo_bar'\n *\n * _.snakeCase('fooBar');\n * // => 'foo_bar'\n *\n * _.snakeCase('--FOO-BAR--');\n * // => 'foo_bar'\n */\n var snakeCase = createCompounder(function(result, word, index) {\n return result + (index ? '_' : '') + word.toLowerCase();\n });\n\n /**\n * Splits `string` by `separator`.\n *\n * **Note:** This method is based on\n * [`String#split`](https://mdn.io/String/split).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to split.\n * @param {RegExp|string} separator The separator pattern to split by.\n * @param {number} [limit] The length to truncate results to.\n * @returns {Array} Returns the string segments.\n * @example\n *\n * _.split('a-b-c', '-', 2);\n * // => ['a', 'b']\n */\n function split(string, separator, limit) {\n if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n separator = limit = undefined;\n }\n limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n if (!limit) {\n return [];\n }\n string = toString(string);\n if (string && (\n typeof separator == 'string' ||\n (separator != null && !isRegExp(separator))\n )) {\n separator = baseToString(separator);\n if (!separator && hasUnicode(string)) {\n return castSlice(stringToArray(string), 0, limit);\n }\n }\n return string.split(separator, limit);\n }\n\n /**\n * Converts `string` to\n * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n *\n * @static\n * @memberOf _\n * @since 3.1.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the start cased string.\n * @example\n *\n * _.startCase('--foo-bar--');\n * // => 'Foo Bar'\n *\n * _.startCase('fooBar');\n * // => 'Foo Bar'\n *\n * _.startCase('__FOO_BAR__');\n * // => 'FOO BAR'\n */\n var startCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + upperFirst(word);\n });\n\n /**\n * Checks if `string` starts with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=0] The position to search from.\n * @returns {boolean} Returns `true` if `string` starts with `target`,\n * else `false`.\n * @example\n *\n * _.startsWith('abc', 'a');\n * // => true\n *\n * _.startsWith('abc', 'b');\n * // => false\n *\n * _.startsWith('abc', 'b', 1);\n * // => true\n */\n function startsWith(string, target, position) {\n string = toString(string);\n position = position == null\n ? 0\n : baseClamp(toInteger(position), 0, string.length);\n\n target = baseToString(target);\n return string.slice(position, position + target.length) == target;\n }\n\n /**\n * Creates a compiled template function that can interpolate data properties\n * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n * properties may be accessed as free variables in the template. If a setting\n * object is given, it takes precedence over `_.templateSettings` values.\n *\n * **Note:** In the development build `_.template` utilizes\n * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n * for easier debugging.\n *\n * For more information on precompiling templates see\n * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n *\n * For more information on Chrome extension sandboxes see\n * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The template string.\n * @param {Object} [options={}] The options object.\n * @param {RegExp} [options.escape=_.templateSettings.escape]\n * The HTML \"escape\" delimiter.\n * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n * The \"evaluate\" delimiter.\n * @param {Object} [options.imports=_.templateSettings.imports]\n * An object to import into the template as free variables.\n * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n * The \"interpolate\" delimiter.\n * @param {string} [options.sourceURL='lodash.templateSources[n]']\n * The sourceURL of the compiled template.\n * @param {string} [options.variable='obj']\n * The data object variable name.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the compiled template function.\n * @example\n *\n * // Use the \"interpolate\" delimiter to create a compiled template.\n * var compiled = _.template('hello <%= user %>!');\n * compiled({ 'user': 'fred' });\n * // => 'hello fred!'\n *\n * // Use the HTML \"escape\" delimiter to escape data property values.\n * var compiled = _.template('<b><%- value %></b>');\n * compiled({ 'value': '<script>' });\n * // => '<b>&lt;script&gt;</b>'\n *\n * // Use the \"evaluate\" delimiter to execute JavaScript and generate HTML.\n * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\n * compiled({ 'users': ['fred', 'barney'] });\n * // => '<li>fred</li><li>barney</li>'\n *\n * // Use the internal `print` function in \"evaluate\" delimiters.\n * var compiled = _.template('<% print(\"hello \" + user); %>!');\n * compiled({ 'user': 'barney' });\n * // => 'hello barney!'\n *\n * // Use the ES template literal delimiter as an \"interpolate\" delimiter.\n * // Disable support by replacing the \"interpolate\" delimiter.\n * var compiled = _.template('hello ${ user }!');\n * compiled({ 'user': 'pebbles' });\n * // => 'hello pebbles!'\n *\n * // Use backslashes to treat delimiters as plain text.\n * var compiled = _.template('<%= \"\\\\<%- value %\\\\>\" %>');\n * compiled({ 'value': 'ignored' });\n * // => '<%- value %>'\n *\n * // Use the `imports` option to import `jQuery` as `jq`.\n * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\n * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\n * compiled({ 'users': ['fred', 'barney'] });\n * // => '<li>fred</li><li>barney</li>'\n *\n * // Use the `sourceURL` option to specify a custom sourceURL for the template.\n * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\n * compiled(data);\n * // => Find the source of \"greeting.jst\" under the Sources tab or Resources panel of the web inspector.\n *\n * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\n * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\n * compiled.source;\n * // => function(data) {\n * // var __t, __p = '';\n * // __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\n * // return __p;\n * // }\n *\n * // Use custom template delimiters.\n * _.templateSettings.interpolate = /{{([\\s\\S]+?)}}/g;\n * var compiled = _.template('hello {{ user }}!');\n * compiled({ 'user': 'mustache' });\n * // => 'hello mustache!'\n *\n * // Use the `source` property to inline compiled templates for meaningful\n * // line numbers in error messages and stack traces.\n * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\n * var JST = {\\\n * \"main\": ' + _.template(mainText).source + '\\\n * };\\\n * ');\n */\n function template(string, options, guard) {\n // Based on John Resig's `tmpl` implementation\n // (http://ejohn.org/blog/javascript-micro-templating/)\n // and Laura Doktorova's doT.js (https://github.com/olado/doT).\n var settings = lodash.templateSettings;\n\n if (guard && isIterateeCall(string, options, guard)) {\n options = undefined;\n }\n string = toString(string);\n options = assignInWith({}, options, settings, customDefaultsAssignIn);\n\n var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\n importsKeys = keys(imports),\n importsValues = baseValues(imports, importsKeys);\n\n var isEscaping,\n isEvaluating,\n index = 0,\n interpolate = options.interpolate || reNoMatch,\n source = \"__p += '\";\n\n // Compile the regexp to match each delimiter.\n var reDelimiters = RegExp(\n (options.escape || reNoMatch).source + '|' +\n interpolate.source + '|' +\n (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\n (options.evaluate || reNoMatch).source + '|$'\n , 'g');\n\n // Use a sourceURL for easier debugging.\n // The sourceURL gets injected into the source that's eval-ed, so be careful\n // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in\n // and escape the comment, thus injecting code that gets evaled.\n var sourceURL = '//# sourceURL=' +\n (hasOwnProperty.call(options, 'sourceURL')\n ? (options.sourceURL + '').replace(/\\s/g, ' ')\n : ('lodash.templateSources[' + (++templateCounter) + ']')\n ) + '\\n';\n\n string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\n interpolateValue || (interpolateValue = esTemplateValue);\n\n // Escape characters that can't be included in string literals.\n source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\n\n // Replace delimiters with snippets.\n if (escapeValue) {\n isEscaping = true;\n source += \"' +\\n__e(\" + escapeValue + \") +\\n'\";\n }\n if (evaluateValue) {\n isEvaluating = true;\n source += \"';\\n\" + evaluateValue + \";\\n__p += '\";\n }\n if (interpolateValue) {\n source += \"' +\\n((__t = (\" + interpolateValue + \")) == null ? '' : __t) +\\n'\";\n }\n index = offset + match.length;\n\n // The JS engine embedded in Adobe products needs `match` returned in\n // order to produce the correct `offset` value.\n return match;\n });\n\n source += \"';\\n\";\n\n // If `variable` is not specified wrap a with-statement around the generated\n // code to add the data object to the top of the scope chain.\n var variable = hasOwnProperty.call(options, 'variable') && options.variable;\n if (!variable) {\n source = 'with (obj) {\\n' + source + '\\n}\\n';\n }\n // Throw an error if a forbidden character was found in `variable`, to prevent\n // potential command injection attacks.\n else if (reForbiddenIdentifierChars.test(variable)) {\n throw new Error(INVALID_TEMPL_VAR_ERROR_TEXT);\n }\n\n // Cleanup code by stripping empty strings.\n source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\n .replace(reEmptyStringMiddle, '$1')\n .replace(reEmptyStringTrailing, '$1;');\n\n // Frame code as the function body.\n source = 'function(' + (variable || 'obj') + ') {\\n' +\n (variable\n ? ''\n : 'obj || (obj = {});\\n'\n ) +\n \"var __t, __p = ''\" +\n (isEscaping\n ? ', __e = _.escape'\n : ''\n ) +\n (isEvaluating\n ? ', __j = Array.prototype.join;\\n' +\n \"function print() { __p += __j.call(arguments, '') }\\n\"\n : ';\\n'\n ) +\n source +\n 'return __p\\n}';\n\n var result = attempt(function() {\n return Function(importsKeys, sourceURL + 'return ' + source)\n .apply(undefined, importsValues);\n });\n\n // Provide the compiled function's source by its `toString` method or\n // the `source` property as a convenience for inlining compiled templates.\n result.source = source;\n if (isError(result)) {\n throw result;\n }\n return result;\n }\n\n /**\n * Converts `string`, as a whole, to lower case just like\n * [String#toLowerCase](https://mdn.io/toLowerCase).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the lower cased string.\n * @example\n *\n * _.toLower('--Foo-Bar--');\n * // => '--foo-bar--'\n *\n * _.toLower('fooBar');\n * // => 'foobar'\n *\n * _.toLower('__FOO_BAR__');\n * // => '__foo_bar__'\n */\n function toLower(value) {\n return toString(value).toLowerCase();\n }\n\n /**\n * Converts `string`, as a whole, to upper case just like\n * [String#toUpperCase](https://mdn.io/toUpperCase).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the upper cased string.\n * @example\n *\n * _.toUpper('--foo-bar--');\n * // => '--FOO-BAR--'\n *\n * _.toUpper('fooBar');\n * // => 'FOOBAR'\n *\n * _.toUpper('__foo_bar__');\n * // => '__FOO_BAR__'\n */\n function toUpper(value) {\n return toString(value).toUpperCase();\n }\n\n /**\n * Removes leading and trailing whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trim(' abc ');\n * // => 'abc'\n *\n * _.trim('-_-abc-_-', '_-');\n * // => 'abc'\n *\n * _.map([' foo ', ' bar '], _.trim);\n * // => ['foo', 'bar']\n */\n function trim(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return baseTrim(string);\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n chrSymbols = stringToArray(chars),\n start = charsStartIndex(strSymbols, chrSymbols),\n end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n return castSlice(strSymbols, start, end).join('');\n }\n\n /**\n * Removes trailing whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trimEnd(' abc ');\n * // => ' abc'\n *\n * _.trimEnd('-_-abc-_-', '_-');\n * // => '-_-abc'\n */\n function trimEnd(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return string.slice(0, trimmedEndIndex(string) + 1);\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\n\n return castSlice(strSymbols, 0, end).join('');\n }\n\n /**\n * Removes leading whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trimStart(' abc ');\n * // => 'abc '\n *\n * _.trimStart('-_-abc-_-', '_-');\n * // => 'abc-_-'\n */\n function trimStart(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return string.replace(reTrimStart, '');\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n start = charsStartIndex(strSymbols, stringToArray(chars));\n\n return castSlice(strSymbols, start).join('');\n }\n\n /**\n * Truncates `string` if it's longer than the given maximum string length.\n * The last characters of the truncated string are replaced with the omission\n * string which defaults to \"...\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to truncate.\n * @param {Object} [options={}] The options object.\n * @param {number} [options.length=30] The maximum string length.\n * @param {string} [options.omission='...'] The string to indicate text is omitted.\n * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\n * @returns {string} Returns the truncated string.\n * @example\n *\n * _.truncate('hi-diddly-ho there, neighborino');\n * // => 'hi-diddly-ho there, neighbo...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'length': 24,\n * 'separator': ' '\n * });\n * // => 'hi-diddly-ho there,...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'length': 24,\n * 'separator': /,? +/\n * });\n * // => 'hi-diddly-ho there...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'omission': ' [...]'\n * });\n * // => 'hi-diddly-ho there, neig [...]'\n */\n function truncate(string, options) {\n var length = DEFAULT_TRUNC_LENGTH,\n omission = DEFAULT_TRUNC_OMISSION;\n\n if (isObject(options)) {\n var separator = 'separator' in options ? options.separator : separator;\n length = 'length' in options ? toInteger(options.length) : length;\n omission = 'omission' in options ? baseToString(options.omission) : omission;\n }\n string = toString(string);\n\n var strLength = string.length;\n if (hasUnicode(string)) {\n var strSymbols = stringToArray(string);\n strLength = strSymbols.length;\n }\n if (length >= strLength) {\n return string;\n }\n var end = length - stringSize(omission);\n if (end < 1) {\n return omission;\n }\n var result = strSymbols\n ? castSlice(strSymbols, 0, end).join('')\n : string.slice(0, end);\n\n if (separator === undefined) {\n return result + omission;\n }\n if (strSymbols) {\n end += (result.length - end);\n }\n if (isRegExp(separator)) {\n if (string.slice(end).search(separator)) {\n var match,\n substring = result;\n\n if (!separator.global) {\n separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\n }\n separator.lastIndex = 0;\n while ((match = separator.exec(substring))) {\n var newEnd = match.index;\n }\n result = result.slice(0, newEnd === undefined ? end : newEnd);\n }\n } else if (string.indexOf(baseToString(separator), end) != end) {\n var index = result.lastIndexOf(separator);\n if (index > -1) {\n result = result.slice(0, index);\n }\n }\n return result + omission;\n }\n\n /**\n * The inverse of `_.escape`; this method converts the HTML entities\n * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to\n * their corresponding characters.\n *\n * **Note:** No other HTML entities are unescaped. To unescape additional\n * HTML entities use a third-party library like [_he_](https://mths.be/he).\n *\n * @static\n * @memberOf _\n * @since 0.6.0\n * @category String\n * @param {string} [string=''] The string to unescape.\n * @returns {string} Returns the unescaped string.\n * @example\n *\n * _.unescape('fred, barney, &amp; pebbles');\n * // => 'fred, barney, & pebbles'\n */\n function unescape(string) {\n string = toString(string);\n return (string && reHasEscapedHtml.test(string))\n ? string.replace(reEscapedHtml, unescapeHtmlChar)\n : string;\n }\n\n /**\n * Converts `string`, as space separated words, to upper case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the upper cased string.\n * @example\n *\n * _.upperCase('--foo-bar');\n * // => 'FOO BAR'\n *\n * _.upperCase('fooBar');\n * // => 'FOO BAR'\n *\n * _.upperCase('__foo_bar__');\n * // => 'FOO BAR'\n */\n var upperCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + word.toUpperCase();\n });\n\n /**\n * Converts the first character of `string` to upper case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.upperFirst('fred');\n * // => 'Fred'\n *\n * _.upperFirst('FRED');\n * // => 'FRED'\n */\n var upperFirst = createCaseFirst('toUpperCase');\n\n /**\n * Splits `string` into an array of its words.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {RegExp|string} [pattern] The pattern to match words.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the words of `string`.\n * @example\n *\n * _.words('fred, barney, & pebbles');\n * // => ['fred', 'barney', 'pebbles']\n *\n * _.words('fred, barney, & pebbles', /[^, ]+/g);\n * // => ['fred', 'barney', '&', 'pebbles']\n */\n function words(string, pattern, guard) {\n string = toString(string);\n pattern = guard ? undefined : pattern;\n\n if (pattern === undefined) {\n return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\n }\n return string.match(pattern) || [];\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Attempts to invoke `func`, returning either the result or the caught error\n * object. Any additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Function} func The function to attempt.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {*} Returns the `func` result or error object.\n * @example\n *\n * // Avoid throwing errors for invalid selectors.\n * var elements = _.attempt(function(selector) {\n * return document.querySelectorAll(selector);\n * }, '>_>');\n *\n * if (_.isError(elements)) {\n * elements = [];\n * }\n */\n var attempt = baseRest(function(func, args) {\n try {\n return apply(func, undefined, args);\n } catch (e) {\n return isError(e) ? e : new Error(e);\n }\n });\n\n /**\n * Binds methods of an object to the object itself, overwriting the existing\n * method.\n *\n * **Note:** This method doesn't set the \"length\" property of bound functions.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {Object} object The object to bind and assign the bound methods to.\n * @param {...(string|string[])} methodNames The object method names to bind.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var view = {\n * 'label': 'docs',\n * 'click': function() {\n * console.log('clicked ' + this.label);\n * }\n * };\n *\n * _.bindAll(view, ['click']);\n * jQuery(element).on('click', view.click);\n * // => Logs 'clicked docs' when clicked.\n */\n var bindAll = flatRest(function(object, methodNames) {\n arrayEach(methodNames, function(key) {\n key = toKey(key);\n baseAssignValue(object, key, bind(object[key], object));\n });\n return object;\n });\n\n /**\n * Creates a function that iterates over `pairs` and invokes the corresponding\n * function of the first predicate to return truthy. The predicate-function\n * pairs are invoked with the `this` binding and arguments of the created\n * function.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {Array} pairs The predicate-function pairs.\n * @returns {Function} Returns the new composite function.\n * @example\n *\n * var func = _.cond([\n * [_.matches({ 'a': 1 }), _.constant('matches A')],\n * [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\n * [_.stubTrue, _.constant('no match')]\n * ]);\n *\n * func({ 'a': 1, 'b': 2 });\n * // => 'matches A'\n *\n * func({ 'a': 0, 'b': 1 });\n * // => 'matches B'\n *\n * func({ 'a': '1', 'b': '2' });\n * // => 'no match'\n */\n function cond(pairs) {\n var length = pairs == null ? 0 : pairs.length,\n toIteratee = getIteratee();\n\n pairs = !length ? [] : arrayMap(pairs, function(pair) {\n if (typeof pair[1] != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return [toIteratee(pair[0]), pair[1]];\n });\n\n return baseRest(function(args) {\n var index = -1;\n while (++index < length) {\n var pair = pairs[index];\n if (apply(pair[0], this, args)) {\n return apply(pair[1], this, args);\n }\n }\n });\n }\n\n /**\n * Creates a function that invokes the predicate properties of `source` with\n * the corresponding property values of a given object, returning `true` if\n * all predicates return truthy, else `false`.\n *\n * **Note:** The created function is equivalent to `_.conformsTo` with\n * `source` partially applied.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n * @example\n *\n * var objects = [\n * { 'a': 2, 'b': 1 },\n * { 'a': 1, 'b': 2 }\n * ];\n *\n * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\n * // => [{ 'a': 1, 'b': 2 }]\n */\n function conforms(source) {\n return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\n function constant(value) {\n return function() {\n return value;\n };\n }\n\n /**\n * Checks `value` to determine whether a default value should be returned in\n * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\n * or `undefined`.\n *\n * @static\n * @memberOf _\n * @since 4.14.0\n * @category Util\n * @param {*} value The value to check.\n * @param {*} defaultValue The default value.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * _.defaultTo(1, 10);\n * // => 1\n *\n * _.defaultTo(undefined, 10);\n * // => 10\n */\n function defaultTo(value, defaultValue) {\n return (value == null || value !== value) ? defaultValue : value;\n }\n\n /**\n * Creates a function that returns the result of invoking the given functions\n * with the `this` binding of the created function, where each successive\n * invocation is supplied the return value of the previous.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {...(Function|Function[])} [funcs] The functions to invoke.\n * @returns {Function} Returns the new composite function.\n * @see _.flowRight\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var addSquare = _.flow([_.add, square]);\n * addSquare(1, 2);\n * // => 9\n */\n var flow = createFlow();\n\n /**\n * This method is like `_.flow` except that it creates a function that\n * invokes the given functions from right to left.\n *\n * @static\n * @since 3.0.0\n * @memberOf _\n * @category Util\n * @param {...(Function|Function[])} [funcs] The functions to invoke.\n * @returns {Function} Returns the new composite function.\n * @see _.flow\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var addSquare = _.flowRight([square, _.add]);\n * addSquare(1, 2);\n * // => 9\n */\n var flowRight = createFlow(true);\n\n /**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\n function identity(value) {\n return value;\n }\n\n /**\n * Creates a function that invokes `func` with the arguments of the created\n * function. If `func` is a property name, the created function returns the\n * property value for a given element. If `func` is an array or object, the\n * created function returns `true` for elements that contain the equivalent\n * source properties, otherwise it returns `false`.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Util\n * @param {*} [func=_.identity] The value to convert to a callback.\n * @returns {Function} Returns the callback.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, _.iteratee(['user', 'fred']));\n * // => [{ 'user': 'fred', 'age': 40 }]\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, _.iteratee('user'));\n * // => ['barney', 'fred']\n *\n * // Create custom iteratee shorthands.\n * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n * return !_.isRegExp(func) ? iteratee(func) : function(string) {\n * return func.test(string);\n * };\n * });\n *\n * _.filter(['abc', 'def'], /ef/);\n * // => ['def']\n */\n function iteratee(func) {\n return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that performs a partial deep comparison between a given\n * object and `source`, returning `true` if the given object has equivalent\n * property values, else `false`.\n *\n * **Note:** The created function is equivalent to `_.isMatch` with `source`\n * partially applied.\n *\n * Partial comparisons will match empty array and empty object `source`\n * values against any array or object value, respectively. See `_.isEqual`\n * for a list of supported value comparisons.\n *\n * **Note:** Multiple values can be checked by combining several matchers\n * using `_.overSome`\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n * @example\n *\n * var objects = [\n * { 'a': 1, 'b': 2, 'c': 3 },\n * { 'a': 4, 'b': 5, 'c': 6 }\n * ];\n *\n * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\n * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\n *\n * // Checking for several possible values\n * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })]));\n * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n */\n function matches(source) {\n return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that performs a partial deep comparison between the\n * value at `path` of a given object to `srcValue`, returning `true` if the\n * object value is equivalent, else `false`.\n *\n * **Note:** Partial comparisons will match empty array and empty object\n * `srcValue` values against any array or object value, respectively. See\n * `_.isEqual` for a list of supported value comparisons.\n *\n * **Note:** Multiple values can be checked by combining several matchers\n * using `_.overSome`\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n * @example\n *\n * var objects = [\n * { 'a': 1, 'b': 2, 'c': 3 },\n * { 'a': 4, 'b': 5, 'c': 6 }\n * ];\n *\n * _.find(objects, _.matchesProperty('a', 4));\n * // => { 'a': 4, 'b': 5, 'c': 6 }\n *\n * // Checking for several possible values\n * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)]));\n * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n */\n function matchesProperty(path, srcValue) {\n return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that invokes the method at `path` of a given object.\n * Any additional arguments are provided to the invoked method.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Util\n * @param {Array|string} path The path of the method to invoke.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {Function} Returns the new invoker function.\n * @example\n *\n * var objects = [\n * { 'a': { 'b': _.constant(2) } },\n * { 'a': { 'b': _.constant(1) } }\n * ];\n *\n * _.map(objects, _.method('a.b'));\n * // => [2, 1]\n *\n * _.map(objects, _.method(['a', 'b']));\n * // => [2, 1]\n */\n var method = baseRest(function(path, args) {\n return function(object) {\n return baseInvoke(object, path, args);\n };\n });\n\n /**\n * The opposite of `_.method`; this method creates a function that invokes\n * the method at a given path of `object`. Any additional arguments are\n * provided to the invoked method.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Util\n * @param {Object} object The object to query.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {Function} Returns the new invoker function.\n * @example\n *\n * var array = _.times(3, _.constant),\n * object = { 'a': array, 'b': array, 'c': array };\n *\n * _.map(['a[2]', 'c[0]'], _.methodOf(object));\n * // => [2, 0]\n *\n * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\n * // => [2, 0]\n */\n var methodOf = baseRest(function(object, args) {\n return function(path) {\n return baseInvoke(object, path, args);\n };\n });\n\n /**\n * Adds all own enumerable string keyed function properties of a source\n * object to the destination object. If `object` is a function, then methods\n * are added to its prototype as well.\n *\n * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\n * avoid conflicts caused by modifying the original.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {Function|Object} [object=lodash] The destination object.\n * @param {Object} source The object of functions to add.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\n * @returns {Function|Object} Returns `object`.\n * @example\n *\n * function vowels(string) {\n * return _.filter(string, function(v) {\n * return /[aeiou]/i.test(v);\n * });\n * }\n *\n * _.mixin({ 'vowels': vowels });\n * _.vowels('fred');\n * // => ['e']\n *\n * _('fred').vowels().value();\n * // => ['e']\n *\n * _.mixin({ 'vowels': vowels }, { 'chain': false });\n * _('fred').vowels();\n * // => ['e']\n */\n function mixin(object, source, options) {\n var props = keys(source),\n methodNames = baseFunctions(source, props);\n\n if (options == null &&\n !(isObject(source) && (methodNames.length || !props.length))) {\n options = source;\n source = object;\n object = this;\n methodNames = baseFunctions(source, keys(source));\n }\n var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\n isFunc = isFunction(object);\n\n arrayEach(methodNames, function(methodName) {\n var func = source[methodName];\n object[methodName] = func;\n if (isFunc) {\n object.prototype[methodName] = function() {\n var chainAll = this.__chain__;\n if (chain || chainAll) {\n var result = object(this.__wrapped__),\n actions = result.__actions__ = copyArray(this.__actions__);\n\n actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\n result.__chain__ = chainAll;\n return result;\n }\n return func.apply(object, arrayPush([this.value()], arguments));\n };\n }\n });\n\n return object;\n }\n\n /**\n * Reverts the `_` variable to its previous value and returns a reference to\n * the `lodash` function.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @returns {Function} Returns the `lodash` function.\n * @example\n *\n * var lodash = _.noConflict();\n */\n function noConflict() {\n if (root._ === this) {\n root._ = oldDash;\n }\n return this;\n }\n\n /**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\n function noop() {\n // No operation performed.\n }\n\n /**\n * Creates a function that gets the argument at index `n`. If `n` is negative,\n * the nth argument from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {number} [n=0] The index of the argument to return.\n * @returns {Function} Returns the new pass-thru function.\n * @example\n *\n * var func = _.nthArg(1);\n * func('a', 'b', 'c', 'd');\n * // => 'b'\n *\n * var func = _.nthArg(-2);\n * func('a', 'b', 'c', 'd');\n * // => 'c'\n */\n function nthArg(n) {\n n = toInteger(n);\n return baseRest(function(args) {\n return baseNth(args, n);\n });\n }\n\n /**\n * Creates a function that invokes `iteratees` with the arguments it receives\n * and returns their results.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to invoke.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.over([Math.max, Math.min]);\n *\n * func(1, 2, 3, 4);\n * // => [4, 1]\n */\n var over = createOver(arrayMap);\n\n /**\n * Creates a function that checks if **all** of the `predicates` return\n * truthy when invoked with the arguments it receives.\n *\n * Following shorthands are possible for providing predicates.\n * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [predicates=[_.identity]]\n * The predicates to check.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.overEvery([Boolean, isFinite]);\n *\n * func('1');\n * // => true\n *\n * func(null);\n * // => false\n *\n * func(NaN);\n * // => false\n */\n var overEvery = createOver(arrayEvery);\n\n /**\n * Creates a function that checks if **any** of the `predicates` return\n * truthy when invoked with the arguments it receives.\n *\n * Following shorthands are possible for providing predicates.\n * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [predicates=[_.identity]]\n * The predicates to check.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.overSome([Boolean, isFinite]);\n *\n * func('1');\n * // => true\n *\n * func(null);\n * // => true\n *\n * func(NaN);\n * // => false\n *\n * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }])\n * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]])\n */\n var overSome = createOver(arraySome);\n\n /**\n * Creates a function that returns the value at `path` of a given object.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var objects = [\n * { 'a': { 'b': 2 } },\n * { 'a': { 'b': 1 } }\n * ];\n *\n * _.map(objects, _.property('a.b'));\n * // => [2, 1]\n *\n * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n */\n function property(path) {\n return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n }\n\n /**\n * The opposite of `_.property`; this method creates a function that returns\n * the value at a given path of `object`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var array = [0, 1, 2],\n * object = { 'a': array, 'b': array, 'c': array };\n *\n * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\n * // => [2, 0]\n *\n * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\n * // => [2, 0]\n */\n function propertyOf(object) {\n return function(path) {\n return object == null ? undefined : baseGet(object, path);\n };\n }\n\n /**\n * Creates an array of numbers (positive and/or negative) progressing from\n * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n * `start` is specified without an `end` or `step`. If `end` is not specified,\n * it's set to `start` with `start` then set to `0`.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.rangeRight\n * @example\n *\n * _.range(4);\n * // => [0, 1, 2, 3]\n *\n * _.range(-4);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 5);\n * // => [1, 2, 3, 4]\n *\n * _.range(0, 20, 5);\n * // => [0, 5, 10, 15]\n *\n * _.range(0, -4, -1);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.range(0);\n * // => []\n */\n var range = createRange();\n\n /**\n * This method is like `_.range` except that it populates values in\n * descending order.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.range\n * @example\n *\n * _.rangeRight(4);\n * // => [3, 2, 1, 0]\n *\n * _.rangeRight(-4);\n * // => [-3, -2, -1, 0]\n *\n * _.rangeRight(1, 5);\n * // => [4, 3, 2, 1]\n *\n * _.rangeRight(0, 20, 5);\n * // => [15, 10, 5, 0]\n *\n * _.rangeRight(0, -4, -1);\n * // => [-3, -2, -1, 0]\n *\n * _.rangeRight(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.rangeRight(0);\n * // => []\n */\n var rangeRight = createRange(true);\n\n /**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\n function stubArray() {\n return [];\n }\n\n /**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\n function stubFalse() {\n return false;\n }\n\n /**\n * This method returns a new empty object.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Object} Returns the new empty object.\n * @example\n *\n * var objects = _.times(2, _.stubObject);\n *\n * console.log(objects);\n * // => [{}, {}]\n *\n * console.log(objects[0] === objects[1]);\n * // => false\n */\n function stubObject() {\n return {};\n }\n\n /**\n * This method returns an empty string.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {string} Returns the empty string.\n * @example\n *\n * _.times(2, _.stubString);\n * // => ['', '']\n */\n function stubString() {\n return '';\n }\n\n /**\n * This method returns `true`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `true`.\n * @example\n *\n * _.times(2, _.stubTrue);\n * // => [true, true]\n */\n function stubTrue() {\n return true;\n }\n\n /**\n * Invokes the iteratee `n` times, returning an array of the results of\n * each invocation. The iteratee is invoked with one argument; (index).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.times(3, String);\n * // => ['0', '1', '2']\n *\n * _.times(4, _.constant(0));\n * // => [0, 0, 0, 0]\n */\n function times(n, iteratee) {\n n = toInteger(n);\n if (n < 1 || n > MAX_SAFE_INTEGER) {\n return [];\n }\n var index = MAX_ARRAY_LENGTH,\n length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n iteratee = getIteratee(iteratee);\n n -= MAX_ARRAY_LENGTH;\n\n var result = baseTimes(length, iteratee);\n while (++index < n) {\n iteratee(index);\n }\n return result;\n }\n\n /**\n * Converts `value` to a property path array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {*} value The value to convert.\n * @returns {Array} Returns the new property path array.\n * @example\n *\n * _.toPath('a.b.c');\n * // => ['a', 'b', 'c']\n *\n * _.toPath('a[0].b.c');\n * // => ['a', '0', 'b', 'c']\n */\n function toPath(value) {\n if (isArray(value)) {\n return arrayMap(value, toKey);\n }\n return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\n }\n\n /**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\n function uniqueId(prefix) {\n var id = ++idCounter;\n return toString(prefix) + id;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Adds two numbers.\n *\n * @static\n * @memberOf _\n * @since 3.4.0\n * @category Math\n * @param {number} augend The first number in an addition.\n * @param {number} addend The second number in an addition.\n * @returns {number} Returns the total.\n * @example\n *\n * _.add(6, 4);\n * // => 10\n */\n var add = createMathOperation(function(augend, addend) {\n return augend + addend;\n }, 0);\n\n /**\n * Computes `number` rounded up to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round up.\n * @param {number} [precision=0] The precision to round up to.\n * @returns {number} Returns the rounded up number.\n * @example\n *\n * _.ceil(4.006);\n * // => 5\n *\n * _.ceil(6.004, 2);\n * // => 6.01\n *\n * _.ceil(6040, -2);\n * // => 6100\n */\n var ceil = createRound('ceil');\n\n /**\n * Divide two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {number} dividend The first number in a division.\n * @param {number} divisor The second number in a division.\n * @returns {number} Returns the quotient.\n * @example\n *\n * _.divide(6, 4);\n * // => 1.5\n */\n var divide = createMathOperation(function(dividend, divisor) {\n return dividend / divisor;\n }, 1);\n\n /**\n * Computes `number` rounded down to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round down.\n * @param {number} [precision=0] The precision to round down to.\n * @returns {number} Returns the rounded down number.\n * @example\n *\n * _.floor(4.006);\n * // => 4\n *\n * _.floor(0.046, 2);\n * // => 0.04\n *\n * _.floor(4060, -2);\n * // => 4000\n */\n var floor = createRound('floor');\n\n /**\n * Computes the maximum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * _.max([4, 2, 8, 6]);\n * // => 8\n *\n * _.max([]);\n * // => undefined\n */\n function max(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseGt)\n : undefined;\n }\n\n /**\n * This method is like `_.max` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.maxBy(objects, function(o) { return o.n; });\n * // => { 'n': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.maxBy(objects, 'n');\n * // => { 'n': 2 }\n */\n function maxBy(array, iteratee) {\n return (array && array.length)\n ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\n : undefined;\n }\n\n /**\n * Computes the mean of the values in `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {number} Returns the mean.\n * @example\n *\n * _.mean([4, 2, 8, 6]);\n * // => 5\n */\n function mean(array) {\n return baseMean(array, identity);\n }\n\n /**\n * This method is like `_.mean` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the value to be averaged.\n * The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the mean.\n * @example\n *\n * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n *\n * _.meanBy(objects, function(o) { return o.n; });\n * // => 5\n *\n * // The `_.property` iteratee shorthand.\n * _.meanBy(objects, 'n');\n * // => 5\n */\n function meanBy(array, iteratee) {\n return baseMean(array, getIteratee(iteratee, 2));\n }\n\n /**\n * Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * _.min([4, 2, 8, 6]);\n * // => 2\n *\n * _.min([]);\n * // => undefined\n */\n function min(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseLt)\n : undefined;\n }\n\n /**\n * This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n *\n * // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n */\n function minBy(array, iteratee) {\n return (array && array.length)\n ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\n : undefined;\n }\n\n /**\n * Multiply two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {number} multiplier The first number in a multiplication.\n * @param {number} multiplicand The second number in a multiplication.\n * @returns {number} Returns the product.\n * @example\n *\n * _.multiply(6, 4);\n * // => 24\n */\n var multiply = createMathOperation(function(multiplier, multiplicand) {\n return multiplier * multiplicand;\n }, 1);\n\n /**\n * Computes `number` rounded to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round.\n * @param {number} [precision=0] The precision to round to.\n * @returns {number} Returns the rounded number.\n * @example\n *\n * _.round(4.006);\n * // => 4\n *\n * _.round(4.006, 2);\n * // => 4.01\n *\n * _.round(4060, -2);\n * // => 4100\n */\n var round = createRound('round');\n\n /**\n * Subtract two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {number} minuend The first number in a subtraction.\n * @param {number} subtrahend The second number in a subtraction.\n * @returns {number} Returns the difference.\n * @example\n *\n * _.subtract(6, 4);\n * // => 2\n */\n var subtract = createMathOperation(function(minuend, subtrahend) {\n return minuend - subtrahend;\n }, 0);\n\n /**\n * Computes the sum of the values in `array`.\n *\n * @static\n * @memberOf _\n * @since 3.4.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {number} Returns the sum.\n * @example\n *\n * _.sum([4, 2, 8, 6]);\n * // => 20\n */\n function sum(array) {\n return (array && array.length)\n ? baseSum(array, identity)\n : 0;\n }\n\n /**\n * This method is like `_.sum` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the value to be summed.\n * The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the sum.\n * @example\n *\n * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n *\n * _.sumBy(objects, function(o) { return o.n; });\n * // => 20\n *\n * // The `_.property` iteratee shorthand.\n * _.sumBy(objects, 'n');\n * // => 20\n */\n function sumBy(array, iteratee) {\n return (array && array.length)\n ? baseSum(array, getIteratee(iteratee, 2))\n : 0;\n }\n\n /*------------------------------------------------------------------------*/\n\n // Add methods that return wrapped values in chain sequences.\n lodash.after = after;\n lodash.ary = ary;\n lodash.assign = assign;\n lodash.assignIn = assignIn;\n lodash.assignInWith = assignInWith;\n lodash.assignWith = assignWith;\n lodash.at = at;\n lodash.before = before;\n lodash.bind = bind;\n lodash.bindAll = bindAll;\n lodash.bindKey = bindKey;\n lodash.castArray = castArray;\n lodash.chain = chain;\n lodash.chunk = chunk;\n lodash.compact = compact;\n lodash.concat = concat;\n lodash.cond = cond;\n lodash.conforms = conforms;\n lodash.constant = constant;\n lodash.countBy = countBy;\n lodash.create = create;\n lodash.curry = curry;\n lodash.curryRight = curryRight;\n lodash.debounce = debounce;\n lodash.defaults = defaults;\n lodash.defaultsDeep = defaultsDeep;\n lodash.defer = defer;\n lodash.delay = delay;\n lodash.difference = difference;\n lodash.differenceBy = differenceBy;\n lodash.differenceWith = differenceWith;\n lodash.drop = drop;\n lodash.dropRight = dropRight;\n lodash.dropRightWhile = dropRightWhile;\n lodash.dropWhile = dropWhile;\n lodash.fill = fill;\n lodash.filter = filter;\n lodash.flatMap = flatMap;\n lodash.flatMapDeep = flatMapDeep;\n lodash.flatMapDepth = flatMapDepth;\n lodash.flatten = flatten;\n lodash.flattenDeep = flattenDeep;\n lodash.flattenDepth = flattenDepth;\n lodash.flip = flip;\n lodash.flow = flow;\n lodash.flowRight = flowRight;\n lodash.fromPairs = fromPairs;\n lodash.functions = functions;\n lodash.functionsIn = functionsIn;\n lodash.groupBy = groupBy;\n lodash.initial = initial;\n lodash.intersection = intersection;\n lodash.intersectionBy = intersectionBy;\n lodash.intersectionWith = intersectionWith;\n lodash.invert = invert;\n lodash.invertBy = invertBy;\n lodash.invokeMap = invokeMap;\n lodash.iteratee = iteratee;\n lodash.keyBy = keyBy;\n lodash.keys = keys;\n lodash.keysIn = keysIn;\n lodash.map = map;\n lodash.mapKeys = mapKeys;\n lodash.mapValues = mapValues;\n lodash.matches = matches;\n lodash.matchesProperty = matchesProperty;\n lodash.memoize = memoize;\n lodash.merge = merge;\n lodash.mergeWith = mergeWith;\n lodash.method = method;\n lodash.methodOf = methodOf;\n lodash.mixin = mixin;\n lodash.negate = negate;\n lodash.nthArg = nthArg;\n lodash.omit = omit;\n lodash.omitBy = omitBy;\n lodash.once = once;\n lodash.orderBy = orderBy;\n lodash.over = over;\n lodash.overArgs = overArgs;\n lodash.overEvery = overEvery;\n lodash.overSome = overSome;\n lodash.partial = partial;\n lodash.partialRight = partialRight;\n lodash.partition = partition;\n lodash.pick = pick;\n lodash.pickBy = pickBy;\n lodash.property = property;\n lodash.propertyOf = propertyOf;\n lodash.pull = pull;\n lodash.pullAll = pullAll;\n lodash.pullAllBy = pullAllBy;\n lodash.pullAllWith = pullAllWith;\n lodash.pullAt = pullAt;\n lodash.range = range;\n lodash.rangeRight = rangeRight;\n lodash.rearg = rearg;\n lodash.reject = reject;\n lodash.remove = remove;\n lodash.rest = rest;\n lodash.reverse = reverse;\n lodash.sampleSize = sampleSize;\n lodash.set = set;\n lodash.setWith = setWith;\n lodash.shuffle = shuffle;\n lodash.slice = slice;\n lodash.sortBy = sortBy;\n lodash.sortedUniq = sortedUniq;\n lodash.sortedUniqBy = sortedUniqBy;\n lodash.split = split;\n lodash.spread = spread;\n lodash.tail = tail;\n lodash.take = take;\n lodash.takeRight = takeRight;\n lodash.takeRightWhile = takeRightWhile;\n lodash.takeWhile = takeWhile;\n lodash.tap = tap;\n lodash.throttle = throttle;\n lodash.thru = thru;\n lodash.toArray = toArray;\n lodash.toPairs = toPairs;\n lodash.toPairsIn = toPairsIn;\n lodash.toPath = toPath;\n lodash.toPlainObject = toPlainObject;\n lodash.transform = transform;\n lodash.unary = unary;\n lodash.union = union;\n lodash.unionBy = unionBy;\n lodash.unionWith = unionWith;\n lodash.uniq = uniq;\n lodash.uniqBy = uniqBy;\n lodash.uniqWith = uniqWith;\n lodash.unset = unset;\n lodash.unzip = unzip;\n lodash.unzipWith = unzipWith;\n lodash.update = update;\n lodash.updateWith = updateWith;\n lodash.values = values;\n lodash.valuesIn = valuesIn;\n lodash.without = without;\n lodash.words = words;\n lodash.wrap = wrap;\n lodash.xor = xor;\n lodash.xorBy = xorBy;\n lodash.xorWith = xorWith;\n lodash.zip = zip;\n lodash.zipObject = zipObject;\n lodash.zipObjectDeep = zipObjectDeep;\n lodash.zipWith = zipWith;\n\n // Add aliases.\n lodash.entries = toPairs;\n lodash.entriesIn = toPairsIn;\n lodash.extend = assignIn;\n lodash.extendWith = assignInWith;\n\n // Add methods to `lodash.prototype`.\n mixin(lodash, lodash);\n\n /*------------------------------------------------------------------------*/\n\n // Add methods that return unwrapped values in chain sequences.\n lodash.add = add;\n lodash.attempt = attempt;\n lodash.camelCase = camelCase;\n lodash.capitalize = capitalize;\n lodash.ceil = ceil;\n lodash.clamp = clamp;\n lodash.clone = clone;\n lodash.cloneDeep = cloneDeep;\n lodash.cloneDeepWith = cloneDeepWith;\n lodash.cloneWith = cloneWith;\n lodash.conformsTo = conformsTo;\n lodash.deburr = deburr;\n lodash.defaultTo = defaultTo;\n lodash.divide = divide;\n lodash.endsWith = endsWith;\n lodash.eq = eq;\n lodash.escape = escape;\n lodash.escapeRegExp = escapeRegExp;\n lodash.every = every;\n lodash.find = find;\n lodash.findIndex = findIndex;\n lodash.findKey = findKey;\n lodash.findLast = findLast;\n lodash.findLastIndex = findLastIndex;\n lodash.findLastKey = findLastKey;\n lodash.floor = floor;\n lodash.forEach = forEach;\n lodash.forEachRight = forEachRight;\n lodash.forIn = forIn;\n lodash.forInRight = forInRight;\n lodash.forOwn = forOwn;\n lodash.forOwnRight = forOwnRight;\n lodash.get = get;\n lodash.gt = gt;\n lodash.gte = gte;\n lodash.has = has;\n lodash.hasIn = hasIn;\n lodash.head = head;\n lodash.identity = identity;\n lodash.includes = includes;\n lodash.indexOf = indexOf;\n lodash.inRange = inRange;\n lodash.invoke = invoke;\n lodash.isArguments = isArguments;\n lodash.isArray = isArray;\n lodash.isArrayBuffer = isArrayBuffer;\n lodash.isArrayLike = isArrayLike;\n lodash.isArrayLikeObject = isArrayLikeObject;\n lodash.isBoolean = isBoolean;\n lodash.isBuffer = isBuffer;\n lodash.isDate = isDate;\n lodash.isElement = isElement;\n lodash.isEmpty = isEmpty;\n lodash.isEqual = isEqual;\n lodash.isEqualWith = isEqualWith;\n lodash.isError = isError;\n lodash.isFinite = isFinite;\n lodash.isFunction = isFunction;\n lodash.isInteger = isInteger;\n lodash.isLength = isLength;\n lodash.isMap = isMap;\n lodash.isMatch = isMatch;\n lodash.isMatchWith = isMatchWith;\n lodash.isNaN = isNaN;\n lodash.isNative = isNative;\n lodash.isNil = isNil;\n lodash.isNull = isNull;\n lodash.isNumber = isNumber;\n lodash.isObject = isObject;\n lodash.isObjectLike = isObjectLike;\n lodash.isPlainObject = isPlainObject;\n lodash.isRegExp = isRegExp;\n lodash.isSafeInteger = isSafeInteger;\n lodash.isSet = isSet;\n lodash.isString = isString;\n lodash.isSymbol = isSymbol;\n lodash.isTypedArray = isTypedArray;\n lodash.isUndefined = isUndefined;\n lodash.isWeakMap = isWeakMap;\n lodash.isWeakSet = isWeakSet;\n lodash.join = join;\n lodash.kebabCase = kebabCase;\n lodash.last = last;\n lodash.lastIndexOf = lastIndexOf;\n lodash.lowerCase = lowerCase;\n lodash.lowerFirst = lowerFirst;\n lodash.lt = lt;\n lodash.lte = lte;\n lodash.max = max;\n lodash.maxBy = maxBy;\n lodash.mean = mean;\n lodash.meanBy = meanBy;\n lodash.min = min;\n lodash.minBy = minBy;\n lodash.stubArray = stubArray;\n lodash.stubFalse = stubFalse;\n lodash.stubObject = stubObject;\n lodash.stubString = stubString;\n lodash.stubTrue = stubTrue;\n lodash.multiply = multiply;\n lodash.nth = nth;\n lodash.noConflict = noConflict;\n lodash.noop = noop;\n lodash.now = now;\n lodash.pad = pad;\n lodash.padEnd = padEnd;\n lodash.padStart = padStart;\n lodash.parseInt = parseInt;\n lodash.random = random;\n lodash.reduce = reduce;\n lodash.reduceRight = reduceRight;\n lodash.repeat = repeat;\n lodash.replace = replace;\n lodash.result = result;\n lodash.round = round;\n lodash.runInContext = runInContext;\n lodash.sample = sample;\n lodash.size = size;\n lodash.snakeCase = snakeCase;\n lodash.some = some;\n lodash.sortedIndex = sortedIndex;\n lodash.sortedIndexBy = sortedIndexBy;\n lodash.sortedIndexOf = sortedIndexOf;\n lodash.sortedLastIndex = sortedLastIndex;\n lodash.sortedLastIndexBy = sortedLastIndexBy;\n lodash.sortedLastIndexOf = sortedLastIndexOf;\n lodash.startCase = startCase;\n lodash.startsWith = startsWith;\n lodash.subtract = subtract;\n lodash.sum = sum;\n lodash.sumBy = sumBy;\n lodash.template = template;\n lodash.times = times;\n lodash.toFinite = toFinite;\n lodash.toInteger = toInteger;\n lodash.toLength = toLength;\n lodash.toLower = toLower;\n lodash.toNumber = toNumber;\n lodash.toSafeInteger = toSafeInteger;\n lodash.toString = toString;\n lodash.toUpper = toUpper;\n lodash.trim = trim;\n lodash.trimEnd = trimEnd;\n lodash.trimStart = trimStart;\n lodash.truncate = truncate;\n lodash.unescape = unescape;\n lodash.uniqueId = uniqueId;\n lodash.upperCase = upperCase;\n lodash.upperFirst = upperFirst;\n\n // Add aliases.\n lodash.each = forEach;\n lodash.eachRight = forEachRight;\n lodash.first = head;\n\n mixin(lodash, (function() {\n var source = {};\n baseForOwn(lodash, function(func, methodName) {\n if (!hasOwnProperty.call(lodash.prototype, methodName)) {\n source[methodName] = func;\n }\n });\n return source;\n }()), { 'chain': false });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The semantic version number.\n *\n * @static\n * @memberOf _\n * @type {string}\n */\n lodash.VERSION = VERSION;\n\n // Assign default placeholders.\n arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\n lodash[methodName].placeholder = lodash;\n });\n\n // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\n arrayEach(['drop', 'take'], function(methodName, index) {\n LazyWrapper.prototype[methodName] = function(n) {\n n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\n\n var result = (this.__filtered__ && !index)\n ? new LazyWrapper(this)\n : this.clone();\n\n if (result.__filtered__) {\n result.__takeCount__ = nativeMin(n, result.__takeCount__);\n } else {\n result.__views__.push({\n 'size': nativeMin(n, MAX_ARRAY_LENGTH),\n 'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\n });\n }\n return result;\n };\n\n LazyWrapper.prototype[methodName + 'Right'] = function(n) {\n return this.reverse()[methodName](n).reverse();\n };\n });\n\n // Add `LazyWrapper` methods that accept an `iteratee` value.\n arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\n var type = index + 1,\n isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\n\n LazyWrapper.prototype[methodName] = function(iteratee) {\n var result = this.clone();\n result.__iteratees__.push({\n 'iteratee': getIteratee(iteratee, 3),\n 'type': type\n });\n result.__filtered__ = result.__filtered__ || isFilter;\n return result;\n };\n });\n\n // Add `LazyWrapper` methods for `_.head` and `_.last`.\n arrayEach(['head', 'last'], function(methodName, index) {\n var takeName = 'take' + (index ? 'Right' : '');\n\n LazyWrapper.prototype[methodName] = function() {\n return this[takeName](1).value()[0];\n };\n });\n\n // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\n arrayEach(['initial', 'tail'], function(methodName, index) {\n var dropName = 'drop' + (index ? '' : 'Right');\n\n LazyWrapper.prototype[methodName] = function() {\n return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\n };\n });\n\n LazyWrapper.prototype.compact = function() {\n return this.filter(identity);\n };\n\n LazyWrapper.prototype.find = function(predicate) {\n return this.filter(predicate).head();\n };\n\n LazyWrapper.prototype.findLast = function(predicate) {\n return this.reverse().find(predicate);\n };\n\n LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\n if (typeof path == 'function') {\n return new LazyWrapper(this);\n }\n return this.map(function(value) {\n return baseInvoke(value, path, args);\n });\n });\n\n LazyWrapper.prototype.reject = function(predicate) {\n return this.filter(negate(getIteratee(predicate)));\n };\n\n LazyWrapper.prototype.slice = function(start, end) {\n start = toInteger(start);\n\n var result = this;\n if (result.__filtered__ && (start > 0 || end < 0)) {\n return new LazyWrapper(result);\n }\n if (start < 0) {\n result = result.takeRight(-start);\n } else if (start) {\n result = result.drop(start);\n }\n if (end !== undefined) {\n end = toInteger(end);\n result = end < 0 ? result.dropRight(-end) : result.take(end - start);\n }\n return result;\n };\n\n LazyWrapper.prototype.takeRightWhile = function(predicate) {\n return this.reverse().takeWhile(predicate).reverse();\n };\n\n LazyWrapper.prototype.toArray = function() {\n return this.take(MAX_ARRAY_LENGTH);\n };\n\n // Add `LazyWrapper` methods to `lodash.prototype`.\n baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\n isTaker = /^(?:head|last)$/.test(methodName),\n lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\n retUnwrapped = isTaker || /^find/.test(methodName);\n\n if (!lodashFunc) {\n return;\n }\n lodash.prototype[methodName] = function() {\n var value = this.__wrapped__,\n args = isTaker ? [1] : arguments,\n isLazy = value instanceof LazyWrapper,\n iteratee = args[0],\n useLazy = isLazy || isArray(value);\n\n var interceptor = function(value) {\n var result = lodashFunc.apply(lodash, arrayPush([value], args));\n return (isTaker && chainAll) ? result[0] : result;\n };\n\n if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\n // Avoid lazy use if the iteratee has a \"length\" value other than `1`.\n isLazy = useLazy = false;\n }\n var chainAll = this.__chain__,\n isHybrid = !!this.__actions__.length,\n isUnwrapped = retUnwrapped && !chainAll,\n onlyLazy = isLazy && !isHybrid;\n\n if (!retUnwrapped && useLazy) {\n value = onlyLazy ? value : new LazyWrapper(this);\n var result = func.apply(value, args);\n result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\n return new LodashWrapper(result, chainAll);\n }\n if (isUnwrapped && onlyLazy) {\n return func.apply(this, args);\n }\n result = this.thru(interceptor);\n return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\n };\n });\n\n // Add `Array` methods to `lodash.prototype`.\n arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\n var func = arrayProto[methodName],\n chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\n retUnwrapped = /^(?:pop|shift)$/.test(methodName);\n\n lodash.prototype[methodName] = function() {\n var args = arguments;\n if (retUnwrapped && !this.__chain__) {\n var value = this.value();\n return func.apply(isArray(value) ? value : [], args);\n }\n return this[chainName](function(value) {\n return func.apply(isArray(value) ? value : [], args);\n });\n };\n });\n\n // Map minified method names to their real names.\n baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n var lodashFunc = lodash[methodName];\n if (lodashFunc) {\n var key = lodashFunc.name + '';\n if (!hasOwnProperty.call(realNames, key)) {\n realNames[key] = [];\n }\n realNames[key].push({ 'name': methodName, 'func': lodashFunc });\n }\n });\n\n realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\n 'name': 'wrapper',\n 'func': undefined\n }];\n\n // Add methods to `LazyWrapper`.\n LazyWrapper.prototype.clone = lazyClone;\n LazyWrapper.prototype.reverse = lazyReverse;\n LazyWrapper.prototype.value = lazyValue;\n\n // Add chain sequence methods to the `lodash` wrapper.\n lodash.prototype.at = wrapperAt;\n lodash.prototype.chain = wrapperChain;\n lodash.prototype.commit = wrapperCommit;\n lodash.prototype.next = wrapperNext;\n lodash.prototype.plant = wrapperPlant;\n lodash.prototype.reverse = wrapperReverse;\n lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\n\n // Add lazy aliases.\n lodash.prototype.first = lodash.prototype.head;\n\n if (symIterator) {\n lodash.prototype[symIterator] = wrapperToIterator;\n }\n return lodash;\n });\n\n /*--------------------------------------------------------------------------*/\n\n // Export lodash.\n var _ = runInContext();\n\n // Some AMD build optimizers, like r.js, check for condition patterns like:\n if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n // Expose Lodash on the global object to prevent errors when Lodash is\n // loaded by a script tag in the presence of an AMD loader.\n // See http://requirejs.org/docs/errors.html#mismatch for more details.\n // Use `_.noConflict` to remove Lodash from the global object.\n root._ = _;\n\n // Define as an anonymous module so, through path mapping, it can be\n // referenced as the \"underscore\" module.\n define(function() {\n return _;\n });\n }\n // Check for `exports` after `define` in case a build optimizer adds it.\n else if (freeModule) {\n // Export for Node.js.\n (freeModule.exports = _)._ = _;\n // Export for CommonJS support.\n freeExports._ = _;\n }\n else {\n // Export to the global object.\n root._ = _;\n }\n}.call(this));\n","import type { Coord } from '@turf/turf'\nimport type { Feature, FeatureCollection, GeoJsonProperties, LineString } from 'geojson'\n\nimport {\n bboxPolygon,\n booleanPointInPolygon,\n distance,\n lineSplit,\n lineString,\n points,\n} from '@turf/turf'\nimport { sortBy } from 'lodash'\n\nimport type { SingleCoordinate } from '@/coordinatesUtils'\nimport type { CoordinatesChunk } from '@/proj/types'\n\ninterface CoordinateSystemBoundsProps {\n lowerX: number\n upperX: number\n lowerY: number\n upperY: number\n customCenter?: SingleCoordinate\n}\n\n/**\n * Turf's lineSplit function doesn't ensure split path will be ordered in its output.\n *\n * This code aims to reorder the result of this function in the correct order. Comes from a GitHub\n * issue (see link below)\n *\n * @see https://github.com/Turfjs/turf/issues/1989#issuecomment-753147919\n */\nfunction reassembleLineSegments(\n origin: Coord,\n path: FeatureCollection<LineString, GeoJsonProperties>\n): Feature<LineString>[] {\n let candidateFeatures = path.features\n const orderedFeatures: Feature<LineString, GeoJsonProperties>[] = []\n while (candidateFeatures.length > 0) {\n candidateFeatures = sortBy(candidateFeatures, (f) => {\n if (f.geometry && f.geometry.coordinates && f.geometry.coordinates[0]) {\n return distance(origin, f.geometry.coordinates[0])\n } else {\n throw new Error('Feature missing geometry')\n }\n })\n const closest = candidateFeatures.shift()!\n const closestOrigin = closest.geometry.coordinates[closest.geometry.coordinates.length - 1]\n if (closestOrigin) {\n origin = closestOrigin\n }\n orderedFeatures.push(closest)\n }\n return orderedFeatures\n}\n\n/**\n * Representation of boundaries of a coordinate system (also sometime called extent)\n *\n * It is expressed by the most bottom left points possible / top right point possible, meaning that\n * a combination of these two gives us the area in which the coordinate system can produce valid\n * coordinates\n */\nexport default class CoordinateSystemBounds {\n public readonly lowerX: number\n public readonly upperX: number\n public readonly lowerY: number\n public readonly upperY: number\n public readonly customCenter?: SingleCoordinate\n\n public readonly bottomLeft: SingleCoordinate\n public readonly bottomRight: SingleCoordinate\n public readonly topLeft: SingleCoordinate\n public readonly topRight: SingleCoordinate\n\n public readonly center: SingleCoordinate\n /** A flattened version of the bounds such as [lowerX, lowerY, upperX, upperY] */\n public readonly flatten: [number, number, number, number]\n\n /**\n * @param args.lowerX\n * @param args.upperX\n * @param args.lowerY\n * @param args.upperY\n * @param args.customCenter If this bounds must have a different center (if we want to offset\n * the natural center of those bounds). If no custom center is given, the center will be\n * calculated relative to the bounds.\n */\n constructor(args: CoordinateSystemBoundsProps) {\n const { lowerX, upperX, lowerY, upperY, customCenter } = args\n this.lowerX = lowerX\n this.upperX = upperX\n this.lowerY = lowerY\n this.upperY = upperY\n this.customCenter = customCenter\n\n this.bottomLeft = [this.lowerX, this.lowerY]\n this.bottomRight = [this.upperX, this.lowerY]\n this.topLeft = [this.lowerX, this.upperY]\n this.topRight = [this.upperX, this.upperY]\n\n this.center = this.customCenter ?? [\n (this.lowerX + this.upperX) / 2,\n (this.lowerY + this.upperY) / 2,\n ]\n this.flatten = [this.lowerX, this.lowerY, this.upperX, this.upperY]\n }\n\n isInBounds(x: number, y: number): boolean\n isInBounds(coordinate: SingleCoordinate): boolean\n\n isInBounds(xOrCoordinate: number | SingleCoordinate, y?: number): boolean {\n if (typeof xOrCoordinate === 'number') {\n return (\n xOrCoordinate >= this.lowerX &&\n xOrCoordinate <= this.upperX &&\n y! >= this.lowerY &&\n y! <= this.upperY\n )\n }\n return this.isInBounds(xOrCoordinate[0], xOrCoordinate[1])\n }\n\n /**\n * Will split the coordinates in chunks if some portion of the coordinates are outside bounds\n * (one chunk for the portion inside, one for the portion outside, rinse and repeat if\n * necessary)\n *\n * Can be helpful when requesting information from our backends, but said backend doesn't\n * support world-wide coverage. Typical example is service-profile, if we give it coordinates\n * outside LV95 bounds it will fill what it doesn't know with coordinates following LV95 extent\n * instead of returning undefined\n *\n * @param {[Number, Number][]} coordinates Coordinates `[[x1,y1],[x2,y2],...]` expressed in the\n * same coordinate system (projection) as the bounds\n * @returns {CoordinatesChunk[] | undefined}\n */\n splitIfOutOfBounds(coordinates: SingleCoordinate[]): CoordinatesChunk[] | undefined {\n if (!Array.isArray(coordinates) || coordinates.length <= 1) {\n return\n }\n // checking that all coordinates are well-formed\n if (coordinates.find((coordinate) => coordinate.length !== 2)) {\n return\n }\n // checking if we require splitting\n if (coordinates.find((coordinate) => !this.isInBounds(coordinate))) {\n const boundsAsPolygon = bboxPolygon(this.flatten)\n const paths = lineSplit(lineString(coordinates), boundsAsPolygon)\n if (coordinates[0]) {\n paths.features = reassembleLineSegments(coordinates[0], paths)\n }\n return paths.features.map((chunk) => {\n return {\n coordinates: chunk.geometry.coordinates,\n isWithinBounds: points(chunk.geometry.coordinates).features.every((point) =>\n booleanPointInPolygon(point, boundsAsPolygon)\n ),\n } as CoordinatesChunk\n })\n }\n // no splitting needed, we return the coordinates as they were given\n return [\n {\n coordinates: coordinates,\n isWithinBounds: true,\n },\n ]\n }\n}\n","import { round } from '@swissgeo/numbers'\nimport { earthRadius } from '@turf/turf'\nimport proj4 from 'proj4'\n\nimport type { SingleCoordinate } from '@/coordinatesUtils'\nimport type { ResolutionStep } from '@/proj/types'\n\nimport CoordinateSystemBounds from '@/proj/CoordinateSystemBounds'\n\n/**\n * These are the zoom levels, for each projection, which give us a 1:25'000 ratio map.\n *\n * These variables are declared here, as the config.js import the LV95 coordinate system, and it\n * could lead to initialization errors (even when initializing the constants before importing the\n * class). Thus we declare them here, at the root class of the coordinates systems.\n */\nexport const STANDARD_ZOOM_LEVEL_1_25000_MAP: number = 15.5\nexport const SWISS_ZOOM_LEVEL_1_25000_MAP: number = 8\n\n/**\n * Resolution (pixel/meter) found at zoom level 0 while looking at the equator. This constant is\n * used to calculate the resolution taking latitude into account. With Mercator projection, the\n * deformation increases when latitude increases.\n *\n * Length of the Earth around its equator (in meters) / 256 pixels\n *\n * @see https://wiki.openstreetmap.org/wiki/Slippy_map_tilenames#Resolution_and_Scale\n * @see https://wiki.openstreetmap.org/wiki/Zoom_levels\n */\nexport const PIXEL_LENGTH_IN_KM_AT_ZOOM_ZERO_WITH_256PX_TILES: number =\n (2 * Math.PI * earthRadius) / 256\n\nexport interface CoordinateSystemProps {\n /**\n * EPSG:xxxx representation of this coordinate system, but only the numerical part (without the\n * \"EPSG:\")\n */\n epsgNumber: number\n /**\n * Label to show users when they are dealing with this coordinate system (can be a translation\n * key)\n */\n label: string\n /**\n * Name of this projection, if applicable, so that it can be tested against name in fields such\n * as COG metadata parsing.\n */\n technicalName?: string\n /**\n * A string describing how proj4 should handle projection/reprojection of this coordinate\n * system, in regard to WGS84. These matrices can be found on the EPSG website for each\n * projection in the Export section, inside the PROJ.4 export type (can be directly accessed by\n * adding .proj4 to the URL of one projection's page on the EPSG website, i.e.\n * https://epsg.io/3857.proj4 for WebMercator)\n */\n proj4transformationMatrix: string\n /**\n * Bounds of this projection system, expressed as in its own coordinate system. These boundaries\n * can also be found on the EPSG website, in the section \"Projected bounds\" of a projection's\n * page. It is possible to specify a custom center to these bounds, so that the application\n * starts at this custom center instead of the natural center (when no coordinates are specified\n * at startup).\n */\n bounds?: CoordinateSystemBounds\n /**\n * A boolean variable indicating whether the Mercator projection pyramid is used.\n *\n * The Mercator projection pyramid is a specific spatial reference system commonly used in\n * mapping and geographic information systems (GIS) applications.\n *\n * If set to `true`, it signifies that the system or dataset is leveraging this projection\n * methodology.\n *\n * If set to `false`, it indicates that the dataset uses an alternative projection or tiling\n * scheme.\n */\n usesMercatorPyramid: boolean\n}\n\n/**\n * Representation of a coordinate system (or also called projection system) in the context of this\n * application.\n *\n * These coordinate systems will be used to drive the mapping framework, helping it grasp which zoom\n * level or resolution to show, where to start the view (with the center of bounds), how to handle a\n * projection change, etc...\n *\n * @abstract\n */\nexport default abstract class CoordinateSystem {\n /**\n * EPSG:xxxx representation of this coordinate system, but only the numerical part (without the\n * \"EPSG:\")\n */\n public readonly epsgNumber: number\n /** EPSG:xxxx representation of this coordinate system */\n public readonly epsg: string\n /**\n * Label to show users when they are dealing with this coordinate system (can be a translation\n * key)\n */\n public readonly label: string\n /**\n * Name of this projection, if applicable, so that it can be tested against name in fields such\n * as COG metadata parsing.\n */\n public readonly technicalName?: string\n /**\n * A string describing how proj4 should handle projection/reprojection of this coordinate\n * system, in regard to WGS84. These matrices can be found on the EPSG website for each\n * projection in the Export section, inside the PROJ.4 export type (can be directly accessed by\n * adding .proj4 to the URL of one projection's page on the EPSG website, i.e.\n * https://epsg.io/3857.proj4 for WebMercator)\n */\n public readonly proj4transformationMatrix: string\n /**\n * Bounds of this projection system, expressed as in its own coordinate system. These boundaries\n * can also be found on the EPSG website, in the section \"Projected bounds\" of a projection's\n * page. It is possible to specify a custom center to these bounds, so that the application\n * starts at this custom center instead of the natural center (when no coordinates are specified\n * at startup).\n */\n public readonly bounds?: CoordinateSystemBounds\n /**\n * A boolean variable indicating whether the Mercator projection pyramid is used.\n *\n * The Mercator projection pyramid is a specific spatial reference system commonly used in\n * mapping and geographic information systems (GIS) applications.\n *\n * If set to `true`, it signifies that the system or dataset is leveraging this projection\n * methodology.\n *\n * If set to `false`, it indicates that the dataset uses an alternative projection or tiling\n * scheme.\n */\n public readonly usesMercatorPyramid: boolean\n\n constructor(args: CoordinateSystemProps) {\n const {\n epsgNumber,\n label,\n proj4transformationMatrix,\n bounds,\n technicalName,\n usesMercatorPyramid = false,\n } = args\n this.epsgNumber = epsgNumber\n /**\n * Full EPSG identifier used by most libraries (such as proj4, or OpenLayers)\n *\n * @type {`EPSG:${Number}`}\n */\n this.epsg = `EPSG:${epsgNumber}`\n this.label = label\n this.proj4transformationMatrix = proj4transformationMatrix\n this.bounds = bounds\n this.technicalName = technicalName\n this.usesMercatorPyramid = usesMercatorPyramid\n }\n\n /**\n * Transforms the bounds of this coordinates system to be expressed in the wanted coordinate\n * system\n *\n * If the coordinate system is invalid, or if bounds are not defined, it will return null\n *\n * @param {CoordinateSystem} coordinateSystem The target coordinate system we want bounds\n * expressed in\n * @returns {CoordinateSystemBounds | undefined} Bounds, expressed in the coordinate system, or\n * undefined if bounds are undefined or the coordinate system is invalid\n */\n getBoundsAs(coordinateSystem: CoordinateSystem): CoordinateSystemBounds | undefined {\n if (this.bounds) {\n if (coordinateSystem.epsg === this.epsg) {\n return this.bounds\n }\n const newBottomLeft = proj4(this.epsg, coordinateSystem.epsg, this.bounds.bottomLeft)\n const newTopRight = proj4(this.epsg, coordinateSystem.epsg, this.bounds.topRight)\n let customCenter: SingleCoordinate | undefined\n if (this.bounds.customCenter) {\n customCenter = proj4(this.epsg, coordinateSystem.epsg, this.bounds.customCenter)\n }\n return new CoordinateSystemBounds({\n lowerX: newBottomLeft[0],\n lowerY: newBottomLeft[1],\n upperX: newTopRight[0],\n upperY: newTopRight[1],\n customCenter,\n })\n }\n return\n }\n\n isInBounds(x: number, y: number): boolean\n isInBounds(coordinate: SingleCoordinate): boolean\n\n /**\n * Tells if a coordinate is in bound of this coordinate system.\n *\n * Will return false if no bounds are defined for this coordinate system\n */\n isInBounds(xOrCoordinate: number | SingleCoordinate, y?: number): boolean {\n if (!this.bounds) {\n return false\n }\n if (typeof xOrCoordinate === 'number') {\n return this.bounds.isInBounds(xOrCoordinate, y!)\n }\n return this.bounds.isInBounds(xOrCoordinate[0], xOrCoordinate[1])\n }\n\n /**\n * @abstract\n * @returns The Index in the resolution list where the 1:25000 zoom level is\n */\n abstract get1_25000ZoomLevel(): number\n\n /**\n * @abstract\n * @returns The default zoom to use when starting the map in this coordinate system (if none are\n * set so far)\n */\n abstract getDefaultZoom(): number\n\n /**\n * Rounds a zoom level.\n *\n * You can, by overwriting this function, add custom zoom level roundings or similar function in\n * your custom coordinate systems.\n *\n * @param zoom A zoom level in this coordinate system\n * @returns The given zoom level after rounding\n */\n roundZoomLevel(zoom: number): number {\n return round(zoom, 3)\n }\n\n /**\n * Returns the corresponding resolution to the given zoom level and center (some coordinate\n * system must take some deformation into account the further north we are, and will require to\n * receive the coordinate of the center of the view)\n *\n * @abstract\n * @param zoom A zoom level\n * @param center The current center of view, expressed with this coordinate system\n * @returns The resolution at the given zoom level, in the context of this coordinate system\n */\n abstract getResolutionForZoom(zoom: number, center?: SingleCoordinate): number\n\n /**\n * Returns the zoom level to match the given resolution and center (some coordinate system must\n * take some deformation into account the further north we are, and will require to receive the\n * coordinate of the center of the view)\n *\n * @abstract\n * @param resolution The resolution of the map, expressed in meter per pixel\n * @param center The current center of view, expressed in this coordinate system\n * @returns The corresponding zoom level, in the context of this coordinate system\n */\n abstract getZoomForResolution(resolution: number, center?: SingleCoordinate): number\n\n /**\n * Returns a rounded value of a coordinate value, in the context of this coordinate system. This\n * enables us to decide how many decimal points we want to keep for numbers after calculation\n * within this coordinate system (no need to keep values that are irrelevant to precision for\n * most maps, such as below 1cm)\n *\n * @abstract\n * @param {Number} value A value to be rounded\n * @returns {Number} The rounded value, with desired remaining decimal point for this coordinate\n * system\n */\n abstract roundCoordinateValue(value: number): number\n\n /**\n * A (descending) list of all the available resolution steps for this coordinate system. If this\n * is not the behavior you want, you have to override this function.\n */\n getResolutionSteps(latitude?: number): ResolutionStep[] {\n if (!this.bounds) {\n return []\n }\n const zoom0PixelSizeInMeters = PIXEL_LENGTH_IN_KM_AT_ZOOM_ZERO_WITH_256PX_TILES\n const resolutions: ResolutionStep[] = []\n const latInRad = ((latitude ?? 0) * Math.PI) / 180.0\n for (let z = 0; z < 21; ++z) {\n resolutions.push({\n resolution: (zoom0PixelSizeInMeters * Math.cos(latInRad)) / Math.pow(2, z),\n zoom: z,\n })\n }\n return resolutions\n }\n\n /**\n * The origin to use as anchor for tile coordinate calculations. It will return the bound's\n * [lowerX, upperY] as default value (meaning the top-left corner of bounds). If this is not the\n * behavior you want, you have to override this function.\n *\n * If no bounds are defined, it will return [0, 0]\n */\n getTileOrigin(): SingleCoordinate {\n return this.bounds?.topLeft ?? [0, 0]\n }\n\n /**\n * List of matrix identifiers for this coordinate system. If this is not the behavior you want,\n * you have to override this function.\n */\n getMatrixIds(): number[] {\n const matrixIds = []\n for (let z = 0; z < this.getResolutionSteps().length; ++z) {\n matrixIds[z] = z\n }\n return matrixIds\n }\n}\n","import type { SingleCoordinate } from '@/coordinatesUtils'\nimport type { CoordinateSystemProps } from '@/proj/CoordinateSystem'\nimport type CoordinateSystemBounds from '@/proj/CoordinateSystemBounds'\n\nimport CoordinateSystem from '@/proj/CoordinateSystem'\n\nexport interface CustomCoordinateSystemProps extends CoordinateSystemProps {\n /** With a custom coordinate system, bounds are mandatory. */\n bounds: CoordinateSystemBounds\n}\n\n/**\n * Description of a coordinate system that will not use the standard resolution and zoom level\n * (a.k.a. mercator pyramid).\n *\n * This can be used to describe national coordinate systems that are built to represent a subset of\n * the World, with a custom zoom pyramid to match their map resolutions.\n *\n * You can see examples by following {@link SwissCoordinateSystem} and its children.\n *\n * @abstract\n * @see https://wiki.openstreetmap.org/wiki/Zoom_levels\n */\nexport default abstract class CustomCoordinateSystem extends CoordinateSystem {\n declare public readonly bounds: CoordinateSystemBounds\n\n protected constructor(args: CustomCoordinateSystemProps) {\n super(args)\n }\n\n /**\n * The origin to use as anchor for tile coordinate calculations. It will return the bound's\n * [lowerX, upperY] as default value (meaning the top-left corner of bounds). If this is not the\n * behavior you want, you have to override this function.\n */\n getTileOrigin(): SingleCoordinate {\n return this.bounds.topLeft\n }\n\n /**\n * Transforms a zoom level from this custom coordinate system, back to a zoom level such as\n * described in https://wiki.openstreetmap.org/wiki/Zoom_levels\n *\n * @abstract\n * @param customZoomLevel A zoom level in this custom coordinate system\n * @returns A standard (or OpenStreetMap) zoom level\n */\n abstract transformCustomZoomLevelToStandard(customZoomLevel: number): number\n\n /**\n * Transforms a standard (or OpenStreetMap) zoom level into a zoom level in this coordinate\n * system\n *\n * @param standardZoomLevel A standard zoom level\n * @returns A zoom level in this custom coordinate system\n */\n abstract transformStandardZoomLevelToCustom(standardZoomLevel: number): number\n}\n","import { closest, round } from '@swissgeo/numbers'\n\nimport type { ResolutionStep } from '@/proj/types'\n\nimport {\n STANDARD_ZOOM_LEVEL_1_25000_MAP,\n SWISS_ZOOM_LEVEL_1_25000_MAP,\n} from '@/proj/CoordinateSystem'\nimport CustomCoordinateSystem from '@/proj/CustomCoordinateSystem'\n\n/**\n * Resolutions for each LV95 zoom level, from 0 to 14\n *\n * @see https://docs.geo.admin.ch/visualize-data/wmts.html#gettile\n */\nexport const LV95_RESOLUTIONS: number[] = [\n 650.0, 500.0, 250.0, 100.0, 50.0, 20.0, 10.0, 5.0, 2.5, 2.0, 1.0, 0.5, 0.25, 0.1,\n]\n\n/**\n * Resolutions steps (one per zoom level) for our own WMTS pyramid (see\n * {@link https://docs.geo.admin.ch/visualize-data/wmts.html}) expressed in meters/pixel\n *\n * Be mindful that zoom levels described on our doc are expressed for LV95 and need conversion to\n * World Wide zoom level (see {@link SwissCoordinateSystem})\n *\n * It is essentially, at low resolution, the same as {@link LV95_RESOLUTIONS}, but with added steps\n * at higher zoom level (further from the ground)\n */\nexport const SWISSTOPO_TILEGRID_RESOLUTIONS: number[] = [\n 4000.0,\n 3750.0,\n 3500.0,\n 3250.0,\n 3000.0,\n 2750.0,\n 2500.0,\n 2250.0,\n 2000.0,\n 1750.0,\n 1500.0,\n 1250.0,\n 1000.0,\n 750.0,\n ...LV95_RESOLUTIONS.slice(0, 10),\n // see table https://docs.geo.admin.ch/visualize-data/wmts.html#gettile\n // LV95 doesn't support zoom level 10 at 1.5 resolution, so we need to split\n // the resolution and add it here\n 1.5,\n ...LV95_RESOLUTIONS.slice(10),\n]\n\n/**\n * Conversion matrix from swisstopo LV95 zoom level to Web Mercator zoom level\n *\n * Indexes of the array are LV95 zoom levels\n *\n * Values are mercator equivalents\n *\n * @type {Number[]}\n */\nexport const SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX: number[] = [\n 7.35, // min: 0\n 7.75, // 1\n 8.75, // 2\n 10, // 3\n 11, // 4\n 12.5, // 5\n 13.5, // 6\n 14.5, // 7\n STANDARD_ZOOM_LEVEL_1_25000_MAP, // 8\n 15.75, // 9\n 16.7, // 10\n 17.75, // 11\n 18.75, // 12\n 20, // 13\n 21, // max: 14\n]\n\nconst SWISSTOPO_ZOOM_TO_PRODUCT_SCALE: string[] = [\n \"1:2'500'000\", // zoom 0\n \"1:2'500'000\", // 1\n \"1:1'000'000\", // 2\n \"1:1'000'000\", // 3\n \"1:500'000\", // 4\n \"1:200'000\", // 5\n \"1:100'000\", // 6\n \"1:50'000\", // 7\n \"1:25'000\", // 8\n \"1:25'000\", // 9\n \"1:10'000\", // 10\n \"1:10'000\", // 11\n \"1:10'000\", // 12\n \"1:10'000\", // 13\n \"1:10'000\", // max zoom: 14\n]\n\nconst swisstopoZoomLevels: number[] = SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX.map(\n (_, index) => index\n)\n\n/**\n * This specialization will be used to represent LV95 and LV03, that use a custom zoom/resolution\n * pyramid to match all our printable products (in contrast to {@link StandardCoordinateSystem} which\n * bases its zoom/resolution on the radius of the Earth at the equator and latitude positioning of\n * the map).\n *\n * @abstract\n * @see https://docs.geo.admin.ch/visualize-data/wmts.html\n * @see https://wiki.openstreetmap.org/wiki/Zoom_levels\n */\nexport default class SwissCoordinateSystem extends CustomCoordinateSystem {\n getResolutionSteps(): ResolutionStep[] {\n return SWISSTOPO_TILEGRID_RESOLUTIONS.map((resolution) => {\n const zoom: number | undefined = LV95_RESOLUTIONS.indexOf(resolution) ?? undefined\n let label: string | undefined\n if (zoom) {\n label = SWISSTOPO_ZOOM_TO_PRODUCT_SCALE[zoom]\n }\n return {\n zoom,\n label,\n resolution: resolution,\n }\n })\n }\n\n get1_25000ZoomLevel(): number {\n return SWISS_ZOOM_LEVEL_1_25000_MAP\n }\n\n getDefaultZoom(): number {\n return 1\n }\n\n transformStandardZoomLevelToCustom(standardZoomLevel: number): number {\n // checking first if the standard zoom level is within range of swiss zooms we have available\n if (\n typeof SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX[0] === 'number' &&\n typeof SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX[14] === 'number' &&\n standardZoomLevel >= SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX[0] &&\n standardZoomLevel <= SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX[14]\n ) {\n return SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX.filter(\n (zoom) => zoom < standardZoomLevel\n ).length\n }\n if (\n typeof SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX[0] === 'number' &&\n standardZoomLevel < SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX[0]\n ) {\n return 0\n }\n if (\n typeof SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX[14] === 'number' &&\n standardZoomLevel > SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX[14]\n ) {\n return 14\n }\n // if no matching zoom level was found, we return the one for the 1:25'000 map\n return this.get1_25000ZoomLevel()\n }\n\n /**\n * Mapping between Swiss map zooms and standard zooms. Heavily inspired by\n * {@link https://github.com/geoadmin/mf-geoadmin3/blob/ce885985e4af5e3e20c87321e67a650388af3602/src/components/map/MapUtilsService.js#L603-L631 MapUtilsService.js on mf-geoadmin3}\n *\n * @param customZoomLevel A zoom level as desribed in\n * {@link https://docs.geo.admin.ch/visualize-data/wmts.html our backend's doc}\n * @returns A web-mercator zoom level (as described on\n * {@link https://wiki.openstreetmap.org/wiki/Zoom_levels | OpenStreetMap's wiki}) or the zoom\n * level to show the 1:25'000 map if the input is invalid\n */\n transformCustomZoomLevelToStandard(customZoomLevel: number): number {\n const key = Math.floor(customZoomLevel)\n if (SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX.length - 1 >= key) {\n return (\n SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX[key] ??\n STANDARD_ZOOM_LEVEL_1_25000_MAP\n )\n }\n // if no matching zoom level was found, we return the one for the 1:25'000 map\n return STANDARD_ZOOM_LEVEL_1_25000_MAP\n }\n\n getResolutionForZoom(zoom: number): number {\n const roundedZoom = Math.round(zoom)\n if (typeof LV95_RESOLUTIONS[roundedZoom] !== 'number') {\n return 0\n }\n // ignoring the center, as it won't have any effect on the chosen zoom level\n return LV95_RESOLUTIONS[roundedZoom]\n }\n\n getZoomForResolution(resolution: number): number {\n // ignoring the center, as it won't have any effect on the resolution\n const matchingResolution = LV95_RESOLUTIONS.find(\n (lv95Resolution) => lv95Resolution <= resolution\n )\n if (matchingResolution) {\n return LV95_RESOLUTIONS.indexOf(matchingResolution)\n }\n // if no match was found, we have to decide if the resolution is too great,\n // or too small to be matched and return the zoom accordingly\n const smallestResolution = LV95_RESOLUTIONS.slice(-1)[0]\n if (smallestResolution && smallestResolution > resolution) {\n // if the resolution was smaller than the smallest available, we return the zoom level corresponding\n // to the smallest available resolution\n return LV95_RESOLUTIONS.indexOf(smallestResolution)\n }\n // otherwise, we return the zoom level corresponding to the greatest resolution available\n return 0\n }\n\n roundCoordinateValue(value: number): number {\n return round(value, 2)\n }\n\n /**\n * Rounding to the zoom level\n *\n * @param customZoomLevel A zoom level, that could be a floating number\n * @param normalize Normalize the zoom level to the closest swisstopo zoom level, by default it\n * only round the zoom level to 3 decimal\n * @returns A zoom level matching one of our national maps\n */\n roundZoomLevel(customZoomLevel: number, normalize: boolean = false): number {\n if (normalize) {\n return closest(customZoomLevel, swisstopoZoomLevels)\n }\n return super.roundZoomLevel(customZoomLevel)\n }\n}\n","import CoordinateSystemBounds from '@/proj/CoordinateSystemBounds'\nimport SwissCoordinateSystem from '@/proj/SwissCoordinateSystem'\n\nexport default class LV03CoordinateSystem extends SwissCoordinateSystem {\n constructor() {\n super({\n epsgNumber: 21781,\n label: 'CH1903 / LV03',\n technicalName: 'LV03',\n // matrix is coming fom https://epsg.io/21781.proj4\n proj4transformationMatrix:\n '+proj=somerc +lat_0=46.9524055555556 +lon_0=7.43958333333333 +k_0=1 +x_0=600000 +y_0=200000 +ellps=bessel +towgs84=674.374,15.056,405.346,0,0,0,0 +units=m +no_defs +type=crs',\n // bound is coming from https://epsg.io/21781\n bounds: new CoordinateSystemBounds({\n lowerX: 485071.58,\n upperX: 837119.8,\n lowerY: 74261.72,\n upperY: 299941.79,\n }),\n usesMercatorPyramid: false,\n })\n }\n}\n","import CoordinateSystemBounds from '@/proj/CoordinateSystemBounds'\nimport SwissCoordinateSystem from '@/proj/SwissCoordinateSystem'\n\nexport default class LV95CoordinateSystem extends SwissCoordinateSystem {\n constructor() {\n super({\n epsgNumber: 2056,\n label: 'CH1903+ / LV95',\n technicalName: 'LV95',\n // matrix is coming fom https://epsg.io/2056.proj4\n proj4transformationMatrix:\n '+proj=somerc +lat_0=46.9524055555556 +lon_0=7.43958333333333 +k_0=1 +x_0=2600000 +y_0=1200000 +ellps=bessel +towgs84=674.374,15.056,405.346,0,0,0,0 +units=m +no_defs +type=crs',\n /**\n * This can be used to constrain OpenLayers (or another mapping framework) to only ask\n * for tiles that are within the extent. It should remove, for instance, the big white\n * zone that is around the pixelkarte-farbe.\n *\n * Values are a ripoff of mf-geoadmin3 (see link below) and are not technically the\n * mathematical bounds of the system, but the limit at which we do not serve data\n * anymore.\n *\n * Those are coordinates expressed in EPSG:2056 (or LV95)\n *\n * @see https://github.com/geoadmin/mf-geoadmin3/blob/0ec560069e93fdceb54ce126a3c2d0ef23a50f45/mk/config.mk#L140\n */\n bounds: new CoordinateSystemBounds({\n lowerX: 2420000,\n upperX: 2900000,\n lowerY: 1030000,\n upperY: 1350000,\n }),\n usesMercatorPyramid: false,\n })\n }\n}\n","import CoordinateSystem, { STANDARD_ZOOM_LEVEL_1_25000_MAP } from '@/proj/CoordinateSystem'\n\n/**\n * Coordinate system with a zoom level/resolution calculation based on the size of the Earth at the\n * equator.\n *\n * These will be used to represent WebMercator and WGS84 among others.\n *\n * @abstract\n * @see https://wiki.openstreetmap.org/wiki/Slippy_map_tilenames#Resolution_and_Scale\n * @see https://wiki.openstreetmap.org/wiki/Zoom_levels\n */\nexport default abstract class StandardCoordinateSystem extends CoordinateSystem {\n /** The index in the resolution list where the 1:25000 zoom level is */\n get1_25000ZoomLevel(): number {\n return STANDARD_ZOOM_LEVEL_1_25000_MAP\n }\n\n getDefaultZoom(): number {\n return STANDARD_ZOOM_LEVEL_1_25000_MAP\n }\n}\n","import { round } from '@swissgeo/numbers'\nimport proj4 from 'proj4'\n\nimport type { SingleCoordinate } from '@/coordinatesUtils'\n\nimport { WGS84 } from '@/proj'\nimport { PIXEL_LENGTH_IN_KM_AT_ZOOM_ZERO_WITH_256PX_TILES } from '@/proj/CoordinateSystem'\nimport CoordinateSystemBounds from '@/proj/CoordinateSystemBounds'\nimport StandardCoordinateSystem from '@/proj/StandardCoordinateSystem'\n\nexport default class WebMercatorCoordinateSystem extends StandardCoordinateSystem {\n constructor() {\n super({\n epsgNumber: 3857,\n label: 'WebMercator',\n // matrix comes from https://epsg.io/3857.proj4\n proj4transformationMatrix:\n '+proj=merc +a=6378137 +b=6378137 +lat_ts=0 +lon_0=0 +x_0=0 +y_0=0 +k=1 +units=m +nadgrids=@null +wktext +no_defs +type=proj',\n // bounds are coming from https://github.com/geoadmin/lib-gatilegrid/blob/58d6e574b69d32740a24edbc086d97897d4b41dc/gatilegrid/tilegrids.py#L122-L125\n bounds: new CoordinateSystemBounds({\n lowerX: -20037508.342789244,\n upperX: 20037508.342789244,\n lowerY: -20037508.342789244,\n upperY: 20037508.342789244,\n // center of LV95's extent transformed with epsg.io website\n customCenter: [917209.87, 5914737.43],\n }),\n usesMercatorPyramid: true,\n })\n }\n\n roundCoordinateValue(value: number): number {\n return round(value, 2)\n }\n\n /**\n * Formula comes from\n * https://wiki.openstreetmap.org/wiki/Slippy_map_tilenames#Resolution_and_Scale\n *\n * resolution = 156543.03 meters / pixel * cos(latitude) / (2 ^ zoom level)\n */\n getResolutionForZoom(zoom: number, center: SingleCoordinate): number {\n const centerInRad = proj4(this.epsg, WGS84.epsg, center).map(\n (coordinate) => (coordinate * Math.PI) / 180.0\n )\n if (typeof centerInRad[1] !== 'number') {\n return 0\n }\n return round(\n Math.abs(\n (PIXEL_LENGTH_IN_KM_AT_ZOOM_ZERO_WITH_256PX_TILES * Math.cos(centerInRad[1])) /\n Math.pow(2, zoom)\n ),\n 2\n )\n }\n\n /**\n * Calculating zoom level by reversing formula from\n * https://wiki.openstreetmap.org/wiki/Slippy_map_tilenames#Resolution_and_Scale :\n *\n * resolution = 156543.03 * cos(latitude) / (2 ^ zoom level)\n *\n * So that\n *\n * zoom level = log2( resolution / 156543.03 / cos(latitude) )\n *\n * @param resolution Resolution in meter/pixel\n * @param center As the use an equatorial constant to calculate the zoom level, we need to know\n * the latitude of the position the resolution must be calculated at, as we need to take into\n * account the deformation of the WebMercator projection (that is greater the further north we\n * are)\n */\n getZoomForResolution(resolution: number, center: SingleCoordinate): number {\n const centerInRad = proj4(this.epsg, WGS84.epsg, center).map(\n (coordinate) => (coordinate * Math.PI) / 180.0\n )\n if (typeof centerInRad[1] !== 'number') {\n return 0\n }\n return Math.abs(\n Math.log2(\n resolution /\n PIXEL_LENGTH_IN_KM_AT_ZOOM_ZERO_WITH_256PX_TILES /\n Math.cos(centerInRad[1])\n )\n )\n }\n}\n","import { round } from '@swissgeo/numbers'\n\nimport type { SingleCoordinate } from '@/coordinatesUtils'\n\nimport { PIXEL_LENGTH_IN_KM_AT_ZOOM_ZERO_WITH_256PX_TILES } from '@/proj/CoordinateSystem'\nimport CoordinateSystemBounds from '@/proj/CoordinateSystemBounds'\nimport StandardCoordinateSystem from '@/proj/StandardCoordinateSystem'\n\nexport default class WGS84CoordinateSystem extends StandardCoordinateSystem {\n constructor() {\n super({\n epsgNumber: 4326,\n label: 'WGS 84 (lat/lon)',\n // matrix comes from https://epsg.io/4326.proj4\n proj4transformationMatrix: '+proj=longlat +datum=WGS84 +no_defs +type=proj',\n bounds: new CoordinateSystemBounds({\n lowerX: -180.0,\n upperX: 180.0,\n lowerY: -90.0,\n upperY: 90.0,\n // center of LV95's extent transformed with epsg.io website\n customCenter: [8.239436, 46.832259],\n }),\n usesMercatorPyramid: true,\n })\n }\n\n roundCoordinateValue(value: number): number {\n // a precision of 6 digits means we can track position with 0.111m accuracy\n // see http://wiki.gis.com/wiki/index.php/Decimal_degrees\n return round(value, 6)\n }\n\n /**\n * Formula comes from\n * https://wiki.openstreetmap.org/wiki/Slippy_map_tilenames#Resolution_and_Scale\n *\n * resolution = 156543.03 meters / pixel * cos(latitude) / (2 ^ zoom level)\n */\n getResolutionForZoom(zoom: number, center: SingleCoordinate): number {\n return round(\n Math.abs(\n (PIXEL_LENGTH_IN_KM_AT_ZOOM_ZERO_WITH_256PX_TILES *\n Math.cos((center[1] * Math.PI) / 180.0)) /\n Math.pow(2, zoom)\n ),\n 2\n )\n }\n\n /**\n * Ensures an extent is in X,Y order (longitude, latitude). If coordinates are in Y,X order\n * (latitude, longitude), swaps them. WGS84 traditionally uses latitude-first (Y,X) axis order\n * [minY, minX, maxY, maxX] Some WGS84 implementations may use X,Y order therefore we need to\n * check and swap if needed.\n *\n * TODO: This method works for the common coordinates in and around switzerland but will not\n * work for the whole world. Therefore a better solution should be implemented if we want to\n * support coordinates and extents of the whole world.\n *\n * @param extent - Input extent [minX, minY, maxX, maxY] or [minY, minX, maxY, maxX]\n * @returns Extent guaranteed to be in [minX, minY, maxX, maxY] order\n * @link Problem description https://docs.geotools.org/latest/userguide/library/referencing/order.html\n */\n getExtentInOrderXY(extent: [number, number, number, number]): [number, number, number, number] {\n if (extent[0] > extent[1]) {\n return [extent[1], extent[0], extent[3], extent[2]]\n }\n return extent\n }\n\n /**\n * Calculating zoom level by reversing the formula from\n * https://wiki.openstreetmap.org/wiki/Slippy_map_tilenames#Resolution_and_Scale :\n *\n * resolution = 156543.03 * cos(latitude) / (2 ^ zoom level)\n *\n * So that\n *\n * zoom level = log2( resolution / 156543.03 / cos(latitude) )\n *\n * @param resolution Resolution in meter/pixel\n * @param center As we use an equatorial constant to calculate the zoom level, we need to know\n * the latitude of the position the resolution must be calculated at, as we need to take into\n * account the deformation of the WebMercator projection (that is greater the further north we\n * are)\n */\n getZoomForResolution(resolution: number, center: SingleCoordinate): number {\n return Math.abs(\n Math.log2(\n resolution /\n PIXEL_LENGTH_IN_KM_AT_ZOOM_ZERO_WITH_256PX_TILES /\n Math.cos((center[1] * Math.PI) / 180.0)\n )\n )\n }\n}\n","import CoordinateSystem, {\n STANDARD_ZOOM_LEVEL_1_25000_MAP,\n SWISS_ZOOM_LEVEL_1_25000_MAP,\n} from '@/proj/CoordinateSystem'\nimport CoordinateSystemBounds from '@/proj/CoordinateSystemBounds'\nimport CustomCoordinateSystem from '@/proj/CustomCoordinateSystem'\nimport LV03CoordinateSystem from '@/proj/LV03CoordinateSystem'\nimport LV95CoordinateSystem from '@/proj/LV95CoordinateSystem'\nimport StandardCoordinateSystem from '@/proj/StandardCoordinateSystem'\nimport SwissCoordinateSystem, {\n LV95_RESOLUTIONS,\n SWISSTOPO_TILEGRID_RESOLUTIONS,\n} from '@/proj/SwissCoordinateSystem'\nimport WebMercatorCoordinateSystem from '@/proj/WebMercatorCoordinateSystem'\nimport WGS84CoordinateSystem from '@/proj/WGS84CoordinateSystem'\n\nexport const LV95: LV95CoordinateSystem = new LV95CoordinateSystem()\nexport const LV03: LV03CoordinateSystem = new LV03CoordinateSystem()\nexport const WGS84: WGS84CoordinateSystem = new WGS84CoordinateSystem()\nexport const WEBMERCATOR: WebMercatorCoordinateSystem = new WebMercatorCoordinateSystem()\n\nexport type * from '@/proj/types'\n\n/** Representation of many (available in this app) projection systems */\nexport const allCoordinateSystems: CoordinateSystem[] = [LV95, LV03, WGS84, WEBMERCATOR]\n\ninterface SwissGeoCoordinateConstants {\n STANDARD_ZOOM_LEVEL_1_25000_MAP: number\n SWISS_ZOOM_LEVEL_1_25000_MAP: number\n LV95_RESOLUTIONS: number[]\n SWISSTOPO_TILEGRID_RESOLUTIONS: number[]\n}\n\nconst constants: SwissGeoCoordinateConstants = {\n STANDARD_ZOOM_LEVEL_1_25000_MAP,\n SWISS_ZOOM_LEVEL_1_25000_MAP,\n LV95_RESOLUTIONS,\n SWISSTOPO_TILEGRID_RESOLUTIONS,\n}\n\nexport interface SwissGeoCoordinateCRS {\n LV95: LV95CoordinateSystem\n LV03: LV03CoordinateSystem\n WGS84: WGS84CoordinateSystem\n WEBMERCATOR: WebMercatorCoordinateSystem\n allCoordinateSystems: CoordinateSystem[]\n}\n\nconst crs: SwissGeoCoordinateCRS = {\n LV95,\n LV03,\n WGS84,\n WEBMERCATOR,\n allCoordinateSystems,\n}\nexport {\n crs,\n constants,\n CoordinateSystem,\n CoordinateSystemBounds,\n CustomCoordinateSystem,\n StandardCoordinateSystem,\n SwissCoordinateSystem,\n}\nexport default crs\n"],"names":["globals","defs","PJD_3PARAM","PJD_7PARAM","PJD_GRIDSHIFT","PJD_WGS84","PJD_NODATUM","SRS_WGS84_SEMIMAJOR","SRS_WGS84_SEMIMINOR","SRS_WGS84_ESQUARED","SEC_TO_RAD","HALF_PI","SIXTH","RA4","RA6","EPSLN","D2R","R2D","FORTPI","TWO_PI","SPI","primeMeridian","units","ignoredChar","match","obj","key","keys","lkey","i","testkey","processedKey","projStr","defData","self","paramObj","v","a","p","split","paramName","paramVal","paramOutname","params","unit","pm","PrimeMeridian","legalAxis","PROJJSONBuilderBase","node","idNode","child","type","name","conversionFactor","id","direction","abbreviationMatch","abbreviation","orderNode","order","unitNode","axis","b","result","csNode","lengthUnitNode","datumOrEnsembleNode","datumOrEnsemble","primem","member","accuracyNode","ellipsoidNode","param","sourceCrsNode","sourceCrsContent","targetCrsNode","targetCrsContent","transformationNode","scaleDifference","PROJJSONBuilder2015","PROJJSONBuilder2019","usageNode","scope","area","bbox","detectWKT2Version","root","buildPROJJSON","detectWKTVersion","wkt","normalizedWKT","NEUTRAL","KEYWORD","NUMBER","QUOTED","AFTERQUOTE","ENDED","whitespace","latin","keyword","endThings","digets","Parser","text","char","newObjects","parseString","txt","parser","mapit","value","thing","out","newObj","item","sExpr","d2r","input","applyProjectionDefaults","normalizedProjName","processUnit","toValue","valueOrObject","calculateEllipsoid","transformPROJJSON","projjson","to_meter","paramValue","knownTypes","rename","outName","inName","cleanWKT","ii","setPropertiesFromWkt","authority","axisOrder","geogcs","toMeter","ratio","renamer","list","version","lisp","that","def","parseProj","testObj","code","testDef","testWKT","codes","checkMercator","auth","checkProjStr","ext","testProj","parse","maybeProjStr","extend$1","destination","source","property","msfnz","eccent","sinphi","cosphi","con","sign","x","adjust_lon","skipAdjust","tsfnz","phi","com","phi2z","ts","eccnth","dphi","init","forward","lon","lat","y","inverse","names","merc","identity","pt","longlat","projs","projStore","add","proj","len","n","getNormalizedProjName","get","start","projections","ellipsoids","WGS84","Ellipsoid","eccentricity","rf","R_A","a2","b2","es","e","ep2","sphere","ellps","ellipse","datums","datum","datumCode","datum_params","nadgrids","loadedNadgrids","nadgrid","data","options","readNTV2Grid","readGeotiffGrid","includeErrorFields","view","isLittleEndian","detectLittleEndian","header","readHeader","subgrids","readSubgrids","tiff","subGridCount","subgridIndex","image","rasters","lim","imageBBoxRadians","degreesToRadians","del","maxX","minY","latitudeOffsetBand","longitudeOffsetBand","nodes","j","index","secondsToRadians","tifGrid","getNadgrids","grids","parseNadgridString","optional","degrees","seconds","nFields","decodeString","end","gridOffset","subHeader","readGridHeader","readGridNodes","lngColumnCount","latColumnCount","mapNodes","rowSize","r","offset","gridHeader","nodesOffset","gridRecordLength","gridShiftRecords","record","Projection","srsCode","callback","error","json","parseCode","ourProj","datumDef","Datum","sphere_","dc_sphere","ecc","dc_eccentricity","datumObj","extend","compareDatums","dest","geodeticToGeocentric","Longitude","Latitude","Height","Rn","Sin_Lat","Sin2_Lat","Cos_Lat","geocentricToGeodetic","genau","genau2","maxiter","P","RR","CT","ST","RX","RK","RN","CPHI0","SPHI0","CPHI","SPHI","SDPHI","iter","X","Y","Z","geocentricToWgs84","datum_type","Dx_BF","Dy_BF","Dz_BF","Rx_BF","Ry_BF","Rz_BF","M_BF","geocentricFromWgs84","x_tmp","y_tmp","z_tmp","checkParams","datum_transform","point","source_a","source_es","gridShiftCode","applyGridShift","dest_a","dest_b","dest_es","destGridShiftResult","output","attemptedGrids","outer","grid","jj","subgrid","epsilon","minX","maxY","applySubgridShift","pin","ct","val","tb","t","nadInterpolate","tol","dif","indx","frct","inx","f00","f10","f11","f01","m11","m10","m00","m01","adjust_axis","crs","denorm","xin","yin","zin","common","array","checkSanity","checkCoord","num","checkNotWGS","transform","enforceAxis","wgs84","toPoint","hasZ","transformer","from","to","coords","transformedArray","checkProj","proj4","fromProjOrToProj","toProjOrCoord","coord","fromProj","toProj","single","NUM_100K_SETS","SET_ORIGIN_COLUMN_LETTERS","SET_ORIGIN_ROW_LETTERS","A","I","O","V","mgrs","ll","accuracy","encode","LLtoUTM","UTMtoLL","decode","degToRad","deg","radToDeg","rad","Lat","Long","eccSquared","k0","LongOrigin","eccPrimeSquared","N","T","C","M","LatRad","LongRad","LongOriginRad","ZoneNumber","UTMEasting","UTMNorthing","getLetterDesignator","utm","zoneLetter","zoneNumber","e1","N1","T1","C1","R1","D","mu","phi1Rad","topRight","LetterDesignator","seasting","snorthing","get100kID","easting","northing","setParm","get100kSetForZone","setColumn","setRow","getLetter100kID","column","row","parm","colOrigin","rowOrigin","colInt","rowInt","rollover","twoLetter","mgrsString","length","hunK","sb","testChar","set","east100k","getEastingFromChar","north100k","getNorthingFromChar","getMinNorthing","remainder","sep","sepEasting","sepNorthing","accuracyBonus","sepEastingString","sepNorthingString","curCol","eastingValue","rewindMarker","curRow","northingValue","Point","z","mgrsStr","C00","C02","C04","C06","C08","C22","C44","C46","C48","C66","C68","C88","pj_enfn","en","pj_mlfn","sphi","cphi","MAX_ITER","pj_inv_mlfn","arg","k","s","delta_lon","sin_phi","cos_phi","al","als","c","cs","tq","ml","tan_phi","d","ds","f","g","temp","h","tmerc","sinh","hypot","log1py","asinhy","gatg","pp","B","cos_2B","h1","h2","clens","arg_r","hr1","hr2","hr","cosh","clens_cmplx","arg_i","sin_arg_r","cos_arg_r","sinh_arg_i","cosh_arg_i","hi1","hi","hi2","np","Ce","Cn","sin_Cn","cos_Cn","sin_Ce","cos_Ce","tmp","etmerc","adjust_zone","zone","dependsOn","srat","esinp","exp","DEL_TOL","gauss","sinc","cosc","cosl","rho","sterea","ssfn_","phit","eccen","sinlat","coslat","sinX","cosX","rh","dlon","ce","Chi","stere","phy0","sinPhy0","semiMajorAxis","invF","flattening","e2","k1","k2","k3","Sa1","Sa2","S","rotI","rotB","lambda","phy","prevPhy","iteration","somerc","TOL","isTypeA","typeAProjections","projectionName","cosph0","F","H","L","sinph0","J","gamma","gamma0","lamc","lam1","lam2","phi1","phi2","alpha_c","alp","gam","one_es","U","W","u","Qp","Sp","Tp","Vp","Up","omerc","sin1","cos1","ms1","ts1","sin2","cos2","ms2","ts2","ts0","rh1","theta","lcc","gfi","deltav","eps","ro","fi1","ok","krovak","mlfn","e0","e3","e0fn","e1fn","e2fn","e3fn","gN","adjust_lat","imlfn","lam","nl","tl","asq","cl","dd","ml1","nl1","rl1","tl1","dl","dsq","cass","qsfnz","S_POLE","N_POLE","EQUIT","OBLIQ","authset","coslam","sinlam","q","sinb","cosb","cCe","sCe","ab","cosz","sinz","authlat","P00","P01","P02","P10","P11","P20","APA","beta","laea","asinz","qs","phi1z","eccnts","aea","coslon","ksp","gnom","iqsfnz","cea","dlat","eqc","el","bl","tanphi","mln","mlnp","ma","poly","delta_lat","d_phi","d_lambda","d_phi_n","d_psi","th_re","th_im","th_n_re","th_n_im","th_n_re1","th_n_im1","z_re","z_im","delta_x","delta_y","z_n_re","z_n_im","z_n_re1","z_n_im1","num_re","num_im","den_re","den_im","den2","d_psi_n","nzmg","mill","sinu","delta_theta","moll","eqdc","sinth","costh","gsq","m","msq","xx","yy","xys","c1","c2","c3","a1","m1","th1","vandg","vincentyInverse","lat1","lon1","lat2","lon2","U1","U2","sinU1","cosU1","sinU2","cosU2","lambdaP","iterLimit","sinLambda","cosLambda","sinSigma","cosSigma","sigma","sinAlpha","cos2Alpha","cos2SigmaM","uSq","deltaSigma","vincentyDirect","azi1","s12","sinAlpha1","cosAlpha1","sigma1","sigmaP","Mlp","Ml","kp","cos_c","vars","aeqd","ortho","FACE_ENUM","AREA_ENUM","xy","sinlon","qsc_shift_lon_origin","qsc_fwd_equat_face_theta","lp","nu","cosmu","tannu","tantheta","invert_sign","xa","slon","qsc","COEFS_X","COEFS_Y","FXC","FYC","RC1","NODES","poly3_val","coefs","poly3_der","newton_rapshon","f_df","max_err","iters","upd","robin","geocent","mode","omega","yt","ba","bm","bq","tpers","rone_es","v_x","v_y","v_z","det","v_zp","geos","A1","A2","A3","A4","paramLat","paramLatSq","paramLatPow6","EPS","NITER","fy","fpy","eqearth","EPS10","e_inv","e_fwd","s_inv","s_fwd","E","bonne","projectionType","forwardOblique","inverseOblique","forwardTransverse","inverseTransverse","paramSets","longLatNames","newProjStr","oProj","Proj","matchedSet","paramSetsKeys","parseParam","setKey","inputParam","lamp","phip","createRotation","how","phic","alpha","innerLp","ob_tran","includedProjections","core","earthRadius","factors","feature","geom","properties","feat","coordinates","isNumber","points","featureCollection","polygon","ring","lineString","features","fc","multiLineString","multiPolygon","radiansToLength","radians","factor","lengthToRadians","distance","radiansToDegrees","isObject","getCoord","getCoords","getGeom","geojson","getType","_name","coordinates1","coordinates2","dLat","dLon","coordEach","excludeWrapCoord","l","geometry","stopG","geometryMaybeCollection","wrapShrink","coordIndex","isGeometryCollection","isFeatureCollection","isFeature","stop","featureIndex","geomIndex","multiFeatureIndex","geometryIndex","geomType","featureEach","featureReduce","initialValue","previousValue","currentFeature","geomEach","featureProperties","featureBBox","featureId","flattenEach","coordinate","bboxPolygon","west","south","east","north","lowLeft","splitter","resulterrbound","sum","elen","flen","Q","Qnew","hh","bvirt","enow","fnow","eindex","findex","hindex","estimate","vec","ccwerrboundA","ccwerrboundB","ccwerrboundC","C2","orient2dadapt","ax","ay","bx","by","cx","cy","detsum","acxtail","acytail","bcxtail","bcytail","ahi","alo","bhi","blo","_i","_j","_0","s1","s0","t1","t0","u3","acx","bcx","acy","bcy","errbound","C1len","C2len","Dlen","orient2d","detleft","detright","pointInPolygon","u1","v1","u2","v2","currentP","nextP","numContours","contour","contourLen","booleanPointInPolygon","polys","inBBox","polyResult","pip","TinyQueue","compare","defaultCompare","top","bottom","pos","parent","current","halfLength","left","best","right","checkWhichEventIsLeft","checkWhichSegmentHasRightEndpointFirst","seg1","seg2","Event","ringId","eventId","eventToCheck","fillEventQueue","eventQueue","processFeature","featureOrGeometry","iii","Segment","event","testSegmentIntersect","x1","y1","x2","y2","x3","y3","x4","y4","denom","numeA","numeB","uA","uB","runCheck","ignoreSelfIntersections","intersectionPoints","outQueue","segment","otherSeg","intersection","sweeplineIntersections","lib","lineIntersect","line1","line2","removeDuplicates","intersections","results","unique","quickselect","arr","quickselectStep","sd","newLeft","newRight","swap","RBush","maxEntries","intersects","toBBox","nodesToSearch","childBBox","contains","tmpNode","createNode","equalsFn","path","indexes","goingUp","findItem","items","height","calcBBox","N2","multiSelect","right2","right3","level","minArea","minEnlargement","targetNode","bboxArea","enlargement","enlargedArea","isNode","insertPath","splitIndex","newNode","minOverlap","bbox1","distBBox","bbox2","overlap","intersectionArea","compareMinX","compareNodeMinX","compareMinY","compareNodeMinY","xMargin","yMargin","leftBBox","rightBBox","margin","bboxMargin","siblings","destNode","children","stack","mid","geojsonRbush","tree","rbush","turfBBox","load","equals","lineSegment","lineSegmentFeature","createSegments","segments","previousCoords","currentCoords","coords1","coords2","__defProp","__defProps","__getOwnPropDescs","__getOwnPropSymbols","__hasOwnProp","__propIsEnum","__defNormalProp","__spreadValues","prop","__spreadProps","nearestPointOnLine","lines","ptPos","closestPt","line","_featureIndex","startPos","stopPos","sectionLength","intersectPos","wasEnd","nearestPointOnSegment","intersectPt","dot","v1x","v1y","v1z","v2x","v2y","v2z","cross","magnitude","normalize","mag","lngLatToVector","lng","vectorToLngLat","zClamp","posA","posB","posC","segmentAxis","targetAxis","intersectionAxis","I1","I2","segmentAxisNorm","cmpAI","cmpIB","truncate","precision","mutate","truncateCoords","lineSplit","lineType","splitterType","truncatedSplitter","splitLineWithPoint","splitLineWithPoints","search","closestLine","findClosestFeature","startPoint","endPoint","pointsEquals","closestSegment","lastCoords","previous","splitterCoords","closestFeature","closestDistance","dist","pt1","pt2","undefined","VERSION","LARGE_ARRAY_SIZE","CORE_ERROR_TEXT","FUNC_ERROR_TEXT","INVALID_TEMPL_VAR_ERROR_TEXT","HASH_UNDEFINED","MAX_MEMOIZE_SIZE","PLACEHOLDER","CLONE_DEEP_FLAG","CLONE_FLAT_FLAG","CLONE_SYMBOLS_FLAG","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","WRAP_BIND_FLAG","WRAP_BIND_KEY_FLAG","WRAP_CURRY_BOUND_FLAG","WRAP_CURRY_FLAG","WRAP_CURRY_RIGHT_FLAG","WRAP_PARTIAL_FLAG","WRAP_PARTIAL_RIGHT_FLAG","WRAP_ARY_FLAG","WRAP_REARG_FLAG","WRAP_FLIP_FLAG","DEFAULT_TRUNC_LENGTH","DEFAULT_TRUNC_OMISSION","HOT_COUNT","HOT_SPAN","LAZY_FILTER_FLAG","LAZY_MAP_FLAG","LAZY_WHILE_FLAG","INFINITY","MAX_SAFE_INTEGER","MAX_INTEGER","NAN","MAX_ARRAY_LENGTH","MAX_ARRAY_INDEX","HALF_MAX_ARRAY_LENGTH","wrapFlags","argsTag","arrayTag","asyncTag","boolTag","dateTag","domExcTag","errorTag","funcTag","genTag","mapTag","numberTag","nullTag","objectTag","promiseTag","proxyTag","regexpTag","setTag","stringTag","symbolTag","undefinedTag","weakMapTag","weakSetTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrimStart","reWhitespace","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reForbiddenIdentifierChars","reEscapeChar","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsHostCtor","reIsOctal","reIsUint","reLatin","reNoMatch","reUnescapedString","rsAstralRange","rsComboMarksRange","reComboHalfMarksRange","rsComboSymbolsRange","rsComboRange","rsDingbatRange","rsLowerRange","rsMathOpRange","rsNonCharRange","rsPunctuationRange","rsSpaceRange","rsUpperRange","rsVarRange","rsBreakRange","rsApos","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsModifier","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsZWJ","rsMiscLower","rsMiscUpper","rsOptContrLower","rsOptContrUpper","reOptMod","rsOptVar","rsOptJoin","rsOrdLower","rsOrdUpper","rsSeq","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","deburredLetters","htmlEscapes","htmlUnescapes","stringEscapes","freeParseFloat","freeParseInt","freeGlobal","global","freeSelf","freeExports","exports","freeModule","module","moduleExports","freeProcess","nodeUtil","types","nodeIsArrayBuffer","nodeIsDate","nodeIsMap","nodeIsRegExp","nodeIsSet","nodeIsTypedArray","apply","func","thisArg","args","arrayAggregator","setter","iteratee","accumulator","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","arrayPush","values","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","asciiToArray","string","asciiWords","baseFindKey","collection","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","object","basePropertyOf","baseReduce","baseSortBy","comparer","baseTimes","baseToPairs","props","baseTrim","trimmedEndIndex","baseUnary","baseValues","cacheHas","cache","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","countHolders","placeholder","deburrLetter","escapeHtmlChar","escapeStringChar","chr","getValue","hasUnicode","hasUnicodeWord","iteratorToArray","iterator","mapToArray","map","overArg","replaceHolders","setToArray","setToPairs","strictLastIndexOf","stringSize","unicodeSize","stringToArray","unicodeToArray","unescapeHtmlChar","unicodeWords","runInContext","context","_","Array","Date","Error","Function","Math","Object","RegExp","String","TypeError","arrayProto","funcProto","objectProto","coreJsData","funcToString","hasOwnProperty","idCounter","maskSrcKey","uid","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Symbol","Uint8Array","allocUnsafe","getPrototype","objectCreate","propertyIsEnumerable","splice","spreadableSymbol","symIterator","symToStringTag","defineProperty","getNative","ctxClearTimeout","ctxNow","ctxSetTimeout","nativeCeil","nativeFloor","nativeGetSymbols","nativeIsBuffer","nativeIsFinite","nativeJoin","nativeKeys","nativeMax","nativeMin","nativeNow","nativeParseInt","nativeRandom","nativeReverse","DataView","Map","Promise","Set","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","symbolToString","lodash","isObjectLike","isArray","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","proto","baseLodash","chainAll","lazyClone","copyArray","lazyReverse","lazyValue","dir","isArr","isRight","arrLength","getView","iteratees","iterLength","takeCount","baseWrapperValue","iterIndex","computed","Hash","entries","entry","hashClear","hashDelete","hashGet","hashHas","hashSet","ListCache","listCacheClear","listCacheDelete","assocIndexOf","lastIndex","listCacheGet","listCacheHas","listCacheSet","MapCache","mapCacheClear","mapCacheDelete","getMapData","mapCacheGet","mapCacheHas","mapCacheSet","size","SetCache","setCacheAdd","setCacheHas","Stack","stackClear","stackDelete","stackGet","stackHas","stackSet","pairs","arrayLikeKeys","inherited","isArg","isArguments","isBuff","isBuffer","isType","isTypedArray","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","baseAggregator","baseEach","baseAssign","copyObject","baseAssignIn","keysIn","baseAt","paths","skip","number","lower","upper","baseClone","bitmask","customizer","isDeep","isFlat","isFull","initCloneArray","tag","getTag","isFunc","cloneBuffer","initCloneObject","copySymbolsIn","copySymbols","initCloneByTag","stacked","isSet","subValue","isMap","keysFunc","getAllKeysIn","getAllKeys","baseConforms","baseConformsTo","baseDelay","wait","setTimeout","baseDifference","includes","isCommon","valuesLength","valuesIndex","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFill","toInteger","toLength","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","castPath","toKey","baseGetAllKeys","symbolsFunc","baseGetTag","getRawTag","objectToString","baseGt","other","baseHas","baseHasIn","baseInRange","baseIntersection","arrays","othLength","othIndex","caches","maxLength","seen","baseInverter","baseInvoke","last","baseIsArguments","baseIsArrayBuffer","baseIsDate","baseIsEqual","baseIsEqualDeep","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","equalObjects","baseIsMap","baseIsMatch","matchData","noCustomizer","srcValue","baseIsNative","isMasked","pattern","baseIsRegExp","baseIsSet","baseIsTypedArray","isLength","baseIteratee","baseMatchesProperty","baseMatches","baseKeys","isPrototype","baseKeysIn","nativeKeysIn","isProto","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","baseMergeDeep","newValue","safeGet","mergeFunc","isTyped","isArrayLikeObject","cloneTypedArray","isPlainObject","toPlainObject","baseNth","baseOrderBy","orders","getIteratee","criteria","compareMultiple","basePick","basePickBy","baseSet","basePropertyDeep","basePullAll","indexOf","basePullAt","baseUnset","baseRange","step","baseRepeat","baseRest","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","baseSome","baseSortedIndex","retHighest","low","high","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","toString","castRest","castSlice","clearTimeout","buffer","cloneArrayBuffer","arrayBuffer","cloneDataView","dataView","cloneRegExp","regexp","cloneSymbol","symbol","typedArray","compareAscending","valIsDefined","valIsReflexive","objCriteria","othCriteria","ordersLength","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","getSymbols","getSymbolsIn","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createBind","isBind","Ctor","createCtor","wrapper","fn","createCaseFirst","methodName","trailing","createCompounder","words","deburr","thisBinding","createCurry","arity","getHolder","createRecurry","createHybrid","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","getFuncName","funcName","getData","isLaziable","partialsRight","holdersRight","argPos","ary","isAry","isBindKey","isFlip","holdersCount","newHolders","reorder","createInverter","toIteratee","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createPartial","createRange","toFinite","createRelationalOperation","toNumber","wrapFunc","isCurry","newHoldersRight","newPartials","newPartialsRight","newData","setData","setWrapToString","createRound","pair","noop","createToPairs","createWrap","mergeData","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","isPartial","arrStacked","othStacked","arrValue","othValue","compared","convert","objProps","objLength","othProps","objStacked","skipCtor","objCtor","othCtor","flatten","otherFunc","isKeyable","isOwn","unmasked","stubArray","ctorString","transforms","getWrapDetails","hasPath","hasFunc","insertWrapDetails","details","isMaskable","stubFalse","memoizeCapped","memoize","srcBitmask","newBitmask","isCombo","otherArgs","oldArray","shortOut","reference","updateWrapDetails","count","lastCalled","stamp","remaining","rand","quote","subString","chunk","compact","concat","difference","differenceBy","differenceWith","drop","dropRight","dropRightWhile","dropWhile","fill","findIndex","findLastIndex","flattenDeep","flattenDepth","fromPairs","head","initial","mapped","intersectionBy","intersectionWith","join","separator","lastIndexOf","nth","pull","pullAll","pullAllBy","pullAllWith","pullAt","remove","reverse","slice","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","sortedUniq","sortedUniqBy","tail","take","takeRight","takeRightWhile","takeWhile","union","unionBy","unionWith","uniq","uniqBy","uniqWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipObject","zipObjectDeep","zipWith","chain","tap","interceptor","thru","wrapperAt","wrapperChain","wrapperCommit","wrapperNext","toArray","done","wrapperToIterator","wrapperPlant","clone","wrapperReverse","wrapped","wrapperValue","countBy","every","filter","find","findLast","flatMap","flatMapDeep","flatMapDepth","forEach","forEachRight","groupBy","isString","invokeMap","keyBy","orderBy","partition","reduce","reduceRight","reject","negate","sample","sampleSize","shuffle","some","sortBy","now","after","before","bind","bindKey","curry","curryRight","debounce","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","time","leadingEdge","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","trailingEdge","cancel","flush","debounced","isInvoking","defer","delay","flip","resolver","memoized","once","overArgs","funcsLength","partial","partialRight","rearg","rest","spread","throttle","unary","wrap","castArray","cloneWith","cloneDeep","cloneDeepWith","conformsTo","gt","gte","isArrayBuffer","isBoolean","isDate","isElement","isEmpty","isEqual","isEqualWith","isError","isFinite","isInteger","isMatch","isMatchWith","isNaN","isNative","isNull","isNil","isRegExp","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lt","lte","isBinary","toSafeInteger","assign","assignIn","assignInWith","assignWith","at","create","prototype","defaults","propsIndex","propsLength","defaultsDeep","mergeWith","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","functions","functionsIn","has","invert","invertBy","invoke","mapKeys","mapValues","merge","omit","omitBy","pickBy","pick","setWith","toPairs","toPairsIn","isArrLike","unset","update","updateWith","valuesIn","clamp","inRange","random","floating","camelCase","word","capitalize","upperFirst","endsWith","target","position","escape","escapeRegExp","kebabCase","lowerCase","lowerFirst","pad","strLength","padEnd","padStart","parseInt","radix","repeat","replace","snakeCase","limit","startCase","startsWith","template","settings","imports","importsKeys","importsValues","isEscaping","isEvaluating","interpolate","reDelimiters","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","variable","attempt","toLower","toUpper","trim","trimEnd","trimStart","omission","substring","newEnd","unescape","upperCase","bindAll","methodNames","cond","conforms","defaultTo","flow","flowRight","matches","matchesProperty","method","methodOf","mixin","noConflict","nthArg","over","overEvery","overSome","propertyOf","range","rangeRight","stubObject","stubString","stubTrue","times","toPath","uniqueId","prefix","augend","addend","ceil","divide","dividend","divisor","floor","max","maxBy","mean","meanBy","min","minBy","multiply","multiplier","multiplicand","round","subtract","minuend","subtrahend","sumBy","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","this","reassembleLineSegments","origin","candidateFeatures","orderedFeatures","closest","closestOrigin","CoordinateSystemBounds","lowerX","upperX","lowerY","upperY","customCenter","xOrCoordinate","boundsAsPolygon","STANDARD_ZOOM_LEVEL_1_25000_MAP","SWISS_ZOOM_LEVEL_1_25000_MAP","PIXEL_LENGTH_IN_KM_AT_ZOOM_ZERO_WITH_256PX_TILES","CoordinateSystem","epsgNumber","label","proj4transformationMatrix","bounds","technicalName","usesMercatorPyramid","coordinateSystem","newBottomLeft","newTopRight","zoom","latitude","zoom0PixelSizeInMeters","resolutions","latInRad","matrixIds","CustomCoordinateSystem","LV95_RESOLUTIONS","SWISSTOPO_TILEGRID_RESOLUTIONS","SWISSTOPO_TILEGRID_ZOOM_TO_STANDARD_ZOOM_MATRIX","SWISSTOPO_ZOOM_TO_PRODUCT_SCALE","swisstopoZoomLevels","SwissCoordinateSystem","resolution","standardZoomLevel","customZoomLevel","roundedZoom","matchingResolution","lv95Resolution","smallestResolution","LV03CoordinateSystem","LV95CoordinateSystem","StandardCoordinateSystem","WebMercatorCoordinateSystem","center","centerInRad","WGS84CoordinateSystem","extent","LV95","LV03","WEBMERCATOR","allCoordinateSystems","constants"],"mappings":"AAAe,SAAAA,GAAUC,GAAM;AAC7B,EAAAA,EAAK,aAAa,iFAAiF,GACnGA,EAAK,aAAa,iHAAiH,GACnIA,EAAK,aAAa,kJAAkJ;AAEpK,WAAS,IAAI,GAAG,KAAK,IAAI,EAAE;AACzB,IAAAA,EAAK,WAAW,QAAQ,IAAI,qBAAqB,IAAI,wBAAwB,GAC7EA,EAAK,WAAW,QAAQ,IAAI,qBAAqB,IAAI,+BAA+B;AAEtF,EAAAA,EAAK,aAAa,yHAAyH,GAC3IA,EAAK,aAAa,0HAA0H,GAE5IA,EAAK,QAAQA,EAAK,WAAW,GAC7BA,EAAK,WAAW,IAAIA,EAAK,WAAW,GACpCA,EAAK,SAASA,EAAK,WAAW,GAC9BA,EAAK,aAAa,IAAIA,EAAK,WAAW,GACtCA,EAAK,aAAa,IAAIA,EAAK,WAAW;AACxC;ACjBO,IAAIC,KAAa,GACbC,KAAa,GACbC,KAAgB,GAChBC,KAAY,GACZC,KAAc,GACdC,KAAsB,SACtBC,KAAsB,eACtBC,KAAqB,uBACrBC,KAAa,qBACbC,IAAU,KAAK,KAAK,GAEpBC,KAAQ,qBAERC,KAAM,qBAENC,KAAM,sBACNC,IAAQ,OAIRC,KAAM,sBACNC,KAAM,mBACNC,KAAS,KAAK,KAAK,GACnBC,KAAS,KAAK,KAAK,GAKnBC,KAAM,eC5BbC,KAAgB,CAAA;AAEpBA,GAAc,YAAY;AAC1BA,GAAc,SAAS;AACvBA,GAAc,QAAQ;AACtBA,GAAc,SAAS;AACvBA,GAAc,SAAS;AACvBA,GAAc,OAAO;AACrBA,GAAc,OAAO;AACrBA,GAAc,UAAU;AACxBA,GAAc,QAAQ;AACtBA,GAAc,WAAW;AACzBA,GAAc,YAAY;AAC1BA,GAAc,SAAS;AACvBA,GAAc,OAAO;ACdrB,MAAAC,KAAe;AAAA,EACb,IAAI,EAAE,UAAU,KAAK;AAAA,EACrB,IAAI,EAAE,UAAU,KAAI;AAAA,EACpB,IAAI,EAAE,UAAU,OAAM;AAAA,EACtB,SAAS,EAAE,UAAU,OAAO,KAAI;AAAA,EAChC,MAAM,EAAE,UAAU,OAAM;AAAA,EACxB,KAAK,EAAE,UAAU,KAAI;AAAA,EACrB,SAAS,EAAE,UAAU,iBAAgB;AAAA,EACrC,SAAS,EAAE,UAAU,iBAAgB;AAAA,EACrC,IAAI,EAAE,UAAU,IAAI;AAAA,EACpB,UAAU,EAAE,UAAU,WAAU;AAAA,EAChC,UAAU,EAAE,UAAU,WAAU;AAAA,EAChC,IAAI,EAAE,UAAU,SAAQ;AAAA,EACxB,IAAI,EAAE,UAAU,OAAM;AAAA,EACtB,IAAI,EAAE,UAAU,QAAO;AAAA,EACvB,MAAM,EAAE,UAAU,SAAQ;AAAA,EAC1B,IAAI,EAAE,UAAU,IAAG;AAAA,EACnB,IAAI,EAAE,UAAU,OAAM;AAAA,EACtB,UAAU,EAAE,UAAU,YAAW;AAAA,EACjC,SAAS,EAAE,UAAU,kBAAiB;AAAA,EACtC,SAAS,EAAE,UAAU,kBAAiB;AACxC;ACrBA,IAAIC,KAAc;AACH,SAASC,GAAMC,GAAKC,GAAK;AACtC,MAAID,EAAIC,CAAG;AACT,WAAOD,EAAIC,CAAG;AAMhB,WAJIC,IAAO,OAAO,KAAKF,CAAG,GACtBG,IAAOF,EAAI,YAAW,EAAG,QAAQH,IAAa,EAAE,GAChDM,IAAI,IACJC,GAASC,GACN,EAAEF,IAAIF,EAAK;AAGhB,QAFAG,IAAUH,EAAKE,CAAC,GAChBE,IAAeD,EAAQ,YAAW,EAAG,QAAQP,IAAa,EAAE,GACxDQ,MAAiBH;AACnB,aAAOH,EAAIK,CAAO;AAGxB;ACPe,SAAAE,GAAUC,GAAS;AAEhC,MAAIC,IAAO,CAAA,GACPC,IAAWF,EAAQ,MAAM,GAAG,EAAE,IAAI,SAAUG,GAAG;AACjD,WAAOA,EAAE,KAAI;AAAA,EACjB,CAAG,EAAE,OAAO,SAAUC,GAAG;AACrB,WAAOA;AAAA,EACX,CAAG,EAAE,OAAO,SAAUC,GAAGD,GAAG;AAExB,QAAIE,IAAQF,EAAE,MAAM,GAAG;AACvB,WAAAE,EAAM,KAAK,EAAI,GACfD,EAAEC,EAAM,CAAC,EAAE,YAAW,CAAE,IAAIA,EAAM,CAAC,GAC5BD;AAAA,EACX,GAAK,EAAE,GACDE,GAAWC,GAAUC,GACrBC,IAAS;AAAA,IACX,MAAM;AAAA,IACN,OAAO;AAAA,IACP,IAAI,SAAUP,GAAG;AACf,MAAAF,EAAK,KAAK,WAAWE,CAAC;AAAA,IAC5B;AAAA,IACI,OAAO,SAAUA,GAAG;AAClB,MAAAF,EAAK,OAAOE,IAAIpB;AAAAA,IACtB;AAAA,IACI,OAAO,SAAUoB,GAAG;AAClB,MAAAF,EAAK,OAAOE,IAAIpB;AAAAA,IACtB;AAAA,IACI,OAAO,SAAUoB,GAAG;AAClB,MAAAF,EAAK,OAAOE,IAAIpB;AAAAA,IACtB;AAAA,IACI,QAAQ,SAAUoB,GAAG;AACnB,MAAAF,EAAK,SAASE,IAAIpB;AAAAA,IACxB;AAAA,IACI,OAAO,SAAUoB,GAAG;AAClB,MAAAF,EAAK,QAAQE,IAAIpB;AAAAA,IACvB;AAAA,IACI,OAAO,SAAUoB,GAAG;AAClB,MAAAF,EAAK,QAAQE,IAAIpB;AAAAA,IACvB;AAAA,IACI,OAAO,SAAUoB,GAAG;AAClB,MAAAF,EAAK,QAAQE,IAAIpB;AAAAA,IACvB;AAAA,IACI,OAAO,SAAUoB,GAAG;AAClB,MAAAF,EAAK,QAAQ,WAAWE,CAAC,IAAIpB;AAAAA,IACnC;AAAA,IACI,OAAO,SAAUoB,GAAG;AAClB,MAAAF,EAAK,uBAAuB,WAAWE,CAAC,IAAIpB;AAAAA,IAClD;AAAA,IACI,MAAM,SAAUoB,GAAG;AACjB,MAAAF,EAAK,QAAQE,IAAIpB;AAAAA,IACvB;AAAA,IACI,KAAK,SAAUoB,GAAG;AAChB,MAAAF,EAAK,KAAK,WAAWE,CAAC;AAAA,IAC5B;AAAA,IACI,KAAK,SAAUA,GAAG;AAChB,MAAAF,EAAK,KAAK,WAAWE,CAAC;AAAA,IAC5B;AAAA,IACI,KAAK,SAAUA,GAAG;AAChB,MAAAF,EAAK,KAAK,WAAWE,CAAC;AAAA,IAC5B;AAAA,IACI,GAAG,SAAUA,GAAG;AACd,MAAAF,EAAK,KAAK,WAAWE,CAAC;AAAA,IAC5B;AAAA,IACI,GAAG,SAAUA,GAAG;AACd,MAAAF,EAAK,IAAI,WAAWE,CAAC;AAAA,IAC3B;AAAA,IACI,GAAG,SAAUA,GAAG;AACd,MAAAF,EAAK,IAAI,WAAWE,CAAC;AAAA,IAC3B;AAAA,IACI,GAAG,SAAUA,GAAG;AACd,MAAAF,EAAK,IAAIA,EAAK,IAAI,WAAWE,CAAC;AAAA,IACpC;AAAA,IACI,KAAK,WAAY;AACf,MAAAF,EAAK,MAAM;AAAA,IACjB;AAAA,IACI,MAAM,SAAUE,GAAG;AACjB,MAAAF,EAAK,OAAO,SAASE,GAAG,EAAE;AAAA,IAChC;AAAA,IACI,OAAO,WAAY;AACjB,MAAAF,EAAK,WAAW;AAAA,IACtB;AAAA,IACI,SAAS,SAAUE,GAAG;AACpB,MAAAF,EAAK,eAAeE,EAAE,MAAM,GAAG,EAAE,IAAI,SAAUC,GAAG;AAChD,eAAO,WAAWA,CAAC;AAAA,MAC3B,CAAO;AAAA,IACP;AAAA,IACI,UAAU,SAAUD,GAAG;AACrB,MAAAF,EAAK,WAAW,WAAWE,CAAC;AAAA,IAClC;AAAA,IACI,OAAO,SAAUA,GAAG;AAClB,MAAAF,EAAK,QAAQE;AACb,UAAIQ,IAAOpB,GAAMF,IAAOc,CAAC;AACzB,MAAIQ,MACFV,EAAK,WAAWU,EAAK;AAAA,IAE7B;AAAA,IACI,gBAAgB,SAAUR,GAAG;AAC3B,MAAAF,EAAK,iBAAiBE,IAAIpB;AAAAA,IAChC;AAAA,IACI,IAAI,SAAUoB,GAAG;AACf,UAAIS,IAAKrB,GAAMsB,IAAeV,CAAC;AAC/B,MAAAF,EAAK,kBAAkBW,KAAU,WAAWT,CAAC,KAAKpB;AAAAA,IACxD;AAAA,IACI,UAAU,SAAUoB,GAAG;AACrB,MAAIA,MAAM,UACRF,EAAK,YAAY,SAEjBA,EAAK,WAAWE;AAAA,IAExB;AAAA,IACI,MAAM,SAAUA,GAAG;AACjB,UAAIW,IAAY;AAChB,MAAIX,EAAE,WAAW,KAAKW,EAAU,QAAQX,EAAE,OAAO,GAAG,CAAC,CAAC,MAAM,MAAMW,EAAU,QAAQX,EAAE,OAAO,GAAG,CAAC,CAAC,MAAM,MAAMW,EAAU,QAAQX,EAAE,OAAO,GAAG,CAAC,CAAC,MAAM,OAClJF,EAAK,OAAOE;AAAA,IAEpB;AAAA,IACI,QAAQ,WAAY;AAClB,MAAAF,EAAK,SAAS;AAAA,IACpB;AAAA,IACI,MAAM,WAAY;AAChB,MAAAA,EAAK,OAAO;AAAA,IAClB;AAAA,EACA;AACE,OAAKM,KAAaL;AAChB,IAAAM,IAAWN,EAASK,CAAS,GACzBA,KAAaG,KACfD,IAAeC,EAAOH,CAAS,GAC3B,OAAOE,KAAiB,aAC1BA,EAAaD,CAAQ,IAErBP,EAAKQ,CAAY,IAAID,KAGvBP,EAAKM,CAAS,IAAIC;AAGtB,SAAI,OAAOP,EAAK,aAAc,YAAYA,EAAK,cAAc,YAC3DA,EAAK,YAAYA,EAAK,UAAU,YAAW,IAE7CA,EAAK,UAAaD,GACXC;AACT;ACtJA,MAAMc,GAAoB;AAAA,EACxB,OAAO,MAAMC,GAAM;AACjB,UAAMC,IAASD,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,IAAI;AAC7E,WAAID,KAAUA,EAAO,UAAU,IACtB;AAAA,MACL,WAAWA,EAAO,CAAC;AAAA,MACnB,MAAM,SAASA,EAAO,CAAC,GAAG,EAAE;AAAA,IACpC,IAEW;AAAA,EACX;AAAA,EAEE,OAAO,YAAYD,GAAMG,IAAO,QAAQ;AACtC,QAAI,CAACH,KAAQA,EAAK,SAAS;AACzB,aAAO,EAAE,MAAAG,GAAM,MAAM,WAAW,mBAAmB,KAAI;AAGzD,UAAMC,IAAOJ,EAAK,CAAC,GACbK,IAAmB,WAAWL,EAAK,CAAC,CAAC,KAAK,MAE1CC,IAASD,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,IAAI,GACvEI,IAAKL,IACP;AAAA,MACA,WAAWA,EAAO,CAAC;AAAA,MACnB,MAAM,SAASA,EAAO,CAAC,GAAG,EAAE;AAAA,IACpC,IACQ;AAEJ,WAAO;AAAA,MACL,MAAAE;AAAA,MACA,MAAAC;AAAA,MACA,mBAAmBC;AAAA,MACnB,IAAAC;AAAA,IACN;AAAA,EACA;AAAA,EAEE,OAAO,YAAYN,GAAM;AACvB,UAAMI,IAAOJ,EAAK,CAAC,KAAK;AAGxB,QAAIO;AACJ,UAAMC,IAAoBJ,EAAK,MAAM,WAAW;AAChD,QAAII,GAAmB;AAErB,YAAMC,IAAeD,EAAkB,CAAC,EAAE,YAAW;AACrD,UAAIC,MAAiB,IAAK,CAAAF,IAAY;AAAA,eAC7BE,MAAiB,IAAK,CAAAF,IAAY;AAAA,eAClCE,MAAiB,IAAK,CAAAF,IAAY;AAAA,UACtC,OAAM,IAAI,MAAM,8BAA8BE,CAAY,EAAE;AAAA,IACvE;AAEM,MAAAF,IAAYP,EAAK,CAAC,IAAIA,EAAK,CAAC,EAAE,YAAW,IAAK;AAGhD,UAAMU,IAAYV,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,OAAO,GAC7ES,IAAQD,IAAY,SAASA,EAAU,CAAC,GAAG,EAAE,IAAI,MAEjDE,IAAWZ,EAAK;AAAA,MACpB,CAACE,MACC,MAAM,QAAQA,CAAK,MAClBA,EAAM,CAAC,MAAM,gBAAgBA,EAAM,CAAC,MAAM,eAAeA,EAAM,CAAC,MAAM;AAAA,IAC/E,GACUP,IAAO,KAAK,YAAYiB,CAAQ;AAEtC,WAAO;AAAA,MACL,MAAAR;AAAA,MACA,WAAAG;AAAA;AAAA,MACA,MAAAZ;AAAA,MACA,OAAAgB;AAAA,IACN;AAAA,EACA;AAAA,EAEE,OAAO,YAAYX,GAAM;AACvB,WAAOA,EACJ,OAAO,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,MAAM,EAC7D,IAAI,CAACW,MAAS,KAAK,YAAYA,CAAI,CAAC,EACpC,KAAK,CAACzB,GAAG0B,OAAO1B,EAAE,SAAS,MAAM0B,EAAE,SAAS,EAAE;AAAA,EACrD;AAAA,EAEE,OAAO,QAAQd,GAAMe,IAAS,IAAI;AAEhC,YAAQf,EAAK,CAAC,GAAC;AAAA,MACb,KAAK;AACH,QAAAe,EAAO,OAAO,gBACdA,EAAO,OAAOf,EAAK,CAAC,GACpBe,EAAO,WAAWf,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,aAAa,IACrF,KAAK,QAAQF,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,aAAa,CAAC,IACrF,MACJa,EAAO,aAAaf,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,YAAY,IACtF,KAAK,QAAQF,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,YAAY,CAAC,IACpF;AAEJ,cAAMc,IAAShB,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,IAAI;AAC7E,QAAIc,MACFD,EAAO,oBAAoB;AAAA,UACzB,MAAMC,EAAO,CAAC;AAAA,UACd,MAAM,KAAK,YAAYhB,CAAI;AAAA,QACvC;AAGQ,cAAMiB,IAAiBjB,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,YAAY;AAC7F,YAAIe,GAAgB;AAClB,gBAAMtB,IAAO,KAAK,YAAYsB,CAAc;AAC5C,UAAAF,EAAO,kBAAkB,OAAOpB;AAAA,QAC1C;AAEQ,QAAAoB,EAAO,KAAK,KAAK,MAAMf,CAAI;AAC3B;AAAA,MAEF,KAAK;AAAA,MACL,KAAK;AACH,QAAAe,EAAO,OAAO,iBACdA,EAAO,OAAOf,EAAK,CAAC;AAGpB,cAAMkB,IAAsBlB,EAAK;AAAA,UAC/B,CAACE,MAAU,MAAM,QAAQA,CAAK,MAAMA,EAAM,CAAC,MAAM,WAAWA,EAAM,CAAC,MAAM;AAAA,QACnF;AACQ,YAAIgB,GAAqB;AACvB,gBAAMC,IAAkB,KAAK,QAAQD,CAAmB;AACxD,UAAIA,EAAoB,CAAC,MAAM,aAC7BH,EAAO,iBAAiBI,IAExBJ,EAAO,QAAQI;AAEjB,gBAAMC,IAASpB,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,QAAQ;AACjF,UAAIkB,KAAUA,EAAO,CAAC,MAAM,gBAC1BD,EAAgB,iBAAiB;AAAA,YAC/B,MAAMC,EAAO,CAAC;AAAA,YACd,WAAW,WAAWA,EAAO,CAAC,CAAC;AAAA,UAC7C;AAAA,QAEA;AAEQ,QAAAL,EAAO,oBAAoB;AAAA,UACzB,MAAM;AAAA,UACN,MAAM,KAAK,YAAYf,CAAI;AAAA,QACrC,GAEQe,EAAO,KAAK,KAAK,MAAMf,CAAI;AAC3B;AAAA,MAEF,KAAK;AACH,QAAAe,EAAO,OAAO,0BACdA,EAAO,OAAOf,EAAK,CAAC,GACpBe,EAAO,YAAYf,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,WAAW,IACpF,KAAK,QAAQF,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,WAAW,CAAC,IACnF;AACJ;AAAA,MAEF,KAAK;AACH,QAAAa,EAAO,OAAO,iBACdA,EAAO,OAAOf,EAAK,CAAC,GAGpBe,EAAO,UAAUf,EACd,OAAO,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,QAAQ,EAC/D,IAAI,CAACmB,OAAY;AAAA,UAChB,MAAM;AAAA,UACN,MAAMA,EAAO,CAAC;AAAA,UACd,IAAI,KAAK,MAAMA,CAAM;AAAA;AAAA,QACjC,EAAY;AAGJ,cAAMC,IAAetB,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,kBAAkB;AACjG,QAAIoB,MACFP,EAAO,WAAW,WAAWO,EAAa,CAAC,CAAC;AAI9C,cAAMC,IAAgBvB,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,WAAW;AAC3F,QAAIqB,MACFR,EAAO,YAAY,KAAK,QAAQQ,CAAa,IAI/CR,EAAO,KAAK,KAAK,MAAMf,CAAI;AAC3B;AAAA,MAEF,KAAK;AACH,QAAAe,EAAO,OAAO,aACdA,EAAO,OAAOf,EAAK,CAAC,GACpBe,EAAO,kBAAkB,WAAWf,EAAK,CAAC,CAAC,GAC3Ce,EAAO,qBAAqB,WAAWf,EAAK,CAAC,CAAC,GAChCA,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,YAAY,KAChF,KAAK,QAAQF,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,YAAY,GAAGa,CAAM;AAEhG;AAAA,MAEF,KAAK;AACH,QAAAA,EAAO,OAAO,cACdA,EAAO,OAAOf,EAAK,CAAC,GACpBe,EAAO,SAASf,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,QAAQ,IAC9E,KAAK,QAAQF,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,QAAQ,CAAC,IAChF,MACJa,EAAO,aAAaf,EACjB,OAAO,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,WAAW,EAClE,IAAI,CAACsB,MAAU,KAAK,QAAQA,CAAK,CAAC;AACrC;AAAA,MAEF,KAAK;AACH,QAAAT,EAAO,OAAO,UACdA,EAAO,OAAOf,EAAK,CAAC,GACpBe,EAAO,KAAK,KAAK,MAAMf,CAAI;AAC3B;AAAA,MAEF,KAAK;AACH,QAAAe,EAAO,OAAO,aACdA,EAAO,OAAOf,EAAK,CAAC,GACpBe,EAAO,QAAQ,WAAWf,EAAK,CAAC,CAAC,GACjCe,EAAO,OAAO,KAAK;AAAA,UACjBf,EAAK;AAAA,YACH,CAACE,MACC,MAAM,QAAQA,CAAK,MAClBA,EAAM,CAAC,MAAM,gBAAgBA,EAAM,CAAC,MAAM,eAAeA,EAAM,CAAC,MAAM;AAAA,UACrF;AAAA,QACA,GACQa,EAAO,KAAK,KAAK,MAAMf,CAAI;AAC3B;AAAA,MAEF,KAAK;AACH,QAAAe,EAAO,OAAO;AAGd,cAAMU,IAAgBzB,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,WAAW;AAC3F,YAAIuB,GAAe;AACjB,gBAAMC,IAAmBD,EAAc,KAAK,CAACvB,MAAU,MAAM,QAAQA,CAAK,CAAC;AAC3E,UAAAa,EAAO,aAAaW,IAAmB,KAAK,QAAQA,CAAgB,IAAI;AAAA,QAClF;AAGQ,cAAMC,IAAgB3B,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,WAAW;AAC3F,YAAIyB,GAAe;AACjB,gBAAMC,IAAmBD,EAAc,KAAK,CAACzB,MAAU,MAAM,QAAQA,CAAK,CAAC;AAC3E,UAAAa,EAAO,aAAaa,IAAmB,KAAK,QAAQA,CAAgB,IAAI;AAAA,QAClF;AAGQ,cAAMC,IAAqB7B,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,wBAAwB;AAC7G,QAAI2B,IACFd,EAAO,iBAAiB,KAAK,QAAQc,CAAkB,IAEvDd,EAAO,iBAAiB;AAE1B;AAAA,MAEF,KAAK;AAyBH,YAxBAA,EAAO,OAAO,kBACdA,EAAO,OAAOf,EAAK,CAAC,GACpBe,EAAO,SAASf,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,QAAQ,IAC9E,KAAK,QAAQF,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,QAAQ,CAAC,IAChF,MAEJa,EAAO,aAAaf,EACjB,OAAO,CAACE,MAAU,MAAM,QAAQA,CAAK,MAAMA,EAAM,CAAC,MAAM,eAAeA,EAAM,CAAC,MAAM,gBAAgB,EACpG,IAAI,CAACsB,MAAU;AACd,cAAIA,EAAM,CAAC,MAAM;AACf,mBAAO,KAAK,QAAQA,CAAK;AACpB,cAAIA,EAAM,CAAC,MAAM;AACtB,mBAAO;AAAA,cACL,MAAMA,EAAM,CAAC;AAAA,cACb,OAAOA,EAAM,CAAC;AAAA,cACd,IAAI;AAAA,gBACF,WAAa;AAAA,gBACb,MAAQ;AAAA,cAC1B;AAAA,YACA;AAAA,QAEA,CAAW,GAGCT,EAAO,WAAW,WAAW,GAAG;AAClC,gBAAMe,IAAkBf,EAAO,WAAW,CAAC;AAC3C,UAAIe,EAAgB,SAAS,uBAC3BA,EAAgB,QAAQ,KAAK,OAAOA,EAAgB,QAAQ,KAAK,IAAI,IAAI;AAAA,QAErF;AAEQ,QAAAf,EAAO,KAAK,KAAK,MAAMf,CAAI;AAC3B;AAAA,MAEF,KAAK;AACH,QAAKe,EAAO,sBACVA,EAAO,oBAAoB,EAAE,MAAM,eAAe,MAAM,CAAA,EAAE,IAE5DA,EAAO,kBAAkB,KAAK,KAAK,KAAK,YAAYf,CAAI,CAAC;AACzD;AAAA,MAEF,KAAK;AACH,cAAML,IAAO,KAAK,YAAYK,GAAM,YAAY;AAChD,QAAIe,EAAO,qBAAqBA,EAAO,kBAAkB,QACvDA,EAAO,kBAAkB,KAAK,QAAQ,CAACF,MAAS;AAC9C,UAAKA,EAAK,SACRA,EAAK,OAAOlB;AAAA,QAE1B,CAAW,GAECA,EAAK,qBAAqBA,EAAK,sBAAsB,KACnDoB,EAAO,oBACTA,EAAO,kBAAkB;AAAA,UACvB,OAAOA,EAAO;AAAA,UACd,MAAApB;AAAA,QACd;AAGQ;AAAA,MAEF;AACE,QAAAoB,EAAO,UAAUf,EAAK,CAAC;AACvB;AAAA,IACR;AAEI,WAAOe;AAAA,EACX;AACA;ACxTA,MAAMgB,WAA4BhC,GAAoB;AAAA,EACpD,OAAO,QAAQC,GAAMe,IAAS,IAAI;AAChC,iBAAM,QAAQf,GAAMe,CAAM,GAGtBA,EAAO,qBAAqBA,EAAO,kBAAkB,YAAY,eACnE,OAAOA,EAAO,mBAEZA,EAAO,SACT,OAAOA,EAAO,OAGTA;AAAA,EACX;AACA;ACdA,MAAMiB,WAA4BjC,GAAoB;AAAA,EACpD,OAAO,QAAQC,GAAMe,IAAS,IAAI;AAChC,UAAM,QAAQf,GAAMe,CAAM;AAG1B,UAAMC,IAAShB,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,IAAI;AAC7E,IAAIc,MACFD,EAAO,oBAAoB;AAAA,MACzB,SAASC,EAAO,CAAC;AAAA,MACjB,MAAM,KAAK,YAAYhB,CAAI;AAAA,IACnC;AAII,UAAMiC,IAAYjC,EAAK,KAAK,CAACE,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,OAAO;AACnF,QAAI+B,GAAW;AACb,YAAMC,IAAQD,EAAU,KAAK,CAAC/B,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,OAAO,GAC9EiC,IAAOF,EAAU,KAAK,CAAC/B,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,MAAM,GAC5EkC,IAAOH,EAAU,KAAK,CAAC/B,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,MAAM;AAClF,MAAAa,EAAO,QAAQ,CAAA,GACXmB,MACFnB,EAAO,MAAM,QAAQmB,EAAM,CAAC,IAE1BC,MACFpB,EAAO,MAAM,OAAOoB,EAAK,CAAC,IAExBC,MACFrB,EAAO,MAAM,OAAOqB,EAAK,MAAM,CAAC;AAAA,IAExC;AAEI,WAAOrB;AAAA,EACX;AACA;AC3BA,SAASsB,GAAkBC,GAAM;AAE/B,SAAIA,EAAK,KAAK,CAACpC,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,OAAO,IAC5D,UAILoC,EAAK,KAAK,CAACpC,MAAU,MAAM,QAAQA,CAAK,KAAKA,EAAM,CAAC,MAAM,IAAI,KAI9DoC,EAAK,CAAC,MAAM,cAAcA,EAAK,CAAC,MAAM,aAAaA,EAAK,CAAC,MAAM,WAC1D;AAKX;AAOO,SAASC,GAAcD,GAAM;AAGlC,UAFgBD,GAAkBC,CAAI,MACV,SAASN,KAAsBD,IAC5C,QAAQO,CAAI;AAC7B;AC/BO,SAASE,GAAiBC,GAAK;AAEpC,QAAMC,IAAgBD,EAAI,YAAW;AAGrC,SACEC,EAAc,SAAS,SAAS,KAChCA,EAAc,SAAS,SAAS,KAChCA,EAAc,SAAS,UAAU,KACjCA,EAAc,SAAS,SAAS,KAChCA,EAAc,SAAS,YAAY,KACnCA,EAAc,SAAS,WAAW,KAClCA,EAAc,SAAS,WAAW,IAE3B,UAKPA,EAAc,SAAS,QAAQ,KAC/BA,EAAc,SAAS,QAAQ,KAC/BA,EAAc,SAAS,UAAU,KACjCA,EAAc,SAAS,SAAS,KAChCA,EAAc,SAAS,MAAM,GAEtB;AAKX;ACjCA,IAAIC,KAAU,GACVC,KAAU,GACVC,KAAS,GACTC,KAAS,GACTC,KAAa,GACbC,KAAQ,IACRC,KAAa,MACbC,KAAQ,YACRC,KAAU,eACVC,KAAY,SACZC,KAAS;AAEb,SAASC,GAAOC,GAAM;AACpB,MAAI,OAAOA,KAAS;AAClB,UAAM,IAAI,MAAM,cAAc;AAEhC,OAAK,OAAOA,EAAK,KAAI,GACrB,KAAK,QAAQ,GACb,KAAK,QAAQ,GACb,KAAK,OAAO,MACZ,KAAK,QAAQ,CAAA,GACb,KAAK,gBAAgB,MACrB,KAAK,QAAQZ;AACf;AACAW,GAAO,UAAU,gBAAgB,WAAW;AAC1C,MAAIE,IAAO,KAAK,KAAK,KAAK,OAAO;AACjC,MAAI,KAAK,UAAUV;AACjB,WAAOG,GAAW,KAAKO,CAAI,KAAG;AAC5B,UAAI,KAAK,SAAS,KAAK,KAAK;AAC1B;AAEF,MAAAA,IAAO,KAAK,KAAK,KAAK,OAAO;AAAA,IACnC;AAEE,UAAQ,KAAK,OAAK;AAAA,IAChB,KAAKb;AACH,aAAO,KAAK,QAAQa,CAAI;AAAA,IAC1B,KAAKZ;AACH,aAAO,KAAK,QAAQY,CAAI;AAAA,IAC1B,KAAKV;AACH,aAAO,KAAK,OAAOU,CAAI;AAAA,IACzB,KAAKT;AACH,aAAO,KAAK,WAAWS,CAAI;AAAA,IAC7B,KAAKX;AACH,aAAO,KAAK,OAAOW,CAAI;AAAA,IACzB,KAAKR;AACH;AAAA,EACN;AACA;AACAM,GAAO,UAAU,aAAa,SAASE,GAAM;AAC3C,MAAIA,MAAS,KAAK;AAChB,SAAK,QAAQ,KACb,KAAK,QAAQV;AACb;AAAA,EACJ;AACE,MAAIM,GAAU,KAAKI,CAAI,GAAG;AACxB,SAAK,OAAO,KAAK,KAAK,KAAI,GAC1B,KAAK,UAAUA,CAAI;AACnB;AAAA,EACJ;AACE,QAAM,IAAI,MAAM,qBAAqBA,IAAO,gCAAgC,KAAK,KAAK;AACxF;AACAF,GAAO,UAAU,YAAY,SAASE,GAAM;AAC1C,MAAIA,MAAS,KAAK;AAChB,IAAI,KAAK,SAAS,QAChB,KAAK,cAAc,KAAK,KAAK,IAAI,GAEnC,KAAK,OAAO,MACZ,KAAK,QAAQb;AACb;AAAA,EACJ;AACE,MAAIa,MAAS,KAAK;AAChB,SAAK,SACD,KAAK,SAAS,SAChB,KAAK,cAAc,KAAK,KAAK,IAAI,GACjC,KAAK,OAAO,OAEd,KAAK,QAAQb,IACb,KAAK,gBAAgB,KAAK,MAAM,IAAG,GAC9B,KAAK,kBACR,KAAK,QAAQK;AAGf;AAAA,EACJ;AACA;AACAM,GAAO,UAAU,SAAS,SAASE,GAAM;AACvC,MAAIH,GAAO,KAAKG,CAAI,GAAG;AACrB,SAAK,QAAQA;AACb;AAAA,EACJ;AACE,MAAIJ,GAAU,KAAKI,CAAI,GAAG;AACxB,SAAK,OAAO,WAAW,KAAK,IAAI,GAChC,KAAK,UAAUA,CAAI;AACnB;AAAA,EACJ;AACE,QAAM,IAAI,MAAM,qBAAqBA,IAAO,4BAA4B,KAAK,KAAK;AACpF;AACAF,GAAO,UAAU,SAAS,SAASE,GAAM;AACvC,MAAIA,MAAS,KAAK;AAChB,SAAK,QAAQT;AACb;AAAA,EACJ;AACE,OAAK,QAAQS;AAEf;AACAF,GAAO,UAAU,UAAU,SAASE,GAAM;AACxC,MAAIL,GAAQ,KAAKK,CAAI,GAAG;AACtB,SAAK,QAAQA;AACb;AAAA,EACJ;AACE,MAAIA,MAAS,KAAK;AAChB,QAAIC,IAAa,CAAA;AACjB,IAAAA,EAAW,KAAK,KAAK,IAAI,GACzB,KAAK,SACD,KAAK,SAAS,OAChB,KAAK,OAAOA,IAEZ,KAAK,cAAc,KAAKA,CAAU,GAEpC,KAAK,MAAM,KAAK,KAAK,aAAa,GAClC,KAAK,gBAAgBA,GACrB,KAAK,QAAQd;AACb;AAAA,EACJ;AACE,MAAIS,GAAU,KAAKI,CAAI,GAAG;AACxB,SAAK,UAAUA,CAAI;AACnB;AAAA,EACJ;AACE,QAAM,IAAI,MAAM,qBAAqBA,IAAO,6BAA6B,KAAK,KAAK;AACrF;AACAF,GAAO,UAAU,UAAU,SAASE,GAAM;AACxC,MAAIN,GAAM,KAAKM,CAAI,GAAG;AACpB,SAAK,OAAOA,GACZ,KAAK,QAAQZ;AACb;AAAA,EACJ;AACE,MAAIY,MAAS,KAAK;AAChB,SAAK,OAAO,IACZ,KAAK,QAAQV;AACb;AAAA,EACJ;AACE,MAAIO,GAAO,KAAKG,CAAI,GAAG;AACrB,SAAK,OAAOA,GACZ,KAAK,QAAQX;AACb;AAAA,EACJ;AACE,MAAIO,GAAU,KAAKI,CAAI,GAAG;AACxB,SAAK,UAAUA,CAAI;AACnB;AAAA,EACJ;AACE,QAAM,IAAI,MAAM,qBAAqBA,IAAO,6BAA6B,KAAK,KAAK;AACrF;AACAF,GAAO,UAAU,SAAS,WAAW;AACnC,SAAO,KAAK,QAAQ,KAAK,KAAK;AAC5B,SAAK,cAAa;AAEpB,MAAI,KAAK,UAAUN;AACjB,WAAO,KAAK;AAEd,QAAM,IAAI,MAAM,6BAA4B,KAAK,OAAO,iBAAiB,KAAK,KAAK;AACrF;AAEA,SAASU,GAAYC,GAAK;AACxB,MAAIC,IAAS,IAAIN,GAAOK,CAAG;AAC3B,SAAOC,EAAO,OAAM;AACtB;ACtKA,SAASC,GAAMrF,GAAKC,GAAKqF,GAAO;AAC9B,EAAI,MAAM,QAAQrF,CAAG,MACnBqF,EAAM,QAAQrF,CAAG,GACjBA,IAAM;AAER,MAAIsF,IAAQtF,IAAM,CAAA,IAAKD,GAEnBwF,IAAMF,EAAM,OAAO,SAASG,GAAQC,GAAM;AAC5C,WAAAC,GAAMD,GAAMD,CAAM,GACXA;AAAA,EACX,GAAKF,CAAK;AACR,EAAItF,MACFD,EAAIC,CAAG,IAAIuF;AAEf;AAEO,SAASG,GAAMhF,GAAGX,GAAK;AAC5B,MAAI,CAAC,MAAM,QAAQW,CAAC,GAAG;AACrB,IAAAX,EAAIW,CAAC,IAAI;AACT;AAAA,EACJ;AACE,MAAIV,IAAMU,EAAE,MAAK;AAIjB,MAHIV,MAAQ,gBACVA,IAAMU,EAAE,MAAK,IAEXA,EAAE,WAAW,GAAG;AAClB,QAAI,MAAM,QAAQA,EAAE,CAAC,CAAC,GAAG;AACvB,MAAAX,EAAIC,CAAG,IAAI,CAAA,GACX0F,GAAMhF,EAAE,CAAC,GAAGX,EAAIC,CAAG,CAAC;AACpB;AAAA,IACN;AACI,IAAAD,EAAIC,CAAG,IAAIU,EAAE,CAAC;AACd;AAAA,EACJ;AACE,MAAI,CAACA,EAAE,QAAQ;AACb,IAAAX,EAAIC,CAAG,IAAI;AACX;AAAA,EACJ;AACE,MAAIA,MAAQ,WAAW;AACrB,IAAAD,EAAIC,CAAG,IAAIU;AACX;AAAA,EACJ;AACE,MAAIV,MAAQ,QAAQ;AAClB,IAAMA,KAAOD,MACXA,EAAIC,CAAG,IAAI,CAAA,IAEbD,EAAIC,CAAG,EAAE,KAAKU,CAAC;AACf;AAAA,EACJ;AACE,EAAK,MAAM,QAAQV,CAAG,MACpBD,EAAIC,CAAG,IAAI,CAAA;AAGb,MAAIG;AACJ,UAAQH,GAAG;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,MAAAD,EAAIC,CAAG,IAAI;AAAA,QACT,MAAMU,EAAE,CAAC,EAAE,YAAW;AAAA,QACtB,SAASA,EAAE,CAAC;AAAA,MACpB,GACUA,EAAE,WAAW,KACfgF,GAAMhF,EAAE,CAAC,GAAGX,EAAIC,CAAG,CAAC;AAEtB;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AACH,MAAAD,EAAIC,CAAG,IAAI;AAAA,QACT,MAAMU,EAAE,CAAC;AAAA,QACT,GAAGA,EAAE,CAAC;AAAA,QACN,IAAIA,EAAE,CAAC;AAAA,MACf,GACUA,EAAE,WAAW,KACfgF,GAAMhF,EAAE,CAAC,GAAGX,EAAIC,CAAG,CAAC;AAEtB;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,MAAAU,EAAE,CAAC,IAAI,CAAC,QAAQA,EAAE,CAAC,CAAC,GACpB0E,GAAMrF,GAAKC,GAAKU,CAAC;AACjB;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA;AAAA;AAAA,IAGL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,MAAAA,EAAE,CAAC,IAAI,CAAC,QAAQA,EAAE,CAAC,CAAC,GACpB0E,GAAMrF,GAAKC,GAAKU,CAAC,GACjBX,EAAIC,CAAG,EAAE,OAAOA;AAChB;AAAA,IACF;AAEE,WADAG,IAAI,IACG,EAAEA,IAAIO,EAAE;AACb,YAAI,CAAC,MAAM,QAAQA,EAAEP,CAAC,CAAC;AACrB,iBAAOuF,GAAMhF,GAAGX,EAAIC,CAAG,CAAC;AAG5B,aAAOoF,GAAMrF,GAAKC,GAAKU,CAAC;AAAA,EAC9B;AACA;ACtHA,IAAIpB,KAAM;AAEH,SAASqG,GAAIC,GAAO;AACzB,SAAOA,IAAQtG;AACjB;AAEO,SAASuG,GAAwB7B,GAAK;AAE3C,QAAM8B,KAAsB9B,EAAI,YAAY,IAAI,cAAc,QAAQ,MAAM,GAAG;AAE/E,EAAI,CAACA,EAAI,SAASA,EAAI,UAAU8B,MAAuB,6BAA6BA,MAAuB,oCACzG9B,EAAI,QAAQA,EAAI,QAEd,CAACA,EAAI,UAAUA,EAAI,SAAS8B,MAAuB,8BAA8BA,MAAuB,sCAC1G9B,EAAI,OAAO2B,GAAI3B,EAAI,OAAO,IAAI,KAAK,GAAG,GACtCA,EAAI,SAASA,EAAI,MACjB,OAAOA,EAAI,QACF,CAACA,EAAI,UAAUA,EAAI,SAAS8B,MAAuB,yBAAyBA,MAAuB,uCAC5G9B,EAAI,SAASA,EAAI,MACjBA,EAAI,OAAO2B,GAAI3B,EAAI,OAAO,IAAI,KAAK,GAAG,GACtC,OAAOA,EAAI;AAEf;ACnBA,SAAS+B,GAAY7E,GAAM;AACzB,MAAIoB,IAAS,EAAE,OAAO,MAAM,UAAU,OAAS;AAE/C,SAAI,OAAOpB,KAAS,YAClBoB,EAAO,QAAQpB,EAAK,YAAW,GAC3BoB,EAAO,UAAU,YACnBA,EAAO,QAAQ,UAEbA,EAAO,UAAU,YACnBA,EAAO,WAAW,MAEXpB,KAAQA,EAAK,SACtBoB,EAAO,QAAQpB,EAAK,KAAK,YAAW,GAChCoB,EAAO,UAAU,YACnBA,EAAO,QAAQ,UAEjBA,EAAO,WAAWpB,EAAK,oBAGlBoB;AACT;AAEA,SAAS0D,GAAQC,GAAe;AAC9B,SAAI,OAAOA,KAAkB,WACpBA,EAAc,QAAQA,EAAc,KAAK,oBAE3CA;AACT;AAEA,SAASC,GAAmBb,GAAO/C,GAAQ;AACzC,EAAI+C,EAAM,UAAU,UAClB/C,EAAO,IAAI+C,EAAM,UAAU,QAC3B/C,EAAO,KAAK,MAEZA,EAAO,IAAI0D,GAAQX,EAAM,UAAU,eAAe,GAC9CA,EAAM,UAAU,uBAAuB,SACzC/C,EAAO,KAAK+C,EAAM,UAAU,qBACnBA,EAAM,UAAU,oBAAoB,UAAaA,EAAM,UAAU,oBAAoB,WAC9F/C,EAAO,KAAKA,EAAO,KAAKA,EAAO,IAAI0D,GAAQX,EAAM,UAAU,eAAe;AAGhF;AAEO,SAASc,GAAkBC,GAAU9D,IAAS,IAAI;AACvD,SAAI,CAAC8D,KAAY,OAAOA,KAAa,WAC5BA,IAGLA,EAAS,SAAS,cACpBD,GAAkBC,EAAS,YAAY9D,CAAM,GAEzC8D,EAAS,mBACPA,EAAS,eAAe,UAAUA,EAAS,eAAe,OAAO,SAAS,SAE5E9D,EAAO,WAAW8D,EAAS,eAAe,WAAW,CAAC,EAAE,QAGxD9D,EAAO,eAAe8D,EAAS,eAAe,WAAW,IAAI,CAACrD,MAAUA,EAAM,KAAK,IAGhFT,MAIT,OAAO,KAAK8D,CAAQ,EAAE,QAAQ,CAACpG,MAAQ;AACrC,UAAMqF,IAAQe,EAASpG,CAAG;AAC1B,QAAIqF,MAAU;AAId,cAAQrF,GAAG;AAAA,QACT,KAAK;AACH,cAAIsC,EAAO;AACT;AAEF,UAAAA,EAAO,OAAO+C,GACd/C,EAAO,UAAU+C;AACjB;AAAA,QAEF,KAAK;AACH,UAAIA,MAAU,kBACZ/C,EAAO,WAAW,YACT+C,MAAU,kBAAkBe,EAAS,cAAcA,EAAS,WAAW,WAChF9D,EAAO,WAAW8D,EAAS,WAAW,OAAO;AAE/C;AAAA,QAEF,KAAK;AAAA,QACL,KAAK;AACH,UAAIf,EAAM,cAER/C,EAAO,QAAQ+C,EAAM,UAAU,MAC/Ba,GAAmBb,GAAO/C,CAAM,IAE9B+C,EAAM,mBACR/C,EAAO,iBAAiB+C,EAAM,eAAe,YAAY,KAAK,KAAK;AAErE;AAAA,QAEF,KAAK;AACH,UAAA/C,EAAO,QAAQ+C,EAAM,MACrBa,GAAmBb,GAAO/C,CAAM;AAChC;AAAA,QAEF,KAAK;AACH,UAAAA,EAAO,SAAS+C,EAAM,aAAa,KAAK,KAAK,KAAK;AAClD;AAAA,QAEF,KAAK;AACH,cAAIA,EAAM;AAYR,gBAXA/C,EAAO,OAAO+C,EAAM,KACjB,IAAI,CAACjD,MAAS;AACb,oBAAMN,IAAYM,EAAK;AACvB,kBAAIN,MAAc,OAAQ,QAAO;AACjC,kBAAIA,MAAc,QAAS,QAAO;AAClC,kBAAIA,MAAc,OAAQ,QAAO;AACjC,kBAAIA,MAAc,QAAS,QAAO;AAClC,oBAAM,IAAI,MAAM,2BAA2BA,CAAS,EAAE;AAAA,YACpE,CAAa,EACA,KAAK,EAAE,IAAI,KAEVuD,EAAM,MAAM;AACd,oBAAM,EAAE,OAAAzF,GAAO,UAAAyG,EAAQ,IAAKN,GAAYV,EAAM,IAAI;AAClD,cAAA/C,EAAO,QAAQ1C,GACf0C,EAAO,WAAW+D;AAAA,YAC9B,WAAqBhB,EAAM,KAAK,CAAC,KAAKA,EAAM,KAAK,CAAC,EAAE,MAAM;AAC9C,oBAAM,EAAE,OAAAzF,GAAO,UAAAyG,MAAaN,GAAYV,EAAM,KAAK,CAAC,EAAE,IAAI;AAC1D,cAAA/C,EAAO,QAAQ1C,GACf0C,EAAO,WAAW+D;AAAA,YAC9B;AAAA;AAEQ;AAAA,QAEF,KAAK;AACH,UAAIhB,EAAM,aAAaA,EAAM,SAC3B/C,EAAO,QAAQ+C,EAAM,YAAY,MAAMA,EAAM;AAE/C;AAAA,QAEF,KAAK;AACH,UAAIA,EAAM,UAAUA,EAAM,OAAO,SAC/B/C,EAAO,WAAW+C,EAAM,OAAO,OAE7BA,EAAM,cACRA,EAAM,WAAW,QAAQ,CAACtC,MAAU;AAClC,kBAAMjC,IAAYiC,EAAM,KAAK,YAAW,EAAG,QAAQ,QAAQ,GAAG,GACxDuD,IAAavD,EAAM;AACzB,YAAIA,EAAM,QAAQA,EAAM,KAAK,oBAC3BT,EAAOxB,CAAS,IAAIwF,IAAavD,EAAM,KAAK,oBACnCA,EAAM,SAAS,WACxBT,EAAOxB,CAAS,IAAIwF,IAAa,KAAK,KAAK,MAE3ChE,EAAOxB,CAAS,IAAIwF;AAAA,UAElC,CAAW;AAEH;AAAA,QAEF,KAAK;AACH,UAAIjB,EAAM,SACR/C,EAAO,QAAQ+C,EAAM,KAAK,YAAW,GACjC/C,EAAO,UAAU,YACnBA,EAAO,QAAQ,WAGf+C,EAAM,sBACR/C,EAAO,WAAW+C,EAAM;AAE1B;AAAA,QAEF,KAAK;AACH,UAAAc,GAAkBd,GAAO/C,CAAM,GAC/BA,EAAO,YAAY+C,EAAM,KAAKA,EAAM,GAAG,YAAY,MAAMA,EAAM,GAAG,OAAOA,EAAM;AAC/E;AAAA,MAKR;AAAA,EACA,CAAG,GAGG/C,EAAO,6BAA6B,WACtCA,EAAO,OAAOA,EAAO,2BAEnBA,EAAO,8BAA8B,WACvCA,EAAO,QAAQA,EAAO,4BAEpBA,EAAO,kCAAkC,WAC3CA,EAAO,OAAOA,EAAO,+BACrBA,EAAO,OAAOA,EAAO,gCAEnBA,EAAO,sCAAsC,WAC/CA,EAAO,OAAOA,EAAO,oCAEnBA,EAAO,sCAAsC,WAC/CA,EAAO,OAAOA,EAAO,oCAEnBA,EAAO,kCAAkC,WAC3CA,EAAO,OAAOA,EAAO,gCAEnBA,EAAO,mCAAmC,WAC5CA,EAAO,QAAQA,EAAO,iCAEpBA,EAAO,4BAA4B,WACrCA,EAAO,KAAKA,EAAO,0BAEjBA,EAAO,6BAA6B,WACtCA,EAAO,KAAKA,EAAO,2BAEjBA,EAAO,+BAA+B,WACxCA,EAAO,OAAOA,EAAO,6BAEnBA,EAAO,gCAAgC,WACzCA,EAAO,QAAQA,EAAO,8BAEpBA,EAAO,wBAAwB,WACjCA,EAAO,QAAQA,EAAO,sBAEpBA,EAAO,kBAAkB,WAC3BA,EAAO,KAAKA,EAAO,gBAEjBA,EAAO,iCACTA,EAAO,KAAKA,EAAO,+BAEjBA,EAAO,mBAAmB,WAC5BA,EAAO,KAAKA,EAAO,iBAEjBA,EAAO,kCACTA,EAAO,KAAKA,EAAO,gCAEjBA,EAAO,wBAAwB,WACjCA,EAAO,OAAOA,EAAO,sBAEnBA,EAAO,wBAAwB,WACjCA,EAAO,OAAOA,EAAO,sBAEnBA,EAAO,mCAAmC,WAC5CA,EAAO,KAAKA,EAAO,iCAEjBA,EAAO,sCAAsC,WAC/CA,EAAO,KAAKA,EAAO,oCAEjBA,EAAO,6CAA6C,WACtDA,EAAO,KAAKA,EAAO,2CAEjBA,EAAO,YAAY,WACrBA,EAAO,QAAQA,EAAO,UAEpBA,EAAO,iCAAiC,WAC1CA,EAAO,QAAQA,EAAO,+BAEpBA,EAAO,sCACTA,EAAO,uBAAuBA,EAAO,oCAIvCuD,GAAwBvD,CAAM,GAEvBA;AACT;AChQA,IAAIiE,KAAa;AAAA,EAAC;AAAA,EAAgB;AAAA,EAAW;AAAA,EAAU;AAAA,EAAU;AAAA,EAAU;AAAA,EAAY;AAAA,EACrF;AAAA,EAAe;AAAA,EAAiB;AAAA,EAAU;AAAgB;AAE5D,SAASC,GAAOzG,GAAKkB,GAAQ;AAC3B,MAAIwF,IAAUxF,EAAO,CAAC,GAClByF,IAASzF,EAAO,CAAC;AACrB,EAAI,EAAEwF,KAAW1G,MAAS2G,KAAU3G,MAClCA,EAAI0G,CAAO,IAAI1G,EAAI2G,CAAM,GACrBzF,EAAO,WAAW,MACpBlB,EAAI0G,CAAO,IAAIxF,EAAO,CAAC,EAAElB,EAAI0G,CAAO,CAAC;AAG3C;AAEA,SAASE,GAAS3C,GAAK;AAErB,WADI/D,IAAO,OAAO,KAAK+D,CAAG,GACjB7D,IAAI,GAAGyG,IAAK3G,EAAK,QAAQE,IAAGyG,GAAI,EAAEzG,GAAG;AAC5C,QAAIH,IAAMC,EAAKE,CAAC;AAGhB,IAAIoG,GAAW,QAAQvG,CAAG,MAAM,MAC9B6G,GAAqB7C,EAAIhE,CAAG,CAAC,GAE3B,OAAOgE,EAAIhE,CAAG,KAAM,YACtB2G,GAAS3C,EAAIhE,CAAG,CAAC;AAAA,EAEvB;AACA;AAEA,SAAS6G,GAAqB7C,GAAK;AACjC,MAAIA,EAAI,WAAW;AACjB,QAAI8C,IAAY,OAAO,KAAK9C,EAAI,SAAS,EAAE,CAAC;AAC5C,IAAI8C,KAAaA,KAAa9C,EAAI,cAChCA,EAAI,QAAQ8C,IAAY,MAAM9C,EAAI,UAAU8C,CAAS;AAAA,EAE3D;AAaE,MAZI9C,EAAI,SAAS,WACfA,EAAI,WAAW,YACNA,EAAI,SAAS,cACtBA,EAAI,WAAW,YACfA,EAAI,QAAQ,MAER,OAAOA,EAAI,cAAe,WAC5BA,EAAI,WAAW,OAAO,KAAKA,EAAI,UAAU,EAAE,CAAC,IAE5CA,EAAI,WAAWA,EAAI,YAGnBA,EAAI,MAAM;AAEZ,aADI+C,IAAY,IACP5G,IAAI,GAAGyG,IAAK5C,EAAI,KAAK,QAAQ7D,IAAIyG,GAAI,EAAEzG,GAAG;AACjD,UAAIiC,IAAO,CAAC4B,EAAI,KAAK7D,CAAC,EAAE,CAAC,EAAE,YAAW,GAAI6D,EAAI,KAAK7D,CAAC,EAAE,CAAC,EAAE,aAAa;AACtE,MAAIiC,EAAK,CAAC,EAAE,QAAQ,OAAO,MAAM,OAAQA,EAAK,CAAC,MAAM,OAAOA,EAAK,CAAC,MAAM,UAAUA,EAAK,CAAC,MAAM,UAC5F2E,KAAa,MACJ3E,EAAK,CAAC,EAAE,QAAQ,OAAO,MAAM,OAAQA,EAAK,CAAC,MAAM,OAAOA,EAAK,CAAC,MAAM,UAAUA,EAAK,CAAC,MAAM,UACnG2E,KAAa,MACJ3E,EAAK,CAAC,EAAE,QAAQ,MAAM,MAAM,OAAQA,EAAK,CAAC,MAAM,OAAOA,EAAK,CAAC,MAAM,UAAUA,EAAK,CAAC,MAAM,SAClG2E,KAAa,OACJ3E,EAAK,CAAC,EAAE,QAAQ,MAAM,MAAM,OAAQA,EAAK,CAAC,MAAM,OAAOA,EAAK,CAAC,MAAM,UAAUA,EAAK,CAAC,MAAM,YAClG2E,KAAa;AAAA,IAErB;AACI,IAAIA,EAAU,WAAW,MACvBA,KAAa,MAEXA,EAAU,WAAW,MACvB/C,EAAI,OAAO+C;AAAA,EAEjB;AACE,EAAI/C,EAAI,SACNA,EAAI,QAAQA,EAAI,KAAK,KAAK,YAAW,GACjCA,EAAI,UAAU,YAChBA,EAAI,QAAQ,UAEVA,EAAI,KAAK,YACPA,EAAI,SAAS,WACXA,EAAI,SAASA,EAAI,MAAM,aACzBA,EAAI,WAAWA,EAAI,KAAK,UAAQA,EAAI,MAAM,SAAS,KAGrDA,EAAI,WAAWA,EAAI,KAAK;AAI9B,MAAIgD,IAAShD,EAAI;AACjB,EAAIA,EAAI,SAAS,aACfgD,IAAShD,IAEPgD,MAIEA,EAAO,QACThD,EAAI,YAAYgD,EAAO,MAAM,KAAK,YAAW,IAE7ChD,EAAI,YAAYgD,EAAO,KAAK,YAAW,GAErChD,EAAI,UAAU,MAAM,GAAG,CAAC,MAAM,SAChCA,EAAI,YAAYA,EAAI,UAAU,MAAM,CAAC,IAEnCA,EAAI,cAAc,uBACpBA,EAAI,YAAY,YAEdA,EAAI,cAAc,cAAcA,EAAI,cAAc,kCAChDA,EAAI,eAAe,gCACrBA,EAAI,SAAS,KAEfA,EAAI,YAAY,UAEdA,EAAI,cAAc,iBACpBA,EAAI,YAAY,UAEdgD,EAAO,SAASA,EAAO,MAAM,aAC/BhD,EAAI,QAAQgD,EAAO,MAAM,SAAS,KAAK,QAAQ,OAAO,EAAE,EAAE,QAAQ,iBAAiB,MAAM,GACrFhD,EAAI,MAAM,YAAW,EAAG,MAAM,GAAG,EAAE,MAAM,oBAC3CA,EAAI,QAAQ,SAGdA,EAAI,IAAIgD,EAAO,MAAM,SAAS,GAC9BhD,EAAI,KAAK,WAAWgD,EAAO,MAAM,SAAS,IAAI,EAAE,IAG9CA,EAAO,SAASA,EAAO,MAAM,YAC/BhD,EAAI,eAAegD,EAAO,MAAM,UAE9B,CAAChD,EAAI,UAAU,QAAQ,WAAW,MACpCA,EAAI,YAAY,WAEd,CAACA,EAAI,UAAU,QAAQ,WAAW,MACpCA,EAAI,YAAY,YAEd,CAACA,EAAI,UAAU,QAAQ,MAAM,KAC5B,CAACA,EAAI,UAAU,QAAQ,wBAAwB,OAClDA,EAAI,YAAY,UAEdA,EAAI,cAAc,cACpBA,EAAI,YAAY,WAEd,CAACA,EAAI,UAAU,QAAQ,QAAQ,MACjCA,EAAI,YAAY,WAGhBA,EAAI,KAAK,CAAC,SAASA,EAAI,CAAC,MAC1BA,EAAI,IAAIA,EAAI,IAEVA,EAAI,yBACNA,EAAI,uBAAuB2B,GAAI3B,EAAI,oBAAoB;AAGzD,WAASiD,EAAQrB,GAAO;AACtB,QAAIsB,IAAQlD,EAAI,YAAY;AAC5B,WAAO4B,IAAQsB;AAAA,EACnB;AACE,MAAIC,IAAU,SAASxG,GAAG;AACxB,WAAO6F,GAAOxC,GAAKrD,CAAC;AAAA,EACxB,GACMyG,IAAO;AAAA,IACT,CAAC,uBAAuB,qBAAqB;AAAA,IAC7C,CAAC,uBAAuB,mCAAmC;AAAA,IAC3D,CAAC,uBAAuB,qBAAqB;AAAA,IAC7C,CAAC,uBAAuB,mCAAmC;AAAA,IAC3D,CAAC,iBAAiB,eAAe;AAAA,IACjC,CAAC,iBAAiB,eAAe;AAAA,IACjC,CAAC,iBAAiB,yBAAyB;AAAA,IAC3C,CAAC,kBAAkB,gBAAgB;AAAA,IACnC,CAAC,kBAAkB,gBAAgB;AAAA,IACnC,CAAC,kBAAkB,0BAA0B;AAAA,IAC7C,CAAC,oBAAoB,kBAAkB;AAAA,IACvC,CAAC,oBAAoB,6BAA6B;AAAA,IAClD,CAAC,oBAAoB,2BAA2B;AAAA,IAChD,CAAC,sBAAsB,oBAAoB;AAAA,IAC3C,CAAC,sBAAsB,kBAAkB;AAAA,IACzC,CAAC,sBAAsB,4BAA4B;AAAA,IACnD,CAAC,sBAAsB,0BAA0B;AAAA,IACjD,CAAC,gBAAgB,cAAc;AAAA,IAC/B,CAAC,MAAM,cAAc;AAAA,IACrB,CAAC,sBAAsB,oBAAoB;AAAA,IAC3C,CAAC,sBAAsB,oBAAoB;AAAA,IAC3C,CAAC,QAAQ,sBAAsBzB,EAAG;AAAA,IAClC,CAAC,uBAAuB,qBAAqB;AAAA,IAC7C,CAAC,uBAAuB,qBAAqB;AAAA,IAC7C,CAAC,SAAS,uBAAuBA,EAAG;AAAA,IACpC,CAAC,MAAM,iBAAiBsB,CAAO;AAAA,IAC/B,CAAC,MAAM,kBAAkBA,CAAO;AAAA,IAChC,CAAC,SAAS,oBAAoBtB,EAAG;AAAA,IACjC,CAAC,QAAQ,sBAAsBA,EAAG;AAAA,IAClC,CAAC,QAAQ,uBAAuBA,EAAG;AAAA,IACnC,CAAC,QAAQ,uBAAuBA,EAAG;AAAA,IACnC,CAAC,QAAQ,uBAAuBA,EAAG;AAAA,IACnC,CAAC,WAAW,SAAS;AAAA,IACrB,CAAC,SAAS,WAAWA,EAAG;AAAA,IACxB,CAAC,WAAW,MAAM;AAAA,EACtB;AACE,EAAAyB,EAAK,QAAQD,CAAO,GACpBtB,GAAwB7B,CAAG;AAC7B;AACe,SAAAA,GAASA,GAAK;AAC3B,MAAI,OAAOA,KAAQ;AACjB,WAAOmC,GAAkBnC,CAAG;AAE9B,QAAMqD,IAAUtD,GAAiBC,CAAG;AACpC,MAAIsD,IAAOnC,GAAOnB,CAAG;AACrB,MAAIqD,MAAY,QAAQ;AACtB,UAAMjB,IAAWtC,GAAcwD,CAAI;AACnC,WAAOnB,GAAkBC,CAAQ;AAAA,EACrC;AACE,MAAI1E,IAAO4F,EAAK,CAAC,GACbvH,IAAM,CAAA;AACV,SAAA2F,GAAM4B,GAAMvH,CAAG,GACf4G,GAAS5G,CAAG,GACLA,EAAI2B,CAAI;AACjB;ACxJA,SAASnD,GAAKoD,GAAM;AAElB,MAAI4F,IAAO;AACX,MAAI,UAAU,WAAW,GAAG;AAC1B,QAAIC,IAAM,UAAU,CAAC;AACrB,IAAI,OAAOA,KAAQ,WACbA,EAAI,OAAO,CAAC,MAAM,MACpBjJ;AAAA;AAAA,MAA4BoD;AAAA,IAAI,IAAK8F,GAAU,UAAU,CAAC,CAAC,IAE3DlJ;AAAA;AAAA,MAA4BoD;AAAA,IAAI,IAAKqC,GAAI,UAAU,CAAC,CAAC,IAE9CwD,KAAO,OAAOA,KAAQ,YAAY,EAAE,cAAcA,KAE3DjJ;AAAA;AAAA,MAA4BoD;AAAA,IAAI,IAAKqC,GAAI,UAAU,CAAC,CAAC,KAErDzF;AAAA;AAAA,MAA4BoD;AAAA,IAAI,IAAK6F,GAChCA,KACH,OAAOjJ;AAAA;AAAA,MAA4BoD;AAAA,IAAI;AAAA,EAG/C,WAAa,UAAU,WAAW,GAAG;AACjC,QAAI,MAAM,QAAQA,CAAI;AACpB,aAAOA,EAAK,IAAI,SAAUjB,GAAG;AAC3B,eAAI,MAAM,QAAQA,CAAC,IACVnC,GAAK,MAAMgJ,GAAM7G,CAAC,IAElBnC,GAAKmC,CAAC;AAAA,MAEvB,CAAO;AACI,QAAI,OAAOiB,KAAS;AACzB,UAAIA,KAAQpD;AACV,eAAOA,GAAKoD,CAAI;AAAA,UAEb,CAAI,UAAUA,IACnBpD,GAAK,UAAUoD,EAAK,IAAI,IAAIA,IACnB,UAAUA,IACnBpD,GAAK,UAAUoD,EAAK,IAAI,IAAIA,IACnB,aAAaA,IACtBpD,GAAK,aAAaoD,EAAK,OAAO,IAAIA,IAElC,QAAQ,IAAIA,CAAI;AAElB;AAAA,EACJ;AACA;AACArD,GAAQC,EAAI;AC3GZ,SAASmJ,GAAQC,GAAM;AACrB,SAAO,OAAOA,KAAS;AACzB;AACA,SAASC,GAAQD,GAAM;AACrB,SAAOA,KAAQpJ;AACjB;AACA,SAASsJ,GAAQF,GAAM;AACrB,SAAQA,EAAK,QAAQ,GAAG,MAAM,KAAKA,EAAK,QAAQ,GAAG,MAAM,MAAQ,OAAOA,KAAS,YAAY,EAAE,aAAaA;AAC9G;AACA,IAAIG,KAAQ,CAAC,QAAQ,UAAU,QAAQ,QAAQ;AAC/C,SAASC,GAActC,GAAM;AAC3B,MAAIuC,IAAOlI,GAAM2F,GAAM,WAAW;AAClC,MAAKuC,GAGL;AAAA,QAAIL,IAAO7H,GAAMkI,GAAM,MAAM;AAC7B,WAAOL,KAAQG,GAAM,QAAQH,CAAI,IAAI;AAAA;AACvC;AACA,SAASM,GAAaxC,GAAM;AAC1B,MAAIyC,IAAMpI,GAAM2F,GAAM,WAAW;AACjC,MAAKyC;AAGL,WAAOpI,GAAMoI,GAAK,OAAO;AAC3B;AACA,SAASC,GAASR,GAAM;AACtB,SAAOA,EAAK,CAAC,MAAM;AACrB;AAKA,SAASS,GAAMT,GAAM;AACnB,MAAID,GAAQC,CAAI,GAAG;AAEjB,QAAIC,GAAQD,CAAI;AACd,aAAOpJ,GAAKoJ,CAAI;AAElB,QAAIE,GAAQF,CAAI,GAAG;AACjB,UAAIpC,IAAMvB,GAAI2D,CAAI;AAElB,UAAII,GAAcxC,CAAG;AACnB,eAAOhH,GAAK,WAAW;AAEzB,UAAI8J,IAAeJ,GAAa1C,CAAG;AACnC,aAAI8C,IACK/H,GAAQ+H,CAAY,IAEtB9C;AAAA,IACb;AACI,QAAI4C,GAASR,CAAI;AACf,aAAOrH,GAAQqH,CAAI;AAAA,EAEzB,MAAS,QAAM,cAAcA,IAGlBA,IAFA3D,GAAI2D,CAAI;AAInB;AC9De,SAAAW,GAAUC,GAAaC,GAAQ;AAC5C,EAAAD,IAAcA,KAAe,CAAA;AAC7B,MAAIlD,GAAOoD;AACX,MAAI,CAACD;AACH,WAAOD;AAET,OAAKE,KAAYD;AACf,IAAAnD,IAAQmD,EAAOC,CAAQ,GACnBpD,MAAU,WACZkD,EAAYE,CAAQ,IAAIpD;AAG5B,SAAOkD;AACT;ACbe,SAAAG,GAAUC,GAAQC,GAAQC,GAAQ;AAC/C,MAAIC,IAAMH,IAASC;AACnB,SAAOC,IAAU,KAAK,KAAK,IAAIC,IAAMA,CAAG;AAC1C;ACHe,SAAAC,GAAUC,GAAG;AAC1B,SAAOA,IAAI,IAAI,KAAK;AACtB;ACCe,SAAAC,EAAUD,GAAGE,GAAY;AACtC,SAAIA,KAGI,KAAK,IAAIF,CAAC,KAAKtJ,KAFdsJ,IAE0BA,IAAKD,GAAKC,CAAC,IAAIvJ;AACpD;ACNe,SAAA0J,GAAUR,GAAQS,GAAKR,GAAQ;AAC5C,MAAIE,IAAMH,IAASC,GACfS,IAAM,MAAMV;AAChB,SAAAG,IAAM,KAAK,KAAM,IAAIA,MAAQ,IAAIA,IAAOO,CAAG,GACnC,KAAK,IAAI,OAAOpK,IAAUmK,EAAI,IAAIN;AAC5C;ACLe,SAAAQ,GAAUX,GAAQY,GAAI;AAInC,WAHIC,IAAS,MAAMb,GACfG,GAAKW,GACLL,IAAMnK,IAAU,IAAI,KAAK,KAAKsK,CAAE,GAC3BpJ,IAAI,GAAGA,KAAK,IAAIA;AAIvB,QAHA2I,IAAMH,IAAS,KAAK,IAAIS,CAAG,GAC3BK,IAAOxK,IAAU,IAAI,KAAK,KAAKsK,IAAM,KAAK,KAAM,IAAIT,MAAQ,IAAIA,IAAOU,CAAM,CAAE,IAAIJ,GACnFA,KAAOK,GACH,KAAK,IAAIA,CAAI,KAAK;AACpB,aAAOL;AAIX,SAAO;AACT;ACDO,SAASM,KAAO;AACrB,MAAIZ,IAAM,KAAK,IAAI,KAAK;AACxB,OAAK,KAAK,IAAIA,IAAMA,GACd,QAAQ,SACZ,KAAK,KAAK,IAEN,QAAQ,SACZ,KAAK,KAAK,IAEZ,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE,GACtB,KAAK,SACH,KAAK,SACP,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,IAE9B,KAAK,KAAKJ,GAAM,KAAK,GAAG,KAAK,IAAI,KAAK,MAAM,GAAG,KAAK,IAAI,KAAK,MAAM,CAAC,IAGjE,KAAK,OACJ,KAAK,IACP,KAAK,KAAK,KAAK,IAEf,KAAK,KAAK;AAIlB;AAKO,SAASiB,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE;AAEZ,MAAIiJ,IAAMtK,KAAM,MAAMsK,IAAMtK,KAAM,OAAOqK,IAAMrK,KAAM,OAAOqK,IAAMrK,KAAM;AACtE,WAAO;AAGT,MAAIyJ,GAAGc;AACP,MAAI,KAAK,IAAI,KAAK,IAAID,CAAG,IAAI5K,CAAO,KAAKI;AACvC,WAAO;AAEP,MAAI,KAAK;AACP,IAAA2J,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAKC,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GACvEE,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAItK,KAAS,MAAMqK,CAAG,CAAC;AAAA,OACjE;AACL,QAAIjB,IAAS,KAAK,IAAIiB,CAAG,GACrBN,IAAKJ,GAAM,KAAK,GAAGU,GAAKjB,CAAM;AAClC,IAAAI,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAKC,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GACvEE,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAIP,CAAE;AAAA,EAClD;AACI,SAAA3I,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GACClJ;AAEX;AAIO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIoI,IAAIpI,EAAE,IAAI,KAAK,IACfkJ,IAAIlJ,EAAE,IAAI,KAAK,IACfgJ,GAAKC;AAET,MAAI,KAAK;AACP,IAAAA,IAAM5K,IAAU,IAAI,KAAK,KAAK,KAAK,IAAI,CAAC6K,KAAK,KAAK,IAAI,KAAK,GAAG,CAAC;AAAA,OAC1D;AACL,QAAIP,IAAK,KAAK,IAAI,CAACO,KAAK,KAAK,IAAI,KAAK,GAAG;AAEzC,QADAD,IAAMP,GAAM,KAAK,GAAGC,CAAE,GAClBM,MAAQ;AACV,aAAO;AAAA,EAEb;AACE,SAAAD,IAAMX,EAAW,KAAK,QAAQD,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,GAE/DpI,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,YAAY,yCAAyC,gBAAgB,6BAA6B,sBAAsB,MAAM;AAClJ,MAAAC,KAAe;AAAA,EACb,MAAMP;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACrGO,SAASN,KAAO;AAEvB;AAEA,SAASQ,GAASC,GAAI;AACpB,SAAOA;AACT;AAGO,IAAIH,KAAQ,CAAC,WAAW,UAAU;AACzC,MAAAI,KAAe;AAAA,EACb,MAAMV;AAAAA,EACN,SAASQ;AAAA,EACT,SAASA;AAAA,EACT,OAAOF;AACT;ACZA,IAAIK,KAAQ,CAACJ,IAAMG,EAAO,GACtBJ,KAAQ,CAAA,GACRM,KAAY,CAAA;AAMT,SAASC,GAAIC,GAAM,GAAG;AAC3B,MAAIC,IAAMH,GAAU;AACpB,SAAKE,EAAK,SAIVF,GAAUG,CAAG,IAAID,GACjBA,EAAK,MAAM,QAAQ,SAAUE,GAAG;AAC9BV,IAAAA,GAAMU,EAAE,YAAW,CAAE,IAAID;AAAA,EAC7B,CAAG,GACM,SAPL,QAAQ,IAAI,CAAC,GACN;AAOX;AAEO,SAASE,GAAsBD,GAAG;AACvC,SAAOA,EAAE,QAAQ,eAAe,GAAG,EAAE,OAAO,QAAQ,MAAM,GAAG;AAC/D;AAOO,SAASE,GAAIjJ,GAAM;AACxB,MAAI,CAACA;AACH,WAAO;AAET,MAAI+I,IAAI/I,EAAK,YAAW;AAKxB,MAJI,OAAOqI,GAAMU,CAAC,IAAM,OAAeJ,GAAUN,GAAMU,CAAC,CAAC,MAGzDA,IAAIC,GAAsBD,CAAC,GACvBA,KAAKV,MAASM,GAAUN,GAAMU,CAAC,CAAC;AAClC,WAAOJ,GAAUN,GAAMU,CAAC,CAAC;AAE7B;AAEO,SAASG,KAAQ;AACtB,EAAAR,GAAM,QAAQE,EAAG;AACnB;AACA,MAAAO,KAAe;AAAA,EACb,OAAOD;AAAA,EACP,KAAKN;AAAA,EACL,KAAKK;AACP;ACtDA,IAAIG,KAAa;AAAA,EACf,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,MAAM;AAAA,IACJ,GAAG;AAAA,IACH,GAAG;AAAA,IACH,aAAa;AAAA,EACjB;AAAA,EACE,MAAM;AAAA,IACJ,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,UAAU;AAAA,IACR,GAAG;AAAA,IACH,GAAG;AAAA,IACH,aAAa;AAAA,EACjB;AAAA,EACE,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,UAAU;AAAA,IACR,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,IACH,aAAa;AAAA,EACjB;AAAA,EACE,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,WAAW;AAAA,IACT,GAAG;AAAA,IACH,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,KAAK;AAAA,IACH,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,UAAU;AAAA,IACR,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,MAAM;AAAA,IACJ,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,UAAU;AAAA,IACR,GAAG;AAAA,IACH,GAAG;AAAA,IACH,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,IACH,aAAa;AAAA,EACjB;AAAA,EACE,SAAS;AAAA,IACP,GAAG;AAAA,IACH,GAAG;AAAA,IACH,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,MAAM;AAAA,IACJ,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,OAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,aAAa;AAAA,EACjB;AAAA,EACE,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,IACH,aAAa;AAAA,EACjB;AACA;AC1NA,MAAMC,KAAQC,GAAU;AAEjB,SAASC,GAAavK,GAAG0B,GAAG8I,GAAIC,GAAK;AAC1C,MAAIC,IAAK1K,IAAIA,GACT2K,IAAKjJ,IAAIA,GACTkJ,KAAMF,IAAKC,KAAMD,GACjBG,IAAI;AACR,EAAIJ,KACFzK,KAAK,IAAI4K,KAAMrM,KAAQqM,KAAMpM,KAAMoM,IAAKnM,MACxCiM,IAAK1K,IAAIA,GACT4K,IAAK,KAELC,IAAI,KAAK,KAAKD,CAAE;AAElB,MAAIE,KAAOJ,IAAKC,KAAMA;AACtB,SAAO;AAAA,IACL,IAAIC;AAAA,IACJ,GAAGC;AAAA,IACH,KAAKC;AAAA,EACT;AACA;AACO,SAASC,GAAO/K,GAAG0B,GAAG8I,GAAIQ,GAAOD,GAAQ;AAC9C,MAAI,CAAC/K,GAAG;AACN,QAAIiL,IAAU9L,GAAMmL,IAAWU,CAAK;AACpC,IAAKC,MACHA,IAAUZ,KAEZrK,IAAIiL,EAAQ,GACZvJ,IAAIuJ,EAAQ,GACZT,IAAKS,EAAQ;AAAA,EACjB;AAEE,SAAIT,KAAM,CAAC9I,MACTA,KAAK,IAAM,IAAM8I,KAAMxK,KAErBwK,MAAO,KAAK,KAAK,IAAIxK,IAAI0B,CAAC,IAAIhD,OAChCqM,IAAS,IACTrJ,IAAI1B,IAEC;AAAA,IACL,GAAGA;AAAA,IACH,GAAG0B;AAAA,IACH,IAAI8I;AAAA,IACJ,QAAQO;AAAA,EACZ;AACA;ACjDA,IAAIG,KAAS;AAAA,EACX,OAAO;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,QAAQ;AAAA,IACN,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,QAAQ;AAAA,IACN,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,OAAO;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,OAAO;AAAA,IACL,UAAU;AAAA,IACV,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,SAAS;AAAA,IACP,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,UAAU;AAAA,IACR,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,eAAe;AAAA,IACb,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,KAAK;AAAA,IACH,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,QAAQ;AAAA,IACN,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,OAAO;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,YAAY;AAAA,IACV,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,QAAQ;AAAA,IACN,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,QAAQ;AAAA,IACN,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,QAAQ;AAAA,IACN,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,UAAU;AAAA,IACR,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,eAAe;AAAA,IACb,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,OAAO;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,EACf;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,YAAY;AAAA,IACV,SAAS;AAAA,EACb;AAAA,EACE,YAAY;AAAA,IACV,SAAS;AAAA,EACb;AAAA,EACE,YAAY;AAAA,IACV,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,YAAY;AAAA,IACV,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,eAAe;AAAA,IACb,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,iBAAiB;AAAA,IACf,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,YAAY;AAAA,IACV,SAAS;AAAA,EACb;AAAA,EACE,eAAe;AAAA,IACb,SAAS;AAAA,EACb;AAAA,EACE,eAAe;AAAA,IACb,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,gBAAgB;AAAA,IACd,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,YAAY;AAAA,IACV,SAAS;AAAA,EACb;AAAA,EACE,YAAY;AAAA,IACV,SAAS;AAAA,EACb;AAAA,EACE,YAAY;AAAA,IACV,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,eAAe;AAAA,IACb,SAAS;AAAA,EACb;AAAA,EACE,eAAe;AAAA,IACb,SAAS;AAAA,EACb;AAAA,EACE,iBAAiB;AAAA,IACf,SAAS;AAAA,EACb;AAAA,EACE,kBAAkB;AAAA,IAChB,SAAS;AAAA,EACb;AAAA,EACE,gBAAgB;AAAA,IACd,SAAS;AAAA,EACb;AAAA,EACE,YAAY;AAAA,IACV,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,cAAc;AAAA,IACZ,SAAS;AAAA,EACb;AAAA,EACE,eAAe;AAAA,IACb,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,WAAW;AAAA,IACT,SAAS;AAAA,EACb;AACA;AAEA,SAAS7L,MAAO6L,IAAQ;AACtB,MAAIC,KAAQD,GAAO7L,EAAG;AACtB,EAAK8L,GAAM,cAGXD,GAAOC,GAAM,SAAS,IAAIA;AAC5B;AC5vCA,SAASA,GAAMC,GAAWC,GAAcrL,GAAG0B,GAAGkJ,GAAIE,GAAKQ,GAAU;AAC/D,MAAI1G,IAAM,CAAA;AAEV,SAAIwG,MAAc,UAAaA,MAAc,SAC3CxG,EAAI,aAAa3G,KAEjB2G,EAAI,aAAa5G,IAGfqN,MACFzG,EAAI,eAAeyG,EAAa,IAAI,UAAU,IAC1CzG,EAAI,aAAa,CAAC,MAAM,KAAKA,EAAI,aAAa,CAAC,MAAM,KAAKA,EAAI,aAAa,CAAC,MAAM,OACpFA,EAAI,aAAa/G,KAEf+G,EAAI,aAAa,SAAS,MACxBA,EAAI,aAAa,CAAC,MAAM,KAAKA,EAAI,aAAa,CAAC,MAAM,KAAKA,EAAI,aAAa,CAAC,MAAM,KAAKA,EAAI,aAAa,CAAC,MAAM,OACjHA,EAAI,aAAa9G,IACjB8G,EAAI,aAAa,CAAC,KAAKvG,IACvBuG,EAAI,aAAa,CAAC,KAAKvG,IACvBuG,EAAI,aAAa,CAAC,KAAKvG,IACvBuG,EAAI,aAAa,CAAC,IAAKA,EAAI,aAAa,CAAC,IAAI,MAAa,KAK5D0G,MACF1G,EAAI,aAAa7G,IACjB6G,EAAI,QAAQ0G,IAEd1G,EAAI,IAAI5E,GACR4E,EAAI,IAAIlD,GACRkD,EAAI,KAAKgG,GACThG,EAAI,MAAMkG,GACHlG;AACT;ACsBA,IAAI2G,KAAiB,CAAA;AAuBN,SAASC,GAAQnM,GAAKoM,GAAMC,GAAS;AAClD,SAAID,aAAgB,cACXE,GAAatM,GAAKoM,GAAMC,CAAO,IAEjC,EAAE,OAAOE,GAAgBvM,GAAKoM,CAAI,EAAC;AAC5C;AAQA,SAASE,GAAatM,GAAKoM,GAAMC,GAAS;AACxC,MAAIG,IAAqB;AACzB,EAAIH,MAAY,UAAaA,EAAQ,uBAAuB,OAC1DG,IAAqB;AAEvB,MAAIC,IAAO,IAAI,SAASL,CAAI,GACxBM,IAAiBC,GAAmBF,CAAI,GACxCG,IAASC,GAAWJ,GAAMC,CAAc,GACxCI,IAAWC,GAAaN,GAAMG,GAAQF,GAAgBF,CAAkB,GACxEL,IAAU,EAAE,QAAQS,GAAQ,UAAUE,EAAQ;AAClD,SAAAZ,GAAelM,CAAG,IAAImM,GACfA;AACT;AAOA,eAAeI,GAAgBvM,GAAKgN,GAAM;AAIxC,WAHIF,IAAW,CAAA,GACXG,IAAe,MAAMD,EAAK,cAAa,GAElCE,IAAeD,IAAe,GAAGC,KAAgB,GAAGA,KAAgB;AAC3E,QAAIC,IAAQ,MAAMH,EAAK,SAASE,CAAY,GAExCE,IAAU,MAAMD,EAAM,YAAW,GACjCf,IAAOgB,GACPC,IAAM,CAACF,EAAM,SAAQ,GAAIA,EAAM,WAAW,GAC1CG,IAAmBH,EAAM,eAAc,EAAG,IAAII,EAAgB,GAC9DC,IAAM,CAACL,EAAM,cAAc,gBAAgB,CAAC,GAAGA,EAAM,cAAc,gBAAgB,CAAC,CAAC,EAAE,IAAII,EAAgB,GAE3GE,IAAOH,EAAiB,CAAC,KAAKD,EAAI,CAAC,IAAI,KAAKG,EAAI,CAAC,GACjDE,IAAOJ,EAAiB,CAAC,KAAKD,EAAI,CAAC,IAAI,KAAKG,EAAI,CAAC,GAEjDG,IAAqBvB,EAAK,CAAC,GAC3BwB,IAAsBxB,EAAK,CAAC,GAC5ByB,IAAQ,CAAA;AAEZ,aAAS1N,IAAIkN,EAAI,CAAC,IAAI,GAAGlN,KAAK,GAAGA;AAC/B,eAAS2N,IAAIT,EAAI,CAAC,IAAI,GAAGS,KAAK,GAAGA,KAAK;AACpC,YAAIC,IAAQ5N,IAAIkN,EAAI,CAAC,IAAIS;AACzB,QAAAD,EAAM,KAAK,CAAC,CAACG,GAAiBJ,EAAoBG,CAAK,CAAC,GAAGC,GAAiBL,EAAmBI,CAAK,CAAC,CAAC,CAAC;AAAA,MAC/G;AAGI,IAAAjB,EAAS,KAAK;AAAA,MACZ,KAAKU;AAAA,MACL,KAAKH;AAAA,MACL,IAAI,CAAC,CAACI,GAAMC,CAAI;AAAA,MAChB,KAAKG;AAAA,IACX,CAAK;AAAA,EACL;AAEE,MAAII,IAAU;AAAA,IACZ,QAAQ;AAAA,MACN,WAAWhB;AAAA,IACjB;AAAA,IACI,UAAUH;AAAA,EACd;AACE,SAAAZ,GAAelM,CAAG,IAAIiO,GACfA;AACT;AAOO,SAASC,GAAYjC,GAAU;AAEpC,MAAIA,MAAa;AACf,WAAO;AAET,MAAIkC,IAAQlC,EAAS,MAAM,GAAG;AAC9B,SAAOkC,EAAM,IAAIC,EAAkB;AACrC;AAMA,SAASA,GAAmB/I,GAAO;AACjC,MAAIA,EAAM,WAAW;AACnB,WAAO;AAET,MAAIgJ,IAAWhJ,EAAM,CAAC,MAAM;AAI5B,SAHIgJ,MACFhJ,IAAQA,EAAM,MAAM,CAAC,IAEnBA,MAAU,SACL,EAAE,MAAM,QAAQ,WAAW,CAACgJ,GAAU,MAAM,MAAM,QAAQ,GAAI,IAEhE;AAAA,IACL,MAAMhJ;AAAA,IACN,WAAW,CAACgJ;AAAA,IACZ,MAAMnC,GAAe7G,CAAK,KAAK;AAAA,IAC/B,QAAQ;AAAA,EACZ;AACA;AAEA,SAASkI,GAAiBe,GAAS;AACjC,SAAQA,IAAW,KAAK,KAAK;AAC/B;AAEA,SAASN,GAAiBO,GAAS;AACjC,SAAQA,IAAU,OAAQ,KAAK,KAAK;AACtC;AAEA,SAAS5B,GAAmBF,GAAM;AAChC,MAAI+B,IAAU/B,EAAK,SAAS,GAAG,EAAK;AACpC,SAAI+B,MAAY,KACP,MAETA,IAAU/B,EAAK,SAAS,GAAG,EAAI,GAC3B+B,MAAY,MACd,QAAQ,KAAK,mEAAmE,GAE3E;AACT;AAEA,SAAS3B,GAAWJ,GAAMC,GAAgB;AACxC,SAAO;AAAA,IACL,SAASD,EAAK,SAAS,GAAGC,CAAc;AAAA,IACxC,gBAAgBD,EAAK,SAAS,IAAIC,CAAc;AAAA,IAChD,WAAWD,EAAK,SAAS,IAAIC,CAAc;AAAA,IAC3C,WAAW+B,GAAahC,GAAM,IAAI,EAAM,EAAE,KAAI;AAAA,IAC9C,mBAAmBA,EAAK,WAAW,KAAKC,CAAc;AAAA,IACtD,mBAAmBD,EAAK,WAAW,KAAKC,CAAc;AAAA,IACtD,iBAAiBD,EAAK,WAAW,KAAKC,CAAc;AAAA,IACpD,iBAAiBD,EAAK,WAAW,KAAKC,CAAc;AAAA,EACxD;AACA;AAEA,SAAS+B,GAAahC,GAAM5B,GAAO6D,GAAK;AACtC,SAAO,OAAO,aAAa,MAAM,MAAM,IAAI,WAAWjC,EAAK,OAAO,MAAM5B,GAAO6D,CAAG,CAAC,CAAC;AACtF;AAEA,SAAS3B,GAAaN,GAAMG,GAAQF,GAAgBF,GAAoB;AAGtE,WAFImC,IAAa,KACbR,IAAQ,CAAA,GACHhO,IAAI,GAAGA,IAAIyM,EAAO,WAAWzM,KAAK;AACzC,QAAIyO,IAAYC,GAAepC,GAAMkC,GAAYjC,CAAc,GAC3DmB,IAAQiB,GAAcrC,GAAMkC,GAAYC,GAAWlC,GAAgBF,CAAkB,GACrFuC,IAAiB,KAAK;AAAA,MACxB,KAAKH,EAAU,iBAAiBA,EAAU,kBAAkBA,EAAU;AAAA,IAAiB,GACrFI,IAAiB,KAAK;AAAA,MACxB,KAAKJ,EAAU,gBAAgBA,EAAU,iBAAiBA,EAAU;AAAA,IAAgB;AAEtF,IAAAT,EAAM,KAAK;AAAA,MACT,IAAI,CAACH,GAAiBY,EAAU,cAAc,GAAGZ,GAAiBY,EAAU,aAAa,CAAC;AAAA,MAC1F,KAAK,CAACZ,GAAiBY,EAAU,iBAAiB,GAAGZ,GAAiBY,EAAU,gBAAgB,CAAC;AAAA,MACjG,KAAK,CAACG,GAAgBC,CAAc;AAAA,MACpC,OAAOJ,EAAU;AAAA,MACjB,KAAKK,GAASpB,CAAK;AAAA,IACzB,CAAK;AACD,QAAIqB,IAAU;AACd,IAAI1C,MAAuB,OACzB0C,IAAU,IAEZP,KAAc,MAAMC,EAAU,gBAAgBM;AAAA,EAClD;AACE,SAAOf;AACT;AAMA,SAASc,GAASpB,GAAO;AACvB,SAAOA,EAAM,IAAI,SAAUsB,GAAG;AAC5B,WAAO,CAACnB,GAAiBmB,EAAE,cAAc,GAAGnB,GAAiBmB,EAAE,aAAa,CAAC;AAAA,EACjF,CAAG;AACH;AAEA,SAASN,GAAepC,GAAM2C,GAAQ1C,GAAgB;AACpD,SAAO;AAAA,IACL,MAAM+B,GAAahC,GAAM2C,IAAS,GAAGA,IAAS,EAAE,EAAE,KAAI;AAAA,IACtD,QAAQX,GAAahC,GAAM2C,IAAS,IAAIA,IAAS,KAAK,CAAC,EAAE,KAAI;AAAA,IAC7D,eAAe3C,EAAK,WAAW2C,IAAS,IAAI1C,CAAc;AAAA,IAC1D,eAAeD,EAAK,WAAW2C,IAAS,IAAI1C,CAAc;AAAA,IAC1D,gBAAgBD,EAAK,WAAW2C,IAAS,KAAK1C,CAAc;AAAA,IAC5D,gBAAgBD,EAAK,WAAW2C,IAAS,KAAK1C,CAAc;AAAA,IAC5D,kBAAkBD,EAAK,WAAW2C,IAAS,KAAK1C,CAAc;AAAA,IAC9D,mBAAmBD,EAAK,WAAW2C,IAAS,KAAK1C,CAAc;AAAA,IAC/D,eAAeD,EAAK,SAAS2C,IAAS,KAAK1C,CAAc;AAAA,EAC7D;AACA;AAEA,SAASoC,GAAcrC,GAAM2C,GAAQC,GAAY3C,GAAgBF,GAAoB;AACnF,MAAI8C,IAAcF,IAAS,KACvBG,IAAmB;AAEvB,EAAI/C,MAAuB,OACzB+C,IAAmB;AAIrB,WADIC,IAAmB,CAAA,GACdrP,IAAI,GAAGA,IAAIkP,EAAW,eAAelP,KAAK;AACjD,QAAIsP,IAAS;AAAA,MACX,eAAehD,EAAK,WAAW6C,IAAcnP,IAAIoP,GAAkB7C,CAAc;AAAA,MACjF,gBAAgBD,EAAK,WAAW6C,IAAcnP,IAAIoP,IAAmB,GAAG7C,CAAc;AAAA,IAE5F;AAEI,IAAIF,MAAuB,OACzBiD,EAAO,mBAAmBhD,EAAK,WAAW6C,IAAcnP,IAAIoP,IAAmB,GAAG7C,CAAc,GAChG+C,EAAO,oBAAoBhD,EAAK,WAAW6C,IAAcnP,IAAIoP,IAAmB,IAAI7C,CAAc,IAGpG8C,EAAiB,KAAKC,CAAM;AAAA,EAChC;AACE,SAAOD;AACT;AC7RA,SAASE,GAAWC,GAASC,GAAU;AACrC,MAAI,EAAE,gBAAgBF;AACpB,WAAO,IAAIA,GAAWC,CAAO;AAG/B,OAAK,UAAU,MAEf,KAAK,UAAU,MAEf,KAAK,OAAO,MAEZ,KAAK,MAEL,KAAK,QAAQ,MAEb,KAAK,OACLC,IAAWA,KAAY,SAAUC,GAAO;AACtC,QAAIA;AACF,YAAMA;AAAA,EAEZ;AACE,MAAIC,IAAOC,GAAUJ,CAAO;AAC5B,MAAI,OAAOG,KAAS,UAAU;AAC5B,IAAAF,EAAS,oCAAoCD,CAAO;AACpD;AAAA,EACJ;AACE,MAAIK,IAAUN,GAAW,YAAY,IAAII,EAAK,QAAQ;AACtD,MAAI,CAACE,GAAS;AACZ,IAAAJ,EAAS,yCAAyCD,CAAO;AACzD;AAAA,EACJ;AACE,MAAIG,EAAK,aAAaA,EAAK,cAAc,QAAQ;AAC/C,QAAIG,IAAWnQ,GAAMoQ,IAAOJ,EAAK,SAAS;AAC1C,IAAIG,MACFH,EAAK,eAAeA,EAAK,iBAAiBG,EAAS,UAAUA,EAAS,QAAQ,MAAM,GAAG,IAAI,OAC3FH,EAAK,QAAQG,EAAS,SACtBH,EAAK,YAAYG,EAAS,YAAYA,EAAS,YAAYH,EAAK;AAAA,EAEtE;AACE,EAAAA,EAAK,KAAKA,EAAK,MAAM,GACrBA,EAAK,OAAOA,EAAK,QAAQ,OACzBA,EAAK,QAAQA,EAAK,SAAS,SAC3BA,EAAK,OAAOA,EAAK,QAAQA,EAAK;AAE9B,MAAIK,IAAUC,GAAUN,EAAK,GAAGA,EAAK,GAAGA,EAAK,IAAIA,EAAK,OAAOA,EAAK,MAAM,GACpEO,IAAMC,GAAgBH,EAAQ,GAAGA,EAAQ,GAAGA,EAAQ,IAAIL,EAAK,GAAG,GAChE7D,IAAWiC,GAAY4B,EAAK,QAAQ,GAEpCS,IAAWT,EAAK,SAAShE;AAAA,IAAMgE,EAAK;AAAA,IAAWA,EAAK;AAAA,IAAcK,EAAQ;AAAA,IAAGA,EAAQ;AAAA,IAAGE,EAAI;AAAA,IAAIA,EAAI;AAAA,IACtGpE;AAAA,EAAQ;AAEVuE,EAAAA,GAAO,MAAMV,CAAI,GACjBU,GAAO,MAAMR,CAAO,GAGpB,KAAK,IAAIG,EAAQ,GACjB,KAAK,IAAIA,EAAQ,GACjB,KAAK,KAAKA,EAAQ,IAClB,KAAK,SAASA,EAAQ,QAGtB,KAAK,KAAKE,EAAI,IACd,KAAK,IAAIA,EAAI,GACb,KAAK,MAAMA,EAAI,KAGf,KAAK,QAAQE,GAGT,UAAU,QAAQ,OAAO,KAAK,QAAS,cACzC,KAAK,KAAI,GAIXX,EAAS,MAAM,IAAI;AACrB;AACAF,GAAW,cAAc5E;AACzB4E,GAAW,YAAY,MAAK;ACjGrB,SAASe,GAAcjI,GAAQkI,GAAM;AAC1C,SAAIlI,EAAO,eAAekI,EAAK,cAEpBlI,EAAO,MAAMkI,EAAK,KAAK,KAAK,IAAIlI,EAAO,KAAKkI,EAAK,EAAE,IAAI,QADzD,KAKElI,EAAO,eAAehK,KACvBgK,EAAO,aAAa,CAAC,MAAMkI,EAAK,aAAa,CAAC,KAAKlI,EAAO,aAAa,CAAC,MAAMkI,EAAK,aAAa,CAAC,KAAKlI,EAAO,aAAa,CAAC,MAAMkI,EAAK,aAAa,CAAC,IACnJlI,EAAO,eAAe/J,KACvB+J,EAAO,aAAa,CAAC,MAAMkI,EAAK,aAAa,CAAC,KAAKlI,EAAO,aAAa,CAAC,MAAMkI,EAAK,aAAa,CAAC,KAAKlI,EAAO,aAAa,CAAC,MAAMkI,EAAK,aAAa,CAAC,KAAKlI,EAAO,aAAa,CAAC,MAAMkI,EAAK,aAAa,CAAC,KAAKlI,EAAO,aAAa,CAAC,MAAMkI,EAAK,aAAa,CAAC,KAAKlI,EAAO,aAAa,CAAC,MAAMkI,EAAK,aAAa,CAAC,KAAKlI,EAAO,aAAa,CAAC,MAAMkI,EAAK,aAAa,CAAC,IAEjW;AAEX;AAeO,SAASC,GAAqB/P,GAAG2K,GAAI5K,GAAG;AAC7C,MAAIiQ,IAAYhQ,EAAE,GACdiQ,IAAWjQ,EAAE,GACbkQ,IAASlQ,EAAE,IAAIA,EAAE,IAAI,GAErBmQ,GACAC,GACAC,GACAC;AAOJ,MAAIL,IAAW,CAAC5R,KAAW4R,IAAW,SAAS5R;AAC7C,IAAA4R,IAAW,CAAC5R;AAAA,WACH4R,IAAW5R,KAAW4R,IAAW,QAAQ5R;AAClD,IAAA4R,IAAW5R;AAAA,OACN;AAAA,QAAI4R,IAAW,CAAC5R;AAGrB,aAAO,EAAE,GAAG,QAAW,GAAG,QAAW,GAAG2B,EAAE,EAAC;AACtC,QAAIiQ,IAAW5R;AAEpB,aAAO,EAAE,GAAG,OAAU,GAAG,OAAU,GAAG2B,EAAE,EAAC;AAAA;AAG3C,SAAIgQ,IAAY,KAAK,OACnBA,KAAc,IAAI,KAAK,KAEzBI,IAAU,KAAK,IAAIH,CAAQ,GAC3BK,IAAU,KAAK,IAAIL,CAAQ,GAC3BI,IAAWD,IAAUA,GACrBD,IAAKpQ,IAAK,KAAK,KAAK,IAAQ4K,IAAK0F,CAAQ,GAClC;AAAA,IACL,IAAIF,IAAKD,KAAUI,IAAU,KAAK,IAAIN,CAAS;AAAA,IAC/C,IAAIG,IAAKD,KAAUI,IAAU,KAAK,IAAIN,CAAS;AAAA,IAC/C,IAAKG,KAAM,IAAIxF,KAAOuF,KAAUE;AAAA,EACpC;AACA;AAEO,SAASG,GAAqBvQ,GAAG2K,GAAI5K,GAAG0B,GAAG;AAGhD,MAAI+O,IAAQ,OACRC,IAAUD,IAAQA,GAClBE,IAAU,IAEVC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAEAC,IAAIxR,EAAE,GACNyR,IAAIzR,EAAE,GACN0R,IAAI1R,EAAE,IAAIA,EAAE,IAAI,GAChBgQ,GACAC,GACAC;AAMJ,MAJAS,IAAI,KAAK,KAAKa,IAAIA,IAAIC,IAAIA,CAAC,GAC3Bb,IAAK,KAAK,KAAKY,IAAIA,IAAIC,IAAIA,IAAIC,IAAIA,CAAC,GAGhCf,IAAI5Q,IAAIyQ;AAMV,QAJAR,IAAY,GAIRY,IAAK7Q,IAAIyQ;AACX,aAAAP,IAAW5R,GACX6R,KAAS,CAACzO,GACH;AAAA,QACL,GAAGzB,EAAE;AAAA,QACL,GAAGA,EAAE;AAAA,QACL,GAAGA,EAAE;AAAA,MACb;AAAA;AAKI,IAAAgQ,IAAY,KAAK,MAAMyB,GAAGD,CAAC;AAY7B,EAAAX,IAAKa,IAAId,GACTE,IAAKH,IAAIC,GACTG,IAAK,IAAM,KAAK,KAAK,IAAMpG,KAAM,IAAMA,KAAMmG,IAAKA,CAAE,GACpDI,IAAQJ,KAAM,IAAMnG,KAAMoG,GAC1BI,IAAQN,IAAKE,GACbQ,IAAO;AAIP;AACE,IAAAA,KACAN,IAAKlR,IAAI,KAAK,KAAK,IAAM4K,IAAKwG,IAAQA,CAAK,GAG3CjB,KAASS,IAAIO,IAAQQ,IAAIP,IAAQF,KAAM,IAAMtG,IAAKwG,IAAQA,IAE1DH,IAAKrG,IAAKsG,KAAMA,IAAKf,KACrBa,IAAK,IAAM,KAAK,KAAK,IAAMC,KAAM,IAAMA,KAAMF,IAAKA,CAAE,GACpDM,IAAON,KAAM,IAAME,KAAMD,GACzBM,IAAOR,IAAKE,GACZO,IAAQD,IAAOH,IAAQE,IAAOD,GAC9BD,IAAQE,GACRD,IAAQE;AAAA,SAEHC,IAAQA,IAAQb,KAAUc,IAAOb;AAGxC,SAAAT,IAAW,KAAK,KAAKoB,IAAO,KAAK,IAAID,CAAI,CAAC,GACnC;AAAA,IACL,GAAGpB;AAAA,IACH,GAAGC;AAAA,IACH,GAAGC;AAAA,EACP;AACA;AAWO,SAASyB,GAAkB3R,GAAG4R,GAAYxG,GAAc;AAC7D,MAAIwG,MAAehU;AAGjB,WAAO;AAAA,MACL,GAAGoC,EAAE,IAAIoL,EAAa,CAAC;AAAA,MACvB,GAAGpL,EAAE,IAAIoL,EAAa,CAAC;AAAA,MACvB,GAAGpL,EAAE,IAAIoL,EAAa,CAAC;AAAA,IAC7B;AACS,MAAIwG,MAAe/T,IAAY;AACpC,QAAIgU,IAAQzG,EAAa,CAAC,GACtB0G,IAAQ1G,EAAa,CAAC,GACtB2G,IAAQ3G,EAAa,CAAC,GACtB4G,IAAQ5G,EAAa,CAAC,GACtB6G,IAAQ7G,EAAa,CAAC,GACtB8G,IAAQ9G,EAAa,CAAC,GACtB+G,IAAO/G,EAAa,CAAC;AAGzB,WAAO;AAAA,MACL,GAAG+G,KAAQnS,EAAE,IAAIkS,IAAQlS,EAAE,IAAIiS,IAAQjS,EAAE,KAAK6R;AAAA,MAC9C,GAAGM,KAAQD,IAAQlS,EAAE,IAAIA,EAAE,IAAIgS,IAAQhS,EAAE,KAAK8R;AAAA,MAC9C,GAAGK,KAAQ,CAACF,IAAQjS,EAAE,IAAIgS,IAAQhS,EAAE,IAAIA,EAAE,KAAK+R;AAAA,IACrD;AAAA,EACA;AACA;AAMO,SAASK,GAAoBpS,GAAG4R,GAAYxG,GAAc;AAC/D,MAAIwG,MAAehU;AAGjB,WAAO;AAAA,MACL,GAAGoC,EAAE,IAAIoL,EAAa,CAAC;AAAA,MACvB,GAAGpL,EAAE,IAAIoL,EAAa,CAAC;AAAA,MACvB,GAAGpL,EAAE,IAAIoL,EAAa,CAAC;AAAA,IAC7B;AACS,MAAIwG,MAAe/T,IAAY;AACpC,QAAIgU,IAAQzG,EAAa,CAAC,GACtB0G,IAAQ1G,EAAa,CAAC,GACtB2G,IAAQ3G,EAAa,CAAC,GACtB4G,IAAQ5G,EAAa,CAAC,GACtB6G,IAAQ7G,EAAa,CAAC,GACtB8G,IAAQ9G,EAAa,CAAC,GACtB+G,IAAO/G,EAAa,CAAC,GACrBiH,KAASrS,EAAE,IAAI6R,KAASM,GACxBG,KAAStS,EAAE,IAAI8R,KAASK,GACxBI,KAASvS,EAAE,IAAI+R,KAASI;AAI5B,WAAO;AAAA,MACL,GAAGE,IAAQH,IAAQI,IAAQL,IAAQM;AAAA,MACnC,GAAG,CAACL,IAAQG,IAAQC,IAAQN,IAAQO;AAAA,MACpC,GAAGN,IAAQI,IAAQL,IAAQM,IAAQC;AAAA,IACzC;AAAA,EACA;AACA;ACnOA,SAASC,GAAY1R,GAAM;AACzB,SAAQA,MAASlD,MAAckD,MAASjD;AAC1C;AAEe,SAAA4U,GAAU7K,GAAQkI,GAAM4C,GAAO;AAS5C,MAPI7C,GAAcjI,GAAQkI,CAAI,KAO1BlI,EAAO,eAAe5J,MAAe8R,EAAK,eAAe9R;AAC3D,WAAO0U;AAIT,MAAIC,IAAW/K,EAAO,GAClBgL,IAAYhL,EAAO;AACvB,MAAIA,EAAO,eAAe9J,IAAe;AACvC,QAAI+U,IAAgBC,GAAelL,GAAQ,IAAO8K,CAAK;AACvD,QAAIG,MAAkB;AACpB;AAEF,IAAAF,IAAW1U,IACX2U,IAAYzU;AAAA,EAChB;AAEE,MAAI4U,IAASjD,EAAK,GACdkD,IAASlD,EAAK,GACdmD,IAAUnD,EAAK;AAQnB,MAPIA,EAAK,eAAehS,OACtBiV,IAAS9U,IACT+U,IAAS9U,IACT+U,IAAU9U,KAIRyU,MAAcK,KAAWN,MAAaI,KAAU,CAACP,GAAY5K,EAAO,UAAU,KAAK,CAAC4K,GAAY1C,EAAK,UAAU;AACjH,WAAO4C;AAcT,MAVAA,IAAQ3C,GAAqB2C,GAAOE,GAAWD,CAAQ,GAEnDH,GAAY5K,EAAO,UAAU,MAC/B8K,IAAQf,GAAkBe,GAAO9K,EAAO,YAAYA,EAAO,YAAY,IAErE4K,GAAY1C,EAAK,UAAU,MAC7B4C,IAAQN,GAAoBM,GAAO5C,EAAK,YAAYA,EAAK,YAAY,IAEvE4C,IAAQnC,GAAqBmC,GAAOO,GAASF,GAAQC,CAAM,GAEvDlD,EAAK,eAAehS,IAAe;AACrC,QAAIoV,IAAsBJ,GAAehD,GAAM,IAAM4C,CAAK;AAC1D,QAAIQ,MAAwB;AAC1B;AAAA,EAEN;AAEE,SAAOR;AACT;AAEO,SAASI,GAAelL,GAAQuB,GAASuJ,GAAO;AACrD,MAAI9K,EAAO,UAAU,QAAQA,EAAO,MAAM,WAAW;AACnD,mBAAQ,IAAI,4BAA4B,GACjC;AAET,MAAI5C,IAAQ,EAAE,GAAG,CAAC0N,EAAM,GAAG,GAAGA,EAAM,EAAC,GACjCS,IAAS,EAAE,GAAG,OAAO,KAAK,GAAG,OAAO,IAAG,GACvCC,IAAiB,CAAA;AACrB,EAAAC;AACA,aAAS9T,IAAI,GAAGA,IAAIqI,EAAO,MAAM,QAAQrI,KAAK;AAC5C,UAAI+T,IAAO1L,EAAO,MAAMrI,CAAC;AAEzB,UADA6T,EAAe,KAAKE,EAAK,IAAI,GACzBA,EAAK,QAAQ;AACf,QAAAH,IAASnO;AACT;AAAA,MACN;AACI,UAAIsO,EAAK,SAAS,MAAM;AACtB,YAAIA,EAAK;AACP,yBAAQ,IAAI,oCAAqCA,EAAK,OAAO,GAAI,GAC1D;AAET;AAAA,MACN;AAEI,eADIpH,IAAWoH,EAAK,KAAK,UAChBpG,IAAI,GAAGqG,IAAKrH,EAAS,QAAQgB,IAAIqG,GAAIrG,KAAK;AACjD,YAAIsG,IAAUtH,EAASgB,CAAC,GAEpBuG,KAAW,KAAK,IAAID,EAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,IAAIA,EAAQ,IAAI,CAAC,CAAC,KAAK,KAClEE,IAAOF,EAAQ,GAAG,CAAC,IAAIC,GACvB3G,IAAO0G,EAAQ,GAAG,CAAC,IAAIC,GACvB5G,IAAO2G,EAAQ,GAAG,CAAC,KAAKA,EAAQ,IAAI,CAAC,IAAI,KAAKA,EAAQ,IAAI,CAAC,IAAIC,GAC/DE,IAAOH,EAAQ,GAAG,CAAC,KAAKA,EAAQ,IAAI,CAAC,IAAI,KAAKA,EAAQ,IAAI,CAAC,IAAIC;AACnE,YAAI,EAAA3G,IAAO9H,EAAM,KAAK0O,IAAO1O,EAAM,KAAK2O,IAAO3O,EAAM,KAAK6H,IAAO7H,EAAM,OAGvEmO,IAASS,GAAkB5O,GAAOmE,GAASqK,CAAO,GAC9C,CAAC,MAAML,EAAO,CAAC;AACjB,gBAAME;AAAA,MAEd;AAAA,IACA;AACE,SAAI,MAAMF,EAAO,CAAC,KAChB,QAAQ,IAAI,qDACR,CAACnO,EAAM,IAAIrG,KAAM,MAAMqG,EAAM,IAAIrG,KAAM,cAAeyU,IAAiB,GAAI,GACxE,OAETV,EAAM,IAAI,CAACS,EAAO,GAClBT,EAAM,IAAIS,EAAO,GACV;AACT;AAEA,SAASS,GAAkBC,GAAK1K,GAAS2K,GAAI;AAC3C,MAAIC,IAAM,EAAE,GAAG,OAAO,KAAK,GAAG,OAAO,IAAG;AACxC,MAAI,MAAMF,EAAI,CAAC;AACb,WAAOE;AAET,MAAIC,IAAK,EAAE,GAAGH,EAAI,GAAG,GAAGA,EAAI,EAAC;AAC7B,EAAAG,EAAG,KAAKF,EAAG,GAAG,CAAC,GACfE,EAAG,KAAKF,EAAG,GAAG,CAAC,GACfE,EAAG,IAAI3L,EAAW2L,EAAG,IAAI,KAAK,EAAE,IAAI,KAAK;AACzC,MAAIC,IAAIC,GAAeF,GAAIF,CAAE;AAC7B,MAAI3K,GAAS;AACX,QAAI,MAAM8K,EAAE,CAAC;AACX,aAAOF;AAET,IAAAE,EAAE,IAAID,EAAG,IAAIC,EAAE,GACfA,EAAE,IAAID,EAAG,IAAIC,EAAE;AACf,QAAI1U,IAAI,GAAG4U,IAAM,OACbC,GAAKxH;AACT,OAAG;AAED,UADAA,IAAMsH,GAAeD,GAAGH,CAAE,GACtB,MAAMlH,EAAI,CAAC,GAAG;AAChB,gBAAQ,IAAI,2FAA2F;AACvG;AAAA,MACR;AACM,MAAAwH,IAAM,EAAE,GAAGJ,EAAG,KAAKpH,EAAI,IAAIqH,EAAE,IAAI,GAAGD,EAAG,KAAKpH,EAAI,IAAIqH,EAAE,GAAE,GACxDA,EAAE,KAAKG,EAAI,GACXH,EAAE,KAAKG,EAAI;AAAA,IACjB,SAAa7U,OAAO,KAAK,IAAI6U,EAAI,CAAC,IAAID,KAAO,KAAK,IAAIC,EAAI,CAAC,IAAID;AAC3D,QAAI5U,IAAI;AACN,qBAAQ,IAAI,iDAAiD,GACtDwU;AAET,IAAAA,EAAI,IAAI1L,EAAW4L,EAAE,IAAIH,EAAG,GAAG,CAAC,CAAC,GACjCC,EAAI,IAAIE,EAAE,IAAIH,EAAG,GAAG,CAAC;AAAA,EACzB;AACI,IAAK,MAAMG,EAAE,CAAC,MACZF,EAAI,IAAIF,EAAI,IAAII,EAAE,GAClBF,EAAI,IAAIF,EAAI,IAAII,EAAE;AAGtB,SAAOF;AACT;AAEA,SAASG,GAAeL,GAAKC,GAAI;AAC/B,MAAIG,IAAI,EAAE,GAAGJ,EAAI,IAAIC,EAAG,IAAI,CAAC,GAAG,GAAGD,EAAI,IAAIC,EAAG,IAAI,CAAC,EAAC,GAChDO,IAAO,EAAE,GAAG,KAAK,MAAMJ,EAAE,CAAC,GAAG,GAAG,KAAK,MAAMA,EAAE,CAAC,EAAC,GAC/CK,IAAO,EAAE,GAAGL,EAAE,IAAI,IAAMI,EAAK,GAAG,GAAGJ,EAAE,IAAI,IAAMI,EAAK,EAAC,GACrDN,IAAM,EAAE,GAAG,OAAO,KAAK,GAAG,OAAO,IAAG,GACpCQ;AAIJ,MAHIF,EAAK,IAAI,KAAKA,EAAK,KAAKP,EAAG,IAAI,CAAC,KAGhCO,EAAK,IAAI,KAAKA,EAAK,KAAKP,EAAG,IAAI,CAAC;AAClC,WAAOC;AAET,EAAAQ,IAAOF,EAAK,IAAIP,EAAG,IAAI,CAAC,IAAKO,EAAK;AAClC,MAAIG,IAAM,EAAE,GAAGV,EAAG,IAAIS,CAAG,EAAE,CAAC,GAAG,GAAGT,EAAG,IAAIS,CAAG,EAAE,CAAC,EAAC;AAChD,EAAAA;AACA,MAAIE,IAAM,EAAE,GAAGX,EAAG,IAAIS,CAAG,EAAE,CAAC,GAAG,GAAGT,EAAG,IAAIS,CAAG,EAAE,CAAC,EAAC;AAChD,EAAAA,KAAOT,EAAG,IAAI,CAAC;AACf,MAAIY,IAAM,EAAE,GAAGZ,EAAG,IAAIS,CAAG,EAAE,CAAC,GAAG,GAAGT,EAAG,IAAIS,CAAG,EAAE,CAAC,EAAC;AAChD,EAAAA;AACA,MAAII,IAAM,EAAE,GAAGb,EAAG,IAAIS,CAAG,EAAE,CAAC,GAAG,GAAGT,EAAG,IAAIS,CAAG,EAAE,CAAC,EAAC,GAC5CK,IAAMN,EAAK,IAAIA,EAAK,GAAGO,IAAMP,EAAK,KAAK,IAAMA,EAAK,IACpDQ,KAAO,IAAMR,EAAK,MAAM,IAAMA,EAAK,IAAIS,KAAO,IAAMT,EAAK,KAAKA,EAAK;AACrE,SAAAP,EAAI,IAAKe,IAAMN,EAAI,IAAIK,IAAMJ,EAAI,IAAIM,IAAMJ,EAAI,IAAIC,IAAMF,EAAI,GAC7DX,EAAI,IAAKe,IAAMN,EAAI,IAAIK,IAAMJ,EAAI,IAAIM,IAAMJ,EAAI,IAAIC,IAAMF,EAAI,GACtDX;AACT;ACnMe,SAAAiB,GAAUC,GAAKC,GAAQxC,GAAO;AAC3C,MAAIyC,IAAMzC,EAAM,GACd0C,IAAM1C,EAAM,GACZ2C,IAAM3C,EAAM,KAAK,GACf5S,GAAGmU,GAAG1U,GAENoF,IAAM,CAAA;AACV,OAAKpF,IAAI,GAAGA,IAAI,GAAGA;AACjB,QAAI,EAAA2V,KAAU3V,MAAM,KAAKmT,EAAM,MAAM;AAqBrC,cAlBInT,MAAM,KACRO,IAAIqV,GACA,KAAK,QAAQF,EAAI,KAAK1V,CAAC,CAAC,MAAM,KAChC0U,IAAI,MAEJA,IAAI,OAEG1U,MAAM,KACfO,IAAIsV,GACA,KAAK,QAAQH,EAAI,KAAK1V,CAAC,CAAC,MAAM,KAChC0U,IAAI,MAEJA,IAAI,QAGNnU,IAAIuV,GACJpB,IAAI,MAEEgB,EAAI,KAAK1V,CAAC,GAAC;AAAA,QACjB,KAAK;AACH,UAAAoF,EAAIsP,CAAC,IAAInU;AACT;AAAA,QACF,KAAK;AACH,UAAA6E,EAAIsP,CAAC,IAAI,CAACnU;AACV;AAAA,QACF,KAAK;AACH,UAAA6E,EAAIsP,CAAC,IAAInU;AACT;AAAA,QACF,KAAK;AACH,UAAA6E,EAAIsP,CAAC,IAAI,CAACnU;AACV;AAAA,QACF,KAAK;AACH,UAAI4S,EAAMuB,CAAC,MAAM,WACftP,EAAI,IAAI7E;AAEV;AAAA,QACF,KAAK;AACH,UAAI4S,EAAMuB,CAAC,MAAM,WACftP,EAAI,IAAI,CAAC7E;AAEX;AAAA,QACF;AAEE,iBAAO;AAAA,MACf;AAEE,SAAO6E;AACT;ACtDe,SAAA2Q,GAAUC,GAAO;AAC9B,MAAI5Q,IAAM;AAAA,IACR,GAAG4Q,EAAM,CAAC;AAAA,IACV,GAAGA,EAAM,CAAC;AAAA,EACd;AACE,SAAIA,EAAM,SAAS,MACjB5Q,EAAI,IAAI4Q,EAAM,CAAC,IAEbA,EAAM,SAAS,MACjB5Q,EAAI,IAAI4Q,EAAM,CAAC,IAEV5Q;AACT;AChBe,SAAA6Q,GAAU9C,GAAO;AAC9B,EAAA+C,GAAW/C,EAAM,CAAC,GAClB+C,GAAW/C,EAAM,CAAC;AACpB;AACA,SAAS+C,GAAWC,GAAK;AACvB,MAAI,OAAO,OAAO,YAAa,YAAY;AACzC,QAAI,OAAO,SAASA,CAAG;AACrB;AAEF,UAAM,IAAI,UAAU,oCAAoC;AAAA,EAC5D;AACE,MAAI,OAAOA,KAAQ,YAAYA,MAAQA,KAAO,CAAC,SAASA,CAAG;AACzD,UAAM,IAAI,UAAU,oCAAoC;AAE5D;ACPA,SAASC,GAAY/N,GAAQkI,GAAM;AACjC,UACGlI,EAAO,MAAM,eAAehK,MAAcgK,EAAO,MAAM,eAAe/J,MAAc+J,EAAO,MAAM,eAAe9J,OAAkBgS,EAAK,cAAc,YACnJA,EAAK,MAAM,eAAelS,MAAckS,EAAK,MAAM,eAAejS,MAAciS,EAAK,MAAM,eAAehS,OAAkB8J,EAAO,cAAc;AACxJ;AASe,SAASgO,GAAUhO,GAAQkI,GAAM4C,GAAOmD,GAAa;AAClE,MAAIC;AACJ,EAAI,MAAM,QAAQpD,CAAK,IACrBA,IAAQqD,GAAQrD,CAAK,IAGrBA,IAAQ;AAAA,IACN,GAAGA,EAAM;AAAA,IACT,GAAGA,EAAM;AAAA,IACT,GAAGA,EAAM;AAAA,IACT,GAAGA,EAAM;AAAA,EACf;AAEE,MAAIsD,IAAOtD,EAAM,MAAM;AAavB,MAZA8C,GAAY9C,CAAK,GAEb9K,EAAO,SAASkI,EAAK,SAAS6F,GAAY/N,GAAQkI,CAAI,MACxDgG,IAAQ,IAAIlM,GAAK,OAAO,GACxB8I,IAAQkD,GAAUhO,GAAQkO,GAAOpD,GAAOmD,CAAW,GACnDjO,IAASkO,IAGPD,KAAejO,EAAO,SAAS,UACjC8K,IAAQsC,GAAYpN,GAAQ,IAAO8K,CAAK,IAGtC9K,EAAO,aAAa;AACtB,IAAA8K,IAAQ;AAAA,MACN,GAAGA,EAAM,IAAIhU;AAAAA,MACb,GAAGgU,EAAM,IAAIhU;AAAAA,MACb,GAAGgU,EAAM,KAAK;AAAA,IACpB;AAAA,WAEQ9K,EAAO,aACT8K,IAAQ;AAAA,IACN,GAAGA,EAAM,IAAI9K,EAAO;AAAA,IACpB,GAAG8K,EAAM,IAAI9K,EAAO;AAAA,IACpB,GAAG8K,EAAM,KAAK;AAAA,EACtB,IAEIA,IAAQ9K,EAAO,QAAQ8K,CAAK,GACxB,CAACA;AACH;AAUJ,MANI9K,EAAO,mBACT8K,EAAM,KAAK9K,EAAO,iBAIpB8K,IAAQD,GAAgB7K,EAAO,OAAOkI,EAAK,OAAO4C,CAAK,GACnD,EAACA;AAkCL,WA9BAA;AAAA,IAA8DA,GAG1D5C,EAAK,mBACP4C,IAAQ;AAAA,MACN,GAAGA,EAAM,IAAI5C,EAAK;AAAA,MAClB,GAAG4C,EAAM;AAAA,MACT,GAAGA,EAAM,KAAK;AAAA,IACpB,IAGM5C,EAAK,aAAa,YAEpB4C,IAAQ;AAAA,MACN,GAAGA,EAAM,IAAI/T;AAAA,MACb,GAAG+T,EAAM,IAAI/T;AAAA,MACb,GAAG+T,EAAM,KAAK;AAAA,IACpB,KAEIA,IAAQ5C,EAAK,QAAQ4C,CAAK,GACtB5C,EAAK,aACP4C,IAAQ;AAAA,MACN,GAAGA,EAAM,IAAI5C,EAAK;AAAA,MAClB,GAAG4C,EAAM,IAAI5C,EAAK;AAAA,MAClB,GAAG4C,EAAM,KAAK;AAAA,IACtB,KAKMmD,KAAe/F,EAAK,SAAS,QACxBkF,GAAYlF,GAAM,IAAM4C,CAAK,KAGlCA,KAAS,CAACsD,KACZ,OAAOtD,EAAM,GAERA;AACT;AChHA,IAAIoD,KAAQlM,GAAK,OAAO;AAiFxB,SAASqM,GAAYC,GAAMC,GAAIC,GAAQP,GAAa;AAClD,MAAIQ,GAAkB1R,GAAKtF;AAC3B,SAAI,MAAM,QAAQ+W,CAAM,KACtBC,IAAmBT,GAAUM,GAAMC,GAAIC,GAAQP,CAAW,KAAK,EAAE,GAAG,KAAK,GAAG,IAAG,GAC3EO,EAAO,SAAS,IACb,OAAOF,EAAK,OAAS,OAAeA,EAAK,SAAS,aAAe,OAAOC,EAAG,OAAS,OAAeA,EAAG,SAAS,YAC9G,OAAOE,EAAiB,KAAM;AAAA;AAAA,IACP,CAACA,EAAiB,GAAGA,EAAiB,GAAGA,EAAiB,CAAC,EAAE,OAAOD,EAAO,MAAM,CAAC,CAAC;AAAA;AAAA;AAAA,IAEnF,CAACC,EAAiB,GAAGA,EAAiB,GAAGD,EAAO,CAAC,CAAC,EAAE,OAAOA,EAAO,MAAM,CAAC,CAAC;AAAA;AAAA;AAAA,IAG5E,CAACC,EAAiB,GAAGA,EAAiB,CAAC,EAAE,OAAOD,EAAO,MAAM,CAAC,CAAC;AAAA;AAAA;AAAA,IAGjE,CAACC,EAAiB,GAAGA,EAAiB,CAAC;AAAA,QAGlE1R,IAAMiR,GAAUM,GAAMC,GAAIC,GAAQP,CAAW,GAC7CxW,IAAO,OAAO,KAAK+W,CAAM,GACrB/W,EAAK,WAAW,KAGpBA,EAAK,QAAQ,SAAUD,GAAK;AAC1B,QAAK,OAAO8W,EAAK,OAAS,OAAeA,EAAK,SAAS,aAAe,OAAOC,EAAG,OAAS,OAAeA,EAAG,SAAS;AAClH,UAAI/W,MAAQ,OAAOA,MAAQ,OAAOA,MAAQ;AACxC;AAAA,eAGEA,MAAQ,OAAOA,MAAQ;AACzB;AAGJ,IAAAuF,EAAIvF,CAAG,IAAIgX,EAAOhX,CAAG;AAAA,EAC3B,CAAK;AAAA,EACwBuF;AAE7B;AAMA,SAAS2R,GAAUzR,GAAM;AACvB,SAAIA,aAAgB+E,KACX/E,IAEL,OAAOA,KAAS,YAAY,WAAWA,IAClCA,EAAK,QAEP+E;AAAAA;AAAAA,IAAiD/E;AAAA,EAAI;AAC9D;AAmCA,SAAS0R,GAAMC,GAAkBC,GAAeC,GAAO;AAErD,MAAIC,GAEAC,GACAC,IAAS,IAET1X;AAiBJ,SAhBI,OAAOsX,IAAkB,OAC3BG,IAASN,GAAUE,CAAgB,GACnCG,IAAWb,IACXe,IAAS,OACA;AAAA,EAAyBJ,EAAe,IAAM,OAAe,MAAM,QAAQA,CAAa,OACjGC;AAAA;AAAA,EAA4CD,GAC5CG,IAASN,GAAUE,CAAgB,GACnCG,IAAWb,IACXe,IAAS,KAENF,MACHA,IAAWL,GAAUE,CAAgB,IAElCI,MACHA,IAASN;AAAA;AAAA,IAA8DG;AAAA,EAAa,IAElFC,IACKT,GAAYU,GAAUC,GAAQF,CAAK,KAE1CvX,IAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOJ,SAAS,SAAUiX,GAAQP,GAAa;AACtC,aAAOI,GAAYU,GAAUC,GAAQR,GAAQP,CAAW;AAAA,IAChE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOM,SAAS,SAAUO,GAAQP,GAAa;AACtC,aAAOI,GAAYW,GAAQD,GAAUP,GAAQP,CAAW;AAAA,IAChE;AAAA,EACA,GACQgB,MACF1X,EAAI,QAAQyX,IAEPzX;AAEX;ACpNA,IAAI2X,KAAgB,GAQhBC,KAA4B,UAQ5BC,KAAyB,UAEzBC,KAAI,IACJC,KAAI,IACJC,KAAI,IACJC,KAAI,IACJ1F,KAAI;AACR,MAAA2F,KAAe;AAAA,EACb,SAAStO;AAAAA,EACT,SAASI;AAAAA,EACT,SAAS4M;AACX;AAUO,SAAShN,GAAQuO,GAAIC,GAAU;AACpC,SAAAA,IAAWA,KAAY,GAChBC,GAAOC,GAAQ;AAAA,IACpB,KAAKH,EAAG,CAAC;AAAA,IACT,KAAKA,EAAG,CAAC;AAAA,EACb,CAAG,GAAGC,CAAQ;AACd;AAUO,SAASpO,GAAQkO,GAAM;AAC5B,MAAItU,IAAO2U,GAAQC,GAAON,EAAK,YAAW,CAAE,CAAC;AAC7C,SAAItU,EAAK,OAAOA,EAAK,MACZ,CAACA,EAAK,KAAKA,EAAK,KAAKA,EAAK,KAAKA,EAAK,GAAG,IAEzC,CAACA,EAAK,MAAMA,EAAK,QAAQA,EAAK,OAAOA,EAAK,GAAG;AACtD;AAEO,SAASgT,GAAQsB,GAAM;AAC5B,MAAItU,IAAO2U,GAAQC,GAAON,EAAK,YAAW,CAAE,CAAC;AAC7C,SAAItU,EAAK,OAAOA,EAAK,MACZ,CAACA,EAAK,KAAKA,EAAK,GAAG,IAErB,EAAEA,EAAK,OAAOA,EAAK,SAAS,IAAIA,EAAK,MAAMA,EAAK,UAAU,CAAC;AACpE;AAQA,SAAS6U,GAASC,GAAK;AACrB,SAAQA,KAAO,KAAK,KAAK;AAC3B;AASA,SAASC,GAASC,GAAK;AACrB,SAAQ,OAASA,IAAM,KAAK;AAC9B;AAaA,SAASN,GAAQH,GAAI;AACnB,MAAIU,IAAMV,EAAG,KACTW,IAAOX,EAAG,KACVvX,IAAI,SACJmY,IAAa,WACbC,IAAK,QACLC,GACAC,GACAC,GAAGC,GAAGC,GAAGvB,GAAGwB,GACZC,IAASd,GAASI,CAAG,GACrBW,IAAUf,GAASK,CAAI,GACvBW,GACAC;AAEJ,EAAAA,IAAa,KAAK,OAAOZ,IAAO,OAAO,CAAC,IAAI,GAGxCA,MAAS,QACXY,IAAa,KAIXb,KAAO,MAAQA,IAAM,MAAQC,KAAQ,KAAOA,IAAO,OACrDY,IAAa,KAIXb,KAAO,MAAQA,IAAM,OACnBC,KAAQ,KAAOA,IAAO,IACxBY,IAAa,KAENZ,KAAQ,KAAOA,IAAO,KAC7BY,IAAa,KAENZ,KAAQ,MAAQA,IAAO,KAC9BY,IAAa,KAENZ,KAAQ,MAAQA,IAAO,OAC9BY,IAAa,MAIjBT,KAAcS,IAAa,KAAK,IAAI,MAAM,GAG1CD,IAAgBhB,GAASQ,CAAU,GAEnCC,IAAmBH,KAAe,IAAIA,IAEtCI,IAAIvY,IAAI,KAAK,KAAK,IAAImY,IAAa,KAAK,IAAIQ,CAAM,IAAI,KAAK,IAAIA,CAAM,CAAC,GACtEH,IAAI,KAAK,IAAIG,CAAM,IAAI,KAAK,IAAIA,CAAM,GACtCF,IAAIH,IAAkB,KAAK,IAAIK,CAAM,IAAI,KAAK,IAAIA,CAAM,GACxDzB,IAAI,KAAK,IAAIyB,CAAM,KAAKC,IAAUC,IAElCH,IAAI1Y,MAAM,IAAImY,IAAa,IAAI,IAAIA,IAAaA,IAAa,KAAK,IAAIA,IAAaA,IAAaA,IAAa,OAAOQ,KAAU,IAAIR,IAAa,IAAI,IAAIA,IAAaA,IAAa,KAAK,KAAKA,IAAaA,IAAaA,IAAa,QAAQ,KAAK,IAAI,IAAIQ,CAAM,KAAK,KAAKR,IAAaA,IAAa,MAAM,KAAKA,IAAaA,IAAaA,IAAa,QAAQ,KAAK,IAAI,IAAIQ,CAAM,IAAK,KAAKR,IAAaA,IAAaA,IAAa,OAAQ,KAAK,IAAI,IAAIQ,CAAM;AAE1b,MAAII,IAAcX,IAAKG,KAAKrB,KAAK,IAAIsB,IAAIC,KAAKvB,IAAIA,IAAIA,IAAI,KAAO,IAAI,KAAKsB,IAAIA,IAAIA,IAAI,KAAKC,IAAI,KAAKH,KAAmBpB,IAAIA,IAAIA,IAAIA,IAAIA,IAAI,OAAS,KAEhJ8B,IAAeZ,KAAMM,IAAIH,IAAI,KAAK,IAAII,CAAM,KAAKzB,IAAIA,IAAI,KAAK,IAAIsB,IAAI,IAAIC,IAAI,IAAIA,IAAIA,KAAKvB,IAAIA,IAAIA,IAAIA,IAAI,MAAQ,KAAK,KAAKsB,IAAIA,IAAIA,IAAI,MAAMC,IAAI,MAAMH,KAAmBpB,IAAIA,IAAIA,IAAIA,IAAIA,IAAIA,IAAI;AACxM,SAAIe,IAAM,MACRe,KAAe,MAIV;AAAA,IACL,UAAU,KAAK,MAAMA,CAAW;AAAA,IAChC,SAAS,KAAK,MAAMD,CAAU;AAAA,IAC9B,YAAYD;AAAA,IACZ,YAAYG,GAAoBhB,CAAG;AAAA,EACvC;AACA;AAiBA,SAASN,GAAQuB,GAAK;AAEpB,MAAIF,IAAcE,EAAI,UAClBH,IAAaG,EAAI,SACjBC,IAAaD,EAAI,YACjBE,IAAaF,EAAI;AAErB,MAAIE,IAAa,KAAKA,IAAa;AACjC,WAAO;AAGT,MAAIhB,IAAK,QACLpY,IAAI,SACJmY,IAAa,WACbG,GACAe,KAAM,IAAI,KAAK,KAAK,IAAIlB,CAAU,MAAM,IAAI,KAAK,KAAK,IAAIA,CAAU,IACpEmB,GAAIC,GAAIC,GAAIC,GAAIC,GAAGhB,GACnBL,GACAsB,GAAIC,GAGJvR,IAAI0Q,IAAa,KACjB5P,IAAI6P;AAMR,EAAIG,IAAa,QACfhQ,KAAK,MAKPkP,KAAce,IAAa,KAAK,IAAI,MAAM,GAI1Cd,IAAmBH,KAAe,IAAIA,IAEtCO,IAAIvP,IAAIiP,GACRuB,IAAKjB,KAAK1Y,KAAK,IAAImY,IAAa,IAAI,IAAIA,IAAaA,IAAa,KAAK,IAAIA,IAAaA,IAAaA,IAAa,OAElHyB,IAAUD,KAAM,IAAIN,IAAK,IAAI,KAAKA,IAAKA,IAAKA,IAAK,MAAM,KAAK,IAAI,IAAIM,CAAE,KAAK,KAAKN,IAAKA,IAAK,KAAK,KAAKA,IAAKA,IAAKA,IAAKA,IAAK,MAAM,KAAK,IAAI,IAAIM,CAAE,IAAK,MAAMN,IAAKA,IAAKA,IAAK,KAAM,KAAK,IAAI,IAAIM,CAAE,GAG5LL,IAAKtZ,IAAI,KAAK,KAAK,IAAImY,IAAa,KAAK,IAAIyB,CAAO,IAAI,KAAK,IAAIA,CAAO,CAAC,GACzEL,IAAK,KAAK,IAAIK,CAAO,IAAI,KAAK,IAAIA,CAAO,GACzCJ,IAAKlB,IAAkB,KAAK,IAAIsB,CAAO,IAAI,KAAK,IAAIA,CAAO,GAC3DH,IAAKzZ,KAAK,IAAImY,KAAc,KAAK,IAAI,IAAIA,IAAa,KAAK,IAAIyB,CAAO,IAAI,KAAK,IAAIA,CAAO,GAAG,GAAG,GAChGF,IAAIrR,KAAKiR,IAAKlB;AAEd,MAAIlP,IAAM0Q,IAAWN,IAAK,KAAK,IAAIM,CAAO,IAAIH,KAAOC,IAAIA,IAAI,KAAK,IAAI,IAAIH,IAAK,KAAKC,IAAK,IAAIA,IAAKA,IAAK,IAAIlB,KAAmBoB,IAAIA,IAAIA,IAAIA,IAAI,MAAM,KAAK,KAAKH,IAAK,MAAMC,IAAK,KAAKD,IAAKA,IAAK,MAAMjB,IAAkB,IAAIkB,IAAKA,KAAME,IAAIA,IAAIA,IAAIA,IAAIA,IAAIA,IAAI;AAC5P,EAAAxQ,IAAM6O,GAAS7O,CAAG;AAElB,MAAID,KAAOyQ,KAAK,IAAI,IAAIH,IAAKC,KAAME,IAAIA,IAAIA,IAAI,KAAK,IAAI,IAAIF,IAAK,KAAKD,IAAK,IAAIC,IAAKA,IAAK,IAAIlB,IAAkB,KAAKiB,IAAKA,KAAMG,IAAIA,IAAIA,IAAIA,IAAIA,IAAI,OAAO,KAAK,IAAIE,CAAO;AAC1K,EAAA3Q,IAAMoP,IAAaN,GAAS9O,CAAG;AAE/B,MAAItH;AACJ,MAAIuX,EAAI,UAAU;AAChB,QAAIW,IAAWlC,GAAQ;AAAA,MACrB,UAAUuB,EAAI,WAAWA,EAAI;AAAA,MAC7B,SAASA,EAAI,UAAUA,EAAI;AAAA,MAC3B,YAAYA,EAAI;AAAA,MAChB,YAAYA,EAAI;AAAA,IACtB,CAAK;AACD,IAAAvX,IAAS;AAAA,MACP,KAAKkY,EAAS;AAAA,MACd,OAAOA,EAAS;AAAA,MAChB,QAAQ3Q;AAAA,MACR,MAAMD;AAAA,IACZ;AAAA,EACA;AAEI,IAAAtH,IAAS;AAAA,MACP,KAAKuH;AAAA,MACL,KAAKD;AAAA,IACX;AAEE,SAAOtH;AACT;AAUA,SAASsX,GAAoB/P,GAAK;AAGhC,MAAI4Q,IAAmB;AAEvB,SAAK,MAAM5Q,KAASA,KAAO,KACzB4Q,IAAmB,MAEX,KAAK5Q,KAASA,KAAO,KAC7B4Q,IAAmB,MAEX,KAAK5Q,KAASA,KAAO,KAC7B4Q,IAAmB,MAEX,KAAK5Q,KAASA,KAAO,KAC7B4Q,IAAmB,MAEX,KAAK5Q,KAASA,KAAO,KAC7B4Q,IAAmB,MAEX,KAAK5Q,KAASA,KAAO,KAC7B4Q,IAAmB,MAEX,KAAK5Q,KAASA,KAAO,KAC7B4Q,IAAmB,MAEX,KAAK5Q,KAASA,KAAO,KAC7B4Q,IAAmB,MAEX,KAAK5Q,KAASA,KAAO,IAC7B4Q,IAAmB,MAEX,IAAI5Q,KAASA,KAAO,IAC5B4Q,IAAmB,MAEX,IAAI5Q,KAASA,KAAO,KAC5B4Q,IAAmB,MAEX,KAAK5Q,KAASA,KAAO,MAC7B4Q,IAAmB,MAEX,MAAM5Q,KAASA,KAAO,MAC9B4Q,IAAmB,MAEX,MAAM5Q,KAASA,KAAO,MAC9B4Q,IAAmB,MAEX,MAAM5Q,KAASA,KAAO,MAC9B4Q,IAAmB,MAEX,MAAM5Q,KAASA,KAAO,MAC9B4Q,IAAmB,MAEX,MAAM5Q,KAASA,KAAO,MAC9B4Q,IAAmB,MAEX,MAAM5Q,KAASA,KAAO,MAC9B4Q,IAAmB,MAEX,MAAM5Q,KAASA,KAAO,MAC9B4Q,IAAmB,MAEX,MAAM5Q,KAASA,KAAO,QAC9B4Q,IAAmB,MAEdA;AACT;AAWA,SAASrC,GAAOyB,GAAK1B,GAAU;AAE7B,MAAIuC,IAAW,UAAUb,EAAI,SAC3Bc,IAAY,UAAUd,EAAI;AAE5B,SAAOA,EAAI,aAAaA,EAAI,aAAae,GAAUf,EAAI,SAASA,EAAI,UAAUA,EAAI,UAAU,IAAIa,EAAS,OAAOA,EAAS,SAAS,GAAGvC,CAAQ,IAAIwC,EAAU,OAAOA,EAAU,SAAS,GAAGxC,CAAQ;AAClM;AAYA,SAASyC,GAAUC,GAASC,GAAUf,GAAY;AAChD,MAAIgB,IAAUC,GAAkBjB,CAAU,GACtCkB,IAAY,KAAK,MAAMJ,IAAU,GAAM,GACvCK,IAAS,KAAK,MAAMJ,IAAW,GAAM,IAAI;AAC7C,SAAOK,GAAgBF,GAAWC,GAAQH,CAAO;AACnD;AASA,SAASC,GAAkB7a,GAAG;AAC5B,MAAI4a,IAAU5a,IAAIuX;AAClB,SAAIqD,MAAY,MACdA,IAAUrD,KAGLqD;AACT;AAkBA,SAASI,GAAgBC,GAAQC,GAAKC,GAAM;AAE1C,MAAIvN,IAAQuN,IAAO,GACfC,IAAY5D,GAA0B,WAAW5J,CAAK,GACtDyN,IAAY5D,GAAuB,WAAW7J,CAAK,GAGnD0N,IAASF,IAAYH,IAAS,GAC9BM,IAASF,IAAYH,GACrBM,IAAW;AAEf,EAAIF,IAASnJ,OACXmJ,IAASA,IAASnJ,KAAIuF,KAAI,GAC1B8D,IAAW,MAGTF,MAAW3D,MAAMyD,IAAYzD,MAAK2D,IAAS3D,OAAQ2D,IAAS3D,MAAKyD,IAAYzD,OAAM6D,MACrFF,MAGEA,MAAW1D,MAAMwD,IAAYxD,MAAK0D,IAAS1D,OAAQ0D,IAAS1D,MAAKwD,IAAYxD,OAAM4D,OACrFF,KAEIA,MAAW3D,MACb2D,MAIAA,IAASnJ,OACXmJ,IAASA,IAASnJ,KAAIuF,KAAI,IAGxB6D,IAAS1D,MACX0D,IAASA,IAAS1D,KAAIH,KAAI,GAC1B8D,IAAW,MAGXA,IAAW,KAGPD,MAAW5D,MAAQ0D,IAAY1D,MAAO4D,IAAS5D,OAAW4D,IAAS5D,MAAO0D,IAAY1D,OAAO6D,MACjGD,MAGIA,MAAW3D,MAAQyD,IAAYzD,MAAO2D,IAAS3D,OAAW2D,IAAS3D,MAAOyD,IAAYzD,OAAO4D,OACjGD,KAEIA,MAAW5D,MACb4D,MAIAA,IAAS1D,OACX0D,IAASA,IAAS1D,KAAIH,KAAI;AAG5B,MAAI+D,IAAY,OAAO,aAAaH,CAAM,IAAI,OAAO,aAAaC,CAAM;AACxE,SAAOE;AACT;AAUA,SAASrD,GAAOsD,GAAY;AAE1B,MAAIA,KAAcA,EAAW,WAAW;AACtC,UAAO;AAWT,WARIC,IAASD,EAAW,QAEpBE,IAAO,MACPC,IAAK,IACLC,GACA9b,IAAI,GAGD,CAAE,QAAS,KAAK8b,IAAWJ,EAAW,OAAO1b,CAAC,CAAC,KAAG;AACvD,QAAIA,KAAK;AACP,YAAO,oCAAoC0b;AAE7C,IAAAG,KAAMC,GACN9b;AAAA,EACJ;AAEE,MAAI4Z,IAAa,SAASiC,GAAI,EAAE;AAEhC,MAAI7b,MAAM,KAAKA,IAAI,IAAI2b;AAGrB,UAAO,oCAAoCD;AAG7C,MAAI/B,IAAa+B,EAAW,OAAO1b,GAAG;AAGtC,MAAI2Z,KAAc,OAAOA,MAAe,OAAOA,MAAe,OAAOA,KAAc,OAAOA,MAAe,OAAOA,MAAe;AAC7H,UAAO,2BAA2BA,IAAa,mBAAmB+B;AAGpE,EAAAE,IAAOF,EAAW,UAAU1b,GAAGA,KAAK,CAAC;AAWrC,WATI+b,IAAMlB,GAAkBjB,CAAU,GAElCoC,IAAWC,GAAmBL,EAAK,OAAO,CAAC,GAAGG,CAAG,GACjDG,IAAYC,GAAoBP,EAAK,OAAO,CAAC,GAAGG,CAAG,GAMhDG,IAAYE,GAAezC,CAAU;AAC1C,IAAAuC,KAAa;AAIf,MAAIG,IAAYV,IAAS3b;AAEzB,MAAIqc,IAAY,MAAM;AACpB,UAAO;AAAA;AAAA;AAAA,mBAAsKX;AAG/K,MAAIY,IAAMD,IAAY,GAElBE,IAAa,GACbC,IAAc,GACdC,GAAeC,GAAkBC,GAAmBjC,GAASC;AACjE,SAAI2B,IAAM,MACRG,IAAgB,MAAW,KAAK,IAAI,IAAIH,CAAG,GAC3CI,IAAmBhB,EAAW,UAAU1b,GAAGA,IAAIsc,CAAG,GAClDC,IAAa,WAAWG,CAAgB,IAAID,GAC5CE,IAAoBjB,EAAW,UAAU1b,IAAIsc,CAAG,GAChDE,IAAc,WAAWG,CAAiB,IAAIF,IAGhD/B,IAAU6B,IAAaP,GACvBrB,IAAW6B,IAAcN,GAElB;AAAA,IACL,SAASxB;AAAA,IACT,UAAUC;AAAA,IACV,YAAYhB;AAAA,IACZ,YAAYC;AAAA,IACZ,UAAU6C;AAAA,EACd;AACA;AAYA,SAASR,GAAmB5Q,GAAG0Q,GAAK;AAOlC,WAJIa,IAASpF,GAA0B,WAAWuE,IAAM,CAAC,GACrDc,IAAe,KACfC,IAAe,IAEZF,MAAWvR,EAAE,WAAW,CAAC,KAAG;AAQjC,QAPAuR,KACIA,MAAWjF,MACbiF,KAEEA,MAAWhF,MACbgF,KAEEA,IAASzK,IAAG;AACd,UAAI2K;AACF,cAAO,oBAAoBzR;AAE7B,MAAAuR,IAASlF,IACToF,IAAe;AAAA,IACrB;AACI,IAAAD,KAAgB;AAAA,EACpB;AAEE,SAAOA;AACT;AAkBA,SAASV,GAAoB5R,GAAGwR,GAAK;AAEnC,MAAIxR,IAAI;AACN,UAAO,sCAAsCA;AAS/C,WAJIwS,IAAStF,GAAuB,WAAWsE,IAAM,CAAC,GAClDiB,IAAgB,GAChBF,IAAe,IAEZC,MAAWxS,EAAE,WAAW,CAAC,KAAG;AAUjC,QATAwS,KACIA,MAAWpF,MACboF,KAEEA,MAAWnF,MACbmF,KAIEA,IAASlF,IAAG;AACd,UAAIiF;AACF,cAAO,oBAAoBvS;AAE7B,MAAAwS,IAASrF,IACToF,IAAe;AAAA,IACrB;AACI,IAAAE,KAAiB;AAAA,EACrB;AAEE,SAAOA;AACT;AAYA,SAASZ,GAAezC,GAAY;AAClC,MAAIgB;AACJ,UAAQhB,GAAU;AAAA,IAClB,KAAK;AACH,MAAAgB,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF,KAAK;AACH,MAAAA,IAAW;AACX;AAAA,IACF;AACE,MAAAA,IAAW;AAAA,EACf;AACE,MAAIA,KAAY;AACd,WAAOA;AAGP,QAAO,0BAA0BhB;AAGrC;ACjuBA,SAASsD,GAAMpU,GAAGc,GAAGuT,GAAG;AACtB,MAAI,EAAE,gBAAgBD;AACpB,WAAO,IAAIA,GAAMpU,GAAGc,GAAGuT,CAAC;AAE1B,MAAI,MAAM,QAAQrU,CAAC;AACjB,SAAK,IAAIA,EAAE,CAAC,GACZ,KAAK,IAAIA,EAAE,CAAC,GACZ,KAAK,IAAIA,EAAE,CAAC,KAAK;AAAA,WACR,OAAOA,KAAM;AACtB,SAAK,IAAIA,EAAE,GACX,KAAK,IAAIA,EAAE,GACX,KAAK,IAAIA,EAAE,KAAK;AAAA,WACP,OAAOA,KAAM,YAAY,OAAOc,IAAM,KAAa;AAC5D,QAAIkN,IAAShO,EAAE,MAAM,GAAG;AACxB,SAAK,IAAI,WAAWgO,EAAO,CAAC,CAAC,GAC7B,KAAK,IAAI,WAAWA,EAAO,CAAC,CAAC,GAC7B,KAAK,IAAI,WAAWA,EAAO,CAAC,CAAC,KAAK;AAAA,EACtC;AACI,SAAK,IAAIhO,GACT,KAAK,IAAIc,GACT,KAAK,IAAIuT,KAAK;AAEhB,UAAQ,KAAK,6DAA6D;AAC5E;AAEAD,GAAM,WAAW,SAAUE,GAAS;AAClC,SAAO,IAAIF,GAAMzG,GAAQ2G,CAAO,CAAC;AACnC;AACAF,GAAM,UAAU,SAAS,SAAUjF,GAAU;AAC3C,SAAOxO,GAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,GAAGwO,CAAQ;AAC3C;ACtCA,IAAIoF,KAAM,GACNC,KAAM,MACNC,KAAM,UACNC,KAAM,YACNC,KAAM,kBACNC,KAAM,MACNC,KAAM,SACNC,KAAM,sBACNC,KAAM,sBACNC,KAAM,oBACNC,KAAM,sBACNC,KAAM;AAEK,SAAAC,GAAU5S,GAAI;AAC3B,MAAI6S,IAAK,CAAA;AACT,EAAAA,EAAG,CAAC,IAAIb,KAAMhS,KAAMiS,KAAMjS,KAAMkS,KAAMlS,KAAMmS,KAAMnS,IAAKoS,OACvDS,EAAG,CAAC,IAAI7S,KAAMqS,KAAMrS,KAAMkS,KAAMlS,KAAMmS,KAAMnS,IAAKoS;AACjD,MAAI9I,IAAItJ,IAAKA;AACb,SAAA6S,EAAG,CAAC,IAAIvJ,KAAKgJ,KAAMtS,KAAMuS,KAAMvS,IAAKwS,MACpClJ,KAAKtJ,GACL6S,EAAG,CAAC,IAAIvJ,KAAKmJ,KAAMzS,IAAK0S,KACxBG,EAAG,CAAC,IAAIvJ,IAAItJ,IAAK2S,IACVE;AACT;ACvBe,SAAAC,GAAUjV,GAAKkV,GAAMC,GAAMH,GAAI;AAC5C,SAAAG,KAAQD,GACRA,KAAQA,GACAF,EAAG,CAAC,IAAIhV,IAAMmV,KAAQH,EAAG,CAAC,IAAIE,KAAQF,EAAG,CAAC,IAAIE,KAAQF,EAAG,CAAC,IAAIE,IAAOF,EAAG,CAAC;AACnF;ACDA,IAAII,KAAW;AAEA,SAAAC,GAAUC,GAAKnT,GAAI6S,GAAI;AAGpC,WAFIO,IAAI,KAAK,IAAIpT,IACbnC,IAAMsV,GACDve,IAAIqe,IAAUre,GAAG,EAAEA,GAAG;AAC7B,QAAIye,IAAI,KAAK,IAAIxV,CAAG,GAChByL,IAAI,IAAItJ,IAAKqT,IAAIA;AAKrB,QAFA/J,KAAKwJ,GAAQjV,GAAKwV,GAAG,KAAK,IAAIxV,CAAG,GAAGgV,CAAE,IAAIM,MAAQ7J,IAAI,KAAK,KAAKA,CAAC,KAAK8J,GACtEvV,KAAOyL,GACH,KAAK,IAAIA,CAAC,IAAIxV;AAChB,aAAO+J;AAAA,EAEb;AAEE,SAAOA;AACT;ACFO,SAASM,KAAO;AACrB,OAAK,KAAK,KAAK,OAAO,SAAY,KAAK,KAAK,GAC5C,KAAK,KAAK,KAAK,OAAO,SAAY,KAAK,KAAK,GAC5C,KAAK,QAAQ,KAAK,UAAU,SAAY,KAAK,QAAQ,GACrD,KAAK,OAAO,KAAK,SAAS,SAAY,KAAK,OAAO,GAE9C,KAAK,OACP,KAAK,KAAKyU,GAAQ,KAAK,EAAE,GACzB,KAAK,MAAME,GAAQ,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,EAAE;AAEnF;AAMO,SAAS1U,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GAERie,IAAY5V,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GAClDd,GACAE,GAAGc,GACHgV,IAAU,KAAK,IAAIjV,CAAG,GACtBkV,IAAU,KAAK,IAAIlV,CAAG;AAE1B,MAAK,KAAK,IA0BH;AACL,QAAImV,IAAKD,IAAUF,GACfI,IAAM,KAAK,IAAID,GAAI,CAAC,GACpBE,IAAI,KAAK,MAAM,KAAK,IAAIH,GAAS,CAAC,GAClCI,IAAK,KAAK,IAAID,GAAG,CAAC,GAClBE,IAAK,KAAK,IAAIL,CAAO,IAAI1f,IAAQ,KAAK,IAAIwK,CAAG,IAAI,GACjDgL,IAAI,KAAK,IAAIuK,GAAI,CAAC,GAClB7V,IAAK,KAAK,IAAIsL,GAAG,CAAC;AACtB,IAAA/L,IAAM,IAAI,KAAK,KAAK,KAAK,IAAIgW,GAAS,CAAC,GACvCE,IAAKA,IAAK,KAAK,KAAKlW,CAAG;AACvB,QAAIuW,IAAKhB,GAAQxU,GAAKiV,GAASC,GAAS,KAAK,EAAE;AAE/C,IAAA/V,IAAI,KAAK,KAAK,KAAK,KAAKgW,KAAM,IAC1BC,IAAM,KAAK,IAAIpK,IAAIqK,IACjBD,IAAM,MAAM,IAAI,KAAKpK,IAAItL,IAAK,KAAK2V,IAAI,KAAKrK,IAAIqK,IAC9CD,IAAM,MAAM,KAAK,MAAM1V,IAAKA,IAAKsL,IAAI,MAAMA,SAC7C,KAAK,IAEX/K,IAAI,KAAK,KAAK,KAAK,MAAMuV,IAAK,KAAK,MAC/BP,IAAUD,IAAYG,IAAK,KAAK,IAC9BC,IAAM,MAAM,IAAIpK,IAAI,IAAIqK,IAAI,IAAIC,IAC9BF,IAAM,MAAM,KAAK1V,IAAK,KAAKsL,IAAI,MAAMqK,IAAI,MAAMrK,IAAIqK,IACjDD,IAAM,MAAM,OAAO,MAAM1V,IAAKA,IAAKsL,IAAI,OAAOA,UAChD,KAAK;AAAA,EACjB,OAlDgB;AACZ,QAAIxS,IAAI0c,IAAU,KAAK,IAAIF,CAAS;AAEpC,QAAK,KAAK,IAAI,KAAK,IAAIxc,CAAC,IAAI,CAAC,IAAKhD;AAChC,aAAQ;AAMR,QAJA2J,IAAI,MAAM,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,IAAI3G,MAAM,IAAIA,EAAE,IAAI,KAAK,IAChEyH,IAAIiV,IAAU,KAAK,IAAIF,CAAS,IAAI,KAAK,KAAK,IAAI,KAAK,IAAIxc,GAAG,CAAC,CAAC,GAChEA,IAAI,KAAK,IAAIyH,CAAC,GAEVzH,KAAK,GAAG;AACV,UAAKA,IAAI,IAAKhD;AACZ,eAAQ;AAER,MAAAyK,IAAI;AAAA,IAEd;AACQ,MAAAA,IAAI,KAAK,KAAKA,CAAC;AAGjB,IAAID,IAAM,MACRC,IAAI,CAACA,IAGPA,IAAI,KAAK,IAAI,KAAK,MAAMA,IAAI,KAAK,QAAQ,KAAK;AAAA,EAEpD;AA0BE,SAAAlJ,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GAEClJ;AACT;AAKO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIkI,GAAKM,GACLS,GAAKD,GACLZ,KAAKpI,EAAE,IAAI,KAAK,OAAO,IAAI,KAAK,IAChCkJ,KAAKlJ,EAAE,IAAI,KAAK,OAAO,IAAI,KAAK;AAEpC,MAAK,KAAK;AAqBR,QAHAkI,IAAM,KAAK,MAAMgB,IAAI,KAAK,IAC1BV,IAAMqV,GAAY3V,GAAK,KAAK,IAAI,KAAK,EAAE,GAEnC,KAAK,IAAIM,CAAG,IAAInK,GAAS;AAC3B,UAAI6f,IAAU,KAAK,IAAI1V,CAAG,GACtB2V,IAAU,KAAK,IAAI3V,CAAG,GACtBkW,IAAU,KAAK,IAAIP,CAAO,IAAI1f,IAAQ,KAAK,IAAI+J,CAAG,IAAI,GACtD8V,IAAI,KAAK,MAAM,KAAK,IAAIH,GAAS,CAAC,GAClCI,IAAK,KAAK,IAAID,GAAG,CAAC,GAClBrK,IAAI,KAAK,IAAIyK,GAAS,CAAC,GACvB/V,IAAK,KAAK,IAAIsL,GAAG,CAAC;AACtB,MAAA/L,IAAM,IAAI,KAAK,KAAK,KAAK,IAAIgW,GAAS,CAAC;AACvC,UAAIS,IAAIvW,IAAI,KAAK,KAAKF,CAAG,IAAI,KAAK,IAC9B0W,IAAK,KAAK,IAAID,GAAG,CAAC;AACtB,MAAAzW,IAAMA,IAAMwW,GAEZzV,IAAMT,IAAON,IAAM0W,KAAM,IAAI,KAAK,MAAO,OAAO,IAC5CA,IAAK,MAAM,IAAI,IAAI3K,IAAI,IAAIqK,IAAIrK,IAAIqK,IAAI,IAAIC,IACzCK,IAAK,MAAM,KAAK,KAAK3K,IAAI,MAAMqK,IAAIrK,IAAI,KAAKtL,IAAK,KAAK2V,IACpDM,IAAK,MAAM,OAAO,OAAO3K,IAAI,OAAOtL,IAAK,OAAOA,IAAKsL,OAE7DjL,IAAMX,EAAW,KAAK,QAASsW,KAAK,IAChCC,IAAK,KAAK,IAAI,IAAI3K,IAAIqK,IACpBM,IAAK,MAAM,IAAI,KAAK3K,IAAI,KAAKtL,IAAK,IAAI2V,IAAIrK,IAAI,IAAIqK,IAChDM,IAAK,MAAM,KAAK,MAAM3K,IAAI,OAAOtL,IAAK,MAAMA,IAAKsL,QAAQkK,GAAU,KAAK,IAAI;AAAA,IAC1F;AACM,MAAAlV,IAAM5K,IAAU8J,GAAKe,CAAC,GACtBF,IAAM;AAAA,OA7CI;AACZ,QAAI6V,IAAI,KAAK,IAAIzW,IAAI,KAAK,EAAE,GACxB0W,IAAI,OAAOD,IAAI,IAAIA,IACnBE,IAAO,KAAK,OAAO7V,IAAI,KAAK,IAC5B8V,IAAI,KAAK,IAAID,CAAI;AACrB,IAAA7W,IAAM,KAAK,MAAM,IAAI,KAAK,IAAI8W,GAAG,CAAC,MAAM,IAAI,KAAK,IAAIF,GAAG,CAAC,EAAE,GAC3D7V,IAAM,KAAK,KAAKf,CAAG,GAEfgB,IAAI,MACND,IAAM,CAACA,IAGJ6V,MAAM,KAAOE,MAAM,IACtBhW,IAAM,IAENA,IAAMX,EAAW,KAAK,MAAMyW,GAAGE,CAAC,IAAI,KAAK,OAAO,KAAK,IAAI;AAAA,EAE/D;AAgCE,SAAAhf,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GAECjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,4BAA4B,0BAA0B;AAC1E,MAAA6V,KAAe;AAAA,EACb,MAAMnW;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AC7Ke,SAAA8V,GAAU9W,GAAG;AAC1B,MAAImG,IAAI,KAAK,IAAInG,CAAC;AAClB,SAAAmG,KAAKA,IAAI,IAAIA,KAAK,GACXA;AACT;ACJe,SAAA4Q,GAAU/W,GAAGc,GAAG;AAC7B,EAAAd,IAAI,KAAK,IAAIA,CAAC,GACdc,IAAI,KAAK,IAAIA,CAAC;AACd,MAAInJ,IAAI,KAAK,IAAIqI,GAAGc,CAAC,GACjBzH,IAAI,KAAK,IAAI2G,GAAGc,CAAC,KAAKnJ,KAAQ;AAElC,SAAOA,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI0B,GAAG,CAAC,CAAC;AACzC;ACPe,SAAA2d,GAAUhX,GAAG;AAC1B,MAAIc,IAAI,IAAId,GACRqU,IAAIvT,IAAI;AAEZ,SAAOuT,MAAM,IAAIrU,IAAIA,IAAI,KAAK,IAAIc,CAAC,IAAIuT;AACzC;ACFe,SAAA4C,GAAUjX,GAAG;AAC1B,MAAIc,IAAI,KAAK,IAAId,CAAC;AAClB,SAAAc,IAAIkW,GAAOlW,KAAK,IAAIA,KAAKiW,GAAM,GAAGjW,CAAC,IAAI,GAAG,GAEnCd,IAAI,IAAI,CAACc,IAAIA;AACtB;ACRe,SAAAoW,GAAUC,GAAIC,GAAG;AAO9B,WANIC,IAAS,IAAI,KAAK,IAAI,IAAID,CAAC,GAC3BjgB,IAAIggB,EAAG,SAAS,GAChBG,IAAKH,EAAGhgB,CAAC,GACTogB,IAAK,GACLX,GAEG,EAAEzf,KAAK;AACZ,IAAAyf,IAAI,CAACW,IAAKF,IAASC,IAAKH,EAAGhgB,CAAC,GAC5BogB,IAAKD,GACLA,IAAKV;AAGP,SAAQQ,IAAIR,IAAI,KAAK,IAAI,IAAIQ,CAAC;AAChC;ACde,SAAAI,GAAUL,GAAIM,GAAO;AAOlC,WANItR,IAAI,IAAI,KAAK,IAAIsR,CAAK,GACtBtgB,IAAIggB,EAAG,SAAS,GAChBO,IAAMP,EAAGhgB,CAAC,GACVwgB,IAAM,GACNC,GAEG,EAAEzgB,KAAK;AACZ,IAAAygB,IAAK,CAACD,IAAMxR,IAAIuR,IAAMP,EAAGhgB,CAAC,GAC1BwgB,IAAMD,GACNA,IAAME;AAGR,SAAO,KAAK,IAAIH,CAAK,IAAIG;AAC3B;ACde,SAAAC,GAAU7X,GAAG;AAC1B,MAAImG,IAAI,KAAK,IAAInG,CAAC;AAClB,SAAAmG,KAAKA,IAAI,IAAIA,KAAK,GACXA;AACT;ACDe,SAAA2R,GAAUX,GAAIM,GAAOM,GAAO;AAezC,WAdIC,IAAY,KAAK,IAAIP,CAAK,GAC1BQ,IAAY,KAAK,IAAIR,CAAK,GAC1BS,IAAapB,GAAKiB,CAAK,GACvBI,IAAaN,GAAKE,CAAK,GACvB5R,IAAI,IAAI8R,IAAYE,GACpBhhB,IAAI,KAAK6gB,IAAYE,GACrBpT,IAAIqS,EAAG,SAAS,GAChBS,IAAKT,EAAGrS,CAAC,GACTsT,IAAM,GACNV,IAAM,GACNW,IAAK,GACLV,GACAW,GAEG,EAAExT,KAAK;AACZ,IAAA6S,IAAMD,GACNY,IAAMF,GACNV,IAAME,GACNQ,IAAMC,GACNT,IAAK,CAACD,IAAMxR,IAAIuR,IAAMvgB,IAAIihB,IAAMjB,EAAGrS,CAAC,GACpCuT,IAAK,CAACC,IAAMnhB,IAAIugB,IAAMvR,IAAIiS;AAG5B,SAAAjS,IAAI6R,IAAYG,GAChBhhB,IAAI8gB,IAAYC,GAET,CAAC/R,IAAIyR,IAAKzgB,IAAIkhB,GAAIlS,IAAIkS,IAAKlhB,IAAIygB,CAAE;AAC1C;ACPO,SAASlX,KAAO;AACrB,MAAI,CAAC,KAAK,WAAW,MAAM,KAAK,EAAE,KAAK,KAAK,MAAM;AAChD,UAAM,IAAI,MAAM,oIAAoI;AAEtJ,EAAI,KAAK,WAEPmW,GAAM,KAAK,MAAM,IAAI,GACrB,KAAK,UAAUA,GAAM,SACrB,KAAK,UAAUA,GAAM,UAGvB,KAAK,KAAK,KAAK,OAAO,SAAY,KAAK,KAAK,GAC5C,KAAK,KAAK,KAAK,OAAO,SAAY,KAAK,KAAK,GAC5C,KAAK,QAAQ,KAAK,UAAU,SAAY,KAAK,QAAQ,GACrD,KAAK,OAAO,KAAK,SAAS,SAAY,KAAK,OAAO,GAElD,KAAK,MAAM,CAAA,GACX,KAAK,MAAM,CAAA,GACX,KAAK,MAAM,CAAA,GACX,KAAK,MAAM,CAAA;AAEX,MAAIJ,IAAI,KAAK,MAAM,IAAI,KAAK,KAAK,IAAI,KAAK,EAAE,IACxC/U,IAAI+U,KAAK,IAAIA,IACb8B,IAAK7W;AAET,OAAK,IAAI,CAAC,IAAIA,KAAK,IAAIA,KAAK,KAAK,IAAIA,KAAK,KAAKA,KAAK,MAAM,KAAKA,KAAK,KAAK,KAAKA,KAAK,QAAQ,WAC3F,KAAK,IAAI,CAAC,IAAIA,KAAK,KAAKA,KAAK,IAAI,IAAIA,KAAK,IAAI,IAAIA,KAAK,MAAM,KAAKA,KAAK,KAAK,KAAKA,KAAK,OAAO,YAE7F6W,IAAKA,IAAK7W,GACV,KAAK,IAAI,CAAC,IAAI6W,KAAM,IAAI,IAAI7W,KAAK,KAAK,IAAIA,KAAK,OAAO,KAAKA,KAAK,OAAO,MAAMA,KAAK,OAAO,UACzF,KAAK,IAAI,CAAC,IAAI6W,KAAM,IAAI,IAAI7W,KAAK,MAAM,KAAKA,KAAK,MAAM,IAAIA,KAAK,MAAM,MAAMA,KAAK,QAAQ,UAEzF6W,IAAKA,IAAK7W,GACV,KAAK,IAAI,CAAC,IAAI6W,KAAM,KAAK,KAAK7W,KAAK,OAAO,KAAKA,KAAK,QAAQ,MAAMA,KAAK,QAAQ,UAC/E,KAAK,IAAI,CAAC,IAAI6W,KAAM,MAAM,KAAK7W,KAAK,KAAK,KAAKA,KAAK,IAAI,IAAIA,KAAK,SAAS,UAEzE6W,IAAKA,IAAK7W,GACV,KAAK,IAAI,CAAC,IAAI6W,KAAM,OAAO,MAAM7W,KAAK,OAAO,KAAKA,KAAK,UAAU,UACjE,KAAK,IAAI,CAAC,IAAI6W,KAAM,OAAO,MAAM7W,KAAK,MAAM,IAAIA,KAAK,SAAS,UAE9D6W,IAAKA,IAAK7W,GACV,KAAK,IAAI,CAAC,IAAI6W,KAAM,OAAO,MAAM7W,KAAK,UAAU,QAChD,KAAK,IAAI,CAAC,IAAI6W,KAAM,OAAO,MAAM7W,KAAK,SAAS,SAE/C6W,IAAKA,IAAK7W,GACV,KAAK,IAAI,CAAC,IAAI6W,KAAM,SAAS,QAC7B,KAAK,IAAI,CAAC,IAAIA,KAAM,SAAS,SAE7BA,IAAK,KAAK,IAAI7W,GAAG,CAAC,GAClB,KAAK,KAAK,KAAK,MAAM,IAAIA,MAAM,IAAI6W,KAAM,IAAI,IAAIA,KAAM,IAAI,KAAKA,IAAK,QAErE,KAAK,IAAI,CAAC,IAAI7W,KAAK,OAAOA,KAAK,IAAI,IAAIA,KAAK,MAAM,KAAKA,KAAK,IAAI,MAAMA,KAAK,KAAK,MAAMA,KAAK,SAAS,cACpG,KAAK,IAAI,CAAC,IAAIA,KAAK,MAAMA,KAAK,KAAK,IAAIA,KAAK,IAAI,KAAKA,KAAK,KAAK,MAAMA,KAAK,OAAO,MAAMA,KAAK,OAAO,aAEnG,KAAK,IAAI,CAAC,IAAI6W,KAAM,KAAK,KAAK7W,KAAK,KAAK,KAAKA,KAAK,MAAM,OAAOA,KAAK,MAAM,MAAMA,KAAK,UAAU,cAC/F,KAAK,IAAI,CAAC,IAAI6W,KAAM,KAAK,KAAK7W,KAAK,KAAK,IAAIA,KAAK,MAAM,OAAOA,KAAK,MAAM,MAAMA,KAAK,WAAW,cAE/F6W,IAAKA,IAAK7W,GACV,KAAK,IAAI,CAAC,IAAI6W,KAAM,MAAM,MAAM7W,KAAK,KAAK,MAAMA,KAAK,MAAM,OAAOA,KAAK,QAAQ,WAC/E,KAAK,IAAI,CAAC,IAAI6W,KAAM,KAAK,MAAM7W,KAAK,OAAO,MAAMA,KAAK,QAAQ,QAAQA,KAAK,SAAS,YAEpF6W,IAAKA,IAAK7W,GACV,KAAK,IAAI,CAAC,IAAI6W,KAAM,QAAQ,SAAS7W,KAAK,KAAK,MAAMA,KAAK,SAAS,YACnE,KAAK,IAAI,CAAC,IAAI6W,KAAM,QAAQ,SAAS7W,KAAK,OAAO,MAAMA,KAAK,UAAU,YAEtE6W,IAAKA,IAAK7W,GACV,KAAK,IAAI,CAAC,IAAI6W,KAAM,QAAQ,SAAS7W,KAAK,SAAS,WACnD,KAAK,IAAI,CAAC,IAAI6W,KAAM,QAAQ,QAAQ7W,KAAK,WAAW,WAEpD6W,IAAKA,IAAK7W,GACV,KAAK,IAAI,CAAC,IAAI6W,KAAM,YAAY,YAChC,KAAK,IAAI,CAAC,IAAIA,KAAM,YAAY;AAEhC,MAAIjP,IAAI4N,GAAK,KAAK,KAAK,KAAK,IAAI;AAChC,OAAK,KAAK,CAAC,KAAK,MAAM5N,IAAIkO,GAAM,KAAK,KAAK,IAAIlO,CAAC;AACjD;AAEO,SAAS3I,GAAQ/I,GAAG;AACzB,MAAI4gB,IAAKvY,EAAWrI,EAAE,IAAI,KAAK,OAAO,KAAK,IAAI,GAC3C6gB,IAAK7gB,EAAE;AAEX,EAAA6gB,IAAKvB,GAAK,KAAK,KAAKuB,CAAE;AACtB,MAAIC,IAAS,KAAK,IAAID,CAAE,GACpBE,IAAS,KAAK,IAAIF,CAAE,GACpBG,IAAS,KAAK,IAAIJ,CAAE,GACpBK,IAAS,KAAK,IAAIL,CAAE;AAExB,EAAAC,IAAK,KAAK,MAAMC,GAAQG,IAASF,CAAM,GACvCH,IAAK,KAAK,MAAMI,IAASD,GAAQ5B,GAAM2B,GAAQC,IAASE,CAAM,CAAC,GAC/DL,IAAKvB,GAAO,KAAK,IAAIuB,CAAE,CAAC;AAExB,MAAIM,IAAMhB,GAAY,KAAK,KAAK,IAAIW,GAAI,IAAID,CAAE;AAE9C,EAAAC,IAAKA,IAAKK,EAAI,CAAC,GACfN,IAAKA,IAAKM,EAAI,CAAC;AAEf,MAAI9Y,GACAc;AAEJ,SAAI,KAAK,IAAI0X,CAAE,KAAK,kBAClBxY,IAAI,KAAK,KAAK,KAAK,KAAKwY,KAAM,KAAK,IACnC1X,IAAI,KAAK,KAAK,KAAK,KAAK2X,IAAK,KAAK,MAAM,KAAK,OAE7CzY,IAAI,OACJc,IAAI,QAGNlJ,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GAEClJ;AACT;AAEO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAI4gB,KAAM5gB,EAAE,IAAI,KAAK,OAAO,IAAI,KAAK,IACjC6gB,KAAM7gB,EAAE,IAAI,KAAK,OAAO,IAAI,KAAK;AAErC,EAAA6gB,KAAMA,IAAK,KAAK,MAAM,KAAK,IAC3BD,IAAKA,IAAK,KAAK;AAEf,MAAI5X,GACAC;AAEJ,MAAI,KAAK,IAAI2X,CAAE,KAAK,gBAAgB;AAClC,QAAIM,IAAMhB,GAAY,KAAK,KAAK,IAAIW,GAAI,IAAID,CAAE;AAE9C,IAAAC,IAAKA,IAAKK,EAAI,CAAC,GACfN,IAAKA,IAAKM,EAAI,CAAC,GACfN,IAAK,KAAK,KAAK1B,GAAK0B,CAAE,CAAC;AAEvB,QAAIE,IAAS,KAAK,IAAID,CAAE,GACpBE,IAAS,KAAK,IAAIF,CAAE,GACpBG,IAAS,KAAK,IAAIJ,CAAE,GACpBK,IAAS,KAAK,IAAIL,CAAE;AAExB,IAAAC,IAAK,KAAK,MAAMC,IAASG,GAAQ9B,GAAM6B,GAAQC,IAASF,CAAM,CAAC,GAC/DH,IAAK,KAAK,MAAMI,GAAQC,IAASF,CAAM,GAEvC/X,IAAMX,EAAWuY,IAAK,KAAK,OAAO,KAAK,IAAI,GAC3C3X,IAAMqW,GAAK,KAAK,KAAKuB,CAAE;AAAA,EAC3B;AACI,IAAA7X,IAAM,OACNC,IAAM;AAGR,SAAAjJ,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GAECjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,gCAAgC,gCAAgC,UAAU,uBAAuB,uBAAuB,gBAAgB,gBAAgB,OAAO;AACnL,MAAA+X,KAAe;AAAA,EACb,MAAMrY;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACnLe,SAAAgY,GAAUC,GAAMrY,GAAK;AAClC,MAAIqY,MAAS,QAAW;AAGtB,QAFAA,IAAO,KAAK,OAAOhZ,EAAWW,CAAG,IAAI,KAAK,MAAM,KAAK,KAAK,EAAE,IAAI,GAE5DqY,IAAO;AACT,aAAO;AACF,QAAIA,IAAO;AAChB,aAAO;AAAA,EAEb;AACE,SAAOA;AACT;ACXO,IAAIC,KAAY;AAIhB,SAASxY,KAAO;AACrB,MAAIuY,IAAOD,GAAY,KAAK,MAAM,KAAK,KAAK;AAC5C,MAAIC,MAAS;AACX,UAAM,IAAI,MAAM,kBAAkB;AAEpC,OAAK,OAAO,GACZ,KAAK,SAAU,IAAI,KAAK,IAAIA,CAAI,IAAK,OAAO3iB,IAC5C,KAAK,KAAK,KACV,KAAK,KAAK,KAAK,WAAW,MAAW,GACrC,KAAK,KAAK,QAEVyiB,GAAO,KAAK,MAAM,IAAI,GACtB,KAAK,UAAUA,GAAO,SACtB,KAAK,UAAUA,GAAO;AACxB;AAEO,IAAI/X,KAAQ,CAAC,wCAAwC,KAAK;AACjE,MAAA6P,KAAe;AAAA,EACb,MAAMnQ;AAAAA,EACN,OAAOM;AAAAA,EACP,WAAWkY;AACb;AC3Be,SAAAC,GAAUC,GAAOC,GAAK;AACnC,SAAQ,KAAK,KAAK,IAAID,MAAU,IAAIA,IAAQC,CAAG;AACjD;ACDA,IAAI7D,KAAW;AAeR,SAAS9U,KAAO;AACrB,MAAI4U,IAAO,KAAK,IAAI,KAAK,IAAI,GACzBC,IAAO,KAAK,IAAI,KAAK,IAAI;AAC7B,EAAAA,KAAQA,GACR,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,EAAE,KAAK,IAAI,KAAK,KAAKD,IAAOA,IACzD,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAKC,IAAOA,KAAQ,IAAI,KAAK,GAAG,GAC5D,KAAK,QAAQ,KAAK,KAAKD,IAAO,KAAK,CAAC,GACpC,KAAK,SAAS,MAAM,KAAK,IAAI,KAAK,GAClC,KAAK,IAAI,KAAK,IAAI,MAAM,KAAK,QAAQ9e,EAAM,KAAK,KAAK,IAAI,KAAK,IAAI,MAAM,KAAK,OAAOA,EAAM,GAAG,KAAK,CAAC,IAAI2iB,GAAK,KAAK,IAAI7D,GAAM,KAAK,MAAM;AACxI;AAEO,SAAS3U,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE;AAEZ,SAAAA,EAAE,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,MAAMiJ,IAAMrK,EAAM,GAAG,KAAK,CAAC,IAAI2iB,GAAK,KAAK,IAAI,KAAK,IAAItY,CAAG,GAAG,KAAK,MAAM,CAAC,IAAI5K,GAC3H2B,EAAE,IAAI,KAAK,IAAIgJ,GACRhJ;AACT;AAEO,SAASmJ,GAAQnJ,GAAG;AAKzB,WAJI0hB,IAAU,OACV1Y,IAAMhJ,EAAE,IAAI,KAAK,GACjBiJ,IAAMjJ,EAAE,GACR0V,IAAM,KAAK,IAAI,KAAK,IAAI,MAAMzM,IAAMrK,EAAM,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,GAC3DW,IAAIqe,IAAUre,IAAI,MACzB0J,IAAM,IAAI,KAAK,KAAKyM,IAAM6L,GAAK,KAAK,IAAI,KAAK,IAAIvhB,EAAE,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,IAAI3B,GACrE,OAAK,IAAI4K,IAAMjJ,EAAE,CAAC,IAAI0hB,KAFE,EAAEniB;AAK9B,IAAAS,EAAE,IAAIiJ;AAGR,SAAK1J,KAGLS,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ,KAJE;AAKX;AAGA,MAAA2hB,KAAe;AAAA,EACb,MAAM7Y;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAEX;ACjDO,SAASL,KAAO;AAErB,EADA6Y,GAAM,KAAK,MAAM,IAAI,GAChB,KAAK,OAGV,KAAK,QAAQ,KAAK,IAAI,KAAK,KAAK,GAChC,KAAK,QAAQ,KAAK,IAAI,KAAK,KAAK,GAChC,KAAK,KAAK,IAAI,KAAK,IACd,KAAK,UACR,KAAK,QAAQ;AAEjB;AAEO,SAAS5Y,GAAQ/I,GAAG;AACzB,MAAI4hB,GAAMC,GAAMC,GAAM/D;AACtB,SAAA/d,EAAE,IAAIqI,EAAWrI,EAAE,IAAI,KAAK,OAAO,KAAK,IAAI,GAC5C2hB,GAAM,QAAQ,MAAM,MAAM,CAAC3hB,CAAC,CAAC,GAC7B4hB,IAAO,KAAK,IAAI5hB,EAAE,CAAC,GACnB6hB,IAAO,KAAK,IAAI7hB,EAAE,CAAC,GACnB8hB,IAAO,KAAK,IAAI9hB,EAAE,CAAC,GACnB+d,IAAI,KAAK,KAAK,KAAK,MAAM,IAAI,KAAK,QAAQ6D,IAAO,KAAK,QAAQC,IAAOC,IACrE9hB,EAAE,IAAI+d,IAAI8D,IAAO,KAAK,IAAI7hB,EAAE,CAAC,GAC7BA,EAAE,IAAI+d,KAAK,KAAK,QAAQ6D,IAAO,KAAK,QAAQC,IAAOC,IACnD9hB,EAAE,IAAI,KAAK,IAAIA,EAAE,IAAI,KAAK,IAC1BA,EAAE,IAAI,KAAK,IAAIA,EAAE,IAAI,KAAK,IACnBA;AACT;AAEO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAI4hB,GAAMC,GAAM7Y,GAAKC,GAAK8Y;AAM1B,MALA/hB,EAAE,KAAKA,EAAE,IAAI,KAAK,MAAM,KAAK,GAC7BA,EAAE,KAAKA,EAAE,IAAI,KAAK,MAAM,KAAK,GAE7BA,EAAE,KAAK,KAAK,IACZA,EAAE,KAAK,KAAK,IACP+hB,IAAM5C,GAAMnf,EAAE,GAAGA,EAAE,CAAC,GAAI;AAC3B,QAAIse,IAAI,IAAI,KAAK,MAAMyD,GAAK,KAAK,EAAE;AACnC,IAAAH,IAAO,KAAK,IAAItD,CAAC,GACjBuD,IAAO,KAAK,IAAIvD,CAAC,GACjBrV,IAAM,KAAK,KAAK4Y,IAAO,KAAK,QAAQ7hB,EAAE,IAAI4hB,IAAO,KAAK,QAAQG,CAAG,GACjE/Y,IAAM,KAAK,MAAMhJ,EAAE,IAAI4hB,GAAMG,IAAM,KAAK,QAAQF,IAAO7hB,EAAE,IAAI,KAAK,QAAQ4hB,CAAI;AAAA,EAClF;AACI,IAAA3Y,IAAM,KAAK,OACXD,IAAM;AAGR,SAAAhJ,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACN0Y,GAAM,QAAQ,MAAM,MAAM,CAAC3hB,CAAC,CAAC,GAC7BA,EAAE,IAAIqI,EAAWrI,EAAE,IAAI,KAAK,OAAO,KAAK,IAAI,GACrCA;AACT;AAEO,IAAIoJ,KAAQ,CAAC,4BAA4B,yBAAyB,UAAU,qCAAqC,sBAAsB;AAC9I,MAAA4Y,KAAe;AAAA,EACb,MAAMlZ;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACpDO,SAAS6Y,GAAMC,GAAMla,GAAQma,GAAO;AACzC,SAAAna,KAAUma,GACF,KAAK,IAAI,OAAO9jB,IAAU6jB,EAAK,IAAI,KAAK,KAAK,IAAIla,MAAW,IAAIA,IAAS,MAAMma,CAAK;AAC9F;AAGO,SAASrZ,KAAO;AAErB,OAAK,KAAK,KAAK,MAAM,GACrB,KAAK,KAAK,KAAK,MAAM,GACrB,KAAK,OAAO,KAAK,QAAQ,GACzB,KAAK,QAAQ,KAAK,SAAS,GAE3B,KAAK,UAAU,KAAK,IAAI,KAAK,IAAI,GACjC,KAAK,UAAU,KAAK,IAAI,KAAK,IAAI,GAC7B,KAAK,SACH,KAAK,OAAO,KAAK,CAAC,MAAM,KAAK,MAAM,KAAK,KAAK,IAAI,KAAK,OAAO,KAAKrK,MACpE,KAAK,KAAK,OAAO,IAAI0J,GAAK,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,MAAM,OAGzD,KAAK,IAAI,KAAK,OAAO,KAAK1J,MACxB,KAAK,OAAO,IAGd,KAAK,MAAM,IAIX,KAAK,MAAM,KAGf,KAAK,OAAO,KAAK,KAAK,KAAK,IAAI,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,GACrF,KAAK,OAAO,KAAK,CAAC,MAAM,KAAK,MAAM,KAAK,KAAK,IAAI,KAAK,OAAO,KAAKA,KAAS,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,IAAIA,MAG/G,KAAK,KAAK,MAAM,KAAK,OAAOqJ,GAAM,KAAK,GAAG,KAAK,IAAI,KAAK,MAAM,GAAG,KAAK,IAAI,KAAK,MAAM,CAAC,IAAIS,GAAM,KAAK,GAAG,KAAK,MAAM,KAAK,QAAQ,KAAK,MAAM,KAAK,IAAI,KAAK,MAAM,CAAC,IAElK,KAAK,MAAMT,GAAM,KAAK,GAAG,KAAK,SAAS,KAAK,OAAO,GACnD,KAAK,KAAK,IAAI,KAAK,KAAKma,GAAM,KAAK,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,IAAI5jB,GAClE,KAAK,QAAQ,KAAK,IAAI,KAAK,EAAE,GAC7B,KAAK,QAAQ,KAAK,IAAI,KAAK,EAAE;AAEjC;AAGO,SAAS0K,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GACRoiB,IAAS,KAAK,IAAInZ,CAAG,GACrBoZ,IAAS,KAAK,IAAIpZ,CAAG,GACrBgO,GAAGzF,GAAG8Q,GAAMC,GAAM5Z,GAAI6Z,GACtBC,IAAOpa,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI;AAEjD,SAAI,KAAK,IAAI,KAAK,IAAIA,IAAM,KAAK,KAAK,IAAI,KAAK,EAAE,KAAKvK,KAAS,KAAK,IAAIwK,IAAM,KAAK,IAAI,KAAKxK,KAG1FuB,EAAE,IAAI,KACNA,EAAE,IAAI,KACCA,KAEL,KAAK,UAEPiX,IAAI,IAAI,KAAK,MAAM,IAAI,KAAK,UAAUmL,IAAS,KAAK,UAAUC,IAAS,KAAK,IAAII,CAAI,IACpFziB,EAAE,IAAI,KAAK,IAAIiX,IAAIoL,IAAS,KAAK,IAAII,CAAI,IAAI,KAAK,IAClDziB,EAAE,IAAI,KAAK,IAAIiX,KAAK,KAAK,UAAUmL,IAAS,KAAK,UAAUC,IAAS,KAAK,IAAII,CAAI,KAAK,KAAK,IACpFziB,MAEPwR,IAAI,IAAI,KAAK,KAAKyQ,GAAMhZ,GAAKmZ,GAAQ,KAAK,CAAC,CAAC,IAAI/jB,GAChDkkB,IAAO,KAAK,IAAI/Q,CAAC,GACjB8Q,IAAO,KAAK,IAAI9Q,CAAC,GACb,KAAK,IAAI,KAAK,OAAO,KAAK/S,KAC5BkK,IAAKJ,GAAM,KAAK,GAAGU,IAAM,KAAK,KAAK,KAAK,MAAMmZ,CAAM,GACpDI,IAAK,IAAI,KAAK,IAAI,KAAK,KAAK7Z,IAAK,KAAK,MACtC3I,EAAE,IAAI,KAAK,KAAKwiB,IAAK,KAAK,IAAIxZ,IAAM,KAAK,KAAK,GAC9ChJ,EAAE,IAAI,KAAK,KAAK,KAAK,MAAMwiB,IAAK,KAAK,IAAIxZ,IAAM,KAAK,KAAK,GAElDhJ,MACE,KAAK,IAAI,KAAK,OAAO,IAAIvB,KAGlCwY,IAAI,IAAI,KAAK,IAAI,KAAK,MAAM,IAAIsL,IAAO,KAAK,IAAIE,CAAI,IACpDziB,EAAE,IAAIiX,IAAIqL,MAIVrL,IAAI,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,OAAO,KAAK,SAAS,IAAI,KAAK,QAAQqL,IAAO,KAAK,QAAQC,IAAO,KAAK,IAAIE,CAAI,KAC9GziB,EAAE,IAAIiX,KAAK,KAAK,QAAQqL,IAAO,KAAK,QAAQC,IAAO,KAAK,IAAIE,CAAI,KAAK,KAAK,KAE5EziB,EAAE,IAAIiX,IAAIsL,IAAO,KAAK,IAAIE,CAAI,IAAI,KAAK,IAGlCziB;AACT;AAGO,SAASmJ,GAAQnJ,GAAG;AACzB,EAAAA,EAAE,KAAK,KAAK,IACZA,EAAE,KAAK,KAAK;AACZ,MAAIgJ,GAAKC,GAAKN,GAAI+Z,GAAIC,GAClBH,IAAK,KAAK,KAAKxiB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC;AACxC,MAAI,KAAK,QAAQ;AACf,QAAIse,IAAI,IAAI,KAAK,KAAKkE,KAAM,IAAI,KAAK,IAAI,KAAK,GAAG;AAGjD,WAFAxZ,IAAM,KAAK,OACXC,IAAM,KAAK,MACPuZ,KAAM/jB,KACRuB,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ,MAETiJ,IAAM,KAAK,KAAK,KAAK,IAAIqV,CAAC,IAAI,KAAK,UAAUte,EAAE,IAAI,KAAK,IAAIse,CAAC,IAAI,KAAK,UAAUkE,CAAE,GAC9E,KAAK,IAAI,KAAK,OAAO,IAAI/jB,IACvB,KAAK,OAAO,IACduK,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAMrI,EAAE,GAAG,KAAKA,EAAE,CAAC,GAAG,KAAK,IAAI,IAElEgJ,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAMrI,EAAE,GAAGA,EAAE,CAAC,GAAG,KAAK,IAAI,IAG/DgJ,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAMrI,EAAE,IAAI,KAAK,IAAIse,CAAC,GAAGkE,IAAK,KAAK,UAAU,KAAK,IAAIlE,CAAC,IAAIte,EAAE,IAAI,KAAK,UAAU,KAAK,IAAIse,CAAC,CAAC,GAAG,KAAK,IAAI,GAE5Ite,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AAAA,EACX,WACQ,KAAK,IAAI,KAAK,OAAO,KAAKvB,GAAO;AACnC,QAAI+jB,KAAM/jB;AACR,aAAAwK,IAAM,KAAK,MACXD,IAAM,KAAK,OACXhJ,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GAECjJ;AAET,IAAAA,EAAE,KAAK,KAAK,KACZA,EAAE,KAAK,KAAK,KACZ2I,IAAK6Z,IAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,KAAK,KACzCvZ,IAAM,KAAK,MAAMP,GAAM,KAAK,GAAGC,CAAE,GACjCK,IAAM,KAAK,MAAMX,EAAW,KAAK,MAAM,KAAK,QAAQ,KAAK,MAAMrI,EAAE,GAAG,KAAKA,EAAE,CAAC,GAAG,KAAK,IAAI;AAAA,EAC9F;AACM,IAAA0iB,IAAK,IAAI,KAAK,KAAKF,IAAK,KAAK,SAAS,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,GACtExZ,IAAM,KAAK,OACPwZ,KAAM/jB,IACRkkB,IAAM,KAAK,MAEXA,IAAM,KAAK,KAAK,KAAK,IAAID,CAAE,IAAI,KAAK,QAAQ1iB,EAAE,IAAI,KAAK,IAAI0iB,CAAE,IAAI,KAAK,QAAQF,CAAE,GAChFxZ,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAMrI,EAAE,IAAI,KAAK,IAAI0iB,CAAE,GAAGF,IAAK,KAAK,QAAQ,KAAK,IAAIE,CAAE,IAAI1iB,EAAE,IAAI,KAAK,QAAQ,KAAK,IAAI0iB,CAAE,CAAC,GAAG,KAAK,IAAI,IAE3IzZ,IAAM,KAAKP,GAAM,KAAK,GAAG,KAAK,IAAI,OAAOrK,IAAUskB,EAAI,CAAC;AAG5D,SAAA3iB,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GAGCjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,SAAS,4BAA4B,iCAAiC,iCAAiC,qBAAqB;AAChJ,MAAAwZ,KAAe;AAAA,EACb,MAAM9Z;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AAAAA,EACP,OAAO6Y;AACT;ACtKO,SAASnZ,KAAO;AACrB,MAAI+Z,IAAO,KAAK;AAChB,OAAK,UAAU,KAAK;AACpB,MAAIC,IAAU,KAAK,IAAID,CAAI,GACvBE,IAAgB,KAAK,GACrBC,IAAO,KAAK,IACZC,IAAa,IAAID,GACjBE,IAAK,IAAID,IAAa,KAAK,IAAIA,GAAY,CAAC,GAC5CrY,IAAI,KAAK,IAAI,KAAK,KAAKsY,CAAE;AAC7B,OAAK,IAAI,KAAK,KAAKH,IAAgB,KAAK,KAAK,IAAIG,CAAE,KAAK,IAAIA,IAAK,KAAK,IAAIJ,GAAS,CAAC,IACpF,KAAK,QAAQ,KAAK,KAAK,IAAII,KAAM,IAAIA,KAAM,KAAK,IAAI,KAAK,IAAIL,CAAI,GAAG,CAAC,CAAC,GACtE,KAAK,KAAK,KAAK,KAAKC,IAAU,KAAK,KAAK;AACxC,MAAIK,IAAK,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC,GACjDC,IAAK,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAIP,IAAO,CAAC,CAAC,GAC9CQ,IAAK,KAAK,KAAK,IAAIzY,IAAIkY,MAAY,IAAIlY,IAAIkY,EAAQ;AACvD,OAAK,IAAIK,IAAK,KAAK,QAAQC,IAAK,KAAK,QAAQxY,IAAI,IAAIyY;AACvD;AAEO,SAASta,GAAQ/I,GAAG;AACzB,MAAIsjB,IAAM,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAItjB,EAAE,IAAI,CAAC,CAAC,GAC9CujB,IAAM,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAIvjB,EAAE,CAAC,MAAM,IAAI,KAAK,IAAI,KAAK,IAAIA,EAAE,CAAC,EAAE,GACvFwjB,IAAI,CAAC,KAAK,SAASF,IAAMC,KAAO,KAAK,GAGrC9hB,IAAI,KAAK,KAAK,KAAK,KAAK,IAAI+hB,CAAC,CAAC,IAAI,KAAK,KAAK,IAG5CtM,IAAI,KAAK,SAASlX,EAAE,IAAI,KAAK,UAG7ByjB,IAAO,KAAK,KAAK,KAAK,IAAIvM,CAAC,KAAK,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAIzV,CAAC,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAIyV,CAAC,EAAE,GAElGwM,IAAO,KAAK,KAAK,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAIjiB,CAAC,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAIA,CAAC,IAAI,KAAK,IAAIyV,CAAC,CAAC;AAEpG,SAAAlX,EAAE,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI0jB,CAAI,MAAM,IAAI,KAAK,IAAIA,CAAI,EAAE,IAAI,KAAK,IAChF1jB,EAAE,IAAI,KAAK,IAAIyjB,IAAO,KAAK,IACpBzjB;AACT;AAEO,SAASmJ,GAAQnJ,GAAG;AAgBzB,WAfIyR,IAAIzR,EAAE,IAAI,KAAK,IACfwR,IAAIxR,EAAE,IAAI,KAAK,IAEfyjB,IAAOhS,IAAI,KAAK,GAChBiS,IAAO,KAAK,KAAK,KAAK,KAAK,IAAIlS,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,KAAK,IAExD/P,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAIiiB,CAAI,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAIA,CAAI,IAAI,KAAK,IAAID,CAAI,CAAC,GACtGvM,IAAI,KAAK,KAAK,KAAK,IAAIuM,CAAI,KAAK,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAIA,CAAI,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAIC,CAAI,EAAE,GAExGC,IAAS,KAAK,UAAUzM,IAAI,KAAK,OAEjCsM,IAAI,GACJI,IAAMniB,GACNoiB,IAAU,MACVC,IAAY,GACT,KAAK,IAAIF,IAAMC,CAAO,IAAI,QAAW;AAC1C,QAAI,EAAEC,IAAY;AAEhB;AAGF,IAAAN,IAAI,IAAI,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI/hB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAImiB,CAAG,CAAC,IAAI,CAAC,CAAC,GACzJC,IAAUD,GACVA,IAAM,IAAI,KAAK,KAAK,KAAK,IAAIJ,CAAC,CAAC,IAAI,KAAK,KAAK;AAAA,EACjD;AAEE,SAAAxjB,EAAE,IAAI2jB,GACN3jB,EAAE,IAAI4jB,GACC5jB;AACT;AAEO,IAAIoJ,KAAQ,CAAC,QAAQ;AAC5B,MAAA2a,KAAe;AAAA,EACb,MAAMjb;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AClEA,IAAI4a,KAAM;AAEV,SAASC,GAAQtT,GAAG;AAClB,MAAIuT,IAAmB,CAAC,2BAA2B,qCAAqC,gDAAgD,GACpIC,IAAiB,OAAOxT,EAAE,YAAa,WAAW,OAAO,KAAKA,EAAE,QAAQ,EAAE,CAAC,IAAIA,EAAE;AAErF,SAAO,aAAaA,KAAK,YAAYA,KAAKuT,EAAiB,QAAQC,CAAc,MAAM,MAAMD,EAAiB,QAAQna,GAAsBoa,CAAc,CAAC,MAAM;AACnK;AAMO,SAASrb,KAAO;AACrB,MAAIZ,GAAKO,GAAK2b,GAAQ3K,GAAG4K,GAAGC,GAAGC,GAAGC,GAAQxkB,GAAGykB,GAAGC,IAAQ,GACtDC,GAAQC,IAAO,GAAGC,IAAO,GAAGC,IAAO,GAAGC,IAAO,GAAGC,IAAO,GAAGC,IAAU;AAItE,OAAK,SAAShB,GAAQ,IAAI,GAC1B,KAAK,SAAS,YAAY;AAE1B,MAAIiB,IAAM;AACV,EAAI,WAAW,SACbA,IAAM;AAGR,MAAIC,IAAM;AAaV,MAZI,0BAA0B,SAC5BA,IAAM,KAGJD,MACFD,IAAU,KAAK,QAGbE,MACFT,IAAQ,KAAK,uBAGXQ,KAAOC;AACT,IAAAP,IAAO,KAAK;AAAA,WAEZC,IAAO,KAAK,OACZE,IAAO,KAAK,MACZD,IAAO,KAAK,OACZE,IAAO,KAAK,MAER,KAAK,IAAID,IAAOC,CAAI,KAAKhB,OAAQ9b,IAAM,KAAK,IAAI6c,CAAI,MAAMf,MACzD,KAAK,IAAI9b,IAAM7J,CAAO,KAAK2lB,MAAO,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI3lB,CAAO,KAAK2lB,MAC7E,KAAK,IAAI,KAAK,IAAIgB,CAAI,IAAI3mB,CAAO,KAAK2lB;AACzC,UAAM,IAAI,MAAK;AAInB,MAAIoB,IAAS,IAAM,KAAK;AACxB,EAAA3c,IAAM,KAAK,KAAK2c,CAAM,GAElB,KAAK,IAAI,KAAK,IAAI,IAAI3mB,KACxB+lB,IAAS,KAAK,IAAI,KAAK,IAAI,GAC3BJ,IAAS,KAAK,IAAI,KAAK,IAAI,GAC3Blc,IAAM,IAAI,KAAK,KAAKsc,IAASA,GAC7B,KAAK,IAAIJ,IAASA,GAClB,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAIgB,CAAM,GACzD,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK3c,IAAMP,GAClCuR,IAAI,KAAK,IAAIhR,KAAO2b,IAAS,KAAK,KAAKlc,CAAG,IAC1Cmc,IAAI5K,IAAIA,IAAI,GAER4K,KAAK,IACPA,IAAI,KAEJA,IAAI,KAAK,KAAKA,CAAC,GACX,KAAK,OAAO,MACdA,IAAI,CAACA,KAIT,KAAK,IAAIA,KAAK5K,GACd,KAAK,KAAK,KAAK,IAAIlR,GAAM,KAAK,GAAG,KAAK,MAAMic,CAAM,GAAG,KAAK,CAAC,MAE3D,KAAK,IAAI,IAAI/b,GACb,KAAK,IAAI,KAAK,IACd,KAAK,IAAIgR,IAAI4K,IAAI,IAGfa,KAAOC,KACLD,KACFP,IAAS,KAAK,KAAK,KAAK,IAAIM,CAAO,IAAIxL,CAAC,GACnC0L,MACHT,IAAQO,OAGVN,IAASD,GACTO,IAAU,KAAK,KAAKxL,IAAI,KAAK,IAAIkL,CAAM,CAAC,IAE1C,KAAK,OAAOC,IAAO,KAAK,KAAK,OAAOP,IAAI,IAAIA,KAAK,KAAK,IAAIM,CAAM,CAAC,IAAI,KAAK,MAE1EL,IAAI,KAAK,IAAI/b,GAAM,KAAK,GAAGwc,GAAM,KAAK,IAAIA,CAAI,CAAC,GAAG,KAAK,CAAC,GACxDR,IAAI,KAAK,IAAIhc,GAAM,KAAK,GAAGyc,GAAM,KAAK,IAAIA,CAAI,CAAC,GAAG,KAAK,CAAC,GACxDX,IAAI,KAAK,IAAIC,GACbtkB,KAAKukB,IAAID,MAAMC,IAAID,IACnBG,IAAI,KAAK,IAAI,KAAK,GAClBA,KAAKA,IAAIF,IAAID,MAAMG,IAAIF,IAAID,IAC3Bpc,IAAM2c,IAAOC,GAET5c,IAAM,CAAC,KAAK,KACd4c,KAAQjmB,KACCqJ,IAAM,KAAK,OACpB4c,KAAQjmB,KAGV,KAAK,OAAOwJ,EAAW,OAAOwc,IAAOC,KAAQ,KAAK,KAAKL,IAAI,KAAK,IAAI,MAAM,KAAK,KAAKI,IAAOC,EAAK,IAAI9kB,CAAC,IAAI,KAAK,GAAG,KAAK,IAAI,GAC1H2kB,IAAS,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAItc,EAAWwc,IAAO,KAAK,MAAM,KAAK,IAAI,CAAC,KAAKR,IAAI,IAAIA,EAAE,GAC/FK,IAAQO,IAAU,KAAK,KAAKxL,IAAI,KAAK,IAAIkL,CAAM,CAAC,IAGlD,KAAK,SAAS,KAAK,IAAIA,CAAM,GAC7B,KAAK,SAAS,KAAK,IAAIA,CAAM,GAC7B,KAAK,SAAS,KAAK,IAAID,CAAK,GAC5B,KAAK,SAAS,KAAK,IAAIA,CAAK,GAE5B,KAAK,KAAK,IAAI,KAAK,GACnB,KAAK,MAAM,KAAK,IAAI,KAAK,IACzB,KAAK,MAAM,IAAI,KAAK,KAEhB,KAAK,SACP,KAAK,MAAM,KAEX,KAAK,MAAM,KAAK,IAAI,KAAK,MAAM,KAAK,KAAK,KAAK,KAAKjL,IAAIA,IAAI,CAAC,IAAI,KAAK,IAAIwL,CAAO,CAAC,CAAC,GAE9E,KAAK,OAAO,MACd,KAAK,MAAM,CAAC,KAAK,OAIrBZ,IAAI,MAAMM,GACV,KAAK,WAAW,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI/lB,KAASylB,CAAC,CAAC,GACxD,KAAK,WAAW,KAAK,MAAM,KAAK,IAAI,KAAK,IAAIzlB,KAASylB,CAAC,CAAC;AAC1D;AAIO,SAAStb,GAAQ/I,GAAG;AACzB,MAAIoW,IAAS,CAAA,GACToN,GAAGjL,GAAG8M,GAAGjO,GAAGkO,GAAGvG,GAAMwG,GAAGzlB;AAG5B,MAFAE,EAAE,IAAIA,EAAE,IAAI,KAAK,MAEb,KAAK,IAAI,KAAK,IAAIA,EAAE,CAAC,IAAI3B,CAAO,IAAII,GAAO;AAS7C,QARA6mB,IAAI,KAAK,IAAI,KAAK,IAAI/c,GAAM,KAAK,GAAGvI,EAAE,GAAG,KAAK,IAAIA,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,GAE/D+e,IAAO,IAAIuG,GACX9B,IAAI,OAAO8B,IAAIvG,IACfxG,IAAI,OAAO+M,IAAIvG,IACf3H,IAAI,KAAK,IAAI,KAAK,IAAIpX,EAAE,CAAC,GACzBqlB,KAAK7B,IAAI,KAAK,SAASpM,IAAI,KAAK,UAAUmB,GAEtC,KAAK,IAAI,KAAK,IAAI8M,CAAC,IAAI,CAAG,IAAI5mB;AAChC,YAAM,IAAI,MAAK;AAGjB,IAAAqB,IAAI,MAAM,KAAK,MAAM,KAAK,KAAK,IAAIulB,MAAM,IAAIA,EAAE,GAC/CtG,IAAO,KAAK,IAAI,KAAK,IAAI/e,EAAE,CAAC,GAExB,KAAK,IAAI+e,CAAI,IAAIiF,KACnBuB,IAAI,KAAK,IAAIvlB,EAAE,IAEfulB,IAAI,KAAK,MAAM,KAAK,MAAO/B,IAAI,KAAK,SAASpM,IAAI,KAAK,QAAS2H,CAAI;AAAA,EAEzE;AACI,IAAAjf,IAAIE,EAAE,IAAI,IAAI,KAAK,WAAW,KAAK,UACnCulB,IAAI,KAAK,MAAMvlB,EAAE;AAGnB,SAAI,KAAK,UACPoW,EAAO,IAAImP,GACXnP,EAAO,IAAItW,MAEXylB,KAAK,KAAK,KACVnP,EAAO,IAAItW,IAAI,KAAK,SAASylB,IAAI,KAAK,QACtCnP,EAAO,IAAImP,IAAI,KAAK,SAASzlB,IAAI,KAAK,SAGxCsW,EAAO,IAAK,KAAK,IAAIA,EAAO,IAAI,KAAK,IACrCA,EAAO,IAAK,KAAK,IAAIA,EAAO,IAAI,KAAK,IAE9BA;AACT;AAEO,SAASjN,GAAQnJ,GAAG;AACzB,MAAIulB,GAAGzlB,GAAG0lB,GAAIC,GAAIC,GAAIC,GAAIC,GACtBxP,IAAS,CAAA;AAmBb,MAjBApW,EAAE,KAAKA,EAAE,IAAI,KAAK,OAAO,IAAM,KAAK,IACpCA,EAAE,KAAKA,EAAE,IAAI,KAAK,OAAO,IAAM,KAAK,IAEhC,KAAK,UACPF,IAAIE,EAAE,GACNulB,IAAIvlB,EAAE,MAENF,IAAIE,EAAE,IAAI,KAAK,SAASA,EAAE,IAAI,KAAK,QACnCulB,IAAIvlB,EAAE,IAAI,KAAK,SAASA,EAAE,IAAI,KAAK,SAAS,KAAK,MAGnDwlB,IAAK,KAAK,IAAI,CAAC,KAAK,MAAM1lB,CAAC,GAC3B2lB,IAAK,OAAOD,IAAK,IAAIA,IACrBE,IAAK,OAAOF,IAAK,IAAIA,IACrBG,IAAK,KAAK,IAAI,KAAK,MAAMJ,CAAC,GAC1BK,KAAMD,IAAK,KAAK,SAASF,IAAK,KAAK,UAAUC,GAEzC,KAAK,IAAI,KAAK,IAAIE,CAAE,IAAI,CAAC,IAAInnB;AAC/B,IAAA2X,EAAO,IAAI,GACXA,EAAO,IAAIwP,IAAK,IAAI,CAACvnB,IAAUA;AAAA,OAC1B;AAIL,QAHA+X,EAAO,IAAI,KAAK,IAAI,KAAK,MAAM,IAAIwP,MAAO,IAAIA,EAAG,GACjDxP,EAAO,IAAI1N,GAAM,KAAK,GAAG,KAAK,IAAI0N,EAAO,GAAG,IAAI,KAAK,CAAC,CAAC,GAEnDA,EAAO,MAAM;AACf,YAAM,IAAI,MAAK;AAGjB,IAAAA,EAAO,IAAI,CAAC,KAAK,KAAK,KAAK,MAAOqP,IAAK,KAAK,SAASE,IAAK,KAAK,QAAS,KAAK,IAAI,KAAK,MAAMJ,CAAC,CAAC;AAAA,EAClG;AAEE,SAAAnP,EAAO,KAAK,KAAK,MAEVA;AACT;AAEO,IAAIhN,KAAQ,CAAC,2BAA2B,2BAA2B,qCAAqC,qCAAqC,kDAAkD,oDAAoD,0CAA0C,oBAAoB,OAAO;AAC/T,MAAAyc,KAAe;AAAA,EACb,MAAM/c;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACvPO,SAASN,KAAO;AAsBrB,MATK,KAAK,SACR,KAAK,OAAO,KAAK,OAEd,KAAK,OACR,KAAK,KAAK,IAEZ,KAAK,KAAK,KAAK,MAAM,GACrB,KAAK,KAAK,KAAK,MAAM,GAEjB,OAAK,IAAI,KAAK,OAAO,KAAK,IAAI,IAAIrK,IAItC;AAAA,QAAIsgB,IAAO,KAAK,IAAI,KAAK;AACzB,SAAK,IAAI,KAAK,KAAK,IAAIA,IAAOA,CAAI;AAElC,QAAI+G,IAAO,KAAK,IAAI,KAAK,IAAI,GACzBC,IAAO,KAAK,IAAI,KAAK,IAAI,GACzBC,IAAMle,GAAM,KAAK,GAAGge,GAAMC,CAAI,GAC9BE,IAAM1d,GAAM,KAAK,GAAG,KAAK,MAAMud,CAAI,GAEnCI,IAAO,KAAK,IAAI,KAAK,IAAI,GACzBC,IAAO,KAAK,IAAI,KAAK,IAAI,GACzBC,IAAMte,GAAM,KAAK,GAAGoe,GAAMC,CAAI,GAC9BE,IAAM9d,GAAM,KAAK,GAAG,KAAK,MAAM2d,CAAI,GAEnCI,IAAM,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,IAAIjoB,CAAO,IAAII,IAChD,IACA8J,GAAM,KAAK,GAAG,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,CAAC;AAEhD,IAAI,KAAK,IAAI,KAAK,OAAO,KAAK,IAAI,IAAI9J,IACpC,KAAK,KAAK,KAAK,IAAIunB,IAAMI,CAAG,IAAI,KAAK,IAAIH,IAAMI,CAAG,IAElD,KAAK,KAAKP,GAER,MAAM,KAAK,EAAE,MACf,KAAK,KAAKA,IAEZ,KAAK,KAAKE,KAAO,KAAK,KAAK,KAAK,IAAIC,GAAK,KAAK,EAAE,IAChD,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAIK,GAAK,KAAK,EAAE,GAC7C,KAAK,UACR,KAAK,QAAQ;AAAA;AAEjB;AAIO,SAASvd,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE;AAGZ,EAAI,KAAK,IAAI,IAAI,KAAK,IAAIiJ,CAAG,IAAI,KAAK,EAAE,KAAKxK,MAC3CwK,IAAMd,GAAKc,CAAG,KAAK5K,IAAU,IAAII;AAGnC,MAAIyJ,IAAM,KAAK,IAAI,KAAK,IAAIe,CAAG,IAAI5K,CAAO,GACtCsK,GAAI4d;AACR,MAAIre,IAAMzJ;AACR,IAAAkK,IAAKJ,GAAM,KAAK,GAAGU,GAAK,KAAK,IAAIA,CAAG,CAAC,GACrCsd,IAAM,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI5d,GAAI,KAAK,EAAE;AAAA,OACxC;AAEL,QADAT,IAAMe,IAAM,KAAK,IACbf,KAAO;AACT,aAAO;AAET,IAAAqe,IAAM;AAAA,EACV;AACE,MAAIC,IAAQ,KAAK,KAAKne,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI;AAC5D,SAAAhJ,EAAE,IAAI,KAAK,MAAMumB,IAAM,KAAK,IAAIC,CAAK,KAAK,KAAK,IAC/CxmB,EAAE,IAAI,KAAK,MAAM,KAAK,KAAKumB,IAAM,KAAK,IAAIC,CAAK,KAAK,KAAK,IAElDxmB;AACT;AAIO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIumB,GAAKre,GAAKS,GACVM,GAAKD,GACLZ,KAAKpI,EAAE,IAAI,KAAK,MAAM,KAAK,IAC3BkJ,IAAK,KAAK,MAAMlJ,EAAE,IAAI,KAAK,MAAM,KAAK;AAC1C,EAAI,KAAK,KAAK,KACZumB,IAAM,KAAK,KAAKne,IAAIA,IAAIc,IAAIA,CAAC,GAC7BhB,IAAM,MAENqe,IAAM,CAAC,KAAK,KAAKne,IAAIA,IAAIc,IAAIA,CAAC,GAC9BhB,IAAM;AAER,MAAIse,IAAQ;AAIZ,MAHID,MAAQ,MACVC,IAAQ,KAAK,MAAOte,IAAME,GAAKF,IAAMgB,CAAC,IAEnCqd,MAAQ,KAAO,KAAK,KAAK;AAI5B,QAHAre,IAAM,IAAI,KAAK,IACfS,IAAK,KAAK,IAAK4d,KAAO,KAAK,IAAI,KAAK,KAAMre,CAAG,GAC7Ce,IAAMP,GAAM,KAAK,GAAGC,CAAE,GAClBM,MAAQ;AACV,aAAO;AAAA;AAGT,IAAAA,IAAM,CAAC5K;AAET,SAAA2K,IAAMX,EAAWme,IAAQ,KAAK,KAAK,KAAK,OAAO,KAAK,IAAI,GAExDxmB,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AACT;AAEO,IAAIoJ,KAAQ;AAAA,EACjB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,MAAAqd,KAAe;AAAA,EACb,MAAM3d;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACxJO,SAASN,KAAO;AACrB,OAAK,IAAI,eACT,KAAK,KAAK,mBACV,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE,GACrB,KAAK,SACR,KAAK,OAAO,oBAET,KAAK,UACR,KAAK,QAAQ,qBAAqB,oBAG/B,KAAK,OACR,KAAK,KAAK,SAEZ,KAAK,MAAM,mBACX,KAAK,MAAM,IAAI,KAAK,KACpB,KAAK,MAAM,KAAK,MAChB,KAAK,KAAK,KAAK,IACf,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE,GAC1B,KAAK,OAAO,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,GAAG,CAAC,KAAM,IAAI,KAAK,GAAG,GACrF,KAAK,KAAK,kBACV,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,IAAI,GAClD,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,OAAO,KAAK,IAAI,CAAC,GAC/G,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,IAAI,KAAK,GAAG,GAAG,KAAK,IAAI,IAAI,KAAK,GAC1G,KAAK,KAAK,KAAK,IACf,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,EAAE,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,GAAG,CAAC,IACzF,KAAK,KAAK,kBACV,KAAK,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,EAAE,GAC/C,KAAK,KAAK,KAAK,MAAM,KAAK;AAC5B;AAKO,SAASC,GAAQ/I,GAAG;AACzB,MAAI0mB,GAAKnB,GAAGoB,GAAQ3I,GAAGW,GAAGiI,GAAKC,GAC3B7d,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GACRie,IAAY5V,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI;AAEtD,SAAA0d,IAAM,KAAK,KAAM,IAAI,KAAK,IAAI,KAAK,IAAIzd,CAAG,MAAM,IAAI,KAAK,IAAI,KAAK,IAAIA,CAAG,IAAM,KAAK,OAAO,KAAK,IAAI,CAAC,GACrGsc,IAAI,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAItc,IAAM,IAAI,KAAK,GAAG,GAAG,KAAK,IAAI,IAAIyd,CAAG,IAAI,KAAK,MAC5FC,IAAS,CAAC1I,IAAY,KAAK,MAC3BD,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAIuH,CAAC,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAIA,CAAC,IAAI,KAAK,IAAIoB,CAAM,CAAC,GAClGhI,IAAI,KAAK,KAAK,KAAK,IAAI4G,CAAC,IAAI,KAAK,IAAIoB,CAAM,IAAI,KAAK,IAAI3I,CAAC,CAAC,GAC1D4I,IAAM,KAAK,IAAIjI,GACfkI,IAAK,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,GAAG,GAAG,KAAK,CAAC,IAAI,KAAK,IAAI,KAAK,IAAI7I,IAAI,IAAI,KAAK,GAAG,GAAG,KAAK,CAAC,GAChHhe,EAAE,IAAI6mB,IAAK,KAAK,IAAID,CAAG,IAAI,GAC3B5mB,EAAE,IAAI6mB,IAAK,KAAK,IAAID,CAAG,IAAI,GAEtB,KAAK,UACR5mB,EAAE,KAAK,IACPA,EAAE,KAAK,KAEDA;AACV;AAGO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIulB,GAAGoB,GAAQ,GAAGhI,GAAGiI,GAAKC,GAAIC,GAC1BC,GAIA7F,IAAMlhB,EAAE;AACZ,EAAAA,EAAE,IAAIA,EAAE,GACRA,EAAE,IAAIkhB,GACD,KAAK,UACRlhB,EAAE,KAAK,IACPA,EAAE,KAAK,KAET6mB,IAAK,KAAK,KAAK7mB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,GACpC4mB,IAAM,KAAK,MAAM5mB,EAAE,GAAGA,EAAE,CAAC,GACzB2e,IAAIiI,IAAM,KAAK,IAAI,KAAK,EAAE,GAC1B,IAAI,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,MAAMC,GAAI,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,MAClGtB,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI5G,CAAC,CAAC,GAC7FgI,IAAS,KAAK,KAAK,KAAK,IAAI,CAAC,IAAI,KAAK,IAAIhI,CAAC,IAAI,KAAK,IAAI4G,CAAC,CAAC,GAC1DvlB,EAAE,IAAI,KAAK,QAAQ2mB,IAAS,KAAK,MACjCG,IAAMvB,GACNwB,IAAK;AACL,MAAIxV,IAAO;AACX;AACE,IAAAvR,EAAE,IAAI,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,GAAG,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,IAAIulB,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAIuB,CAAG,MAAM,IAAI,KAAK,IAAI,KAAK,IAAIA,CAAG,IAAI,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,MACpM,KAAK,IAAIA,IAAM9mB,EAAE,CAAC,IAAI,UACxB+mB,IAAK,IAEPD,IAAM9mB,EAAE,GACRuR,KAAQ;AAAA,SACDwV,MAAO,KAAKxV,IAAO;AAC5B,SAAIA,KAAQ,KACH,OAGDvR;AACV;AAEO,IAAIoJ,KAAQ,CAAC,UAAU,QAAQ;AACtC,MAAA4d,KAAe;AAAA,EACb,MAAMle;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACzGe,SAAA6d,GAAUC,GAAI9N,GAAI8J,GAAIiE,GAAI3e,GAAK;AAC5C,SAAQ0e,IAAK1e,IAAM4Q,IAAK,KAAK,IAAI,IAAI5Q,CAAG,IAAI0a,IAAK,KAAK,IAAI,IAAI1a,CAAG,IAAI2e,IAAK,KAAK,IAAI,IAAI3e,CAAG;AAC5F;ACFe,SAAA4e,GAAUhf,GAAG;AAC1B,SAAQ,IAAI,OAAOA,KAAK,IAAIA,IAAI,MAAM,IAAI,OAAOA;AACnD;ACFe,SAAAif,GAAUjf,GAAG;AAC1B,SAAQ,QAAQA,KAAK,IAAI,OAAOA,KAAK,IAAI,UAAUA;AACrD;ACFe,SAAAkf,GAAUlf,GAAG;AAC1B,SAAQ,aAAaA,IAAIA,KAAK,IAAI,OAAOA;AAC3C;ACFe,SAAAmf,GAAUnf,GAAG;AAC1B,SAAQA,IAAIA,IAAIA,KAAK,KAAK;AAC5B;ACFe,SAAAof,GAAUznB,GAAG6K,GAAG5C,GAAQ;AACrC,MAAI+W,IAAOnU,IAAI5C;AACf,SAAOjI,IAAI,KAAK,KAAK,IAAIgf,IAAOA,CAAI;AACtC;ACAe,SAAA0I,GAAUrf,GAAG;AAC1B,SAAQ,KAAK,IAAIA,CAAC,IAAI/J,IAAW+J,IAAKA,IAAKD,GAAKC,CAAC,IAAI,KAAK;AAC5D;ACLe,SAAAsf,GAAUjJ,GAAIyI,GAAI9N,GAAI8J,GAAIiE,GAAI;AAC3C,MAAI3e,GACAK;AAEJ,EAAAL,IAAMiW,IAAKyI;AACX,WAAS3nB,IAAI,GAAGA,IAAI,IAAIA;AAGtB,QAFAsJ,KAAQ4V,KAAMyI,IAAK1e,IAAM4Q,IAAK,KAAK,IAAI,IAAI5Q,CAAG,IAAI0a,IAAK,KAAK,IAAI,IAAI1a,CAAG,IAAI2e,IAAK,KAAK,IAAI,IAAI3e,CAAG,OAAO0e,IAAK,IAAI9N,IAAK,KAAK,IAAI,IAAI5Q,CAAG,IAAI,IAAI0a,IAAK,KAAK,IAAI,IAAI1a,CAAG,IAAI,IAAI2e,IAAK,KAAK,IAAI,IAAI3e,CAAG,IAC/LA,KAAOK,GACH,KAAK,IAAIA,CAAI,KAAK;AACpB,aAAOL;AAKX,SAAO;AACT;ACOO,SAASM,KAAO;AACrB,EAAK,KAAK,WACR,KAAK,KAAKse,GAAK,KAAK,EAAE,GACtB,KAAK,KAAKC,GAAK,KAAK,EAAE,GACtB,KAAK,KAAKC,GAAK,KAAK,EAAE,GACtB,KAAK,KAAKC,GAAK,KAAK,EAAE,GACtB,KAAK,MAAM,KAAK,IAAIN,GAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI;AAE1E;AAIO,SAASle,GAAQ/I,GAAG;AAGzB,MAAIoI,GAAGc,GACHye,IAAM3nB,EAAE,GACRwI,IAAMxI,EAAE;AAGZ,MAFA2nB,IAAMtf,EAAWsf,IAAM,KAAK,OAAO,KAAK,IAAI,GAExC,KAAK;AACP,IAAAvf,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,IAAII,CAAG,IAAI,KAAK,IAAImf,CAAG,CAAC,GACpDze,IAAI,KAAK,KAAK,KAAK,MAAM,KAAK,IAAIV,CAAG,GAAG,KAAK,IAAImf,CAAG,CAAC,IAAI,KAAK;AAAA,OACzD;AAEL,QAAI3f,IAAS,KAAK,IAAIQ,CAAG,GACrBP,IAAS,KAAK,IAAIO,CAAG,GACrBof,IAAKJ,GAAG,KAAK,GAAG,KAAK,GAAGxf,CAAM,GAC9B6f,IAAK,KAAK,IAAIrf,CAAG,IAAI,KAAK,IAAIA,CAAG,GACjC4V,IAAKuJ,IAAM,KAAK,IAAInf,CAAG,GACvBsf,IAAM1J,IAAKA,GACX2J,IAAK,KAAK,KAAK9f,IAASA,KAAU,IAAI,KAAK,KAC3CwW,IAAK,KAAK,IAAIwI,GAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAIze,CAAG;AAE9D,IAAAJ,IAAIwf,IAAKxJ,KAAM,IAAI0J,IAAMD,KAAM,IAAI,KAAK,IAAIA,IAAK,IAAIE,KAAMD,IAAM,OACjE5e,IAAIuV,IAAK,KAAK,MAAMmJ,IAAK5f,IAASC,IAAS6f,KAAO,OAAO,IAAID,IAAK,IAAIE,KAAMD,IAAM;AAAA,EACtF;AAEE,SAAA9nB,EAAE,IAAIoI,IAAI,KAAK,IACfpI,EAAE,IAAIkJ,IAAI,KAAK,IACRlJ;AACT;AAIO,SAASmJ,GAAQnJ,GAAG;AACzB,EAAAA,EAAE,KAAK,KAAK,IACZA,EAAE,KAAK,KAAK;AACZ,MAAIoI,IAAIpI,EAAE,IAAI,KAAK,GACfkJ,IAAIlJ,EAAE,IAAI,KAAK,GACfwI,GAAKmf;AAET,MAAI,KAAK,QAAQ;AACf,QAAIK,IAAK9e,IAAI,KAAK;AAClB,IAAAV,IAAM,KAAK,KAAK,KAAK,IAAIwf,CAAE,IAAI,KAAK,IAAI5f,CAAC,CAAC,GAC1Cuf,IAAM,KAAK,MAAM,KAAK,IAAIvf,CAAC,GAAG,KAAK,IAAI4f,CAAE,CAAC;AAAA,EAC9C,OAAS;AAEL,QAAIC,IAAM,KAAK,MAAM,KAAK,IAAI/e,GAC1B6b,IAAO2C,GAAMO,GAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,EAAE;AACxD,QAAI,KAAK,IAAI,KAAK,IAAIlD,CAAI,IAAI1mB,CAAO,KAAKI;AACxC,aAAAuB,EAAE,IAAI,KAAK,OACXA,EAAE,IAAI3B,GACF6K,IAAI,MACNlJ,EAAE,KAAK,KAEFA;AAET,QAAIkoB,IAAMV,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,IAAIzC,CAAI,CAAC,GAEvCoD,IAAMD,IAAMA,IAAMA,IAAM,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KACpDE,IAAM,KAAK,IAAI,KAAK,IAAIrD,CAAI,GAAG,CAAC,GAChCsD,IAAKjgB,IAAI,KAAK,IAAI8f,GAClBI,IAAMD,IAAKA;AACf,IAAA7f,IAAMuc,IAAOmD,IAAM,KAAK,IAAInD,CAAI,IAAIoD,IAAME,IAAKA,KAAM,OAAO,IAAI,IAAID,KAAOC,IAAKA,IAAK,KACrFV,IAAMU,KAAM,IAAIC,KAAOF,IAAM,KAAK,IAAI,IAAIA,KAAOA,IAAME,IAAM,OAAO,KAAK,IAAIvD,CAAI;AAAA,EACrF;AAEE,SAAA/kB,EAAE,IAAIqI,EAAWsf,IAAM,KAAK,OAAO,KAAK,IAAI,GAC5C3nB,EAAE,IAAIynB,GAAWjf,CAAG,GACbxI;AACT;AAEO,IAAIoJ,KAAQ,CAAC,WAAW,mBAAmB,MAAM;AACxD,MAAAmf,KAAe;AAAA,EACb,MAAMzf;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AC/Ge,SAAAof,GAAUzgB,GAAQC,GAAQ;AACvC,MAAIE;AACJ,SAAIH,IAAS,QACXG,IAAMH,IAASC,IACN,IAAID,IAASA,MAAWC,KAAU,IAAIE,IAAMA,KAAQ,MAAMH,IAAU,KAAK,KAAK,IAAIG,MAAQ,IAAIA,EAAI,MAEnG,IAAIF;AAEhB;ACqBO,IAAIygB,KAAS,GACTC,KAAS,GACTC,KAAQ,GACRC,KAAQ;AAMZ,SAAS9f,KAAO;AACrB,MAAI,IAAI,KAAK,IAAI,KAAK,IAAI;AAQ1B,MAPI,KAAK,IAAI,IAAIzK,CAAO,IAAII,IAC1B,KAAK,OAAO,KAAK,OAAO,IAAIgqB,KAASC,KAC5B,KAAK,IAAI,CAAC,IAAIjqB,IACvB,KAAK,OAAOkqB,KAEZ,KAAK,OAAOC,IAEV,KAAK,KAAK,GAAG;AACf,QAAI5gB;AAKJ,YAHA,KAAK,KAAKwgB,GAAM,KAAK,GAAG,CAAC,GACzB,KAAK,MAAM,OAAO,IAAI,KAAK,KAC3B,KAAK,MAAMK,GAAQ,KAAK,EAAE,GAClB,KAAK,MAAI;AAAA,MACf,KAAKH;AACH,aAAK,KAAK;AACV;AAAA,MACF,KAAKD;AACH,aAAK,KAAK;AACV;AAAA,MACF,KAAKE;AACH,aAAK,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,GACjC,KAAK,KAAK,IAAI,KAAK,IACnB,KAAK,MAAM,GACX,KAAK,MAAM,MAAM,KAAK;AACtB;AAAA,MACF,KAAKC;AACH,aAAK,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,GACjC5gB,IAAS,KAAK,IAAI,KAAK,IAAI,GAC3B,KAAK,QAAQwgB,GAAM,KAAK,GAAGxgB,CAAM,IAAI,KAAK,IAC1C,KAAK,QAAQ,KAAK,KAAK,IAAI,KAAK,QAAQ,KAAK,KAAK,GAClD,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAKA,IAASA,CAAM,IAAI,KAAK,KAAK,KAAK,QAC3F,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,KAAK,IACvC,KAAK,OAAO,KAAK;AACjB;AAAA,IACR;AAAA,EACA;AACI,IAAI,KAAK,SAAS4gB,OAChB,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAChC,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI;AAGtC;AAIO,SAAS7f,GAAQ/I,GAAG;AAGzB,MAAIoI,GAAGc,GAAG4f,GAAQC,GAAQ/gB,GAAQghB,GAAGC,GAAMC,GAAMznB,GAAGwG,GAChD0f,IAAM3nB,EAAE,GACRwI,IAAMxI,EAAE;AAGZ,MADA2nB,IAAMtf,EAAWsf,IAAM,KAAK,OAAO,KAAK,IAAI,GACxC,KAAK;AAIP,QAHA3f,IAAS,KAAK,IAAIQ,CAAG,GACrBP,IAAS,KAAK,IAAIO,CAAG,GACrBsgB,IAAS,KAAK,IAAInB,CAAG,GACjB,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS,KAAK,OAAO;AAExD,UADAze,IAAK,KAAK,SAAS,KAAK,QAAS,IAAIjB,IAAS6gB,IAAS,IAAI,KAAK,SAAS9gB,IAAS,KAAK,SAASC,IAAS6gB,GACrG5f,KAAKzK;AACP,eAAO;AAET,MAAAyK,IAAI,KAAK,KAAK,IAAIA,CAAC,GACnBd,IAAIc,IAAIjB,IAAS,KAAK,IAAI0f,CAAG,GAC7Bze,KAAM,KAAK,SAAS,KAAK,QAASlB,IAAS,KAAK,SAASA,IAAS,KAAK,SAASC,IAAS6gB;AAAA,IAC/F,WAAe,KAAK,SAAS,KAAK,UAAU,KAAK,SAAS,KAAK,QAAQ;AAIjE,UAHI,KAAK,SAAS,KAAK,WACrBA,IAAS,CAACA,IAER,KAAK,IAAItgB,IAAM,KAAK,IAAI,IAAI/J;AAC9B,eAAO;AAET,MAAAyK,IAAItK,KAAS4J,IAAM,KACnBU,IAAI,KAAM,KAAK,SAAS,KAAK,SAAU,KAAK,IAAIA,CAAC,IAAI,KAAK,IAAIA,CAAC,IAC/Dd,IAAIc,IAAI,KAAK,IAAIye,CAAG,GACpBze,KAAK4f;AAAA,IACX;AAAA,SACS;AAYL,YAXAG,IAAO,GACPC,IAAO,GACPznB,IAAI,GACJqnB,IAAS,KAAK,IAAInB,CAAG,GACrBoB,IAAS,KAAK,IAAIpB,CAAG,GACrB3f,IAAS,KAAK,IAAIQ,CAAG,GACrBwgB,IAAIR,GAAM,KAAK,GAAGxgB,CAAM,IACpB,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS,KAAK,WACjDihB,IAAOD,IAAI,KAAK,IAChBE,IAAO,KAAK,KAAK,IAAID,IAAOA,CAAI,IAE1B,KAAK,MAAI;AAAA,MACf,KAAK,KAAK;AACR,QAAAxnB,IAAI,IAAI,KAAK,QAAQwnB,IAAO,KAAK,QAAQC,IAAOJ;AAChD;AAAA,MACF,KAAK,KAAK;AACR,QAAArnB,IAAI,IAAIynB,IAAOJ;AACf;AAAA,MACF,KAAK,KAAK;AACR,QAAArnB,IAAIpD,IAAUmK,GACdwgB,IAAI,KAAK,KAAKA;AACd;AAAA,MACF,KAAK,KAAK;AACR,QAAAvnB,IAAI+G,IAAMnK,GACV2qB,IAAI,KAAK,KAAKA;AACd;AAAA,IACR;AACI,QAAI,KAAK,IAAIvnB,CAAC,IAAIhD;AAChB,aAAO;AAET,YAAQ,KAAK,MAAI;AAAA,MACf,KAAK,KAAK;AAAA,MACV,KAAK,KAAK;AACR,QAAAgD,IAAI,KAAK,KAAK,IAAIA,CAAC,GACf,KAAK,SAAS,KAAK,QACrByH,IAAI,KAAK,MAAMzH,KAAK,KAAK,QAAQwnB,IAAO,KAAK,QAAQC,IAAOJ,KAE5D5f,KAAKzH,IAAI,KAAK,KAAK,KAAK,IAAIynB,IAAOJ,EAAO,KAAKG,IAAO,KAAK,KAE7D7gB,IAAI,KAAK,MAAM3G,IAAIynB,IAAOH;AAC1B;AAAA,MACF,KAAK,KAAK;AAAA,MACV,KAAK,KAAK;AACR,QAAIC,KAAK,KACP5gB,KAAK3G,IAAI,KAAK,KAAKunB,CAAC,KAAKD,GACzB7f,IAAI4f,KAAW,KAAK,SAAS,KAAK,SAAUrnB,IAAI,CAACA,MAEjD2G,IAAIc,IAAI;AAEV;AAAA,IACR;AAAA,EACA;AAEE,SAAAlJ,EAAE,IAAI,KAAK,IAAIoI,IAAI,KAAK,IACxBpI,EAAE,IAAI,KAAK,IAAIkJ,IAAI,KAAK,IACjBlJ;AACT;AAIO,SAASmJ,GAAQnJ,GAAG;AACzB,EAAAA,EAAE,KAAK,KAAK,IACZA,EAAE,KAAK,KAAK;AACZ,MAAIoI,IAAIpI,EAAE,IAAI,KAAK,GACfkJ,IAAIlJ,EAAE,IAAI,KAAK,GACf2nB,GAAKnf,GAAK2gB,GAAKC,GAAKJ,GAAGjH,GAAKsH;AAChC,MAAI,KAAK,QAAQ;AACf,QAAIC,IAAO,GACT9G,GAAI+G,IAAO;AAIb,QAFA/G,IAAK,KAAK,KAAKpa,IAAIA,IAAIc,IAAIA,CAAC,GAC5BV,IAAMga,IAAK,KACPha,IAAM;AACR,aAAO;AAOT,YALAA,IAAM,IAAI,KAAK,KAAKA,CAAG,IACnB,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS,KAAK,WACjD+gB,IAAO,KAAK,IAAI/gB,CAAG,GACnB8gB,IAAO,KAAK,IAAI9gB,CAAG,IAEb,KAAK,MAAI;AAAA,MACf,KAAK,KAAK;AACR,QAAAA,IAAO,KAAK,IAAIga,CAAE,KAAK/jB,IAAS,IAAI,KAAK,KAAKyK,IAAIqgB,IAAO/G,CAAE,GAC3Dpa,KAAKmhB,GACLrgB,IAAIogB,IAAO9G;AACX;AAAA,MACF,KAAK,KAAK;AACR,QAAAha,IAAO,KAAK,IAAIga,CAAE,KAAK/jB,IAAS,KAAK,OAAO,KAAK,KAAK6qB,IAAO,KAAK,SAASpgB,IAAIqgB,IAAO,KAAK,SAAS/G,CAAE,GACtGpa,KAAKmhB,IAAO,KAAK,QACjBrgB,KAAKogB,IAAO,KAAK,IAAI9gB,CAAG,IAAI,KAAK,UAAUga;AAC3C;AAAA,MACF,KAAK,KAAK;AACR,QAAAtZ,IAAI,CAACA,GACLV,IAAMnK,IAAUmK;AAChB;AAAA,MACF,KAAK,KAAK;AACR,QAAAA,KAAOnK;AACP;AAAA,IACR;AACI,IAAAspB,IAAOze,MAAM,MAAM,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS,KAAK,SAAU,IAAI,KAAK,MAAMd,GAAGc,CAAC;AAAA,EACnG,OAAS;AAEL,QADAmgB,IAAK,GACD,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS,KAAK,OAAO;AAIxD,UAHAjhB,KAAK,KAAK,IACVc,KAAK,KAAK,IACV6Y,IAAM,KAAK,KAAK3Z,IAAIA,IAAIc,IAAIA,CAAC,GACzB6Y,IAAMtjB;AACR,eAAAuB,EAAE,IAAI,KAAK,OACXA,EAAE,IAAI,KAAK,MACJA;AAET,MAAAopB,IAAM,IAAI,KAAK,KAAK,MAAMrH,IAAM,KAAK,EAAE,GACvCoH,IAAM,KAAK,IAAIC,CAAG,GAClBhhB,KAAMghB,IAAM,KAAK,IAAIA,CAAG,GACpB,KAAK,SAAS,KAAK,SACrBC,IAAKF,IAAM,KAAK,QAAQjgB,IAAIkgB,IAAM,KAAK,QAAQrH,GAC/CiH,IAAI,KAAK,KAAKK,GACdngB,IAAI6Y,IAAM,KAAK,QAAQoH,IAAMjgB,IAAI,KAAK,QAAQkgB,MAE9CC,IAAKngB,IAAIkgB,IAAMrH,GACfiH,IAAI,KAAK,KAAKK,GACdngB,IAAI6Y,IAAMoH;AAAA,IAElB,WAAe,KAAK,SAAS,KAAK,UAAU,KAAK,SAAS,KAAK,QAAQ;AAKjE,UAJI,KAAK,SAAS,KAAK,WACrBjgB,IAAI,CAACA,IAEP8f,IAAK5gB,IAAIA,IAAIc,IAAIA,GACb,CAAC8f;AACH,eAAAhpB,EAAE,IAAI,KAAK,OACXA,EAAE,IAAI,KAAK,MACJA;AAET,MAAAqpB,IAAK,IAAIL,IAAI,KAAK,IACd,KAAK,SAAS,KAAK,WACrBK,IAAK,CAACA;AAAA,IAEd;AACI,IAAA1B,IAAM,KAAK,MAAMvf,GAAGc,CAAC,GACrBV,IAAMghB,GAAQ,KAAK,KAAKH,CAAE,GAAG,KAAK,GAAG;AAAA,EACzC;AAEE,SAAArpB,EAAE,IAAIqI,EAAW,KAAK,QAAQsf,GAAK,KAAK,IAAI,GAC5C3nB,EAAE,IAAIwI,GACCxI;AACT;AAGA,IAAIypB,KAAM,oBAENC,KAAM,qBACNC,KAAM,qBACNC,KAAM,qBACNC,KAAM,oBACNC,KAAM;AAEV,SAASjB,GAAQle,GAAI;AACnB,MAAIsJ,GACA8V,IAAM,CAAA;AACV,SAAAA,EAAI,CAAC,IAAIpf,IAAK8e,IACdxV,IAAItJ,IAAKA,GACTof,EAAI,CAAC,KAAK9V,IAAIyV,IACdK,EAAI,CAAC,IAAI9V,IAAI2V,IACb3V,KAAKtJ,GACLof,EAAI,CAAC,KAAK9V,IAAI0V,IACdI,EAAI,CAAC,KAAK9V,IAAI4V,IACdE,EAAI,CAAC,IAAI9V,IAAI6V,IACNC;AACT;AAEA,SAASP,GAAQQ,GAAMD,GAAK;AAC1B,MAAI9V,IAAI+V,IAAOA;AACf,SAAQA,IAAOD,EAAI,CAAC,IAAI,KAAK,IAAI9V,CAAC,IAAI8V,EAAI,CAAC,IAAI,KAAK,IAAI9V,IAAIA,CAAC,IAAI8V,EAAI,CAAC,IAAI,KAAK,IAAI9V,IAAIA,IAAIA,CAAC;AAC9F;AAEO,IAAI7K,KAAQ,CAAC,gCAAgC,gCAAgC,MAAM;AAC1F,MAAA6gB,KAAe;AAAA,EACb,MAAMnhB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AAAAA,EACP,QAAQqf;AAAA,EACR,QAAQC;AAAA,EACR,OAAOC;AAAA,EACP,OAAOC;AACT;AChTe,SAAAsB,GAAU9hB,GAAG;AAC1B,SAAI,KAAK,IAAIA,CAAC,IAAI,MAChBA,IAAKA,IAAI,IAAK,IAAI,KAEb,KAAK,KAAKA,CAAC;AACpB;ACyBO,SAASU,KAAO;AACrB,EAAI,KAAK,IAAI,KAAK,OAAO,KAAK,IAAI,IAAIrK,MAGtC,KAAK,OAAO,KAAK,IAAI,KAAK,GAC1B,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,GACnC,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE,GAE3B,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAChC,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAChC,KAAK,KAAK,KAAK,QACf,KAAK,MAAM,KAAK,QAChB,KAAK,MAAMqJ,GAAM,KAAK,IAAI,KAAK,QAAQ,KAAK,MAAM,GAClD,KAAK,MAAM0gB,GAAM,KAAK,IAAI,KAAK,MAAM,GAErC,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAChC,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAChC,KAAK,KAAK,KAAK,QACf,KAAK,MAAM1gB,GAAM,KAAK,IAAI,KAAK,QAAQ,KAAK,MAAM,GAClD,KAAK,MAAM0gB,GAAM,KAAK,IAAI,KAAK,MAAM,GAErC,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAChC,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAChC,KAAK,KAAK,KAAK,QACf,KAAK,MAAMA,GAAM,KAAK,IAAI,KAAK,MAAM,GAEjC,KAAK,IAAI,KAAK,OAAO,KAAK,IAAI,IAAI/pB,IACpC,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,QAAQ,KAAK,MAAM,KAAK,OAE1E,KAAK,MAAM,KAAK,KAElB,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,KAC/C,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,KAAK,GAAG,IAAI,KAAK;AACpE;AAKO,SAASsK,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE;AAEZ,OAAK,UAAU,KAAK,IAAIiJ,CAAG,GAC3B,KAAK,UAAU,KAAK,IAAIA,CAAG;AAE3B,MAAIkhB,IAAK3B,GAAM,KAAK,IAAI,KAAK,OAAO,GAChCjC,IAAM,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM4D,CAAE,IAAI,KAAK,KACxD3D,IAAQ,KAAK,MAAMne,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GACzDZ,IAAIme,IAAM,KAAK,IAAIC,CAAK,IAAI,KAAK,IACjCtd,IAAI,KAAK,KAAKqd,IAAM,KAAK,IAAIC,CAAK,IAAI,KAAK;AAE/C,SAAAxmB,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GACClJ;AACT;AAEO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIumB,GAAK4D,GAAIjiB,GAAKse,GAAOxd,GAAKC;AAE9B,SAAAjJ,EAAE,KAAK,KAAK,IACZA,EAAE,IAAI,KAAK,KAAKA,EAAE,IAAI,KAAK,IACvB,KAAK,OAAO,KACdumB,IAAM,KAAK,KAAKvmB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,GACrCkI,IAAM,MAENqe,IAAM,CAAC,KAAK,KAAKvmB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,GACtCkI,IAAM,KAERse,IAAQ,GACJD,MAAQ,MACVC,IAAQ,KAAK,MAAMte,IAAMlI,EAAE,GAAGkI,IAAMlI,EAAE,CAAC,IAEzCkI,IAAMqe,IAAM,KAAK,MAAM,KAAK,GACxB,KAAK,SACPtd,IAAM,KAAK,MAAM,KAAK,IAAIf,IAAMA,MAAQ,IAAI,KAAK,IAAI,KAErDiiB,KAAM,KAAK,IAAIjiB,IAAMA,KAAO,KAAK,KACjCe,IAAM,KAAK,MAAM,KAAK,IAAIkhB,CAAE,IAG9BnhB,IAAMX,EAAWme,IAAQ,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,GACzDxmB,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AACT;AAKO,SAASoqB,GAAMriB,GAAQoiB,GAAI;AAChC,MAAIniB,GAAQC,GAAQC,GAAKO,GAAKI,GAC1BL,IAAM0hB,GAAM,MAAMC,CAAE;AACxB,MAAIpiB,IAAStJ;AACX,WAAO+J;AAIT,WADI6hB,IAAStiB,IAASA,GACbxI,IAAI,GAAGA,KAAK,IAAIA;AAOvB,QANAyI,IAAS,KAAK,IAAIQ,CAAG,GACrBP,IAAS,KAAK,IAAIO,CAAG,GACrBN,IAAMH,IAASC,GACfS,IAAM,IAAIP,IAAMA,GAChBW,IAAO,MAAMJ,IAAMA,IAAMR,KAAUkiB,KAAM,IAAIE,KAAUriB,IAASS,IAAM,MAAMV,IAAS,KAAK,KAAK,IAAIG,MAAQ,IAAIA,EAAI,IACnHM,IAAMA,IAAMK,GACR,KAAK,IAAIA,CAAI,KAAK;AACpB,aAAOL;AAGX,SAAO;AACT;AAEO,IAAIY,KAAQ,CAAC,2BAA2B,qBAAqB,UAAU,KAAK;AACnF,MAAAkhB,KAAe;AAAA,EACb,MAAMxhB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AAAAA,EACP,OAAOghB;AACT;ACjIO,SAASthB,KAAO;AAGrB,OAAK,UAAU,KAAK,IAAI,KAAK,IAAI,GACjC,KAAK,UAAU,KAAK,IAAI,KAAK,IAAI,GAEjC,KAAK,gBAAgB,MAAO,KAAK,GACjC,KAAK,KAAK;AACZ;AAIO,SAASC,GAAQ/I,GAAG;AACzB,MAAIgI,GAAQC,GACRwa,GACA8H,GACAC,GACA1L,GACA1W,GAAGc,GACHF,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE;AAGZ,SAAAyiB,IAAOpa,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GAE7ChB,IAAS,KAAK,IAAIiB,CAAG,GACrBhB,IAAS,KAAK,IAAIgB,CAAG,GAErBshB,IAAS,KAAK,IAAI9H,CAAI,GACtB3D,IAAI,KAAK,UAAU9W,IAAS,KAAK,UAAUC,IAASsiB,GACpDC,IAAM,GACD1L,IAAI,KAAO,KAAK,IAAIA,CAAC,KAAKrgB,KAC7B2J,IAAI,KAAK,KAAK,KAAK,IAAIoiB,IAAMviB,IAAS,KAAK,IAAIwa,CAAI,IAAI3D,GACvD5V,IAAI,KAAK,KAAK,KAAK,IAAIshB,KAAO,KAAK,UAAUxiB,IAAS,KAAK,UAAUC,IAASsiB,KAAUzL,MASxF1W,IAAI,KAAK,KAAK,KAAK,gBAAgBH,IAAS,KAAK,IAAIwa,CAAI,GACzDvZ,IAAI,KAAK,KAAK,KAAK,iBAAiB,KAAK,UAAUlB,IAAS,KAAK,UAAUC,IAASsiB,KAEtFvqB,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GACClJ;AACT;AAEO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIwiB,GACAZ,GAAMC,GACNvD,GACAtV,GAAKC;AAIT,SAAAjJ,EAAE,KAAKA,EAAE,IAAI,KAAK,MAAM,KAAK,GAC7BA,EAAE,KAAKA,EAAE,IAAI,KAAK,MAAM,KAAK,GAE7BA,EAAE,KAAK,KAAK,IACZA,EAAE,KAAK,KAAK,KAEPwiB,IAAK,KAAK,KAAKxiB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,MACvCse,IAAI,KAAK,MAAMkE,GAAI,KAAK,EAAE,GAC1BZ,IAAO,KAAK,IAAItD,CAAC,GACjBuD,IAAO,KAAK,IAAIvD,CAAC,GAEjBrV,IAAMihB,GAAMrI,IAAO,KAAK,UAAW7hB,EAAE,IAAI4hB,IAAO,KAAK,UAAWY,CAAE,GAClExZ,IAAM,KAAK,MAAMhJ,EAAE,IAAI4hB,GAAMY,IAAK,KAAK,UAAUX,IAAO7hB,EAAE,IAAI,KAAK,UAAU4hB,CAAI,GACjF5Y,IAAMX,EAAW,KAAK,QAAQW,GAAK,KAAK,IAAI,MAE5CC,IAAM,KAAK,OACXD,IAAM,IAGRhJ,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,MAAM;AAC1B,MAAAqhB,KAAe;AAAA,EACb,MAAM3hB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACzGe,SAAAshB,GAAU3iB,GAAQihB,GAAG;AAClC,MAAIjK,IAAO,KAAK,IAAIhX,IAASA,MAAW,IAAIA,KAAU,KAAK,KAAK,IAAIA,MAAW,IAAIA,EAAO;AAC1F,MAAI,KAAK,IAAI,KAAK,IAAIihB,CAAC,IAAIjK,CAAI,IAAI;AACjC,WAAIiK,IAAI,IACE,KAAK3qB,IAENA;AASX,WALImK,IAAM,KAAK,KAAK,MAAMwgB,CAAC,GACvBngB,GACAqV,GACAC,GACAjW,GACK3I,IAAI,GAAGA,IAAI,IAAIA;AAMtB,QALA2e,IAAU,KAAK,IAAI1V,CAAG,GACtB2V,IAAU,KAAK,IAAI3V,CAAG,GACtBN,IAAMH,IAASmW,GACfrV,IAAO,KAAK,IAAI,IAAIX,IAAMA,GAAK,CAAC,KAAK,IAAIiW,MAAY6K,KAAK,IAAIjhB,IAASA,KAAUmW,KAAW,IAAIhW,IAAMA,KAAO,MAAMH,IAAS,KAAK,KAAK,IAAIG,MAAQ,IAAIA,EAAI,IAC1JM,KAAOK,GACH,KAAK,IAAIA,CAAI,KAAK;AACpB,aAAOL;AAKX,SAAO;AACT;ACbO,SAASM,KAAO;AAErB,EAAK,KAAK,WACR,KAAK,KAAKhB,GAAM,KAAK,GAAG,KAAK,IAAI,KAAK,MAAM,GAAG,KAAK,IAAI,KAAK,MAAM,CAAC;AAExE;AAIO,SAASiB,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GACRoI,GAAGc,GAGHuZ,IAAOpa,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI;AACjD,MAAI,KAAK;AACP,IAAAZ,IAAI,KAAK,KAAK,KAAK,IAAIqa,IAAO,KAAK,IAAI,KAAK,MAAM,GAClDvZ,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAID,CAAG,IAAI,KAAK,IAAI,KAAK,MAAM;AAAA,OACtD;AACL,QAAIkhB,IAAK3B,GAAM,KAAK,GAAG,KAAK,IAAIvf,CAAG,CAAC;AACpC,IAAAb,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAKqa,GACjCvZ,IAAI,KAAK,KAAK,KAAK,IAAIihB,IAAK,MAAM,KAAK;AAAA,EAC3C;AAEE,SAAAnqB,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GACClJ;AACT;AAIO,SAASmJ,GAAQnJ,GAAG;AACzB,EAAAA,EAAE,KAAK,KAAK,IACZA,EAAE,KAAK,KAAK;AACZ,MAAIgJ,GAAKC;AAET,SAAI,KAAK,UACPD,IAAMX,EAAW,KAAK,QAASrI,EAAE,IAAI,KAAK,IAAK,KAAK,IAAI,KAAK,MAAM,GAAG,KAAK,IAAI,GAC/EiJ,IAAM,KAAK,KAAMjJ,EAAE,IAAI,KAAK,IAAK,KAAK,IAAI,KAAK,MAAM,CAAC,MAEtDiJ,IAAMyhB,GAAO,KAAK,GAAG,IAAI1qB,EAAE,IAAI,KAAK,KAAK,KAAK,CAAC,GAC/CgJ,IAAMX,EAAW,KAAK,QAAQrI,EAAE,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,IAGnEA,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,KAAK;AACzB,MAAAuhB,KAAe;AAAA,EACb,MAAM7hB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACtEO,SAASN,KAAO;AACrB,OAAK,KAAK,KAAK,MAAM,GACrB,KAAK,KAAK,KAAK,MAAM,GACrB,KAAK,OAAO,KAAK,QAAQ,GACzB,KAAK,QAAQ,KAAK,SAAS,GAC3B,KAAK,SAAS,KAAK,UAAU,GAC7B,KAAK,QAAQ,KAAK,SAAS,yCAE3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM;AAChC;AAIO,SAASC,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GAERyiB,IAAOpa,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GAC7C4hB,IAAOnD,GAAWxe,IAAM,KAAK,IAAI;AACrC,SAAAjJ,EAAE,IAAI,KAAK,KAAM,KAAK,IAAIyiB,IAAO,KAAK,IACtCziB,EAAE,IAAI,KAAK,KAAM,KAAK,IAAI4qB,GACnB5qB;AACT;AAIO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIoI,IAAIpI,EAAE,GACNkJ,IAAIlJ,EAAE;AAEV,SAAAA,EAAE,IAAIqI,EAAW,KAAK,SAAUD,IAAI,KAAK,OAAO,KAAK,IAAI,KAAK,KAAM,KAAK,IAAI,GAC7EpI,EAAE,IAAIynB,GAAW,KAAK,QAASve,IAAI,KAAK,MAAO,KAAK,CAAG,GAChDlJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,mBAAmB,2BAA2B,qCAAqC,KAAK;AAC5G,MAAAyhB,KAAe;AAAA,EACb,MAAM/hB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACrBA,IAAIwU,KAAW;AAGR,SAAS9U,KAAO;AAGrB,OAAK,OAAO,KAAK,IAAI,KAAK,GAC1B,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,GACnC,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE,GAC1B,KAAK,KAAKse,GAAK,KAAK,EAAE,GACtB,KAAK,KAAKC,GAAK,KAAK,EAAE,GACtB,KAAK,KAAKC,GAAK,KAAK,EAAE,GACtB,KAAK,KAAKC,GAAK,KAAK,EAAE,GACtB,KAAK,MAAM,KAAK,IAAIN,GAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI;AACxE;AAIO,SAASle,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GACRoI,GAAGc,GAAG4hB,GACNrI,IAAOpa,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI;AAEjD,MADA8hB,IAAKrI,IAAO,KAAK,IAAIxZ,CAAG,GACpB,KAAK;AACP,IAAI,KAAK,IAAIA,CAAG,KAAKxK,KACnB2J,IAAI,KAAK,IAAIqa,GACbvZ,IAAI,KAAK,KAAK,IAAI,KAAK,SAEvBd,IAAI,KAAK,IAAI,KAAK,IAAI0iB,CAAE,IAAI,KAAK,IAAI7hB,CAAG,GACxCC,IAAI,KAAK,KAAKue,GAAWxe,IAAM,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI6hB,CAAE,KAAK,KAAK,IAAI7hB,CAAG;AAAA,WAG3E,KAAK,IAAIA,CAAG,KAAKxK;AACnB,IAAA2J,IAAI,KAAK,IAAIqa,GACbvZ,IAAI,KAAK,KAAK;AAAA,OACT;AACL,QAAI0e,IAAKJ,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,IAAIve,CAAG,CAAC,IAAI,KAAK,IAAIA,CAAG;AACzD,IAAAb,IAAIwf,IAAK,KAAK,IAAIkD,CAAE,GACpB5hB,IAAI,KAAK,IAAI+d,GAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAIhe,CAAG,IAAI,KAAK,MAAM2e,KAAM,IAAI,KAAK,IAAIkD,CAAE;AAAA,EACnG;AAEE,SAAA9qB,EAAE,IAAIoI,IAAI,KAAK,IACfpI,EAAE,IAAIkJ,IAAI,KAAK,IACRlJ;AACT;AAIO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIgJ,GAAKC,GAAKb,GAAGc,GAAG3J,GAChB6e,GAAI2M,GACJviB,GAAKK;AAIT,MAHAT,IAAIpI,EAAE,IAAI,KAAK,IACfkJ,IAAIlJ,EAAE,IAAI,KAAK,IAEX,KAAK;AACP,QAAI,KAAK,IAAIkJ,IAAI,KAAK,IAAI,KAAK,IAAI,KAAKzK;AACtC,MAAAuK,IAAMX,EAAWD,IAAI,KAAK,IAAI,KAAK,OAAO,KAAK,IAAI,GACnDa,IAAM;AAAA,SACD;AACL,MAAAmV,IAAK,KAAK,OAAOlV,IAAI,KAAK,GAC1B6hB,IAAK3iB,IAAIA,IAAI,KAAK,IAAI,KAAK,IAAIgW,IAAKA,GACpC5V,IAAM4V;AACN,UAAI4M;AACJ,WAAKzrB,IAAIqe,IAAUre,GAAG,EAAEA;AAItB,YAHAyrB,IAAS,KAAK,IAAIxiB,CAAG,GACrBK,IAAO,MAAMuV,KAAM5V,IAAMwiB,IAAS,KAAKxiB,IAAM,OAAOA,IAAMA,IAAMuiB,KAAMC,OAAYxiB,IAAM4V,KAAM4M,IAAS,IACvGxiB,KAAOK,GACH,KAAK,IAAIA,CAAI,KAAKpK,GAAO;AAC3B,UAAAwK,IAAMT;AACN;AAAA,QACV;AAEM,MAAAQ,IAAMX,EAAW,KAAK,QAAS,KAAK,KAAKD,IAAI,KAAK,IAAII,CAAG,IAAI,KAAK,CAAC,IAAK,KAAK,IAAIS,CAAG,GAAG,KAAK,IAAI;AAAA,IACtG;AAAA,WAEQ,KAAK,IAAIC,IAAI,KAAK,GAAG,KAAKzK;AAC5B,IAAAwK,IAAM,GACND,IAAMX,EAAW,KAAK,QAAQD,IAAI,KAAK,GAAG,KAAK,IAAI;AAAA,OAC9C;AACL,IAAAgW,KAAM,KAAK,MAAMlV,KAAK,KAAK,GAC3B6hB,IAAK3iB,IAAIA,IAAI,KAAK,IAAI,KAAK,IAAIgW,IAAKA,GACpC5V,IAAM4V;AACN,QAAI2J,GAAIkD,GAAKC,GAAMC,GACfjjB;AACJ,SAAK3I,IAAIqe,IAAUre,GAAG,EAAEA;AAQtB,UAPA2I,IAAM,KAAK,IAAI,KAAK,IAAIM,CAAG,GAC3Buf,IAAK,KAAK,KAAK,IAAI7f,IAAMA,CAAG,IAAI,KAAK,IAAIM,CAAG,GAC5CyiB,IAAM,KAAK,IAAIhE,GAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAIze,CAAG,GAC3D0iB,IAAO,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,IAAI1iB,CAAG,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,IAAIA,CAAG,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,IAAIA,CAAG,GACnH2iB,IAAKF,IAAM,KAAK,GAChBpiB,KAAQuV,KAAM2J,IAAKoD,IAAK,KAAKA,IAAK,MAAMpD,KAAMoD,IAAKA,IAAKJ,OAAQ,KAAK,KAAK,KAAK,IAAI,IAAIviB,CAAG,KAAK2iB,IAAKA,IAAKJ,IAAK,IAAI3M,IAAK+M,MAAO,IAAIpD,MAAO3J,IAAK+M,MAAOpD,IAAKmD,IAAO,IAAI,KAAK,IAAI,IAAI1iB,CAAG,KAAK0iB,IAC1L1iB,KAAOK,GACH,KAAK,IAAIA,CAAI,KAAKpK,GAAO;AAC3B,QAAAwK,IAAMT;AACN;AAAA,MACV;AAIM,IAAAuf,IAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI9e,CAAG,GAAG,CAAC,CAAC,IAAI,KAAK,IAAIA,CAAG,GACvED,IAAMX,EAAW,KAAK,QAAQ,KAAK,KAAKD,IAAI2f,IAAK,KAAK,CAAC,IAAI,KAAK,IAAI9e,CAAG,GAAG,KAAK,IAAI;AAAA,EACzF;AAGE,SAAAjJ,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,aAAa,sBAAsB,MAAM;AAC7D,MAAAgiB,KAAe;AAAA,EACb,MAAMtiB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AC1HO,SAASN,KAAO;AACrB,OAAK,IAAI,CAAA,GACT,KAAK,EAAE,CAAC,IAAI,cACZ,KAAK,EAAE,CAAC,IAAI,eACZ,KAAK,EAAE,CAAC,IAAI,aACZ,KAAK,EAAE,CAAC,IAAI,aACZ,KAAK,EAAE,CAAC,IAAI,WACZ,KAAK,EAAE,CAAC,IAAI,WACZ,KAAK,EAAE,CAAC,IAAI,UACZ,KAAK,EAAE,CAAC,IAAI,UACZ,KAAK,EAAE,CAAC,IAAI,OACZ,KAAK,EAAE,EAAE,IAAI,QAEb,KAAK,OAAO,CAAA,GACZ,KAAK,OAAO,CAAA,GACZ,KAAK,KAAK,CAAC,IAAI,cACf,KAAK,KAAK,CAAC,IAAI,GACf,KAAK,KAAK,CAAC,IAAI,aACf,KAAK,KAAK,CAAC,IAAI,YACf,KAAK,KAAK,CAAC,IAAI,aACf,KAAK,KAAK,CAAC,IAAI,YACf,KAAK,KAAK,CAAC,IAAI,aACf,KAAK,KAAK,CAAC,IAAI,YACf,KAAK,KAAK,CAAC,IAAI,aACf,KAAK,KAAK,CAAC,IAAI,aACf,KAAK,KAAK,CAAC,IAAI,YACf,KAAK,KAAK,CAAC,IAAI,YAEf,KAAK,OAAO,CAAA,GACZ,KAAK,OAAO,CAAA,GACZ,KAAK,KAAK,CAAC,IAAI,cACf,KAAK,KAAK,CAAC,IAAI,GACf,KAAK,KAAK,CAAC,IAAI,cACf,KAAK,KAAK,CAAC,IAAI,aACf,KAAK,KAAK,CAAC,IAAI,aACf,KAAK,KAAK,CAAC,IAAI,cACf,KAAK,KAAK,CAAC,IAAI,aACf,KAAK,KAAK,CAAC,IAAI,YACf,KAAK,KAAK,CAAC,IAAI,YACf,KAAK,KAAK,CAAC,IAAI,YACf,KAAK,KAAK,CAAC,IAAI,WACf,KAAK,KAAK,CAAC,IAAI,WAEf,KAAK,IAAI,CAAA,GACT,KAAK,EAAE,CAAC,IAAI,cACZ,KAAK,EAAE,CAAC,IAAI,cACZ,KAAK,EAAE,CAAC,IAAI,aACZ,KAAK,EAAE,CAAC,IAAI,YACZ,KAAK,EAAE,CAAC,IAAI,YACZ,KAAK,EAAE,CAAC,IAAI,SACZ,KAAK,EAAE,CAAC,IAAI,QACZ,KAAK,EAAE,CAAC,IAAI,QACZ,KAAK,EAAE,CAAC,IAAI;AACd;AAMO,SAASC,GAAQ/I,GAAG;AACzB,MAAI8J,GACAd,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GAERqrB,IAAYpiB,IAAM,KAAK,MACvBgV,IAAYjV,IAAM,KAAK,OAIvBsiB,IAAQD,IAAYjtB,KAAa,MACjCmtB,IAAWtN,GACXuN,IAAU,GAEVC,IAAQ;AACZ,OAAK3hB,IAAI,GAAGA,KAAK,IAAIA;AACnB,IAAA0hB,IAAUA,IAAUF,GACpBG,IAAQA,IAAQ,KAAK,EAAE3hB,CAAC,IAAI0hB;AAI9B,MAAIE,IAAQD,GACRE,IAAQJ,GAGRK,IAAU,GACVC,IAAU,GACVC,GACAC,GAEAC,IAAO,GACPC,IAAO;AACX,OAAKniB,IAAI,GAAGA,KAAK,GAAGA;AAClB,IAAAgiB,IAAWF,IAAUF,IAAQG,IAAUF,GACvCI,IAAWF,IAAUH,IAAQE,IAAUD,GACvCC,IAAUE,GACVD,IAAUE,GACVC,IAAOA,IAAO,KAAK,KAAKliB,CAAC,IAAI8hB,IAAU,KAAK,KAAK9hB,CAAC,IAAI+hB,GACtDI,IAAOA,IAAO,KAAK,KAAKniB,CAAC,IAAI8hB,IAAU,KAAK,KAAK9hB,CAAC,IAAI+hB;AAIxD,SAAA7rB,EAAE,IAAKisB,IAAO,KAAK,IAAK,KAAK,IAC7BjsB,EAAE,IAAKgsB,IAAO,KAAK,IAAK,KAAK,IAEtBhsB;AACT;AAKO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAI8J,GACA1B,IAAIpI,EAAE,GACNkJ,IAAIlJ,EAAE,GAENksB,IAAU9jB,IAAI,KAAK,IACnB+jB,IAAUjjB,IAAI,KAAK,IAGnB8iB,IAAOG,IAAU,KAAK,GACtBF,IAAOC,IAAU,KAAK,GAGtBE,IAAS,GACTC,IAAS,GACTC,GACAC,GAEAb,IAAQ,GACRC,IAAQ;AACZ,OAAK7hB,IAAI,GAAGA,KAAK,GAAGA;AAClB,IAAAwiB,IAAUF,IAASJ,IAAOK,IAASJ,GACnCM,IAAUF,IAASL,IAAOI,IAASH,GACnCG,IAASE,GACTD,IAASE,GACTb,IAAQA,IAAQ,KAAK,KAAK5hB,CAAC,IAAIsiB,IAAS,KAAK,KAAKtiB,CAAC,IAAIuiB,GACvDV,IAAQA,IAAQ,KAAK,KAAK7hB,CAAC,IAAIsiB,IAAS,KAAK,KAAKtiB,CAAC,IAAIuiB;AAOzD,WAAS9sB,IAAI,GAAGA,IAAI,KAAK,YAAYA,KAAK;AACxC,QAAIqsB,IAAUF,GACVG,IAAUF,GACVG,GACAC,GAEAS,IAASR,GACTS,IAASR;AACb,SAAKniB,IAAI,GAAGA,KAAK,GAAGA;AAClB,MAAAgiB,IAAWF,IAAUF,IAAQG,IAAUF,GACvCI,IAAWF,IAAUH,IAAQE,IAAUD,GACvCC,IAAUE,GACVD,IAAUE,GACVS,IAASA,KAAU1iB,IAAI,MAAM,KAAK,KAAKA,CAAC,IAAI8hB,IAAU,KAAK,KAAK9hB,CAAC,IAAI+hB,IACrEY,IAASA,KAAU3iB,IAAI,MAAM,KAAK,KAAKA,CAAC,IAAI8hB,IAAU,KAAK,KAAK9hB,CAAC,IAAI+hB;AAGvE,IAAAD,IAAU,GACVC,IAAU;AACV,QAAIa,IAAS,KAAK,KAAK,CAAC,GACpBC,IAAS,KAAK,KAAK,CAAC;AACxB,SAAK7iB,IAAI,GAAGA,KAAK,GAAGA;AAClB,MAAAgiB,IAAWF,IAAUF,IAAQG,IAAUF,GACvCI,IAAWF,IAAUH,IAAQE,IAAUD,GACvCC,IAAUE,GACVD,IAAUE,GACVW,IAASA,IAAS5iB,KAAK,KAAK,KAAKA,CAAC,IAAI8hB,IAAU,KAAK,KAAK9hB,CAAC,IAAI+hB,IAC/Dc,IAASA,IAAS7iB,KAAK,KAAK,KAAKA,CAAC,IAAI8hB,IAAU,KAAK,KAAK9hB,CAAC,IAAI+hB;AAIjE,QAAIe,IAAOF,IAASA,IAASC,IAASA;AACtC,IAAAjB,KAASc,IAASE,IAASD,IAASE,KAAUC,GAC9CjB,KAASc,IAASC,IAASF,IAASG,KAAUC;AAAA,EAClD;AAGE,MAAInB,IAAQC,GACRH,KAAWI,GACXkB,KAAU,GAEVvB,KAAQ;AACZ,OAAKxhB,IAAI,GAAGA,KAAK,GAAGA;AAClB,IAAA+iB,KAAUA,KAAUpB,GACpBH,KAAQA,KAAQ,KAAK,EAAExhB,CAAC,IAAI+iB;AAK9B,MAAI5jB,KAAM,KAAK,OAAQqiB,KAAQltB,KAAa,KACxC4K,KAAM,KAAK,QAAQuiB;AAEvB,SAAAvrB,EAAE,IAAIgJ,IACNhJ,EAAE,IAAIiJ,IAECjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,wBAAwB,MAAM;AAClD,MAAA0jB,KAAe;AAAA,EACb,MAAMhkB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACvNO,SAASN,KAAO;AAEvB;AAIO,SAASC,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GAGRyiB,IAAOpa,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GAC7CZ,IAAI,KAAK,KAAK,KAAK,IAAIqa,GACvBvZ,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAK,KAAK,KAAK,IAAMD,IAAM,GAAI,CAAC,IAAI;AAE7E,SAAAjJ,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GACClJ;AACT;AAIO,SAASmJ,GAAQnJ,GAAG;AACzB,EAAAA,EAAE,KAAK,KAAK,IACZA,EAAE,KAAK,KAAK;AAEZ,MAAIgJ,IAAMX,EAAW,KAAK,QAAQrI,EAAE,IAAI,KAAK,GAAG,KAAK,IAAI,GACrDiJ,IAAM,OAAO,KAAK,KAAK,KAAK,IAAI,MAAMjJ,EAAE,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,KAAK;AAErE,SAAAA,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,sBAAsB,MAAM;AAChD,MAAA2jB,KAAe;AAAA,EACb,MAAMjkB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AC/CA,IAAIwU,KAAW;AAkBR,SAAS9U,KAAO;AAIrB,EAAK,KAAK,UAGR,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,KAAK,GACV,KAAK,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,CAAC,GAC1C,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,MANhC,KAAK,KAAKyU,GAAQ,KAAK,EAAE;AAQ7B;AAIO,SAASxU,GAAQ/I,GAAG;AACzB,MAAIoI,GAAGc,GACHF,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE;AAKZ,MAFAgJ,IAAMX,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GAExC,KAAK,QAAQ;AACf,QAAI,CAAC,KAAK;AACR,MAAAC,IAAM,KAAK,MAAM,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAIA,CAAG,CAAC,IAAIA;AAAA;AAGzD,eADI8U,IAAI,KAAK,IAAI,KAAK,IAAI9U,CAAG,GACpB1J,IAAIqe,IAAUre,GAAG,EAAEA,GAAG;AAC7B,YAAI6X,KAAK,KAAK,IAAInO,IAAM,KAAK,IAAIA,CAAG,IAAI8U,MAAM,KAAK,IAAI,KAAK,IAAI9U,CAAG;AAEnE,YADAA,KAAOmO,GACH,KAAK,IAAIA,CAAC,IAAI3Y;AAChB;AAAA,MAEV;AAEI,IAAA2J,IAAI,KAAK,IAAI,KAAK,MAAMY,KAAO,KAAK,IAAI,KAAK,IAAIC,CAAG,IACpDC,IAAI,KAAK,IAAI,KAAK,MAAMD;AAAA,EAC5B,OAAS;AACL,QAAI+U,IAAI,KAAK,IAAI/U,CAAG,GAChBqV,IAAI,KAAK,IAAIrV,CAAG;AACpB,IAAAC,IAAI,KAAK,IAAIuU,GAAQxU,GAAK+U,GAAGM,GAAG,KAAK,EAAE,GACvClW,IAAI,KAAK,IAAIY,IAAMsV,IAAI,KAAK,KAAK,IAAI,KAAK,KAAKN,IAAIA,CAAC;AAAA,EACxD;AAEE,SAAAhe,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GACClJ;AACT;AAEO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIiJ,GAAK8V,GAAM/V,GAAKgV;AAEpB,SAAAhe,EAAE,KAAK,KAAK,IACZgJ,IAAMhJ,EAAE,IAAI,KAAK,GACjBA,EAAE,KAAK,KAAK,IACZiJ,IAAMjJ,EAAE,IAAI,KAAK,GAEb,KAAK,UACPiJ,KAAO,KAAK,KACZD,IAAMA,KAAO,KAAK,OAAO,KAAK,IAAI,KAAK,IAAIC,CAAG,KAC1C,KAAK,IACPA,IAAMihB,IAAO,KAAK,IAAIjhB,IAAM,KAAK,IAAIA,CAAG,KAAK,KAAK,CAAC,IAC1C,KAAK,MAAM,MACpBA,IAAMihB,GAAM,KAAK,IAAIjhB,CAAG,IAAI,KAAK,CAAC,IAEpCD,IAAMX,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GAC5CC,IAAMwe,GAAWxe,CAAG,MAEpBA,IAAM4U,GAAY7d,EAAE,IAAI,KAAK,GAAG,KAAK,IAAI,KAAK,EAAE,GAChDge,IAAI,KAAK,IAAI/U,CAAG,GACZ+U,IAAI3f,KACN2f,IAAI,KAAK,IAAI/U,CAAG,GAChB8V,IAAO,KAAK,QAAQ/e,EAAE,IAAI,KAAK,KAAK,IAAI,KAAK,KAAKge,IAAIA,CAAC,KAAK,KAAK,IAAI,KAAK,IAAI/U,CAAG,IAEjFD,IAAMX,EAAW0W,GAAM,KAAK,IAAI,KACtBf,IAAIvf,IAASJ,MACvB2K,IAAM,KAAK,SAGfhJ,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,cAAc,MAAM;AACxC,MAAA4jB,KAAe;AAAA,EACb,MAAMlkB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AC9GO,SAASN,KAAO;AACrB,OAAK,KAAK,KAAK,OAAO,SAAY,KAAK,KAAK,GAC5C,KAAK,KAAK,KAAK,OAAO,SAAY,KAAK,KAAK,GAC5C,KAAK,QAAQ,KAAK,UAAU,SAAY,KAAK,QAAQ;AACvD;AAIO,SAASC,GAAQ/I,GAAG;AAYzB,WATIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GAERie,IAAY5V,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GAClDwd,IAAQvd,GACRf,IAAM,KAAK,KAAK,KAAK,IAAIe,CAAG,OAInB;AACX,QAAIgkB,IAAc,EAAEzG,IAAQ,KAAK,IAAIA,CAAK,IAAIte,MAAQ,IAAI,KAAK,IAAIse,CAAK;AAExE,QADAA,KAASyG,GACL,KAAK,IAAIA,CAAW,IAAIxuB;AAC1B;AAAA,EAEN;AACE,EAAA+nB,KAAS,GAKL,KAAK,KAAK,IAAI,KAAK,IAAIvd,CAAG,IAAIxK,MAChCwf,IAAY;AAEd,MAAI7V,IAAI,iBAAiB,KAAK,IAAI6V,IAAY,KAAK,IAAIuI,CAAK,IAAI,KAAK,IACjEtd,IAAI,kBAAkB,KAAK,IAAI,KAAK,IAAIsd,CAAK,IAAI,KAAK;AAE1D,SAAAxmB,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GACClJ;AACT;AAEO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIwmB,GACA1I;AAIJ,EAAA9d,EAAE,KAAK,KAAK,IACZA,EAAE,KAAK,KAAK,IACZ8d,IAAM9d,EAAE,KAAK,kBAAkB,KAAK,IAKhC,KAAK,IAAI8d,CAAG,IAAI,mBAClBA,IAAM,iBAER0I,IAAQ,KAAK,KAAK1I,CAAG;AACrB,MAAI9U,IAAMX,EAAW,KAAK,QAASrI,EAAE,KAAK,iBAAiB,KAAK,IAAI,KAAK,IAAIwmB,CAAK,IAAK,KAAK,IAAI;AAChG,EAAIxd,IAAO,CAAC,KAAK,OACfA,IAAM,CAAC,KAAK,KAEVA,IAAM,KAAK,OACbA,IAAM,KAAK,KAEb8U,KAAO,IAAI0I,IAAQ,KAAK,IAAI,IAAIA,CAAK,KAAK,KAAK,IAC3C,KAAK,IAAI1I,CAAG,IAAI,MAClBA,IAAM;AAER,MAAI7U,IAAM,KAAK,KAAK6U,CAAG;AAEvB,SAAA9d,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,aAAa,MAAM;AACvC,MAAA8jB,KAAe;AAAA,EACb,MAAMpkB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACvDO,SAASN,KAAO;AAIrB,EAAI,KAAK,IAAI,KAAK,OAAO,KAAK,IAAI,IAAIrK,MAGtC,KAAK,OAAO,KAAK,QAAQ,KAAK,MAC9B,KAAK,OAAO,KAAK,IAAI,KAAK,GAC1B,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,GACnC,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE,GAC1B,KAAK,KAAK2oB,GAAK,KAAK,EAAE,GACtB,KAAK,KAAKC,GAAK,KAAK,EAAE,GACtB,KAAK,KAAKC,GAAK,KAAK,EAAE,GACtB,KAAK,KAAKC,GAAK,KAAK,EAAE,GAEtB,KAAK,UAAU,KAAK,IAAI,KAAK,IAAI,GACjC,KAAK,UAAU,KAAK,IAAI,KAAK,IAAI,GAEjC,KAAK,MAAMzf,GAAM,KAAK,GAAG,KAAK,SAAS,KAAK,OAAO,GACnD,KAAK,MAAMmf,GAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,GAEzD,KAAK,IAAI,KAAK,OAAO,KAAK,IAAI,IAAIxoB,IACpC,KAAK,KAAK,KAAK,WAEf,KAAK,UAAU,KAAK,IAAI,KAAK,IAAI,GACjC,KAAK,UAAU,KAAK,IAAI,KAAK,IAAI,GACjC,KAAK,MAAMqJ,GAAM,KAAK,GAAG,KAAK,SAAS,KAAK,OAAO,GACnD,KAAK,MAAMmf,GAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,GAC7D,KAAK,MAAM,KAAK,MAAM,KAAK,QAAQ,KAAK,MAAM,KAAK,OAErD,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM,KAAK,IACpC,KAAK,MAAMA,GAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,GAC7D,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK;AACpC;AAIO,SAASle,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GACRumB;AAIJ,MAAI,KAAK;AACP,IAAAA,IAAM,KAAK,KAAK,KAAK,IAAItd;AAAA,OACpB;AACL,QAAIwV,IAAKwI,GAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAIhe,CAAG;AACrD,IAAAsd,IAAM,KAAK,KAAK,KAAK,IAAI9H;AAAA,EAC7B;AACE,MAAI+H,IAAQ,KAAK,KAAKne,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GACxDZ,IAAI,KAAK,KAAKme,IAAM,KAAK,IAAIC,CAAK,GAClCtd,IAAI,KAAK,KAAK,KAAK,KAAKqd,IAAM,KAAK,IAAIC,CAAK;AAChD,SAAAxmB,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GACClJ;AACT;AAIO,SAASmJ,GAAQnJ,GAAG;AACzB,EAAAA,EAAE,KAAK,KAAK,IACZA,EAAE,IAAI,KAAK,KAAKA,EAAE,IAAI,KAAK;AAC3B,MAAIkI,GAAKqe,GAAKtd,GAAKD;AACnB,EAAI,KAAK,MAAM,KACbud,IAAM,KAAK,KAAKvmB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,GACrCkI,IAAM,MAENqe,IAAM,CAAC,KAAK,KAAKvmB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,GACtCkI,IAAM;AAER,MAAIse,IAAQ;AAKZ,MAJID,MAAQ,MACVC,IAAQ,KAAK,MAAMte,IAAMlI,EAAE,GAAGkI,IAAMlI,EAAE,CAAC,IAGrC,KAAK;AACP,WAAAgJ,IAAMX,EAAW,KAAK,QAAQme,IAAQ,KAAK,IAAI,KAAK,IAAI,GACxDvd,IAAMwe,GAAW,KAAK,IAAIlB,IAAM,KAAK,CAAC,GACtCvmB,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AAEP,MAAIye,IAAK,KAAK,IAAI8H,IAAM,KAAK;AAC7B,SAAAtd,IAAMye,GAAMjJ,GAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,EAAE,GAClDzV,IAAMX,EAAW,KAAK,QAAQme,IAAQ,KAAK,IAAI,KAAK,IAAI,GACxDxmB,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AAEX;AAEO,IAAIoJ,KAAQ,CAAC,qBAAqB,MAAM;AAC/C,MAAA+jB,KAAe;AAAA,EACb,MAAMrkB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACrHO,SAASN,KAAO;AAErB,OAAK,IAAI,KAAK;AAChB;AAEO,SAASC,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GAIRyiB,IAAOpa,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GAC7CZ,GAAGc;AAEP,EAAI,KAAK,IAAID,CAAG,KAAKxK,MACnB2J,IAAI,KAAK,KAAK,KAAK,IAAIqa,GACvBvZ,IAAI,KAAK;AAEX,MAAIsd,IAAQ0D,GAAM,IAAI,KAAK,IAAIjhB,IAAM,KAAK,EAAE,CAAC;AAC7C,GAAK,KAAK,IAAIwZ,CAAI,KAAKhkB,KAAW,KAAK,IAAI,KAAK,IAAIwK,CAAG,IAAI5K,CAAO,KAAKI,OACrE2J,IAAI,KAAK,IACLa,KAAO,IACTC,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,MAAMsd,CAAK,IAErDtd,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,MAAMsd,CAAK;AAI1D,MAAIpI,IAAK,MAAM,KAAK,IAAK,KAAK,KAAKqE,IAASA,IAAO,KAAK,EAAG,GACvDqF,IAAM1J,IAAKA,GACXgP,IAAQ,KAAK,IAAI5G,CAAK,GACtB6G,IAAQ,KAAK,IAAI7G,CAAK,GAEtB1H,IAAIuO,KAASD,IAAQC,IAAQ,IAC7BC,IAAMxO,IAAIA,GACVyO,IAAIzO,KAAK,IAAIsO,IAAQ,IACrBI,IAAMD,IAAIA,GACVrlB,IAAM,KAAK,KAAK,KAAK,KAAKkW,KAAMU,IAAI0O,KAAO,KAAK,KAAK1F,KAAOhJ,IAAI0O,MAAQ1O,IAAI0O,MAAQA,IAAM1F,MAAQwF,IAAME,EAAI,MAAMA,IAAM1F;AAC5H,EAAIrF,IAAO,MACTva,IAAM,CAACA,IAETE,IAAI,KAAK,KAAKF;AAEd,MAAI8gB,IAAIlB,IAAMhJ;AACd,SAAA5W,IAAM,KAAK,KAAK,KAAK,KAAKqlB,IAAIvE,IAAI5K,IAAK,KAAK,MAAMoP,IAAM1F,MAAQA,IAAM,KAAKkB,IAAIA,CAAC,MAAMwE,IAAM1F,IACxF7e,KAAO,IAETC,IAAI,KAAK,KAAKhB,IAGdgB,IAAI,KAAK,KAAKhB,GAEhBlI,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GACClJ;AACT;AAIO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIgJ,GAAKC,GACLwkB,GAAIC,GAAIC,GAAKC,GAAIC,GAAIC,GACrBC,GACAC,GACA9lB,GACA+lB,GACAtP;AAIJ,SAAA3e,EAAE,KAAK,KAAK,IACZA,EAAE,KAAK,KAAK,IACZkI,IAAM,KAAK,KAAK,KAAK,GACrBulB,IAAKztB,EAAE,IAAIkI,GACXwlB,IAAK1tB,EAAE,IAAIkI,GACXylB,IAAMF,IAAKA,IAAKC,IAAKA,GACrBE,IAAK,CAAC,KAAK,IAAIF,CAAE,KAAK,IAAIC,IAC1BE,IAAKD,IAAK,IAAIF,IAAKA,IAAKD,IAAKA,GAC7BK,IAAK,KAAKF,IAAK,IAAI,IAAIF,IAAKA,IAAKC,IAAMA,GACvChP,IAAI+O,IAAKA,IAAKI,KAAM,IAAID,IAAKA,IAAKA,IAAKC,IAAKA,IAAKA,IAAK,IAAIF,IAAKC,IAAKC,IAAKA,KAAM,IAC/EC,KAAMH,IAAKC,IAAKA,IAAK,IAAIC,KAAMA,GAC/BE,IAAK,IAAI,KAAK,KAAK,CAACD,IAAK,CAAC,GAC1B7lB,IAAQ,IAAIyW,IAAKoP,IAAMC,GACnB,KAAK,IAAI9lB,CAAG,IAAI,MACdA,KAAO,IACTA,IAAM,IAENA,IAAM,KAGV+lB,IAAM,KAAK,KAAK/lB,CAAG,IAAI,GACnBlI,EAAE,KAAK,IACTiJ,KAAO,CAAC+kB,IAAK,KAAK,IAAIC,IAAM,KAAK,KAAK,CAAC,IAAIJ,IAAK,IAAIC,KAAM,KAAK,KAE/D7kB,IAAM,EAAE,CAAC+kB,IAAK,KAAK,IAAIC,IAAM,KAAK,KAAK,CAAC,IAAIJ,IAAK,IAAIC,KAAM,KAAK,IAG9D,KAAK,IAAIL,CAAE,IAAIhvB,IACjBuK,IAAM,KAAK,QAEXA,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAMslB,IAAM,IAAI,KAAK,KAAK,IAAI,KAAKF,IAAKA,IAAKC,IAAKA,KAAMC,IAAMA,CAAG,KAAK,IAAIF,GAAI,KAAK,IAAI,GAG5HztB,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,qBAAqB,iBAAiB,mBAAmB,OAAO;AACpF,MAAA8kB,KAAe;AAAA,EACb,MAAMplB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AClHO,SAAS+kB,GAAgBC,GAAMC,GAAMC,GAAMC,GAAMxuB,GAAG8e,GAAG;AAC5D,QAAM0F,IAAIgK,IAAOF,GACXG,IAAK,KAAK,MAAM,IAAI3P,KAAK,KAAK,IAAIuP,CAAI,CAAC,GACvCK,IAAK,KAAK,MAAM,IAAI5P,KAAK,KAAK,IAAIyP,CAAI,CAAC,GACvCI,IAAQ,KAAK,IAAIF,CAAE,GAAGG,IAAQ,KAAK,IAAIH,CAAE,GACzCI,IAAQ,KAAK,IAAIH,CAAE,GAAGI,IAAQ,KAAK,IAAIJ,CAAE;AAE/C,MAAI9K,IAASY,GAAGuK,GAASC,IAAY,KACjCC,GAAWC,GAAWC,GAAUC,GAAUC,GAAOC,GAAUC,GAAWC,GAAY/W,GAClFgX,IAAKvY,IAAGuI,IAAGiQ,IAAYzR;AAE3B,KAAG;AAQD,QAPAgR,IAAY,KAAK,IAAIrL,CAAM,GAC3BsL,IAAY,KAAK,IAAItL,CAAM,GAC3BuL,IAAW,KAAK;AAAA,MACbL,IAAQG,KAAcH,IAAQG,MAC5BL,IAAQC,IAAQF,IAAQG,IAAQI,MAChCN,IAAQC,IAAQF,IAAQG,IAAQI;AAAA,IACzC,GACQC,MAAa;AACf,aAAO,EAAE,MAAM,GAAG,KAAK,EAAC;AAE1B,IAAAC,IAAWT,IAAQE,IAAQD,IAAQE,IAAQI,GAC3CG,IAAQ,KAAK,MAAMF,GAAUC,CAAQ,GACrCE,IAAWV,IAAQE,IAAQG,IAAYE,GACvCI,IAAY,IAAID,IAAWA,GAC3BE,IAAcD,MAAc,IAAMH,IAAW,IAAIT,IAAQE,IAAQU,IAAa,GAC9E9W,IAAIqG,IAAI,KAAKyQ,KAAa,IAAIzQ,KAAK,IAAI,IAAIyQ,KAC3CR,IAAUnL,GACVA,IAASY,KAAK,IAAI/L,KAAKqG,IAAIwQ,KACxBD,IAAQ5W,IAAI0W,KAAYK,IAAa/W,IAAI2W,KAAY,KAAK,IAAII,IAAaA;AAAA,EAClF,SAAW,KAAK,IAAI5L,IAASmL,CAAO,IAAI,SAAS,EAAEC,IAAY;AAE7D,SAAIA,MAAc,IACT,EAAE,MAAM,KAAK,KAAK,IAAG,KAG9BS,KAAMF,KAAavvB,IAAIA,IAAKA,KAAK,IAAI8e,MAAO9e,KAAK,IAAI8e,QAAS9e,KAAK,IAAI8e,MAAO9e,KAAK,IAAI8e,MACvF5H,KAAI,IAAIuY,KAAM,SAAS,OAAOA,MAAO,OAAOA,MAAO,MAAM,MAAMA,OAC/DhQ,KAAIgQ,KAAM,QAAQ,MAAMA,MAAO,OAAOA,MAAO,KAAK,KAAKA,OACvDC,KAAajQ,KAAI0P,KAAYK,IAAa/P,KAAI,KAAK2P,KAAY,KAAK,IAAII,IAAaA,KACjF/P,KAAI,IAAI+P,KAAc,KAAK,IAAIL,IAAWA,MAAa,KAAK,IAAIK,IAAaA,MAEjFvR,KAAKje,KAAK,IAAI8e,KAAM5H,MAAKmY,IAAQK,KAK1B,EAAE,MAFI,KAAK,MAAMZ,IAAQG,GAAWL,IAAQC,IAAQF,IAAQG,IAAQI,CAAS,GAErE,KAAKjR,GAAC;AACvB;AAcO,SAAS0R,GAAetB,GAAMC,GAAMsB,GAAMC,GAAK7vB,GAAG8e,GAAG;AAC1D,QAAM2P,IAAK,KAAK,MAAM,IAAI3P,KAAK,KAAK,IAAIuP,CAAI,CAAC,GACvCM,IAAQ,KAAK,IAAIF,CAAE,GAAGG,IAAQ,KAAK,IAAIH,CAAE,GACzCqB,IAAY,KAAK,IAAIF,CAAI,GAAGG,IAAY,KAAK,IAAIH,CAAI,GAErDI,IAAS,KAAK,MAAMrB,GAAOC,IAAQmB,CAAS,GAC5CT,IAAWV,IAAQkB,GACnBP,IAAY,IAAID,IAAWA,GAC3BG,IAAMF,KAAavvB,IAAIA,IAAKA,KAAK,IAAI8e,MAAO9e,KAAK,IAAI8e,QAAS9e,KAAK,IAAI8e,MAAO9e,KAAK,IAAI8e,MACvF5H,IAAI,IAAIuY,IAAM,SAAS,OAAOA,KAAO,OAAOA,KAAO,MAAM,MAAMA,MAC/DhQ,IAAIgQ,IAAM,QAAQ,MAAMA,KAAO,OAAOA,KAAO,KAAK,KAAKA;AAE7D,MAAIJ,IAAQQ,KAAQ7vB,KAAK,IAAI8e,KAAM5H,IAAI+Y,GAAQjB,IAAY,KACvDQ,GAAYL,GAAUC,GAAUM;AAEpC;AACE,IAAAF,IAAa,KAAK,IAAI,IAAIQ,IAASX,CAAK,GACxCF,IAAW,KAAK,IAAIE,CAAK,GACzBD,IAAW,KAAK,IAAIC,CAAK,GACzBK,IAAajQ,IAAI0P,KAAYK,IAAa/P,IAAI,KAAK2P,KAAY,KAAK,IAAII,IAAaA,KACjF/P,IAAI,IAAI+P,KAAc,KAAK,IAAIL,IAAWA,MAAa,KAAK,IAAIK,IAAaA,MACjFS,IAASZ,GACTA,IAAQQ,KAAQ7vB,KAAK,IAAI8e,KAAM5H,KAAKwY;AAAA,SAC7B,KAAK,IAAIL,IAAQY,CAAM,IAAI,SAAS,EAAEjB,IAAY;AAE3D,MAAIA,MAAc;AAChB,WAAO,EAAE,MAAM,KAAK,MAAM,IAAG;AAG/B,QAAM7N,IAAMwN,IAAQQ,IAAWP,IAAQQ,IAAWW,GAC5CxB,KAAO,KAAK;AAAA,IAChBI,IAAQS,IAAWR,IAAQO,IAAWY;AAAA,KACrC,IAAIjR,KAAK,KAAK,KAAKwQ,IAAWA,IAAWnO,IAAMA,CAAG;AAAA,EACvD,GACQyC,KAAS,KAAK;AAAA,IAClBuL,IAAWW;AAAA,IACXlB,IAAQQ,IAAWT,IAAQQ,IAAWY;AAAA,EAC1C,GACQtX,KAAIqG,IAAI,KAAKyQ,KAAa,IAAIzQ,KAAK,IAAI,IAAIyQ,KAC3C/K,KAAIZ,MAAU,IAAInL,MAAKqG,IAAIwQ,KAC5BD,IAAQ5W,KAAI0W,KAAYK,IAAa/W,KAAI2W,KAAY,KAAK,IAAII,IAAaA,MAC1EhB,KAAOF,IAAO9J;AAEpB,SAAO,EAAE,MAAA+J,IAAM,MAAAC,GAAI;AACrB;ACrGO,SAASzlB,KAAO;AACrB,OAAK,UAAU,KAAK,IAAI,KAAK,IAAI,GACjC,KAAK,UAAU,KAAK,IAAI,KAAK,IAAI,GAEjC,KAAK,IAAI,KAAK,MAAM,IAAI,KAAK,KAAK,IAAI,KAAK,EAAE;AAC/C;AAEO,SAASC,GAAQ/I,GAAG;AACzB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GACRgI,IAAS,KAAK,IAAIhI,EAAE,CAAC,GACrBiI,IAAS,KAAK,IAAIjI,EAAE,CAAC,GACrByiB,IAAOpa,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GAC7Cke,GAAI9N,GAAI8J,GAAIiE,GAAI8I,GAAKC,GAAI5R,GAAG6R,GAAIC,GAAOC,GAAMV;AACjD,SAAI,KAAK,SACH,KAAK,IAAI,KAAK,UAAU,CAAC,KAAKlxB,KAEhCuB,EAAE,IAAI,KAAK,KAAK,KAAK,KAAK3B,IAAU4K,KAAO,KAAK,IAAIwZ,CAAI,GACxDziB,EAAE,IAAI,KAAK,KAAK,KAAK,KAAK3B,IAAU4K,KAAO,KAAK,IAAIwZ,CAAI,GACjDziB,KACE,KAAK,IAAI,KAAK,UAAU,CAAC,KAAKvB,KAEvCuB,EAAE,IAAI,KAAK,KAAK,KAAK,KAAK3B,IAAU4K,KAAO,KAAK,IAAIwZ,CAAI,GACxDziB,EAAE,IAAI,KAAK,KAAK,KAAK,KAAK3B,IAAU4K,KAAO,KAAK,IAAIwZ,CAAI,GACjDziB,MAGPowB,IAAQ,KAAK,UAAUpoB,IAAS,KAAK,UAAUC,IAAS,KAAK,IAAIwa,CAAI,GACrEnE,IAAI,KAAK,KAAK8R,CAAK,GACnBD,IAAK7R,IAAIA,IAAI,KAAK,IAAIA,CAAC,IAAI,GAC3Bte,EAAE,IAAI,KAAK,KAAK,KAAK,IAAImwB,IAAKloB,IAAS,KAAK,IAAIwa,CAAI,GACpDziB,EAAE,IAAI,KAAK,KAAK,KAAK,IAAImwB,KAAM,KAAK,UAAUnoB,IAAS,KAAK,UAAUC,IAAS,KAAK,IAAIwa,CAAI,IACrFziB,MAGTknB,IAAKE,GAAK,KAAK,EAAE,GACjBhO,IAAKiO,GAAK,KAAK,EAAE,GACjBnE,IAAKoE,GAAK,KAAK,EAAE,GACjBH,IAAKI,GAAK,KAAK,EAAE,GACb,KAAK,IAAI,KAAK,UAAU,CAAC,KAAK9oB,KAEhCwxB,IAAM,KAAK,IAAIhJ,GAAKC,GAAI9N,GAAI8J,GAAIiE,GAAI9oB,CAAO,GAC3C6xB,IAAK,KAAK,IAAIjJ,GAAKC,GAAI9N,GAAI8J,GAAIiE,GAAIle,CAAG,GACtCjJ,EAAE,IAAI,KAAK,MAAMiwB,IAAMC,KAAM,KAAK,IAAIzN,CAAI,GAC1CziB,EAAE,IAAI,KAAK,MAAMiwB,IAAMC,KAAM,KAAK,IAAIzN,CAAI,GACnCziB,KACE,KAAK,IAAI,KAAK,UAAU,CAAC,KAAKvB,KAEvCwxB,IAAM,KAAK,IAAIhJ,GAAKC,GAAI9N,GAAI8J,GAAIiE,GAAI9oB,CAAO,GAC3C6xB,IAAK,KAAK,IAAIjJ,GAAKC,GAAI9N,GAAI8J,GAAIiE,GAAIle,CAAG,GACtCjJ,EAAE,IAAI,KAAK,MAAMiwB,IAAMC,KAAM,KAAK,IAAIzN,CAAI,GAC1CziB,EAAE,IAAI,KAAK,MAAMiwB,IAAMC,KAAM,KAAK,IAAIzN,CAAI,GACnCziB,KAGH,KAAK,IAAIgJ,CAAG,IAAIvK,KAAS,KAAK,IAAIwK,IAAM,KAAK,IAAI,IAAIxK,KACvDuB,EAAE,IAAIA,EAAE,IAAI,GACLA,MAETqwB,IAAOlC,GAAgB,KAAK,MAAM,KAAK,OAAOllB,GAAKD,GAAK,KAAK,GAAG,KAAK,CAAC,GACtE2mB,IAAOU,EAAK,MACZrwB,EAAE,IAAIqwB,EAAK,MAAM,KAAK,IAAIV,CAAI,GAC9B3vB,EAAE,IAAIqwB,EAAK,MAAM,KAAK,IAAIV,CAAI,GACvB3vB;AAGb;AAEO,SAASmJ,GAAQnJ,GAAG;AACzB,EAAAA,EAAE,KAAK,KAAK,IACZA,EAAE,KAAK,KAAK;AACZ,MAAIwiB,GAAI/F,GAAG8M,GAAMD,GAAMtgB,GAAKC,GAAKf,GAAKgf,GAAI9N,GAAI8J,GAAIiE,GAAI8I,GAAKxX,GAAGkX,GAAMC,GAAKS;AACzE,SAAI,KAAK,UACP7N,IAAK,KAAK,KAAKxiB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,GAChCwiB,IAAM,IAAInkB,IAAU,KAAK,IAC3B,UAEFoe,IAAI+F,IAAK,KAAK,GAEd+G,IAAO,KAAK,IAAI9M,CAAC,GACjB6M,IAAO,KAAK,IAAI7M,CAAC,GAEjBzT,IAAM,KAAK,OACP,KAAK,IAAIwZ,CAAE,KAAK/jB,IAClBwK,IAAM,KAAK,QAEXA,IAAMihB,GAAMZ,IAAO,KAAK,UAAWtpB,EAAE,IAAIupB,IAAO,KAAK,UAAW/G,CAAE,GAClEta,IAAM,KAAK,IAAI,KAAK,IAAI,IAAI7J,GACxB,KAAK,IAAI6J,CAAG,KAAKzJ,IACf,KAAK,QAAQ,IACfuK,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAMrI,EAAE,GAAG,CAACA,EAAE,CAAC,GAAG,KAAK,IAAI,IAE9DgJ,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAM,CAACrI,EAAE,GAAGA,EAAE,CAAC,GAAG,KAAK,IAAI,IAGhEgJ,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAMrI,EAAE,IAAIupB,GAAM/G,IAAK,KAAK,UAAU8G,IAAOtpB,EAAE,IAAI,KAAK,UAAUupB,CAAI,GAAG,KAAK,IAAI,IAIzHvpB,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ,OAEPknB,IAAKE,GAAK,KAAK,EAAE,GACjBhO,IAAKiO,GAAK,KAAK,EAAE,GACjBnE,IAAKoE,GAAK,KAAK,EAAE,GACjBH,IAAKI,GAAK,KAAK,EAAE,GACb,KAAK,IAAI,KAAK,UAAU,CAAC,KAAK9oB,KAEhCwxB,IAAM,KAAK,IAAIhJ,GAAKC,GAAI9N,GAAI8J,GAAIiE,GAAI9oB,CAAO,GAC3CmkB,IAAK,KAAK,KAAKxiB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,GACpCyY,IAAIwX,IAAMzN,GACVvZ,IAAMye,GAAMjP,IAAI,KAAK,GAAGyO,GAAI9N,GAAI8J,GAAIiE,CAAE,GACtCne,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAMrI,EAAE,GAAG,KAAKA,EAAE,CAAC,GAAG,KAAK,IAAI,GAClEA,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ,KACE,KAAK,IAAI,KAAK,UAAU,CAAC,KAAKvB,KAEvCwxB,IAAM,KAAK,IAAIhJ,GAAKC,GAAI9N,GAAI8J,GAAIiE,GAAI9oB,CAAO,GAC3CmkB,IAAK,KAAK,KAAKxiB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,GACpCyY,IAAI+J,IAAKyN,GAEThnB,IAAMye,GAAMjP,IAAI,KAAK,GAAGyO,GAAI9N,GAAI8J,GAAIiE,CAAE,GACtCne,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAMrI,EAAE,GAAGA,EAAE,CAAC,GAAG,KAAK,IAAI,GAC7DA,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ,MAGP2vB,IAAO,KAAK,MAAM3vB,EAAE,GAAGA,EAAE,CAAC,GAC1B4vB,IAAM,KAAK,KAAK5vB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,GACrCqwB,IAAOX,GAAe,KAAK,MAAM,KAAK,OAAOC,GAAMC,GAAK,KAAK,GAAG,KAAK,CAAC,GAEtE5vB,EAAE,IAAIqwB,EAAK,MACXrwB,EAAE,IAAIqwB,EAAK,MACJrwB;AAGb;AAEO,IAAIoJ,KAAQ,CAAC,yBAAyB,MAAM;AACnD,MAAAknB,KAAe;AAAA,EACb,MAAMxnB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AC7JO,SAASN,KAAO;AAKrB,OAAK,UAAU,KAAK,IAAI,KAAK,IAAI,GACjC,KAAK,UAAU,KAAK,IAAI,KAAK,IAAI;AACnC;AAIO,SAASC,GAAQ/I,GAAG;AACzB,MAAIgI,GAAQC,GACRwa,GACA8H,GACAC,GACA1L,GAAG1W,GAAGc,GACNF,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE;AAGZ,SAAAyiB,IAAOpa,EAAWW,IAAM,KAAK,OAAO,KAAK,IAAI,GAE7ChB,IAAS,KAAK,IAAIiB,CAAG,GACrBhB,IAAS,KAAK,IAAIgB,CAAG,GAErBshB,IAAS,KAAK,IAAI9H,CAAI,GACtB3D,IAAI,KAAK,UAAU9W,IAAS,KAAK,UAAUC,IAASsiB,GACpDC,IAAM,IACD1L,IAAI,KAAO,KAAK,IAAIA,CAAC,KAAKrgB,OAC7B2J,IAAI,KAAK,IAAIoiB,IAAMviB,IAAS,KAAK,IAAIwa,CAAI,GACzCvZ,IAAI,KAAK,KAAK,KAAK,IAAIshB,KAAO,KAAK,UAAUxiB,IAAS,KAAK,UAAUC,IAASsiB,KAEhFvqB,EAAE,IAAIoI,GACNpI,EAAE,IAAIkJ,GACClJ;AACT;AAEO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAIwiB,GACA/F,GACA8M,GAAMD,GACNphB,GACAc,GAAKC;AAYT,SATAjJ,EAAE,KAAK,KAAK,IACZA,EAAE,KAAK,KAAK,IACZwiB,IAAK,KAAK,KAAKxiB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,GACpCyc,IAAIyN,GAAM1H,IAAK,KAAK,CAAC,GAErB+G,IAAO,KAAK,IAAI9M,CAAC,GACjB6M,IAAO,KAAK,IAAI7M,CAAC,GAEjBzT,IAAM,KAAK,OACP,KAAK,IAAIwZ,CAAE,KAAK/jB,KAClBwK,IAAM,KAAK,MACXjJ,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ,MAETiJ,IAAMihB,GAAMZ,IAAO,KAAK,UAAWtpB,EAAE,IAAIupB,IAAO,KAAK,UAAW/G,CAAE,GAClEta,IAAM,KAAK,IAAI,KAAK,IAAI,IAAI7J,GACxB,KAAK,IAAI6J,CAAG,KAAKzJ,KACf,KAAK,QAAQ,IACfuK,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAMrI,EAAE,GAAG,CAACA,EAAE,CAAC,GAAG,KAAK,IAAI,IAE9DgJ,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAM,CAACrI,EAAE,GAAGA,EAAE,CAAC,GAAG,KAAK,IAAI,GAEhEA,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ,MAETgJ,IAAMX,EAAW,KAAK,QAAQ,KAAK,MAAOrI,EAAE,IAAIupB,GAAO/G,IAAK,KAAK,UAAU8G,IAAOtpB,EAAE,IAAI,KAAK,UAAUupB,CAAI,GAAG,KAAK,IAAI,GACvHvpB,EAAE,IAAIgJ,GACNhJ,EAAE,IAAIiJ,GACCjJ;AACT;AAEO,IAAIoJ,KAAQ,CAAC,OAAO;AAC3B,MAAAmnB,KAAe;AAAA,EACb,MAAMznB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AChFA,IAAIonB,KAAY;AAAA,EACd,OAAO;AAAA,EACP,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,QAAQ;AACV,GAEIC,KAAY;AAAA,EACd,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AACV;AAGO,SAAS3nB,KAAO;AACrB,OAAK,KAAK,KAAK,MAAM,GACrB,KAAK,KAAK,KAAK,MAAM,GACrB,KAAK,OAAO,KAAK,QAAQ,GACzB,KAAK,QAAQ,KAAK,SAAS,GAC3B,KAAK,SAAS,KAAK,UAAU,GAC7B,KAAK,QAAQ,KAAK,SAAS,oCAGvB,KAAK,QAAQzK,IAAUO,KAAS,IAClC,KAAK,OAAO4xB,GAAU,MACb,KAAK,QAAQ,EAAEnyB,IAAUO,KAAS,KAC3C,KAAK,OAAO4xB,GAAU,SACb,KAAK,IAAI,KAAK,KAAK,KAAK5xB,KACjC,KAAK,OAAO4xB,GAAU,QACb,KAAK,IAAI,KAAK,KAAK,KAAKnyB,IAAUO,KAC3C,KAAK,OAAO,KAAK,QAAQ,IAAM4xB,GAAU,QAAQA,GAAU,OAE3D,KAAK,OAAOA,GAAU,MAKpB,KAAK,OAAO,MACd,KAAK,cAAc,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,GAChD,KAAK,sBAAsB,KAAK,cAAc,KAAK;AAEvD;AAIO,SAASznB,GAAQ/I,GAAG;AACzB,MAAI0wB,IAAK,EAAE,GAAG,GAAG,GAAG,EAAC,GACjBznB,GAAKD,GACLwd,GAAOhe,GACPyL,GAAGyF,GAEH5W,IAAO,EAAE,OAAO,EAAC;AAoBrB,MAjBA9C,EAAE,KAAK,KAAK,OAKR,KAAK,OAAO,IACdiJ,IAAM,KAAK,KAAK,KAAK,sBAAsB,KAAK,IAAIjJ,EAAE,CAAC,CAAC,IAExDiJ,IAAMjJ,EAAE,GAQVgJ,IAAMhJ,EAAE,GACJ,KAAK,SAASwwB,GAAU;AAC1B,IAAAhoB,IAAMnK,IAAU4K,GACZD,KAAOpK,MAAUoK,KAAO3K,IAAUO,MACpCkE,EAAK,QAAQ2tB,GAAU,QACvBjK,IAAQxd,IAAM3K,KACL2K,IAAM3K,IAAUO,MAAUoK,KAAO,EAAE3K,IAAUO,OACtDkE,EAAK,QAAQ2tB,GAAU,QACvBjK,IAASxd,IAAM,IAAMA,IAAMlK,KAAMkK,IAAMlK,MAC9BkK,IAAM,EAAE3K,IAAUO,OAAWoK,KAAO,CAACpK,MAC9CkE,EAAK,QAAQ2tB,GAAU,QACvBjK,IAAQxd,IAAM3K,MAEdyE,EAAK,QAAQ2tB,GAAU,QACvBjK,IAAQxd;AAAA,WAED,KAAK,SAASwnB,GAAU;AACjC,IAAAhoB,IAAMnK,IAAU4K,GACZD,KAAOpK,MAAUoK,KAAO3K,IAAUO,MACpCkE,EAAK,QAAQ2tB,GAAU,QACvBjK,IAAQ,CAACxd,IAAM3K,KACN2K,IAAMpK,MAAUoK,KAAO,CAACpK,MACjCkE,EAAK,QAAQ2tB,GAAU,QACvBjK,IAAQ,CAACxd,KACAA,IAAM,CAACpK,MAAUoK,KAAO,EAAE3K,IAAUO,OAC7CkE,EAAK,QAAQ2tB,GAAU,QACvBjK,IAAQ,CAACxd,IAAM3K,MAEfyE,EAAK,QAAQ2tB,GAAU,QACvBjK,IAASxd,IAAM,IAAM,CAACA,IAAMlK,KAAM,CAACkK,IAAMlK;AAAA,OAEtC;AACL,QAAIkqB,GAAGza,GAAGyP,GACNoE,GAAQC,GACRsO,GAAQpG;AAEZ,IAAI,KAAK,SAASiG,GAAU,QAC1BxnB,IAAM4nB,GAAqB5nB,GAAK,CAAC3K,CAAO,IAC/B,KAAK,SAASmyB,GAAU,OACjCxnB,IAAM4nB,GAAqB5nB,GAAK,CAAClK,EAAG,IAC3B,KAAK,SAAS0xB,GAAU,SACjCxnB,IAAM4nB,GAAqB5nB,GAAK,CAAC3K,CAAO,IAE1C+jB,IAAS,KAAK,IAAInZ,CAAG,GACrBoZ,IAAS,KAAK,IAAIpZ,CAAG,GACrB0nB,IAAS,KAAK,IAAI3nB,CAAG,GACrBuhB,IAAS,KAAK,IAAIvhB,CAAG,GACrBggB,IAAI3G,IAASkI,GACbhc,IAAI8T,IAASsO,GACb3S,IAAIoE,GAEA,KAAK,SAASoO,GAAU,SAC1BhoB,IAAM,KAAK,KAAKwgB,CAAC,GACjBxC,IAAQqK,GAAyBroB,GAAKwV,GAAGzP,GAAGzL,CAAI,KACvC,KAAK,SAAS0tB,GAAU,SACjChoB,IAAM,KAAK,KAAK+F,CAAC,GACjBiY,IAAQqK,GAAyBroB,GAAKwV,GAAG,CAACgL,GAAGlmB,CAAI,KACxC,KAAK,SAAS0tB,GAAU,QACjChoB,IAAM,KAAK,KAAK,CAACwgB,CAAC,GAClBxC,IAAQqK,GAAyBroB,GAAKwV,GAAG,CAACzP,GAAGzL,CAAI,KACxC,KAAK,SAAS0tB,GAAU,QACjChoB,IAAM,KAAK,KAAK,CAAC+F,CAAC,GAClBiY,IAAQqK,GAAyBroB,GAAKwV,GAAGgL,GAAGlmB,CAAI,MAGhD0F,IAAMge,IAAQ,GACd1jB,EAAK,QAAQ2tB,GAAU;AAAA,EAE7B;AAKE,SAAA/W,IAAK,KAAK,KAAM,KAAK5a,MAAQ0nB,IAAQ,KAAK,KAAK,KAAK,IAAIA,CAAK,IAAI,KAAK,IAAI5nB,EAAM,CAAC,IAAIP,EAAQ,GAC7F4V,IAAI,KAAK,MAAM,IAAI,KAAK,IAAIzL,CAAG,MAAM,KAAK,IAAIkR,CAAE,IAAI,KAAK,IAAIA,CAAE,MAAM,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI8M,CAAK,CAAC,CAAC,EAAE,GAG9G1jB,EAAK,UAAU2tB,GAAU,SAC3B/W,KAAMrb,IACGyE,EAAK,UAAU2tB,GAAU,SAClC/W,KAAM5a,KACGgE,EAAK,UAAU2tB,GAAU,WAClC/W,KAAM,MAAM5a,KAId4xB,EAAG,IAAIzc,IAAI,KAAK,IAAIyF,CAAE,GACtBgX,EAAG,IAAIzc,IAAI,KAAK,IAAIyF,CAAE,GACtBgX,EAAG,IAAIA,EAAG,IAAI,KAAK,IAAI,KAAK,IAC5BA,EAAG,IAAIA,EAAG,IAAI,KAAK,IAAI,KAAK,IAE5B1wB,EAAE,IAAI0wB,EAAG,GACT1wB,EAAE,IAAI0wB,EAAG,GACF1wB;AACT;AAIO,SAASmJ,GAAQnJ,GAAG;AACzB,MAAI8wB,IAAK,EAAE,KAAK,GAAG,KAAK,EAAC,GACrBpX,GAAIqX,GAAIC,GAAOC,GACfC,GAAU1K,GAAOve,GAAQO,GACzByL,GACAnR,IAAO,EAAE,OAAO,EAAC;AA4CrB,MAzCA9C,EAAE,KAAKA,EAAE,IAAI,KAAK,MAAM,KAAK,GAC7BA,EAAE,KAAKA,EAAE,IAAI,KAAK,MAAM,KAAK,GAI7B+wB,IAAK,KAAK,KAAK,KAAK,KAAK/wB,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,CAAC,CAAC,GAC/C0Z,IAAK,KAAK,MAAM1Z,EAAE,GAAGA,EAAE,CAAC,GACpBA,EAAE,KAAK,KAAOA,EAAE,KAAK,KAAK,IAAIA,EAAE,CAAC,IACnC8C,EAAK,QAAQ2tB,GAAU,SACdzwB,EAAE,KAAK,KAAOA,EAAE,KAAK,KAAK,IAAIA,EAAE,CAAC,KAC1C8C,EAAK,QAAQ2tB,GAAU,QACvB/W,KAAMrb,KACG2B,EAAE,IAAI,KAAO,CAACA,EAAE,KAAK,KAAK,IAAIA,EAAE,CAAC,KAC1C8C,EAAK,QAAQ2tB,GAAU,QACvB/W,IAAMA,IAAK,IAAMA,IAAK5a,KAAM4a,IAAK5a,OAEjCgE,EAAK,QAAQ2tB,GAAU,QACvB/W,KAAMrb,IAQR4V,IAAKnV,KAAM,KAAM,KAAK,IAAI4a,CAAE,GAC5BwX,IAAW,KAAK,IAAIjd,CAAC,KAAK,KAAK,IAAIA,CAAC,IAAK,IAAI,KAAK,KAAK,CAAC,IACxDuS,IAAQ,KAAK,KAAK0K,CAAQ,GAC1BF,IAAQ,KAAK,IAAItX,CAAE,GACnBuX,IAAQ,KAAK,IAAIF,CAAE,GACnB9oB,IAAS,IAAI+oB,IAAQA,IAAQC,IAAQA,KAAS,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,IAAIzK,CAAK,CAAC,CAAC,IACrFve,IAAS,KACXA,IAAS,KACAA,IAAS,MAClBA,IAAS,IAOP,KAAK,SAASuoB,GAAU;AAC1B,IAAAhoB,IAAM,KAAK,KAAKP,CAAM,GACtB6oB,EAAG,MAAMzyB,IAAUmK,GACf1F,EAAK,UAAU2tB,GAAU,SAC3BK,EAAG,MAAMtK,IAAQnoB,IACRyE,EAAK,UAAU2tB,GAAU,SAClCK,EAAG,MAAOtK,IAAQ,IAAMA,IAAQ1nB,KAAM0nB,IAAQ1nB,KACrCgE,EAAK,UAAU2tB,GAAU,SAClCK,EAAG,MAAMtK,IAAQnoB,IAEjByyB,EAAG,MAAMtK;AAAA,WAEF,KAAK,SAASgK,GAAU;AACjC,IAAAhoB,IAAM,KAAK,KAAKP,CAAM,GACtB6oB,EAAG,MAAMtoB,IAAMnK,GACXyE,EAAK,UAAU2tB,GAAU,SAC3BK,EAAG,MAAM,CAACtK,IAAQnoB,IACTyE,EAAK,UAAU2tB,GAAU,SAClCK,EAAG,MAAM,CAACtK,IACD1jB,EAAK,UAAU2tB,GAAU,SAClCK,EAAG,MAAM,CAACtK,IAAQnoB,IAElByyB,EAAG,MAAOtK,IAAQ,IAAM,CAACA,IAAQ1nB,KAAM,CAAC0nB,IAAQ1nB;AAAA,OAE7C;AAEL,QAAIkqB,GAAGza,GAAGyP;AACV,IAAAgL,IAAI/gB,GACJgM,IAAI+U,IAAIA,GACJ/U,KAAK,IACP+J,IAAI,IAEJA,IAAI,KAAK,KAAK,IAAI/J,CAAC,IAAI,KAAK,IAAIuS,CAAK,GAEvCvS,KAAK+J,IAAIA,GACL/J,KAAK,IACP1F,IAAI,IAEJA,IAAI,KAAK,KAAK,IAAI0F,CAAC,GAGjBnR,EAAK,UAAU2tB,GAAU,UAC3Bxc,IAAI1F,GACJA,IAAI,CAACyP,GACLA,IAAI/J,KACKnR,EAAK,UAAU2tB,GAAU,UAClCliB,IAAI,CAACA,GACLyP,IAAI,CAACA,KACIlb,EAAK,UAAU2tB,GAAU,WAClCxc,IAAI1F,GACJA,IAAIyP,GACJA,IAAI,CAAC/J,IAGH,KAAK,SAASuc,GAAU,SAC1Bvc,IAAI+U,GACJA,IAAI,CAACza,GACLA,IAAI0F,KACK,KAAK,SAASuc,GAAU,QACjCxH,IAAI,CAACA,GACLza,IAAI,CAACA,KACI,KAAK,SAASiiB,GAAU,SACjCvc,IAAI+U,GACJA,IAAIza,GACJA,IAAI,CAAC0F,IAGP6c,EAAG,MAAM,KAAK,KAAK,CAAC9S,CAAC,IAAI3f,GACzByyB,EAAG,MAAM,KAAK,MAAMviB,GAAGya,CAAC,GACpB,KAAK,SAASwH,GAAU,QAC1BM,EAAG,MAAMF,GAAqBE,EAAG,KAAK,CAACzyB,CAAO,IACrC,KAAK,SAASmyB,GAAU,OACjCM,EAAG,MAAMF,GAAqBE,EAAG,KAAK,CAAChyB,EAAG,IACjC,KAAK,SAAS0xB,GAAU,SACjCM,EAAG,MAAMF,GAAqBE,EAAG,KAAK,CAACzyB,CAAO;AAAA,EAEpD;AAIE,MAAI,KAAK,OAAO,GAAG;AACjB,QAAI8yB,GACAnG,GAAQoG;AACZ,IAAAD,IAAeL,EAAG,MAAM,IAAI,IAAI,GAChC9F,IAAS,KAAK,IAAI8F,EAAG,GAAG,GACxBM,IAAK,KAAK,IAAI,KAAK,KAAKpG,IAASA,IAAS,KAAK,mBAAmB,GAClE8F,EAAG,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,IAAIM,IAAKA,CAAE,KAAK,KAAK,cAAcA,EAAG,GAC7ED,MACFL,EAAG,MAAM,CAACA,EAAG;AAAA,EAEnB;AAEE,SAAAA,EAAG,OAAO,KAAK,OACf9wB,EAAE,IAAI8wB,EAAG,KACT9wB,EAAE,IAAI8wB,EAAG,KACF9wB;AACT;AAIA,SAAS6wB,GAAyBroB,GAAKU,GAAGd,GAAGtF,GAAM;AACjD,MAAI0jB;AACJ,SAAIhe,IAAM/J,KACRqE,EAAK,QAAQ2tB,GAAU,QACvBjK,IAAQ,MAERA,IAAQ,KAAK,MAAMtd,GAAGd,CAAC,GACnB,KAAK,IAAIoe,CAAK,KAAK5nB,KACrBkE,EAAK,QAAQ2tB,GAAU,SACdjK,IAAQ5nB,MAAU4nB,KAASnoB,IAAUO,MAC9CkE,EAAK,QAAQ2tB,GAAU,QACvBjK,KAASnoB,KACAmoB,IAAQnoB,IAAUO,MAAU4nB,KAAS,EAAEnoB,IAAUO,OAC1DkE,EAAK,QAAQ2tB,GAAU,QACvBjK,IAASA,KAAS,IAAMA,IAAQ1nB,KAAM0nB,IAAQ1nB,OAE9CgE,EAAK,QAAQ2tB,GAAU,QACvBjK,KAASnoB,KAGNmoB;AACT;AAGA,SAASoK,GAAqB5nB,GAAKwF,GAAQ;AACzC,MAAI6iB,IAAOroB,IAAMwF;AACjB,SAAI6iB,IAAO,CAACvyB,KACVuyB,KAAQxyB,KACCwyB,IAAO,CAACvyB,OACjBuyB,KAAQxyB,KAEHwyB;AACT;AAEO,IAAIjoB,KAAQ,CAAC,oCAAoC,oCAAoC,KAAK;AACjG,MAAAkoB,KAAe;AAAA,EACb,MAAMxoB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACjXA,IAAImoB,KAAU;AAAA,EACZ,CAAC,GAAQ,WAAY,aAAc,SAAU;AAAA,EAC7C,CAAC,QAAQ,YAAc,WAAa,UAAW;AAAA,EAC/C,CAAC,QAAQ,WAAa,aAAc,WAAY;AAAA,EAChD,CAAC,MAAQ,YAAa,WAAa,SAAU;AAAA,EAC7C,CAAC,QAAQ,YAAa,aAAc,WAAY;AAAA,EAChD,CAAC,OAAQ,YAAa,aAAc,SAAU;AAAA,EAC9C,CAAC,MAAQ,YAAa,aAAc,UAAW;AAAA,EAC/C,CAAC,QAAQ,YAAa,aAAc,UAAW;AAAA,EAC/C,CAAC,QAAQ,YAAa,WAAa,UAAW;AAAA,EAC9C,CAAC,QAAQ,YAAa,aAAc,WAAY;AAAA,EAChD,CAAC,QAAQ,YAAa,YAAc,UAAW;AAAA,EAC/C,CAAC,OAAQ,YAAa,aAAc,UAAW;AAAA,EAC/C,CAAC,QAAQ,YAAa,aAAc,UAAW;AAAA,EAC/C,CAAC,QAAQ,YAAa,WAAa,WAAY;AAAA,EAC/C,CAAC,QAAQ,YAAa,aAAc,UAAW;AAAA,EAC/C,CAAC,QAAQ,YAAa,YAAc,UAAW;AAAA,EAC/C,CAAC,QAAQ,WAAW,YAAa,UAAW;AAAA,EAC5C,CAAC,QAAQ,YAAa,QAAU,UAAW;AAAA,EAC3C,CAAC,QAAQ,YAAa,WAAa,UAAW;AAChD,GAEIC,KAAU;AAAA,EACZ,CAAC,aAAc,QAAQ,YAAa,WAAY;AAAA,EAChD,CAAC,OAAQ,QAAQ,aAAc,UAAW;AAAA,EAC1C,CAAC,OAAQ,QAAQ,YAAa,WAAY;AAAA,EAC1C,CAAC,OAAQ,WAAW,aAAc,UAAW;AAAA,EAC7C,CAAC,OAAQ,WAAW,YAAa,QAAS;AAAA,EAC1C,CAAC,MAAQ,WAAW,aAAc,UAAW;AAAA,EAC7C,CAAC,OAAQ,WAAW,YAAa,WAAY;AAAA,EAC7C,CAAC,OAAQ,WAAW,aAAc,WAAY;AAAA,EAC9C,CAAC,QAAQ,WAAW,aAAc,WAAY;AAAA,EAC9C,CAAC,QAAQ,WAAW,aAAc,WAAY;AAAA,EAC9C,CAAC,QAAQ,WAAW,aAAc,WAAY;AAAA,EAC9C,CAAC,QAAQ,UAAU,aAAc,WAAY;AAAA,EAC7C,CAAC,QAAQ,WAAW,aAAc,WAAY;AAAA,EAC9C,CAAC,QAAQ,WAAW,aAAc,WAAY;AAAA,EAC9C,CAAC,QAAQ,WAAW,WAAa,WAAY;AAAA,EAC7C,CAAC,QAAQ,WAAY,WAAa,QAAU;AAAA,EAC5C,CAAC,QAAQ,WAAY,YAAc,UAAW;AAAA,EAC9C,CAAC,QAAQ,WAAY,SAAW,UAAW;AAAA,EAC3C,CAAC,GAAQ,WAAY,YAAc,UAAW;AAChD,GAEIC,KAAM,QACNC,KAAM,QACNnY,KAAK5a,KAAM,GACXgzB,KAAM,IAAIpY,IACVqY,KAAQ,IAERC,KAAY,SAAUC,GAAO1pB,GAAG;AAClC,SAAO0pB,EAAM,CAAC,IAAI1pB,KAAK0pB,EAAM,CAAC,IAAI1pB,KAAK0pB,EAAM,CAAC,IAAI1pB,IAAI0pB,EAAM,CAAC;AAC/D,GAEIC,KAAY,SAAUD,GAAO1pB,GAAG;AAClC,SAAO0pB,EAAM,CAAC,IAAI1pB,KAAK,IAAI0pB,EAAM,CAAC,IAAI1pB,IAAI,IAAI0pB,EAAM,CAAC;AACvD;AAEA,SAASE,GAAeC,GAAMhoB,GAAOioB,GAASC,GAAO;AAEnD,WADI/pB,IAAI6B,GACDkoB,GAAO,EAAEA,GAAO;AACrB,QAAIC,IAAMH,EAAK7pB,CAAC;AAEhB,QADAA,KAAKgqB,GACD,KAAK,IAAIA,CAAG,IAAIF;AAClB;AAAA,EAEN;AACE,SAAO9pB;AACT;AAEO,SAASU,KAAO;AACrB,OAAK,KAAK,KAAK,MAAM,GACrB,KAAK,KAAK,KAAK,MAAM,GACrB,KAAK,QAAQ,KAAK,SAAS,GAC3B,KAAK,KAAK,GACV,KAAK,QAAQ,KAAK,SAAS;AAC7B;AAEO,SAASC,GAAQuO,GAAI;AAC1B,MAAItO,IAAMX,EAAWiP,EAAG,IAAI,KAAK,OAAO,KAAK,IAAI,GAE7CzO,IAAO,KAAK,IAAIyO,EAAG,CAAC,GACpB/X,IAAI,KAAK,MAAMsJ,IAAO0Q,EAAE;AAC5B,EAAIha,IAAI,IACNA,IAAI,IACKA,KAAKqyB,OACdryB,IAAIqyB,KAAQ,IAEd/oB,IAAOlK,MAAOkK,IAAO8oB,KAAMpyB;AAC3B,MAAImxB,IAAK;AAAA,IACP,GAAGmB,GAAUN,GAAQhyB,CAAC,GAAGsJ,CAAI,IAAIG;AAAA,IACjC,GAAG6oB,GAAUL,GAAQjyB,CAAC,GAAGsJ,CAAI;AAAA,EACjC;AACE,SAAIyO,EAAG,IAAI,MACToZ,EAAG,IAAI,CAACA,EAAG,IAGbA,EAAG,IAAIA,EAAG,IAAI,KAAK,IAAIe,KAAM,KAAK,IAClCf,EAAG,IAAIA,EAAG,IAAI,KAAK,IAAIgB,KAAM,KAAK,IAC3BhB;AACT;AAEO,SAASvnB,GAAQunB,GAAI;AAC1B,MAAIpZ,IAAK;AAAA,IACP,IAAIoZ,EAAG,IAAI,KAAK,OAAO,KAAK,IAAIe;AAAA,IAChC,GAAG,KAAK,IAAIf,EAAG,IAAI,KAAK,EAAE,KAAK,KAAK,IAAIgB;AAAA,EAC5C;AAEE,MAAIpa,EAAG,KAAK;AACV,IAAAA,EAAG,KAAKia,GAAQK,EAAK,EAAE,CAAC,GACxBta,EAAG,IAAIoZ,EAAG,IAAI,IAAI,CAACryB,IAAUA;AAAA,OACxB;AAEL,QAAIkB,IAAI,KAAK,MAAM+X,EAAG,IAAIsa,EAAK;AAM/B,SALIryB,IAAI,IACNA,IAAI,IACKA,KAAKqyB,OACdryB,IAAIqyB,KAAQ;AAGZ,UAAIJ,GAAQjyB,CAAC,EAAE,CAAC,IAAI+X,EAAG;AACrB,UAAE/X;AAAA,eACOiyB,GAAQjyB,IAAI,CAAC,EAAE,CAAC,KAAK+X,EAAG;AACjC,UAAE/X;AAAA;AAEF;AAIJ,QAAIuyB,IAAQN,GAAQjyB,CAAC,GACjB0U,IAAI,KAAKqD,EAAG,IAAIwa,EAAM,CAAC,MAAMN,GAAQjyB,IAAI,CAAC,EAAE,CAAC,IAAIuyB,EAAM,CAAC;AAE5D,IAAA7d,IAAI+d,GAAe,SAAU5pB,GAAG;AAC9B,cAAQypB,GAAUC,GAAO1pB,CAAC,IAAIkP,EAAG,KAAKya,GAAUD,GAAO1pB,CAAC;AAAA,IAC9D,GAAO6L,GAAGxV,GAAO,GAAG,GAEhB6Y,EAAG,KAAKua,GAAUN,GAAQhyB,CAAC,GAAG0U,CAAC,GAC/BqD,EAAG,KAAK,IAAI/X,IAAI0U,KAAKvV,IACjBgyB,EAAG,IAAI,MACTpZ,EAAG,IAAI,CAACA,EAAG;AAAA,EAEjB;AAEE,SAAAA,EAAG,IAAIjP,EAAWiP,EAAG,IAAI,KAAK,OAAO,KAAK,IAAI,GACvCA;AACT;AAEO,IAAIlO,KAAQ,CAAC,YAAY,OAAO;AACvC,MAAAipB,KAAe;AAAA,EACb,MAAMvpB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AC3JO,SAASN,KAAO;AACrB,OAAK,OAAO;AACd;AAEO,SAASC,GAAQ/I,GAAG;AACzB,MAAI0S,IAAQ3C,GAAqB/P,GAAG,KAAK,IAAI,KAAK,CAAC;AACnD,SAAO0S;AACT;AAEO,SAASvJ,GAAQnJ,GAAG;AACzB,MAAI0S,IAAQnC,GAAqBvQ,GAAG,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC;AAC3D,SAAO0S;AACT;AAEO,IAAItJ,KAAQ,CAAC,cAAc,cAAc,WAAW,SAAS;AACpE,MAAAkpB,KAAe;AAAA,EACb,MAAMxpB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;ACFA,IAAImpB,KAAO;AAAA,EACT,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,OAAO;AACT,GAEIlyB,KAAS;AAAA,EACX,GAAG,EAAE,KAAK,KAAQ,KAAK,GAAI;AAAA;AAAA,EAC3B,KAAK,EAAE,KAAK,GAAG,KAAK,IAAM,SAAS,GAAI;AAAA;AAAA,EACvC,MAAM,EAAE,KAAK,GAAG,KAAK,IAAM,SAAS,GAAI;AAAA;AAAA,EACxC,OAAO,EAAE,KAAK,GAAG,KAAK,GAAI;AAAA;AAAA,EAC1B,MAAM,EAAE,KAAK,GAAG,KAAK,GAAI;AAAA;AAC3B;AAGO,SAASyI,KAAO;AA0BrB,MAzBA,OAAO,KAAKzI,EAAM,EAAE,SAAQ,SAAUL,GAAG;AACvC,QAAI,OAAO,KAAKA,CAAC,IAAM;AACrB,WAAKA,CAAC,IAAIK,GAAOL,CAAC,EAAE;AAAA,SACf;AAAA,UAAIK,GAAOL,CAAC,EAAE,OAAO,MAAM,KAAKA,CAAC,CAAC;AACvC,cAAM,IAAI,MAAM,8CAA8CA,IAAI,QAAQ,KAAKA,CAAC,CAAC;AAC5E,MAAIK,GAAOL,CAAC,EAAE,QACnB,KAAKA,CAAC,IAAI,WAAW,KAAKA,CAAC,CAAC;AAAA;AAE9B,IAAIK,GAAOL,CAAC,EAAE,YACZ,KAAKA,CAAC,IAAI,KAAKA,CAAC,IAAItB;AAAAA,EAE1B,GAAI,KAAK,IAAI,CAAC,GAER,KAAK,IAAK,KAAK,IAAI,KAAK,IAAI,IAAIL,CAAO,IAAKI,IAC9C,KAAK,OAAO,KAAK,OAAO,IAAI8zB,GAAK,SAASA,GAAK,SACtC,KAAK,IAAI,KAAK,IAAI,IAAI9zB,IAC/B,KAAK,OAAO8zB,GAAK,SAEjB,KAAK,OAAOA,GAAK,OACjB,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAChC,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,IAGlC,KAAK,MAAM,KAAK,IAAI,KAAK,GAErB,KAAK,OAAO,KAAK,KAAK,MAAM;AAC9B,UAAM,IAAI,MAAM,gBAAgB;AAGlC,OAAK,IAAI,IAAI,KAAK,KAClB,KAAK,KAAK,IAAI,KAAK,GACnB,KAAK,KAAK,IAAI,KAAK,KACnB,KAAK,SAAS,KAAK,IAAI,KAAK,KAAK,IACjC,KAAK,KAAK;AAEV,MAAIC,IAAQ,KAAK,MACb9N,IAAQ,KAAK;AACjB,OAAK,KAAK,KAAK,IAAIA,CAAK,GACxB,KAAK,KAAK,KAAK,IAAIA,CAAK,GACxB,KAAK,KAAK,KAAK,IAAI8N,CAAK,GACxB,KAAK,KAAK,KAAK,IAAIA,CAAK;AAC1B;AAEO,SAASzpB,GAAQ/I,GAAG;AACzB,EAAAA,EAAE,KAAK,KAAK;AACZ,MAAIgI,IAAS,KAAK,IAAIhI,EAAE,CAAC,GACrBiI,IAAS,KAAK,IAAIjI,EAAE,CAAC,GACrB8oB,IAAS,KAAK,IAAI9oB,EAAE,CAAC,GACrBoI,GAAGc;AACP,UAAQ,KAAK,MAAI;AAAA,IACf,KAAKqpB,GAAK;AACR,MAAArpB,IAAI,KAAK,SAASlB,IAAS,KAAK,SAASC,IAAS6gB;AAClD;AAAA,IACF,KAAKyJ,GAAK;AACR,MAAArpB,IAAIjB,IAAS6gB;AACb;AAAA,IACF,KAAKyJ,GAAK;AACR,MAAArpB,IAAI,CAAClB;AACL;AAAA,IACF,KAAKuqB,GAAK;AACR,MAAArpB,IAAIlB;AACJ;AAAA,EACN;AAIE,UAHAkB,IAAI,KAAK,OAAO,KAAK,IAAIA,IACzBd,IAAIc,IAAIjB,IAAS,KAAK,IAAIjI,EAAE,CAAC,GAErB,KAAK,MAAI;AAAA,IACf,KAAKuyB,GAAK;AACR,MAAArpB,KAAK,KAAK,SAASlB,IAAS,KAAK,SAASC,IAAS6gB;AACnD;AAAA,IACF,KAAKyJ,GAAK;AACR,MAAArpB,KAAKlB;AACL;AAAA,IACF,KAAKuqB,GAAK;AACR,MAAArpB,KAAK,EAAEjB,IAAS6gB;AAChB;AAAA,IACF,KAAKyJ,GAAK;AACR,MAAArpB,KAAKjB,IAAS6gB;AACd;AAAA,EACN;AAGE,MAAI2J,GAAIC;AACR,SAAAD,IAAKvpB,IAAI,KAAK,KAAKd,IAAI,KAAK,IAC5BsqB,IAAK,KAAKD,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KACxCrqB,KAAKA,IAAI,KAAK,KAAKc,IAAI,KAAK,MAAM,KAAK,KAAKwpB,GAC5CxpB,IAAIupB,IAAKC,GAET1yB,EAAE,IAAIoI,IAAI,KAAK,GACfpI,EAAE,IAAIkJ,IAAI,KAAK,GACRlJ;AACT;AAEO,SAASmJ,GAAQnJ,GAAG;AACzB,EAAAA,EAAE,KAAK,KAAK,GACZA,EAAE,KAAK,KAAK;AACZ,MAAIuO,IAAI,EAAE,GAAGvO,EAAE,GAAG,GAAGA,EAAE,EAAC,GAGpB2yB,GAAIC,GAAIH;AACZ,EAAAA,IAAK,KAAK,KAAK,MAAMzyB,EAAE,IAAI,KAAK,KAChC2yB,IAAK,KAAK,MAAM3yB,EAAE,IAAIyyB,GACtBG,IAAK,KAAK,MAAM5yB,EAAE,IAAI,KAAK,KAAKyyB,GAChCzyB,EAAE,IAAI2yB,IAAK,KAAK,KAAKC,IAAK,KAAK,IAC/B5yB,EAAE,IAAI4yB,IAAK,KAAK,KAAKD,IAAK,KAAK;AAE/B,MAAInQ,IAAKrD,GAAMnf,EAAE,GAAGA,EAAE,CAAC;AACvB,MAAI,KAAK,IAAIwiB,CAAE,IAAI/jB;AACjB,IAAA8P,EAAE,IAAI,GACNA,EAAE,IAAIvO,EAAE;AAAA,OACH;AACL,QAAIspB,GAAMC;AAIV,YAHAA,IAAO,IAAI/G,IAAKA,IAAK,KAAK,OAC1B+G,KAAQ,KAAK,IAAI,KAAK,KAAKA,CAAI,MAAM,KAAK,MAAM/G,IAAKA,IAAK,KAAK,MAC/D8G,IAAO,KAAK,KAAK,IAAIC,IAAOA,CAAI,GACxB,KAAK,MAAI;AAAA,MACf,KAAKgJ,GAAK;AACR,QAAAhkB,EAAE,IAAI,KAAK,KAAK+a,IAAO,KAAK,SAAStpB,EAAE,IAAIupB,IAAO,KAAK,SAAS/G,CAAE,GAClExiB,EAAE,KAAKspB,IAAO,KAAK,SAAS,KAAK,IAAI/a,EAAE,CAAC,KAAKiU,GAC7CxiB,EAAE,KAAKupB,IAAO,KAAK;AACnB;AAAA,MACF,KAAKgJ,GAAK;AACR,QAAAhkB,EAAE,IAAI,KAAK,KAAKvO,EAAE,IAAIupB,IAAO/G,CAAE,GAC/BxiB,EAAE,IAAIspB,IAAO9G,GACbxiB,EAAE,KAAKupB;AACP;AAAA,MACF,KAAKgJ,GAAK;AACR,QAAAhkB,EAAE,IAAI,KAAK,KAAK+a,CAAI,GACpBtpB,EAAE,IAAI,CAACA,EAAE;AACT;AAAA,MACF,KAAKuyB,GAAK;AACR,QAAAhkB,EAAE,IAAI,CAAC,KAAK,KAAK+a,CAAI;AACrB;AAAA,IACR;AACI,IAAA/a,EAAE,IAAI,KAAK,MAAMvO,EAAE,GAAGA,EAAE,CAAC;AAAA,EAC7B;AAEE,SAAAA,EAAE,IAAIuO,EAAE,IAAI,KAAK,OACjBvO,EAAE,IAAIuO,EAAE,GACDvO;AACT;AAEO,IAAIoJ,KAAQ,CAAC,sBAAsB,OAAO;AACjD,MAAAypB,KAAe;AAAA,EACb,MAAM/pB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AC1KO,SAASN,KAAO;AAKrB,MAJA,KAAK,YAAa,KAAK,UAAU,MAAM,IAAI,GAC3C,KAAK,IAAI,OAAO,KAAK,CAAC,GACtB,KAAK,aAAa,KAAK,IAAI,KAAK,GAE5B,KAAK,cAAc,KAAK,KAAK,aAAa;AAC5C,UAAM,IAAI,MAAK;AAMjB,MAHA,KAAK,WAAW,IAAM,KAAK,YAC3B,KAAK,IAAI,KAAK,WAAW,KAAK,WAAW,GAErC,KAAK,OAAO,GAAK;AACnB,QAAIsc,IAAS,IAAM,KAAK,IACpB0N,IAAU,IAAI1N;AAElB,SAAK,WAAW,KAAK,KAAKA,CAAM,GAChC,KAAK,YAAYA,GACjB,KAAK,gBAAgB0N,GAErB,KAAK,QAAQ;AAAA,EACjB;AACI,SAAK,WAAW,GAChB,KAAK,YAAY,GACjB,KAAK,gBAAgB,GAErB,KAAK,QAAQ;AAGf,EAAK,KAAK,UACR,KAAK,QAAQ;AAEjB;AAEA,SAAS/pB,GAAQ/I,GAAG;AAClB,MAAIgJ,IAAMhJ,EAAE,GACRiJ,IAAMjJ,EAAE,GACRkhB,GAAK6R,GAAKC,GAAKC;AAGnB,MAFAjqB,IAAMA,IAAM,KAAK,OAEb,KAAK,UAAU,WAAW;AAC5B,IAAAC,IAAM,KAAK,KAAK,KAAK,YAAY,KAAK,IAAIA,CAAG,CAAC;AAC9C,QAAIsF,IAAI,KAAK,WAAW4Q,GAAM,KAAK,WAAW,KAAK,IAAIlW,CAAG,GAAG,KAAK,IAAIA,CAAG,CAAC;AAM1E,QAJA8pB,IAAMxkB,IAAI,KAAK,IAAIvF,CAAG,IAAI,KAAK,IAAIC,CAAG,GACtC+pB,IAAMzkB,IAAI,KAAK,IAAIvF,CAAG,IAAI,KAAK,IAAIC,CAAG,GACtCgqB,IAAM1kB,IAAI,KAAK,IAAItF,CAAG,IAEhB,KAAK,WAAW8pB,KAAOA,IAAMC,IAAMA,IAAMC,IAAMA,IAAM,KAAK,gBAAiB;AAC/E,aAAAjzB,EAAE,IAAI,OAAO,KACbA,EAAE,IAAI,OAAO,KACNA;AAGT,IAAAkhB,IAAM,KAAK,WAAW6R,GAClB,KAAK,aACP/yB,EAAE,IAAI,KAAK,aAAa,KAAK,KAAKgzB,IAAM7T,GAAM8T,GAAK/R,CAAG,CAAC,GACvDlhB,EAAE,IAAI,KAAK,aAAa,KAAK,KAAKizB,IAAM/R,CAAG,MAE3ClhB,EAAE,IAAI,KAAK,aAAa,KAAK,KAAKgzB,IAAM9R,CAAG,GAC3ClhB,EAAE,IAAI,KAAK,aAAa,KAAK,KAAKizB,IAAM9T,GAAM6T,GAAK9R,CAAG,CAAC;AAAA,EAE7D,MAAS,CAAI,KAAK,UAAU,aACxBA,IAAM,KAAK,IAAIjY,CAAG,GAClB8pB,IAAM,KAAK,IAAI/pB,CAAG,IAAIkY,GACtB8R,IAAM,KAAK,IAAIhqB,CAAG,IAAIkY,GACtB+R,IAAM,KAAK,IAAIhqB,CAAG,GAClBiY,IAAM,KAAK,WAAW6R,GAElB,KAAK,aACP/yB,EAAE,IAAI,KAAK,aAAa,KAAK,KAAKgzB,IAAM7T,GAAM8T,GAAK/R,CAAG,CAAC,GACvDlhB,EAAE,IAAI,KAAK,aAAa,KAAK,KAAKizB,IAAM/R,CAAG,MAE3ClhB,EAAE,IAAI,KAAK,aAAa,KAAK,KAAKgzB,IAAM9R,CAAG,GAC3ClhB,EAAE,IAAI,KAAK,aAAa,KAAK,KAAKizB,IAAM9T,GAAM6T,GAAK9R,CAAG,CAAC;AAG3D,SAAAlhB,EAAE,IAAIA,EAAE,IAAI,KAAK,GACjBA,EAAE,IAAIA,EAAE,IAAI,KAAK,GACVA;AACT;AAEA,SAASmJ,GAAQnJ,GAAG;AAClB,MAAI+yB,IAAM,IACNC,IAAM,GACNC,IAAM,GACNlzB,GAAG0B,GAAGyxB,GAAKnV;AAKf,MAHA/d,EAAE,IAAIA,EAAE,IAAI,KAAK,GACjBA,EAAE,IAAIA,EAAE,IAAI,KAAK,GAEb,KAAK,UAAU,WAAW;AAC5B,IAAI,KAAK,aACPizB,IAAM,KAAK,IAAIjzB,EAAE,IAAI,KAAK,UAAU,GACpCgzB,IAAM,KAAK,IAAIhzB,EAAE,IAAI,KAAK,UAAU,IAAImf,GAAM,GAAK8T,CAAG,MAEtDD,IAAM,KAAK,IAAIhzB,EAAE,IAAI,KAAK,UAAU,GACpCizB,IAAM,KAAK,IAAIjzB,EAAE,IAAI,KAAK,UAAU,IAAImf,GAAM,GAAK6T,CAAG;AAGxD,QAAIG,IAAOF,IAAM,KAAK;AAKtB,QAJAlzB,IAAIizB,IAAMA,IAAMG,IAAOA,IAAOJ,IAAMA,GACpCtxB,IAAI,IAAI,KAAK,WAAWsxB,GACxBG,IAAOzxB,IAAIA,IAAK,IAAI1B,IAAI,KAAK,GAEzBmzB,IAAM;AACR,aAAAlzB,EAAE,IAAI,OAAO,KACbA,EAAE,IAAI,OAAO,KACNA;AAGT,IAAA+d,KAAK,CAACtc,IAAI,KAAK,KAAKyxB,CAAG,MAAM,IAAMnzB,IACnCgzB,IAAM,KAAK,WAAWhV,IAAIgV,GAC1BC,KAAOjV,GACPkV,KAAOlV,GAEP/d,EAAE,IAAI,KAAK,MAAMgzB,GAAKD,CAAG,GACzB/yB,EAAE,IAAI,KAAK,KAAKizB,IAAM,KAAK,IAAIjzB,EAAE,CAAC,IAAI+yB,CAAG,GACzC/yB,EAAE,IAAI,KAAK,KAAK,KAAK,gBAAgB,KAAK,IAAIA,EAAE,CAAC,CAAC;AAAA,EACtD,WAAa,KAAK,UAAU,UAAU;AAYlC,QAXI,KAAK,aACPizB,IAAM,KAAK,IAAIjzB,EAAE,IAAI,KAAK,UAAU,GACpCgzB,IAAM,KAAK,IAAIhzB,EAAE,IAAI,KAAK,UAAU,IAAI,KAAK,KAAK,IAAMizB,IAAMA,CAAG,MAEjED,IAAM,KAAK,IAAIhzB,EAAE,IAAI,KAAK,UAAU,GACpCizB,IAAM,KAAK,IAAIjzB,EAAE,IAAI,KAAK,UAAU,IAAI,KAAK,KAAK,IAAMgzB,IAAMA,CAAG,IAGnEjzB,IAAIizB,IAAMA,IAAMC,IAAMA,IAAMF,IAAMA,GAClCtxB,IAAI,IAAI,KAAK,WAAWsxB,GACxBG,IAAOzxB,IAAIA,IAAK,IAAI1B,IAAI,KAAK,GACzBmzB,IAAM;AACR,aAAAlzB,EAAE,IAAI,OAAO,KACbA,EAAE,IAAI,OAAO,KACNA;AAGT,IAAA+d,KAAK,CAACtc,IAAI,KAAK,KAAKyxB,CAAG,MAAM,IAAMnzB,IACnCgzB,IAAM,KAAK,WAAWhV,IAAIgV,GAC1BC,KAAOjV,GACPkV,KAAOlV,GAEP/d,EAAE,IAAI,KAAK,MAAMgzB,GAAKD,CAAG,GACzB/yB,EAAE,IAAI,KAAK,KAAKizB,IAAM,KAAK,IAAIjzB,EAAE,CAAC,IAAI+yB,CAAG;AAAA,EAC7C;AACE,SAAA/yB,EAAE,IAAIA,EAAE,IAAI,KAAK,OACVA;AACT;AAEO,IAAIoJ,KAAQ,CAAC,gCAAgC,2BAA2B,MAAM;AACrF,MAAAgqB,KAAe;AAAA,EACb,MAAMtqB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AC9IA,IAAIiqB,KAAK,UACPC,KAAK,WACLC,KAAK,QACLC,KAAK,SACL/a,KAAI,KAAK,KAAK,CAAC,IAAI;AAEd,SAAS3P,KAAO;AACrB,OAAK,KAAK,GACV,KAAK,QAAQ,KAAK,UAAU,SAAY,KAAK,QAAQ,GACrD,KAAK,KAAK,KAAK,OAAO,SAAY,KAAK,KAAK,GAC5C,KAAK,KAAK,KAAK,OAAO,SAAY,KAAK,KAAK;AAC9C;AAEO,SAASC,GAAQ/I,GAAG;AACzB,MAAI2nB,IAAMtf,EAAWrI,EAAE,IAAI,KAAK,OAAO,KAAK,IAAI,GAC5CwI,IAAMxI,EAAE,GACRyzB,IAAW,KAAK,KAAKhb,KAAI,KAAK,IAAIjQ,CAAG,CAAC,GACxCkrB,IAAaD,IAAWA,GACxBE,IAAeD,IAAaA,IAAaA;AAC3C,SAAA1zB,EAAE,IAAI2nB,IAAM,KAAK,IAAI8L,CAAQ,KACxBhb,MAAK4a,KAAK,IAAIC,KAAKI,IAAaC,KAAgB,IAAIJ,KAAK,IAAIC,KAAKE,MACvE1zB,EAAE,IAAIyzB,KAAYJ,KAAKC,KAAKI,IAAaC,KAAgBJ,KAAKC,KAAKE,KAEnE1zB,EAAE,IAAI,KAAK,IAAIA,EAAE,IAAI,KAAK,IAC1BA,EAAE,IAAI,KAAK,IAAIA,EAAE,IAAI,KAAK,IACnBA;AACT;AAEO,SAASmJ,GAAQnJ,GAAG;AACzB,EAAAA,EAAE,KAAKA,EAAE,IAAI,KAAK,MAAM,KAAK,GAC7BA,EAAE,KAAKA,EAAE,IAAI,KAAK,MAAM,KAAK;AAE7B,MAAI4zB,IAAM,MACRC,IAAQ,IACRJ,IAAWzzB,EAAE,GACb0zB,GAAYC,GAAcG,GAAIC,GAAKnJ,GAAMrrB;AAE3C,OAAKA,IAAI,GAAGA,IAAIs0B,MACdH,IAAaD,IAAWA,GACxBE,IAAeD,IAAaA,IAAaA,GACzCI,IAAKL,KAAYJ,KAAKC,KAAKI,IAAaC,KAAgBJ,KAAKC,KAAKE,MAAe1zB,EAAE,GACnF+zB,IAAMV,KAAK,IAAIC,KAAKI,IAAaC,KAAgB,IAAIJ,KAAK,IAAIC,KAAKE,IACnED,KAAY7I,IAAOkJ,IAAKC,GACpB,OAAK,IAAInJ,CAAI,IAAIgJ,KANA,EAAEr0B;AAMvB;AAIF,SAAAm0B,IAAaD,IAAWA,GACxBE,IAAeD,IAAaA,IAAaA,GACzC1zB,EAAE,IAAIyY,KAAIzY,EAAE,KAAKqzB,KAAK,IAAIC,KAAKI,IAAaC,KAAgB,IAAIJ,KAAK,IAAIC,KAAKE,MAC1E,KAAK,IAAID,CAAQ,GACrBzzB,EAAE,IAAI,KAAK,KAAK,KAAK,IAAIyzB,CAAQ,IAAIhb,EAAC,GAEtCzY,EAAE,IAAIqI,EAAWrI,EAAE,IAAI,KAAK,OAAO,KAAK,IAAI,GACrCA;AACT;AAEO,IAAIoJ,KAAQ,CAAC,WAAW,eAAe,aAAa;AAC3D,MAAA4qB,KAAe;AAAA,EACb,MAAMlrB;AAAAA,EACN,SAASC;AAAAA,EACT,SAASI;AAAAA,EACT,OAAOC;AACT;AC5EA,IAAI6qB,KAAQ;AAGL,SAASnrB,KAAO;AACrB,MAAIwV;AAGJ,MADA,KAAK,OAAO,KAAK,MACb,KAAK,IAAI,KAAK,IAAI,IAAI2V;AACxB,UAAM,IAAI,MAAK;AAEjB,EAAI,KAAK,MACP,KAAK,KAAK1W,GAAQ,KAAK,EAAE,GACzB,KAAK,KAAKE;AAAA,IAAQ,KAAK;AAAA,IAAM,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI;AAAA,IACxDa,IAAI,KAAK,IAAI,KAAK,IAAI;AAAA,IAAG,KAAK;AAAA,EAAE,GAClC,KAAK,MAAMA,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,MAAM,KAAK,GAAG,IAAI,KAAK,MACpE,KAAK,UAAU4V,IACf,KAAK,UAAUC,OAEX,KAAK,IAAI,KAAK,IAAI,IAAIF,MAAS51B,IACjC,KAAK,QAAQ,IAEb,KAAK,QAAQ,IAAI,KAAK,IAAI,KAAK,IAAI,GAErC,KAAK,UAAU+1B,IACf,KAAK,UAAUC;AAEnB;AAEA,SAASF,GAAMn0B,GAAG;AAChB,MAAI2nB,IAAMtf,EAAWrI,EAAE,KAAK,KAAK,SAAS,IAAI,KAAK,IAAI,GACnDwI,IAAMxI,EAAE,GACRwiB,GAAI8R,GAAGhW;AACX,SAAAkE,IAAK,KAAK,MAAM,KAAK,KAAK/E,GAAQjV,GAAK8rB,IAAI,KAAK,IAAI9rB,CAAG,GAAG8V,IAAI,KAAK,IAAI9V,CAAG,GAAG,KAAK,EAAE,GACpF8rB,IAAIhW,IAAIqJ,KAAOnF,IAAK,KAAK,KAAK,IAAI,KAAK,KAAK8R,IAAIA,CAAC,IACjDt0B,EAAE,IAAIwiB,IAAK,KAAK,IAAI8R,CAAC,GACrBt0B,EAAE,IAAI,KAAK,MAAMwiB,IAAK,KAAK,IAAI8R,CAAC,GAEhCt0B,EAAE,IAAI,KAAK,IAAIA,EAAE,KAAK,KAAK,MAAM,IACjCA,EAAE,IAAI,KAAK,IAAIA,EAAE,KAAK,KAAK,MAAM,IAC1BA;AACT;AAEA,SAASk0B,GAAMl0B,GAAG;AAChB,EAAAA,EAAE,KAAKA,EAAE,KAAK,KAAK,MAAM,MAAM,KAAK,GACpCA,EAAE,KAAKA,EAAE,KAAK,KAAK,MAAM,MAAM,KAAK;AAEpC,MAAIge,GAAGwE,GAAImF,GAAKnf;AAGhB,MAFAga,IAAKrD,GAAMnf,EAAE,GAAGA,EAAE,IAAI,KAAK,MAAMA,EAAE,CAAC,GACpCwI,IAAMqV,GAAY,KAAK,MAAM,KAAK,KAAK2E,GAAI,KAAK,IAAI,KAAK,EAAE,IACtDxE,IAAI,KAAK,IAAIxV,CAAG,KAAKnK;AACxB,IAAA2f,IAAI,KAAK,IAAIxV,CAAG,GAChBmf,IAAMnF,IAAK,KAAK,MAAMxiB,EAAE,GAAGA,EAAE,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK,KAAKge,IAAIA,CAAC,IAAI,KAAK,IAAIxV,CAAG;AAAA,WACtE,KAAK,IAAIwV,IAAI3f,CAAO,KAAK41B;AAClC,IAAAtM,IAAM;AAAA;AAEN,UAAM,IAAI,MAAK;AAEjB,SAAA3nB,EAAE,IAAIqI,EAAWsf,KAAO,KAAK,SAAS,IAAI,KAAK,IAAI,GACnD3nB,EAAE,IAAIynB,GAAWjf,CAAG,GACbxI;AACT;AAEA,SAASq0B,GAAMr0B,GAAG;AAChB,MAAI2nB,IAAMtf,EAAWrI,EAAE,KAAK,KAAK,SAAS,IAAI,KAAK,IAAI,GACnDwI,IAAMxI,EAAE,GACRs0B,GAAG9R;AACP,SAAAA,IAAK,KAAK,QAAQ,KAAK,OAAOha,GAC1B,KAAK,IAAIga,CAAE,IAAIyR,MACjBj0B,EAAE,IAAIwiB,IAAK,KAAK,IAAI8R,IAAI3M,IAAM,KAAK,IAAInf,CAAG,IAAIga,CAAE,GAChDxiB,EAAE,IAAI,KAAK,QAAQwiB,IAAK,KAAK,IAAI8R,CAAC,KAElCt0B,EAAE,IAAIA,EAAE,IAAI,GAGdA,EAAE,IAAI,KAAK,IAAIA,EAAE,KAAK,KAAK,MAAM,IACjCA,EAAE,IAAI,KAAK,IAAIA,EAAE,KAAK,KAAK,MAAM,IAC1BA;AACT;AAEA,SAASo0B,GAAMp0B,GAAG;AAChB,EAAAA,EAAE,KAAKA,EAAE,KAAK,KAAK,MAAM,MAAM,KAAK,GACpCA,EAAE,KAAKA,EAAE,KAAK,KAAK,MAAM,MAAM,KAAK;AAEpC,MAAI2nB,GAAKnf,GACLga,IAAKrD,GAAMnf,EAAE,GAAGA,EAAE,IAAI,KAAK,QAAQA,EAAE,CAAC;AAE1C,MADAwI,IAAM,KAAK,QAAQ,KAAK,OAAOga,GAC3B,KAAK,IAAIha,CAAG,IAAInK;AAClB,UAAM,IAAI,MAAK;AAEjB,SAAI,KAAK,IAAI,KAAK,IAAImK,CAAG,IAAInK,CAAO,KAAK41B,KACvCtM,IAAM,IAENA,IAAMnF,IAAK,KAAK,MAAMxiB,EAAE,GAAGA,EAAE,CAAC,IAAI,KAAK,IAAIwI,CAAG,GAEhDxI,EAAE,IAAIqI,EAAWsf,KAAO,KAAK,SAAS,IAAI,KAAK,IAAI,GACnD3nB,EAAE,IAAIynB,GAAWjf,CAAG,GACbxI;AACT;AAEO,IAAIoJ,KAAQ,CAAC,SAAS,yBAAyB;AACtD,MAAAmrB,KAAe;AAAA,EACb,MAAMzrB;AAAAA,EACN,OAAOM;AACT,GCpGMorB,KAAiB;AAAA,EACrB,SAAS;AAAA,IACP,SAASC;AAAA,IACT,SAASC;AAAA,EACb;AAAA,EACE,YAAY;AAAA,IACV,SAASC;AAAA,IACT,SAASC;AAAA,EACb;AACA,GAyCMC,KAAY;AAAA,EAChB,QAAQ;AAAA,IACN,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,UAAU;AAAA,IACR,SAAS;AAAA,IACT,SAAS;AAAA,EACb;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,EACb;AACA;AAGO,SAAS/rB,KAAO;AAQrB,MAPA,KAAK,KAAK,KAAK,MAAM,GACrB,KAAK,KAAK,KAAK,MAAM,GACrB,KAAK,QAAQ,KAAK,SAAS,GAC3B,KAAK,QAAQ,KAAK,SAAS,kCAC3B,KAAK,aAAagsB,GAAa,SAAS,KAAK,MAAM,GAG/C,CAAC,KAAK;AACR,UAAM,IAAI,MAAM,2BAA2B;AAG7C,MAAI,KAAK,WAAW;AAClB,UAAM,IAAI,MAAM,+BAA+B,KAAK,MAAM;AAG5D,QAAMC,IAAa,KAAK,QAAQ,QAAQ,iBAAiB,EAAE,EAAE,QAAQ,YAAY,QAAQ,EAAE,KAAI,GAGzFC,IAAQC,GAAKF,CAAU;AAC7B,MAAI,CAACC;AACH,UAAM,IAAI,MAAM,mDAAmD,KAAK,MAAM;AAEhF,EAAAA,EAAM,QAAQ,GACd,KAAK,oBAAoBA;AAEzB,MAAIE;AACJ,QAAMC,IAAgB,OAAO,KAAKN,EAAS,GAOrCO,IAAa,CAACr0B,MAAS;AAC3B,QAAI,OAAO,KAAKA,CAAI,IAAM;AACxB;AAEF,UAAMgT,IAAM,WAAW,KAAKhT,CAAI,CAAC,IAAIrC;AACrC,QAAI,MAAMqV,CAAG;AACX,YAAM,IAAI,MAAM,uBAAuBhT,IAAO,OAAO,KAAKA,CAAI,CAAC;AAEjE,WAAOgT;AAAA,EACX;AAEE,WAASxU,IAAI,GAAGA,IAAI41B,EAAc,QAAQ51B,KAAK;AAC7C,UAAM81B,IAASF,EAAc51B,CAAC,GACxB+b,IAAMuZ,GAAUQ,CAAM,GACtBh1B,IAAS,OAAO,QAAQib,CAAG;AAIjC,QAHqBjb,EAAO;AAAA,MAC1B,CAAC,CAACL,CAAC,MAAM,OAAO,KAAKA,CAAC,IAAM;AAAA,IAClC,GAII;AAAA,MAAAk1B,IAAa5Z;AACb,eAAStV,IAAK,GAAGA,IAAK3F,EAAO,QAAQ2F,KAAM;AACzC,cAAM,CAACsvB,GAAYnzB,CAAK,IAAI9B,EAAO2F,CAAE,GAC/B+N,IAAMqhB,EAAWE,CAAU;AACjC,YAAI,OAAOvhB,IAAQ;AACjB,gBAAM,IAAI,MAAM,wBAAwBuhB,IAAa,GAAG;AAE1D,aAAKnzB,CAAK,IAAI4R;AAAA,MACpB;AACI;AAAA;AAAA,EACJ;AAEE,MAAI,CAACmhB;AACH,UAAM,IAAI,MAAM,sDAAsD;AAGxE,QAAM,EAAE,MAAAK,GAAM,MAAAC,EAAI,IAAKC,GAAe,MAAMP,CAAU;AACtD,OAAK,OAAOK,GAER,KAAK,IAAIC,CAAI,IAAI/2B,KACnB,KAAK,QAAQ,KAAK,IAAI+2B,CAAI,GAC1B,KAAK,QAAQ,KAAK,IAAIA,CAAI,GAC1B,KAAK,iBAAiBhB,GAAe,WAErC,KAAK,iBAAiBA,GAAe;AAEzC;AAOO,SAASzrB,GAAQ/I,GAAG;AACzB,SAAO,KAAK,eAAe,QAAQ,MAAMA,CAAC;AAC5C;AAOO,SAASmJ,GAAQnJ,GAAG;AACzB,SAAO,KAAK,eAAe,QAAQ,MAAMA,CAAC;AAC5C;AAOA,SAASy1B,GAAep1B,GAAQq1B,GAAK;AACnC,MAAIF,GAAMD;AACV,MAAIG,MAAQb,GAAU,QAAQ;AAC5B,QAAIjQ,IAAOvkB,EAAO,QACds1B,IAAOt1B,EAAO,OACdu1B,IAAQv1B,EAAO;AACnB,QAAI,KAAK,IAAI,KAAK,IAAIs1B,CAAI,IAAIt3B,CAAO,KAAKI;AACxC,YAAM,IAAI,MAAM,gCAAgC4B,EAAO,UAAU,kBAAkB;AAErF,IAAAk1B,IAAO3Q,IAAO,KAAK,MAAM,KAAK,KAAK,IAAIgR,CAAK,GAAG,KAAK,KAAK,IAAIA,CAAK,IAAI,KAAK,IAAID,CAAI,CAAC,GACpFH,IAAO,KAAK,KAAK,KAAK,IAAIG,CAAI,IAAI,KAAK,IAAIC,CAAK,CAAC;AAAA,EACrD,WAAaF,MAAQb,GAAU;AAC3B,IAAAU,IAAOl1B,EAAO,QACdm1B,IAAOn1B,EAAO;AAAA,OACT;AACL,QAAIwkB,IAAOxkB,EAAO,QACd0kB,IAAO1kB,EAAO,OACdykB,IAAOzkB,EAAO,QACd2kB,IAAO3kB,EAAO,OACd6H,IAAM,KAAK,IAAI6c,CAAI;AAEvB,QAAI,KAAK,IAAIA,CAAI,IAAI1mB,IAAUI;AAC7B,YAAM,IAAI,MAAM,gCAAgC4B,EAAO,UAAU,kBAAkB;AAGrF,QAAI,KAAK,IAAI2kB,CAAI,IAAI3mB,IAAUI;AAC7B,YAAM,IAAI,MAAM,gCAAgC4B,EAAO,UAAU,kBAAkB;AAGrF,QAAI,KAAK,IAAI0kB,IAAOC,CAAI,IAAIvmB;AAC1B,YAAM,IAAI,MAAM,iFAAiF;AAEnG,QAAIyJ,IAAMzJ;AACR,YAAM,IAAI,MAAM,kEAAkE;AAGpF,IAAA82B,IAAO,KAAK;AAAA,MACT,KAAK,IAAIxQ,CAAI,IAAI,KAAK,IAAIC,CAAI,IAAI,KAAK,IAAIH,CAAI,IAC7C,KAAK,IAAIE,CAAI,IAAI,KAAK,IAAIC,CAAI,IAAI,KAAK,IAAIF,CAAI;AAAA,MACjD,KAAK,IAAIC,CAAI,IAAI,KAAK,IAAIC,CAAI,IAAI,KAAK,IAAIF,CAAI,IAC7C,KAAK,IAAIC,CAAI,IAAI,KAAK,IAAIC,CAAI,IAAI,KAAK,IAAIH,CAAI;AAAA,IACxD,GAEI2Q,IAAO,KAAK,KAAK,KAAK,KAAK,IAAID,IAAO1Q,CAAI,IAAI,KAAK,IAAIE,CAAI,CAAC;AAAA,EAChE;AAEE,SAAO,EAAE,MAAAwQ,GAAM,MAAAC,EAAI;AACrB;AAOA,SAASf,GAAe70B,GAAMkxB,GAAI;AAChC,MAAI,EAAE,GAAGnJ,GAAK,GAAGnf,EAAG,IAAKsoB;AACzB,EAAAnJ,KAAO/nB,EAAK;AACZ,QAAMkpB,IAAS,KAAK,IAAInB,CAAG,GACrB3f,IAAS,KAAK,IAAIQ,CAAG,GACrBP,IAAS,KAAK,IAAIO,CAAG;AAE3B,EAAAsoB,EAAG,IAAIzoB;AAAA,IACL,KAAK;AAAA,MACHJ,IAAS,KAAK,IAAI0f,CAAG;AAAA,MACpB/nB,EAAK,QAAQqI,IAAS6gB,IAAWlpB,EAAK,QAAQoI;AAAA,IACrD,IAAQpI,EAAK;AAAA,EACb,GACEkxB,EAAG,IAAI,KAAK;AAAA,IACTlxB,EAAK,QAAQoI,IAAWpI,EAAK,QAAQqI,IAAS6gB;AAAA,EACnD;AAEE,QAAMpnB,IAAS9B,EAAK,kBAAkB,QAAQkxB,CAAE;AAChD,SAAIlxB,EAAK,eACP8B,EAAO,KAAK/C,IACZ+C,EAAO,KAAK/C,KAEP+C;AACT;AAOA,SAASizB,GAAkB/0B,GAAMkxB,GAAI;AACnC,MAAI,EAAE,GAAGnJ,GAAK,GAAGnf,EAAG,IAAKsoB;AACzB,EAAAnJ,KAAO/nB,EAAK;AACZ,QAAMqI,IAAS,KAAK,IAAIO,CAAG,GACrBsgB,IAAS,KAAK,IAAInB,CAAG;AAC3B,EAAAmJ,EAAG,IAAIzoB;AAAA,IACL,KAAK;AAAA,MACHJ,IAAS,KAAK,IAAI0f,CAAG;AAAA,MACrB,KAAK,IAAInf,CAAG;AAAA,IAClB,IAAQ5I,EAAK;AAAA,EACb,GACEkxB,EAAG,IAAI,KAAK,KAAK,KAAK7oB,IAAS6gB,CAAM;AAErC,QAAMpnB,IAAS9B,EAAK,kBAAkB,QAAQkxB,CAAE;AAEhD,SAAIlxB,EAAK,eACP8B,EAAO,KAAK/C,IACZ+C,EAAO,KAAK/C,KAEP+C;AACT;AAOA,SAASgzB,GAAe90B,GAAMkxB,GAAI;AAChC,EAAIlxB,EAAK,eACPkxB,EAAG,KAAKpyB,IACRoyB,EAAG,KAAKpyB;AAGV,QAAMm3B,IAAUj2B,EAAK,kBAAkB,QAAQkxB,CAAE;AACjD,MAAI,EAAE,GAAGnJ,GAAK,GAAGnf,EAAG,IAAKqtB;AAEzB,MAAIlO,IAAM,OAAO,WAAW;AAC1B,IAAAA,KAAO/nB,EAAK;AACZ,UAAMkpB,IAAS,KAAK,IAAInB,CAAG,GACrB3f,IAAS,KAAK,IAAIQ,CAAG,GACrBP,IAAS,KAAK,IAAIO,CAAG;AAC3B,IAAAsoB,EAAG,IAAI,KAAK;AAAA,MACV7oB,IAAS,KAAK,IAAI0f,CAAG;AAAA,MACpB/nB,EAAK,QAAQqI,IAAS6gB,IAAWlpB,EAAK,QAAQoI;AAAA,IACrD,GACI8oB,EAAG,IAAI,KAAK;AAAA,MACTlxB,EAAK,QAAQoI,IAAWpI,EAAK,QAAQqI,IAAS6gB;AAAA,IACrD;AAAA,EACA;AAEE,SAAAgI,EAAG,IAAIzoB,EAAWyoB,EAAG,IAAIlxB,EAAK,KAAK,GAC5BkxB;AACT;AAOA,SAAS8D,GAAkBh1B,GAAMkxB,GAAI;AACnC,EAAIlxB,EAAK,eACPkxB,EAAG,KAAKpyB,IACRoyB,EAAG,KAAKpyB;AAGV,QAAMm3B,IAAUj2B,EAAK,kBAAkB,QAAQkxB,CAAE;AACjD,MAAI,EAAE,GAAGnJ,GAAK,GAAGnf,EAAG,IAAKqtB;AAEzB,MAAIlO,IAAM,OAAO,WAAW;AAC1B,UAAM1f,IAAS,KAAK,IAAIO,CAAG;AAC3B,IAAAmf,KAAO/nB,EAAK,MACZkxB,EAAG,IAAI,KAAK;AAAA,MACV7oB,IAAS,KAAK,IAAI0f,CAAG;AAAA,MACrB,KAAK,KAAK,IAAInf,CAAG;AAAA,IACvB,GACIsoB,EAAG,IAAI,KAAK;AAAA,MACV7oB,IAAS,KAAK,IAAI0f,CAAG;AAAA,IAC3B;AAAA,EACA;AAEE,SAAAmJ,EAAG,IAAIzoB,EAAWyoB,EAAG,IAAIlxB,EAAK,KAAK,GAC5BkxB;AACT;AAEO,IAAI1nB,KAAQ,CAAC,kCAAkC,kCAAkC,SAAS;AACjG,MAAA0sB,KAAe;AAAA,EACb,MAAMhtB;AAAA,EACN,SAASC;AAAA,EACT,SAASI;AAAA,EACT,OAAOC;AACT;AClVe,SAAA2sB,GAAUxf,GAAO;AAC9B,EAAAA,EAAM,KAAK,YAAY,IAAI0I,EAAK,GAChC1I,EAAM,KAAK,YAAY,IAAI4K,EAAM,GACjC5K,EAAM,KAAK,YAAY,IAAI0C,EAAG,GAC9B1C,EAAM,KAAK,YAAY,IAAIyL,EAAM,GACjCzL,EAAM,KAAK,YAAY,IAAIqM,EAAK,GAChCrM,EAAM,KAAK,YAAY,IAAIwN,EAAM,GACjCxN,EAAM,KAAK,YAAY,IAAIsP,EAAK,GAChCtP,EAAM,KAAK,YAAY,IAAIkQ,EAAG,GAC9BlQ,EAAM,KAAK,YAAY,IAAIyQ,EAAM,GACjCzQ,EAAM,KAAK,YAAY,IAAIgS,EAAI,GAC/BhS,EAAM,KAAK,YAAY,IAAI0T,EAAI,GAC/B1T,EAAM,KAAK,YAAY,IAAI+T,EAAG,GAC9B/T,EAAM,KAAK,YAAY,IAAIkU,EAAI,GAC/BlU,EAAM,KAAK,YAAY,IAAIoU,EAAG,GAC9BpU,EAAM,KAAK,YAAY,IAAIsU,EAAG,GAC9BtU,EAAM,KAAK,YAAY,IAAI6U,EAAI,GAC/B7U,EAAM,KAAK,YAAY,IAAIuW,EAAI,GAC/BvW,EAAM,KAAK,YAAY,IAAIwW,EAAI,GAC/BxW,EAAM,KAAK,YAAY,IAAIyW,EAAI,GAC/BzW,EAAM,KAAK,YAAY,IAAI2W,EAAI,GAC/B3W,EAAM,KAAK,YAAY,IAAI4W,EAAI,GAC/B5W,EAAM,KAAK,YAAY,IAAI2X,EAAK,GAChC3X,EAAM,KAAK,YAAY,IAAI+Z,EAAI,GAC/B/Z,EAAM,KAAK,YAAY,IAAIga,EAAK,GAChCha,EAAM,KAAK,YAAY,IAAI+a,EAAG,GAC9B/a,EAAM,KAAK,YAAY,IAAI8b,EAAK,GAChC9b,EAAM,KAAK,YAAY,IAAI+b,EAAO,GAClC/b,EAAM,KAAK,YAAY,IAAIsc,EAAK,GAChCtc,EAAM,KAAK,YAAY,IAAI6c,EAAI,GAC/B7c,EAAM,KAAK,YAAY,IAAIyd,EAAO,GAClCzd,EAAM,KAAK,YAAY,IAAIge,EAAK,GAChChe,EAAM,KAAK,YAAY,IAAIuf,EAAO;AACpC;ACpCK,MAACvf,KAAQ,OAAO,OAAOyf,IAAM;AAAA,EAChC,cAAc;AAAA,EAChB,MAAEf;AAAAA,EACA,OAAO,IAAIA,GAAK,OAAO;AAAA,EACvB,OAAAzY;AAAA,EACA,SAASlH;AAAA,EACT,MAAA3X;AAAA,EACA,SAAA4N;AAAA,EACA,WAAAqK;AAAA,EACA,MAAAyB;AAAA,EACA,SAAS;AACX,CAAC;AACD0e,GAAoBxf,EAAK;ACzCzB,SAASyH,GAAElU,GAAGyE,IAAI,GAAG;AACnB,MAAI,CAAChP,GAAEuK,CAAC;AACN,WAAO,OAAO;AAChB,MAAIyE,MAAM;AACR,WAAO,KAAK,MAAMzE,CAAC;AACrB,QAAMmK,IAAI,KAAK,IAAI,IAAI1F,CAAC;AACxB,SAAO,KAAK,MAAMzE,IAAImK,CAAC,IAAIA;AAC7B;AACA,SAAS4K,GAAE/U,GAAGyE,GAAG;AACf,MAAI,MAAM,QAAQA,CAAC,KAAKA,EAAE,SAAS,GAAG;AACpC,UAAM0F,IAAI1F,EAAE,IAAI,CAACgX,MAAM,KAAK,IAAIzb,IAAIyb,CAAC,CAAC,GAAG3a,IAAIqJ,EAAE;AAAA,MAC7C,CAACsR,GAAGjH,MAAMiH,IAAIjH,IAAIA,IAAIiH;AAAA,IAC5B,GAAO,IAAItR,EAAE,QAAQrJ,CAAC;AAClB,WAAO,OAAO2D,EAAE,CAAC,KAAK,YAAY,MAAMA,EAAE,CAAC,CAAC,IAAIzE,IAAIyE,EAAE,CAAC;AAAA,EAC3D;AACE,SAAOzE;AACT;AACA,SAASvK,GAAEuK,GAAG;AACZ,SAAOA,KAAK,QAAQ,CAAC,OAAO,MAAM,OAAOA,CAAC,CAAC,MAAM,OAAOA,KAAK,YAAYA,EAAE,WAAW;AACxF;AAIA,MAAM/J,KAAI;AAIV,SAAS4e,GAAE7U,GAAGyE,IAAI,KAAK;AACrB,QAAM0F,IAAI,KAAKrJ,IAAI,GAAGd,CAAC,GAAG,MAAMmK,CAAC;AACjC,SAAO,OAAOrJ,EAAE,CAAC,KAAK,YAAYA,EAAE,CAAC,EAAE,WAAW,IAAI,GAAGd,CAAC,MAAMc,EAAE,CAAC,IAAIA,EAAE,CAAC,EAAE,QAAQ7K,IAAGwO,CAAC,GAAG3D,EAAE,KAAKqJ,CAAC;AACrG;AC7BG,IAACgiB,KAAc,aACdC,KAAU;AAAA,EACZ,aAAaD,KAAc;AAAA,EAC3B,aAAaA,KAAc;AAAA,EAC3B,SAAS,OAAO,IAAI,KAAK;AAAA,EACzB,MAAMA,KAAc;AAAA,EACpB,QAAQA,KAAc;AAAA,EACtB,YAAYA,KAAc;AAAA,EAC1B,YAAYA,KAAc;AAAA,EAC1B,QAAQA;AAAA,EACR,QAAQA;AAAA,EACR,OAAOA,KAAc;AAAA,EACrB,aAAaA,KAAc;AAAA,EAC3B,aAAaA,KAAc;AAAA,EAC3B,eAAeA,KAAc;AAAA,EAC7B,SAAS;AAAA,EACT,OAAOA,KAAc;AACvB;AAkBA,SAASE,GAAQC,GAAMC,GAAY5qB,IAAU,CAAA,GAAI;AAC/C,QAAM6qB,IAAO,EAAE,MAAM,UAAS;AAC9B,UAAI7qB,EAAQ,OAAO,KAAKA,EAAQ,QAC9B6qB,EAAK,KAAK7qB,EAAQ,KAEhBA,EAAQ,SACV6qB,EAAK,OAAO7qB,EAAQ,OAEtB6qB,EAAK,aAAaD,KAAc,CAAA,GAChCC,EAAK,WAAWF,GACTE;AACT;AAmBA,SAAS5jB,GAAM6jB,GAAaF,GAAY5qB,IAAU,CAAA,GAAI;AACpD,MAAI,CAAC8qB;AACH,UAAM,IAAI,MAAM,yBAAyB;AAE3C,MAAI,CAAC,MAAM,QAAQA,CAAW;AAC5B,UAAM,IAAI,MAAM,8BAA8B;AAEhD,MAAIA,EAAY,SAAS;AACvB,UAAM,IAAI,MAAM,6CAA6C;AAE/D,MAAI,CAACC,GAASD,EAAY,CAAC,CAAC,KAAK,CAACC,GAASD,EAAY,CAAC,CAAC;AACvD,UAAM,IAAI,MAAM,kCAAkC;AAMpD,SAAOJ,GAJM;AAAA,IACX,MAAM;AAAA,IACN,aAAAI;AAAA,EACJ,GACuBF,GAAY5qB,CAAO;AAC1C;AACA,SAASgrB,GAAOF,GAAaF,GAAY5qB,IAAU,CAAA,GAAI;AACrD,SAAOirB;AAAA,IACLH,EAAY,IAAI,CAACngB,MACR1D,GAAM0D,GAAQigB,CAAU,CAChC;AAAA,IACD5qB;AAAA,EACJ;AACA;AACA,SAASkrB,GAAQJ,GAAaF,GAAY5qB,IAAU,CAAA,GAAI;AACtD,aAAWmrB,KAAQL,GAAa;AAC9B,QAAIK,EAAK,SAAS;AAChB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAIA,EAAKA,EAAK,SAAS,CAAC,EAAE,WAAWA,EAAK,CAAC,EAAE;AAC3C,YAAM,IAAI,MAAM,6CAA6C;AAE/D,aAAS1pB,IAAI,GAAGA,IAAI0pB,EAAKA,EAAK,SAAS,CAAC,EAAE,QAAQ1pB;AAChD,UAAI0pB,EAAKA,EAAK,SAAS,CAAC,EAAE1pB,CAAC,MAAM0pB,EAAK,CAAC,EAAE1pB,CAAC;AACxC,cAAM,IAAI,MAAM,6CAA6C;AAAA,EAGrE;AAKE,SAAOipB,GAJM;AAAA,IACX,MAAM;AAAA,IACN,aAAAI;AAAA,EACJ,GACuBF,GAAY5qB,CAAO;AAC1C;AASA,SAASorB,GAAWN,GAAaF,GAAY5qB,IAAU,CAAA,GAAI;AACzD,MAAI8qB,EAAY,SAAS;AACvB,UAAM,IAAI,MAAM,uDAAuD;AAMzE,SAAOJ,GAJM;AAAA,IACX,MAAM;AAAA,IACN,aAAAI;AAAA,EACJ,GACuBF,GAAY5qB,CAAO;AAC1C;AASA,SAASirB,GAAkBI,GAAUrrB,IAAU,IAAI;AACjD,QAAMsrB,IAAK,EAAE,MAAM,oBAAmB;AACtC,SAAItrB,EAAQ,OACVsrB,EAAG,KAAKtrB,EAAQ,KAEdA,EAAQ,SACVsrB,EAAG,OAAOtrB,EAAQ,OAEpBsrB,EAAG,WAAWD,GACPC;AACT;AACA,SAASC,GAAgBT,GAAaF,GAAY5qB,IAAU,CAAA,GAAI;AAK9D,SAAO0qB,GAJM;AAAA,IACX,MAAM;AAAA,IACN,aAAAI;AAAA,EACJ,GACuBF,GAAY5qB,CAAO;AAC1C;AAQA,SAASwrB,GAAaV,GAAaF,GAAY5qB,IAAU,CAAA,GAAI;AAK3D,SAAO0qB,GAJM;AAAA,IACX,MAAM;AAAA,IACN,aAAAI;AAAA,EACJ,GACuBF,GAAY5qB,CAAO;AAC1C;AAeA,SAASyrB,GAAgBC,GAASn4B,IAAQ,cAAc;AACtD,QAAMo4B,IAASlB,GAAQl3B,CAAK;AAC5B,MAAI,CAACo4B;AACH,UAAM,IAAI,MAAMp4B,IAAQ,mBAAmB;AAE7C,SAAOm4B,IAAUC;AACnB;AACA,SAASC,GAAgBC,GAAUt4B,IAAQ,cAAc;AACvD,QAAMo4B,IAASlB,GAAQl3B,CAAK;AAC5B,MAAI,CAACo4B;AACH,UAAM,IAAI,MAAMp4B,IAAQ,mBAAmB;AAE7C,SAAOs4B,IAAWF;AACpB;AAoBA,SAASG,GAAiBJ,GAAS;AAEjC,SAD0BA,KAAW,IAAI,KAAK,MACnB,MAAM,KAAK;AACxC;AACA,SAASxqB,GAAiBe,GAAS;AAEjC,SAD0BA,IAAU,MACT,KAAK,KAAK;AACvC;AAqBA,SAAS8oB,GAAS9gB,GAAK;AACrB,SAAO,CAAC,MAAMA,CAAG,KAAKA,MAAQ,QAAQ,CAAC,MAAM,QAAQA,CAAG;AAC1D;AACA,SAAS8hB,GAASxyB,GAAO;AACvB,SAAOA,MAAU,QAAQ,OAAOA,KAAU,YAAY,CAAC,MAAM,QAAQA,CAAK;AAC5E;AC3PA,SAASyyB,GAAS/gB,GAAO;AACvB,MAAI,CAACA;AACH,UAAM,IAAI,MAAM,mBAAmB;AAErC,MAAI,CAAC,MAAM,QAAQA,CAAK,GAAG;AACzB,QAAIA,EAAM,SAAS,aAAaA,EAAM,aAAa,QAAQA,EAAM,SAAS,SAAS;AACjF,aAAO,CAAC,GAAGA,EAAM,SAAS,WAAW;AAEvC,QAAIA,EAAM,SAAS;AACjB,aAAO,CAAC,GAAGA,EAAM,WAAW;AAAA,EAElC;AACE,MAAI,MAAM,QAAQA,CAAK,KAAKA,EAAM,UAAU,KAAK,CAAC,MAAM,QAAQA,EAAM,CAAC,CAAC,KAAK,CAAC,MAAM,QAAQA,EAAM,CAAC,CAAC;AAClG,WAAO,CAAC,GAAGA,CAAK;AAElB,QAAM,IAAI,MAAM,oDAAoD;AACtE;AACA,SAASghB,GAAUthB,GAAQ;AACzB,MAAI,MAAM,QAAQA,CAAM;AACtB,WAAOA;AAET,MAAIA,EAAO,SAAS;AAClB,QAAIA,EAAO,aAAa;AACtB,aAAOA,EAAO,SAAS;AAAA,aAGrBA,EAAO;AACT,WAAOA,EAAO;AAGlB,QAAM,IAAI;AAAA,IACR;AAAA,EACJ;AACA;AA+DA,SAASuhB,GAAQC,GAAS;AACxB,SAAIA,EAAQ,SAAS,YACZA,EAAQ,WAEVA;AACT;AACA,SAASC,GAAQD,GAASE,GAAO;AAC/B,SAAIF,EAAQ,SAAS,sBACZ,sBAELA,EAAQ,SAAS,uBACZ,uBAELA,EAAQ,SAAS,aAAaA,EAAQ,aAAa,OAC9CA,EAAQ,SAAS,OAEnBA,EAAQ;AACjB;AChHA,SAASN,GAASphB,GAAMC,GAAI1K,IAAU,CAAA,GAAI;AACxC,MAAIssB,IAAeN,GAASvhB,CAAI,GAC5B8hB,IAAeP,GAASthB,CAAE,GAC1B8hB,IAAOtrB,GAAiBqrB,EAAa,CAAC,IAAID,EAAa,CAAC,CAAC,GACzDG,IAAOvrB,GAAiBqrB,EAAa,CAAC,IAAID,EAAa,CAAC,CAAC,GACzD3J,IAAOzhB,GAAiBorB,EAAa,CAAC,CAAC,GACvCzJ,IAAO3hB,GAAiBqrB,EAAa,CAAC,CAAC,GACvCj4B,IAAI,KAAK,IAAI,KAAK,IAAIk4B,IAAO,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,KAAK,IAAIC,IAAO,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI9J,CAAI,IAAI,KAAK,IAAIE,CAAI;AAC1G,SAAO4I;AAAA,IACL,IAAI,KAAK,MAAM,KAAK,KAAKn3B,CAAC,GAAG,KAAK,KAAK,IAAIA,CAAC,CAAC;AAAA,IAC7C0L,EAAQ;AAAA,EACZ;AACA;ACbA,SAAS0sB,GAAUP,GAAS5oB,GAAUopB,GAAkB;AACtD,MAAIR,MAAY;AAEhB,aADI1qB,GAAG6Q,GAAGsa,GAAGC,GAAUC,GAAOniB,GAAQoiB,GAAyBC,IAAa,GAAGC,IAAa,GAAGC,GAAsB73B,IAAO82B,EAAQ,MAAMgB,IAAsB93B,MAAS,qBAAqB+3B,IAAY/3B,MAAS,WAAWg4B,IAAOF,IAAsBhB,EAAQ,SAAS,SAAS,GAC5QmB,IAAe,GAAGA,IAAeD,GAAMC,KAAgB;AAC9D,MAAAP,IAA0BI,IAAsBhB,EAAQ,SAASmB,CAAY,EAAE,WAAWF,IAAYjB,EAAQ,WAAWA,GACzHe,IAAuBH,IAA0BA,EAAwB,SAAS,uBAAuB,IACzGD,IAAQI,IAAuBH,EAAwB,WAAW,SAAS;AAC3E,eAASQ,IAAY,GAAGA,IAAYT,GAAOS,KAAa;AACtD,YAAIC,IAAoB,GACpBC,IAAgB;AAEpB,YADAZ,IAAWK,IAAuBH,EAAwB,WAAWQ,CAAS,IAAIR,GAC9EF,MAAa,MACjB;AAAA,UAAAliB,IAASkiB,EAAS;AAClB,cAAIa,IAAWb,EAAS;AAExB,kBADAG,IAA+F,GACvFU,GAAQ;AAAA,YACd,KAAK;AACH;AAAA,YACF,KAAK;AACH,kBAAInqB;AAAA,gBACFoH;AAAA,gBACAsiB;AAAA,gBACAK;AAAA,gBACAE;AAAA,gBACAC;AAAA,cACZ,MAAgB;AACJ,uBAAO;AACT,cAAAR,KACAO;AACA;AAAA,YACF,KAAK;AAAA,YACL,KAAK;AACH,mBAAK/rB,IAAI,GAAGA,IAAIkJ,EAAO,QAAQlJ,KAAK;AAClC,oBAAI8B;AAAA,kBACFoH,EAAOlJ,CAAC;AAAA,kBACRwrB;AAAA,kBACAK;AAAA,kBACAE;AAAA,kBACAC;AAAA,gBACd,MAAkB;AACJ,yBAAO;AACT,gBAAAR,KACIS,MAAa,gBAAcF;AAAA,cAC3C;AACU,cAAIE,MAAa,gBAAcF;AAC/B;AAAA,YACF,KAAK;AAAA,YACL,KAAK;AACH,mBAAK/rB,IAAI,GAAGA,IAAIkJ,EAAO,QAAQlJ,KAAK;AAClC,qBAAK6Q,IAAI,GAAGA,IAAI3H,EAAOlJ,CAAC,EAAE,SAASurB,GAAY1a,KAAK;AAClD,sBAAI/O;AAAA,oBACFoH,EAAOlJ,CAAC,EAAE6Q,CAAC;AAAA,oBACX2a;AAAA,oBACAK;AAAA,oBACAE;AAAA,oBACAC;AAAA,kBAChB,MAAoB;AACJ,2BAAO;AACT,kBAAAR;AAAA,gBACd;AACY,gBAAIS,MAAa,qBAAmBF,KAChCE,MAAa,aAAWD;AAAA,cACxC;AACU,cAAIC,MAAa,aAAWF;AAC5B;AAAA,YACF,KAAK;AACH,mBAAK/rB,IAAI,GAAGA,IAAIkJ,EAAO,QAAQlJ,KAAK;AAElC,qBADAgsB,IAAgB,GACXnb,IAAI,GAAGA,IAAI3H,EAAOlJ,CAAC,EAAE,QAAQ6Q,KAAK;AACrC,uBAAKsa,IAAI,GAAGA,IAAIjiB,EAAOlJ,CAAC,EAAE6Q,CAAC,EAAE,SAAS0a,GAAYJ,KAAK;AACrD,wBAAIrpB;AAAA,sBACFoH,EAAOlJ,CAAC,EAAE6Q,CAAC,EAAEsa,CAAC;AAAA,sBACdK;AAAA,sBACAK;AAAA,sBACAE;AAAA,sBACAC;AAAA,oBAClB,MAAsB;AACJ,6BAAO;AACT,oBAAAR;AAAA,kBAChB;AACc,kBAAAQ;AAAA,gBACd;AACY,gBAAAD;AAAA,cACZ;AACU;AAAA,YACF,KAAK;AACH,mBAAK/rB,IAAI,GAAGA,IAAIorB,EAAS,WAAW,QAAQprB;AAC1C,oBAAIirB,GAAUG,EAAS,WAAWprB,CAAC,GAAG8B,CAA0B,MAAM;AACpE,yBAAO;AACX;AAAA,YACF;AACE,oBAAM,IAAI,MAAM,uBAAuB;AAAA,UACjD;AAAA;AAAA,MACA;AAAA,IACA;AACA;AA6CA,SAASoqB,GAAYxB,GAAS5oB,GAAU;AACtC,MAAI4oB,EAAQ,SAAS;AACnB,IAAA5oB,EAAS4oB,GAAS,CAAC;AAAA,WACVA,EAAQ,SAAS;AAC1B,aAASr4B,IAAI,GAAGA,IAAIq4B,EAAQ,SAAS,UAC/B5oB,EAAS4oB,EAAQ,SAASr4B,CAAC,GAAGA,CAAC,MAAM,IADEA;AAC3C;AAGN;AACA,SAAS85B,GAAczB,GAAS5oB,GAAUsqB,GAAc;AACtD,MAAIC,IAAgBD;AACpB,SAAAF,GAAYxB,GAAS,SAAS4B,GAAgBT,GAAc;AAC1D,IAAIA,MAAiB,KAAKO,MAAiB,SACzCC,IAAgBC,IACbD,IAAgBvqB,EAASuqB,GAAeC,GAAgBT,CAAY;AAAA,EAC7E,CAAG,GACMQ;AACT;AAQA,SAASE,GAAS7B,GAAS5oB,GAAU;AACnC,MAAIzP,GAAG2N,GAAG4R,GAAGwZ,GAAUC,GAAOC,GAAyBG,GAAsBe,GAAmBC,GAAaC,GAAWb,IAAe,GAAGH,IAAsBhB,EAAQ,SAAS,qBAAqBiB,IAAYjB,EAAQ,SAAS,WAAWkB,IAAOF,IAAsBhB,EAAQ,SAAS,SAAS;AACrS,OAAKr4B,IAAI,GAAGA,IAAIu5B,GAAMv5B,KAAK;AAOzB,SANAi5B,IAA0BI,IAAsBhB,EAAQ,SAASr4B,CAAC,EAAE,WAAWs5B,IAAYjB,EAAQ,WAAWA,GAC9G8B,IAAoBd,IAAsBhB,EAAQ,SAASr4B,CAAC,EAAE,aAAas5B,IAAYjB,EAAQ,aAAa,CAAA,GAC5G+B,IAAcf,IAAsBhB,EAAQ,SAASr4B,CAAC,EAAE,OAAOs5B,IAAYjB,EAAQ,OAAO,QAC1FgC,IAAYhB,IAAsBhB,EAAQ,SAASr4B,CAAC,EAAE,KAAKs5B,IAAYjB,EAAQ,KAAK,QACpFe,IAAuBH,IAA0BA,EAAwB,SAAS,uBAAuB,IACzGD,IAAQI,IAAuBH,EAAwB,WAAW,SAAS,GACtE1Z,IAAI,GAAGA,IAAIyZ,GAAOzZ,KAAK;AAE1B,UADAwZ,IAAWK,IAAuBH,EAAwB,WAAW1Z,CAAC,IAAI0Z,GACtEF,MAAa,MAAM;AACrB,YAAItpB;AAAA,UACF;AAAA,UACA+pB;AAAA,UACAW;AAAA,UACAC;AAAA,UACAC;AAAA,QACV,MAAc;AACJ,iBAAO;AACT;AAAA,MACR;AACM,cAAQtB,EAAS,MAAI;AAAA,QACnB,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK,gBAAgB;AACnB,cAAItpB;AAAA,YACFspB;AAAA,YACAS;AAAA,YACAW;AAAA,YACAC;AAAA,YACAC;AAAA,UACZ,MAAgB;AACJ,mBAAO;AACT;AAAA,QACV;AAAA,QACQ,KAAK,sBAAsB;AACzB,eAAK1sB,IAAI,GAAGA,IAAIorB,EAAS,WAAW,QAAQprB;AAC1C,gBAAI8B;AAAA,cACFspB,EAAS,WAAWprB,CAAC;AAAA,cACrB6rB;AAAA,cACAW;AAAA,cACAC;AAAA,cACAC;AAAA,YACd,MAAkB;AACJ,qBAAO;AAEX;AAAA,QACV;AAAA,QACQ;AACE,gBAAM,IAAI,MAAM,uBAAuB;AAAA,MACjD;AAAA,IACA;AACI,IAAAb;AAAA,EACJ;AACA;AAqBA,SAASc,GAAYjC,GAAS5oB,GAAU;AACtC,EAAAyqB,GAAS7B,GAAS,SAASU,GAAUS,GAAc1C,GAAYtzB,GAAM9B,GAAI;AACvE,QAAIH,IAAOw3B,MAAa,OAAO,OAAOA,EAAS;AAC/C,YAAQx3B,GAAI;AAAA,MACV,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACH,eAAIkO;AAAA,UACFmnB,GAAQmC,GAAUjC,GAAY,EAAE,MAAAtzB,GAAM,IAAA9B,EAAE,CAAE;AAAA,UAC1C83B;AAAA,UACA;AAAA,QACV,MAAc,KACG,KACT;AAAA,IACR;AACI,QAAII;AACJ,YAAQr4B,GAAI;AAAA,MACV,KAAK;AACH,QAAAq4B,IAAW;AACX;AAAA,MACF,KAAK;AACH,QAAAA,IAAW;AACX;AAAA,MACF,KAAK;AACH,QAAAA,IAAW;AACX;AAAA,IACR;AACI,aAASF,IAAoB,GAAGA,IAAoBX,EAAS,YAAY,QAAQW,KAAqB;AACpG,UAAIa,IAAaxB,EAAS,YAAYW,CAAiB,GACnD7C,IAAO;AAAA,QACT,MAAM+C;AAAA,QACN,aAAaW;AAAA,MACrB;AACM,UAAI9qB,EAASmnB,GAAQC,GAAMC,CAAU,GAAG0C,GAAcE,CAAiB,MAAM;AAC3E,eAAO;AAAA,IACf;AAAA,EACA,CAAG;AACH;AC1RA,SAASl2B,GAAK60B,GAASnsB,IAAU,IAAI;AACnC,MAAImsB,EAAQ,QAAQ,QAAiBnsB,EAAQ,cAAjB;AAC1B,WAAOmsB,EAAQ;AAEjB,QAAMl2B,IAAS,CAAC,OAAU,OAAU,QAAW,MAAS;AACxD,SAAAy2B,GAAUP,GAAS,CAAClhB,MAAU;AAC5B,IAAIhV,EAAO,CAAC,IAAIgV,EAAM,CAAC,MACrBhV,EAAO,CAAC,IAAIgV,EAAM,CAAC,IAEjBhV,EAAO,CAAC,IAAIgV,EAAM,CAAC,MACrBhV,EAAO,CAAC,IAAIgV,EAAM,CAAC,IAEjBhV,EAAO,CAAC,IAAIgV,EAAM,CAAC,MACrBhV,EAAO,CAAC,IAAIgV,EAAM,CAAC,IAEjBhV,EAAO,CAAC,IAAIgV,EAAM,CAAC,MACrBhV,EAAO,CAAC,IAAIgV,EAAM,CAAC;AAAA,EAEzB,CAAG,GACMhV;AACT;ACpBA,SAASq4B,GAAYh3B,GAAM0I,IAAU,IAAI;AACvC,QAAMuuB,IAAO,OAAOj3B,EAAK,CAAC,CAAC,GACrBk3B,IAAQ,OAAOl3B,EAAK,CAAC,CAAC,GACtBm3B,IAAO,OAAOn3B,EAAK,CAAC,CAAC,GACrBo3B,IAAQ,OAAOp3B,EAAK,CAAC,CAAC;AAC5B,MAAIA,EAAK,WAAW;AAClB,UAAM,IAAI;AAAA,MACR;AAAA,IACN;AAEE,QAAMq3B,IAAU,CAACJ,GAAMC,CAAK;AAI5B,SAAOtD;AAAA,IACL,CAAC,CAACyD,GAFa,CAACF,GAAMD,CAAK,GADZ,CAACC,GAAMC,CAAK,GADb,CAACH,GAAMG,CAAK,GAIcC,CAAO,CAAC;AAAA,IAChD3uB,EAAQ;AAAA,IACR,EAAE,MAAA1I,GAAM,IAAI0I,EAAQ,GAAE;AAAA,EAC1B;AACA;ACrBO,MAAMgI,KAAU,uBACV4mB,KAAW,WACXC,MAAkB,IAAI,IAAI7mB,MAAWA;AAG3C,SAAS8mB,GAAIC,GAAM5vB,GAAG6vB,GAAM5b,GAAGG,GAAG;AACrC,MAAI0b,GAAGC,GAAMC,GAAIC,GACbC,IAAOlwB,EAAE,CAAC,GACVmwB,IAAOlc,EAAE,CAAC,GACVmc,IAAS,GACTC,IAAS;AACb,EAAKF,IAAOD,KAAWC,IAAO,CAACD,KAC3BJ,IAAII,GACJA,IAAOlwB,EAAE,EAAEowB,CAAM,MAEjBN,IAAIK,GACJA,IAAOlc,EAAE,EAAEoc,CAAM;AAErB,MAAIC,IAAS;AACb,MAAIF,IAASR,KAAQS,IAASR;AAc1B,SAbKM,IAAOD,KAAWC,IAAO,CAACD,KAC3BH,IAAOG,IAAOJ,GACdE,IAAKF,KAAKC,IAAOG,IACjBA,IAAOlwB,EAAE,EAAEowB,CAAM,MAEjBL,IAAOI,IAAOL,GACdE,IAAKF,KAAKC,IAAOI,IACjBA,IAAOlc,EAAE,EAAEoc,CAAM,IAErBP,IAAIC,GACAC,MAAO,MACP5b,EAAEkc,GAAQ,IAAIN,IAEXI,IAASR,KAAQS,IAASR;AAC7B,MAAKM,IAAOD,KAAWC,IAAO,CAACD,KAC3BH,IAAOD,IAAII,GACXD,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUC,IAAOD,IAClCC,IAAOlwB,EAAE,EAAEowB,CAAM,MAEjBL,IAAOD,IAAIK,GACXF,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUE,IAAOF,IAClCE,IAAOlc,EAAE,EAAEoc,CAAM,IAErBP,IAAIC,GACAC,MAAO,MACP5b,EAAEkc,GAAQ,IAAIN;AAI1B,SAAOI,IAASR;AACZ,IAAAG,IAAOD,IAAII,GACXD,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUC,IAAOD,IAClCC,IAAOlwB,EAAE,EAAEowB,CAAM,GACjBN,IAAIC,GACAC,MAAO,MACP5b,EAAEkc,GAAQ,IAAIN;AAGtB,SAAOK,IAASR;AACZ,IAAAE,IAAOD,IAAIK,GACXF,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUE,IAAOF,IAClCE,IAAOlc,EAAE,EAAEoc,CAAM,GACjBP,IAAIC,GACAC,MAAO,MACP5b,EAAEkc,GAAQ,IAAIN;AAGtB,UAAIF,MAAM,KAAKQ,MAAW,OACtBlc,EAAEkc,GAAQ,IAAIR,IAEXQ;AACX;AAsDO,SAASC,GAASX,GAAM5vB,GAAG;AAC9B,MAAI8vB,IAAI9vB,EAAE,CAAC;AACX,WAASrL,IAAI,GAAGA,IAAIi7B,GAAMj7B,IAAK,CAAAm7B,KAAK9vB,EAAErL,CAAC;AACvC,SAAOm7B;AACX;AAEO,SAASU,GAAItxB,GAAG;AACnB,SAAO,IAAI,aAAaA,CAAC;AAC7B;ACvIA,MAAMuxB,MAAgB,IAAI,KAAK5nB,MAAWA,IACpC6nB,MAAgB,IAAI,KAAK7nB,MAAWA,IACpC8nB,MAAgB,IAAI,KAAK9nB,MAAWA,KAAUA,IAE9C+L,KAAI4b,GAAI,CAAC,GACT7hB,KAAK6hB,GAAI,CAAC,GACVI,KAAKJ,GAAI,EAAE,GACX3hB,KAAI2hB,GAAI,EAAE,GACV7V,KAAI6V,GAAI,CAAC;AAEf,SAASK,GAAcC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAQ;AACnD,MAAIC,GAASC,GAASC,GAASC,GAC3BvB,GAAOvc,GAAG+d,GAAKC,GAAKC,GAAKC,GAAKC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC;AAE9D,QAAMC,KAAMvB,IAAKI,GACXoB,KAAMtB,IAAKE,GACXqB,KAAMxB,IAAKI,GACXqB,KAAMvB,IAAKE;AAEjB,EAAAa,IAAKK,KAAMG,IACX9e,IAAI+b,KAAW4C,IACfZ,IAAM/d,KAAKA,IAAI2e,KACfX,IAAMW,KAAMZ,GACZ/d,IAAI+b,KAAW+C,IACfb,IAAMje,KAAKA,IAAI8e,KACfZ,IAAMY,KAAMb,GACZM,IAAKP,IAAME,KAAOI,IAAKP,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDM,IAAKK,KAAMD,IACX5e,IAAI+b,KAAW8C,IACfd,IAAM/d,KAAKA,IAAI6e,KACfb,IAAMa,KAAMd,GACZ/d,IAAI+b,KAAW6C,IACfX,IAAMje,KAAKA,IAAI4e,KACfV,IAAMU,KAAMX,GACZQ,IAAKT,IAAME,KAAOM,IAAKT,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDC,IAAKI,IAAKE,GACVlC,IAAQgC,IAAKJ,GACbjd,GAAE,CAAC,IAAIqd,KAAMJ,IAAK5B,MAAUA,IAAQkC,IACpCL,IAAKE,IAAKH,GACV5B,IAAQ6B,IAAKE,GACbD,IAAKC,KAAMF,IAAK7B,MAAU4B,IAAK5B,IAC/B4B,IAAKE,IAAKG,GACVjC,IAAQ8B,IAAKF,GACbjd,GAAE,CAAC,IAAImd,KAAMF,IAAK5B,MAAUA,IAAQiC,IACpCE,IAAKN,IAAKD,GACV5B,IAAQmC,IAAKN,GACbld,GAAE,CAAC,IAAIkd,KAAMM,IAAKnC,MAAU4B,IAAK5B,IACjCrb,GAAE,CAAC,IAAIwd;AAEP,MAAI9J,KAAMiI,GAAS,GAAG3b,EAAC,GACnB6d,KAAW/B,KAAeU;AAoB9B,MAnBI9I,MAAOmK,MAAY,CAACnK,MAAOmK,OAI/BxC,IAAQa,IAAKuB,IACbhB,IAAUP,KAAMuB,KAAMpC,MAAUA,IAAQiB,IACxCjB,IAAQe,IAAKsB,IACbf,IAAUP,KAAMsB,KAAMrC,MAAUA,IAAQiB,IACxCjB,IAAQc,IAAKwB,IACbjB,IAAUP,KAAMwB,KAAMtC,MAAUA,IAAQkB,IACxClB,IAAQgB,IAAKuB,IACbhB,IAAUP,KAAMuB,KAAMvC,MAAUA,IAAQkB,IAEpCE,MAAY,KAAKC,MAAY,KAAKC,MAAY,KAAKC,MAAY,OAInEiB,KAAW9B,KAAeS,IAAS1B,KAAiB,KAAK,IAAIpH,EAAG,GAChEA,MAAQ+J,KAAMb,IAAUgB,KAAMnB,KAAYkB,KAAMhB,IAAUe,KAAMhB,IAC5DhJ,MAAOmK,MAAY,CAACnK,MAAOmK,IAAU,QAAOnK;AAEhD,EAAA0J,IAAKX,IAAUmB,IACf9e,IAAI+b,KAAW4B,GACfI,IAAM/d,KAAKA,IAAI2d,IACfK,IAAML,IAAUI,GAChB/d,IAAI+b,KAAW+C,IACfb,IAAMje,KAAKA,IAAI8e,KACfZ,IAAMY,KAAMb,GACZM,IAAKP,IAAME,KAAOI,IAAKP,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDM,IAAKZ,IAAUgB,IACf5e,IAAI+b,KAAW6B,GACfG,IAAM/d,KAAKA,IAAI4d,IACfI,IAAMJ,IAAUG,GAChB/d,IAAI+b,KAAW6C,IACfX,IAAMje,KAAKA,IAAI4e,KACfV,IAAMU,KAAMX,GACZQ,IAAKT,IAAME,KAAOM,IAAKT,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDC,IAAKI,IAAKE,GACVlC,IAAQgC,IAAKJ,GACblX,GAAE,CAAC,IAAIsX,KAAMJ,IAAK5B,MAAUA,IAAQkC,IACpCL,IAAKE,IAAKH,GACV5B,IAAQ6B,IAAKE,GACbD,IAAKC,KAAMF,IAAK7B,MAAU4B,IAAK5B,IAC/B4B,IAAKE,IAAKG,GACVjC,IAAQ8B,IAAKF,GACblX,GAAE,CAAC,IAAIoX,KAAMF,IAAK5B,MAAUA,IAAQiC,IACpCE,IAAKN,IAAKD,GACV5B,IAAQmC,IAAKN,GACbnX,GAAE,CAAC,IAAImX,KAAMM,IAAKnC,MAAU4B,IAAK5B,IACjCtV,GAAE,CAAC,IAAIyX;AACP,QAAMM,KAAQ/C,GAAI,GAAG/a,IAAG,GAAG+F,IAAGhM,EAAE;AAEhC,EAAAqjB,IAAKK,KAAMb,GACX9d,IAAI+b,KAAW4C,IACfZ,IAAM/d,KAAKA,IAAI2e,KACfX,IAAMW,KAAMZ,GACZ/d,IAAI+b,KAAW+B,GACfG,IAAMje,KAAKA,IAAI8d,IACfI,IAAMJ,IAAUG,GAChBM,IAAKP,IAAME,KAAOI,IAAKP,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDM,IAAKK,KAAMhB,GACX7d,IAAI+b,KAAW8C,IACfd,IAAM/d,KAAKA,IAAI6e,KACfb,IAAMa,KAAMd,GACZ/d,IAAI+b,KAAW8B,GACfI,IAAMje,KAAKA,IAAI6d,IACfK,IAAML,IAAUI,GAChBQ,IAAKT,IAAME,KAAOM,IAAKT,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDC,IAAKI,IAAKE,GACVlC,IAAQgC,IAAKJ,GACblX,GAAE,CAAC,IAAIsX,KAAMJ,IAAK5B,MAAUA,IAAQkC,IACpCL,IAAKE,IAAKH,GACV5B,IAAQ6B,IAAKE,GACbD,IAAKC,KAAMF,IAAK7B,MAAU4B,IAAK5B,IAC/B4B,IAAKE,IAAKG,GACVjC,IAAQ8B,IAAKF,GACblX,GAAE,CAAC,IAAIoX,KAAMF,IAAK5B,MAAUA,IAAQiC,IACpCE,IAAKN,IAAKD,GACV5B,IAAQmC,IAAKN,GACbnX,GAAE,CAAC,IAAImX,KAAMM,IAAKnC,MAAU4B,IAAK5B,IACjCtV,GAAE,CAAC,IAAIyX;AACP,QAAMO,KAAQhD,GAAI+C,IAAO/jB,IAAI,GAAGgM,IAAGiW,EAAE;AAErC,EAAAoB,IAAKX,IAAUG,GACf9d,IAAI+b,KAAW4B,GACfI,IAAM/d,KAAKA,IAAI2d,IACfK,IAAML,IAAUI,GAChB/d,IAAI+b,KAAW+B,GACfG,IAAMje,KAAKA,IAAI8d,IACfI,IAAMJ,IAAUG,GAChBM,IAAKP,IAAME,KAAOI,IAAKP,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDM,IAAKZ,IAAUC,GACf7d,IAAI+b,KAAW6B,GACfG,IAAM/d,KAAKA,IAAI4d,IACfI,IAAMJ,IAAUG,GAChB/d,IAAI+b,KAAW8B,GACfI,IAAMje,KAAKA,IAAI6d,IACfK,IAAML,IAAUI,GAChBQ,IAAKT,IAAME,KAAOM,IAAKT,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDC,IAAKI,IAAKE,GACVlC,IAAQgC,IAAKJ,GACblX,GAAE,CAAC,IAAIsX,KAAMJ,IAAK5B,MAAUA,IAAQkC,IACpCL,IAAKE,IAAKH,GACV5B,IAAQ6B,IAAKE,GACbD,IAAKC,KAAMF,IAAK7B,MAAU4B,IAAK5B,IAC/B4B,IAAKE,IAAKG,GACVjC,IAAQ8B,IAAKF,GACblX,GAAE,CAAC,IAAIoX,KAAMF,IAAK5B,MAAUA,IAAQiC,IACpCE,IAAKN,IAAKD,GACV5B,IAAQmC,IAAKN,GACbnX,GAAE,CAAC,IAAImX,KAAMM,IAAKnC,MAAU4B,IAAK5B,IACjCtV,GAAE,CAAC,IAAIyX;AACP,QAAMQ,KAAOjD,GAAIgD,IAAO/B,IAAI,GAAGjW,IAAG9L,EAAC;AAEnC,SAAOA,GAAE+jB,KAAO,CAAC;AACrB;AAEO,SAASC,GAAS/B,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AAC7C,QAAM2B,KAAW/B,IAAKI,MAAOH,IAAKE,IAC5B6B,KAAYjC,IAAKI,MAAOD,IAAKE,IAC7B7I,IAAMwK,IAAUC,GAEhB3B,IAAS,KAAK,IAAI0B,IAAUC,CAAQ;AAC1C,SAAI,KAAK,IAAIzK,CAAG,KAAKmI,KAAeW,IAAe9I,IAE5C,CAACuI,GAAcC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,CAAM;AACxD;ACjLA,SAAS4B,GAAe59B,GAAG22B,GAAS;AAChC,MAAIp3B,GACAyG,GACA+X,IAAI,GACJc,GACAgf,GACAC,GACAC,GACAC,GACAC,GACAC,GAEA91B,IAAIpI,EAAE,CAAC,GACPkJ,IAAIlJ,EAAE,CAAC,GAEPm+B,IAAcxH,EAAQ;AAC1B,OAAKp3B,IAAI,GAAGA,IAAI4+B,GAAa5+B,KAAK;AAC9B,IAAAyG,IAAK;AACL,QAAIo4B,IAAUzH,EAAQp3B,CAAC,GACnB8+B,IAAaD,EAAQ,SAAS;AAGlC,QADAH,IAAWG,EAAQ,CAAC,GAChBH,EAAS,CAAC,MAAMG,EAAQC,CAAU,EAAE,CAAC,KACrCJ,EAAS,CAAC,MAAMG,EAAQC,CAAU,EAAE,CAAC;AACrC,YAAM,IAAI,MAAM,uDAAuD;AAM3E,SAHAR,IAAKI,EAAS,CAAC,IAAI71B,GACnB01B,IAAKG,EAAS,CAAC,IAAI/0B,GAEdlD,GAAIA,IAAKq4B,GAAYr4B,KAAM;AAM5B,UALAk4B,IAAQE,EAAQp4B,IAAK,CAAC,GAEtB+3B,IAAKG,EAAM,CAAC,IAAI91B,GAChB41B,IAAKE,EAAM,CAAC,IAAIh1B,GAEZ40B,MAAO,KAAKE,MAAO;AACnB,YAAKD,KAAM,KAAKF,KAAM,KAAOA,KAAM,KAAKE,KAAM;AAAM,iBAAO;AAAA,iBACnDC,KAAM,KAAKF,KAAM,KAAOE,KAAM,KAAKF,KAAM,GAAI;AAErD,YADAjf,IAAI4e,GAASI,GAAIE,GAAID,GAAIE,GAAI,GAAG,CAAC,GAC7Bnf,MAAM;AAAK,iBAAO;AACtB,SAAKA,IAAI,KAAKmf,IAAK,KAAKF,KAAM,KAAOjf,IAAI,KAAKmf,KAAM,KAAKF,IAAK,MAAM/f;AAAA,MACpF;AACY,MAAAkgB,IAAWC,GACXJ,IAAKE,GACLH,IAAKE;AAAA,IACjB;AAAA,EACA;AAEI,SAAIhgB,IAAI,MAAM;AAElB;AClDA,SAASugB,GAAsB5rB,GAAOikB,GAASlrB,IAAU,CAAA,GAAI;AAC3D,MAAI,CAACiH;AACH,UAAM,IAAI,MAAM,mBAAmB;AAErC,MAAI,CAACikB;AACH,UAAM,IAAI,MAAM,qBAAqB;AAEvC,QAAMptB,IAAKkuB,GAAS/kB,CAAK,GACnB0jB,IAAOuB,GAAQhB,CAAO,GACtB71B,IAAOs1B,EAAK,MACZrzB,IAAO4zB,EAAQ;AACrB,MAAI4H,IAAQnI,EAAK;AACjB,MAAIrzB,KAAQy7B,GAAOj1B,GAAIxG,CAAI,MAAM;AAC/B,WAAO;AAET,EAAIjC,MAAS,cACXy9B,IAAQ,CAACA,CAAK;AAEhB,MAAI78B,IAAS;AACb,WAASnC,IAAI,GAAGA,IAAIg/B,EAAM,QAAQ,EAAEh/B,GAAG;AACrC,UAAMk/B,IAAaC,GAAIn1B,GAAIg1B,EAAMh/B,CAAC,CAAC;AACnC,QAAIk/B,MAAe,EAAG,QAAO,CAAAhzB,EAAQ;AAChC,IAAIgzB,MAAY/8B,IAAS;AAAA,EAClC;AACE,SAAOA;AACT;AACA,SAAS88B,GAAOj1B,GAAIxG,GAAM;AACxB,SAAOA,EAAK,CAAC,KAAKwG,EAAG,CAAC,KAAKxG,EAAK,CAAC,KAAKwG,EAAG,CAAC,KAAKxG,EAAK,CAAC,KAAKwG,EAAG,CAAC,KAAKxG,EAAK,CAAC,KAAKwG,EAAG,CAAC;AACpF;AC/BA,MAAMo1B,GAAU;AAAA,EACZ,YAAYnzB,IAAO,IAAIozB,IAAUC,IAAgB;AAK7C,QAJA,KAAK,OAAOrzB,GACZ,KAAK,SAAS,KAAK,KAAK,QACxB,KAAK,UAAUozB,GAEX,KAAK,SAAS;AACd,eAASr/B,KAAK,KAAK,UAAU,KAAK,GAAGA,KAAK,GAAGA,IAAK,MAAK,MAAMA,CAAC;AAAA,EAE1E;AAAA,EAEI,KAAKsF,GAAM;AACP,SAAK,KAAK,KAAKA,CAAI,GACnB,KAAK,UACL,KAAK,IAAI,KAAK,SAAS,CAAC;AAAA,EAChC;AAAA,EAEI,MAAM;AACF,QAAI,KAAK,WAAW,EAAG;AAEvB,UAAMi6B,IAAM,KAAK,KAAK,CAAC,GACjBC,IAAS,KAAK,KAAK,IAAG;AAC5B,gBAAK,UAED,KAAK,SAAS,MACd,KAAK,KAAK,CAAC,IAAIA,GACf,KAAK,MAAM,CAAC,IAGTD;AAAA,EACf;AAAA,EAEI,OAAO;AACH,WAAO,KAAK,KAAK,CAAC;AAAA,EAC1B;AAAA,EAEI,IAAIE,GAAK;AACL,UAAM,EAAC,MAAAxzB,GAAM,SAAAozB,EAAO,IAAI,MAClB/5B,IAAO2G,EAAKwzB,CAAG;AAErB,WAAOA,IAAM,KAAG;AACZ,YAAMC,IAAUD,IAAM,KAAM,GACtBE,IAAU1zB,EAAKyzB,CAAM;AAC3B,UAAIL,EAAQ/5B,GAAMq6B,CAAO,KAAK,EAAG;AACjC,MAAA1zB,EAAKwzB,CAAG,IAAIE,GACZF,IAAMC;AAAA,IAClB;AAEQ,IAAAzzB,EAAKwzB,CAAG,IAAIn6B;AAAA,EACpB;AAAA,EAEI,MAAMm6B,GAAK;AACP,UAAM,EAAC,MAAAxzB,GAAM,SAAAozB,EAAO,IAAI,MAClBO,IAAa,KAAK,UAAU,GAC5Bt6B,IAAO2G,EAAKwzB,CAAG;AAErB,WAAOA,IAAMG,KAAY;AACrB,UAAIC,KAAQJ,KAAO,KAAK,GACpBK,IAAO7zB,EAAK4zB,CAAI;AACpB,YAAME,IAAQF,IAAO;AAMrB,UAJIE,IAAQ,KAAK,UAAUV,EAAQpzB,EAAK8zB,CAAK,GAAGD,CAAI,IAAI,MACpDD,IAAOE,GACPD,IAAO7zB,EAAK8zB,CAAK,IAEjBV,EAAQS,GAAMx6B,CAAI,KAAK,EAAG;AAE9B,MAAA2G,EAAKwzB,CAAG,IAAIK,GACZL,IAAMI;AAAA,IAClB;AAEQ,IAAA5zB,EAAKwzB,CAAG,IAAIn6B;AAAA,EACpB;AACA;AAEA,SAASg6B,GAAe9+B,GAAG0B,GAAG;AAC1B,SAAO1B,IAAI0B,IAAI,KAAK1B,IAAI0B,IAAI,IAAI;AACpC;AAEA,SAAS89B,GAAuBnmB,GAAI8J,GAAI;AACpC,SAAI9J,EAAG,EAAE,IAAI8J,EAAG,EAAE,IAAU,IACxB9J,EAAG,EAAE,IAAI8J,EAAG,EAAE,IAAU,KAExB9J,EAAG,EAAE,MAAM8J,EAAG,EAAE,IAAU9J,EAAG,EAAE,IAAI8J,EAAG,EAAE,IAAI,IAAI,KAC7C;AACX;AAEA,SAASsc,GAAwCC,GAAMC,GAAM;AACzD,SAAID,EAAK,gBAAgB,EAAE,IAAIC,EAAK,gBAAgB,EAAE,IAAU,IAC5DD,EAAK,gBAAgB,EAAE,IAAIC,EAAK,gBAAgB,EAAE,IAAU,KAE5DD,EAAK,gBAAgB,EAAE,MAAMC,EAAK,gBAAgB,EAAE,IAAUD,EAAK,gBAAgB,EAAE,IAAIC,EAAK,gBAAgB,EAAE,IAAI,IAAI,KACrH;AACX;AAEA,MAAMC,GAAM;AAAA,EAER,YAAa3/B,GAAG45B,GAAWgG,GAAQC,GAAS;AACxC,SAAK,IAAI;AAAA,MACL,GAAG7/B,EAAE,CAAC;AAAA,MACN,GAAGA,EAAE,CAAC;AAAA,IAClB,GACQ,KAAK,YAAY45B,GACjB,KAAK,SAASgG,GACd,KAAK,UAAUC,GAEf,KAAK,aAAa,MAClB,KAAK,iBAAiB;AAAA,EAC9B;AAAA,EAEI,YAAaC,GAAc;AACvB,WAAO,KAAK,EAAE,MAAMA,EAAa,EAAE,KAAK,KAAK,EAAE,MAAMA,EAAa,EAAE;AAAA,EAC5E;AACA;AAEA,SAASC,GAAgBnI,GAASoI,GAAY;AAC1C,MAAIpI,EAAQ,SAAS,qBAAqB;AACtC,UAAMd,IAAWc,EAAQ;AACzB,aAASr4B,IAAI,GAAGA,IAAIu3B,EAAS,QAAQv3B;AACjC,MAAA0gC,GAAenJ,EAASv3B,CAAC,GAAGygC,CAAU;AAAA,EAElD;AACQ,IAAAC,GAAerI,GAASoI,CAAU;AAE1C;AAEA,IAAIpG,KAAY,GACZgG,KAAS,GACTC,KAAU;AACd,SAASI,GAAgBC,GAAmBF,GAAY;AACpD,QAAM5J,IAAO8J,EAAkB,SAAS,YAAYA,EAAkB,WAAWA;AACjF,MAAI9pB,IAASggB,EAAK;AAElB,GAAIA,EAAK,SAAS,aAAaA,EAAK,SAAS,uBAAmBhgB,IAAS,CAACA,CAAM,IAC5EggB,EAAK,SAAS,iBAAchgB,IAAS,CAAC,CAACA,CAAM,CAAC;AAElD,WAAS7W,IAAI,GAAGA,IAAI6W,EAAO,QAAQ7W;AAC/B,aAASyG,IAAK,GAAGA,IAAKoQ,EAAO7W,CAAC,EAAE,QAAQyG,KAAM;AAC1C,UAAIi4B,IAAW7nB,EAAO7W,CAAC,EAAEyG,CAAE,EAAE,CAAC,GAC1Bk4B,IAAQ;AACZ,MAAA0B,KAASA,KAAS;AAClB,eAASO,IAAM,GAAGA,IAAM/pB,EAAO7W,CAAC,EAAEyG,CAAE,EAAE,SAAS,GAAGm6B,KAAO;AACrD,QAAAjC,IAAQ9nB,EAAO7W,CAAC,EAAEyG,CAAE,EAAEm6B,IAAM,CAAC;AAE7B,cAAM/mB,IAAK,IAAIumB,GAAM1B,GAAUrE,IAAWgG,IAAQC,EAAO,GACnD3c,IAAK,IAAIyc,GAAMzB,GAAOtE,IAAWgG,IAAQC,KAAU,CAAC;AAE1D,QAAAzmB,EAAG,aAAa8J,GAChBA,EAAG,aAAa9J,GAEZmmB,GAAsBnmB,GAAI8J,CAAE,IAAI,KAChCA,EAAG,iBAAiB,IACpB9J,EAAG,iBAAiB,OAEpBA,EAAG,iBAAiB,IACpB8J,EAAG,iBAAiB,KAExB8c,EAAW,KAAK5mB,CAAE,GAClB4mB,EAAW,KAAK9c,CAAE,GAElB+a,IAAWC,GACX2B,KAAUA,KAAU;AAAA,MACpC;AAAA,IACA;AAEI,EAAAjG,KAAYA,KAAY;AAC5B;AAEA,MAAMwG,GAAQ;AAAA,EAEV,YAAaC,GAAO;AAChB,SAAK,iBAAiBA,GACtB,KAAK,kBAAkBA,EAAM;AAAA,EACrC;AACA;AAEA,SAASC,GAAsBb,GAAMC,GAAM;AAGvC,MAFID,MAAS,QAAQC,MAAS,QAE1BD,EAAK,eAAe,WAAWC,EAAK,eAAe,WAClDD,EAAK,gBAAgB,YAAYC,EAAK,cAAc,KACrDD,EAAK,gBAAgB,YAAYC,EAAK,cAAc,KACpDD,EAAK,gBAAgB,YAAYC,EAAK,eAAe,KACrDD,EAAK,eAAe,YAAYC,EAAK,cAAc,KACnDD,EAAK,eAAe,YAAYC,EAAK,eAAe,GAAI,QAAO;AAEnE,QAAMa,IAAKd,EAAK,eAAe,EAAE,GAC3Be,IAAKf,EAAK,eAAe,EAAE,GAC3BgB,IAAKhB,EAAK,gBAAgB,EAAE,GAC5BiB,IAAKjB,EAAK,gBAAgB,EAAE,GAC5BkB,IAAKjB,EAAK,eAAe,EAAE,GAC3BkB,IAAKlB,EAAK,eAAe,EAAE,GAC3BmB,IAAKnB,EAAK,gBAAgB,EAAE,GAC5BoB,IAAKpB,EAAK,gBAAgB,EAAE,GAE5BqB,KAAUD,IAAKF,MAAOH,IAAKF,MAASM,IAAKF,MAAOD,IAAKF,IACrDQ,KAAUH,IAAKF,MAAOH,IAAKI,MAASE,IAAKF,MAAOL,IAAKI,IACrDM,KAAUR,IAAKF,MAAOC,IAAKI,MAASF,IAAKF,MAAOD,IAAKI;AAE3D,MAAII,MAAU;AACV,WAAuC;AAI3C,QAAMG,IAAKF,IAAQD,GACbI,IAAKF,IAAQF;AAEnB,MAAIG,KAAM,KAAKA,KAAM,KAAKC,KAAM,KAAKA,KAAM,GAAG;AAC1C,UAAM/4B,IAAIm4B,IAAMW,KAAMT,IAAKF,IACrBr3B,IAAIs3B,IAAMU,KAAMR,IAAKF;AAC3B,WAAO,CAACp4B,GAAGc,CAAC;AAAA,EACpB;AACI,SAAO;AACX;AAIA,SAASk4B,GAAUpB,GAAYqB,GAAyB;AACpD,EAAAA,IAA0BA,KAAoD;AAE9E,QAAMC,IAAqB,CAAA,GACrBC,IAAW,IAAI5C,GAAU,CAAA,GAAIa,EAAsC;AAEzE,SAAOQ,EAAW,UAAQ;AACtB,UAAMK,IAAQL,EAAW,IAAG;AAC5B,QAAIK,EAAM,gBAAgB;AAEtB,YAAMmB,IAAU,IAAIpB,GAAQC,CAAK;AACjC,eAAS9gC,IAAI,GAAGA,IAAIgiC,EAAS,KAAK,QAAQhiC,KAAK;AAC3C,cAAMkiC,IAAWF,EAAS,KAAKhiC,CAAC;AAChC,YAAI8hC,KACII,EAAS,eAAe,cAAcpB,EAAM;AAAW;AAE/D,cAAMqB,IAAepB,GAAqBkB,GAASC,CAAQ;AAC3D,QAAIC,MAAiB,MAAOJ,EAAmB,KAAKI,CAAY;AAAA,MAChF;AACY,MAAAH,EAAS,KAAKC,CAAO;AAAA,IACjC,MAAe,CAAInB,EAAM,mBAAmB,MAChCkB,EAAS,IAAG;AAAA,EAIxB;AACI,SAAOD;AACX;AAEA,SAASK,GAAwB/J,GAASyJ,GAAyB;AAC/D,QAAMrB,IAAa,IAAIrB,GAAU,CAAA,GAAIY,EAAqB;AAC1D,SAAAQ,GAAenI,GAASoI,CAAU,GAC3BoB,GAASpB,GAAYqB,CAAuB;AACvD;ACrPA,IAAIM,KAAyBC;AAG7B,SAASC,GAAcC,GAAOC,GAAOt2B,IAAU,CAAA,GAAI;AACjD,QAAM,EAAE,kBAAAu2B,IAAmB,IAAM,yBAAAX,IAA0B,GAAI,IAAK51B;AACpE,MAAIqrB,IAAW,CAAA;AACf,EAAIgL,EAAM,SAAS,sBACjBhL,IAAWA,EAAS,OAAOgL,EAAM,QAAQ,IAClCA,EAAM,SAAS,YAAWhL,EAAS,KAAKgL,CAAK,KAC7CA,EAAM,SAAS,gBAAgBA,EAAM,SAAS,aAAaA,EAAM,SAAS,qBAAqBA,EAAM,SAAS,mBACrHhL,EAAS,KAAKX,GAAQ2L,CAAK,CAAC,GAE1BC,EAAM,SAAS,sBACjBjL,IAAWA,EAAS,OAAOiL,EAAM,QAAQ,IAClCA,EAAM,SAAS,YAAWjL,EAAS,KAAKiL,CAAK,KAC7CA,EAAM,SAAS,gBAAgBA,EAAM,SAAS,aAAaA,EAAM,SAAS,qBAAqBA,EAAM,SAAS,mBACrHjL,EAAS,KAAKX,GAAQ4L,CAAK,CAAC;AAE9B,QAAME,IAAgBN;AAAA,IACpBjL,GAAkBI,CAAQ;AAAA,IAC1BuK;AAAA,EACJ;AACE,MAAIa,IAAU,CAAA;AACd,MAAIF,GAAkB;AACpB,UAAMG,IAAS,CAAA;AACf,IAAAF,EAAc,QAAQ,CAACP,MAAiB;AACtC,YAAMtiC,IAAMsiC,EAAa,KAAK,GAAG;AACjC,MAAKS,EAAO/iC,CAAG,MACb+iC,EAAO/iC,CAAG,IAAI,IACd8iC,EAAQ,KAAKR,CAAY;AAAA,IAEjC,CAAK;AAAA,EACL;AACI,IAAAQ,IAAUD;AAEZ,SAAOvL,GAAkBwL,EAAQ,IAAI,CAAC3zB,MAAMmE,GAAMnE,CAAC,CAAC,CAAC;AACvD;ACxCe,SAAS6zB,GAAYC,GAAKtkB,GAAGqhB,GAAME,GAAOV,GAAS;AAC9D,EAAA0D,GAAgBD,GAAKtkB,GAAGqhB,KAAQ,GAAGE,KAAU+C,EAAI,SAAS,GAAIzD,KAAWC,EAAc;AAC3F;AAEA,SAASyD,GAAgBD,GAAKtkB,GAAGqhB,GAAME,GAAOV,GAAS;AAEnD,SAAOU,IAAQF,KAAM;AACjB,QAAIE,IAAQF,IAAO,KAAK;AACpB,UAAIt1B,IAAIw1B,IAAQF,IAAO,GACnB7R,IAAIxP,IAAIqhB,IAAO,GACf3iB,IAAI,KAAK,IAAI3S,CAAC,GACdkU,IAAI,MAAM,KAAK,IAAI,IAAIvB,IAAI,CAAC,GAC5B8lB,IAAK,MAAM,KAAK,KAAK9lB,IAAIuB,KAAKlU,IAAIkU,KAAKlU,CAAC,KAAKyjB,IAAIzjB,IAAI,IAAI,IAAI,KAAK,IAClE04B,IAAU,KAAK,IAAIpD,GAAM,KAAK,MAAMrhB,IAAIwP,IAAIvP,IAAIlU,IAAIy4B,CAAE,CAAC,GACvDE,IAAW,KAAK,IAAInD,GAAO,KAAK,MAAMvhB,KAAKjU,IAAIyjB,KAAKvP,IAAIlU,IAAIy4B,CAAE,CAAC;AACnE,MAAAD,GAAgBD,GAAKtkB,GAAGykB,GAASC,GAAU7D,CAAO;AAAA,IAC9D;AAEQ,QAAI3qB,IAAIouB,EAAItkB,CAAC,GACTxe,IAAI6/B,GACJlyB,IAAIoyB;AAKR,SAHAoD,GAAKL,GAAKjD,GAAMrhB,CAAC,GACb6gB,EAAQyD,EAAI/C,CAAK,GAAGrrB,CAAC,IAAI,KAAGyuB,GAAKL,GAAKjD,GAAME,CAAK,GAE9C//B,IAAI2N,KAAG;AAIV,WAHAw1B,GAAKL,GAAK9iC,GAAG2N,CAAC,GACd3N,KACA2N,KACO0xB,EAAQyD,EAAI9iC,CAAC,GAAG0U,CAAC,IAAI,IAAG,CAAA1U;AAC/B,aAAOq/B,EAAQyD,EAAIn1B,CAAC,GAAG+G,CAAC,IAAI,IAAG,CAAA/G;AAAA,IAC3C;AAEQ,IAAI0xB,EAAQyD,EAAIjD,CAAI,GAAGnrB,CAAC,MAAM,IAAGyuB,GAAKL,GAAKjD,GAAMlyB,CAAC,KAE9CA,KACAw1B,GAAKL,GAAKn1B,GAAGoyB,CAAK,IAGlBpyB,KAAK6Q,MAAGqhB,IAAOlyB,IAAI,IACnB6Q,KAAK7Q,MAAGoyB,IAAQpyB,IAAI;AAAA,EAChC;AACA;AAEA,SAASw1B,GAAKL,GAAK,GAAGn1B,GAAG;AACrB,MAAIgU,IAAMmhB,EAAI,CAAC;AACf,EAAAA,EAAI,CAAC,IAAIA,EAAIn1B,CAAC,GACdm1B,EAAIn1B,CAAC,IAAIgU;AACb;AAEA,SAAS2d,GAAe9+B,GAAG0B,GAAG;AAC1B,SAAO1B,IAAI0B,IAAI,KAAK1B,IAAI0B,IAAI,IAAI;AACpC;ACnDe,MAAMkhC,GAAM;AAAA,EACvB,YAAYC,IAAa,GAAG;AAExB,SAAK,cAAc,KAAK,IAAI,GAAGA,CAAU,GACzC,KAAK,cAAc,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,cAAc,GAAG,CAAC,GAChE,KAAK,MAAK;AAAA,EAClB;AAAA,EAEI,MAAM;AACF,WAAO,KAAK,KAAK,KAAK,MAAM,CAAA,CAAE;AAAA,EACtC;AAAA,EAEI,OAAO7/B,GAAM;AACT,QAAIpC,IAAO,KAAK;AAChB,UAAMe,IAAS,CAAA;AAEf,QAAI,CAACmhC,GAAW9/B,GAAMpC,CAAI,EAAG,QAAOe;AAEpC,UAAMohC,IAAS,KAAK,QACdC,IAAgB,CAAA;AAEtB,WAAOpiC,KAAM;AACT,eAASpB,IAAI,GAAGA,IAAIoB,EAAK,SAAS,QAAQpB,KAAK;AAC3C,cAAMsB,IAAQF,EAAK,SAASpB,CAAC,GACvByjC,IAAYriC,EAAK,OAAOmiC,EAAOjiC,CAAK,IAAIA;AAE9C,QAAIgiC,GAAW9/B,GAAMigC,CAAS,MACtBriC,EAAK,OAAMe,EAAO,KAAKb,CAAK,IACvBoiC,GAASlgC,GAAMigC,CAAS,IAAG,KAAK,KAAKniC,GAAOa,CAAM,IACtDqhC,EAAc,KAAKliC,CAAK;AAAA,MAEjD;AACY,MAAAF,IAAOoiC,EAAc,IAAG;AAAA,IACpC;AAEQ,WAAOrhC;AAAA,EACf;AAAA,EAEI,SAASqB,GAAM;AACX,QAAIpC,IAAO,KAAK;AAEhB,QAAI,CAACkiC,GAAW9/B,GAAMpC,CAAI,EAAG,QAAO;AAEpC,UAAMoiC,IAAgB,CAAA;AACtB,WAAOpiC,KAAM;AACT,eAASpB,IAAI,GAAGA,IAAIoB,EAAK,SAAS,QAAQpB,KAAK;AAC3C,cAAMsB,IAAQF,EAAK,SAASpB,CAAC,GACvByjC,IAAYriC,EAAK,OAAO,KAAK,OAAOE,CAAK,IAAIA;AAEnD,YAAIgiC,GAAW9/B,GAAMigC,CAAS,GAAG;AAC7B,cAAIriC,EAAK,QAAQsiC,GAASlgC,GAAMigC,CAAS,EAAG,QAAO;AACnD,UAAAD,EAAc,KAAKliC,CAAK;AAAA,QAC5C;AAAA,MACA;AACY,MAAAF,IAAOoiC,EAAc,IAAG;AAAA,IACpC;AAEQ,WAAO;AAAA,EACf;AAAA,EAEI,KAAKv3B,GAAM;AACP,QAAI,EAAEA,KAAQA,EAAK,QAAS,QAAO;AAEnC,QAAIA,EAAK,SAAS,KAAK,aAAa;AAChC,eAASjM,IAAI,GAAGA,IAAIiM,EAAK,QAAQjM;AAC7B,aAAK,OAAOiM,EAAKjM,CAAC,CAAC;AAEvB,aAAO;AAAA,IACnB;AAGQ,QAAIoB,IAAO,KAAK,OAAO6K,EAAK,SAAS,GAAGA,EAAK,SAAS,GAAG,CAAC;AAE1D,QAAI,CAAC,KAAK,KAAK,SAAS;AAEpB,WAAK,OAAO7K;AAAA,aAEL,KAAK,KAAK,WAAWA,EAAK;AAEjC,WAAK,WAAW,KAAK,MAAMA,CAAI;AAAA,SAE5B;AACH,UAAI,KAAK,KAAK,SAASA,EAAK,QAAQ;AAEhC,cAAMuiC,IAAU,KAAK;AACrB,aAAK,OAAOviC,GACZA,IAAOuiC;AAAA,MACvB;AAGY,WAAK,QAAQviC,GAAM,KAAK,KAAK,SAASA,EAAK,SAAS,GAAG,EAAI;AAAA,IACvE;AAEQ,WAAO;AAAA,EACf;AAAA,EAEI,OAAOkE,GAAM;AACT,WAAIA,KAAM,KAAK,QAAQA,GAAM,KAAK,KAAK,SAAS,CAAC,GAC1C;AAAA,EACf;AAAA,EAEI,QAAQ;AACJ,gBAAK,OAAOs+B,GAAW,EAAE,GAClB;AAAA,EACf;AAAA,EAEI,OAAOt+B,GAAMu+B,GAAU;AACnB,QAAI,CAACv+B,EAAM,QAAO;AAElB,QAAIlE,IAAO,KAAK;AAChB,UAAMoC,IAAO,KAAK,OAAO8B,CAAI,GACvBw+B,IAAO,CAAA,GACPC,IAAU,CAAA;AAChB,QAAI/jC,GAAG0/B,GAAQsE;AAGf,WAAO5iC,KAAQ0iC,EAAK,UAAQ;AASxB,UAPK1iC,MACDA,IAAO0iC,EAAK,IAAG,GACfpE,IAASoE,EAAKA,EAAK,SAAS,CAAC,GAC7B9jC,IAAI+jC,EAAQ,IAAG,GACfC,IAAU,KAGV5iC,EAAK,MAAM;AACX,cAAMwM,IAAQq2B,GAAS3+B,GAAMlE,EAAK,UAAUyiC,CAAQ;AAEpD,YAAIj2B,MAAU;AAEV,iBAAAxM,EAAK,SAAS,OAAOwM,GAAO,CAAC,GAC7Bk2B,EAAK,KAAK1iC,CAAI,GACd,KAAK,UAAU0iC,CAAI,GACZ;AAAA,MAE3B;AAEY,MAAI,CAACE,KAAW,CAAC5iC,EAAK,QAAQsiC,GAAStiC,GAAMoC,CAAI,KAC7CsgC,EAAK,KAAK1iC,CAAI,GACd2iC,EAAQ,KAAK/jC,CAAC,GACdA,IAAI,GACJ0/B,IAASt+B,GACTA,IAAOA,EAAK,SAAS,CAAC,KAEfs+B,KACP1/B,KACAoB,IAAOs+B,EAAO,SAAS1/B,CAAC,GACxBgkC,IAAU,MAEP5iC,IAAO;AAAA,IAC1B;AAEQ,WAAO;AAAA,EACf;AAAA,EAEI,OAAOkE,GAAM;AAAE,WAAOA;AAAA,EAAK;AAAA,EAE3B,YAAY9E,GAAG0B,GAAG;AAAE,WAAO1B,EAAE,OAAO0B,EAAE;AAAA,EAAK;AAAA,EAC3C,YAAY1B,GAAG0B,GAAG;AAAE,WAAO1B,EAAE,OAAO0B,EAAE;AAAA,EAAK;AAAA,EAE3C,SAAS;AAAE,WAAO,KAAK;AAAA,EAAK;AAAA,EAE5B,SAAS+J,GAAM;AACX,gBAAK,OAAOA,GACL;AAAA,EACf;AAAA,EAEI,KAAK7K,GAAMe,GAAQ;AACf,UAAMqhC,IAAgB,CAAA;AACtB,WAAOpiC;AACH,MAAIA,EAAK,OAAMe,EAAO,KAAK,GAAGf,EAAK,QAAQ,IACtCoiC,EAAc,KAAK,GAAGpiC,EAAK,QAAQ,GAExCA,IAAOoiC,EAAc,IAAG;AAE5B,WAAOrhC;AAAA,EACf;AAAA,EAEI,OAAO+hC,GAAOrE,GAAME,GAAOoE,GAAQ;AAE/B,UAAMprB,IAAIgnB,IAAQF,IAAO;AACzB,QAAI3mB,IAAI,KAAK,aACT9X;AAEJ,QAAI2X,KAAKG;AAEL,aAAA9X,IAAOwiC,GAAWM,EAAM,MAAMrE,GAAME,IAAQ,CAAC,CAAC,GAC9CqE,GAAShjC,GAAM,KAAK,MAAM,GACnBA;AAGX,IAAK+iC,MAEDA,IAAS,KAAK,KAAK,KAAK,IAAIprB,CAAC,IAAI,KAAK,IAAIG,CAAC,CAAC,GAG5CA,IAAI,KAAK,KAAKH,IAAI,KAAK,IAAIG,GAAGirB,IAAS,CAAC,CAAC,IAG7C/iC,IAAOwiC,GAAW,EAAE,GACpBxiC,EAAK,OAAO,IACZA,EAAK,SAAS+iC;AAId,UAAME,IAAK,KAAK,KAAKtrB,IAAIG,CAAC,GACpBY,IAAKuqB,IAAK,KAAK,KAAK,KAAK,KAAKnrB,CAAC,CAAC;AAEtC,IAAAorB,GAAYJ,GAAOrE,GAAME,GAAOjmB,GAAI,KAAK,WAAW;AAEpD,aAAS9Z,IAAI6/B,GAAM7/B,KAAK+/B,GAAO//B,KAAK8Z,GAAI;AAEpC,YAAMyqB,IAAS,KAAK,IAAIvkC,IAAI8Z,IAAK,GAAGimB,CAAK;AAEzC,MAAAuE,GAAYJ,GAAOlkC,GAAGukC,GAAQF,GAAI,KAAK,WAAW;AAElD,eAAS12B,IAAI3N,GAAG2N,KAAK42B,GAAQ52B,KAAK02B,GAAI;AAElC,cAAMG,IAAS,KAAK,IAAI72B,IAAI02B,IAAK,GAAGE,CAAM;AAG1C,QAAAnjC,EAAK,SAAS,KAAK,KAAK,OAAO8iC,GAAOv2B,GAAG62B,GAAQL,IAAS,CAAC,CAAC;AAAA,MAC5E;AAAA,IACA;AAEQ,WAAAC,GAAShjC,GAAM,KAAK,MAAM,GAEnBA;AAAA,EACf;AAAA,EAEI,eAAeoC,GAAMpC,GAAMqjC,GAAOX,GAAM;AACpC,WACIA,EAAK,KAAK1iC,CAAI,GAEV,EAAAA,EAAK,QAAQ0iC,EAAK,SAAS,MAAMW,MAH5B;AAKT,UAAIC,IAAU,OACVC,IAAiB,OACjBC;AAEJ,eAAS5kC,IAAI,GAAGA,IAAIoB,EAAK,SAAS,QAAQpB,KAAK;AAC3C,cAAMsB,IAAQF,EAAK,SAASpB,CAAC,GACvBuD,IAAOshC,GAASvjC,CAAK,GACrBwjC,IAAcC,GAAavhC,GAAMlC,CAAK,IAAIiC;AAGhD,QAAIuhC,IAAcH,KACdA,IAAiBG,GACjBJ,IAAUnhC,IAAOmhC,IAAUnhC,IAAOmhC,GAClCE,IAAatjC,KAENwjC,MAAgBH,KAEnBphC,IAAOmhC,MACPA,IAAUnhC,GACVqhC,IAAatjC;AAAA,MAGrC;AAEY,MAAAF,IAAOwjC,KAAcxjC,EAAK,SAAS,CAAC;AAAA,IAChD;AAEQ,WAAOA;AAAA,EACf;AAAA,EAEI,QAAQkE,GAAMm/B,GAAOO,GAAQ;AACzB,UAAMxhC,IAAOwhC,IAAS1/B,IAAO,KAAK,OAAOA,CAAI,GACvC2/B,IAAa,CAAA,GAGb7jC,IAAO,KAAK,eAAeoC,GAAM,KAAK,MAAMihC,GAAOQ,CAAU;AAOnE,SAJA7jC,EAAK,SAAS,KAAKkE,CAAI,GACvB+K,GAAOjP,GAAMoC,CAAI,GAGVihC,KAAS,KACRQ,EAAWR,CAAK,EAAE,SAAS,SAAS,KAAK;AACzC,WAAK,OAAOQ,GAAYR,CAAK,GAC7BA;AAKR,SAAK,oBAAoBjhC,GAAMyhC,GAAYR,CAAK;AAAA,EACxD;AAAA;AAAA,EAGI,OAAOQ,GAAYR,GAAO;AACtB,UAAMrjC,IAAO6jC,EAAWR,CAAK,GACvBvrB,IAAI9X,EAAK,SAAS,QAClB4sB,IAAI,KAAK;AAEf,SAAK,iBAAiB5sB,GAAM4sB,GAAG9U,CAAC;AAEhC,UAAMgsB,IAAa,KAAK,kBAAkB9jC,GAAM4sB,GAAG9U,CAAC,GAE9CisB,IAAUvB,GAAWxiC,EAAK,SAAS,OAAO8jC,GAAY9jC,EAAK,SAAS,SAAS8jC,CAAU,CAAC;AAC9F,IAAAC,EAAQ,SAAS/jC,EAAK,QACtB+jC,EAAQ,OAAO/jC,EAAK,MAEpBgjC,GAAShjC,GAAM,KAAK,MAAM,GAC1BgjC,GAASe,GAAS,KAAK,MAAM,GAEzBV,IAAOQ,EAAWR,IAAQ,CAAC,EAAE,SAAS,KAAKU,CAAO,IACjD,KAAK,WAAW/jC,GAAM+jC,CAAO;AAAA,EAC1C;AAAA,EAEI,WAAW/jC,GAAM+jC,GAAS;AAEtB,SAAK,OAAOvB,GAAW,CAACxiC,GAAM+jC,CAAO,CAAC,GACtC,KAAK,KAAK,SAAS/jC,EAAK,SAAS,GACjC,KAAK,KAAK,OAAO,IACjBgjC,GAAS,KAAK,MAAM,KAAK,MAAM;AAAA,EACvC;AAAA,EAEI,kBAAkBhjC,GAAM4sB,GAAG9U,GAAG;AAC1B,QAAItL,GACAw3B,IAAa,OACbV,IAAU;AAEd,aAAS1kC,IAAIguB,GAAGhuB,KAAKkZ,IAAI8U,GAAGhuB,KAAK;AAC7B,YAAMqlC,IAAQC,GAASlkC,GAAM,GAAGpB,GAAG,KAAK,MAAM,GACxCulC,IAAQD,GAASlkC,GAAMpB,GAAGkZ,GAAG,KAAK,MAAM,GAExCssB,IAAUC,GAAiBJ,GAAOE,CAAK,GACvChiC,IAAOshC,GAASQ,CAAK,IAAIR,GAASU,CAAK;AAG7C,MAAIC,IAAUJ,KACVA,IAAaI,GACb53B,IAAQ5N,GAER0kC,IAAUnhC,IAAOmhC,IAAUnhC,IAAOmhC,KAE3Bc,MAAYJ,KAEf7hC,IAAOmhC,MACPA,IAAUnhC,GACVqK,IAAQ5N;AAAA,IAG5B;AAEQ,WAAO4N,KAASsL,IAAI8U;AAAA,EAC5B;AAAA;AAAA,EAGI,iBAAiB5sB,GAAM4sB,GAAG9U,GAAG;AACzB,UAAMwsB,IAActkC,EAAK,OAAO,KAAK,cAAcukC,IAC7CC,IAAcxkC,EAAK,OAAO,KAAK,cAAcykC,IAC7CC,IAAU,KAAK,eAAe1kC,GAAM4sB,GAAG9U,GAAGwsB,CAAW,GACrDK,IAAU,KAAK,eAAe3kC,GAAM4sB,GAAG9U,GAAG0sB,CAAW;AAI3D,IAAIE,IAAUC,KAAS3kC,EAAK,SAAS,KAAKskC,CAAW;AAAA,EAC7D;AAAA;AAAA,EAGI,eAAetkC,GAAM4sB,GAAG9U,GAAGmmB,GAAS;AAChC,IAAAj+B,EAAK,SAAS,KAAKi+B,CAAO;AAE1B,UAAMkE,IAAS,KAAK,QACdyC,IAAWV,GAASlkC,GAAM,GAAG4sB,GAAGuV,CAAM,GACtC0C,IAAYX,GAASlkC,GAAM8X,IAAI8U,GAAG9U,GAAGqqB,CAAM;AACjD,QAAI2C,IAASC,GAAWH,CAAQ,IAAIG,GAAWF,CAAS;AAExD,aAASjmC,IAAIguB,GAAGhuB,IAAIkZ,IAAI8U,GAAGhuB,KAAK;AAC5B,YAAMsB,IAAQF,EAAK,SAASpB,CAAC;AAC7B,MAAAqQ,GAAO21B,GAAU5kC,EAAK,OAAOmiC,EAAOjiC,CAAK,IAAIA,CAAK,GAClD4kC,KAAUC,GAAWH,CAAQ;AAAA,IACzC;AAEQ,aAAShmC,IAAIkZ,IAAI8U,IAAI,GAAGhuB,KAAKguB,GAAGhuB,KAAK;AACjC,YAAMsB,IAAQF,EAAK,SAASpB,CAAC;AAC7B,MAAAqQ,GAAO41B,GAAW7kC,EAAK,OAAOmiC,EAAOjiC,CAAK,IAAIA,CAAK,GACnD4kC,KAAUC,GAAWF,CAAS;AAAA,IAC1C;AAEQ,WAAOC;AAAA,EACf;AAAA,EAEI,oBAAoB1iC,GAAMsgC,GAAMW,GAAO;AAEnC,aAASzkC,IAAIykC,GAAOzkC,KAAK,GAAGA;AACxB,MAAAqQ,GAAOyzB,EAAK9jC,CAAC,GAAGwD,CAAI;AAAA,EAEhC;AAAA,EAEI,UAAUsgC,GAAM;AAEZ,aAAS9jC,IAAI8jC,EAAK,SAAS,GAAGsC,GAAUpmC,KAAK,GAAGA;AAC5C,MAAI8jC,EAAK9jC,CAAC,EAAE,SAAS,WAAW,IACxBA,IAAI,KACJomC,IAAWtC,EAAK9jC,IAAI,CAAC,EAAE,UACvBomC,EAAS,OAAOA,EAAS,QAAQtC,EAAK9jC,CAAC,CAAC,GAAG,CAAC,KAEzC,KAAK,MAAK,IAEdokC,GAASN,EAAK9jC,CAAC,GAAG,KAAK,MAAM;AAAA,EAEhD;AACA;AAEA,SAASikC,GAAS3+B,GAAM4+B,GAAOL,GAAU;AACrC,MAAI,CAACA,EAAU,QAAOK,EAAM,QAAQ5+B,CAAI;AAExC,WAAStF,IAAI,GAAGA,IAAIkkC,EAAM,QAAQlkC;AAC9B,QAAI6jC,EAASv+B,GAAM4+B,EAAMlkC,CAAC,CAAC,EAAG,QAAOA;AAEzC,SAAO;AACX;AAGA,SAASokC,GAAShjC,GAAMmiC,GAAQ;AAC5B,EAAA+B,GAASlkC,GAAM,GAAGA,EAAK,SAAS,QAAQmiC,GAAQniC,CAAI;AACxD;AAGA,SAASkkC,GAASlkC,GAAMod,GAAG/d,GAAG8iC,GAAQ8C,GAAU;AAC5C,EAAKA,MAAUA,IAAWzC,GAAW,IAAI,IACzCyC,EAAS,OAAO,OAChBA,EAAS,OAAO,OAChBA,EAAS,OAAO,QAChBA,EAAS,OAAO;AAEhB,WAASrmC,IAAIwe,GAAGxe,IAAIS,GAAGT,KAAK;AACxB,UAAMsB,IAAQF,EAAK,SAASpB,CAAC;AAC7B,IAAAqQ,GAAOg2B,GAAUjlC,EAAK,OAAOmiC,EAAOjiC,CAAK,IAAIA,CAAK;AAAA,EAC1D;AAEI,SAAO+kC;AACX;AAEA,SAASh2B,GAAO7P,GAAG0B,GAAG;AAClB,SAAA1B,EAAE,OAAO,KAAK,IAAIA,EAAE,MAAM0B,EAAE,IAAI,GAChC1B,EAAE,OAAO,KAAK,IAAIA,EAAE,MAAM0B,EAAE,IAAI,GAChC1B,EAAE,OAAO,KAAK,IAAIA,EAAE,MAAM0B,EAAE,IAAI,GAChC1B,EAAE,OAAO,KAAK,IAAIA,EAAE,MAAM0B,EAAE,IAAI,GACzB1B;AACX;AAEA,SAASmlC,GAAgBnlC,GAAG0B,GAAG;AAAE,SAAO1B,EAAE,OAAO0B,EAAE;AAAK;AACxD,SAAS2jC,GAAgBrlC,GAAG0B,GAAG;AAAE,SAAO1B,EAAE,OAAO0B,EAAE;AAAK;AAExD,SAAS2iC,GAASrkC,GAAK;AAAE,UAAQA,EAAE,OAAOA,EAAE,SAASA,EAAE,OAAOA,EAAE;AAAM;AACtE,SAAS2lC,GAAW3lC,GAAG;AAAE,SAAQA,EAAE,OAAOA,EAAE,QAASA,EAAE,OAAOA,EAAE;AAAM;AAEtE,SAASukC,GAAavkC,GAAG0B,GAAG;AACxB,UAAQ,KAAK,IAAIA,EAAE,MAAM1B,EAAE,IAAI,IAAI,KAAK,IAAI0B,EAAE,MAAM1B,EAAE,IAAI,MAClD,KAAK,IAAI0B,EAAE,MAAM1B,EAAE,IAAI,IAAI,KAAK,IAAI0B,EAAE,MAAM1B,EAAE,IAAI;AAC9D;AAEA,SAASilC,GAAiBjlC,GAAG0B,GAAG;AAC5B,QAAMiS,IAAO,KAAK,IAAI3T,EAAE,MAAM0B,EAAE,IAAI,GAC9BqL,IAAO,KAAK,IAAI/M,EAAE,MAAM0B,EAAE,IAAI,GAC9BoL,IAAO,KAAK,IAAI9M,EAAE,MAAM0B,EAAE,IAAI,GAC9BkS,IAAO,KAAK,IAAI5T,EAAE,MAAM0B,EAAE,IAAI;AAEpC,SAAO,KAAK,IAAI,GAAGoL,IAAO6G,CAAI,IACvB,KAAK,IAAI,GAAGC,IAAO7G,CAAI;AAClC;AAEA,SAASm2B,GAASljC,GAAG0B,GAAG;AACpB,SAAO1B,EAAE,QAAQ0B,EAAE,QACZ1B,EAAE,QAAQ0B,EAAE,QACZA,EAAE,QAAQ1B,EAAE,QACZ0B,EAAE,QAAQ1B,EAAE;AACvB;AAEA,SAAS8iC,GAAW9iC,GAAG0B,GAAG;AACtB,SAAOA,EAAE,QAAQ1B,EAAE,QACZ0B,EAAE,QAAQ1B,EAAE,QACZ0B,EAAE,QAAQ1B,EAAE,QACZ0B,EAAE,QAAQ1B,EAAE;AACvB;AAEA,SAASojC,GAAW0C,GAAU;AAC1B,SAAO;AAAA,IACH,UAAAA;AAAA,IACA,QAAQ;AAAA,IACR,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,EACd;AACA;AAKA,SAAShC,GAAYxB,GAAKjD,GAAME,GAAOx1B,GAAG80B,GAAS;AAC/C,QAAMkH,IAAQ,CAAC1G,GAAME,CAAK;AAE1B,SAAOwG,EAAM,UAAQ;AAIjB,QAHAxG,IAAQwG,EAAM,IAAG,GACjB1G,IAAO0G,EAAM,IAAG,GAEZxG,IAAQF,KAAQt1B,EAAG;AAEvB,UAAMi8B,IAAM3G,IAAO,KAAK,MAAME,IAAQF,KAAQt1B,IAAI,CAAC,IAAIA;AACvD,IAAAs4B,GAAYC,GAAK0D,GAAK3G,GAAME,GAAOV,CAAO,GAE1CkH,EAAM,KAAK1G,GAAM2G,GAAKA,GAAKzG,CAAK;AAAA,EACxC;AACA;AC1fA,SAAS0G,GAAapD,GAAY;AAChC,MAAIqD,IAAO,IAAIC,GAAMtD,CAAU;AAC/B,SAAAqD,EAAK,SAAS,SAAS9P,GAAS;AAC9B,QAAIA,EAAQ,SAAS,UAAW,OAAM,IAAI,MAAM,iBAAiB;AACjE,WAAAA,EAAQ,OAAOA,EAAQ,OAAOA,EAAQ,OAAOgQ,GAAShQ,CAAO,GACtD+P,GAAM,UAAU,OAAO,KAAK,MAAM/P,CAAO;AAAA,EACpD,GACE8P,EAAK,OAAO,SAASnP,GAAU;AAC7B,QAAIsP,IAAO,CAAA;AACX,WAAI,MAAM,QAAQtP,CAAQ,IACxBA,EAAS,QAAQ,SAASX,GAAS;AACjC,UAAIA,EAAQ,SAAS,UAAW,OAAM,IAAI,MAAM,kBAAkB;AAClE,MAAAA,EAAQ,OAAOA,EAAQ,OAAOA,EAAQ,OAAOgQ,GAAShQ,CAAO,GAC7DiQ,EAAK,KAAKjQ,CAAO;AAAA,IACzB,CAAO,IAEDiD,GAAYtC,GAAU,SAASX,GAAS;AACtC,UAAIA,EAAQ,SAAS,UAAW,OAAM,IAAI,MAAM,kBAAkB;AAClE,MAAAA,EAAQ,OAAOA,EAAQ,OAAOA,EAAQ,OAAOgQ,GAAShQ,CAAO,GAC7DiQ,EAAK,KAAKjQ,CAAO;AAAA,IACzB,CAAO,GAEI+P,GAAM,UAAU,KAAK,KAAK,MAAME,CAAI;AAAA,EAC/C,GACEH,EAAK,SAAS,SAAS9P,GAASkQ,GAAQ;AACtC,QAAIlQ,EAAQ,SAAS,UAAW,OAAM,IAAI,MAAM,iBAAiB;AACjE,WAAAA,EAAQ,OAAOA,EAAQ,OAAOA,EAAQ,OAAOgQ,GAAShQ,CAAO,GACtD+P,GAAM,UAAU,OAAO,KAAK,MAAM/P,GAASkQ,CAAM;AAAA,EAC5D,GACEJ,EAAK,QAAQ,WAAW;AACtB,WAAOC,GAAM,UAAU,MAAM,KAAK,IAAI;AAAA,EAC1C,GACED,EAAK,SAAS,SAASrO,GAAS;AAC9B,QAAId,IAAWoP,GAAM,UAAU,OAAO,KAAK,MAAM,KAAK,OAAOtO,CAAO,CAAC;AACrE,WAAOlB,GAAkBI,CAAQ;AAAA,EACrC,GACEmP,EAAK,WAAW,SAASrO,GAAS;AAChC,WAAOsO,GAAM,UAAU,SAAS,KAAK,MAAM,KAAK,OAAOtO,CAAO,CAAC;AAAA,EACnE,GACEqO,EAAK,MAAM,WAAW;AACpB,QAAInP,IAAWoP,GAAM,UAAU,IAAI,KAAK,IAAI;AAC5C,WAAOxP,GAAkBI,CAAQ;AAAA,EACrC,GACEmP,EAAK,SAAS,WAAW;AACvB,WAAOC,GAAM,UAAU,OAAO,KAAK,IAAI;AAAA,EAC3C,GACED,EAAK,WAAW,SAAS/2B,GAAM;AAC7B,WAAOg3B,GAAM,UAAU,SAAS,KAAK,MAAMh3B,CAAI;AAAA,EACnD,GACE+2B,EAAK,SAAS,SAASrO,GAAS;AAC9B,QAAI70B;AACJ,QAAI60B,EAAQ,KAAM,CAAA70B,IAAO60B,EAAQ;AAAA,aACxB,MAAM,QAAQA,CAAO,KAAKA,EAAQ,WAAW,EAAG,CAAA70B,IAAO60B;AAAA,aACvD,MAAM,QAAQA,CAAO,KAAKA,EAAQ,WAAW;AACpD,MAAA70B,IAAO,CAAC60B,EAAQ,CAAC,GAAGA,EAAQ,CAAC,GAAGA,EAAQ,CAAC,GAAGA,EAAQ,CAAC,CAAC;AAAA,aAC/CA,EAAQ,SAAS,UAAW,CAAA70B,IAAOojC,GAASvO,CAAO;AAAA,aACnDA,EAAQ,SAAS,oBAAqB,CAAA70B,IAAOojC,GAASvO,CAAO;AAAA,QACjE,OAAM,IAAI,MAAM,iBAAiB;AACtC,WAAO;AAAA,MACL,MAAM70B,EAAK,CAAC;AAAA,MACZ,MAAMA,EAAK,CAAC;AAAA,MACZ,MAAMA,EAAK,CAAC;AAAA,MACZ,MAAMA,EAAK,CAAC;AAAA,IAClB;AAAA,EACA,GACSkjC;AACT;ACnEA,SAASK,GAAY1O,GAAS;AAC5B,MAAI,CAACA;AACH,UAAM,IAAI,MAAM,qBAAqB;AAEvC,QAAMsK,IAAU,CAAA;AAChB,SAAArI,GAAYjC,GAAS,CAACzB,MAAY;AAChC,IAAAoQ,GAAmBpQ,GAAS+L,CAAO;AAAA,EACvC,CAAG,GACMxL,GAAkBwL,CAAO;AAClC;AACA,SAASqE,GAAmB3O,GAASsK,GAAS;AAC5C,MAAI9rB,IAAS,CAAA;AACb,QAAMkiB,IAAWV,EAAQ;AACzB,MAAIU,MAAa,MAAM;AACrB,YAAQA,EAAS,MAAI;AAAA,MACnB,KAAK;AACH,QAAAliB,IAASshB,GAAUY,CAAQ;AAC3B;AAAA,MACF,KAAK;AACH,QAAAliB,IAAS,CAACshB,GAAUY,CAAQ,CAAC;AAAA,IACrC;AACI,IAAAliB,EAAO,QAAQ,CAACM,MAAU;AAExB,MADiB8vB,GAAe9vB,GAAOkhB,EAAQ,UAAU,EAChD,QAAQ,CAAC4J,MAAY;AAC5B,QAAAA,EAAQ,KAAKU,EAAQ,QACrBA,EAAQ,KAAKV,CAAO;AAAA,MAC5B,CAAO;AAAA,IACP,CAAK;AAAA,EACL;AACA;AACA,SAASgF,GAAepwB,GAAQigB,GAAY;AAC1C,QAAMoQ,IAAW,CAAA;AACjB,SAAArwB,EAAO,OAAO,CAACswB,GAAgBC,MAAkB;AAC/C,UAAMnF,IAAU3K,GAAW,CAAC6P,GAAgBC,CAAa,GAAGtQ,CAAU;AACtE,WAAAmL,EAAQ,OAAOz+B,GAAK2jC,GAAgBC,CAAa,GACjDF,EAAS,KAAKjF,CAAO,GACdmF;AAAA,EACX,CAAG,GACMF;AACT;AACA,SAAS1jC,GAAK6jC,GAASC,GAAS;AAC9B,QAAMtG,IAAKqG,EAAQ,CAAC,GACdpG,IAAKoG,EAAQ,CAAC,GACdnG,IAAKoG,EAAQ,CAAC,GACdnG,IAAKmG,EAAQ,CAAC,GACd7M,IAAOuG,IAAKE,IAAKF,IAAKE,GACtBxG,IAAQuG,IAAKE,IAAKF,IAAKE,GACvBxG,IAAOqG,IAAKE,IAAKF,IAAKE,GACtBtG,IAAQqG,IAAKE,IAAKF,IAAKE;AAC7B,SAAO,CAAC1G,GAAMC,GAAOC,GAAMC,CAAK;AAClC;ACtDA,IAAI2M,KAAY,OAAO,gBACnBC,KAAa,OAAO,kBACpBC,KAAoB,OAAO,2BAC3BC,KAAsB,OAAO,uBAC7BC,KAAe,OAAO,UAAU,gBAChCC,KAAe,OAAO,UAAU,sBAChCC,KAAkB,CAACjoC,GAAKC,GAAKqF,MAAUrF,KAAOD,IAAM2nC,GAAU3nC,GAAKC,GAAK,EAAE,YAAY,IAAM,cAAc,IAAM,UAAU,IAAM,OAAAqF,EAAK,CAAE,IAAItF,EAAIC,CAAG,IAAIqF,GACtJ4iC,KAAiB,CAACtnC,GAAG0B,MAAM;AAC7B,WAAS6lC,KAAQ7lC,MAAMA,IAAI,CAAA;AACzB,IAAIylC,GAAa,KAAKzlC,GAAG6lC,CAAI,KAC3BF,GAAgBrnC,GAAGunC,GAAM7lC,EAAE6lC,CAAI,CAAC;AACpC,MAAIL;AACF,aAASK,KAAQL,GAAoBxlC,CAAC;AACpC,MAAI0lC,GAAa,KAAK1lC,GAAG6lC,CAAI,KAC3BF,GAAgBrnC,GAAGunC,GAAM7lC,EAAE6lC,CAAI,CAAC;AAEtC,SAAOvnC;AACT,GACIwnC,KAAgB,CAACxnC,GAAG0B,MAAMslC,GAAWhnC,GAAGinC,GAAkBvlC,CAAC,CAAC;AAWhE,SAAS+lC,GAAmBC,GAAOl+B,GAAIkC,IAAU,CAAA,GAAI;AACnD,MAAI,CAACg8B,KAAS,CAACl+B;AACb,UAAM,IAAI,MAAM,qCAAqC;AAEvD,QAAMm+B,IAAQjQ,GAASluB,CAAE;AACzB,MAAIo+B,IAAYj1B,GAAM,CAAC,OAAU,KAAQ,GAAG;AAAA,IAC1C,MAAM;AAAA,IACN,OAAO;AAAA,IACP,mBAAmB;AAAA,IACnB,UAAU;AAAA,EACd,CAAG,GACGwI,IAAS;AACb,SAAA2e;AAAA,IACE4N;AAAA,IACA,SAASG,GAAMC,GAAe5O,GAAmB;AAC/C,YAAM7iB,IAASshB,GAAUkQ,CAAI;AAC7B,eAASroC,IAAI,GAAGA,IAAI6W,EAAO,SAAS,GAAG7W,KAAK;AAC1C,cAAM0K,IAAQyI,GAAM0D,EAAO7W,CAAC,CAAC,GACvBuoC,IAAWrQ,GAASxtB,CAAK,GACzB6uB,IAAOpmB,GAAM0D,EAAO7W,IAAI,CAAC,CAAC,GAC1BwoC,IAAUtQ,GAASqB,CAAI,GACvBkP,IAAgB1Q,GAASrtB,GAAO6uB,GAAMrtB,CAAO;AACnD,YAAIw8B,GACAC;AACJ,QAAIH,EAAQ,CAAC,MAAML,EAAM,CAAC,KAAKK,EAAQ,CAAC,MAAML,EAAM,CAAC,IACnD,CAACO,GAAcC,CAAM,IAAI,CAACH,GAAS,EAAI,IAC9BD,EAAS,CAAC,MAAMJ,EAAM,CAAC,KAAKI,EAAS,CAAC,MAAMJ,EAAM,CAAC,IAC5D,CAACO,GAAcC,CAAM,IAAI,CAACJ,GAAU,EAAK,IAEzC,CAACG,GAAcC,CAAM,IAAIC;AAAA,UACvBL;AAAA,UACAC;AAAA,UACAL;AAAA,QACZ;AAEQ,cAAMU,IAAc11B,GAAMu1B,GAAc;AAAA,UACtC,MAAM3Q,GAAS/tB,GAAI0+B,GAAcx8B,CAAO;AAAA,UACxC,mBAAAwtB;AAAA,UACA,UAAU/d,IAASoc,GAASrtB,GAAOg+B,GAAcx8B,CAAO;AAAA,QAClE,CAAS;AACD,QAAI28B,EAAY,WAAW,OAAOT,EAAU,WAAW,SACrDA,IAAYJ,GAAcF,GAAe,CAAA,GAAIe,CAAW,GAAG;AAAA,UACzD,YAAYb,GAAcF,GAAe,CAAA,GAAIe,EAAY,UAAU,GAAG;AAAA;AAAA;AAAA,YAGpE,OAAOF,IAAS3oC,IAAI,IAAIA;AAAA,UACtC,CAAa;AAAA,QACb,CAAW,IAEH2b,KAAU8sB;AAAA,MAClB;AAAA,IACA;AAAA,EACA,GACSL;AACT;AACA,SAASU,GAAIvK,GAAIE,GAAI;AACnB,QAAM,CAACsK,GAAKC,GAAKC,CAAG,IAAI1K,GAClB,CAAC2K,GAAKC,GAAKC,CAAG,IAAI3K;AACxB,SAAOsK,IAAMG,IAAMF,IAAMG,IAAMF,IAAMG;AACvC;AACA,SAASC,GAAM9K,GAAIE,GAAI;AACrB,QAAM,CAACsK,GAAKC,GAAKC,CAAG,IAAI1K,GAClB,CAAC2K,GAAKC,GAAKC,CAAG,IAAI3K;AACxB,SAAO,CAACuK,IAAMI,IAAMH,IAAME,GAAKF,IAAMC,IAAMH,IAAMK,GAAKL,IAAMI,IAAMH,IAAME,CAAG;AAC7E;AACA,SAASI,GAAU/oC,GAAG;AACpB,SAAO,KAAK,KAAK,KAAK,IAAIA,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,IAAIA,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,IAAIA,EAAE,CAAC,GAAG,CAAC,CAAC;AAC5E;AACA,SAASgpC,GAAUhpC,GAAG;AACpB,QAAMipC,IAAMF,GAAU/oC,CAAC;AACvB,SAAO,CAACA,EAAE,CAAC,IAAIipC,GAAKjpC,EAAE,CAAC,IAAIipC,GAAKjpC,EAAE,CAAC,IAAIipC,CAAG;AAC5C;AACA,SAASC,GAAejpC,GAAG;AACzB,QAAMkJ,IAAM0D,GAAiB5M,EAAE,CAAC,CAAC,GAC3BkpC,IAAMt8B,GAAiB5M,EAAE,CAAC,CAAC;AACjC,SAAO;AAAA,IACL,KAAK,IAAIkJ,CAAG,IAAI,KAAK,IAAIggC,CAAG;AAAA,IAC5B,KAAK,IAAIhgC,CAAG,IAAI,KAAK,IAAIggC,CAAG;AAAA,IAC5B,KAAK,IAAIhgC,CAAG;AAAA,EAChB;AACA;AACA,SAASigC,GAAeppC,GAAG;AACzB,QAAM,CAACsI,GAAGc,GAAGuT,CAAC,IAAI3c,GACZqpC,IAAS,KAAK,IAAI,KAAK,IAAI1sB,GAAG,EAAE,GAAG,CAAC,GACpCxT,IAAMsuB,GAAiB,KAAK,KAAK4R,CAAM,CAAC;AAE9C,SAAO,CADK5R,GAAiB,KAAK,MAAMruB,GAAGd,CAAC,CAAC,GAChCa,CAAG;AAClB;AACA,SAASk/B,GAAsBiB,GAAMC,GAAMC,GAAM;AAC/C,QAAMryB,IAAI+xB,GAAeI,CAAI,GACvB5pB,IAAIwpB,GAAeK,CAAI,GACvB7wB,IAAIwwB,GAAeM,CAAI,GACvBC,IAAcX,GAAM3xB,GAAGuI,CAAC;AAC9B,MAAI+pB,EAAY,CAAC,MAAM,KAAKA,EAAY,CAAC,MAAM,KAAKA,EAAY,CAAC,MAAM;AACrE,WAAIlB,GAAIpxB,GAAGuI,CAAC,IAAI,IACP,CAAC,CAAC,GAAG6pB,CAAI,GAAG,EAAI,IAEhB,CAAC,CAAC,GAAGC,CAAI,GAAG,EAAK;AAG5B,QAAME,IAAaZ,GAAMW,GAAa/wB,CAAC;AACvC,MAAIgxB,EAAW,CAAC,MAAM,KAAKA,EAAW,CAAC,MAAM,KAAKA,EAAW,CAAC,MAAM;AAClE,WAAO,CAAC,CAAC,GAAGH,CAAI,GAAG,EAAI;AAEzB,QAAMI,IAAmBb,GAAMY,GAAYD,CAAW,GAChDG,IAAKZ,GAAUW,CAAgB,GAC/BE,IAAK,CAAC,CAACD,EAAG,CAAC,GAAG,CAACA,EAAG,CAAC,GAAG,CAACA,EAAG,CAAC,CAAC,GAC5BxyB,IAAImxB,GAAI7vB,GAAGkxB,CAAE,IAAIrB,GAAI7vB,GAAGmxB,CAAE,IAAID,IAAKC,GACnCC,IAAkBd,GAAUS,CAAW,GACvCM,IAAQxB,GAAIO,GAAM3xB,GAAGC,CAAC,GAAG0yB,CAAe,GACxCE,IAAQzB,GAAIO,GAAM1xB,GAAGsI,CAAC,GAAGoqB,CAAe;AAC9C,SAAIC,KAAS,KAAKC,KAAS,IAClB,CAACZ,GAAehyB,CAAC,GAAG,EAAK,IAE9BmxB,GAAIpxB,GAAGuB,CAAC,IAAI6vB,GAAI7oB,GAAGhH,CAAC,IACf,CAAC,CAAC,GAAG4wB,CAAI,GAAG,EAAK,IAEjB,CAAC,CAAC,GAAGC,CAAI,GAAG,EAAI;AAE3B;;;;;ACjJA,SAASU,GAASnS,GAASnsB,GAAS;AAElC,MADAA,IAAUA,KAA4B,CAAA,GAClC,CAAC+rB,GAAS/rB,CAAO,EAAG,OAAM,IAAI,MAAM,oBAAoB;AAC5D,MAAIu+B,IAAYv+B,EAAQ,WACpB8qB,IAAc9qB,EAAQ,aACtBw+B,IAASx+B,EAAQ;AAGrB,MAFAu+B,IAAoCA,KAAc,QAAQ,MAAMA,CAAS,IAAI,IAAIA,GACjFzT,IAAwCA,KAAgB,QAAQ,MAAMA,CAAW,IAAI,IAAIA,GACrF,CAACqB,EAAS,OAAM,IAAI,MAAM,uBAAuB;AACrD,MAAI,OAAOoS,KAAc;AACvB,UAAM,IAAI,MAAM,8BAA8B;AAChD,MAAI,OAAOzT,KAAgB;AACzB,UAAM,IAAI,MAAM,gCAAgC;AAClD,GAAI0T,MAAW,MAASA,MAAW,YACjCrS,IAAU,KAAK,MAAM,KAAK,UAAUA,CAAO,CAAC;AAC9C,MAAIR,IAAS,KAAK,IAAI,IAAI4S,CAAS;AACnC,SAAA7R,GAAUP,GAAS,SAASxhB,GAAQ;AAClC,IAAA8zB,GAAe9zB,GAAQghB,GAAQb,CAAW;AAAA,EAC9C,CAAG,GACMqB;AACT;AACA,SAASsS,GAAe9zB,GAAQghB,GAAQb,GAAa;AACnD,EAAIngB,EAAO,SAASmgB,KAAangB,EAAO,OAAOmgB,GAAangB,EAAO,MAAM;AACzE,WAAS7W,IAAI,GAAGA,IAAI6W,EAAO,QAAQ7W;AACjC,IAAA6W,EAAO7W,CAAC,IAAI,KAAK,MAAM6W,EAAO7W,CAAC,IAAI63B,CAAM,IAAIA;AAE/C,SAAOhhB;AACT;ACrBA,SAAS+zB,GAAUvC,GAAMvN,GAAU;AACjC,MAAI,CAACuN,EAAM,OAAM,IAAI,MAAM,kBAAkB;AAC7C,MAAI,CAACvN,EAAU,OAAM,IAAI,MAAM,sBAAsB;AACrD,MAAI+P,IAAWvS,GAAQ+P,CAAI,GACvByC,IAAexS,GAAQwC,CAAQ;AACnC,MAAI+P,MAAa,aAAc,OAAM,IAAI,MAAM,yBAAyB;AACxE,MAAIC,MAAiB;AACnB,UAAM,IAAI,MAAM,wCAAwC;AAC1D,MAAIA,MAAiB;AACnB,UAAM,IAAI,MAAM,yCAAyC;AAC3D,MAAIC,IAAoBP,GAAS1P,GAAU,EAAE,WAAW,EAAC,CAAE;AAC3D,UAAQgQ,GAAY;AAAA,IAClB,KAAK;AACH,aAAOE,GAAmB3C,GAAM0C,CAAiB;AAAA,IACnD,KAAK;AACH,aAAOE,GAAoB5C,GAAM0C,CAAiB;AAAA,IACpD,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAOE;AAAA,QACL5C;AAAA,QACA/F,GAAc+F,GAAM0C,GAAmB;AAAA,UACrC,yBAAyB;AAAA,QACnC,CAAS;AAAA,MACT;AAAA,EACA;AACA;AACA,SAASE,GAAoB5C,GAAMvN,GAAU;AAC3C,MAAI6H,IAAU,CAAA,GACV+D,IAAOC,GAAK;AAChB,SAAArM,GAAYQ,GAAU,SAAS3nB,GAAO;AAIpC,QAHAwvB,EAAQ,QAAQ,SAAS/L,GAAShpB,GAAO;AACvC,MAAAgpB,EAAQ,KAAKhpB;AAAA,IACnB,CAAK,GACG,CAAC+0B,EAAQ;AACX,MAAAA,IAAUqI,GAAmB3C,GAAMl1B,CAAK,EAAE,UAC1CuzB,EAAK,KAAKvP,GAAkBwL,CAAO,CAAC;AAAA,SAC/B;AACL,UAAIuI,IAASxE,EAAK,OAAOvzB,CAAK;AAC9B,UAAI+3B,EAAO,SAAS,QAAQ;AAC1B,YAAIC,IAAcC,GAAmBj4B,GAAO+3B,CAAM;AAClD,QAAAvI,IAAUA,EAAQ,OAAO,SAAS/L,GAAS;AACzC,iBAAOA,EAAQ,OAAOuU,EAAY;AAAA,QAC5C,CAAS,GACDzE,EAAK,OAAOyE,CAAW,GACvBtR,GAAYmR,GAAmBG,GAAah4B,CAAK,GAAG,SAASqvB,GAAO;AAClE,UAAAG,EAAQ,KAAKH,CAAK,GAClBkE,EAAK,OAAOlE,CAAK;AAAA,QAC3B,CAAS;AAAA,MACT;AAAA,IACA;AAAA,EACA,CAAG,GACMrL,GAAkBwL,CAAO;AAClC;AACA,SAASqI,GAAmB3C,GAAMvN,GAAU;AAC1C,MAAI6H,IAAU,CAAA,GACV0I,IAAalT,GAAUkQ,CAAI,EAAE,CAAC,GAC9BiD,IAAWnT,GAAUkQ,CAAI,EAAEA,EAAK,SAAS,YAAY,SAAS,CAAC;AACnE,MAAIkD,GAAaF,GAAYnT,GAAS4C,CAAQ,CAAC,KAAKyQ,GAAaD,GAAUpT,GAAS4C,CAAQ,CAAC;AAC3F,WAAO3D,GAAkB,CAACkR,CAAI,CAAC;AACjC,MAAI3B,IAAOC,GAAK,GACZO,IAAWH,GAAYsB,CAAI;AAC/B,EAAA3B,EAAK,KAAKQ,CAAQ;AAClB,MAAIgE,IAASxE,EAAK,OAAO5L,CAAQ;AACjC,MAAI,CAACoQ,EAAO,SAAS,OAAQ,QAAO/T,GAAkB,CAACkR,CAAI,CAAC;AAC5D,MAAImD,IAAiBJ,GAAmBtQ,GAAUoQ,CAAM,GACpDnR,IAAe,CAACsR,CAAU,GAC1BI,IAAa3R;AAAA,IACfoN;AAAA,IACA,SAASwE,GAAU/L,GAAS/xB,GAAO;AACjC,UAAIw5B,IAAgBjP,GAAUwH,CAAO,EAAE,CAAC,GACpCgM,IAAiBzT,GAAS4C,CAAQ;AACtC,aAAIltB,MAAU49B,EAAe,MAC3BE,EAAS,KAAKC,CAAc,GAC5BhJ,EAAQ,KAAKrL,GAAWoU,CAAQ,CAAC,GAC7BH,GAAaI,GAAgBvE,CAAa,IACrC,CAACuE,CAAc,IACjB,CAACA,GAAgBvE,CAAa,MAErCsE,EAAS,KAAKtE,CAAa,GACpBsE;AAAA,IAEf;AAAA,IACI3R;AAAA,EACJ;AACE,SAAI0R,EAAW,SAAS,KACtB9I,EAAQ,KAAKrL,GAAWmU,CAAU,CAAC,GAE9BtU,GAAkBwL,CAAO;AAClC;AACA,SAASyI,GAAmBj4B,GAAO+0B,GAAO;AACxC,MAAI,CAACA,EAAM,SAAS,OAAQ,OAAM,IAAI,MAAM,6BAA6B;AACzE,MAAIA,EAAM,SAAS,WAAW,EAAG,QAAOA,EAAM,SAAS,CAAC;AACxD,MAAI0D,GACAC,IAAkB;AACtB,SAAAhS,GAAYqO,GAAO,SAASjG,GAAS;AACnC,QAAIj4B,IAAKi+B,GAAmBhG,GAAS9uB,CAAK,GACtC24B,IAAO9hC,EAAG,WAAW;AACzB,IAAI8hC,IAAOD,MACTD,IAAiB3J,GACjB4J,IAAkBC;AAAA,EAExB,CAAG,GACMF;AACT;AACA,SAASL,GAAaQ,GAAKC,GAAK;AAC9B,SAAOD,EAAI,CAAC,MAAMC,EAAI,CAAC,KAAKD,EAAI,CAAC,MAAMC,EAAI,CAAC;AAC9C;;;;;AC7GC,KAAC,WAAW;AAGX,UAAIC,GAGAC,IAAU,WAGVC,IAAmB,KAGnBC,IAAkB,mEAClBC,IAAkB,uBAClBC,IAA+B,sDAG/BC,IAAiB,6BAGjBC,IAAmB,KAGnBC,IAAc,0BAGdC,IAAkB,GAClBC,IAAkB,GAClBC,IAAqB,GAGrBC,IAAuB,GACvBC,IAAyB,GAGzBC,IAAiB,GACjBC,IAAqB,GACrBC,IAAwB,GACxBC,IAAkB,GAClBC,IAAwB,IACxBC,IAAoB,IACpBC,IAA0B,IAC1BC,IAAgB,KAChBC,IAAkB,KAClBC,KAAiB,KAGjBC,KAAuB,IACvBC,KAAyB,OAGzBC,KAAY,KACZC,KAAW,IAGXC,KAAmB,GACnBC,KAAgB,GAChBC,KAAkB,GAGlBC,KAAW,OACXC,KAAmB,kBACnBC,KAAc,uBACdC,KAAM,KAGNC,KAAmB,YACnBC,KAAkBD,KAAmB,GACrCE,KAAwBF,OAAqB,GAG7CG,KAAY;AAAA,QACd,CAAC,OAAOjB,CAAa;AAAA,QACrB,CAAC,QAAQP,CAAc;AAAA,QACvB,CAAC,WAAWC,CAAkB;AAAA,QAC9B,CAAC,SAASE,CAAe;AAAA,QACzB,CAAC,cAAcC,CAAqB;AAAA,QACpC,CAAC,QAAQK,EAAc;AAAA,QACvB,CAAC,WAAWJ,CAAiB;AAAA,QAC7B,CAAC,gBAAgBC,CAAuB;AAAA,QACxC,CAAC,SAASE,CAAe;AAAA,SAIvBiB,KAAU,sBACVC,KAAW,kBACXC,KAAW,0BACXC,KAAU,oBACVC,KAAU,iBACVC,KAAY,yBACZC,KAAW,kBACXC,KAAU,qBACVC,KAAS,8BACTC,KAAS,gBACTC,KAAY,mBACZC,KAAU,iBACVC,KAAY,mBACZC,KAAa,oBACbC,KAAW,kBACXC,KAAY,mBACZC,KAAS,gBACTC,KAAY,mBACZC,KAAY,mBACZC,KAAe,sBACfC,KAAa,oBACbC,KAAa,oBAEbC,KAAiB,wBACjBC,KAAc,qBACdC,KAAa,yBACbC,KAAa,yBACbC,KAAU,sBACVC,KAAW,uBACXC,KAAW,uBACXC,KAAW,uBACXC,KAAkB,8BAClBC,KAAY,wBACZC,KAAY,wBAGZC,KAAuB,kBACvBC,KAAsB,sBACtBC,KAAwB,iCAGxBC,KAAgB,6BAChBC,KAAkB,YAClBC,KAAmB,OAAOF,GAAc,MAAM,GAC9CG,KAAqB,OAAOF,GAAgB,MAAM,GAGlDG,KAAW,oBACXC,KAAa,mBACbC,KAAgB,oBAGhBC,KAAe,oDACfC,KAAgB,SAChBC,KAAa,oGAMbC,KAAe,uBACfC,KAAkB,OAAOD,GAAa,MAAM,GAG5CE,KAAc,QAGdC,KAAe,MAGfC,KAAgB,6CAChBC,KAAgB,qCAChBC,KAAiB,SAGjBC,KAAc,6CAYdC,KAA6B,oBAG7BC,KAAe,YAMfC,KAAe,mCAGfC,KAAU,QAGVC,KAAa,sBAGbC,KAAa,cAGbC,KAAe,+BAGfC,KAAY,eAGZC,KAAW,oBAGXC,KAAU,+CAGVC,KAAY,QAGZC,KAAoB,0BAGpBC,KAAgB,mBAChBC,KAAoB,mBACpBC,KAAwB,mBACxBC,KAAsB,mBACtBC,KAAeH,KAAoBC,KAAwBC,IAC3DE,KAAiB,mBACjBC,KAAe,6BACfC,KAAgB,wBAChBC,KAAiB,gDACjBC,KAAqB,mBACrBC,KAAe,gKACfC,KAAe,6BACfC,KAAa,kBACbC,KAAeN,KAAgBC,KAAiBC,KAAqBC,IAGrEI,KAAS,QACTC,KAAW,MAAMf,KAAgB,KACjCgB,KAAU,MAAMH,KAAe,KAC/BI,KAAU,MAAMb,KAAe,KAC/Bc,KAAW,QACXC,KAAY,MAAMd,KAAiB,KACnCe,KAAU,MAAMd,KAAe,KAC/Be,KAAS,OAAOrB,KAAgBa,KAAeK,KAAWb,KAAiBC,KAAeK,KAAe,KACzGW,KAAS,4BACTC,KAAa,QAAQN,KAAU,MAAMK,KAAS,KAC9CE,KAAc,OAAOxB,KAAgB,KACrCyB,KAAa,mCACbC,KAAa,sCACbC,KAAU,MAAMhB,KAAe,KAC/BiB,KAAQ,WAGRC,KAAc,QAAQT,KAAU,MAAMC,KAAS,KAC/CS,KAAc,QAAQH,KAAU,MAAMN,KAAS,KAC/CU,KAAkB,QAAQjB,KAAS,0BACnCkB,KAAkB,QAAQlB,KAAS,0BACnCmB,KAAWV,KAAa,KACxBW,KAAW,MAAMtB,KAAa,MAC9BuB,KAAY,QAAQP,KAAQ,QAAQ,CAACJ,IAAaC,IAAYC,EAAU,EAAE,KAAK,GAAG,IAAI,MAAMQ,KAAWD,KAAW,MAClHG,KAAa,oDACbC,KAAa,oDACbC,KAAQJ,KAAWD,KAAWE,IAC9BI,KAAU,QAAQ,CAACpB,IAAWM,IAAYC,EAAU,EAAE,KAAK,GAAG,IAAI,MAAMY,IACxEE,KAAW,QAAQ,CAAChB,KAAcP,KAAU,KAAKA,IAASQ,IAAYC,IAAYX,EAAQ,EAAE,KAAK,GAAG,IAAI,KAGxG0B,KAAS,OAAO3B,IAAQ,GAAG,GAM3B4B,KAAc,OAAOzB,IAAS,GAAG,GAGjC0B,KAAY,OAAOrB,KAAS,QAAQA,KAAS,OAAOkB,KAAWF,IAAO,GAAG,GAGzEM,KAAgB,OAAO;AAAA,QACzBjB,KAAU,MAAMP,KAAU,MAAMW,KAAkB,QAAQ,CAACf,IAASW,IAAS,GAAG,EAAE,KAAK,GAAG,IAAI;AAAA,QAC9FG,KAAc,MAAME,KAAkB,QAAQ,CAAChB,IAASW,KAAUE,IAAa,GAAG,EAAE,KAAK,GAAG,IAAI;AAAA,QAChGF,KAAU,MAAME,KAAc,MAAME;AAAA,QACpCJ,KAAU,MAAMK;AAAA,QAChBK;AAAA,QACAD;AAAA,QACAlB;AAAA,QACAqB;AAAA,MACJ,EAAI,KAAK,GAAG,GAAG,GAAG,GAGZM,KAAe,OAAO,MAAMjB,KAAQ5B,KAAiBI,KAAeQ,KAAa,GAAG,GAGpFkC,KAAmB,sEAGnBC,KAAe;AAAA,QACjB;AAAA,QAAS;AAAA,QAAU;AAAA,QAAY;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAgB;AAAA,QAChE;AAAA,QAAY;AAAA,QAAa;AAAA,QAAc;AAAA,QAAc;AAAA,QAAO;AAAA,QAAQ;AAAA,QACpE;AAAA,QAAW;AAAA,QAAU;AAAA,QAAO;AAAA,QAAU;AAAA,QAAU;AAAA,QAAa;AAAA,QAC7D;AAAA,QAAqB;AAAA,QAAe;AAAA,QAAe;AAAA,QACnD;AAAA,QAAK;AAAA,QAAgB;AAAA,QAAY;AAAA,QAAY;AAAA,SAI3CC,KAAkB,IAGlBC,KAAiB,CAAA;AACrB,MAAAA,GAAe3F,EAAU,IAAI2F,GAAe1F,EAAU,IACtD0F,GAAezF,EAAO,IAAIyF,GAAexF,EAAQ,IACjDwF,GAAevF,EAAQ,IAAIuF,GAAetF,EAAQ,IAClDsF,GAAerF,EAAe,IAAIqF,GAAepF,EAAS,IAC1DoF,GAAenF,EAAS,IAAI,IAC5BmF,GAAenH,EAAO,IAAImH,GAAelH,EAAQ,IACjDkH,GAAe7F,EAAc,IAAI6F,GAAehH,EAAO,IACvDgH,GAAe5F,EAAW,IAAI4F,GAAe/G,EAAO,IACpD+G,GAAe7G,EAAQ,IAAI6G,GAAe5G,EAAO,IACjD4G,GAAe1G,EAAM,IAAI0G,GAAezG,EAAS,IACjDyG,GAAevG,EAAS,IAAIuG,GAAepG,EAAS,IACpDoG,GAAenG,EAAM,IAAImG,GAAelG,EAAS,IACjDkG,GAAe/F,EAAU,IAAI;AAG7B,UAAIgG,KAAgB,CAAA;AACpB,MAAAA,GAAcpH,EAAO,IAAIoH,GAAcnH,EAAQ,IAC/CmH,GAAc9F,EAAc,IAAI8F,GAAc7F,EAAW,IACzD6F,GAAcjH,EAAO,IAAIiH,GAAchH,EAAO,IAC9CgH,GAAc5F,EAAU,IAAI4F,GAAc3F,EAAU,IACpD2F,GAAc1F,EAAO,IAAI0F,GAAczF,EAAQ,IAC/CyF,GAAcxF,EAAQ,IAAIwF,GAAc3G,EAAM,IAC9C2G,GAAc1G,EAAS,IAAI0G,GAAcxG,EAAS,IAClDwG,GAAcrG,EAAS,IAAIqG,GAAcpG,EAAM,IAC/CoG,GAAcnG,EAAS,IAAImG,GAAclG,EAAS,IAClDkG,GAAcvF,EAAQ,IAAIuF,GAActF,EAAe,IACvDsF,GAAcrF,EAAS,IAAIqF,GAAcpF,EAAS,IAAI,IACtDoF,GAAc9G,EAAQ,IAAI8G,GAAc7G,EAAO,IAC/C6G,GAAchG,EAAU,IAAI;AAG5B,UAAIiG,KAAkB;AAAA;AAAA,QAEpB,GAAQ;AAAA,QAAM,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAC1E,GAAQ;AAAA,QAAM,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAC1E,GAAQ;AAAA,QAAM,GAAQ;AAAA,QACtB,GAAQ;AAAA,QAAM,GAAQ;AAAA,QACtB,GAAQ;AAAA,QAAM,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAChD,GAAQ;AAAA,QAAM,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAChD,GAAQ;AAAA,QAAM,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAChD,GAAQ;AAAA,QAAM,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAChD,GAAQ;AAAA,QAAM,GAAQ;AAAA,QACtB,GAAQ;AAAA,QAAM,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAC1E,GAAQ;AAAA,QAAM,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAC1E,GAAQ;AAAA,QAAM,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAChD,GAAQ;AAAA,QAAM,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAAK,GAAQ;AAAA,QAChD,GAAQ;AAAA,QAAM,GAAQ;AAAA,QAAK,GAAQ;AAAA,QACnC,GAAQ;AAAA,QAAM,GAAQ;AAAA,QACtB,GAAQ;AAAA,QAAM,GAAQ;AAAA,QACtB,GAAQ;AAAA;AAAA,QAER,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACxD,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACxD,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACxD,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACvE,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACvE,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACxD,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACxD,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACxD,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACvE,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACvE,GAAU;AAAA,QAAM,GAAU;AAAA,QAC1B,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACvE,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACvE,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACxD,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACxD,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACxD,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACxD,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACtF,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QAAK,GAAU;AAAA,QACtF,GAAU;AAAA,QAAM,GAAU;AAAA,QAC1B,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAAK,GAAU;AAAA,QACzC,GAAU;AAAA,QAAM,GAAU;AAAA,QAC1B,GAAU;AAAA,QAAM,GAAU;AAAA,QAC1B,GAAU;AAAA,QAAM,GAAU;AAAA,SAIxBC,KAAc;AAAA,QAChB,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,SAIHC,KAAgB;AAAA,QAClB,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,SAAS;AAAA,SAIPC,KAAgB;AAAA,QAClB,MAAM;AAAA,QACN,KAAK;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,QACV,UAAU;AAAA,SAIRC,KAAiB,YACjBC,KAAe,UAGfC,KAAa,OAAOC,MAAU,YAAYA,MAAUA,GAAO,WAAW,UAAUA,IAGhFC,KAAW,OAAO,QAAQ,YAAY,QAAQ,KAAK,WAAW,UAAU,MAGxE3yC,KAAOyyC,MAAcE,MAAY,SAAS,aAAa,EAAC,GAGxDC,KAA4CC,KAAW,CAACA,EAAQ,YAAYA,GAG5EC,KAAaF,MAAe,MAA6BG,KAAU,CAACA,EAAO,YAAYA,GAGvFC,KAAgBF,MAAcA,GAAW,YAAYF,IAGrDK,KAAcD,MAAiBP,GAAW,SAG1CS,KAAY,WAAW;AACzB,YAAI;AAEF,cAAIC,IAAQL,MAAcA,GAAW,WAAWA,GAAW,QAAQ,MAAM,EAAE;AAE3E,iBAAIK,KAKGF,MAAeA,GAAY,WAAWA,GAAY,QAAQ,MAAM;AAAA,gBAC7D;AAAA,QAAA;AAAA,MAChB,KAGMG,KAAoBF,MAAYA,GAAS,eACzCG,KAAaH,MAAYA,GAAS,QAClCI,KAAYJ,MAAYA,GAAS,OACjCK,KAAeL,MAAYA,GAAS,UACpCM,KAAYN,MAAYA,GAAS,OACjCO,KAAmBP,MAAYA,GAAS;AAc5C,eAASQ,GAAMC,GAAMC,GAASC,GAAM;AAClC,gBAAQA,EAAK,QAAM;AAAA,UACjB,KAAK;AAAG,mBAAOF,EAAK,KAAKC,CAAO;AAAA,UAChC,KAAK;AAAG,mBAAOD,EAAK,KAAKC,GAASC,EAAK,CAAC,CAAC;AAAA,UACzC,KAAK;AAAG,mBAAOF,EAAK,KAAKC,GAASC,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,UAClD,KAAK;AAAG,mBAAOF,EAAK,KAAKC,GAASC,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,QACjE;AACI,eAAOF,EAAK,MAAMC,GAASC,CAAI;AAAA,MACnC;AAYE,eAASC,GAAgBxhC,GAAOyhC,GAAQC,GAAUC,GAAa;AAI7D,iBAHI/pC,IAAQ,IACR+N,KAAS3F,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAEpI,IAAQ+N,MAAQ;AACvB,cAAIzW,KAAQ8Q,EAAMpI,CAAK;AACvB,UAAA6pC,EAAOE,GAAazyC,IAAOwyC,EAASxyC,EAAK,GAAG8Q,CAAK;AAAA,QACvD;AACI,eAAO2hC;AAAA,MACX;AAWE,eAASC,GAAU5hC,GAAO0hC,GAAU;AAIlC,iBAHI9pC,IAAQ,IACR+N,IAAS3F,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAEpI,IAAQ+N,KACX+7B,EAAS1hC,EAAMpI,CAAK,GAAGA,GAAOoI,CAAK,MAAM;AAA7C;AAIF,eAAOA;AAAA,MACX;AAWE,eAAS6hC,GAAe7hC,GAAO0hC,GAAU;AAGvC,iBAFI/7B,IAAS3F,KAAS,OAAO,IAAIA,EAAM,QAEhC2F,OACD+7B,EAAS1hC,EAAM2F,CAAM,GAAGA,GAAQ3F,CAAK,MAAM;AAA/C;AAIF,eAAOA;AAAA,MACX;AAYE,eAAS8hC,GAAW9hC,GAAO+hC,GAAW;AAIpC,iBAHInqC,IAAQ,IACR+N,IAAS3F,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAEpI,IAAQ+N;AACf,cAAI,CAACo8B,EAAU/hC,EAAMpI,CAAK,GAAGA,GAAOoI,CAAK;AACvC,mBAAO;AAGX,eAAO;AAAA,MACX;AAWE,eAASgiC,GAAYhiC,GAAO+hC,GAAW;AAMrC,iBALInqC,IAAQ,IACR+N,IAAS3F,KAAS,OAAO,IAAIA,EAAM,QACnCiiC,IAAW,GACX91C,KAAS,CAAA,GAEN,EAAEyL,IAAQ+N,KAAQ;AACvB,cAAIzW,KAAQ8Q,EAAMpI,CAAK;AACvB,UAAImqC,EAAU7yC,IAAO0I,GAAOoI,CAAK,MAC/B7T,GAAO81C,GAAU,IAAI/yC;AAAA,QAE7B;AACI,eAAO/C;AAAA,MACX;AAWE,eAAS+1C,GAAcliC,GAAO9Q,GAAO;AACnC,YAAIyW,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,eAAO,CAAC,CAAC2F,KAAUw8B,GAAYniC,GAAO9Q,GAAO,CAAC,IAAI;AAAA,MACtD;AAWE,eAASkzC,GAAkBpiC,GAAO9Q,GAAOmzC,GAAY;AAInD,iBAHIzqC,IAAQ,IACR+N,IAAS3F,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAEpI,IAAQ+N;AACf,cAAI08B,EAAWnzC,GAAO8Q,EAAMpI,CAAK,CAAC;AAChC,mBAAO;AAGX,eAAO;AAAA,MACX;AAWE,eAAS0qC,GAAStiC,GAAO0hC,GAAU;AAKjC,iBAJI9pC,IAAQ,IACR+N,IAAS3F,KAAS,OAAO,IAAIA,EAAM,QACnC7T,IAAS,MAAMwZ,CAAM,GAElB,EAAE/N,IAAQ+N;AACf,UAAAxZ,EAAOyL,CAAK,IAAI8pC,EAAS1hC,EAAMpI,CAAK,GAAGA,GAAOoI,CAAK;AAErD,eAAO7T;AAAA,MACX;AAUE,eAASo2C,GAAUviC,GAAOwiC,GAAQ;AAKhC,iBAJI5qC,IAAQ,IACR+N,IAAS68B,EAAO,QAChBvpC,IAAS+G,EAAM,QAEZ,EAAEpI,IAAQ+N;AACf,UAAA3F,EAAM/G,IAASrB,CAAK,IAAI4qC,EAAO5qC,CAAK;AAEtC,eAAOoI;AAAA,MACX;AAcE,eAASyiC,GAAYziC,GAAO0hC,GAAUC,GAAae,GAAW;AAC5D,YAAI9qC,IAAQ,IACR+N,KAAS3F,KAAS,OAAO,IAAIA,EAAM;AAKvC,aAHI0iC,KAAa/8B,OACfg8B,IAAc3hC,EAAM,EAAEpI,CAAK,IAEtB,EAAEA,IAAQ+N;AACf,UAAAg8B,IAAcD,EAASC,GAAa3hC,EAAMpI,CAAK,GAAGA,GAAOoI,CAAK;AAEhE,eAAO2hC;AAAA,MACX;AAcE,eAASgB,GAAiB3iC,GAAO0hC,GAAUC,GAAae,GAAW;AACjE,YAAI/8B,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AAIvC,aAHI0iC,KAAa/8B,MACfg8B,IAAc3hC,EAAM,EAAE2F,CAAM,IAEvBA;AACL,UAAAg8B,IAAcD,EAASC,GAAa3hC,EAAM2F,CAAM,GAAGA,GAAQ3F,CAAK;AAElE,eAAO2hC;AAAA,MACX;AAYE,eAASiB,GAAU5iC,GAAO+hC,GAAW;AAInC,iBAHInqC,IAAQ,IACR+N,IAAS3F,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAEpI,IAAQ+N;AACf,cAAIo8B,EAAU/hC,EAAMpI,CAAK,GAAGA,GAAOoI,CAAK;AACtC,mBAAO;AAGX,eAAO;AAAA,MACX;AASE,UAAI6iC,KAAYC,GAAa,QAAQ;AASrC,eAASC,GAAaC,GAAQ;AAC5B,eAAOA,EAAO,MAAM,EAAE;AAAA,MAC1B;AASE,eAASC,GAAWD,GAAQ;AAC1B,eAAOA,EAAO,MAAMnH,EAAW,KAAK,CAAA;AAAA,MACxC;AAaE,eAASqH,GAAYC,GAAYpB,GAAWqB,GAAU;AACpD,YAAIj3C;AACJ,eAAAi3C,EAASD,GAAY,SAASj0C,GAAOrF,IAAKs5C,IAAY;AACpD,cAAIpB,EAAU7yC,GAAOrF,IAAKs5C,EAAU;AAClC,mBAAAh3C,IAAStC,IACF;AAAA,QAEf,CAAK,GACMsC;AAAA,MACX;AAaE,eAASk3C,GAAcrjC,GAAO+hC,GAAWuB,GAAWC,GAAW;AAI7D,iBAHI59B,IAAS3F,EAAM,QACfpI,KAAQ0rC,KAAaC,IAAY,IAAI,KAEjCA,IAAY3rC,OAAU,EAAEA,KAAQ+N;AACtC,cAAIo8B,EAAU/hC,EAAMpI,EAAK,GAAGA,IAAOoI,CAAK;AACtC,mBAAOpI;AAGX,eAAO;AAAA,MACX;AAWE,eAASuqC,GAAYniC,GAAO9Q,GAAOo0C,GAAW;AAC5C,eAAOp0C,MAAUA,IACbs0C,GAAcxjC,GAAO9Q,GAAOo0C,CAAS,IACrCD,GAAcrjC,GAAOyjC,IAAWH,CAAS;AAAA,MACjD;AAYE,eAASI,GAAgB1jC,GAAO9Q,GAAOo0C,GAAWjB,GAAY;AAI5D,iBAHIzqC,IAAQ0rC,IAAY,GACpB39B,KAAS3F,EAAM,QAEZ,EAAEpI,IAAQ+N;AACf,cAAI08B,EAAWriC,EAAMpI,CAAK,GAAG1I,CAAK;AAChC,mBAAO0I;AAGX,eAAO;AAAA,MACX;AASE,eAAS6rC,GAAUv0C,GAAO;AACxB,eAAOA,MAAUA;AAAA,MACrB;AAWE,eAASy0C,GAAS3jC,GAAO0hC,GAAU;AACjC,YAAI/7B,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,eAAO2F,IAAUi+B,GAAQ5jC,GAAO0hC,CAAQ,IAAI/7B,IAAUwyB;AAAA,MAC1D;AASE,eAAS2K,GAAaj5C,GAAK;AACzB,eAAO,SAASg6C,GAAQ;AACtB,iBAAOA,KAAU,OAAO5N,IAAY4N,EAAOh6C,CAAG;AAAA;MAEpD;AASE,eAASi6C,GAAeD,GAAQ;AAC9B,eAAO,SAASh6C,GAAK;AACnB,iBAAOg6C,KAAU,OAAO5N,IAAY4N,EAAOh6C,CAAG;AAAA;MAEpD;AAeE,eAASk6C,GAAWZ,GAAYzB,GAAUC,GAAae,GAAWU,GAAU;AAC1E,eAAAA,EAASD,GAAY,SAASj0C,IAAO0I,IAAOurC,IAAY;AACtD,UAAAxB,IAAce,KACTA,IAAY,IAAOxzC,MACpBwyC,EAASC,GAAazyC,IAAO0I,IAAOurC,EAAU;AAAA,QACxD,CAAK,GACMxB;AAAA,MACX;AAYE,eAASqC,GAAWhkC,GAAOikC,GAAU;AACnC,YAAIt+B,IAAS3F,EAAM;AAGnB,aADAA,EAAM,KAAKikC,CAAQ,GACZt+B;AACL,UAAA3F,EAAM2F,CAAM,IAAI3F,EAAM2F,CAAM,EAAE;AAEhC,eAAO3F;AAAA,MACX;AAWE,eAAS4jC,GAAQ5jC,GAAO0hC,GAAU;AAKhC,iBAJIv1C,GACAyL,IAAQ,IACR+N,IAAS3F,EAAM,QAEZ,EAAEpI,IAAQ+N,KAAQ;AACvB,cAAIgkB,KAAU+X,EAAS1hC,EAAMpI,CAAK,CAAC;AACnC,UAAI+xB,OAAYsM,MACd9pC,IAASA,MAAW8pC,IAAYtM,KAAWx9B,IAASw9B;AAAA,QAE5D;AACI,eAAOx9B;AAAA,MACX;AAWE,eAAS+3C,GAAU3vC,GAAGmtC,GAAU;AAI9B,iBAHI9pC,IAAQ,IACRzL,IAAS,MAAMoI,CAAC,GAEb,EAAEqD,IAAQrD;AACf,UAAApI,EAAOyL,CAAK,IAAI8pC,EAAS9pC,CAAK;AAEhC,eAAOzL;AAAA,MACX;AAWE,eAASg4C,GAAYN,GAAQO,GAAO;AAClC,eAAO9B,GAAS8B,GAAO,SAASv6C,GAAK;AACnC,iBAAO,CAACA,GAAKg6C,EAAOh6C,CAAG,CAAC;AAAA,QAC9B,CAAK;AAAA,MACL;AASE,eAASw6C,GAASrB,GAAQ;AACxB,eAAOA,KACHA,EAAO,MAAM,GAAGsB,GAAgBtB,CAAM,IAAI,CAAC,EAAE,QAAQxH,IAAa,EAAE;AAAA,MAE5E;AASE,eAAS+I,GAAUlD,GAAM;AACvB,eAAO,SAASnyC,GAAO;AACrB,iBAAOmyC,EAAKnyC,CAAK;AAAA;MAEvB;AAYE,eAASs1C,GAAWX,GAAQO,GAAO;AACjC,eAAO9B,GAAS8B,GAAO,SAASv6C,GAAK;AACnC,iBAAOg6C,EAAOh6C,CAAG;AAAA,QACvB,CAAK;AAAA,MACL;AAUE,eAAS46C,GAASC,GAAO76C,GAAK;AAC5B,eAAO66C,EAAM,IAAI76C,CAAG;AAAA,MACxB;AAWE,eAAS86C,GAAgBC,GAAYC,GAAY;AAI/C,iBAHIjtC,IAAQ,IACR+N,IAASi/B,EAAW,QAEjB,EAAEhtC,IAAQ+N,KAAUw8B,GAAY0C,GAAYD,EAAWhtC,CAAK,GAAG,CAAC,IAAI;AAAI;AAC/E,eAAOA;AAAA,MACX;AAWE,eAASktC,GAAcF,GAAYC,GAAY;AAG7C,iBAFIjtC,IAAQgtC,EAAW,QAEhBhtC,OAAWuqC,GAAY0C,GAAYD,EAAWhtC,CAAK,GAAG,CAAC,IAAI;AAAI;AACtE,eAAOA;AAAA,MACX;AAUE,eAASmtC,GAAa/kC,GAAOglC,GAAa;AAIxC,iBAHIr/B,IAAS3F,EAAM,QACf7T,IAAS,GAENwZ;AACL,UAAI3F,EAAM2F,CAAM,MAAMq/B,KACpB,EAAE74C;AAGN,eAAOA;AAAA,MACX;AAUE,UAAI84C,KAAenB,GAAejE,EAAe,GAS7CqF,KAAiBpB,GAAehE,EAAW;AAS/C,eAASqF,GAAiBC,GAAK;AAC7B,eAAO,OAAOpF,GAAcoF,CAAG;AAAA,MACnC;AAUE,eAASC,GAASxB,GAAQh6C,GAAK;AAC7B,eAAOg6C,KAAU,OAAO5N,IAAY4N,EAAOh6C,CAAG;AAAA,MAClD;AASE,eAASy7C,GAAWtC,GAAQ;AAC1B,eAAOzD,GAAa,KAAKyD,CAAM;AAAA,MACnC;AASE,eAASuC,GAAevC,GAAQ;AAC9B,eAAOxD,GAAiB,KAAKwD,CAAM;AAAA,MACvC;AASE,eAASwC,GAAgBC,GAAU;AAIjC,iBAHIxvC,GACA9J,IAAS,CAAA,GAEN,EAAE8J,IAAOwvC,EAAS,KAAI,GAAI;AAC/B,UAAAt5C,EAAO,KAAK8J,EAAK,KAAK;AAExB,eAAO9J;AAAA,MACX;AASE,eAASu5C,GAAWC,GAAK;AACvB,YAAI/tC,IAAQ,IACRzL,IAAS,MAAMw5C,EAAI,IAAI;AAE3B,eAAAA,EAAI,QAAQ,SAASz2C,GAAOrF,GAAK;AAC/B,UAAAsC,EAAO,EAAEyL,CAAK,IAAI,CAAC/N,GAAKqF,CAAK;AAAA,QACnC,CAAK,GACM/C;AAAA,MACX;AAUE,eAASy5C,GAAQvE,GAAMhhC,GAAW;AAChC,eAAO,SAASkI,GAAK;AACnB,iBAAO84B,EAAKhhC,EAAUkI,CAAG,CAAC;AAAA;MAEhC;AAWE,eAASs9B,GAAe7lC,GAAOglC,GAAa;AAM1C,iBALIptC,IAAQ,IACR+N,IAAS3F,EAAM,QACfiiC,IAAW,GACX91C,KAAS,CAAA,GAEN,EAAEyL,IAAQ+N,KAAQ;AACvB,cAAIzW,KAAQ8Q,EAAMpI,CAAK;AACvB,WAAI1I,OAAU81C,KAAe91C,OAAUunC,OACrCz2B,EAAMpI,CAAK,IAAI6+B,GACftqC,GAAO81C,GAAU,IAAIrqC;AAAA,QAE7B;AACI,eAAOzL;AAAA,MACX;AASE,eAAS25C,GAAW//B,GAAK;AACvB,YAAInO,IAAQ,IACRzL,IAAS,MAAM4Z,EAAI,IAAI;AAE3B,eAAAA,EAAI,QAAQ,SAAS7W,GAAO;AAC1B,UAAA/C,EAAO,EAAEyL,CAAK,IAAI1I;AAAA,QACxB,CAAK,GACM/C;AAAA,MACX;AASE,eAAS45C,GAAWhgC,GAAK;AACvB,YAAInO,IAAQ,IACRzL,IAAS,MAAM4Z,EAAI,IAAI;AAE3B,eAAAA,EAAI,QAAQ,SAAS7W,GAAO;AAC1B,UAAA/C,EAAO,EAAEyL,CAAK,IAAI,CAAC1I,GAAOA,CAAK;AAAA,QACrC,CAAK,GACM/C;AAAA,MACX;AAYE,eAASq3C,GAAcxjC,GAAO9Q,GAAOo0C,GAAW;AAI9C,iBAHI1rC,IAAQ0rC,IAAY,GACpB39B,IAAS3F,EAAM,QAEZ,EAAEpI,IAAQ+N;AACf,cAAI3F,EAAMpI,CAAK,MAAM1I;AACnB,mBAAO0I;AAGX,eAAO;AAAA,MACX;AAYE,eAASouC,GAAkBhmC,GAAO9Q,GAAOo0C,GAAW;AAElD,iBADI1rC,IAAQ0rC,IAAY,GACjB1rC;AACL,cAAIoI,EAAMpI,CAAK,MAAM1I;AACnB,mBAAO0I;AAGX,eAAOA;AAAA,MACX;AASE,eAASquC,GAAWjD,GAAQ;AAC1B,eAAOsC,GAAWtC,CAAM,IACpBkD,GAAYlD,CAAM,IAClBH,GAAUG,CAAM;AAAA,MACxB;AASE,eAASmD,GAAcnD,GAAQ;AAC7B,eAAOsC,GAAWtC,CAAM,IACpBoD,GAAepD,CAAM,IACrBD,GAAaC,CAAM;AAAA,MAC3B;AAUE,eAASsB,GAAgBtB,GAAQ;AAG/B,iBAFIprC,IAAQorC,EAAO,QAEZprC,OAAW6jC,GAAa,KAAKuH,EAAO,OAAOprC,CAAK,CAAC;AAAG;AAC3D,eAAOA;AAAA,MACX;AASE,UAAIyuC,KAAmBvC,GAAe/D,EAAa;AASnD,eAASmG,GAAYlD,GAAQ;AAE3B,iBADI72C,IAASkzC,GAAU,YAAY,GAC5BA,GAAU,KAAK2D,CAAM;AAC1B,YAAE72C;AAEJ,eAAOA;AAAA,MACX;AASE,eAASi6C,GAAepD,GAAQ;AAC9B,eAAOA,EAAO,MAAM3D,EAAS,KAAK,CAAA;AAAA,MACtC;AASE,eAASiH,GAAatD,GAAQ;AAC5B,eAAOA,EAAO,MAAM1D,EAAa,KAAK,CAAA;AAAA,MAC1C;AAiCE,UAAIiH,KAAgB,SAASA,EAAaC,GAAS;AACjD,QAAAA,IAAUA,KAAW,OAAO94C,KAAO+4C,GAAE,SAAS/4C,GAAK,OAAM,GAAI84C,GAASC,GAAE,KAAK/4C,IAAM+xC,EAAY,CAAC;AAGhG,YAAIiH,IAAQF,EAAQ,OAChBG,IAAOH,EAAQ,MACfI,IAAQJ,EAAQ,OAChBK,KAAWL,EAAQ,UACnBM,KAAON,EAAQ,MACfO,KAASP,EAAQ,QACjBQ,KAASR,EAAQ,QACjBS,KAAST,EAAQ,QACjBU,KAAYV,EAAQ,WAGpBW,KAAaT,EAAM,WACnBU,KAAYP,GAAS,WACrBQ,KAAcN,GAAO,WAGrBO,KAAad,EAAQ,oBAAoB,GAGzCe,KAAeH,GAAU,UAGzBI,KAAiBH,GAAY,gBAG7BI,KAAY,GAGZC,KAAc,WAAW;AAC3B,cAAIC,IAAM,SAAS,KAAKL,MAAcA,GAAW,QAAQA,GAAW,KAAK,YAAY,EAAE;AACvF,iBAAOK,IAAO,mBAAmBA,IAAO;AAAA,QAC9C,KAOQC,KAAuBP,GAAY,UAGnCQ,KAAmBN,GAAa,KAAKR,EAAM,GAG3Ce,KAAUp6C,GAAK,GAGfq6C,KAAaf;AAAA,UAAO,MACtBO,GAAa,KAAKC,EAAc,EAAE,QAAQlM,IAAc,MAAM,EAC7D,QAAQ,0DAA0D,OAAO,IAAI;AAAA,WAI5E0M,KAAStH,KAAgB8F,EAAQ,SAASvQ,GAC1CgS,KAASzB,EAAQ,QACjB0B,KAAa1B,EAAQ,YACrB2B,KAAcH,KAASA,GAAO,cAAc/R,GAC5CmS,KAAexC,GAAQmB,GAAO,gBAAgBA,EAAM,GACpDsB,KAAetB,GAAO,QACtBuB,KAAuBjB,GAAY,sBACnCkB,KAASpB,GAAW,QACpBqB,KAAmBP,KAASA,GAAO,qBAAqBhS,GACxDwS,KAAcR,KAASA,GAAO,WAAWhS,GACzCyS,KAAiBT,KAASA,GAAO,cAAchS,GAE/C0S,KAAkB,WAAW;AAC/B,cAAI;AACF,gBAAItH,IAAOuH,GAAU7B,IAAQ,gBAAgB;AAC7C,mBAAA1F,EAAK,CAAA,GAAI,IAAI,EAAE,GACRA;AAAA,kBACG;AAAA,UAAA;AAAA,QAClB,KAGQwH,KAAkBrC,EAAQ,iBAAiB94C,GAAK,gBAAgB84C,EAAQ,cACxEsC,KAASnC,KAAQA,EAAK,QAAQj5C,GAAK,KAAK,OAAOi5C,EAAK,KACpDoC,KAAgBvC,EAAQ,eAAe94C,GAAK,cAAc84C,EAAQ,YAGlEwC,KAAalC,GAAK,MAClBmC,KAAcnC,GAAK,OACnBoC,KAAmBnC,GAAO,uBAC1BoC,KAAiBnB,KAASA,GAAO,WAAW/R,GAC5CmT,KAAiB5C,EAAQ,UACzB6C,KAAalC,GAAW,MACxBmC,KAAa1D,GAAQmB,GAAO,MAAMA,EAAM,GACxCwC,KAAYzC,GAAK,KACjB0C,KAAY1C,GAAK,KACjB2C,KAAY9C,EAAK,KACjB+C,KAAiBlD,EAAQ,UACzBmD,KAAe7C,GAAK,QACpB8C,KAAgBzC,GAAW,SAG3B0C,KAAWjB,GAAUpC,GAAS,UAAU,GACxCsD,KAAMlB,GAAUpC,GAAS,KAAK,GAC9BuD,KAAUnB,GAAUpC,GAAS,SAAS,GACtCwD,KAAMpB,GAAUpC,GAAS,KAAK,GAC9ByD,KAAUrB,GAAUpC,GAAS,SAAS,GACtC0D,KAAetB,GAAU7B,IAAQ,QAAQ,GAGzCoD,KAAUF,MAAW,IAAIA,MAGzBG,KAAY,CAAA,GAGZC,KAAqBC,GAAST,EAAQ,GACtCU,KAAgBD,GAASR,EAAG,GAC5BU,KAAoBF,GAASP,EAAO,GACpCU,KAAgBH,GAASN,EAAG,GAC5BU,KAAoBJ,GAASL,EAAO,GAGpCU,KAAc1C,KAASA,GAAO,YAAYhS,GAC1C2U,KAAgBD,KAAcA,GAAY,UAAU1U,GACpD4U,KAAiBF,KAAcA,GAAY,WAAW1U;AAyH1D,iBAAS6U,EAAO57C,GAAO;AACrB,cAAI67C,GAAa77C,CAAK,KAAK,CAAC87C,EAAQ97C,CAAK,KAAK,EAAEA,aAAiB+7C,KAAc;AAC7E,gBAAI/7C,aAAiBg8C;AACnB,qBAAOh8C;AAET,gBAAIs4C,GAAe,KAAKt4C,GAAO,aAAa;AAC1C,qBAAOi8C,GAAaj8C,CAAK;AAAA,UAEnC;AACM,iBAAO,IAAIg8C,GAAch8C,CAAK;AAAA,QACpC;AAUI,YAAIk8C,KAAc,2BAAW;AAC3B,mBAASvH,IAAS;AAAA,UAAA;AAClB,iBAAO,SAASwH,GAAO;AACrB,gBAAI,CAACppB,GAASopB,CAAK;AACjB,qBAAO,CAAA;AAET,gBAAIhD;AACF,qBAAOA,GAAagD,CAAK;AAE3B,YAAAxH,EAAO,YAAYwH;AACnB,gBAAIl/C,IAAS,IAAI03C;AACjB,mBAAAA,EAAO,YAAY5N,GACZ9pC;AAAA;QAEf;AAOI,iBAASm/C,KAAa;AAAA,QAE1B;AASI,iBAASJ,GAAch8C,GAAOq8C,GAAU;AACtC,eAAK,cAAcr8C,GACnB,KAAK,cAAc,CAAA,GACnB,KAAK,YAAY,CAAC,CAACq8C,GACnB,KAAK,YAAY,GACjB,KAAK,aAAatV;AAAAA,QACxB;AAWI,QAAA6U,EAAO,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQxB,QAAU9P;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQV,UAAYC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQZ,aAAeC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQf,UAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQZ,SAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAQT,GAAK4P;AAAA,UACb;AAAA,WAIIA,EAAO,YAAYQ,GAAW,WAC9BR,EAAO,UAAU,cAAcA,GAE/BI,GAAc,YAAYE,GAAWE,GAAW,SAAS,GACzDJ,GAAc,UAAU,cAAcA;AAWtC,iBAASD,GAAY/7C,GAAO;AAC1B,eAAK,cAAcA,GACnB,KAAK,cAAc,CAAA,GACnB,KAAK,UAAU,GACf,KAAK,eAAe,IACpB,KAAK,gBAAgB,CAAA,GACrB,KAAK,gBAAgBkpC,IACrB,KAAK,YAAY,CAAA;AAAA,QACvB;AAUI,iBAASoT,KAAY;AACnB,cAAIr/C,IAAS,IAAI8+C,GAAY,KAAK,WAAW;AAC7C,iBAAA9+C,EAAO,cAAcs/C,GAAU,KAAK,WAAW,GAC/Ct/C,EAAO,UAAU,KAAK,SACtBA,EAAO,eAAe,KAAK,cAC3BA,EAAO,gBAAgBs/C,GAAU,KAAK,aAAa,GACnDt/C,EAAO,gBAAgB,KAAK,eAC5BA,EAAO,YAAYs/C,GAAU,KAAK,SAAS,GACpCt/C;AAAA,QACb;AAUI,iBAASu/C,KAAc;AACrB,cAAI,KAAK,cAAc;AACrB,gBAAIv/C,IAAS,IAAI8+C,GAAY,IAAI;AACjC,YAAA9+C,EAAO,UAAU,IACjBA,EAAO,eAAe;AAAA,UAC9B;AACQ,YAAAA,IAAS,KAAK,MAAK,GACnBA,EAAO,WAAW;AAEpB,iBAAOA;AAAA,QACb;AAUI,iBAASw/C,KAAY;AACnB,cAAI3rC,IAAQ,KAAK,YAAY,MAAK,GAC9B4rC,IAAM,KAAK,SACXC,IAAQb,EAAQhrC,CAAK,GACrB8rC,IAAUF,IAAM,GAChBG,IAAYF,IAAQ7rC,EAAM,SAAS,GACnC1J,IAAO01C,GAAQ,GAAGD,GAAW,KAAK,SAAS,GAC3Cr3C,IAAQ4B,EAAK,OACbiC,IAAMjC,EAAK,KACXqP,IAASpN,IAAM7D,GACfkD,IAAQk0C,IAAUvzC,IAAO7D,IAAQ,GACjCu3C,IAAY,KAAK,eACjBC,IAAaD,EAAU,QACvBhK,IAAW,GACXkK,IAAY3C,GAAU7jC,GAAQ,KAAK,aAAa;AAEpD,cAAI,CAACkmC,KAAU,CAACC,KAAWC,KAAapmC,KAAUwmC,KAAaxmC;AAC7D,mBAAOymC,GAAiBpsC,GAAO,KAAK,WAAW;AAEjD,cAAI7T,IAAS,CAAA;AAEb,UAAA2R;AACA,mBAAO6H,OAAYs8B,IAAWkK,KAAW;AACvC,cAAAv0C,KAASg0C;AAKT,uBAHIS,IAAY,IACZn9C,IAAQ8Q,EAAMpI,CAAK,GAEhB,EAAEy0C,IAAYH,KAAY;AAC/B,oBAAIj2C,KAAOg2C,EAAUI,CAAS,GAC1B3K,KAAWzrC,GAAK,UAChB1K,KAAO0K,GAAK,MACZq2C,KAAW5K,GAASxyC,CAAK;AAE7B,oBAAI3D,MAAQusC;AACV,kBAAA5oC,IAAQo9C;AAAA,yBACC,CAACA,IAAU;AACpB,sBAAI/gD,MAAQssC;AACV,6BAAS/5B;AAET,wBAAMA;AAAA,gBAEpB;AAAA,cACA;AACQ,cAAA3R,EAAO81C,GAAU,IAAI/yC;AAAA,YAC7B;AACM,iBAAO/C;AAAA,QACb;AAGI,QAAA8+C,GAAY,YAAYG,GAAWE,GAAW,SAAS,GACvDL,GAAY,UAAU,cAAcA;AAWpC,iBAASsB,GAAKC,GAAS;AACrB,cAAI50C,IAAQ,IACR+N,IAAS6mC,KAAW,OAAO,IAAIA,EAAQ;AAG3C,eADA,KAAK,MAAK,GACH,EAAE50C,IAAQ+N,KAAQ;AACvB,gBAAI8mC,IAAQD,EAAQ50C,CAAK;AACzB,iBAAK,IAAI60C,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,UACnC;AAAA,QACA;AASI,iBAASC,KAAY;AACnB,eAAK,WAAWxC,KAAeA,GAAa,IAAI,IAAI,CAAA,GACpD,KAAK,OAAO;AAAA,QAClB;AAYI,iBAASyC,GAAW9iD,GAAK;AACvB,cAAIsC,IAAS,KAAK,IAAItC,CAAG,KAAK,OAAO,KAAK,SAASA,CAAG;AACtD,sBAAK,QAAQsC,IAAS,IAAI,GACnBA;AAAA,QACb;AAWI,iBAASygD,GAAQ/iD,GAAK;AACpB,cAAIoM,IAAO,KAAK;AAChB,cAAIi0C,IAAc;AAChB,gBAAI/9C,IAAS8J,EAAKpM,CAAG;AACrB,mBAAOsC,MAAWoqC,IAAiBN,IAAY9pC;AAAA,UACvD;AACM,iBAAOq7C,GAAe,KAAKvxC,GAAMpM,CAAG,IAAIoM,EAAKpM,CAAG,IAAIosC;AAAAA,QAC1D;AAWI,iBAAS4W,GAAQhjD,GAAK;AACpB,cAAIoM,IAAO,KAAK;AAChB,iBAAOi0C,KAAgBj0C,EAAKpM,CAAG,MAAMosC,IAAauR,GAAe,KAAKvxC,GAAMpM,CAAG;AAAA,QACrF;AAYI,iBAASijD,GAAQjjD,GAAKqF,GAAO;AAC3B,cAAI+G,IAAO,KAAK;AAChB,sBAAK,QAAQ,KAAK,IAAIpM,CAAG,IAAI,IAAI,GACjCoM,EAAKpM,CAAG,IAAKqgD,MAAgBh7C,MAAU+mC,IAAaM,IAAiBrnC,GAC9D;AAAA,QACb;AAGI,QAAAq9C,GAAK,UAAU,QAAQG,IACvBH,GAAK,UAAU,SAAYI,IAC3BJ,GAAK,UAAU,MAAMK,IACrBL,GAAK,UAAU,MAAMM,IACrBN,GAAK,UAAU,MAAMO;AAWrB,iBAASC,GAAUP,GAAS;AAC1B,cAAI50C,IAAQ,IACR+N,IAAS6mC,KAAW,OAAO,IAAIA,EAAQ;AAG3C,eADA,KAAK,MAAK,GACH,EAAE50C,IAAQ+N,KAAQ;AACvB,gBAAI8mC,IAAQD,EAAQ50C,CAAK;AACzB,iBAAK,IAAI60C,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,UACnC;AAAA,QACA;AASI,iBAASO,KAAiB;AACxB,eAAK,WAAW,CAAA,GAChB,KAAK,OAAO;AAAA,QAClB;AAWI,iBAASC,GAAgBpjD,GAAK;AAC5B,cAAIoM,IAAO,KAAK,UACZ2B,IAAQs1C,GAAaj3C,GAAMpM,CAAG;AAElC,cAAI+N,IAAQ;AACV,mBAAO;AAET,cAAIu1C,IAAYl3C,EAAK,SAAS;AAC9B,iBAAI2B,KAASu1C,IACXl3C,EAAK,IAAG,IAERsyC,GAAO,KAAKtyC,GAAM2B,GAAO,CAAC,GAE5B,EAAE,KAAK,MACA;AAAA,QACb;AAWI,iBAASw1C,GAAavjD,GAAK;AACzB,cAAIoM,IAAO,KAAK,UACZ2B,IAAQs1C,GAAaj3C,GAAMpM,CAAG;AAElC,iBAAO+N,IAAQ,IAAIq+B,IAAYhgC,EAAK2B,CAAK,EAAE,CAAC;AAAA,QAClD;AAWI,iBAASy1C,GAAaxjD,GAAK;AACzB,iBAAOqjD,GAAa,KAAK,UAAUrjD,CAAG,IAAI;AAAA,QAChD;AAYI,iBAASyjD,GAAazjD,GAAKqF,GAAO;AAChC,cAAI+G,IAAO,KAAK,UACZ2B,IAAQs1C,GAAaj3C,GAAMpM,CAAG;AAElC,iBAAI+N,IAAQ,KACV,EAAE,KAAK,MACP3B,EAAK,KAAK,CAACpM,GAAKqF,CAAK,CAAC,KAEtB+G,EAAK2B,CAAK,EAAE,CAAC,IAAI1I,GAEZ;AAAA,QACb;AAGI,QAAA69C,GAAU,UAAU,QAAQC,IAC5BD,GAAU,UAAU,SAAYE,IAChCF,GAAU,UAAU,MAAMK,IAC1BL,GAAU,UAAU,MAAMM,IAC1BN,GAAU,UAAU,MAAMO;AAW1B,iBAASC,GAASf,GAAS;AACzB,cAAI50C,IAAQ,IACR+N,IAAS6mC,KAAW,OAAO,IAAIA,EAAQ;AAG3C,eADA,KAAK,MAAK,GACH,EAAE50C,IAAQ+N,KAAQ;AACvB,gBAAI8mC,IAAQD,EAAQ50C,CAAK;AACzB,iBAAK,IAAI60C,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,UACnC;AAAA,QACA;AASI,iBAASe,KAAgB;AACvB,eAAK,OAAO,GACZ,KAAK,WAAW;AAAA,YACd,MAAQ,IAAIjB;AAAA,YACZ,KAAO,KAAKzC,MAAOiD;AAAA,YACnB,QAAU,IAAIR;AAAA;QAEtB;AAWI,iBAASkB,GAAe5jD,GAAK;AAC3B,cAAIsC,IAASuhD,GAAW,MAAM7jD,CAAG,EAAE,OAAUA,CAAG;AAChD,sBAAK,QAAQsC,IAAS,IAAI,GACnBA;AAAA,QACb;AAWI,iBAASwhD,GAAY9jD,GAAK;AACxB,iBAAO6jD,GAAW,MAAM7jD,CAAG,EAAE,IAAIA,CAAG;AAAA,QAC1C;AAWI,iBAAS+jD,GAAY/jD,GAAK;AACxB,iBAAO6jD,GAAW,MAAM7jD,CAAG,EAAE,IAAIA,CAAG;AAAA,QAC1C;AAYI,iBAASgkD,GAAYhkD,GAAKqF,GAAO;AAC/B,cAAI+G,IAAOy3C,GAAW,MAAM7jD,CAAG,GAC3BikD,IAAO73C,EAAK;AAEhB,iBAAAA,EAAK,IAAIpM,GAAKqF,CAAK,GACnB,KAAK,QAAQ+G,EAAK,QAAQ63C,IAAO,IAAI,GAC9B;AAAA,QACb;AAGI,QAAAP,GAAS,UAAU,QAAQC,IAC3BD,GAAS,UAAU,SAAYE,IAC/BF,GAAS,UAAU,MAAMI,IACzBJ,GAAS,UAAU,MAAMK,IACzBL,GAAS,UAAU,MAAMM;AAYzB,iBAASE,GAASvL,GAAQ;AACxB,cAAI5qC,IAAQ,IACR+N,IAAS68B,KAAU,OAAO,IAAIA,EAAO;AAGzC,eADA,KAAK,WAAW,IAAI+K,MACb,EAAE31C,IAAQ+N;AACf,iBAAK,IAAI68B,EAAO5qC,CAAK,CAAC;AAAA,QAE9B;AAYI,iBAASo2C,GAAY9+C,GAAO;AAC1B,sBAAK,SAAS,IAAIA,GAAOqnC,CAAc,GAChC;AAAA,QACb;AAWI,iBAAS0X,GAAY/+C,GAAO;AAC1B,iBAAO,KAAK,SAAS,IAAIA,CAAK;AAAA,QACpC;AAGI,QAAA6+C,GAAS,UAAU,MAAMA,GAAS,UAAU,OAAOC,IACnDD,GAAS,UAAU,MAAME;AAWzB,iBAASC,GAAM1B,GAAS;AACtB,cAAIv2C,IAAO,KAAK,WAAW,IAAI82C,GAAUP,CAAO;AAChD,eAAK,OAAOv2C,EAAK;AAAA,QACvB;AASI,iBAASk4C,KAAa;AACpB,eAAK,WAAW,IAAIpB,MACpB,KAAK,OAAO;AAAA,QAClB;AAWI,iBAASqB,GAAYvkD,GAAK;AACxB,cAAIoM,IAAO,KAAK,UACZ9J,IAAS8J,EAAK,OAAUpM,CAAG;AAE/B,sBAAK,OAAOoM,EAAK,MACV9J;AAAA,QACb;AAWI,iBAASkiD,GAASxkD,GAAK;AACrB,iBAAO,KAAK,SAAS,IAAIA,CAAG;AAAA,QAClC;AAWI,iBAASykD,GAASzkD,GAAK;AACrB,iBAAO,KAAK,SAAS,IAAIA,CAAG;AAAA,QAClC;AAYI,iBAAS0kD,GAAS1kD,GAAKqF,GAAO;AAC5B,cAAI+G,IAAO,KAAK;AAChB,cAAIA,aAAgB82C,IAAW;AAC7B,gBAAIyB,IAAQv4C,EAAK;AACjB,gBAAI,CAAC6zC,MAAQ0E,EAAM,SAASrY,IAAmB;AAC7C,qBAAAqY,EAAM,KAAK,CAAC3kD,GAAKqF,CAAK,CAAC,GACvB,KAAK,OAAO,EAAE+G,EAAK,MACZ;AAET,YAAAA,IAAO,KAAK,WAAW,IAAIs3C,GAASiB,CAAK;AAAA,UACjD;AACM,iBAAAv4C,EAAK,IAAIpM,GAAKqF,CAAK,GACnB,KAAK,OAAO+G,EAAK,MACV;AAAA,QACb;AAGI,QAAAi4C,GAAM,UAAU,QAAQC,IACxBD,GAAM,UAAU,SAAYE,IAC5BF,GAAM,UAAU,MAAMG,IACtBH,GAAM,UAAU,MAAMI,IACtBJ,GAAM,UAAU,MAAMK;AAYtB,iBAASE,GAAcv/C,GAAOw/C,GAAW;AACvC,cAAI7C,IAAQb,EAAQ97C,CAAK,GACrBy/C,IAAQ,CAAC9C,KAAS+C,GAAY1/C,CAAK,GACnC2/C,IAAS,CAAChD,KAAS,CAAC8C,KAASG,GAAS5/C,CAAK,GAC3C6/C,IAAS,CAAClD,KAAS,CAAC8C,KAAS,CAACE,KAAUG,GAAa9/C,CAAK,GAC1D+/C,IAAcpD,KAAS8C,KAASE,KAAUE,GAC1C5iD,IAAS8iD,IAAc/K,GAAUh1C,EAAM,QAAQ+3C,EAAM,IAAI,CAAA,GACzDthC,IAASxZ,EAAO;AAEpB,mBAAStC,KAAOqF;AACd,aAAKw/C,KAAalH,GAAe,KAAKt4C,GAAOrF,CAAG,MAC5C,EAAEolD;AAAA,aAECplD,KAAO;AAAA,YAENglD,MAAWhlD,KAAO,YAAYA,KAAO;AAAA,YAErCklD,MAAWllD,KAAO,YAAYA,KAAO,gBAAgBA,KAAO;AAAA,YAE7DqlD,GAAQrlD,GAAK8b,CAAM,OAExBxZ,EAAO,KAAKtC,CAAG;AAGnB,iBAAOsC;AAAA,QACb;AASI,iBAASgjD,GAAYnvC,GAAO;AAC1B,cAAI2F,IAAS3F,EAAM;AACnB,iBAAO2F,IAAS3F,EAAMovC,GAAW,GAAGzpC,IAAS,CAAC,CAAC,IAAIswB;AAAAA,QACzD;AAUI,iBAASoZ,GAAgBrvC,GAAOzL,GAAG;AACjC,iBAAO+6C,GAAY7D,GAAUzrC,CAAK,GAAGuvC,GAAUh7C,GAAG,GAAGyL,EAAM,MAAM,CAAC;AAAA,QACxE;AASI,iBAASwvC,GAAaxvC,GAAO;AAC3B,iBAAOsvC,GAAY7D,GAAUzrC,CAAK,CAAC;AAAA,QACzC;AAWI,iBAASyvC,GAAiB5L,GAAQh6C,GAAKqF,GAAO;AAC5C,WAAKA,MAAU+mC,KAAa,CAACyZ,GAAG7L,EAAOh6C,CAAG,GAAGqF,CAAK,KAC7CA,MAAU+mC,KAAa,EAAEpsC,KAAOg6C,OACnC8L,GAAgB9L,GAAQh6C,GAAKqF,CAAK;AAAA,QAE1C;AAYI,iBAAS0gD,GAAY/L,GAAQh6C,GAAKqF,GAAO;AACvC,cAAI2gD,IAAWhM,EAAOh6C,CAAG;AACzB,WAAI,EAAE29C,GAAe,KAAK3D,GAAQh6C,CAAG,KAAK6lD,GAAGG,GAAU3gD,CAAK,MACvDA,MAAU+mC,KAAa,EAAEpsC,KAAOg6C,OACnC8L,GAAgB9L,GAAQh6C,GAAKqF,CAAK;AAAA,QAE1C;AAUI,iBAASg+C,GAAaltC,GAAOnW,GAAK;AAEhC,mBADI8b,IAAS3F,EAAM,QACZ2F;AACL,gBAAI+pC,GAAG1vC,EAAM2F,CAAM,EAAE,CAAC,GAAG9b,CAAG;AAC1B,qBAAO8b;AAGX,iBAAO;AAAA,QACb;AAaI,iBAASmqC,GAAe3M,GAAY1B,GAAQC,GAAUC,GAAa;AACjE,iBAAAoO,GAAS5M,GAAY,SAASj0C,GAAOrF,GAAKs5C,GAAY;AACpD,YAAA1B,EAAOE,GAAazyC,GAAOwyC,EAASxyC,CAAK,GAAGi0C,CAAU;AAAA,UAC9D,CAAO,GACMxB;AAAA,QACb;AAWI,iBAASqO,GAAWnM,GAAQxxC,GAAQ;AAClC,iBAAOwxC,KAAUoM,GAAW59C,GAAQvI,GAAKuI,CAAM,GAAGwxC,CAAM;AAAA,QAC9D;AAWI,iBAASqM,GAAarM,GAAQxxC,GAAQ;AACpC,iBAAOwxC,KAAUoM,GAAW59C,GAAQ89C,GAAO99C,CAAM,GAAGwxC,CAAM;AAAA,QAChE;AAWI,iBAAS8L,GAAgB9L,GAAQh6C,GAAKqF,GAAO;AAC3C,UAAIrF,KAAO,eAAe8+C,KACxBA,GAAe9E,GAAQh6C,GAAK;AAAA,YAC1B,cAAgB;AAAA,YAChB,YAAc;AAAA,YACd,OAASqF;AAAA,YACT,UAAY;AAAA,UACtB,CAAS,IAED20C,EAAOh6C,CAAG,IAAIqF;AAAA,QAEtB;AAUI,iBAASkhD,GAAOvM,GAAQwM,GAAO;AAM7B,mBALIz4C,IAAQ,IACR+N,IAAS0qC,EAAM,QACflkD,IAASu6C,EAAM/gC,CAAM,GACrB2qC,IAAOzM,KAAU,MAEd,EAAEjsC,IAAQ+N;AACf,YAAAxZ,EAAOyL,CAAK,IAAI04C,IAAOra,IAAYxhC,GAAIovC,GAAQwM,EAAMz4C,CAAK,CAAC;AAE7D,iBAAOzL;AAAA,QACb;AAWI,iBAASojD,GAAUgB,GAAQC,GAAOC,GAAO;AACvC,iBAAIF,MAAWA,MACTE,MAAUxa,MACZsa,IAASA,KAAUE,IAAQF,IAASE,IAElCD,MAAUva,MACZsa,IAASA,KAAUC,IAAQD,IAASC,KAGjCD;AAAA,QACb;AAkBI,iBAASG,GAAUxhD,GAAOyhD,GAASC,GAAY/mD,GAAKg6C,GAAQtT,GAAO;AACjE,cAAIpkC,GACA0kD,IAASF,IAAUja,GACnBoa,IAASH,IAAUha,GACnBoa,IAASJ,IAAU/Z;AAKvB,cAHIga,MACFzkD,IAAS03C,IAAS+M,EAAW1hD,GAAOrF,GAAKg6C,GAAQtT,CAAK,IAAIqgB,EAAW1hD,CAAK,IAExE/C,MAAW8pC;AACb,mBAAO9pC;AAET,cAAI,CAAC81B,GAAS/yB,CAAK;AACjB,mBAAOA;AAET,cAAI28C,IAAQb,EAAQ97C,CAAK;AACzB,cAAI28C;AAEF,gBADA1/C,IAAS6kD,GAAe9hD,CAAK,GACzB,CAAC2hD;AACH,qBAAOpF,GAAUv8C,GAAO/C,CAAM;AAAA,iBAE3B;AACL,gBAAI8kD,IAAMC,GAAOhiD,CAAK,GAClBiiD,IAASF,KAAOlY,MAAWkY,KAAOjY;AAEtC,gBAAI8V,GAAS5/C,CAAK;AAChB,qBAAOkiD,GAAYliD,GAAO2hD,CAAM;AAElC,gBAAII,KAAO7X,MAAa6X,KAAOzY,MAAY2Y,KAAU,CAACtN;AAEpD,kBADA13C,IAAU2kD,KAAUK,IAAU,CAAA,IAAKE,GAAgBniD,CAAK,GACpD,CAAC2hD;AACH,uBAAOC,IACHQ,GAAcpiD,GAAOghD,GAAa/jD,GAAQ+C,CAAK,CAAC,IAChDqiD,GAAYriD,GAAO8gD,GAAW7jD,GAAQ+C,CAAK,CAAC;AAAA,mBAE7C;AACL,kBAAI,CAAC0wC,GAAcqR,CAAG;AACpB,uBAAOpN,IAAS30C,IAAQ,CAAA;AAE1B,cAAA/C,IAASqlD,GAAetiD,GAAO+hD,GAAKJ,CAAM;AAAA,YACpD;AAAA,UACA;AAEM,UAAAtgB,MAAUA,IAAQ,IAAI2d;AACtB,cAAIuD,IAAUlhB,EAAM,IAAIrhC,CAAK;AAC7B,cAAIuiD;AACF,mBAAOA;AAET,UAAAlhB,EAAM,IAAIrhC,GAAO/C,CAAM,GAEnBulD,GAAMxiD,CAAK,IACbA,EAAM,QAAQ,SAASyiD,GAAU;AAC/B,YAAAxlD,EAAO,IAAIukD,GAAUiB,GAAUhB,GAASC,GAAYe,GAAUziD,GAAOqhC,CAAK,CAAC;AAAA,UACrF,CAAS,IACQqhB,GAAM1iD,CAAK,KACpBA,EAAM,QAAQ,SAASyiD,GAAU9nD,IAAK;AACpC,YAAAsC,EAAO,IAAItC,IAAK6mD,GAAUiB,GAAUhB,GAASC,GAAY/mD,IAAKqF,GAAOqhC,CAAK,CAAC;AAAA,UACrF,CAAS;AAGH,cAAIshB,IAAWd,IACVD,IAASgB,KAAeC,KACxBjB,IAASX,KAASrmD,IAEnBs6C,IAAQyH,IAAQ5V,IAAY4b,EAAS3iD,CAAK;AAC9C,iBAAA0yC,GAAUwC,KAASl1C,GAAO,SAASyiD,GAAU9nD,IAAK;AAChD,YAAIu6C,MACFv6C,KAAM8nD,GACNA,IAAWziD,EAAMrF,EAAG,IAGtB+lD,GAAYzjD,GAAQtC,IAAK6mD,GAAUiB,GAAUhB,GAASC,GAAY/mD,IAAKqF,GAAOqhC,CAAK,CAAC;AAAA,UAC5F,CAAO,GACMpkC;AAAA,QACb;AASI,iBAAS6lD,GAAa3/C,GAAQ;AAC5B,cAAI+xC,IAAQt6C,GAAKuI,CAAM;AACvB,iBAAO,SAASwxC,GAAQ;AACtB,mBAAOoO,GAAepO,GAAQxxC,GAAQ+xC,CAAK;AAAA;QAEnD;AAUI,iBAAS6N,GAAepO,GAAQxxC,GAAQ+xC,GAAO;AAC7C,cAAIz+B,IAASy+B,EAAM;AACnB,cAAIP,KAAU;AACZ,mBAAO,CAACl+B;AAGV,eADAk+B,IAASkD,GAAOlD,CAAM,GACfl+B,OAAU;AACf,gBAAI9b,IAAMu6C,EAAMz+B,CAAM,GAClBo8B,IAAY1vC,EAAOxI,CAAG,GACtBqF,IAAQ20C,EAAOh6C,CAAG;AAEtB,gBAAKqF,MAAU+mC,KAAa,EAAEpsC,KAAOg6C,MAAY,CAAC9B,EAAU7yC,CAAK;AAC/D,qBAAO;AAAA,UAEjB;AACM,iBAAO;AAAA,QACb;AAYI,iBAASgjD,GAAU7Q,GAAM8Q,GAAM5Q,GAAM;AACnC,cAAI,OAAOF,KAAQ;AACjB,kBAAM,IAAI6F,GAAU7Q,CAAe;AAErC,iBAAO+b,GAAW,WAAW;AAAE,YAAA/Q,EAAK,MAAMpL,GAAWsL,CAAI;AAAA,UAAE,GAAI4Q,CAAI;AAAA,QACzE;AAaI,iBAASE,GAAeryC,GAAOwiC,GAAQd,GAAUW,GAAY;AAC3D,cAAIzqC,IAAQ,IACR06C,IAAWpQ,IACXqQ,IAAW,IACX5sC,IAAS3F,EAAM,QACf7T,IAAS,CAAA,GACTqmD,IAAehQ,EAAO;AAE1B,cAAI,CAAC78B;AACH,mBAAOxZ;AAET,UAAIu1C,MACFc,IAASF,GAASE,GAAQ+B,GAAU7C,CAAQ,CAAC,IAE3CW,KACFiQ,IAAWlQ,IACXmQ,IAAW,MAEJ/P,EAAO,UAAUrM,MACxBmc,IAAW7N,IACX8N,IAAW,IACX/P,IAAS,IAAIuL,GAASvL,CAAM;AAE9B,UAAA1kC;AACA,mBAAO,EAAElG,IAAQ+N,KAAQ;AACvB,kBAAIzW,IAAQ8Q,EAAMpI,CAAK,GACnB00C,IAAW5K,KAAY,OAAOxyC,IAAQwyC,EAASxyC,CAAK;AAGxD,kBADAA,IAASmzC,KAAcnzC,MAAU,IAAKA,IAAQ,GAC1CqjD,KAAYjG,MAAaA,GAAU;AAErC,yBADImG,IAAcD,GACXC;AACL,sBAAIjQ,EAAOiQ,CAAW,MAAMnG;AAC1B,6BAASxuC;AAGb,gBAAA3R,EAAO,KAAK+C,CAAK;AAAA,cAC3B,MACa,CAAKojD,EAAS9P,GAAQ8J,GAAUjK,CAAU,KAC7Cl2C,EAAO,KAAK+C,CAAK;AAAA,YAE3B;AACM,iBAAO/C;AAAA,QACb;AAUI,YAAI4jD,KAAW2C,GAAeC,EAAU,GAUpCC,KAAgBF,GAAeG,IAAiB,EAAI;AAWxD,iBAASC,GAAU3P,GAAYpB,GAAW;AACxC,cAAI51C,IAAS;AACb,iBAAA4jD,GAAS5M,GAAY,SAASj0C,GAAO0I,GAAOurC,GAAY;AACtD,mBAAAh3C,IAAS,CAAC,CAAC41C,EAAU7yC,GAAO0I,GAAOurC,CAAU,GACtCh3C;AAAA,UACf,CAAO,GACMA;AAAA,QACb;AAYI,iBAAS4mD,GAAa/yC,GAAO0hC,GAAUW,GAAY;AAIjD,mBAHIzqC,IAAQ,IACR+N,IAAS3F,EAAM,QAEZ,EAAEpI,IAAQ+N,KAAQ;AACvB,gBAAIzW,IAAQ8Q,EAAMpI,CAAK,GACnB+xB,IAAU+X,EAASxyC,CAAK;AAE5B,gBAAIy6B,KAAW,SAAS2iB,MAAarW,IAC5BtM,MAAYA,KAAW,CAACqpB,GAASrpB,CAAO,IACzC0Y,EAAW1Y,GAAS2iB,CAAQ;AAElC,kBAAIA,IAAW3iB,GACXx9B,IAAS+C;AAAA,UAEvB;AACM,iBAAO/C;AAAA,QACb;AAYI,iBAAS8mD,GAASjzC,GAAO9Q,GAAOwF,GAAO6D,GAAK;AAC1C,cAAIoN,IAAS3F,EAAM;AAWnB,eATAtL,IAAQw+C,EAAUx+C,CAAK,GACnBA,IAAQ,MACVA,IAAQ,CAACA,IAAQiR,IAAS,IAAKA,IAASjR,IAE1C6D,IAAOA,MAAQ09B,KAAa19B,IAAMoN,IAAUA,IAASutC,EAAU36C,CAAG,GAC9DA,IAAM,MACRA,KAAOoN,IAETpN,IAAM7D,IAAQ6D,IAAM,IAAI46C,GAAS56C,CAAG,GAC7B7D,IAAQ6D;AACb,YAAAyH,EAAMtL,GAAO,IAAIxF;AAEnB,iBAAO8Q;AAAA,QACb;AAUI,iBAASozC,GAAWjQ,GAAYpB,GAAW;AACzC,cAAI51C,IAAS,CAAA;AACb,iBAAA4jD,GAAS5M,GAAY,SAASj0C,GAAO0I,GAAOurC,GAAY;AACtD,YAAIpB,EAAU7yC,GAAO0I,GAAOurC,CAAU,KACpCh3C,EAAO,KAAK+C,CAAK;AAAA,UAE3B,CAAO,GACM/C;AAAA,QACb;AAaI,iBAASknD,GAAYrzC,GAAOszC,GAAOvR,GAAWwR,GAAUpnD,GAAQ;AAC9D,cAAIyL,IAAQ,IACR+N,IAAS3F,EAAM;AAKnB,eAHA+hC,MAAcA,IAAYyR,KAC1BrnD,MAAWA,IAAS,KAEb,EAAEyL,IAAQ+N,KAAQ;AACvB,gBAAIzW,IAAQ8Q,EAAMpI,CAAK;AACvB,YAAI07C,IAAQ,KAAKvR,EAAU7yC,CAAK,IAC1BokD,IAAQ,IAEVD,GAAYnkD,GAAOokD,IAAQ,GAAGvR,GAAWwR,GAAUpnD,CAAM,IAEzDo2C,GAAUp2C,GAAQ+C,CAAK,IAEfqkD,MACVpnD,EAAOA,EAAO,MAAM,IAAI+C;AAAA,UAElC;AACM,iBAAO/C;AAAA,QACb;AAaI,YAAIsnD,KAAUC,GAAa,GAYvBC,KAAeD,GAAc,EAAI;AAUrC,iBAASf,GAAW9O,GAAQnC,GAAU;AACpC,iBAAOmC,KAAU4P,GAAQ5P,GAAQnC,GAAU53C,EAAI;AAAA,QACrD;AAUI,iBAAS+oD,GAAgBhP,GAAQnC,GAAU;AACzC,iBAAOmC,KAAU8P,GAAa9P,GAAQnC,GAAU53C,EAAI;AAAA,QAC1D;AAWI,iBAAS8pD,GAAc/P,GAAQO,GAAO;AACpC,iBAAOpC,GAAYoC,GAAO,SAASv6C,GAAK;AACtC,mBAAOgqD,GAAWhQ,EAAOh6C,CAAG,CAAC;AAAA,UACrC,CAAO;AAAA,QACP;AAUI,iBAASiqD,GAAQjQ,GAAQ/V,GAAM;AAC7B,UAAAA,IAAOimB,GAASjmB,GAAM+V,CAAM;AAK5B,mBAHIjsC,IAAQ,GACR+N,IAASmoB,EAAK,QAEX+V,KAAU,QAAQjsC,IAAQ+N;AAC/B,YAAAk+B,IAASA,EAAOmQ,GAAMlmB,EAAKl2B,GAAO,CAAC,CAAC;AAEtC,iBAAQA,KAASA,KAAS+N,IAAUk+B,IAAS5N;AAAAA,QACnD;AAaI,iBAASge,GAAepQ,GAAQgO,GAAUqC,GAAa;AACrD,cAAI/nD,IAAS0lD,EAAShO,CAAM;AAC5B,iBAAOmH,EAAQnH,CAAM,IAAI13C,IAASo2C,GAAUp2C,GAAQ+nD,EAAYrQ,CAAM,CAAC;AAAA,QAC7E;AASI,iBAASsQ,GAAWjlD,GAAO;AACzB,iBAAIA,KAAS,OACJA,MAAU+mC,IAAY0D,KAAeR,KAEtCuP,MAAkBA,MAAkB3B,GAAO73C,CAAK,IACpDklD,GAAUllD,CAAK,IACfmlD,GAAenlD,CAAK;AAAA,QAC9B;AAWI,iBAASolD,GAAOplD,GAAOqlD,GAAO;AAC5B,iBAAOrlD,IAAQqlD;AAAA,QACrB;AAUI,iBAASC,GAAQ3Q,GAAQh6C,GAAK;AAC5B,iBAAOg6C,KAAU,QAAQ2D,GAAe,KAAK3D,GAAQh6C,CAAG;AAAA,QAC9D;AAUI,iBAAS4qD,GAAU5Q,GAAQh6C,GAAK;AAC9B,iBAAOg6C,KAAU,QAAQh6C,KAAOk9C,GAAOlD,CAAM;AAAA,QACnD;AAWI,iBAAS6Q,GAAYnE,GAAQ77C,GAAO6D,GAAK;AACvC,iBAAOg4C,KAAU/G,GAAU90C,GAAO6D,CAAG,KAAKg4C,IAAShH,GAAU70C,GAAO6D,CAAG;AAAA,QAC7E;AAYI,iBAASo8C,GAAiBC,GAAQlT,GAAUW,GAAY;AAStD,mBARIiQ,IAAWjQ,IAAaD,KAAoBF,IAC5Cv8B,IAASivC,EAAO,CAAC,EAAE,QACnBC,IAAYD,EAAO,QACnBE,IAAWD,GACXE,IAASrO,EAAMmO,CAAS,GACxBG,IAAY,OACZ7oD,IAAS,CAAA,GAEN2oD,OAAY;AACjB,gBAAI90C,IAAQ40C,EAAOE,CAAQ;AAC3B,YAAIA,KAAYpT,MACd1hC,IAAQsiC,GAAStiC,GAAOukC,GAAU7C,CAAQ,CAAC,IAE7CsT,IAAYxL,GAAUxpC,EAAM,QAAQg1C,CAAS,GAC7CD,EAAOD,CAAQ,IAAI,CAACzS,MAAeX,KAAa/7B,KAAU,OAAO3F,EAAM,UAAU,OAC7E,IAAI+tC,GAAS+G,KAAY90C,CAAK,IAC9Bi2B;AAAAA,UACZ;AACM,UAAAj2B,IAAQ40C,EAAO,CAAC;AAEhB,cAAIh9C,IAAQ,IACRq9C,IAAOF,EAAO,CAAC;AAEnB,UAAAj3C;AACA,mBAAO,EAAElG,IAAQ+N,KAAUxZ,EAAO,SAAS6oD,KAAW;AACpD,kBAAI9lD,IAAQ8Q,EAAMpI,CAAK,GACnB00C,IAAW5K,IAAWA,EAASxyC,CAAK,IAAIA;AAG5C,kBADAA,IAASmzC,KAAcnzC,MAAU,IAAKA,IAAQ,GAC1C,EAAE+lD,IACExQ,GAASwQ,GAAM3I,CAAQ,IACvBgG,EAASnmD,GAAQmgD,GAAUjK,CAAU,IACtC;AAEL,qBADAyS,IAAWD,GACJ,EAAEC,KAAU;AACjB,sBAAIpQ,IAAQqQ,EAAOD,CAAQ;AAC3B,sBAAI,EAAEpQ,IACED,GAASC,GAAO4H,CAAQ,IACxBgG,EAASsC,EAAOE,CAAQ,GAAGxI,GAAUjK,CAAU;AAErD,6BAASvkC;AAAA,gBAEvB;AACU,gBAAIm3C,KACFA,EAAK,KAAK3I,CAAQ,GAEpBngD,EAAO,KAAK+C,CAAK;AAAA,cAC3B;AAAA,YACA;AACM,iBAAO/C;AAAA,QACb;AAaI,iBAAS+oD,GAAarR,GAAQpC,GAAQC,GAAUC,GAAa;AAC3D,iBAAAgR,GAAW9O,GAAQ,SAAS30C,GAAOrF,GAAKg6C,GAAQ;AAC9C,YAAApC,EAAOE,GAAaD,EAASxyC,CAAK,GAAGrF,GAAKg6C,CAAM;AAAA,UACxD,CAAO,GACMlC;AAAA,QACb;AAYI,iBAASwT,GAAWtR,GAAQ/V,GAAMyT,GAAM;AACtC,UAAAzT,IAAOimB,GAASjmB,GAAM+V,CAAM,GAC5BA,IAASna,GAAOma,GAAQ/V,CAAI;AAC5B,cAAIuT,IAAOwC,KAAU,OAAOA,IAASA,EAAOmQ,GAAMoB,GAAKtnB,CAAI,CAAC,CAAC;AAC7D,iBAAOuT,KAAQ,OAAOpL,IAAYmL,GAAMC,GAAMwC,GAAQtC,CAAI;AAAA,QAChE;AASI,iBAAS8T,GAAgBnmD,GAAO;AAC9B,iBAAO67C,GAAa77C,CAAK,KAAKilD,GAAWjlD,CAAK,KAAKspC;AAAA,QACzD;AASI,iBAAS8c,GAAkBpmD,GAAO;AAChC,iBAAO67C,GAAa77C,CAAK,KAAKilD,GAAWjlD,CAAK,KAAK4qC;AAAA,QACzD;AASI,iBAASyb,GAAWrmD,GAAO;AACzB,iBAAO67C,GAAa77C,CAAK,KAAKilD,GAAWjlD,CAAK,KAAK0pC;AAAA,QACzD;AAgBI,iBAAS4c,GAAYtmD,GAAOqlD,GAAO5D,GAASC,GAAYrgB,GAAO;AAC7D,iBAAIrhC,MAAUqlD,IACL,KAELrlD,KAAS,QAAQqlD,KAAS,QAAS,CAACxJ,GAAa77C,CAAK,KAAK,CAAC67C,GAAawJ,CAAK,IACzErlD,MAAUA,KAASqlD,MAAUA,IAE/BkB,GAAgBvmD,GAAOqlD,GAAO5D,GAASC,GAAY4E,IAAajlB,CAAK;AAAA,QAClF;AAgBI,iBAASklB,GAAgB5R,GAAQ0Q,GAAO5D,GAASC,GAAY8E,GAAWnlB,GAAO;AAC7E,cAAIolB,IAAW3K,EAAQnH,CAAM,GACzB+R,IAAW5K,EAAQuJ,CAAK,GACxBsB,IAASF,IAAWld,KAAWyY,GAAOrN,CAAM,GAC5CiS,IAASF,IAAWnd,KAAWyY,GAAOqD,CAAK;AAE/C,UAAAsB,IAASA,KAAUrd,KAAUY,KAAYyc,GACzCC,IAASA,KAAUtd,KAAUY,KAAY0c;AAEzC,cAAIC,IAAWF,KAAUzc,IACrB4c,IAAWF,KAAU1c,IACrB6c,IAAYJ,KAAUC;AAE1B,cAAIG,KAAanH,GAASjL,CAAM,GAAG;AACjC,gBAAI,CAACiL,GAASyF,CAAK;AACjB,qBAAO;AAET,YAAAoB,IAAW,IACXI,IAAW;AAAA,UACnB;AACM,cAAIE,KAAa,CAACF;AAChB,mBAAAxlB,MAAUA,IAAQ,IAAI2d,OACdyH,KAAY3G,GAAanL,CAAM,IACnCqS,GAAYrS,GAAQ0Q,GAAO5D,GAASC,GAAY8E,GAAWnlB,CAAK,IAChE4lB,GAAWtS,GAAQ0Q,GAAOsB,GAAQlF,GAASC,GAAY8E,GAAWnlB,CAAK;AAE7E,cAAI,EAAEogB,IAAU9Z,IAAuB;AACrC,gBAAIuf,IAAeL,KAAYvO,GAAe,KAAK3D,GAAQ,aAAa,GACpEwS,IAAeL,KAAYxO,GAAe,KAAK+M,GAAO,aAAa;AAEvE,gBAAI6B,KAAgBC,GAAc;AAChC,kBAAIC,IAAeF,IAAevS,EAAO,MAAK,IAAKA,GAC/C0S,IAAeF,IAAe9B,EAAM,MAAK,IAAKA;AAElD,qBAAAhkB,MAAUA,IAAQ,IAAI2d,OACfwH,EAAUY,GAAcC,GAAc5F,GAASC,GAAYrgB,CAAK;AAAA,YACjF;AAAA,UACA;AACM,iBAAK0lB,KAGL1lB,MAAUA,IAAQ,IAAI2d,OACfsI,GAAa3S,GAAQ0Q,GAAO5D,GAASC,GAAY8E,GAAWnlB,CAAK,KAH/D;AAAA,QAIf;AASI,iBAASkmB,GAAUvnD,GAAO;AACxB,iBAAO67C,GAAa77C,CAAK,KAAKgiD,GAAOhiD,CAAK,KAAK+pC;AAAA,QACrD;AAYI,iBAASyd,GAAY7S,GAAQxxC,GAAQskD,GAAW/F,GAAY;AAC1D,cAAIh5C,IAAQ++C,EAAU,QAClBhxC,IAAS/N,GACTg/C,IAAe,CAAChG;AAEpB,cAAI/M,KAAU;AACZ,mBAAO,CAACl+B;AAGV,eADAk+B,IAASkD,GAAOlD,CAAM,GACfjsC,OAAS;AACd,gBAAI3B,IAAO0gD,EAAU/+C,CAAK;AAC1B,gBAAKg/C,KAAgB3gD,EAAK,CAAC,IACnBA,EAAK,CAAC,MAAM4tC,EAAO5tC,EAAK,CAAC,CAAC,IAC1B,EAAEA,EAAK,CAAC,KAAK4tC;AAEnB,qBAAO;AAAA,UAEjB;AACM,iBAAO,EAAEjsC,IAAQ+N,KAAQ;AACvB,YAAA1P,IAAO0gD,EAAU/+C,CAAK;AACtB,gBAAI/N,IAAMoM,EAAK,CAAC,GACZ45C,IAAWhM,EAAOh6C,CAAG,GACrBgtD,IAAW5gD,EAAK,CAAC;AAErB,gBAAI2gD,KAAgB3gD,EAAK,CAAC;AACxB,kBAAI45C,MAAa5Z,KAAa,EAAEpsC,KAAOg6C;AACrC,uBAAO;AAAA,mBAEJ;AACL,kBAAItT,IAAQ,IAAI2d;AAChB,kBAAI0C;AACF,oBAAIzkD,IAASykD,EAAWf,GAAUgH,GAAUhtD,GAAKg6C,GAAQxxC,GAAQk+B,CAAK;AAExE,kBAAI,EAAEpkC,MAAW8pC,IACTuf,GAAYqB,GAAUhH,GAAUhZ,IAAuBC,GAAwB8Z,GAAYrgB,CAAK,IAChGpkC;AAEN,uBAAO;AAAA,YAEnB;AAAA,UACA;AACM,iBAAO;AAAA,QACb;AAUI,iBAAS2qD,GAAa5nD,GAAO;AAC3B,cAAI,CAAC+yB,GAAS/yB,CAAK,KAAK6nD,GAAS7nD,CAAK;AACpC,mBAAO;AAET,cAAI8nD,IAAUnD,GAAW3kD,CAAK,IAAI64C,KAAa3L;AAC/C,iBAAO4a,EAAQ,KAAK1M,GAASp7C,CAAK,CAAC;AAAA,QACzC;AASI,iBAAS+nD,GAAa/nD,GAAO;AAC3B,iBAAO67C,GAAa77C,CAAK,KAAKilD,GAAWjlD,CAAK,KAAKqqC;AAAA,QACzD;AASI,iBAAS2d,GAAUhoD,GAAO;AACxB,iBAAO67C,GAAa77C,CAAK,KAAKgiD,GAAOhiD,CAAK,KAAKsqC;AAAA,QACrD;AASI,iBAAS2d,GAAiBjoD,GAAO;AAC/B,iBAAO67C,GAAa77C,CAAK,KACvBkoD,GAASloD,EAAM,MAAM,KAAK,CAAC,CAACywC,GAAewU,GAAWjlD,CAAK,CAAC;AAAA,QACpE;AASI,iBAASmoD,GAAanoD,GAAO;AAG3B,iBAAI,OAAOA,KAAS,aACXA,IAELA,KAAS,OACJ6E,KAEL,OAAO7E,KAAS,WACX87C,EAAQ97C,CAAK,IAChBooD,GAAoBpoD,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC,IACtCqoD,GAAYroD,CAAK,IAEhBoD,GAASpD,CAAK;AAAA,QAC3B;AASI,iBAASsoD,GAAS3T,GAAQ;AACxB,cAAI,CAAC4T,GAAY5T,CAAM;AACrB,mBAAOyF,GAAWzF,CAAM;AAE1B,cAAI13C,IAAS,CAAA;AACb,mBAAStC,KAAOk9C,GAAOlD,CAAM;AAC3B,YAAI2D,GAAe,KAAK3D,GAAQh6C,CAAG,KAAKA,KAAO,iBAC7CsC,EAAO,KAAKtC,CAAG;AAGnB,iBAAOsC;AAAA,QACb;AASI,iBAASurD,GAAW7T,GAAQ;AAC1B,cAAI,CAAC5hB,GAAS4hB,CAAM;AAClB,mBAAO8T,GAAa9T,CAAM;AAE5B,cAAI+T,IAAUH,GAAY5T,CAAM,GAC5B13C,IAAS,CAAA;AAEb,mBAAStC,KAAOg6C;AACd,YAAMh6C,KAAO,kBAAkB+tD,KAAW,CAACpQ,GAAe,KAAK3D,GAAQh6C,CAAG,MACxEsC,EAAO,KAAKtC,CAAG;AAGnB,iBAAOsC;AAAA,QACb;AAWI,iBAAS0rD,GAAO3oD,GAAOqlD,GAAO;AAC5B,iBAAOrlD,IAAQqlD;AAAA,QACrB;AAUI,iBAASuD,GAAQ3U,GAAYzB,GAAU;AACrC,cAAI9pC,IAAQ,IACRzL,IAAS4rD,GAAY5U,CAAU,IAAIuD,EAAMvD,EAAW,MAAM,IAAI,CAAA;AAElE,iBAAA4M,GAAS5M,GAAY,SAASj0C,GAAOrF,GAAKs5C,GAAY;AACpD,YAAAh3C,EAAO,EAAEyL,CAAK,IAAI8pC,EAASxyC,GAAOrF,GAAKs5C,CAAU;AAAA,UACzD,CAAO,GACMh3C;AAAA,QACb;AASI,iBAASorD,GAAYllD,GAAQ;AAC3B,cAAIskD,IAAYqB,GAAa3lD,CAAM;AACnC,iBAAIskD,EAAU,UAAU,KAAKA,EAAU,CAAC,EAAE,CAAC,IAClCsB,GAAwBtB,EAAU,CAAC,EAAE,CAAC,GAAGA,EAAU,CAAC,EAAE,CAAC,CAAC,IAE1D,SAAS9S,GAAQ;AACtB,mBAAOA,MAAWxxC,KAAUqkD,GAAY7S,GAAQxxC,GAAQskD,CAAS;AAAA;QAEzE;AAUI,iBAASW,GAAoBxpB,GAAM+oB,GAAU;AAC3C,iBAAIqB,GAAMpqB,CAAI,KAAKqqB,GAAmBtB,CAAQ,IACrCoB,GAAwBjE,GAAMlmB,CAAI,GAAG+oB,CAAQ,IAE/C,SAAShT,GAAQ;AACtB,gBAAIgM,IAAWp7C,GAAIovC,GAAQ/V,CAAI;AAC/B,mBAAQ+hB,MAAa5Z,KAAa4Z,MAAagH,IAC3CuB,GAAMvU,GAAQ/V,CAAI,IAClB0nB,GAAYqB,GAAUhH,GAAUhZ,IAAuBC,CAAsB;AAAA;QAEzF;AAaI,iBAASuhB,GAAUxU,GAAQxxC,GAAQimD,GAAU1H,GAAYrgB,GAAO;AAC9D,UAAIsT,MAAWxxC,KAGfohD,GAAQphD,GAAQ,SAASwkD,GAAUhtD,GAAK;AAEtC,gBADA0mC,MAAUA,IAAQ,IAAI2d,OAClBjsB,GAAS40B,CAAQ;AACnB,cAAA0B,GAAc1U,GAAQxxC,GAAQxI,GAAKyuD,GAAUD,IAAWzH,GAAYrgB,CAAK;AAAA,iBAEtE;AACH,kBAAIioB,IAAW5H,IACXA,EAAW6H,GAAQ5U,GAAQh6C,CAAG,GAAGgtD,GAAWhtD,IAAM,IAAKg6C,GAAQxxC,GAAQk+B,CAAK,IAC5E0F;AAEJ,cAAIuiB,MAAaviB,MACfuiB,IAAW3B,IAEbpH,GAAiB5L,GAAQh6C,GAAK2uD,CAAQ;AAAA,YAChD;AAAA,aACSrI,EAAM;AAAA,QACf;AAiBI,iBAASoI,GAAc1U,GAAQxxC,GAAQxI,GAAKyuD,GAAUI,GAAW9H,GAAYrgB,GAAO;AAClF,cAAIsf,IAAW4I,GAAQ5U,GAAQh6C,CAAG,GAC9BgtD,IAAW4B,GAAQpmD,GAAQxI,CAAG,GAC9B4nD,IAAUlhB,EAAM,IAAIsmB,CAAQ;AAEhC,cAAIpF,GAAS;AACX,YAAAhC,GAAiB5L,GAAQh6C,GAAK4nD,CAAO;AACrC;AAAA,UACR;AACM,cAAI+G,IAAW5H,IACXA,EAAWf,GAAUgH,GAAWhtD,IAAM,IAAKg6C,GAAQxxC,GAAQk+B,CAAK,IAChE0F,GAEAsc,IAAWiG,MAAaviB;AAE5B,cAAIsc,GAAU;AACZ,gBAAI1G,IAAQb,EAAQ6L,CAAQ,GACxBhI,IAAS,CAAChD,KAASiD,GAAS+H,CAAQ,GACpC8B,IAAU,CAAC9M,KAAS,CAACgD,KAAUG,GAAa6H,CAAQ;AAExD,YAAA2B,IAAW3B,GACPhL,KAASgD,KAAU8J,IACjB3N,EAAQ6E,CAAQ,IAClB2I,IAAW3I,IAEJ+I,GAAkB/I,CAAQ,IACjC2I,IAAW/M,GAAUoE,CAAQ,IAEtBhB,KACP0D,IAAW,IACXiG,IAAWpH,GAAYyF,GAAU,EAAI,KAE9B8B,KACPpG,IAAW,IACXiG,IAAWK,GAAgBhC,GAAU,EAAI,KAGzC2B,IAAW,CAAA,IAGNM,GAAcjC,CAAQ,KAAKjI,GAAYiI,CAAQ,KACtD2B,IAAW3I,GACPjB,GAAYiB,CAAQ,IACtB2I,IAAWO,GAAclJ,CAAQ,KAE1B,CAAC5tB,GAAS4tB,CAAQ,KAAKgE,GAAWhE,CAAQ,OACjD2I,IAAWnH,GAAgBwF,CAAQ,MAIrCtE,IAAW;AAAA,UAErB;AACM,UAAIA,MAEFhiB,EAAM,IAAIsmB,GAAU2B,CAAQ,GAC5BE,EAAUF,GAAU3B,GAAUyB,GAAU1H,GAAYrgB,CAAK,GACzDA,EAAM,OAAUsmB,CAAQ,IAE1BpH,GAAiB5L,GAAQh6C,GAAK2uD,CAAQ;AAAA,QAC5C;AAUI,iBAASQ,GAAQh5C,GAAOzL,GAAG;AACzB,cAAIoR,IAAS3F,EAAM;AACnB,cAAK2F;AAGL,mBAAApR,KAAKA,IAAI,IAAIoR,IAAS,GACfupC,GAAQ36C,GAAGoR,CAAM,IAAI3F,EAAMzL,CAAC,IAAI0hC;AAAAA,QAC7C;AAWI,iBAASgjB,GAAY9V,GAAY8I,GAAWiN,GAAQ;AAClD,UAAIjN,EAAU,SACZA,IAAY3J,GAAS2J,GAAW,SAASvK,GAAU;AACjD,mBAAIsJ,EAAQtJ,CAAQ,IACX,SAASxyC,GAAO;AACrB,qBAAO4kD,GAAQ5kD,GAAOwyC,EAAS,WAAW,IAAIA,EAAS,CAAC,IAAIA,CAAQ;AAAA,YAClF,IAEiBA;AAAA,UACjB,CAAS,IAEDuK,IAAY,CAACl4C,EAAQ;AAGvB,cAAI6D,IAAQ;AACZ,UAAAq0C,IAAY3J,GAAS2J,GAAW1H,GAAU4U,EAAW,CAAE,CAAC;AAExD,cAAIhtD,IAAS2rD,GAAQ3U,GAAY,SAASj0C,GAAOrF,GAAKs5C,GAAY;AAChE,gBAAIiW,IAAW9W,GAAS2J,GAAW,SAASvK,GAAU;AACpD,qBAAOA,EAASxyC,CAAK;AAAA,YAC/B,CAAS;AACD,mBAAO,EAAE,UAAYkqD,GAAU,OAAS,EAAExhD,GAAO,OAAS1I,EAAK;AAAA,UACvE,CAAO;AAED,iBAAO80C,GAAW73C,GAAQ,SAAS03C,GAAQ0Q,GAAO;AAChD,mBAAO8E,GAAgBxV,GAAQ0Q,GAAO2E,CAAM;AAAA,UACpD,CAAO;AAAA,QACP;AAWI,iBAASI,GAASzV,GAAQwM,GAAO;AAC/B,iBAAOkJ,GAAW1V,GAAQwM,GAAO,SAASnhD,GAAO4+B,GAAM;AACrD,mBAAOsqB,GAAMvU,GAAQ/V,CAAI;AAAA,UACjC,CAAO;AAAA,QACP;AAWI,iBAASyrB,GAAW1V,GAAQwM,GAAOtO,GAAW;AAK5C,mBAJInqC,IAAQ,IACR+N,IAAS0qC,EAAM,QACflkD,IAAS,CAAA,GAEN,EAAEyL,IAAQ+N,KAAQ;AACvB,gBAAImoB,IAAOuiB,EAAMz4C,CAAK,GAClB1I,IAAQ4kD,GAAQjQ,GAAQ/V,CAAI;AAEhC,YAAIiU,EAAU7yC,GAAO4+B,CAAI,KACvB0rB,GAAQrtD,GAAQ4nD,GAASjmB,GAAM+V,CAAM,GAAG30C,CAAK;AAAA,UAEvD;AACM,iBAAO/C;AAAA,QACb;AASI,iBAASstD,GAAiB3rB,GAAM;AAC9B,iBAAO,SAAS+V,GAAQ;AACtB,mBAAOiQ,GAAQjQ,GAAQ/V,CAAI;AAAA;QAEnC;AAaI,iBAAS4rB,GAAY15C,GAAOwiC,GAAQd,GAAUW,GAAY;AACxD,cAAIsX,IAAUtX,IAAaqB,KAAkBvB,IACzCvqC,IAAQ,IACR+N,IAAS68B,EAAO,QAChByS,IAAOj1C;AAQX,eANIA,MAAUwiC,MACZA,IAASiJ,GAAUjJ,CAAM,IAEvBd,MACFuT,IAAO3S,GAAStiC,GAAOukC,GAAU7C,CAAQ,CAAC,IAErC,EAAE9pC,IAAQ+N;AAKf,qBAJI29B,IAAY,GACZp0C,IAAQszC,EAAO5qC,CAAK,GACpB00C,IAAW5K,IAAWA,EAASxyC,CAAK,IAAIA,IAEpCo0C,IAAYqW,EAAQ1E,GAAM3I,GAAUhJ,GAAWjB,CAAU,KAAK;AACpE,cAAI4S,MAASj1C,KACXuoC,GAAO,KAAK0M,GAAM3R,GAAW,CAAC,GAEhCiF,GAAO,KAAKvoC,GAAOsjC,GAAW,CAAC;AAGnC,iBAAOtjC;AAAA,QACb;AAWI,iBAAS45C,GAAW55C,GAAO+tB,GAAS;AAIlC,mBAHIpoB,IAAS3F,IAAQ+tB,EAAQ,SAAS,GAClCof,IAAYxnC,IAAS,GAElBA,OAAU;AACf,gBAAI/N,IAAQm2B,EAAQpoB,CAAM;AAC1B,gBAAIA,KAAUwnC,KAAav1C,MAAU89B,GAAU;AAC7C,kBAAIA,IAAW99B;AACf,cAAIs3C,GAAQt3C,CAAK,IACf2wC,GAAO,KAAKvoC,GAAOpI,GAAO,CAAC,IAE3BiiD,GAAU75C,GAAOpI,CAAK;AAAA,YAElC;AAAA,UACA;AACM,iBAAOoI;AAAA,QACb;AAWI,iBAASovC,GAAWoB,GAAOC,GAAO;AAChC,iBAAOD,IAAQvH,GAAYU,GAAY,KAAM8G,IAAQD,IAAQ,EAAE;AAAA,QACrE;AAaI,iBAASsJ,GAAUplD,GAAO6D,GAAKwhD,GAAMxW,GAAW;AAK9C,mBAJI3rC,IAAQ,IACR+N,IAAS4jC,GAAUP,IAAYzwC,IAAM7D,MAAUqlD,KAAQ,EAAE,GAAG,CAAC,GAC7D5tD,IAASu6C,EAAM/gC,CAAM,GAElBA;AACL,YAAAxZ,EAAOo3C,IAAY59B,IAAS,EAAE/N,CAAK,IAAIlD,GACvCA,KAASqlD;AAEX,iBAAO5tD;AAAA,QACb;AAUI,iBAAS6tD,GAAWhX,GAAQzuC,GAAG;AAC7B,cAAIpI,IAAS;AACb,cAAI,CAAC62C,KAAUzuC,IAAI,KAAKA,IAAI0jC;AAC1B,mBAAO9rC;AAIT;AACE,YAAIoI,IAAI,MACNpI,KAAU62C,IAEZzuC,IAAI00C,GAAY10C,IAAI,CAAC,GACjBA,MACFyuC,KAAUA;AAAA,iBAELzuC;AAET,iBAAOpI;AAAA,QACb;AAUI,iBAAS8tD,GAAS5Y,GAAM3sC,GAAO;AAC7B,iBAAOwlD,GAAYC,GAAS9Y,GAAM3sC,GAAOX,EAAQ,GAAGstC,IAAO,EAAE;AAAA,QACnE;AASI,iBAAS+Y,GAAWjX,GAAY;AAC9B,iBAAOgM,GAAY3M,GAAOW,CAAU,CAAC;AAAA,QAC3C;AAUI,iBAASkX,GAAelX,GAAY5uC,GAAG;AACrC,cAAIyL,IAAQwiC,GAAOW,CAAU;AAC7B,iBAAOmM,GAAYtvC,GAAOuvC,GAAUh7C,GAAG,GAAGyL,EAAM,MAAM,CAAC;AAAA,QAC7D;AAYI,iBAASw5C,GAAQ3V,GAAQ/V,GAAM5+B,GAAO0hD,GAAY;AAChD,cAAI,CAAC3uB,GAAS4hB,CAAM;AAClB,mBAAOA;AAET,UAAA/V,IAAOimB,GAASjmB,GAAM+V,CAAM;AAO5B,mBALIjsC,IAAQ,IACR+N,IAASmoB,EAAK,QACdqf,IAAYxnC,IAAS,GACrB20C,IAASzW,GAENyW,KAAU,QAAQ,EAAE1iD,IAAQ+N,KAAQ;AACzC,gBAAI9b,IAAMmqD,GAAMlmB,EAAKl2B,CAAK,CAAC,GACvB4gD,IAAWtpD;AAEf,gBAAIrF,MAAQ,eAAeA,MAAQ,iBAAiBA,MAAQ;AAC1D,qBAAOg6C;AAGT,gBAAIjsC,KAASu1C,GAAW;AACtB,kBAAI0C,IAAWyK,EAAOzwD,CAAG;AACzB,cAAA2uD,IAAW5H,IAAaA,EAAWf,GAAUhmD,GAAKywD,CAAM,IAAIrkB,GACxDuiB,MAAaviB,MACfuiB,IAAWv2B,GAAS4tB,CAAQ,IACxBA,IACCX,GAAQphB,EAAKl2B,IAAQ,CAAC,CAAC,IAAI,CAAA,IAAK;YAEjD;AACQ,YAAAg4C,GAAY0K,GAAQzwD,GAAK2uD,CAAQ,GACjC8B,IAASA,EAAOzwD,CAAG;AAAA,UAC3B;AACM,iBAAOg6C;AAAA,QACb;AAUI,YAAI0W,KAAepQ,KAAqB,SAAS9I,GAAMprC,GAAM;AAC3D,iBAAAk0C,GAAQ,IAAI9I,GAAMprC,CAAI,GACforC;AAAA,YAFoBttC,IAazBymD,KAAmB7R,KAA4B,SAAStH,GAAM2B,GAAQ;AACxE,iBAAO2F,GAAetH,GAAM,YAAY;AAAA,YACtC,cAAgB;AAAA,YAChB,YAAc;AAAA,YACd,OAASoZ,GAASzX,CAAM;AAAA,YACxB,UAAY;AAAA,UACpB,CAAO;AAAA,YANqCjvC;AAgBxC,iBAAS2mD,GAAYvX,GAAY;AAC/B,iBAAOmM,GAAY9M,GAAOW,CAAU,CAAC;AAAA,QAC3C;AAWI,iBAASwX,GAAU36C,GAAOtL,GAAO6D,GAAK;AACpC,cAAIX,IAAQ,IACR+N,IAAS3F,EAAM;AAEnB,UAAItL,IAAQ,MACVA,IAAQ,CAACA,IAAQiR,IAAS,IAAKA,IAASjR,IAE1C6D,IAAMA,IAAMoN,IAASA,IAASpN,GAC1BA,IAAM,MACRA,KAAOoN,IAETA,IAASjR,IAAQ6D,IAAM,IAAMA,IAAM7D,MAAW,GAC9CA,OAAW;AAGX,mBADIvI,IAASu6C,EAAM/gC,CAAM,GAClB,EAAE/N,IAAQ+N;AACf,YAAAxZ,EAAOyL,CAAK,IAAIoI,EAAMpI,IAAQlD,CAAK;AAErC,iBAAOvI;AAAA,QACb;AAWI,iBAASyuD,GAASzX,GAAYpB,GAAW;AACvC,cAAI51C;AAEJ,iBAAA4jD,GAAS5M,GAAY,SAASj0C,GAAO0I,GAAOurC,GAAY;AACtD,mBAAAh3C,IAAS41C,EAAU7yC,GAAO0I,GAAOurC,CAAU,GACpC,CAACh3C;AAAA,UAChB,CAAO,GACM,CAAC,CAACA;AAAA,QACf;AAcI,iBAAS0uD,GAAgB76C,GAAO9Q,GAAO4rD,GAAY;AACjD,cAAIC,IAAM,GACNC,IAAOh7C,KAAS,OAAO+6C,IAAM/6C,EAAM;AAEvC,cAAI,OAAO9Q,KAAS,YAAYA,MAAUA,KAAS8rD,KAAQ1iB,IAAuB;AAChF,mBAAOyiB,IAAMC,KAAM;AACjB,kBAAIxqB,IAAOuqB,IAAMC,MAAU,GACvB1O,IAAWtsC,EAAMwwB,CAAG;AAExB,cAAI8b,MAAa,QAAQ,CAAC0G,GAAS1G,CAAQ,MACtCwO,IAAcxO,KAAYp9C,IAAUo9C,IAAWp9C,KAClD6rD,IAAMvqB,IAAM,IAEZwqB,IAAOxqB;AAAA,YAEnB;AACQ,mBAAOwqB;AAAA,UACf;AACM,iBAAOC,GAAkBj7C,GAAO9Q,GAAO6E,IAAU+mD,CAAU;AAAA,QACjE;AAeI,iBAASG,GAAkBj7C,GAAO9Q,GAAOwyC,GAAUoZ,GAAY;AAC7D,cAAIC,IAAM,GACNC,IAAOh7C,KAAS,OAAO,IAAIA,EAAM;AACrC,cAAIg7C,MAAS;AACX,mBAAO;AAGT,UAAA9rD,IAAQwyC,EAASxyC,CAAK;AAMtB,mBALIgsD,IAAWhsD,MAAUA,GACrBisD,IAAYjsD,MAAU,MACtBksD,IAAcpI,GAAS9jD,CAAK,GAC5BmsD,IAAiBnsD,MAAU+mC,GAExB8kB,IAAMC,KAAM;AACjB,gBAAIxqB,IAAMyY,IAAa8R,IAAMC,KAAQ,CAAC,GAClC1O,IAAW5K,EAAS1hC,EAAMwwB,CAAG,CAAC,GAC9B8qB,IAAehP,MAAarW,GAC5BslB,IAAYjP,MAAa,MACzBkP,IAAiBlP,MAAaA,GAC9BmP,IAAczI,GAAS1G,CAAQ;AAEnC,gBAAI4O;AACF,kBAAIQ,IAASZ,KAAcU;AAAA,gBACtB,CAAIH,IACTK,IAASF,MAAmBV,KAAcQ,KACjCH,IACTO,IAASF,KAAkBF,MAAiBR,KAAc,CAACS,KAClDH,IACTM,IAASF,KAAkBF,KAAgB,CAACC,MAAcT,KAAc,CAACW,KAChEF,KAAaE,IACtBC,IAAS,KAETA,IAASZ,IAAcxO,KAAYp9C,IAAUo9C,IAAWp9C;AAE1D,YAAIwsD,IACFX,IAAMvqB,IAAM,IAEZwqB,IAAOxqB;AAAA,UAEjB;AACM,iBAAOgZ,GAAUwR,GAAM3iB,EAAe;AAAA,QAC5C;AAWI,iBAASsjB,GAAe37C,GAAO0hC,GAAU;AAMvC,mBALI9pC,IAAQ,IACR+N,IAAS3F,EAAM,QACfiiC,IAAW,GACX91C,IAAS,CAAA,GAEN,EAAEyL,IAAQ+N,KAAQ;AACvB,gBAAIzW,IAAQ8Q,EAAMpI,CAAK,GACnB00C,IAAW5K,IAAWA,EAASxyC,CAAK,IAAIA;AAE5C,gBAAI,CAAC0I,KAAS,CAAC83C,GAAGpD,GAAU2I,CAAI,GAAG;AACjC,kBAAIA,IAAO3I;AACX,cAAAngD,EAAO81C,GAAU,IAAI/yC,MAAU,IAAI,IAAIA;AAAA,YACjD;AAAA,UACA;AACM,iBAAO/C;AAAA,QACb;AAUI,iBAASyvD,GAAa1sD,GAAO;AAC3B,iBAAI,OAAOA,KAAS,WACXA,IAEL8jD,GAAS9jD,CAAK,IACTipC,KAEF,CAACjpC;AAAA,QACd;AAUI,iBAAS2sD,GAAa3sD,GAAO;AAE3B,cAAI,OAAOA,KAAS;AAClB,mBAAOA;AAET,cAAI87C,EAAQ97C,CAAK;AAEf,mBAAOozC,GAASpzC,GAAO2sD,EAAY,IAAI;AAEzC,cAAI7I,GAAS9jD,CAAK;AAChB,mBAAO27C,KAAiBA,GAAe,KAAK37C,CAAK,IAAI;AAEvD,cAAI/C,IAAU+C,IAAQ;AACtB,iBAAQ/C,KAAU,OAAQ,IAAI+C,KAAU,CAAC8oC,KAAY,OAAO7rC;AAAA,QAClE;AAWI,iBAAS2vD,GAAS97C,GAAO0hC,GAAUW,GAAY;AAC7C,cAAIzqC,IAAQ,IACR06C,IAAWpQ,IACXv8B,IAAS3F,EAAM,QACfuyC,IAAW,IACXpmD,IAAS,CAAA,GACT8oD,IAAO9oD;AAEX,cAAIk2C;AACF,YAAAkQ,IAAW,IACXD,IAAWlQ;AAAA,mBAEJz8B,KAAUwwB,GAAkB;AACnC,gBAAIpwB,IAAM27B,IAAW,OAAOqa,GAAU/7C,CAAK;AAC3C,gBAAI+F;AACF,qBAAO+/B,GAAW//B,CAAG;AAEvB,YAAAwsC,IAAW,IACXD,IAAW7N,IACXwQ,IAAO,IAAIlH;AAAA,UACnB;AAEQ,YAAAkH,IAAOvT,IAAW,CAAA,IAAKv1C;AAEzB,UAAA2R;AACA,mBAAO,EAAElG,IAAQ+N,KAAQ;AACvB,kBAAIzW,IAAQ8Q,EAAMpI,CAAK,GACnB00C,IAAW5K,IAAWA,EAASxyC,CAAK,IAAIA;AAG5C,kBADAA,IAASmzC,KAAcnzC,MAAU,IAAKA,IAAQ,GAC1CqjD,KAAYjG,MAAaA,GAAU;AAErC,yBADI0P,IAAY/G,EAAK,QACd+G;AACL,sBAAI/G,EAAK+G,CAAS,MAAM1P;AACtB,6BAASxuC;AAGb,gBAAI4jC,KACFuT,EAAK,KAAK3I,CAAQ,GAEpBngD,EAAO,KAAK+C,CAAK;AAAA,cAC3B,MACa,CAAKojD,EAAS2C,GAAM3I,GAAUjK,CAAU,MACvC4S,MAAS9oD,KACX8oD,EAAK,KAAK3I,CAAQ,GAEpBngD,EAAO,KAAK+C,CAAK;AAAA,YAE3B;AACM,iBAAO/C;AAAA,QACb;AAUI,iBAAS0tD,GAAUhW,GAAQ/V,GAAM;AAC/B,iBAAAA,IAAOimB,GAASjmB,GAAM+V,CAAM,GAC5BA,IAASna,GAAOma,GAAQ/V,CAAI,GACrB+V,KAAU,QAAQ,OAAOA,EAAOmQ,GAAMoB,GAAKtnB,CAAI,CAAC,CAAC;AAAA,QAC9D;AAYI,iBAASmuB,GAAWpY,GAAQ/V,GAAMouB,GAAStL,GAAY;AACrD,iBAAO4I,GAAQ3V,GAAQ/V,GAAMouB,EAAQpI,GAAQjQ,GAAQ/V,CAAI,CAAC,GAAG8iB,CAAU;AAAA,QAC7E;AAaI,iBAASuL,GAAUn8C,GAAO+hC,GAAWqa,GAAQ7Y,GAAW;AAItD,mBAHI59B,IAAS3F,EAAM,QACfpI,IAAQ2rC,IAAY59B,IAAS,KAEzB49B,IAAY3rC,MAAU,EAAEA,IAAQ+N,MACtCo8B,EAAU/hC,EAAMpI,CAAK,GAAGA,GAAOoI,CAAK;AAAG;AAEzC,iBAAOo8C,IACHzB,GAAU36C,GAAQujC,IAAY,IAAI3rC,GAAS2rC,IAAY3rC,IAAQ,IAAI+N,CAAM,IACzEg1C,GAAU36C,GAAQujC,IAAY3rC,IAAQ,IAAI,GAAK2rC,IAAY59B,IAAS/N,CAAK;AAAA,QACnF;AAYI,iBAASw0C,GAAiBl9C,GAAOmtD,GAAS;AACxC,cAAIlwD,IAAS+C;AACb,iBAAI/C,aAAkB8+C,OACpB9+C,IAASA,EAAO,MAAK,IAEhBs2C,GAAY4Z,GAAS,SAASlwD,GAAQmwD,GAAQ;AACnD,mBAAOA,EAAO,KAAK,MAAMA,EAAO,SAAS/Z,GAAU,CAACp2C,CAAM,GAAGmwD,EAAO,IAAI,CAAC;AAAA,aACxEnwD,CAAM;AAAA,QACf;AAYI,iBAASowD,GAAQ3H,GAAQlT,GAAUW,GAAY;AAC7C,cAAI18B,IAASivC,EAAO;AACpB,cAAIjvC,IAAS;AACX,mBAAOA,IAASm2C,GAASlH,EAAO,CAAC,CAAC,IAAI,CAAA;AAKxC,mBAHIh9C,IAAQ,IACRzL,IAASu6C,EAAM/gC,CAAM,GAElB,EAAE/N,IAAQ+N;AAIf,qBAHI3F,IAAQ40C,EAAOh9C,CAAK,GACpBk9C,IAAW,IAER,EAAEA,IAAWnvC;AAClB,cAAImvC,KAAYl9C,MACdzL,EAAOyL,CAAK,IAAIy6C,GAAelmD,EAAOyL,CAAK,KAAKoI,GAAO40C,EAAOE,CAAQ,GAAGpT,GAAUW,CAAU;AAInG,iBAAOyZ,GAASzI,GAAYlnD,GAAQ,CAAC,GAAGu1C,GAAUW,CAAU;AAAA,QAClE;AAWI,iBAASma,GAAcpY,GAAO5B,GAAQia,GAAY;AAMhD,mBALI7kD,IAAQ,IACR+N,IAASy+B,EAAM,QACfsY,IAAala,EAAO,QACpBr2C,IAAS,CAAA,GAEN,EAAEyL,IAAQ+N,KAAQ;AACvB,gBAAIzW,IAAQ0I,IAAQ8kD,IAAala,EAAO5qC,CAAK,IAAIq+B;AACjD,YAAAwmB,EAAWtwD,GAAQi4C,EAAMxsC,CAAK,GAAG1I,CAAK;AAAA,UAC9C;AACM,iBAAO/C;AAAA,QACb;AASI,iBAASwwD,GAAoBztD,GAAO;AAClC,iBAAO0pD,GAAkB1pD,CAAK,IAAIA,IAAQ,CAAA;AAAA,QAChD;AASI,iBAAS0tD,GAAa1tD,GAAO;AAC3B,iBAAO,OAAOA,KAAS,aAAaA,IAAQ6E;AAAA,QAClD;AAUI,iBAASggD,GAAS7kD,GAAO20C,GAAQ;AAC/B,iBAAImH,EAAQ97C,CAAK,IACRA,IAEFgpD,GAAMhpD,GAAO20C,CAAM,IAAI,CAAC30C,CAAK,IAAI2tD,GAAaC,GAAS5tD,CAAK,CAAC;AAAA,QAC1E;AAWI,YAAI6tD,KAAW9C;AAWf,iBAAS+C,GAAUh9C,GAAOtL,GAAO6D,GAAK;AACpC,cAAIoN,IAAS3F,EAAM;AACnB,iBAAAzH,IAAMA,MAAQ09B,IAAYtwB,IAASpN,GAC3B,CAAC7D,KAAS6D,KAAOoN,IAAU3F,IAAQ26C,GAAU36C,GAAOtL,GAAO6D,CAAG;AAAA,QAC5E;AAQI,YAAI0kD,KAAepU,MAAmB,SAASn9C,GAAI;AACjD,iBAAOgC,GAAK,aAAahC,CAAE;AAAA;AAW7B,iBAAS0lD,GAAY8L,GAAQrM,GAAQ;AACnC,cAAIA;AACF,mBAAOqM,EAAO,MAAK;AAErB,cAAIv3C,IAASu3C,EAAO,QAChB/wD,IAASg8C,KAAcA,GAAYxiC,CAAM,IAAI,IAAIu3C,EAAO,YAAYv3C,CAAM;AAE9E,iBAAAu3C,EAAO,KAAK/wD,CAAM,GACXA;AAAA,QACb;AASI,iBAASgxD,GAAiBC,GAAa;AACrC,cAAIjxD,IAAS,IAAIixD,EAAY,YAAYA,EAAY,UAAU;AAC/D,qBAAIlV,GAAW/7C,CAAM,EAAE,IAAI,IAAI+7C,GAAWkV,CAAW,CAAC,GAC/CjxD;AAAA,QACb;AAUI,iBAASkxD,GAAcC,GAAUzM,GAAQ;AACvC,cAAIqM,IAASrM,IAASsM,GAAiBG,EAAS,MAAM,IAAIA,EAAS;AACnE,iBAAO,IAAIA,EAAS,YAAYJ,GAAQI,EAAS,YAAYA,EAAS,UAAU;AAAA,QACtF;AASI,iBAASC,GAAYC,GAAQ;AAC3B,cAAIrxD,IAAS,IAAIqxD,EAAO,YAAYA,EAAO,QAAQvhB,GAAQ,KAAKuhB,CAAM,CAAC;AACvE,iBAAArxD,EAAO,YAAYqxD,EAAO,WACnBrxD;AAAA,QACb;AASI,iBAASsxD,GAAYC,GAAQ;AAC3B,iBAAO9S,KAAgB7D,GAAO6D,GAAc,KAAK8S,CAAM,CAAC,IAAI,CAAA;AAAA,QAClE;AAUI,iBAAS7E,GAAgB8E,GAAY9M,GAAQ;AAC3C,cAAIqM,IAASrM,IAASsM,GAAiBQ,EAAW,MAAM,IAAIA,EAAW;AACvE,iBAAO,IAAIA,EAAW,YAAYT,GAAQS,EAAW,YAAYA,EAAW,MAAM;AAAA,QACxF;AAUI,iBAASC,GAAiB1uD,GAAOqlD,GAAO;AACtC,cAAIrlD,MAAUqlD,GAAO;AACnB,gBAAIsJ,IAAe3uD,MAAU+mC,GACzBklB,IAAYjsD,MAAU,MACtB4uD,IAAiB5uD,MAAUA,GAC3BksD,IAAcpI,GAAS9jD,CAAK,GAE5BosD,IAAe/G,MAAUte,GACzBslB,IAAYhH,MAAU,MACtBiH,IAAiBjH,MAAUA,GAC3BkH,IAAczI,GAASuB,CAAK;AAEhC,gBAAK,CAACgH,KAAa,CAACE,KAAe,CAACL,KAAelsD,IAAQqlD,KACtD6G,KAAeE,KAAgBE,KAAkB,CAACD,KAAa,CAACE,KAChEN,KAAaG,KAAgBE,KAC7B,CAACqC,KAAgBrC,KAClB,CAACsC;AACH,qBAAO;AAET,gBAAK,CAAC3C,KAAa,CAACC,KAAe,CAACK,KAAevsD,IAAQqlD,KACtDkH,KAAeoC,KAAgBC,KAAkB,CAAC3C,KAAa,CAACC,KAChEG,KAAasC,KAAgBC,KAC7B,CAACxC,KAAgBwC,KAClB,CAACtC;AACH,qBAAO;AAAA,UAEjB;AACM,iBAAO;AAAA,QACb;AAgBI,iBAASnC,GAAgBxV,GAAQ0Q,GAAO2E,GAAQ;AAO9C,mBANIthD,IAAQ,IACRmmD,IAAcla,EAAO,UACrBma,IAAczJ,EAAM,UACpB5uC,IAASo4C,EAAY,QACrBE,IAAe/E,EAAO,QAEnB,EAAEthD,IAAQ+N,KAAQ;AACvB,gBAAIxZ,IAASyxD,GAAiBG,EAAYnmD,CAAK,GAAGomD,EAAYpmD,CAAK,CAAC;AACpE,gBAAIzL,GAAQ;AACV,kBAAIyL,KAASqmD;AACX,uBAAO9xD;AAET,kBAAIJ,IAAQmtD,EAAOthD,CAAK;AACxB,qBAAOzL,KAAUJ,KAAS,SAAS,KAAK;AAAA,YAClD;AAAA,UACA;AAQM,iBAAO83C,EAAO,QAAQ0Q,EAAM;AAAA,QAClC;AAaI,iBAAS2J,GAAY3c,GAAM4c,GAAUC,GAASC,GAAW;AAUvD,mBATIC,IAAY,IACZC,IAAahd,EAAK,QAClBid,IAAgBJ,EAAQ,QACxBK,IAAY,IACZC,IAAaP,EAAS,QACtBQ,IAAcpV,GAAUgV,IAAaC,GAAe,CAAC,GACrDryD,IAASu6C,EAAMgY,IAAaC,CAAW,GACvCC,IAAc,CAACP,GAEZ,EAAEI,IAAYC;AACnB,YAAAvyD,EAAOsyD,CAAS,IAAIN,EAASM,CAAS;AAExC,iBAAO,EAAEH,IAAYE;AACnB,aAAII,KAAeN,IAAYC,OAC7BpyD,EAAOiyD,EAAQE,CAAS,CAAC,IAAI/c,EAAK+c,CAAS;AAG/C,iBAAOK;AACL,YAAAxyD,EAAOsyD,GAAW,IAAIld,EAAK+c,GAAW;AAExC,iBAAOnyD;AAAA,QACb;AAaI,iBAAS0yD,GAAiBtd,GAAM4c,GAAUC,GAASC,GAAW;AAW5D,mBAVIC,IAAY,IACZC,IAAahd,EAAK,QAClBud,IAAe,IACfN,IAAgBJ,EAAQ,QACxBW,IAAa,IACbC,IAAcb,EAAS,QACvBQ,IAAcpV,GAAUgV,IAAaC,GAAe,CAAC,GACrDryD,IAASu6C,EAAMiY,IAAcK,CAAW,GACxCJ,IAAc,CAACP,GAEZ,EAAEC,IAAYK;AACnB,YAAAxyD,EAAOmyD,CAAS,IAAI/c,EAAK+c,CAAS;AAGpC,mBADIrlD,IAASqlD,GACN,EAAES,IAAaC;AACpB,YAAA7yD,EAAO8M,IAAS8lD,CAAU,IAAIZ,EAASY,CAAU;AAEnD,iBAAO,EAAED,IAAeN;AACtB,aAAII,KAAeN,IAAYC,OAC7BpyD,EAAO8M,IAASmlD,EAAQU,CAAY,CAAC,IAAIvd,EAAK+c,GAAW;AAG7D,iBAAOnyD;AAAA,QACb;AAUI,iBAASs/C,GAAUp5C,GAAQ2N,GAAO;AAChC,cAAIpI,IAAQ,IACR+N,IAAStT,EAAO;AAGpB,eADA2N,MAAUA,IAAQ0mC,EAAM/gC,CAAM,IACvB,EAAE/N,IAAQ+N;AACf,YAAA3F,EAAMpI,CAAK,IAAIvF,EAAOuF,CAAK;AAE7B,iBAAOoI;AAAA,QACb;AAYI,iBAASiwC,GAAW59C,GAAQ+xC,GAAOP,GAAQ+M,GAAY;AACrD,cAAIqO,IAAQ,CAACpb;AACb,UAAAA,MAAWA,IAAS;AAKpB,mBAHIjsC,IAAQ,IACR+N,IAASy+B,EAAM,QAEZ,EAAExsC,IAAQ+N,KAAQ;AACvB,gBAAI9b,IAAMu6C,EAAMxsC,CAAK,GAEjB4gD,IAAW5H,IACXA,EAAW/M,EAAOh6C,CAAG,GAAGwI,EAAOxI,CAAG,GAAGA,GAAKg6C,GAAQxxC,CAAM,IACxD4jC;AAEJ,YAAIuiB,MAAaviB,MACfuiB,IAAWnmD,EAAOxI,CAAG,IAEnBo1D,IACFtP,GAAgB9L,GAAQh6C,GAAK2uD,CAAQ,IAErC5I,GAAY/L,GAAQh6C,GAAK2uD,CAAQ;AAAA,UAE3C;AACM,iBAAO3U;AAAA,QACb;AAUI,iBAAS0N,GAAYl/C,GAAQwxC,GAAQ;AACnC,iBAAOoM,GAAW59C,GAAQ6sD,GAAW7sD,CAAM,GAAGwxC,CAAM;AAAA,QAC1D;AAUI,iBAASyN,GAAcj/C,GAAQwxC,GAAQ;AACrC,iBAAOoM,GAAW59C,GAAQ8sD,GAAa9sD,CAAM,GAAGwxC,CAAM;AAAA,QAC5D;AAUI,iBAASub,GAAiB3d,GAAQ4d,GAAa;AAC7C,iBAAO,SAASlc,GAAYzB,GAAU;AACpC,gBAAIL,IAAO2J,EAAQ7H,CAAU,IAAI3B,KAAkBsO,IAC/CnO,IAAc0d,IAAcA,EAAW,IAAK,CAAA;AAEhD,mBAAOhe,EAAK8B,GAAY1B,GAAQ0X,EAAYzX,GAAU,CAAC,GAAGC,CAAW;AAAA;QAE7E;AASI,iBAAS2d,GAAeC,GAAU;AAChC,iBAAOtF,GAAS,SAASpW,GAAQ2b,GAAS;AACxC,gBAAI5nD,IAAQ,IACR+N,IAAS65C,EAAQ,QACjB5O,IAAajrC,IAAS,IAAI65C,EAAQ75C,IAAS,CAAC,IAAIswB,GAChDwpB,IAAQ95C,IAAS,IAAI65C,EAAQ,CAAC,IAAIvpB;AAWtC,iBATA2a,IAAc2O,EAAS,SAAS,KAAK,OAAO3O,KAAc,cACrDjrC,KAAUirC,KACX3a,GAEAwpB,KAASC,GAAeF,EAAQ,CAAC,GAAGA,EAAQ,CAAC,GAAGC,CAAK,MACvD7O,IAAajrC,IAAS,IAAIswB,IAAY2a,GACtCjrC,IAAS,IAEXk+B,IAASkD,GAAOlD,CAAM,GACf,EAAEjsC,IAAQ+N,KAAQ;AACvB,kBAAItT,IAASmtD,EAAQ5nD,CAAK;AAC1B,cAAIvF,KACFktD,EAAS1b,GAAQxxC,GAAQuF,GAAOg5C,CAAU;AAAA,YAEtD;AACQ,mBAAO/M;AAAA,UACf,CAAO;AAAA,QACP;AAUI,iBAAS6O,GAAetP,GAAUG,GAAW;AAC3C,iBAAO,SAASJ,GAAYzB,GAAU;AACpC,gBAAIyB,KAAc;AAChB,qBAAOA;AAET,gBAAI,CAAC4U,GAAY5U,CAAU;AACzB,qBAAOC,EAASD,GAAYzB,CAAQ;AAMtC,qBAJI/7B,IAASw9B,EAAW,QACpBvrC,IAAQ2rC,IAAY59B,IAAS,IAC7Bg6C,IAAW5Y,GAAO5D,CAAU,IAExBI,IAAY3rC,MAAU,EAAEA,IAAQ+N,MAClC+7B,EAASie,EAAS/nD,CAAK,GAAGA,GAAO+nD,CAAQ,MAAM;AAAnD;AAIF,mBAAOxc;AAAA;QAEf;AASI,iBAASuQ,GAAcnQ,GAAW;AAChC,iBAAO,SAASM,GAAQnC,GAAUmQ,GAAU;AAM1C,qBALIj6C,IAAQ,IACR+nD,IAAW5Y,GAAOlD,CAAM,GACxBO,IAAQyN,EAAShO,CAAM,GACvBl+B,IAASy+B,EAAM,QAEZz+B,OAAU;AACf,kBAAI9b,IAAMu6C,EAAMb,IAAY59B,IAAS,EAAE/N,CAAK;AAC5C,kBAAI8pC,EAASie,EAAS91D,CAAG,GAAGA,GAAK81D,CAAQ,MAAM;AAC7C;AAAA,YAEZ;AACQ,mBAAO9b;AAAA;QAEf;AAYI,iBAAS+b,GAAWve,GAAMsP,GAASrP,GAAS;AAC1C,cAAIue,IAASlP,IAAU5Z,GACnB+oB,IAAOC,GAAW1e,CAAI;AAE1B,mBAAS2e,IAAU;AACjB,gBAAIC,IAAM,QAAQ,SAASvyD,MAAQ,gBAAgBsyD,IAAWF,IAAOze;AACrE,mBAAO4e,EAAG,MAAMJ,IAASve,IAAU,MAAM,SAAS;AAAA,UAC1D;AACM,iBAAO0e;AAAA,QACb;AASI,iBAASE,GAAgBC,GAAY;AACnC,iBAAO,SAASnd,GAAQ;AACtB,YAAAA,IAAS8Z,GAAS9Z,CAAM;AAExB,gBAAI4B,IAAaU,GAAWtC,CAAM,IAC9BmD,GAAcnD,CAAM,IACpB/M,GAEAmP,IAAMR,IACNA,EAAW,CAAC,IACZ5B,EAAO,OAAO,CAAC,GAEfod,IAAWxb,IACXoY,GAAUpY,GAAY,CAAC,EAAE,KAAK,EAAE,IAChC5B,EAAO,MAAM,CAAC;AAElB,mBAAOoC,EAAI+a,CAAU,EAAC,IAAKC;AAAA;QAEnC;AASI,iBAASC,GAAiB5mD,GAAU;AAClC,iBAAO,SAASupC,GAAQ;AACtB,mBAAOP,GAAY6d,GAAMC,GAAOvd,CAAM,EAAE,QAAQ7D,IAAQ,EAAE,CAAC,GAAG1lC,GAAU,EAAE;AAAA;QAElF;AAUI,iBAASsmD,GAAWD,GAAM;AACxB,iBAAO,WAAW;AAIhB,gBAAIve,IAAO;AACX,oBAAQA,EAAK,QAAM;AAAA,cACjB,KAAK;AAAG,uBAAO,IAAIue;AAAA,cACnB,KAAK;AAAG,uBAAO,IAAIA,EAAKve,EAAK,CAAC,CAAC;AAAA,cAC/B,KAAK;AAAG,uBAAO,IAAIue,EAAKve,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,cACxC,KAAK;AAAG,uBAAO,IAAIue,EAAKve,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,cACjD,KAAK;AAAG,uBAAO,IAAIue,EAAKve,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,cAC1D,KAAK;AAAG,uBAAO,IAAIue,EAAKve,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,cACnE,KAAK;AAAG,uBAAO,IAAIue,EAAKve,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,cAC5E,KAAK;AAAG,uBAAO,IAAIue,EAAKve,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,YAC/F;AACQ,gBAAIif,IAAcpV,GAAW0U,EAAK,SAAS,GACvC3zD,IAAS2zD,EAAK,MAAMU,GAAajf,CAAI;AAIzC,mBAAOtf,GAAS91B,CAAM,IAAIA,IAASq0D;AAAA;QAE3C;AAWI,iBAASC,GAAYpf,GAAMsP,GAAS+P,GAAO;AACzC,cAAIZ,IAAOC,GAAW1e,CAAI;AAE1B,mBAAS2e,IAAU;AAMjB,qBALIr6C,IAAS,UAAU,QACnB47B,IAAOmF,EAAM/gC,CAAM,GACnB/N,IAAQ+N,GACRq/B,IAAc2b,GAAUX,CAAO,GAE5BpoD;AACL,cAAA2pC,EAAK3pC,CAAK,IAAI,UAAUA,CAAK;AAE/B,gBAAIwmD,IAAWz4C,IAAS,KAAK47B,EAAK,CAAC,MAAMyD,KAAezD,EAAK57B,IAAS,CAAC,MAAMq/B,IACzE,CAAA,IACAa,GAAetE,GAAMyD,CAAW;AAGpC,gBADAr/B,KAAUy4C,EAAQ,QACdz4C,IAAS+6C;AACX,qBAAOE;AAAA,gBACLvf;AAAA,gBAAMsP;AAAA,gBAASkQ;AAAA,gBAAcb,EAAQ;AAAA,gBAAa/pB;AAAAA,gBAClDsL;AAAA,gBAAM6c;AAAA,gBAASnoB;AAAAA,gBAAWA;AAAAA,gBAAWyqB,IAAQ/6C;AAAA,cAAM;AAEvD,gBAAIs6C,IAAM,QAAQ,SAASvyD,MAAQ,gBAAgBsyD,IAAWF,IAAOze;AACrE,mBAAOD,GAAM6e,GAAI,MAAM1e,CAAI;AAAA,UACnC;AACM,iBAAOye;AAAA,QACb;AASI,iBAASc,GAAWC,GAAe;AACjC,iBAAO,SAAS5d,GAAYpB,GAAWuB,GAAW;AAChD,gBAAIqc,IAAW5Y,GAAO5D,CAAU;AAChC,gBAAI,CAAC4U,GAAY5U,CAAU,GAAG;AAC5B,kBAAIzB,IAAWyX,EAAYpX,GAAW,CAAC;AACvC,cAAAoB,IAAar5C,GAAKq5C,CAAU,GAC5BpB,IAAY,SAASl4C,GAAK;AAAE,uBAAO63C,EAASie,EAAS91D,CAAG,GAAGA,GAAK81D,CAAQ;AAAA,cAAE;AAAA,YACpF;AACQ,gBAAI/nD,IAAQmpD,EAAc5d,GAAYpB,GAAWuB,CAAS;AAC1D,mBAAO1rC,IAAQ,KAAK+nD,EAASje,IAAWyB,EAAWvrC,CAAK,IAAIA,CAAK,IAAIq+B;AAAAA;QAE7E;AASI,iBAAS+qB,GAAWzd,GAAW;AAC7B,iBAAO0d,GAAS,SAASC,GAAO;AAC9B,gBAAIv7C,IAASu7C,EAAM,QACftpD,IAAQ+N,GACRw7C,IAASjW,GAAc,UAAU;AAKrC,iBAHI3H,KACF2d,EAAM,QAAO,GAERtpD,OAAS;AACd,kBAAIypC,IAAO6f,EAAMtpD,CAAK;AACtB,kBAAI,OAAOypC,KAAQ;AACjB,sBAAM,IAAI6F,GAAU7Q,CAAe;AAErC,kBAAI8qB,KAAU,CAACnB,KAAWoB,GAAY/f,CAAI,KAAK;AAC7C,oBAAI2e,IAAU,IAAI9U,GAAc,CAAA,GAAI,EAAI;AAAA,YAEpD;AAEQ,iBADAtzC,IAAQooD,IAAUpoD,IAAQ+N,GACnB,EAAE/N,IAAQ+N,KAAQ;AACvB,cAAA07B,IAAO6f,EAAMtpD,CAAK;AAElB,kBAAIypD,IAAWD,GAAY/f,CAAI,GAC3BprC,IAAOorD,KAAY,YAAYC,GAAQjgB,CAAI,IAAIpL;AAEnD,cAAIhgC,KAAQsrD,GAAWtrD,EAAK,CAAC,CAAC,KACxBA,EAAK,CAAC,MAAMqhC,IAAgBJ,IAAkBE,IAAoBG,MAClE,CAACthC,EAAK,CAAC,EAAE,UAAUA,EAAK,CAAC,KAAK,IAElC+pD,IAAUA,EAAQoB,GAAYnrD,EAAK,CAAC,CAAC,CAAC,EAAE,MAAM+pD,GAAS/pD,EAAK,CAAC,CAAC,IAE9D+pD,IAAW3e,EAAK,UAAU,KAAKkgB,GAAWlgB,CAAI,IAC1C2e,EAAQqB,CAAQ,EAAC,IACjBrB,EAAQ,KAAK3e,CAAI;AAAA,YAEjC;AACQ,mBAAO,WAAW;AAChB,kBAAIE,IAAO,WACPryC,IAAQqyC,EAAK,CAAC;AAElB,kBAAIye,KAAWze,EAAK,UAAU,KAAKyJ,EAAQ97C,CAAK;AAC9C,uBAAO8wD,EAAQ,MAAM9wD,CAAK,EAAE,MAAK;AAKnC,uBAHI0I,IAAQ,GACRzL,IAASwZ,IAASu7C,EAAMtpD,CAAK,EAAE,MAAM,MAAM2pC,CAAI,IAAIryC,GAEhD,EAAE0I,IAAQ+N;AACf,gBAAAxZ,IAAS+0D,EAAMtpD,CAAK,EAAE,KAAK,MAAMzL,CAAM;AAEzC,qBAAOA;AAAA;UAEjB,CAAO;AAAA,QACP;AAqBI,iBAAS00D,GAAaxf,GAAMsP,GAASrP,GAAS6c,GAAUC,GAASoD,GAAeC,GAAcC,GAAQC,GAAKjB,GAAO;AAChH,cAAIkB,IAAQjR,IAAUrZ,GAClBuoB,IAASlP,IAAU5Z,GACnB8qB,IAAYlR,IAAU3Z,GACtBqnB,IAAY1N,KAAWzZ,IAAkBC,IACzC2qB,IAASnR,IAAUnZ,IACnBsoB,IAAO+B,IAAY5rB,IAAY8pB,GAAW1e,CAAI;AAElD,mBAAS2e,IAAU;AAKjB,qBAJIr6C,KAAS,UAAU,QACnB47B,KAAOmF,EAAM/gC,EAAM,GACnB/N,KAAQ+N,IAEL/N;AACL,cAAA2pC,GAAK3pC,EAAK,IAAI,UAAUA,EAAK;AAE/B,gBAAIymD;AACF,kBAAIrZ,KAAc2b,GAAUX,CAAO,GAC/B+B,KAAehd,GAAaxD,IAAMyD,EAAW;AASnD,gBAPImZ,MACF5c,KAAO2c,GAAY3c,IAAM4c,GAAUC,GAASC,CAAS,IAEnDmD,MACFjgB,KAAOsd,GAAiBtd,IAAMigB,GAAeC,GAAcpD,CAAS,IAEtE14C,MAAUo8C,IACN1D,KAAa14C,KAAS+6C,GAAO;AAC/B,kBAAIsB,KAAanc,GAAetE,IAAMyD,EAAW;AACjD,qBAAO4b;AAAA,gBACLvf;AAAA,gBAAMsP;AAAA,gBAASkQ;AAAA,gBAAcb,EAAQ;AAAA,gBAAa1e;AAAA,gBAClDC;AAAA,gBAAMygB;AAAA,gBAAYN;AAAA,gBAAQC;AAAA,gBAAKjB,IAAQ/6C;AAAA;YAEnD;AACQ,gBAAI66C,KAAcX,IAASve,IAAU,MACjC2e,KAAK4B,IAAYrB,GAAYnf,CAAI,IAAIA;AAEzC,mBAAA17B,KAAS47B,GAAK,QACVmgB,IACFngB,KAAO0gB,GAAQ1gB,IAAMmgB,CAAM,IAClBI,KAAUn8C,KAAS,KAC5B47B,GAAK,QAAO,GAEVqgB,KAASD,IAAMh8C,OACjB47B,GAAK,SAASogB,IAEZ,QAAQ,SAASj0D,MAAQ,gBAAgBsyD,MAC3CC,KAAKH,KAAQC,GAAWE,EAAE,IAErBA,GAAG,MAAMO,IAAajf,EAAI;AAAA,UACzC;AACM,iBAAOye;AAAA,QACb;AAUI,iBAASkC,GAAezgB,GAAQ0gB,GAAY;AAC1C,iBAAO,SAASte,GAAQnC,GAAU;AAChC,mBAAOwT,GAAarR,GAAQpC,GAAQ0gB,EAAWzgB,CAAQ,GAAG,EAAE;AAAA;QAEpE;AAUI,iBAAS0gB,GAAoBC,GAAUC,GAAc;AACnD,iBAAO,SAASpzD,GAAOqlD,GAAO;AAC5B,gBAAIpoD;AACJ,gBAAI+C,MAAU+mC,KAAase,MAAUte;AACnC,qBAAOqsB;AAKT,gBAHIpzD,MAAU+mC,MACZ9pC,IAAS+C,IAEPqlD,MAAUte,GAAW;AACvB,kBAAI9pC,MAAW8pC;AACb,uBAAOse;AAET,cAAI,OAAOrlD,KAAS,YAAY,OAAOqlD,KAAS,YAC9CrlD,IAAQ2sD,GAAa3sD,CAAK,GAC1BqlD,IAAQsH,GAAatH,CAAK,MAE1BrlD,IAAQ0sD,GAAa1sD,CAAK,GAC1BqlD,IAAQqH,GAAarH,CAAK,IAE5BpoD,IAASk2D,EAASnzD,GAAOqlD,CAAK;AAAA,YACxC;AACQ,mBAAOpoD;AAAA;QAEf;AASI,iBAASo2D,GAAWC,GAAW;AAC7B,iBAAOvB,GAAS,SAAShV,GAAW;AAClC,mBAAAA,IAAY3J,GAAS2J,GAAW1H,GAAU4U,EAAW,CAAE,CAAC,GACjDc,GAAS,SAAS1Y,GAAM;AAC7B,kBAAID,IAAU;AACd,qBAAOkhB,EAAUvW,GAAW,SAASvK,GAAU;AAC7C,uBAAON,GAAMM,GAAUJ,GAASC,CAAI;AAAA,cAChD,CAAW;AAAA,YACX,CAAS;AAAA,UACT,CAAO;AAAA,QACP;AAWI,iBAASkhB,GAAc98C,GAAQ+8C,GAAO;AACpC,UAAAA,IAAQA,MAAUzsB,IAAY,MAAM4lB,GAAa6G,CAAK;AAEtD,cAAIC,IAAcD,EAAM;AACxB,cAAIC,IAAc;AAChB,mBAAOA,IAAc3I,GAAW0I,GAAO/8C,CAAM,IAAI+8C;AAEnD,cAAIv2D,IAAS6tD,GAAW0I,GAAO1Z,GAAWrjC,IAASsgC,GAAWyc,CAAK,CAAC,CAAC;AACrE,iBAAOpd,GAAWod,CAAK,IACnB1F,GAAU7W,GAAch6C,CAAM,GAAG,GAAGwZ,CAAM,EAAE,KAAK,EAAE,IACnDxZ,EAAO,MAAM,GAAGwZ,CAAM;AAAA,QAChC;AAcI,iBAASi9C,GAAcvhB,GAAMsP,GAASrP,GAAS6c,GAAU;AACvD,cAAI0B,IAASlP,IAAU5Z,GACnB+oB,IAAOC,GAAW1e,CAAI;AAE1B,mBAAS2e,IAAU;AAQjB,qBAPI1B,IAAY,IACZC,IAAa,UAAU,QACvBE,IAAY,IACZC,IAAaP,EAAS,QACtB5c,IAAOmF,EAAMgY,IAAaH,CAAU,GACpC0B,IAAM,QAAQ,SAASvyD,MAAQ,gBAAgBsyD,IAAWF,IAAOze,GAE9D,EAAEod,IAAYC;AACnB,cAAAnd,EAAKkd,CAAS,IAAIN,EAASM,CAAS;AAEtC,mBAAOF;AACL,cAAAhd,EAAKkd,GAAW,IAAI,UAAU,EAAEH,CAAS;AAE3C,mBAAOld,GAAM6e,GAAIJ,IAASve,IAAU,MAAMC,CAAI;AAAA,UACtD;AACM,iBAAOye;AAAA,QACb;AASI,iBAAS6C,GAAYtf,GAAW;AAC9B,iBAAO,SAAS7uC,GAAO6D,GAAKwhD,GAAM;AAChC,mBAAIA,KAAQ,OAAOA,KAAQ,YAAY2F,GAAehrD,GAAO6D,GAAKwhD,CAAI,MACpExhD,IAAMwhD,IAAO9jB,IAGfvhC,IAAQouD,GAASpuD,CAAK,GAClB6D,MAAQ09B,KACV19B,IAAM7D,GACNA,IAAQ,KAER6D,IAAMuqD,GAASvqD,CAAG,GAEpBwhD,IAAOA,MAAS9jB,IAAavhC,IAAQ6D,IAAM,IAAI,KAAMuqD,GAAS/I,CAAI,GAC3DD,GAAUplD,GAAO6D,GAAKwhD,GAAMxW,CAAS;AAAA;QAEpD;AASI,iBAASwf,GAA0BV,GAAU;AAC3C,iBAAO,SAASnzD,GAAOqlD,GAAO;AAC5B,mBAAM,OAAOrlD,KAAS,YAAY,OAAOqlD,KAAS,aAChDrlD,IAAQ8zD,GAAS9zD,CAAK,GACtBqlD,IAAQyO,GAASzO,CAAK,IAEjB8N,EAASnzD,GAAOqlD,CAAK;AAAA;QAEpC;AAmBI,iBAASqM,GAAcvf,GAAMsP,GAASsS,GAAUje,GAAa1D,GAAS6c,GAAUC,GAASsD,GAAQC,GAAKjB,GAAO;AAC3G,cAAIwC,IAAUvS,IAAUzZ,GACpB8qB,IAAakB,IAAU9E,IAAUnoB,GACjCktB,IAAkBD,IAAUjtB,IAAYmoB,GACxCgF,IAAcF,IAAU/E,IAAWloB,GACnCotB,IAAmBH,IAAUjtB,IAAYkoB;AAE7C,UAAAxN,KAAYuS,IAAU9rB,IAAoBC,GAC1CsZ,KAAW,EAAEuS,IAAU7rB,IAA0BD,IAE3CuZ,IAAU1Z,MACd0Z,KAAW;AAEb,cAAI2S,IAAU;AAAA,YACZjiB;AAAA,YAAMsP;AAAA,YAASrP;AAAA,YAAS8hB;AAAA,YAAapB;AAAA,YAAYqB;AAAA,YACjDF;AAAA,YAAiBzB;AAAA,YAAQC;AAAA,YAAKjB;AAAA,aAG5Bv0D,IAAS82D,EAAS,MAAMhtB,GAAWqtB,CAAO;AAC9C,iBAAI/B,GAAWlgB,CAAI,KACjBkiB,GAAQp3D,GAAQm3D,CAAO,GAEzBn3D,EAAO,cAAc64C,GACdwe,GAAgBr3D,GAAQk1C,GAAMsP,CAAO;AAAA,QAClD;AASI,iBAAS8S,GAAYtD,GAAY;AAC/B,cAAI9e,IAAOyF,GAAKqZ,CAAU;AAC1B,iBAAO,SAAS5P,GAAQ9b,GAAW;AAGjC,gBAFA8b,IAASyS,GAASzS,CAAM,GACxB9b,IAAYA,KAAa,OAAO,IAAI+U,GAAU0J,EAAUze,CAAS,GAAG,GAAG,GACnEA,KAAa2U,GAAemH,CAAM,GAAG;AAGvC,kBAAImT,KAAQ5G,GAASvM,CAAM,IAAI,KAAK,MAAM,GAAG,GACzCrhD,IAAQmyC,EAAKqiB,EAAK,CAAC,IAAI,OAAO,CAACA,EAAK,CAAC,IAAIjvB,EAAU;AAEvD,qBAAAivB,KAAQ5G,GAAS5tD,CAAK,IAAI,KAAK,MAAM,GAAG,GACjC,EAAEw0D,EAAK,CAAC,IAAI,OAAO,CAACA,EAAK,CAAC,IAAIjvB;AAAA,YAC/C;AACQ,mBAAO4M,EAAKkP,CAAM;AAAA;QAE1B;AASI,YAAIwL,KAAc/R,MAAQ,IAAIlE,GAAW,IAAIkE,GAAI,CAAA,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAMhS,KAAmB,SAASwK,GAAQ;AAClG,iBAAO,IAAIwH,GAAIxH,CAAM;AAAA,YADqDmhB;AAW5E,iBAASC,GAAc/R,GAAU;AAC/B,iBAAO,SAAShO,GAAQ;AACtB,gBAAIoN,IAAMC,GAAOrN,CAAM;AACvB,mBAAIoN,KAAOhY,KACFyM,GAAW7B,CAAM,IAEtBoN,KAAOzX,KACFuM,GAAWlC,CAAM,IAEnBM,GAAYN,GAAQgO,EAAShO,CAAM,CAAC;AAAA;QAEnD;AA2BI,iBAASggB,GAAWxiB,GAAMsP,GAASrP,GAAS6c,GAAUC,GAASsD,GAAQC,GAAKjB,GAAO;AACjF,cAAImB,IAAYlR,IAAU3Z;AAC1B,cAAI,CAAC6qB,KAAa,OAAOxgB,KAAQ;AAC/B,kBAAM,IAAI6F,GAAU7Q,CAAe;AAErC,cAAI1wB,IAASw4C,IAAWA,EAAS,SAAS;AAS1C,cARKx4C,MACHgrC,KAAW,KACXwN,IAAWC,IAAUnoB,IAEvB0rB,IAAMA,MAAQ1rB,IAAY0rB,IAAMpY,GAAU2J,EAAUyO,CAAG,GAAG,CAAC,GAC3DjB,IAAQA,MAAUzqB,IAAYyqB,IAAQxN,EAAUwN,CAAK,GACrD/6C,KAAUy4C,IAAUA,EAAQ,SAAS,GAEjCzN,IAAUtZ,GAAyB;AACrC,gBAAImqB,IAAgBrD,GAChBsD,IAAerD;AAEnB,YAAAD,IAAWC,IAAUnoB;AAAAA,UAC7B;AACM,cAAIhgC,IAAO4rD,IAAY5rB,IAAYqrB,GAAQjgB,CAAI,GAE3CiiB,IAAU;AAAA,YACZjiB;AAAA,YAAMsP;AAAA,YAASrP;AAAA,YAAS6c;AAAA,YAAUC;AAAA,YAASoD;AAAA,YAAeC;AAAA,YAC1DC;AAAA,YAAQC;AAAA,YAAKjB;AAAA;AAkBf,cAfIzqD,KACF6tD,GAAUR,GAASrtD,CAAI,GAEzBorC,IAAOiiB,EAAQ,CAAC,GAChB3S,IAAU2S,EAAQ,CAAC,GACnBhiB,IAAUgiB,EAAQ,CAAC,GACnBnF,IAAWmF,EAAQ,CAAC,GACpBlF,IAAUkF,EAAQ,CAAC,GACnB5C,IAAQ4C,EAAQ,CAAC,IAAIA,EAAQ,CAAC,MAAMrtB,IAC/B4rB,IAAY,IAAIxgB,EAAK,SACtBkI,GAAU+Z,EAAQ,CAAC,IAAI39C,GAAQ,CAAC,GAEhC,CAAC+6C,KAAS/P,KAAWzZ,IAAkBC,OACzCwZ,KAAW,MAET,CAACA,KAAWA,KAAW5Z;AACzB,gBAAI5qC,IAASyzD,GAAWve,GAAMsP,GAASrP,CAAO;AAAA,cACzC,CAAIqP,KAAWzZ,KAAmByZ,KAAWxZ,IAClDhrC,IAASs0D,GAAYpf,GAAMsP,GAAS+P,CAAK,KAC/B/P,KAAWvZ,KAAqBuZ,MAAY5Z,IAAiBK,OAAuB,CAACgnB,EAAQ,SACvGjyD,IAASy2D,GAAcvhB,GAAMsP,GAASrP,GAAS6c,CAAQ,IAEvDhyD,IAAS00D,GAAa,MAAM5qB,GAAWqtB,CAAO;AAEhD,cAAI7hB,IAASxrC,IAAOskD,KAAcgJ;AAClC,iBAAOC,GAAgB/hB,EAAOt1C,GAAQm3D,CAAO,GAAGjiB,GAAMsP,CAAO;AAAA,QACnE;AAcI,iBAASoT,GAAuBlU,GAAUgH,GAAUhtD,GAAKg6C,GAAQ;AAC/D,iBAAIgM,MAAa5Z,KACZyZ,GAAGG,GAAUxI,GAAYx9C,CAAG,CAAC,KAAK,CAAC29C,GAAe,KAAK3D,GAAQh6C,CAAG,IAC9DgtD,IAEFhH;AAAA,QACb;AAgBI,iBAASmU,GAAoBnU,GAAUgH,GAAUhtD,GAAKg6C,GAAQxxC,GAAQk+B,GAAO;AAC3E,iBAAItO,GAAS4tB,CAAQ,KAAK5tB,GAAS40B,CAAQ,MAEzCtmB,EAAM,IAAIsmB,GAAUhH,CAAQ,GAC5BwI,GAAUxI,GAAUgH,GAAU5gB,GAAW+tB,IAAqBzzB,CAAK,GACnEA,EAAM,OAAUsmB,CAAQ,IAEnBhH;AAAA,QACb;AAWI,iBAASoU,GAAgB/0D,GAAO;AAC9B,iBAAO4pD,GAAc5pD,CAAK,IAAI+mC,IAAY/mC;AAAA,QAChD;AAeI,iBAASgnD,GAAYl2C,GAAOu0C,GAAO5D,GAASC,GAAY8E,GAAWnlB,GAAO;AACxE,cAAI2zB,IAAYvT,IAAU9Z,GACtBkV,IAAY/rC,EAAM,QAClB60C,IAAYN,EAAM;AAEtB,cAAIxI,KAAa8I,KAAa,EAAEqP,KAAarP,IAAY9I;AACvD,mBAAO;AAGT,cAAIoY,IAAa5zB,EAAM,IAAIvwB,CAAK,GAC5BokD,IAAa7zB,EAAM,IAAIgkB,CAAK;AAChC,cAAI4P,KAAcC;AAChB,mBAAOD,KAAc5P,KAAS6P,KAAcpkD;AAE9C,cAAIpI,IAAQ,IACRzL,IAAS,IACT8oD,IAAQtE,IAAU7Z,IAA0B,IAAIiX,OAAW9X;AAM/D,eAJA1F,EAAM,IAAIvwB,GAAOu0C,CAAK,GACtBhkB,EAAM,IAAIgkB,GAAOv0C,CAAK,GAGf,EAAEpI,IAAQm0C,KAAW;AAC1B,gBAAIsY,IAAWrkD,EAAMpI,CAAK,GACtB0sD,IAAW/P,EAAM38C,CAAK;AAE1B,gBAAIg5C;AACF,kBAAI2T,IAAWL,IACXtT,EAAW0T,GAAUD,GAAUzsD,GAAO28C,GAAOv0C,GAAOuwB,CAAK,IACzDqgB,EAAWyT,GAAUC,GAAU1sD,GAAOoI,GAAOu0C,GAAOhkB,CAAK;AAE/D,gBAAIg0B,MAAatuB,GAAW;AAC1B,kBAAIsuB;AACF;AAEF,cAAAp4D,IAAS;AACT;AAAA,YACV;AAEQ,gBAAI8oD;AACF,kBAAI,CAACrS,GAAU2R,GAAO,SAAS+P,IAAUxP,IAAU;AAC7C,oBAAI,CAACrQ,GAASwQ,GAAMH,EAAQ,MACvBuP,MAAaC,MAAY5O,EAAU2O,GAAUC,IAAU3T,GAASC,GAAYrgB,CAAK;AACpF,yBAAO0kB,EAAK,KAAKH,EAAQ;AAAA,cAE3C,CAAe,GAAG;AACN,gBAAA3oD,IAAS;AACT;AAAA,cACZ;AAAA,uBACmB,EACLk4D,MAAaC,KACX5O,EAAU2O,GAAUC,GAAU3T,GAASC,GAAYrgB,CAAK,IACzD;AACL,cAAApkC,IAAS;AACT;AAAA,YACV;AAAA,UACA;AACM,iBAAAokC,EAAM,OAAUvwB,CAAK,GACrBuwB,EAAM,OAAUgkB,CAAK,GACdpoD;AAAA,QACb;AAmBI,iBAASgqD,GAAWtS,GAAQ0Q,GAAOtD,GAAKN,GAASC,GAAY8E,GAAWnlB,GAAO;AAC7E,kBAAQ0gB,GAAG;AAAA,YACT,KAAKlX;AACH,kBAAK8J,EAAO,cAAc0Q,EAAM,cAC3B1Q,EAAO,cAAc0Q,EAAM;AAC9B,uBAAO;AAET,cAAA1Q,IAASA,EAAO,QAChB0Q,IAAQA,EAAM;AAAA,YAEhB,KAAKza;AACH,qBAAK,EAAA+J,EAAO,cAAc0Q,EAAM,cAC5B,CAACmB,EAAU,IAAIxN,GAAWrE,CAAM,GAAG,IAAIqE,GAAWqM,CAAK,CAAC;AAAA,YAK9D,KAAK5b;AAAA,YACL,KAAKC;AAAA,YACL,KAAKM;AAGH,qBAAOwW,GAAG,CAAC7L,GAAQ,CAAC0Q,CAAK;AAAA,YAE3B,KAAKzb;AACH,qBAAO+K,EAAO,QAAQ0Q,EAAM,QAAQ1Q,EAAO,WAAW0Q,EAAM;AAAA,YAE9D,KAAKhb;AAAA,YACL,KAAKE;AAIH,qBAAOoK,KAAW0Q,IAAQ;AAAA,YAE5B,KAAKtb;AACH,kBAAIurB,IAAU9e;AAAA,YAEhB,KAAKlM;AACH,kBAAI0qB,IAAYvT,IAAU9Z;AAG1B,kBAFA2tB,MAAYA,IAAU1e,KAElBjC,EAAO,QAAQ0Q,EAAM,QAAQ,CAAC2P;AAChC,uBAAO;AAGT,kBAAIzS,IAAUlhB,EAAM,IAAIsT,CAAM;AAC9B,kBAAI4N;AACF,uBAAOA,KAAW8C;AAEpB,cAAA5D,KAAW7Z,GAGXvG,EAAM,IAAIsT,GAAQ0Q,CAAK;AACvB,kBAAIpoD,IAAS+pD,GAAYsO,EAAQ3gB,CAAM,GAAG2gB,EAAQjQ,CAAK,GAAG5D,GAASC,GAAY8E,GAAWnlB,CAAK;AAC/F,qBAAAA,EAAM,OAAUsT,CAAM,GACf13C;AAAA,YAET,KAAKutC;AACH,kBAAIkR;AACF,uBAAOA,GAAc,KAAK/G,CAAM,KAAK+G,GAAc,KAAK2J,CAAK;AAAA,UAEzE;AACM,iBAAO;AAAA,QACb;AAeI,iBAASiC,GAAa3S,GAAQ0Q,GAAO5D,GAASC,GAAY8E,GAAWnlB,GAAO;AAC1E,cAAI2zB,IAAYvT,IAAU9Z,GACtB4tB,IAAW1S,GAAWlO,CAAM,GAC5B6gB,IAAYD,EAAS,QACrBE,IAAW5S,GAAWwC,CAAK,GAC3BM,IAAY8P,EAAS;AAEzB,cAAID,KAAa7P,KAAa,CAACqP;AAC7B,mBAAO;AAGT,mBADItsD,IAAQ8sD,GACL9sD,OAAS;AACd,gBAAI/N,IAAM46D,EAAS7sD,CAAK;AACxB,gBAAI,EAAEssD,IAAYr6D,KAAO0qD,IAAQ/M,GAAe,KAAK+M,GAAO1qD,CAAG;AAC7D,qBAAO;AAAA,UAEjB;AAEM,cAAI+6D,IAAar0B,EAAM,IAAIsT,CAAM,GAC7BugB,IAAa7zB,EAAM,IAAIgkB,CAAK;AAChC,cAAIqQ,KAAcR;AAChB,mBAAOQ,KAAcrQ,KAAS6P,KAAcvgB;AAE9C,cAAI13C,IAAS;AACb,UAAAokC,EAAM,IAAIsT,GAAQ0Q,CAAK,GACvBhkB,EAAM,IAAIgkB,GAAO1Q,CAAM;AAGvB,mBADIghB,IAAWX,GACR,EAAEtsD,IAAQ8sD,KAAW;AAC1B,YAAA76D,IAAM46D,EAAS7sD,CAAK;AACpB,gBAAIi4C,KAAWhM,EAAOh6C,CAAG,GACrBy6D,KAAW/P,EAAM1qD,CAAG;AAExB,gBAAI+mD;AACF,kBAAI2T,KAAWL,IACXtT,EAAW0T,IAAUzU,IAAUhmD,GAAK0qD,GAAO1Q,GAAQtT,CAAK,IACxDqgB,EAAWf,IAAUyU,IAAUz6D,GAAKg6C,GAAQ0Q,GAAOhkB,CAAK;AAG9D,gBAAI,EAAEg0B,OAAatuB,IACV4Z,OAAayU,MAAY5O,EAAU7F,IAAUyU,IAAU3T,GAASC,GAAYrgB,CAAK,IAClFg0B,KACD;AACL,cAAAp4D,IAAS;AACT;AAAA,YACV;AACQ,YAAA04D,MAAaA,IAAWh7D,KAAO;AAAA,UACvC;AACM,cAAIsC,KAAU,CAAC04D,GAAU;AACvB,gBAAIC,KAAUjhB,EAAO,aACjBkhB,KAAUxQ,EAAM;AAGpB,YAAIuQ,MAAWC,MACV,iBAAiBlhB,KAAU,iBAAiB0Q,KAC7C,EAAE,OAAOuQ,MAAW,cAAcA,cAAmBA,MACnD,OAAOC,MAAW,cAAcA,cAAmBA,QACvD54D,IAAS;AAAA,UAEnB;AACM,iBAAAokC,EAAM,OAAUsT,CAAM,GACtBtT,EAAM,OAAUgkB,CAAK,GACdpoD;AAAA,QACb;AASI,iBAAS80D,GAAS5f,GAAM;AACtB,iBAAO6Y,GAAYC,GAAS9Y,GAAMpL,GAAW+uB,EAAO,GAAG3jB,IAAO,EAAE;AAAA,QACtE;AASI,iBAAS0Q,GAAWlO,GAAQ;AAC1B,iBAAOoQ,GAAepQ,GAAQ/5C,IAAMo1D,EAAU;AAAA,QACpD;AAUI,iBAASpN,GAAajO,GAAQ;AAC5B,iBAAOoQ,GAAepQ,GAAQsM,IAAQgP,EAAY;AAAA,QACxD;AASI,YAAImC,KAAWnX,KAAiB,SAAS9I,GAAM;AAC7C,iBAAO8I,GAAQ,IAAI9I,CAAI;AAAA,YADAsiB;AAWzB,iBAASvC,GAAY/f,GAAM;AAKzB,mBAJIl1C,IAAUk1C,EAAK,OAAO,IACtBrhC,IAAQoqC,GAAUj+C,CAAM,GACxBwZ,IAAS6hC,GAAe,KAAK4C,IAAWj+C,CAAM,IAAI6T,EAAM,SAAS,GAE9D2F,OAAU;AACf,gBAAI1P,IAAO+J,EAAM2F,CAAM,GACnBs/C,IAAYhvD,EAAK;AACrB,gBAAIgvD,KAAa,QAAQA,KAAa5jB;AACpC,qBAAOprC,EAAK;AAAA,UAEtB;AACM,iBAAO9J;AAAA,QACb;AASI,iBAASw0D,GAAUtf,GAAM;AACvB,cAAIwC,IAAS2D,GAAe,KAAKsD,GAAQ,aAAa,IAAIA,IAASzJ;AACnE,iBAAOwC,EAAO;AAAA,QACpB;AAaI,iBAASsV,IAAc;AACrB,cAAIhtD,IAAS2+C,EAAO,YAAYpJ;AAChC,iBAAAv1C,IAASA,MAAWu1C,KAAW2V,KAAelrD,GACvC,UAAU,SAASA,EAAO,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,IAAIA;AAAA,QACrE;AAUI,iBAASuhD,GAAW/H,GAAK97C,GAAK;AAC5B,cAAIoM,IAAO0vC,EAAI;AACf,iBAAOuf,GAAUr7D,CAAG,IAChBoM,EAAK,OAAOpM,KAAO,WAAW,WAAW,MAAM,IAC/CoM,EAAK;AAAA,QACf;AASI,iBAAS+hD,GAAanU,GAAQ;AAI5B,mBAHI13C,IAASrC,GAAK+5C,CAAM,GACpBl+B,IAASxZ,EAAO,QAEbwZ,OAAU;AACf,gBAAI9b,IAAMsC,EAAOwZ,CAAM,GACnBzW,IAAQ20C,EAAOh6C,CAAG;AAEtB,YAAAsC,EAAOwZ,CAAM,IAAI,CAAC9b,GAAKqF,GAAOipD,GAAmBjpD,CAAK,CAAC;AAAA,UAC/D;AACM,iBAAO/C;AAAA,QACb;AAUI,iBAASy8C,GAAU/E,GAAQh6C,GAAK;AAC9B,cAAIqF,IAAQm2C,GAASxB,GAAQh6C,CAAG;AAChC,iBAAOitD,GAAa5nD,CAAK,IAAIA,IAAQ+mC;AAAAA,QAC3C;AASI,iBAASme,GAAUllD,GAAO;AACxB,cAAIi2D,IAAQ3d,GAAe,KAAKt4C,GAAOw5C,EAAc,GACjDuI,IAAM/hD,EAAMw5C,EAAc;AAE9B,cAAI;AACF,YAAAx5C,EAAMw5C,EAAc,IAAIzS;AACxB,gBAAImvB,IAAW;AAAA,kBACL;AAAA,UAAA;AAEZ,cAAIj5D,IAASy7C,GAAqB,KAAK14C,CAAK;AAC5C,iBAAIk2D,MACED,IACFj2D,EAAMw5C,EAAc,IAAIuI,IAExB,OAAO/hD,EAAMw5C,EAAc,IAGxBv8C;AAAA,QACb;AASI,YAAI+yD,KAAchW,KAA+B,SAASrF,GAAQ;AAChE,iBAAIA,KAAU,OACL,CAAA,KAETA,IAASkD,GAAOlD,CAAM,GACf7B,GAAYkH,GAAiBrF,CAAM,GAAG,SAAS6Z,GAAQ;AAC5D,mBAAOpV,GAAqB,KAAKzE,GAAQ6Z,CAAM;AAAA,UACvD,CAAO;AAAA,YAPkC2H,IAiBjClG,KAAgBjW,KAA+B,SAASrF,GAAQ;AAElE,mBADI13C,IAAS,CAAA,GACN03C;AACL,YAAAtB,GAAUp2C,GAAQ+yD,GAAWrb,CAAM,CAAC,GACpCA,IAASuE,GAAavE,CAAM;AAE9B,iBAAO13C;AAAA,YAN8Bk5D,IAgBnCnU,KAASiD;AAGb,SAAKtK,MAAYqH,GAAO,IAAIrH,GAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK9P,MACxD+P,MAAOoH,GAAO,IAAIpH,IAAG,KAAK7Q,MAC1B8Q,MAAWmH,GAAOnH,GAAQ,QAAO,CAAE,KAAK1Q,MACxC2Q,MAAOkH,GAAO,IAAIlH,IAAG,KAAKxQ,MAC1ByQ,MAAWiH,GAAO,IAAIjH,IAAO,KAAKrQ,QACrCsX,KAAS,SAAShiD,GAAO;AACvB,cAAI/C,IAASgoD,GAAWjlD,CAAK,GACzB4wD,IAAO3zD,KAAUitC,KAAYlqC,EAAM,cAAc+mC,GACjDqvB,IAAaxF,IAAOxV,GAASwV,CAAI,IAAI;AAEzC,cAAIwF;AACF,oBAAQA,GAAU;AAAA,cAChB,KAAKjb;AAAoB,uBAAOtQ;AAAA,cAChC,KAAKwQ;AAAe,uBAAOtR;AAAA,cAC3B,KAAKuR;AAAmB,uBAAOnR;AAAA,cAC/B,KAAKoR;AAAe,uBAAOjR;AAAA,cAC3B,KAAKkR;AAAmB,uBAAO9Q;AAAA,YAC3C;AAEQ,iBAAOztC;AAAA;AAcX,iBAAS6/C,GAAQt3C,GAAO6D,GAAKgtD,GAAY;AAIvC,mBAHI3tD,IAAQ,IACR+N,IAAS4/C,EAAW,QAEjB,EAAE3tD,IAAQ+N,KAAQ;AACvB,gBAAI1P,IAAOsvD,EAAW3tD,CAAK,GACvBk2C,IAAO73C,EAAK;AAEhB,oBAAQA,EAAK,MAAI;AAAA,cACf,KAAK;AAAa,gBAAAvB,KAASo5C;AAAM;AAAA,cACjC,KAAK;AAAa,gBAAAv1C,KAAOu1C;AAAM;AAAA,cAC/B,KAAK;AAAa,gBAAAv1C,IAAMixC,GAAUjxC,GAAK7D,IAAQo5C,CAAI;AAAG;AAAA,cACtD,KAAK;AAAa,gBAAAp5C,IAAQ60C,GAAU70C,GAAO6D,IAAMu1C,CAAI;AAAG;AAAA,YAClE;AAAA,UACA;AACM,iBAAO,EAAE,OAASp5C,GAAO,KAAO6D,EAAG;AAAA,QACzC;AASI,iBAASitD,GAAenzD,GAAQ;AAC9B,cAAI1I,IAAQ0I,EAAO,MAAMspC,EAAa;AACtC,iBAAOhyC,IAAQA,EAAM,CAAC,EAAE,MAAMiyC,EAAc,IAAI,CAAA;AAAA,QACtD;AAWI,iBAAS6pB,GAAQ5hB,GAAQ/V,GAAM43B,GAAS;AACtC,UAAA53B,IAAOimB,GAASjmB,GAAM+V,CAAM;AAM5B,mBAJIjsC,IAAQ,IACR+N,IAASmoB,EAAK,QACd3hC,IAAS,IAEN,EAAEyL,IAAQ+N,KAAQ;AACvB,gBAAI9b,IAAMmqD,GAAMlmB,EAAKl2B,CAAK,CAAC;AAC3B,gBAAI,EAAEzL,IAAS03C,KAAU,QAAQ6hB,EAAQ7hB,GAAQh6C,CAAG;AAClD;AAEF,YAAAg6C,IAASA,EAAOh6C,CAAG;AAAA,UAC3B;AACM,iBAAIsC,KAAU,EAAEyL,KAAS+N,IAChBxZ,KAETwZ,IAASk+B,KAAU,OAAO,IAAIA,EAAO,QAC9B,CAAC,CAACl+B,KAAUyxC,GAASzxC,CAAM,KAAKupC,GAAQrlD,GAAK8b,CAAM,MACvDqlC,EAAQnH,CAAM,KAAK+K,GAAY/K,CAAM;AAAA,QAC9C;AASI,iBAASmN,GAAehxC,GAAO;AAC7B,cAAI2F,IAAS3F,EAAM,QACf7T,IAAS,IAAI6T,EAAM,YAAY2F,CAAM;AAGzC,iBAAIA,KAAU,OAAO3F,EAAM,CAAC,KAAK,YAAYwnC,GAAe,KAAKxnC,GAAO,OAAO,MAC7E7T,EAAO,QAAQ6T,EAAM,OACrB7T,EAAO,QAAQ6T,EAAM,QAEhB7T;AAAA,QACb;AASI,iBAASklD,GAAgBxN,GAAQ;AAC/B,iBAAQ,OAAOA,EAAO,eAAe,cAAc,CAAC4T,GAAY5T,CAAM,IAClEuH,GAAWhD,GAAavE,CAAM,CAAC,IAC/B,CAAA;AAAA,QACV;AAcI,iBAAS2N,GAAe3N,GAAQoN,GAAKJ,GAAQ;AAC3C,cAAIiP,IAAOjc,EAAO;AAClB,kBAAQoN,GAAG;AAAA,YACT,KAAKnX;AACH,qBAAOqjB,GAAiBtZ,CAAM;AAAA,YAEhC,KAAKlL;AAAA,YACL,KAAKC;AACH,qBAAO,IAAIknB,EAAK,CAACjc,CAAM;AAAA,YAEzB,KAAK9J;AACH,qBAAOsjB,GAAcxZ,GAAQgN,CAAM;AAAA,YAErC,KAAK7W;AAAA,YAAY,KAAKC;AAAA,YACtB,KAAKC;AAAA,YAAS,KAAKC;AAAA,YAAU,KAAKC;AAAA,YAClC,KAAKC;AAAA,YAAU,KAAKC;AAAA,YAAiB,KAAKC;AAAA,YAAW,KAAKC;AACxD,qBAAOqe,GAAgBhV,GAAQgN,CAAM;AAAA,YAEvC,KAAK5X;AACH,qBAAO,IAAI6mB;AAAA,YAEb,KAAK5mB;AAAA,YACL,KAAKO;AACH,qBAAO,IAAIqmB,EAAKjc,CAAM;AAAA,YAExB,KAAKtK;AACH,qBAAOgkB,GAAY1Z,CAAM;AAAA,YAE3B,KAAKrK;AACH,qBAAO,IAAIsmB;AAAA,YAEb,KAAKpmB;AACH,qBAAO+jB,GAAY5Z,CAAM;AAAA,UACnC;AAAA,QACA;AAUI,iBAAS8hB,GAAkBtzD,GAAQuzD,GAAS;AAC1C,cAAIjgD,IAASigD,EAAQ;AACrB,cAAI,CAACjgD;AACH,mBAAOtT;AAET,cAAI86C,IAAYxnC,IAAS;AACzB,iBAAAigD,EAAQzY,CAAS,KAAKxnC,IAAS,IAAI,OAAO,MAAMigD,EAAQzY,CAAS,GACjEyY,IAAUA,EAAQ,KAAKjgD,IAAS,IAAI,OAAO,GAAG,GACvCtT,EAAO,QAAQqpC,IAAe;AAAA,qBAAyBkqB,IAAU;AAAA,CAAQ;AAAA,QACtF;AASI,iBAASpS,GAActkD,GAAO;AAC5B,iBAAO87C,EAAQ97C,CAAK,KAAK0/C,GAAY1/C,CAAK,KACxC,CAAC,EAAEs5C,MAAoBt5C,KAASA,EAAMs5C,EAAgB;AAAA,QAC9D;AAUI,iBAAS0G,GAAQhgD,GAAOyW,GAAQ;AAC9B,cAAIpa,IAAO,OAAO2D;AAClB,iBAAAyW,IAASA,KAAiBsyB,IAEnB,CAAC,CAACtyB,MACNpa,KAAQ,YACNA,KAAQ,YAAY+wC,GAAS,KAAKptC,CAAK,MACrCA,IAAQ,MAAMA,IAAQ,KAAK,KAAKA,IAAQyW;AAAA,QACrD;AAYI,iBAAS+5C,GAAexwD,GAAO0I,GAAOisC,GAAQ;AAC5C,cAAI,CAAC5hB,GAAS4hB,CAAM;AAClB,mBAAO;AAET,cAAIt4C,IAAO,OAAOqM;AAClB,kBAAIrM,KAAQ,WACHwsD,GAAYlU,CAAM,KAAKqL,GAAQt3C,GAAOisC,EAAO,MAAM,IACnDt4C,KAAQ,YAAYqM,KAASisC,KAE7B6L,GAAG7L,EAAOjsC,CAAK,GAAG1I,CAAK,IAEzB;AAAA,QACb;AAUI,iBAASgpD,GAAMhpD,GAAO20C,GAAQ;AAC5B,cAAImH,EAAQ97C,CAAK;AACf,mBAAO;AAET,cAAI3D,IAAO,OAAO2D;AAClB,iBAAI3D,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,aAChD2D,KAAS,QAAQ8jD,GAAS9jD,CAAK,IAC1B,KAEFksC,GAAc,KAAKlsC,CAAK,KAAK,CAACisC,GAAa,KAAKjsC,CAAK,KACzD20C,KAAU,QAAQ30C,KAAS63C,GAAOlD,CAAM;AAAA,QACjD;AASI,iBAASqhB,GAAUh2D,GAAO;AACxB,cAAI3D,IAAO,OAAO2D;AAClB,iBAAQ3D,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,YACvE2D,MAAU,cACVA,MAAU;AAAA,QACrB;AAUI,iBAASqyD,GAAWlgB,GAAM;AACxB,cAAIggB,IAAWD,GAAY/f,CAAI,GAC3BkT,IAAQzJ,EAAOuW,CAAQ;AAE3B,cAAI,OAAO9M,KAAS,cAAc,EAAE8M,KAAYpW,GAAY;AAC1D,mBAAO;AAET,cAAI5J,MAASkT;AACX,mBAAO;AAET,cAAIt+C,IAAOqrD,GAAQ/M,CAAK;AACxB,iBAAO,CAAC,CAACt+C,KAAQorC,MAASprC,EAAK,CAAC;AAAA,QACtC;AASI,iBAAS8gD,GAAS1V,GAAM;AACtB,iBAAO,CAAC,CAACqG,MAAeA,MAAcrG;AAAA,QAC5C;AASI,YAAIwkB,KAAave,KAAauM,KAAaiS;AAS3C,iBAASrO,GAAYvoD,GAAO;AAC1B,cAAI4wD,IAAO5wD,KAASA,EAAM,aACtBm8C,IAAS,OAAOyU,KAAQ,cAAcA,EAAK,aAAczY;AAE7D,iBAAOn4C,MAAUm8C;AAAA,QACvB;AAUI,iBAAS8M,GAAmBjpD,GAAO;AACjC,iBAAOA,MAAUA,KAAS,CAAC+yB,GAAS/yB,CAAK;AAAA,QAC/C;AAWI,iBAAS+oD,GAAwBpuD,GAAKgtD,GAAU;AAC9C,iBAAO,SAAShT,GAAQ;AACtB,mBAAIA,KAAU,OACL,KAEFA,EAAOh6C,CAAG,MAAMgtD,MACpBA,MAAa5gB,KAAcpsC,KAAOk9C,GAAOlD,CAAM;AAAA;QAE1D;AAUI,iBAASkiB,GAAc1kB,GAAM;AAC3B,cAAIl1C,IAAS65D,GAAQ3kB,GAAM,SAASx3C,GAAK;AACvC,mBAAI66C,EAAM,SAASlO,KACjBkO,EAAM,MAAK,GAEN76C;AAAA,UACf,CAAO,GAEG66C,IAAQv4C,EAAO;AACnB,iBAAOA;AAAA,QACb;AAkBI,iBAAS23D,GAAU7tD,GAAM5D,GAAQ;AAC/B,cAAIs+C,IAAU16C,EAAK,CAAC,GAChBgwD,IAAa5zD,EAAO,CAAC,GACrB6zD,IAAavV,IAAUsV,GACvB1T,IAAW2T,KAAcnvB,IAAiBC,IAAqBM,IAE/D6uB,IACAF,KAAc3uB,KAAmBqZ,KAAWzZ,KAC5C+uB,KAAc3uB,KAAmBqZ,KAAWpZ,KAAqBthC,EAAK,CAAC,EAAE,UAAU5D,EAAO,CAAC,KAC3F4zD,MAAe3uB,IAAgBC,MAAsBllC,EAAO,CAAC,EAAE,UAAUA,EAAO,CAAC,KAAOs+C,KAAWzZ;AAGvG,cAAI,EAAEqb,KAAY4T;AAChB,mBAAOlwD;AAGT,UAAIgwD,IAAalvB,MACf9gC,EAAK,CAAC,IAAI5D,EAAO,CAAC,GAElB6zD,KAAcvV,IAAU5Z,IAAiB,IAAIE;AAG/C,cAAI/nC,IAAQmD,EAAO,CAAC;AACpB,cAAInD,GAAO;AACT,gBAAIivD,IAAWloD,EAAK,CAAC;AACrB,YAAAA,EAAK,CAAC,IAAIkoD,IAAWD,GAAYC,GAAUjvD,GAAOmD,EAAO,CAAC,CAAC,IAAInD,GAC/D+G,EAAK,CAAC,IAAIkoD,IAAWtY,GAAe5vC,EAAK,CAAC,GAAGwgC,CAAW,IAAIpkC,EAAO,CAAC;AAAA,UAC5E;AAEM,iBAAAnD,IAAQmD,EAAO,CAAC,GACZnD,MACFivD,IAAWloD,EAAK,CAAC,GACjBA,EAAK,CAAC,IAAIkoD,IAAWU,GAAiBV,GAAUjvD,GAAOmD,EAAO,CAAC,CAAC,IAAInD,GACpE+G,EAAK,CAAC,IAAIkoD,IAAWtY,GAAe5vC,EAAK,CAAC,GAAGwgC,CAAW,IAAIpkC,EAAO,CAAC,IAGtEnD,IAAQmD,EAAO,CAAC,GACZnD,MACF+G,EAAK,CAAC,IAAI/G,IAGR+2D,IAAa3uB,MACfrhC,EAAK,CAAC,IAAIA,EAAK,CAAC,KAAK,OAAO5D,EAAO,CAAC,IAAIm3C,GAAUvzC,EAAK,CAAC,GAAG5D,EAAO,CAAC,CAAC,IAGlE4D,EAAK,CAAC,KAAK,SACbA,EAAK,CAAC,IAAI5D,EAAO,CAAC,IAGpB4D,EAAK,CAAC,IAAI5D,EAAO,CAAC,GAClB4D,EAAK,CAAC,IAAIiwD,GAEHjwD;AAAA,QACb;AAWI,iBAAS0hD,GAAa9T,GAAQ;AAC5B,cAAI13C,IAAS,CAAA;AACb,cAAI03C,KAAU;AACZ,qBAASh6C,KAAOk9C,GAAOlD,CAAM;AAC3B,cAAA13C,EAAO,KAAKtC,CAAG;AAGnB,iBAAOsC;AAAA,QACb;AASI,iBAASkoD,GAAenlD,GAAO;AAC7B,iBAAO04C,GAAqB,KAAK14C,CAAK;AAAA,QAC5C;AAWI,iBAASirD,GAAS9Y,GAAM3sC,GAAO2L,GAAW;AACxC,iBAAA3L,IAAQ60C,GAAU70C,MAAUuhC,IAAaoL,EAAK,SAAS,IAAK3sC,GAAO,CAAC,GAC7D,WAAW;AAMhB,qBALI6sC,IAAO,WACP3pC,IAAQ,IACR+N,IAAS4jC,GAAUhI,EAAK,SAAS7sC,GAAO,CAAC,GACzCsL,IAAQ0mC,EAAM/gC,CAAM,GAEjB,EAAE/N,IAAQ+N;AACf,cAAA3F,EAAMpI,CAAK,IAAI2pC,EAAK7sC,IAAQkD,CAAK;AAEnC,YAAAA,IAAQ;AAER,qBADIwuD,IAAY1f,EAAMhyC,IAAQ,CAAC,GACxB,EAAEkD,IAAQlD;AACf,cAAA0xD,EAAUxuD,CAAK,IAAI2pC,EAAK3pC,CAAK;AAE/B,mBAAAwuD,EAAU1xD,CAAK,IAAI2L,EAAUL,CAAK,GAC3BohC,GAAMC,GAAM,MAAM+kB,CAAS;AAAA;QAE1C;AAUI,iBAAS18B,GAAOma,GAAQ/V,GAAM;AAC5B,iBAAOA,EAAK,SAAS,IAAI+V,IAASiQ,GAAQjQ,GAAQ8W,GAAU7sB,GAAM,GAAG,EAAE,CAAC;AAAA,QAC9E;AAYI,iBAASm0B,GAAQjiD,GAAO+tB,GAAS;AAK/B,mBAJIge,IAAY/rC,EAAM,QAClB2F,IAAS6jC,GAAUzb,EAAQ,QAAQge,CAAS,GAC5Csa,IAAW5a,GAAUzrC,CAAK,GAEvB2F,OAAU;AACf,gBAAI/N,IAAQm2B,EAAQpoB,CAAM;AAC1B,YAAA3F,EAAM2F,CAAM,IAAIupC,GAAQt3C,GAAOm0C,CAAS,IAAIsa,EAASzuD,CAAK,IAAIq+B;AAAAA,UACtE;AACM,iBAAOj2B;AAAA,QACb;AAUI,iBAASy4C,GAAQ5U,GAAQh6C,GAAK;AAC5B,cAAI,EAAAA,MAAQ,iBAAiB,OAAOg6C,EAAOh6C,CAAG,KAAM,eAIhDA,KAAO;AAIX,mBAAOg6C,EAAOh6C,CAAG;AAAA,QACvB;AAgBI,YAAI05D,KAAU+C,GAAS/L,EAAW,GAU9BnI,KAAarJ,MAAiB,SAAS1H,GAAM8Q,GAAM;AACrD,iBAAOzkD,GAAK,WAAW2zC,GAAM8Q,CAAI;AAAA,WAW/B+H,KAAcoM,GAAS9L,EAAe;AAY1C,iBAASgJ,GAAgBxD,GAASuG,GAAW5V,GAAS;AACpD,cAAIt+C,IAAUk0D,IAAY;AAC1B,iBAAOrM,GAAY8F,GAAS2F,GAAkBtzD,GAAQm0D,GAAkBhB,GAAenzD,CAAM,GAAGs+C,CAAO,CAAC,CAAC;AAAA,QAC/G;AAWI,iBAAS2V,GAASjlB,GAAM;AACtB,cAAIolB,IAAQ,GACRC,IAAa;AAEjB,iBAAO,WAAW;AAChB,gBAAIC,IAAQld,GAAS,GACjBmd,IAAYhvB,MAAY+uB,IAAQD;AAGpC,gBADAA,IAAaC,GACTC,IAAY;AACd,kBAAI,EAAEH,KAAS9uB;AACb,uBAAO,UAAU,CAAC;AAAA;AAGpB,cAAA8uB,IAAQ;AAEV,mBAAOplB,EAAK,MAAMpL,GAAW,SAAS;AAAA;QAE9C;AAUI,iBAASqZ,GAAYtvC,GAAO8tC,GAAM;AAChC,cAAIl2C,IAAQ,IACR+N,IAAS3F,EAAM,QACfmtC,IAAYxnC,IAAS;AAGzB,eADAmoC,IAAOA,MAAS7X,IAAYtwB,IAASmoC,GAC9B,EAAEl2C,IAAQk2C,KAAM;AACrB,gBAAI+Y,IAAOzX,GAAWx3C,GAAOu1C,CAAS,GAClCj+C,IAAQ8Q,EAAM6mD,CAAI;AAEtB,YAAA7mD,EAAM6mD,CAAI,IAAI7mD,EAAMpI,CAAK,GACzBoI,EAAMpI,CAAK,IAAI1I;AAAA,UACvB;AACM,iBAAA8Q,EAAM,SAAS8tC,GACR9tC;AAAA,QACb;AASI,YAAI68C,KAAekJ,GAAc,SAAS/iB,GAAQ;AAChD,cAAI72C,IAAS,CAAA;AACb,iBAAI62C,EAAO,WAAW,CAAC,MAAM,MAC3B72C,EAAO,KAAK,EAAE,GAEhB62C,EAAO,QAAQ3H,IAAY,SAAS1xC,GAAO4mD,GAAQuW,GAAOC,GAAW;AACnE,YAAA56D,EAAO,KAAK26D,IAAQC,EAAU,QAAQhrB,IAAc,IAAI,IAAKwU,KAAU5mD,CAAM;AAAA,UACrF,CAAO,GACMwC;AAAA,QACb,CAAK;AASD,iBAAS6nD,GAAM9kD,GAAO;AACpB,cAAI,OAAOA,KAAS,YAAY8jD,GAAS9jD,CAAK;AAC5C,mBAAOA;AAET,cAAI/C,IAAU+C,IAAQ;AACtB,iBAAQ/C,KAAU,OAAQ,IAAI+C,KAAU,CAAC8oC,KAAY,OAAO7rC;AAAA,QAClE;AASI,iBAASm+C,GAASjJ,GAAM;AACtB,cAAIA,KAAQ,MAAM;AAChB,gBAAI;AACF,qBAAOkG,GAAa,KAAKlG,CAAI;AAAA,oBACnB;AAAA,YAAA;AACZ,gBAAI;AACF,qBAAQA,IAAO;AAAA,oBACL;AAAA,YAAA;AAAA,UACpB;AACM,iBAAO;AAAA,QACb;AAUI,iBAASmlB,GAAkBZ,GAASjV,GAAS;AAC3C,iBAAA/O,GAAUrJ,IAAW,SAASmrB,GAAM;AAClC,gBAAIx0D,IAAQ,OAAOw0D,EAAK,CAAC;AACzB,YAAK/S,IAAU+S,EAAK,CAAC,KAAM,CAACxhB,GAAc0jB,GAAS12D,CAAK,KACtD02D,EAAQ,KAAK12D,CAAK;AAAA,UAE5B,CAAO,GACM02D,EAAQ,KAAI;AAAA,QACzB;AASI,iBAASza,GAAa6U,GAAS;AAC7B,cAAIA,aAAmB/U;AACrB,mBAAO+U,EAAQ,MAAK;AAEtB,cAAI7zD,IAAS,IAAI++C,GAAc8U,EAAQ,aAAaA,EAAQ,SAAS;AACrE,iBAAA7zD,EAAO,cAAcs/C,GAAUuU,EAAQ,WAAW,GAClD7zD,EAAO,YAAa6zD,EAAQ,WAC5B7zD,EAAO,aAAa6zD,EAAQ,YACrB7zD;AAAA,QACb;AAyBI,iBAAS66D,GAAMhnD,GAAO8tC,GAAM2R,GAAO;AACjC,WAAKA,IAAQC,GAAe1/C,GAAO8tC,GAAM2R,CAAK,IAAI3R,MAAS7X,KACzD6X,IAAO,IAEPA,IAAOvE,GAAU2J,EAAUpF,CAAI,GAAG,CAAC;AAErC,cAAInoC,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,cAAI,CAAC2F,KAAUmoC,IAAO;AACpB,mBAAO,CAAA;AAMT,mBAJIl2C,IAAQ,GACRqqC,IAAW,GACX91C,IAASu6C,EAAMsC,GAAWrjC,IAASmoC,CAAI,CAAC,GAErCl2C,IAAQ+N;AACb,YAAAxZ,EAAO81C,GAAU,IAAI0Y,GAAU36C,GAAOpI,GAAQA,KAASk2C,CAAI;AAE7D,iBAAO3hD;AAAA,QACb;AAiBI,iBAAS86D,GAAQjnD,GAAO;AAMtB,mBALIpI,IAAQ,IACR+N,IAAS3F,KAAS,OAAO,IAAIA,EAAM,QACnCiiC,IAAW,GACX91C,IAAS,CAAA,GAEN,EAAEyL,IAAQ+N,KAAQ;AACvB,gBAAIzW,IAAQ8Q,EAAMpI,CAAK;AACvB,YAAI1I,MACF/C,EAAO81C,GAAU,IAAI/yC;AAAA,UAE/B;AACM,iBAAO/C;AAAA,QACb;AAwBI,iBAAS+6D,KAAS;AAChB,cAAIvhD,IAAS,UAAU;AACvB,cAAI,CAACA;AACH,mBAAO,CAAA;AAMT,mBAJI47B,IAAOmF,EAAM/gC,IAAS,CAAC,GACvB3F,IAAQ,UAAU,CAAC,GACnBpI,IAAQ+N,GAEL/N;AACL,YAAA2pC,EAAK3pC,IAAQ,CAAC,IAAI,UAAUA,CAAK;AAEnC,iBAAO2qC,GAAUyI,EAAQhrC,CAAK,IAAIyrC,GAAUzrC,CAAK,IAAI,CAACA,CAAK,GAAGqzC,GAAY9R,GAAM,CAAC,CAAC;AAAA,QACxF;AAuBI,YAAI4lB,KAAalN,GAAS,SAASj6C,GAAOwiC,GAAQ;AAChD,iBAAOoW,GAAkB54C,CAAK,IAC1BqyC,GAAeryC,GAAOqzC,GAAY7Q,GAAQ,GAAGoW,IAAmB,EAAI,CAAC,IACrE,CAAA;AAAA,QACV,CAAK,GA4BGwO,KAAenN,GAAS,SAASj6C,GAAOwiC,GAAQ;AAClD,cAAId,IAAW0T,GAAK5S,CAAM;AAC1B,iBAAIoW,GAAkBlX,CAAQ,MAC5BA,IAAWzL,IAEN2iB,GAAkB54C,CAAK,IAC1BqyC,GAAeryC,GAAOqzC,GAAY7Q,GAAQ,GAAGoW,IAAmB,EAAI,GAAGO,EAAYzX,GAAU,CAAC,CAAC,IAC/F,CAAA;AAAA,QACV,CAAK,GAyBG2lB,KAAiBpN,GAAS,SAASj6C,GAAOwiC,GAAQ;AACpD,cAAIH,IAAa+S,GAAK5S,CAAM;AAC5B,iBAAIoW,GAAkBvW,CAAU,MAC9BA,IAAapM,IAER2iB,GAAkB54C,CAAK,IAC1BqyC,GAAeryC,GAAOqzC,GAAY7Q,GAAQ,GAAGoW,IAAmB,EAAI,GAAG3iB,GAAWoM,CAAU,IAC5F,CAAA;AAAA,QACV,CAAK;AA2BD,iBAASilB,GAAKtnD,GAAOzL,GAAGkrD,GAAO;AAC7B,cAAI95C,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,iBAAK2F,KAGLpR,IAAKkrD,KAASlrD,MAAM0hC,IAAa,IAAIid,EAAU3+C,CAAC,GACzComD,GAAU36C,GAAOzL,IAAI,IAAI,IAAIA,GAAGoR,CAAM,KAHpC,CAAA;AAAA,QAIf;AA2BI,iBAAS4hD,GAAUvnD,GAAOzL,GAAGkrD,GAAO;AAClC,cAAI95C,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,iBAAK2F,KAGLpR,IAAKkrD,KAASlrD,MAAM0hC,IAAa,IAAIid,EAAU3+C,CAAC,GAChDA,IAAIoR,IAASpR,GACNomD,GAAU36C,GAAO,GAAGzL,IAAI,IAAI,IAAIA,CAAC,KAJ/B,CAAA;AAAA,QAKf;AAqCI,iBAASizD,GAAexnD,GAAO+hC,GAAW;AACxC,iBAAQ/hC,KAASA,EAAM,SACnBm8C,GAAUn8C,GAAOm5C,EAAYpX,GAAW,CAAC,GAAG,IAAM,EAAI,IACtD,CAAA;AAAA,QACV;AAqCI,iBAAS0lB,GAAUznD,GAAO+hC,GAAW;AACnC,iBAAQ/hC,KAASA,EAAM,SACnBm8C,GAAUn8C,GAAOm5C,EAAYpX,GAAW,CAAC,GAAG,EAAI,IAChD,CAAA;AAAA,QACV;AA+BI,iBAAS2lB,GAAK1nD,GAAO9Q,GAAOwF,GAAO6D,GAAK;AACtC,cAAIoN,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,iBAAK2F,KAGDjR,KAAS,OAAOA,KAAS,YAAYgrD,GAAe1/C,GAAO9Q,GAAOwF,CAAK,MACzEA,IAAQ,GACR6D,IAAMoN,IAEDstC,GAASjzC,GAAO9Q,GAAOwF,GAAO6D,CAAG,KAN/B,CAAA;AAAA,QAOf;AAqCI,iBAASovD,GAAU3nD,GAAO+hC,GAAWuB,GAAW;AAC9C,cAAI39B,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,cAAI,CAAC2F;AACH,mBAAO;AAET,cAAI/N,IAAQ0rC,KAAa,OAAO,IAAI4P,EAAU5P,CAAS;AACvD,iBAAI1rC,IAAQ,MACVA,IAAQ2xC,GAAU5jC,IAAS/N,GAAO,CAAC,IAE9ByrC,GAAcrjC,GAAOm5C,EAAYpX,GAAW,CAAC,GAAGnqC,CAAK;AAAA,QAClE;AAqCI,iBAASgwD,GAAc5nD,GAAO+hC,GAAWuB,GAAW;AAClD,cAAI39B,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,cAAI,CAAC2F;AACH,mBAAO;AAET,cAAI/N,IAAQ+N,IAAS;AACrB,iBAAI29B,MAAcrN,MAChBr+B,IAAQs7C,EAAU5P,CAAS,GAC3B1rC,IAAQ0rC,IAAY,IAChBiG,GAAU5jC,IAAS/N,GAAO,CAAC,IAC3B4xC,GAAU5xC,GAAO+N,IAAS,CAAC,IAE1B09B,GAAcrjC,GAAOm5C,EAAYpX,GAAW,CAAC,GAAGnqC,GAAO,EAAI;AAAA,QACxE;AAgBI,iBAASotD,GAAQhlD,GAAO;AACtB,cAAI2F,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,iBAAO2F,IAAS0tC,GAAYrzC,GAAO,CAAC,IAAI,CAAA;AAAA,QAC9C;AAgBI,iBAAS6nD,GAAY7nD,GAAO;AAC1B,cAAI2F,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,iBAAO2F,IAAS0tC,GAAYrzC,GAAOg4B,EAAQ,IAAI,CAAA;AAAA,QACrD;AAsBI,iBAAS8vB,GAAa9nD,GAAOszC,GAAO;AAClC,cAAI3tC,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,iBAAK2F,KAGL2tC,IAAQA,MAAUrd,IAAY,IAAIid,EAAUI,CAAK,GAC1CD,GAAYrzC,GAAOszC,CAAK,KAHtB,CAAA;AAAA,QAIf;AAiBI,iBAASyU,GAAUvZ,GAAO;AAKxB,mBAJI52C,IAAQ,IACR+N,IAAS6oC,KAAS,OAAO,IAAIA,EAAM,QACnCriD,IAAS,CAAA,GAEN,EAAEyL,IAAQ+N,KAAQ;AACvB,gBAAI+9C,IAAOlV,EAAM52C,CAAK;AACtB,YAAAzL,EAAOu3D,EAAK,CAAC,CAAC,IAAIA,EAAK,CAAC;AAAA,UAChC;AACM,iBAAOv3D;AAAA,QACb;AAoBI,iBAAS67D,GAAKhoD,GAAO;AACnB,iBAAQA,KAASA,EAAM,SAAUA,EAAM,CAAC,IAAIi2B;AAAAA,QAClD;AAyBI,iBAAS0jB,GAAQ35C,GAAO9Q,GAAOo0C,GAAW;AACxC,cAAI39B,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,cAAI,CAAC2F;AACH,mBAAO;AAET,cAAI/N,IAAQ0rC,KAAa,OAAO,IAAI4P,EAAU5P,CAAS;AACvD,iBAAI1rC,IAAQ,MACVA,IAAQ2xC,GAAU5jC,IAAS/N,GAAO,CAAC,IAE9BuqC,GAAYniC,GAAO9Q,GAAO0I,CAAK;AAAA,QAC5C;AAgBI,iBAASqwD,GAAQjoD,GAAO;AACtB,cAAI2F,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,iBAAO2F,IAASg1C,GAAU36C,GAAO,GAAG,EAAE,IAAI,CAAA;AAAA,QAChD;AAmBI,YAAImsB,KAAe8tB,GAAS,SAASrF,GAAQ;AAC3C,cAAIsT,IAAS5lB,GAASsS,GAAQ+H,EAAmB;AACjD,iBAAQuL,EAAO,UAAUA,EAAO,CAAC,MAAMtT,EAAO,CAAC,IAC3CD,GAAiBuT,CAAM,IACvB,CAAA;AAAA,QACV,CAAK,GAyBGC,KAAiBlO,GAAS,SAASrF,GAAQ;AAC7C,cAAIlT,IAAW0T,GAAKR,CAAM,GACtBsT,IAAS5lB,GAASsS,GAAQ+H,EAAmB;AAEjD,iBAAIjb,MAAa0T,GAAK8S,CAAM,IAC1BxmB,IAAWzL,IAEXiyB,EAAO,IAAG,GAEJA,EAAO,UAAUA,EAAO,CAAC,MAAMtT,EAAO,CAAC,IAC3CD,GAAiBuT,GAAQ/O,EAAYzX,GAAU,CAAC,CAAC,IACjD,CAAA;AAAA,QACV,CAAK,GAuBG0mB,KAAmBnO,GAAS,SAASrF,GAAQ;AAC/C,cAAIvS,IAAa+S,GAAKR,CAAM,GACxBsT,IAAS5lB,GAASsS,GAAQ+H,EAAmB;AAEjD,iBAAAta,IAAa,OAAOA,KAAc,aAAaA,IAAapM,GACxDoM,KACF6lB,EAAO,IAAG,GAEJA,EAAO,UAAUA,EAAO,CAAC,MAAMtT,EAAO,CAAC,IAC3CD,GAAiBuT,GAAQjyB,GAAWoM,CAAU,IAC9C,CAAA;AAAA,QACV,CAAK;AAiBD,iBAASgmB,GAAKroD,GAAOsoD,GAAW;AAC9B,iBAAOtoD,KAAS,OAAO,KAAKqpC,GAAW,KAAKrpC,GAAOsoD,CAAS;AAAA,QAClE;AAgBI,iBAASlT,GAAKp1C,GAAO;AACnB,cAAI2F,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,iBAAO2F,IAAS3F,EAAM2F,IAAS,CAAC,IAAIswB;AAAAA,QAC1C;AAuBI,iBAASsyB,GAAYvoD,GAAO9Q,GAAOo0C,GAAW;AAC5C,cAAI39B,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,cAAI,CAAC2F;AACH,mBAAO;AAET,cAAI/N,IAAQ+N;AACZ,iBAAI29B,MAAcrN,MAChBr+B,IAAQs7C,EAAU5P,CAAS,GAC3B1rC,IAAQA,IAAQ,IAAI2xC,GAAU5jC,IAAS/N,GAAO,CAAC,IAAI4xC,GAAU5xC,GAAO+N,IAAS,CAAC,IAEzEzW,MAAUA,IACb82C,GAAkBhmC,GAAO9Q,GAAO0I,CAAK,IACrCyrC,GAAcrjC,GAAOyjC,IAAW7rC,GAAO,EAAI;AAAA,QACrD;AAuBI,iBAAS4wD,GAAIxoD,GAAOzL,GAAG;AACrB,iBAAQyL,KAASA,EAAM,SAAUg5C,GAAQh5C,GAAOkzC,EAAU3+C,CAAC,CAAC,IAAI0hC;AAAAA,QACtE;AAyBI,YAAIwyB,KAAOxO,GAASyO,EAAO;AAsB3B,iBAASA,GAAQ1oD,GAAOwiC,GAAQ;AAC9B,iBAAQxiC,KAASA,EAAM,UAAUwiC,KAAUA,EAAO,SAC9CkX,GAAY15C,GAAOwiC,CAAM,IACzBxiC;AAAA,QACV;AAyBI,iBAAS2oD,GAAU3oD,GAAOwiC,GAAQd,GAAU;AAC1C,iBAAQ1hC,KAASA,EAAM,UAAUwiC,KAAUA,EAAO,SAC9CkX,GAAY15C,GAAOwiC,GAAQ2W,EAAYzX,GAAU,CAAC,CAAC,IACnD1hC;AAAA,QACV;AAyBI,iBAAS4oD,GAAY5oD,GAAOwiC,GAAQH,GAAY;AAC9C,iBAAQriC,KAASA,EAAM,UAAUwiC,KAAUA,EAAO,SAC9CkX,GAAY15C,GAAOwiC,GAAQvM,GAAWoM,CAAU,IAChDriC;AAAA,QACV;AA0BI,YAAI6oD,KAAS5H,GAAS,SAASjhD,GAAO+tB,GAAS;AAC7C,cAAIpoB,IAAS3F,KAAS,OAAO,IAAIA,EAAM,QACnC7T,IAASikD,GAAOpwC,GAAO+tB,CAAO;AAElC,iBAAA6rB,GAAW55C,GAAOsiC,GAASvU,GAAS,SAASn2B,GAAO;AAClD,mBAAOs3C,GAAQt3C,GAAO+N,CAAM,IAAI,CAAC/N,IAAQA;AAAA,UACjD,CAAO,EAAE,KAAKgmD,EAAgB,CAAC,GAElBzxD;AAAA,QACb,CAAK;AA8BD,iBAAS28D,GAAO9oD,GAAO+hC,GAAW;AAChC,cAAI51C,IAAS,CAAA;AACb,cAAI,EAAE6T,KAASA,EAAM;AACnB,mBAAO7T;AAET,cAAIyL,IAAQ,IACRm2B,IAAU,CAAA,GACVpoB,IAAS3F,EAAM;AAGnB,eADA+hC,IAAYoX,EAAYpX,GAAW,CAAC,GAC7B,EAAEnqC,IAAQ+N,KAAQ;AACvB,gBAAIzW,IAAQ8Q,EAAMpI,CAAK;AACvB,YAAImqC,EAAU7yC,GAAO0I,GAAOoI,CAAK,MAC/B7T,EAAO,KAAK+C,CAAK,GACjB6+B,EAAQ,KAAKn2B,CAAK;AAAA,UAE5B;AACM,iBAAAgiD,GAAW55C,GAAO+tB,CAAO,GAClB5hC;AAAA,QACb;AAyBI,iBAAS48D,GAAQ/oD,GAAO;AACtB,iBAAOA,KAAS,OAAOA,IAAQ4pC,GAAc,KAAK5pC,CAAK;AAAA,QAC7D;AAkBI,iBAASgpD,GAAMhpD,GAAOtL,GAAO6D,GAAK;AAChC,cAAIoN,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,iBAAK2F,KAGDpN,KAAO,OAAOA,KAAO,YAAYmnD,GAAe1/C,GAAOtL,GAAO6D,CAAG,KACnE7D,IAAQ,GACR6D,IAAMoN,MAGNjR,IAAQA,KAAS,OAAO,IAAIw+C,EAAUx+C,CAAK,GAC3C6D,IAAMA,MAAQ09B,IAAYtwB,IAASutC,EAAU36C,CAAG,IAE3CoiD,GAAU36C,GAAOtL,GAAO6D,CAAG,KAVzB,CAAA;AAAA,QAWf;AAmBI,iBAAS0wD,GAAYjpD,GAAO9Q,GAAO;AACjC,iBAAO2rD,GAAgB76C,GAAO9Q,CAAK;AAAA,QACzC;AA2BI,iBAASg6D,GAAclpD,GAAO9Q,GAAOwyC,GAAU;AAC7C,iBAAOuZ,GAAkBj7C,GAAO9Q,GAAOiqD,EAAYzX,GAAU,CAAC,CAAC;AAAA,QACrE;AAkBI,iBAASynB,GAAcnpD,GAAO9Q,GAAO;AACnC,cAAIyW,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,cAAI2F,GAAQ;AACV,gBAAI/N,IAAQijD,GAAgB76C,GAAO9Q,CAAK;AACxC,gBAAI0I,IAAQ+N,KAAU+pC,GAAG1vC,EAAMpI,CAAK,GAAG1I,CAAK;AAC1C,qBAAO0I;AAAA,UAEjB;AACM,iBAAO;AAAA,QACb;AAoBI,iBAASwxD,GAAgBppD,GAAO9Q,GAAO;AACrC,iBAAO2rD,GAAgB76C,GAAO9Q,GAAO,EAAI;AAAA,QAC/C;AA2BI,iBAASm6D,GAAkBrpD,GAAO9Q,GAAOwyC,GAAU;AACjD,iBAAOuZ,GAAkBj7C,GAAO9Q,GAAOiqD,EAAYzX,GAAU,CAAC,GAAG,EAAI;AAAA,QAC3E;AAkBI,iBAAS4nB,GAAkBtpD,GAAO9Q,GAAO;AACvC,cAAIyW,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,cAAI2F,GAAQ;AACV,gBAAI/N,IAAQijD,GAAgB76C,GAAO9Q,GAAO,EAAI,IAAI;AAClD,gBAAIwgD,GAAG1vC,EAAMpI,CAAK,GAAG1I,CAAK;AACxB,qBAAO0I;AAAA,UAEjB;AACM,iBAAO;AAAA,QACb;AAiBI,iBAAS2xD,GAAWvpD,GAAO;AACzB,iBAAQA,KAASA,EAAM,SACnB27C,GAAe37C,CAAK,IACpB,CAAA;AAAA,QACV;AAkBI,iBAASwpD,GAAaxpD,GAAO0hC,GAAU;AACrC,iBAAQ1hC,KAASA,EAAM,SACnB27C,GAAe37C,GAAOm5C,EAAYzX,GAAU,CAAC,CAAC,IAC9C,CAAA;AAAA,QACV;AAgBI,iBAAS+nB,GAAKzpD,GAAO;AACnB,cAAI2F,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,iBAAO2F,IAASg1C,GAAU36C,GAAO,GAAG2F,CAAM,IAAI,CAAA;AAAA,QACpD;AA2BI,iBAAS+jD,GAAK1pD,GAAOzL,GAAGkrD,GAAO;AAC7B,iBAAMz/C,KAASA,EAAM,UAGrBzL,IAAKkrD,KAASlrD,MAAM0hC,IAAa,IAAIid,EAAU3+C,CAAC,GACzComD,GAAU36C,GAAO,GAAGzL,IAAI,IAAI,IAAIA,CAAC,KAH/B,CAAA;AAAA,QAIf;AA2BI,iBAASo1D,GAAU3pD,GAAOzL,GAAGkrD,GAAO;AAClC,cAAI95C,IAAS3F,KAAS,OAAO,IAAIA,EAAM;AACvC,iBAAK2F,KAGLpR,IAAKkrD,KAASlrD,MAAM0hC,IAAa,IAAIid,EAAU3+C,CAAC,GAChDA,IAAIoR,IAASpR,GACNomD,GAAU36C,GAAOzL,IAAI,IAAI,IAAIA,GAAGoR,CAAM,KAJpC,CAAA;AAAA,QAKf;AAqCI,iBAASikD,GAAe5pD,GAAO+hC,GAAW;AACxC,iBAAQ/hC,KAASA,EAAM,SACnBm8C,GAAUn8C,GAAOm5C,EAAYpX,GAAW,CAAC,GAAG,IAAO,EAAI,IACvD,CAAA;AAAA,QACV;AAqCI,iBAAS8nB,GAAU7pD,GAAO+hC,GAAW;AACnC,iBAAQ/hC,KAASA,EAAM,SACnBm8C,GAAUn8C,GAAOm5C,EAAYpX,GAAW,CAAC,CAAC,IAC1C,CAAA;AAAA,QACV;AAkBI,YAAI+nB,KAAQ7P,GAAS,SAASrF,GAAQ;AACpC,iBAAOkH,GAASzI,GAAYuB,GAAQ,GAAGgE,IAAmB,EAAI,CAAC;AAAA,QACrE,CAAK,GAyBGmR,KAAU9P,GAAS,SAASrF,GAAQ;AACtC,cAAIlT,IAAW0T,GAAKR,CAAM;AAC1B,iBAAIgE,GAAkBlX,CAAQ,MAC5BA,IAAWzL,IAEN6lB,GAASzI,GAAYuB,GAAQ,GAAGgE,IAAmB,EAAI,GAAGO,EAAYzX,GAAU,CAAC,CAAC;AAAA,QAC/F,CAAK,GAuBGsoB,KAAY/P,GAAS,SAASrF,GAAQ;AACxC,cAAIvS,IAAa+S,GAAKR,CAAM;AAC5B,iBAAAvS,IAAa,OAAOA,KAAc,aAAaA,IAAapM,GACrD6lB,GAASzI,GAAYuB,GAAQ,GAAGgE,IAAmB,EAAI,GAAG3iB,GAAWoM,CAAU;AAAA,QAC5F,CAAK;AAoBD,iBAAS4nB,GAAKjqD,GAAO;AACnB,iBAAQA,KAASA,EAAM,SAAU87C,GAAS97C,CAAK,IAAI,CAAA;AAAA,QACzD;AAyBI,iBAASkqD,GAAOlqD,GAAO0hC,GAAU;AAC/B,iBAAQ1hC,KAASA,EAAM,SAAU87C,GAAS97C,GAAOm5C,EAAYzX,GAAU,CAAC,CAAC,IAAI,CAAA;AAAA,QACnF;AAsBI,iBAASyoB,GAASnqD,GAAOqiC,GAAY;AACnC,iBAAAA,IAAa,OAAOA,KAAc,aAAaA,IAAapM,GACpDj2B,KAASA,EAAM,SAAU87C,GAAS97C,GAAOi2B,GAAWoM,CAAU,IAAI,CAAA;AAAA,QAChF;AAqBI,iBAAS+nB,GAAMpqD,GAAO;AACpB,cAAI,EAAEA,KAASA,EAAM;AACnB,mBAAO,CAAA;AAET,cAAI2F,IAAS;AACb,iBAAA3F,IAAQgiC,GAAYhiC,GAAO,SAASqqD,GAAO;AACzC,gBAAIzR,GAAkByR,CAAK;AACzB,qBAAA1kD,IAAS4jC,GAAU8gB,EAAM,QAAQ1kD,CAAM,GAChC;AAAA,UAEjB,CAAO,GACMu+B,GAAUv+B,GAAQ,SAAS/N,GAAO;AACvC,mBAAO0qC,GAAStiC,GAAO8iC,GAAalrC,CAAK,CAAC;AAAA,UAClD,CAAO;AAAA,QACP;AAuBI,iBAAS0yD,GAAUtqD,GAAO0hC,GAAU;AAClC,cAAI,EAAE1hC,KAASA,EAAM;AACnB,mBAAO,CAAA;AAET,cAAI7T,IAASi+D,GAAMpqD,CAAK;AACxB,iBAAI0hC,KAAY,OACPv1C,IAEFm2C,GAASn2C,GAAQ,SAASk+D,GAAO;AACtC,mBAAOjpB,GAAMM,GAAUzL,GAAWo0B,CAAK;AAAA,UAC/C,CAAO;AAAA,QACP;AAsBI,YAAIE,KAAUtQ,GAAS,SAASj6C,GAAOwiC,GAAQ;AAC7C,iBAAOoW,GAAkB54C,CAAK,IAC1BqyC,GAAeryC,GAAOwiC,CAAM,IAC5B,CAAA;AAAA,QACV,CAAK,GAoBGgoB,KAAMvQ,GAAS,SAASrF,GAAQ;AAClC,iBAAO2H,GAAQva,GAAY4S,GAAQgE,EAAiB,CAAC;AAAA,QAC3D,CAAK,GAyBG6R,KAAQxQ,GAAS,SAASrF,GAAQ;AACpC,cAAIlT,IAAW0T,GAAKR,CAAM;AAC1B,iBAAIgE,GAAkBlX,CAAQ,MAC5BA,IAAWzL,IAENsmB,GAAQva,GAAY4S,GAAQgE,EAAiB,GAAGO,EAAYzX,GAAU,CAAC,CAAC;AAAA,QACrF,CAAK,GAuBGgpB,KAAUzQ,GAAS,SAASrF,GAAQ;AACtC,cAAIvS,IAAa+S,GAAKR,CAAM;AAC5B,iBAAAvS,IAAa,OAAOA,KAAc,aAAaA,IAAapM,GACrDsmB,GAAQva,GAAY4S,GAAQgE,EAAiB,GAAG3iB,GAAWoM,CAAU;AAAA,QAClF,CAAK,GAkBGsoB,KAAM1Q,GAASmQ,EAAK;AAkBxB,iBAASQ,GAAUxmB,GAAO5B,GAAQ;AAChC,iBAAOga,GAAcpY,KAAS,CAAA,GAAI5B,KAAU,CAAA,GAAIoN,EAAW;AAAA,QACjE;AAiBI,iBAASib,GAAczmB,GAAO5B,GAAQ;AACpC,iBAAOga,GAAcpY,KAAS,CAAA,GAAI5B,KAAU,CAAA,GAAIgX,EAAO;AAAA,QAC7D;AAsBI,YAAIsR,KAAU7Q,GAAS,SAASrF,GAAQ;AACtC,cAAIjvC,IAASivC,EAAO,QAChBlT,IAAW/7B,IAAS,IAAIivC,EAAOjvC,IAAS,CAAC,IAAIswB;AAEjD,iBAAAyL,IAAW,OAAOA,KAAY,cAAckT,EAAO,IAAG,GAAIlT,KAAYzL,GAC/Dq0B,GAAU1V,GAAQlT,CAAQ;AAAA,QACvC,CAAK;AAiCD,iBAASqpB,GAAM77D,GAAO;AACpB,cAAI/C,IAAS2+C,EAAO57C,CAAK;AACzB,iBAAA/C,EAAO,YAAY,IACZA;AAAA,QACb;AAyBI,iBAAS6+D,GAAI97D,GAAO+7D,GAAa;AAC/B,iBAAAA,EAAY/7D,CAAK,GACVA;AAAA,QACb;AAyBI,iBAASg8D,GAAKh8D,GAAO+7D,GAAa;AAChC,iBAAOA,EAAY/7D,CAAK;AAAA,QAC9B;AAkBI,YAAIi8D,KAAYlK,GAAS,SAAS5Q,GAAO;AACvC,cAAI1qC,IAAS0qC,EAAM,QACf37C,IAAQiR,IAAS0qC,EAAM,CAAC,IAAI,GAC5BnhD,IAAQ,KAAK,aACb+7D,IAAc,SAASpnB,GAAQ;AAAE,mBAAOuM,GAAOvM,GAAQwM,CAAK;AAAA,UAAE;AAElE,iBAAI1qC,IAAS,KAAK,KAAK,YAAY,UAC/B,EAAEzW,aAAiB+7C,OAAgB,CAACiE,GAAQx6C,CAAK,IAC5C,KAAK,KAAKu2D,CAAW,KAE9B/7D,IAAQA,EAAM,MAAMwF,GAAO,CAACA,KAASiR,IAAS,IAAI,EAAE,GACpDzW,EAAM,YAAY,KAAK;AAAA,YACrB,MAAQg8D;AAAA,YACR,MAAQ,CAACD,CAAW;AAAA,YACpB,SAAWh1B;AAAAA,UACnB,CAAO,GACM,IAAIiV,GAAch8C,GAAO,KAAK,SAAS,EAAE,KAAK,SAAS8Q,GAAO;AACnE,mBAAI2F,KAAU,CAAC3F,EAAM,UACnBA,EAAM,KAAKi2B,CAAS,GAEfj2B;AAAA,UACf,CAAO;AAAA,QACP,CAAK;AA6BD,iBAASorD,KAAe;AACtB,iBAAOL,GAAM,IAAI;AAAA,QACvB;AA4BI,iBAASM,KAAgB;AACvB,iBAAO,IAAIngB,GAAc,KAAK,MAAK,GAAI,KAAK,SAAS;AAAA,QAC3D;AAwBI,iBAASogB,KAAc;AACrB,UAAI,KAAK,eAAer1B,MACtB,KAAK,aAAas1B,GAAQ,KAAK,MAAK,CAAE;AAExC,cAAIC,IAAO,KAAK,aAAa,KAAK,WAAW,QACzCt8D,IAAQs8D,IAAOv1B,IAAY,KAAK,WAAW,KAAK,WAAW;AAE/D,iBAAO,EAAE,MAAQu1B,GAAM,OAASt8D,EAAK;AAAA,QAC3C;AAoBI,iBAASu8D,KAAoB;AAC3B,iBAAO;AAAA,QACb;AA0BI,iBAASC,GAAax8D,GAAO;AAI3B,mBAHI/C,GACAu9B,IAAS,MAENA,aAAkB4hB,MAAY;AACnC,gBAAIqgB,IAAQxgB,GAAazhB,CAAM;AAC/B,YAAAiiC,EAAM,YAAY,GAClBA,EAAM,aAAa11B,GACf9pC,IACFupC,EAAS,cAAci2B,IAEvBx/D,IAASw/D;AAEX,gBAAIj2B,IAAWi2B;AACf,YAAAjiC,IAASA,EAAO;AAAA,UACxB;AACM,iBAAAgM,EAAS,cAAcxmC,GAChB/C;AAAA,QACb;AAsBI,iBAASy/D,KAAiB;AACxB,cAAI18D,IAAQ,KAAK;AACjB,cAAIA,aAAiB+7C,IAAa;AAChC,gBAAI4gB,IAAU38D;AACd,mBAAI,KAAK,YAAY,WACnB28D,IAAU,IAAI5gB,GAAY,IAAI,IAEhC4gB,IAAUA,EAAQ,QAAO,GACzBA,EAAQ,YAAY,KAAK;AAAA,cACvB,MAAQX;AAAA,cACR,MAAQ,CAACnC,EAAO;AAAA,cAChB,SAAW9yB;AAAAA,YACrB,CAAS,GACM,IAAIiV,GAAc2gB,GAAS,KAAK,SAAS;AAAA,UACxD;AACM,iBAAO,KAAK,KAAK9C,EAAO;AAAA,QAC9B;AAgBI,iBAAS+C,KAAe;AACtB,iBAAO1f,GAAiB,KAAK,aAAa,KAAK,WAAW;AAAA,QAChE;AA0BI,YAAI2f,KAAU3M,GAAiB,SAASjzD,GAAQ+C,GAAOrF,GAAK;AAC1D,UAAI29C,GAAe,KAAKr7C,GAAQtC,CAAG,IACjC,EAAEsC,EAAOtC,CAAG,IAEZ8lD,GAAgBxjD,GAAQtC,GAAK,CAAC;AAAA,QAEtC,CAAK;AA2CD,iBAASmiE,GAAM7oB,GAAYpB,GAAW0d,GAAO;AAC3C,cAAIpe,IAAO2J,EAAQ7H,CAAU,IAAIrB,KAAagR;AAC9C,iBAAI2M,KAASC,GAAevc,GAAYpB,GAAW0d,CAAK,MACtD1d,IAAY9L,IAEPoL,EAAK8B,GAAYgW,EAAYpX,GAAW,CAAC,CAAC;AAAA,QACvD;AA2CI,iBAASkqB,GAAO9oB,GAAYpB,GAAW;AACrC,cAAIV,IAAO2J,EAAQ7H,CAAU,IAAInB,KAAcoR;AAC/C,iBAAO/R,EAAK8B,GAAYgW,EAAYpX,GAAW,CAAC,CAAC;AAAA,QACvD;AAsCI,YAAImqB,KAAOpL,GAAW6G,EAAS,GAqB3BwE,KAAWrL,GAAW8G,EAAa;AAuBvC,iBAASwE,GAAQjpB,GAAYzB,GAAU;AACrC,iBAAO2R,GAAY1N,GAAIxC,GAAYzB,CAAQ,GAAG,CAAC;AAAA,QACrD;AAsBI,iBAAS2qB,GAAYlpB,GAAYzB,GAAU;AACzC,iBAAO2R,GAAY1N,GAAIxC,GAAYzB,CAAQ,GAAG1J,EAAQ;AAAA,QAC5D;AAuBI,iBAASs0B,GAAanpB,GAAYzB,GAAU4R,GAAO;AACjD,iBAAAA,IAAQA,MAAUrd,IAAY,IAAIid,EAAUI,CAAK,GAC1CD,GAAY1N,GAAIxC,GAAYzB,CAAQ,GAAG4R,CAAK;AAAA,QACzD;AAgCI,iBAASiZ,GAAQppB,GAAYzB,GAAU;AACrC,cAAIL,IAAO2J,EAAQ7H,CAAU,IAAIvB,KAAYmO;AAC7C,iBAAO1O,EAAK8B,GAAYgW,EAAYzX,GAAU,CAAC,CAAC;AAAA,QACtD;AAsBI,iBAAS8qB,GAAarpB,GAAYzB,GAAU;AAC1C,cAAIL,IAAO2J,EAAQ7H,CAAU,IAAItB,KAAiB+Q;AAClD,iBAAOvR,EAAK8B,GAAYgW,EAAYzX,GAAU,CAAC,CAAC;AAAA,QACtD;AAyBI,YAAI+qB,KAAUrN,GAAiB,SAASjzD,GAAQ+C,GAAOrF,GAAK;AAC1D,UAAI29C,GAAe,KAAKr7C,GAAQtC,CAAG,IACjCsC,EAAOtC,CAAG,EAAE,KAAKqF,CAAK,IAEtBygD,GAAgBxjD,GAAQtC,GAAK,CAACqF,CAAK,CAAC;AAAA,QAE5C,CAAK;AAgCD,iBAASojD,GAASnP,GAAYj0C,GAAOo0C,GAAWmc,GAAO;AACrD,UAAAtc,IAAa4U,GAAY5U,CAAU,IAAIA,IAAaX,GAAOW,CAAU,GACrEG,IAAaA,KAAa,CAACmc,IAASvM,EAAU5P,CAAS,IAAI;AAE3D,cAAI39B,IAASw9B,EAAW;AACxB,iBAAIG,IAAY,MACdA,IAAYiG,GAAU5jC,IAAS29B,GAAW,CAAC,IAEtCopB,GAASvpB,CAAU,IACrBG,KAAa39B,KAAUw9B,EAAW,QAAQj0C,GAAOo0C,CAAS,IAAI,KAC9D,CAAC,CAAC39B,KAAUw8B,GAAYgB,GAAYj0C,GAAOo0C,CAAS,IAAI;AAAA,QACnE;AAyBI,YAAIqpB,KAAY1S,GAAS,SAAS9W,GAAYrV,GAAMyT,GAAM;AACxD,cAAI3pC,IAAQ,IACRu5C,IAAS,OAAOrjB,KAAQ,YACxB3hC,IAAS4rD,GAAY5U,CAAU,IAAIuD,EAAMvD,EAAW,MAAM,IAAI,CAAA;AAElE,iBAAA4M,GAAS5M,GAAY,SAASj0C,GAAO;AACnC,YAAA/C,EAAO,EAAEyL,CAAK,IAAIu5C,IAAS/P,GAAMtT,GAAM5+B,GAAOqyC,CAAI,IAAI4T,GAAWjmD,GAAO4+B,GAAMyT,CAAI;AAAA,UAC1F,CAAO,GACMp1C;AAAA,QACb,CAAK,GA8BGygE,KAAQxN,GAAiB,SAASjzD,GAAQ+C,GAAOrF,GAAK;AACxD,UAAA8lD,GAAgBxjD,GAAQtC,GAAKqF,CAAK;AAAA,QACxC,CAAK;AA4CD,iBAASy2C,GAAIxC,GAAYzB,GAAU;AACjC,cAAIL,IAAO2J,EAAQ7H,CAAU,IAAIb,KAAWwV;AAC5C,iBAAOzW,EAAK8B,GAAYgW,EAAYzX,GAAU,CAAC,CAAC;AAAA,QACtD;AA+BI,iBAASmrB,GAAQ1pB,GAAY8I,GAAWiN,GAAQuG,GAAO;AACrD,iBAAItc,KAAc,OACT,CAAA,KAEJ6H,EAAQiB,CAAS,MACpBA,IAAYA,KAAa,OAAO,CAAA,IAAK,CAACA,CAAS,IAEjDiN,IAASuG,IAAQxpB,IAAYijB,GACxBlO,EAAQkO,CAAM,MACjBA,IAASA,KAAU,OAAO,CAAA,IAAK,CAACA,CAAM,IAEjCD,GAAY9V,GAAY8I,GAAWiN,CAAM;AAAA,QACtD;AAsCI,YAAI4T,KAAY1N,GAAiB,SAASjzD,GAAQ+C,GAAOrF,GAAK;AAC5D,UAAAsC,EAAOtC,IAAM,IAAI,CAAC,EAAE,KAAKqF,CAAK;AAAA,WAC7B,WAAW;AAAE,iBAAO,CAAC,CAAA,GAAI,CAAA,CAAE;AAAA,QAAE,CAAE;AAuClC,iBAAS69D,GAAO5pB,GAAYzB,GAAUC,GAAa;AACjD,cAAIN,IAAO2J,EAAQ7H,CAAU,IAAIV,KAAcsB,IAC3CrB,IAAY,UAAU,SAAS;AAEnC,iBAAOrB,EAAK8B,GAAYgW,EAAYzX,GAAU,CAAC,GAAGC,GAAae,GAAWqN,EAAQ;AAAA,QACxF;AAwBI,iBAASid,GAAY7pB,GAAYzB,GAAUC,GAAa;AACtD,cAAIN,IAAO2J,EAAQ7H,CAAU,IAAIR,KAAmBoB,IAChDrB,IAAY,UAAU,SAAS;AAEnC,iBAAOrB,EAAK8B,GAAYgW,EAAYzX,GAAU,CAAC,GAAGC,GAAae,GAAWkQ,EAAa;AAAA,QAC7F;AAoCI,iBAASqa,GAAO9pB,GAAYpB,GAAW;AACrC,cAAIV,IAAO2J,EAAQ7H,CAAU,IAAInB,KAAcoR;AAC/C,iBAAO/R,EAAK8B,GAAY+pB,GAAO/T,EAAYpX,GAAW,CAAC,CAAC,CAAC;AAAA,QAC/D;AAgBI,iBAASorB,GAAOhqB,GAAY;AAC1B,cAAI9B,IAAO2J,EAAQ7H,CAAU,IAAIgM,KAAciL;AAC/C,iBAAO/Y,EAAK8B,CAAU;AAAA,QAC5B;AAsBI,iBAASiqB,GAAWjqB,GAAY5uC,GAAGkrD,GAAO;AACxC,WAAKA,IAAQC,GAAevc,GAAY5uC,GAAGkrD,CAAK,IAAIlrD,MAAM0hC,KACxD1hC,IAAI,IAEJA,IAAI2+C,EAAU3+C,CAAC;AAEjB,cAAI8sC,IAAO2J,EAAQ7H,CAAU,IAAIkM,KAAkBgL;AACnD,iBAAOhZ,EAAK8B,GAAY5uC,CAAC;AAAA,QAC/B;AAiBI,iBAAS84D,GAAQlqB,GAAY;AAC3B,cAAI9B,IAAO2J,EAAQ7H,CAAU,IAAIqM,KAAekL;AAChD,iBAAOrZ,EAAK8B,CAAU;AAAA,QAC5B;AAuBI,iBAAS2K,GAAK3K,GAAY;AACxB,cAAIA,KAAc;AAChB,mBAAO;AAET,cAAI4U,GAAY5U,CAAU;AACxB,mBAAOupB,GAASvpB,CAAU,IAAI8C,GAAW9C,CAAU,IAAIA,EAAW;AAEpE,cAAI8N,IAAMC,GAAO/N,CAAU;AAC3B,iBAAI8N,KAAOhY,MAAUgY,KAAOzX,KACnB2J,EAAW,OAEbqU,GAASrU,CAAU,EAAE;AAAA,QAClC;AAsCI,iBAASmqB,GAAKnqB,GAAYpB,GAAW0d,GAAO;AAC1C,cAAIpe,IAAO2J,EAAQ7H,CAAU,IAAIP,KAAYgY;AAC7C,iBAAI6E,KAASC,GAAevc,GAAYpB,GAAW0d,CAAK,MACtD1d,IAAY9L,IAEPoL,EAAK8B,GAAYgW,EAAYpX,GAAW,CAAC,CAAC;AAAA,QACvD;AA+BI,YAAIwrB,KAAStT,GAAS,SAAS9W,GAAY8I,GAAW;AACpD,cAAI9I,KAAc;AAChB,mBAAO,CAAA;AAET,cAAIx9B,IAASsmC,EAAU;AACvB,iBAAItmC,IAAS,KAAK+5C,GAAevc,GAAY8I,EAAU,CAAC,GAAGA,EAAU,CAAC,CAAC,IACrEA,IAAY,CAAA,IACHtmC,IAAS,KAAK+5C,GAAezT,EAAU,CAAC,GAAGA,EAAU,CAAC,GAAGA,EAAU,CAAC,CAAC,MAC9EA,IAAY,CAACA,EAAU,CAAC,CAAC,IAEpBgN,GAAY9V,GAAYkQ,GAAYpH,GAAW,CAAC,GAAG,EAAE;AAAA,QAClE,CAAK,GAoBGuhB,KAAM1kB,MAAU,WAAW;AAC7B,iBAAOp7C,GAAK,KAAK,IAAG;AAAA;AA6BtB,iBAAS+/D,GAAMl5D,GAAG8sC,GAAM;AACtB,cAAI,OAAOA,KAAQ;AACjB,kBAAM,IAAI6F,GAAU7Q,CAAe;AAErC,iBAAA9hC,IAAI2+C,EAAU3+C,CAAC,GACR,WAAW;AAChB,gBAAI,EAAEA,IAAI;AACR,qBAAO8sC,EAAK,MAAM,MAAM,SAAS;AAAA;QAG3C;AAmBI,iBAASsgB,GAAItgB,GAAM9sC,GAAGkrD,GAAO;AAC3B,iBAAAlrD,IAAIkrD,IAAQxpB,IAAY1hC,GACxBA,IAAK8sC,KAAQ9sC,KAAK,OAAQ8sC,EAAK,SAAS9sC,GACjCsvD,GAAWxiB,GAAM/J,GAAerB,GAAWA,GAAWA,GAAWA,GAAW1hC,CAAC;AAAA,QAC1F;AAmBI,iBAASm5D,GAAOn5D,GAAG8sC,GAAM;AACvB,cAAIl1C;AACJ,cAAI,OAAOk1C,KAAQ;AACjB,kBAAM,IAAI6F,GAAU7Q,CAAe;AAErC,iBAAA9hC,IAAI2+C,EAAU3+C,CAAC,GACR,WAAW;AAChB,mBAAI,EAAEA,IAAI,MACRpI,IAASk1C,EAAK,MAAM,MAAM,SAAS,IAEjC9sC,KAAK,MACP8sC,IAAOpL,IAEF9pC;AAAA;QAEf;AAqCI,YAAIwhE,KAAO1T,GAAS,SAAS5Y,GAAMC,GAAS6c,GAAU;AACpD,cAAIxN,IAAU5Z;AACd,cAAIonB,EAAS,QAAQ;AACnB,gBAAIC,IAAUvY,GAAesY,GAAUwC,GAAUgN,EAAI,CAAC;AACtD,YAAAhd,KAAWvZ;AAAA,UACnB;AACM,iBAAOysB,GAAWxiB,GAAMsP,GAASrP,GAAS6c,GAAUC,CAAO;AAAA,QACjE,CAAK,GA+CGwP,KAAU3T,GAAS,SAASpW,GAAQh6C,GAAKs0D,GAAU;AACrD,cAAIxN,IAAU5Z,IAAiBC;AAC/B,cAAImnB,EAAS,QAAQ;AACnB,gBAAIC,IAAUvY,GAAesY,GAAUwC,GAAUiN,EAAO,CAAC;AACzD,YAAAjd,KAAWvZ;AAAA,UACnB;AACM,iBAAOysB,GAAWh6D,GAAK8mD,GAAS9M,GAAQsa,GAAUC,CAAO;AAAA,QAC/D,CAAK;AA2CD,iBAASyP,GAAMxsB,GAAMqf,GAAOjB,GAAO;AACjC,UAAAiB,IAAQjB,IAAQxpB,IAAYyqB;AAC5B,cAAIv0D,IAAS03D,GAAWxiB,GAAMnK,GAAiBjB,GAAWA,GAAWA,GAAWA,GAAWA,GAAWyqB,CAAK;AAC3G,iBAAAv0D,EAAO,cAAc0hE,GAAM,aACpB1hE;AAAA,QACb;AAwCI,iBAAS2hE,GAAWzsB,GAAMqf,GAAOjB,GAAO;AACtC,UAAAiB,IAAQjB,IAAQxpB,IAAYyqB;AAC5B,cAAIv0D,IAAS03D,GAAWxiB,GAAMlK,GAAuBlB,GAAWA,GAAWA,GAAWA,GAAWA,GAAWyqB,CAAK;AACjH,iBAAAv0D,EAAO,cAAc2hE,GAAW,aACzB3hE;AAAA,QACb;AAwDI,iBAAS4hE,GAAS1sB,GAAM8Q,GAAMj8C,GAAS;AACrC,cAAI83D,GACAC,GACAC,GACA/hE,GACAgiE,GACAC,GACAC,IAAiB,GACjBC,IAAU,IACVC,IAAS,IACTnO,IAAW;AAEf,cAAI,OAAO/e,KAAQ;AACjB,kBAAM,IAAI6F,GAAU7Q,CAAe;AAErC,UAAA8b,IAAO6Q,GAAS7Q,CAAI,KAAK,GACrBlwB,GAAS/rB,CAAO,MAClBo4D,IAAU,CAAC,CAACp4D,EAAQ,SACpBq4D,IAAS,aAAar4D,GACtBg4D,IAAUK,IAAShlB,GAAUyZ,GAAS9sD,EAAQ,OAAO,KAAK,GAAGi8C,CAAI,IAAI+b,GACrE9N,IAAW,cAAclqD,IAAU,CAAC,CAACA,EAAQ,WAAWkqD;AAG1D,mBAASoO,EAAWC,IAAM;AACxB,gBAAIltB,KAAOysB,GACP1sB,KAAU2sB;AAEd,mBAAAD,IAAWC,IAAWh4B,GACtBo4B,IAAiBI,IACjBtiE,IAASk1C,EAAK,MAAMC,IAASC,EAAI,GAC1Bp1C;AAAA,UACf;AAEM,mBAASuiE,EAAYD,IAAM;AAEzB,mBAAAJ,IAAiBI,IAEjBN,IAAU/b,GAAWuc,IAAcxc,CAAI,GAEhCmc,IAAUE,EAAWC,EAAI,IAAItiE;AAAA,UAC5C;AAEM,mBAASyiE,EAAcH,IAAM;AAC3B,gBAAII,KAAoBJ,KAAOL,GAC3BU,KAAsBL,KAAOJ,GAC7BU,KAAc5c,IAAO0c;AAEzB,mBAAON,IACH/kB,GAAUulB,IAAab,IAAUY,EAAmB,IACpDC;AAAA,UACZ;AAEM,mBAASC,EAAaP,IAAM;AAC1B,gBAAII,KAAoBJ,KAAOL,GAC3BU,KAAsBL,KAAOJ;AAKjC,mBAAQD,MAAiBn4B,KAAc44B,MAAqB1c,KACzD0c,KAAoB,KAAON,KAAUO,MAAuBZ;AAAA,UACvE;AAEM,mBAASS,KAAe;AACtB,gBAAIF,KAAOjB,GAAG;AACd,gBAAIwB,EAAaP,EAAI;AACnB,qBAAOQ,GAAaR,EAAI;AAG1B,YAAAN,IAAU/b,GAAWuc,IAAcC,EAAcH,EAAI,CAAC;AAAA,UAC9D;AAEM,mBAASQ,GAAaR,IAAM;AAK1B,mBAJAN,IAAUl4B,GAINmqB,KAAY4N,IACPQ,EAAWC,EAAI,KAExBT,IAAWC,IAAWh4B,GACf9pC;AAAA,UACf;AAEM,mBAAS+iE,KAAS;AAChB,YAAIf,MAAYl4B,KACdgnB,GAAakR,CAAO,GAEtBE,IAAiB,GACjBL,IAAWI,IAAeH,IAAWE,IAAUl4B;AAAAA,UACvD;AAEM,mBAASk5B,KAAQ;AACf,mBAAOhB,MAAYl4B,IAAY9pC,IAAS8iE,GAAazB,GAAG,CAAE;AAAA,UAClE;AAEM,mBAAS4B,KAAY;AACnB,gBAAIX,KAAOjB,GAAG,GACV6B,KAAaL,EAAaP,EAAI;AAMlC,gBAJAT,IAAW,WACXC,IAAW,MACXG,IAAeK,IAEXY,IAAY;AACd,kBAAIlB,MAAYl4B;AACd,uBAAOy4B,EAAYN,CAAY;AAEjC,kBAAIG;AAEF,uBAAAtR,GAAakR,CAAO,GACpBA,IAAU/b,GAAWuc,IAAcxc,CAAI,GAChCqc,EAAWJ,CAAY;AAAA,YAE1C;AACQ,mBAAID,MAAYl4B,MACdk4B,IAAU/b,GAAWuc,IAAcxc,CAAI,IAElChmD;AAAA,UACf;AACM,iBAAAijE,GAAU,SAASF,IACnBE,GAAU,QAAQD,IACXC;AAAA,QACb;AAoBI,YAAIE,KAAQrV,GAAS,SAAS5Y,GAAME,GAAM;AACxC,iBAAO2Q,GAAU7Q,GAAM,GAAGE,CAAI;AAAA,QACpC,CAAK,GAqBGguB,KAAQtV,GAAS,SAAS5Y,GAAM8Q,GAAM5Q,GAAM;AAC9C,iBAAO2Q,GAAU7Q,GAAM2hB,GAAS7Q,CAAI,KAAK,GAAG5Q,CAAI;AAAA,QACtD,CAAK;AAoBD,iBAASiuB,GAAKnuB,GAAM;AAClB,iBAAOwiB,GAAWxiB,GAAM7J,EAAc;AAAA,QAC5C;AA8CI,iBAASwuB,GAAQ3kB,GAAMouB,GAAU;AAC/B,cAAI,OAAOpuB,KAAQ,cAAeouB,KAAY,QAAQ,OAAOA,KAAY;AACvE,kBAAM,IAAIvoB,GAAU7Q,CAAe;AAErC,cAAIq5B,IAAW,WAAW;AACxB,gBAAInuB,IAAO,WACP13C,IAAM4lE,IAAWA,EAAS,MAAM,MAAMluB,CAAI,IAAIA,EAAK,CAAC,GACpDmD,IAAQgrB,EAAS;AAErB,gBAAIhrB,EAAM,IAAI76C,CAAG;AACf,qBAAO66C,EAAM,IAAI76C,CAAG;AAEtB,gBAAIsC,IAASk1C,EAAK,MAAM,MAAME,CAAI;AAClC,mBAAAmuB,EAAS,QAAQhrB,EAAM,IAAI76C,GAAKsC,CAAM,KAAKu4C,GACpCv4C;AAAA;AAET,iBAAAujE,EAAS,QAAQ,KAAK1J,GAAQ,SAASzY,OAChCmiB;AAAA,QACb;AAGI,QAAA1J,GAAQ,QAAQzY;AAsBhB,iBAAS2f,GAAOnrB,GAAW;AACzB,cAAI,OAAOA,KAAa;AACtB,kBAAM,IAAImF,GAAU7Q,CAAe;AAErC,iBAAO,WAAW;AAChB,gBAAIkL,IAAO;AACX,oBAAQA,EAAK,QAAM;AAAA,cACjB,KAAK;AAAG,uBAAO,CAACQ,EAAU,KAAK,IAAI;AAAA,cACnC,KAAK;AAAG,uBAAO,CAACA,EAAU,KAAK,MAAMR,EAAK,CAAC,CAAC;AAAA,cAC5C,KAAK;AAAG,uBAAO,CAACQ,EAAU,KAAK,MAAMR,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,cACrD,KAAK;AAAG,uBAAO,CAACQ,EAAU,KAAK,MAAMR,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,YACxE;AACQ,mBAAO,CAACQ,EAAU,MAAM,MAAMR,CAAI;AAAA;QAE1C;AAoBI,iBAASouB,GAAKtuB,GAAM;AAClB,iBAAOqsB,GAAO,GAAGrsB,CAAI;AAAA,QAC3B;AAiCI,YAAIuuB,KAAW7S,GAAS,SAAS1b,GAAMkkB,GAAY;AACjD,UAAAA,IAAcA,EAAW,UAAU,KAAKva,EAAQua,EAAW,CAAC,CAAC,IACzDjjB,GAASijB,EAAW,CAAC,GAAGhhB,GAAU4U,EAAW,CAAE,CAAC,IAChD7W,GAAS+Q,GAAYkS,GAAY,CAAC,GAAGhhB,GAAU4U,EAAW,CAAE,CAAC;AAEjE,cAAI0W,IAActK,EAAW;AAC7B,iBAAOtL,GAAS,SAAS1Y,GAAM;AAI7B,qBAHI3pC,IAAQ,IACR+N,IAAS6jC,GAAUjI,EAAK,QAAQsuB,CAAW,GAExC,EAAEj4D,IAAQ+N;AACf,cAAA47B,EAAK3pC,CAAK,IAAI2tD,EAAW3tD,CAAK,EAAE,KAAK,MAAM2pC,EAAK3pC,CAAK,CAAC;AAExD,mBAAOwpC,GAAMC,GAAM,MAAME,CAAI;AAAA,UACrC,CAAO;AAAA,QACP,CAAK,GAmCGuuB,KAAU7V,GAAS,SAAS5Y,GAAM8c,GAAU;AAC9C,cAAIC,IAAUvY,GAAesY,GAAUwC,GAAUmP,EAAO,CAAC;AACzD,iBAAOjM,GAAWxiB,GAAMjK,GAAmBnB,GAAWkoB,GAAUC,CAAO;AAAA,QAC7E,CAAK,GAkCG2R,KAAe9V,GAAS,SAAS5Y,GAAM8c,GAAU;AACnD,cAAIC,IAAUvY,GAAesY,GAAUwC,GAAUoP,EAAY,CAAC;AAC9D,iBAAOlM,GAAWxiB,GAAMhK,GAAyBpB,GAAWkoB,GAAUC,CAAO;AAAA,QACnF,CAAK,GAwBG4R,KAAQ/O,GAAS,SAAS5f,GAAMtT,GAAS;AAC3C,iBAAO81B,GAAWxiB,GAAM9J,GAAiBtB,GAAWA,GAAWA,GAAWlI,CAAO;AAAA,QACvF,CAAK;AA2BD,iBAASkiC,GAAK5uB,GAAM3sC,GAAO;AACzB,cAAI,OAAO2sC,KAAQ;AACjB,kBAAM,IAAI6F,GAAU7Q,CAAe;AAErC,iBAAA3hC,IAAQA,MAAUuhC,IAAYvhC,IAAQw+C,EAAUx+C,CAAK,GAC9CulD,GAAS5Y,GAAM3sC,CAAK;AAAA,QACjC;AAoCI,iBAASw7D,GAAO7uB,GAAM3sC,GAAO;AAC3B,cAAI,OAAO2sC,KAAQ;AACjB,kBAAM,IAAI6F,GAAU7Q,CAAe;AAErC,iBAAA3hC,IAAQA,KAAS,OAAO,IAAI60C,GAAU2J,EAAUx+C,CAAK,GAAG,CAAC,GAClDulD,GAAS,SAAS1Y,GAAM;AAC7B,gBAAIvhC,IAAQuhC,EAAK7sC,CAAK,GAClB0xD,IAAYpJ,GAAUzb,GAAM,GAAG7sC,CAAK;AAExC,mBAAIsL,KACFuiC,GAAU6jB,GAAWpmD,CAAK,GAErBohC,GAAMC,GAAM,MAAM+kB,CAAS;AAAA,UAC1C,CAAO;AAAA,QACP;AA8CI,iBAAS+J,GAAS9uB,GAAM8Q,GAAMj8C,GAAS;AACrC,cAAIo4D,IAAU,IACVlO,IAAW;AAEf,cAAI,OAAO/e,KAAQ;AACjB,kBAAM,IAAI6F,GAAU7Q,CAAe;AAErC,iBAAIpU,GAAS/rB,CAAO,MAClBo4D,IAAU,aAAap4D,IAAU,CAAC,CAACA,EAAQ,UAAUo4D,GACrDlO,IAAW,cAAclqD,IAAU,CAAC,CAACA,EAAQ,WAAWkqD,IAEnD2N,GAAS1sB,GAAM8Q,GAAM;AAAA,YAC1B,SAAWmc;AAAA,YACX,SAAWnc;AAAA,YACX,UAAYiO;AAAA,UACpB,CAAO;AAAA,QACP;AAiBI,iBAASgQ,GAAM/uB,GAAM;AACnB,iBAAOsgB,GAAItgB,GAAM,CAAC;AAAA,QACxB;AAwBI,iBAASgvB,GAAKnhE,GAAO8wD,GAAS;AAC5B,iBAAO8P,GAAQlT,GAAaoD,CAAO,GAAG9wD,CAAK;AAAA,QACjD;AAqCI,iBAASohE,KAAY;AACnB,cAAI,CAAC,UAAU;AACb,mBAAO,CAAA;AAET,cAAIphE,IAAQ,UAAU,CAAC;AACvB,iBAAO87C,EAAQ97C,CAAK,IAAIA,IAAQ,CAACA,CAAK;AAAA,QAC5C;AA4BI,iBAASy8D,GAAMz8D,GAAO;AACpB,iBAAOwhD,GAAUxhD,GAAO0nC,CAAkB;AAAA,QAChD;AAiCI,iBAAS25B,GAAUrhE,GAAO0hD,GAAY;AACpC,iBAAAA,IAAa,OAAOA,KAAc,aAAaA,IAAa3a,GACrDya,GAAUxhD,GAAO0nC,GAAoBga,CAAU;AAAA,QAC5D;AAoBI,iBAAS4f,GAAUthE,GAAO;AACxB,iBAAOwhD,GAAUxhD,GAAOwnC,IAAkBE,CAAkB;AAAA,QAClE;AA8BI,iBAAS65B,GAAcvhE,GAAO0hD,GAAY;AACxC,iBAAAA,IAAa,OAAOA,KAAc,aAAaA,IAAa3a,GACrDya,GAAUxhD,GAAOwnC,IAAkBE,GAAoBga,CAAU;AAAA,QAC9E;AA0BI,iBAAS8f,GAAW7sB,GAAQxxC,GAAQ;AAClC,iBAAOA,KAAU,QAAQ4/C,GAAepO,GAAQxxC,GAAQvI,GAAKuI,CAAM,CAAC;AAAA,QAC1E;AAkCI,iBAASq9C,GAAGxgD,GAAOqlD,GAAO;AACxB,iBAAOrlD,MAAUqlD,KAAUrlD,MAAUA,KAASqlD,MAAUA;AAAA,QAC9D;AAyBI,YAAIoc,KAAK5N,GAA0BzO,EAAM,GAyBrCsc,KAAM7N,GAA0B,SAAS7zD,GAAOqlD,GAAO;AACzD,iBAAOrlD,KAASqlD;AAAA,QACtB,CAAK,GAoBG3F,KAAcyG,GAAgB,2BAAW;AAAE,iBAAO;AAAA,QAAU,GAAI,IAAIA,KAAkB,SAASnmD,GAAO;AACxG,iBAAO67C,GAAa77C,CAAK,KAAKs4C,GAAe,KAAKt4C,GAAO,QAAQ,KAC/D,CAACo5C,GAAqB,KAAKp5C,GAAO,QAAQ;AAAA,WA0B1C87C,IAAUtE,EAAM,SAmBhBmqB,KAAgB/vB,KAAoByD,GAAUzD,EAAiB,IAAIwU;AA2BvE,iBAASyC,GAAY7oD,GAAO;AAC1B,iBAAOA,KAAS,QAAQkoD,GAASloD,EAAM,MAAM,KAAK,CAAC2kD,GAAW3kD,CAAK;AAAA,QACzE;AA2BI,iBAAS0pD,GAAkB1pD,GAAO;AAChC,iBAAO67C,GAAa77C,CAAK,KAAK6oD,GAAY7oD,CAAK;AAAA,QACrD;AAmBI,iBAAS4hE,GAAU5hE,GAAO;AACxB,iBAAOA,MAAU,MAAQA,MAAU,MAChC67C,GAAa77C,CAAK,KAAKilD,GAAWjlD,CAAK,KAAKypC;AAAA,QACrD;AAmBI,YAAImW,KAAW3F,MAAkB2c,IAmB7BiL,KAAShwB,KAAawD,GAAUxD,EAAU,IAAIwU;AAmBlD,iBAASyb,GAAU9hE,GAAO;AACxB,iBAAO67C,GAAa77C,CAAK,KAAKA,EAAM,aAAa,KAAK,CAAC4pD,GAAc5pD,CAAK;AAAA,QAChF;AAmCI,iBAAS+hE,GAAQ/hE,GAAO;AACtB,cAAIA,KAAS;AACX,mBAAO;AAET,cAAI6oD,GAAY7oD,CAAK,MAChB87C,EAAQ97C,CAAK,KAAK,OAAOA,KAAS,YAAY,OAAOA,EAAM,UAAU,cACpE4/C,GAAS5/C,CAAK,KAAK8/C,GAAa9/C,CAAK,KAAK0/C,GAAY1/C,CAAK;AAC/D,mBAAO,CAACA,EAAM;AAEhB,cAAI+hD,IAAMC,GAAOhiD,CAAK;AACtB,cAAI+hD,KAAOhY,MAAUgY,KAAOzX;AAC1B,mBAAO,CAACtqC,EAAM;AAEhB,cAAIuoD,GAAYvoD,CAAK;AACnB,mBAAO,CAACsoD,GAAStoD,CAAK,EAAE;AAE1B,mBAASrF,KAAOqF;AACd,gBAAIs4C,GAAe,KAAKt4C,GAAOrF,CAAG;AAChC,qBAAO;AAGX,iBAAO;AAAA,QACb;AA8BI,iBAASqnE,GAAQhiE,GAAOqlD,GAAO;AAC7B,iBAAOiB,GAAYtmD,GAAOqlD,CAAK;AAAA,QACrC;AAkCI,iBAAS4c,GAAYjiE,GAAOqlD,GAAO3D,GAAY;AAC7C,UAAAA,IAAa,OAAOA,KAAc,aAAaA,IAAa3a;AAC5D,cAAI9pC,IAASykD,IAAaA,EAAW1hD,GAAOqlD,CAAK,IAAIte;AACrD,iBAAO9pC,MAAW8pC,IAAYuf,GAAYtmD,GAAOqlD,GAAOte,GAAW2a,CAAU,IAAI,CAAC,CAACzkD;AAAA,QACzF;AAoBI,iBAASilE,GAAQliE,GAAO;AACtB,cAAI,CAAC67C,GAAa77C,CAAK;AACrB,mBAAO;AAET,cAAI+hD,IAAMkD,GAAWjlD,CAAK;AAC1B,iBAAO+hD,KAAOnY,MAAYmY,KAAOpY,MAC9B,OAAO3pC,EAAM,WAAW,YAAY,OAAOA,EAAM,QAAQ,YAAY,CAAC4pD,GAAc5pD,CAAK;AAAA,QAClG;AA4BI,iBAASmiE,GAASniE,GAAO;AACvB,iBAAO,OAAOA,KAAS,YAAYk6C,GAAel6C,CAAK;AAAA,QAC7D;AAmBI,iBAAS2kD,GAAW3kD,GAAO;AACzB,cAAI,CAAC+yB,GAAS/yB,CAAK;AACjB,mBAAO;AAIT,cAAI+hD,IAAMkD,GAAWjlD,CAAK;AAC1B,iBAAO+hD,KAAOlY,MAAWkY,KAAOjY,MAAUiY,KAAOvY,MAAYuY,KAAO3X;AAAA,QAC1E;AA4BI,iBAASg4B,GAAUpiE,GAAO;AACxB,iBAAO,OAAOA,KAAS,YAAYA,KAASgkD,EAAUhkD,CAAK;AAAA,QACjE;AA4BI,iBAASkoD,GAASloD,GAAO;AACvB,iBAAO,OAAOA,KAAS,YACrBA,IAAQ,MAAMA,IAAQ,KAAK,KAAKA,KAAS+oC;AAAA,QACjD;AA2BI,iBAAShW,GAAS/yB,GAAO;AACvB,cAAI3D,IAAO,OAAO2D;AAClB,iBAAOA,KAAS,SAAS3D,KAAQ,YAAYA,KAAQ;AAAA,QAC3D;AA0BI,iBAASw/C,GAAa77C,GAAO;AAC3B,iBAAOA,KAAS,QAAQ,OAAOA,KAAS;AAAA,QAC9C;AAmBI,YAAI0iD,KAAQ5Q,KAAYuD,GAAUvD,EAAS,IAAIyV;AA8B/C,iBAAS8a,GAAQ1tB,GAAQxxC,GAAQ;AAC/B,iBAAOwxC,MAAWxxC,KAAUqkD,GAAY7S,GAAQxxC,GAAQ2lD,GAAa3lD,CAAM,CAAC;AAAA,QAClF;AAkCI,iBAASm/D,GAAY3tB,GAAQxxC,GAAQu+C,GAAY;AAC/C,iBAAAA,IAAa,OAAOA,KAAc,aAAaA,IAAa3a,GACrDygB,GAAY7S,GAAQxxC,GAAQ2lD,GAAa3lD,CAAM,GAAGu+C,CAAU;AAAA,QACzE;AA8BI,iBAAS6gB,GAAMviE,GAAO;AAIpB,iBAAO+xB,GAAS/xB,CAAK,KAAKA,KAAS,CAACA;AAAA,QAC1C;AA4BI,iBAASwiE,GAASxiE,GAAO;AACvB,cAAI22D,GAAW32D,CAAK;AAClB,kBAAM,IAAI03C,EAAMxQ,CAAe;AAEjC,iBAAO0gB,GAAa5nD,CAAK;AAAA,QAC/B;AAmBI,iBAASyiE,GAAOziE,GAAO;AACrB,iBAAOA,MAAU;AAAA,QACvB;AAsBI,iBAAS0iE,GAAM1iE,GAAO;AACpB,iBAAOA,KAAS;AAAA,QACtB;AA4BI,iBAAS+xB,GAAS/xB,GAAO;AACvB,iBAAO,OAAOA,KAAS,YACpB67C,GAAa77C,CAAK,KAAKilD,GAAWjlD,CAAK,KAAKgqC;AAAA,QACrD;AA8BI,iBAAS4f,GAAc5pD,GAAO;AAC5B,cAAI,CAAC67C,GAAa77C,CAAK,KAAKilD,GAAWjlD,CAAK,KAAKkqC;AAC/C,mBAAO;AAET,cAAIiS,IAAQjD,GAAal5C,CAAK;AAC9B,cAAIm8C,MAAU;AACZ,mBAAO;AAET,cAAIyU,IAAOtY,GAAe,KAAK6D,GAAO,aAAa,KAAKA,EAAM;AAC9D,iBAAO,OAAOyU,KAAQ,cAAcA,aAAgBA,KAClDvY,GAAa,KAAKuY,CAAI,KAAKjY;AAAA,QACnC;AAmBI,YAAIgqB,KAAW5wB,KAAesD,GAAUtD,EAAY,IAAIgW;AA6BxD,iBAAS6a,GAAc5iE,GAAO;AAC5B,iBAAOoiE,GAAUpiE,CAAK,KAAKA,KAAS,CAAC+oC,MAAoB/oC,KAAS+oC;AAAA,QACxE;AAmBI,YAAIyZ,KAAQxQ,KAAYqD,GAAUrD,EAAS,IAAIgW;AAmB/C,iBAASwV,GAASx9D,GAAO;AACvB,iBAAO,OAAOA,KAAS,YACpB,CAAC87C,EAAQ97C,CAAK,KAAK67C,GAAa77C,CAAK,KAAKilD,GAAWjlD,CAAK,KAAKuqC;AAAA,QACxE;AAmBI,iBAASuZ,GAAS9jD,GAAO;AACvB,iBAAO,OAAOA,KAAS,YACpB67C,GAAa77C,CAAK,KAAKilD,GAAWjlD,CAAK,KAAKwqC;AAAA,QACrD;AAmBI,YAAIsV,KAAe7N,KAAmBoD,GAAUpD,EAAgB,IAAIgW;AAmBpE,iBAAS4a,GAAY7iE,GAAO;AAC1B,iBAAOA,MAAU+mC;AAAAA,QACvB;AAmBI,iBAAS+7B,GAAU9iE,GAAO;AACxB,iBAAO67C,GAAa77C,CAAK,KAAKgiD,GAAOhiD,CAAK,KAAK0qC;AAAA,QACrD;AAmBI,iBAASq4B,GAAU/iE,GAAO;AACxB,iBAAO67C,GAAa77C,CAAK,KAAKilD,GAAWjlD,CAAK,KAAK2qC;AAAA,QACzD;AAyBI,YAAIq4B,KAAKnP,GAA0BlL,EAAM,GAyBrCsa,KAAMpP,GAA0B,SAAS7zD,GAAOqlD,GAAO;AACzD,iBAAOrlD,KAASqlD;AAAA,QACtB,CAAK;AAyBD,iBAASgX,GAAQr8D,GAAO;AACtB,cAAI,CAACA;AACH,mBAAO,CAAA;AAET,cAAI6oD,GAAY7oD,CAAK;AACnB,mBAAOw9D,GAASx9D,CAAK,IAAIi3C,GAAcj3C,CAAK,IAAIu8C,GAAUv8C,CAAK;AAEjE,cAAIu5C,MAAev5C,EAAMu5C,EAAW;AAClC,mBAAOjD,GAAgBt2C,EAAMu5C,EAAW,GAAG;AAE7C,cAAIwI,IAAMC,GAAOhiD,CAAK,GAClBmyC,IAAO4P,KAAOhY,KAASyM,KAAcuL,KAAOzX,KAASsM,KAAatD;AAEtE,iBAAOnB,EAAKnyC,CAAK;AAAA,QACvB;AAyBI,iBAAS4zD,GAAS5zD,GAAO;AACvB,cAAI,CAACA;AACH,mBAAOA,MAAU,IAAIA,IAAQ;AAG/B,cADAA,IAAQ8zD,GAAS9zD,CAAK,GAClBA,MAAU8oC,MAAY9oC,MAAU,CAAC8oC,IAAU;AAC7C,gBAAIplC,IAAQ1D,IAAQ,IAAI,KAAK;AAC7B,mBAAO0D,IAAOslC;AAAA,UACtB;AACM,iBAAOhpC,MAAUA,IAAQA,IAAQ;AAAA,QACvC;AA4BI,iBAASgkD,EAAUhkD,GAAO;AACxB,cAAI/C,IAAS22D,GAAS5zD,CAAK,GACvBmX,IAAYla,IAAS;AAEzB,iBAAOA,MAAWA,IAAUka,IAAYla,IAASka,IAAYla,IAAU;AAAA,QAC7E;AA6BI,iBAASgnD,GAASjkD,GAAO;AACvB,iBAAOA,IAAQqgD,GAAU2D,EAAUhkD,CAAK,GAAG,GAAGkpC,EAAgB,IAAI;AAAA,QACxE;AAyBI,iBAAS4qB,GAAS9zD,GAAO;AACvB,cAAI,OAAOA,KAAS;AAClB,mBAAOA;AAET,cAAI8jD,GAAS9jD,CAAK;AAChB,mBAAOipC;AAET,cAAIlW,GAAS/yB,CAAK,GAAG;AACnB,gBAAIqlD,IAAQ,OAAOrlD,EAAM,WAAW,aAAaA,EAAM,QAAO,IAAKA;AACnE,YAAAA,IAAQ+yB,GAASsyB,CAAK,IAAKA,IAAQ,KAAMA;AAAA,UACjD;AACM,cAAI,OAAOrlD,KAAS;AAClB,mBAAOA,MAAU,IAAIA,IAAQ,CAACA;AAEhC,UAAAA,IAAQm1C,GAASn1C,CAAK;AACtB,cAAIkjE,IAAWj2B,GAAW,KAAKjtC,CAAK;AACpC,iBAAQkjE,KAAY/1B,GAAU,KAAKntC,CAAK,IACpCgxC,GAAahxC,EAAM,MAAM,CAAC,GAAGkjE,IAAW,IAAI,CAAC,IAC5Cl2B,GAAW,KAAKhtC,CAAK,IAAIipC,KAAM,CAACjpC;AAAA,QAC3C;AA0BI,iBAAS6pD,GAAc7pD,GAAO;AAC5B,iBAAO+gD,GAAW/gD,GAAOihD,GAAOjhD,CAAK,CAAC;AAAA,QAC5C;AA0BI,iBAASmjE,GAAcnjE,GAAO;AAC5B,iBAAOA,IACHqgD,GAAU2D,EAAUhkD,CAAK,GAAG,CAAC+oC,IAAkBA,EAAgB,IAC9D/oC,MAAU,IAAIA,IAAQ;AAAA,QACjC;AAuBI,iBAAS4tD,GAAS5tD,GAAO;AACvB,iBAAOA,KAAS,OAAO,KAAK2sD,GAAa3sD,CAAK;AAAA,QACpD;AAoCI,YAAIojE,KAAShT,GAAe,SAASzb,GAAQxxC,GAAQ;AACnD,cAAIolD,GAAYplD,CAAM,KAAK0lD,GAAY1lD,CAAM,GAAG;AAC9C,YAAA49C,GAAW59C,GAAQvI,GAAKuI,CAAM,GAAGwxC,CAAM;AACvC;AAAA,UACR;AACM,mBAASh6C,KAAOwI;AACd,YAAIm1C,GAAe,KAAKn1C,GAAQxI,CAAG,KACjC+lD,GAAY/L,GAAQh6C,GAAKwI,EAAOxI,CAAG,CAAC;AAAA,QAG9C,CAAK,GAiCG0oE,KAAWjT,GAAe,SAASzb,GAAQxxC,GAAQ;AACrD,UAAA49C,GAAW59C,GAAQ89C,GAAO99C,CAAM,GAAGwxC,CAAM;AAAA,QAC/C,CAAK,GA+BG2uB,KAAelT,GAAe,SAASzb,GAAQxxC,GAAQimD,GAAU1H,GAAY;AAC/E,UAAAX,GAAW59C,GAAQ89C,GAAO99C,CAAM,GAAGwxC,GAAQ+M,CAAU;AAAA,QAC3D,CAAK,GA8BG6hB,KAAanT,GAAe,SAASzb,GAAQxxC,GAAQimD,GAAU1H,GAAY;AAC7E,UAAAX,GAAW59C,GAAQvI,GAAKuI,CAAM,GAAGwxC,GAAQ+M,CAAU;AAAA,QACzD,CAAK,GAmBG8hB,KAAKzR,GAAS7Q,EAAM;AAoCxB,iBAASuiB,GAAOC,GAAW9xC,GAAY;AACrC,cAAI30B,IAASi/C,GAAWwnB,CAAS;AACjC,iBAAO9xC,KAAc,OAAO30B,IAAS6jD,GAAW7jD,GAAQ20B,CAAU;AAAA,QACxE;AAuBI,YAAI+xC,KAAW5Y,GAAS,SAASpW,GAAQ2b,GAAS;AAChD,UAAA3b,IAASkD,GAAOlD,CAAM;AAEtB,cAAIjsC,IAAQ,IACR+N,IAAS65C,EAAQ,QACjBC,IAAQ95C,IAAS,IAAI65C,EAAQ,CAAC,IAAIvpB;AAMtC,eAJIwpB,KAASC,GAAeF,EAAQ,CAAC,GAAGA,EAAQ,CAAC,GAAGC,CAAK,MACvD95C,IAAS,IAGJ,EAAE/N,IAAQ+N;AAMf,qBALItT,IAASmtD,EAAQ5nD,CAAK,GACtBwsC,IAAQ+L,GAAO99C,CAAM,GACrBygE,IAAa,IACbC,IAAc3uB,EAAM,QAEjB,EAAE0uB,IAAaC,KAAa;AACjC,kBAAIlpE,IAAMu6C,EAAM0uB,CAAU,GACtB5jE,IAAQ20C,EAAOh6C,CAAG;AAEtB,eAAIqF,MAAU+mC,KACTyZ,GAAGxgD,GAAOm4C,GAAYx9C,CAAG,CAAC,KAAK,CAAC29C,GAAe,KAAK3D,GAAQh6C,CAAG,OAClEg6C,EAAOh6C,CAAG,IAAIwI,EAAOxI,CAAG;AAAA,YAEpC;AAGM,iBAAOg6C;AAAA,QACb,CAAK,GAqBGmvB,KAAe/Y,GAAS,SAAS1Y,GAAM;AACzC,iBAAAA,EAAK,KAAKtL,GAAW+tB,EAAmB,GACjC5iB,GAAM6xB,IAAWh9B,GAAWsL,CAAI;AAAA,QAC7C,CAAK;AAqCD,iBAAS2xB,GAAQrvB,GAAQ9B,GAAW;AAClC,iBAAOmB,GAAYW,GAAQsV,EAAYpX,GAAW,CAAC,GAAG4Q,EAAU;AAAA,QACtE;AAqCI,iBAASwgB,GAAYtvB,GAAQ9B,GAAW;AACtC,iBAAOmB,GAAYW,GAAQsV,EAAYpX,GAAW,CAAC,GAAG8Q,EAAe;AAAA,QAC3E;AA8BI,iBAASugB,GAAMvvB,GAAQnC,GAAU;AAC/B,iBAAOmC,KAAU,OACbA,IACA4P,GAAQ5P,GAAQsV,EAAYzX,GAAU,CAAC,GAAGyO,EAAM;AAAA,QAC1D;AA4BI,iBAASkjB,GAAWxvB,GAAQnC,GAAU;AACpC,iBAAOmC,KAAU,OACbA,IACA8P,GAAa9P,GAAQsV,EAAYzX,GAAU,CAAC,GAAGyO,EAAM;AAAA,QAC/D;AA8BI,iBAASmjB,GAAOzvB,GAAQnC,GAAU;AAChC,iBAAOmC,KAAU8O,GAAW9O,GAAQsV,EAAYzX,GAAU,CAAC,CAAC;AAAA,QAClE;AA4BI,iBAAS6xB,GAAY1vB,GAAQnC,GAAU;AACrC,iBAAOmC,KAAUgP,GAAgBhP,GAAQsV,EAAYzX,GAAU,CAAC,CAAC;AAAA,QACvE;AAyBI,iBAAS8xB,GAAU3vB,GAAQ;AACzB,iBAAOA,KAAU,OAAO,CAAA,IAAK+P,GAAc/P,GAAQ/5C,GAAK+5C,CAAM,CAAC;AAAA,QACrE;AAyBI,iBAAS4vB,GAAY5vB,GAAQ;AAC3B,iBAAOA,KAAU,OAAO,CAAA,IAAK+P,GAAc/P,GAAQsM,GAAOtM,CAAM,CAAC;AAAA,QACvE;AA2BI,iBAASpvC,GAAIovC,GAAQ/V,GAAMw0B,GAAc;AACvC,cAAIn2D,IAAS03C,KAAU,OAAO5N,IAAY6d,GAAQjQ,GAAQ/V,CAAI;AAC9D,iBAAO3hC,MAAW8pC,IAAYqsB,IAAen2D;AAAA,QACnD;AA6BI,iBAASunE,GAAI7vB,GAAQ/V,GAAM;AACzB,iBAAO+V,KAAU,QAAQ4hB,GAAQ5hB,GAAQ/V,GAAM0mB,EAAO;AAAA,QAC5D;AA4BI,iBAAS4D,GAAMvU,GAAQ/V,GAAM;AAC3B,iBAAO+V,KAAU,QAAQ4hB,GAAQ5hB,GAAQ/V,GAAM2mB,EAAS;AAAA,QAC9D;AAoBI,YAAIkf,KAASzR,GAAe,SAAS/1D,GAAQ+C,GAAOrF,GAAK;AACvD,UAAIqF,KAAS,QACT,OAAOA,EAAM,YAAY,eAC3BA,IAAQ04C,GAAqB,KAAK14C,CAAK,IAGzC/C,EAAO+C,CAAK,IAAIrF;AAAA,QACtB,GAAO4wD,GAAS1mD,EAAQ,CAAC,GA4BjB6/D,KAAW1R,GAAe,SAAS/1D,GAAQ+C,GAAOrF,GAAK;AACzD,UAAIqF,KAAS,QACT,OAAOA,EAAM,YAAY,eAC3BA,IAAQ04C,GAAqB,KAAK14C,CAAK,IAGrCs4C,GAAe,KAAKr7C,GAAQ+C,CAAK,IACnC/C,EAAO+C,CAAK,EAAE,KAAKrF,CAAG,IAEtBsC,EAAO+C,CAAK,IAAI,CAACrF,CAAG;AAAA,WAErBsvD,CAAW,GAoBV0a,KAAS5Z,GAAS9E,EAAU;AA8BhC,iBAASrrD,GAAK+5C,GAAQ;AACpB,iBAAOkU,GAAYlU,CAAM,IAAI4K,GAAc5K,CAAM,IAAI2T,GAAS3T,CAAM;AAAA,QAC1E;AAyBI,iBAASsM,GAAOtM,GAAQ;AACtB,iBAAOkU,GAAYlU,CAAM,IAAI4K,GAAc5K,GAAQ,EAAI,IAAI6T,GAAW7T,CAAM;AAAA,QAClF;AAuBI,iBAASiwB,GAAQjwB,GAAQnC,GAAU;AACjC,cAAIv1C,IAAS,CAAA;AACb,iBAAAu1C,IAAWyX,EAAYzX,GAAU,CAAC,GAElCiR,GAAW9O,GAAQ,SAAS30C,GAAOrF,GAAKg6C,GAAQ;AAC9C,YAAA8L,GAAgBxjD,GAAQu1C,EAASxyC,GAAOrF,GAAKg6C,CAAM,GAAG30C,CAAK;AAAA,UACnE,CAAO,GACM/C;AAAA,QACb;AA8BI,iBAAS4nE,GAAUlwB,GAAQnC,GAAU;AACnC,cAAIv1C,IAAS,CAAA;AACb,iBAAAu1C,IAAWyX,EAAYzX,GAAU,CAAC,GAElCiR,GAAW9O,GAAQ,SAAS30C,GAAOrF,GAAKg6C,GAAQ;AAC9C,YAAA8L,GAAgBxjD,GAAQtC,GAAK63C,EAASxyC,GAAOrF,GAAKg6C,CAAM,CAAC;AAAA,UACjE,CAAO,GACM13C;AAAA,QACb;AAiCI,YAAI6nE,KAAQ1U,GAAe,SAASzb,GAAQxxC,GAAQimD,GAAU;AAC5D,UAAAD,GAAUxU,GAAQxxC,GAAQimD,CAAQ;AAAA,QACxC,CAAK,GAiCG2a,KAAY3T,GAAe,SAASzb,GAAQxxC,GAAQimD,GAAU1H,GAAY;AAC5E,UAAAyH,GAAUxU,GAAQxxC,GAAQimD,GAAU1H,CAAU;AAAA,QACpD,CAAK,GAsBGqjB,KAAOhT,GAAS,SAASpd,GAAQwM,GAAO;AAC1C,cAAIlkD,IAAS,CAAA;AACb,cAAI03C,KAAU;AACZ,mBAAO13C;AAET,cAAI0kD,IAAS;AACb,UAAAR,IAAQ/N,GAAS+N,GAAO,SAASviB,GAAM;AACrC,mBAAAA,IAAOimB,GAASjmB,GAAM+V,CAAM,GAC5BgN,MAAWA,IAAS/iB,EAAK,SAAS,IAC3BA;AAAA,UACf,CAAO,GACDmiB,GAAWpM,GAAQiO,GAAajO,CAAM,GAAG13C,CAAM,GAC3C0kD,MACF1kD,IAASukD,GAAUvkD,GAAQuqC,IAAkBC,IAAkBC,GAAoBqtB,EAAe;AAGpG,mBADIt+C,IAAS0qC,EAAM,QACZ1qC;AACL,YAAAk0C,GAAU1tD,GAAQkkD,EAAM1qC,CAAM,CAAC;AAEjC,iBAAOxZ;AAAA,QACb,CAAK;AAsBD,iBAAS+nE,GAAOrwB,GAAQ9B,GAAW;AACjC,iBAAOoyB,GAAOtwB,GAAQqpB,GAAO/T,EAAYpX,CAAS,CAAC,CAAC;AAAA,QAC1D;AAmBI,YAAIqyB,KAAOnT,GAAS,SAASpd,GAAQwM,GAAO;AAC1C,iBAAOxM,KAAU,OAAO,CAAA,IAAKyV,GAASzV,GAAQwM,CAAK;AAAA,QACzD,CAAK;AAoBD,iBAAS8jB,GAAOtwB,GAAQ9B,GAAW;AACjC,cAAI8B,KAAU;AACZ,mBAAO,CAAA;AAET,cAAIO,IAAQ9B,GAASwP,GAAajO,CAAM,GAAG,SAAS9R,GAAM;AACxD,mBAAO,CAACA,CAAI;AAAA,UACpB,CAAO;AACD,iBAAAgQ,IAAYoX,EAAYpX,CAAS,GAC1BwX,GAAW1V,GAAQO,GAAO,SAASl1C,GAAO4+B,GAAM;AACrD,mBAAOiU,EAAU7yC,GAAO4+B,EAAK,CAAC,CAAC;AAAA,UACvC,CAAO;AAAA,QACP;AA+BI,iBAAS3hC,GAAO03C,GAAQ/V,GAAMw0B,GAAc;AAC1C,UAAAx0B,IAAOimB,GAASjmB,GAAM+V,CAAM;AAE5B,cAAIjsC,IAAQ,IACR+N,IAASmoB,EAAK;AAOlB,eAJKnoB,MACHA,IAAS,GACTk+B,IAAS5N,IAEJ,EAAEr+B,IAAQ+N,KAAQ;AACvB,gBAAIzW,IAAQ20C,KAAU,OAAO5N,IAAY4N,EAAOmQ,GAAMlmB,EAAKl2B,CAAK,CAAC,CAAC;AAClE,YAAI1I,MAAU+mC,MACZr+B,IAAQ+N,GACRzW,IAAQozD,IAEVze,IAASgQ,GAAW3kD,CAAK,IAAIA,EAAM,KAAK20C,CAAM,IAAI30C;AAAA,UAC1D;AACM,iBAAO20C;AAAA,QACb;AA8BI,iBAAS99B,GAAI89B,GAAQ/V,GAAM5+B,GAAO;AAChC,iBAAO20C,KAAU,OAAOA,IAAS2V,GAAQ3V,GAAQ/V,GAAM5+B,CAAK;AAAA,QAClE;AA0BI,iBAASmlE,GAAQxwB,GAAQ/V,GAAM5+B,GAAO0hD,GAAY;AAChD,iBAAAA,IAAa,OAAOA,KAAc,aAAaA,IAAa3a,GACrD4N,KAAU,OAAOA,IAAS2V,GAAQ3V,GAAQ/V,GAAM5+B,GAAO0hD,CAAU;AAAA,QAC9E;AA0BI,YAAI0jB,KAAU1Q,GAAc95D,EAAI,GA0B5ByqE,KAAY3Q,GAAczT,EAAM;AAgCpC,iBAAS9vC,GAAUwjC,GAAQnC,GAAUC,GAAa;AAChD,cAAIkK,IAAQb,EAAQnH,CAAM,GACtB2wB,IAAY3oB,KAASiD,GAASjL,CAAM,KAAKmL,GAAanL,CAAM;AAGhE,cADAnC,IAAWyX,EAAYzX,GAAU,CAAC,GAC9BC,KAAe,MAAM;AACvB,gBAAIme,IAAOjc,KAAUA,EAAO;AAC5B,YAAI2wB,IACF7yB,IAAckK,IAAQ,IAAIiU,MAAO,CAAA,IAE1B79B,GAAS4hB,CAAM,IACtBlC,IAAckS,GAAWiM,CAAI,IAAI1U,GAAWhD,GAAavE,CAAM,CAAC,IAAI,CAAA,IAGpElC,IAAc,CAAA;AAAA,UAExB;AACM,kBAAC6yB,IAAY5yB,KAAY+Q,IAAY9O,GAAQ,SAAS30C,GAAO0I,GAAOisC,GAAQ;AAC1E,mBAAOnC,EAASC,GAAazyC,GAAO0I,GAAOisC,CAAM;AAAA,UACzD,CAAO,GACMlC;AAAA,QACb;AA6BI,iBAAS8yB,GAAM5wB,GAAQ/V,GAAM;AAC3B,iBAAO+V,KAAU,OAAO,KAAOgW,GAAUhW,GAAQ/V,CAAI;AAAA,QAC3D;AA6BI,iBAAS4mC,GAAO7wB,GAAQ/V,GAAMouB,GAAS;AACrC,iBAAOrY,KAAU,OAAOA,IAASoY,GAAWpY,GAAQ/V,GAAM8uB,GAAaV,CAAO,CAAC;AAAA,QACrF;AA0BI,iBAASyY,GAAW9wB,GAAQ/V,GAAMouB,GAAStL,GAAY;AACrD,iBAAAA,IAAa,OAAOA,KAAc,aAAaA,IAAa3a,GACrD4N,KAAU,OAAOA,IAASoY,GAAWpY,GAAQ/V,GAAM8uB,GAAaV,CAAO,GAAGtL,CAAU;AAAA,QACjG;AA4BI,iBAASpO,GAAOqB,GAAQ;AACtB,iBAAOA,KAAU,OAAO,CAAA,IAAKW,GAAWX,GAAQ/5C,GAAK+5C,CAAM,CAAC;AAAA,QAClE;AA0BI,iBAAS+wB,GAAS/wB,GAAQ;AACxB,iBAAOA,KAAU,OAAO,CAAA,IAAKW,GAAWX,GAAQsM,GAAOtM,CAAM,CAAC;AAAA,QACpE;AAuBI,iBAASgxB,GAAMtkB,GAAQC,GAAOC,GAAO;AACnC,iBAAIA,MAAUxa,MACZwa,IAAQD,GACRA,IAAQva,IAENwa,MAAUxa,MACZwa,IAAQuS,GAASvS,CAAK,GACtBA,IAAQA,MAAUA,IAAQA,IAAQ,IAEhCD,MAAUva,MACZua,IAAQwS,GAASxS,CAAK,GACtBA,IAAQA,MAAUA,IAAQA,IAAQ,IAE7BjB,GAAUyT,GAASzS,CAAM,GAAGC,GAAOC,CAAK;AAAA,QACrD;AAwCI,iBAASqkB,GAAQvkB,GAAQ77C,GAAO6D,GAAK;AACnC,iBAAA7D,IAAQouD,GAASpuD,CAAK,GAClB6D,MAAQ09B,KACV19B,IAAM7D,GACNA,IAAQ,KAER6D,IAAMuqD,GAASvqD,CAAG,GAEpBg4C,IAASyS,GAASzS,CAAM,GACjBmE,GAAYnE,GAAQ77C,GAAO6D,CAAG;AAAA,QAC3C;AAiCI,iBAASw8D,GAAOvkB,GAAOC,GAAOukB,GAAU;AA2BtC,cA1BIA,KAAY,OAAOA,KAAY,aAAatV,GAAelP,GAAOC,GAAOukB,CAAQ,MACnFvkB,IAAQukB,IAAW/+B,IAEjB++B,MAAa/+B,MACX,OAAOwa,KAAS,aAClBukB,IAAWvkB,GACXA,IAAQxa,KAED,OAAOua,KAAS,cACvBwkB,IAAWxkB,GACXA,IAAQva,KAGRua,MAAUva,KAAawa,MAAUxa,KACnCua,IAAQ,GACRC,IAAQ,MAGRD,IAAQsS,GAAStS,CAAK,GAClBC,MAAUxa,KACZwa,IAAQD,GACRA,IAAQ,KAERC,IAAQqS,GAASrS,CAAK,IAGtBD,IAAQC,GAAO;AACjB,gBAAIjnC,IAAOgnC;AACX,YAAAA,IAAQC,GACRA,IAAQjnC;AAAA,UAChB;AACM,cAAIwrD,KAAYxkB,IAAQ,KAAKC,IAAQ,GAAG;AACtC,gBAAIoW,IAAOld,GAAY;AACvB,mBAAOH,GAAUgH,IAASqW,KAAQpW,IAAQD,IAAQvQ,GAAe,UAAU4mB,IAAO,IAAI,SAAS,EAAE,IAAKpW,CAAK;AAAA,UACnH;AACM,iBAAOrB,GAAWoB,GAAOC,CAAK;AAAA,QACpC;AAwBI,YAAIwkB,KAAY5U,GAAiB,SAASl0D,GAAQ+oE,GAAMt9D,GAAO;AAC7D,iBAAAs9D,IAAOA,EAAK,YAAW,GAChB/oE,KAAUyL,IAAQu9D,GAAWD,CAAI,IAAIA;AAAA,QAClD,CAAK;AAiBD,iBAASC,GAAWnyB,GAAQ;AAC1B,iBAAOoyB,GAAWtY,GAAS9Z,CAAM,EAAE,YAAW,CAAE;AAAA,QACtD;AAoBI,iBAASud,GAAOvd,GAAQ;AACtB,iBAAAA,IAAS8Z,GAAS9Z,CAAM,GACjBA,KAAUA,EAAO,QAAQzG,IAAS0I,EAAY,EAAE,QAAQ7F,IAAa,EAAE;AAAA,QACpF;AAyBI,iBAASi2B,GAASryB,GAAQsyB,GAAQC,GAAU;AAC1C,UAAAvyB,IAAS8Z,GAAS9Z,CAAM,GACxBsyB,IAASzZ,GAAayZ,CAAM;AAE5B,cAAI3vD,IAASq9B,EAAO;AACpB,UAAAuyB,IAAWA,MAAat/B,IACpBtwB,IACA4pC,GAAU2D,EAAUqiB,CAAQ,GAAG,GAAG5vD,CAAM;AAE5C,cAAIpN,IAAMg9D;AACV,iBAAAA,KAAYD,EAAO,QACZC,KAAY,KAAKvyB,EAAO,MAAMuyB,GAAUh9D,CAAG,KAAK+8D;AAAA,QAC7D;AA8BI,iBAASE,GAAOxyB,GAAQ;AACtB,iBAAAA,IAAS8Z,GAAS9Z,CAAM,GAChBA,KAAUjI,GAAmB,KAAKiI,CAAM,IAC5CA,EAAO,QAAQnI,IAAiBqK,EAAc,IAC9ClC;AAAA,QACV;AAiBI,iBAASyyB,GAAazyB,GAAQ;AAC5B,iBAAAA,IAAS8Z,GAAS9Z,CAAM,GAChBA,KAAUzH,GAAgB,KAAKyH,CAAM,IACzCA,EAAO,QAAQ1H,IAAc,MAAM,IACnC0H;AAAA,QACV;AAuBI,YAAI0yB,KAAYrV,GAAiB,SAASl0D,GAAQ+oE,GAAMt9D,GAAO;AAC7D,iBAAOzL,KAAUyL,IAAQ,MAAM,MAAMs9D,EAAK,YAAW;AAAA,QAC3D,CAAK,GAsBGS,KAAYtV,GAAiB,SAASl0D,GAAQ+oE,GAAMt9D,GAAO;AAC7D,iBAAOzL,KAAUyL,IAAQ,MAAM,MAAMs9D,EAAK,YAAW;AAAA,QAC3D,CAAK,GAmBGU,KAAa1V,GAAgB,aAAa;AAyB9C,iBAAS2V,GAAI7yB,GAAQr9B,GAAQ+8C,GAAO;AAClC,UAAA1f,IAAS8Z,GAAS9Z,CAAM,GACxBr9B,IAASutC,EAAUvtC,CAAM;AAEzB,cAAImwD,IAAYnwD,IAASsgC,GAAWjD,CAAM,IAAI;AAC9C,cAAI,CAACr9B,KAAUmwD,KAAanwD;AAC1B,mBAAOq9B;AAET,cAAIxS,KAAO7qB,IAASmwD,KAAa;AACjC,iBACErT,GAAcxZ,GAAYzY,CAAG,GAAGkyB,CAAK,IACrC1f,IACAyf,GAAczZ,GAAWxY,CAAG,GAAGkyB,CAAK;AAAA,QAE5C;AAyBI,iBAASqT,GAAO/yB,GAAQr9B,GAAQ+8C,GAAO;AACrC,UAAA1f,IAAS8Z,GAAS9Z,CAAM,GACxBr9B,IAASutC,EAAUvtC,CAAM;AAEzB,cAAImwD,IAAYnwD,IAASsgC,GAAWjD,CAAM,IAAI;AAC9C,iBAAQr9B,KAAUmwD,IAAYnwD,IACzBq9B,IAASyf,GAAc98C,IAASmwD,GAAWpT,CAAK,IACjD1f;AAAA,QACV;AAyBI,iBAASgzB,GAAShzB,GAAQr9B,GAAQ+8C,GAAO;AACvC,UAAA1f,IAAS8Z,GAAS9Z,CAAM,GACxBr9B,IAASutC,EAAUvtC,CAAM;AAEzB,cAAImwD,IAAYnwD,IAASsgC,GAAWjD,CAAM,IAAI;AAC9C,iBAAQr9B,KAAUmwD,IAAYnwD,IACzB88C,GAAc98C,IAASmwD,GAAWpT,CAAK,IAAI1f,IAC5CA;AAAA,QACV;AA0BI,iBAASizB,GAASjzB,GAAQkzB,GAAOzW,GAAO;AACtC,iBAAIA,KAASyW,KAAS,OACpBA,IAAQ,IACCA,MACTA,IAAQ,CAACA,IAEJxsB,GAAeoT,GAAS9Z,CAAM,EAAE,QAAQxH,IAAa,EAAE,GAAG06B,KAAS,CAAC;AAAA,QACjF;AAwBI,iBAASC,GAAOnzB,GAAQzuC,GAAGkrD,GAAO;AAChC,kBAAKA,IAAQC,GAAe1c,GAAQzuC,GAAGkrD,CAAK,IAAIlrD,MAAM0hC,KACpD1hC,IAAI,IAEJA,IAAI2+C,EAAU3+C,CAAC,GAEVylD,GAAW8C,GAAS9Z,CAAM,GAAGzuC,CAAC;AAAA,QAC3C;AAqBI,iBAAS6hE,KAAU;AACjB,cAAI70B,IAAO,WACPyB,IAAS8Z,GAASvb,EAAK,CAAC,CAAC;AAE7B,iBAAOA,EAAK,SAAS,IAAIyB,IAASA,EAAO,QAAQzB,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,QACvE;AAuBI,YAAI80B,KAAYhW,GAAiB,SAASl0D,GAAQ+oE,GAAMt9D,GAAO;AAC7D,iBAAOzL,KAAUyL,IAAQ,MAAM,MAAMs9D,EAAK,YAAW;AAAA,QAC3D,CAAK;AAqBD,iBAASxqE,GAAMs4C,GAAQslB,GAAWgO,GAAO;AAKvC,iBAJIA,KAAS,OAAOA,KAAS,YAAY5W,GAAe1c,GAAQslB,GAAWgO,CAAK,MAC9EhO,IAAYgO,IAAQrgC,IAEtBqgC,IAAQA,MAAUrgC,IAAYmC,KAAmBk+B,MAAU,GACtDA,KAGLtzB,IAAS8Z,GAAS9Z,CAAM,GACpBA,MACE,OAAOslB,KAAa,YACnBA,KAAa,QAAQ,CAACuJ,GAASvJ,CAAS,OAE7CA,IAAYzM,GAAayM,CAAS,GAC9B,CAACA,KAAahjB,GAAWtC,CAAM,KAC1Bga,GAAU7W,GAAcnD,CAAM,GAAG,GAAGszB,CAAK,IAG7CtzB,EAAO,MAAMslB,GAAWgO,CAAK,KAZ3B,CAAA;AAAA,QAaf;AAuBI,YAAIC,KAAYlW,GAAiB,SAASl0D,GAAQ+oE,GAAMt9D,GAAO;AAC7D,iBAAOzL,KAAUyL,IAAQ,MAAM,MAAMw9D,GAAWF,CAAI;AAAA,QAC1D,CAAK;AAyBD,iBAASsB,GAAWxzB,GAAQsyB,GAAQC,GAAU;AAC5C,iBAAAvyB,IAAS8Z,GAAS9Z,CAAM,GACxBuyB,IAAWA,KAAY,OACnB,IACAhmB,GAAU2D,EAAUqiB,CAAQ,GAAG,GAAGvyB,EAAO,MAAM,GAEnDsyB,IAASzZ,GAAayZ,CAAM,GACrBtyB,EAAO,MAAMuyB,GAAUA,IAAWD,EAAO,MAAM,KAAKA;AAAA,QACjE;AA0GI,iBAASmB,GAASzzB,GAAQ9sC,GAASupD,GAAO;AAIxC,cAAIiX,IAAW5rB,EAAO;AAEtB,UAAI2U,KAASC,GAAe1c,GAAQ9sC,GAASupD,CAAK,MAChDvpD,IAAU+/B,IAEZ+M,IAAS8Z,GAAS9Z,CAAM,GACxB9sC,IAAUs8D,GAAa,CAAA,GAAIt8D,GAASwgE,GAAU3S,EAAsB;AAEpE,cAAI4S,IAAUnE,GAAa,IAAIt8D,EAAQ,SAASwgE,EAAS,SAAS3S,EAAsB,GACpF6S,IAAc9sE,GAAK6sE,CAAO,GAC1BE,IAAgBryB,GAAWmyB,GAASC,CAAW,GAE/CE,GACAC,GACAn/D,IAAQ,GACRo/D,IAAc9gE,EAAQ,eAAesmC,IACrCnqC,IAAS,YAGT4kE,IAAejwB;AAAA,aAChB9wC,EAAQ,UAAUsmC,IAAW,SAAS,MACvCw6B,EAAY,SAAS,OACpBA,MAAgB97B,KAAgBc,KAAeQ,IAAW,SAAS,OACnEtmC,EAAQ,YAAYsmC,IAAW,SAAS;AAAA,YACzC;AAAA,UAAG,GAMD06B,IAAY,oBACb1vB,GAAe,KAAKtxC,GAAS,WAAW,KACpCA,EAAQ,YAAY,IAAI,QAAQ,OAAO,GAAG,IAC1C,4BAA6B,EAAEwpC,KAAmB,OACnD;AAAA;AAEN,UAAAsD,EAAO,QAAQi0B,GAAc,SAASttE,GAAOwtE,IAAaC,IAAkBC,IAAiBC,IAAer+D,IAAQ;AAClH,mBAAAm+D,OAAqBA,KAAmBC,KAGxChlE,KAAU2wC,EAAO,MAAMprC,GAAOqB,EAAM,EAAE,QAAQwjC,IAAmB0I,EAAgB,GAG7EgyB,OACFL,IAAa,IACbzkE,KAAU;AAAA,QAAc8kE,KAAc;AAAA,KAEpCG,OACFP,IAAe,IACf1kE,KAAU;AAAA,IAASilE,KAAgB;AAAA,YAEjCF,OACF/kE,KAAU;AAAA,aAAmB+kE,KAAmB;AAAA,KAElDx/D,IAAQqB,KAAStP,EAAM,QAIhBA;AAAA,UACf,CAAO,GAED0I,KAAU;AAAA;AAIV,cAAIklE,IAAW/vB,GAAe,KAAKtxC,GAAS,UAAU,KAAKA,EAAQ;AACnE,cAAI,CAACqhE;AACH,YAAAllE,IAAS;AAAA,IAAmBA,IAAS;AAAA;AAAA;AAAA,mBAI9BypC,GAA2B,KAAKy7B,CAAQ;AAC/C,kBAAM,IAAI3wB,EAAMtQ,CAA4B;AAI9C,UAAAjkC,KAAU0kE,IAAe1kE,EAAO,QAAQooC,IAAsB,EAAE,IAAIpoC,GACjE,QAAQqoC,IAAqB,IAAI,EACjC,QAAQC,IAAuB,KAAK,GAGvCtoC,IAAS,eAAeklE,KAAY,SAAS;AAAA,KAC1CA,IACG,KACA;AAAA,KAEJ,uBACCT,IACI,qBACA,OAEJC,IACG;AAAA;AAAA,IAEA;AAAA,KAEJ1kE,IACA;AAAA;AAEF,cAAIlG,IAASqrE,GAAQ,WAAW;AAC9B,mBAAO3wB,GAAS+vB,GAAaM,IAAY,YAAY7kE,CAAM,EACxD,MAAM4jC,GAAW4gC,CAAa;AAAA,UACzC,CAAO;AAKD,cADA1qE,EAAO,SAASkG,GACZ++D,GAAQjlE,CAAM;AAChB,kBAAMA;AAER,iBAAOA;AAAA,QACb;AAuBI,iBAASsrE,GAAQvoE,GAAO;AACtB,iBAAO4tD,GAAS5tD,CAAK,EAAE,YAAW;AAAA,QACxC;AAuBI,iBAASwoE,GAAQxoE,GAAO;AACtB,iBAAO4tD,GAAS5tD,CAAK,EAAE,YAAW;AAAA,QACxC;AAwBI,iBAASyoE,GAAK30B,GAAQ0f,GAAOjD,GAAO;AAElC,cADAzc,IAAS8Z,GAAS9Z,CAAM,GACpBA,MAAWyc,KAASiD,MAAUzsB;AAChC,mBAAOoO,GAASrB,CAAM;AAExB,cAAI,CAACA,KAAU,EAAE0f,IAAQ7G,GAAa6G,CAAK;AACzC,mBAAO1f;AAET,cAAI4B,IAAauB,GAAcnD,CAAM,GACjC6B,IAAasB,GAAcuc,CAAK,GAChChuD,IAAQiwC,GAAgBC,GAAYC,CAAU,GAC9CtsC,IAAMusC,GAAcF,GAAYC,CAAU,IAAI;AAElD,iBAAOmY,GAAUpY,GAAYlwC,GAAO6D,CAAG,EAAE,KAAK,EAAE;AAAA,QACtD;AAqBI,iBAASq/D,GAAQ50B,GAAQ0f,GAAOjD,GAAO;AAErC,cADAzc,IAAS8Z,GAAS9Z,CAAM,GACpBA,MAAWyc,KAASiD,MAAUzsB;AAChC,mBAAO+M,EAAO,MAAM,GAAGsB,GAAgBtB,CAAM,IAAI,CAAC;AAEpD,cAAI,CAACA,KAAU,EAAE0f,IAAQ7G,GAAa6G,CAAK;AACzC,mBAAO1f;AAET,cAAI4B,IAAauB,GAAcnD,CAAM,GACjCzqC,IAAMusC,GAAcF,GAAYuB,GAAcuc,CAAK,CAAC,IAAI;AAE5D,iBAAO1F,GAAUpY,GAAY,GAAGrsC,CAAG,EAAE,KAAK,EAAE;AAAA,QAClD;AAqBI,iBAASs/D,GAAU70B,GAAQ0f,GAAOjD,GAAO;AAEvC,cADAzc,IAAS8Z,GAAS9Z,CAAM,GACpBA,MAAWyc,KAASiD,MAAUzsB;AAChC,mBAAO+M,EAAO,QAAQxH,IAAa,EAAE;AAEvC,cAAI,CAACwH,KAAU,EAAE0f,IAAQ7G,GAAa6G,CAAK;AACzC,mBAAO1f;AAET,cAAI4B,IAAauB,GAAcnD,CAAM,GACjCtuC,IAAQiwC,GAAgBC,GAAYuB,GAAcuc,CAAK,CAAC;AAE5D,iBAAO1F,GAAUpY,GAAYlwC,CAAK,EAAE,KAAK,EAAE;AAAA,QACjD;AAuCI,iBAAS8/B,GAASwO,GAAQ9sC,GAAS;AACjC,cAAIyP,IAAS8xB,IACTqgC,IAAWpgC;AAEf,cAAIzV,GAAS/rB,CAAO,GAAG;AACrB,gBAAIoyD,IAAY,eAAepyD,IAAUA,EAAQ,YAAYoyD;AAC7D,YAAA3iD,IAAS,YAAYzP,IAAUg9C,EAAUh9C,EAAQ,MAAM,IAAIyP,GAC3DmyD,IAAW,cAAc5hE,IAAU2lD,GAAa3lD,EAAQ,QAAQ,IAAI4hE;AAAA,UAC5E;AACM,UAAA90B,IAAS8Z,GAAS9Z,CAAM;AAExB,cAAI8yB,IAAY9yB,EAAO;AACvB,cAAIsC,GAAWtC,CAAM,GAAG;AACtB,gBAAI4B,IAAauB,GAAcnD,CAAM;AACrC,YAAA8yB,IAAYlxB,EAAW;AAAA,UAC/B;AACM,cAAIj/B,KAAUmwD;AACZ,mBAAO9yB;AAET,cAAIzqC,IAAMoN,IAASsgC,GAAW6xB,CAAQ;AACtC,cAAIv/D,IAAM;AACR,mBAAOu/D;AAET,cAAI3rE,IAASy4C,IACToY,GAAUpY,GAAY,GAAGrsC,CAAG,EAAE,KAAK,EAAE,IACrCyqC,EAAO,MAAM,GAAGzqC,CAAG;AAEvB,cAAI+vD,MAAcryB;AAChB,mBAAO9pC,IAAS2rE;AAKlB,cAHIlzB,MACFrsC,KAAQpM,EAAO,SAASoM,IAEtBs5D,GAASvJ,CAAS;AACpB,gBAAItlB,EAAO,MAAMzqC,CAAG,EAAE,OAAO+vD,CAAS,GAAG;AACvC,kBAAI3+D,GACAouE,IAAY5rE;AAMhB,mBAJKm8D,EAAU,WACbA,IAAYthB,GAAOshB,EAAU,QAAQxL,GAAS7gB,GAAQ,KAAKqsB,CAAS,CAAC,IAAI,GAAG,IAE9EA,EAAU,YAAY,GACd3+D,IAAQ2+D,EAAU,KAAKyP,CAAS;AACtC,oBAAIC,IAASruE,EAAM;AAErB,cAAAwC,IAASA,EAAO,MAAM,GAAG6rE,MAAW/hC,IAAY19B,IAAMy/D,CAAM;AAAA,YACtE;AAAA,qBACiBh1B,EAAO,QAAQ6Y,GAAayM,CAAS,GAAG/vD,CAAG,KAAKA,GAAK;AAC9D,gBAAIX,IAAQzL,EAAO,YAAYm8D,CAAS;AACxC,YAAI1wD,IAAQ,OACVzL,IAASA,EAAO,MAAM,GAAGyL,CAAK;AAAA,UAExC;AACM,iBAAOzL,IAAS2rE;AAAA,QACtB;AAqBI,iBAASG,GAASj1B,GAAQ;AACxB,iBAAAA,IAAS8Z,GAAS9Z,CAAM,GAChBA,KAAUlI,GAAiB,KAAKkI,CAAM,IAC1CA,EAAO,QAAQpI,IAAeyL,EAAgB,IAC9CrD;AAAA,QACV;AAsBI,YAAIk1B,KAAY7X,GAAiB,SAASl0D,GAAQ+oE,GAAMt9D,GAAO;AAC7D,iBAAOzL,KAAUyL,IAAQ,MAAM,MAAMs9D,EAAK,YAAW;AAAA,QAC3D,CAAK,GAmBGE,KAAalV,GAAgB,aAAa;AAqB9C,iBAASI,GAAMtd,GAAQgU,GAASyI,GAAO;AAIrC,iBAHAzc,IAAS8Z,GAAS9Z,CAAM,GACxBgU,IAAUyI,IAAQxpB,IAAY+gB,GAE1BA,MAAY/gB,IACPsP,GAAevC,CAAM,IAAIsD,GAAatD,CAAM,IAAIC,GAAWD,CAAM,IAEnEA,EAAO,MAAMgU,CAAO,KAAK,CAAA;AAAA,QACtC;AA0BI,YAAIwgB,KAAUvd,GAAS,SAAS5Y,GAAME,GAAM;AAC1C,cAAI;AACF,mBAAOH,GAAMC,GAAMpL,GAAWsL,CAAI;AAAA,mBAC3BlsC,GAAG;AACV,mBAAO+7D,GAAQ/7D,CAAC,IAAIA,IAAI,IAAIuxC,EAAMvxC,CAAC;AAAA,UAC3C;AAAA,QACA,CAAK,GA4BG8iE,KAAUlX,GAAS,SAASpd,GAAQu0B,GAAa;AACnD,iBAAAx2B,GAAUw2B,GAAa,SAASvuE,GAAK;AACnC,YAAAA,IAAMmqD,GAAMnqD,CAAG,GACf8lD,GAAgB9L,GAAQh6C,GAAK8jE,GAAK9pB,EAAOh6C,CAAG,GAAGg6C,CAAM,CAAC;AAAA,UAC9D,CAAO,GACMA;AAAA,QACb,CAAK;AA+BD,iBAASw0B,GAAK7pB,GAAO;AACnB,cAAI7oC,IAAS6oC,KAAS,OAAO,IAAIA,EAAM,QACnC2T,IAAahJ,EAAW;AAE5B,iBAAA3K,IAAS7oC,IAAc28B,GAASkM,GAAO,SAASkV,GAAM;AACpD,gBAAI,OAAOA,EAAK,CAAC,KAAK;AACpB,oBAAM,IAAIxc,GAAU7Q,CAAe;AAErC,mBAAO,CAAC8rB,EAAWuB,EAAK,CAAC,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,UAC5C,CAAO,IALiB,CAAA,GAOXzJ,GAAS,SAAS1Y,GAAM;AAE7B,qBADI3pC,IAAQ,IACL,EAAEA,IAAQ+N,KAAQ;AACvB,kBAAI+9C,IAAOlV,EAAM52C,CAAK;AACtB,kBAAIwpC,GAAMsiB,EAAK,CAAC,GAAG,MAAMniB,CAAI;AAC3B,uBAAOH,GAAMsiB,EAAK,CAAC,GAAG,MAAMniB,CAAI;AAAA,YAE5C;AAAA,UACA,CAAO;AAAA,QACP;AA0BI,iBAAS+2B,GAASjmE,GAAQ;AACxB,iBAAO2/C,GAAatB,GAAUr+C,GAAQqkC,CAAe,CAAC;AAAA,QAC5D;AAqBI,iBAAS+jB,GAASvrD,GAAO;AACvB,iBAAO,WAAW;AAChB,mBAAOA;AAAA;QAEf;AAsBI,iBAASqpE,GAAUrpE,GAAOozD,GAAc;AACtC,iBAAQpzD,KAAS,QAAQA,MAAUA,IAASozD,IAAepzD;AAAA,QACjE;AAwBI,YAAIspE,KAAOxX,GAAU,GAuBjByX,KAAYzX,GAAW,EAAI;AAkB/B,iBAASjtD,GAAS7E,GAAO;AACvB,iBAAOA;AAAA,QACb;AA4CI,iBAASwyC,GAASL,GAAM;AACtB,iBAAOgW,GAAa,OAAOhW,KAAQ,aAAaA,IAAOqP,GAAUrP,GAAM3K,CAAe,CAAC;AAAA,QAC7F;AAqCI,iBAASgiC,GAAQrmE,GAAQ;AACvB,iBAAOklD,GAAY7G,GAAUr+C,GAAQqkC,CAAe,CAAC;AAAA,QAC3D;AAmCI,iBAASiiC,GAAgB7qC,GAAM+oB,GAAU;AACvC,iBAAOS,GAAoBxpB,GAAM4iB,GAAUmG,GAAUngB,CAAe,CAAC;AAAA,QAC3E;AA0BI,YAAIkiC,KAAS3e,GAAS,SAASnsB,GAAMyT,GAAM;AACzC,iBAAO,SAASsC,GAAQ;AACtB,mBAAOsR,GAAWtR,GAAQ/V,GAAMyT,CAAI;AAAA;QAE5C,CAAK,GAyBGs3B,KAAW5e,GAAS,SAASpW,GAAQtC,GAAM;AAC7C,iBAAO,SAASzT,GAAM;AACpB,mBAAOqnB,GAAWtR,GAAQ/V,GAAMyT,CAAI;AAAA;QAE5C,CAAK;AAsCD,iBAASu3B,GAAMj1B,GAAQxxC,GAAQ6D,GAAS;AACtC,cAAIkuC,IAAQt6C,GAAKuI,CAAM,GACnB+lE,IAAcxkB,GAAcvhD,GAAQ+xC,CAAK;AAE7C,UAAIluC,KAAW,QACX,EAAE+rB,GAAS5vB,CAAM,MAAM+lE,EAAY,UAAU,CAACh0B,EAAM,aACtDluC,IAAU7D,GACVA,IAASwxC,GACTA,IAAS,MACTu0B,IAAcxkB,GAAcvhD,GAAQvI,GAAKuI,CAAM,CAAC;AAElD,cAAI04D,IAAQ,EAAE9oC,GAAS/rB,CAAO,KAAK,WAAWA,MAAY,CAAC,CAACA,EAAQ,OAChEi7C,IAAS0C,GAAWhQ,CAAM;AAE9B,iBAAAjC,GAAUw2B,GAAa,SAASjY,GAAY;AAC1C,gBAAI9e,IAAOhvC,EAAO8tD,CAAU;AAC5B,YAAAtc,EAAOsc,CAAU,IAAI9e,GACjB8P,MACFtN,EAAO,UAAUsc,CAAU,IAAI,WAAW;AACxC,kBAAI5U,IAAW,KAAK;AACpB,kBAAIwf,KAASxf,GAAU;AACrB,oBAAIp/C,IAAS03C,EAAO,KAAK,WAAW,GAChCwY,IAAUlwD,EAAO,cAAcs/C,GAAU,KAAK,WAAW;AAE7D,uBAAA4Q,EAAQ,KAAK,EAAE,MAAQhb,GAAM,MAAQ,WAAW,SAAWwC,GAAQ,GACnE13C,EAAO,YAAYo/C,GACZp/C;AAAA,cACrB;AACY,qBAAOk1C,EAAK,MAAMwC,GAAQtB,GAAU,CAAC,KAAK,MAAK,CAAE,GAAG,SAAS,CAAC;AAAA;UAG1E,CAAO,GAEMsB;AAAA,QACb;AAeI,iBAASk1B,KAAa;AACpB,iBAAIrrE,GAAK,MAAM,SACbA,GAAK,IAAIo6C,KAEJ;AAAA,QACb;AAcI,iBAAS6b,KAAO;AAAA,QAEpB;AAsBI,iBAASqV,GAAOzkE,GAAG;AACjB,iBAAAA,IAAI2+C,EAAU3+C,CAAC,GACR0lD,GAAS,SAAS1Y,GAAM;AAC7B,mBAAOyX,GAAQzX,GAAMhtC,CAAC;AAAA,UAC9B,CAAO;AAAA,QACP;AAoBI,YAAI0kE,KAAO1W,GAAWjgB,EAAQ,GA8B1B42B,KAAY3W,GAAWzgB,EAAU,GAiCjCq3B,KAAW5W,GAAW3f,EAAS;AAwBnC,iBAAStwC,GAASw7B,GAAM;AACtB,iBAAOoqB,GAAMpqB,CAAI,IAAIgV,GAAakR,GAAMlmB,CAAI,CAAC,IAAI2rB,GAAiB3rB,CAAI;AAAA,QAC5E;AAuBI,iBAASsrC,GAAWv1B,GAAQ;AAC1B,iBAAO,SAAS/V,GAAM;AACpB,mBAAO+V,KAAU,OAAO5N,IAAY6d,GAAQjQ,GAAQ/V,CAAI;AAAA;QAEhE;AA2CI,YAAIurC,KAAQxW,GAAW,GAsCnByW,KAAazW,GAAY,EAAI;AAoBjC,iBAASwC,KAAY;AACnB,iBAAO,CAAA;AAAA,QACb;AAeI,iBAASS,KAAY;AACnB,iBAAO;AAAA,QACb;AAoBI,iBAASyT,KAAa;AACpB,iBAAO,CAAA;AAAA,QACb;AAeI,iBAASC,KAAa;AACpB,iBAAO;AAAA,QACb;AAeI,iBAASC,KAAW;AAClB,iBAAO;AAAA,QACb;AAqBI,iBAASC,GAAMnlE,GAAGmtC,GAAU;AAE1B,cADAntC,IAAI2+C,EAAU3+C,CAAC,GACXA,IAAI,KAAKA,IAAI0jC;AACf,mBAAO,CAAA;AAET,cAAIrgC,IAAQwgC,IACRzyB,IAAS6jC,GAAUj1C,GAAG6jC,EAAgB;AAE1C,UAAAsJ,IAAWyX,EAAYzX,CAAQ,GAC/BntC,KAAK6jC;AAGL,mBADIjsC,IAAS+3C,GAAUv+B,GAAQ+7B,CAAQ,GAChC,EAAE9pC,IAAQrD;AACf,YAAAmtC,EAAS9pC,CAAK;AAEhB,iBAAOzL;AAAA,QACb;AAmBI,iBAASwtE,GAAOzqE,GAAO;AACrB,iBAAI87C,EAAQ97C,CAAK,IACRozC,GAASpzC,GAAO8kD,EAAK,IAEvBhB,GAAS9jD,CAAK,IAAI,CAACA,CAAK,IAAIu8C,GAAUoR,GAAaC,GAAS5tD,CAAK,CAAC,CAAC;AAAA,QAChF;AAmBI,iBAAS0qE,GAASC,GAAQ;AACxB,cAAInuE,IAAK,EAAE+7C;AACX,iBAAOqV,GAAS+c,CAAM,IAAInuE;AAAA,QAChC;AAmBI,YAAI0I,KAAMguD,GAAoB,SAAS0X,GAAQC,GAAQ;AACrD,iBAAOD,IAASC;AAAA,WACf,CAAC,GAuBAC,KAAOvW,GAAY,MAAM,GAiBzBwW,KAAS7X,GAAoB,SAAS8X,GAAUC,GAAS;AAC3D,iBAAOD,IAAWC;AAAA,WACjB,CAAC,GAuBAC,KAAQ3W,GAAY,OAAO;AAoB/B,iBAAS4W,GAAIr6D,GAAO;AAClB,iBAAQA,KAASA,EAAM,SACnB+yC,GAAa/yC,GAAOjM,IAAUugD,EAAM,IACpCre;AAAAA,QACV;AAyBI,iBAASqkC,GAAMt6D,GAAO0hC,GAAU;AAC9B,iBAAQ1hC,KAASA,EAAM,SACnB+yC,GAAa/yC,GAAOm5C,EAAYzX,GAAU,CAAC,GAAG4S,EAAM,IACpDre;AAAAA,QACV;AAgBI,iBAASskC,GAAKv6D,GAAO;AACnB,iBAAO2jC,GAAS3jC,GAAOjM,EAAQ;AAAA,QACrC;AAyBI,iBAASymE,GAAOx6D,GAAO0hC,GAAU;AAC/B,iBAAOiC,GAAS3jC,GAAOm5C,EAAYzX,GAAU,CAAC,CAAC;AAAA,QACrD;AAoBI,iBAAS+4B,GAAIz6D,GAAO;AAClB,iBAAQA,KAASA,EAAM,SACnB+yC,GAAa/yC,GAAOjM,IAAU8jD,EAAM,IACpC5hB;AAAAA,QACV;AAyBI,iBAASykC,GAAM16D,GAAO0hC,GAAU;AAC9B,iBAAQ1hC,KAASA,EAAM,SACnB+yC,GAAa/yC,GAAOm5C,EAAYzX,GAAU,CAAC,GAAGmW,EAAM,IACpD5hB;AAAAA,QACV;AAiBI,YAAI0kC,KAAWvY,GAAoB,SAASwY,GAAYC,GAAc;AACpE,iBAAOD,IAAaC;AAAA,WACnB,CAAC,GAuBAC,KAAQrX,GAAY,OAAO,GAiB3BsX,KAAW3Y,GAAoB,SAAS4Y,GAASC,GAAY;AAC/D,iBAAOD,IAAUC;AAAA,WAChB,CAAC;AAgBJ,iBAASj2C,GAAIhlB,GAAO;AAClB,iBAAQA,KAASA,EAAM,SACnB4jC,GAAQ5jC,GAAOjM,EAAQ,IACvB;AAAA,QACV;AAyBI,iBAASmnE,GAAMl7D,GAAO0hC,GAAU;AAC9B,iBAAQ1hC,KAASA,EAAM,SACnB4jC,GAAQ5jC,GAAOm5C,EAAYzX,GAAU,CAAC,CAAC,IACvC;AAAA,QACV;AAKI,eAAAoJ,EAAO,QAAQ2iB,IACf3iB,EAAO,MAAM6W,IACb7W,EAAO,SAASwnB,IAChBxnB,EAAO,WAAWynB,IAClBznB,EAAO,eAAe0nB,IACtB1nB,EAAO,aAAa2nB,IACpB3nB,EAAO,KAAK4nB,IACZ5nB,EAAO,SAAS4iB,IAChB5iB,EAAO,OAAO6iB,IACd7iB,EAAO,UAAUqtB,IACjBrtB,EAAO,UAAU8iB,IACjB9iB,EAAO,YAAYwlB,IACnBxlB,EAAO,QAAQigB,IACfjgB,EAAO,QAAQkc,IACflc,EAAO,UAAUmc,IACjBnc,EAAO,SAASoc,IAChBpc,EAAO,OAAOutB,IACdvtB,EAAO,WAAWwtB,IAClBxtB,EAAO,WAAW2P,IAClB3P,EAAO,UAAUihB,IACjBjhB,EAAO,SAAS6nB,IAChB7nB,EAAO,QAAQ+iB,IACf/iB,EAAO,aAAagjB,IACpBhjB,EAAO,WAAWijB,IAClBjjB,EAAO,WAAW+nB,IAClB/nB,EAAO,eAAekoB,IACtBloB,EAAO,QAAQwkB,IACfxkB,EAAO,QAAQykB,IACfzkB,EAAO,aAAaqc,IACpBrc,EAAO,eAAesc,IACtBtc,EAAO,iBAAiBuc,IACxBvc,EAAO,OAAOwc,IACdxc,EAAO,YAAYyc,IACnBzc,EAAO,iBAAiB0c,IACxB1c,EAAO,YAAY2c,IACnB3c,EAAO,OAAO4c,IACd5c,EAAO,SAASmhB,IAChBnhB,EAAO,UAAUshB,IACjBthB,EAAO,cAAcuhB,IACrBvhB,EAAO,eAAewhB,IACtBxhB,EAAO,UAAUka,IACjBla,EAAO,cAAc+c,IACrB/c,EAAO,eAAegd,IACtBhd,EAAO,OAAO0kB,IACd1kB,EAAO,OAAO0tB,IACd1tB,EAAO,YAAY2tB,IACnB3tB,EAAO,YAAYid,IACnBjd,EAAO,YAAY0oB,IACnB1oB,EAAO,cAAc2oB,IACrB3oB,EAAO,UAAU2hB,IACjB3hB,EAAO,UAAUmd,IACjBnd,EAAO,eAAe3e,IACtB2e,EAAO,iBAAiBqd,IACxBrd,EAAO,mBAAmBsd,IAC1Btd,EAAO,SAAS6oB,IAChB7oB,EAAO,WAAW8oB,IAClB9oB,EAAO,YAAY6hB,IACnB7hB,EAAO,WAAWpJ,IAClBoJ,EAAO,QAAQ8hB,IACf9hB,EAAO,OAAOhhD,IACdghD,EAAO,SAASqF,IAChBrF,EAAO,MAAMnF,IACbmF,EAAO,UAAUgpB,IACjBhpB,EAAO,YAAYipB,IACnBjpB,EAAO,UAAU4tB,IACjB5tB,EAAO,kBAAkB6tB,IACzB7tB,EAAO,UAAUkb,IACjBlb,EAAO,QAAQkpB,IACflpB,EAAO,YAAYmoB,IACnBnoB,EAAO,SAAS8tB,IAChB9tB,EAAO,WAAW+tB,IAClB/tB,EAAO,QAAQguB,IACfhuB,EAAO,SAASoiB,IAChBpiB,EAAO,SAASkuB,IAChBluB,EAAO,OAAOmpB,IACdnpB,EAAO,SAASopB,IAChBppB,EAAO,OAAO6kB,IACd7kB,EAAO,UAAU+hB,IACjB/hB,EAAO,OAAOmuB,IACdnuB,EAAO,WAAW8kB,IAClB9kB,EAAO,YAAYouB,IACnBpuB,EAAO,WAAWquB,IAClBruB,EAAO,UAAUglB,IACjBhlB,EAAO,eAAeilB,IACtBjlB,EAAO,YAAYgiB,IACnBhiB,EAAO,OAAOspB,IACdtpB,EAAO,SAASqpB,IAChBrpB,EAAO,WAAWx4C,IAClBw4C,EAAO,aAAasuB,IACpBtuB,EAAO,OAAO2d,IACd3d,EAAO,UAAU4d,IACjB5d,EAAO,YAAY6d,IACnB7d,EAAO,cAAc8d,IACrB9d,EAAO,SAAS+d,IAChB/d,EAAO,QAAQuuB,IACfvuB,EAAO,aAAawuB,IACpBxuB,EAAO,QAAQklB,IACfllB,EAAO,SAASmiB,IAChBniB,EAAO,SAASge,IAChBhe,EAAO,OAAOmlB,IACdnlB,EAAO,UAAUie,IACjBje,EAAO,aAAasiB,IACpBtiB,EAAO,MAAM/kC,IACb+kC,EAAO,UAAUupB,IACjBvpB,EAAO,UAAUuiB,IACjBviB,EAAO,QAAQke,IACfle,EAAO,SAASyiB,IAChBziB,EAAO,aAAaye,IACpBze,EAAO,eAAe0e,IACtB1e,EAAO,QAAQpgD,IACfogD,EAAO,SAASolB,IAChBplB,EAAO,OAAO2e,IACd3e,EAAO,OAAO4e,IACd5e,EAAO,YAAY6e,IACnB7e,EAAO,iBAAiB8e,IACxB9e,EAAO,YAAY+e,IACnB/e,EAAO,MAAMkgB,IACblgB,EAAO,WAAWqlB,IAClBrlB,EAAO,OAAOogB,IACdpgB,EAAO,UAAUygB,IACjBzgB,EAAO,UAAUwpB,IACjBxpB,EAAO,YAAYypB,IACnBzpB,EAAO,SAAS6uB,IAChB7uB,EAAO,gBAAgBiO,IACvBjO,EAAO,YAAYzqC,IACnByqC,EAAO,QAAQslB,IACftlB,EAAO,QAAQgf,IACfhf,EAAO,UAAUif,IACjBjf,EAAO,YAAYkf,IACnBlf,EAAO,OAAOmf,IACdnf,EAAO,SAASof,IAChBpf,EAAO,WAAWqf,IAClBrf,EAAO,QAAQ2pB,IACf3pB,EAAO,QAAQsf,IACftf,EAAO,YAAYwf,IACnBxf,EAAO,SAAS4pB,IAChB5pB,EAAO,aAAa6pB,IACpB7pB,EAAO,SAAStI,IAChBsI,EAAO,WAAW8pB,IAClB9pB,EAAO,UAAUyf,IACjBzf,EAAO,QAAQwV,IACfxV,EAAO,OAAOulB,IACdvlB,EAAO,MAAM0f,IACb1f,EAAO,QAAQ2f,IACf3f,EAAO,UAAU4f,IACjB5f,EAAO,MAAM6f,IACb7f,EAAO,YAAY8f,IACnB9f,EAAO,gBAAgB+f,IACvB/f,EAAO,UAAUggB,IAGjBhgB,EAAO,UAAUwpB,IACjBxpB,EAAO,YAAYypB,IACnBzpB,EAAO,SAASynB,IAChBznB,EAAO,aAAa0nB,IAGpBsG,GAAMhuB,GAAQA,CAAM,GAKpBA,EAAO,MAAM12C,IACb02C,EAAO,UAAU0sB,IACjB1sB,EAAO,YAAYmqB,IACnBnqB,EAAO,aAAaqqB,IACpBrqB,EAAO,OAAOkvB,IACdlvB,EAAO,QAAQ+pB,IACf/pB,EAAO,QAAQ6gB,IACf7gB,EAAO,YAAY0lB,IACnB1lB,EAAO,gBAAgB2lB,IACvB3lB,EAAO,YAAYylB,IACnBzlB,EAAO,aAAa4lB,IACpB5lB,EAAO,SAASyV,IAChBzV,EAAO,YAAYytB,IACnBztB,EAAO,SAASmvB,IAChBnvB,EAAO,WAAWuqB,IAClBvqB,EAAO,KAAK4E,IACZ5E,EAAO,SAAS0qB,IAChB1qB,EAAO,eAAe2qB,IACtB3qB,EAAO,QAAQkhB,IACflhB,EAAO,OAAOohB,IACdphB,EAAO,YAAY6c,IACnB7c,EAAO,UAAUooB,IACjBpoB,EAAO,WAAWqhB,IAClBrhB,EAAO,gBAAgB8c,IACvB9c,EAAO,cAAcqoB,IACrBroB,EAAO,QAAQsvB,IACftvB,EAAO,UAAUyhB,IACjBzhB,EAAO,eAAe0hB,IACtB1hB,EAAO,QAAQsoB,IACftoB,EAAO,aAAauoB,IACpBvoB,EAAO,SAASwoB,IAChBxoB,EAAO,cAAcyoB,IACrBzoB,EAAO,MAAMr2C,IACbq2C,EAAO,KAAK6lB,IACZ7lB,EAAO,MAAM8lB,IACb9lB,EAAO,MAAM4oB,IACb5oB,EAAO,QAAQsN,IACftN,EAAO,OAAOkd,IACdld,EAAO,WAAW/2C,IAClB+2C,EAAO,WAAWwH,IAClBxH,EAAO,UAAU6O,IACjB7O,EAAO,UAAUgqB,IACjBhqB,EAAO,SAAS+oB,IAChB/oB,EAAO,cAAc8D,IACrB9D,EAAO,UAAUE,GACjBF,EAAO,gBAAgB+lB,IACvB/lB,EAAO,cAAciN,IACrBjN,EAAO,oBAAoB8N,IAC3B9N,EAAO,YAAYgmB,IACnBhmB,EAAO,WAAWgE,IAClBhE,EAAO,SAASimB,IAChBjmB,EAAO,YAAYkmB,IACnBlmB,EAAO,UAAUmmB,IACjBnmB,EAAO,UAAUomB,IACjBpmB,EAAO,cAAcqmB,IACrBrmB,EAAO,UAAUsmB,IACjBtmB,EAAO,WAAWumB,IAClBvmB,EAAO,aAAa+I,IACpB/I,EAAO,YAAYwmB,IACnBxmB,EAAO,WAAWsM,IAClBtM,EAAO,QAAQ8G,IACf9G,EAAO,UAAUymB,IACjBzmB,EAAO,cAAc0mB,IACrB1mB,EAAO,QAAQ2mB,IACf3mB,EAAO,WAAW4mB,IAClB5mB,EAAO,QAAQ8mB,IACf9mB,EAAO,SAAS6mB,IAChB7mB,EAAO,WAAW7pB,IAClB6pB,EAAO,WAAW7oB,IAClB6oB,EAAO,eAAeC,IACtBD,EAAO,gBAAgBgO,IACvBhO,EAAO,WAAW+mB,IAClB/mB,EAAO,gBAAgBgnB,IACvBhnB,EAAO,QAAQ4G,IACf5G,EAAO,WAAW4hB,IAClB5hB,EAAO,WAAWkI,IAClBlI,EAAO,eAAekE,IACtBlE,EAAO,cAAcinB,IACrBjnB,EAAO,YAAYknB,IACnBlnB,EAAO,YAAYmnB,IACnBnnB,EAAO,OAAOud,IACdvd,EAAO,YAAY4qB,IACnB5qB,EAAO,OAAOsK,IACdtK,EAAO,cAAcyd,IACrBzd,EAAO,YAAY6qB,IACnB7qB,EAAO,aAAa8qB,IACpB9qB,EAAO,KAAKonB,IACZpnB,EAAO,MAAMqnB,IACbrnB,EAAO,MAAMuvB,IACbvvB,EAAO,QAAQwvB,IACfxvB,EAAO,OAAOyvB,IACdzvB,EAAO,SAAS0vB,IAChB1vB,EAAO,MAAM2vB,IACb3vB,EAAO,QAAQ4vB,IACf5vB,EAAO,YAAYua,IACnBva,EAAO,YAAYgb,IACnBhb,EAAO,aAAayuB,IACpBzuB,EAAO,aAAa0uB,IACpB1uB,EAAO,WAAW2uB,IAClB3uB,EAAO,WAAW6vB,IAClB7vB,EAAO,MAAM0d,IACb1d,EAAO,aAAaiuB,IACpBjuB,EAAO,OAAO6Y,IACd7Y,EAAO,MAAM0iB,IACb1iB,EAAO,MAAM+qB,IACb/qB,EAAO,SAASirB,IAChBjrB,EAAO,WAAWkrB,IAClBlrB,EAAO,WAAWmrB,IAClBnrB,EAAO,SAASiqB,IAChBjqB,EAAO,SAASiiB,IAChBjiB,EAAO,cAAckiB,IACrBliB,EAAO,SAASqrB,IAChBrrB,EAAO,UAAUsrB,IACjBtrB,EAAO,SAAS3+C,IAChB2+C,EAAO,QAAQgwB,IACfhwB,EAAO,eAAevE,GACtBuE,EAAO,SAASqiB,IAChBriB,EAAO,OAAOgD,IACdhD,EAAO,YAAYurB,IACnBvrB,EAAO,OAAOwiB,IACdxiB,EAAO,cAAcme,IACrBne,EAAO,gBAAgBoe,IACvBpe,EAAO,gBAAgBqe,IACvBre,EAAO,kBAAkBse,IACzBte,EAAO,oBAAoBue,IAC3Bve,EAAO,oBAAoBwe,IAC3Bxe,EAAO,YAAYyrB,IACnBzrB,EAAO,aAAa0rB,IACpB1rB,EAAO,WAAWiwB,IAClBjwB,EAAO,MAAM9lB,IACb8lB,EAAO,QAAQowB,IACfpwB,EAAO,WAAW2rB,IAClB3rB,EAAO,QAAQ4uB,IACf5uB,EAAO,WAAWgY,IAClBhY,EAAO,YAAYoI,GACnBpI,EAAO,WAAWqI,IAClBrI,EAAO,UAAU2sB,IACjB3sB,EAAO,WAAWkY,IAClBlY,EAAO,gBAAgBunB,IACvBvnB,EAAO,WAAWgS,IAClBhS,EAAO,UAAU4sB,IACjB5sB,EAAO,OAAO6sB,IACd7sB,EAAO,UAAU8sB,IACjB9sB,EAAO,YAAY+sB,IACnB/sB,EAAO,WAAWtW,IAClBsW,EAAO,WAAWmtB,IAClBntB,EAAO,WAAW8uB,IAClB9uB,EAAO,YAAYotB,IACnBptB,EAAO,aAAasqB,IAGpBtqB,EAAO,OAAOyhB,IACdzhB,EAAO,YAAY0hB,IACnB1hB,EAAO,QAAQkd,IAEf8Q,GAAMhuB,GAAS,WAAW;AACxB,cAAIz4C,IAAS,CAAA;AACb,iBAAAsgD,GAAW7H,GAAQ,SAASzJ,GAAM8e,GAAY;AAC5C,YAAK3Y,GAAe,KAAKsD,EAAO,WAAWqV,CAAU,MACnD9tD,EAAO8tD,CAAU,IAAI9e;AAAA,UAE/B,CAAO,GACMhvC;AAAA,QACb,KAAU,EAAE,OAAS,IAAO,GAWxBy4C,EAAO,UAAU5U,GAGjB0L,GAAU,CAAC,QAAQ,WAAW,SAAS,cAAc,WAAW,cAAc,GAAG,SAASue,GAAY;AACpG,UAAArV,EAAOqV,CAAU,EAAE,cAAcrV;AAAA,QACvC,CAAK,GAGDlJ,GAAU,CAAC,QAAQ,MAAM,GAAG,SAASue,GAAYvoD,GAAO;AACtD,UAAAqzC,GAAY,UAAUkV,CAAU,IAAI,SAAS5rD,GAAG;AAC9C,YAAAA,IAAIA,MAAM0hC,IAAY,IAAIsT,GAAU2J,EAAU3+C,CAAC,GAAG,CAAC;AAEnD,gBAAIpI,IAAU,KAAK,gBAAgB,CAACyL,IAChC,IAAIqzC,GAAY,IAAI,IACpB,KAAK,MAAK;AAEd,mBAAI9+C,EAAO,eACTA,EAAO,gBAAgBq9C,GAAUj1C,GAAGpI,EAAO,aAAa,IAExDA,EAAO,UAAU,KAAK;AAAA,cACpB,MAAQq9C,GAAUj1C,GAAG6jC,EAAgB;AAAA,cACrC,MAAQ+nB,KAAch0D,EAAO,UAAU,IAAI,UAAU;AAAA,YACjE,CAAW,GAEIA;AAAA,aAGT8+C,GAAY,UAAUkV,IAAa,OAAO,IAAI,SAAS5rD,GAAG;AACxD,mBAAO,KAAK,QAAO,EAAG4rD,CAAU,EAAE5rD,CAAC,EAAE,QAAO;AAAA;QAEpD,CAAK,GAGDqtC,GAAU,CAAC,UAAU,OAAO,WAAW,GAAG,SAASue,GAAYvoD,GAAO;AACpE,cAAIrM,IAAOqM,IAAQ,GACfujE,IAAW5vE,KAAQssC,MAAoBtsC,KAAQwsC;AAEnD,UAAAkT,GAAY,UAAUkV,CAAU,IAAI,SAASze,GAAU;AACrD,gBAAIv1C,IAAS,KAAK,MAAK;AACvB,mBAAAA,EAAO,cAAc,KAAK;AAAA,cACxB,UAAYgtD,EAAYzX,GAAU,CAAC;AAAA,cACnC,MAAQn2C;AAAA,YAClB,CAAS,GACDY,EAAO,eAAeA,EAAO,gBAAgBgvE,GACtChvE;AAAA;QAEf,CAAK,GAGDy1C,GAAU,CAAC,QAAQ,MAAM,GAAG,SAASue,GAAYvoD,GAAO;AACtD,cAAIwjE,IAAW,UAAUxjE,IAAQ,UAAU;AAE3C,UAAAqzC,GAAY,UAAUkV,CAAU,IAAI,WAAW;AAC7C,mBAAO,KAAKib,CAAQ,EAAE,CAAC,EAAE,MAAK,EAAG,CAAC;AAAA;QAE1C,CAAK,GAGDx5B,GAAU,CAAC,WAAW,MAAM,GAAG,SAASue,GAAYvoD,GAAO;AACzD,cAAIyjE,IAAW,UAAUzjE,IAAQ,KAAK;AAEtC,UAAAqzC,GAAY,UAAUkV,CAAU,IAAI,WAAW;AAC7C,mBAAO,KAAK,eAAe,IAAIlV,GAAY,IAAI,IAAI,KAAKowB,CAAQ,EAAE,CAAC;AAAA;QAE3E,CAAK,GAEDpwB,GAAY,UAAU,UAAU,WAAW;AACzC,iBAAO,KAAK,OAAOl3C,EAAQ;AAAA,WAG7Bk3C,GAAY,UAAU,OAAO,SAASlJ,GAAW;AAC/C,iBAAO,KAAK,OAAOA,CAAS,EAAE,KAAI;AAAA,WAGpCkJ,GAAY,UAAU,WAAW,SAASlJ,GAAW;AACnD,iBAAO,KAAK,UAAU,KAAKA,CAAS;AAAA,WAGtCkJ,GAAY,UAAU,YAAYgP,GAAS,SAASnsB,GAAMyT,GAAM;AAC9D,iBAAI,OAAOzT,KAAQ,aACV,IAAImd,GAAY,IAAI,IAEtB,KAAK,IAAI,SAAS/7C,GAAO;AAC9B,mBAAOimD,GAAWjmD,GAAO4+B,GAAMyT,CAAI;AAAA,UAC3C,CAAO;AAAA,QACP,CAAK,GAED0J,GAAY,UAAU,SAAS,SAASlJ,GAAW;AACjD,iBAAO,KAAK,OAAOmrB,GAAO/T,EAAYpX,CAAS,CAAC,CAAC;AAAA,WAGnDkJ,GAAY,UAAU,QAAQ,SAASv2C,GAAO6D,GAAK;AACjD,UAAA7D,IAAQw+C,EAAUx+C,CAAK;AAEvB,cAAIvI,IAAS;AACb,iBAAIA,EAAO,iBAAiBuI,IAAQ,KAAK6D,IAAM,KACtC,IAAI0yC,GAAY9+C,CAAM,KAE3BuI,IAAQ,IACVvI,IAASA,EAAO,UAAU,CAACuI,CAAK,IACvBA,MACTvI,IAASA,EAAO,KAAKuI,CAAK,IAExB6D,MAAQ09B,MACV19B,IAAM26C,EAAU36C,CAAG,GACnBpM,IAASoM,IAAM,IAAIpM,EAAO,UAAU,CAACoM,CAAG,IAAIpM,EAAO,KAAKoM,IAAM7D,CAAK,IAE9DvI;AAAA,WAGT8+C,GAAY,UAAU,iBAAiB,SAASlJ,GAAW;AACzD,iBAAO,KAAK,QAAO,EAAG,UAAUA,CAAS,EAAE,QAAO;AAAA,WAGpDkJ,GAAY,UAAU,UAAU,WAAW;AACzC,iBAAO,KAAK,KAAK7S,EAAgB;AAAA,WAInCua,GAAW1H,GAAY,WAAW,SAAS5J,GAAM8e,GAAY;AAC3D,cAAImb,IAAgB,qCAAqC,KAAKnb,CAAU,GACpEob,IAAU,kBAAkB,KAAKpb,CAAU,GAC3Cqb,IAAa1wB,EAAOywB,IAAW,UAAUpb,KAAc,SAAS,UAAU,MAAOA,CAAU,GAC3Fsb,IAAeF,KAAW,QAAQ,KAAKpb,CAAU;AAErD,UAAKqb,MAGL1wB,EAAO,UAAUqV,CAAU,IAAI,WAAW;AACxC,gBAAIjxD,IAAQ,KAAK,aACbqyC,IAAOg6B,IAAU,CAAC,CAAC,IAAI,WACvBG,IAASxsE,aAAiB+7C,IAC1BvJ,IAAWH,EAAK,CAAC,GACjBo6B,IAAUD,KAAU1wB,EAAQ97C,CAAK,GAEjC+7D,IAAc,SAAS/7D,IAAO;AAChC,kBAAI/C,KAASqvE,EAAW,MAAM1wB,GAAQvI,GAAU,CAACrzC,EAAK,GAAGqyC,CAAI,CAAC;AAC9D,qBAAQg6B,KAAWhwB,IAAYp/C,GAAO,CAAC,IAAIA;AAAA;AAG7C,YAAIwvE,KAAWL,KAAiB,OAAO55B,KAAY,cAAcA,EAAS,UAAU,MAElFg6B,IAASC,IAAU;AAErB,gBAAIpwB,IAAW,KAAK,WAChBqwB,IAAW,CAAC,CAAC,KAAK,YAAY,QAC9BC,IAAcJ,KAAgB,CAAClwB,GAC/BuwB,IAAWJ,KAAU,CAACE;AAE1B,gBAAI,CAACH,KAAgBE,GAAS;AAC5B,cAAAzsE,IAAQ4sE,IAAW5sE,IAAQ,IAAI+7C,GAAY,IAAI;AAC/C,kBAAI9+C,IAASk1C,EAAK,MAAMnyC,GAAOqyC,CAAI;AACnC,qBAAAp1C,EAAO,YAAY,KAAK,EAAE,MAAQ++D,IAAM,MAAQ,CAACD,CAAW,GAAG,SAAWh1B,EAAS,CAAE,GAC9E,IAAIiV,GAAc/+C,GAAQo/C,CAAQ;AAAA,YACnD;AACQ,mBAAIswB,KAAeC,IACVz6B,EAAK,MAAM,MAAME,CAAI,KAE9Bp1C,IAAS,KAAK,KAAK8+D,CAAW,GACvB4Q,IAAeN,IAAUpvE,EAAO,MAAK,EAAG,CAAC,IAAIA,EAAO,MAAK,IAAMA;AAAA;QAE9E,CAAK,GAGDy1C,GAAU,CAAC,OAAO,QAAQ,SAAS,QAAQ,UAAU,SAAS,GAAG,SAASue,GAAY;AACpF,cAAI9e,IAAO8F,GAAWgZ,CAAU,GAC5B4b,IAAY,0BAA0B,KAAK5b,CAAU,IAAI,QAAQ,QACjEsb,IAAe,kBAAkB,KAAKtb,CAAU;AAEpD,UAAArV,EAAO,UAAUqV,CAAU,IAAI,WAAW;AACxC,gBAAI5e,IAAO;AACX,gBAAIk6B,KAAgB,CAAC,KAAK,WAAW;AACnC,kBAAIvsE,IAAQ,KAAK,MAAK;AACtB,qBAAOmyC,EAAK,MAAM2J,EAAQ97C,CAAK,IAAIA,IAAQ,CAAA,GAAIqyC,CAAI;AAAA,YAC7D;AACQ,mBAAO,KAAKw6B,CAAS,EAAE,SAAS7sE,GAAO;AACrC,qBAAOmyC,EAAK,MAAM2J,EAAQ97C,CAAK,IAAIA,IAAQ,CAAA,GAAIqyC,CAAI;AAAA,YAC7D,CAAS;AAAA;QAET,CAAK,GAGDoR,GAAW1H,GAAY,WAAW,SAAS5J,GAAM8e,GAAY;AAC3D,cAAIqb,IAAa1wB,EAAOqV,CAAU;AAClC,cAAIqb,GAAY;AACd,gBAAI3xE,IAAM2xE,EAAW,OAAO;AAC5B,YAAKh0B,GAAe,KAAK4C,IAAWvgD,CAAG,MACrCugD,GAAUvgD,CAAG,IAAI,CAAA,IAEnBugD,GAAUvgD,CAAG,EAAE,KAAK,EAAE,MAAQs2D,GAAY,MAAQqb,GAAY;AAAA,UACtE;AAAA,QACA,CAAK,GAEDpxB,GAAUyW,GAAa5qB,GAAWe,CAAkB,EAAE,IAAI,IAAI,CAAC;AAAA,UAC7D,MAAQ;AAAA,UACR,MAAQf;AAAAA,QACd,CAAK,GAGDgV,GAAY,UAAU,QAAQO,IAC9BP,GAAY,UAAU,UAAUS,IAChCT,GAAY,UAAU,QAAQU,IAG9Bb,EAAO,UAAU,KAAKqgB,IACtBrgB,EAAO,UAAU,QAAQsgB,IACzBtgB,EAAO,UAAU,SAASugB,IAC1BvgB,EAAO,UAAU,OAAOwgB,IACxBxgB,EAAO,UAAU,QAAQ4gB,IACzB5gB,EAAO,UAAU,UAAU8gB,IAC3B9gB,EAAO,UAAU,SAASA,EAAO,UAAU,UAAUA,EAAO,UAAU,QAAQghB,IAG9EhhB,EAAO,UAAU,QAAQA,EAAO,UAAU,MAEtCrC,OACFqC,EAAO,UAAUrC,EAAW,IAAIgjB,KAE3B3gB;AAAA,MACX,GAKMrE,KAAIF,GAAY;AAiBf,MAAI/F,OAENA,GAAW,UAAUiG,IAAG,IAAIA,IAE7BnG,GAAY,IAAImG,MAIhB/4C,GAAK,IAAI+4C;AAAA,IAEb,GAAE,KAAKu1B,EAAI;AAAA;;;ACxxhBX,SAASC,GACLC,GACApuC,GACqB;AACrB,MAAIquC,IAAoBruC,EAAK;AAC7B,QAAMsuC,IAA4D,CAAA;AAClE,SAAOD,EAAkB,SAAS,KAAG;AACjC,IAAAA,IAAoB5O,GAAAA,OAAO4O,GAAmB,CAAC,MAAM;AACjD,UAAI,EAAE,YAAY,EAAE,SAAS,eAAe,EAAE,SAAS,YAAY,CAAC;AAChE,eAAOp6C,GAASm6C,GAAQ,EAAE,SAAS,YAAY,CAAC,CAAC;AAEjD,YAAM,IAAI,MAAM,0BAA0B;AAAA,IAC9C,CACH;AACD,UAAMG,IAAUF,EAAkB,MAAA,GAC5BG,IAAgBD,EAAQ,SAAS,YAAYA,EAAQ,SAAS,YAAY,SAAS,CAAC;AAC1F,IAAIC,MACAJ,IAASI,IAEbF,EAAgB,KAAKC,CAAO;AAAA,EAAA;AAEhC,SAAOD;AACX;AASA,MAAqBG,GAAuB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA;AAAA;AAAA,EAEA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWhB,YAAYh7B,GAAmC;AAC3C,UAAM,EAAE,QAAAi7B,GAAQ,QAAAC,GAAQ,QAAAC,GAAQ,QAAAC,GAAQ,cAAAC,MAAiBr7B;AACzD,SAAK,SAASi7B,GACd,KAAK,SAASC,GACd,KAAK,SAASC,GACd,KAAK,SAASC,GACd,KAAK,eAAeC,GAEpB,KAAK,aAAa,CAAC,KAAK,QAAQ,KAAK,MAAM,GAC3C,KAAK,cAAc,CAAC,KAAK,QAAQ,KAAK,MAAM,GAC5C,KAAK,UAAU,CAAC,KAAK,QAAQ,KAAK,MAAM,GACxC,KAAK,WAAW,CAAC,KAAK,QAAQ,KAAK,MAAM,GAEzC,KAAK,SAAS,KAAK,gBAAgB;AAAA,OAC9B,KAAK,SAAS,KAAK,UAAU;AAAA,OAC7B,KAAK,SAAS,KAAK,UAAU;AAAA,IAAA,GAElC,KAAK,UAAU,CAAC,KAAK,QAAQ,KAAK,QAAQ,KAAK,QAAQ,KAAK,MAAM;AAAA,EAAA;AAAA,EAMtE,WAAWC,GAA0ClpE,GAAqB;AACtE,WAAI,OAAOkpE,KAAkB,WAErBA,KAAiB,KAAK,UACtBA,KAAiB,KAAK,UACtBlpE,KAAM,KAAK,UACXA,KAAM,KAAK,SAGZ,KAAK,WAAWkpE,EAAc,CAAC,GAAGA,EAAc,CAAC,CAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiB7D,mBAAmB77C,GAAiE;AAChF,QAAI,GAAC,MAAM,QAAQA,CAAW,KAAKA,EAAY,UAAU,MAIrD,CAAAA,EAAY,KAAK,CAACuD,MAAeA,EAAW,WAAW,CAAC,GAI5D;AAAA,UAAIvD,EAAY,KAAK,CAACuD,MAAe,CAAC,KAAK,WAAWA,CAAU,CAAC,GAAG;AAChE,cAAMu4C,IAAkBt4C,GAAY,KAAK,OAAO,GAC1C6rB,IAAQzb,GAAUtT,GAAWN,CAAW,GAAG87C,CAAe;AAChE,eAAI97C,EAAY,CAAC,MACbqvB,EAAM,WAAW4rB,GAAuBj7C,EAAY,CAAC,GAAGqvB,CAAK,IAE1DA,EAAM,SAAS,IAAI,CAAC2W,OAChB;AAAA,UACH,aAAaA,EAAM,SAAS;AAAA,UAC5B,gBAAgB9lC,GAAO8lC,EAAM,SAAS,WAAW,EAAE,SAAS;AAAA,YAAM,CAAC7pD,MAC/D4rB,GAAsB5rB,GAAO2/D,CAAe;AAAA,UAAA;AAAA,QAChD,EAEP;AAAA,MAAA;AAGL,aAAO;AAAA,QACH;AAAA,UACI,aAAA97C;AAAA,UACA,gBAAgB;AAAA,QAAA;AAAA,MACpB;AAAA;AAAA,EACJ;AAER;ACzJO,MAAM+7C,KAA0C,MAC1CC,KAAuC,GAYvCC,KACR,IAAI,KAAK,KAAKv8C,KAAe;AA2DlC,MAA8Bw8C,GAAiB;AAAA;AAAA;AAAA;AAAA;AAAA,EAK3B;AAAA;AAAA,EAEA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA;AAAA,EAEhB,YAAY37B,GAA6B;AACrC,UAAM;AAAA,MACF,YAAA47B;AAAA,MACA,OAAAC;AAAA,MACA,2BAAAC;AAAA,MACA,QAAAC;AAAA,MACA,eAAAC;AAAA,MACA,qBAAAC,IAAsB;AAAA,IAAA,IACtBj8B;AACJ,SAAK,aAAa47B,GAMlB,KAAK,OAAO,QAAQA,CAAU,IAC9B,KAAK,QAAQC,GACb,KAAK,4BAA4BC,GACjC,KAAK,SAASC,GACd,KAAK,gBAAgBC,GACrB,KAAK,sBAAsBC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAc/B,YAAYC,GAAwE;AAChF,QAAI,KAAK,QAAQ;AACb,UAAIA,EAAiB,SAAS,KAAK;AAC/B,eAAO,KAAK;AAEhB,YAAMC,IAAgB18D,GAAM,KAAK,MAAMy8D,EAAiB,MAAM,KAAK,OAAO,UAAU,GAC9EE,IAAc38D,GAAM,KAAK,MAAMy8D,EAAiB,MAAM,KAAK,OAAO,QAAQ;AAChF,UAAIb;AACJ,aAAI,KAAK,OAAO,iBACZA,IAAe57D,GAAM,KAAK,MAAMy8D,EAAiB,MAAM,KAAK,OAAO,YAAY,IAE5E,IAAIlB,GAAuB;AAAA,QAC9B,QAAQmB,EAAc,CAAC;AAAA,QACvB,QAAQA,EAAc,CAAC;AAAA,QACvB,QAAQC,EAAY,CAAC;AAAA,QACrB,QAAQA,EAAY,CAAC;AAAA,QACrB,cAAAf;AAAA,MAAA,CACH;AAAA,IAAA;AAAA,EAEL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWJ,WAAWC,GAA0ClpE,GAAqB;AACtE,WAAK,KAAK,SAGN,OAAOkpE,KAAkB,WAClB,KAAK,OAAO,WAAWA,GAAelpE,CAAE,IAE5C,KAAK,OAAO,WAAWkpE,EAAc,CAAC,GAAGA,EAAc,CAAC,CAAC,IALrD;AAAA,EAKqD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBpE,eAAee,GAAsB;AACjC,WAAO9C,GAAM8C,GAAM,CAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA4CxB,mBAAmBC,GAAqC;AACpD,QAAI,CAAC,KAAK;AACN,aAAO,CAAA;AAEX,UAAMC,IAAyBb,IACzBc,IAAgC,CAAA,GAChCC,KAAaH,KAAY,KAAK,KAAK,KAAM;AAC/C,aAAS32D,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,MAAA62D,EAAY,KAAK;AAAA,QACb,YAAaD,IAAyB,KAAK,IAAIE,CAAQ,IAAK,KAAK,IAAI,GAAG92D,CAAC;AAAA,QACzE,MAAMA;AAAA,MAAA,CACT;AAEL,WAAO62D;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUX,gBAAkC;AAC9B,WAAO,KAAK,QAAQ,WAAW,CAAC,GAAG,CAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOxC,eAAyB;AACrB,UAAME,IAAY,CAAA;AAClB,aAAS/2D,IAAI,GAAGA,IAAI,KAAK,qBAAqB,QAAQ,EAAEA;AACpD,MAAA+2D,EAAU/2D,CAAC,IAAIA;AAEnB,WAAO+2D;AAAA,EAAA;AAEf;ACrSA,MAA8BC,WAA+BhB,GAAiB;AAAA,EAGhE,YAAY37B,GAAmC;AACrD,UAAMA,CAAI;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQd,gBAAkC;AAC9B,WAAO,KAAK,OAAO;AAAA,EAAA;AAqB3B;AC1CO,MAAM48B,KAA6B;AAAA,EACtC;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAM;AACjF,GAYaC,KAA2C;AAAA,EACpD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,GAAGD,GAAiB,MAAM,GAAG,EAAE;AAAA;AAAA;AAAA;AAAA,EAI/B;AAAA,EACA,GAAGA,GAAiB,MAAM,EAAE;AAChC,GAWaE,KAA4D;AAAA,EACrE;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACAtB;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AACJ,GAEMuB,KAA4C;AAAA,EAC9C;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AACJ,GAEMC,KAAgCF,GAAgD;AAAA,EAClF,CAAC53B,GAAG7uC,MAAUA;AAClB;AAYA,MAAqB4mE,WAA8BN,GAAuB;AAAA,EACtE,qBAAuC;AACnC,WAAOE,GAA+B,IAAI,CAACK,MAAe;AACtD,YAAMb,IAA2BO,GAAiB,QAAQM,CAAU,KAAK;AACzE,UAAIrB;AACJ,aAAIQ,MACAR,IAAQkB,GAAgCV,CAAI,IAEzC;AAAA,QACH,MAAAA;AAAA,QACA,OAAAR;AAAA,QACA,YAAAqB;AAAA,MAAA;AAAA,IACJ,CACH;AAAA,EAAA;AAAA,EAGL,sBAA8B;AAC1B,WAAOzB;AAAA,EAAA;AAAA,EAGX,iBAAyB;AACrB,WAAO;AAAA,EAAA;AAAA,EAGX,mCAAmC0B,GAAmC;AAElE,WACI,OAAOL,GAAgD,CAAC,KAAM,YAC9D,OAAOA,GAAgD,EAAE,KAAM,YAC/DK,KAAqBL,GAAgD,CAAC,KACtEK,KAAqBL,GAAgD,EAAE,IAEhEA,GAAgD;AAAA,MACnD,CAACT,MAASA,IAAOc;AAAA,IAAA,EACnB,SAGF,OAAOL,GAAgD,CAAC,KAAM,YAC9DK,IAAoBL,GAAgD,CAAC,IAE9D,IAGP,OAAOA,GAAgD,EAAE,KAAM,YAC/DK,IAAoBL,GAAgD,EAAE,IAE/D,KAGJ,KAAK,oBAAA;AAAA,EAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAapC,mCAAmCM,GAAiC;AAChE,UAAM90E,IAAM,KAAK,MAAM80E,CAAe;AACtC,WAAIN,GAAgD,SAAS,KAAKx0E,IAE1Dw0E,GAAgDx0E,CAAG,KACnDkzE,KAIDA;AAAA,EAAA;AAAA,EAGX,qBAAqBa,GAAsB;AACvC,UAAMgB,IAAc,KAAK,MAAMhB,CAAI;AACnC,WAAI,OAAOO,GAAiBS,CAAW,KAAM,WAClC,IAGJT,GAAiBS,CAAW;AAAA,EAAA;AAAA,EAGvC,qBAAqBH,GAA4B;AAE7C,UAAMI,IAAqBV,GAAiB;AAAA,MACxC,CAACW,MAAmBA,KAAkBL;AAAA,IAAA;AAE1C,QAAII;AACA,aAAOV,GAAiB,QAAQU,CAAkB;AAItD,UAAME,IAAqBZ,GAAiB,MAAM,EAAE,EAAE,CAAC;AACvD,WAAIY,KAAsBA,IAAqBN,IAGpCN,GAAiB,QAAQY,CAAkB,IAG/C;AAAA,EAAA;AAAA,EAGX,qBAAqB7vE,GAAuB;AACxC,WAAO4rE,GAAM5rE,GAAO,CAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWzB,eAAeyvE,GAAyBprC,IAAqB,IAAe;AACxE,WAAIA,IACO8oC,GAAQsC,GAAiBJ,EAAmB,IAEhD,MAAM,eAAeI,CAAe;AAAA,EAAA;AAEnD;ACrOA,MAAqBK,WAA6BR,GAAsB;AAAA,EACpE,cAAc;AACV,UAAM;AAAA,MACF,YAAY;AAAA,MACZ,OAAO;AAAA,MACP,eAAe;AAAA;AAAA,MAEf,2BACI;AAAA;AAAA,MAEJ,QAAQ,IAAIjC,GAAuB;AAAA,QAC/B,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MAAA,CACX;AAAA,MACD,qBAAqB;AAAA,IAAA,CACxB;AAAA,EAAA;AAET;ACnBA,MAAqB0C,WAA6BT,GAAsB;AAAA,EACpE,cAAc;AACV,UAAM;AAAA,MACF,YAAY;AAAA,MACZ,OAAO;AAAA,MACP,eAAe;AAAA;AAAA,MAEf,2BACI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAcJ,QAAQ,IAAIjC,GAAuB;AAAA,QAC/B,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MAAA,CACX;AAAA,MACD,qBAAqB;AAAA,IAAA,CACxB;AAAA,EAAA;AAET;ACtBA,MAA8B2C,WAAiChC,GAAiB;AAAA;AAAA,EAE5E,sBAA8B;AAC1B,WAAOH;AAAA,EAAA;AAAA,EAGX,iBAAyB;AACrB,WAAOA;AAAA,EAAA;AAEf;ACXA,MAAqBoC,WAAoCD,GAAyB;AAAA,EAC9E,cAAc;AACV,UAAM;AAAA,MACF,YAAY;AAAA,MACZ,OAAO;AAAA;AAAA,MAEP,2BACI;AAAA;AAAA,MAEJ,QAAQ,IAAI3C,GAAuB;AAAA,QAC/B,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA;AAAA,QAER,cAAc,CAAC,WAAW,YAAU;AAAA,MAAA,CACvC;AAAA,MACD,qBAAqB;AAAA,IAAA,CACxB;AAAA,EAAA;AAAA,EAGL,qBAAqBrtE,GAAuB;AACxC,WAAO4rE,GAAM5rE,GAAO,CAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASzB,qBAAqB0uE,GAAcwB,GAAkC;AACjE,UAAMC,IAAcr+D,GAAM,KAAK,MAAMnM,GAAM,MAAMuqE,CAAM,EAAE;AAAA,MACrD,CAAC76C,MAAgBA,IAAa,KAAK,KAAM;AAAA,IAAA;AAE7C,WAAI,OAAO86C,EAAY,CAAC,KAAM,WACnB,IAEJvE;AAAAA,MACH,KAAK;AAAA,QACAmC,KAAmD,KAAK,IAAIoC,EAAY,CAAC,CAAC,IACvE,KAAK,IAAI,GAAGzB,CAAI;AAAA,MAAA;AAAA,MAExB;AAAA,IAAA;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBJ,qBAAqBa,GAAoBW,GAAkC;AACvE,UAAMC,IAAcr+D,GAAM,KAAK,MAAMnM,GAAM,MAAMuqE,CAAM,EAAE;AAAA,MACrD,CAAC76C,MAAgBA,IAAa,KAAK,KAAM;AAAA,IAAA;AAE7C,WAAI,OAAO86C,EAAY,CAAC,KAAM,WACnB,IAEJ,KAAK;AAAA,MACR,KAAK;AAAA,QACDZ,IACIxB,KACA,KAAK,IAAIoC,EAAY,CAAC,CAAC;AAAA,MAAA;AAAA,IAC/B;AAAA,EACJ;AAER;AChFA,MAAqBC,WAA8BJ,GAAyB;AAAA,EACxE,cAAc;AACV,UAAM;AAAA,MACF,YAAY;AAAA,MACZ,OAAO;AAAA;AAAA,MAEP,2BAA2B;AAAA,MAC3B,QAAQ,IAAI3C,GAAuB;AAAA,QAC/B,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA;AAAA,QAER,cAAc,CAAC,UAAU,SAAS;AAAA,MAAA,CACrC;AAAA,MACD,qBAAqB;AAAA,IAAA,CACxB;AAAA,EAAA;AAAA,EAGL,qBAAqBrtE,GAAuB;AAGxC,WAAO4rE,GAAM5rE,GAAO,CAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASzB,qBAAqB0uE,GAAcwB,GAAkC;AACjE,WAAOtE;AAAAA,MACH,KAAK;AAAA,QACAmC,KACG,KAAK,IAAKmC,EAAO,CAAC,IAAI,KAAK,KAAM,GAAK,IACtC,KAAK,IAAI,GAAGxB,CAAI;AAAA,MAAA;AAAA,MAExB;AAAA,IAAA;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBJ,mBAAmB2B,GAA4E;AAC3F,WAAIA,EAAO,CAAC,IAAIA,EAAO,CAAC,IACb,CAACA,EAAO,CAAC,GAAGA,EAAO,CAAC,GAAGA,EAAO,CAAC,GAAGA,EAAO,CAAC,CAAC,IAE/CA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBX,qBAAqBd,GAAoBW,GAAkC;AACvE,WAAO,KAAK;AAAA,MACR,KAAK;AAAA,QACDX,IACIxB,KACA,KAAK,IAAKmC,EAAO,CAAC,IAAI,KAAK,KAAM,GAAK;AAAA,MAAA;AAAA,IAC9C;AAAA,EACJ;AAER;AChFO,MAAMI,KAA6B,IAAIP,GAAA,GACjCQ,KAA6B,IAAIT,GAAA,GACjCnqE,KAA+B,IAAIyqE,GAAA,GACnCI,KAA2C,IAAIP,GAAA,GAK/CQ,KAA2C,CAACH,IAAMC,IAAM5qE,IAAO6qE,EAAW,GASjFE,KAAyC;AAAA,EAC3C,iCAAA7C;AAAA,EACA,8BAAAC;AAAA,EACA,kBAAAmB;AAAA,EACA,gCAAAC;AACJ,GAUM1+D,KAA6B;AAAA,EAC/B,MAAA8/D;AAAA,EACA,MAAAC;AAAA,EACA,OAAA5qE;AAAA,EACA,aAAA6qE;AAAA,EACA,sBAAAC;AACJ;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122]}