@teepin/sdk 0.3.0 → 0.4.0

package/dist/cjs/direct/packing.js

@@ -0,0 +1,549 @@
+"use strict";
+// Copyright 2026 TEEPIN Project
+// Licensed under the Apache License, Version 2.0
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.schedule = exports.remnantAlone = exports.absorbCap = exports.InFlight = exports.Arrivals = exports.decide = exports.planPack = exports.atSpeed = exports.limitsFromJSON = exports.requestBudget = exports.DEFAULT_LIMITS = exports.SLOW = exports.MAX_PACK_BYTES = exports.MEMORY_CAP = exports.REQUEST_OVERHEAD = exports.COMMIT_SAMPLES = exports.COMMIT_USUAL_START_MS = exports.MAX_OBSERVE_MS = exports.DEFAULT_OBSERVE_MS = exports.DEFAULT_SETTLE_MS = exports.DEFAULT_RATE_WINDOW_MS = exports.DEFAULT_WAIT_MS = exports.DEFAULT_MAX_REQUEST = exports.DEFAULT_MAX_PACK_OBJECTS = exports.DEFAULT_MAX_OBJECTS = exports.DEFAULT_CEILING = exports.DEFAULT_FLOOR = void 0;
+// Pack sizes (TEEPIN-STORAGE-DESIGN.md section 28): every write to the storage network is at least 10 MiB, unless it
+// is a leftover with its reason. Pure: no I/O and no clock of its own (times are passed in, in milliseconds), the same
+// rules as the other uploaders, held to them by test/vectors/pack_planner.json.
+//
+//   - PackLimits: the sizes and timings, built in and sent by the server with each reservation (28.15).
+//   - planPack: which waiting items the next pack takes (28.3, 28.17).
+//   - Arrivals: the running totals of one bucket's waiting saves, so the timing rule decides without planning.
+//   - decide: when a save's pack goes (28.4, 28.17, 28.25).
+//   - InFlight: the saves' packs in flight and when each is expected back, whose callers will very likely save again
+//     (28.25 point 2).
+//   - schedule: one dispatch's decisions for every bucket, oldest first (28.17's driver, without its slots and memory).
+exports.DEFAULT_FLOOR = 10 * 2 ** 20;
+exports.DEFAULT_CEILING = 20 * 2 ** 20;
+exports.DEFAULT_MAX_OBJECTS = 10000;
+/** The server's cap on a pack's objects: one that has just reached the floor, plus a run's tail (28.14). */
+exports.DEFAULT_MAX_PACK_OBJECTS = 140000;
+/** A reserve or sign body's limit on the server. */
+exports.DEFAULT_MAX_REQUEST = 64 * 2 ** 20;
+exports.DEFAULT_WAIT_MS = 5000;
+exports.DEFAULT_RATE_WINDOW_MS = 1000;
+exports.DEFAULT_SETTLE_MS = 200;
+/**
+ * How long a pack under the floor waits before it may go as a leftover early (28.25 point 1): within it, a burst's
+ * arrivals land in the rate window. The server may send 0 to 2,000 ms.
+ */
+exports.DEFAULT_OBSERVE_MS = 300;
+exports.MAX_OBSERVE_MS = 2000;
+/** A commit's usual time until one is measured, and how many of the last ones its median takes (28.25 point 2). */
+exports.COMMIT_USUAL_START_MS = 1500;
+exports.COMMIT_SAMPLES = 8;
+/** A reserve body's bytes besides its objects, with room to spare. */
+exports.REQUEST_OVERHEAD = 512;
+/** Pack bytes in flight per client (28.2): 16 full packs. */
+exports.MEMORY_CAP = 320 * 2 ** 20;
+/** The pack cap: no ceiling may pass it. */
+exports.MAX_PACK_BYTES = 64 * 2 ** 20;
+/** On a slow link a pack never shrinks below one TWS1 segment (28.7). Settable only for tests. */
+exports.SLOW = { min: 64 * 2 ** 10 };
+/** The limits a client starts with, until the server sends its own. */
+exports.DEFAULT_LIMITS = Object.freeze({
+    floor: exports.DEFAULT_FLOOR,
+    ceiling: exports.DEFAULT_CEILING,
+    maxObjects: exports.DEFAULT_MAX_OBJECTS,
+    maxPackObjects: exports.DEFAULT_MAX_PACK_OBJECTS,
+    maxRequest: exports.DEFAULT_MAX_REQUEST,
+    waitMs: exports.DEFAULT_WAIT_MS,
+    windowMs: exports.DEFAULT_RATE_WINDOW_MS,
+    settleMs: exports.DEFAULT_SETTLE_MS,
+    observeMs: exports.DEFAULT_OBSERVE_MS,
+});
+/** The bytes a reserve body's objects may take. */
+function requestBudget(l) {
+    return Math.max(0, l.maxRequest - exports.REQUEST_OVERHEAD);
+}
+exports.requestBudget = requestBudget;
+const LIMIT_FIELDS = [
+    'floor_bytes',
+    'ceiling_bytes',
+    'max_objects',
+    'max_pack_objects',
+    'max_request_bytes',
+    'wait_ms',
+    'rate_window_ms',
+    'settle_ms',
+];
+/**
+ * The reserve answer's limits (28.15), whole or not at all: undefined when absent or when any value breaks section
+ * 28's rules (the caller then keeps what it has).
+ */
+function limitsFromJSON(d) {
+    if (!d || typeof d !== 'object')
+        return undefined;
+    const o = d;
+    const v = {};
+    for (const k of LIMIT_FIELDS) {
+        const x = o[k];
+        if (typeof x !== 'number' || !Number.isSafeInteger(x))
+            return undefined;
+        v[k] = x;
+    }
+    const floor = v.floor_bytes;
+    const ceiling = v.ceiling_bytes;
+    if (floor < 2 ** 20 || ceiling < 2 * floor || ceiling > exports.MAX_PACK_BYTES)
+        return undefined;
+    if (v.max_objects < 1 || v.max_pack_objects < 1 || v.max_request_bytes < 2 ** 20)
+        return undefined;
+    for (const k of ['wait_ms', 'rate_window_ms', 'settle_ms'])
+        if (v[k] < 0 || v[k] > 60000)
+            return undefined;
+    // observe_ms (28.25) is optional: a server before it sends none, and its other limits still hold.
+    let observe = o.observe_ms;
+    if (observe === undefined || observe === null)
+        observe = exports.DEFAULT_OBSERVE_MS;
+    else if (typeof observe !== 'number' || !Number.isSafeInteger(observe) || observe < 0 || observe > exports.MAX_OBSERVE_MS)
+        return undefined;
+    return {
+        floor,
+        ceiling,
+        maxObjects: v.max_objects,
+        maxPackObjects: v.max_pack_objects,
+        maxRequest: v.max_request_bytes,
+        waitMs: v.wait_ms,
+        windowMs: v.rate_window_ms,
+        settleMs: v.settle_ms,
+        observeMs: observe,
+    };
+}
+exports.limitsFromJSON = limitsFromJSON;
+/**
+ * l at the measured speed (28.7): requestBytes is what one request carries in 240 s (undefined before anything is
+ * measured). The ceiling comes down toward the floor. Under the floor the link is slow: packs shrink as before section
+ * 28, each taking files only while it stays within that size (at least SLOW.min), so the floor is one byte and the
+ * ceiling that size.
+ */
+function atSpeed(l, requestBytes) {
+    if (requestBytes === undefined || requestBytes >= l.ceiling)
+        return [{ ...l }, false];
+    if (requestBytes >= l.floor)
+        return [{ ...l, ceiling: requestBytes }, false];
+    return [{ ...l, floor: 1, ceiling: Math.max(exports.SLOW.min, requestBytes) }, true];
+}
+exports.atSpeed = atSpeed;
+/**
+ * Which of items (in order) the next pack takes (28.3, 28.17):
+ * - an item whose key is in the pack, or among the earlier items left, waits (writes to one key keep their order);
+ * - under the floor, the pack takes the next item whatever its size and the count, until its reserve body would pass
+ *   the request budget (request_limited);
+ * - at or over the floor, it takes an item only if it stays at or under the ceiling, under maxObjects and within the
+ *   request budget; a pack that turned one away is full, else ready;
+ * - tail (runs): when everything left is over zero and under the floor, and can join (no key in it waits on another),
+ *   the pack takes it all, within maxPackObjects and the request budget; with tailCap (a save's remnant, 28.25), only
+ *   while the pack stays within that many stored bytes.
+ */
+function planPack(items, storedOf, keyOf, requestOf, l, tail = false, tailCap) {
+    const pack = [];
+    let rest = [];
+    const keys = new Set();
+    const restKeys = new Set();
+    let stored = 0;
+    let request = 0;
+    let turned = false;
+    let limited = false;
+    const budget = requestBudget(l);
+    for (const it of items) {
+        const k = keyOf(it);
+        if (keys.has(k) || restKeys.has(k)) {
+            rest.push(it);
+            restKeys.add(k);
+            continue;
+        }
+        const n = storedOf(it);
+        const r = requestOf(it);
+        let take;
+        if (stored < l.floor) {
+            take = !limited && (pack.length === 0 || request + r <= budget);
+            limited = !take;
+        }
+        else {
+            take = stored + n <= l.ceiling && pack.length < l.maxObjects && request + r <= budget;
+            turned = turned || !take;
+        }
+        if (take) {
+            pack.push(it);
+            keys.add(k);
+            stored += n;
+            request += r;
+        }
+        else {
+            rest.push(it);
+            restKeys.add(k);
+        }
+    }
+    if (tail && rest.length > 0 && joins(rest, keyOf, keys)) {
+        let size = 0;
+        let req = 0;
+        for (const it of rest) {
+            size += storedOf(it);
+            req += requestOf(it);
+        }
+        if (size < l.floor && pack.length + rest.length <= l.maxPackObjects && request + req <= budget && (tailCap === undefined || stored + size <= tailCap)) {
+            pack.push(...rest);
+            stored += size;
+            request += req;
+            rest = [];
+            turned = false;
+        }
+    }
+    const state = stored >= l.floor ? (turned ? 'full' : 'ready') : limited ? 'request_limited' : 'under';
+    return { pack, rest, state, stored, request };
+}
+exports.planPack = planPack;
+function joins(rest, keyOf, keys) {
+    const seen = new Set(keys);
+    for (const it of rest) {
+        const k = keyOf(it);
+        if (seen.has(k))
+            return false;
+        seen.add(k);
+    }
+    return true;
+}
+/**
+ * When a save's pack goes (28.4, 28.17, 28.25). waiting is the stored bytes that can join the next pack; oldest and last
+ * the first and latest arrival among them; arrivals the saves that arrived ready to join, without the oldest waiting
+ * file's own (28.22: it says nothing about what comes next). A pack that would send with no free slot is idle.
+ *
+ * A pack under the floor goes at its time limit. Before it, it goes early only when nothing says a batch is forming
+ * (28.25):
+ * - not before its oldest file has waited l.observeMs, so a burst's arrivals reach the rate window first; unless a later
+ *   write to one of its keys waits behind it (only its going lets that write go: 75 saves to one key still go one by one
+ *   at once);
+ * - coming: the stored bytes of this bucket's packs in flight expected back before the time limit count as arriving, as
+ *   their callers will very likely save again;
+ * - not while contested: another pack waits for a slot or settles (a full or ready one, or a run's next pack), which a
+ *   leftover must not take.
+ */
+function decide(state, waiting, oldest, last, arrivals, now, l, slotFree, coming = 0, contested = false, behind = false) {
+    const send = (reason) => (slotFree ? (reason ? { kind: 'send', reason, at: 0 } : { kind: 'send', at: 0 }) : { kind: 'idle', at: 0 });
+    if (state === 'full')
+        return send();
+    if (state === 'request_limited')
+        return send('request_limit');
+    if (state === 'ready') {
+        const due = Math.min(last + l.settleMs, oldest + l.waitMs);
+        return now >= due ? send() : { kind: 'wait', at: due };
+    }
+    const left = oldest + l.waitMs - now;
+    if (left <= 0)
+        return send('leftover');
+    let at = oldest + l.waitMs;
+    if (!behind && now < oldest + l.observeMs)
+        return { kind: 'wait', at: Math.min(at, oldest + l.observeMs) };
+    let recent = 0;
+    let first;
+    for (const [t, b] of arrivals) {
+        if (t > now - l.windowMs) {
+            recent += b;
+            if (first === undefined || t < first)
+                first = t;
+        }
+    }
+    const rate = l.windowMs > 0 ? recent / l.windowMs : 0; // bytes per millisecond
+    if (!contested && waiting + coming + rate * left < l.floor)
+        return send('leftover');
+    if (first !== undefined)
+        at = Math.min(at, first + l.windowMs);
+    return { kind: 'wait', at };
+}
+exports.decide = decide;
+/**
+ * One bucket's waiting saves and their running totals (28.17, 28.22). A save whose key already has an earlier write
+ * waiting can't join the next pack: it counts neither as bytes waiting nor as an arrival. When the earlier write leaves,
+ * it joins the bytes waiting, but never counts as an arrival. The first waiting save is always one that can join, so it
+ * is the oldest the timing rule looks at.
+ */
+class Arrivals {
+    entries = new Map(); // in arrival order
+    byKey = new Map();
+    seq = 0;
+    window = [];
+    /** The stored and reserve-request bytes that can join; the latest arrival among them. */
+    waiting = 0;
+    request = 0;
+    last = 0;
+    /** Waiting saves that can't join the next pack (an earlier write to their key waits). */
+    blocked = 0;
+    get size() {
+        return this.entries.size;
+    }
+    add(item, key, stored, request, now) {
+        this.seq += 1;
+        const same = this.byKey.get(key) ?? [];
+        const e = {
+            item,
+            key,
+            stored,
+            request,
+            at: now,
+            joins: same.length === 0,
+            seq: this.seq,
+        };
+        same.push(item);
+        this.byKey.set(key, same);
+        this.entries.set(item, e);
+        if (e.joins) {
+            this.waiting += stored;
+            this.request += request;
+            this.last = now;
+            this.window.push([now, stored, e.seq]);
+        }
+        else {
+            this.blocked += 1;
+        }
+    }
+    /** Items a pack took (or that left the queue). */
+    remove(items) {
+        for (const item of items) {
+            const e = this.entries.get(item);
+            if (!e)
+                continue;
+            this.entries.delete(item);
+            const same = (this.byKey.get(e.key) ?? []).filter((x) => x !== item);
+            if (e.joins) {
+                this.waiting -= e.stored;
+                this.request -= e.request;
+            }
+            else {
+                this.blocked -= 1;
+            }
+            if (same.length === 0) {
+                this.byKey.delete(e.key);
+                continue;
+            }
+            this.byKey.set(e.key, same);
+            if (e.joins) {
+                const next = this.entries.get(same[0]);
+                if (!next.joins) {
+                    next.joins = true;
+                    this.blocked -= 1;
+                    this.waiting += next.stored;
+                    this.request += next.request;
+                }
+            }
+        }
+    }
+    /** The waiting items, in arrival order. */
+    items() {
+        return [...this.entries.keys()];
+    }
+    /** The first waiting item and when it arrived, or undefined. */
+    oldest() {
+        for (const e of this.entries.values())
+            return [e.item, e.at];
+        return undefined;
+    }
+    /** The arrivals within windowMs of now, without the oldest waiting item's own; older ones are forgotten. */
+    arrivals(now, windowMs) {
+        this.window = this.window.filter(([t]) => t > now - windowMs);
+        let skip = 0;
+        for (const e of this.entries.values()) {
+            skip = e.seq;
+            break;
+        }
+        return this.window.filter(([, , s]) => s !== skip).map(([t, b]) => [t, b]);
+    }
+    /** When a waiting item arrived. */
+    arrivedAt(item) {
+        return this.entries.get(item).at;
+    }
+    /** A waiting item's stored bytes. */
+    storedOf(item) {
+        return this.entries.get(item).stored;
+    }
+    /** The stored bytes of the saves that arrived able to join at t or later (within the rate window kept), waiting or not. */
+    arrivedSince(t) {
+        let n = 0;
+        for (const [at, b] of this.window)
+            if (at >= t)
+                n += b;
+        return n;
+    }
+    /** Whether a later write to a key in the next pack waits behind it. */
+    get behind() {
+        return this.blocked > 0;
+    }
+}
+exports.Arrivals = Arrivals;
+/**
+ * The saves' packs in flight, and when each is expected back (28.25 point 2): the callers blocked in a pack will very
+ * likely save again once it commits, so its bytes count as coming arrivals.
+ *
+ * Expected back, by phase: not uploading yet, now plus its sending time plus a commit's usual time; uploading, from the
+ * upload's start; sent, the send plus a commit's usual time (the median of the last COMMIT_SAMPLES commits,
+ * COMMIT_USUAL_START_MS until one is measured). Before any speed is measured, every pack counts as coming: at worst a
+ * save waits the time limit.
+ *
+ * A pack that committed keeps counting for a grace time (the observe time), less the bytes that arrived since it came
+ * back: its callers are on their way back, and between its commit and their saves it is neither in flight nor waiting (a
+ * small group waiting for it would otherwise go alone just before them). Times are passed in (ms).
+ */
+class InFlight {
+    packs = new Map();
+    commits = [];
+    /** Committed packs within their grace time: bucket, stored bytes, when it came back. */
+    returned = [];
+    get size() {
+        return this.packs.size;
+    }
+    add(key, bucket, stored) {
+        this.packs.set(key, { bucket, stored });
+    }
+    /** Its upload starts (again: a pack sent once more starts over). */
+    uploading(key, now) {
+        const e = this.packs.get(key);
+        if (e) {
+            e.up = now;
+            e.sent = undefined;
+        }
+    }
+    /** Its upload ended; its commit is being checked. */
+    sent(key, now) {
+        const e = this.packs.get(key);
+        if (e)
+            e.sent = now;
+    }
+    /** It left: a committed pack's time since its send is a commit's time, and it starts its grace time. */
+    remove(key, now, committed) {
+        const e = this.packs.get(key);
+        if (!e)
+            return;
+        this.packs.delete(key);
+        if (!committed)
+            return;
+        if (e.sent !== undefined) {
+            this.commits.push(Math.max(0, now - e.sent));
+            if (this.commits.length > exports.COMMIT_SAMPLES)
+                this.commits.shift();
+        }
+        this.returned.push([e.bucket, e.stored, now]);
+    }
+    /** The median of the last commits' times (ms). */
+    commitUsual() {
+        if (!this.commits.length)
+            return exports.COMMIT_USUAL_START_MS;
+        const s = [...this.commits].sort((a, b) => a - b);
+        const m = s.length >> 1;
+        return s.length % 2 ? s[m] : (s[m - 1] + s[m]) / 2;
+    }
+    /** When the pack is expected back (ms); now before any speed is measured. speed is in bytes per second. */
+    expected(key, now, speed) {
+        const e = this.packs.get(key);
+        const usual = this.commitUsual();
+        if (e.sent !== undefined)
+            return e.sent + usual;
+        if (!speed || speed <= 0)
+            return now;
+        return (e.up ?? now) + (e.stored / speed) * 1000 + usual;
+    }
+    /**
+     * The stored bytes of bucket's packs expected back by by, and of those that came back within graceMs of now less what
+     * arrived since (arrivedSince(t): the stored bytes that arrived at t or later).
+     */
+    coming(bucket, by, now, speed, graceMs = 0, arrivedSince) {
+        this.returned = this.returned.filter(([, , at]) => now < at + graceMs);
+        let ahead = 0;
+        for (const [k, e] of this.packs)
+            if (e.bucket === bucket && this.expected(k, now, speed) <= by)
+                ahead += e.stored;
+        const back = this.returned.filter(([b]) => b === bucket);
+        if (back.length) {
+            const since = Math.min(...back.map(([, , at]) => at));
+            const arrived = arrivedSince ? arrivedSince(since) : 0;
+            ahead += Math.max(0, back.reduce((n, [, s]) => n + s, 0) - arrived);
+        }
+        return ahead;
+    }
+}
+exports.InFlight = InFlight;
+/**
+ * The most stored bytes a save's pack may reach by taking its remnant (28.25): the ceiling plus the floor, never past
+ * what the measured speed sends in one request's time (28.7), nor the pack cap. l are the server's, before the speed's
+ * clamp.
+ */
+function absorbCap(l, requestBytes) {
+    const cap = Math.min(l.ceiling + l.floor, exports.MAX_PACK_BYTES);
+    return requestBytes === undefined ? cap : Math.min(cap, requestBytes);
+}
+exports.absorbCap = absorbCap;
+/**
+ * Whether what a full save's pack turns away is a remnant with nothing coming for it (28.25): its rest stored bytes,
+ * plus coming, plus its own arrivals in the window (without its oldest's) at their rate for the time its oldest has
+ * left, stay under the floor. The batch that is going is no evidence for it. Decided when the pack goes, never after a
+ * wait.
+ */
+function remnantAlone(rest, oldest, arrivals, coming, now, l) {
+    if (rest <= 0 || rest >= l.floor)
+        return false;
+    let recent = 0;
+    for (const [t, b] of arrivals)
+        if (t > now - l.windowMs)
+            recent += b;
+    const rate = l.windowMs > 0 ? recent / l.windowMs : 0;
+    const left = Math.max(0, oldest + l.waitMs - now);
+    return rest + coming + rate * left < l.floor;
+}
+exports.remnantAlone = remnantAlone;
+/**
+ * One dispatch (28.17's driver, 28.25): every bucket's decision, oldest bucket first. Returns the packs that may go now,
+ * in that order (the driver gives each a slot and memory, or holds it), and the earliest time a waiting one next needs a
+ * decision.
+ *
+ * A bucket's pack is planned only when its totals are at the floor, over the request budget, or it goes (28.22 point 6).
+ * A bucket under the floor is contested while another bucket's totals are at the floor or over the budget (a full, ready
+ * or request-limited pack waits or settles), or a run's next pack waits for a slot. planOf(arrivals, tailCap) plans a
+ * bucket's next pack, with its tail taken within tailCap bytes when given. A full pack that goes takes its remnant
+ * (remnantAlone) within cap (absorbCap; 0 takes none).
+ */
+function schedule(queues, now, l, planOf, comingOf, runsWaiting, cap = 0) {
+    const order = [...queues.entries()].filter(([, a]) => a.size > 0).sort((x, y) => x[1].oldest()[1] - y[1].oldest()[1]);
+    const budget = requestBudget(l);
+    const pending = new Set(order.filter(([, a]) => a.waiting >= l.floor || a.request > budget).map(([b]) => b));
+    const out = [];
+    let next;
+    for (const [bucket, a] of order) {
+        const oldest = a.oldest()[1];
+        const recent = a.arrivals(now, l.windowMs);
+        const coming = comingOf(bucket, oldest + l.waitMs);
+        const contested = runsWaiting || [...pending].some((b) => b !== bucket);
+        const behind = a.behind;
+        let plan;
+        let d;
+        if (!pending.has(bucket)) {
+            d = decide('under', a.waiting, oldest, a.last, recent, now, l, true, coming, contested, behind);
+        }
+        else {
+            plan = planOf(a, undefined);
+            d = decide(plan.state, plan.stored, oldest, a.last, recent, now, l, true, coming, contested, behind);
+        }
+        if (d.kind === 'send' && !plan) {
+            plan = planOf(a, undefined);
+            if (plan.state !== 'under')
+                d = decide(plan.state, plan.stored, oldest, a.last, recent, now, l, true, coming, contested, behind); // decided again from the planned pack
+        }
+        if (d.kind === 'wait') {
+            next = next === undefined ? d.at : Math.min(next, d.at);
+            continue;
+        }
+        if (!plan)
+            continue;
+        if (d.kind === 'send' && plan.state === 'full' && plan.rest.length > 0 && cap > 0) {
+            const since = a.arrivedAt(plan.rest[0]);
+            const own = plan.rest.slice(1).map((it) => [a.arrivedAt(it), a.storedOf(it)]);
+            if (remnantAlone(a.waiting - plan.stored, since, own, comingOf(bucket, since + l.waitMs), now, l)) {
+                const whole = planOf(a, cap);
+                if (!whole.rest.length && whole.stored >= l.floor)
+                    plan = whole;
+            }
+        }
+        out.push({ bucket, plan, decision: d });
+    }
+    return [out, next];
+}
+exports.schedule = schedule;
+//# sourceMappingURL=packing.js.map

