@hpcc-js/util 2.42.0 → 2.44.0

package/dist/index.js

@@ -1,12 +1,12 @@
 (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';
+    (global = global || self, factory(global['@hpcc-js/util'] = {}));
+}(this, (function (exports) { 'use strict';
 
     var PKG_NAME = "@hpcc-js/util";
-    var PKG_VERSION = "2.42.0";
-    var BUILD_VERSION = "2.97.0";
+    var PKG_VERSION = "2.44.0";
+    var BUILD_VERSION = "2.99.0";
 
     /*! *****************************************************************************
     Copyright (c) Microsoft Corporation.
@@ -95,7 +95,7 @@
                 ar[i] = from[i];
             }
         }
-        return to.concat(ar || Array.prototype.slice.call(from));
+        return to.concat(ar || from);
     }
 
     // Based on:  https://tc39.github.io/ecma262/#sec-array.prototype.find
@@ -134,7 +134,7 @@
         var retVal = {
             update: [],
             exit: [],
-            enter: __spreadArray([], after, true)
+            enter: __spreadArray([], after)
         };
         for (var _i = 0, before_1 = before; _i < before_1.length; _i++) {
             var row = before_1[_i];
@@ -465,7 +465,7 @@
         return (days * 24 * 60 * 60) + secs;
     }
 
-    var GraphItem$1 = /** @class */ (function () {
+    var GraphItem = /** @class */ (function () {
         function GraphItem(graph, parent) {
             this.props = {};
             this._graph = graph;
@@ -473,7 +473,7 @@
         }
         return GraphItem;
     }());
-    var Subgraph$1 = /** @class */ (function (_super) {
+    var Subgraph = /** @class */ (function (_super) {
         __extends(Subgraph, _super);
         function Subgraph(graph, parent, _) {
             var _this = _super.call(this, graph, parent) || this;
@@ -552,7 +552,7 @@
             if (item instanceof Subgraph) {
                 this._addSubgraph(item);
             }
-            else if (item instanceof Vertex$1) {
+            else if (item instanceof Vertex) {
                 this._addVertex(item);
             }
             else {
@@ -560,8 +560,8 @@
             }
         };
         return Subgraph;
-    }(GraphItem$1));
-    var Vertex$1 = /** @class */ (function (_super) {
+    }(GraphItem));
+    var Vertex = /** @class */ (function (_super) {
         __extends(Vertex, _super);
         function Vertex(graph, parent, _) {
             var _this = _super.call(this, graph, parent) || this;
@@ -573,7 +573,7 @@
         }
         Object.defineProperty(Vertex.prototype, "edges", {
             get: function () {
-                return __spreadArray(__spreadArray([], this.inEdges, true), this.outEdges, true);
+                return __spreadArray(__spreadArray([], this.inEdges), this.outEdges);
             },
             enumerable: false,
             configurable: true
@@ -603,8 +603,8 @@
             this.outEdges.splice(idx, 1);
         };
         return Vertex;
-    }(GraphItem$1));
-    var Edge$1 = /** @class */ (function (_super) {
+    }(GraphItem));
+    var Edge = /** @class */ (function (_super) {
         __extends(Edge, _super);
         function Edge(graph, parent, source, target, _) {
             var _this = _super.call(this, graph, parent) || this;
@@ -626,7 +626,7 @@
             this._graph.removeEdge(this);
         };
         return Edge;
-    }(GraphItem$1));
+    }(GraphItem));
     var Graph = /** @class */ (function () {
         function Graph(idOf, _) {
             if (idOf === void 0) { idOf = function (item) { return "" + item._; }; }
@@ -636,11 +636,11 @@
             this._allVerticesMap = {};
             this._allEdges = [];
             this._allEdgesMap = {};
-            this.root = new Subgraph$1(this, null, _);
+            this.root = new Subgraph(this, null, _);
             this.idOf = idOf;
         }
         Graph.prototype.createSubgraph = function (parent, _) {
-            var retVal = new Subgraph$1(this, parent || this.root, _);
+            var retVal = new Subgraph(this, parent || this.root, _);
             this._allSubgraphs.push(retVal);
             this._allSubgraphsMap[this.idOf(retVal)] = retVal;
             return retVal;
@@ -672,7 +672,7 @@
             return this._allSubgraphsMap[id];
         };
         Graph.prototype.createVertex = function (parent, _) {
-            var retVal = new Vertex$1(this, parent, _);
+            var retVal = new Vertex(this, parent, _);
             this._allVertices.push(retVal);
             this._allVerticesMap[this.idOf(retVal)] = retVal;
             return retVal;
@@ -710,7 +710,7 @@
             return this._allVerticesMap[id];
         };
         Graph.prototype.createEdge = function (parent, source, target, _) {
-            var retVal = new Edge$1(this, parent, source, target, _);
+            var retVal = new Edge(this, parent, source, target, _);
             this._allEdges.push(retVal);
             this._allEdgesMap[this.idOf(retVal)] = retVal;
             return retVal;
@@ -772,13 +772,13 @@
             map.put(this.root, retVal.root);
             this.walk(function (item) {
                 var parent = map.get(item.parent);
-                if (item instanceof Subgraph$1) {
+                if (item instanceof Subgraph) {
                     map.put(item, parent.createSubgraph(item._));
                 }
-                else if (item instanceof Vertex$1) {
+                else if (item instanceof Vertex) {
                     map.put(item, parent.createVertex(item._));
                 }
-                else if (item instanceof Edge$1) {
+                else if (item instanceof Edge) {
                     var source = map.get(item.source);
                     var target = map.get(item.target);
                     parent.createEdge(source, target, item._);
@@ -808,7 +808,7 @@
         };
     }
 
-    var GraphItem = /** @class */ (function () {
+    var GraphItem$1 = /** @class */ (function () {
         function GraphItem(g, _) {
             this._graph = g;
             this._ = _;
@@ -845,8 +845,8 @@
             return this;
         };
         return ChildGraphItem;
-    }(GraphItem));
-    var Subgraph = /** @class */ (function (_super) {
+    }(GraphItem$1));
+    var Subgraph$1 = /** @class */ (function (_super) {
         __extends(Subgraph, _super);
         function Subgraph(g, _) {
             var _this = _super.call(this, g, _) || this;
@@ -864,7 +864,7 @@
         };
         return Subgraph;
     }(ChildGraphItem));
-    var Vertex = /** @class */ (function (_super) {
+    var Vertex$1 = /** @class */ (function (_super) {
         __extends(Vertex, _super);
         function Vertex(g, _) {
             var _this = _super.call(this, g, _) || this;
@@ -873,7 +873,7 @@
             return _this;
         }
         Vertex.prototype.edges = function () {
-            return __spreadArray(__spreadArray([], this._inEdges, true), this._outEdges, true);
+            return __spreadArray(__spreadArray([], this._inEdges), this._outEdges);
         };
         Vertex.prototype.edgeCount = function () {
             return this._outEdges.length + this._inEdges.length;
@@ -898,7 +898,7 @@
         };
         return Vertex;
     }(ChildGraphItem));
-    var Edge = /** @class */ (function (_super) {
+    var Edge$1 = /** @class */ (function (_super) {
         __extends(Edge, _super);
         function Edge(g, _, source, target) {
             var _this = _super.call(this, g, _) || this;
@@ -976,7 +976,7 @@
             return this.edgeExists(this.id(_));
         };
         Graph2.prototype.allItems = function () {
-            return __spreadArray(__spreadArray(__spreadArray([], this.allSubgraphs(), true), this.allVertices(), true), this.allEdges(), true);
+            return __spreadArray(__spreadArray(__spreadArray([], this.allSubgraphs()), this.allVertices()), this.allEdges());
         };
         Graph2.prototype.item = function (id) {
             if (this.subgraphExists(id))
@@ -1028,12 +1028,12 @@
         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);
+                throw new Error("Subgraph '" + s_id + "' already exists.");
+            var subgraph = new Subgraph$1(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."));
+                    throw new Error("Subgraph '" + p_id + "' does not exist.");
                 subgraph.parent(this._subgraphMap[p_id]);
             }
             this._subgraphMap[s_id] = subgraph;
@@ -1052,7 +1052,7 @@
             var sg_id = this._idFunc(sg);
             var subgraph = this._subgraphMap[sg_id];
             if (!subgraph)
-                throw new Error("Subgraph '".concat(sg_id, "' does not exist."));
+                throw new Error("Subgraph '" + sg_id + "' does not exist.");
             subgraph._ = sg;
             return this;
         };
@@ -1061,13 +1061,13 @@
             if (promoteChildren === void 0) { promoteChildren = true; }
             var sg = this._subgraphMap[id];
             if (!sg)
-                throw new Error("Subgraph '".concat(id, "' does not exist."));
+                throw new Error("Subgraph '" + id + "' does not exist.");
             sg.children().forEach(function (child) {
                 if (promoteChildren) {
                     child.parent(sg.parent());
                 }
                 else {
-                    if (child instanceof Subgraph) {
+                    if (child instanceof Subgraph$1) {
                         _this.removeSubgraph(child.id());
                     }
                     else {
@@ -1081,14 +1081,14 @@
         Graph2.prototype.subgraphParent = function (id, parentID) {
             var item = this._subgraphMap[id];
             if (!item)
-                throw new Error("Subgraph '".concat(id, "' does not exist."));
+                throw new Error("Subgraph '" + 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."));
+                throw new Error("Vertex parent '" + parent + "' does not exist.");
             item.parent(parent);
             return this;
         };
@@ -1141,7 +1141,7 @@
             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);
+            return __spreadArray(__spreadArray([], this._vertexMap[id].outEdges().map(function (e) { return e._target; })), this._vertexMap[id].inEdges().map(function (e) { return e._source; }));
         };
         Graph2.prototype.neighbors = function (id) {
             return this._neighbors(id).map(function (n) { return n._; });
@@ -1152,12 +1152,12 @@
         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);
+                throw new Error("Vertex '" + v_id + "' already exists.");
+            var vertex = new Vertex$1(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."));
+                    throw new Error("Subgraph '" + p_id + "' does not exist.");
                 vertex.parent(this._subgraphMap[p_id]);
             }
             this._vertexMap[v_id] = vertex;
@@ -1175,7 +1175,7 @@
             var v_id = this._idFunc(v);
             var vertex = this._vertexMap[v_id];
             if (!vertex)
-                throw new Error("Vertex '".concat(v_id, "' does not exist."));
+                throw new Error("Vertex '" + v_id + "' does not exist.");
             vertex._ = v;
             return this;
         };
@@ -1183,7 +1183,7 @@
             var _this = this;
             var v = this._vertexMap[id];
             if (!v)
-                throw new Error("Vertex '".concat(id, "' does not exist."));
+                throw new Error("Vertex '" + id + "' does not exist.");
             v.edges().forEach(function (e) {
                 _this.removeEdge(e.id());
             });
@@ -1193,14 +1193,14 @@
         Graph2.prototype.vertexParent = function (id, parentID) {
             var item = this._vertexMap[id];
             if (!item)
-                throw new Error("Vertex '".concat(id, "' does not exist."));
+                throw new Error("Vertex '" + 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."));
+                throw new Error("Vertex parent '" + parent + "' does not exist.");
             item.parent(parent);
             return this;
         };
@@ -1216,16 +1216,16 @@
             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."));
+                throw new Error("Edge '" + e_id + "' already exists.");
             if (!this.vertexExists(e_source))
-                throw new Error("Edge Source '".concat(e_source, "' does not exist."));
+                throw new Error("Edge Source '" + 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]);
+                throw new Error("Edge Target '" + e_target + "' does not exist.");
+            var edge = new Edge$1(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."));
+                    throw new Error("Subgraph '" + p_id + "' does not exist.");
                 edge.parent(this._subgraphMap[p_id]);
             }
             this._edgeMap[e_id] = edge;
@@ -1245,28 +1245,28 @@
             var e_id = this._idFunc(e);
             var edge = this._edgeMap[e_id];
             if (!edge)
-                throw new Error("Edge '".concat(e_id, "' does not exist."));
+                throw new Error("Edge '" + e_id + "' does not exist.");
             edge._ = e;
             return this;
         };
         Graph2.prototype.removeEdge = function (id) {
             var e = this._edgeMap[id];
             if (!e)
-                throw new Error("Edge '".concat(id, "' does not exist."));
+                throw new Error("Edge '" + 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."));
+                throw new Error("Edge Source'" + 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."));
+                throw new Error("Edge Target'" + 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) {
+            if (item instanceof Subgraph$1) {
                 return formatter("subgraph", item._, item.children().map(function (child) { return _this._hwalk(child, formatter); }));
             }
             else {
@@ -1361,7 +1361,7 @@
                 ancestors.push(vertex);
                 vertex.outEdges().forEach(function (e) {
                     if (ancestors.indexOf(e._target) < 0) {
-                        visit(e._target, __spreadArray([], ancestors, true));
+                        visit(e._target, __spreadArray([], ancestors));
                     }
                 });
                 retVal.unshift(vertex._);
@@ -1409,15 +1409,15 @@
         return Set;
     }());
 
-    var isArray$1 = Array.isArray;
+    var isArray = Array.isArray;
     var keyList = Object.keys;
     var hasProp = Object.prototype.hasOwnProperty;
     function deepEquals(a, b) {
         if (a === b)
             return true;
         if (a && b && typeof a === "object" && typeof b === "object") {
-            var arrA = isArray$1(a);
-            var arrB = isArray$1(b);
+            var arrA = isArray(a);
+            var arrB = isArray(b);
             var i = void 0;
             var length_1;
             var key = void 0;
@@ -1523,7 +1523,6 @@
         return Stack;
     }());
 
-    exports.Level = void 0;
     (function (Level) {
         Level[Level["debug"] = 0] = "debug";
         Level[Level["info"] = 1] = "info";
@@ -1549,10 +1548,10 @@
         }
         ConsoleWriter.prototype.write = function (dateTime, level, id, msg) {
             if (isNode) {
-                console.log("[".concat(dateTime, "] ").concat(exports.Level[level].toUpperCase(), " ").concat(id, ":  ").concat(msg));
+                console.log("[" + dateTime + "] " + exports.Level[level].toUpperCase() + " " + id + ":  " + msg);
             }
             else {
-                console.log("[".concat(dateTime, "] %c").concat(exports.Level[level].toUpperCase(), "%c ").concat(id, ":  ").concat(msg), "color:".concat(colours[exports.Level[level]]), "");
+                console.log("[" + dateTime + "] %c" + exports.Level[level].toUpperCase() + "%c " + id + ":  " + msg, "color:" + colours[exports.Level[level]], "");
             }
         };
         return ConsoleWriter;
@@ -1849,7 +1848,7 @@
             sources[_i - 1] = arguments[_i];
         }
         if (typeof dest !== "object")
-            throw new Error("Destination \"".concat(dest, "\" must be an object."));
+            throw new Error("Destination \"" + 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);
@@ -1871,7 +1870,7 @@
         for (var _i = 1; _i < arguments.length; _i++) {
             sources[_i - 1] = arguments[_i];
         }
-        return deepMixin.apply(void 0, __spreadArray([dest], sources, false));
+        return deepMixin.apply(void 0, __spreadArray([dest], sources));
     }
     /**
      * safeStingify - JSONsimilar to .stringify, except ignores circular references.
@@ -1891,7 +1890,7 @@
             return value;
         });
     }
-    function isArray(arg) {
+    function isArray$1(arg) {
         if (Array.isArray !== undefined) {
             return Array.isArray(arg);
         }
@@ -1901,7 +1900,7 @@
         var info = classID.split("_");
         var classInfo = info[1].split(".");
         return {
-            module: "@hpcc-js/".concat(info[0]),
+            module: "@hpcc-js/" + info[0],
             file: classInfo[0],
             class: classInfo[1] || classInfo[0]
         };
@@ -2396,7 +2395,7 @@
             }
             // Remove trailing slashes.
             segment = segment.replace(/\/$/, "");
-            return __spreadArray(__spreadArray([], parts, true), segment.split("/"), true);
+            return __spreadArray(__spreadArray([], parts), segment.split("/"));
         }, []);
         var resultParts = [];
         for (var _a = 0, parts_1 = parts; _a < parts_1.length; _a++) {
@@ -2423,10 +2422,10 @@
     exports.Dictionary = Dictionary;
     exports.DictionaryNoCase = DictionaryNoCase;
     exports.Dispatch = Dispatch;
-    exports.Edge = Edge$1;
+    exports.Edge = Edge;
     exports.Graph = Graph;
     exports.Graph2 = Graph2;
-    exports.GraphItem = GraphItem$1;
+    exports.GraphItem = GraphItem;
     exports.Logging = Logging;
     exports.Message = Message;
     exports.Observable = Observable;
@@ -2436,8 +2435,8 @@
     exports.ScopedLogging = ScopedLogging;
     exports.Stack = Stack;
     exports.StateObject = StateObject;
-    exports.Subgraph = Subgraph$1;
-    exports.Vertex = Vertex$1;
+    exports.Subgraph = Subgraph;
+    exports.Vertex = Vertex;
     exports.XMLNode = XMLNode;
     exports.cartesianToPolar = cartesianToPolar;
     exports.classID2Meta = classID2Meta;
@@ -2456,7 +2455,7 @@
     exports.getScriptSrc = getScriptSrc;
     exports.hashSum = hashSum;
     exports.inner = inner;
-    exports.isArray = isArray;
+    exports.isArray = isArray$1;
     exports.isBrowser = isBrowser;
     exports.isCI = isCI;
     exports.isNode = isNode;
@@ -2478,5 +2477,5 @@
 
     Object.defineProperty(exports, '__esModule', { value: true });
 
-}));
+})));
 //# sourceMappingURL=index.js.map