@vertigis/arcgis-extensions 48.3.4 → 48.4.0

package/utilities/CollectionProxy.d.ts

@@ -196,7 +196,13 @@ export declare abstract class CollectionProxy<T> extends CollectionProxy_base {
      *   and returns a new value at the same index of the original item.
      */
     map<U>(callback: ItemMapCallback<T, U>): Collection<U>;
-    on(...args: [type: "after-add", listener: CollectionAfterAddEventHandler<T>] | [type: "after-changes", listener: CollectionAfterChangesEventHandler] | [type: "after-remove", listener: CollectionAfterRemoveEventHandler<T>] | [type: "before-add", listener: CollectionBeforeAddEventHandler<T>] | [type: "before-changes", listener: CollectionBeforeChangesEventHandler] | [type: "before-remove", listener: CollectionBeforeRemoveEventHandler<T>] | [type: "change", listener: CollectionChangeEventHandler<T>]): IHandle;
+    on(type: "after-add", listener: CollectionAfterAddEventHandler<T>): IHandle;
+    on(type: "after-changes", listener: CollectionAfterChangesEventHandler): IHandle;
+    on(type: "after-remove", listener: CollectionAfterRemoveEventHandler<T>): IHandle;
+    on(type: "before-add", listener: CollectionBeforeAddEventHandler<T>): IHandle;
+    on(type: "before-changes", listener: CollectionBeforeChangesEventHandler): IHandle;
+    on(type: "before-remove", listener: CollectionBeforeRemoveEventHandler<T>): IHandle;
+    on(type: "change", listener: CollectionChangeEventHandler<T>): IHandle;
     /**
      * Removes the last item from the collection and returns it.
      */

package/utilities/CollectionProxy.js

@@ -1 +1 @@
-import{Observable as t}from"../support/Observable.js";import{onCollectionPropertyChange as e}from"./watch.js";export class CollectionProxy extends t{get length(){return this._collection.length}get declaredClass(){return"esri.core.Collection"}get destroyed(){return this._destroyed}set destroyed(t){this._destroyed=t}get initialized(){return this._initialized}set initialized(t){this._initialized=t}get _collection(){if(void 0===this._collectionField)throw new Error("CollectionProxy requires a backing collection.");return this._collectionField}set _collection(t){this._collectionField=t}_destroyed=!1;_initialized=!0;_afterChangesHandle;_collectionField;constructor(t){super(),this._collectionField=t,e(this,"_collectionField",(t=>{this.emit("change",t)})),this.watch("_collectionField.length",(()=>this.notifyChange("length"))),this.watch("_collectionField",(t=>{this._afterChangesHandle?.remove(),this._afterChangesHandle=t?.on("after-changes",(t=>this.emit("after-changes",t))),this.emit("after-changes")}),!0),null!=this._collectionField&&(this._afterChangesHandle=this._collectionField.on("after-changes",(t=>this.emit("after-changes",t))))}*[Symbol.iterator](){for(const t of this._collection)yield t}add(t,e){return this._collection.add(t,e),this}addMany(t,e){if(!t)return this;let i=e;if(arguments.length>1)for(let e=0;e<t.length;e++)"function"==typeof t.getItemAt?this.add(t.getItemAt(e),i++):this.add(t[e],i++);else for(let e=0;e<t.length;e++)"function"==typeof t.getItemAt?this.add(t.getItemAt(e)):this.add(t[e]);return this}clone(){const t=Object.create(Object.getPrototypeOf(this));return t._collection=this._collection,t}concat(t){return this._collection.concat(t)}destroy(){}every(t){return this._collection.every(t)}filter(t){return this._collection.filter(t)}find(t){return this._collection.find(t)}findIndex(t){return this._collection.findIndex(t)}flatten(t){return this._collection.flatten(t)}forEach(t){return this._collection.forEach(t)}getItemAt(t){return this._collection.getItemAt(t)}includes(t){return this._collection.includes(t)}indexOf(t,e){return this._collection.indexOf(t,e)}join(t){return this._collection.join(t)}lastIndexOf(t,e){return this._collection.lastIndexOf(t,e)}map(t){return this._collection.map(t)}on(...t){const[e,i]=t;return super.on(e,i)}pop(){return this.removeAt(this.length-1)}push(t){return this.add(t,this.length),this.length}reduce(t,e){return this._collection.reduce(t,e)}reduceRight(t,e){return this._collection.reduceRight(t,e)}remove(t){return this.removeAt(this.indexOf(t))}removeAll(){const t=[];for(;this.length;)t.push(this.pop());return t}removeAt(t){return this._collection.removeAt(t)}removeMany(t){if(!t)return;const e=[];for(let i=0;i<t.length;i++){const r="function"==typeof t.getItemAt?t.getItemAt(i):t[i],o=this.indexOf(r);o>=0&&e.push(this.removeAt(o))}return e}reorder(t,e){return this._collection.reorder(t,e)}reverse(){return this._collection.reverse(),this}shift(){return this.removeAt(0)}slice(t,e){return this._collection.slice(t,e)}some(t){return this._collection.some(t)}sort(t){return this._collection.sort(t),this}splice(t,e,...i){const r=[];for(let i=e;i>0;i--)r.push(this.removeAt(t));let o=t;return i.forEach((t=>{this.add(t,o),o++})),r}toArray(){return this._collection.toArray()}unshift(t){return this.add(t,0),this.length}_get(t){throw Error()}_set(t,e){throw Error()}}
+import{Observable as t}from"../support/Observable.js";import{onCollectionPropertyChange as e}from"./watch.js";export class CollectionProxy extends t{get length(){return this._collection.length}get declaredClass(){return"esri.core.Collection"}get destroyed(){return this._destroyed}set destroyed(t){this._destroyed=t}get initialized(){return this._initialized}set initialized(t){this._initialized=t}get _collection(){if(void 0===this._collectionField)throw new Error("CollectionProxy requires a backing collection.");return this._collectionField}set _collection(t){this._collectionField=t}_destroyed=!1;_initialized=!0;_afterChangesHandle;_collectionField;constructor(t){super(),this._collectionField=t,e(this,"_collectionField",(t=>{this.emit("change",t)})),this.watch("_collectionField.length",(()=>this.notifyChange("length"))),this.watch("_collectionField",(t=>{this._afterChangesHandle?.remove(),this._afterChangesHandle=t?.on("after-changes",(t=>this.emit("after-changes",t))),this.emit("after-changes")}),!0),null!=this._collectionField&&(this._afterChangesHandle=this._collectionField.on("after-changes",(t=>this.emit("after-changes",t))))}*[Symbol.iterator](){for(const t of this._collection)yield t}add(t,e){return this._collection.add(t,e),this}addMany(t,e){if(!t)return this;if(arguments.length>1){let i=e;for(let e=0;e<t.length;e++)"function"==typeof t.getItemAt?this.add(t.getItemAt(e),i++):this.add(t[e],i++)}else for(let e=0;e<t.length;e++)"function"==typeof t.getItemAt?this.add(t.getItemAt(e)):this.add(t[e]);return this}clone(){const t=Object.create(Object.getPrototypeOf(this));return t._collection=this._collection,t}concat(t){return this._collection.concat(t)}destroy(){}every(t){return this._collection.every(t)}filter(t){return this._collection.filter(t)}find(t){return this._collection.find(t)}findIndex(t){return this._collection.findIndex(t)}flatten(t){return this._collection.flatten(t)}forEach(t){return this._collection.forEach(t)}getItemAt(t){return this._collection.getItemAt(t)}includes(t){return this._collection.includes(t)}indexOf(t,e){return this._collection.indexOf(t,e)}join(t){return this._collection.join(t)}lastIndexOf(t,e){return this._collection.lastIndexOf(t,e)}map(t){return this._collection.map(t)}on(t,e){return super.on(t,e)}pop(){return this.removeAt(this.length-1)}push(t){return this.add(t,this.length),this.length}reduce(t,e){return this._collection.reduce(t,e)}reduceRight(t,e){return this._collection.reduceRight(t,e)}remove(t){return this.removeAt(this.indexOf(t))}removeAll(){const t=[];for(;this.length;)t.push(this.pop());return t}removeAt(t){return this._collection.removeAt(t)}removeMany(t){const e=[];for(let i=0;i<t.length;i++){const r="function"==typeof t.getItemAt?t.getItemAt(i):t[i],o=this.indexOf(r);o>=0&&e.push(this.removeAt(o))}return e}reorder(t,e){return this._collection.reorder(t,e)}reverse(){return this._collection.reverse(),this}shift(){return this.removeAt(0)}slice(t,e){return this._collection.slice(t,e)}some(t){return this._collection.some(t)}sort(t){return this._collection.sort(t),this}splice(t,e,...i){const r=[];for(let i=e;i>0;i--)r.push(this.removeAt(t));let o=t;return i.forEach((t=>{this.add(t,o),o++})),r}toArray(){return this._collection.toArray()}unshift(t){return this.add(t,0),this.length}_get(t){throw Error()}_set(t,e){throw Error()}}

package/utilities/_gml.js

@@ -1 +1 @@
-import e from"@arcgis/core/geometry/Extent";import n from"@arcgis/core/geometry/Multipoint";import t from"@arcgis/core/geometry/Point";import o from"@arcgis/core/geometry/Polygon";import r from"@arcgis/core/geometry/Polyline";import s from"@arcgis/core/geometry/SpatialReference";import{ArgumentError as i}from"../ArgumentError.js";import{getGmlNS as a,ogcSrsToEsriSr as c,webMercatorAliases as m}from"./_ogc.js";import{checkArg as l}from"./checkArg.js";import{isExtent as g,isPolygon as f}from"./esri.js";const p="Unable to convert the GML geometry into an Esri geometry.";export function gmlToEsri(s){switch(l("geometry",s).isNotMissing(),s.localName){case"Point":return function(e){const n=h(e),o=u(e);if(o&&o.length>1)return new t({x:o[0],y:o[1],spatialReference:n});throw new i(p)}(s);case"MultiPoint":return function(e){const t=new Array,o=h(e);if(e.childElementCount>0){const n=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"pointMember")),o=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"pointMembers")),r=n.concat(...o);for(const e of r){const n=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"Point"));for(const e of n)t.push(u(e))}}if(t&&t.length>0)return new n({points:t,spatialReference:o});throw new i(p)}(s);case"LineString":case"Curve":case"MultiLineString":case"MultiCurve":return function(e){let n;const t=h(e);"LineString"===e.localName?n=function(e){const n=y(e);return[n]}(e):"Curve"===e.localName&&e.childElementCount>0?n=function(e){const n=new Array,t=e.getElementsByTagNameNS(e.namespaceURI,"segments");if(t.length>0){const o=Array.from(t[0].getElementsByTagNameNS(e.namespaceURI,"LineStringSegment"));for(const e of o){const t=y(e);n.push(t)}}return n}(e):"MultiLineString"===e.localName&&e.childElementCount>0?n=function(e){const n=new Array,t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"lineStringMember"));for(const e of t){const t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"LineString"));for(const e of t)n.push(y(e))}return n}(e):"MultiCurve"===e.localName&&e.childElementCount>0&&(n=function(e){const n=new Array,t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"curveMember")),o=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"curveMembers")),r=t.concat(...o);for(const e of r){const t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"LineString"));for(const e of t)n.push(y(e))}return n}(e));if(n&&n.length>0)return new r({paths:n,spatialReference:t});throw new i(p)}(s);case"Polygon":case"MultiPolygon":case"MultiSurface":return function(e){let n;const t=h(e);"Polygon"===e.localName?n=N(e):"MultiPolygon"===e.localName?n=function(e){l("geometry",e).isNotMissing();const n=new Array,t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"polygonMember"));for(const e of t){const t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"Polygon"));for(const e of t){const t=N(e);n.push(...t)}}return n}(e):"MultiSurface"===e.localName&&(n=function(e){l("geometry",e).isNotMissing();const n=new Array,t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"surfaceMember"));for(const e of t){const t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"Polygon"));for(const e of t){const t=N(e);n.push(...t)}}return n}(e));if(n&&n.length>0)return new o({rings:n,spatialReference:t});throw new i(p)}(s);case"Envelope":return function(n){const t=h(n),o=function(e){if(l("geometry",e).isNotMissing(),"Envelope"!==e.localName)throw new i(p);const n=function(e){const n=e.getElementsByTagNameNS(e.namespaceURI,"coordinates");if(0===n.length)return;const t=n[1],o=t.getAttribute("cs")??",",r=t.getAttribute("ts")??" ",{data:s}=t.childNodes[0];return s.split(o).map((e=>U(e,r)))}(e);if(n)return n;const t=e.getElementsByTagNameNS(e.namespaceURI,"pos");if(2===t.length&&t[0].childNodes[0].nodeType===Node.TEXT_NODE){const e=t[0].childNodes[0].data,n=t[0].childNodes[0].data;return[U(e),U(n)]}const o=e.getElementsByTagNameNS(e.namespaceURI,"lowerCorner"),r=e.getElementsByTagNameNS(e.namespaceURI,"upperCorner");if(o.length>0&&o[0].childNodes[0].nodeType===Node.TEXT_NODE&&r.length>0&&r[0].childNodes[0].nodeType===Node.TEXT_NODE){const e=o[0].childNodes[0].data,n=r[0].childNodes[0].data;return[U(e),U(n)]}throw new i(p)}(n);if(2===o.length){const[n,r]=o;return new e({spatialReference:t,xmin:n[0],xmax:r[0],ymin:n[1],ymax:r[1]})}throw new i(p)}(s);default:throw new i("Unrecognized geometry type.")}}export function esriToGml(e,n){switch(l("geometry",e).isNotMissing(),l("geometry type",e.type).isNotMissing(),l("gmlVersion",n.gmlVersion).isNotMissing(),e.type){case"point":return function(e,n){const t=a(n.gmlVersion),o=T(t,"Point","gml"),r=w(e,n),s=n.hasOwnProperty("srsDimension")?n.srsDimension:void 0;let i,c;E(o,r,s),"2.0"===n.gmlVersion||"3.0"===n.gmlVersion?(i=T(t,"coordinates","gml"),c=R(", ",e)):(i=T(t,"pos","gml"),c=R(" ",e));o.appendChild(i);const m=S(c);return i.appendChild(m),o}(e,n);case"polyline":return function(e,n){const t=a(n.gmlVersion),o=T(t,"LineString","gml"),r=w(e,n),s=n.hasOwnProperty("srsDimension")?n.srsDimension:void 0;let i,c;E(o,r,s),"2.0"===n.gmlVersion||"3.0"===n.gmlVersion?(i=T(t,"coordinates","gml"),c=A(", ",e)):(i=T(t,"posList","gml"),c=A(" ",e));o.appendChild(i);const m=S(c);return i.appendChild(m),o}(e,n);case"polygon":case"extent":return function(e,n){const t=a(n.gmlVersion),o=T(t,"Polygon","gml"),r=w(e,n),s=n.hasOwnProperty("srsDimension")?n.srsDimension:void 0;E(o,r,s);const i="2.0"===n.gmlVersion?T(t,"outerBoundaryIs","gml"):T(t,"exterior","gml");o.appendChild(i);const c=T(t,"LinearRing","gml");let m,l;i.appendChild(c),"2.0"===n.gmlVersion||"3.0"===n.gmlVersion?(m=T(t,"coordinates","gml"),l=M(", ",e)):(m=T(t,"posList","gml"),l=M(" ",e));c.appendChild(m);const g=S(l);return m.appendChild(g),o}(e,n);default:throw new i(`Unrecognized geometry type: ${e.type}. Must be one of point, polyline or polygon.`)}}function u(e){if(l("geometry",e).isNotMissing(),"Point"!==e.localName)throw new i(p);const n=e.getElementsByTagNameNS(e.namespaceURI,"coordinates"),t=e.getElementsByTagNameNS(e.namespaceURI,"pos");if(n.length>0&&n[0].childNodes[0].nodeType===Node.TEXT_NODE){return U(n[0].childNodes[0].data)}if(t.length>0&&t[0].childNodes[0].nodeType===Node.TEXT_NODE){return U(t[0].childNodes[0].data)}throw new i(p)}function N(e){l("geometry",e).isNotMissing();const n=new Array,t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"outerBoundaryIs")),o=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"innerBoundaryIs")),r=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"exterior")),s=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"interior")),i=t.concat(...o).concat(...r).concat(...s);for(const e of i){const t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"LinearRing"));for(const e of t)n.push(y(e))}return n}function y(e){if(l("geometry",e).isNotMissing(),"LineString"!==e.localName&&"LinearRing"!==e.localName&&"LineStringSegment"!==e.localName)throw new i(p);const n=e.getElementsByTagNameNS(e.namespaceURI,"coordinates"),t=e.getElementsByTagNameNS(e.namespaceURI,"posList");if(n.length>0&&n[0].childNodes[0].nodeType===Node.TEXT_NODE){return d(n[0].childNodes[0].data)}if(t.length>0&&t[0].childNodes[0].nodeType===Node.TEXT_NODE){return d(t[0].childNodes[0].data)}throw new i(p)}function d(e){const n=e.replace(/,/g,"").split(" ").filter((e=>!!e)).map(Number),t=new Array;for(let e=0;e<n.length;e+=2){if(void 0===n[e+1])throw new i(p);t.push([n[e],n[e+1]])}if(t.length>0)return t;throw new i(p)}function h(e){return l("geometry",e).isNotMissing(),e.hasAttribute("srsName")?c(e.getAttribute("srsName")):s.WebMercator}function w(e,n){if(n.hasOwnProperty("srsName"))return n.srsName;if(void 0!==e.spatialReference.wkid&&null!==e.spatialReference.wkid){if(e.spatialReference.wkid<32767)return`EPSG:${e.spatialReference.wkid}`;if(m.includes(e.spatialReference.wkid))return"EPSG:3857"}throw new i("Unable to convert Esri WKT spatial reference to an OGC spatial reference")}function E(e,n,t){if(null!=n&&(e.setAttribute("srsName",n),null!=t)){const n=t<1?2:t;e.setAttribute("srsDimension",n.toString())}}function T(e,n,t){l("namespace",e).isNotMissing(),l("name",n).isNotMissing();return document.implementation.createDocument(void 0,"temp",void 0).createElementNS(e,t?`${t}:${n}`:n)}function S(e){return document.implementation.createDocument(void 0,"temp",void 0).createTextNode(e)}function R(e,n){const t=n;return" "===e?`${t.x} ${t.y}`:`${t.x}, ${t.y}`}function A(e,n){return n.paths[0].map((n=>n.join(e))).join(" ")}function M(e,n){let t;if(f(n))t=n.rings[0];else if(g(n)){const{xmin:e,xmax:o,ymin:r,ymax:s}=n;t=[[e,s],[o,s],[o,r],[e,r],[e,s]]}return t.map((n=>n.join(e))).join(" ")}function U(e,n=" "){const t=e.replace(/,/g,"").split(n).map(Number);if(2===t.length)return[t[0],t[1]];throw new i(p)}
+import e from"@arcgis/core/geometry/Extent";import n from"@arcgis/core/geometry/Multipoint";import t from"@arcgis/core/geometry/Point";import o from"@arcgis/core/geometry/Polygon";import r from"@arcgis/core/geometry/Polyline";import s from"@arcgis/core/geometry/SpatialReference";import{ArgumentError as i}from"../ArgumentError.js";import{getGmlNS as a,ogcSrsToEsriSr as c,webMercatorAliases as m}from"./_ogc.js";import{checkArg as l}from"./checkArg.js";import{isExtent as g,isPolygon as f}from"./esri.js";const p="Unable to convert the GML geometry into an Esri geometry.";export function gmlToEsri(s){switch(l("geometry",s).isNotMissing(),s.localName){case"Point":return function(e){const n=h(e),o=u(e);if(o&&o.length>1)return new t({x:o[0],y:o[1],spatialReference:n});throw new i(p)}(s);case"MultiPoint":return function(e){const t=new Array,o=h(e);if(e.childElementCount>0){const n=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"pointMember")),o=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"pointMembers")),r=n.concat(...o);for(const e of r){const n=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"Point"));for(const e of n)t.push(u(e))}}if(t&&t.length>0)return new n({points:t,spatialReference:o});throw new i(p)}(s);case"LineString":case"Curve":case"MultiLineString":case"MultiCurve":return function(e){let n;const t=h(e);"LineString"===e.localName?n=function(e){const n=y(e);return[n]}(e):"Curve"===e.localName&&e.childElementCount>0?n=function(e){const n=new Array,t=e.getElementsByTagNameNS(e.namespaceURI,"segments");if(t.length>0){const o=Array.from(t[0].getElementsByTagNameNS(e.namespaceURI,"LineStringSegment"));for(const e of o){const t=y(e);n.push(t)}}return n}(e):"MultiLineString"===e.localName&&e.childElementCount>0?n=function(e){const n=new Array,t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"lineStringMember"));for(const e of t){const t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"LineString"));for(const e of t)n.push(y(e))}return n}(e):"MultiCurve"===e.localName&&e.childElementCount>0&&(n=function(e){const n=new Array,t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"curveMember")),o=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"curveMembers")),r=t.concat(...o);for(const e of r){const t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"LineString"));for(const e of t)n.push(y(e))}return n}(e));if(n&&n.length>0)return new r({paths:n,spatialReference:t});throw new i(p)}(s);case"Polygon":case"MultiPolygon":case"MultiSurface":return function(e){let n;const t=h(e);"Polygon"===e.localName?n=N(e):"MultiPolygon"===e.localName?n=function(e){l("geometry",e).isNotMissing();const n=new Array,t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"polygonMember"));for(const e of t){const t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"Polygon"));for(const e of t){const t=N(e);n.push(...t)}}return n}(e):"MultiSurface"===e.localName&&(n=function(e){l("geometry",e).isNotMissing();const n=new Array,t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"surfaceMember"));for(const e of t){const t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"Polygon"));for(const e of t){const t=N(e);n.push(...t)}}return n}(e));if(n&&n.length>0)return new o({rings:n,spatialReference:t});throw new i(p)}(s);case"Box":case"Envelope":return function(n){const t=h(n),o=function(e){if(l("geometry",e).isNotMissing(),"Envelope"!==e.localName&&"Box"!==e.localName)throw new i(p);const n=function(e){const n=e.getElementsByTagNameNS(e.namespaceURI,"coordinates");if(0===n.length)return;const t=n[0],o=t.getAttribute("cs")??",",r=t.getAttribute("ts")??" ",{data:s}=t.childNodes[0];return s.split(r).map((e=>B(e,o)))}(e);if(n)return n;const t=e.getElementsByTagNameNS(e.namespaceURI,"pos");if(2===t.length&&t[0].childNodes[0].nodeType===Node.TEXT_NODE){const e=t[0].childNodes[0].data,n=t[0].childNodes[0].data;return[B(e),B(n)]}const o=e.getElementsByTagNameNS(e.namespaceURI,"lowerCorner"),r=e.getElementsByTagNameNS(e.namespaceURI,"upperCorner");if(o.length>0&&o[0].childNodes[0].nodeType===Node.TEXT_NODE&&r.length>0&&r[0].childNodes[0].nodeType===Node.TEXT_NODE){const e=o[0].childNodes[0].data,n=r[0].childNodes[0].data;return[B(e),B(n)]}throw new i(p)}(n);if(2===o.length){const[n,r]=o;return new e({spatialReference:t,xmin:n[0],xmax:r[0],ymin:n[1],ymax:r[1]})}throw new i(p)}(s);default:throw new i("Unrecognized geometry type.")}}export function esriToGml(e,n){switch(l("geometry",e).isNotMissing(),l("geometry type",e.type).isNotMissing(),l("gmlVersion",n.gmlVersion).isNotMissing(),e.type){case"point":return function(e,n){const t=a(n.gmlVersion),o=T(t,"Point","gml"),r=w(e,n),s=n.hasOwnProperty("srsDimension")?n.srsDimension:void 0;let i,c;E(o,r,s),"2.0"===n.gmlVersion||"3.0"===n.gmlVersion?(i=T(t,"coordinates","gml"),c=R(", ",e)):(i=T(t,"pos","gml"),c=R(" ",e));o.appendChild(i);const m=S(c);return i.appendChild(m),o}(e,n);case"polyline":return function(e,n){const t=a(n.gmlVersion),o=T(t,"LineString","gml"),r=w(e,n),s=n.hasOwnProperty("srsDimension")?n.srsDimension:void 0;let i,c;E(o,r,s),"2.0"===n.gmlVersion||"3.0"===n.gmlVersion?(i=T(t,"coordinates","gml"),c=A(", ",e)):(i=T(t,"posList","gml"),c=A(" ",e));o.appendChild(i);const m=S(c);return i.appendChild(m),o}(e,n);case"polygon":case"extent":return function(e,n){const t=a(n.gmlVersion),o=T(t,"Polygon","gml"),r=w(e,n),s=n.hasOwnProperty("srsDimension")?n.srsDimension:void 0;E(o,r,s);const i="2.0"===n.gmlVersion?T(t,"outerBoundaryIs","gml"):T(t,"exterior","gml");o.appendChild(i);const c=T(t,"LinearRing","gml");let m,l;i.appendChild(c),"2.0"===n.gmlVersion||"3.0"===n.gmlVersion?(m=T(t,"coordinates","gml"),l=M(", ",e)):(m=T(t,"posList","gml"),l=M(" ",e));c.appendChild(m);const g=S(l);return m.appendChild(g),o}(e,n);default:throw new i(`Unrecognized geometry type: ${e.type}. Must be one of point, polyline or polygon.`)}}function u(e){if(l("geometry",e).isNotMissing(),"Point"!==e.localName)throw new i(p);const n=e.getElementsByTagNameNS(e.namespaceURI,"coordinates"),t=e.getElementsByTagNameNS(e.namespaceURI,"pos");if(n.length>0&&n[0].childNodes[0].nodeType===Node.TEXT_NODE){return B(n[0].childNodes[0].data)}if(t.length>0&&t[0].childNodes[0].nodeType===Node.TEXT_NODE){return B(t[0].childNodes[0].data)}throw new i(p)}function N(e){l("geometry",e).isNotMissing();const n=new Array,t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"outerBoundaryIs")),o=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"innerBoundaryIs")),r=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"exterior")),s=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"interior")),i=t.concat(...o).concat(...r).concat(...s);for(const e of i){const t=Array.from(e.getElementsByTagNameNS(e.namespaceURI,"LinearRing"));for(const e of t)n.push(y(e))}return n}function y(e){if(l("geometry",e).isNotMissing(),"LineString"!==e.localName&&"LinearRing"!==e.localName&&"LineStringSegment"!==e.localName)throw new i(p);const n=e.getElementsByTagNameNS(e.namespaceURI,"coordinates"),t=e.getElementsByTagNameNS(e.namespaceURI,"posList");if(n.length>0&&n[0].childNodes[0].nodeType===Node.TEXT_NODE){return d(n[0].childNodes[0].data)}if(t.length>0&&t[0].childNodes[0].nodeType===Node.TEXT_NODE){return d(t[0].childNodes[0].data)}throw new i(p)}function d(e){const n=e.replace(/,/g," ").split(" ").filter((e=>!!e)).map(Number),t=new Array;for(let e=0;e<n.length;e+=2){if(void 0===n[e+1])throw new i(p);t.push([n[e],n[e+1]])}if(t.length>0)return t;throw new i(p)}function h(e){return l("geometry",e).isNotMissing(),e.hasAttribute("srsName")?c(e.getAttribute("srsName")):s.WebMercator}function w(e,n){if(n.hasOwnProperty("srsName"))return n.srsName;if(void 0!==e.spatialReference.wkid&&null!==e.spatialReference.wkid){if(e.spatialReference.wkid<32767)return`EPSG:${e.spatialReference.wkid}`;if(m.includes(e.spatialReference.wkid))return"EPSG:3857"}throw new i("Unable to convert Esri WKT spatial reference to an OGC spatial reference")}function E(e,n,t){if(null!=n&&(e.setAttribute("srsName",n),null!=t)){const n=t<1?2:t;e.setAttribute("srsDimension",n.toString())}}function T(e,n,t){l("namespace",e).isNotMissing(),l("name",n).isNotMissing();return document.implementation.createDocument(void 0,"temp",void 0).createElementNS(e,t?`${t}:${n}`:n)}function S(e){return document.implementation.createDocument(void 0,"temp",void 0).createTextNode(e)}function R(e,n){const t=n;return" "===e?`${t.x} ${t.y}`:`${t.x}, ${t.y}`}function A(e,n){return n.paths[0].map((n=>n.join(e))).join(" ")}function M(e,n){let t;if(f(n))t=n.rings[0];else if(g(n)){const{xmin:e,xmax:o,ymin:r,ymax:s}=n;t=[[e,s],[o,s],[o,r],[e,r],[e,s]]}return t.map((n=>n.join(e))).join(" ")}function B(e,n=" "){const t=e.replace(/,/g,n).split(n).filter((e=>e)).map(Number);if(2===t.length)return[t[0],t[1]];throw new i(p)}

