bruce-cesium 7.2.0 → 7.2.2

package/dist/lib/rendering/render-managers/common/historic-utils.js

@@ -0,0 +1,471 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.HistoricGatherer = exports.HistoricRangeCache = exports.HistoricFetchPlan = exports.HistoricFetchOrder = void 0;
+const Cesium = require("cesium");
+const bruce_models_1 = require("bruce-models");
+const entity_utils_1 = require("../../../utils/entity-utils");
+const view_utils_1 = require("../../../utils/view-utils");
+/**
+ * How often a historic refresh is worth running, and which Entities it should ask about first.
+ *
+ * A handful of tracked vehicles can afford to re-read on almost every clock tick. Thousands of
+ * parcels cannot, and refreshing them that often was never buying anything since the answer barely
+ * changes between ticks.
+ */
+var HistoricFetchOrder;
+(function (HistoricFetchOrder) {
+    // The cadence for a set small enough that latency is what the user notices.
+    HistoricFetchOrder.MIN_INTERVAL_MS = 250;
+    // The cadence for a set large enough that the request itself is what the user notices.
+    HistoricFetchOrder.MAX_INTERVAL_MS = 10000;
+    // Below this many Entities the cadence stays at its fastest.
+    HistoricFetchOrder.SMALL_SET = 30;
+    // At and above this many it stays at its slowest.
+    HistoricFetchOrder.LARGE_SET = 5000;
+    /**
+     * Returns how long to wait between historic refreshes for a set of this size.
+     */
+    function IntervalFor(entityCount, minMs = HistoricFetchOrder.MIN_INTERVAL_MS, maxMs = HistoricFetchOrder.MAX_INTERVAL_MS) {
+        if (!(entityCount > HistoricFetchOrder.SMALL_SET)) {
+            return minMs;
+        }
+        if (entityCount >= HistoricFetchOrder.LARGE_SET) {
+            return maxMs;
+        }
+        // Log scaled, so going from 30 to 300 Entities costs more than going from 3000 to 5000.
+        const progress = Math.log(entityCount / HistoricFetchOrder.SMALL_SET) / Math.log(HistoricFetchOrder.LARGE_SET / HistoricFetchOrder.SMALL_SET);
+        return Math.round(minMs + ((maxMs - minMs) * progress));
+    }
+    HistoricFetchOrder.IntervalFor = IntervalFor;
+    /**
+     * Returns the Entities grouped into bands by distance from the camera, nearest band first.
+     *
+     * Bands rather than a true sort, so a small camera move does not reshuffle the whole queue and
+     * restart it. What the user is looking at resolves first either way.
+     */
+    function ByCameraDistance(params) {
+        var _a;
+        const { viewer, entities } = params;
+        const bands = params.bands || [500, 2000, 10000, 50000];
+        if (!(entities === null || entities === void 0 ? void 0 : entities.length)) {
+            return [];
+        }
+        const cameraPos = (_a = viewer === null || viewer === void 0 ? void 0 : viewer.camera) === null || _a === void 0 ? void 0 : _a.position;
+        if (!cameraPos) {
+            return [entities];
+        }
+        // One band past the named bounds, for everything beyond the last of them.
+        const banded = bands.map(() => []).concat([[]]);
+        for (const entity of entities) {
+            const pos = SafePos(entity, viewer);
+            if (!pos) {
+                banded[banded.length - 1].push(entity);
+                continue;
+            }
+            const distance = Cesium.Cartesian3.distance(cameraPos, pos);
+            let index = bands.findIndex(bound => distance <= bound);
+            if (index < 0) {
+                index = banded.length - 1;
+            }
+            banded[index].push(entity);
+        }
+        return banded.filter(band => band.length > 0);
+    }
+    HistoricFetchOrder.ByCameraDistance = ByCameraDistance;
+    /*
+     * Returns an Entity's world position, or null when it has none to place it by.
+     */
+    function SafePos(entity, viewer) {
+        try {
+            const pos = entity_utils_1.EntityUtils.GetPos({
+                entity: entity,
+                viewer: viewer,
+                allowRendered: true
+            });
+            if (!pos || isNaN(pos.x) || isNaN(pos.y) || isNaN(pos.z)) {
+                return null;
+            }
+            return pos;
+        }
+        catch {
+            return null;
+        }
+    }
+})(HistoricFetchOrder = exports.HistoricFetchOrder || (exports.HistoricFetchOrder = {}));
+/**
+ * Decides what slice of history is worth fetching for the clock as it is currently moving.
+ */
+var HistoricFetchPlan;
+(function (HistoricFetchPlan) {
+    // How many seconds of playback the detail window tries to stay ahead by.
+    HistoricFetchPlan.DEFAULT_LEAD_SECONDS = 10;
+    // The detail window never shrinks below this, so a paused clock still has something around it.
+    HistoricFetchPlan.DEFAULT_MIN_DETAIL_MS = 60 * 1000;
+    // Nor grows past it, which is what stops a fast scrub asking for the whole archive.
+    HistoricFetchPlan.DEFAULT_MAX_DETAIL_MS = 6 * 60 * 60 * 1000;
+    // Records the coarse pass may spend describing the whole range.
+    HistoricFetchPlan.DEFAULT_SAMPLE = 200;
+    /*
+     * Returns how wide the detail window should be for the rate the clock is moving at.
+     */
+    function DetailSpanFor(trajectory, leadSeconds, minMs, maxMs) {
+        const rate = Math.abs((trajectory === null || trajectory === void 0 ? void 0 : trajectory.ratePerSecondMs) || 0);
+        const span = rate * leadSeconds;
+        if (!(span > minMs)) {
+            return minMs;
+        }
+        return Math.min(span, maxMs);
+    }
+    HistoricFetchPlan.DetailSpanFor = DetailSpanFor;
+    /**
+     * Returns the detail window and the coarse pass for the clock as it stands.
+     */
+    function Plan(params) {
+        var _a;
+        const { currentTime, windowStart, windowStop, trajectory, leadSeconds = HistoricFetchPlan.DEFAULT_LEAD_SECONDS, minDetailMs = HistoricFetchPlan.DEFAULT_MIN_DETAIL_MS, maxDetailMs = HistoricFetchPlan.DEFAULT_MAX_DETAIL_MS, sample = HistoricFetchPlan.DEFAULT_SAMPLE } = params;
+        if (!(windowStop > windowStart)) {
+            return { detail: null, coarse: null };
+        }
+        // A range that fits the detail budget has nothing worth sampling: reading it whole is both
+        // cheaper than two requests and better than an approximation of it.
+        if ((windowStop - windowStart) <= maxDetailMs) {
+            return { detail: { start: windowStart, stop: windowStop }, coarse: null };
+        }
+        const span = DetailSpanFor(trajectory, leadSeconds, minDetailMs, maxDetailMs);
+        const direction = (_a = trajectory === null || trajectory === void 0 ? void 0 : trajectory.direction) !== null && _a !== void 0 ? _a : 0;
+        // Time running forward only ever reveals what is ahead, so the window leads rather than centres.
+        // A little is still kept behind so a record just passed can still be interpolated from.
+        const behind = direction === 0 ? span / 2 : span * 0.2;
+        const ahead = direction === 0 ? span / 2 : span * 0.8;
+        let start = direction < 0 ? currentTime - ahead : currentTime - behind;
+        let stop = direction < 0 ? currentTime + behind : currentTime + ahead;
+        start = Math.max(windowStart, start);
+        stop = Math.min(windowStop, stop);
+        if (!(stop > start)) {
+            return { detail: null, coarse: { start: windowStart, stop: windowStop, sample } };
+        }
+        const detail = { start, stop };
+        // Nothing to be coarse about once the detail window is the whole range.
+        if (start <= windowStart && stop >= windowStop) {
+            return { detail, coarse: null };
+        }
+        return { detail, coarse: { start: windowStart, stop: windowStop, sample } };
+    }
+    HistoricFetchPlan.Plan = Plan;
+    /**
+     * Tracks which way the clock is moving and how fast, from the times it is observed at.
+     * Playback and a user dragging the timeline both look the same here, which is the point.
+     */
+    class TrajectoryTracker {
+        // Smooths the rate so one slow frame does not collapse the window.
+        constructor(smoothing = 0.4) {
+            this.smoothing = smoothing;
+            this.lastTime = null;
+            this.lastObservedAt = null;
+            this.direction = 0;
+            this.ratePerSecondMs = 0;
+        }
+        /**
+         * Records where the clock is now. observedAt is the wall clock, in milliseconds.
+         */
+        Observe(sceneTime, observedAt) {
+            if (this.lastTime == null) {
+                this.lastTime = sceneTime;
+                this.lastObservedAt = observedAt;
+                return;
+            }
+            const elapsed = observedAt - this.lastObservedAt;
+            const moved = sceneTime - this.lastTime;
+            this.lastTime = sceneTime;
+            this.lastObservedAt = observedAt;
+            if (!(elapsed > 0)) {
+                return;
+            }
+            if (moved === 0) {
+                this.direction = 0;
+                this.ratePerSecondMs = 0;
+                return;
+            }
+            this.direction = moved > 0 ? 1 : -1;
+            const rate = Math.abs(moved) / (elapsed / 1000);
+            this.ratePerSecondMs = this.ratePerSecondMs === 0
+                ? rate
+                : (this.ratePerSecondMs * (1 - this.smoothing)) + (rate * this.smoothing);
+        }
+        Get() {
+            return { direction: this.direction, ratePerSecondMs: this.ratePerSecondMs };
+        }
+        Reset() {
+            this.lastTime = null;
+            this.lastObservedAt = null;
+            this.direction = 0;
+            this.ratePerSecondMs = 0;
+        }
+    }
+    HistoricFetchPlan.TrajectoryTracker = TrajectoryTracker;
+})(HistoricFetchPlan = exports.HistoricFetchPlan || (exports.HistoricFetchPlan = {}));
+/**
+ * Tracks which time ranges of historic data have already been requested, and the records they
+ * returned, so moving the clock only fetches the part that is genuinely new.
+ *
+ * Coverage is tracked by the ranges that were asked for, not by the timestamps that came back. A
+ * window holding no records is still covered, otherwise an empty stretch is re-requested forever.
+ */
+class HistoricRangeCache {
+    // Ranges this far apart are treated as one, so a scrub does not leave a trail of slivers.
+    constructor(mergeToleranceMs = 60000) {
+        this.mergeToleranceMs = mergeToleranceMs;
+        // Requested ranges, kept sorted and non-overlapping.
+        this.held = [];
+        // Ranges covered only by a sampled read, which describe their span without holding every record.
+        this.heldCoarse = [];
+        this.records = {};
+    }
+    /**
+     * Returns the parts of the window that have not been requested yet.
+     */
+    MissingRanges(start, stop) {
+        if (!(stop > start)) {
+            return [];
+        }
+        const missing = [];
+        let cursor = start;
+        for (const range of this.held) {
+            if (range.stop <= cursor) {
+                continue;
+            }
+            if (range.start >= stop) {
+                break;
+            }
+            if (range.start > cursor) {
+                missing.push({ start: cursor, stop: Math.min(range.start, stop) });
+            }
+            cursor = Math.max(cursor, range.stop);
+            if (cursor >= stop) {
+                break;
+            }
+        }
+        if (cursor < stop) {
+            missing.push({ start: cursor, stop: stop });
+        }
+        return this.mergeAdjacent(missing);
+    }
+    /**
+     * Marks a range as requested and merges the records it returned into what is already held.
+     */
+    Absorb(start, stop, recordsByIds, coarse = false) {
+        if (stop > start) {
+            if (coarse) {
+                this.heldCoarse = this.mergeAdjacent([...this.heldCoarse, { start, stop }].sort((a, b) => a.start - b.start));
+            }
+            else {
+                this.held = this.mergeAdjacent([...this.held, { start, stop }].sort((a, b) => a.start - b.start));
+            }
+        }
+        if (!recordsByIds) {
+            return;
+        }
+        for (const entityId of Object.keys(recordsByIds)) {
+            const incoming = recordsByIds[entityId] || [];
+            const current = this.records[entityId] || [];
+            // Keyed by instant so a range fetched twice cannot double up its records.
+            const byInstant = new Map();
+            for (const record of current) {
+                byInstant.set(new Date(record.dateTime).getTime(), record);
+            }
+            for (const record of incoming) {
+                byInstant.set(new Date(record.dateTime).getTime(), record);
+            }
+            this.records[entityId] = Array.from(byInstant.values())
+                .sort((a, b) => new Date(a.dateTime).getTime() - new Date(b.dateTime).getTime());
+        }
+    }
+    GetRecords() {
+        return this.records;
+    }
+    /**
+     * Returns whether the window is already covered in full.
+     */
+    Covers(start, stop) {
+        return this.MissingRanges(start, stop).length === 0;
+    }
+    /**
+     * Returns whether a sampled pass already describes the window.
+     */
+    CoversCoarse(start, stop) {
+        if (!(stop > start)) {
+            return true;
+        }
+        return this.heldCoarse.some(range => range.start <= start && range.stop >= stop);
+    }
+    Clear() {
+        this.held = [];
+        this.heldCoarse = [];
+        this.records = {};
+    }
+    mergeAdjacent(ranges) {
+        if (ranges.length <= 1) {
+            return ranges;
+        }
+        const sorted = [...ranges].sort((a, b) => a.start - b.start);
+        const merged = [];
+        let current = { ...sorted[0] };
+        for (let i = 1; i < sorted.length; i++) {
+            const next = sorted[i];
+            if (next.start - current.stop <= this.mergeToleranceMs) {
+                current.stop = Math.max(current.stop, next.stop);
+            }
+            else {
+                merged.push(current);
+                current = { ...next };
+            }
+        }
+        merged.push(current);
+        return merged;
+    }
+}
+exports.HistoricRangeCache = HistoricRangeCache;
+/**
+ * Pulls historic records for the visible clock range: what to ask for, in what order, and what has
+ * already been asked for.
+ */
+class HistoricGatherer {
+    constructor(params) {
+        this.params = params;
+        this.trajectory = new HistoricFetchPlan.TrajectoryTracker();
+        // Range key to the request in flight for it, so the same range is never asked for twice at once.
+        this.inFlight = new Map();
+        this.disposed = false;
+        this.cache = new HistoricRangeCache();
+    }
+    get Records() {
+        return this.cache.GetRecords();
+    }
+    Clear() {
+        this.cache.Clear();
+        this.trajectory.Reset();
+        this.inFlight.clear();
+    }
+    Dispose() {
+        this.disposed = true;
+        this.Clear();
+    }
+    /**
+     * Returns how long to wait between refreshes for a set of this size.
+     */
+    IntervalFor(entityCount) {
+        return HistoricFetchOrder.IntervalFor(entityCount);
+    }
+    /**
+     * Fetches whatever the current clock range needs that is not already held.
+     * Returns whether anything was requested, alongside every record held for these Entities.
+     */
+    async Gather(entities) {
+        var _a;
+        if (this.disposed || !(entities === null || entities === void 0 ? void 0 : entities.length)) {
+            return { fetched: false, recordsByIds: this.cache.GetRecords() };
+        }
+        const { viewer } = this.params;
+        const windowStart = new Date(viewer.clock.startTime.toString()).getTime();
+        const windowStop = new Date(viewer.clock.stopTime.toString()).getTime();
+        const currentTime = new Date(viewer.clock.currentTime.toString()).getTime();
+        this.trajectory.Observe(currentTime, Date.now());
+        const liveEdge = view_utils_1.ViewUtils.GetTimeDetails({ viewer }).isLive ? currentTime : null;
+        const liveTail = (_a = this.params.liveTailMs) !== null && _a !== void 0 ? _a : HistoricGatherer.LIVE_TAIL_MS;
+        const plan = HistoricFetchPlan.Plan({
+            currentTime,
+            windowStart,
+            windowStop,
+            trajectory: this.trajectory.Get(),
+            sample: this.params.sample
+        });
+        let fetched = false;
+        if (plan.coarse && !this.cache.CoversCoarse(plan.coarse.start, plan.coarse.stop)) {
+            const records = await this.request(plan.coarse.start, plan.coarse.stop, entities, plan.coarse.sample);
+            if (this.disposed) {
+                return { fetched, recordsByIds: this.cache.GetRecords() };
+            }
+            this.cache.Absorb(plan.coarse.start, this.holdTo(plan.coarse.stop, liveEdge, liveTail), records, true);
+            fetched = true;
+        }
+        if (plan.detail) {
+            const bands = entities.length > HistoricFetchOrder.SMALL_SET
+                ? HistoricFetchOrder.ByCameraDistance({ viewer, entities })
+                : [entities];
+            for (const range of this.cache.MissingRanges(plan.detail.start, plan.detail.stop)) {
+                if (this.disposed) {
+                    break;
+                }
+                for (const band of bands) {
+                    if (this.disposed) {
+                        break;
+                    }
+                    const records = await this.request(range.start, range.stop, band, 0);
+                    if (this.disposed) {
+                        break;
+                    }
+                    // Records land as each band arrives, while the range is only marked held once
+                    // every band has been asked for.
+                    this.cache.Absorb(0, 0, records);
+                    fetched = true;
+                }
+                if (this.disposed) {
+                    break;
+                }
+                const heldTo = this.holdTo(range.stop, liveEdge, liveTail);
+                if (heldTo > range.start) {
+                    this.cache.Absorb(range.start, heldTo, {});
+                }
+            }
+        }
+        return { fetched, recordsByIds: this.cache.GetRecords() };
+    }
+    /*
+     * Returns how much of a range that was just read may be marked as held.
+     */
+    holdTo(stop, liveEdge, liveTailMs) {
+        if (liveEdge == null) {
+            return stop;
+        }
+        return Math.min(stop, liveEdge - liveTailMs);
+    }
+    /*
+     * Reads one range, joining a request already in flight for it rather than repeating it.
+     */
+    request(start, stop, entities, sample) {
+        var _a;
+        const padding = (_a = this.params.paddingMs) !== null && _a !== void 0 ? _a : 0;
+        const dateTimeFrom = new Date(start - padding).toISOString();
+        const dateTimeTo = new Date(stop + padding).toISOString();
+        const entityIds = entities.map(x => { var _a; return (_a = x.Bruce) === null || _a === void 0 ? void 0 : _a.ID; }).filter(x => !!x);
+        const key = `${dateTimeFrom}|${dateTimeTo}|${sample}|${entityIds.join(",")}`;
+        const existing = this.inFlight.get(key);
+        if (existing) {
+            return existing;
+        }
+        const prom = bruce_models_1.EntityHistoricData.GetRecordsByEntity({
+            attrKey: this.params.getAttrKey(),
+            dateTimeFrom,
+            dateTimeTo,
+            entityIds,
+            sample: sample > 0 ? sample : undefined,
+            api: this.params.getApi()
+        }).then((res) => {
+            const records = res.recordsByIds || {};
+            if (!this.disposed && this.params.onRecords) {
+                this.params.onRecords(records);
+            }
+            return records;
+        }).finally(() => {
+            this.inFlight.delete(key);
+        });
+        this.inFlight.set(key, prom);
+        return prom;
+    }
+}
+// How far back from the live edge is left unheld, so a record written moments ago still falls in
+// something that gets asked for again. It has to outlast a write, a commit and a refresh, plus
+// whatever the writer's clock and this one disagree by.
+HistoricGatherer.LIVE_TAIL_MS = 15000;
+exports.HistoricGatherer = HistoricGatherer;
+//# sourceMappingURL=historic-utils.js.map

