@gpa-gemstone/react-graph 1.0.51 → 1.0.52

package/lib/PointNode.d.ts

@@ -1,31 +1,31 @@
-/**
- *
- * Node in a tree.
- */
-export declare class PointNode {
-    minT: number;
-    maxT: number;
-    minV: number[];
-    maxV: number[];
-    avgV: number[];
-    dim: number;
-    private children;
-    private points;
-    constructor(data: [...number[]][]);
-    GetData(Tstart: number, Tend: number, IncludeEdges?: boolean): [...number[]][];
-    GetFullData(): [...number[]][];
-    GetAllLimits(Tstart: number, Tend: number): [number, number][];
-    GetLimits(Tstart: number, Tend: number, dimension?: number): [number, number];
-    /**
-     * Retrieves a point from the PointNode tree
-     * @param {number} tVal - The time value of the point to retrieve from the tree.
-     */
-    GetPoint(tVal: number): [...number[]];
-    /**
-     * Retrieves a specified number of points from the PointNode tree, centered around a point
-     * @param {number} tVal - The time value of the center point of the point retrieval.
-     * @param {number} pointsRetrieved - The number of points to retrieve
-     */
-    GetPoints(tVal: number, pointsRetrieved?: number): [...number[]][];
-    private PointBinarySearch;
-}
+/**
+ *
+ * Node in a tree.
+ */
+export declare class PointNode {
+    minT: number;
+    maxT: number;
+    minV: number[];
+    maxV: number[];
+    avgV: number[];
+    dim: number;
+    private children;
+    private points;
+    constructor(data: [...number[]][]);
+    GetData(Tstart: number, Tend: number, IncludeEdges?: boolean): [...number[]][];
+    GetFullData(): [...number[]][];
+    GetAllLimits(Tstart: number, Tend: number): [number, number][];
+    GetLimits(Tstart: number, Tend: number, dimension?: number): [number, number];
+    /**
+     * Retrieves a point from the PointNode tree
+     * @param {number} tVal - The time value of the point to retrieve from the tree.
+     */
+    GetPoint(tVal: number): [...number[]];
+    /**
+     * Retrieves a specified number of points from the PointNode tree, centered around a point
+     * @param {number} tVal - The time value of the center point of the point retrieval.
+     * @param {number} pointsRetrieved - The number of points to retrieve
+     */
+    GetPoints(tVal: number, pointsRetrieved?: number): [...number[]][];
+    private PointBinarySearch;
+}

package/lib/PointNode.js

