@peerbit/shared-log 8.0.7 → 9.0.0-55cebfe

package/dist/src/ranges.js

@@ -0,0 +1,645 @@
+import { equals } from "@peerbit/crypto";
+import { And, Compare, IntegerCompare, Or, SearchRequest, Sort, SortDirection, StringMatch, iterate, iteratorInSeries, } from "@peerbit/indexer-interface";
+import {} from "./replication.js";
+import { SEGMENT_COORDINATE_SCALE } from "./role.js";
+/*
+export const containsPoint = (
+    rect: { offset: number; length: number },
+    point: number,
+    eps = 0.00001 // we do this to handle numerical errors
+) => {
+    if (rect.factor === 0) {
+        return false;
+    }
+    const start = rect.offset;
+    const width = rect.factor + eps; // we do this to handle numerical errors. It is better to be more inclusive
+    const endUnwrapped = rect.offset + width;
+    let end = endUnwrapped;
+    let wrapped = false;
+    if (endUnwrapped > 1) {
+        end = endUnwrapped % 1;
+        wrapped = true;
+    }
+
+    const inFirstInterval = point >= start && point < Math.min(endUnwrapped, 1);
+    const inSecondInterval =
+        !inFirstInterval && wrapped && point >= 0 && point < end;
+
+    return inFirstInterval || inSecondInterval;
+}; */
+/* const resolveRectsThatContainPoint = async (
+    rects: Index<ReplicationRangeIndexable>,
+    point: number,
+    roleAgeLimit: number,
+    matured: boolean
+): Promise<ReplicationRangeIndexable[]> => {
+    // point is between 0 and 1, and the range can start at any offset between 0 and 1 and have length between 0 and 1
+    // so we need to query for all ranges that contain the point
+    const scaledPoint = Math.round(point * SEGMENT_COORDINATE_SCALE)
+    let queries = [
+        new IntegerCompare({ key: 'start', compare: Compare.LessOrEqual, value: scaledPoint }),
+        new IntegerCompare({ key: 'end', compare: Compare.Greater, value: scaledPoint }),
+        new IntegerCompare({ key: 'timestamp', compare: matured ? Compare.LessOrEqual : Compare.Greater, value: Date.now() - roleAgeLimit })
+    ]
+
+    const results = await rects.query(new SearchRequest({
+        query: [
+            new Nested({
+                path: 'segments',
+                query: queries
+            })
+        ]
+    }))
+    return results.results.map(x => x.value)
+} */
+/* const resolveRectsInRange = async (rects: Index<ReplicationRangeIndexable>,
+    start: number,
+    end: number,
+    roleAgeLimit: number,
+    matured: boolean
+): Promise<ReplicationRangeIndexable[]> => {
+    // point is between 0 and 1, and the range can start at any offset between 0 and 1 and have length between 0 and 1
+    // so we need to query for all ranges that contain the point
+    let endScaled = Math.round(end * SEGMENT_COORDINATE_SCALE);
+    let startScaled = Math.round(start * SEGMENT_COORDINATE_SCALE);
+    let queries = [
+        new Or([
+            new And([
+                new IntegerCompare({ key: 'start1', compare: Compare.Less, value: endScaled }),
+                new IntegerCompare({ key: 'end1', compare: Compare.GreaterOrEqual, value: startScaled }),
+            ]),
+            new And([
+                new IntegerCompare({ key: 'start2', compare: Compare.Less, value: endScaled }),
+                new IntegerCompare({ key: 'end2', compare: Compare.GreaterOrEqual, value: startScaled }),
+            ])
+        ]),
+        new IntegerCompare({ key: 'timestamp', compare: matured ? Compare.LessOrEqual : Compare.Greater, value: BigInt(+new Date - roleAgeLimit) })
+    ]
+
+    const results = await rects.query(new SearchRequest({
+        query: queries,
+        sort: [new Sort({ key: "start1" }), new Sort({ key: "start2" })],
+        fetch: 0xffffffff
+    }))
+    return results.results.map(x => x.value)
+} */
+const containingPoint = (rects, point, roleAgeLimit, matured, now, options) => {
+    // point is between 0 and 1, and the range can start at any offset between 0 and 1 and have length between 0 and 1
+    // so we need to query for all ranges that contain the point
+    let pointScaled = Math.round(point * (options?.scaled ? 1 : SEGMENT_COORDINATE_SCALE));
+    let queries = [
+        new Or([
+            new And([
+                new IntegerCompare({
+                    key: "start1",
+                    compare: Compare.LessOrEqual,
+                    value: pointScaled,
+                }),
+                new IntegerCompare({
+                    key: "end1",
+                    compare: Compare.Greater,
+                    value: pointScaled,
+                }),
+            ]),
+            new And([
+                new IntegerCompare({
+                    key: "start2",
+                    compare: Compare.LessOrEqual,
+                    value: pointScaled,
+                }),
+                new IntegerCompare({
+                    key: "end2",
+                    compare: Compare.Greater,
+                    value: pointScaled,
+                }),
+            ]),
+        ]),
+        new IntegerCompare({
+            key: "timestamp",
+            compare: matured ? Compare.LessOrEqual : Compare.Greater,
+            value: BigInt(now - roleAgeLimit),
+        }),
+    ];
+    return iterate(rects, new SearchRequest({
+        query: queries,
+        sort: options?.sort,
+        fetch: 0xffffffff,
+    }));
+    /* const results = await rects.query(new SearchRequest({
+        query: queries,
+        sort: options?.sort,
+        fetch: 0xffffffff
+    }))
+    return results.results.map(x => x.value) */
+};
+const getClosest = (direction, rects, point, roleAgeLimit, matured, now, scaled = false) => {
+    const scaledPoint = Math.round(point * (scaled ? 1 : SEGMENT_COORDINATE_SCALE));
+    const createQueries = (p, equality) => {
+        let queries;
+        if (direction === "below") {
+            queries = [
+                new IntegerCompare({
+                    key: "end2",
+                    compare: equality ? Compare.LessOrEqual : Compare.Less,
+                    value: p,
+                }),
+                new IntegerCompare({
+                    key: "timestamp",
+                    compare: matured ? Compare.LessOrEqual : Compare.GreaterOrEqual,
+                    value: BigInt(now - roleAgeLimit),
+                }),
+            ];
+        }
+        else {
+            queries = [
+                new IntegerCompare({
+                    key: "start1",
+                    compare: equality ? Compare.GreaterOrEqual : Compare.Greater,
+                    value: p,
+                }),
+                new IntegerCompare({
+                    key: "timestamp",
+                    compare: matured ? Compare.LessOrEqual : Compare.GreaterOrEqual,
+                    value: BigInt(now - roleAgeLimit),
+                }),
+            ];
+        }
+        queries.push(new IntegerCompare({ key: "width", compare: Compare.Greater, value: 0 }));
+        return queries;
+    };
+    const iterator = iterate(rects, new SearchRequest({
+        query: createQueries(scaledPoint, false),
+        sort: direction === "below"
+            ? new Sort({ key: ["end2"], direction: "desc" })
+            : new Sort({ key: ["start1"], direction: "asc" }),
+    }));
+    const iteratorWrapped = iterate(rects, new SearchRequest({
+        query: createQueries(direction === "below" ? SEGMENT_COORDINATE_SCALE : 0, true),
+        sort: direction === "below"
+            ? new Sort({ key: ["end2"], direction: "desc" })
+            : new Sort({ key: ["start1"], direction: "asc" }),
+    }));
+    return joinIterator([iterator, iteratorWrapped], scaledPoint, true, direction);
+};
+export const getDistance = (from, to, direction, end = SEGMENT_COORDINATE_SCALE) => {
+    // if direction is 'above' only measure distance from 'from to 'to' from above.
+    // i.e if from < to, then from needs to wrap around 0 to 1 and then to to
+    // if direction is 'below' and from > to, then from needs to wrap around 1 to 0 and then to to
+    // if direction is 'closest' then the shortest distance is the distance
+    // also from is 0.1 and to is 0.9, then distance should be 0.2 not 0.8
+    // same as for if from is 0.9 and to is 0.1, then distance should be 0.2 not 0.8
+    if (direction === "closest") {
+        if (from === to) {
+            return 0;
+        }
+        return Math.min(Math.abs(from - to), Math.abs(end - Math.abs(from - to)));
+    }
+    if (direction === "above") {
+        if (from <= to) {
+            return Math.abs(end - to) + from;
+        }
+        return from - to;
+    }
+    if (direction === "below") {
+        if (from >= to) {
+            return Math.abs(end - from) + to;
+        }
+        return to - from;
+    }
+    throw new Error("Invalid direction");
+};
+const joinIterator = (iterators, point, scaled, direction) => {
+    const scaledPoint = Math.round(point * (scaled ? 1 : SEGMENT_COORDINATE_SCALE));
+    let queues = [];
+    return {
+        next: async (count) => {
+            let results = {
+                kept: 0, // TODO
+                results: [],
+            };
+            for (let i = 0; i < iterators.length; i++) {
+                let queue = queues[i];
+                if (!queue) {
+                    queue = { elements: [], kept: 0 };
+                    queues[i] = queue;
+                }
+                let iterator = iterators[i];
+                if (queue.elements.length < count && iterator.done() === false) {
+                    let res = await iterator.next(count);
+                    queue.kept = res.kept;
+                    for (const el of res.results) {
+                        const closest = el.value;
+                        let dist;
+                        if (direction === "closest") {
+                            dist = Math.min(getDistance(closest.start1, scaledPoint, direction), getDistance(closest.end2, scaledPoint, direction));
+                        }
+                        else if (direction === "above") {
+                            dist = getDistance(closest.start1, scaledPoint, direction);
+                        }
+                        else if (direction === "below") {
+                            dist = getDistance(closest.end2, scaledPoint, direction);
+                        }
+                        else {
+                            throw new Error("Invalid direction");
+                        }
+                        queue.elements.push({ result: el, dist });
+                    }
+                }
+            }
+            // pull the 'count' the closest element from one of the queue
+            for (let i = 0; i < count; i++) {
+                let closestQueue = -1;
+                let closestDist = Number.MAX_SAFE_INTEGER;
+                for (let j = 0; j < queues.length; j++) {
+                    let queue = queues[j];
+                    if (queue && queue.elements.length > 0) {
+                        let closest = queue.elements[0];
+                        if (closest.dist < closestDist) {
+                            closestDist = closest.dist;
+                            closestQueue = j;
+                        }
+                    }
+                }
+                if (closestQueue === -1) {
+                    break;
+                }
+                let closest = queues[closestQueue]?.elements.shift();
+                if (closest) {
+                    results.results.push(closest.result);
+                }
+            }
+            for (let i = 0; i < queues.length; i++) {
+                results.kept += queues[i].elements.length + queues[i].kept;
+            }
+            return results;
+        },
+        done: () => iterators.every((x) => x.done()),
+        close: async () => {
+            for (const iterator of iterators) {
+                await iterator.close();
+            }
+        },
+        all: async () => {
+            let results = [];
+            for (const iterator of iterators) {
+                let res = await iterator.all();
+                results.push(...res);
+            }
+            return results;
+        },
+    };
+};
+const getClosestAround = (peers, point, roleAge, now, scaled) => {
+    const closestBelow = getClosest("below", peers, point, roleAge, true, now, scaled);
+    const closestAbove = getClosest("above", peers, point, roleAge, true, now, scaled);
+    const containing = containingPoint(peers, point, roleAge, true, now, {
+        scaled: scaled,
+    });
+    return iteratorInSeries(containing, joinIterator([closestBelow, closestAbove], point, scaled, "closest"));
+};
+const collectNodesAroundPoint = async (roleAge, peers, collector, point, now, done = () => true) => {
+    const containing = containingPoint(peers, point, 0, true, now, {
+        scaled: false,
+    });
+    const allContaining = await containing.next(0xffffffff);
+    for (const rect of allContaining.results) {
+        collector(rect.value, isMatured(rect.value, now, roleAge));
+    }
+    if (done()) {
+        return;
+    }
+    const closestBelow = getClosest("below", peers, point, 0, true, now, false);
+    const closestAbove = getClosest("above", peers, point, 0, true, now, false);
+    const aroundIterator = joinIterator([closestBelow, closestAbove], point, false, "closest");
+    while (aroundIterator.done() === false && done() === false) {
+        const res = await aroundIterator.next(1);
+        for (const rect of res.results) {
+            collector(rect.value, isMatured(rect.value, now, roleAge));
+            if (done()) {
+                return;
+            }
+        }
+    }
+};
+export const isMatured = (segment, now, minAge) => {
+    return now - Number(segment.timestamp) >= minAge;
+};
+export const getSamples = async (cursor, peers, amount, roleAge) => {
+    const leaders = new Set();
+    const width = 1;
+    if (!peers) {
+        return [];
+    }
+    const size = await peers.getSize();
+    amount = Math.min(amount, size);
+    if (amount === 0) {
+        return [];
+    }
+    const now = +new Date();
+    const maturedLeaders = new Set();
+    for (let i = 0; i < amount; i++) {
+        // evenly distributed
+        const point = ((cursor + i / amount) % 1) * width;
+        // aquire at least one unique node for each point
+        await collectNodesAroundPoint(roleAge, peers, (rect, m) => {
+            // console.log(m, rect.start1 / SEGMENT_COORDINATE_SCALE, rect.width / SEGMENT_COORDINATE_SCALE)
+            if (m) {
+                maturedLeaders.add(rect.hash);
+            }
+            leaders.add(rect.hash);
+        }, point, now, () => {
+            if (maturedLeaders.size > i) {
+                return true;
+            }
+            return false;
+        });
+    }
+    return [...leaders];
+};
+const fetchOne = async (iterator) => {
+    const value = await iterator.next(1);
+    await iterator.close();
+    return value.results[0]?.value;
+};
+export const getCoverSet = async (coveringWidth, peers, roleAge, startNodeIdentity) => {
+    let now = +new Date();
+    // find a good starting point
+    let startNode = undefined;
+    if (startNodeIdentity) {
+        // start at our node (local first)
+        let result = await peers.query(new SearchRequest({
+            query: [
+                new StringMatch({ key: "hash", value: startNodeIdentity.hashcode() }),
+            ],
+            fetch: 1,
+        }));
+        startNode = result.results[0]?.value;
+        if (startNode) {
+            if (!isMatured(startNode, now, roleAge)) {
+                const matured = await fetchOne(getClosestAround(peers, startNode.start1, roleAge, now, true));
+                if (matured) {
+                    startNode = matured;
+                }
+            }
+        }
+    }
+    let startLocation;
+    if (!startNode) {
+        startLocation = Math.random() * SEGMENT_COORDINATE_SCALE;
+        startNode = await fetchOne(getClosestAround(peers, startLocation, roleAge, now, true));
+    }
+    else {
+        // TODO choose start location as the point with the longest range?
+        startLocation =
+            startNode.start1 ?? Math.random() * SEGMENT_COORDINATE_SCALE;
+    }
+    /* const startNode = walker; */
+    if (!startNode) {
+        return new Set();
+    }
+    let results = [];
+    let widthToCoverScaled = coveringWidth * SEGMENT_COORDINATE_SCALE;
+    const endLocation = (startLocation + widthToCoverScaled) % SEGMENT_COORDINATE_SCALE;
+    const endIsWrapped = endLocation <= startLocation;
+    const endRect = (await fetchOne(getClosestAround(peers, endLocation, roleAge, now, true))) || (await fetchOne(getClosestAround(peers, endLocation, 0, now, true))); // (await getClosest('above', peers, nextLocation, roleAge, true, 1, true))[0]
+    if (!endRect) {
+        return new Set();
+    }
+    let current = 
+    /* (await getClosestAround(peers, startLocation, roleAge, 1, true))[0] */ startNode ||
+        (await fetchOne(getClosestAround(peers, startLocation, 0, now, true))); //(await getClosest('above', peers, startLocation, roleAge, true, 1, true))[0]
+    let coveredLength = current.width;
+    let nextLocation = current.end2;
+    // push edges
+    results.push(endRect);
+    results.push(current);
+    /* const endIsSameAsStart = equals(endRect.id, current.id); */
+    const resolveNextContaining = async (nextLocation, roleAge) => {
+        let next = await fetchOne(containingPoint(peers, nextLocation, roleAge, true, now, {
+            scaled: true,
+            sort: [new Sort({ key: "end2", direction: SortDirection.DESC })],
+        })); // get entersecting sort by largest end2
+        return next;
+    };
+    const resolveNextAbove = async (nextLocation, roleAge) => {
+        // if not get closest from above
+        let next = await fetchOne(getClosest("above", peers, nextLocation, roleAge, true, now, true));
+        return next;
+    };
+    const resolveNext = async (nextLocation, roleAge) => {
+        const containing = await resolveNextContaining(nextLocation, roleAge);
+        if (containing) {
+            return [containing, true];
+        }
+        return [await resolveNextAbove(nextLocation, roleAge), false];
+    };
+    // fill the middle
+    let wrappedOnce = current.end2 < current.end1;
+    let maturedCoveredLength = coveredLength;
+    /* 	let lastMatured = isMatured(startNode, now, roleAge) ? startNode : undefined;
+     */
+    while (maturedCoveredLength < widthToCoverScaled &&
+        coveredLength <= SEGMENT_COORDINATE_SCALE) {
+        let nextCandidate = await resolveNext(nextLocation, roleAge);
+        /* let fromAbove = false; */
+        let matured = true;
+        if (!nextCandidate[0]) {
+            matured = false;
+            nextCandidate = await resolveNext(nextLocation, 0);
+            /* fromAbove = true; */
+        }
+        if (!nextCandidate[0]) {
+            break;
+        }
+        current = nextCandidate[0];
+        let distanceBefore = coveredLength;
+        if (current.end2 < nextLocation) {
+            wrappedOnce = true;
+            coveredLength += SEGMENT_COORDINATE_SCALE - nextLocation;
+            coveredLength += current.end2;
+        }
+        else {
+            coveredLength += current.end1 - nextLocation;
+        }
+        let isLast = distanceBefore < widthToCoverScaled &&
+            coveredLength >= widthToCoverScaled;
+        if ((isLast &&
+            !nextCandidate[1]) /* || Math.min(current.start1, current.start2) > Math.min(endRect.start1, endRect.start2) */ /* (Math.min(current.start1, current.start2) > endLocation) */ ||
+            equals(endRect.id, current.id)) {
+            /* if ((isLast && ((endIsWrapped && wrappedOnce) || (!endIsWrapped))) && (current.start1 > endLocation || equals(current.id, endRect.id))) { */
+            // this is the end!
+            /* if (lastMatured && lastMatured.distanceTo(endLocation) < current.distanceTo(endLocation)) {
+                breaks;
+            } */
+            break;
+        }
+        /* if (fromAbove && next && next.start1 > endRect.start1 && (endIsWrapped === false || wrappedOnce)) {
+            break;
+        } */
+        // this is a skip condition to not include too many rects
+        if (matured) {
+            maturedCoveredLength = coveredLength;
+            /* lastMatured = current; */
+        }
+        results.push(current);
+        /*
+        
+                if (current.start1 > endLocation && (wrappedOnce || !endIsWrapped)) {
+                    break;
+                }
+        
+         */
+        nextLocation = endIsWrapped
+            ? wrappedOnce
+                ? Math.min(current.end2, endLocation)
+                : current.end2
+            : Math.min(current.end2, endLocation);
+    }
+    const res = new Set(results.map((x) => x.hash));
+    startNodeIdentity && res.add(startNodeIdentity.hashcode());
+    return res;
+    //
+    /* const set: Set<string> = new Set();
+    let currentNode = startNode;
+    const t = +new Date();
+    
+    let wrappedOnce = false;
+    const startPoint = startNode.segment.offset;
+    
+    const getNextPoint = (): [number, number, number, boolean] => {
+        let nextPoint =
+            currentNode.segment.offset + currentNode.segment.factor;
+    
+        if (nextPoint > 1 || nextPoint < startPoint) {
+            wrappedOnce = true;
+        }
+    
+        nextPoint = nextPoint % 1;
+        let distanceStart: number;
+    
+        if (wrappedOnce) {
+            distanceStart = (1 - startPoint + currentNode.segment.offset) % 1;
+        } else {
+            distanceStart = (currentNode.segment.offset - startPoint) % 1;
+        }
+    
+        const distanceEnd = distanceStart + currentNode.segment.factor;
+    
+        return [nextPoint, distanceStart, distanceEnd, wrappedOnce];
+    };
+    
+    const getNextMatured = async (from: ReplicatorRect) => {
+        let next = (await peers.query(new SearchRequest({ query: [new IntegerCompare({ key: ['segment', 'offset'], compare: Compare.Greater, value: from.segment.offset })], fetch: 1 })))?.results[0]?.value  // (from.next || peers.head)!;
+        while (
+            next.hash !== from.hash &&
+            next.hash !== startNode.hash
+        ) {
+            if (isMatured(next.segment, t, roleAge)) {
+                return next;
+            }
+            next = (next.next || peers.head)!;
+        }
+        return undefined;
+    }; */
+    /**
+     * The purpose of this loop is to cover at least coveringWidth
+     * so that if we query all nodes in this range, we know we will
+     * "query" all data in that range
+     */
+    /* let isPastThePoint = false;
+    outer: while (currentNode) {
+        if (set.has(currentNode.hash)) break;
+    
+        const [nextPoint, distanceStart, distanceEnd, wrapped] = getNextPoint();
+    
+        if (distanceStart <= coveringWidth) {
+            set.add(currentNode.hash);
+        }
+    
+        if (distanceEnd >= coveringWidth) {
+            break;
+        }
+    
+        let next = currentNode.next || peers.head;
+        while (next) {
+            if (next.value.publicKey.equals(startNode.value.publicKey)) {
+                break outer;
+            }
+    
+            const prevOffset = (next.prev || peers.tail)!.value.role.offset;
+            const nextOffset = next.value.role.offset;
+            const nextHasWrapped = nextOffset < prevOffset;
+    
+            if (
+                (!wrapped && nextOffset > nextPoint) ||
+                (nextHasWrapped &&
+                    (wrapped ? nextOffset > nextPoint : prevOffset < nextPoint)) ||
+                (!nextHasWrapped && prevOffset < nextPoint && nextPoint <= nextOffset)
+            ) {
+                isPastThePoint = true;
+            }
+    
+            if (isPastThePoint) {
+                break; // include this next in the set;
+            }
+    
+            const overlapsRange = containsPoint(next.value.role, nextPoint);
+    
+            if (overlapsRange) {
+                // Find out if there is a better choice ahead of us
+                const nextNext = await getNextMatured(next);
+                if (
+                    nextNext &&
+                    nextNext.hash === currentNode.hash &&
+                    nextNext.segment.offset < nextPoint &&
+                    nextNext.segment.offset + nextNext.segment.factor > nextPoint
+                ) {
+                    // nextNext is better (continue to iterate)
+                } else {
+                    // done
+                    break;
+                }
+            } else {
+                // (continue to iterate)
+            }
+    
+            next = next.next || peers.head;
+        }
+        currentNode = next!;
+    } */
+    // collect 1 point around the boundary of the start and one at the end,
+    // preferrd matured and that we already have it
+    /* for (const point of [
+        startNode.segment.offset,
+        (startNode.segment.offset + coveringWidth) % 1
+    ]) {
+        let done = false;
+        const unmatured: string[] = [];
+        collectNodesAroundPoint(
+            t,
+            roleAge,
+            peers,
+            isMatured(startNode.segment, t, roleAge) ? startNode : peers.head, // start at startNode is matured, else start at head (we only seek to find one matured node at the point)
+            (rect, matured) => {
+                if (matured) {
+                    if (set.has(rect.hash)) {
+                        // great!
+                    } else {
+                        set.add(rect.hash);
+                    }
+                    done = true;
+                } else {
+                    unmatured.push(rect.hash);
+                }
+            },
+            point,
+            () => done
+        );
+        if (!done && unmatured.length > 0) {
+            set.add(unmatured[0]);
+            // TODO add more elements?
+        }
+    }
+    return set; */
+};
+//# sourceMappingURL=ranges.js.map

