@hpcc-js/util 3.2.0 → 3.3.0

package/dist/index.js

@@ -1,2 +1,1625 @@
-var xe="@hpcc-js/util",Ee="3.2.0",me="3.2.0";function Se(n,e){if(n==null)throw new TypeError('"o" is null or not defined');let t=n.length>>>0;if(typeof e!="function")throw new TypeError("predicate must be a function");let r=arguments[1],s=0;for(;s<t;){let i=n[s];if(e.call(r,i,s))return i;s++}}function ye(n,e){let t={update:[],exit:[],enter:[...e]};for(let r of n){let s=t.enter.indexOf(r);s>=0?(t.update.push(r),t.enter.splice(s,1)):t.exit.push(r)}return t}function M(n,e,t,r=(s,i)=>i){let s={update:[],exit:[],enter:[]};if(n===e)return s.update=n,s;let i={};e.forEach(o=>{i[t(o)]=o});for(let o of n){let a=t(o),h=i[a];h!==void 0?(delete i[a],s.update.push(r(o,h))):s.exit.push(o)}for(let o in i)s.enter.push(i[o]);return s}function ue(n,e){for(;n.length<e;)n="0"+n;return n}function b(n,e){if(e.length===0)return n;for(let t=0;t<e.length;++t){let r=e.charCodeAt(t);n=(n<<5)-n+r,n|=0}return n<0?n*-2:n}function ce(n,e,t){return typeof e.hashSum=="function"?e.hashSum():Object.keys(e).sort().reduce((r,s)=>J(r,e[s],s,t),n)}function J(n,e,t,r){let s=b(b(b(n,t),pe(e)),typeof e);return e===null?b(s,"null"):e===void 0?b(s,"undefined"):typeof e=="object"?r.indexOf(e)!==-1?b(s,"[Circular]"+t):(r.push(e),ce(s,e,r)):b(s,e.toString())}function pe(n){return Object.prototype.toString.call(n)}function E(n){return ue(J(0,n,"",[]).toString(16),8)}var Q=class{_cache={};_calcID;static hash(...e){return E({...e})}constructor(e){this._calcID=e}has(e){return this._calcID(e)in this._cache}set(e){return this._cache[this._calcID(e)]=e,e}get(e,t){let r=this._cache[this._calcID(e)];return r||(t?this.set(t()):null)}},Y=class{_cache={};_calcID;static hash(...e){return E({...e})}constructor(e){this._calcID=e}has(e){return this._calcID(e)in this._cache}set(e,t){return this._cache[this._calcID(e)]=t,t}get(e,t){let r=this._cache[this._calcID(e)];return r||(t?this.set(e,t()):Promise.resolve(null))}};function ke(n,e){let t={};return(...r)=>{let s=E(r);return t[s]||(t[s]={clockStart:Date.now(),promise:n(...r).then(i=>(e===void 0?t[s]=null:setTimeout(()=>{t[s]=null},Math.max(e-(Date.now()-t[s].clockStart),0)),i)).catch(i=>{throw t[s]=null,i})}),t[s].promise}}function Pe(n,e){let t,r=new Promise((s,i)=>{t=setTimeout(()=>{clearTimeout(t),i("Timed out in "+n+"ms.")},n)});return Promise.race([e,r]).then(s=>(clearTimeout(t),s)).catch(s=>{throw clearTimeout(t),s})}var Z=class{_q=[];isTop(e){return this._q[0]===e}push(e){let t=e.then(r=>this.isTop(t)?(this._q.shift(),r):new Promise((s,i)=>{let o=setInterval(()=>{this.isTop(t)&&(clearInterval(o),this._q.shift(),s(r))},20)}));return this._q.push(t),t}};function De(n){return new Promise(e=>{setTimeout(()=>e(),n)})}var A=class{store={};constructor(e){if(e)for(let t in e)this.set(t,e[t])}set(e,t){let r=this.store[e];return this.store[e]=t,r}get(e){return this.store[e]}has(e){return this.store[e]!==void 0}remove(e){delete this.store[e]}keys(){let e=[];for(let t in this.store)e.push(t);return e}values(){let e=[];for(let t in this.store)e.push(this.store[t]);return e}},ee=class extends A{constructor(e){super(e)}set(e,t){return super.set(e.toLowerCase(),t)}get(e){return super.get(e.toLowerCase())}has(e){return super.has(e.toLowerCase())}remove(e){return super.remove(e.toLowerCase())}};function Fe(n){if(n){if(!isNaN(Number(n)))return Number(n)}else return 0;let e=n.indexOf("ns");if(e!==-1)return parseFloat(n.substr(0,e))/1e9;let t=n.indexOf("ms");if(t!==-1)return parseFloat(n.substr(0,t))/1e3;let r=n.indexOf("s");if(r!==-1&&n.indexOf("days")===-1)return parseFloat(n.substr(0,r));let s=n.split(" days "),i=s.length>1?parseFloat(s[0]):0,o=s.length>1?s[1]:s[0],a=0,h=o.split(":").reverse();for(let p=0;p<h.length;++p)a+=parseFloat(h[p])*Math.pow(60,p);return i*24*60*60+a}var v=class{_graph;parent;props={};constructor(e,t){this._graph=e,this.parent=t}},m=class n extends v{subgraphs=[];vertices=[];edges=[];_;constructor(e,t,r){super(e,t),t&&t._addSubgraph(this),this._=r}remove(e=!0){this._graph.removeSubgraph(this,e)}createSubgraph(e){return this._graph.createSubgraph(this,e)}_addSubgraph(e){if(this.subgraphs.indexOf(e)>=0)throw new Error("Subgraph already exists");this.subgraphs.push(e)}_removeSubgraph(e){let t=this.subgraphs.indexOf(e);if(t<0)throw new Error("Subgraph does not exist");this.subgraphs.splice(t,1)}removeAllSubgraphs(){for(let e=this.subgraphs.length-1;e>=0;--e)this._graph.removeSubgraph(this.subgraphs[e],!0)}createVertex(e){return this._graph.createVertex(this,e)}_addVertex(e){if(this.vertices.indexOf(e)>=0)throw new Error("Vertex already exists");this.vertices.push(e)}_removeVertex(e){let t=this.vertices.indexOf(e);if(t<0)throw new Error("Vertex does not exist");this.vertices.splice(t,1)}removeAllVertices(){for(let e=this.vertices.length-1;e>=0;--e)this._graph.removeVertex(this.vertices[e],!0)}createEdge(e,t,r){return this._graph.createEdge(this,e,t,r)}_addEdge(e){if(this.edges.indexOf(e)>=0)throw new Error("Edge already exists");this.edges.push(e)}_removeEdge(e){let t=this.edges.indexOf(e);if(t<0)throw new Error("Edge does not exist");this.edges.splice(t,1)}_add(e){e instanceof n?this._addSubgraph(e):e instanceof S?this._addVertex(e):this._addEdge(e)}},S=class extends v{inEdges=[];outEdges=[];get edges(){return[...this.inEdges,...this.outEdges]}_;constructor(e,t,r){super(e,t),t._addVertex(this),this._=r}remove(e=!0,t){return this._graph.removeVertex(this,e,t)}addInEdge(e){this.inEdges.push(e)}removeInEdge(e){let t=this.inEdges.indexOf(e);if(t<0)throw new Error("In edge does not exist");this.inEdges.splice(t,1)}addOutEdge(e){this.outEdges.push(e)}removeOutEdge(e){let t=this.outEdges.indexOf(e);if(t<0)throw new Error("Out edge does not exist");this.outEdges.splice(t,1)}},I=class extends v{source;target;_;constructor(e,t,r,s,i){if(super(e,t),!r)throw new Error("Missing source vertex");if(!s)throw new Error("Missing target vertex");t._addEdge(this),this.source=r,this.source.addOutEdge(this),this.target=s,this.target.addInEdge(this),this._=i}remove(){this._graph.removeEdge(this)}},te=class{root;_allSubgraphs=[];_allSubgraphsMap={};_allVertices=[];_allVerticesMap={};_allEdges=[];_allEdgesMap={};idOf;constructor(e=r=>""+r._,t){this.root=new m(this,null,t),this.idOf=e}createSubgraph(e,t){let r=new m(this,e||this.root,t);return this._allSubgraphs.push(r),this._allSubgraphsMap[this.idOf(r)]=r,r}removeSubgraph(e,t=!0){let r=this._allSubgraphs.indexOf(e);if(r<0)throw new Error("Subgraph does not exist");this._allSubgraphs.splice(r,1),delete this._allSubgraphsMap[this.idOf(e)],e.parent&&e.parent._removeSubgraph(e),e.edges.forEach(s=>t?this.removeEdge(s):e.parent._addEdge(s)),e.vertices.forEach(s=>t?this.removeVertex(s,t):e.parent._addVertex(s)),e.subgraphs.forEach(s=>t?this.removeSubgraph(s,t):e.parent._addSubgraph(s))}get subgraphs(){return this._allSubgraphs}subgraph(e){return this._allSubgraphsMap[e]}createVertex(e,t){let r=new S(this,e,t);return this._allVertices.push(r),this._allVerticesMap[this.idOf(r)]=r,r}removeVertex(e,t=!0,r){let s=this._allVertices.indexOf(e);if(s<0)throw new Error("Vertex does not exist");this._allVertices.splice(s,1),delete this._allVerticesMap[this.idOf(e)],e.parent&&e.parent._removeVertex(e),t||e.inEdges.forEach(i=>{e.outEdges.forEach(o=>{this.createEdge(this.root,i.source,o.target,r?r(i.source._,o.target._):void 0)})}),e.inEdges.forEach(i=>this.removeEdge(i)),e.outEdges.forEach(i=>this.removeEdge(i))}get vertices(){return this._allVertices}vertex(e){return this._allVerticesMap[e]}createEdge(e,t,r,s){let i=new I(this,e,t,r,s);return this._allEdges.push(i),this._allEdgesMap[this.idOf(i)]=i,i}removeEdge(e){let t=this._allEdges.indexOf(e);if(t<0)throw new Error("Edge does not exist");this._allEdges.splice(t,1),delete this._allEdgesMap[this.idOf(e)],e.parent&&e.parent._removeEdge(e),e.source.removeOutEdge(e),e.target.removeInEdge(e)}get edges(){return this._allEdges}edge(e){return this._allEdgesMap[e]}_walk(e,t){for(let r of e.subgraphs)switch(t(r)){case"abort":return!0;case"stepover":break;default:if(this._walk(r,t))return!0}for(let r of e.vertices)if(t(r)==="abort")return!0}walk(e){this._walk(this.root,e);for(let t of this._allEdges)if(e(t)==="abort")return!0}clone(){let e=this.constructor,t=new e(this.idOf,this.root._),r=de();return r.put(this.root,t.root),this.walk(s=>{let i=r.get(s.parent);if(s instanceof m)r.put(s,i.createSubgraph(s._));else if(s instanceof S)r.put(s,i.createVertex(s._));else if(s instanceof I){let o=r.get(s.source),a=r.get(s.target);i.createEdge(o,a,s._)}}),t}};function de(){let n=[],e=[];return{put(t,r){let s=n.indexOf(t);s===-1?(n.push(t),e.push(r)):e[s]=r},get(t){return e[n.indexOf(t)]}}}var j=class{_graph;_;id(){return this._graph.id(this._)}constructor(e,t){this._graph=e,this._=t}},V=class extends j{_parent;constructor(e,t){super(e,t)}clearParent(){return this._parent&&(this._parent.removeChild(this),delete this._parent),this}parent(e){return arguments.length===0?this._parent:(this._parent!==e&&(this._parent&&this._parent.removeChild(this),this._parent=e,this._parent&&this._parent.addChild(this)),this)}},y=class extends V{_children=[];constructor(e,t){super(e,t)}children(){return this._children}addChild(e){this._children.push(e)}removeChild(e){this._children=this._children.filter(t=>t.id!==e.id)}},$=class extends V{_inEdges=[];_outEdges=[];constructor(e,t){super(e,t)}edges(){return[...this._inEdges,...this._outEdges]}edgeCount(){return this._outEdges.length+this._inEdges.length}inEdges(){return this._inEdges}addInEdge(e){this._inEdges.push(e)}removeInEdge(e){this._inEdges=this._inEdges.filter(t=>t._.id!==e)}outEdges(){return this._outEdges}addOutEdge(e){this._outEdges.push(e)}removeOutEdge(e){this._outEdges=this._outEdges.filter(t=>t._.id!==e)}},L=class extends V{_source;_target;constructor(e,t,r,s){super(e,t),this._source=r,this._target=s}},re=class{_directed;_subgraphMap={};_vertexMap={};_edgeMap={};constructor(e=!0){this._directed=e}clear(){return this._subgraphMap={},this._vertexMap={},this._edgeMap={},this}clearParents(){for(let e in this._subgraphMap)this._subgraphMap[e].clearParent();for(let e in this._vertexMap)this._vertexMap[e].clearParent();return this}isDirected(){return this._directed}_idFunc=e=>typeof e.id=="function"?e.id():e.id;idFunc(e){return this._idFunc=e,this}_sourceFunc=e=>typeof e.source=="function"?e.source():e.source;sourceFunc(e){return this._sourceFunc=e,this}_targetFunc=e=>typeof e.target=="function"?e.target():e.target;targetFunc(e){return this._targetFunc=e,this}_updateFunc=(e,t)=>t;updateFunc(e){return this._updateFunc=e,this}id(e){return this._idFunc(e)}type(e){return this.subgraphExists(e)?"S":this.vertexExists(e)?"V":this.edgeExists(e)?"E":""}isSubgraph(e){return this.subgraphExists(this.id(e))}isVertex(e){return this.vertexExists(this.id(e))}isEdge(e){return this.edgeExists(this.id(e))}allItems(){return[...this.allSubgraphs(),...this.allVertices(),...this.allEdges()]}item(e){if(this.subgraphExists(e))return this.subgraph(e);if(this.vertexExists(e))return this.vertex(e);if(this.edgeExists(e))return this.edge(e)}itemExists(e){return this.edgeExists(e)||this.vertexExists(e)||this.subgraphExists(e)}allSubgraphs(){let e=[];for(let t in this._subgraphMap)e.push(this._subgraphMap[t]._);return e}subgraphs(){let e=[];for(let t in this._subgraphMap)this._subgraphMap[t].parent()===void 0&&e.push(this._subgraphMap[t]._);return e}subgraphExists(e){return!!this._subgraphMap[e]}subgraph(e){return this._subgraphMap[e]._}subgraphSubgraphs(e){return this._subgraphMap[e].children().filter(t=>this.isSubgraph(t._)).map(t=>t._)}subgraphVertices(e){return this._subgraphMap[e].children().filter(t=>this.isVertex(t._)).map(t=>t._)}subgraphEdges(e){return this._subgraphMap[e].children().filter(t=>this.isEdge(t._)).map(t=>t._)}addSubgraph(e,t){let r=this._idFunc(e);if(this._subgraphMap[r])throw new Error(`Subgraph '${r}' already exists.`);let s=new y(this,e);if(t){let i=this._idFunc(t);if(!this._subgraphMap[i])throw new Error(`Subgraph '${i}' does not exist.`);s.parent(this._subgraphMap[i])}return this._subgraphMap[r]=s,this}mergeSubgraphs(e=[]){let t=M(this.allSubgraphs(),e,r=>this._idFunc(r),this._updateFunc);return t.exit.forEach(r=>this.removeSubgraph(this._idFunc(r))),t.enter.forEach(r=>this.addSubgraph(r)),t.update.forEach(r=>this.updateSubgraph(r)),this}updateSubgraph(e){let t=this._idFunc(e),r=this._subgraphMap[t];if(!r)throw new Error(`Subgraph '${t}' does not exist.`);return r._=e,this}removeSubgraph(e,t=!0){let r=this._subgraphMap[e];if(!r)throw new Error(`Subgraph '${e}' does not exist.`);return r.children().forEach(s=>{t?s.parent(r.parent()):s instanceof y?this.removeSubgraph(s.id()):this.removeVertex(s.id())}),delete this._subgraphMap[e],this}subgraphParent(e,t){let r=this._subgraphMap[e];if(!r)throw new Error(`Subgraph '${e}' does not exist.`);if(t===void 0){let i=r.parent();return i?i._:void 0}let s=this._subgraphMap[t];if(!s)throw new Error(`Vertex parent '${s}' does not exist.`);return r.parent(s),this}allVertices(){let e=[];for(let t in this._vertexMap)e.push(this._vertexMap[t]._);return e}vertices(){let e=[];for(let t in this._vertexMap)this._vertexMap[t].parent()===void 0&&e.push(this._vertexMap[t]._);return e}vertexExists(e){return!!this._vertexMap[e]}vertex(e){return this._vertexMap[e]._}allEdges(){let e=[];for(let t in this._edgeMap)e.push(this._edgeMap[t]._);return e}edges(){let e=[];for(let t in this._edgeMap)this._edgeMap[t].parent()===void 0&&e.push(this._edgeMap[t]._);return e}vertexEdges(e){return this._vertexMap[e].edges().map(t=>t._)}inEdges(e){return this._vertexMap[e].inEdges().map(t=>t._)}outEdges(e){return this._vertexMap[e].outEdges().map(t=>t._)}_neighbors(e){return[...this._vertexMap[e].outEdges().map(t=>t._target),...this._vertexMap[e].inEdges().map(t=>t._source)]}neighbors(e){return this._neighbors(e).map(t=>t._)}singleNeighbors(e){return this._neighbors(e).filter(t=>t.edgeCount()===1).map(t=>t._)}addVertex(e,t){let r=this._idFunc(e);if(this._vertexMap[r])throw new Error(`Vertex '${r}' already exists.`);let s=new $(this,e);if(t){let i=this._idFunc(t);if(!this.subgraphExists(i))throw new Error(`Subgraph '${i}' does not exist.`);s.parent(this._subgraphMap[i])}return this._vertexMap[r]=s,this}mergeVertices(e){let t=M(this.allVertices(),e,r=>this._idFunc(r),this._updateFunc);return t.exit.forEach(r=>this.removeVertex(this._idFunc(r))),t.enter.forEach(r=>this.addVertex(r)),t.update.forEach(r=>this.updateVertex(r)),this}updateVertex(e){let t=this._idFunc(e),r=this._vertexMap[t];if(!r)throw new Error(`Vertex '${t}' does not exist.`);return r._=e,this}removeVertex(e){let t=this._vertexMap[e];if(!t)throw new Error(`Vertex '${e}' does not exist.`);return t.edges().forEach(r=>{this.removeEdge(r.id())}),delete this._vertexMap[e],this}vertexParent(e,t){let r=this._vertexMap[e];if(!r)throw new Error(`Vertex '${e}' does not exist.`);if(t===void 0){let i=r.parent();return i?i._:void 0}let s=this._subgraphMap[t];if(!s)throw new Error(`Vertex parent '${s}' does not exist.`);return r.parent(s),this}edgeExists(e){return!!this._edgeMap[e]}edge(e){return this._edgeMap[e]._}addEdge(e,t){let r=this._idFunc(e),s=this._sourceFunc(e),i=this._targetFunc(e);if(this._edgeMap[r])throw new Error(`Edge '${r}' already exists.`);if(!this.vertexExists(s))throw new Error(`Edge Source '${s}' does not exist.`);if(!this.vertexExists(i))throw new Error(`Edge Target '${i}' does not exist.`);let o=new L(this,e,this._vertexMap[s],this._vertexMap[i]);if(t){let a=this._idFunc(t);if(!this.subgraphExists(a))throw new Error(`Subgraph '${a}' does not exist.`);o.parent(this._subgraphMap[a])}return this._edgeMap[r]=o,this._vertexMap[s].addOutEdge(o),this._vertexMap[i].addInEdge(o),this}mergeEdges(e){let t=M(this.allEdges(),e,r=>this._idFunc(r),this._updateFunc);return t.exit.forEach(r=>this.removeEdge(this._idFunc(r))),t.enter.forEach(r=>this.addEdge(r)),t.update.forEach(r=>this.updateEdge(r)),this}updateEdge(e){let t=this._idFunc(e),r=this._edgeMap[t];if(!r)throw new Error(`Edge '${t}' does not exist.`);let s=r._source.id(),i=this._sourceFunc(e);s!==i&&(this._vertexMap[s]?.removeOutEdge(t),this._vertexMap[i]?.addOutEdge(r));let o=r._target.id(),a=this._targetFunc(e);return o!==a&&(this._vertexMap[o]?.removeInEdge(t),this._vertexMap[a]?.addInEdge(r)),r._=e,r._source=this._vertexMap[i],r._target=this._vertexMap[a],this}removeEdge(e){let t=this._edgeMap[e];if(!t)throw new Error(`Edge '${e}' does not exist.`);let r=this._idFunc(t._source._);if(!this.vertexExists(r))throw new Error(`Edge Source'${r}' does not exist.`);this._vertexMap[r].removeOutEdge(e);let s=this._idFunc(t._target._);if(!this.vertexExists(s))throw new Error(`Edge Target'${s}' does not exist.`);return this._vertexMap[s].removeInEdge(e),delete this._edgeMap[e],this}_hwalk(e,t){return e instanceof y?t("subgraph",e._,e.children().map(r=>this._hwalk(r,t))):t("vertex",e._)}hierarchy(e){let t=[];for(let r in this._subgraphMap){let s=this._subgraphMap[r];s.parent()===void 0&&t.push(this._hwalk(s,e))}for(let r in this._vertexMap){let s=this._vertexMap[r];s.parent()===void 0&&t.push(this._hwalk(s,e))}return t}dijkstra(e,t){let r=this.allEdges(),s=new N,i={},o={},a={};function h(u,d){let c=1/0,_=null;return u.forEach(F=>{d[F]<c&&(c=d[F],_=F)}),_}for(let u=0;u<r.length;u++){let d=this._sourceFunc(r[u]),c=this._targetFunc(r[u]),_=1;s.add(d),s.add(c),o[d]=1/0,o[c]=1/0,a[d]===void 0&&(a[d]={}),a[c]===void 0&&(a[c]={}),a[d][c]=_,a[c][d]=_}for(o[e]=0;s.size;){let u=h(s,o);if(u===null)break;let d=Object.keys(a[u]).filter(c=>s.has(c));if(s.delete(u),u===t)break;for(let c of d){let _=o[u]+a[u][c];_<o[c]&&(o[c]=_,i[c]=u)}}let p=t,g=[p],f=0;for(;i[p]!==void 0;)g.unshift(i[p]),f+=a[p][i[p]],p=i[p];return{ids:g,len:f}}sort(e){let t=[],r={},s=(i,o=[])=>{let a=i.id();r[a]||(r[a]=!0,o.push(i),i.outEdges().forEach(h=>{o.indexOf(h._target)<0&&s(h._target,[...o])}),t.unshift(i._))};if(e)s(this._vertexMap[e]);else for(let i in this._vertexMap)s(this._vertexMap[i]);return t}},N=class{_content=[];get size(){return this._content.length}has(e){return this._content.indexOf(e)>=0}add(e){this.has(e)||this._content.push(e)}delete(e){let t=this._content.indexOf(e);t>=0&&this._content.splice(t,1)}forEach(e){this._content.forEach(e)}};var k=Array.isArray,w=Object.keys,ne=Object.prototype.hasOwnProperty;function se(n,e,t=!1){if(n===e)return!0;if(n&&e){if(typeof n=="object"&&typeof e=="object"){let s=k(n),i=k(e),o,a,h;if(s&&i){if(a=n.length,a!==e.length)return console.warn(`lengths not equal: ${a} !== ${e.length}`),!1;for(o=a;o--!==0;)if(!se(n[o],e[o],t))return!1;return!0}if(s!==i)return console.warn(`arrays not equal: ${s} !== ${i}`),!1;let p=n instanceof Date,g=e instanceof Date;if(p!==g)return console.warn(`dates not equal: ${p} !== ${g}`),!1;if(p&&g){let c=n.getTime()===e.getTime();return c||console.warn(`dates not equal: ${n.getTime()} !== ${e.getTime()}`),c}let f=n instanceof RegExp,u=e instanceof RegExp;if(f!==u)return console.warn(`regexps not equal: ${f} !== ${u}`),!1;if(f&&u){let c=n.toString()===e.toString();return c||console.warn(`regexps not equal: ${n.toString()} !== ${e.toString()}`),c}let d=w(n);if(a=d.length,a!==w(e).length)return console.warn(`key lengths not equal: ${a} !== ${w(e).length}`),!1;for(o=a;o--!==0;)if(!ne.call(e,d[o]))return console.warn(`${d[o]} in a but not b`),!1;for(o=a;o--!==0;)if(h=d[o],!se(n[h],e[h],t))return!1;return!0}else if(!t&&typeof n=="function"&&typeof e=="function"){let s=n.toString()===e.toString();return s||console.warn(`functions not equal: ${n.toString()} !== ${e.toString()}`),s}}let r=n!==n&&e!==e;return r||console.warn(`values not equal: ${n} !== ${e}`),r}function T(n,e,t=!1){if(n===e)return!0;if(n&&e){if(typeof n=="object"&&typeof e=="object"){let r=k(n),s=k(e),i,o,a;if(r&&s){if(o=n.length,o!==e.length)return!1;for(i=o;i--!==0;)if(!T(n[i],e[i],t))return!1;return!0}if(r!==s)return!1;let h=n instanceof Date,p=e instanceof Date;if(h!==p)return!1;if(h&&p)return n.getTime()===e.getTime();let g=n instanceof RegExp,f=e instanceof RegExp;if(g!==f)return!1;if(g&&f)return n.toString()===e.toString();let u=w(n);if(o=u.length,o!==w(e).length)return!1;for(i=o;i--!==0;)if(!ne.call(e,u[i]))return!1;for(i=o;i--!==0;)if(a=u[i],!T(n[a],e[a],t))return!1;return!0}else if(!t&&typeof n=="function"&&typeof e=="function")return n.toString()===e.toString()}return n!==n&&e!==e}function Ne(n,e,t=!1){return T(n,e,t)?n:e}var P=typeof globalThis<"u"?globalThis:window,Ue=typeof window<"u"&&P===window,R=typeof process<"u"&&process.versions!=null&&process.versions.node!=null,qe=R&&process.env!=null&&(process.env.TRAVIS!=null||process.env.GITHUB_ACTIONS!=null);function Ke(n){let e=document.scripts||[];for(let t=document.scripts.length-1;t>=0;--t){let r=e[t];if(r.src){let s=r.src.indexOf(n);if(s>=0)return r.src.substring(0,s)}}return""}var x=class{stack=[];push(e){return this.stack.push(e),e}pop(){return this.stack.pop()}top(){return this.stack.length?this.stack[this.stack.length-1]:void 0}depth(){return this.stack.length}};var D=(h=>(h[h.debug=0]="debug",h[h.info=1]="info",h[h.notice=2]="notice",h[h.warning=3]="warning",h[h.error=4]="error",h[h.critical=5]="critical",h[h.alert=6]="alert",h[h.emergency=7]="emergency",h))(D||{}),le={debug:"cyan",info:"green",notice:"grey",warning:"blue",error:"red",critical:"magenta",alert:"magenta",emergency:"magenta"},U=class{write(e,t,r,s){R?console.log(`[${e}] ${D[t].toUpperCase()} ${r}:  ${s}`):console.log(`[${e}] %c${D[t].toUpperCase()}%c ${r}:  ${s}`,`color:${le[D[t]]}`,"")}},q=class{static _instance;_levelStack=new x;_level=1;_filter="";_writer=new U;static Instance(){return this._instance||(this._instance=new this)}constructor(){}stringify(e){let t=[];return JSON.stringify(e,function(r,s){if(typeof s=="object"&&s!==null){if(t.indexOf(s)!==-1)return;t.push(s)}return s},2)}writer(e){return e===void 0?this._writer:(this._writer=e,this)}log(e,t,r){if(e<this._level||this._filter&&this._filter!==t)return;let s=new Date().toISOString();this._writer.rawWrite?this._writer.rawWrite(s,e,t,r):(typeof r!="string"&&(r=this.stringify(r)),this._writer.write&&this._writer.write(s,e,t,r))}debug(e,t){this.log(0,e,t)}info(e,t){this.log(1,e,t)}notice(e,t){this.log(2,e,t)}warning(e,t){this.log(3,e,t)}error(e,t){this.log(4,e,t)}critical(e,t){this.log(5,e,t)}alert(e,t){this.log(6,e,t)}emergency(e,t){this.log(7,e,t)}level(e){return e===void 0?this._level:(this._level=e,this)}pushLevel(e){return this._levelStack.push(this._level),this._level=e,this}popLevel(){return this._level=this._levelStack.pop(),this}filter(e){return e===void 0?this._filter:(this._filter=e,this)}},l=q.Instance(),K=class{_scopeID;constructor(e){this._scopeID=e}debug(e){l.debug(this._scopeID,e)}info(e){l.info(this._scopeID,e)}notice(e){l.notice(this._scopeID,e)}warning(e){l.warning(this._scopeID,e)}error(e){l.error(this._scopeID,e)}critical(e){l.critical(this._scopeID,e)}alert(e){l.alert(this._scopeID,e)}emergency(e){l.emergency(this._scopeID,e)}pushLevel(e){return l.pushLevel(e),this}popLevel(){return l.popLevel(),this}};function We(n,e=!1){return e&&l.filter(n),new K(n)}function Je(n){return n*(Math.PI/180)}function Qe(n){return n*(180/Math.PI)}function Ye(n,e){return{x:n*Math.cos(e),y:n*Math.sin(e)}}function Ze(n,e){return{r:Math.sqrt(n*n+e*e),theta:Math.atan2(e,n)}}function et(n,e=-Math.PI,t=Math.PI){return ie(n,e,t)}function tt(n,e=-180,t=180){return ie(n,e,t)}function ie(n,e,t){let r=t-e,s=n-e;return s-Math.floor(s/r)*r+e}function ge(n,e){if(!(n===void 0||e===void 0)){for(let t of n.split(".")){if(!e.hasOwnProperty(t))return;e=e[t]}return e}}function st(n,e){return ge(n,e)!==void 0}function fe(n,e){let t={};for(let r in e){if(!e.hasOwnProperty(r)||r==="__proto__"||r==="constructor")continue;let s=e[r];s instanceof Array||typeof s=="object"&&(s=oe(n[r],s)),(!(r in n)||n[r]!==s&&(!(r in t)||t[r]!==s))&&(n[r]=s)}return n}function oe(n={},...e){if(typeof n!="object")throw new Error(`Destination "${n}" must be an object.`);for(let t of e)fe(n,t);return n}function nt(n={},...e){return oe(n,...e)}function it(n){let e=[];return JSON.stringify(n,function(t,r){if(typeof r=="object"&&r!==null){if(e.indexOf(r)!==-1)return;e.push(r)}return r})}function ot(n){return Array.isArray!==void 0?Array.isArray(n):Object.prototype.toString.call(n)==="[object Array]"}function at(n){let e=n.split("_"),t=e[1].split(".");return{module:`@hpcc-js/${e[0]}`,file:t[0],class:t[1]||t[0]}}var X=class{eventTarget;eventID;callback;constructor(e,t,r){this.eventTarget=e,this.eventID=t,this.callback=r}release(){this.eventTarget.removeObserver(this.eventID,this.callback)}unwatch(){this.release()}},ae=class{_eventObservers={};constructor(...e){}addObserver(e,t){let r=this._eventObservers[e];return r||(r=[],this._eventObservers[e]=r),r.push(t),new X(this,e,t)}removeObserver(e,t){let r=this._eventObservers[e];if(r)for(let s=r.length-1;s>=0;--s)r[s]===t&&r.splice(s,1);return this}dispatchEvent(e,...t){let r=this._eventObservers[e];if(r)for(let s of r)s(...t);return this}_hasObserver(e){let t=this._eventObservers[e];for(let r in t)if(t[r])return!0;return!1}hasObserver(e){if(e!==void 0)return this._hasObserver(e);for(let t in this._eventObservers)if(this._hasObserver(t))return!0;return!1}};var H;(function(){if(P.requestAnimationFrame)H=P.requestAnimationFrame;else{let n=0;H=function(e){let t=new Date().getTime(),r=Math.max(0,16-(t-n)),s=setTimeout(()=>e(t+r),r);return n=t+r,s}}})();var O=class{get canConflate(){return!1}conflate(e){return!1}void(){return!1}};var C=class{_observerID=0;_observers=[];_messageBuffer=[];constructor(){}observers(){return this._observers}messages(){let e=[];return this._messageBuffer.forEach(t=>{e.some(r=>r.canConflate&&r.conflate(t))||e.push(t)}),e}dispatchAll(){this.dispatch(this.messages()),this.flush()}dispatch(e){e.length!==0&&this.observers().forEach(t=>{let r=e.filter(s=>!s.void()&&(t.type===void 0||s instanceof t.type));r.length&&t.callback(r)})}hasObserver(){return this._observers.length>0}flush(){this._messageBuffer=[]}send(e){this.dispatch([e])}post(e){this._messageBuffer.push(e),H(()=>this.dispatchAll())}attach(e,t){let r=this,s=++this._observerID;return this._observers.push({id:s,type:t,callback:e}),{release(){r._observers=r._observers.filter(i=>i.id!==s)},unwatch(){this.release()}}}};var G=class{name="";$={};_children=[];content="";constructor(e){this.name=e}appendAttribute(e,t){this.$[e]=t}appendContent(e){this.content+=e}appendChild(e){this._children.push(e)}children(e){return e===void 0?this._children:this._children.filter(t=>t.name===e)}},B=class{root;stack=new x;constructor(){}walkDoc(e){let t=this._startXMLNode(e);if(e.attributes)for(let r=0;r<e.attributes.length;++r){let s=e.attributes.item(r);this.attributes(s.nodeName,s.nodeValue)}if(this.startXMLNode(t),e.childNodes)for(let r=0;r<e.childNodes.length;++r){let s=e.childNodes.item(r);s.nodeType===s.TEXT_NODE?this.characters(s.nodeValue):this.walkDoc(s)}this.endXMLNode(this.stack.pop())}_startXMLNode(e){let t=new G(e.nodeName);return this.stack.depth()?this.stack.top().appendChild(t):this.root=t,this.stack.push(t)}parse(e){let r=new DOMParser().parseFromString(e,"application/xml");this.startDocument(),this.walkDoc(r),this.endDocument()}startDocument(){}endDocument(){}startXMLNode(e){}endXMLNode(e){}attributes(e,t){this.stack.top().appendAttribute(e,t)}characters(e){this.stack.top().appendContent(e)}},W=class extends B{startXMLNode(e){switch(super.startXMLNode(e),e.name){case"xs:element":break;case"xs:simpleType":break;default:break}}endXMLNode(e){switch(e.name){case"xs:element":break;case"xs:simpleType":break;default:break}super.endXMLNode(e)}};function lt(n){let e=new W;return e.parse(n),e.root}var z=class extends O{constructor(t,r,s){super();this.property=t;this.newValue=r;this.oldValue=s}get canConflate(){return!0}conflate(t){return this.property===t.property?(this.newValue=t.newValue,!0):!1}void(){return T(this.newValue,this.oldValue)}},he=class{_espState={};_dispatch=new C;_monitorHandle;_monitorTickCount=0;clear(e){this._espState={},e!==void 0&&this.set(e),this._monitorTickCount=0}get(e,t){return e===void 0?this._espState:this.has(e)?this._espState[e]:t}set(e,t){if(typeof e=="string")return this.setSingle(e,t);this.setAll(e)}setSingle(e,t){let r=this._espState[e];this._espState[e]=t,this._dispatch.post(new z(e,t,r))}setAll(e){for(let t in e)e.hasOwnProperty(t)&&this.setSingle(t,e[t])}has(e){return this._espState[e]!==void 0}addObserver(e,t,r){if(this.isCallback(t)){if(e!=="changed")throw new Error("Invalid eventID:  "+e);return this._dispatch.attach(s=>{t(s.map(i=>({id:i.property,oldValue:i.oldValue,newValue:i.newValue})))})}else{if(e!=="propChanged")throw new Error("Invalid eventID:  "+e);return this._dispatch.attach(s=>{let i=s.filter(o=>o.property===t);if(i.length){i.length>1&&console.warn("Should only be 1 message?");let o=i[i.length-1];r({id:o.property,oldValue:o.oldValue,newValue:o.newValue})}})}}on(e,t,r){return this.addObserver(e,t,r),this}isCallback(e){return typeof e=="function"}hasEventListener(){return this._dispatch.hasObserver()}async refresh(e=!1){return await Promise.resolve(),this}_monitor(){if(this._monitorHandle){this._monitorTickCount=0;return}this._monitorHandle=setTimeout(()=>{(this.hasEventListener()?this.refresh():Promise.resolve()).then(()=>{this._monitor()}),delete this._monitorHandle},this._monitorTimeoutDuration())}_monitorTimeoutDuration(){return++this._monitorTickCount,this._monitorTickCount<=1?0:3e4}watch(e,t=!0){if(typeof e!="function")throw new Error("Invalid Callback");t&&setTimeout(()=>{let s=this.get(),i=[];for(let o in s)s.hasOwnProperty(s)&&i.push({id:o,newValue:s[o],oldValue:void 0});e(i)},0);let r=this.addObserver("changed",e);return this._monitor(),r}};function Et(n,e){if(typeof e!="string"||e.length===0)return n;for(;n.indexOf(e)===0;)n=n.substring(1);for(;_e(n,e);)n=n.substring(0,n.length-1);return n}function _e(n,e,t){let r=n.toString();(typeof t!="number"||!isFinite(t)||Math.floor(t)!==t||t>r.length)&&(t=r.length),t-=e.length;let s=r.lastIndexOf(e,t);return s!==-1&&s===t}function be(...n){let e=n.reduce((r,s)=>(r.length>0&&(s=s.replace(/^\//,"")),s=s.replace(/\/$/,""),[...r,...s.split("/")]),[]),t=[];for(let r of e)if(r!=="."){if(r===".."){t.pop();continue}t.push(r)}return t.join("/")}function vt(n){return be(n,"..")}export{Y as AsyncCache,Z as AsyncOrderedQueue,me as BUILD_VERSION,Q as Cache,A as Dictionary,ee as DictionaryNoCase,C as Dispatch,I as Edge,te as Graph,re as Graph2,v as GraphItem,D as Level,q as Logging,O as Message,ae as Observable,xe as PKG_NAME,Ee as PKG_VERSION,B as SAXStackParser,K as ScopedLogging,x as Stack,he as StateObject,m as Subgraph,S as Vertex,G as XMLNode,Ze as cartesianToPolar,at as classID2Meta,ye as compare,M as compare2,ke as debounce,T as deepEquals,oe as deepMixin,nt as deepMixinT,Je as degreesToRadians,vt as dirname,_e as endsWith,Fe as espTime2Seconds,st as exists,Se as find,Ke as getScriptSrc,E as hashSum,ge as inner,ot as isArray,Ue as isBrowser,qe as isCI,R as isNode,be as join,l as logger,ie as normalize,tt as normalizeDegrees,et as normalizeRadians,Ye as polarToCartesian,Pe as promiseTimeout,Qe as radiansToDegrees,P as root,it as safeStringify,We as scopedLogger,De as sleep,Et as trim,Ne as update,se as verboseDeepEquals,lt as xml2json};
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: !0, configurable: !0, writable: !0, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key != "symbol" ? key + "" : key, value);
+const PKG_NAME = "@hpcc-js/util", PKG_VERSION = "3.2.0", BUILD_VERSION = "3.2.1";
+function find(o, predicate) {
+  if (o == null)
+    throw new TypeError('"o" is null or not defined');
+  const len = o.length >>> 0;
+  if (typeof predicate != "function")
+    throw new TypeError("predicate must be a function");
+  const thisArg = arguments[1];
+  let k = 0;
+  for (; k < len; ) {
+    const kValue = o[k];
+    if (predicate.call(thisArg, kValue, k))
+      return kValue;
+    k++;
+  }
+}
+function compare(before, after) {
+  const retVal = {
+    update: [],
+    exit: [],
+    enter: [...after]
+  };
+  for (const row of before) {
+    const otherIdx = retVal.enter.indexOf(row);
+    otherIdx >= 0 ? (retVal.update.push(row), retVal.enter.splice(otherIdx, 1)) : retVal.exit.push(row);
+  }
+  return retVal;
+}
+function compare2(before, after, idFunc, updateFunc = (before2, after2) => after2) {
+  const retVal = {
+    update: [],
+    exit: [],
+    enter: []
+  };
+  if (before === after)
+    return retVal.update = before, retVal;
+  const unknownMap = {};
+  after.forEach((item) => {
+    unknownMap[idFunc(item)] = item;
+  });
+  for (const row of before) {
+    const id = idFunc(row), item = unknownMap[id];
+    item !== void 0 ? (delete unknownMap[id], retVal.update.push(updateFunc(row, item))) : retVal.exit.push(row);
+  }
+  for (const key in unknownMap)
+    retVal.enter.push(unknownMap[key]);
+  return retVal;
+}
+function pad(hash, len) {
+  for (; hash.length < len; )
+    hash = "0" + hash;
+  return hash;
+}
+function fold(hash, text) {
+  if (text.length === 0)
+    return hash;
+  for (let i = 0; i < text.length; ++i) {
+    const chr = text.charCodeAt(i);
+    hash = (hash << 5) - hash + chr, hash |= 0;
+  }
+  return hash < 0 ? hash * -2 : hash;
+}
+function foldObject(hash, o, seen) {
+  return typeof o.hashSum == "function" ? o.hashSum() : Object.keys(o).sort().reduce((input, key) => foldValue(input, o[key], key, seen), hash);
+}
+function foldValue(input, value, key, seen) {
+  const hash = fold(fold(fold(input, key), toString(value)), typeof value);
+  return value === null ? fold(hash, "null") : value === void 0 ? fold(hash, "undefined") : typeof value == "object" ? seen.indexOf(value) !== -1 ? fold(hash, "[Circular]" + key) : (seen.push(value), foldObject(hash, value, seen)) : fold(hash, value.toString());
+}
+function toString(o) {
+  return Object.prototype.toString.call(o);
+}
+function hashSum(o) {
+  return pad(foldValue(0, o, "", []).toString(16), 8);
+}
+class Cache {
+  constructor(calcID) {
+    __publicField(this, "_cache", {});
+    __publicField(this, "_calcID");
+    this._calcID = calcID;
+  }
+  static hash(...args) {
+    return hashSum({ ...args });
+  }
+  has(espObj) {
+    return this._calcID(espObj) in this._cache;
+  }
+  set(obj) {
+    return this._cache[this._calcID(obj)] = obj, obj;
+  }
+  get(espObj, factory) {
+    const retVal = this._cache[this._calcID(espObj)];
+    return retVal || (factory ? this.set(factory()) : null);
+  }
+}
+class AsyncCache {
+  constructor(calcID) {
+    __publicField(this, "_cache", {});
+    __publicField(this, "_calcID");
+    this._calcID = calcID;
+  }
+  static hash(...args) {
+    return hashSum({ ...args });
+  }
+  has(espObj) {
+    return this._calcID(espObj) in this._cache;
+  }
+  set(espObj, obj) {
+    return this._cache[this._calcID(espObj)] = obj, obj;
+  }
+  get(espObj, factory) {
+    const retVal = this._cache[this._calcID(espObj)];
+    return retVal || (factory ? this.set(espObj, factory()) : Promise.resolve(null));
+  }
+}
+function debounce(fn, timeout) {
+  const promises = {};
+  return (...params) => {
+    const hash = hashSum(params);
+    return promises[hash] || (promises[hash] = {
+      clockStart: Date.now(),
+      promise: fn(...params).then((response) => (timeout === void 0 ? promises[hash] = null : setTimeout(() => {
+        promises[hash] = null;
+      }, Math.max(timeout - (Date.now() - promises[hash].clockStart), 0)), response)).catch((e) => {
+        throw promises[hash] = null, e;
+      })
+    }), promises[hash].promise;
+  };
+}
+function promiseTimeout(ms, promise) {
+  let id;
+  const timeout = new Promise((resolve, reject) => {
+    id = setTimeout(() => {
+      clearTimeout(id), reject("Timed out in " + ms + "ms.");
+    }, ms);
+  });
+  return Promise.race([
+    promise,
+    timeout
+  ]).then((response) => (clearTimeout(id), response)).catch((e) => {
+    throw clearTimeout(id), e;
+  });
+}
+class AsyncOrderedQueue {
+  constructor() {
+    __publicField(this, "_q", []);
+  }
+  isTop(p) {
+    return this._q[0] === p;
+  }
+  push(p) {
+    const retVal = p.then((response) => this.isTop(retVal) ? (this._q.shift(), response) : new Promise((resolve, reject) => {
+      const intervalHandler = setInterval(() => {
+        this.isTop(retVal) && (clearInterval(intervalHandler), this._q.shift(), resolve(response));
+      }, 20);
+    }));
+    return this._q.push(retVal), retVal;
+  }
+}
+function sleep(ms) {
+  return new Promise((resolve) => {
+    setTimeout(() => resolve(), ms);
+  });
+}
+class Dictionary {
+  constructor(attrs) {
+    __publicField(this, "store", {});
+    if (attrs)
+      for (const key in attrs)
+        this.set(key, attrs[key]);
+  }
+  set(key, value) {
+    const retVal = this.store[key];
+    return this.store[key] = value, retVal;
+  }
+  get(key) {
+    return this.store[key];
+  }
+  has(key) {
+    return this.store[key] !== void 0;
+  }
+  remove(key) {
+    delete this.store[key];
+  }
+  keys() {
+    const retVal = [];
+    for (const key in this.store)
+      retVal.push(key);
+    return retVal;
+  }
+  values() {
+    const retVal = [];
+    for (const key in this.store)
+      retVal.push(this.store[key]);
+    return retVal;
+  }
+}
+class DictionaryNoCase extends Dictionary {
+  constructor(attrs) {
+    super(attrs);
+  }
+  set(key, value) {
+    return super.set(key.toLowerCase(), value);
+  }
+  get(key) {
+    return super.get(key.toLowerCase());
+  }
+  has(key) {
+    return super.has(key.toLowerCase());
+  }
+  remove(key) {
+    return super.remove(key.toLowerCase());
+  }
+}
+function espTime2Seconds(duration) {
+  if (duration) {
+    if (!isNaN(Number(duration)))
+      return Number(duration);
+  } else
+    return 0;
+  const nsIndex = duration.indexOf("ns");
+  if (nsIndex !== -1)
+    return parseFloat(duration.substr(0, nsIndex)) / 1e9;
+  const msIndex = duration.indexOf("ms");
+  if (msIndex !== -1)
+    return parseFloat(duration.substr(0, msIndex)) / 1e3;
+  const sIndex = duration.indexOf("s");
+  if (sIndex !== -1 && duration.indexOf("days") === -1)
+    return parseFloat(duration.substr(0, sIndex));
+  const dayTimeParts = duration.split(" days "), days = dayTimeParts.length > 1 ? parseFloat(dayTimeParts[0]) : 0, time = dayTimeParts.length > 1 ? dayTimeParts[1] : dayTimeParts[0];
+  let secs = 0;
+  const timeParts = time.split(":").reverse();
+  for (let j = 0; j < timeParts.length; ++j)
+    secs += parseFloat(timeParts[j]) * Math.pow(60, j);
+  return days * 24 * 60 * 60 + secs;
+}
+let GraphItem$1 = class {
+  constructor(graph, parent) {
+    __publicField(this, "_graph");
+    __publicField(this, "parent");
+    __publicField(this, "props", {});
+    this._graph = graph, this.parent = parent;
+  }
+}, Subgraph$1 = class Subgraph extends GraphItem$1 {
+  constructor(graph, parent, _) {
+    super(graph, parent);
+    __publicField(this, "subgraphs", []);
+    __publicField(this, "vertices", []);
+    __publicField(this, "edges", []);
+    __publicField(this, "_");
+    parent && parent._addSubgraph(this), this._ = _;
+  }
+  remove(full = !0) {
+    this._graph.removeSubgraph(this, full);
+  }
+  createSubgraph(_) {
+    return this._graph.createSubgraph(this, _);
+  }
+  _addSubgraph(subgraph) {
+    if (this.subgraphs.indexOf(subgraph) >= 0)
+      throw new Error("Subgraph already exists");
+    this.subgraphs.push(subgraph);
+  }
+  _removeSubgraph(subgraph) {
+    const idx = this.subgraphs.indexOf(subgraph);
+    if (idx < 0)
+      throw new Error("Subgraph does not exist");
+    this.subgraphs.splice(idx, 1);
+  }
+  removeAllSubgraphs() {
+    for (let i = this.subgraphs.length - 1; i >= 0; --i)
+      this._graph.removeSubgraph(this.subgraphs[i], !0);
+  }
+  createVertex(_) {
+    return this._graph.createVertex(this, _);
+  }
+  _addVertex(vertex) {
+    if (this.vertices.indexOf(vertex) >= 0)
+      throw new Error("Vertex already exists");
+    this.vertices.push(vertex);
+  }
+  _removeVertex(vertex) {
+    const idx = this.vertices.indexOf(vertex);
+    if (idx < 0)
+      throw new Error("Vertex does not exist");
+    this.vertices.splice(idx, 1);
+  }
+  removeAllVertices() {
+    for (let i = this.vertices.length - 1; i >= 0; --i)
+      this._graph.removeVertex(this.vertices[i], !0);
+  }
+  createEdge(source, target, _) {
+    return this._graph.createEdge(this, source, target, _);
+  }
+  _addEdge(edge) {
+    if (this.edges.indexOf(edge) >= 0)
+      throw new Error("Edge already exists");
+    this.edges.push(edge);
+  }
+  _removeEdge(edge) {
+    const idx = this.edges.indexOf(edge);
+    if (idx < 0)
+      throw new Error("Edge does not exist");
+    this.edges.splice(idx, 1);
+  }
+  _add(item) {
+    item instanceof Subgraph ? this._addSubgraph(item) : item instanceof Vertex$1 ? this._addVertex(item) : this._addEdge(item);
+  }
+}, Vertex$1 = class extends GraphItem$1 {
+  constructor(graph, parent, _) {
+    super(graph, parent);
+    __publicField(this, "inEdges", []);
+    __publicField(this, "outEdges", []);
+    __publicField(this, "_");
+    parent._addVertex(this), this._ = _;
+  }
+  get edges() {
+    return [...this.inEdges, ...this.outEdges];
+  }
+  remove(full = !0, _) {
+    return this._graph.removeVertex(this, full, _);
+  }
+  addInEdge(edge) {
+    this.inEdges.push(edge);
+  }
+  removeInEdge(edge) {
+    const idx = this.inEdges.indexOf(edge);
+    if (idx < 0)
+      throw new Error("In edge does not exist");
+    this.inEdges.splice(idx, 1);
+  }
+  addOutEdge(edge) {
+    this.outEdges.push(edge);
+  }
+  removeOutEdge(edge) {
+    const idx = this.outEdges.indexOf(edge);
+    if (idx < 0)
+      throw new Error("Out edge does not exist");
+    this.outEdges.splice(idx, 1);
+  }
+}, Edge$1 = class extends GraphItem$1 {
+  constructor(graph, parent, source, target, _) {
+    super(graph, parent);
+    __publicField(this, "source");
+    __publicField(this, "target");
+    __publicField(this, "_");
+    if (!source)
+      throw new Error("Missing source vertex");
+    if (!target)
+      throw new Error("Missing target vertex");
+    parent._addEdge(this), this.source = source, this.source.addOutEdge(this), this.target = target, this.target.addInEdge(this), this._ = _;
+  }
+  remove() {
+    this._graph.removeEdge(this);
+  }
+};
+class Graph {
+  constructor(idOf = (item) => "" + item._, _) {
+    __publicField(this, "root");
+    __publicField(this, "_allSubgraphs", []);
+    __publicField(this, "_allSubgraphsMap", {});
+    __publicField(this, "_allVertices", []);
+    __publicField(this, "_allVerticesMap", {});
+    __publicField(this, "_allEdges", []);
+    __publicField(this, "_allEdgesMap", {});
+    __publicField(this, "idOf");
+    this.root = new Subgraph$1(this, null, _), this.idOf = idOf;
+  }
+  createSubgraph(parent, _) {
+    const retVal = new Subgraph$1(this, parent || this.root, _);
+    return this._allSubgraphs.push(retVal), this._allSubgraphsMap[this.idOf(retVal)] = retVal, retVal;
+  }
+  removeSubgraph(subgraph, full = !0) {
+    const idx = this._allSubgraphs.indexOf(subgraph);
+    if (idx < 0)
+      throw new Error("Subgraph does not exist");
+    this._allSubgraphs.splice(idx, 1), delete this._allSubgraphsMap[this.idOf(subgraph)], subgraph.parent && subgraph.parent._removeSubgraph(subgraph), subgraph.edges.forEach((edge) => full ? this.removeEdge(edge) : subgraph.parent._addEdge(edge)), subgraph.vertices.forEach((vertex) => full ? this.removeVertex(vertex, full) : subgraph.parent._addVertex(vertex)), subgraph.subgraphs.forEach(
+      (childSubgraph) => full ? this.removeSubgraph(childSubgraph, full) : subgraph.parent._addSubgraph(childSubgraph)
+    );
+  }
+  get subgraphs() {
+    return this._allSubgraphs;
+  }
+  subgraph(id) {
+    return this._allSubgraphsMap[id];
+  }
+  createVertex(parent, _) {
+    const retVal = new Vertex$1(this, parent, _);
+    return this._allVertices.push(retVal), this._allVerticesMap[this.idOf(retVal)] = retVal, retVal;
+  }
+  removeVertex(vertex, full = !0, _) {
+    const idx = this._allVertices.indexOf(vertex);
+    if (idx < 0)
+      throw new Error("Vertex does not exist");
+    this._allVertices.splice(idx, 1), delete this._allVerticesMap[this.idOf(vertex)], vertex.parent && vertex.parent._removeVertex(vertex), full || vertex.inEdges.forEach((inEdge) => {
+      vertex.outEdges.forEach((outEdge) => {
+        this.createEdge(this.root, inEdge.source, outEdge.target, _ ? _(inEdge.source._, outEdge.target._) : void 0);
+      });
+    }), vertex.inEdges.forEach((edge) => this.removeEdge(edge)), vertex.outEdges.forEach((edge) => this.removeEdge(edge));
+  }
+  get vertices() {
+    return this._allVertices;
+  }
+  vertex(id) {
+    return this._allVerticesMap[id];
+  }
+  createEdge(parent, source, target, _) {
+    const retVal = new Edge$1(this, parent, source, target, _);
+    return this._allEdges.push(retVal), this._allEdgesMap[this.idOf(retVal)] = retVal, retVal;
+  }
+  removeEdge(edge) {
+    const idx = this._allEdges.indexOf(edge);
+    if (idx < 0)
+      throw new Error("Edge does not exist");
+    this._allEdges.splice(idx, 1), delete this._allEdgesMap[this.idOf(edge)], edge.parent && edge.parent._removeEdge(edge), edge.source.removeOutEdge(edge), edge.target.removeInEdge(edge);
+  }
+  get edges() {
+    return this._allEdges;
+  }
+  edge(id) {
+    return this._allEdgesMap[id];
+  }
+  _walk(parent, visitor) {
+    for (const subgraph of parent.subgraphs)
+      switch (visitor(subgraph)) {
+        case "abort":
+          return !0;
+        case "stepover":
+          break;
+        default:
+          if (this._walk(subgraph, visitor)) return !0;
+      }
+    for (const vertex of parent.vertices)
+      if (visitor(vertex) === "abort") return !0;
+  }
+  walk(visitor) {
+    this._walk(this.root, visitor);
+    for (const edge of this._allEdges)
+      if (visitor(edge) === "abort") return !0;
+  }
+  clone() {
+    const ctor = this.constructor, retVal = new ctor(this.idOf, this.root._), map = ObjMap();
+    return map.put(this.root, retVal.root), this.walk((item) => {
+      const parent = map.get(item.parent);
+      if (item instanceof Subgraph$1)
+        map.put(item, parent.createSubgraph(item._));
+      else if (item instanceof Vertex$1)
+        map.put(item, parent.createVertex(item._));
+      else if (item instanceof Edge$1) {
+        const source = map.get(item.source), target = map.get(item.target);
+        parent.createEdge(source, target, item._);
+      }
+    }), retVal;
+  }
+}
+function ObjMap() {
+  const keys = [], values = [];
+  return {
+    put(key, value) {
+      const index = keys.indexOf(key);
+      index === -1 ? (keys.push(key), values.push(value)) : values[index] = value;
+    },
+    get(key) {
+      return values[keys.indexOf(key)];
+    }
+  };
+}
+class GraphItem2 {
+  constructor(g, _) {
+    __publicField(this, "_graph");
+    __publicField(this, "_");
+    this._graph = g, this._ = _;
+  }
+  id() {
+    return this._graph.id(this._);
+  }
+}
+class ChildGraphItem extends GraphItem2 {
+  constructor(g, _) {
+    super(g, _);
+    __publicField(this, "_parent");
+  }
+  clearParent() {
+    return this._parent && (this._parent.removeChild(this), delete this._parent), this;
+  }
+  parent(_) {
+    return arguments.length === 0 ? this._parent : (this._parent !== _ && (this._parent && this._parent.removeChild(this), this._parent = _, this._parent && this._parent.addChild(this)), this);
+  }
+}
+class Subgraph2 extends ChildGraphItem {
+  constructor(g, _) {
+    super(g, _);
+    __publicField(this, "_children", []);
+  }
+  children() {
+    return this._children;
+  }
+  addChild(_) {
+    this._children.push(_);
+  }
+  removeChild(_) {
+    this._children = this._children.filter((row) => row.id !== _.id);
+  }
+}
+class Vertex2 extends ChildGraphItem {
+  constructor(g, _) {
+    super(g, _);
+    __publicField(this, "_inEdges", []);
+    __publicField(this, "_outEdges", []);
+  }
+  edges() {
+    return [...this._inEdges, ...this._outEdges];
+  }
+  edgeCount() {
+    return this._outEdges.length + this._inEdges.length;
+  }
+  inEdges() {
+    return this._inEdges;
+  }
+  addInEdge(e) {
+    this._inEdges.push(e);
+  }
+  removeInEdge(id) {
+    this._inEdges = this._inEdges.filter((e) => e._.id !== id);
+  }
+  outEdges() {
+    return this._outEdges;
+  }
+  addOutEdge(e) {
+    this._outEdges.push(e);
+  }
+  removeOutEdge(id) {
+    this._outEdges = this._outEdges.filter((e) => e._.id !== id);
+  }
+}
+class Edge2 extends ChildGraphItem {
+  constructor(g, _, source, target) {
+    super(g, _);
+    __publicField(this, "_source");
+    __publicField(this, "_target");
+    this._source = source, this._target = target;
+  }
+}
+class Graph2 {
+  constructor(directed = !0) {
+    __publicField(this, "_directed");
+    __publicField(this, "_subgraphMap", {});
+    __publicField(this, "_vertexMap", {});
+    __publicField(this, "_edgeMap", {});
+    __publicField(this, "_idFunc", (_) => typeof _.id == "function" ? _.id() : _.id);
+    __publicField(this, "_sourceFunc", (_) => typeof _.source == "function" ? _.source() : _.source);
+    __publicField(this, "_targetFunc", (_) => typeof _.target == "function" ? _.target() : _.target);
+    __publicField(this, "_updateFunc", (before, after) => after);
+    this._directed = directed;
+  }
+  clear() {
+    return this._subgraphMap = {}, this._vertexMap = {}, this._edgeMap = {}, this;
+  }
+  clearParents() {
+    for (const key in this._subgraphMap)
+      this._subgraphMap[key].clearParent();
+    for (const key in this._vertexMap)
+      this._vertexMap[key].clearParent();
+    return this;
+  }
+  isDirected() {
+    return this._directed;
+  }
+  idFunc(_) {
+    return this._idFunc = _, this;
+  }
+  sourceFunc(_) {
+    return this._sourceFunc = _, this;
+  }
+  targetFunc(_) {
+    return this._targetFunc = _, this;
+  }
+  updateFunc(_) {
+    return this._updateFunc = _, this;
+  }
+  id(_) {
+    return this._idFunc(_);
+  }
+  type(id) {
+    return this.subgraphExists(id) ? "S" : this.vertexExists(id) ? "V" : this.edgeExists(id) ? "E" : "";
+  }
+  isSubgraph(_) {
+    return this.subgraphExists(this.id(_));
+  }
+  isVertex(_) {
+    return this.vertexExists(this.id(_));
+  }
+  isEdge(_) {
+    return this.edgeExists(this.id(_));
+  }
+  allItems() {
+    return [...this.allSubgraphs(), ...this.allVertices(), ...this.allEdges()];
+  }
+  item(id) {
+    if (this.subgraphExists(id)) return this.subgraph(id);
+    if (this.vertexExists(id)) return this.vertex(id);
+    if (this.edgeExists(id)) return this.edge(id);
+  }
+  itemExists(id) {
+    return this.edgeExists(id) || this.vertexExists(id) || this.subgraphExists(id);
+  }
+  // Subgraphs  ---
+  allSubgraphs() {
+    const retVal = [];
+    for (const key in this._subgraphMap)
+      retVal.push(this._subgraphMap[key]._);
+    return retVal;
+  }
+  subgraphs() {
+    const retVal = [];
+    for (const key in this._subgraphMap)
+      this._subgraphMap[key].parent() === void 0 && retVal.push(this._subgraphMap[key]._);
+    return retVal;
+  }
+  subgraphExists(id) {
+    return !!this._subgraphMap[id];
+  }
+  subgraph(id) {
+    return this._subgraphMap[id]._;
+  }
+  subgraphSubgraphs(id) {
+    return this._subgraphMap[id].children().filter((child) => this.isSubgraph(child._)).map((child) => child._);
+  }
+  subgraphVertices(id) {
+    return this._subgraphMap[id].children().filter((child) => this.isVertex(child._)).map((child) => child._);
+  }
+  subgraphEdges(id) {
+    return this._subgraphMap[id].children().filter((child) => this.isEdge(child._)).map((child) => child._);
+  }
+  addSubgraph(s, parent) {
+    const s_id = this._idFunc(s);
+    if (this._subgraphMap[s_id]) throw new Error(`Subgraph '${s_id}' already exists.`);
+    const subgraph = new Subgraph2(this, s);
+    if (parent) {
+      const p_id = this._idFunc(parent);
+      if (!this._subgraphMap[p_id]) throw new Error(`Subgraph '${p_id}' does not exist.`);
+      subgraph.parent(this._subgraphMap[p_id]);
+    }
+    return this._subgraphMap[s_id] = subgraph, this;
+  }
+  mergeSubgraphs(_subgraphs = []) {
+    const sgDiff = compare2(this.allSubgraphs(), _subgraphs, (sg) => this._idFunc(sg), this._updateFunc);
+    return sgDiff.exit.forEach((sg) => this.removeSubgraph(this._idFunc(sg))), sgDiff.enter.forEach((sg) => this.addSubgraph(sg)), sgDiff.update.forEach((sg) => this.updateSubgraph(sg)), this;
+  }
+  updateSubgraph(sg) {
+    const sg_id = this._idFunc(sg), subgraph = this._subgraphMap[sg_id];
+    if (!subgraph) throw new Error(`Subgraph '${sg_id}' does not exist.`);
+    return subgraph._ = sg, this;
+  }
+  removeSubgraph(id, promoteChildren = !0) {
+    const sg = this._subgraphMap[id];
+    if (!sg) throw new Error(`Subgraph '${id}' does not exist.`);
+    return sg.children().forEach((child) => {
+      promoteChildren ? child.parent(sg.parent()) : child instanceof Subgraph2 ? this.removeSubgraph(child.id()) : this.removeVertex(child.id());
+    }), delete this._subgraphMap[id], this;
+  }
+  subgraphParent(id, parentID) {
+    const item = this._subgraphMap[id];
+    if (!item) throw new Error(`Subgraph '${id}' does not exist.`);
+    if (parentID === void 0) {
+      const parent2 = item.parent();
+      return parent2 ? parent2._ : void 0;
+    }
+    const parent = this._subgraphMap[parentID];
+    if (!parent) throw new Error(`Vertex parent '${parent}' does not exist.`);
+    return item.parent(parent), this;
+  }
+  // Vertices  ---
+  allVertices() {
+    const retVal = [];
+    for (const key in this._vertexMap)
+      retVal.push(this._vertexMap[key]._);
+    return retVal;
+  }
+  vertices() {
+    const retVal = [];
+    for (const key in this._vertexMap)
+      this._vertexMap[key].parent() === void 0 && retVal.push(this._vertexMap[key]._);
+    return retVal;
+  }
+  vertexExists(id) {
+    return !!this._vertexMap[id];
+  }
+  vertex(id) {
+    return this._vertexMap[id]._;
+  }
+  allEdges() {
+    const retVal = [];
+    for (const key in this._edgeMap)
+      retVal.push(this._edgeMap[key]._);
+    return retVal;
+  }
+  edges() {
+    const retVal = [];
+    for (const key in this._edgeMap)
+      this._edgeMap[key].parent() === void 0 && retVal.push(this._edgeMap[key]._);
+    return retVal;
+  }
+  vertexEdges(vertexID) {
+    return this._vertexMap[vertexID].edges().map((e) => e._);
+  }
+  inEdges(vertexID) {
+    return this._vertexMap[vertexID].inEdges().map((e) => e._);
+  }
+  outEdges(vertexID) {
+    return this._vertexMap[vertexID].outEdges().map((e) => e._);
+  }
+  _neighbors(id) {
+    return [...this._vertexMap[id].outEdges().map((e) => e._target), ...this._vertexMap[id].inEdges().map((e) => e._source)];
+  }
+  neighbors(id) {
+    return this._neighbors(id).map((n) => n._);
+  }
+  singleNeighbors(id) {
+    return this._neighbors(id).filter((n) => n.edgeCount() === 1).map((n) => n._);
+  }
+  addVertex(v, parent) {
+    const v_id = this._idFunc(v);
+    if (this._vertexMap[v_id]) throw new Error(`Vertex '${v_id}' already exists.`);
+    const vertex = new Vertex2(this, v);
+    if (parent) {
+      const p_id = this._idFunc(parent);
+      if (!this.subgraphExists(p_id)) throw new Error(`Subgraph '${p_id}' does not exist.`);
+      vertex.parent(this._subgraphMap[p_id]);
+    }
+    return this._vertexMap[v_id] = vertex, this;
+  }
+  mergeVertices(_vertices) {
+    const vDiff = compare2(this.allVertices(), _vertices, (v) => this._idFunc(v), this._updateFunc);
+    return vDiff.exit.forEach((v) => this.removeVertex(this._idFunc(v))), vDiff.enter.forEach((v) => this.addVertex(v)), vDiff.update.forEach((v) => this.updateVertex(v)), this;
+  }
+  updateVertex(v) {
+    const v_id = this._idFunc(v), vertex = this._vertexMap[v_id];
+    if (!vertex) throw new Error(`Vertex '${v_id}' does not exist.`);
+    return vertex._ = v, this;
+  }
+  removeVertex(id) {
+    const v = this._vertexMap[id];
+    if (!v) throw new Error(`Vertex '${id}' does not exist.`);
+    return v.edges().forEach((e) => {
+      this.removeEdge(e.id());
+    }), delete this._vertexMap[id], this;
+  }
+  vertexParent(id, parentID) {
+    const item = this._vertexMap[id];
+    if (!item) throw new Error(`Vertex '${id}' does not exist.`);
+    if (parentID === void 0) {
+      const parent2 = item.parent();
+      return parent2 ? parent2._ : void 0;
+    }
+    const parent = this._subgraphMap[parentID];
+    if (!parent) throw new Error(`Vertex parent '${parent}' does not exist.`);
+    return item.parent(parent), this;
+  }
+  // Edges  ---
+  edgeExists(id) {
+    return !!this._edgeMap[id];
+  }
+  edge(id) {
+    return this._edgeMap[id]._;
+  }
+  addEdge(e, parent) {
+    const e_id = this._idFunc(e), e_source = this._sourceFunc(e), e_target = this._targetFunc(e);
+    if (this._edgeMap[e_id]) throw new Error(`Edge '${e_id}' already exists.`);
+    if (!this.vertexExists(e_source)) throw new Error(`Edge Source '${e_source}' does not exist.`);
+    if (!this.vertexExists(e_target)) throw new Error(`Edge Target '${e_target}' does not exist.`);
+    const edge = new Edge2(this, e, this._vertexMap[e_source], this._vertexMap[e_target]);
+    if (parent) {
+      const p_id = this._idFunc(parent);
+      if (!this.subgraphExists(p_id)) throw new Error(`Subgraph '${p_id}' does not exist.`);
+      edge.parent(this._subgraphMap[p_id]);
+    }
+    return this._edgeMap[e_id] = edge, this._vertexMap[e_source].addOutEdge(edge), this._vertexMap[e_target].addInEdge(edge), this;
+  }
+  mergeEdges(_edges) {
+    const eDiff = compare2(this.allEdges(), _edges, (e) => this._idFunc(e), this._updateFunc);
+    return eDiff.exit.forEach((e) => this.removeEdge(this._idFunc(e))), eDiff.enter.forEach((e) => this.addEdge(e)), eDiff.update.forEach((e) => this.updateEdge(e)), this;
+  }
+  updateEdge(e) {
+    var _a, _b, _c, _d;
+    const e_id = this._idFunc(e), edge = this._edgeMap[e_id];
+    if (!edge) throw new Error(`Edge '${e_id}' does not exist.`);
+    const old_source = edge._source.id(), new_source = this._sourceFunc(e);
+    old_source !== new_source && ((_a = this._vertexMap[old_source]) == null || _a.removeOutEdge(e_id), (_b = this._vertexMap[new_source]) == null || _b.addOutEdge(edge));
+    const old_target = edge._target.id(), new_target = this._targetFunc(e);
+    return old_target !== new_target && ((_c = this._vertexMap[old_target]) == null || _c.removeInEdge(e_id), (_d = this._vertexMap[new_target]) == null || _d.addInEdge(edge)), edge._ = e, edge._source = this._vertexMap[new_source], edge._target = this._vertexMap[new_target], this;
+  }
+  removeEdge(id) {
+    const e = this._edgeMap[id];
+    if (!e) throw new Error(`Edge '${id}' does not exist.`);
+    const e_sourceID = this._idFunc(e._source._);
+    if (!this.vertexExists(e_sourceID)) throw new Error(`Edge Source'${e_sourceID}' does not exist.`);
+    this._vertexMap[e_sourceID].removeOutEdge(id);
+    const e_targetID = this._idFunc(e._target._);
+    if (!this.vertexExists(e_targetID)) throw new Error(`Edge Target'${e_targetID}' does not exist.`);
+    return this._vertexMap[e_targetID].removeInEdge(id), delete this._edgeMap[id], this;
+  }
+  _hwalk(item, formatter) {
+    return item instanceof Subgraph2 ? formatter("subgraph", item._, item.children().map((child) => this._hwalk(child, formatter))) : formatter("vertex", item._);
+  }
+  hierarchy(formatter) {
+    const retVal = [];
+    for (const id in this._subgraphMap) {
+      const sg = this._subgraphMap[id];
+      sg.parent() === void 0 && retVal.push(this._hwalk(sg, formatter));
+    }
+    for (const id in this._vertexMap) {
+      const v = this._vertexMap[id];
+      v.parent() === void 0 && retVal.push(this._hwalk(v, formatter));
+    }
+    return retVal;
+  }
+  dijkstra(source, target) {
+    const edges = this.allEdges(), Q = new Set(), prev = {}, dist = {}, adj = {};
+    function vertex_with_min_dist(Q2, dist2) {
+      let min_distance = 1 / 0, u2 = null;
+      return Q2.forEach((v) => {
+        dist2[v] < min_distance && (min_distance = dist2[v], u2 = v);
+      }), u2;
+    }
+    for (let i = 0; i < edges.length; i++) {
+      const v1 = this._sourceFunc(edges[i]), v2 = this._targetFunc(edges[i]), len2 = 1;
+      Q.add(v1), Q.add(v2), dist[v1] = 1 / 0, dist[v2] = 1 / 0, adj[v1] === void 0 && (adj[v1] = {}), adj[v2] === void 0 && (adj[v2] = {}), adj[v1][v2] = len2, adj[v2][v1] = len2;
+    }
+    for (dist[source] = 0; Q.size; ) {
+      const u2 = vertex_with_min_dist(Q, dist);
+      if (u2 === null) break;
+      const neighbors = Object.keys(adj[u2]).filter((v) => Q.has(v));
+      if (Q.delete(u2), u2 === target) break;
+      for (const v of neighbors) {
+        const alt = dist[u2] + adj[u2][v];
+        alt < dist[v] && (dist[v] = alt, prev[v] = u2);
+      }
+    }
+    let u = target;
+    const ids = [u];
+    let len = 0;
+    for (; prev[u] !== void 0; )
+      ids.unshift(prev[u]), len += adj[u][prev[u]], u = prev[u];
+    return { ids, len };
+  }
+  sort(v_id) {
+    const retVal = [], visited = {}, visit = (vertex, ancestors = []) => {
+      const v_id2 = vertex.id();
+      visited[v_id2] || (visited[v_id2] = !0, ancestors.push(vertex), vertex.outEdges().forEach((e) => {
+        ancestors.indexOf(e._target) < 0 && visit(e._target, [...ancestors]);
+      }), retVal.unshift(vertex._));
+    };
+    if (v_id)
+      visit(this._vertexMap[v_id]);
+    else
+      for (const key in this._vertexMap)
+        visit(this._vertexMap[key]);
+    return retVal;
+  }
+}
+class Set {
+  constructor() {
+    __publicField(this, "_content", []);
+  }
+  get size() {
+    return this._content.length;
+  }
+  has(_) {
+    return this._content.indexOf(_) >= 0;
+  }
+  add(_) {
+    this.has(_) || this._content.push(_);
+  }
+  delete(_) {
+    const idx = this._content.indexOf(_);
+    idx >= 0 && this._content.splice(idx, 1);
+  }
+  forEach(_) {
+    this._content.forEach(_);
+  }
+}
+const isArray$1 = Array.isArray, keyList = Object.keys, hasProp = Object.prototype.hasOwnProperty;
+function verboseDeepEquals(a, b, functionRefCompare = !1) {
+  if (a === b) return !0;
+  if (a && b) {
+    if (typeof a == "object" && typeof b == "object") {
+      const arrA = isArray$1(a), arrB = isArray$1(b);
+      let i, length, key;
+      if (arrA && arrB) {
+        if (length = a.length, length !== b.length)
+          return console.warn(`lengths not equal: ${length} !== ${b.length}`), !1;
+        for (i = length; i-- !== 0; )
+          if (!verboseDeepEquals(a[i], b[i], functionRefCompare))
+            return !1;
+        return !0;
+      }
+      if (arrA !== arrB)
+        return console.warn(`arrays not equal: ${arrA} !== ${arrB}`), !1;
+      const dateA = a instanceof Date, dateB = b instanceof Date;
+      if (dateA !== dateB)
+        return console.warn(`dates not equal: ${dateA} !== ${dateB}`), !1;
+      if (dateA && dateB) {
+        const retVal2 = a.getTime() === b.getTime();
+        return retVal2 || console.warn(`dates not equal: ${a.getTime()} !== ${b.getTime()}`), retVal2;
+      }
+      const regexpA = a instanceof RegExp, regexpB = b instanceof RegExp;
+      if (regexpA !== regexpB)
+        return console.warn(`regexps not equal: ${regexpA} !== ${regexpB}`), !1;
+      if (regexpA && regexpB) {
+        const retVal2 = a.toString() === b.toString();
+        return retVal2 || console.warn(`regexps not equal: ${a.toString()} !== ${b.toString()}`), retVal2;
+      }
+      const keys = keyList(a);
+      if (length = keys.length, length !== keyList(b).length)
+        return console.warn(`key lengths not equal: ${length} !== ${keyList(b).length}`), !1;
+      for (i = length; i-- !== 0; )
+        if (!hasProp.call(b, keys[i]))
+          return console.warn(`${keys[i]} in a but not b`), !1;
+      for (i = length; i-- !== 0; )
+        if (key = keys[i], !verboseDeepEquals(a[key], b[key], functionRefCompare))
+          return !1;
+      return !0;
+    } else if (!functionRefCompare && typeof a == "function" && typeof b == "function") {
+      const retVal2 = a.toString() === b.toString();
+      return retVal2 || console.warn(`functions not equal: ${a.toString()} !== ${b.toString()}`), retVal2;
+    }
+  }
+  const retVal = a !== a && b !== b;
+  return retVal || console.warn(`values not equal: ${a} !== ${b}`), retVal;
+}
+function deepEquals(a, b, functionRefCompare = !1) {
+  if (a === b) return !0;
+  if (a && b) {
+    if (typeof a == "object" && typeof b == "object") {
+      const arrA = isArray$1(a), arrB = isArray$1(b);
+      let i, length, key;
+      if (arrA && arrB) {
+        if (length = a.length, length !== b.length) return !1;
+        for (i = length; i-- !== 0; )
+          if (!deepEquals(a[i], b[i], functionRefCompare)) return !1;
+        return !0;
+      }
+      if (arrA !== arrB) return !1;
+      const dateA = a instanceof Date, dateB = b instanceof Date;
+      if (dateA !== dateB) return !1;
+      if (dateA && dateB) return a.getTime() === b.getTime();
+      const regexpA = a instanceof RegExp, regexpB = b instanceof RegExp;
+      if (regexpA !== regexpB) return !1;
+      if (regexpA && regexpB) return a.toString() === b.toString();
+      const keys = keyList(a);
+      if (length = keys.length, length !== keyList(b).length)
+        return !1;
+      for (i = length; i-- !== 0; )
+        if (!hasProp.call(b, keys[i])) return !1;
+      for (i = length; i-- !== 0; )
+        if (key = keys[i], !deepEquals(a[key], b[key], functionRefCompare)) return !1;
+      return !0;
+    } else if (!functionRefCompare && typeof a == "function" && typeof b == "function")
+      return a.toString() === b.toString();
+  }
+  return a !== a && b !== b;
+}
+function update(origItem, newItem, functionRefCompare = !1) {
+  return deepEquals(origItem, newItem, functionRefCompare) ? origItem : newItem;
+}
+const root = typeof globalThis < "u" ? globalThis : window, isBrowser = typeof window < "u" && root === window, isNode = typeof process < "u" && process.versions != null && process.versions.node != null, isCI = isNode && process.env != null && (process.env.TRAVIS != null || process.env.GITHUB_ACTIONS != null);
+function getScriptSrc(partial) {
+  const scripts = document.scripts || [];
+  for (let i = document.scripts.length - 1; i >= 0; --i) {
+    const script = scripts[i];
+    if (script.src) {
+      const idx = script.src.indexOf(partial);
+      if (idx >= 0)
+        return script.src.substring(0, idx);
+    }
+  }
+  return "";
+}
+class Stack {
+  constructor() {
+    __publicField(this, "stack", []);
+  }
+  /**
+   * Push element onto the stack
+   *
+   * @param e - element to push
+   */
+  push(e) {
+    return this.stack.push(e), e;
+  }
+  /**
+   * Pop element off the stack
+   */
+  pop() {
+    return this.stack.pop();
+  }
+  /**
+   * Top item on the stack
+   *
+   * @returns Top element on the stack
+   */
+  top() {
+    return this.stack.length ? this.stack[this.stack.length - 1] : void 0;
+  }
+  /**
+   * Depth of stack
+   *
+   * @returns Depth
+   */
+  depth() {
+    return this.stack.length;
+  }
+}
+var Level = /* @__PURE__ */ ((Level2) => (Level2[Level2.debug = 0] = "debug", Level2[Level2.info = 1] = "info", Level2[Level2.notice = 2] = "notice", Level2[Level2.warning = 3] = "warning", Level2[Level2.error = 4] = "error", Level2[Level2.critical = 5] = "critical", Level2[Level2.alert = 6] = "alert", Level2[Level2.emergency = 7] = "emergency", Level2))(Level || {});
+const colours = {
+  debug: "cyan",
+  info: "green",
+  notice: "grey",
+  warning: "blue",
+  error: "red",
+  critical: "magenta",
+  alert: "magenta",
+  emergency: "magenta"
+};
+class ConsoleWriter {
+  write(dateTime, level, id, msg) {
+    isNode ? console.log(`[${dateTime}] ${Level[level].toUpperCase()} ${id}:  ${msg}`) : console.log(`[${dateTime}] %c${Level[level].toUpperCase()}%c ${id}:  ${msg}`, `color:${colours[Level[level]]}`, "");
+  }
+}
+class Logging {
+  constructor() {
+    __publicField(this, "_levelStack", new Stack());
+    __publicField(this, "_level", 1);
+    __publicField(this, "_filter", "");
+    __publicField(this, "_writer", new ConsoleWriter());
+  }
+  static Instance() {
+    return this._instance || (this._instance = new this());
+  }
+  stringify(obj) {
+    const cache = [];
+    return JSON.stringify(obj, function(_key, value) {
+      if (typeof value == "object" && value !== null) {
+        if (cache.indexOf(value) !== -1)
+          return;
+        cache.push(value);
+      }
+      return value;
+    }, 2);
+  }
+  writer(_) {
+    return _ === void 0 ? this._writer : (this._writer = _, this);
+  }
+  log(level, id, msg) {
+    if (level < this._level || this._filter && this._filter !== id) return;
+    const dateTime = (/* @__PURE__ */ new Date()).toISOString();
+    this._writer.rawWrite ? this._writer.rawWrite(dateTime, level, id, msg) : (typeof msg != "string" && (msg = this.stringify(msg)), this._writer.write && this._writer.write(dateTime, level, id, msg));
+  }
+  debug(id, msg) {
+    this.log(0, id, msg);
+  }
+  info(id, msg) {
+    this.log(1, id, msg);
+  }
+  notice(id, msg) {
+    this.log(2, id, msg);
+  }
+  warning(id, msg) {
+    this.log(3, id, msg);
+  }
+  error(id, msg) {
+    this.log(4, id, msg);
+  }
+  critical(id, msg) {
+    this.log(5, id, msg);
+  }
+  alert(id, msg) {
+    this.log(6, id, msg);
+  }
+  emergency(id, msg) {
+    this.log(7, id, msg);
+  }
+  level(_) {
+    return _ === void 0 ? this._level : (this._level = _, this);
+  }
+  pushLevel(_) {
+    return this._levelStack.push(this._level), this._level = _, this;
+  }
+  popLevel() {
+    return this._level = this._levelStack.pop(), this;
+  }
+  filter(_) {
+    return _ === void 0 ? this._filter : (this._filter = _, this);
+  }
+}
+__publicField(Logging, "_instance");
+const logger = Logging.Instance();
+class ScopedLogging {
+  constructor(scopeID) {
+    __publicField(this, "_scopeID");
+    this._scopeID = scopeID;
+  }
+  debug(msg) {
+    logger.debug(this._scopeID, msg);
+  }
+  info(msg) {
+    logger.info(this._scopeID, msg);
+  }
+  notice(msg) {
+    logger.notice(this._scopeID, msg);
+  }
+  warning(msg) {
+    logger.warning(this._scopeID, msg);
+  }
+  error(msg) {
+    logger.error(this._scopeID, msg);
+  }
+  critical(msg) {
+    logger.critical(this._scopeID, msg);
+  }
+  alert(msg) {
+    logger.alert(this._scopeID, msg);
+  }
+  emergency(msg) {
+    logger.emergency(this._scopeID, msg);
+  }
+  pushLevel(_) {
+    return logger.pushLevel(_), this;
+  }
+  popLevel() {
+    return logger.popLevel(), this;
+  }
+}
+function scopedLogger(scopeID, filter = !1) {
+  return filter && logger.filter(scopeID), new ScopedLogging(scopeID);
+}
+function degreesToRadians(degrees) {
+  return degrees * (Math.PI / 180);
+}
+function radiansToDegrees(radians) {
+  return radians * (180 / Math.PI);
+}
+function polarToCartesian(r, theta) {
+  return {
+    x: r * Math.cos(theta),
+    y: r * Math.sin(theta)
+  };
+}
+function cartesianToPolar(x, y) {
+  return {
+    r: Math.sqrt(x * x + y * y),
+    theta: Math.atan2(y, x)
+  };
+}
+function normalizeRadians(radians, min = -Math.PI, max = Math.PI) {
+  return normalize(radians, min, max);
+}
+function normalizeDegrees(degrees, min = -180, max = 180) {
+  return normalize(degrees, min, max);
+}
+function normalize(value, min, max) {
+  const spread = max - min, offsetValue = value - min;
+  return offsetValue - Math.floor(offsetValue / spread) * spread + min;
+}
+function inner(prop, obj) {
+  if (!(prop === void 0 || obj === void 0)) {
+    for (const item of prop.split(".")) {
+      if (!obj.hasOwnProperty(item))
+        return;
+      obj = obj[item];
+    }
+    return obj;
+  }
+}
+function exists(prop, obj) {
+  return inner(prop, obj) !== void 0;
+}
+function _mixin(dest, source) {
+  const empty = {};
+  for (const key in source) {
+    if (!source.hasOwnProperty(key) || key === "__proto__" || key === "constructor") continue;
+    let s = source[key];
+    s instanceof Array || typeof s == "object" && (s = deepMixin(dest[key], s)), (!(key in dest) || dest[key] !== s && (!(key in empty) || empty[key] !== s)) && (dest[key] = s);
+  }
+  return dest;
+}
+function deepMixin(dest = {}, ...sources) {
+  if (typeof dest != "object") throw new Error(`Destination "${dest}" must be an object.`);
+  for (const source of sources)
+    _mixin(dest, source);
+  return dest;
+}
+function deepMixinT(dest = {}, ...sources) {
+  return deepMixin(dest, ...sources);
+}
+function safeStringify(obj) {
+  const cache = [];
+  return JSON.stringify(obj, function(key, value) {
+    if (typeof value == "object" && value !== null) {
+      if (cache.indexOf(value) !== -1)
+        return;
+      cache.push(value);
+    }
+    return value;
+  });
+}
+function isArray(arg) {
+  return Array.isArray !== void 0 ? Array.isArray(arg) : Object.prototype.toString.call(arg) === "[object Array]";
+}
+function classID2Meta(classID) {
+  const info = classID.split("_"), classInfo = info[1].split(".");
+  return {
+    module: `@hpcc-js/${info[0]}`,
+    file: classInfo[0],
+    class: classInfo[1] || classInfo[0]
+  };
+}
+class ObserverHandle {
+  constructor(eventTarget, eventID, callback) {
+    __publicField(this, "eventTarget");
+    __publicField(this, "eventID");
+    __publicField(this, "callback");
+    this.eventTarget = eventTarget, this.eventID = eventID, this.callback = callback;
+  }
+  release() {
+    this.eventTarget.removeObserver(this.eventID, this.callback);
+  }
+  unwatch() {
+    this.release();
+  }
+}
+class Observable {
+  constructor(...events) {
+    __publicField(this, "_eventObservers", {});
+  }
+  addObserver(eventID, callback) {
+    let eventObservers = this._eventObservers[eventID];
+    return eventObservers || (eventObservers = [], this._eventObservers[eventID] = eventObservers), eventObservers.push(callback), new ObserverHandle(this, eventID, callback);
+  }
+  removeObserver(eventID, callback) {
+    const eventObservers = this._eventObservers[eventID];
+    if (eventObservers)
+      for (let i = eventObservers.length - 1; i >= 0; --i)
+        eventObservers[i] === callback && eventObservers.splice(i, 1);
+    return this;
+  }
+  dispatchEvent(eventID, ...args) {
+    const eventObservers = this._eventObservers[eventID];
+    if (eventObservers)
+      for (const observer of eventObservers)
+        observer(...args);
+    return this;
+  }
+  _hasObserver(eventID) {
+    const eventObservers = this._eventObservers[eventID];
+    for (const observer in eventObservers)
+      if (eventObservers[observer])
+        return !0;
+    return !1;
+  }
+  hasObserver(_eventID) {
+    if (_eventID !== void 0)
+      return this._hasObserver(_eventID);
+    for (const eventID in this._eventObservers)
+      if (this._hasObserver(eventID))
+        return !0;
+    return !1;
+  }
+}
+let requestAnimationFrame;
+(function() {
+  if (root.requestAnimationFrame)
+    requestAnimationFrame = root.requestAnimationFrame;
+  else {
+    let lastTime = 0;
+    requestAnimationFrame = function(callback) {
+      const currTime = (/* @__PURE__ */ new Date()).getTime(), timeToCall = Math.max(0, 16 - (currTime - lastTime)), id = setTimeout(() => callback(currTime + timeToCall), timeToCall);
+      return lastTime = currTime + timeToCall, id;
+    };
+  }
+})();
+class Message {
+  get canConflate() {
+    return !1;
+  }
+  conflate(other) {
+    return !1;
+  }
+  void() {
+    return !1;
+  }
+}
+class Dispatch {
+  constructor() {
+    __publicField(this, "_observerID", 0);
+    __publicField(this, "_observers", []);
+    __publicField(this, "_messageBuffer", []);
+  }
+  observers() {
+    return this._observers;
+  }
+  messages() {
+    const retVal = [];
+    return this._messageBuffer.forEach((msg) => {
+      retVal.some((msg2) => msg2.canConflate && msg2.conflate(msg)) || retVal.push(msg);
+    }), retVal;
+  }
+  dispatchAll() {
+    this.dispatch(this.messages()), this.flush();
+  }
+  dispatch(messages) {
+    messages.length !== 0 && this.observers().forEach((o) => {
+      const msgs = messages.filter((m) => !m.void() && (o.type === void 0 || m instanceof o.type));
+      msgs.length && o.callback(msgs);
+    });
+  }
+  hasObserver() {
+    return this._observers.length > 0;
+  }
+  flush() {
+    this._messageBuffer = [];
+  }
+  send(msg) {
+    this.dispatch([msg]);
+  }
+  post(msg) {
+    this._messageBuffer.push(msg), requestAnimationFrame(() => this.dispatchAll());
+  }
+  attach(callback, type) {
+    const context = this, id = ++this._observerID;
+    return this._observers.push({ id, type, callback }), {
+      release() {
+        context._observers = context._observers.filter((o) => o.id !== id);
+      },
+      unwatch() {
+        this.release();
+      }
+    };
+  }
+}
+class XMLNode {
+  constructor(name) {
+    __publicField(this, "name", "");
+    __publicField(this, "$", {});
+    __publicField(this, "_children", []);
+    __publicField(this, "content", "");
+    this.name = name;
+  }
+  appendAttribute(key, val) {
+    this.$[key] = val;
+  }
+  appendContent(content) {
+    this.content += content;
+  }
+  appendChild(child) {
+    this._children.push(child);
+  }
+  children(tag) {
+    return tag === void 0 ? this._children : this._children.filter((xmlNode) => xmlNode.name === tag);
+  }
+}
+class SAXStackParser {
+  constructor() {
+    __publicField(this, "root");
+    __publicField(this, "stack", new Stack());
+  }
+  walkDoc(node) {
+    const xmlNode = this._startXMLNode(node);
+    if (node.attributes)
+      for (let i = 0; i < node.attributes.length; ++i) {
+        const attribute = node.attributes.item(i);
+        this.attributes(attribute.nodeName, attribute.nodeValue);
+      }
+    if (this.startXMLNode(xmlNode), node.childNodes)
+      for (let i = 0; i < node.childNodes.length; ++i) {
+        const childNode = node.childNodes.item(i);
+        childNode.nodeType === childNode.TEXT_NODE ? this.characters(childNode.nodeValue) : this.walkDoc(childNode);
+      }
+    this.endXMLNode(this.stack.pop());
+  }
+  _startXMLNode(node) {
+    const newNode = new XMLNode(node.nodeName);
+    return this.stack.depth() ? this.stack.top().appendChild(newNode) : this.root = newNode, this.stack.push(newNode);
+  }
+  parse(xml) {
+    const doc = new DOMParser().parseFromString(xml, "application/xml");
+    this.startDocument(), this.walkDoc(doc), this.endDocument();
+  }
+  //  Callbacks  ---
+  startDocument() {
+  }
+  endDocument() {
+  }
+  startXMLNode(node) {
+  }
+  endXMLNode(node) {
+  }
+  attributes(key, val) {
+    this.stack.top().appendAttribute(key, val);
+  }
+  characters(text) {
+    this.stack.top().appendContent(text);
+  }
+}
+class XML2JSONParser extends SAXStackParser {
+  startXMLNode(node) {
+    switch (super.startXMLNode(node), node.name) {
+    }
+  }
+  endXMLNode(node) {
+    switch (node.name) {
+    }
+    super.endXMLNode(node);
+  }
+}
+function xml2json(xml) {
+  const saxParser = new XML2JSONParser();
+  return saxParser.parse(xml), saxParser.root;
+}
+class PropChangedMessage extends Message {
+  constructor(property, newValue, oldValue) {
+    super(), this.property = property, this.newValue = newValue, this.oldValue = oldValue;
+  }
+  get canConflate() {
+    return !0;
+  }
+  conflate(other) {
+    return this.property === other.property ? (this.newValue = other.newValue, !0) : !1;
+  }
+  void() {
+    return deepEquals(this.newValue, this.oldValue);
+  }
+}
+class StateObject {
+  constructor() {
+    __publicField(this, "_espState", {});
+    __publicField(this, "_dispatch", new Dispatch());
+    __publicField(this, "_monitorHandle");
+    __publicField(this, "_monitorTickCount", 0);
+  }
+  clear(newVals) {
+    this._espState = {}, newVals !== void 0 && this.set(newVals), this._monitorTickCount = 0;
+  }
+  get(key, defValue) {
+    return key === void 0 ? this._espState : this.has(key) ? this._espState[key] : defValue;
+  }
+  set(keyOrNewVals, newVal) {
+    if (typeof keyOrNewVals == "string")
+      return this.setSingle(keyOrNewVals, newVal);
+    this.setAll(keyOrNewVals);
+  }
+  setSingle(key, newVal) {
+    const oldVal = this._espState[key];
+    this._espState[key] = newVal, this._dispatch.post(new PropChangedMessage(key, newVal, oldVal));
+  }
+  setAll(_) {
+    for (const key in _)
+      _.hasOwnProperty(key) && this.setSingle(key, _[key]);
+  }
+  has(key) {
+    return this._espState[key] !== void 0;
+  }
+  addObserver(eventID, propIDOrCallback, callback) {
+    if (this.isCallback(propIDOrCallback)) {
+      if (eventID !== "changed") throw new Error("Invalid eventID:  " + eventID);
+      return this._dispatch.attach((messages) => {
+        propIDOrCallback(messages.map((m) => ({
+          id: m.property,
+          oldValue: m.oldValue,
+          newValue: m.newValue
+        })));
+      });
+    } else {
+      if (eventID !== "propChanged") throw new Error("Invalid eventID:  " + eventID);
+      return this._dispatch.attach((messages) => {
+        const filteredMessages = messages.filter((m) => m.property === propIDOrCallback);
+        if (filteredMessages.length) {
+          filteredMessages.length > 1 && console.warn("Should only be 1 message?");
+          const event = filteredMessages[filteredMessages.length - 1];
+          callback({
+            id: event.property,
+            oldValue: event.oldValue,
+            newValue: event.newValue
+          });
+        }
+      });
+    }
+  }
+  on(eventID, propIDOrCallback, callback) {
+    return this.addObserver(eventID, propIDOrCallback, callback), this;
+  }
+  isCallback(propIDOrCallback) {
+    return typeof propIDOrCallback == "function";
+  }
+  hasEventListener() {
+    return this._dispatch.hasObserver();
+  }
+  //  Monitoring  ---
+  async refresh(full = !1) {
+    return await Promise.resolve(), this;
+  }
+  _monitor() {
+    if (this._monitorHandle) {
+      this._monitorTickCount = 0;
+      return;
+    }
+    this._monitorHandle = setTimeout(() => {
+      (this.hasEventListener() ? this.refresh() : Promise.resolve()).then(() => {
+        this._monitor();
+      }), delete this._monitorHandle;
+    }, this._monitorTimeoutDuration());
+  }
+  _monitorTimeoutDuration() {
+    return ++this._monitorTickCount, this._monitorTickCount <= 1 ? 0 : 3e4;
+  }
+  watch(callback, triggerChange = !0) {
+    if (typeof callback != "function")
+      throw new Error("Invalid Callback");
+    triggerChange && setTimeout(() => {
+      const props = this.get(), changes = [];
+      for (const key in props)
+        props.hasOwnProperty(props) && changes.push({ id: key, newValue: props[key], oldValue: void 0 });
+      callback(changes);
+    }, 0);
+    const retVal = this.addObserver("changed", callback);
+    return this._monitor(), retVal;
+  }
+}
+function trim(str, char) {
+  if (typeof char != "string" || char.length === 0) return str;
+  for (; str.indexOf(char) === 0; )
+    str = str.substring(1);
+  for (; endsWith(str, char); )
+    str = str.substring(0, str.length - 1);
+  return str;
+}
+function endsWith(origString, searchString, position) {
+  const subjectString = origString.toString();
+  (typeof position != "number" || !isFinite(position) || Math.floor(position) !== position || position > subjectString.length) && (position = subjectString.length), position -= searchString.length;
+  const lastIndex = subjectString.lastIndexOf(searchString, position);
+  return lastIndex !== -1 && lastIndex === position;
+}
+function join(...segments) {
+  const parts = segments.reduce((parts2, segment) => (parts2.length > 0 && (segment = segment.replace(/^\//, "")), segment = segment.replace(/\/$/, ""), [...parts2, ...segment.split("/")]), []), resultParts = [];
+  for (const part of parts)
+    if (part !== ".") {
+      if (part === "..") {
+        resultParts.pop();
+        continue;
+      }
+      resultParts.push(part);
+    }
+  return resultParts.join("/");
+}
+function dirname(path) {
+  return join(path, "..");
+}
+export {
+  AsyncCache,
+  AsyncOrderedQueue,
+  BUILD_VERSION,
+  Cache,
+  Dictionary,
+  DictionaryNoCase,
+  Dispatch,
+  Edge$1 as Edge,
+  Graph,
+  Graph2,
+  GraphItem$1 as GraphItem,
+  Level,
+  Logging,
+  Message,
+  Observable,
+  PKG_NAME,
+  PKG_VERSION,
+  SAXStackParser,
+  ScopedLogging,
+  Stack,
+  StateObject,
+  Subgraph$1 as Subgraph,
+  Vertex$1 as Vertex,
+  XMLNode,
+  cartesianToPolar,
+  classID2Meta,
+  compare,
+  compare2,
+  debounce,
+  deepEquals,
+  deepMixin,
+  deepMixinT,
+  degreesToRadians,
+  dirname,
+  endsWith,
+  espTime2Seconds,
+  exists,
+  find,
+  getScriptSrc,
+  hashSum,
+  inner,
+  isArray,
+  isBrowser,
+  isCI,
+  isNode,
+  join,
+  logger,
+  normalize,
+  normalizeDegrees,
+  normalizeRadians,
+  polarToCartesian,
+  promiseTimeout,
+  radiansToDegrees,
+  root,
+  safeStringify,
+  scopedLogger,
+  sleep,
+  trim,
+  update,
+  verboseDeepEquals,
+  xml2json
+};
 //# sourceMappingURL=index.js.map