@@ -1,254 +1,254 @@
-"use strict";
-// ******************************************************************************************************
-//  PointNode.tsx - Gbtc
-//
-//  Copyright © 2020, Grid Protection Alliance.  All Rights Reserved.
-//
-//  Licensed to the Grid Protection Alliance (GPA) under one or more contributor license agreements. See
-//  the NOTICE file distributed with this work for additional information regarding copyright ownership.
-//  The GPA licenses this file to you under the MIT License (MIT), the "License"; you may not use this
-//  file except in compliance with the License. You may obtain a copy of the License at:
-//
-//      http://opensource.org/licenses/MIT
-//
-//  Unless agreed to in writing, the subject software distributed under the License is distributed on an
-//  "AS-IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. Refer to the
-//  License for the specific language governing permissions and limitations.
-//
-//  Code Modification History:
-//  ----------------------------------------------------------------------------------------------------
-//  03/18/2021 - C Lackner
-//       Generated original version of source code.
-//
-// ******************************************************************************************************
-var __read = (this && this.__read) || function (o, n) {
-    var m = typeof Symbol === "function" && o[Symbol.iterator];
-    if (!m) return o;
-    var i = m.call(o), r, ar = [], e;
-    try {
-        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
-    }
-    catch (error) { e = { error: error }; }
-    finally {
-        try {
-            if (r && !r.done && (m = i["return"])) m.call(i);
-        }
-        finally { if (e) throw e.error; }
-    }
-    return ar;
-};
-var __spreadArray = (this && this.__spreadArray) || function (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));
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PointNode = void 0;
-var MaxPoints = 20;
-/**
- *
- * Node in a tree.
- */
-var PointNode = /** @class */ (function () {
-    function PointNode(data) {
-        var _this = this;
-        this.dim = data[0].length;
-        // That minimum time stamp that fits in this bucket
-        this.minT = data[0][0];
-        // The maximum time stamp that might fit in this bucket
-        this.maxT = data[data.length - 1][0];
-        // Intializing other vars
-        this.avgV = Array(this.dim - 1).fill(0);
-        this.minV = Array(this.dim - 1).fill(0);
-        this.maxV = Array(this.dim - 1).fill(0);
-        this.children = null;
-        this.points = null;
-        if (data.length <= MaxPoints) {
-            if (data.some(function (point) { return point.length != _this.dim; }))
-                throw new TypeError("Jagged data passed to PointNode. All points should all be " + this.dim + " dimensions.");
-            this.points = data;
-            var _loop_1 = function (index_1) {
-                this_1.minV[index_1 - 1] = Math.min.apply(Math, __spreadArray([], __read(data.filter(function (pt) { return !isNaN(pt[index_1]); }).map(function (pt) { return pt[index_1]; })), false));
-            };
-            var this_1 = this;
-            for (var index_1 = 1; index_1 < this.dim; index_1++) {
-                _loop_1(index_1);
-            }
-            var _loop_2 = function (index_2) {
-                this_2.maxV[index_2 - 1] = Math.max.apply(Math, __spreadArray([], __read(data.filter(function (pt) { return !isNaN(pt[index_2]); }).map(function (pt) { return pt[index_2]; })), false));
-            };
-            var this_2 = this;
-            for (var index_2 = 1; index_2 < this.dim; index_2++) {
-                _loop_2(index_2);
-            }
-            return;
-        }
-        var nLevel = Math.floor(Math.pow(data.length, 1 / MaxPoints));
-        var blockSize = nLevel * MaxPoints;
-        var index = 0;
-        this.children = [];
-        while (index < data.length) {
-            this.children.push(new PointNode(data.slice(index, index + blockSize)));
-            index = index + blockSize;
-        }
-        var _loop_3 = function (index_3) {
-            this_3.minV[index_3] = Math.min.apply(Math, __spreadArray([], __read(this_3.children.map(function (node) { return node.minV[index_3]; })), false));
-        };
-        var this_3 = this;
-        for (var index_3 = 0; index_3 < this.dim - 1; index_3++) {
-            _loop_3(index_3);
-        }
-        var _loop_4 = function (index_4) {
-            this_4.maxV[index_4] = Math.max.apply(Math, __spreadArray([], __read(this_4.children.map(function (node) { return node.maxV[index_4]; })), false));
-        };
-        var this_4 = this;
-        for (var index_4 = 0; index_4 < this.dim - 1; index_4++) {
-            _loop_4(index_4);
-        }
-    }
-    PointNode.prototype.GetData = function (Tstart, Tend, IncludeEdges) {
-        var _this = this;
-        if (this.points != null && Tstart <= this.minT && Tend >= this.maxT)
-            return this.points;
-        if (this.points != null && IncludeEdges !== undefined && IncludeEdges)
-            return this.points.filter(function (pt, i) {
-                var _a, _b;
-                return (pt[0] >= Tstart && pt[0] <= Tend) ||
-                    i < (((_b = (_a = _this.points) === null || _a === void 0 ? void 0 : _a.length) !== null && _b !== void 0 ? _b : 0) - 1) && (_this.points != null ? _this.points[i + 1][0] : 0) >= Tstart ||
-                    i > 0 && (_this.points != null ? _this.points[i - 1][0] : 0) <= Tend;
-            });
-        if (this.points != null)
-            return this.points.filter(function (pt) { return pt[0] >= Tstart && pt[0] <= Tend; });
-        var result = [];
-        return result.concat.apply(result, __spreadArray([], __read(this.children.filter(function (node) {
-            return (node.minT <= Tstart && node.maxT > Tstart) ||
-                (node.maxT >= Tend && node.minT < Tend) ||
-                (node.minT >= Tstart && node.maxT <= Tend);
-        }).map(function (node) { return node.GetData(Tstart, Tend, IncludeEdges); })), false));
-    };
-    PointNode.prototype.GetFullData = function () {
-        return this.GetData(this.minT, this.maxT);
-    };
-    PointNode.prototype.GetAllLimits = function (Tstart, Tend) {
-        var result = Array(this.dim - 1);
-        for (var index = 0; index < this.dim - 1; index++)
-            result[index] = this.GetLimits(Tstart, Tend, index);
-        return result;
-    };
-    // Note: Dimension indexing does not include time, I.E. in (x,y), y would be dimension 0;
-    PointNode.prototype.GetLimits = function (Tstart, Tend, dimension) {
-        var currentIndex = dimension !== null && dimension !== void 0 ? dimension : 0;
-        var max = this.maxV[currentIndex];
-        var min = this.minV[currentIndex];
-        if (this.points == null && !(Tstart <= this.minT && Tend > this.maxT)) {
-            // Array represents all limits of buckets
-            var limits = this.children.filter(function (n) { return n.maxT > Tstart && n.minT < Tend; }).map(function (n) { return n.GetLimits(Tstart, Tend, currentIndex); });
-            min = Math.min.apply(Math, __spreadArray([], __read(limits.map(function (pt) { return pt[0]; })), false));
-            max = Math.max.apply(Math, __spreadArray([], __read(limits.map(function (pt) { return pt[1]; })), false));
-        }
-        if (this.points != null && !(Tstart <= this.minT && Tend > this.maxT)) {
-            // Array represents all numbers within this bucket that fall in range
-            var limits = this.points.filter(function (pt) { return pt[0] > Tstart && pt[0] < Tend; }).map(function (pt) { return pt[currentIndex + 1]; });
-            min = Math.min.apply(Math, __spreadArray([], __read(limits), false));
-            max = Math.max.apply(Math, __spreadArray([], __read(limits), false));
-        }
-        return [min, max];
-    };
-    /**
-     * Retrieves a point from the PointNode tree
-     * @param {number} tVal - The time value of the point to retrieve from the tree.
-     */
-    PointNode.prototype.GetPoint = function (tVal) {
-        return this.PointBinarySearch(tVal, 1)[0];
-    };
-    /**
-     * Retrieves a specified number of points from the PointNode tree, centered around a point
-     * @param {number} tVal - The time value of the center point of the point retrieval.
-     * @param {number} pointsRetrieved - The number of points to retrieve
-     */
-    PointNode.prototype.GetPoints = function (tVal, pointsRetrieved) {
-        if (pointsRetrieved === void 0) { pointsRetrieved = 1; }
-        return this.PointBinarySearch(tVal, pointsRetrieved);
-    };
-    PointNode.prototype.PointBinarySearch = function (tVal, pointsRetrieved, bucketLowerNeighbor, bucketUpperNeighbor) {
-        if (pointsRetrieved === void 0) { pointsRetrieved = 1; }
-        if (pointsRetrieved <= 0)
-            throw new RangeError("Requested number of points must be positive value.");
-        // round tVal back to whole integer 
-        if (this.points !== null) {
-            // if the tVal is less than the minimum value of the subsection, return the first point
-            if (tVal < this.minT) {
-                var spillOver = pointsRetrieved - this.points.length;
-                var spillOverPoints = (spillOver > 0 && bucketUpperNeighbor !== undefined) ? bucketUpperNeighbor.PointBinarySearch(tVal, spillOver, this, undefined) : [];
-                return this.points.slice(0, pointsRetrieved).concat(spillOverPoints);
-            }
-            // if the tVal is greater than the largest value of the subsection, return the last point
-            if (tVal > this.maxT) {
-                var spillOver = pointsRetrieved - this.points.length;
-                var spillOverPoints = (spillOver > 0 && bucketLowerNeighbor !== undefined) ? bucketLowerNeighbor.PointBinarySearch(tVal, spillOver, undefined, this) : [];
-                return spillOverPoints.concat(this.points.slice(-pointsRetrieved));
-            }
-            // Otherwise, perform binary search
-            var upper = this.points.length - 1;
-            var lower = 0;
-            var Tlower = this.minT;
-            var Tupper = this.maxT;
-            while (Tupper !== tVal && Tlower !== tVal && upper !== lower && Tupper !== Tlower) {
-                var center = Math.round((upper + lower) / 2);
-                var Tcenter = this.points[center][0];
-                if (center === upper || center === lower)
-                    break;
-                if (Tcenter <= tVal)
-                    lower = center;
-                if (Tcenter > tVal)
-                    upper = center;
-                Tupper = this.points[upper][0];
-                Tlower = this.points[lower][0];
-            }
-            var upperPoints = Math.floor(pointsRetrieved / 2);
-            var lowerPoints = upperPoints;
-            // Adjustment for even number of points
-            var sidingAdjust = pointsRetrieved % 2 === 0 ? 1 : 0;
-            var centerIndex = void 0;
-            if (Math.abs(tVal - Tlower) < Math.abs(tVal - Tupper)) {
-                centerIndex = lower;
-                lowerPoints -= sidingAdjust;
-            }
-            else {
-                centerIndex = upper;
-                upperPoints -= sidingAdjust;
-            }
-            // Note: If we have spillover and no neighbor on the spillover side, then we discard the idea of spillover, and just return as many as we can on that side
-            var upperSpillOver = centerIndex + upperPoints + 1 - this.points.length;
-            var upperNeighborPoints = (upperSpillOver > 0 && bucketUpperNeighbor !== undefined) ? bucketUpperNeighbor.PointBinarySearch(tVal, upperSpillOver, this, undefined) : [];
-            var lowerSpillOver = lowerPoints - centerIndex;
-            var lowerNeighborPoints = (lowerSpillOver > 0 && bucketLowerNeighbor !== undefined) ? bucketLowerNeighbor.PointBinarySearch(tVal, lowerSpillOver, undefined, this) : [];
-            return lowerNeighborPoints.concat(this.points.slice(Math.max(centerIndex - lowerPoints, 0), Math.min(centerIndex + upperPoints + 1, this.points.length))).concat(upperNeighborPoints);
-        }
-        else if (this.children !== null) {
-            var childIndex = -1;
-            // if the subsection is null, and the tVal is less than the minimum value of the subsection, ??Start over again looking for the point in the first subsection??
-            if (tVal < this.minT)
-                childIndex = 0;
-            else if (tVal > this.maxT)
-                childIndex = this.children.length - 1;
-            else
-                childIndex = this.children.findIndex(function (n) { return n.maxT > tVal; });
-            if (childIndex === -1)
-                throw new RangeError("Could not find child bucket with point that has a time value of " + tVal);
-            // Find neighbors
-            var upperNeighbor = childIndex !== this.children.length - 1 ? this.children[childIndex + 1] : undefined;
-            var lowerNeighbor = childIndex !== 0 ? this.children[childIndex - 1] : undefined;
-            return this.children[childIndex].PointBinarySearch(tVal, pointsRetrieved, lowerNeighbor, upperNeighbor);
-        }
-        else
-            throw new RangeError("Both children and points are null for PointNode, unabled to find point with time value of " + tVal);
-    };
-    return PointNode;
-}());
-exports.PointNode = PointNode;
-//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"PointNode.js","sourceRoot":"","sources":["../src/PointNode.tsx"],"names":[],"mappings":";AAAA,yGAAyG;AACzG,wBAAwB;AACxB,EAAE;AACF,qEAAqE;AACrE,EAAE;AACF,wGAAwG;AACxG,wGAAwG;AACxG,sGAAsG;AACtG,wFAAwF;AACxF,EAAE;AACF,0CAA0C;AAC1C,EAAE;AACF,wGAAwG;AACxG,wGAAwG;AACxG,4EAA4E;AAC5E,EAAE;AACF,8BAA8B;AAC9B,wGAAwG;AACxG,0BAA0B;AAC1B,mDAAmD;AACnD,EAAE;AACF,yGAAyG;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEzG,IAAM,SAAS,GAAG,EAAE,CAAC;AAErB;;;GAGG;AACH;IAYI,mBAAY,IAAqB;QAAjC,iBAgCC;QA/BG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC1B,mDAAmD;QACnD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,uDAAuD;QACvD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,yBAAyB;QACzB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QAEnB,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS,EAAE;YAC1B,IAAI,IAAI,CAAC,IAAI,CAAC,UAAC,KAAK,IAAI,OAAA,KAAK,CAAC,MAAM,IAAI,KAAI,CAAC,GAAG,EAAxB,CAAwB,CAAC;gBAAE,MAAM,IAAI,SAAS,CAAC,+DAA6D,IAAI,CAAC,GAAG,iBAAc,CAAC,CAAA;YAC3J,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;oCACV,OAAK;gBAAiC,OAAK,IAAI,CAAC,OAAK,GAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,IAAI,CAAC,MAAM,CAAC,UAAA,EAAE,IAAI,OAAA,CAAC,KAAK,CAAC,EAAE,CAAC,OAAK,CAAC,CAAC,EAAjB,CAAiB,CAAC,CAAC,GAAG,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,OAAK,CAAC,EAAT,CAAS,CAAC,UAAC,CAAC;;;YAA3I,KAAK,IAAI,OAAK,GAAG,CAAC,EAAE,OAAK,GAAG,IAAI,CAAC,GAAG,EAAE,OAAK,EAAE;wBAApC,OAAK;aAA6H;oCAClI,OAAK;gBAAiC,OAAK,IAAI,CAAC,OAAK,GAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,IAAI,CAAC,MAAM,CAAC,UAAA,EAAE,IAAI,OAAA,CAAC,KAAK,CAAC,EAAE,CAAC,OAAK,CAAC,CAAC,EAAjB,CAAiB,CAAC,CAAC,GAAG,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,OAAK,CAAC,EAAT,CAAS,CAAC,UAAC,CAAC;;;YAA3I,KAAK,IAAI,OAAK,GAAG,CAAC,EAAE,OAAK,GAAG,IAAI,CAAC,GAAG,EAAE,OAAK,EAAE;wBAApC,OAAK;aAA6H;YAC3I,OAAO;SACV;QAED,IAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;QAChE,IAAM,SAAS,GAAG,MAAM,GAAG,SAAS,CAAC;QAErC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE;YACxB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACxE,KAAK,GAAG,KAAK,GAAG,SAAS,CAAC;SAC7B;gCACQ,OAAK;YAAmC,OAAK,IAAI,CAAC,OAAK,CAAC,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,OAAK,QAAQ,CAAC,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,IAAI,CAAC,IAAI,CAAC,OAAK,CAAC,EAAhB,CAAgB,CAAC,UAAC,CAAC;;;QAA7H,KAAK,IAAI,OAAK,GAAG,CAAC,EAAE,OAAK,GAAG,IAAI,CAAC,GAAG,GAAC,CAAC,EAAE,OAAK,EAAE;oBAAtC,OAAK;SAA+G;gCACpH,OAAK;YAAmC,OAAK,IAAI,CAAC,OAAK,CAAC,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,OAAK,QAAQ,CAAC,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,IAAI,CAAC,IAAI,CAAC,OAAK,CAAC,EAAhB,CAAgB,CAAC,UAAC,CAAC;;;QAA7H,KAAK,IAAI,OAAK,GAAG,CAAC,EAAE,OAAK,GAAG,IAAI,CAAC,GAAG,GAAC,CAAC,EAAE,OAAK,EAAE;oBAAtC,OAAK;SAA+G;IACjI,CAAC;IAEM,2BAAO,GAAd,UAAe,MAAc,EAAE,IAAY,EAAE,YAAsB;QAAnE,iBAeC;QAdG,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI;YAC/D,OAAO,IAAI,CAAC,MAAM,CAAC;QACvB,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY;YACjE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAC,EAAE,EAAC,CAAC;;gBAAK,OAAA,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;oBAClE,CAAC,GAAG,CAAC,CAAC,MAAA,MAAA,KAAI,CAAC,MAAM,0CAAE,MAAM,mCAAI,CAAC,CAAC,GAAE,CAAC,CAAC,IAAI,CAAC,KAAI,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,KAAI,CAAC,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM;oBAChG,CAAC,GAAG,CAAC,IAAK,CAAC,KAAI,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,KAAI,CAAC,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAG,IAAI,CAAA;aAAA,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI;YACnB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAhC,CAAgC,CAAE,CAAC;QACvE,IAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,OAAO,MAAM,CAAC,MAAM,OAAb,MAAM,2BAAW,IAAI,CAAC,QAAS,CAAC,MAAM,CAAC,UAAA,IAAI;YAC9C,OAAA,CAAC,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;gBAC3C,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBACvC,CAAC,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QAF1C,CAE0C,CACzC,CAAC,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,YAAY,CAAC,EAAxC,CAAwC,CAAC,WAAE;IACjE,CAAC;IAEM,+BAAW,GAAlB;QACE,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;IAEM,gCAAY,GAAnB,UAAoB,MAAc,EAAE,IAAY;QAC5C,IAAM,MAAM,GAAuB,KAAK,CAAC,IAAI,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC;QACrD,KAAI,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,GAAG,GAAC,CAAC,EAAE,KAAK,EAAE;YAC1C,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACxD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,yFAAyF;IAClF,6BAAS,GAAhB,UAAiB,MAAc,EAAE,IAAY,EAAE,SAAkB;QAC/D,IAAM,YAAY,GAAG,SAAS,aAAT,SAAS,cAAT,SAAS,GAAI,CAAC,CAAC;QACpC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAClC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAElC,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE;YACrE,yCAAyC;YACzC,IAAM,MAAM,GAAG,IAAI,CAAC,QAAS,CAAC,MAAM,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,IAAI,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,GAAG,IAAI,EAAhC,CAAgC,CAAC,CAAC,GAAG,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,SAAS,CAAC,MAAM,EAAC,IAAI,EAAC,YAAY,CAAC,EAArC,CAAqC,CAAC,CAAC;YAC5H,GAAG,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,MAAM,CAAC,GAAG,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,CAAC,CAAC,EAAL,CAAK,CAAC,UAAC,CAAC;YAC3C,GAAG,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,MAAM,CAAC,GAAG,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,CAAC,CAAC,EAAL,CAAK,CAAC,UAAC,CAAC;SAC5C;QACD,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE;YACrE,qEAAqE;YACrE,IAAM,MAAM,GAAG,IAAI,CAAC,MAAO,CAAC,MAAM,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,EAA9B,CAA8B,CAAC,CAAC,GAAG,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,YAAY,GAAC,CAAC,CAAC,EAAlB,CAAkB,CAAC,CAAC;YACvG,GAAG,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,MAAM,UAAC,CAAC;YAC1B,GAAG,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,MAAM,UAAC,CAAC;SAC3B;QAED,OAAO,CAAC,GAAG,EAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,4BAAQ,GAAf,UAAgB,IAAY;QACxB,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;;;OAIG;IACI,6BAAS,GAAhB,UAAiB,IAAY,EAAE,eAAmB;QAAnB,gCAAA,EAAA,mBAAmB;QAC9C,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;IACzD,CAAC;IAEO,qCAAiB,GAAzB,UAA0B,IAAY,EAAE,eAAmB,EAAE,mBAA+B,EAAE,mBAA+B;QAArF,gCAAA,EAAA,mBAAmB;QACvD,IAAI,eAAe,IAAI,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,oDAAoD,CAAC,CAAC;QACrG,oCAAoC;QAEpC,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE;YACtB,uFAAuF;YACvF,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE;gBAClB,IAAM,SAAS,GAAG,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;gBACvD,IAAM,eAAe,GAAG,CAAC,SAAS,GAAG,CAAC,IAAI,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5J,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAC,eAAe,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;aACvE;YAED,yFAAyF;YACzF,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE;gBAClB,IAAM,SAAS,GAAG,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;gBACvD,IAAM,eAAe,GAAG,CAAC,SAAS,GAAG,CAAC,IAAI,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5J,OAAO,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC;aACtE;YAED,mCAAmC;YACnC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YACnC,IAAI,KAAK,GAAG,CAAC,CAAC;YAEd,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;YAEvB,OAAO,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,MAAM,KAAK,MAAM,EAAE;gBAC/E,IAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/C,IAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAEvC,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK;oBACpC,MAAM;gBACV,IAAI,OAAO,IAAI,IAAI;oBACf,KAAK,GAAG,MAAM,CAAC;gBACnB,IAAI,OAAO,GAAG,IAAI;oBACd,KAAK,GAAG,MAAM,CAAC;gBACnB,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/B,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;aAClC;YAED,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;YAClD,IAAI,WAAW,GAAG,WAAW,CAAC;YAC9B,uCAAuC;YACvC,IAAM,YAAY,GAAG,eAAe,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvD,IAAI,WAAW,SAAQ,CAAC;YACxB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,EAAE;gBACnD,WAAW,GAAG,KAAK,CAAC;gBACpB,WAAW,IAAI,YAAY,CAAC;aAC/B;iBAAM;gBACH,WAAW,GAAG,KAAK,CAAC;gBACpB,WAAW,IAAI,YAAY,CAAC;aAC/B;YAED,0JAA0J;YAC1J,IAAM,cAAc,GAAG,WAAW,GAAG,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC1E,IAAM,mBAAmB,GAAG,CAAC,cAAc,GAAG,CAAC,IAAI,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1K,IAAM,cAAc,GAAG,WAAW,GAAG,WAAW,CAAC;YACjD,IAAM,mBAAmB,GAAG,CAAC,cAAc,GAAG,CAAC,IAAI,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAE1K,OAAO,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,WAAW,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,WAAW,GAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;SAExL;aACI,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE;YAC7B,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;YACpB,+JAA+J;YAC/J,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI;gBAAE,UAAU,GAAG,CAAC,CAAC;iBAChC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI;gBAAE,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;;gBAC5D,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,IAAI,GAAG,IAAI,EAAb,CAAa,CAAC,CAAC;YAE9D,IAAI,UAAU,KAAK,CAAC,CAAC;gBAAE,MAAM,IAAI,UAAU,CAAC,qEAAmE,IAAM,CAAC,CAAC;YAEvH,iBAAiB;YACjB,IAAM,aAAa,GAAG,UAAU,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC1G,IAAM,aAAa,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACnF,OAAO,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,iBAAiB,CAAC,IAAI,EAAE,eAAe,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;SAC3G;;YACI,MAAM,IAAI,UAAU,CAAC,+FAA6F,IAAM,CAAC,CAAC;IACnI,CAAC;IACL,gBAAC;AAAD,CAAC,AA/LD,IA+LC;AA/LY,8BAAS"}
+"use strict";
+// ******************************************************************************************************
+//  PointNode.tsx - Gbtc
+//
+//  Copyright © 2020, Grid Protection Alliance.  All Rights Reserved.
+//
+//  Licensed to the Grid Protection Alliance (GPA) under one or more contributor license agreements. See
+//  the NOTICE file distributed with this work for additional information regarding copyright ownership.
+//  The GPA licenses this file to you under the MIT License (MIT), the "License"; you may not use this
+//  file except in compliance with the License. You may obtain a copy of the License at:
+//
+//      http://opensource.org/licenses/MIT
+//
+//  Unless agreed to in writing, the subject software distributed under the License is distributed on an
+//  "AS-IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. Refer to the
+//  License for the specific language governing permissions and limitations.
+//
+//  Code Modification History:
+//  ----------------------------------------------------------------------------------------------------
+//  03/18/2021 - C Lackner
+//       Generated original version of source code.
+//
+// ******************************************************************************************************
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (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));
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PointNode = void 0;
+var MaxPoints = 20;
+/**
+ *
+ * Node in a tree.
+ */
+var PointNode = /** @class */ (function () {
+    function PointNode(data) {
+        var _this = this;
+        this.dim = data[0].length;
+        // That minimum time stamp that fits in this bucket
+        this.minT = data[0][0];
+        // The maximum time stamp that might fit in this bucket
+        this.maxT = data[data.length - 1][0];
+        // Intializing other vars
+        this.avgV = Array(this.dim - 1).fill(0);
+        this.minV = Array(this.dim - 1).fill(0);
+        this.maxV = Array(this.dim - 1).fill(0);
+        this.children = null;
+        this.points = null;
+        if (data.length <= MaxPoints) {
+            if (data.some(function (point) { return point.length != _this.dim; }))
+                throw new TypeError("Jagged data passed to PointNode. All points should all be ".concat(this.dim, " dimensions."));
+            this.points = data;
+            var _loop_1 = function (index_1) {
+                this_1.minV[index_1 - 1] = Math.min.apply(Math, __spreadArray([], __read(data.filter(function (pt) { return !isNaN(pt[index_1]); }).map(function (pt) { return pt[index_1]; })), false));
+            };
+            var this_1 = this;
+            for (var index_1 = 1; index_1 < this.dim; index_1++) {
+                _loop_1(index_1);
+            }
+            var _loop_2 = function (index_2) {
+                this_2.maxV[index_2 - 1] = Math.max.apply(Math, __spreadArray([], __read(data.filter(function (pt) { return !isNaN(pt[index_2]); }).map(function (pt) { return pt[index_2]; })), false));
+            };
+            var this_2 = this;
+            for (var index_2 = 1; index_2 < this.dim; index_2++) {
+                _loop_2(index_2);
+            }
+            return;
+        }
+        var nLevel = Math.floor(Math.pow(data.length, 1 / MaxPoints));
+        var blockSize = nLevel * MaxPoints;
+        var index = 0;
+        this.children = [];
+        while (index < data.length) {
+            this.children.push(new PointNode(data.slice(index, index + blockSize)));
+            index = index + blockSize;
+        }
+        var _loop_3 = function (index_3) {
+            this_3.minV[index_3] = Math.min.apply(Math, __spreadArray([], __read(this_3.children.map(function (node) { return node.minV[index_3]; })), false));
+        };
+        var this_3 = this;
+        for (var index_3 = 0; index_3 < this.dim - 1; index_3++) {
+            _loop_3(index_3);
+        }
+        var _loop_4 = function (index_4) {
+            this_4.maxV[index_4] = Math.max.apply(Math, __spreadArray([], __read(this_4.children.map(function (node) { return node.maxV[index_4]; })), false));
+        };
+        var this_4 = this;
+        for (var index_4 = 0; index_4 < this.dim - 1; index_4++) {
+            _loop_4(index_4);
+        }
+    }
+    PointNode.prototype.GetData = function (Tstart, Tend, IncludeEdges) {
+        var _this = this;
+        if (this.points != null && Tstart <= this.minT && Tend >= this.maxT)
+            return this.points;
+        if (this.points != null && IncludeEdges !== undefined && IncludeEdges)
+            return this.points.filter(function (pt, i) {
+                var _a, _b;
+                return (pt[0] >= Tstart && pt[0] <= Tend) ||
+                    i < (((_b = (_a = _this.points) === null || _a === void 0 ? void 0 : _a.length) !== null && _b !== void 0 ? _b : 0) - 1) && (_this.points != null ? _this.points[i + 1][0] : 0) >= Tstart ||
+                    i > 0 && (_this.points != null ? _this.points[i - 1][0] : 0) <= Tend;
+            });
+        if (this.points != null)
+            return this.points.filter(function (pt) { return pt[0] >= Tstart && pt[0] <= Tend; });
+        var result = [];
+        return result.concat.apply(result, __spreadArray([], __read(this.children.filter(function (node) {
+            return (node.minT <= Tstart && node.maxT > Tstart) ||
+                (node.maxT >= Tend && node.minT < Tend) ||
+                (node.minT >= Tstart && node.maxT <= Tend);
+        }).map(function (node) { return node.GetData(Tstart, Tend, IncludeEdges); })), false));
+    };
+    PointNode.prototype.GetFullData = function () {
+        return this.GetData(this.minT, this.maxT);
+    };
+    PointNode.prototype.GetAllLimits = function (Tstart, Tend) {
+        var result = Array(this.dim - 1);
+        for (var index = 0; index < this.dim - 1; index++)
+            result[index] = this.GetLimits(Tstart, Tend, index);
+        return result;
+    };
+    // Note: Dimension indexing does not include time, I.E. in (x,y), y would be dimension 0;
+    PointNode.prototype.GetLimits = function (Tstart, Tend, dimension) {
+        var currentIndex = dimension !== null && dimension !== void 0 ? dimension : 0;
+        var max = this.maxV[currentIndex];
+        var min = this.minV[currentIndex];
+        if (this.points == null && !(Tstart <= this.minT && Tend > this.maxT)) {
+            // Array represents all limits of buckets
+            var limits = this.children.filter(function (n) { return n.maxT > Tstart && n.minT < Tend; }).map(function (n) { return n.GetLimits(Tstart, Tend, currentIndex); });
+            min = Math.min.apply(Math, __spreadArray([], __read(limits.map(function (pt) { return pt[0]; })), false));
+            max = Math.max.apply(Math, __spreadArray([], __read(limits.map(function (pt) { return pt[1]; })), false));
+        }
+        if (this.points != null && !(Tstart <= this.minT && Tend > this.maxT)) {
+            // Array represents all numbers within this bucket that fall in range
+            var limits = this.points.filter(function (pt) { return pt[0] > Tstart && pt[0] < Tend; }).map(function (pt) { return pt[currentIndex + 1]; });
+            min = Math.min.apply(Math, __spreadArray([], __read(limits), false));
+            max = Math.max.apply(Math, __spreadArray([], __read(limits), false));
+        }
+        return [min, max];
+    };
+    /**
+     * Retrieves a point from the PointNode tree
+     * @param {number} tVal - The time value of the point to retrieve from the tree.
+     */
+    PointNode.prototype.GetPoint = function (tVal) {
+        return this.PointBinarySearch(tVal, 1)[0];
+    };
+    /**
+     * Retrieves a specified number of points from the PointNode tree, centered around a point
+     * @param {number} tVal - The time value of the center point of the point retrieval.
+     * @param {number} pointsRetrieved - The number of points to retrieve
+     */
+    PointNode.prototype.GetPoints = function (tVal, pointsRetrieved) {
+        if (pointsRetrieved === void 0) { pointsRetrieved = 1; }
+        return this.PointBinarySearch(tVal, pointsRetrieved);
+    };
+    PointNode.prototype.PointBinarySearch = function (tVal, pointsRetrieved, bucketLowerNeighbor, bucketUpperNeighbor) {
+        if (pointsRetrieved === void 0) { pointsRetrieved = 1; }
+        if (pointsRetrieved <= 0)
+            throw new RangeError("Requested number of points must be positive value.");
+        // round tVal back to whole integer 
+        if (this.points !== null) {
+            // if the tVal is less than the minimum value of the subsection, return the first point
+            if (tVal < this.minT) {
+                var spillOver = pointsRetrieved - this.points.length;
+                var spillOverPoints = (spillOver > 0 && bucketUpperNeighbor !== undefined) ? bucketUpperNeighbor.PointBinarySearch(tVal, spillOver, this, undefined) : [];
+                return this.points.slice(0, pointsRetrieved).concat(spillOverPoints);
+            }
+            // if the tVal is greater than the largest value of the subsection, return the last point
+            if (tVal > this.maxT) {
+                var spillOver = pointsRetrieved - this.points.length;
+                var spillOverPoints = (spillOver > 0 && bucketLowerNeighbor !== undefined) ? bucketLowerNeighbor.PointBinarySearch(tVal, spillOver, undefined, this) : [];
+                return spillOverPoints.concat(this.points.slice(-pointsRetrieved));
+            }
+            // Otherwise, perform binary search
+            var upper = this.points.length - 1;
+            var lower = 0;
+            var Tlower = this.minT;
+            var Tupper = this.maxT;
+            while (Tupper !== tVal && Tlower !== tVal && upper !== lower && Tupper !== Tlower) {
+                var center = Math.round((upper + lower) / 2);
+                var Tcenter = this.points[center][0];
+                if (center === upper || center === lower)
+                    break;
+                if (Tcenter <= tVal)
+                    lower = center;
+                if (Tcenter > tVal)
+                    upper = center;
+                Tupper = this.points[upper][0];
+                Tlower = this.points[lower][0];
+            }
+            var upperPoints = Math.floor(pointsRetrieved / 2);
+            var lowerPoints = upperPoints;
+            // Adjustment for even number of points
+            var sidingAdjust = pointsRetrieved % 2 === 0 ? 1 : 0;
+            var centerIndex = void 0;
+            if (Math.abs(tVal - Tlower) < Math.abs(tVal - Tupper)) {
+                centerIndex = lower;
+                lowerPoints -= sidingAdjust;
+            }
+            else {
+                centerIndex = upper;
+                upperPoints -= sidingAdjust;
+            }
+            // Note: If we have spillover and no neighbor on the spillover side, then we discard the idea of spillover, and just return as many as we can on that side
+            var upperSpillOver = centerIndex + upperPoints + 1 - this.points.length;
+            var upperNeighborPoints = (upperSpillOver > 0 && bucketUpperNeighbor !== undefined) ? bucketUpperNeighbor.PointBinarySearch(tVal, upperSpillOver, this, undefined) : [];
+            var lowerSpillOver = lowerPoints - centerIndex;
+            var lowerNeighborPoints = (lowerSpillOver > 0 && bucketLowerNeighbor !== undefined) ? bucketLowerNeighbor.PointBinarySearch(tVal, lowerSpillOver, undefined, this) : [];
+            return lowerNeighborPoints.concat(this.points.slice(Math.max(centerIndex - lowerPoints, 0), Math.min(centerIndex + upperPoints + 1, this.points.length))).concat(upperNeighborPoints);
+        }
+        else if (this.children !== null) {
+            var childIndex = -1;
+            // if the subsection is null, and the tVal is less than the minimum value of the subsection, ??Start over again looking for the point in the first subsection??
+            if (tVal < this.minT)
+                childIndex = 0;
+            else if (tVal > this.maxT)
+                childIndex = this.children.length - 1;
+            else
+                childIndex = this.children.findIndex(function (n) { return n.maxT > tVal; });
+            if (childIndex === -1)
+                throw new RangeError("Could not find child bucket with point that has a time value of ".concat(tVal));
+            // Find neighbors
+            var upperNeighbor = childIndex !== this.children.length - 1 ? this.children[childIndex + 1] : undefined;
+            var lowerNeighbor = childIndex !== 0 ? this.children[childIndex - 1] : undefined;
+            return this.children[childIndex].PointBinarySearch(tVal, pointsRetrieved, lowerNeighbor, upperNeighbor);
+        }
+        else
+            throw new RangeError("Both children and points are null for PointNode, unabled to find point with time value of ".concat(tVal));
+    };
+    return PointNode;
+}());
+exports.PointNode = PointNode;
+//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"PointNode.js","sourceRoot":"","sources":["../src/PointNode.tsx"],"names":[],"mappings":";AAAA,yGAAyG;AACzG,wBAAwB;AACxB,EAAE;AACF,qEAAqE;AACrE,EAAE;AACF,wGAAwG;AACxG,wGAAwG;AACxG,sGAAsG;AACtG,wFAAwF;AACxF,EAAE;AACF,0CAA0C;AAC1C,EAAE;AACF,wGAAwG;AACxG,wGAAwG;AACxG,4EAA4E;AAC5E,EAAE;AACF,8BAA8B;AAC9B,wGAAwG;AACxG,0BAA0B;AAC1B,mDAAmD;AACnD,EAAE;AACF,yGAAyG;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEzG,IAAM,SAAS,GAAG,EAAE,CAAC;AAErB;;;GAGG;AACH;IAYI,mBAAY,IAAqB;QAAjC,iBAgCC;QA/BG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC1B,mDAAmD;QACnD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,uDAAuD;QACvD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,yBAAyB;QACzB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QAEnB,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,IAAI,CAAC,UAAC,KAAK,IAAI,OAAA,KAAK,CAAC,MAAM,IAAI,KAAI,CAAC,GAAG,EAAxB,CAAwB,CAAC;gBAAE,MAAM,IAAI,SAAS,CAAC,oEAA6D,IAAI,CAAC,GAAG,iBAAc,CAAC,CAAA;YAC3J,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;oCACV,OAAK;gBAAiC,OAAK,IAAI,CAAC,OAAK,GAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,IAAI,CAAC,MAAM,CAAC,UAAA,EAAE,IAAI,OAAA,CAAC,KAAK,CAAC,EAAE,CAAC,OAAK,CAAC,CAAC,EAAjB,CAAiB,CAAC,CAAC,GAAG,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,OAAK,CAAC,EAAT,CAAS,CAAC,UAAC,CAAC;;;YAA3I,KAAK,IAAI,OAAK,GAAG,CAAC,EAAE,OAAK,GAAG,IAAI,CAAC,GAAG,EAAE,OAAK,EAAE;wBAApC,OAAK;aAA6H;oCAClI,OAAK;gBAAiC,OAAK,IAAI,CAAC,OAAK,GAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,IAAI,CAAC,MAAM,CAAC,UAAA,EAAE,IAAI,OAAA,CAAC,KAAK,CAAC,EAAE,CAAC,OAAK,CAAC,CAAC,EAAjB,CAAiB,CAAC,CAAC,GAAG,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,OAAK,CAAC,EAAT,CAAS,CAAC,UAAC,CAAC;;;YAA3I,KAAK,IAAI,OAAK,GAAG,CAAC,EAAE,OAAK,GAAG,IAAI,CAAC,GAAG,EAAE,OAAK,EAAE;wBAApC,OAAK;aAA6H;YAC3I,OAAO;QACX,CAAC;QAED,IAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;QAChE,IAAM,SAAS,GAAG,MAAM,GAAG,SAAS,CAAC;QAErC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACxE,KAAK,GAAG,KAAK,GAAG,SAAS,CAAC;QAC9B,CAAC;gCACQ,OAAK;YAAmC,OAAK,IAAI,CAAC,OAAK,CAAC,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,OAAK,QAAQ,CAAC,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,IAAI,CAAC,IAAI,CAAC,OAAK,CAAC,EAAhB,CAAgB,CAAC,UAAC,CAAC;;;QAA7H,KAAK,IAAI,OAAK,GAAG,CAAC,EAAE,OAAK,GAAG,IAAI,CAAC,GAAG,GAAC,CAAC,EAAE,OAAK,EAAE;oBAAtC,OAAK;SAA+G;gCACpH,OAAK;YAAmC,OAAK,IAAI,CAAC,OAAK,CAAC,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,OAAK,QAAQ,CAAC,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,IAAI,CAAC,IAAI,CAAC,OAAK,CAAC,EAAhB,CAAgB,CAAC,UAAC,CAAC;;;QAA7H,KAAK,IAAI,OAAK,GAAG,CAAC,EAAE,OAAK,GAAG,IAAI,CAAC,GAAG,GAAC,CAAC,EAAE,OAAK,EAAE;oBAAtC,OAAK;SAA+G;IACjI,CAAC;IAEM,2BAAO,GAAd,UAAe,MAAc,EAAE,IAAY,EAAE,YAAsB;QAAnE,iBAeC;QAdG,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI;YAC/D,OAAO,IAAI,CAAC,MAAM,CAAC;QACvB,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY;YACjE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAC,EAAE,EAAC,CAAC;;gBAAK,OAAA,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;oBAClE,CAAC,GAAG,CAAC,CAAC,MAAA,MAAA,KAAI,CAAC,MAAM,0CAAE,MAAM,mCAAI,CAAC,CAAC,GAAE,CAAC,CAAC,IAAI,CAAC,KAAI,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,KAAI,CAAC,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM;oBAChG,CAAC,GAAG,CAAC,IAAK,CAAC,KAAI,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,KAAI,CAAC,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAG,IAAI,CAAA;aAAA,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI;YACnB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAhC,CAAgC,CAAE,CAAC;QACvE,IAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,OAAO,MAAM,CAAC,MAAM,OAAb,MAAM,2BAAW,IAAI,CAAC,QAAS,CAAC,MAAM,CAAC,UAAA,IAAI;YAC9C,OAAA,CAAC,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;gBAC3C,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBACvC,CAAC,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QAF1C,CAE0C,CACzC,CAAC,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,YAAY,CAAC,EAAxC,CAAwC,CAAC,WAAE;IACjE,CAAC;IAEM,+BAAW,GAAlB;QACE,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;IAEM,gCAAY,GAAnB,UAAoB,MAAc,EAAE,IAAY;QAC5C,IAAM,MAAM,GAAuB,KAAK,CAAC,IAAI,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC;QACrD,KAAI,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,GAAG,GAAC,CAAC,EAAE,KAAK,EAAE;YAC1C,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACxD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,yFAAyF;IAClF,6BAAS,GAAhB,UAAiB,MAAc,EAAE,IAAY,EAAE,SAAkB;QAC/D,IAAM,YAAY,GAAG,SAAS,aAAT,SAAS,cAAT,SAAS,GAAI,CAAC,CAAC;QACpC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAClC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAElC,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACtE,yCAAyC;YACzC,IAAM,MAAM,GAAG,IAAI,CAAC,QAAS,CAAC,MAAM,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,IAAI,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,GAAG,IAAI,EAAhC,CAAgC,CAAC,CAAC,GAAG,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,SAAS,CAAC,MAAM,EAAC,IAAI,EAAC,YAAY,CAAC,EAArC,CAAqC,CAAC,CAAC;YAC5H,GAAG,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,MAAM,CAAC,GAAG,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,CAAC,CAAC,EAAL,CAAK,CAAC,UAAC,CAAC;YAC3C,GAAG,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,MAAM,CAAC,GAAG,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,CAAC,CAAC,EAAL,CAAK,CAAC,UAAC,CAAC;QAC7C,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACtE,qEAAqE;YACrE,IAAM,MAAM,GAAG,IAAI,CAAC,MAAO,CAAC,MAAM,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,EAA9B,CAA8B,CAAC,CAAC,GAAG,CAAC,UAAA,EAAE,IAAI,OAAA,EAAE,CAAC,YAAY,GAAC,CAAC,CAAC,EAAlB,CAAkB,CAAC,CAAC;YACvG,GAAG,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,MAAM,UAAC,CAAC;YAC1B,GAAG,GAAG,IAAI,CAAC,GAAG,OAAR,IAAI,2BAAQ,MAAM,UAAC,CAAC;QAC5B,CAAC;QAED,OAAO,CAAC,GAAG,EAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,4BAAQ,GAAf,UAAgB,IAAY;QACxB,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;;;OAIG;IACI,6BAAS,GAAhB,UAAiB,IAAY,EAAE,eAAmB;QAAnB,gCAAA,EAAA,mBAAmB;QAC9C,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;IACzD,CAAC;IAEO,qCAAiB,GAAzB,UAA0B,IAAY,EAAE,eAAmB,EAAE,mBAA+B,EAAE,mBAA+B;QAArF,gCAAA,EAAA,mBAAmB;QACvD,IAAI,eAAe,IAAI,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,oDAAoD,CAAC,CAAC;QACrG,oCAAoC;QAEpC,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YACvB,uFAAuF;YACvF,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBACnB,IAAM,SAAS,GAAG,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;gBACvD,IAAM,eAAe,GAAG,CAAC,SAAS,GAAG,CAAC,IAAI,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5J,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAC,eAAe,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;YACxE,CAAC;YAED,yFAAyF;YACzF,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBACnB,IAAM,SAAS,GAAG,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;gBACvD,IAAM,eAAe,GAAG,CAAC,SAAS,GAAG,CAAC,IAAI,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5J,OAAO,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC;YACvE,CAAC;YAED,mCAAmC;YACnC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YACnC,IAAI,KAAK,GAAG,CAAC,CAAC;YAEd,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;YAEvB,OAAO,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;gBAChF,IAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/C,IAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAEvC,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK;oBACpC,MAAM;gBACV,IAAI,OAAO,IAAI,IAAI;oBACf,KAAK,GAAG,MAAM,CAAC;gBACnB,IAAI,OAAO,GAAG,IAAI;oBACd,KAAK,GAAG,MAAM,CAAC;gBACnB,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/B,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC;YAED,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;YAClD,IAAI,WAAW,GAAG,WAAW,CAAC;YAC9B,uCAAuC;YACvC,IAAM,YAAY,GAAG,eAAe,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvD,IAAI,WAAW,SAAQ,CAAC;YACxB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC;gBACpD,WAAW,GAAG,KAAK,CAAC;gBACpB,WAAW,IAAI,YAAY,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACJ,WAAW,GAAG,KAAK,CAAC;gBACpB,WAAW,IAAI,YAAY,CAAC;YAChC,CAAC;YAED,0JAA0J;YAC1J,IAAM,cAAc,GAAG,WAAW,GAAG,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC1E,IAAM,mBAAmB,GAAG,CAAC,cAAc,GAAG,CAAC,IAAI,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1K,IAAM,cAAc,GAAG,WAAW,GAAG,WAAW,CAAC;YACjD,IAAM,mBAAmB,GAAG,CAAC,cAAc,GAAG,CAAC,IAAI,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAE1K,OAAO,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,WAAW,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,WAAW,GAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;QAEzL,CAAC;aACI,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC9B,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;YACpB,+JAA+J;YAC/J,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI;gBAAE,UAAU,GAAG,CAAC,CAAC;iBAChC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI;gBAAE,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;;gBAC5D,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,IAAI,GAAG,IAAI,EAAb,CAAa,CAAC,CAAC;YAE9D,IAAI,UAAU,KAAK,CAAC,CAAC;gBAAE,MAAM,IAAI,UAAU,CAAC,0EAAmE,IAAI,CAAE,CAAC,CAAC;YAEvH,iBAAiB;YACjB,IAAM,aAAa,GAAG,UAAU,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC1G,IAAM,aAAa,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACnF,OAAO,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,iBAAiB,CAAC,IAAI,EAAE,eAAe,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;QAC5G,CAAC;;YACI,MAAM,IAAI,UAAU,CAAC,oGAA6F,IAAI,CAAE,CAAC,CAAC;IACnI,CAAC;IACL,gBAAC;AAAD,CAAC,AA/LD,IA+LC;AA/LY,8BAAS"}