package/utilities/_ogc.d.ts

@@ -47,7 +47,7 @@ export declare function inferGmlVersion(wfsVersion: string): GmlVersion;
  *
  * @param ns The namespace to check.
  */
-export declare function isGmlNamespace(ns: string): boolean;
+export declare function isGmlNamespace(ns: string | undefined | null): boolean;
 /**
  * Naively converts an EPSG OGC spatial reference to an Esri spatial reference.
  *

package/utilities/array.d.ts

@@ -50,7 +50,7 @@ export declare function chunk<T>(array: T[], size: number): T[][];
  * @returns An object containing groups, keyed by group key. The order of items
  *   is preserved within each group.
  */
-export declare function groupBy<T, K>(array: T[], getKey: (item: T, index?: number) => K): Map<K, T[]>;
+export declare function groupBy<T, K>(array: T[], getKey: (item: T, index: number) => K): Map<K, T[]>;
 /**
  * Options that can be passed to {@link compare}.
  */

package/utilities/asyncIterable.d.ts

@@ -127,7 +127,7 @@ export declare function filter<T>(iterable: AsyncIterable<T>, p: (x: T, index?:
  * @param iterable The async iterator to search.
  * @param p The predicate to use for finding an item.
  */
-export declare function find<T>(iterable: AsyncIterable<T>, p: (x: T, index?: number) => boolean | PromiseLike<boolean>): Promise<T> | undefined;
+export declare function find<T>(iterable: AsyncIterable<T>, p: (x: T, index?: number) => boolean | PromiseLike<boolean>): Promise<T | undefined>;
 /**
  * Returns the first element in an async iterable, or undefined if there are no
  * elements.

package/utilities/iterable.d.ts

@@ -6,7 +6,7 @@ export type { CompareOptions } from "./array.js";
  * @param iterable The iterator to map over.
  * @param f The mapping function.
  */
-export declare function map<T, U>(iterable: Iterable<T>, f: (x: T, index?: number) => U): Iterable<U>;
+export declare function map<T, U>(iterable: Iterable<T>, f: (x: T, index: number) => U): Iterable<U>;
 /**
  * The equivalent of Array.prototype.reduce for iterators.
  *

package/utilities/object.d.ts

@@ -28,7 +28,7 @@ export declare function map<T, K extends keyof T, V>(obj: T, callback: (value: T
  * @returns An object containing the properties for which the callback function
  *   returned a value that evaluates to `true`.
  */
-export declare function filter<T extends Record<string, unknown>>(obj: T, callback: (value: unknown, key: keyof T, obj: T) => unknown): Partial<T>;
+export declare function filter<T extends Record<string, unknown>>(obj: T, callback: (value: T[keyof T], key: keyof T, obj: T) => boolean): Partial<T>;
 /**
  * Like Object.keys, but unsound in exchange for more convenience.
  *

package/utilities/promise.d.ts

@@ -35,70 +35,7 @@ export declare function timeout<T>(ms: number, promise: Promise<T>, message?: st
  * @param values The array of values to map over.
  * @param mapper The mapper function to apply to each element.
  */
-export declare function map<T, U>(values: PromiseLike<Iterable<PromiseLike<T>>>, mapper: (item: T, index: number) => U | PromiseLike<U>): Promise<U[]>;
-/**
- * Map an array, or a promise of an array, which contains promises (or a mix of
- * promises and values) with the given mapper function with the signature
- * `(item, index)` where `item` is the resolved value of a respective promise in
- * the input array. If any promise in the input array is rejected the returned
- * promise is rejected as well.
- *
- * If the mapper function returns promises or then-ables, the returned promise
- * will wait for all the mapped results to be resolved as well.
- *
- * The mapper function for a given item is called as soon as possible, that is,
- * when the promise for that item's index in the input array is fulfilled. This
- * means that multiple promises may be pending concurrently, and that the mapper
- * function may not be applied to elements in the order that they appear in the
- * original array. However, items in the resulting array will always appear in
- * the same order as the input items.
- *
- * @param values The array of values to map over.
- * @param mapper The mapper function to apply to each element.
- */
-export declare function map<T, U>(values: PromiseLike<Iterable<T>>, mapper: (item: T, index: number) => U | PromiseLike<U>): Promise<U[]>;
-/**
- * Map an array, or a promise of an array, which contains promises (or a mix of
- * promises and values) with the given mapper function with the signature
- * `(item, index)` where `item` is the resolved value of a respective promise in
- * the input array. If any promise in the input array is rejected the returned
- * promise is rejected as well.
- *
- * If the mapper function returns promises or then-ables, the returned promise
- * will wait for all the mapped results to be resolved as well.
- *
- * The mapper function for a given item is called as soon as possible, that is,
- * when the promise for that item's index in the input array is fulfilled. This
- * means that multiple promises may be pending concurrently, and that the mapper
- * function may not be applied to elements in the order that they appear in the
- * original array. However, items in the resulting array will always appear in
- * the same order as the input items.
- *
- * @param values The array of values to map over.
- * @param mapper The mapper function to apply to each element.
- */
-export declare function map<T, U>(values: Iterable<PromiseLike<T>>, mapper: (item: T, index: number) => U | PromiseLike<U>): Promise<U[]>;
-/**
- * Map an array, or a promise of an array, which contains promises (or a mix of
- * promises and values) with the given mapper function with the signature
- * `(item, index)` where `item` is the resolved value of a respective promise in
- * the input array. If any promise in the input array is rejected the returned
- * promise is rejected as well.
- *
- * If the mapper function returns promises or then-ables, the returned promise
- * will wait for all the mapped results to be resolved as well.
- *
- * The mapper function for a given item is called as soon as possible, that is,
- * when the promise for that item's index in the input array is fulfilled. This
- * means that multiple promises may be pending concurrently, and that the mapper
- * function may not be applied to elements in the order that they appear in the
- * original array. However, items in the resulting array will always appear in
- * the same order as the input items.
- *
- * @param values The array of values to map over.
- * @param mapper The mapper function to apply to each element.
- */
-export declare function map<T, U>(values: Iterable<T>, mapper: (item: T, index: number) => U | PromiseLike<U>): Promise<U[]>;
+export declare function map<T, U>(values: PromiseLike<Iterable<T | PromiseLike<T>>> | Iterable<T | PromiseLike<T>>, mapper: (item: T, index: number) => U | PromiseLike<U>): Promise<U[]>;
 /**
  * Iterate over an array, or a promise of an array, which contains promises (or
  * a mix of promises and values) with the given iterator function with the
@@ -112,65 +49,7 @@ export declare function map<T, U>(values: Iterable<T>, mapper: (item: T, index:
  * @param values The array of values to iterate over.
  * @param iterator The iterator function to apply to each element.
  */
-export declare function each<T>(values: PromiseLike<Iterable<PromiseLike<T>>>, iterator: (item: T, index: number) => void | PromiseLike<void>): Promise<void>;
-/**
- * Iterate over an array, or a promise of an array, which contains promises (or
- * a mix of promises and values) with the given iterator function with the
- * signature `(item, index)` where `item` is the resolved value of a respective
- * promise in the input array. Iteration happens serially. If any promise in the
- * input array is rejected the returned promise is rejected as well.
- *
- * If the iterator function returns a promise or a thenable, the result for the
- * promise is awaited for before continuing with next iteration.
- *
- * @param values The array of values to iterate over.
- * @param iterator The iterator function to apply to each element.
- */
-export declare function each<T>(values: Iterable<PromiseLike<T>>, iterator: (item: T, index: number) => void | PromiseLike<void>): Promise<void>;
-/**
- * Iterate over an array, or a promise of an array, which contains promises (or
- * a mix of promises and values) with the given iterator function with the
- * signature `(item, index)` where `item` is the resolved value of a respective
- * promise in the input array. Iteration happens serially. If any promise in the
- * input array is rejected the returned promise is rejected as well.
- *
- * If the iterator function returns a promise or a thenable, the result for the
- * promise is awaited for before continuing with next iteration.
- *
- * @param values The array of values to iterate over.
- * @param iterator The iterator function to apply to each element.
- */
-export declare function each<T>(values: PromiseLike<Iterable<T>>, iterator: (item: T, index: number) => void | PromiseLike<void>): Promise<void>;
-/**
- * Iterate over an array, or a promise of an array, which contains promises (or
- * a mix of promises and values) with the given iterator function with the
- * signature `(item, index)` where `item` is the resolved value of a respective
- * promise in the input array. Iteration happens serially. If any promise in the
- * input array is rejected the returned promise is rejected as well.
- *
- * If the iterator function returns a promise or a thenable, the result for the
- * promise is awaited for before continuing with next iteration.
- *
- * @param values The array of values to iterate over.
- * @param iterator The iterator function to apply to each element.
- */
-export declare function each<T>(values: Iterable<T>, iterator: (item: T, index: number) => void | PromiseLike<void>): Promise<void>;
-/**
- * Same as {@link each}, except that the elements are processed in parallel
- * rather than sequentially.
- *
- * @param values The array of values to iterate over.
- * @param iterator The iterator function to apply to each element.
- */
-export declare function parallelEach<T, U>(values: PromiseLike<Iterable<PromiseLike<T>>>, iterator: (item: T, index: number) => U | PromiseLike<U>): Promise<void>;
-/**
- * Same as {@link each}, except that the elements are processed in parallel
- * rather than sequentially.
- *
- * @param values The array of values to iterate over.
- * @param iterator The iterator function to apply to each element.
- */
-export declare function parallelEach<T, U>(values: Iterable<PromiseLike<T>>, iterator: (item: T, index: number) => U | PromiseLike<U>): Promise<void>;
+export declare function each<T>(values: Iterable<T | PromiseLike<T>> | PromiseLike<Iterable<T | PromiseLike<T>>>, iterator: (item: T, index: number) => void | PromiseLike<void>): Promise<void>;
 /**
  * Same as {@link each}, except that the elements are processed in parallel
  * rather than sequentially.
@@ -178,76 +57,7 @@ export declare function parallelEach<T, U>(values: Iterable<PromiseLike<T>>, ite
  * @param values The array of values to iterate over.
  * @param iterator The iterator function to apply to each element.
  */
-export declare function parallelEach<T, U>(values: Iterable<T> | PromiseLike<Iterable<T>>, iterator: (item: T, index: number) => U | PromiseLike<U>): Promise<void>;
-/**
- * Reduce an array, or a promise of an array, which contains a promises (or a
- * mix of promises and values) with the given reducer function with the
- * signature `(total, current, index)` where `current` is the resolved value of
- * a respective promise in the input array. If any promise in the input array is
- * rejected the returned promise is rejected as well.
- *
- * If the reducer function returns a promise or a thenable, the result for the
- * promise is awaited for before continuing with next iteration.
- *
- * The original array is not modified. If no `initialValue` is given and the
- * array doesn't contain at least 2 items, the callback will not be called and
- * `undefined` is returned. If no `initialValue` is given and the array contains
- * at least two items, the first element is used as the initial value. If
- * `initialValue` is given and the array doesn't have at least 1 item,
- * `initialValue` is returned.
- *
- * @param values The array of values to iterate over.
- * @param reducer The reducer function.
- * @param initialValue Optional. The initial seed value for the reducer
- *   function.
- */
-export declare function reduce<T, U>(values: PromiseLike<Iterable<PromiseLike<T>>>, reducer: (total: U, current: T, index: number) => U | PromiseLike<U>, initialValue?: U): Promise<U>;
-/**
- * Reduce an array, or a promise of an array, which contains a promises (or a
- * mix of promises and values) with the given reducer function with the
- * signature `(total, current, index)` where `current` is the resolved value of
- * a respective promise in the input array. If any promise in the input array is
- * rejected the returned promise is rejected as well.
- *
- * If the reducer function returns a promise or a thenable, the result for the
- * promise is awaited for before continuing with next iteration.
- *
- * The original array is not modified. If no `initialValue` is given and the
- * array doesn't contain at least 2 items, the callback will not be called and
- * `undefined` is returned. If no `initialValue` is given and the array contains
- * at least two items, the first element is used as the initial value. If
- * `initialValue` is given and the array doesn't have at least 1 item,
- * `initialValue` is returned.
- *
- * @param values The array of values to iterate over.
- * @param reducer The reducer function.
- * @param initialValue Optional. The initial seed value for the reducer
- *   function.
- */
-export declare function reduce<T, U>(values: PromiseLike<Iterable<T>>, reducer: (total: U, current: T, index: number) => U | PromiseLike<U>, initialValue?: U): Promise<U>;
-/**
- * Reduce an array, or a promise of an array, which contains a promises (or a
- * mix of promises and values) with the given reducer function with the
- * signature `(total, current, index)` where `current` is the resolved value of
- * a respective promise in the input array. If any promise in the input array is
- * rejected the returned promise is rejected as well.
- *
- * If the reducer function returns a promise or a thenable, the result for the
- * promise is awaited for before continuing with next iteration.
- *
- * The original array is not modified. If no `initialValue` is given and the
- * array doesn't contain at least 2 items, the callback will not be called and
- * `undefined` is returned. If no `initialValue` is given and the array contains
- * at least two items, the first element is used as the initial value. If
- * `initialValue` is given and the array doesn't have at least 1 item,
- * `initialValue` is returned.
- *
- * @param values The array of values to iterate over.
- * @param reducer The reducer function.
- * @param initialValue Optional. The initial seed value for the reducer
- *   function.
- */
-export declare function reduce<T, U>(values: Iterable<PromiseLike<T>>, reducer: (total: U, current: T, index: number) => U | PromiseLike<U>, initialValue?: U): Promise<U>;
+export declare function parallelEach<T, U>(values: Iterable<T | PromiseLike<T>> | PromiseLike<Iterable<T | PromiseLike<T>>>, iterator: (item: T, index: number) => U | PromiseLike<U>): Promise<void>;
 /**
  * Reduce an array, or a promise of an array, which contains a promises (or a
  * mix of promises and values) with the given reducer function with the
@@ -270,7 +80,8 @@ export declare function reduce<T, U>(values: Iterable<PromiseLike<T>>, reducer:
  * @param initialValue Optional. The initial seed value for the reducer
  *   function.
  */
-export declare function reduce<T, U>(values: Iterable<T>, reducer: (total: U, current: T, index: number) => U | PromiseLike<U>, initialValue?: U): Promise<U>;
+export declare function reduce<T, U>(values: Iterable<T | PromiseLike<T>> | PromiseLike<Iterable<T | PromiseLike<T>>>, reducer: (total: U, current: T, index: number) => U | PromiseLike<U>, initialValue: U): Promise<U>;
+export declare function reduce<T, U>(values: Iterable<T | PromiseLike<T>> | PromiseLike<Iterable<T | PromiseLike<T>>>, reducer: (total: U, current: T, index: number) => U | PromiseLike<U>): Promise<U | undefined>;
 type Awaited<T> = T extends PromiseLike<infer PT> ? PT : T;
 /**
  * Like `Promise.all` but for object properties instead of array items. Returns

package/utilities/promise.js

@@ -1 +1 @@
-import{checkArg as t}from"./checkArg.js";import{map as a}from"./iterable.js";export function delay(t=0){return new Promise((a=>{setTimeout(a,t)}))}export async function timeout(t,a,i){let e=!1;return new Promise((async(r,s)=>{setTimeout((()=>{e||s("string"==typeof i?new Error(i):i||new Error("Timed out while waiting for promise to resolve."))}),t);try{r(await a)}catch(t){s(t)}finally{e=!0}}))}export async function map(i,e){t("values",i).isNotMissing(),t("mapper",e).isNotMissing();const r=Array.from(a(await i,(async(t,a)=>e(await t,a))));return Promise.all(r)}export async function each(a,i){t("values",a).isNotMissing(),t("iterator",i).isNotMissing();const e=await a;let r=0;for(const t of e)await i(await t,r++)}export async function parallelEach(t,a){await map(t,a)}export function reduce(a,i,e){const r=arguments.length;return(async()=>{t("values",a).isNotMissing(),t("reducer",i).isNotMissing();let s=[...await a],n=e;if(r<3){if(s.length<2)return;n=await s[0],s=s.slice(1)}for(let t=0;t<s.length;t++)n=await i(n,await s[t],t);return n})()}export async function props(a){t("object",a).isNotMissing().satisfies((t=>"object"==typeof t));const i={},e=await a;return await parallelEach(Object.keys(e),(async t=>{const a=await e[t];e.hasOwnProperty(t)&&(i[t]=a)})),i}export async function asyncFlatMap(t,a){return(await Promise.all(t.map(a))).flat()}
+import{checkArg as t}from"./checkArg.js";import{map as a}from"./iterable.js";export function delay(t=0){return new Promise((a=>{setTimeout(a,t)}))}export async function timeout(t,a,i){let e=!1;return new Promise((async(r,s)=>{setTimeout((()=>{e||s("string"==typeof i?new Error(i):i||new Error("Timed out while waiting for promise to resolve."))}),t);try{r(await a)}catch(t){s(t)}finally{e=!0}}))}export async function map(i,e){t("values",i).isNotMissing(),t("mapper",e).isNotMissing();const r=Array.from(a(await i,(async(t,a)=>e(await t,a))));return Promise.all(r)}export async function each(a,i){t("values",a).isNotMissing(),t("iterator",i).isNotMissing();const e=await a;let r=0;for(const t of e)await i(await t,r++)}export async function parallelEach(t,a){await map(t,a)}export function reduce(a,i,e){const r=arguments.length;return(async()=>{t("values",a).isNotMissing(),t("reducer",i).isNotMissing();const s=[...await a];let n=e;if(r<3){if(s.length<2)return;n=await s.shift()}for(let t=0;t<s.length;t++)n=await i(n,await s[t],t);return n})()}export async function props(a){t("object",a).isNotMissing().satisfies((t=>"object"==typeof t));const i={},e=await a;return await parallelEach(Object.keys(e),(async t=>{const a=await e[t];e.hasOwnProperty(t)&&(i[t]=a)})),i}export async function asyncFlatMap(t,a){return(await Promise.all(t.map(a))).flat()}

package/utilities/scaleRanges.d.ts

@@ -38,9 +38,9 @@ export declare const getNextScale: (currentScale: number, scaleLevels?: number)
  *
  * @param id The Scale ID.
  */
-export declare const getScaleRange: (id: ScaleId) => number | undefined;
+export declare const getScaleRange: (id: ScaleId) => number;
 /**
- * A list of esri well known scale ranges. Copied from
+ * A list of esri well known scale ranges. See
  * arcgis-js-api\widgets\ScaleRangeSlider\ScaleRanges.js.
  */
 export declare const wellKnownScaleRanges: ScaleRange[];

package/utilities/scaleRanges.js

@@ -1 +1 @@
-export const expandExtentToScale=(e,l,s)=>{const c=e.width/l*s/e.width;return e.clone().expand(c)};export const getNextScale=(e,l=1)=>{let s=l;for(const l of wellKnownScaleRanges)if(l.scale>e&&0==--s)return l.scale};export const getScaleRange=e=>wellKnownScaleRanges.find((l=>l.id===e))?.scale;export const wellKnownScaleRanges=[{id:"room",scale:100},{id:"rooms",scale:400},{id:"smallBuilding",scale:800},{id:"building",scale:1999},{id:"buildings",scale:3999},{id:"street",scale:7499},{id:"streets",scale:14999},{id:"neighborhood",scale:29999},{id:"town",scale:59999},{id:"city",scale:119999},{id:"cities",scale:249999},{id:"metropolitanArea",scale:499999},{id:"county",scale:999999},{id:"counties",scale:1999999},{id:"stateProvince",scale:3999999},{id:"statesProvinces",scale:6999999},{id:"countriesSmall",scale:14999999},{id:"countriesBig",scale:34999999},{id:"continent",scale:99999999},{id:"world",scale:147914382}];
+export const expandExtentToScale=(e,t,n)=>{const o=e.width/t*n/e.width;return e.clone().expand(o)};export const getNextScale=(e,t=1)=>{let n=t;for(const t of wellKnownScaleRanges)if(t.scale>e&&0==--n)return t.scale};export const getScaleRange=t=>e[t];const e={room:100,rooms:400,smallBuilding:800,building:1999,buildings:3999,street:7499,streets:14999,neighborhood:29999,town:59999,city:119999,cities:249999,metropolitanArea:499999,county:999999,counties:1999999,stateProvince:3999999,statesProvinces:6999999,countriesSmall:14999999,countriesBig:34999999,continent:99999999,world:147914382};export const wellKnownScaleRanges=Object.entries(e).map((e=>({id:e[0],scale:e[1]})));

package/utilities/uri.d.ts

@@ -87,8 +87,10 @@ export declare class Uri {
  * Determines whether a URI is relative.
  *
  * @param uri The URI to check.
+ * @returns `true` if the URI is relative, empty, or undefined; otherwise,
+ *   `false`.
  */
-export declare function isRelativeUri(uri: string): boolean;
+export declare function isRelativeUri(uri: string | undefined): boolean;
 /**
  * Determines whether a URI is absolute.
  *

package/version.d.ts

@@ -1,4 +1,4 @@
 /**
  * The current version of the Geocortex ArcGIS Extensions API.
  */
-export declare const version = "48.3.4";
+export declare const version = "48.4.0";

package/version.js

@@ -1 +1 @@
-export const version="48.3.4";
+export const version="48.4.0";