package/dist/lib/rendering/render-managers/common/historic-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"historic-utils.js","sourceRoot":"","sources":["../../../../../src/rendering/render-managers/common/historic-utils.ts"],"names":[],"mappings":";;;AAAA,iCAAiC;AACjC,+CAAiF;AACjF,8DAA0D;AAC1D,0DAAsD;AAEtD;;;;;;GAMG;AACH,IAAiB,kBAAkB,CA0FlC;AA1FD,WAAiB,kBAAkB;IAC/B,4EAA4E;IAC/D,kCAAe,GAAG,GAAG,CAAC;IACnC,uFAAuF;IAC1E,kCAAe,GAAG,KAAK,CAAC;IACrC,6DAA6D;IAChD,4BAAS,GAAG,EAAE,CAAC;IAC5B,kDAAkD;IACrC,4BAAS,GAAG,IAAI,CAAC;IAE9B;;OAEG;IACH,SAAgB,WAAW,CAAC,WAAmB,EAAE,QAAgB,mBAAA,eAAe,EAAE,QAAgB,mBAAA,eAAe;QAC7G,IAAI,CAAC,CAAC,WAAW,GAAG,mBAAA,SAAS,CAAC,EAAE;YAC5B,OAAO,KAAK,CAAC;SAChB;QACD,IAAI,WAAW,IAAI,mBAAA,SAAS,EAAE;YAC1B,OAAO,KAAK,CAAC;SAChB;QAED,wFAAwF;QACxF,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,mBAAA,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,mBAAA,SAAS,GAAG,mBAAA,SAAS,CAAC,CAAC;QACrF,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAC5D,CAAC;IAXe,8BAAW,cAW1B,CAAA;IAED;;;;;OAKG;IACH,SAAgB,gBAAgB,CAAC,MAKhC;;QACG,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;QACpC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAExD,IAAI,CAAC,CAAA,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,CAAA,EAAE;YACnB,OAAO,EAAE,CAAC;SACb;QAED,MAAM,SAAS,GAAG,MAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,MAAM,0CAAE,QAAQ,CAAC;QAC3C,IAAI,CAAC,SAAS,EAAE;YACZ,OAAO,CAAC,QAAQ,CAAC,CAAC;SACrB;QAED,0EAA0E;QAC1E,MAAM,MAAM,GAAuB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEpE,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;YAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACpC,IAAI,CAAC,GAAG,EAAE;gBACN,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvC,SAAS;aACZ;YAED,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC5D,IAAI,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,IAAI,KAAK,CAAC,CAAC;YACxD,IAAI,KAAK,GAAG,CAAC,EAAE;gBACX,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;aAC7B;YACD,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SAC9B;QAED,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClD,CAAC;IArCe,mCAAgB,mBAqC/B,CAAA;IAED;;OAEG;IACH,SAAS,OAAO,CAAC,MAAsB,EAAE,MAAqB;QAC1D,IAAI;YACA,MAAM,GAAG,GAAG,0BAAW,CAAC,MAAM,CAAC;gBAC3B,MAAM,EAAE,MAAM;gBACd,MAAM,EAAE,MAAM;gBACd,aAAa,EAAE,IAAI;aACtB,CAAC,CAAC;YACH,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;gBACtD,OAAO,IAAI,CAAC;aACf;YACD,OAAO,GAAG,CAAC;SACd;QACD,MAAM;YACF,OAAO,IAAI,CAAC;SACf;IACL,CAAC;AACL,CAAC,EA1FgB,kBAAkB,GAAlB,0BAAkB,KAAlB,0BAAkB,QA0FlC;AAED;;GAEG;AACH,IAAiB,iBAAiB,CA8JjC;AA9JD,WAAiB,iBAAiB;IAoB9B,yEAAyE;IAC5D,sCAAoB,GAAG,EAAE,CAAC;IACvC,+FAA+F;IAClF,uCAAqB,GAAG,EAAE,GAAG,IAAI,CAAC;IAC/C,oFAAoF;IACvE,uCAAqB,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IACxD,gEAAgE;IACnD,gCAAc,GAAG,GAAG,CAAC;IAElC;;OAEG;IACH,SAAgB,aAAa,CAAC,UAAuB,EAAE,WAAmB,EAAE,KAAa,EAAE,KAAa;QACpG,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,eAAe,KAAI,CAAC,CAAC,CAAC;QACxD,MAAM,IAAI,GAAG,IAAI,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,EAAE;YACjB,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAPe,+BAAa,gBAO5B,CAAA;IAED;;OAEG;IACH,SAAgB,IAAI,CAAC,MASpB;;QACG,MAAM,EACF,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAChD,WAAW,GAAG,kBAAA,oBAAoB,EAClC,WAAW,GAAG,kBAAA,qBAAqB,EACnC,WAAW,GAAG,kBAAA,qBAAqB,EACnC,MAAM,GAAG,kBAAA,cAAc,EAC1B,GAAG,MAAM,CAAC;QAEX,IAAI,CAAC,CAAC,UAAU,GAAG,WAAW,CAAC,EAAE;YAC7B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;SACzC;QAED,2FAA2F;QAC3F,oEAAoE;QACpE,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,IAAI,WAAW,EAAE;YAC3C,OAAO,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;SAC7E;QAED,MAAM,IAAI,GAAG,aAAa,CAAC,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;QAC9E,MAAM,SAAS,GAAG,MAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,SAAS,mCAAI,CAAC,CAAC;QAE7C,iGAAiG;QACjG,wFAAwF;QACxF,MAAM,MAAM,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC;QACvD,MAAM,KAAK,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC;QAEtD,IAAI,KAAK,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,WAAW,GAAG,MAAM,CAAC;QACvE,IAAI,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,GAAG,KAAK,CAAC;QAEtE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QACrC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAElC,IAAI,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,EAAE;YACjB,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;SACrF;QAED,MAAM,MAAM,GAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QAEvC,wEAAwE;QACxE,IAAI,KAAK,IAAI,WAAW,IAAI,IAAI,IAAI,UAAU,EAAE;YAC5C,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;SACnC;QAED,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;IAChF,CAAC;IAtDe,sBAAI,OAsDnB,CAAA;IAED;;;OAGG;IACH,MAAa,iBAAiB;QAM1B,mEAAmE;QACnE,YAAoB,YAAoB,GAAG;YAAvB,cAAS,GAAT,SAAS,CAAc;YANnC,aAAQ,GAAW,IAAI,CAAC;YACxB,mBAAc,GAAW,IAAI,CAAC;YAC9B,cAAS,GAAe,CAAC,CAAC;YAC1B,oBAAe,GAAW,CAAC,CAAC;QAGU,CAAC;QAE/C;;WAEG;QACI,OAAO,CAAC,SAAiB,EAAE,UAAkB;YAChD,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE;gBACvB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAC1B,IAAI,CAAC,cAAc,GAAG,UAAU,CAAC;gBACjC,OAAO;aACV;YAED,MAAM,OAAO,GAAG,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC;YACjD,MAAM,KAAK,GAAG,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;YAExC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC1B,IAAI,CAAC,cAAc,GAAG,UAAU,CAAC;YAEjC,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE;gBAChB,OAAO;aACV;YAED,IAAI,KAAK,KAAK,CAAC,EAAE;gBACb,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;gBACnB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;gBACzB,OAAO;aACV;YAED,IAAI,CAAC,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEpC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC;YAChD,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,eAAe,KAAK,CAAC;gBAC7C,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QAClF,CAAC;QAEM,GAAG;YACN,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,eAAe,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC;QAChF,CAAC;QAEM,KAAK;YACR,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACrB,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;YAC3B,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;QAC7B,CAAC;KACJ;IArDY,mCAAiB,oBAqD7B,CAAA;AACL,CAAC,EA9JgB,iBAAiB,GAAjB,yBAAiB,KAAjB,yBAAiB,QA8JjC;AAED;;;;;;GAMG;AACH,MAAa,kBAAkB;IAO3B,0FAA0F;IAC1F,YAA2B,mBAA2B,KAAK;QAAhC,qBAAgB,GAAhB,gBAAgB,CAAgB;QAP3D,qDAAqD;QAC7C,SAAI,GAAsC,EAAE,CAAC;QACrD,iGAAiG;QACzF,eAAU,GAAsC,EAAE,CAAC;QACnD,YAAO,GAA4C,EAAE,CAAC;IAGA,CAAC;IAE/D;;OAEG;IACI,aAAa,CAAC,KAAa,EAAE,IAAY;QAC5C,IAAI,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,EAAE;YACjB,OAAO,EAAE,CAAC;SACb;QAED,MAAM,OAAO,GAAsC,EAAE,CAAC;QACtD,IAAI,MAAM,GAAG,KAAK,CAAC;QAEnB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE;YAC3B,IAAI,KAAK,CAAC,IAAI,IAAI,MAAM,EAAE;gBACtB,SAAS;aACZ;YACD,IAAI,KAAK,CAAC,KAAK,IAAI,IAAI,EAAE;gBACrB,MAAM;aACT;YACD,IAAI,KAAK,CAAC,KAAK,GAAG,MAAM,EAAE;gBACtB,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;aACtE;YACD,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,MAAM,IAAI,IAAI,EAAE;gBAChB,MAAM;aACT;SACJ;QAED,IAAI,MAAM,GAAG,IAAI,EAAE;YACf,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;SAC/C;QAED,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,KAAa,EAAE,IAAY,EAAE,YAAqD,EAAE,SAAkB,KAAK;QACrH,IAAI,IAAI,GAAG,KAAK,EAAE;YACd,IAAI,MAAM,EAAE;gBACR,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;aACjH;iBACI;gBACD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;aACrG;SACJ;QAED,IAAI,CAAC,YAAY,EAAE;YACf,OAAO;SACV;QAED,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE;YAC9C,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YAE7C,0EAA0E;YAC1E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoC,CAAC;YAC9D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;gBAC1B,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC;aAC9D;YACD,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;gBAC3B,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC;aAC9D;YAED,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;iBAClD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;SACxF;IACL,CAAC;IAEM,UAAU;QACb,OAAO,IAAI,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,KAAa,EAAE,IAAY;QACrC,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;IACxD,CAAC;IAED;;OAEG;IACI,YAAY,CAAC,KAAa,EAAE,IAAY;QAC3C,IAAI,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,EAAE;YACjB,OAAO,IAAI,CAAC;SACf;QACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,IAAI,KAAK,IAAI,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;IACrF,CAAC;IAEM,KAAK;QACR,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IACtB,CAAC;IAEO,aAAa,CAAC,MAAyC;QAC3D,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE;YACpB,OAAO,MAAM,CAAC;SACjB;QAED,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAsC,EAAE,CAAC;QACrD,IAAI,OAAO,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,gBAAgB,EAAE;gBACpD,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;aACpD;iBACI;gBACD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrB,OAAO,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;aACzB;SACJ;QACD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAErB,OAAO,MAAM,CAAC;IAClB,CAAC;CACJ;AAjID,gDAiIC;AAED;;;GAGG;AACH,MAAa,gBAAgB;IAczB,YAAoB,MAanB;QAbmB,WAAM,GAAN,MAAM,CAazB;QApBO,eAAU,GAAG,IAAI,iBAAiB,CAAC,iBAAiB,EAAE,CAAC;QAE/D,iGAAiG;QACzF,aAAQ,GAAG,IAAI,GAAG,EAA4D,CAAC;QAE/E,aAAQ,GAAY,KAAK,CAAC;QAgB9B,IAAI,CAAC,KAAK,GAAG,IAAI,kBAAkB,EAAE,CAAC;IAC1C,CAAC;IAED,IAAW,OAAO;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;IACnC,CAAC;IAEM,KAAK;QACR,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAEM,OAAO;QACV,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,KAAK,EAAE,CAAC;IACjB,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,WAAmB;QAClC,OAAO,kBAAkB,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IACvD,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,MAAM,CAAC,QAA0B;;QAI1C,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAA,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,CAAA,EAAE;YACpC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,CAAC;SACpE;QAED,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QAC/B,MAAM,WAAW,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QAC1E,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACxE,MAAM,WAAW,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QAE5E,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAEjD,MAAM,QAAQ,GAAG,sBAAS,CAAC,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC;QAClF,MAAM,QAAQ,GAAG,MAAA,IAAI,CAAC,MAAM,CAAC,UAAU,mCAAI,gBAAgB,CAAC,YAAY,CAAC;QAEzE,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC;YAChC,WAAW;YACX,WAAW;YACX,UAAU;YACV,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE;YACjC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM;SAC7B,CAAC,CAAC;QAEH,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YAC9E,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAC9B,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAEvE,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACf,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,CAAC;aAC7D;YACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;YACvG,OAAO,GAAG,IAAI,CAAC;SAClB;QAED,IAAI,IAAI,CAAC,MAAM,EAAE;YACb,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,kBAAkB,CAAC,SAAS;gBACxD,CAAC,CAAC,kBAAkB,CAAC,gBAAgB,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;gBAC3D,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAEjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;gBAC/E,IAAI,IAAI,CAAC,QAAQ,EAAE;oBACf,MAAM;iBACT;gBAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;oBACtB,IAAI,IAAI,CAAC,QAAQ,EAAE;wBACf,MAAM;qBACT;oBACD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;oBACrE,IAAI,IAAI,CAAC,QAAQ,EAAE;wBACf,MAAM;qBACT;oBACD,8EAA8E;oBAC9E,iCAAiC;oBACjC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;oBACjC,OAAO,GAAG,IAAI,CAAC;iBAClB;gBAED,IAAI,IAAI,CAAC,QAAQ,EAAE;oBACf,MAAM;iBACT;gBACD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBAC3D,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE;oBACtB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;iBAC9C;aACJ;SACJ;QAED,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,CAAC;IAC9D,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,IAAY,EAAE,QAAgB,EAAE,UAAkB;QAC7D,IAAI,QAAQ,IAAI,IAAI,EAAE;YAClB,OAAO,IAAI,CAAC;SACf;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,GAAG,UAAU,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACK,OAAO,CACX,KAAa,EACb,IAAY,EACZ,QAA0B,EAC1B,MAAc;;QAEd,MAAM,OAAO,GAAG,MAAA,IAAI,CAAC,MAAM,CAAC,SAAS,mCAAI,CAAC,CAAC;QAC3C,MAAM,YAAY,GAAG,IAAI,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QAC7D,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QAE1D,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,WAAC,OAAA,MAAA,CAAC,CAAC,KAAK,0CAAE,EAAE,CAAA,EAAA,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,MAAM,GAAG,GAAG,GAAG,YAAY,IAAI,UAAU,IAAI,MAAM,IAAI,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAE7E,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,QAAQ,EAAE;YACV,OAAO,QAAQ,CAAC;SACnB;QAED,MAAM,IAAI,GAAG,iCAAkB,CAAC,kBAAkB,CAAC;YAC/C,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE;YACjC,YAAY;YACZ,UAAU;YACV,SAAS;YACT,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;YACvC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;SAC5B,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE;YACZ,MAAM,OAAO,GAAG,GAAG,CAAC,YAAY,IAAI,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE;gBACzC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;aAClC;YACD,OAAO,OAAO,CAAC;QACnB,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;YACZ,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IAChB,CAAC;;AAtLD,iGAAiG;AACjG,+FAA+F;AAC/F,wDAAwD;AACjC,6BAAY,GAAG,KAAK,AAAR,CAAS;AAJnC,4CAAgB"}