package/dist/src/ranges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ranges.js","sourceRoot":"","sources":["../../src/ranges.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAC7D,OAAO,EACN,GAAG,EACH,OAAO,EAKP,cAAc,EACd,EAAE,EAEF,aAAa,EACb,IAAI,EACJ,aAAa,EACb,WAAW,EACX,OAAO,EACP,gBAAgB,GAChB,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAGN,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,wBAAwB,EAAE,MAAM,WAAW,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;KAwBK;AAEL;;;;;;;;;;;;;;;;;;;;;;;;IAwBI;AAEJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;IA8BI;AAEJ,MAAM,eAAe,GAAG,CACvB,KAAuC,EACvC,KAAa,EACb,YAAoB,EACpB,OAAgB,EAChB,GAAW,EACX,OAGC,EAC0C,EAAE;IAC7C,kHAAkH;IAClH,4DAA4D;IAC5D,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,CAC3B,KAAK,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAwB,CAAC,CACxD,CAAC;IACF,IAAI,OAAO,GAAG;QACb,IAAI,EAAE,CAAC;YACN,IAAI,GAAG,CAAC;gBACP,IAAI,cAAc,CAAC;oBAClB,GAAG,EAAE,QAAQ;oBACb,OAAO,EAAE,OAAO,CAAC,WAAW;oBAC5B,KAAK,EAAE,WAAW;iBAClB,CAAC;gBACF,IAAI,cAAc,CAAC;oBAClB,GAAG,EAAE,MAAM;oBACX,OAAO,EAAE,OAAO,CAAC,OAAO;oBACxB,KAAK,EAAE,WAAW;iBAClB,CAAC;aACF,CAAC;YACF,IAAI,GAAG,CAAC;gBACP,IAAI,cAAc,CAAC;oBAClB,GAAG,EAAE,QAAQ;oBACb,OAAO,EAAE,OAAO,CAAC,WAAW;oBAC5B,KAAK,EAAE,WAAW;iBAClB,CAAC;gBACF,IAAI,cAAc,CAAC;oBAClB,GAAG,EAAE,MAAM;oBACX,OAAO,EAAE,OAAO,CAAC,OAAO;oBACxB,KAAK,EAAE,WAAW;iBAClB,CAAC;aACF,CAAC;SACF,CAAC;QACF,IAAI,cAAc,CAAC;YAClB,GAAG,EAAE,WAAW;YAChB,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO;YACxD,KAAK,EAAE,MAAM,CAAC,GAAG,GAAG,YAAY,CAAC;SACjC,CAAC;KACF,CAAC;IACF,OAAO,OAAO,CACb,KAAK,EACL,IAAI,aAAa,CAAC;QACjB,KAAK,EAAE,OAAO;QACd,IAAI,EAAE,OAAO,EAAE,IAAI;QACnB,KAAK,EAAE,UAAU;KACjB,CAAC,CACF,CAAC;IACF;;;;;+CAK2C;AAC5C,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAClB,SAA4B,EAC5B,KAAuC,EACvC,KAAa,EACb,YAAoB,EACpB,OAAgB,EAChB,GAAW,EACX,SAAkB,KAAK,EACoB,EAAE;IAC7C,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAC7B,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAC/C,CAAC;IACF,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,QAAiB,EAAE,EAAE;QACtD,IAAI,OAAgB,CAAC;QACrB,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;YAC3B,OAAO,GAAG;gBACT,IAAI,cAAc,CAAC;oBAClB,GAAG,EAAE,MAAM;oBACX,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI;oBACtD,KAAK,EAAE,CAAC;iBACR,CAAC;gBACF,IAAI,cAAc,CAAC;oBAClB,GAAG,EAAE,WAAW;oBAChB,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,cAAc;oBAC/D,KAAK,EAAE,MAAM,CAAC,GAAG,GAAG,YAAY,CAAC;iBACjC,CAAC;aACF,CAAC;QACH,CAAC;aAAM,CAAC;YACP,OAAO,GAAG;gBACT,IAAI,cAAc,CAAC;oBAClB,GAAG,EAAE,QAAQ;oBACb,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO;oBAC5D,KAAK,EAAE,CAAC;iBACR,CAAC;gBACF,IAAI,cAAc,CAAC;oBAClB,GAAG,EAAE,WAAW;oBAChB,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,cAAc;oBAC/D,KAAK,EAAE,MAAM,CAAC,GAAG,GAAG,YAAY,CAAC;iBACjC,CAAC;aACF,CAAC;QACH,CAAC;QACD,OAAO,CAAC,IAAI,CACX,IAAI,cAAc,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CACxE,CAAC;QACF,OAAO,OAAO,CAAC;IAChB,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,OAAO,CACvB,KAAK,EACL,IAAI,aAAa,CAAC;QACjB,KAAK,EAAE,aAAa,CAAC,WAAW,EAAE,KAAK,CAAC;QACxC,IAAI,EACH,SAAS,KAAK,OAAO;YACpB,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;YAChD,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;KACnD,CAAC,CACF,CAAC;IACF,MAAM,eAAe,GAAG,OAAO,CAC9B,KAAK,EACL,IAAI,aAAa,CAAC;QACjB,KAAK,EAAE,aAAa,CACnB,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC,EACpD,IAAI,CACJ;QACD,IAAI,EACH,SAAS,KAAK,OAAO;YACpB,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;YAChD,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;KACnD,CAAC,CACF,CAAC;IAEF,OAAO,YAAY,CAClB,CAAC,QAAQ,EAAE,eAAe,CAAC,EAC3B,WAAW,EACX,IAAI,EACJ,SAAS,CACT,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,WAAW,GAAG,CAC1B,IAAY,EACZ,EAAU,EACV,SAAwC,EACxC,GAAG,GAAG,wBAAwB,EAC7B,EAAE;IACH,+EAA+E;IAC/E,yEAAyE;IACzE,8FAA8F;IAC9F,uEAAuE;IAEvE,sEAAsE;IACtE,gFAAgF;IAEhF,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC7B,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;YACjB,OAAO,CAAC,CAAC;QACV,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;QAC3B,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;YAChB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;QAClC,CAAC;QACD,OAAO,IAAI,GAAG,EAAE,CAAC;IAClB,CAAC;IAED,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;QAC3B,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;YAChB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAClC,CAAC;QACD,OAAO,EAAE,GAAG,IAAI,CAAC;IAClB,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;AACtC,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CACpB,SAAqD,EACrD,KAAa,EACb,MAAe,EACf,SAAwC,EACvC,EAAE;IACH,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAC7B,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAC/C,CAAC;IACF,IAAI,MAAM,GAMJ,EAAE,CAAC;IAET,OAAO;QACN,IAAI,EAAE,KAAK,EACV,KAAa,EACwC,EAAE;YACvD,IAAI,OAAO,GAA8C;gBACxD,IAAI,EAAE,CAAC,EAAE,OAAO;gBAChB,OAAO,EAAE,EAAE;aACX,CAAC;YACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,CAAC,KAAK,EAAE,CAAC;oBACZ,KAAK,GAAG,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;oBAClC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;gBACnB,CAAC;gBACD,IAAI,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,KAAK,IAAI,QAAQ,CAAC,IAAI,EAAE,KAAK,KAAK,EAAE,CAAC;oBAChE,IAAI,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACrC,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;oBAEtB,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;wBAC9B,MAAM,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;wBAEzB,IAAI,IAAY,CAAC;wBACjB,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;4BAC7B,IAAI,GAAG,IAAI,CAAC,GAAG,CACd,WAAW,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,EACnD,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,CACjD,CAAC;wBACH,CAAC;6BAAM,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;4BAClC,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;wBAC5D,CAAC;6BAAM,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;4BAClC,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;wBAC1D,CAAC;6BAAM,CAAC;4BACP,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;wBACtC,CAAC;wBAED,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;oBAC3C,CAAC;gBACF,CAAC;YACF,CAAC;YAED,6DAA6D;YAE7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;gBACtB,IAAI,WAAW,GAAG,MAAM,CAAC,gBAAgB,CAAC;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACxC,IAAI,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;oBACtB,IAAI,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACxC,IAAI,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;wBAChC,IAAI,OAAO,CAAC,IAAI,GAAG,WAAW,EAAE,CAAC;4BAChC,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;4BAC3B,YAAY,GAAG,CAAC,CAAC;wBAClB,CAAC;oBACF,CAAC;gBACF,CAAC;gBAED,IAAI,YAAY,KAAK,CAAC,CAAC,EAAE,CAAC;oBACzB,MAAM;gBACP,CAAC;gBAED,IAAI,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;gBACrD,IAAI,OAAO,EAAE,CAAC;oBACb,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACtC,CAAC;YACF,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC5D,CAAC;YAED,OAAO,OAAO,CAAC;QAChB,CAAC;QACD,IAAI,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5C,KAAK,EAAE,KAAK,IAAI,EAAE;YACjB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBAClC,MAAM,QAAQ,CAAC,KAAK,EAAE,CAAC;YACxB,CAAC;QACF,CAAC;QACD,GAAG,EAAE,KAAK,IAAI,EAAE;YACf,IAAI,OAAO,GAA+C,EAAE,CAAC;YAC7D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBAClC,IAAI,GAAG,GAAG,MAAM,QAAQ,CAAC,GAAG,EAAE,CAAC;gBAC/B,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;YACtB,CAAC;YACD,OAAO,OAAO,CAAC;QAChB,CAAC;KACD,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,gBAAgB,GAAG,CACxB,KAAuC,EACvC,KAAa,EACb,OAAe,EACf,GAAW,EACX,MAAe,EACd,EAAE;IACH,MAAM,YAAY,GAAG,UAAU,CAC9B,OAAO,EACP,KAAK,EACL,KAAK,EACL,OAAO,EACP,IAAI,EACJ,GAAG,EACH,MAAM,CACN,CAAC;IACF,MAAM,YAAY,GAAG,UAAU,CAC9B,OAAO,EACP,KAAK,EACL,KAAK,EACL,OAAO,EACP,IAAI,EACJ,GAAG,EACH,MAAM,CACN,CAAC;IACF,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE;QACpE,MAAM,EAAE,MAAM;KACd,CAAC,CAAC;IAEH,OAAO,gBAAgB,CACtB,UAAU,EACV,YAAY,CAAC,CAAC,YAAY,EAAE,YAAY,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,CACpE,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,uBAAuB,GAAG,KAAK,EACpC,OAAe,EACf,KAAuC,EACvC,SAAsE,EACtE,KAAa,EACb,GAAW,EACX,OAAsB,GAAG,EAAE,CAAC,IAAI,EAC/B,EAAE;IACH,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,KAAK;KACb,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACxD,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,OAAO,EAAE,CAAC;QAC1C,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,IAAI,IAAI,EAAE,EAAE,CAAC;QACZ,OAAO;IACR,CAAC;IAED,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IAC5E,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IAC5E,MAAM,cAAc,GAAG,YAAY,CAClC,CAAC,YAAY,EAAE,YAAY,CAAC,EAC5B,KAAK,EACL,KAAK,EACL,SAAS,CACT,CAAC;IACF,OAAO,cAAc,CAAC,IAAI,EAAE,KAAK,KAAK,IAAI,IAAI,EAAE,KAAK,KAAK,EAAE,CAAC;QAC5D,MAAM,GAAG,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAChC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE,EAAE,CAAC;gBACZ,OAAO;YACR,CAAC;QACF,CAAC;IACF,CAAC;AACF,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAG,CACxB,OAA8B,EAC9B,GAAW,EACX,MAAc,EACb,EAAE;IACH,OAAO,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC;AAClD,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,UAAU,GAAG,KAAK,EAC9B,MAAc,EACd,KAAuC,EACvC,MAAc,EACd,OAAe,EACd,EAAE;IACH,MAAM,OAAO,GAAgB,IAAI,GAAG,EAAE,CAAC;IACvC,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,IAAI,CAAC,KAAK,EAAE,CAAC;QACZ,OAAO,EAAE,CAAC;IACX,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;IAEnC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAEhC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;QAClB,OAAO,EAAE,CAAC;IACX,CAAC;IAED,MAAM,GAAG,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;IAExB,MAAM,cAAc,GAAG,IAAI,GAAG,EAAE,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,qBAAqB;QACrB,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAElD,iDAAiD;QACjD,MAAM,uBAAuB,CAC5B,OAAO,EACP,KAAK,EACL,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACX,gGAAgG;YAChG,IAAI,CAAC,EAAE,CAAC;gBACP,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC,EACD,KAAK,EACL,GAAG,EACH,GAAG,EAAE;YACJ,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC7B,OAAO,IAAI,CAAC;YACb,CAAC;YACD,OAAO,KAAK,CAAC;QACd,CAAC,CACD,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACrB,CAAC,CAAC;AAEF,MAAM,QAAQ,GAAG,KAAK,EAAE,QAAkD,EAAE,EAAE;IAC7E,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,QAAQ,CAAC,KAAK,EAAE,CAAC;IACvB,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;AAChC,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,WAAW,GAAG,KAAK,EAC/B,aAAqB,EACrB,KAAuC,EACvC,OAAe,EACf,iBAAiC,EACV,EAAE;IACzB,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;IAEtB,6BAA6B;IAC7B,IAAI,SAAS,GAA0C,SAAS,CAAC;IACjE,IAAI,iBAAiB,EAAE,CAAC;QACvB,kCAAkC;QAClC,IAAI,MAAM,GAAG,MAAM,KAAK,CAAC,KAAK,CAC7B,IAAI,aAAa,CAAC;YACjB,KAAK,EAAE;gBACN,IAAI,WAAW,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,iBAAiB,CAAC,QAAQ,EAAE,EAAE,CAAC;aACrE;YACD,KAAK,EAAE,CAAC;SACR,CAAC,CACF,CAAC;QACF,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;QAErC,IAAI,SAAS,EAAE,CAAC;YACf,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;gBACzC,MAAM,OAAO,GAAG,MAAM,QAAQ,CAC7B,gBAAgB,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAC7D,CAAC;gBACF,IAAI,OAAO,EAAE,CAAC;oBACb,SAAS,GAAG,OAAO,CAAC;gBACrB,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IACD,IAAI,aAAqB,CAAC;IAE1B,IAAI,CAAC,SAAS,EAAE,CAAC;QAChB,aAAa,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,wBAAwB,CAAC;QACzD,SAAS,GAAG,MAAM,QAAQ,CACzB,gBAAgB,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAC1D,CAAC;IACH,CAAC;SAAM,CAAC;QACP,kEAAkE;QAClE,aAAa;YACZ,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,EAAE,GAAG,wBAAwB,CAAC;IAC/D,CAAC;IAED,+BAA+B;IAC/B,IAAI,CAAC,SAAS,EAAE,CAAC;QAChB,OAAO,IAAI,GAAG,EAAE,CAAC;IAClB,CAAC;IAED,IAAI,OAAO,GAAgC,EAAE,CAAC;IAE9C,IAAI,kBAAkB,GAAG,aAAa,GAAG,wBAAwB,CAAC;IAClE,MAAM,WAAW,GAChB,CAAC,aAAa,GAAG,kBAAkB,CAAC,GAAG,wBAAwB,CAAC;IACjE,MAAM,YAAY,GAAG,WAAW,IAAI,aAAa,CAAC;IAElD,MAAM,OAAO,GACZ,CAAC,MAAM,QAAQ,CACd,gBAAgB,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CACxD,CAAC,IAAI,CAAC,MAAM,QAAQ,CAAC,gBAAgB,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,8EAA8E;IAE3J,IAAI,CAAC,OAAO,EAAE,CAAC;QACd,OAAO,IAAI,GAAG,EAAE,CAAC;IAClB,CAAC;IAED,IAAI,OAAO;IACV,yEAAyE,CAAC,SAAS;QACnF,CAAC,MAAM,QAAQ,CAAC,gBAAgB,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,8EAA8E;IACvJ,IAAI,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC;IAClC,IAAI,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC;IAEhC,aAAa;IACb,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtB,8DAA8D;IAE9D,MAAM,qBAAqB,GAAG,KAAK,EAClC,YAAoB,EACpB,OAAe,EACd,EAAE;QACH,IAAI,IAAI,GAAG,MAAM,QAAQ,CACxB,eAAe,CAAC,KAAK,EAAE,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE;YACxD,MAAM,EAAE,IAAI;YACZ,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;SAChE,CAAC,CACF,CAAC,CAAC,wCAAwC;QAC3C,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;IAEF,MAAM,gBAAgB,GAAG,KAAK,EAAE,YAAoB,EAAE,OAAe,EAAE,EAAE;QACxE,gCAAgC;QAChC,IAAI,IAAI,GAAG,MAAM,QAAQ,CACxB,UAAU,CAAC,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAClE,CAAC;QACF,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,KAAK,EACxB,YAAoB,EACpB,OAAe,EACiC,EAAE;QAClD,MAAM,UAAU,GAAG,MAAM,qBAAqB,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QACtE,IAAI,UAAU,EAAE,CAAC;YAChB,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,CAAC,MAAM,gBAAgB,CAAC,YAAY,EAAE,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC;IAC/D,CAAC,CAAC;IAEF,kBAAkB;IAClB,IAAI,WAAW,GAAG,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IAE9C,IAAI,oBAAoB,GAAG,aAAa,CAAC;IACzC;OACG;IAEH,OACC,oBAAoB,GAAG,kBAAkB;QACzC,aAAa,IAAI,wBAAwB,EACxC,CAAC;QACF,IAAI,aAAa,GAAG,MAAM,WAAW,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QAC7D,4BAA4B;QAC5B,IAAI,OAAO,GAAG,IAAI,CAAC;QAEnB,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;YACvB,OAAO,GAAG,KAAK,CAAC;YAChB,aAAa,GAAG,MAAM,WAAW,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;YACnD,uBAAuB;QACxB,CAAC;QAED,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;YACvB,MAAM;QACP,CAAC;QAED,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAE3B,IAAI,cAAc,GAAG,aAAa,CAAC;QAEnC,IAAI,OAAO,CAAC,IAAI,GAAG,YAAY,EAAE,CAAC;YACjC,WAAW,GAAG,IAAI,CAAC;YACnB,aAAa,IAAI,wBAAwB,GAAG,YAAY,CAAC;YACzD,aAAa,IAAI,OAAO,CAAC,IAAI,CAAC;QAC/B,CAAC;aAAM,CAAC;YACP,aAAa,IAAI,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC;QAC9C,CAAC;QAED,IAAI,MAAM,GACT,cAAc,GAAG,kBAAkB;YACnC,aAAa,IAAI,kBAAkB,CAAC;QACrC,IACC,CAAC,MAAM;YACN,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,4FAA4F,CAAC,8DAA8D;YAC/K,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,EAC7B,CAAC;YACF,+IAA+I;YAC/I,mBAAmB;YACnB;;gBAEI;YACJ,MAAM;QACP,CAAC;QAED;;YAEI;QAEJ,yDAAyD;QAEzD,IAAI,OAAO,EAAE,CAAC;YACb,oBAAoB,GAAG,aAAa,CAAC;YACrC,4BAA4B;QAC7B,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtB;;;;;;WAMG;QACH,YAAY,GAAG,YAAY;YAC1B,CAAC,CAAC,WAAW;gBACZ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,WAAW,CAAC;gBACrC,CAAC,CAAC,OAAO,CAAC,IAAI;YACf,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAChD,iBAAiB,IAAI,GAAG,CAAC,GAAG,CAAC,iBAAiB,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3D,OAAO,GAAG,CAAC;IAEX,EAAE;IACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;SAyCK;IAEL;;;;OAIG;IAEH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;QA4DI;IAEJ,uEAAuE;IACvE,+CAA+C;IAC/C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBA+Bc;AACf,CAAC,CAAC"}