package/dist/cjs/direct/packing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"packing.js","sourceRoot":"","sources":["../../../src/direct/packing.ts"],"names":[],"mappings":";AAAA,gCAAgC;AAChC,iDAAiD;;;AAEjD,qHAAqH;AACrH,uHAAuH;AACvH,gFAAgF;AAChF,EAAE;AACF,wGAAwG;AACxG,uEAAuE;AACvE,+GAA+G;AAC/G,4DAA4D;AAC5D,qHAAqH;AACrH,uBAAuB;AACvB,wHAAwH;AAE3G,QAAA,aAAa,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAC7B,QAAA,eAAe,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAC/B,QAAA,mBAAmB,GAAG,KAAM,CAAC;AAC1C,4GAA4G;AAC/F,QAAA,wBAAwB,GAAG,MAAO,CAAC;AAChD,oDAAoD;AACvC,QAAA,mBAAmB,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AACnC,QAAA,eAAe,GAAG,IAAI,CAAC;AACvB,QAAA,sBAAsB,GAAG,IAAI,CAAC;AAC9B,QAAA,iBAAiB,GAAG,GAAG,CAAC;AACrC;;;GAGG;AACU,QAAA,kBAAkB,GAAG,GAAG,CAAC;AACzB,QAAA,cAAc,GAAG,IAAI,CAAC;AACnC,mHAAmH;AACtG,QAAA,qBAAqB,GAAG,IAAI,CAAC;AAC7B,QAAA,cAAc,GAAG,CAAC,CAAC;AAChC,sEAAsE;AACzD,QAAA,gBAAgB,GAAG,GAAG,CAAC;AACpC,6DAA6D;AAChD,QAAA,UAAU,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;AACxC,4CAA4C;AAC/B,QAAA,cAAc,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAC3C,kGAAkG;AACrF,QAAA,IAAI,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;AAkB1C,uEAAuE;AAC1D,QAAA,cAAc,GAAyB,MAAM,CAAC,MAAM,CAAC;IAChE,KAAK,EAAE,qBAAa;IACpB,OAAO,EAAE,uBAAe;IACxB,UAAU,EAAE,2BAAmB;IAC/B,cAAc,EAAE,gCAAwB;IACxC,UAAU,EAAE,2BAAmB;IAC/B,MAAM,EAAE,uBAAe;IACvB,QAAQ,EAAE,8BAAsB;IAChC,QAAQ,EAAE,yBAAiB;IAC3B,SAAS,EAAE,0BAAkB;CAC9B,CAAC,CAAC;AAEH,mDAAmD;AACnD,SAAgB,aAAa,CAAC,CAAuB;IACnD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,GAAG,wBAAgB,CAAC,CAAC;AACtD,CAAC;AAFD,sCAEC;AAED,MAAM,YAAY,GAAG;IACnB,aAAa;IACb,eAAe;IACf,aAAa;IACb,kBAAkB;IAClB,mBAAmB;IACnB,SAAS;IACT,gBAAgB;IAChB,WAAW;CACH,CAAC;AAEX;;;GAGG;AACH,SAAgB,cAAc,CAAC,CAAU;IACvC,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAClD,MAAM,CAAC,GAAG,CAA4B,CAAC;IACvC,MAAM,CAAC,GAA2B,EAAE,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QACxE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KACV;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,CAAC;IAC5B,MAAM,OAAO,GAAG,CAAC,CAAC,aAAa,CAAC;IAChC,IAAI,KAAK,GAAG,CAAC,IAAI,EAAE,IAAI,OAAO,GAAG,CAAC,GAAG,KAAK,IAAI,OAAO,GAAG,sBAAc;QAAE,OAAO,SAAS,CAAC;IACzF,IAAI,CAAC,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,CAAC,gBAAgB,GAAG,CAAC,IAAI,CAAC,CAAC,iBAAiB,GAAG,CAAC,IAAI,EAAE;QAAE,OAAO,SAAS,CAAC;IACnG,KAAK,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,gBAAgB,EAAE,WAAW,CAAC;QAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,KAAM;YAAE,OAAO,SAAS,CAAC;IAC5G,kGAAkG;IAClG,IAAI,OAAO,GAAG,CAAC,CAAC,UAAU,CAAC;IAC3B,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,GAAG,0BAAkB,CAAC;SACvE,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,sBAAc;QAAE,OAAO,SAAS,CAAC;IACpI,OAAO;QACL,KAAK;QACL,OAAO;QACP,UAAU,EAAE,CAAC,CAAC,WAAW;QACzB,cAAc,EAAE,CAAC,CAAC,gBAAgB;QAClC,UAAU,EAAE,CAAC,CAAC,iBAAiB;QAC/B,MAAM,EAAE,CAAC,CAAC,OAAO;QACjB,QAAQ,EAAE,CAAC,CAAC,cAAc;QAC1B,QAAQ,EAAE,CAAC,CAAC,SAAS;QACrB,SAAS,EAAE,OAAiB;KAC7B,CAAC;AACJ,CAAC;AA7BD,wCA6BC;AAED;;;;;GAKG;AACH,SAAgB,OAAO,CAAC,CAAuB,EAAE,YAAgC;IAC/E,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,IAAI,CAAC,CAAC,OAAO;QAAE,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACtF,IAAI,YAAY,IAAI,CAAC,CAAC,KAAK;QAAE,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE,KAAK,CAAC,CAAC;IAC7E,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,YAAI,CAAC,GAAG,EAAE,YAAY,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;AAC/E,CAAC;AAJD,0BAIC;AAWD;;;;;;;;;;GAUG;AACH,SAAgB,QAAQ,CACtB,KAAmB,EACnB,QAA0B,EAC1B,KAAuB,EACvB,SAA2B,EAC3B,CAAuB,EACvB,IAAI,GAAG,KAAK,EACZ,OAAgB;IAEhB,MAAM,IAAI,GAAQ,EAAE,CAAC;IACrB,IAAI,IAAI,GAAQ,EAAE,CAAC;IACnB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAChC,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE;QACtB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAClC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACd,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChB,SAAS;SACV;QACD,MAAM,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;QACxB,IAAI,IAAa,CAAC;QAClB,IAAI,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE;YACpB,IAAI,GAAG,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC;YAChE,OAAO,GAAG,CAAC,IAAI,CAAC;SACjB;aAAM;YACL,IAAI,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,UAAU,IAAI,OAAO,GAAG,CAAC,IAAI,MAAM,CAAC;YACtF,MAAM,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC;SAC1B;QACD,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACd,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,MAAM,IAAI,CAAC,CAAC;YACZ,OAAO,IAAI,CAAC,CAAC;SACd;aAAM;YACL,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACd,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACjB;KACF;IACD,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE;QACvD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE;YACrB,IAAI,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC;YACrB,GAAG,IAAI,SAAS,CAAC,EAAE,CAAC,CAAC;SACtB;QACD,IAAI,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,cAAc,IAAI,OAAO,GAAG,GAAG,IAAI,MAAM,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,MAAM,GAAG,IAAI,IAAI,OAAO,CAAC,EAAE;YACrJ,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;YACnB,MAAM,IAAI,IAAI,CAAC;YACf,OAAO,IAAI,GAAG,CAAC;YACf,IAAI,GAAG,EAAE,CAAC;YACV,MAAM,GAAG,KAAK,CAAC;SAChB;KACF;IACD,MAAM,KAAK,GAAc,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC;IACjH,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;AAChD,CAAC;AA9DD,4BA8DC;AAED,SAAS,KAAK,CAAI,IAAkB,EAAE,KAAuB,EAAE,IAAiB;IAC9E,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC3B,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE;QACrB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;KACb;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAYD;;;;;;;;;;;;;;GAcG;AACH,SAAgB,MAAM,CACpB,KAAgB,EAChB,OAAe,EACf,MAAc,EACd,IAAY,EACZ,QAA4B,EAC5B,GAAW,EACX,CAAuB,EACvB,QAAiB,EACjB,MAAM,GAAG,CAAC,EACV,SAAS,GAAG,KAAK,EACjB,MAAM,GAAG,KAAK;IAEd,MAAM,IAAI,GAAG,CAAC,MAAmB,EAAY,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAC5J,IAAI,KAAK,KAAK,MAAM;QAAE,OAAO,IAAI,EAAE,CAAC;IACpC,IAAI,KAAK,KAAK,iBAAiB;QAAE,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC;IAC9D,IAAI,KAAK,KAAK,OAAO,EAAE;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAC3D,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;KACxD;IACD,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC;IACrC,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC;IACvC,IAAI,EAAE,GAAG,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3B,IAAI,CAAC,MAAM,IAAI,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC,SAAS;QAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;IAC3G,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,KAAyB,CAAC;IAC9B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,QAAQ,EAAE;QAC7B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,QAAQ,EAAE;YACxB,MAAM,IAAI,CAAC,CAAC;YACZ,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,GAAG,KAAK;gBAAE,KAAK,GAAG,CAAC,CAAC;SACjD;KACF;IACD,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAwB;IAC/E,IAAI,CAAC,SAAS,IAAI,OAAO,GAAG,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC;IACpF,IAAI,KAAK,KAAK,SAAS;QAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC/D,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAC9B,CAAC;AApCD,wBAoCC;AAYD;;;;;GAKG;AACH,MAAa,QAAQ;IACX,OAAO,GAAG,IAAI,GAAG,EAAe,CAAC,CAAC,mBAAmB;IACrD,KAAK,GAAG,IAAI,GAAG,EAAe,CAAC;IAC/B,GAAG,GAAG,CAAC,CAAC;IACR,MAAM,GAAqD,EAAE,CAAC;IACtE,yFAAyF;IACzF,OAAO,GAAG,CAAC,CAAC;IACZ,OAAO,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,CAAC,CAAC;IACT,yFAAyF;IACzF,OAAO,GAAG,CAAC,CAAC;IAEZ,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED,GAAG,CAAC,IAAO,EAAE,GAAW,EAAE,MAAc,EAAE,OAAe,EAAE,GAAW;QACpE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,CAAC,GAAa;YAClB,IAAI;YACJ,GAAG;YACH,MAAM;YACN,OAAO;YACP,EAAE,EAAE,GAAG;YACP,KAAK,EAAE,IAAI,CAAC,MAAM,KAAK,CAAC;YACxB,GAAG,EAAE,IAAI,CAAC,GAAG;SACd,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,CAAC,KAAK,EAAE;YACX,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC;YACvB,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC;YACxB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;YAChB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;SACxC;aAAM;YACL,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;SACnB;IACH,CAAC;IAED,kDAAkD;IAClD,MAAM,CAAC,KAAkB;QACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACxB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,CAAC,CAAC;gBAAE,SAAS;YACjB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YACrE,IAAI,CAAC,CAAC,KAAK,EAAE;gBACX,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,MAAM,CAAC;gBACzB,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC;aAC3B;iBAAM;gBACL,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;aACnB;YACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;gBACrB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACzB,SAAS;aACV;YACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC,KAAK,EAAE;gBACX,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;oBACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;oBAClB,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;oBAClB,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC;oBAC5B,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC;iBAC9B;aACF;SACF;IACH,CAAC;IAED,2CAA2C;IAC3C,KAAK;QACH,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IAClC,CAAC;IAED,gEAAgE;IAChE,MAAM;QACJ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7D,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,4GAA4G;IAC5G,QAAQ,CAAC,GAAW,EAAE,QAAgB;QACpC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,GAAG,QAAQ,CAAC,CAAC;QAC9D,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE;YACrC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC;YACb,MAAM;SACP;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,AAAD,EAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAU,CAAC,CAAC;IACtF,CAAC;IAED,mCAAmC;IACnC,SAAS,CAAC,IAAO;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,EAAE,CAAC;IACpC,CAAC;IAED,qCAAqC;IACrC,QAAQ,CAAC,IAAO;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,MAAM,CAAC;IACxC,CAAC;IAED,2HAA2H;IAC3H,YAAY,CAAC,CAAS;QACpB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM;YAAE,IAAI,EAAE,IAAI,CAAC;gBAAE,CAAC,IAAI,CAAC,CAAC;QACvD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,uEAAuE;IACvE,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IAC1B,CAAC;CACF;AAlHD,4BAkHC;AASD;;;;;;;;;;;;GAYG;AACH,MAAa,QAAQ;IACX,KAAK,GAAG,IAAI,GAAG,EAAa,CAAC;IAC7B,OAAO,GAAa,EAAE,CAAC;IAC/B,wFAAwF;IACxF,QAAQ,GAAwD,EAAE,CAAC;IAEnE,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,MAAc,EAAE,MAAc;QACxC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,oEAAoE;IACpE,SAAS,CAAC,GAAM,EAAE,GAAW;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,EAAE;YACL,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC;YACX,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC;SACpB;IACH,CAAC;IAED,qDAAqD;IACrD,IAAI,CAAC,GAAM,EAAE,GAAW;QACtB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC;YAAE,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC;IACtB,CAAC;IAED,wGAAwG;IACxG,MAAM,CAAC,GAAM,EAAE,GAAW,EAAE,SAAkB;QAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,CAAC;YAAE,OAAO;QACf,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,SAAS;YAAE,OAAO;QACvB,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE;YACxB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7C,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,sBAAc;gBAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;SAChE;QACD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,kDAAkD;IAClD,WAAW;QACT,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO,6BAAqB,CAAC;QACvD,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;QACxB,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,2GAA2G;IAC3G,QAAQ,CAAC,GAAM,EAAE,GAAW,EAAE,KAAyB;QACrD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;YAAE,OAAO,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC;QAChD,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,GAAG,CAAC;QACrC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC;IAC3D,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,MAAc,EAAE,EAAU,EAAE,GAAW,EAAE,KAAyB,EAAE,OAAO,GAAG,CAAC,EAAE,YAAoC;QAC1H,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,AAAD,EAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,GAAG,OAAO,CAAC,CAAC;QACvE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE;gBAAE,KAAK,IAAI,CAAC,CAAC,MAAM,CAAC;QAClH,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC;QACzD,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,AAAD,EAAG,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACtD,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvD,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;SACrE;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA3ED,4BA2EC;AAED;;;;GAIG;AACH,SAAgB,SAAS,CAAC,CAAuB,EAAE,YAAgC;IACjF,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,KAAK,EAAE,sBAAc,CAAC,CAAC;IAC1D,OAAO,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;AACxE,CAAC;AAHD,8BAGC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,IAAY,EAAE,MAAc,EAAE,QAA4B,EAAE,MAAc,EAAE,GAAW,EAAE,CAAuB;IAC3I,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IAC/C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,QAAQ;QAAE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,QAAQ;YAAE,MAAM,IAAI,CAAC,CAAC;IACrE,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;IAClD,OAAO,IAAI,GAAG,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;AAC/C,CAAC;AAPD,oCAOC;AASD;;;;;;;;;;GAUG;AACH,SAAgB,QAAQ,CACtB,MAAwC,EACxC,GAAW,EACX,CAAuB,EACvB,MAAgE,EAChE,QAAgD,EAChD,WAAoB,EACpB,GAAG,GAAG,CAAC;IAEP,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACxH,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,OAAO,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7G,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,IAAI,IAAwB,CAAC;IAC7B,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE;QAC/B,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,EAAG,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC3C,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,WAAW,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC;QACxE,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QACxB,IAAI,IAAyB,CAAC;QAC9B,IAAI,CAAW,CAAC;QAChB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACxB,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;SACjG;aAAM;YACL,IAAI,GAAG,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAC5B,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;SACtG;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,IAAI,EAAE;YAC9B,IAAI,GAAG,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,KAAK,KAAK,OAAO;gBAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,sCAAsC;SACzK;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE;YACrB,IAAI,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACxD,SAAS;SACV;QACD,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE;YACjF,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,GAAG,GAAc,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAU,CAAC,CAAC;YAClG,IAAI,YAAY,CAAC,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE;gBACjG,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK;oBAAE,IAAI,GAAG,KAAK,CAAC;aACjE;SACF;QACD,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;KACzC;IACD,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AACrB,CAAC;AAhDD,4BAgDC"}