package/dist/lib/rendering/render-managers/entities/entities-ids-render-manager.js

@@ -5,6 +5,7 @@ const bruce_models_1 = require("bruce-models");
 const Cesium = require("cesium");
 const entity_render_engine_1 = require("../../entity-render-engine");
 const visuals_register_1 = require("../../visuals-register");
+const historic_utils_1 = require("../common/historic-utils");
 const point_clustering_1 = require("../common/point-clustering");
 const entity_rerender_maintain_state_1 = require("../common/entity-rerender-maintain-state");
 const batched_data_getter_1 = require("../../getters/batched-data-getter");
@@ -50,6 +51,13 @@ var EntitiesIdsRenderManager;
             this.monitor = monitor;
             this.item = item;
             this.visualsManager = visualsManager;
+            this.historicGatherer = new historic_utils_1.HistoricGatherer({
+                viewer: this.viewer,
+                getApi: () => this.apiGetter.getApi(),
+                getAttrKey: () => { var _a; return (_a = this.item.BruceEntity) === null || _a === void 0 ? void 0 : _a.historicAttrKey; },
+                // Padding either side of a requested range, for clock desync between us and the server.
+                paddingMs: 15000
+            });
             if (this.item.enableClustering) {
                 this.clustering = new point_clustering_1.PointClustering(visualsManager, this.item.id, (_a = this.item) === null || _a === void 0 ? void 0 : _a.clustering);
             }
