@hpcc-js/util 3.4.1 → 3.4.2

package/dist/index.js

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