@hpcc-js/util 2.52.0 → 3.1.0

package/dist/index.js

@@ -1,2591 +1,2 @@
-(function (global, factory) {
-  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
-  typeof define === 'function' && define.amd ? define(['exports'], factory) :
-  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global["@hpcc-js/util"] = {}));
-})(this, (function (exports) { 'use strict';
-
-  var PKG_NAME = "@hpcc-js/util";
-  var PKG_VERSION = "2.52.0";
-  var BUILD_VERSION = "2.106.0";
-
-  /******************************************************************************
-  Copyright (c) Microsoft Corporation.
-
-  Permission to use, copy, modify, and/or distribute this software for any
-  purpose with or without fee is hereby granted.
-
-  THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
-  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
-  AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
-  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
-  LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
-  OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
-  PERFORMANCE OF THIS SOFTWARE.
-  ***************************************************************************** */
-  /* global Reflect, Promise, SuppressedError, Symbol */
-
-  var extendStatics = function(d, b) {
-    extendStatics = Object.setPrototypeOf ||
-        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
-        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
-    return extendStatics(d, b);
-  };
-
-  function __extends(d, b) {
-    if (typeof b !== "function" && b !== null)
-        throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
-    extendStatics(d, b);
-    function __() { this.constructor = d; }
-    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-  }
-
-  var __assign = function() {
-    __assign = Object.assign || function __assign(t) {
-        for (var s, i = 1, n = arguments.length; i < n; i++) {
-            s = arguments[i];
-            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
-        }
-        return t;
-    };
-    return __assign.apply(this, arguments);
-  };
-
-  function __awaiter(thisArg, _arguments, P, generator) {
-    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
-    return new (P || (P = Promise))(function (resolve, reject) {
-        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
-        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
-        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
-        step((generator = generator.apply(thisArg, _arguments || [])).next());
-    });
-  }
-
-  function __generator(thisArg, body) {
-    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
-    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
-    function verb(n) { return function (v) { return step([n, v]); }; }
-    function step(op) {
-        if (f) throw new TypeError("Generator is already executing.");
-        while (g && (g = 0, op[0] && (_ = 0)), _) try {
-            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
-            if (y = 0, t) op = [op[0] & 2, t.value];
-            switch (op[0]) {
-                case 0: case 1: t = op; break;
-                case 4: _.label++; return { value: op[1], done: false };
-                case 5: _.label++; y = op[1]; op = [0]; continue;
-                case 7: op = _.ops.pop(); _.trys.pop(); continue;
-                default:
-                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
-                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
-                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
-                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
-                    if (t[2]) _.ops.pop();
-                    _.trys.pop(); continue;
-            }
-            op = body.call(thisArg, _);
-        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
-        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
-    }
-  }
-
-  function __spreadArray(to, from, pack) {
-    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
-        if (ar || !(i in from)) {
-            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
-            ar[i] = from[i];
-        }
-    }
-    return to.concat(ar || Array.prototype.slice.call(from));
-  }
-
-  typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) {
-    var e = new Error(message);
-    return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
-  };
-
-  // Based on:  https://tc39.github.io/ecma262/#sec-array.prototype.find
-  function find(o, predicate) {
-      // 1. Let O be ? ToObject(this value).
-      if (o == null) {
-          throw new TypeError('"o" is null or not defined');
-      }
-      // 2. Let len be ? ToLength(? Get(O, "length")).
-      var len = o.length >>> 0;
-      // 3. If IsCallable(predicate) is false, throw a TypeError exception.
-      if (typeof predicate !== "function") {
-          throw new TypeError("predicate must be a function");
-      }
-      // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.
-      var thisArg = arguments[1];
-      // 5. Let k be 0.
-      var k = 0;
-      // 6. Repeat, while k < len
-      while (k < len) {
-          // a. Let Pk be ! ToString(k).
-          // b. Let kValue be ? Get(O, Pk).
-          // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).
-          // d. If testResult is true, return kValue.
-          var kValue = o[k];
-          if (predicate.call(thisArg, kValue, k, o)) {
-              return kValue;
-          }
-          // e. Increase k by 1.
-          k++;
-      }
-      // 7. Return undefined.
-      return undefined;
-  }
-  function compare(before, after) {
-      var retVal = {
-          update: [],
-          exit: [],
-          enter: __spreadArray([], after, true)
-      };
-      for (var _i = 0, before_1 = before; _i < before_1.length; _i++) {
-          var row = before_1[_i];
-          var otherIdx = retVal.enter.indexOf(row);
-          if (otherIdx >= 0) {
-              retVal.update.push(row);
-              retVal.enter.splice(otherIdx, 1);
-          }
-          else {
-              retVal.exit.push(row);
-          }
-      }
-      return retVal;
-  }
-  function compare2(before, after, idFunc, updateFunc) {
-      if (updateFunc === void 0) { updateFunc = function (before, after) { return after; }; }
-      var retVal = {
-          update: [],
-          exit: [],
-          enter: []
-      };
-      if (before === after) {
-          retVal.update = before;
-          return retVal;
-      }
-      var unknownMap = {};
-      after.forEach(function (item) {
-          unknownMap[idFunc(item)] = item;
-      });
-      for (var _i = 0, before_2 = before; _i < before_2.length; _i++) {
-          var row = before_2[_i];
-          var id = idFunc(row);
-          var item = unknownMap[id];
-          if (item !== undefined) {
-              delete unknownMap[id];
-              retVal.update.push(updateFunc(row, item));
-          }
-          else {
-              retVal.exit.push(row);
-          }
-      }
-      for (var key in unknownMap) {
-          retVal.enter.push(unknownMap[key]);
-      }
-      return retVal;
-  }
-
-  //  Ported to TypeScript from:  https://github.com/bevacqua/hash-sum
-  function pad(hash, len) {
-      while (hash.length < len) {
-          hash = "0" + hash;
-      }
-      return hash;
-  }
-  function fold(hash, text) {
-      if (text.length === 0) {
-          return hash;
-      }
-      for (var i = 0; i < text.length; ++i) {
-          var chr = text.charCodeAt(i);
-          hash = ((hash << 5) - hash) + chr;
-          hash |= 0;
-      }
-      return hash < 0 ? hash * -2 : hash;
-  }
-  function foldObject(hash, o, seen) {
-      if (typeof o.hashSum === "function") {
-          return o.hashSum();
-      }
-      return Object.keys(o).sort().reduce(function (input, key) {
-          return foldValue(input, o[key], key, seen);
-      }, hash);
-  }
-  function foldValue(input, value, key, seen) {
-      var hash = fold(fold(fold(input, key), toString(value)), typeof value);
-      if (value === null) {
-          return fold(hash, "null");
-      }
-      if (value === undefined) {
-          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());
-  }
-  function toString(o) {
-      return Object.prototype.toString.call(o);
-  }
-  function hashSum(o) {
-      return pad(foldValue(0, o, "", []).toString(16), 8);
-  }
-
-  var Cache = /** @class */ (function () {
-      function Cache(calcID) {
-          this._cache = {};
-          this._calcID = calcID;
-      }
-      Cache.hash = function () {
-          var args = [];
-          for (var _i = 0; _i < arguments.length; _i++) {
-              args[_i] = arguments[_i];
-          }
-          return hashSum(__assign({}, args));
-      };
-      Cache.prototype.has = function (espObj) {
-          return this._calcID(espObj) in this._cache;
-      };
-      Cache.prototype.set = function (obj) {
-          this._cache[this._calcID(obj)] = obj;
-          return obj;
-      };
-      Cache.prototype.get = function (espObj, factory) {
-          var retVal = this._cache[this._calcID(espObj)];
-          if (!retVal) {
-              return factory ? this.set(factory()) : null;
-          }
-          return retVal;
-      };
-      return Cache;
-  }());
-  var AsyncCache = /** @class */ (function () {
-      function AsyncCache(calcID) {
-          this._cache = {};
-          this._calcID = calcID;
-      }
-      AsyncCache.hash = function () {
-          var args = [];
-          for (var _i = 0; _i < arguments.length; _i++) {
-              args[_i] = arguments[_i];
-          }
-          return hashSum(__assign({}, args));
-      };
-      AsyncCache.prototype.has = function (espObj) {
-          return this._calcID(espObj) in this._cache;
-      };
-      AsyncCache.prototype.set = function (espObj, obj) {
-          this._cache[this._calcID(espObj)] = obj;
-          return obj;
-      };
-      AsyncCache.prototype.get = function (espObj, factory) {
-          var retVal = this._cache[this._calcID(espObj)];
-          if (!retVal) {
-              return factory ? this.set(espObj, factory()) : Promise.resolve(null);
-          }
-          return retVal;
-      };
-      return AsyncCache;
-  }());
-
-  function debounce(fn, timeout) {
-      var promises = {};
-      return function () {
-          var params = [];
-          for (var _i = 0; _i < arguments.length; _i++) {
-              params[_i] = arguments[_i];
-          }
-          var hash = hashSum(params);
-          if (!promises[hash]) {
-              promises[hash] = {
-                  clockStart: Date.now(),
-                  promise: fn.apply(void 0, params).then(function (response) {
-                      if (timeout === undefined) {
-                          promises[hash] = null;
-                      }
-                      else {
-                          setTimeout(function () {
-                              promises[hash] = null;
-                          }, Math.max(timeout - (Date.now() - promises[hash].clockStart), 0));
-                      }
-                      return response;
-                  }).catch(function (e) {
-                      promises[hash] = null;
-                      throw e;
-                  })
-              };
-          }
-          return promises[hash].promise;
-      };
-  }
-  function promiseTimeout(ms, promise) {
-      var id;
-      var timeout = new Promise(function (resolve, reject) {
-          id = setTimeout(function () {
-              clearTimeout(id);
-              reject("Timed out in " + ms + "ms.");
-          }, ms);
-      });
-      return Promise.race([
-          promise,
-          timeout
-      ]).then(function (response) {
-          clearTimeout(id);
-          return response;
-      }).catch(function (e) {
-          clearTimeout(id);
-          throw e;
-      });
-  }
-  var AsyncOrderedQueue = /** @class */ (function () {
-      function AsyncOrderedQueue() {
-          this._q = [];
-      }
-      AsyncOrderedQueue.prototype.isTop = function (p) {
-          return this._q[0] === p;
-      };
-      AsyncOrderedQueue.prototype.push = function (p) {
-          var _this = this;
-          var retVal = p.then(function (response) {
-              if (_this.isTop(retVal)) {
-                  _this._q.shift();
-                  return response;
-              }
-              return new Promise(function (resolve, reject) {
-                  var intervalHandler = setInterval(function () {
-                      if (_this.isTop(retVal)) {
-                          clearInterval(intervalHandler);
-                          _this._q.shift();
-                          resolve(response);
-                      }
-                  }, 20);
-              });
-          });
-          this._q.push(retVal);
-          return retVal;
-      };
-      return AsyncOrderedQueue;
-  }());
-  function sleep(ms) {
-      return new Promise(function (resolve) {
-          setTimeout(function () { return resolve(); }, ms);
-      });
-  }
-
-  var Dictionary = /** @class */ (function () {
-      function Dictionary(attrs) {
-          this.store = {};
-          if (attrs) {
-              for (var key in attrs) {
-                  this.set(key, attrs[key]);
-              }
-          }
-      }
-      Dictionary.prototype.set = function (key, value) {
-          var retVal = this.store[key];
-          this.store[key] = value;
-          return retVal;
-      };
-      Dictionary.prototype.get = function (key) {
-          return this.store[key];
-      };
-      Dictionary.prototype.has = function (key) {
-          return this.store[key] !== undefined;
-      };
-      Dictionary.prototype.remove = function (key) {
-          delete this.store[key];
-      };
-      Dictionary.prototype.keys = function () {
-          var retVal = [];
-          for (var key in this.store) {
-              retVal.push(key);
-          }
-          return retVal;
-      };
-      Dictionary.prototype.values = function () {
-          var retVal = [];
-          for (var key in this.store) {
-              retVal.push(this.store[key]);
-          }
-          return retVal;
-      };
-      return Dictionary;
-  }());
-  var DictionaryNoCase = /** @class */ (function (_super) {
-      __extends(DictionaryNoCase, _super);
-      function DictionaryNoCase(attrs) {
-          return _super.call(this, attrs) || this;
-      }
-      DictionaryNoCase.prototype.set = function (key, value) {
-          return _super.prototype.set.call(this, key.toLowerCase(), value);
-      };
-      DictionaryNoCase.prototype.get = function (key) {
-          return _super.prototype.get.call(this, key.toLowerCase());
-      };
-      DictionaryNoCase.prototype.has = function (key) {
-          return _super.prototype.has.call(this, key.toLowerCase());
-      };
-      DictionaryNoCase.prototype.remove = function (key) {
-          return _super.prototype.remove.call(this, key.toLowerCase());
-      };
-      return DictionaryNoCase;
-  }(Dictionary));
-
-  function espTime2Seconds(duration) {
-      if (!duration) {
-          return 0;
-      }
-      else {
-          if (!isNaN(Number(duration))) {
-              return Number(duration);
-          }
-      }
-      //  GH:  <n>ns or <m>ms or <s>s or [<d> days ][<h>:][<m>:]<s>[.<ms>]
-      var nsIndex = duration.indexOf("ns");
-      if (nsIndex !== -1) {
-          return parseFloat(duration.substr(0, nsIndex)) / 1000000000;
-      }
-      var msIndex = duration.indexOf("ms");
-      if (msIndex !== -1) {
-          return parseFloat(duration.substr(0, msIndex)) / 1000;
-      }
-      var sIndex = duration.indexOf("s");
-      if (sIndex !== -1 && duration.indexOf("days") === -1) {
-          return parseFloat(duration.substr(0, sIndex));
-      }
-      var dayTimeParts = duration.split(" days ");
-      var days = dayTimeParts.length > 1 ? parseFloat(dayTimeParts[0]) : 0.0;
-      var time = dayTimeParts.length > 1 ? dayTimeParts[1] : dayTimeParts[0];
-      var secs = 0.0;
-      var timeParts = time.split(":").reverse();
-      for (var j = 0; j < timeParts.length; ++j) {
-          secs += parseFloat(timeParts[j]) * Math.pow(60, j);
-      }
-      return (days * 24 * 60 * 60) + secs;
-  }
-
-  var GraphItem$1 = /** @class */ (function () {
-      function GraphItem(graph, parent) {
-          this.props = {};
-          this._graph = graph;
-          this.parent = parent;
-      }
-      return GraphItem;
-  }());
-  var Subgraph$1 = /** @class */ (function (_super) {
-      __extends(Subgraph, _super);
-      function Subgraph(graph, parent, _) {
-          var _this = _super.call(this, graph, parent) || this;
-          _this.subgraphs = [];
-          _this.vertices = [];
-          _this.edges = [];
-          if (parent) { //  Only needed for dummy root
-              parent._addSubgraph(_this);
-          }
-          _this._ = _;
-          return _this;
-      }
-      Subgraph.prototype.remove = function (full) {
-          if (full === void 0) { full = true; }
-          this._graph.removeSubgraph(this, full);
-      };
-      Subgraph.prototype.createSubgraph = function (_) {
-          return this._graph.createSubgraph(this, _);
-      };
-      Subgraph.prototype._addSubgraph = function (subgraph) {
-          if (this.subgraphs.indexOf(subgraph) >= 0) {
-              throw new Error("Subgraph already exists");
-          }
-          this.subgraphs.push(subgraph);
-      };
-      Subgraph.prototype._removeSubgraph = function (subgraph) {
-          var idx = this.subgraphs.indexOf(subgraph);
-          if (idx < 0) {
-              throw new Error("Subgraph does not exist");
-          }
-          this.subgraphs.splice(idx, 1);
-      };
-      Subgraph.prototype.removeAllSubgraphs = function () {
-          for (var i = this.subgraphs.length - 1; i >= 0; --i) {
-              this._graph.removeSubgraph(this.subgraphs[i], true);
-          }
-      };
-      Subgraph.prototype.createVertex = function (_) {
-          return this._graph.createVertex(this, _);
-      };
-      Subgraph.prototype._addVertex = function (vertex) {
-          if (this.vertices.indexOf(vertex) >= 0) {
-              throw new Error("Vertex already exists");
-          }
-          this.vertices.push(vertex);
-      };
-      Subgraph.prototype._removeVertex = function (vertex) {
-          var idx = this.vertices.indexOf(vertex);
-          if (idx < 0) {
-              throw new Error("Vertex does not exist");
-          }
-          this.vertices.splice(idx, 1);
-      };
-      Subgraph.prototype.removeAllVertices = function () {
-          for (var i = this.vertices.length - 1; i >= 0; --i) {
-              this._graph.removeVertex(this.vertices[i], true);
-          }
-      };
-      Subgraph.prototype.createEdge = function (source, target, _) {
-          return this._graph.createEdge(this, source, target, _);
-      };
-      Subgraph.prototype._addEdge = function (edge) {
-          if (this.edges.indexOf(edge) >= 0) {
-              throw new Error("Edge already exists");
-          }
-          this.edges.push(edge);
-      };
-      Subgraph.prototype._removeEdge = function (edge) {
-          var idx = this.edges.indexOf(edge);
-          if (idx < 0) {
-              throw new Error("Edge does not exist");
-          }
-          this.edges.splice(idx, 1);
-      };
-      Subgraph.prototype._add = function (item) {
-          if (item instanceof Subgraph) {
-              this._addSubgraph(item);
-          }
-          else if (item instanceof Vertex$1) {
-              this._addVertex(item);
-          }
-          else {
-              this._addEdge(item);
-          }
-      };
-      return Subgraph;
-  }(GraphItem$1));
-  var Vertex$1 = /** @class */ (function (_super) {
-      __extends(Vertex, _super);
-      function Vertex(graph, parent, _) {
-          var _this = _super.call(this, graph, parent) || this;
-          _this.inEdges = [];
-          _this.outEdges = [];
-          parent._addVertex(_this);
-          _this._ = _;
-          return _this;
-      }
-      Object.defineProperty(Vertex.prototype, "edges", {
-          get: function () {
-              return __spreadArray(__spreadArray([], this.inEdges, true), this.outEdges, true);
-          },
-          enumerable: false,
-          configurable: true
-      });
-      Vertex.prototype.remove = function (full, _) {
-          if (full === void 0) { full = true; }
-          return this._graph.removeVertex(this, full, _);
-      };
-      Vertex.prototype.addInEdge = function (edge) {
-          this.inEdges.push(edge);
-      };
-      Vertex.prototype.removeInEdge = function (edge) {
-          var idx = this.inEdges.indexOf(edge);
-          if (idx < 0) {
-              throw new Error("In edge does not exist");
-          }
-          this.inEdges.splice(idx, 1);
-      };
-      Vertex.prototype.addOutEdge = function (edge) {
-          this.outEdges.push(edge);
-      };
-      Vertex.prototype.removeOutEdge = function (edge) {
-          var idx = this.outEdges.indexOf(edge);
-          if (idx < 0) {
-              throw new Error("Out edge does not exist");
-          }
-          this.outEdges.splice(idx, 1);
-      };
-      return Vertex;
-  }(GraphItem$1));
-  var Edge$1 = /** @class */ (function (_super) {
-      __extends(Edge, _super);
-      function Edge(graph, parent, source, target, _) {
-          var _this = _super.call(this, graph, parent) || this;
-          if (!source) {
-              throw new Error("Missing source vertex");
-          }
-          if (!target) {
-              throw new Error("Missing target vertex");
-          }
-          parent._addEdge(_this);
-          _this.source = source;
-          _this.source.addOutEdge(_this);
-          _this.target = target;
-          _this.target.addInEdge(_this);
-          _this._ = _;
-          return _this;
-      }
-      Edge.prototype.remove = function () {
-          this._graph.removeEdge(this);
-      };
-      return Edge;
-  }(GraphItem$1));
-  var Graph = /** @class */ (function () {
-      function Graph(idOf, _) {
-          if (idOf === void 0) { idOf = function (item) { return "" + item._; }; }
-          this._allSubgraphs = [];
-          this._allSubgraphsMap = {};
-          this._allVertices = [];
-          this._allVerticesMap = {};
-          this._allEdges = [];
-          this._allEdgesMap = {};
-          this.root = new Subgraph$1(this, null, _);
-          this.idOf = idOf;
-      }
-      Graph.prototype.createSubgraph = function (parent, _) {
-          var retVal = new Subgraph$1(this, parent || this.root, _);
-          this._allSubgraphs.push(retVal);
-          this._allSubgraphsMap[this.idOf(retVal)] = retVal;
-          return retVal;
-      };
-      Graph.prototype.removeSubgraph = function (subgraph, full) {
-          var _this = this;
-          if (full === void 0) { full = true; }
-          var 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(function (edge) { return full ? _this.removeEdge(edge) : subgraph.parent._addEdge(edge); });
-          subgraph.vertices.forEach(function (vertex) { return full ? _this.removeVertex(vertex, full) : subgraph.parent._addVertex(vertex); });
-          subgraph.subgraphs.forEach(function (childSubgraph) { return full ? _this.removeSubgraph(childSubgraph, full) : subgraph.parent._addSubgraph(childSubgraph); });
-      };
-      Object.defineProperty(Graph.prototype, "subgraphs", {
-          get: function () {
-              return this._allSubgraphs;
-          },
-          enumerable: false,
-          configurable: true
-      });
-      Graph.prototype.subgraph = function (id) {
-          return this._allSubgraphsMap[id];
-      };
-      Graph.prototype.createVertex = function (parent, _) {
-          var retVal = new Vertex$1(this, parent, _);
-          this._allVertices.push(retVal);
-          this._allVerticesMap[this.idOf(retVal)] = retVal;
-          return retVal;
-      };
-      Graph.prototype.removeVertex = function (vertex, full, _) {
-          var _this = this;
-          if (full === void 0) { full = true; }
-          var 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(function (inEdge) {
-                  vertex.outEdges.forEach(function (outEdge) {
-                      _this.createEdge(_this.root, inEdge.source, outEdge.target, _ ? _(inEdge.source._, outEdge.target._) : undefined);
-                  });
-              });
-          }
-          vertex.inEdges.forEach(function (edge) { return _this.removeEdge(edge); });
-          vertex.outEdges.forEach(function (edge) { return _this.removeEdge(edge); });
-      };
-      Object.defineProperty(Graph.prototype, "vertices", {
-          get: function () {
-              return this._allVertices;
-          },
-          enumerable: false,
-          configurable: true
-      });
-      Graph.prototype.vertex = function (id) {
-          return this._allVerticesMap[id];
-      };
-      Graph.prototype.createEdge = function (parent, source, target, _) {
-          var retVal = new Edge$1(this, parent, source, target, _);
-          this._allEdges.push(retVal);
-          this._allEdgesMap[this.idOf(retVal)] = retVal;
-          return retVal;
-      };
-      Graph.prototype.removeEdge = function (edge) {
-          var 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);
-      };
-      Object.defineProperty(Graph.prototype, "edges", {
-          get: function () {
-              return this._allEdges;
-          },
-          enumerable: false,
-          configurable: true
-      });
-      Graph.prototype.edge = function (id) {
-          return this._allEdgesMap[id];
-      };
-      Graph.prototype._walk = function (parent, visitor) {
-          for (var _i = 0, _a = parent.subgraphs; _i < _a.length; _i++) {
-              var subgraph = _a[_i];
-              switch (visitor(subgraph)) {
-                  case "abort":
-                      return true;
-                  case "stepover":
-                      break;
-                  default:
-                      if (this._walk(subgraph, visitor))
-                          return true;
-              }
-          }
-          for (var _b = 0, _c = parent.vertices; _b < _c.length; _b++) {
-              var vertex = _c[_b];
-              if (visitor(vertex) === "abort")
-                  return true;
-          }
-      };
-      Graph.prototype.walk = function (visitor) {
-          this._walk(this.root, visitor);
-          for (var _i = 0, _a = this._allEdges; _i < _a.length; _i++) {
-              var edge = _a[_i];
-              if (visitor(edge) === "abort")
-                  return true;
-          }
-      };
-      Graph.prototype.clone = function () {
-          var ctor = this.constructor;
-          var retVal = new ctor(this.idOf, this.root._);
-          var map = ObjMap();
-          map.put(this.root, retVal.root);
-          this.walk(function (item) {
-              var 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) {
-                  var source = map.get(item.source);
-                  var target = map.get(item.target);
-                  parent.createEdge(source, target, item._);
-              }
-          });
-          return retVal;
-      };
-      return Graph;
-  }());
-  function ObjMap() {
-      var keys = [];
-      var values = [];
-      return {
-          put: function (key, value) {
-              var index = keys.indexOf(key);
-              if (index === -1) {
-                  keys.push(key);
-                  values.push(value);
-              }
-              else {
-                  values[index] = value;
-              }
-          },
-          get: function (key) {
-              return values[keys.indexOf(key)];
-          }
-      };
-  }
-
-  var GraphItem = /** @class */ (function () {
-      function GraphItem(g, _) {
-          this._graph = g;
-          this._ = _;
-      }
-      GraphItem.prototype.id = function () {
-          return this._graph.id(this._);
-      };
-      return GraphItem;
-  }());
-  var ChildGraphItem = /** @class */ (function (_super) {
-      __extends(ChildGraphItem, _super);
-      function ChildGraphItem(g, _) {
-          return _super.call(this, g, _) || this;
-      }
-      ChildGraphItem.prototype.clearParent = function () {
-          if (this._parent) {
-              this._parent.removeChild(this);
-              delete this._parent;
-          }
-          return this;
-      };
-      ChildGraphItem.prototype.parent = function (_) {
-          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;
-      };
-      return ChildGraphItem;
-  }(GraphItem));
-  var Subgraph = /** @class */ (function (_super) {
-      __extends(Subgraph, _super);
-      function Subgraph(g, _) {
-          var _this = _super.call(this, g, _) || this;
-          _this._children = [];
-          return _this;
-      }
-      Subgraph.prototype.children = function () {
-          return this._children;
-      };
-      Subgraph.prototype.addChild = function (_) {
-          this._children.push(_);
-      };
-      Subgraph.prototype.removeChild = function (_) {
-          this._children = this._children.filter(function (row) { return row.id !== _.id; });
-      };
-      return Subgraph;
-  }(ChildGraphItem));
-  var Vertex = /** @class */ (function (_super) {
-      __extends(Vertex, _super);
-      function Vertex(g, _) {
-          var _this = _super.call(this, g, _) || this;
-          _this._inEdges = [];
-          _this._outEdges = [];
-          return _this;
-      }
-      Vertex.prototype.edges = function () {
-          return __spreadArray(__spreadArray([], this._inEdges, true), this._outEdges, true);
-      };
-      Vertex.prototype.edgeCount = function () {
-          return this._outEdges.length + this._inEdges.length;
-      };
-      Vertex.prototype.inEdges = function () {
-          return this._inEdges;
-      };
-      Vertex.prototype.addInEdge = function (e) {
-          this._inEdges.push(e);
-      };
-      Vertex.prototype.removeInEdge = function (id) {
-          this._inEdges = this._inEdges.filter(function (e) { return e._.id !== id; });
-      };
-      Vertex.prototype.outEdges = function () {
-          return this._outEdges;
-      };
-      Vertex.prototype.addOutEdge = function (e) {
-          this._outEdges.push(e);
-      };
-      Vertex.prototype.removeOutEdge = function (id) {
-          this._outEdges = this._outEdges.filter(function (e) { return e._.id !== id; });
-      };
-      return Vertex;
-  }(ChildGraphItem));
-  var Edge = /** @class */ (function (_super) {
-      __extends(Edge, _super);
-      function Edge(g, _, source, target) {
-          var _this = _super.call(this, g, _) || this;
-          _this._source = source;
-          _this._target = target;
-          return _this;
-      }
-      return Edge;
-  }(ChildGraphItem));
-  var Graph2 = /** @class */ (function () {
-      function Graph2(directed) {
-          if (directed === void 0) { directed = true; }
-          this._subgraphMap = {};
-          this._vertexMap = {};
-          this._edgeMap = {};
-          this._idFunc = function (_) { return typeof _.id === "function" ? _.id() : _.id; };
-          this._sourceFunc = function (_) { return typeof _.source === "function" ? _.source() : _.source; };
-          this._targetFunc = function (_) { return typeof _.target === "function" ? _.target() : _.target; };
-          this._updateFunc = function (before, after) { return after; };
-          this._directed = directed;
-      }
-      Graph2.prototype.clear = function () {
-          this._subgraphMap = {};
-          this._vertexMap = {};
-          this._edgeMap = {};
-          return this;
-      };
-      Graph2.prototype.clearParents = function () {
-          for (var key in this._subgraphMap) {
-              this._subgraphMap[key].clearParent();
-          }
-          for (var key in this._vertexMap) {
-              this._vertexMap[key].clearParent();
-          }
-          return this;
-      };
-      Graph2.prototype.isDirected = function () {
-          return this._directed;
-      };
-      Graph2.prototype.idFunc = function (_) {
-          this._idFunc = _;
-          return this;
-      };
-      Graph2.prototype.sourceFunc = function (_) {
-          this._sourceFunc = _;
-          return this;
-      };
-      Graph2.prototype.targetFunc = function (_) {
-          this._targetFunc = _;
-          return this;
-      };
-      Graph2.prototype.updateFunc = function (_) {
-          this._updateFunc = _;
-          return this;
-      };
-      Graph2.prototype.id = function (_) {
-          return this._idFunc(_);
-      };
-      Graph2.prototype.type = function (id) {
-          if (this.subgraphExists(id))
-              return "S";
-          if (this.vertexExists(id))
-              return "V";
-          if (this.edgeExists(id))
-              return "E";
-          return "";
-      };
-      Graph2.prototype.isSubgraph = function (_) {
-          return this.subgraphExists(this.id(_));
-      };
-      Graph2.prototype.isVertex = function (_) {
-          return this.vertexExists(this.id(_));
-      };
-      Graph2.prototype.isEdge = function (_) {
-          return this.edgeExists(this.id(_));
-      };
-      Graph2.prototype.allItems = function () {
-          return __spreadArray(__spreadArray(__spreadArray([], this.allSubgraphs(), true), this.allVertices(), true), this.allEdges(), true);
-      };
-      Graph2.prototype.item = function (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 undefined;
-      };
-      Graph2.prototype.itemExists = function (id) {
-          return this.edgeExists(id) || this.vertexExists(id) || this.subgraphExists(id);
-      };
-      // Subgraphs  ---
-      Graph2.prototype.allSubgraphs = function () {
-          var retVal = [];
-          for (var key in this._subgraphMap) {
-              retVal.push(this._subgraphMap[key]._);
-          }
-          return retVal;
-      };
-      Graph2.prototype.subgraphs = function () {
-          var retVal = [];
-          for (var key in this._subgraphMap) {
-              if (this._subgraphMap[key].parent() === undefined) {
-                  retVal.push(this._subgraphMap[key]._);
-              }
-          }
-          return retVal;
-      };
-      Graph2.prototype.subgraphExists = function (id) {
-          return !!this._subgraphMap[id];
-      };
-      Graph2.prototype.subgraph = function (id) {
-          return this._subgraphMap[id]._;
-      };
-      Graph2.prototype.subgraphSubgraphs = function (id) {
-          var _this = this;
-          return this._subgraphMap[id].children().filter(function (child) { return _this.isSubgraph(child._); }).map(function (child) { return child._; });
-      };
-      Graph2.prototype.subgraphVertices = function (id) {
-          var _this = this;
-          return this._subgraphMap[id].children().filter(function (child) { return _this.isVertex(child._); }).map(function (child) { return child._; });
-      };
-      Graph2.prototype.subgraphEdges = function (id) {
-          var _this = this;
-          return this._subgraphMap[id].children().filter(function (child) { return _this.isEdge(child._); }).map(function (child) { return child._; });
-      };
-      Graph2.prototype.addSubgraph = function (s, parent) {
-          var s_id = this._idFunc(s);
-          if (this._subgraphMap[s_id])
-              throw new Error("Subgraph '".concat(s_id, "' already exists."));
-          var subgraph = new Subgraph(this, s);
-          if (parent) {
-              var p_id = this._idFunc(parent);
-              if (!this._subgraphMap[p_id])
-                  throw new Error("Subgraph '".concat(p_id, "' does not exist."));
-              subgraph.parent(this._subgraphMap[p_id]);
-          }
-          this._subgraphMap[s_id] = subgraph;
-          return this;
-      };
-      Graph2.prototype.mergeSubgraphs = function (_subgraphs) {
-          var _this = this;
-          if (_subgraphs === void 0) { _subgraphs = []; }
-          var sgDiff = compare2(this.allSubgraphs(), _subgraphs, function (sg) { return _this._idFunc(sg); }, this._updateFunc);
-          sgDiff.exit.forEach(function (sg) { return _this.removeSubgraph(_this._idFunc(sg)); });
-          sgDiff.enter.forEach(function (sg) { return _this.addSubgraph(sg); });
-          sgDiff.update.forEach(function (sg) { return _this.updateSubgraph(sg); });
-          return this;
-      };
-      Graph2.prototype.updateSubgraph = function (sg) {
-          var sg_id = this._idFunc(sg);
-          var subgraph = this._subgraphMap[sg_id];
-          if (!subgraph)
-              throw new Error("Subgraph '".concat(sg_id, "' does not exist."));
-          subgraph._ = sg;
-          return this;
-      };
-      Graph2.prototype.removeSubgraph = function (id, promoteChildren) {
-          var _this = this;
-          if (promoteChildren === void 0) { promoteChildren = true; }
-          var sg = this._subgraphMap[id];
-          if (!sg)
-              throw new Error("Subgraph '".concat(id, "' does not exist."));
-          sg.children().forEach(function (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;
-      };
-      Graph2.prototype.subgraphParent = function (id, parentID) {
-          var item = this._subgraphMap[id];
-          if (!item)
-              throw new Error("Subgraph '".concat(id, "' does not exist."));
-          if (parentID === void 0) {
-              var parent_1 = item.parent();
-              return parent_1 ? parent_1._ : undefined;
-          }
-          var parent = this._subgraphMap[parentID];
-          if (!parent)
-              throw new Error("Vertex parent '".concat(parent, "' does not exist."));
-          item.parent(parent);
-          return this;
-      };
-      // Vertices  ---
-      Graph2.prototype.allVertices = function () {
-          var retVal = [];
-          for (var key in this._vertexMap) {
-              retVal.push(this._vertexMap[key]._);
-          }
-          return retVal;
-      };
-      Graph2.prototype.vertices = function () {
-          var retVal = [];
-          for (var key in this._vertexMap) {
-              if (this._vertexMap[key].parent() === undefined) {
-                  retVal.push(this._vertexMap[key]._);
-              }
-          }
-          return retVal;
-      };
-      Graph2.prototype.vertexExists = function (id) {
-          return !!this._vertexMap[id];
-      };
-      Graph2.prototype.vertex = function (id) {
-          return this._vertexMap[id]._;
-      };
-      Graph2.prototype.allEdges = function () {
-          var retVal = [];
-          for (var key in this._edgeMap) {
-              retVal.push(this._edgeMap[key]._);
-          }
-          return retVal;
-      };
-      Graph2.prototype.edges = function () {
-          var retVal = [];
-          for (var key in this._edgeMap) {
-              if (this._edgeMap[key].parent() === undefined) {
-                  retVal.push(this._edgeMap[key]._);
-              }
-          }
-          return retVal;
-      };
-      Graph2.prototype.vertexEdges = function (vertexID) {
-          return this._vertexMap[vertexID].edges().map(function (e) { return e._; });
-      };
-      Graph2.prototype.inEdges = function (vertexID) {
-          return this._vertexMap[vertexID].inEdges().map(function (e) { return e._; });
-      };
-      Graph2.prototype.outEdges = function (vertexID) {
-          return this._vertexMap[vertexID].outEdges().map(function (e) { return e._; });
-      };
-      Graph2.prototype._neighbors = function (id) {
-          return __spreadArray(__spreadArray([], this._vertexMap[id].outEdges().map(function (e) { return e._target; }), true), this._vertexMap[id].inEdges().map(function (e) { return e._source; }), true);
-      };
-      Graph2.prototype.neighbors = function (id) {
-          return this._neighbors(id).map(function (n) { return n._; });
-      };
-      Graph2.prototype.singleNeighbors = function (id) {
-          return this._neighbors(id).filter(function (n) { return n.edgeCount() === 1; }).map(function (n) { return n._; });
-      };
-      Graph2.prototype.addVertex = function (v, parent) {
-          var v_id = this._idFunc(v);
-          if (this._vertexMap[v_id])
-              throw new Error("Vertex '".concat(v_id, "' already exists."));
-          var vertex = new Vertex(this, v);
-          if (parent) {
-              var p_id = this._idFunc(parent);
-              if (!this.subgraphExists(p_id))
-                  throw new Error("Subgraph '".concat(p_id, "' does not exist."));
-              vertex.parent(this._subgraphMap[p_id]);
-          }
-          this._vertexMap[v_id] = vertex;
-          return this;
-      };
-      Graph2.prototype.mergeVertices = function (_vertices) {
-          var _this = this;
-          var vDiff = compare2(this.allVertices(), _vertices, function (v) { return _this._idFunc(v); }, this._updateFunc);
-          vDiff.exit.forEach(function (v) { return _this.removeVertex(_this._idFunc(v)); });
-          vDiff.enter.forEach(function (v) { return _this.addVertex(v); });
-          vDiff.update.forEach(function (v) { return _this.updateVertex(v); });
-          return this;
-      };
-      Graph2.prototype.updateVertex = function (v) {
-          var v_id = this._idFunc(v);
-          var vertex = this._vertexMap[v_id];
-          if (!vertex)
-              throw new Error("Vertex '".concat(v_id, "' does not exist."));
-          vertex._ = v;
-          return this;
-      };
-      Graph2.prototype.removeVertex = function (id) {
-          var _this = this;
-          var v = this._vertexMap[id];
-          if (!v)
-              throw new Error("Vertex '".concat(id, "' does not exist."));
-          v.edges().forEach(function (e) {
-              _this.removeEdge(e.id());
-          });
-          delete this._vertexMap[id];
-          return this;
-      };
-      Graph2.prototype.vertexParent = function (id, parentID) {
-          var item = this._vertexMap[id];
-          if (!item)
-              throw new Error("Vertex '".concat(id, "' does not exist."));
-          if (parentID === void 0) {
-              var parent_2 = item.parent();
-              return parent_2 ? parent_2._ : undefined;
-          }
-          var parent = this._subgraphMap[parentID];
-          if (!parent)
-              throw new Error("Vertex parent '".concat(parent, "' does not exist."));
-          item.parent(parent);
-          return this;
-      };
-      // Edges  ---
-      Graph2.prototype.edgeExists = function (id) {
-          return !!this._edgeMap[id];
-      };
-      Graph2.prototype.edge = function (id) {
-          return this._edgeMap[id]._;
-      };
-      Graph2.prototype.addEdge = function (e, parent) {
-          var e_id = this._idFunc(e);
-          var e_source = this._sourceFunc(e);
-          var e_target = this._targetFunc(e);
-          if (this._edgeMap[e_id])
-              throw new Error("Edge '".concat(e_id, "' already exists."));
-          if (!this.vertexExists(e_source))
-              throw new Error("Edge Source '".concat(e_source, "' does not exist."));
-          if (!this.vertexExists(e_target))
-              throw new Error("Edge Target '".concat(e_target, "' does not exist."));
-          var edge = new Edge(this, e, this._vertexMap[e_source], this._vertexMap[e_target]);
-          if (parent) {
-              var p_id = this._idFunc(parent);
-              if (!this.subgraphExists(p_id))
-                  throw new Error("Subgraph '".concat(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;
-      };
-      Graph2.prototype.mergeEdges = function (_edges) {
-          var _this = this;
-          var eDiff = compare2(this.allEdges(), _edges, function (e) { return _this._idFunc(e); }, this._updateFunc);
-          eDiff.exit.forEach(function (e) { return _this.removeEdge(_this._idFunc(e)); });
-          eDiff.enter.forEach(function (e) { return _this.addEdge(e); });
-          eDiff.update.forEach(function (e) { return _this.updateEdge(e); });
-          return this;
-      };
-      Graph2.prototype.updateEdge = function (e) {
-          var _a, _b, _c, _d;
-          var e_id = this._idFunc(e);
-          var edge = this._edgeMap[e_id];
-          if (!edge)
-              throw new Error("Edge '".concat(e_id, "' does not exist."));
-          var old_source = edge._source.id();
-          var new_source = this._sourceFunc(e);
-          if (old_source !== new_source) {
-              (_a = this._vertexMap[old_source]) === null || _a === void 0 ? void 0 : _a.removeOutEdge(e_id);
-              (_b = this._vertexMap[new_source]) === null || _b === void 0 ? void 0 : _b.addOutEdge(edge);
-          }
-          var old_target = edge._target.id();
-          var new_target = this._targetFunc(e);
-          if (old_target !== new_target) {
-              (_c = this._vertexMap[old_target]) === null || _c === void 0 ? void 0 : _c.removeInEdge(e_id);
-              (_d = this._vertexMap[new_target]) === null || _d === void 0 ? void 0 : _d.addInEdge(edge);
-          }
-          edge._ = e;
-          edge._source = this._vertexMap[new_source];
-          edge._target = this._vertexMap[new_target];
-          return this;
-      };
-      Graph2.prototype.removeEdge = function (id) {
-          var e = this._edgeMap[id];
-          if (!e)
-              throw new Error("Edge '".concat(id, "' does not exist."));
-          var e_sourceID = this._idFunc(e._source._);
-          if (!this.vertexExists(e_sourceID))
-              throw new Error("Edge Source'".concat(e_sourceID, "' does not exist."));
-          this._vertexMap[e_sourceID].removeOutEdge(id);
-          var e_targetID = this._idFunc(e._target._);
-          if (!this.vertexExists(e_targetID))
-              throw new Error("Edge Target'".concat(e_targetID, "' does not exist."));
-          this._vertexMap[e_targetID].removeInEdge(id);
-          delete this._edgeMap[id];
-          return this;
-      };
-      Graph2.prototype._hwalk = function (item, formatter) {
-          var _this = this;
-          if (item instanceof Subgraph) {
-              return formatter("subgraph", item._, item.children().map(function (child) { return _this._hwalk(child, formatter); }));
-          }
-          else {
-              return formatter("vertex", item._);
-          }
-      };
-      Graph2.prototype.hierarchy = function (formatter) {
-          var retVal = [];
-          for (var id in this._subgraphMap) {
-              var sg = this._subgraphMap[id];
-              if (sg.parent() === undefined) {
-                  retVal.push(this._hwalk(sg, formatter));
-              }
-          }
-          for (var id in this._vertexMap) {
-              var v = this._vertexMap[id];
-              if (v.parent() === undefined) {
-                  retVal.push(this._hwalk(v, formatter));
-              }
-          }
-          return retVal;
-      };
-      Graph2.prototype.dijkstra = function (source, target) {
-          var edges = this.allEdges();
-          var Q = new Set();
-          var prev = {};
-          var dist = {};
-          var adj = {};
-          function vertex_with_min_dist(Q, dist) {
-              var min_distance = Infinity;
-              var u = null;
-              Q.forEach(function (v) {
-                  if (dist[v] < min_distance) {
-                      min_distance = dist[v];
-                      u = v;
-                  }
-              });
-              return u;
-          }
-          for (var i = 0; i < edges.length; i++) {
-              var v1 = this._sourceFunc(edges[i]);
-              var v2 = this._targetFunc(edges[i]);
-              var len_1 = 1;
-              Q.add(v1);
-              Q.add(v2);
-              dist[v1] = Infinity;
-              dist[v2] = Infinity;
-              if (adj[v1] === undefined)
-                  adj[v1] = {};
-              if (adj[v2] === undefined)
-                  adj[v2] = {};
-              adj[v1][v2] = len_1;
-              adj[v2][v1] = len_1;
-          }
-          dist[source] = 0;
-          while (Q.size) {
-              var u_1 = vertex_with_min_dist(Q, dist);
-              if (u_1 === null)
-                  break;
-              var neighbors = Object.keys(adj[u_1]).filter(function (v) { return Q.has(v); }); // Neighbor still in Q
-              Q.delete(u_1);
-              if (u_1 === target)
-                  break; // Break when the target has been found
-              for (var _i = 0, neighbors_1 = neighbors; _i < neighbors_1.length; _i++) {
-                  var v = neighbors_1[_i];
-                  var alt = dist[u_1] + adj[u_1][v];
-                  if (alt < dist[v]) {
-                      dist[v] = alt;
-                      prev[v] = u_1;
-                  }
-              }
-          }
-          var u = target;
-          var ids = [u];
-          var len = 0;
-          while (prev[u] !== undefined) {
-              ids.unshift(prev[u]);
-              len += adj[u][prev[u]];
-              u = prev[u];
-          }
-          return { ids: ids, len: len };
-      };
-      Graph2.prototype.sort = function (v_id) {
-          var retVal = [];
-          var visited = {};
-          var visit = function (vertex, ancestors) {
-              if (ancestors === void 0) { ancestors = []; }
-              var v_id = vertex.id();
-              if (visited[v_id])
-                  return;
-              visited[v_id] = true;
-              ancestors.push(vertex);
-              vertex.outEdges().forEach(function (e) {
-                  if (ancestors.indexOf(e._target) < 0) {
-                      visit(e._target, __spreadArray([], ancestors, true));
-                  }
-              });
-              retVal.unshift(vertex._);
-          };
-          if (v_id) {
-              visit(this._vertexMap[v_id]);
-          }
-          else {
-              for (var key in this._vertexMap) {
-                  visit(this._vertexMap[key]);
-              }
-          }
-          return retVal;
-      };
-      return Graph2;
-  }());
-  var Set = /** @class */ (function () {
-      function Set() {
-          this._content = [];
-      }
-      Object.defineProperty(Set.prototype, "size", {
-          get: function () {
-              return this._content.length;
-          },
-          enumerable: false,
-          configurable: true
-      });
-      Set.prototype.has = function (_) {
-          return this._content.indexOf(_) >= 0;
-      };
-      Set.prototype.add = function (_) {
-          if (!this.has(_)) {
-              this._content.push(_);
-          }
-      };
-      Set.prototype.delete = function (_) {
-          var idx = this._content.indexOf(_);
-          if (idx >= 0) {
-              this._content.splice(idx, 1);
-          }
-      };
-      Set.prototype.forEach = function (_) {
-          this._content.forEach(_);
-      };
-      return Set;
-  }());
-
-  var isArray$1 = Array.isArray;
-  var keyList = Object.keys;
-  var hasProp = Object.prototype.hasOwnProperty;
-  function verboseDeepEquals(a, b, functionRefCompare) {
-      if (functionRefCompare === void 0) { functionRefCompare = false; }
-      if (a === b)
-          return true;
-      if (a && b) {
-          if (typeof a === "object" && typeof b === "object") {
-              var arrA = isArray$1(a);
-              var arrB = isArray$1(b);
-              var i = void 0;
-              var length_1;
-              var key = void 0;
-              if (arrA && arrB) {
-                  length_1 = a.length;
-                  if (length_1 !== b.length) {
-                      console.warn("lengths not equal: ".concat(length_1, " !== ").concat(b.length));
-                      return false;
-                  }
-                  for (i = length_1; i-- !== 0;)
-                      if (!verboseDeepEquals(a[i], b[i], functionRefCompare)) {
-                          return false;
-                      }
-                  return true;
-              }
-              if (arrA !== arrB) {
-                  console.warn("arrays not equal: ".concat(arrA, " !== ").concat(arrB));
-                  return false;
-              }
-              var dateA = a instanceof Date;
-              var dateB = b instanceof Date;
-              if (dateA !== dateB) {
-                  console.warn("dates not equal: ".concat(dateA, " !== ").concat(dateB));
-                  return false;
-              }
-              if (dateA && dateB) {
-                  var retVal_1 = a.getTime() === b.getTime();
-                  if (!retVal_1) {
-                      console.warn("dates not equal: ".concat(a.getTime(), " !== ").concat(b.getTime()));
-                  }
-                  return retVal_1;
-              }
-              var regexpA = a instanceof RegExp;
-              var regexpB = b instanceof RegExp;
-              if (regexpA !== regexpB) {
-                  console.warn("regexps not equal: ".concat(regexpA, " !== ").concat(regexpB));
-                  return false;
-              }
-              if (regexpA && regexpB) {
-                  var retVal_2 = a.toString() === b.toString();
-                  if (!retVal_2) {
-                      console.warn("regexps not equal: ".concat(a.toString(), " !== ").concat(b.toString()));
-                  }
-                  return retVal_2;
-              }
-              var keys = keyList(a);
-              length_1 = keys.length;
-              if (length_1 !== keyList(b).length) {
-                  console.warn("key lengths not equal: ".concat(length_1, " !== ").concat(keyList(b).length));
-                  return false;
-              }
-              for (i = length_1; i-- !== 0;)
-                  if (!hasProp.call(b, keys[i])) {
-                      console.warn("".concat(keys[i], " in a but not b"));
-                      return false;
-                  }
-              for (i = length_1; 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") {
-              var retVal_3 = a.toString() === b.toString();
-              if (!retVal_3) {
-                  console.warn("functions not equal: ".concat(a.toString(), " !== ").concat(b.toString()));
-              }
-              return retVal_3;
-          }
-      }
-      var retVal = a !== a && b !== b;
-      if (!retVal) {
-          console.warn("values not equal: ".concat(a, " !== ").concat(b));
-      }
-      return retVal;
-  }
-  function deepEquals(a, b, functionRefCompare) {
-      if (functionRefCompare === void 0) { functionRefCompare = false; }
-      if (a === b)
-          return true;
-      if (a && b) {
-          if (typeof a === "object" && typeof b === "object") {
-              var arrA = isArray$1(a);
-              var arrB = isArray$1(b);
-              var i = void 0;
-              var length_2;
-              var key = void 0;
-              if (arrA && arrB) {
-                  length_2 = a.length;
-                  if (length_2 !== b.length)
-                      return false;
-                  for (i = length_2; i-- !== 0;)
-                      if (!deepEquals(a[i], b[i], functionRefCompare))
-                          return false;
-                  return true;
-              }
-              if (arrA !== arrB)
-                  return false;
-              var dateA = a instanceof Date;
-              var dateB = b instanceof Date;
-              if (dateA !== dateB)
-                  return false;
-              if (dateA && dateB)
-                  return a.getTime() === b.getTime();
-              var regexpA = a instanceof RegExp;
-              var regexpB = b instanceof RegExp;
-              if (regexpA !== regexpB)
-                  return false;
-              if (regexpA && regexpB)
-                  return a.toString() === b.toString();
-              var keys = keyList(a);
-              length_2 = keys.length;
-              if (length_2 !== keyList(b).length)
-                  return false;
-              for (i = length_2; i-- !== 0;)
-                  if (!hasProp.call(b, keys[i]))
-                      return false;
-              for (i = length_2; 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;
-  }
-  function update(origItem, newItem, functionRefCompare) {
-      if (functionRefCompare === void 0) { functionRefCompare = false; }
-      return deepEquals(origItem, newItem, functionRefCompare) ? origItem : newItem;
-  }
-
-  var root = typeof globalThis !== "undefined" ? globalThis : window;
-  var isBrowser = typeof window !== "undefined" && root === window;
-  var isNode = typeof process !== "undefined" && process.versions != null && process.versions.node != null;
-  var isCI = isNode && process.env != null && (process.env.TRAVIS != null || process.env.GITHUB_ACTIONS != null);
-  function getScriptSrc(partial) {
-      var scripts = document.scripts || [];
-      for (var i = document.scripts.length - 1; i >= 0; --i) {
-          var script = scripts[i];
-          if (script.src) {
-              var idx = script.src.indexOf(partial);
-              if (idx >= 0) {
-                  return script.src.substring(0, idx);
-              }
-          }
-      }
-      return "";
-  }
-
-  /**
-   * A generic Stack
-   */
-  var Stack = /** @class */ (function () {
-      function Stack() {
-          this.stack = [];
-      }
-      /**
-       * Push element onto the stack
-       *
-       * @param e - element to push
-       */
-      Stack.prototype.push = function (e) {
-          this.stack.push(e);
-          return e;
-      };
-      /**
-       * Pop element off the stack
-       */
-      Stack.prototype.pop = function () {
-          return this.stack.pop();
-      };
-      /**
-       * Top item on the stack
-       *
-       * @returns Top element on the stack
-       */
-      Stack.prototype.top = function () {
-          return this.stack.length ? this.stack[this.stack.length - 1] : undefined;
-      };
-      /**
-       * Depth of stack
-       *
-       * @returns Depth
-       */
-      Stack.prototype.depth = function () {
-          return this.stack.length;
-      };
-      return Stack;
-  }());
-
-  /* eslint-disable no-console */
-  exports.Level = void 0;
-  (function (Level) {
-      Level[Level["debug"] = 0] = "debug";
-      Level[Level["info"] = 1] = "info";
-      Level[Level["notice"] = 2] = "notice";
-      Level[Level["warning"] = 3] = "warning";
-      Level[Level["error"] = 4] = "error";
-      Level[Level["critical"] = 5] = "critical";
-      Level[Level["alert"] = 6] = "alert";
-      Level[Level["emergency"] = 7] = "emergency";
-  })(exports.Level || (exports.Level = {}));
-  var colours = {
-      debug: "cyan",
-      info: "green",
-      notice: "grey",
-      warning: "blue",
-      error: "red",
-      critical: "magenta",
-      alert: "magenta",
-      emergency: "magenta"
-  };
-  var ConsoleWriter = /** @class */ (function () {
-      function ConsoleWriter() {
-      }
-      ConsoleWriter.prototype.write = function (dateTime, level, id, msg) {
-          if (isNode) {
-              console.log("[".concat(dateTime, "] ").concat(exports.Level[level].toUpperCase(), " ").concat(id, ":  ").concat(msg));
-          }
-          else {
-              console.log("[".concat(dateTime, "] %c").concat(exports.Level[level].toUpperCase(), "%c ").concat(id, ":  ").concat(msg), "color:".concat(colours[exports.Level[level]]), "");
-          }
-      };
-      return ConsoleWriter;
-  }());
-  var Logging = /** @class */ (function () {
-      function Logging() {
-          this._levelStack = new Stack();
-          this._level = exports.Level.info;
-          this._filter = "";
-          this._writer = new ConsoleWriter();
-      }
-      Logging.Instance = function () {
-          return this._instance || (this._instance = new this());
-      };
-      Logging.prototype.stringify = function (obj) {
-          var 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);
-      };
-      Logging.prototype.writer = function (_) {
-          if (_ === void 0)
-              return this._writer;
-          this._writer = _;
-          return this;
-      };
-      Logging.prototype.log = function (level, id, msg) {
-          if (level < this._level)
-              return;
-          if (this._filter && this._filter !== id)
-              return;
-          var dateTime = 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);
-              }
-          }
-      };
-      Logging.prototype.debug = function (id, msg) {
-          this.log(exports.Level.debug, id, msg);
-      };
-      Logging.prototype.info = function (id, msg) {
-          this.log(exports.Level.info, id, msg);
-      };
-      Logging.prototype.notice = function (id, msg) {
-          this.log(exports.Level.notice, id, msg);
-      };
-      Logging.prototype.warning = function (id, msg) {
-          this.log(exports.Level.warning, id, msg);
-      };
-      Logging.prototype.error = function (id, msg) {
-          this.log(exports.Level.error, id, msg);
-      };
-      Logging.prototype.critical = function (id, msg) {
-          this.log(exports.Level.critical, id, msg);
-      };
-      Logging.prototype.alert = function (id, msg) {
-          this.log(exports.Level.alert, id, msg);
-      };
-      Logging.prototype.emergency = function (id, msg) {
-          this.log(exports.Level.emergency, id, msg);
-      };
-      Logging.prototype.level = function (_) {
-          if (_ === void 0)
-              return this._level;
-          this._level = _;
-          return this;
-      };
-      Logging.prototype.pushLevel = function (_) {
-          this._levelStack.push(this._level);
-          this._level = _;
-          return this;
-      };
-      Logging.prototype.popLevel = function () {
-          this._level = this._levelStack.pop();
-          return this;
-      };
-      Logging.prototype.filter = function (_) {
-          if (_ === void 0)
-              return this._filter;
-          this._filter = _;
-          return this;
-      };
-      return Logging;
-  }());
-  var logger = Logging.Instance();
-  var ScopedLogging = /** @class */ (function () {
-      function ScopedLogging(scopeID) {
-          this._scopeID = scopeID;
-      }
-      ScopedLogging.prototype.debug = function (msg) {
-          logger.debug(this._scopeID, msg);
-      };
-      ScopedLogging.prototype.info = function (msg) {
-          logger.info(this._scopeID, msg);
-      };
-      ScopedLogging.prototype.notice = function (msg) {
-          logger.notice(this._scopeID, msg);
-      };
-      ScopedLogging.prototype.warning = function (msg) {
-          logger.warning(this._scopeID, msg);
-      };
-      ScopedLogging.prototype.error = function (msg) {
-          logger.error(this._scopeID, msg);
-      };
-      ScopedLogging.prototype.critical = function (msg) {
-          logger.critical(this._scopeID, msg);
-      };
-      ScopedLogging.prototype.alert = function (msg) {
-          logger.alert(this._scopeID, msg);
-      };
-      ScopedLogging.prototype.emergency = function (msg) {
-          logger.emergency(this._scopeID, msg);
-      };
-      ScopedLogging.prototype.pushLevel = function (_) {
-          logger.pushLevel(_);
-          return this;
-      };
-      ScopedLogging.prototype.popLevel = function () {
-          logger.popLevel();
-          return this;
-      };
-      return ScopedLogging;
-  }());
-  function scopedLogger(scopeID, filter) {
-      if (filter === void 0) { filter = false; }
-      if (filter) {
-          logger.filter(scopeID);
-      }
-      return new ScopedLogging(scopeID);
-  }
-
-  /**
-   * degreesToRadians - converts degrees to radians
-   * Usage: degreesToRadians(1080);
-   *
-   * @param degrees
-   * @returns Number radians
-   */
-  function degreesToRadians(degrees) {
-      return degrees * (Math.PI / 180);
-  }
-  /**
-   * radiansToDegrees - converts radians to degrees
-   * Usage: radiansToDegrees(7);
-   *
-   * @param radians
-   * @returns Number degreees
-   */
-  function radiansToDegrees(radians) {
-      return radians * (180 / Math.PI);
-  }
-  /**
-   * polarToCartesian - converts (r, theta) to {x, y}
-   * Usage: polarToCartesian(5, Math.PI);
-   *
-   * @param r radius
-   * @param theta angle in radians
-   * @returns { x: number, y: number }
-   */
-  function polarToCartesian(r, theta) {
-      return {
-          x: r * Math.cos(theta),
-          y: r * Math.sin(theta)
-      };
-  }
-  /**
-   * cartesianToPolar - converts (x, y) to {r, theta}
-   * Usage: cartesianToPolar(100, 200);
-   *
-   * @param x
-   * @param y
-   * @returns { r: number, theta: number }
-   */
-  function cartesianToPolar(x, y) {
-      return {
-          r: Math.sqrt(x * x + y * y),
-          theta: Math.atan2(y, x)
-      };
-  }
-  /**
-   * normalizeRadians - normalizes a radian value to within the provided range
-   * Usage: normalizeRadians(7);
-   *
-   * @param radians value to be normalized
-   * @param min lower limit
-   * @param max upper limit
-   * @returns Number normalized to within the provided range
-   */
-  function normalizeRadians(radians, min, max) {
-      if (min === void 0) { min = -Math.PI; }
-      if (max === void 0) { max = Math.PI; }
-      return normalize(radians, min, max);
-  }
-  /**
-   * normalizeDegrees - normalizes a degree value to within the provided range
-   * Usage: normalizeDegrees(1080);
-   *
-   * @param degrees value to be normalized
-   * @param min lower limit
-   * @param max upper limit
-   * @returns Number normalized to within the provided range
-   */
-  function normalizeDegrees(degrees, min, max) {
-      if (min === void 0) { min = -180; }
-      if (max === void 0) { max = 180; }
-      return normalize(degrees, min, max);
-  }
-  /**
-   * normalize - normalizes a value to within the provided range
-   * Usage: normalize(1000, 0, 365);
-   *
-   * @param value value to be normalized
-   * @param min lower limit
-   * @param max upper limit
-   * @returns Number normalized to within the provided range
-   */
-  function normalize(value, min, max) {
-      var spread = max - min;
-      var offsetValue = value - min;
-      return (offsetValue - (Math.floor(offsetValue / spread) * spread)) + min;
-  }
-
-  /**
-   * inner - return inner property of Object
-   * Usage:  inner("some.prop.to.locate", obj);
-   *
-   * @param prop - property to locate
-   * @param obj - object to locate property in
-   */
-  function inner(prop, obj) {
-      if (prop === void 0 || obj === void 0)
-          return void 0;
-      for (var _i = 0, _a = prop.split("."); _i < _a.length; _i++) {
-          var item = _a[_i];
-          if (!obj.hasOwnProperty(item)) {
-              return undefined;
-          }
-          obj = obj[item];
-      }
-      return obj;
-  }
-  /**
-   * exists - return true if inner property of Object exists
-   * Usage:  exists("some.prop.to.locate", obj);
-   *
-   * @param prop - property to locate
-   * @param obj - object to locate property in
-   */
-  function exists(prop, obj) {
-      return inner(prop, obj) !== undefined;
-  }
-  function _mixin(dest, source) {
-      var empty = {};
-      for (var key in source) {
-          if (!source.hasOwnProperty(key))
-              continue;
-          if (key === "__proto__" || key === "constructor")
-              continue;
-          var 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;
-  }
-  /**
-   * deepMixin - combine several objects from right to left
-   * Usage:  deepMixin({a: "a"}, {b: "b"});
-   *
-   * @param dest - target object to mix into.
-   * @param sources - objects to mix in
-   */
-  function deepMixin(dest) {
-      if (dest === void 0) { dest = {}; }
-      var sources = [];
-      for (var _i = 1; _i < arguments.length; _i++) {
-          sources[_i - 1] = arguments[_i];
-      }
-      if (typeof dest !== "object")
-          throw new Error("Destination \"".concat(dest, "\" must be an object."));
-      for (var _a = 0, sources_1 = sources; _a < sources_1.length; _a++) {
-          var source = sources_1[_a];
-          _mixin(dest, source);
-      }
-      return dest;
-  }
-  /**
-   * deepMixinT - combine several objects of Partial<T> from right to left
-   * Usage:  deepMixinT<MyInterface>({a: "a"}, {b: "b"});
-   *
-   * Note:  Only provided as a convenience, so user gets auto completion based on destination type.
-   *
-   * @param dest - target object to mix into.
-   * @param sources - objects to mix in
-   */
-  function deepMixinT(dest) {
-      if (dest === void 0) { dest = {}; }
-      var sources = [];
-      for (var _i = 1; _i < arguments.length; _i++) {
-          sources[_i - 1] = arguments[_i];
-      }
-      return deepMixin.apply(void 0, __spreadArray([dest], sources, false));
-  }
-  /**
-   * safeStingify - JSONsimilar to .stringify, except ignores circular references.
-   * Usage:  safeStingify(object);
-   *
-   * @param obj - any object.
-   */
-  function safeStringify(obj) {
-      var cache = [];
-      return JSON.stringify(obj, function (key, value) {
-          if (typeof value === "object" && value !== null) {
-              if (cache.indexOf(value) !== -1) {
-                  return;
-              }
-              cache.push(value);
-          }
-          return value;
-      });
-  }
-  function isArray(arg) {
-      if (Array.isArray !== undefined) {
-          return Array.isArray(arg);
-      }
-      return Object.prototype.toString.call(arg) === "[object Array]";
-  }
-  function classID2Meta(classID) {
-      var info = classID.split("_");
-      var classInfo = info[1].split(".");
-      return {
-          module: "@hpcc-js/".concat(info[0]),
-          file: classInfo[0],
-          class: classInfo[1] || classInfo[0]
-      };
-  }
-
-  var ObserverHandle = /** @class */ (function () {
-      function ObserverHandle(eventTarget, eventID, callback) {
-          this.eventTarget = eventTarget;
-          this.eventID = eventID;
-          this.callback = callback;
-      }
-      ObserverHandle.prototype.release = function () {
-          this.eventTarget.removeObserver(this.eventID, this.callback);
-      };
-      ObserverHandle.prototype.unwatch = function () {
-          this.release();
-      };
-      return ObserverHandle;
-  }());
-  var Observable = /** @class */ (function () {
-      function Observable() {
-          this._eventObservers = {};
-      }
-      Observable.prototype.addObserver = function (eventID, callback) {
-          var eventObservers = this._eventObservers[eventID];
-          if (!eventObservers) {
-              eventObservers = [];
-              this._eventObservers[eventID] = eventObservers;
-          }
-          eventObservers.push(callback);
-          return new ObserverHandle(this, eventID, callback);
-      };
-      Observable.prototype.removeObserver = function (eventID, callback) {
-          var eventObservers = this._eventObservers[eventID];
-          if (eventObservers) {
-              for (var i = eventObservers.length - 1; i >= 0; --i) {
-                  if (eventObservers[i] === callback) {
-                      eventObservers.splice(i, 1);
-                  }
-              }
-          }
-          return this;
-      };
-      Observable.prototype.dispatchEvent = function (eventID) {
-          var args = [];
-          for (var _i = 1; _i < arguments.length; _i++) {
-              args[_i - 1] = arguments[_i];
-          }
-          var eventObservers = this._eventObservers[eventID];
-          if (eventObservers) {
-              for (var _a = 0, eventObservers_1 = eventObservers; _a < eventObservers_1.length; _a++) {
-                  var observer = eventObservers_1[_a];
-                  observer.apply(void 0, args);
-              }
-          }
-          return this;
-      };
-      Observable.prototype._hasObserver = function (eventID) {
-          var eventObservers = this._eventObservers[eventID];
-          for (var observer in eventObservers) {
-              if (eventObservers[observer]) {
-                  return true;
-              }
-          }
-          return false;
-      };
-      Observable.prototype.hasObserver = function (_eventID) {
-          if (_eventID !== void 0) {
-              return this._hasObserver(_eventID);
-          }
-          for (var eventID in this._eventObservers) {
-              if (this._hasObserver(eventID)) {
-                  return true;
-              }
-          }
-          return false;
-      };
-      return Observable;
-  }());
-
-  var requestAnimationFrame;
-  // let cancelAnimationFrame: CancelAnimationFrame;
-  (function () {
-      if (root.requestAnimationFrame) {
-          requestAnimationFrame = root.requestAnimationFrame;
-          // cancelAnimationFrame = root.cancelAnimationFrame;
-      }
-      else {
-          var lastTime_1 = 0;
-          requestAnimationFrame = function (callback) {
-              var currTime = new Date().getTime();
-              var timeToCall = Math.max(0, 16 - (currTime - lastTime_1));
-              var id = setTimeout(function () { return callback(currTime + timeToCall); }, timeToCall);
-              lastTime_1 = currTime + timeToCall;
-              return id;
-          };
-          // cancelAnimationFrame = function (handle: number): void {
-          //     clearTimeout(handle);
-          // };
-      }
-  })();
-  var Message = /** @class */ (function () {
-      function Message() {
-      }
-      Object.defineProperty(Message.prototype, "canConflate", {
-          get: function () { return false; },
-          enumerable: false,
-          configurable: true
-      });
-      Message.prototype.conflate = function (other) {
-          return false;
-      };
-      Message.prototype.void = function () {
-          return false;
-      };
-      return Message;
-  }());
-  var Dispatch = /** @class */ (function () {
-      function Dispatch() {
-          this._observerID = 0;
-          this._observers = [];
-          this._messageBuffer = [];
-      }
-      Dispatch.prototype.observers = function () {
-          return this._observers;
-      };
-      Dispatch.prototype.messages = function () {
-          var retVal = [];
-          this._messageBuffer.forEach(function (msg) {
-              if (!retVal.some(function (msg2) { return msg2.canConflate && msg2.conflate(msg); })) {
-                  retVal.push(msg);
-              }
-          });
-          return retVal;
-      };
-      Dispatch.prototype.dispatchAll = function () {
-          this.dispatch(this.messages());
-          this.flush();
-      };
-      Dispatch.prototype.dispatch = function (messages) {
-          if (messages.length === 0)
-              return;
-          this.observers().forEach(function (o) {
-              var msgs = messages.filter(function (m) { return !m.void() && (o.type === undefined || m instanceof o.type); });
-              if (msgs.length) {
-                  o.callback(msgs);
-              }
-          });
-      };
-      Dispatch.prototype.hasObserver = function () {
-          return this._observers.length > 0;
-      };
-      Dispatch.prototype.flush = function () {
-          this._messageBuffer = [];
-      };
-      Dispatch.prototype.send = function (msg) {
-          this.dispatch([msg]);
-      };
-      Dispatch.prototype.post = function (msg) {
-          var _this = this;
-          this._messageBuffer.push(msg);
-          requestAnimationFrame(function () { return _this.dispatchAll(); });
-      };
-      Dispatch.prototype.attach = function (callback, type) {
-          var context = this;
-          var id = ++this._observerID;
-          this._observers.push({ id: id, type: type, callback: callback });
-          return {
-              release: function () {
-                  context._observers = context._observers.filter(function (o) { return o.id !== id; });
-              },
-              unwatch: function () {
-                  this.release();
-              }
-          };
-      };
-      return Dispatch;
-  }());
-
-  var XMLNode = /** @class */ (function () {
-      function XMLNode(name) {
-          this.name = "";
-          this.$ = {};
-          this._children = [];
-          this.content = "";
-          this.name = name;
-      }
-      XMLNode.prototype.appendAttribute = function (key, val) {
-          this.$[key] = val;
-      };
-      XMLNode.prototype.appendContent = function (content) {
-          this.content += content;
-      };
-      XMLNode.prototype.appendChild = function (child) {
-          this._children.push(child);
-      };
-      XMLNode.prototype.children = function (tag) {
-          if (tag === undefined) {
-              return this._children;
-          }
-          return this._children.filter(function (xmlNode) {
-              return xmlNode.name === tag;
-          });
-      };
-      return XMLNode;
-  }());
-  var SAXStackParser = /** @class */ (function () {
-      function SAXStackParser() {
-          this.stack = new Stack();
-      }
-      SAXStackParser.prototype.walkDoc = function (node) {
-          var xmlNode = this._startXMLNode(node);
-          if (node.attributes) {
-              for (var i = 0; i < node.attributes.length; ++i) {
-                  var attribute = node.attributes.item(i);
-                  this.attributes(attribute.nodeName, attribute.nodeValue);
-              }
-          }
-          this.startXMLNode(xmlNode);
-          if (node.childNodes) {
-              for (var i = 0; i < node.childNodes.length; ++i) {
-                  var childNode = node.childNodes.item(i);
-                  if (childNode.nodeType === childNode.TEXT_NODE) {
-                      this.characters(childNode.nodeValue);
-                  }
-                  else {
-                      this.walkDoc(childNode);
-                  }
-              }
-          }
-          this.endXMLNode(this.stack.pop());
-      };
-      SAXStackParser.prototype._startXMLNode = function (node) {
-          var newNode = new XMLNode(node.nodeName);
-          if (!this.stack.depth()) {
-              this.root = newNode;
-          }
-          else {
-              this.stack.top().appendChild(newNode);
-          }
-          return this.stack.push(newNode);
-      };
-      SAXStackParser.prototype.parse = function (xml) {
-          var domParser = new DOMParser();
-          var doc = domParser.parseFromString(xml, "application/xml");
-          this.startDocument();
-          this.walkDoc(doc);
-          this.endDocument();
-      };
-      //  Callbacks  ---
-      SAXStackParser.prototype.startDocument = function () {
-      };
-      SAXStackParser.prototype.endDocument = function () {
-      };
-      SAXStackParser.prototype.startXMLNode = function (node) {
-      };
-      SAXStackParser.prototype.endXMLNode = function (node) {
-      };
-      SAXStackParser.prototype.attributes = function (key, val) {
-          this.stack.top().appendAttribute(key, val);
-      };
-      SAXStackParser.prototype.characters = function (text) {
-          this.stack.top().appendContent(text);
-      };
-      return SAXStackParser;
-  }());
-  var XML2JSONParser = /** @class */ (function (_super) {
-      __extends(XML2JSONParser, _super);
-      function XML2JSONParser() {
-          return _super !== null && _super.apply(this, arguments) || this;
-      }
-      XML2JSONParser.prototype.startXMLNode = function (node) {
-          _super.prototype.startXMLNode.call(this, node);
-          switch (node.name) {
-                      }
-      };
-      XML2JSONParser.prototype.endXMLNode = function (node) {
-          switch (node.name) {
-                      }
-          _super.prototype.endXMLNode.call(this, node);
-      };
-      return XML2JSONParser;
-  }(SAXStackParser));
-  function xml2json(xml) {
-      var saxParser = new XML2JSONParser();
-      saxParser.parse(xml);
-      return saxParser.root;
-  }
-
-  var PropChangedMessage = /** @class */ (function (_super) {
-      __extends(PropChangedMessage, _super);
-      function PropChangedMessage(property, newValue, oldValue) {
-          var _this = _super.call(this) || this;
-          _this.property = property;
-          _this.newValue = newValue;
-          _this.oldValue = oldValue;
-          return _this;
-      }
-      Object.defineProperty(PropChangedMessage.prototype, "canConflate", {
-          get: function () { return true; },
-          enumerable: false,
-          configurable: true
-      });
-      PropChangedMessage.prototype.conflate = function (other) {
-          if (this.property === other.property) {
-              this.newValue = other.newValue;
-              return true;
-          }
-          return false;
-      };
-      PropChangedMessage.prototype.void = function () {
-          return deepEquals(this.newValue, this.oldValue);
-      };
-      return PropChangedMessage;
-  }(Message));
-  var StateObject = /** @class */ (function () {
-      function StateObject() {
-          this._espState = {};
-          this._dispatch = new Dispatch();
-          this._monitorTickCount = 0;
-      }
-      StateObject.prototype.clear = function (newVals) {
-          this._espState = {};
-          if (newVals !== void 0) {
-              this.set(newVals);
-          }
-          this._monitorTickCount = 0;
-      };
-      StateObject.prototype.get = function (key, defValue) {
-          if (key === void 0) {
-              return this._espState;
-          }
-          return this.has(key) ? this._espState[key] : defValue;
-      };
-      StateObject.prototype.set = function (keyOrNewVals, newVal) {
-          if (typeof keyOrNewVals === "string") {
-              return this.setSingle(keyOrNewVals, newVal); //  TODO:  "as any" should not be needed (TS >= 3.1.x)
-          }
-          this.setAll(keyOrNewVals);
-      };
-      StateObject.prototype.setSingle = function (key, newVal) {
-          var oldVal = this._espState[key];
-          this._espState[key] = newVal;
-          this._dispatch.post(new PropChangedMessage(key, newVal, oldVal));
-      };
-      StateObject.prototype.setAll = function (_) {
-          for (var key in _) {
-              if (_.hasOwnProperty(key)) {
-                  this.setSingle(key, _[key]);
-              }
-          }
-      };
-      StateObject.prototype.has = function (key) {
-          return this._espState[key] !== void 0;
-      };
-      StateObject.prototype.addObserver = function (eventID, propIDOrCallback, callback) {
-          if (this.isCallback(propIDOrCallback)) {
-              if (eventID !== "changed")
-                  throw new Error("Invalid eventID:  " + eventID);
-              return this._dispatch.attach(function (messages) {
-                  propIDOrCallback(messages.map(function (m) { return ({
-                      id: m.property,
-                      oldValue: m.oldValue,
-                      newValue: m.newValue
-                  }); }));
-              });
-          }
-          else {
-              if (eventID !== "propChanged")
-                  throw new Error("Invalid eventID:  " + eventID);
-              return this._dispatch.attach(function (messages) {
-                  var filteredMessages = messages.filter(function (m) { return m.property === propIDOrCallback; });
-                  if (filteredMessages.length) {
-                      if (filteredMessages.length > 1) {
-                          console.warn("Should only be 1 message?");
-                      }
-                      var event_1 = filteredMessages[filteredMessages.length - 1];
-                      callback({
-                          id: event_1.property,
-                          oldValue: event_1.oldValue,
-                          newValue: event_1.newValue
-                      });
-                  }
-              });
-          }
-      };
-      StateObject.prototype.on = function (eventID, propIDOrCallback, callback) {
-          this.addObserver(eventID, propIDOrCallback, callback);
-          return this;
-      };
-      StateObject.prototype.isCallback = function (propIDOrCallback) {
-          return (typeof propIDOrCallback === "function");
-      };
-      StateObject.prototype.hasEventListener = function () {
-          return this._dispatch.hasObserver();
-      };
-      //  Monitoring  ---
-      StateObject.prototype.refresh = function () {
-          return __awaiter(this, arguments, void 0, function (full) {
-              return __generator(this, function (_a) {
-                  switch (_a.label) {
-                      case 0: return [4 /*yield*/, Promise.resolve()];
-                      case 1:
-                          _a.sent();
-                          return [2 /*return*/, this];
-                  }
-              });
-          });
-      };
-      StateObject.prototype._monitor = function () {
-          var _this = this;
-          if (this._monitorHandle) {
-              this._monitorTickCount = 0;
-              return;
-          }
-          this._monitorHandle = setTimeout(function () {
-              var refreshPromise = _this.hasEventListener() ? _this.refresh() : Promise.resolve();
-              refreshPromise.then(function () {
-                  _this._monitor();
-              });
-              delete _this._monitorHandle;
-          }, this._monitorTimeoutDuration());
-      };
-      StateObject.prototype._monitorTimeoutDuration = function () {
-          ++this._monitorTickCount;
-          if (this._monitorTickCount <= 1) { //  Once
-              return 0;
-          }
-          return 30000;
-      };
-      StateObject.prototype.watch = function (callback, triggerChange) {
-          var _this = this;
-          if (triggerChange === void 0) { triggerChange = true; }
-          if (typeof callback !== "function") {
-              throw new Error("Invalid Callback");
-          }
-          if (triggerChange) {
-              setTimeout(function () {
-                  var props = _this.get();
-                  var changes = [];
-                  for (var key in props) {
-                      if (props.hasOwnProperty(props)) {
-                          changes.push({ id: key, newValue: props[key], oldValue: undefined });
-                      }
-                  }
-                  callback(changes);
-              }, 0);
-          }
-          var retVal = this.addObserver("changed", callback);
-          this._monitor();
-          return retVal;
-      };
-      return 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;
-  }
-  function endsWith(origString, searchString, position) {
-      var subjectString = origString.toString();
-      if (typeof position !== "number" || !isFinite(position) || Math.floor(position) !== position || position > subjectString.length) {
-          position = subjectString.length;
-      }
-      position -= searchString.length;
-      var lastIndex = subjectString.lastIndexOf(searchString, position);
-      return lastIndex !== -1 && lastIndex === position;
-  }
-
-  function join() {
-      var segments = [];
-      for (var _i = 0; _i < arguments.length; _i++) {
-          segments[_i] = arguments[_i];
-      }
-      var parts = segments.reduce(function (parts, segment) {
-          // Remove leading slashes from non-first part.
-          if (parts.length > 0) {
-              segment = segment.replace(/^\//, "");
-          }
-          // Remove trailing slashes.
-          segment = segment.replace(/\/$/, "");
-          return __spreadArray(__spreadArray([], parts, true), segment.split("/"), true);
-      }, []);
-      var resultParts = [];
-      for (var _a = 0, parts_1 = parts; _a < parts_1.length; _a++) {
-          var part = parts_1[_a];
-          if (part === ".") {
-              continue;
-          }
-          if (part === "..") {
-              resultParts.pop();
-              continue;
-          }
-          resultParts.push(part);
-      }
-      return resultParts.join("/");
-  }
-  function dirname(path) {
-      return join(path, "..");
-  }
-
-  exports.AsyncCache = AsyncCache;
-  exports.AsyncOrderedQueue = AsyncOrderedQueue;
-  exports.BUILD_VERSION = BUILD_VERSION;
-  exports.Cache = Cache;
-  exports.Dictionary = Dictionary;
-  exports.DictionaryNoCase = DictionaryNoCase;
-  exports.Dispatch = Dispatch;
-  exports.Edge = Edge$1;
-  exports.Graph = Graph;
-  exports.Graph2 = Graph2;
-  exports.GraphItem = GraphItem$1;
-  exports.Logging = Logging;
-  exports.Message = Message;
-  exports.Observable = Observable;
-  exports.PKG_NAME = PKG_NAME;
-  exports.PKG_VERSION = PKG_VERSION;
-  exports.SAXStackParser = SAXStackParser;
-  exports.ScopedLogging = ScopedLogging;
-  exports.Stack = Stack;
-  exports.StateObject = StateObject;
-  exports.Subgraph = Subgraph$1;
-  exports.Vertex = Vertex$1;
-  exports.XMLNode = XMLNode;
-  exports.cartesianToPolar = cartesianToPolar;
-  exports.classID2Meta = classID2Meta;
-  exports.compare = compare;
-  exports.compare2 = compare2;
-  exports.debounce = debounce;
-  exports.deepEquals = deepEquals;
-  exports.deepMixin = deepMixin;
-  exports.deepMixinT = deepMixinT;
-  exports.degreesToRadians = degreesToRadians;
-  exports.dirname = dirname;
-  exports.endsWith = endsWith;
-  exports.espTime2Seconds = espTime2Seconds;
-  exports.exists = exists;
-  exports.find = find;
-  exports.getScriptSrc = getScriptSrc;
-  exports.hashSum = hashSum;
-  exports.inner = inner;
-  exports.isArray = isArray;
-  exports.isBrowser = isBrowser;
-  exports.isCI = isCI;
-  exports.isNode = isNode;
-  exports.join = join;
-  exports.logger = logger;
-  exports.normalize = normalize;
-  exports.normalizeDegrees = normalizeDegrees;
-  exports.normalizeRadians = normalizeRadians;
-  exports.polarToCartesian = polarToCartesian;
-  exports.promiseTimeout = promiseTimeout;
-  exports.radiansToDegrees = radiansToDegrees;
-  exports.root = root;
-  exports.safeStringify = safeStringify;
-  exports.scopedLogger = scopedLogger;
-  exports.sleep = sleep;
-  exports.trim = trim;
-  exports.update = update;
-  exports.verboseDeepEquals = verboseDeepEquals;
-  exports.xml2json = xml2json;
-
-}));
+var xe="@hpcc-js/util",Ee="3.1.0",me="2.107.0";function Se(n,e){if(n==null)throw new TypeError('"o" is null or not defined');let t=n.length>>>0;if(typeof e!="function")throw new TypeError("predicate must be a function");let r=arguments[1],s=0;for(;s<t;){let i=n[s];if(e.call(r,i,s))return i;s++}}function ye(n,e){let t={update:[],exit:[],enter:[...e]};for(let r of n){let s=t.enter.indexOf(r);s>=0?(t.update.push(r),t.enter.splice(s,1)):t.exit.push(r)}return t}function M(n,e,t,r=(s,i)=>i){let s={update:[],exit:[],enter:[]};if(n===e)return s.update=n,s;let i={};e.forEach(o=>{i[t(o)]=o});for(let o of n){let a=t(o),h=i[a];h!==void 0?(delete i[a],s.update.push(r(o,h))):s.exit.push(o)}for(let o in i)s.enter.push(i[o]);return s}function ue(n,e){for(;n.length<e;)n="0"+n;return n}function b(n,e){if(e.length===0)return n;for(let t=0;t<e.length;++t){let r=e.charCodeAt(t);n=(n<<5)-n+r,n|=0}return n<0?n*-2:n}function ce(n,e,t){return typeof e.hashSum=="function"?e.hashSum():Object.keys(e).sort().reduce((r,s)=>J(r,e[s],s,t),n)}function J(n,e,t,r){let s=b(b(b(n,t),pe(e)),typeof e);return e===null?b(s,"null"):e===void 0?b(s,"undefined"):typeof e=="object"?r.indexOf(e)!==-1?b(s,"[Circular]"+t):(r.push(e),ce(s,e,r)):b(s,e.toString())}function pe(n){return Object.prototype.toString.call(n)}function E(n){return ue(J(0,n,"",[]).toString(16),8)}var Q=class{_cache={};_calcID;static hash(...e){return E({...e})}constructor(e){this._calcID=e}has(e){return this._calcID(e)in this._cache}set(e){return this._cache[this._calcID(e)]=e,e}get(e,t){let r=this._cache[this._calcID(e)];return r||(t?this.set(t()):null)}},Y=class{_cache={};_calcID;static hash(...e){return E({...e})}constructor(e){this._calcID=e}has(e){return this._calcID(e)in this._cache}set(e,t){return this._cache[this._calcID(e)]=t,t}get(e,t){let r=this._cache[this._calcID(e)];return r||(t?this.set(e,t()):Promise.resolve(null))}};function ke(n,e){let t={};return(...r)=>{let s=E(r);return t[s]||(t[s]={clockStart:Date.now(),promise:n(...r).then(i=>(e===void 0?t[s]=null:setTimeout(()=>{t[s]=null},Math.max(e-(Date.now()-t[s].clockStart),0)),i)).catch(i=>{throw t[s]=null,i})}),t[s].promise}}function Pe(n,e){let t,r=new Promise((s,i)=>{t=setTimeout(()=>{clearTimeout(t),i("Timed out in "+n+"ms.")},n)});return Promise.race([e,r]).then(s=>(clearTimeout(t),s)).catch(s=>{throw clearTimeout(t),s})}var Z=class{_q=[];isTop(e){return this._q[0]===e}push(e){let t=e.then(r=>this.isTop(t)?(this._q.shift(),r):new Promise((s,i)=>{let o=setInterval(()=>{this.isTop(t)&&(clearInterval(o),this._q.shift(),s(r))},20)}));return this._q.push(t),t}};function De(n){return new Promise(e=>{setTimeout(()=>e(),n)})}var A=class{store={};constructor(e){if(e)for(let t in e)this.set(t,e[t])}set(e,t){let r=this.store[e];return this.store[e]=t,r}get(e){return this.store[e]}has(e){return this.store[e]!==void 0}remove(e){delete this.store[e]}keys(){let e=[];for(let t in this.store)e.push(t);return e}values(){let e=[];for(let t in this.store)e.push(this.store[t]);return e}},ee=class extends A{constructor(e){super(e)}set(e,t){return super.set(e.toLowerCase(),t)}get(e){return super.get(e.toLowerCase())}has(e){return super.has(e.toLowerCase())}remove(e){return super.remove(e.toLowerCase())}};function Fe(n){if(n){if(!isNaN(Number(n)))return Number(n)}else return 0;let e=n.indexOf("ns");if(e!==-1)return parseFloat(n.substr(0,e))/1e9;let t=n.indexOf("ms");if(t!==-1)return parseFloat(n.substr(0,t))/1e3;let r=n.indexOf("s");if(r!==-1&&n.indexOf("days")===-1)return parseFloat(n.substr(0,r));let s=n.split(" days "),i=s.length>1?parseFloat(s[0]):0,o=s.length>1?s[1]:s[0],a=0,h=o.split(":").reverse();for(let p=0;p<h.length;++p)a+=parseFloat(h[p])*Math.pow(60,p);return i*24*60*60+a}var v=class{_graph;parent;props={};constructor(e,t){this._graph=e,this.parent=t}},m=class n extends v{subgraphs=[];vertices=[];edges=[];_;constructor(e,t,r){super(e,t),t&&t._addSubgraph(this),this._=r}remove(e=!0){this._graph.removeSubgraph(this,e)}createSubgraph(e){return this._graph.createSubgraph(this,e)}_addSubgraph(e){if(this.subgraphs.indexOf(e)>=0)throw new Error("Subgraph already exists");this.subgraphs.push(e)}_removeSubgraph(e){let t=this.subgraphs.indexOf(e);if(t<0)throw new Error("Subgraph does not exist");this.subgraphs.splice(t,1)}removeAllSubgraphs(){for(let e=this.subgraphs.length-1;e>=0;--e)this._graph.removeSubgraph(this.subgraphs[e],!0)}createVertex(e){return this._graph.createVertex(this,e)}_addVertex(e){if(this.vertices.indexOf(e)>=0)throw new Error("Vertex already exists");this.vertices.push(e)}_removeVertex(e){let t=this.vertices.indexOf(e);if(t<0)throw new Error("Vertex does not exist");this.vertices.splice(t,1)}removeAllVertices(){for(let e=this.vertices.length-1;e>=0;--e)this._graph.removeVertex(this.vertices[e],!0)}createEdge(e,t,r){return this._graph.createEdge(this,e,t,r)}_addEdge(e){if(this.edges.indexOf(e)>=0)throw new Error("Edge already exists");this.edges.push(e)}_removeEdge(e){let t=this.edges.indexOf(e);if(t<0)throw new Error("Edge does not exist");this.edges.splice(t,1)}_add(e){e instanceof n?this._addSubgraph(e):e instanceof S?this._addVertex(e):this._addEdge(e)}},S=class extends v{inEdges=[];outEdges=[];get edges(){return[...this.inEdges,...this.outEdges]}_;constructor(e,t,r){super(e,t),t._addVertex(this),this._=r}remove(e=!0,t){return this._graph.removeVertex(this,e,t)}addInEdge(e){this.inEdges.push(e)}removeInEdge(e){let t=this.inEdges.indexOf(e);if(t<0)throw new Error("In edge does not exist");this.inEdges.splice(t,1)}addOutEdge(e){this.outEdges.push(e)}removeOutEdge(e){let t=this.outEdges.indexOf(e);if(t<0)throw new Error("Out edge does not exist");this.outEdges.splice(t,1)}},I=class extends v{source;target;_;constructor(e,t,r,s,i){if(super(e,t),!r)throw new Error("Missing source vertex");if(!s)throw new Error("Missing target vertex");t._addEdge(this),this.source=r,this.source.addOutEdge(this),this.target=s,this.target.addInEdge(this),this._=i}remove(){this._graph.removeEdge(this)}},te=class{root;_allSubgraphs=[];_allSubgraphsMap={};_allVertices=[];_allVerticesMap={};_allEdges=[];_allEdgesMap={};idOf;constructor(e=r=>""+r._,t){this.root=new m(this,null,t),this.idOf=e}createSubgraph(e,t){let r=new m(this,e||this.root,t);return this._allSubgraphs.push(r),this._allSubgraphsMap[this.idOf(r)]=r,r}removeSubgraph(e,t=!0){let r=this._allSubgraphs.indexOf(e);if(r<0)throw new Error("Subgraph does not exist");this._allSubgraphs.splice(r,1),delete this._allSubgraphsMap[this.idOf(e)],e.parent&&e.parent._removeSubgraph(e),e.edges.forEach(s=>t?this.removeEdge(s):e.parent._addEdge(s)),e.vertices.forEach(s=>t?this.removeVertex(s,t):e.parent._addVertex(s)),e.subgraphs.forEach(s=>t?this.removeSubgraph(s,t):e.parent._addSubgraph(s))}get subgraphs(){return this._allSubgraphs}subgraph(e){return this._allSubgraphsMap[e]}createVertex(e,t){let r=new S(this,e,t);return this._allVertices.push(r),this._allVerticesMap[this.idOf(r)]=r,r}removeVertex(e,t=!0,r){let s=this._allVertices.indexOf(e);if(s<0)throw new Error("Vertex does not exist");this._allVertices.splice(s,1),delete this._allVerticesMap[this.idOf(e)],e.parent&&e.parent._removeVertex(e),t||e.inEdges.forEach(i=>{e.outEdges.forEach(o=>{this.createEdge(this.root,i.source,o.target,r?r(i.source._,o.target._):void 0)})}),e.inEdges.forEach(i=>this.removeEdge(i)),e.outEdges.forEach(i=>this.removeEdge(i))}get vertices(){return this._allVertices}vertex(e){return this._allVerticesMap[e]}createEdge(e,t,r,s){let i=new I(this,e,t,r,s);return this._allEdges.push(i),this._allEdgesMap[this.idOf(i)]=i,i}removeEdge(e){let t=this._allEdges.indexOf(e);if(t<0)throw new Error("Edge does not exist");this._allEdges.splice(t,1),delete this._allEdgesMap[this.idOf(e)],e.parent&&e.parent._removeEdge(e),e.source.removeOutEdge(e),e.target.removeInEdge(e)}get edges(){return this._allEdges}edge(e){return this._allEdgesMap[e]}_walk(e,t){for(let r of e.subgraphs)switch(t(r)){case"abort":return!0;case"stepover":break;default:if(this._walk(r,t))return!0}for(let r of e.vertices)if(t(r)==="abort")return!0}walk(e){this._walk(this.root,e);for(let t of this._allEdges)if(e(t)==="abort")return!0}clone(){let e=this.constructor,t=new e(this.idOf,this.root._),r=de();return r.put(this.root,t.root),this.walk(s=>{let i=r.get(s.parent);if(s instanceof m)r.put(s,i.createSubgraph(s._));else if(s instanceof S)r.put(s,i.createVertex(s._));else if(s instanceof I){let o=r.get(s.source),a=r.get(s.target);i.createEdge(o,a,s._)}}),t}};function de(){let n=[],e=[];return{put(t,r){let s=n.indexOf(t);s===-1?(n.push(t),e.push(r)):e[s]=r},get(t){return e[n.indexOf(t)]}}}var j=class{_graph;_;id(){return this._graph.id(this._)}constructor(e,t){this._graph=e,this._=t}},V=class extends j{_parent;constructor(e,t){super(e,t)}clearParent(){return this._parent&&(this._parent.removeChild(this),delete this._parent),this}parent(e){return arguments.length===0?this._parent:(this._parent!==e&&(this._parent&&this._parent.removeChild(this),this._parent=e,this._parent&&this._parent.addChild(this)),this)}},y=class extends V{_children=[];constructor(e,t){super(e,t)}children(){return this._children}addChild(e){this._children.push(e)}removeChild(e){this._children=this._children.filter(t=>t.id!==e.id)}},$=class extends V{_inEdges=[];_outEdges=[];constructor(e,t){super(e,t)}edges(){return[...this._inEdges,...this._outEdges]}edgeCount(){return this._outEdges.length+this._inEdges.length}inEdges(){return this._inEdges}addInEdge(e){this._inEdges.push(e)}removeInEdge(e){this._inEdges=this._inEdges.filter(t=>t._.id!==e)}outEdges(){return this._outEdges}addOutEdge(e){this._outEdges.push(e)}removeOutEdge(e){this._outEdges=this._outEdges.filter(t=>t._.id!==e)}},L=class extends V{_source;_target;constructor(e,t,r,s){super(e,t),this._source=r,this._target=s}},re=class{_directed;_subgraphMap={};_vertexMap={};_edgeMap={};constructor(e=!0){this._directed=e}clear(){return this._subgraphMap={},this._vertexMap={},this._edgeMap={},this}clearParents(){for(let e in this._subgraphMap)this._subgraphMap[e].clearParent();for(let e in this._vertexMap)this._vertexMap[e].clearParent();return this}isDirected(){return this._directed}_idFunc=e=>typeof e.id=="function"?e.id():e.id;idFunc(e){return this._idFunc=e,this}_sourceFunc=e=>typeof e.source=="function"?e.source():e.source;sourceFunc(e){return this._sourceFunc=e,this}_targetFunc=e=>typeof e.target=="function"?e.target():e.target;targetFunc(e){return this._targetFunc=e,this}_updateFunc=(e,t)=>t;updateFunc(e){return this._updateFunc=e,this}id(e){return this._idFunc(e)}type(e){return this.subgraphExists(e)?"S":this.vertexExists(e)?"V":this.edgeExists(e)?"E":""}isSubgraph(e){return this.subgraphExists(this.id(e))}isVertex(e){return this.vertexExists(this.id(e))}isEdge(e){return this.edgeExists(this.id(e))}allItems(){return[...this.allSubgraphs(),...this.allVertices(),...this.allEdges()]}item(e){if(this.subgraphExists(e))return this.subgraph(e);if(this.vertexExists(e))return this.vertex(e);if(this.edgeExists(e))return this.edge(e)}itemExists(e){return this.edgeExists(e)||this.vertexExists(e)||this.subgraphExists(e)}allSubgraphs(){let e=[];for(let t in this._subgraphMap)e.push(this._subgraphMap[t]._);return e}subgraphs(){let e=[];for(let t in this._subgraphMap)this._subgraphMap[t].parent()===void 0&&e.push(this._subgraphMap[t]._);return e}subgraphExists(e){return!!this._subgraphMap[e]}subgraph(e){return this._subgraphMap[e]._}subgraphSubgraphs(e){return this._subgraphMap[e].children().filter(t=>this.isSubgraph(t._)).map(t=>t._)}subgraphVertices(e){return this._subgraphMap[e].children().filter(t=>this.isVertex(t._)).map(t=>t._)}subgraphEdges(e){return this._subgraphMap[e].children().filter(t=>this.isEdge(t._)).map(t=>t._)}addSubgraph(e,t){let r=this._idFunc(e);if(this._subgraphMap[r])throw new Error(`Subgraph '${r}' already exists.`);let s=new y(this,e);if(t){let i=this._idFunc(t);if(!this._subgraphMap[i])throw new Error(`Subgraph '${i}' does not exist.`);s.parent(this._subgraphMap[i])}return this._subgraphMap[r]=s,this}mergeSubgraphs(e=[]){let t=M(this.allSubgraphs(),e,r=>this._idFunc(r),this._updateFunc);return t.exit.forEach(r=>this.removeSubgraph(this._idFunc(r))),t.enter.forEach(r=>this.addSubgraph(r)),t.update.forEach(r=>this.updateSubgraph(r)),this}updateSubgraph(e){let t=this._idFunc(e),r=this._subgraphMap[t];if(!r)throw new Error(`Subgraph '${t}' does not exist.`);return r._=e,this}removeSubgraph(e,t=!0){let r=this._subgraphMap[e];if(!r)throw new Error(`Subgraph '${e}' does not exist.`);return r.children().forEach(s=>{t?s.parent(r.parent()):s instanceof y?this.removeSubgraph(s.id()):this.removeVertex(s.id())}),delete this._subgraphMap[e],this}subgraphParent(e,t){let r=this._subgraphMap[e];if(!r)throw new Error(`Subgraph '${e}' does not exist.`);if(t===void 0){let i=r.parent();return i?i._:void 0}let s=this._subgraphMap[t];if(!s)throw new Error(`Vertex parent '${s}' does not exist.`);return r.parent(s),this}allVertices(){let e=[];for(let t in this._vertexMap)e.push(this._vertexMap[t]._);return e}vertices(){let e=[];for(let t in this._vertexMap)this._vertexMap[t].parent()===void 0&&e.push(this._vertexMap[t]._);return e}vertexExists(e){return!!this._vertexMap[e]}vertex(e){return this._vertexMap[e]._}allEdges(){let e=[];for(let t in this._edgeMap)e.push(this._edgeMap[t]._);return e}edges(){let e=[];for(let t in this._edgeMap)this._edgeMap[t].parent()===void 0&&e.push(this._edgeMap[t]._);return e}vertexEdges(e){return this._vertexMap[e].edges().map(t=>t._)}inEdges(e){return this._vertexMap[e].inEdges().map(t=>t._)}outEdges(e){return this._vertexMap[e].outEdges().map(t=>t._)}_neighbors(e){return[...this._vertexMap[e].outEdges().map(t=>t._target),...this._vertexMap[e].inEdges().map(t=>t._source)]}neighbors(e){return this._neighbors(e).map(t=>t._)}singleNeighbors(e){return this._neighbors(e).filter(t=>t.edgeCount()===1).map(t=>t._)}addVertex(e,t){let r=this._idFunc(e);if(this._vertexMap[r])throw new Error(`Vertex '${r}' already exists.`);let s=new $(this,e);if(t){let i=this._idFunc(t);if(!this.subgraphExists(i))throw new Error(`Subgraph '${i}' does not exist.`);s.parent(this._subgraphMap[i])}return this._vertexMap[r]=s,this}mergeVertices(e){let t=M(this.allVertices(),e,r=>this._idFunc(r),this._updateFunc);return t.exit.forEach(r=>this.removeVertex(this._idFunc(r))),t.enter.forEach(r=>this.addVertex(r)),t.update.forEach(r=>this.updateVertex(r)),this}updateVertex(e){let t=this._idFunc(e),r=this._vertexMap[t];if(!r)throw new Error(`Vertex '${t}' does not exist.`);return r._=e,this}removeVertex(e){let t=this._vertexMap[e];if(!t)throw new Error(`Vertex '${e}' does not exist.`);return t.edges().forEach(r=>{this.removeEdge(r.id())}),delete this._vertexMap[e],this}vertexParent(e,t){let r=this._vertexMap[e];if(!r)throw new Error(`Vertex '${e}' does not exist.`);if(t===void 0){let i=r.parent();return i?i._:void 0}let s=this._subgraphMap[t];if(!s)throw new Error(`Vertex parent '${s}' does not exist.`);return r.parent(s),this}edgeExists(e){return!!this._edgeMap[e]}edge(e){return this._edgeMap[e]._}addEdge(e,t){let r=this._idFunc(e),s=this._sourceFunc(e),i=this._targetFunc(e);if(this._edgeMap[r])throw new Error(`Edge '${r}' already exists.`);if(!this.vertexExists(s))throw new Error(`Edge Source '${s}' does not exist.`);if(!this.vertexExists(i))throw new Error(`Edge Target '${i}' does not exist.`);let o=new L(this,e,this._vertexMap[s],this._vertexMap[i]);if(t){let a=this._idFunc(t);if(!this.subgraphExists(a))throw new Error(`Subgraph '${a}' does not exist.`);o.parent(this._subgraphMap[a])}return this._edgeMap[r]=o,this._vertexMap[s].addOutEdge(o),this._vertexMap[i].addInEdge(o),this}mergeEdges(e){let t=M(this.allEdges(),e,r=>this._idFunc(r),this._updateFunc);return t.exit.forEach(r=>this.removeEdge(this._idFunc(r))),t.enter.forEach(r=>this.addEdge(r)),t.update.forEach(r=>this.updateEdge(r)),this}updateEdge(e){let t=this._idFunc(e),r=this._edgeMap[t];if(!r)throw new Error(`Edge '${t}' does not exist.`);let s=r._source.id(),i=this._sourceFunc(e);s!==i&&(this._vertexMap[s]?.removeOutEdge(t),this._vertexMap[i]?.addOutEdge(r));let o=r._target.id(),a=this._targetFunc(e);return o!==a&&(this._vertexMap[o]?.removeInEdge(t),this._vertexMap[a]?.addInEdge(r)),r._=e,r._source=this._vertexMap[i],r._target=this._vertexMap[a],this}removeEdge(e){let t=this._edgeMap[e];if(!t)throw new Error(`Edge '${e}' does not exist.`);let r=this._idFunc(t._source._);if(!this.vertexExists(r))throw new Error(`Edge Source'${r}' does not exist.`);this._vertexMap[r].removeOutEdge(e);let s=this._idFunc(t._target._);if(!this.vertexExists(s))throw new Error(`Edge Target'${s}' does not exist.`);return this._vertexMap[s].removeInEdge(e),delete this._edgeMap[e],this}_hwalk(e,t){return e instanceof y?t("subgraph",e._,e.children().map(r=>this._hwalk(r,t))):t("vertex",e._)}hierarchy(e){let t=[];for(let r in this._subgraphMap){let s=this._subgraphMap[r];s.parent()===void 0&&t.push(this._hwalk(s,e))}for(let r in this._vertexMap){let s=this._vertexMap[r];s.parent()===void 0&&t.push(this._hwalk(s,e))}return t}dijkstra(e,t){let r=this.allEdges(),s=new N,i={},o={},a={};function h(u,d){let c=1/0,_=null;return u.forEach(F=>{d[F]<c&&(c=d[F],_=F)}),_}for(let u=0;u<r.length;u++){let d=this._sourceFunc(r[u]),c=this._targetFunc(r[u]),_=1;s.add(d),s.add(c),o[d]=1/0,o[c]=1/0,a[d]===void 0&&(a[d]={}),a[c]===void 0&&(a[c]={}),a[d][c]=_,a[c][d]=_}for(o[e]=0;s.size;){let u=h(s,o);if(u===null)break;let d=Object.keys(a[u]).filter(c=>s.has(c));if(s.delete(u),u===t)break;for(let c of d){let _=o[u]+a[u][c];_<o[c]&&(o[c]=_,i[c]=u)}}let p=t,g=[p],f=0;for(;i[p]!==void 0;)g.unshift(i[p]),f+=a[p][i[p]],p=i[p];return{ids:g,len:f}}sort(e){let t=[],r={},s=(i,o=[])=>{let a=i.id();r[a]||(r[a]=!0,o.push(i),i.outEdges().forEach(h=>{o.indexOf(h._target)<0&&s(h._target,[...o])}),t.unshift(i._))};if(e)s(this._vertexMap[e]);else for(let i in this._vertexMap)s(this._vertexMap[i]);return t}},N=class{_content=[];get size(){return this._content.length}has(e){return this._content.indexOf(e)>=0}add(e){this.has(e)||this._content.push(e)}delete(e){let t=this._content.indexOf(e);t>=0&&this._content.splice(t,1)}forEach(e){this._content.forEach(e)}};var k=Array.isArray,w=Object.keys,ne=Object.prototype.hasOwnProperty;function se(n,e,t=!1){if(n===e)return!0;if(n&&e){if(typeof n=="object"&&typeof e=="object"){let s=k(n),i=k(e),o,a,h;if(s&&i){if(a=n.length,a!==e.length)return console.warn(`lengths not equal: ${a} !== ${e.length}`),!1;for(o=a;o--!==0;)if(!se(n[o],e[o],t))return!1;return!0}if(s!==i)return console.warn(`arrays not equal: ${s} !== ${i}`),!1;let p=n instanceof Date,g=e instanceof Date;if(p!==g)return console.warn(`dates not equal: ${p} !== ${g}`),!1;if(p&&g){let c=n.getTime()===e.getTime();return c||console.warn(`dates not equal: ${n.getTime()} !== ${e.getTime()}`),c}let f=n instanceof RegExp,u=e instanceof RegExp;if(f!==u)return console.warn(`regexps not equal: ${f} !== ${u}`),!1;if(f&&u){let c=n.toString()===e.toString();return c||console.warn(`regexps not equal: ${n.toString()} !== ${e.toString()}`),c}let d=w(n);if(a=d.length,a!==w(e).length)return console.warn(`key lengths not equal: ${a} !== ${w(e).length}`),!1;for(o=a;o--!==0;)if(!ne.call(e,d[o]))return console.warn(`${d[o]} in a but not b`),!1;for(o=a;o--!==0;)if(h=d[o],!se(n[h],e[h],t))return!1;return!0}else if(!t&&typeof n=="function"&&typeof e=="function"){let s=n.toString()===e.toString();return s||console.warn(`functions not equal: ${n.toString()} !== ${e.toString()}`),s}}let r=n!==n&&e!==e;return r||console.warn(`values not equal: ${n} !== ${e}`),r}function T(n,e,t=!1){if(n===e)return!0;if(n&&e){if(typeof n=="object"&&typeof e=="object"){let r=k(n),s=k(e),i,o,a;if(r&&s){if(o=n.length,o!==e.length)return!1;for(i=o;i--!==0;)if(!T(n[i],e[i],t))return!1;return!0}if(r!==s)return!1;let h=n instanceof Date,p=e instanceof Date;if(h!==p)return!1;if(h&&p)return n.getTime()===e.getTime();let g=n instanceof RegExp,f=e instanceof RegExp;if(g!==f)return!1;if(g&&f)return n.toString()===e.toString();let u=w(n);if(o=u.length,o!==w(e).length)return!1;for(i=o;i--!==0;)if(!ne.call(e,u[i]))return!1;for(i=o;i--!==0;)if(a=u[i],!T(n[a],e[a],t))return!1;return!0}else if(!t&&typeof n=="function"&&typeof e=="function")return n.toString()===e.toString()}return n!==n&&e!==e}function Ne(n,e,t=!1){return T(n,e,t)?n:e}var P=typeof globalThis<"u"?globalThis:window,Ue=typeof window<"u"&&P===window,R=typeof process<"u"&&process.versions!=null&&process.versions.node!=null,qe=R&&process.env!=null&&(process.env.TRAVIS!=null||process.env.GITHUB_ACTIONS!=null);function Ke(n){let e=document.scripts||[];for(let t=document.scripts.length-1;t>=0;--t){let r=e[t];if(r.src){let s=r.src.indexOf(n);if(s>=0)return r.src.substring(0,s)}}return""}var x=class{stack=[];push(e){return this.stack.push(e),e}pop(){return this.stack.pop()}top(){return this.stack.length?this.stack[this.stack.length-1]:void 0}depth(){return this.stack.length}};var D=(h=>(h[h.debug=0]="debug",h[h.info=1]="info",h[h.notice=2]="notice",h[h.warning=3]="warning",h[h.error=4]="error",h[h.critical=5]="critical",h[h.alert=6]="alert",h[h.emergency=7]="emergency",h))(D||{}),le={debug:"cyan",info:"green",notice:"grey",warning:"blue",error:"red",critical:"magenta",alert:"magenta",emergency:"magenta"},U=class{write(e,t,r,s){R?console.log(`[${e}] ${D[t].toUpperCase()} ${r}:  ${s}`):console.log(`[${e}] %c${D[t].toUpperCase()}%c ${r}:  ${s}`,`color:${le[D[t]]}`,"")}},q=class{static _instance;_levelStack=new x;_level=1;_filter="";_writer=new U;static Instance(){return this._instance||(this._instance=new this)}constructor(){}stringify(e){let t=[];return JSON.stringify(e,function(r,s){if(typeof s=="object"&&s!==null){if(t.indexOf(s)!==-1)return;t.push(s)}return s},2)}writer(e){return e===void 0?this._writer:(this._writer=e,this)}log(e,t,r){if(e<this._level||this._filter&&this._filter!==t)return;let s=new Date().toISOString();this._writer.rawWrite?this._writer.rawWrite(s,e,t,r):(typeof r!="string"&&(r=this.stringify(r)),this._writer.write&&this._writer.write(s,e,t,r))}debug(e,t){this.log(0,e,t)}info(e,t){this.log(1,e,t)}notice(e,t){this.log(2,e,t)}warning(e,t){this.log(3,e,t)}error(e,t){this.log(4,e,t)}critical(e,t){this.log(5,e,t)}alert(e,t){this.log(6,e,t)}emergency(e,t){this.log(7,e,t)}level(e){return e===void 0?this._level:(this._level=e,this)}pushLevel(e){return this._levelStack.push(this._level),this._level=e,this}popLevel(){return this._level=this._levelStack.pop(),this}filter(e){return e===void 0?this._filter:(this._filter=e,this)}},l=q.Instance(),K=class{_scopeID;constructor(e){this._scopeID=e}debug(e){l.debug(this._scopeID,e)}info(e){l.info(this._scopeID,e)}notice(e){l.notice(this._scopeID,e)}warning(e){l.warning(this._scopeID,e)}error(e){l.error(this._scopeID,e)}critical(e){l.critical(this._scopeID,e)}alert(e){l.alert(this._scopeID,e)}emergency(e){l.emergency(this._scopeID,e)}pushLevel(e){return l.pushLevel(e),this}popLevel(){return l.popLevel(),this}};function We(n,e=!1){return e&&l.filter(n),new K(n)}function Je(n){return n*(Math.PI/180)}function Qe(n){return n*(180/Math.PI)}function Ye(n,e){return{x:n*Math.cos(e),y:n*Math.sin(e)}}function Ze(n,e){return{r:Math.sqrt(n*n+e*e),theta:Math.atan2(e,n)}}function et(n,e=-Math.PI,t=Math.PI){return ie(n,e,t)}function tt(n,e=-180,t=180){return ie(n,e,t)}function ie(n,e,t){let r=t-e,s=n-e;return s-Math.floor(s/r)*r+e}function ge(n,e){if(!(n===void 0||e===void 0)){for(let t of n.split(".")){if(!e.hasOwnProperty(t))return;e=e[t]}return e}}function st(n,e){return ge(n,e)!==void 0}function fe(n,e){let t={};for(let r in e){if(!e.hasOwnProperty(r)||r==="__proto__"||r==="constructor")continue;let s=e[r];s instanceof Array||typeof s=="object"&&(s=oe(n[r],s)),(!(r in n)||n[r]!==s&&(!(r in t)||t[r]!==s))&&(n[r]=s)}return n}function oe(n={},...e){if(typeof n!="object")throw new Error(`Destination "${n}" must be an object.`);for(let t of e)fe(n,t);return n}function nt(n={},...e){return oe(n,...e)}function it(n){let e=[];return JSON.stringify(n,function(t,r){if(typeof r=="object"&&r!==null){if(e.indexOf(r)!==-1)return;e.push(r)}return r})}function ot(n){return Array.isArray!==void 0?Array.isArray(n):Object.prototype.toString.call(n)==="[object Array]"}function at(n){let e=n.split("_"),t=e[1].split(".");return{module:`@hpcc-js/${e[0]}`,file:t[0],class:t[1]||t[0]}}var X=class{eventTarget;eventID;callback;constructor(e,t,r){this.eventTarget=e,this.eventID=t,this.callback=r}release(){this.eventTarget.removeObserver(this.eventID,this.callback)}unwatch(){this.release()}},ae=class{_eventObservers={};constructor(...e){}addObserver(e,t){let r=this._eventObservers[e];return r||(r=[],this._eventObservers[e]=r),r.push(t),new X(this,e,t)}removeObserver(e,t){let r=this._eventObservers[e];if(r)for(let s=r.length-1;s>=0;--s)r[s]===t&&r.splice(s,1);return this}dispatchEvent(e,...t){let r=this._eventObservers[e];if(r)for(let s of r)s(...t);return this}_hasObserver(e){let t=this._eventObservers[e];for(let r in t)if(t[r])return!0;return!1}hasObserver(e){if(e!==void 0)return this._hasObserver(e);for(let t in this._eventObservers)if(this._hasObserver(t))return!0;return!1}};var H;(function(){if(P.requestAnimationFrame)H=P.requestAnimationFrame;else{let n=0;H=function(e){let t=new Date().getTime(),r=Math.max(0,16-(t-n)),s=setTimeout(()=>e(t+r),r);return n=t+r,s}}})();var O=class{get canConflate(){return!1}conflate(e){return!1}void(){return!1}};var C=class{_observerID=0;_observers=[];_messageBuffer=[];constructor(){}observers(){return this._observers}messages(){let e=[];return this._messageBuffer.forEach(t=>{e.some(r=>r.canConflate&&r.conflate(t))||e.push(t)}),e}dispatchAll(){this.dispatch(this.messages()),this.flush()}dispatch(e){e.length!==0&&this.observers().forEach(t=>{let r=e.filter(s=>!s.void()&&(t.type===void 0||s instanceof t.type));r.length&&t.callback(r)})}hasObserver(){return this._observers.length>0}flush(){this._messageBuffer=[]}send(e){this.dispatch([e])}post(e){this._messageBuffer.push(e),H(()=>this.dispatchAll())}attach(e,t){let r=this,s=++this._observerID;return this._observers.push({id:s,type:t,callback:e}),{release(){r._observers=r._observers.filter(i=>i.id!==s)},unwatch(){this.release()}}}};var G=class{name="";$={};_children=[];content="";constructor(e){this.name=e}appendAttribute(e,t){this.$[e]=t}appendContent(e){this.content+=e}appendChild(e){this._children.push(e)}children(e){return e===void 0?this._children:this._children.filter(t=>t.name===e)}},B=class{root;stack=new x;constructor(){}walkDoc(e){let t=this._startXMLNode(e);if(e.attributes)for(let r=0;r<e.attributes.length;++r){let s=e.attributes.item(r);this.attributes(s.nodeName,s.nodeValue)}if(this.startXMLNode(t),e.childNodes)for(let r=0;r<e.childNodes.length;++r){let s=e.childNodes.item(r);s.nodeType===s.TEXT_NODE?this.characters(s.nodeValue):this.walkDoc(s)}this.endXMLNode(this.stack.pop())}_startXMLNode(e){let t=new G(e.nodeName);return this.stack.depth()?this.stack.top().appendChild(t):this.root=t,this.stack.push(t)}parse(e){let r=new DOMParser().parseFromString(e,"application/xml");this.startDocument(),this.walkDoc(r),this.endDocument()}startDocument(){}endDocument(){}startXMLNode(e){}endXMLNode(e){}attributes(e,t){this.stack.top().appendAttribute(e,t)}characters(e){this.stack.top().appendContent(e)}},W=class extends B{startXMLNode(e){switch(super.startXMLNode(e),e.name){case"xs:element":break;case"xs:simpleType":break;default:break}}endXMLNode(e){switch(e.name){case"xs:element":break;case"xs:simpleType":break;default:break}super.endXMLNode(e)}};function lt(n){let e=new W;return e.parse(n),e.root}var z=class extends O{constructor(t,r,s){super();this.property=t;this.newValue=r;this.oldValue=s}get canConflate(){return!0}conflate(t){return this.property===t.property?(this.newValue=t.newValue,!0):!1}void(){return T(this.newValue,this.oldValue)}},he=class{_espState={};_dispatch=new C;_monitorHandle;_monitorTickCount=0;clear(e){this._espState={},e!==void 0&&this.set(e),this._monitorTickCount=0}get(e,t){return e===void 0?this._espState:this.has(e)?this._espState[e]:t}set(e,t){if(typeof e=="string")return this.setSingle(e,t);this.setAll(e)}setSingle(e,t){let r=this._espState[e];this._espState[e]=t,this._dispatch.post(new z(e,t,r))}setAll(e){for(let t in e)e.hasOwnProperty(t)&&this.setSingle(t,e[t])}has(e){return this._espState[e]!==void 0}addObserver(e,t,r){if(this.isCallback(t)){if(e!=="changed")throw new Error("Invalid eventID:  "+e);return this._dispatch.attach(s=>{t(s.map(i=>({id:i.property,oldValue:i.oldValue,newValue:i.newValue})))})}else{if(e!=="propChanged")throw new Error("Invalid eventID:  "+e);return this._dispatch.attach(s=>{let i=s.filter(o=>o.property===t);if(i.length){i.length>1&&console.warn("Should only be 1 message?");let o=i[i.length-1];r({id:o.property,oldValue:o.oldValue,newValue:o.newValue})}})}}on(e,t,r){return this.addObserver(e,t,r),this}isCallback(e){return typeof e=="function"}hasEventListener(){return this._dispatch.hasObserver()}async refresh(e=!1){return await Promise.resolve(),this}_monitor(){if(this._monitorHandle){this._monitorTickCount=0;return}this._monitorHandle=setTimeout(()=>{(this.hasEventListener()?this.refresh():Promise.resolve()).then(()=>{this._monitor()}),delete this._monitorHandle},this._monitorTimeoutDuration())}_monitorTimeoutDuration(){return++this._monitorTickCount,this._monitorTickCount<=1?0:3e4}watch(e,t=!0){if(typeof e!="function")throw new Error("Invalid Callback");t&&setTimeout(()=>{let s=this.get(),i=[];for(let o in s)s.hasOwnProperty(s)&&i.push({id:o,newValue:s[o],oldValue:void 0});e(i)},0);let r=this.addObserver("changed",e);return this._monitor(),r}};function Et(n,e){if(typeof e!="string"||e.length===0)return n;for(;n.indexOf(e)===0;)n=n.substring(1);for(;_e(n,e);)n=n.substring(0,n.length-1);return n}function _e(n,e,t){let r=n.toString();(typeof t!="number"||!isFinite(t)||Math.floor(t)!==t||t>r.length)&&(t=r.length),t-=e.length;let s=r.lastIndexOf(e,t);return s!==-1&&s===t}function be(...n){let e=n.reduce((r,s)=>(r.length>0&&(s=s.replace(/^\//,"")),s=s.replace(/\/$/,""),[...r,...s.split("/")]),[]),t=[];for(let r of e)if(r!=="."){if(r===".."){t.pop();continue}t.push(r)}return t.join("/")}function vt(n){return be(n,"..")}export{Y as AsyncCache,Z as AsyncOrderedQueue,me as BUILD_VERSION,Q as Cache,A as Dictionary,ee as DictionaryNoCase,C as Dispatch,I as Edge,te as Graph,re as Graph2,v as GraphItem,D as Level,q as Logging,O as Message,ae as Observable,xe as PKG_NAME,Ee as PKG_VERSION,B as SAXStackParser,K as ScopedLogging,x as Stack,he as StateObject,m as Subgraph,S as Vertex,G as XMLNode,Ze as cartesianToPolar,at as classID2Meta,ye as compare,M as compare2,ke as debounce,T as deepEquals,oe as deepMixin,nt as deepMixinT,Je as degreesToRadians,vt as dirname,_e as endsWith,Fe as espTime2Seconds,st as exists,Se as find,Ke as getScriptSrc,E as hashSum,ge as inner,ot as isArray,Ue as isBrowser,qe as isCI,R as isNode,be as join,l as logger,ie as normalize,tt as normalizeDegrees,et as normalizeRadians,Ye as polarToCartesian,Pe as promiseTimeout,Qe as radiansToDegrees,P as root,it as safeStringify,We as scopedLogger,De as sleep,Et as trim,Ne as update,se as verboseDeepEquals,lt as xml2json};
 //# sourceMappingURL=index.js.map