@@ -399,140 +407,22 @@ var EntitiesIdsRenderManager;
          * @param entities
          */
         async getHistoricInfo(entities) {
-            // Time padding in milliseconds (15 seconds).
-            // Helps account for desync between client and server.
-            const TIME_PADDING_MS = 15000;
-            const minDateTimeStr = this.viewer.clock.startTime.toString();
-            const maxDateTimeStr = this.viewer.clock.stopTime.toString();
-            const minDateTime = new Date(minDateTimeStr).getTime();
-            const maxDateTime = new Date(maxDateTimeStr).getTime();
-            const tDetails = view_utils_1.ViewUtils.GetTimeDetails({
-                viewer: this.viewer,
-            });
-            const isLive = tDetails.isLive;
-            let rangesToRequest = [{
-                    start: minDateTime,
-                    stop: maxDateTime
-                }];
-            // If we already have cached data, determine what ranges we're missing.
-            if (Object.keys(this.entitiesHistoric).length >= entities.length) {
-                let foundMinDateTime = null;
-                let foundMaxDateTime = null;
-                // Find the min/max based on cached data.
-                // Since we set the values sorted, we only have to check the first and last records for each entity.
-                for (const entityId of Object.keys(this.entitiesHistoric)) {
-                    const records = this.entitiesHistoric[entityId] || [];
-                    if (records.length) {
-                        const dateTime = new Date(records[0].dateTime).getTime();
-                        if (foundMinDateTime == null || dateTime < foundMinDateTime) {
-                            foundMinDateTime = dateTime;
-                        }
-                        const dateTime2 = new Date(records[records.length - 1].dateTime).getTime();
-                        if (foundMaxDateTime == null || dateTime2 > foundMaxDateTime) {
-                            foundMaxDateTime = dateTime2;
-                        }
-                    }
-                }
-                // Complete overlap - we already have all the data.
-                if (foundMinDateTime != null && foundMaxDateTime != null && foundMinDateTime <= minDateTime && foundMaxDateTime >= maxDateTime) {
-                    return [false, this.entitiesHistoric];
-                }
-                // Calculate missing ranges.
-                rangesToRequest = [];
-                // Check if we need data before our cached range.
-                if (foundMinDateTime != null && foundMinDateTime > minDateTime) {
-                    // When live we focus on getting the next range rather than old data.
-                    // Ends up being one less request to perform every second.
-                    if (!isLive || foundMinDateTime == null) {
-                        rangesToRequest.push({
-                            start: minDateTime,
-                            stop: new Date(foundMinDateTime).getTime()
-                        });
-                    }
-                }
-                // Check if we need data after our cached range.
-                if (foundMaxDateTime != null && foundMaxDateTime < maxDateTime) {
-                    rangesToRequest.push({
-                        start: new Date(foundMaxDateTime).getTime(),
-                        stop: maxDateTime
-                    });
-                }
-                // If the ranges to request are within a tolerance, combine them.
-                if (rangesToRequest.length > 1) {
-                    const TOLERANCE_MS = 60000; // 1 minute.
-                    const mergedRanges = [];
-                    let currentRange = rangesToRequest[0];
-                    for (let i = 1; i < rangesToRequest.length; i++) {
-                        const nextRange = rangesToRequest[i];
-                        if (nextRange.start - currentRange.stop <= TOLERANCE_MS) {
-                            currentRange.stop = nextRange.stop;
-                        }
-                        else {
-                            mergedRanges.push(currentRange);
-                            currentRange = nextRange;
-                        }
-                    }
-                }
-            }
-            const entityIds = entities.map(x => x.Bruce.ID);
-            const combined = { ...this.entitiesHistoric };
-            // Make requests for each missing range
-            for (const range of rangesToRequest) {
-                if (this.disposed) {
-                    break;
-                }
-                const start = new Date(range.start - TIME_PADDING_MS);
-                const stop = new Date(range.stop + TIME_PADDING_MS);
-                const historicData = await bruce_models_1.EntityHistoricData.GetList({
-                    attrKey: this.item.BruceEntity.historicAttrKey,
-                    dateTimeFrom: start.toISOString(),
-                    dateTimeTo: stop.toISOString(),
-                    entityIds: entityIds,
-                    api: this.apiGetter.getApi()
-                });
-                if (this.disposed) {
-                    break;
-                }
-                // Merge the new data with existing data
-                const records = historicData.recordsByIds;
-                const recordsIds = Object.keys(records);
-                for (let i = 0; i < recordsIds.length; i++) {
-                    const entityId = recordsIds[i];
-                    const latest = records[entityId] || [];
-                    const current = combined[entityId] || [];
-                    // Use a Map to de-duplicate by timestamp.
-                    const tmp = new Map();
-                    for (let j = 0; j < current.length; j++) {
-                        const record = current[j];
-                        const dateTime = new Date(record.dateTime).getTime();
-                        tmp.set(dateTime, record);
-                    }
-                    for (let j = 0; j < latest.length; j++) {
-                        const record = latest[j];
-                        const dateTime = new Date(record.dateTime).getTime();
-                        tmp.set(dateTime, record);
-                    }
-                    // Convert to array and sort by date.
-                    const sorted = Array.from(tmp.values()).sort((a, b) => {
-                        return new Date(a.dateTime).getTime() - new Date(b.dateTime).getTime();
-                    });
-                    combined[entityId] = sorted;
-                }
-            }
+            const { fetched, recordsByIds } = await this.historicGatherer.Gather(entities);
             if (!this.disposed) {
-                this.entitiesHistoric = combined;
+                this.entitiesHistoric = recordsByIds;
             }
-            return [rangesToRequest.length > 0, combined];
+            return [fetched, recordsByIds];
         }
         viewerDateTimeSub() {
             var _a, _b;
             if ((!((_a = this.item.BruceEntity) === null || _a === void 0 ? void 0 : _a.historic) && !((_b = this.item.BruceEntity) === null || _b === void 0 ? void 0 : _b.historicAttrKey)) || this.viewerDateTimeChangeRemoval) {
                 return;
             }
-            const THROTTLE_INTERVAL = 2000;
+            // Scaled by how many Entities are on screen rather than fixed, since the cost of a refresh
+            // is the set size and a large set barely changes between ticks anyway.
             let queue = new bruce_models_1.DelayQueue(() => {
                 this.onGetterUpdate(Object.keys(this.renderedEntities));
-            }, THROTTLE_INTERVAL, true);
+            }, this.historicGatherer.IntervalFor(Object.keys(this.renderedEntities).length), true);
             let clockTickRemoval;
             let prevTick = this.viewer.clock.currentTime.toString();
             clockTickRemoval = this.viewer.clock.onTick.addEventListener(() => {