@hpcc-js/util 3.3.8 → 3.3.10

package/dist/index.umd.cjs

@@ -1,2 +1,2 @@
-(function(global,factory){typeof exports=="object"&&typeof module<"u"?factory(exports):typeof define=="function"&&define.amd?define(["exports"],factory):(global=typeof globalThis<"u"?globalThis:global||self,factory(global["@hpcc-js/util"]={}))})(this,function(exports2){"use strict";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 Subgraph2 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 Subgraph2?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 GraphItem{constructor(g,_){__publicField(this,"_graph");__publicField(this,"_");this._graph=g,this._=_}id(){return this._graph.id(this._)}}class ChildGraphItem extends GraphItem{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 Subgraph 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 Vertex 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 Edge 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)}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 Subgraph(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 Subgraph?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}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 Vertex(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}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 Edge(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 Subgraph?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(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 Level=(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=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=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()}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()}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,"..")}exports2.AsyncCache=AsyncCache,exports2.AsyncOrderedQueue=AsyncOrderedQueue,exports2.BUILD_VERSION=BUILD_VERSION,exports2.Cache=Cache,exports2.Dictionary=Dictionary,exports2.DictionaryNoCase=DictionaryNoCase,exports2.Dispatch=Dispatch,exports2.Edge=Edge$1,exports2.Graph=Graph,exports2.Graph2=Graph2,exports2.GraphItem=GraphItem$1,exports2.Level=Level,exports2.Logging=Logging,exports2.Message=Message,exports2.Observable=Observable,exports2.PKG_NAME=PKG_NAME,exports2.PKG_VERSION=PKG_VERSION,exports2.SAXStackParser=SAXStackParser,exports2.ScopedLogging=ScopedLogging,exports2.Stack=Stack,exports2.StateObject=StateObject,exports2.Subgraph=Subgraph$1,exports2.Vertex=Vertex$1,exports2.XMLNode=XMLNode,exports2.cartesianToPolar=cartesianToPolar,exports2.classID2Meta=classID2Meta,exports2.compare=compare,exports2.compare2=compare2,exports2.debounce=debounce,exports2.deepEquals=deepEquals,exports2.deepMixin=deepMixin,exports2.deepMixinT=deepMixinT,exports2.degreesToRadians=degreesToRadians,exports2.dirname=dirname,exports2.endsWith=endsWith,exports2.espTime2Seconds=espTime2Seconds,exports2.exists=exists,exports2.find=find,exports2.getScriptSrc=getScriptSrc,exports2.hashSum=hashSum,exports2.inner=inner,exports2.isArray=isArray,exports2.isBrowser=isBrowser,exports2.isCI=isCI,exports2.isNode=isNode,exports2.join=join,exports2.logger=logger,exports2.normalize=normalize,exports2.normalizeDegrees=normalizeDegrees,exports2.normalizeRadians=normalizeRadians,exports2.polarToCartesian=polarToCartesian,exports2.promiseTimeout=promiseTimeout,exports2.radiansToDegrees=radiansToDegrees,exports2.root=root,exports2.safeStringify=safeStringify,exports2.scopedLogger=scopedLogger,exports2.sleep=sleep,exports2.trim=trim,exports2.update=update,exports2.verboseDeepEquals=verboseDeepEquals,exports2.xml2json=xml2json,Object.defineProperty(exports2,Symbol.toStringTag,{value:"Module"})});
+!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self)["@hpcc-js/util"]={})}(this,function(e){"use strict";var t,r,s,i,n=Object.defineProperty,o=(e,t)=>n(e,"name",{value:t,configurable:!0});function a(e,t){if(null==e)throw new TypeError('"o" is null or not defined');const r=e.length>>>0;if("function"!=typeof t)throw new TypeError("predicate must be a function");const s=arguments[1];let i=0;for(;i<r;){const r=e[i];if(t.call(s,r,i))return r;i++}}function h(e,t){const r={update:[],exit:[],enter:[...t]};for(const s of e){const e=r.enter.indexOf(s);e>=0?(r.update.push(s),r.enter.splice(e,1)):r.exit.push(s)}return r}function c(e,t,r,s=(e,t)=>t){const i={update:[],exit:[],enter:[]};if(e===t)return i.update=e,i;const n={};t.forEach(e=>{n[r(e)]=e});for(const o of e){const e=r(o),t=n[e];void 0!==t?(delete n[e],i.update.push(s(o,t))):i.exit.push(o)}for(const o in n)i.enter.push(n[o]);return i}function u(e,t){for(;e.length<t;)e="0"+e;return e}function d(e,t){if(0===t.length)return e;for(let r=0;r<t.length;++r){e=(e<<5)-e+t.charCodeAt(r),e|=0}return e<0?-2*e:e}function l(e,t,r){return"function"==typeof t.hashSum?t.hashSum():Object.keys(t).sort().reduce((e,s)=>p(e,t[s],s,r),e)}function p(e,t,r,s){const i=d(d(d(e,r),g(t)),typeof t);return null===t?d(i,"null"):void 0===t?d(i,"undefined"):"object"==typeof t?-1!==s.indexOf(t)?d(i,"[Circular]"+r):(s.push(t),l(i,t,s)):d(i,t.toString())}function g(e){return Object.prototype.toString.call(e)}function _(e){return u(p(0,e,"",[]).toString(16),8)}o(a,"find"),o(h,"compare"),o(c,"compare2"),o(u,"pad"),o(d,"fold"),o(l,"foldObject"),o(p,"foldValue"),o(g,"toString"),o(_,"hashSum");const f=class _Cache{_cache={};_calcID;static hash(...e){return _({...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){const r=this._cache[this._calcID(e)];return r||(t?this.set(t()):null)}};o(f,"Cache");let v=f;const b=class _AsyncCache{_cache={};_calcID;static hash(...e){return _({...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){const r=this._cache[this._calcID(e)];return r||(t?this.set(e,t()):Promise.resolve(null))}};o(b,"AsyncCache");let E=b;function x(e,t){const r={};return(...s)=>{const i=_(s);return r[i]||(r[i]={clockStart:Date.now(),promise:e(...s).then(e=>(void 0===t?r[i]=null:setTimeout(()=>{r[i]=null},Math.max(t-(Date.now()-r[i].clockStart),0)),e)).catch(e=>{throw r[i]=null,e})}),r[i].promise}}function m(e,t){let r;const s=new Promise((t,s)=>{r=setTimeout(()=>{clearTimeout(r),s("Timed out in "+e+"ms.")},e)});return Promise.race([t,s]).then(e=>(clearTimeout(r),e)).catch(e=>{throw clearTimeout(r),e})}o(x,"debounce"),o(m,"promiseTimeout");const w=class _AsyncOrderedQueue{_q=[];isTop(e){return this._q[0]===e}push(e){const t=e.then(e=>this.isTop(t)?(this._q.shift(),e):new Promise((r,s)=>{const i=setInterval(()=>{this.isTop(t)&&(clearInterval(i),this._q.shift(),r(e))},20)}));return this._q.push(t),t}};o(w,"AsyncOrderedQueue");let M=w;function S(e){return new Promise(t=>{setTimeout(()=>t(),e)})}o(S,"sleep");const y=class _Dictionary{store={};constructor(e){if(e)for(const t in e)this.set(t,e[t])}set(e,t){const r=this.store[e];return this.store[e]=t,r}get(e){return this.store[e]}has(e){return void 0!==this.store[e]}remove(e){delete this.store[e]}keys(){const e=[];for(const t in this.store)e.push(t);return e}values(){const e=[];for(const t in this.store)e.push(this.store[t]);return e}};o(y,"Dictionary");let O=y;const V=class _DictionaryNoCase extends O{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())}};o(V,"DictionaryNoCase");let I=V;function D(e){if(!e)return 0;if(!isNaN(Number(e)))return Number(e);const t=e.indexOf("ns");if(-1!==t)return parseFloat(e.substr(0,t))/1e9;const r=e.indexOf("ms");if(-1!==r)return parseFloat(e.substr(0,r))/1e3;const s=e.indexOf("s");if(-1!==s&&-1===e.indexOf("days"))return parseFloat(e.substr(0,s));const i=e.split(" days "),n=i.length>1?parseFloat(i[0]):0;let o=0;const a=(i.length>1?i[1]:i[0]).split(":").reverse();for(let h=0;h<a.length;++h)o+=parseFloat(a[h])*Math.pow(60,h);return 24*n*60*60+o}o(D,"espTime2Seconds");let k=(o(t=class{_graph;parent;props={};constructor(e,t){this._graph=e,this.parent=t}},"GraphItem"),t),T=(o(r=class extends k{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){const 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){const 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){const t=this.edges.indexOf(e);if(t<0)throw new Error("Edge does not exist");this.edges.splice(t,1)}_add(e){e instanceof r?this._addSubgraph(e):e instanceof F?this._addVertex(e):this._addEdge(e)}},"Subgraph"),r),F=(o(s=class extends k{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){const 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){const t=this.outEdges.indexOf(e);if(t<0)throw new Error("Out edge does not exist");this.outEdges.splice(t,1)}},"Vertex"),s),$=(o(i=class extends k{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)}},"Edge"),i);const C=class _Graph{root;_allSubgraphs=[];_allSubgraphsMap={};_allVertices=[];_allVerticesMap={};_allEdges=[];_allEdgesMap={};idOf;constructor(e=e=>""+e._,t){this.root=new T(this,null,t),this.idOf=e}createSubgraph(e,t){const r=new T(this,e||this.root,t);return this._allSubgraphs.push(r),this._allSubgraphsMap[this.idOf(r)]=r,r}removeSubgraph(e,t=!0){const 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(r=>t?this.removeEdge(r):e.parent._addEdge(r)),e.vertices.forEach(r=>t?this.removeVertex(r,t):e.parent._addVertex(r)),e.subgraphs.forEach(r=>t?this.removeSubgraph(r,t):e.parent._addSubgraph(r))}get subgraphs(){return this._allSubgraphs}subgraph(e){return this._allSubgraphsMap[e]}createVertex(e,t){const r=new F(this,e,t);return this._allVertices.push(r),this._allVerticesMap[this.idOf(r)]=r,r}removeVertex(e,t=!0,r){const 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(t=>{e.outEdges.forEach(e=>{this.createEdge(this.root,t.source,e.target,r?r(t.source._,e.target._):void 0)})}),e.inEdges.forEach(e=>this.removeEdge(e)),e.outEdges.forEach(e=>this.removeEdge(e))}get vertices(){return this._allVertices}vertex(e){return this._allVerticesMap[e]}createEdge(e,t,r,s){const i=new $(this,e,t,r,s);return this._allEdges.push(i),this._allEdgesMap[this.idOf(i)]=i,i}removeEdge(e){const 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(const r of e.subgraphs)switch(t(r)){case"abort":return!0;case"stepover":break;default:if(this._walk(r,t))return!0}for(const r of e.vertices)if("abort"===t(r))return!0}walk(e){this._walk(this.root,e);for(const t of this._allEdges)if("abort"===e(t))return!0}clone(){const e=new(0,this.constructor)(this.idOf,this.root._),t=N();return t.put(this.root,e.root),this.walk(e=>{const r=t.get(e.parent);if(e instanceof T)t.put(e,r.createSubgraph(e._));else if(e instanceof F)t.put(e,r.createVertex(e._));else if(e instanceof $){const s=t.get(e.source),i=t.get(e.target);r.createEdge(s,i,e._)}}),e}};o(C,"Graph");let L=C;function N(){const e=[],t=[];return{put(r,s){const i=e.indexOf(r);-1===i?(e.push(r),t.push(s)):t[i]=s},get:r=>t[e.indexOf(r)]}}o(N,"ObjMap");const P=class _GraphItem{_graph;_;id(){return this._graph.id(this._)}constructor(e,t){this._graph=e,this._=t}};o(P,"GraphItem");let j=P;const A=class _ChildGraphItem extends j{_parent;constructor(e,t){super(e,t)}clearParent(){return this._parent&&(this._parent.removeChild(this),delete this._parent),this}parent(e){return 0===arguments.length?this._parent:(this._parent!==e&&(this._parent&&this._parent.removeChild(this),this._parent=e,this._parent&&this._parent.addChild(this)),this)}};o(A,"ChildGraphItem");let q=A;const X=class _Subgraph extends q{_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)}};o(X,"Subgraph");let G=X;const R=class _Vertex extends q{_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)}};o(R,"Vertex");let z=R;const B=class _Edge extends q{_source;_target;constructor(e,t,r,s){super(e,t),this._source=r,this._target=s}};o(B,"Edge");let H=B;const W=class _Graph2{_directed;_subgraphMap={};_vertexMap={};_edgeMap={};constructor(e=!0){this._directed=e}clear(){return this._subgraphMap={},this._vertexMap={},this._edgeMap={},this}clearParents(){for(const e in this._subgraphMap)this._subgraphMap[e].clearParent();for(const e in this._vertexMap)this._vertexMap[e].clearParent();return this}isDirected(){return this._directed}_idFunc=o(e=>"function"==typeof e.id?e.id():e.id,"_idFunc");idFunc(e){return this._idFunc=e,this}_sourceFunc=o(e=>"function"==typeof e.source?e.source():e.source,"_sourceFunc");sourceFunc(e){return this._sourceFunc=e,this}_targetFunc=o(e=>"function"==typeof e.target?e.target():e.target,"_targetFunc");targetFunc(e){return this._targetFunc=e,this}_updateFunc=o((e,t)=>t,"_updateFunc");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){return this.subgraphExists(e)?this.subgraph(e):this.vertexExists(e)?this.vertex(e):this.edgeExists(e)?this.edge(e):void 0}itemExists(e){return this.edgeExists(e)||this.vertexExists(e)||this.subgraphExists(e)}allSubgraphs(){const e=[];for(const t in this._subgraphMap)e.push(this._subgraphMap[t]._);return e}subgraphs(){const e=[];for(const t in this._subgraphMap)void 0===this._subgraphMap[t].parent()&&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(e=>this.isSubgraph(e._)).map(e=>e._)}subgraphVertices(e){return this._subgraphMap[e].children().filter(e=>this.isVertex(e._)).map(e=>e._)}subgraphEdges(e){return this._subgraphMap[e].children().filter(e=>this.isEdge(e._)).map(e=>e._)}addSubgraph(e,t){const r=this._idFunc(e);if(this._subgraphMap[r])throw new Error(`Subgraph '${r}' already exists.`);const s=new G(this,e);if(t){const e=this._idFunc(t);if(!this._subgraphMap[e])throw new Error(`Subgraph '${e}' does not exist.`);s.parent(this._subgraphMap[e])}return this._subgraphMap[r]=s,this}mergeSubgraphs(e=[]){const t=c(this.allSubgraphs(),e,e=>this._idFunc(e),this._updateFunc);return t.exit.forEach(e=>this.removeSubgraph(this._idFunc(e))),t.enter.forEach(e=>this.addSubgraph(e)),t.update.forEach(e=>this.updateSubgraph(e)),this}updateSubgraph(e){const 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){const r=this._subgraphMap[e];if(!r)throw new Error(`Subgraph '${e}' does not exist.`);return r.children().forEach(e=>{t?e.parent(r.parent()):e instanceof G?this.removeSubgraph(e.id()):this.removeVertex(e.id())}),delete this._subgraphMap[e],this}subgraphParent(e,t){const r=this._subgraphMap[e];if(!r)throw new Error(`Subgraph '${e}' does not exist.`);if(void 0===t){const e=r.parent();return e?e._:void 0}const s=this._subgraphMap[t];if(!s)throw new Error(`Vertex parent '${s}' does not exist.`);return r.parent(s),this}allVertices(){const e=[];for(const t in this._vertexMap)e.push(this._vertexMap[t]._);return e}vertices(){const e=[];for(const t in this._vertexMap)void 0===this._vertexMap[t].parent()&&e.push(this._vertexMap[t]._);return e}vertexExists(e){return!!this._vertexMap[e]}vertex(e){return this._vertexMap[e]._}allEdges(){const e=[];for(const t in this._edgeMap)e.push(this._edgeMap[t]._);return e}edges(){const e=[];for(const t in this._edgeMap)void 0===this._edgeMap[t].parent()&&e.push(this._edgeMap[t]._);return e}vertexEdges(e){return this._vertexMap[e].edges().map(e=>e._)}inEdges(e){return this._vertexMap[e].inEdges().map(e=>e._)}outEdges(e){return this._vertexMap[e].outEdges().map(e=>e._)}_neighbors(e){return[...this._vertexMap[e].outEdges().map(e=>e._target),...this._vertexMap[e].inEdges().map(e=>e._source)]}neighbors(e){return this._neighbors(e).map(e=>e._)}singleNeighbors(e){return this._neighbors(e).filter(e=>1===e.edgeCount()).map(e=>e._)}addVertex(e,t){const r=this._idFunc(e);if(this._vertexMap[r])throw new Error(`Vertex '${r}' already exists.`);const s=new z(this,e);if(t){const e=this._idFunc(t);if(!this.subgraphExists(e))throw new Error(`Subgraph '${e}' does not exist.`);s.parent(this._subgraphMap[e])}return this._vertexMap[r]=s,this}mergeVertices(e){const t=c(this.allVertices(),e,e=>this._idFunc(e),this._updateFunc);return t.exit.forEach(e=>this.removeVertex(this._idFunc(e))),t.enter.forEach(e=>this.addVertex(e)),t.update.forEach(e=>this.updateVertex(e)),this}updateVertex(e){const t=this._idFunc(e),r=this._vertexMap[t];if(!r)throw new Error(`Vertex '${t}' does not exist.`);return r._=e,this}removeVertex(e){const t=this._vertexMap[e];if(!t)throw new Error(`Vertex '${e}' does not exist.`);return t.edges().forEach(e=>{this.removeEdge(e.id())}),delete this._vertexMap[e],this}vertexParent(e,t){const r=this._vertexMap[e];if(!r)throw new Error(`Vertex '${e}' does not exist.`);if(void 0===t){const e=r.parent();return e?e._:void 0}const 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){const 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.`);const n=new H(this,e,this._vertexMap[s],this._vertexMap[i]);if(t){const e=this._idFunc(t);if(!this.subgraphExists(e))throw new Error(`Subgraph '${e}' does not exist.`);n.parent(this._subgraphMap[e])}return this._edgeMap[r]=n,this._vertexMap[s].addOutEdge(n),this._vertexMap[i].addInEdge(n),this}mergeEdges(e){const t=c(this.allEdges(),e,e=>this._idFunc(e),this._updateFunc);return t.exit.forEach(e=>this.removeEdge(this._idFunc(e))),t.enter.forEach(e=>this.addEdge(e)),t.update.forEach(e=>this.updateEdge(e)),this}updateEdge(e){const t=this._idFunc(e),r=this._edgeMap[t];if(!r)throw new Error(`Edge '${t}' does not exist.`);const s=r._source.id(),i=this._sourceFunc(e);s!==i&&(this._vertexMap[s]?.removeOutEdge(t),this._vertexMap[i]?.addOutEdge(r));const n=r._target.id(),o=this._targetFunc(e);return n!==o&&(this._vertexMap[n]?.removeInEdge(t),this._vertexMap[o]?.addInEdge(r)),r._=e,r._source=this._vertexMap[i],r._target=this._vertexMap[o],this}removeEdge(e){const t=this._edgeMap[e];if(!t)throw new Error(`Edge '${e}' does not exist.`);const r=this._idFunc(t._source._);if(!this.vertexExists(r))throw new Error(`Edge Source'${r}' does not exist.`);this._vertexMap[r].removeOutEdge(e);const 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 G?t("subgraph",e._,e.children().map(e=>this._hwalk(e,t))):t("vertex",e._)}hierarchy(e){const t=[];for(const r in this._subgraphMap){const s=this._subgraphMap[r];void 0===s.parent()&&t.push(this._hwalk(s,e))}for(const r in this._vertexMap){const s=this._vertexMap[r];void 0===s.parent()&&t.push(this._hwalk(s,e))}return t}dijkstra(e,t){const r=this.allEdges(),s=new Q,i={},n={},a={};function h(e,t){let r=1/0,s=null;return e.forEach(e=>{t[e]<r&&(r=t[e],s=e)}),s}o(h,"vertex_with_min_dist");for(let o=0;o<r.length;o++){const e=this._sourceFunc(r[o]),t=this._targetFunc(r[o]),i=1;s.add(e),s.add(t),n[e]=1/0,n[t]=1/0,void 0===a[e]&&(a[e]={}),void 0===a[t]&&(a[t]={}),a[e][t]=i,a[t][e]=i}for(n[e]=0;s.size;){const e=h(s,n);if(null===e)break;const r=Object.keys(a[e]).filter(e=>s.has(e));if(s.delete(e),e===t)break;for(const t of r){const r=n[e]+a[e][t];r<n[t]&&(n[t]=r,i[t]=e)}}let c=t;const u=[c];let d=0;for(;void 0!==i[c];)u.unshift(i[c]),d+=a[c][i[c]],c=i[c];return{ids:u,len:d}}sort(e){const t=[],r={},s=o((e,i=[])=>{const n=e.id();r[n]||(r[n]=!0,i.push(e),e.outEdges().forEach(e=>{i.indexOf(e._target)<0&&s(e._target,[...i])}),t.unshift(e._))},"visit");if(e)s(this._vertexMap[e]);else for(const i in this._vertexMap)s(this._vertexMap[i]);return t}};o(W,"Graph2");let J=W;const U=class _Set{_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){const t=this._content.indexOf(e);t>=0&&this._content.splice(t,1)}forEach(e){this._content.forEach(e)}};o(U,"Set");let Q=U;const K=Array.isArray,Y=Object.keys,Z=Object.prototype.hasOwnProperty;function ee(e,t,r=!1){if(e===t)return!0;if(e&&t){if("object"==typeof e&&"object"==typeof t){const s=K(e),i=K(t);let n,o,a;if(s&&i){if(o=e.length,o!==t.length)return console.warn(`lengths not equal: ${o} !== ${t.length}`),!1;for(n=o;0!==n--;)if(!ee(e[n],t[n],r))return!1;return!0}if(s!==i)return console.warn(`arrays not equal: ${s} !== ${i}`),!1;const h=e instanceof Date,c=t instanceof Date;if(h!==c)return console.warn(`dates not equal: ${h} !== ${c}`),!1;if(h&&c){const r=e.getTime()===t.getTime();return r||console.warn(`dates not equal: ${e.getTime()} !== ${t.getTime()}`),r}const u=e instanceof RegExp,d=t instanceof RegExp;if(u!==d)return console.warn(`regexps not equal: ${u} !== ${d}`),!1;if(u&&d){const r=e.toString()===t.toString();return r||console.warn(`regexps not equal: ${e.toString()} !== ${t.toString()}`),r}const l=Y(e);if(o=l.length,o!==Y(t).length)return console.warn(`key lengths not equal: ${o} !== ${Y(t).length}`),!1;for(n=o;0!==n--;)if(!Z.call(t,l[n]))return console.warn(`${l[n]} in a but not b`),!1;for(n=o;0!==n--;)if(a=l[n],!ee(e[a],t[a],r))return!1;return!0}if(!r&&"function"==typeof e&&"function"==typeof t){const r=e.toString()===t.toString();return r||console.warn(`functions not equal: ${e.toString()} !== ${t.toString()}`),r}}const s=e!=e&&t!=t;return s||console.warn(`values not equal: ${e} !== ${t}`),s}function te(e,t,r=!1){if(e===t)return!0;if(e&&t){if("object"==typeof e&&"object"==typeof t){const s=K(e),i=K(t);let n,o,a;if(s&&i){if(o=e.length,o!==t.length)return!1;for(n=o;0!==n--;)if(!te(e[n],t[n],r))return!1;return!0}if(s!==i)return!1;const h=e instanceof Date,c=t instanceof Date;if(h!==c)return!1;if(h&&c)return e.getTime()===t.getTime();const u=e instanceof RegExp,d=t instanceof RegExp;if(u!==d)return!1;if(u&&d)return e.toString()===t.toString();const l=Y(e);if(o=l.length,o!==Y(t).length)return!1;for(n=o;0!==n--;)if(!Z.call(t,l[n]))return!1;for(n=o;0!==n--;)if(a=l[n],!te(e[a],t[a],r))return!1;return!0}if(!r&&"function"==typeof e&&"function"==typeof t)return e.toString()===t.toString()}return e!=e&&t!=t}function re(e,t,r=!1){return te(e,t,r)?e:t}o(ee,"verboseDeepEquals"),o(te,"deepEquals"),o(re,"update");const se="undefined"!=typeof globalThis?globalThis:window,ie="undefined"!=typeof window&&se===window,ne="undefined"!=typeof process&&null!=process.versions&&null!=process.versions.node,oe=ne&&null!=process.env&&(null!=process.env.TRAVIS||null!=process.env.GITHUB_ACTIONS||null!=process.env.CI);function ae(e){const t=document.scripts||[];for(let r=document.scripts.length-1;r>=0;--r){const s=t[r];if(s.src){const t=s.src.indexOf(e);if(t>=0)return s.src.substring(0,t)}}return""}o(ae,"getScriptSrc");const he=class _Stack{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}};o(he,"Stack");let ce=he;var ue=(e=>(e[e.debug=0]="debug",e[e.info=1]="info",e[e.notice=2]="notice",e[e.warning=3]="warning",e[e.error=4]="error",e[e.critical=5]="critical",e[e.alert=6]="alert",e[e.emergency=7]="emergency",e))(ue||{});const de={debug:"cyan",info:"green",notice:"grey",warning:"blue",error:"red",critical:"magenta",alert:"magenta",emergency:"magenta"},le=class _ConsoleWriter{write(e,t,r,s){ne?console.log(`[${e}] ${ue[t].toUpperCase()} ${r}:  ${s}`):console.log(`[${e}] %c${ue[t].toUpperCase()}%c ${r}:  ${s}`,`color:${de[ue[t]]}`,"")}};o(le,"ConsoleWriter");let pe=le;const ge=class _Logging{_levelStack=new ce;_level=1;_filter="";_writer=new pe;static Instance(){return this._instance||(this._instance=new this)}constructor(){}stringify(e){const t=[];return JSON.stringify(e,function(e,r){if("object"==typeof r&&null!==r){if(-1!==t.indexOf(r))return;t.push(r)}return r},2)}writer(e){return void 0===e?this._writer:(this._writer=e,this)}log(e,t,r){if(e<this._level)return;if(this._filter&&this._filter!==t)return;const s=(new Date).toISOString();this._writer.rawWrite?this._writer.rawWrite(s,e,t,r):("string"!=typeof r&&(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 void 0===e?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 void 0===e?this._filter:(this._filter=e,this)}};var _e,fe;o(ge,"Logging"),((e,t,r)=>{t in e?n(e,t,{enumerable:!0,configurable:!0,writable:!0,value:r}):e[t]=r})(ge,"symbol"!=typeof(_e="_instance")?_e+"":_e,fe);let ve=ge;const be=ve.Instance(),Ee=class _ScopedLogging{_scopeID;constructor(e){this._scopeID=e}debug(e){be.debug(this._scopeID,e)}info(e){be.info(this._scopeID,e)}notice(e){be.notice(this._scopeID,e)}warning(e){be.warning(this._scopeID,e)}error(e){be.error(this._scopeID,e)}critical(e){be.critical(this._scopeID,e)}alert(e){be.alert(this._scopeID,e)}emergency(e){be.emergency(this._scopeID,e)}pushLevel(e){return be.pushLevel(e),this}popLevel(){return be.popLevel(),this}};o(Ee,"ScopedLogging");let xe=Ee;function me(e,t=!1){return t&&be.filter(e),new xe(e)}function we(e){return e*(Math.PI/180)}function Me(e){return e*(180/Math.PI)}function Se(e,t){return{x:e*Math.cos(t),y:e*Math.sin(t)}}function ye(e,t){return{r:Math.sqrt(e*e+t*t),theta:Math.atan2(t,e)}}function Oe(e,t=-Math.PI,r=Math.PI){return Ie(e,t,r)}function Ve(e,t=-180,r=180){return Ie(e,t,r)}function Ie(e,t,r){const s=r-t,i=e-t;return i-Math.floor(i/s)*s+t}function De(e,t){if(void 0!==e&&void 0!==t){for(const r of e.split(".")){if(!t.hasOwnProperty(r))return;t=t[r]}return t}}function ke(e,t){return void 0!==De(e,t)}function Te(e,t){const r={};for(const s in t){if(!t.hasOwnProperty(s))continue;if("__proto__"===s||"constructor"===s)continue;let i=t[s];i instanceof Array||"object"==typeof i&&(i=Fe(e[s],i)),s in e&&(e[s]===i||s in r&&r[s]===i)||(e[s]=i)}return e}function Fe(e={},...t){if("object"!=typeof e)throw new Error(`Destination "${e}" must be an object.`);for(const r of t)Te(e,r);return e}function $e(e={},...t){return Fe(e,...t)}function Ce(e){const t=[];return JSON.stringify(e,function(e,r){if("object"==typeof r&&null!==r){if(-1!==t.indexOf(r))return;t.push(r)}return r})}function Le(e){return void 0!==Array.isArray?Array.isArray(e):"[object Array]"===Object.prototype.toString.call(e)}function Ne(e){const t=e.split("_"),r=t[1].split(".");return{module:`@hpcc-js/${t[0]}`,file:r[0],class:r[1]||r[0]}}o(me,"scopedLogger"),o(we,"degreesToRadians"),o(Me,"radiansToDegrees"),o(Se,"polarToCartesian"),o(ye,"cartesianToPolar"),o(Oe,"normalizeRadians"),o(Ve,"normalizeDegrees"),o(Ie,"normalize"),o(De,"inner"),o(ke,"exists"),o(Te,"_mixin"),o(Fe,"deepMixin"),o($e,"deepMixinT"),o(Ce,"safeStringify"),o(Le,"isArray"),o(Ne,"classID2Meta");const Pe=class _ObserverHandle{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()}};o(Pe,"ObserverHandle");let je=Pe;const Ae=class _Observable{_eventObservers={};constructor(...e){}addObserver(e,t){let r=this._eventObservers[e];return r||(r=[],this._eventObservers[e]=r),r.push(t),new je(this,e,t)}removeObserver(e,t){const 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){const r=this._eventObservers[e];if(r)for(const s of r)s(...t);return this}_hasObserver(e){const t=this._eventObservers[e];for(const r in t)if(t[r])return!0;return!1}hasObserver(e){if(void 0!==e)return this._hasObserver(e);for(const t in this._eventObservers)if(this._hasObserver(t))return!0;return!1}};o(Ae,"Observable");let qe,Xe=Ae;!function(){if(se.requestAnimationFrame)qe=se.requestAnimationFrame;else{let e=0;qe=o(function(t){const r=(new Date).getTime(),s=Math.max(0,16-(r-e)),i=setTimeout(()=>t(r+s),s);return e=r+s,i},"requestAnimationFrame")}}();const Ge=class _Message{get canConflate(){return!1}conflate(e){return!1}void(){return!1}};o(Ge,"Message");let Re=Ge;const ze=class _Dispatch{_observerID=0;_observers=[];_messageBuffer=[];constructor(){}observers(){return this._observers}messages(){const e=[];return this._messageBuffer.forEach(t=>{e.some(e=>e.canConflate&&e.conflate(t))||e.push(t)}),e}dispatchAll(){this.dispatch(this.messages()),this.flush()}dispatch(e){0!==e.length&&this.observers().forEach(t=>{const r=e.filter(e=>!e.void()&&(void 0===t.type||e 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),qe(()=>this.dispatchAll())}attach(e,t){const r=this,s=++this._observerID;return this._observers.push({id:s,type:t,callback:e}),{release(){r._observers=r._observers.filter(e=>e.id!==s)},unwatch(){this.release()}}}};o(ze,"Dispatch");let Be=ze;const He=class _XMLNode{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 void 0===e?this._children:this._children.filter(t=>t.name===e)}};o(He,"XMLNode");let We=He;const Je=class _SAXStackParser{root;stack=new ce;constructor(){}walkDoc(e){const t=this._startXMLNode(e);if(e.attributes)for(let r=0;r<e.attributes.length;++r){const t=e.attributes.item(r);this.attributes(t.nodeName,t.nodeValue)}if(this.startXMLNode(t),e.childNodes)for(let r=0;r<e.childNodes.length;++r){const t=e.childNodes.item(r);t.nodeType===t.TEXT_NODE?this.characters(t.nodeValue):this.walkDoc(t)}this.endXMLNode(this.stack.pop())}_startXMLNode(e){const t=new We(e.nodeName);return this.stack.depth()?this.stack.top().appendChild(t):this.root=t,this.stack.push(t)}parse(e){const t=(new DOMParser).parseFromString(e,"application/xml");this.startDocument(),this.walkDoc(t),this.endDocument()}startDocument(){}endDocument(){}startXMLNode(e){}endXMLNode(e){}attributes(e,t){this.stack.top().appendAttribute(e,t)}characters(e){this.stack.top().appendContent(e)}};o(Je,"SAXStackParser");let Ue=Je;const Qe=class _XML2JSONParser extends Ue{startXMLNode(e){super.startXMLNode(e),e.name}endXMLNode(e){e.name,super.endXMLNode(e)}};o(Qe,"XML2JSONParser");let Ke=Qe;function Ye(e){const t=new Ke;return t.parse(e),t.root}o(Ye,"xml2json");const Ze=class _PropChangedMessage extends Re{constructor(e,t,r){super(),this.property=e,this.newValue=t,this.oldValue=r}get canConflate(){return!0}conflate(e){return this.property===e.property&&(this.newValue=e.newValue,!0)}void(){return te(this.newValue,this.oldValue)}};o(Ze,"PropChangedMessage");let et=Ze;const tt=class _StateObject{_espState={};_dispatch=new Be;_monitorHandle;_monitorTickCount=0;clear(e){this._espState={},void 0!==e&&this.set(e),this._monitorTickCount=0}get(e,t){return void 0===e?this._espState:this.has(e)?this._espState[e]:t}set(e,t){if("string"==typeof e)return this.setSingle(e,t);this.setAll(e)}setSingle(e,t){const r=this._espState[e];this._espState[e]=t,this._dispatch.post(new et(e,t,r))}setAll(e){for(const t in e)e.hasOwnProperty(t)&&this.setSingle(t,e[t])}has(e){return void 0!==this._espState[e]}addObserver(e,t,r){if(this.isCallback(t)){if("changed"!==e)throw new Error("Invalid eventID:  "+e);return this._dispatch.attach(e=>{t(e.map(e=>({id:e.property,oldValue:e.oldValue,newValue:e.newValue})))})}if("propChanged"!==e)throw new Error("Invalid eventID:  "+e);return this._dispatch.attach(e=>{const s=e.filter(e=>e.property===t);if(s.length){s.length>1&&console.warn("Should only be 1 message?");const e=s[s.length-1];r({id:e.property,oldValue:e.oldValue,newValue:e.newValue})}})}on(e,t,r){return this.addObserver(e,t,r),this}isCallback(e){return"function"==typeof e}hasEventListener(){return this._dispatch.hasObserver()}async refresh(e=!1){return await Promise.resolve(),this}_monitor(){this._monitorHandle?this._monitorTickCount=0: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("function"!=typeof e)throw new Error("Invalid Callback");t&&setTimeout(()=>{const t=this.get(),r=[];for(const e in t)t.hasOwnProperty(t)&&r.push({id:e,newValue:t[e],oldValue:void 0});e(r)},0);const r=this.addObserver("changed",e);return this._monitor(),r}};o(tt,"StateObject");let rt=tt;function st(e,t){if("string"!=typeof t)return e;if(0===t.length)return e;for(;0===e.indexOf(t);)e=e.substring(1);for(;it(e,t);)e=e.substring(0,e.length-1);return e}function it(e,t,r){const s=e.toString();("number"!=typeof r||!isFinite(r)||Math.floor(r)!==r||r>s.length)&&(r=s.length),r-=t.length;const i=s.lastIndexOf(t,r);return-1!==i&&i===r}function nt(...e){const t=e.reduce((e,t)=>(e.length>0&&(t=t.replace(/^\//,"")),t=t.replace(/\/$/,""),[...e,...t.split("/")]),[]),r=[];for(const s of t)"."!==s&&(".."!==s?r.push(s):r.pop());return r.join("/")}function ot(e){return nt(e,"..")}o(st,"trim"),o(it,"endsWith"),o(nt,"join"),o(ot,"dirname"),e.AsyncCache=E,e.AsyncOrderedQueue=M,e.BUILD_VERSION="3.2.1",e.Cache=v,e.Dictionary=O,e.DictionaryNoCase=I,e.Dispatch=Be,e.Edge=$,e.Graph=L,e.Graph2=J,e.GraphItem=k,e.Level=ue,e.Logging=ve,e.Message=Re,e.Observable=Xe,e.PKG_NAME="@hpcc-js/util",e.PKG_VERSION="3.2.0",e.SAXStackParser=Ue,e.ScopedLogging=xe,e.Stack=ce,e.StateObject=rt,e.Subgraph=T,e.Vertex=F,e.XMLNode=We,e.cartesianToPolar=ye,e.classID2Meta=Ne,e.compare=h,e.compare2=c,e.debounce=x,e.deepEquals=te,e.deepMixin=Fe,e.deepMixinT=$e,e.degreesToRadians=we,e.dirname=ot,e.endsWith=it,e.espTime2Seconds=D,e.exists=ke,e.find=a,e.getScriptSrc=ae,e.hashSum=_,e.inner=De,e.isArray=Le,e.isBrowser=ie,e.isCI=oe,e.isNode=ne,e.join=nt,e.logger=be,e.normalize=Ie,e.normalizeDegrees=Ve,e.normalizeRadians=Oe,e.polarToCartesian=Se,e.promiseTimeout=m,e.radiansToDegrees=Me,e.root=se,e.safeStringify=Ce,e.scopedLogger=me,e.sleep=S,e.trim=st,e.update=re,e.verboseDeepEquals=ee,e.xml2json=Ye,Object.defineProperty(e,Symbol.toStringTag,{value:"Module"})});
 //# sourceMappingURL=index.umd.cjs.map