crbro-memory 2.9.1 → 2.11.0

package/dist/engine/cortex.d.ts

@@ -1,670 +0,0 @@
-import { AsyncLocalStorage } from 'node:async_hooks';
-import { type ShelfReason } from './shelf.js';
-import type { Brain } from './brain.js';
-import type { Neuron, NeuronType, FactStatus, ShelfLife } from '../types/index.js';
-/**
- * `witnessed`: "<neuron>|<fact id>" of every fact this session stored or
- * confirmed. A session is one witness: storing the same line again in the
- * same session (a retry, the post-compaction re-save) does not count twice.
- * Not cleared by consolidate, which ends a chapter, not the conversation.
- */
-export interface SessionTally {
-    facts: number;
-    decisions: number;
-    topics: Set<string>;
-    witnessed?: Set<string>;
-    verifiedEmitted?: Set<string>;
-}
-export declare const newTally: () => SessionTally;
-/**
- * The connection a request belongs to, carried through every await. Empty
- * outside the daemon. `resumed`: this backend took over a conversation that
- * was already running (its daemon died), so the tally starts at zero although
- * the conversation did not — consolidate must not present that zero as the truth.
- */
-export declare const sessionScope: AsyncLocalStorage<{
-    tally: SessionTally;
-    resumed?: boolean;
-}>;
-/**
- * Near-duplicates of `content` among `candidates`, best first: Dice ≥ 0.8 on
- * lower-cased text, both sides at least NEAR_DUP_MIN_LENGTH characters. The
- * one rule behind learn's near_duplicates warning (inside one neuron) and
- * consolidate's promotion_candidates (across project neurons), so the two
- * cannot disagree on what "almost the same line" means.
- */
-export declare function nearDuplicatesAmong(content: string, candidates: Array<{
-    id: string;
-    text: string;
-}>): Array<{
-    id: string;
-    similarity: number;
-    text: string;
-}>;
-/** Lesson kinds that can be promoted: what was learned, not what was decided or preferred. */
-export type LessonKind = 'fact' | 'pattern' | 'error';
-export interface PromotionCandidate {
-    kind: LessonKind;
-    /** The telling to promote: the most confirmed copy, then the longest. */
-    text: string;
-    /** Project neurons that hold it, the one written this session first. */
-    neurons: string[];
-    /** The entry id of the copy in each of `neurons`, same order. */
-    entry_ids: string[];
-    /** Lowest similarity in the group: 1 when every copy is the same text. */
-    similarity: number;
-    /** Sum of the copies' confirmations (each copy counts at least 1). */
-    confirmations: number;
-}
-/** Most promotion candidates consolidate reports. More is a backlog, not a nudge. */
-export declare const MAX_PROMOTION_CANDIDATES = 5;
-/**
- * The same lesson living in two or more project neurons: the mark of
- * something that is not about one project at all and belongs in a tech_ or
- * process_ neuron where every project finds it.
- *
- * Generalises findNearDuplicates (one neuron) to many without making it
- * quadratic: only the lessons of `seedIds` — the project neurons this session
- * touched — are compared, and each only against the lessons that hold the
- * same numbers and most of its distinctive words (inverted indexes built
- * once). The bigram test then decides, as in learn. Exact copies (same
- * normalised text) count at any length.
- *
- * Only the user's own lessons take part. A line that arrived from a shared
- * space, the miner or anything that is not this machine's session is left
- * out: promoting it would rewrite a third party's text as the user's own
- * lesson, valid for every project, and drop the origin recall shows for it.
- *
- * Read-only and pure: it suggests, it never moves anything.
- */
-export declare function findPromotionCandidates(neurons: Neuron[], seedIds: Iterable<string>, max?: number): PromotionCandidate[];
-export type Indexer = (neuron: Neuron) => Promise<void> | void;
-/**
- * Called after a write so shared neurons can append a note to the team log.
- * A hook rather than a direct call, because the sync layer needs the Cortex
- * and the Cortex would then need the sync layer.
- */
-export type Emitter = (neuronId: string, change: {
-    kind: 'fact';
-    text: string;
-    fid: string;
-    conf: number;
-    at: string;
-    src?: string;
-    keys?: string[];
-    shelf?: ShelfLife;
-} | {
-    kind: 'status';
-    fid: string;
-    to: 'superseded' | 'retracted';
-    at: string;
-    why?: string;
-} | {
-    kind: 'decision';
-    text: string;
-    why?: string;
-    at: string;
-} | {
-    kind: 'pattern';
-    text: string;
-    at: string;
-} | {
-    kind: 'error';
-    text: string;
-    at: string;
-} | {
-    kind: 'debt';
-    text: string;
-    at: string;
-} | {
-    kind: 'map';
-    text: string;
-    at: string;
-} | {
-    kind: 'error_purge';
-    key: string;
-    at: string;
-} | {
-    kind: 'debt_purge';
-    key: string;
-    at: string;
-} | {
-    kind: 'decision_purge';
-    key: string;
-    at: string;
-} | {
-    kind: 'pattern_purge';
-    key: string;
-    at: string;
-}
-/** A line was checked against its source and still holds (shelf life). `at` is the check. */
- | {
-    kind: 'verify';
-    eid: string;
-    ekind: 'fact' | 'entry';
-    at: string;
-}) => Promise<void> | void;
-/**
- * Called after a neuron file is deleted, so the search index drops its
- * chunks. The mirror of Indexer: without it a forgotten neuron kept
- * answering recall until the next full rebuild.
- */
-export type Remover = (neuronId: string) => Promise<void> | void;
-/**
- * Everything of `source` folded into `target`, as a new object.
- *
- * Shared by restoreNeuron (a quarantine copy back over a neuron that was
- * re-created since) and mergeNeurons (two neurons that turned out to be one
- * topic). Pure on purpose: neither input is touched, so the caller can diff
- * the result against what it had and emit only what actually moved.
- *
- * Facts line up by id (the content hash), falling back to normalised text;
- * on a collision the target's telling stays but takes the furthest-along
- * status (active < superseded < retracted) and the earliest `added`, and the
- * keys are unioned. Everything else is a set union keyed by normalised text
- * with the target's order first. Local observations (heat, access_count)
- * combine as max and sum; identity (id, name, domain, type) is the target's.
- */
-export declare function unionNeuron(target: Neuron, source: Neuron): {
-    neuron: Neuron;
-    moved: {
-        facts: number;
-        decisions: number;
-        patterns: number;
-        preferences: number;
-        errors: number;
-        debts: number;
-        tags: number;
-        map: 0 | 1;
-    };
-};
-/**
- * Aliases a future question may use, as stored: trimmed, lower-cased, at
- * most 40 characters each, unique, at most eight. Order is kept.
- */
-export declare function normalizeKeys(keys?: string[]): string[];
-export declare class Cortex {
-    private brain;
-    /**
-     * Optional hook invoked after every write. Wiring it here — rather than
-     * calling the search engine from each caller — is what guarantees the miner
-     * path gets indexed too. Before this, the miner wrote straight to disk and
-     * 91% of the brain never reached the index.
-     */
-    private indexer;
-    private emitter;
-    private remover;
-    /**
-     * What this session has actually written, for an honest consolidate().
-     * One per Cortex when a process serves one conversation; in the daemon one
-     * Cortex serves every client, so the tally in force is the one the
-     * connection carries (sessionScope) — otherwise whoever consolidated first
-     * would log, and link with synapses, what the other conversations wrote.
-     */
-    private ownTally;
-    private get tally();
-    constructor(brain: Brain);
-    /** Facts, decisions and neurons touched since the last consolidation. */
-    sessionTally(): {
-        facts: number;
-        decisions: number;
-        topics: string[];
-    };
-    resetSessionTally(): void;
-    setIndexer(indexer: Indexer | null): void;
-    setEmitter(emitter: Emitter | null): void;
-    setRemover(remover: Remover | null): void;
-    private unindex;
-    /**
-     * Copy a whole neuron to .quarantine/ with a timestamp, before anything
-     * destructive. Same stamp format everywhere, so restoreNeuron can pick the
-     * newest copy by name alone.
-     */
-    private quarantine;
-    /** Remove the neuron file, drop its chunks, and keep the manifest honest. */
-    private deleteNeuronFile;
-    private emit;
-    /**
-     * Overwrite a neuron with the result of merging the team's notes.
-     * Only the sync layer calls this, and only with a neuron that already
-     * contains everything local plus whatever arrived.
-     */
-    replaceFromSync(neuron: Neuron): Promise<Neuron>;
-    private reindex;
-    /**
-     * Get a neuron by ID.
-     */
-    get(id: string): Promise<Neuron | null>;
-    /**
-     * Get a neuron by ID without updating access stats.
-     */
-    peek(id: string): Promise<Neuron | null>;
-    /**
-     * Find a neuron by name.
-     *
-     * Returns null rather than guessing. That is the point: the previous
-     * implementation fell back to substring containment in either direction, so
-     * a two-word topic landed inside any long id that happened to contain it —
-     * a short name like "SEO" was swallowed by a sixty-character neuron whose
-     * title merely mentioned it.
-     * Knowledge written into the wrong neuron is recalled attributed to the
-     * wrong neuron, and no amount of index tuning repairs that. A wrong guess
-     * is worse than a new neuron.
-     */
-    findByName(name: string): Promise<Neuron | null>;
-    /**
-     * Create a new neuron.
-     * Refuses to clobber: two different names can slugify to the same id, and
-     * the old code wrote straight over the existing file, losing every fact in it.
-     */
-    create(name: string, type: NeuronType, domain: string, summary?: string): Promise<Neuron>;
-    /**
-     * Learn — add a fact, decision, pattern or preference to a neuron.
-     * Creates the neuron if it does not exist.
-     */
-    learn(topic: string, type: 'fact' | 'decision' | 'pattern' | 'preference' | 'error' | 'debt', content: string, options?: {
-        confidence?: number;
-        domain?: string;
-        rationale?: string;
-        neuronType?: NeuronType;
-        /** Facts only: words a future question may use that the text does not contain. Indexed, never displayed. */
-        keys?: string[];
-        /**
-         * On an exact-duplicate fact, replace its stored keys with `keys`
-         * instead of merging them. Local only: materialize unions keys across
-         * teammates, so a removed alias does not propagate to their brains.
-         */
-        keysReplace?: boolean;
-        /** Write to this exact neuron and skip name resolution entirely. */
-        neuronId?: string;
-        /** Who is writing: 'session' (default), 'miner', 'manual'. */
-        source?: string;
-        /** Ids or verbatim texts of facts this one replaces. */
-        supersedes?: string[];
-        /**
-         * Facts only: how fast this value goes stale, when the caller says so.
-         * Stored only when given; absent, the class is inferred from the text at
-         * read time. On an exact duplicate a different value replaces the stored one.
-         */
-        shelfLife?: ShelfLife;
-        /**
-         * Create the neuron when the topic is unknown. Default true.
-         * The miner passes false: an automated pass guessing at topic names is
-         * how a brain ends up with a thousand neurons called things like
-         * `lang_pool_8_ball`, each of them shorter -- and therefore
-         * easier to retrieve -- than the knowledge that matters.
-         */
-        createIfMissing?: boolean;
-    }): Promise<{
-        neuron: Neuron | null;
-        /**
-         * `skipped` — no neuron and createIfMissing was false.
-         * `skipped_retired` — the text matches a fact or entry that was retired
-         * (superseded or retracted); nothing was written. Re-learning a retired
-         * line silently would undo a deliberate revision; the caller decides,
-         * with `skipped_retired` in hand, whether to reactivate it instead.
-         */
-        action: 'created' | 'updated' | 'skipped' | 'skipped_retired';
-        superseded: number;
-        /** Supersedes targets that matched no active fact — a silent miss no more. */
-        supersedes_unmatched: string[];
-        /**
-         * Active facts this one closely resembles (Dice ≥ 0.8). The fact is
-         * stored anyway — the brain never refuses knowledge — but the caller is
-         * told, so it can retire the older telling with supersedes/revise
-         * instead of leaving two versions competing on recall.
-         */
-        near_duplicates: Array<{
-            id: string;
-            similarity: number;
-            preview: string;
-        }>;
-        redacted: string[];
-        /** The exact text (case-insensitive) was already an active fact of the neuron. */
-        duplicate: boolean;
-        /** An exact-duplicate fact had its confidence or keys changed by this call. */
-        updated_in_place: boolean;
-        /** Set when the text matches a retired fact/entry; nothing was written. */
-        skipped_retired: {
-            id: string;
-            status: 'superseded' | 'retracted';
-            revised?: string;
-            note?: string;
-        } | null;
-        /** Exact-duplicate fact only: how many times the line has now been learned (2.7). */
-        confirmations?: number;
-        /** Facts only: the shelf-life class that applies, and whether it was inferred from the text (and by which rule). */
-        shelf?: {
-            shelf_life: ShelfLife;
-            inferred: boolean;
-            reason?: ShelfReason;
-        };
-        /** Exact-duplicate fact learned again by a session: its `verified` was stamped now. */
-        reconfirmed?: boolean;
-        /** An explicit shelf_life was replaced by a less volatile one (team merge restores the more volatile value). */
-        shelf_lengthened?: boolean;
-    }>;
-    /**
-     * Mark facts as no longer current.
-     *
-     * `superseded` — a newer fact replaces it.
-     * `retracted`  — it was never true.
-     *
-     * Facts are matched by id, and failing that by verbatim text, because the
-     * caller usually has the text in front of it and not the hash.
-     */
-    revise(neuronRef: string, targets: string[], options?: {
-        status?: FactStatus;
-        note?: string;
-        replacedBy?: string;
-    }): Promise<{
-        neuron: Neuron | null;
-        revised: number;
-        unmatched: string[];
-    }>;
-    /**
-     * Reconfirm: the caller checked these lines against their source and they
-     * still hold, so their shelf-life clock restarts now.
-     *
-     * `facts` match ACTIVE facts by id or exact text (trimmed, case-insensitive);
-     * `entries` match live decisions and patterns by entry id or exact text —
-     * the two kinds whose class is durable. A retired fact or entry is not
-     * verifiable: it comes back in `retired` with its status (reactivate it with
-     * status active first, if it holds again), and in `unmatched` like any miss.
-     * Preferences, errors and debts never go stale, so there is nothing to
-     * reconfirm on them; they are unmatched.
-     *
-     * Each stamp is emitted as a verify op, so on a shared neuron a teammate's
-     * clock restarts too: the fact is shared, and so is the world it describes.
-     */
-    verify(neuronRef: string, targets: {
-        facts?: string[];
-        entries?: string[];
-    }): Promise<{
-        neuron: Neuron | null;
-        verified: string[];
-        unmatched: string[];
-        retired: Array<{
-            target: string;
-            id: string;
-            status: 'superseded' | 'retracted';
-        }>;
-    }>;
-    /**
-     * Which active facts does this text closely resemble?
-     *
-     * Warn-only by design. Measured on the reference brain: the heaviest
-     * neuron held 293 facts with 1,407 near-duplicate pairs — session
-     * summaries retelling the same thing with variations, each version as
-     * loud as the others on recall. The fix is the writer retiring the old
-     * telling, never the engine merging on its own.
-     */
-    private findNearDuplicates;
-    /**
-     * Flip matching facts to a non-active status.
-     *
-     * Also reports which targets matched nothing. Callers pass free text, and
-     * a miss used to be indistinguishable from a hit: `supersedes` returned 0
-     * without a word, the writer walked away believing the old version was
-     * retired, and both versions kept surfacing on recall as equals.
-     */
-    private retire;
-    /**
-     * Bring retired facts back. The inverse of retire: only superseded or
-     * retracted facts match, by id or by trimmed lower-cased text. Clears
-     * superseded_by (the replacement no longer replaces it) and stamps the
-     * revision date; the note, if given, records why it came back.
-     */
-    private reactivate;
-    /**
-     * Retire — or reactivate — decisions, patterns, errors and debts by exact
-     * text (trimmed, case-insensitive). These are plain strings, so their
-     * status lives in the entry_status sidecar keyed by entryId(text), the
-     * same way their dates do. A retired entry stays in the file and leaves
-     * recall exactly like a superseded fact; status 'active' deletes the key.
-     *
-     * Never emitted: the sidecar travels only through the local file and
-     * survives a sync because applyOps copies and prunes it.
-     */
-    retireEntries(neuronRef: string, targets: string[], options?: {
-        status?: FactStatus;
-        note?: string;
-    }): Promise<{
-        neuron: Neuron | null;
-        revised: number;
-        unmatched: string[];
-    }>;
-    /**
-     * Edit a neuron's metadata: summary, domain, tags, name.
-     *
-     * Only fields that actually differ are written and reported; a call that
-     * changes nothing writes nothing. `tags` replaces the whole list — protocol
-     * neurons keep their 'priority:'/'source:' tags only if the caller re-sends
-     * them. `name` changes the display name only: the id, and with it the file,
-     * the synapses, the shared map and the connections, never move. `domain`
-     * replaces unconditionally, unlike learn, which only fills in 'general'.
-     *
-     * Not emitted: NeuronOp is only an announcement, and metadata is local.
-     */
-    setMeta(neuronRef: string, meta: {
-        summary?: string;
-        domain?: string;
-        tags?: string[];
-        name?: string;
-    }): Promise<{
-        neuron: Neuron | null;
-        changed: Array<'summary' | 'domain' | 'tags' | 'name'>;
-        redacted: string[];
-    }>;
-    /**
-     * Replace the neuron's system map.
-     *
-     * Whole-document semantics on purpose: a map that can only be appended to
-     * rots the same way facts did — old directions never die. The writer reads
-     * the current map, rewrites it, and stores the new truth. Credentials are
-     * redacted exactly as in learn.
-     */
-    setMap(neuronRef: string, content: string, options?: {
-        domain?: string;
-        neuronType?: NeuronType;
-    }): Promise<{
-        neuron: Neuron | null;
-        action: 'created' | 'updated';
-        redacted: string[];
-    }>;
-    /**
-     * List all neurons with optional filters, and how many matched before paging.
-     *
-     * `list` returns only the page, which made every caller report the page size
-     * as the total — so a client paging through 1,145 neurons was told there were
-     * 50, and stopped. The count here is taken after the filters and before the
-     * slice, which is the only number a pager can trust.
-     */
-    listWithTotal(options?: {
-        domain?: string;
-        type?: NeuronType;
-        min_heat?: number;
-        limit?: number;
-        offset?: number;
-    }): Promise<{
-        total: number;
-        rows: Awaited<ReturnType<Cortex['list']>>;
-    }>;
-    /**
-     * List all neurons with optional filters.
-     */
-    list(options?: {
-        domain?: string;
-        type?: NeuronType;
-        min_heat?: number;
-        limit?: number;
-        /** Rows to skip after the heat sort, for paging. Default 0. */
-        offset?: number;
-    }): Promise<Array<{
-        id: string;
-        name: string;
-        domain: string;
-        type: NeuronType;
-        heat: number;
-        last_accessed: string;
-        facts_count: number;
-    }>>;
-    /**
-     * Update a neuron's summary.
-     */
-    updateSummary(id: string, summary: string): Promise<Neuron | null>;
-    /**
-     * Add tags to a neuron.
-     */
-    addTags(id: string, tags: string[]): Promise<Neuron | null>;
-    /**
-     * Remove facts for good.
-     *
-     * The only destructive operation in CRBRO, so it never edits in place: the
-     * whole neuron is copied to .quarantine/ first, with a timestamp, and can be
-     * put back by hand. Superseding hides a fact; this is for the ones that must
-     * not exist at all — a credential, someone's personal data.
-     */
-    forget(neuronRef: string, targets: string[]): Promise<{
-        neuron_id: string | null;
-        removed: number;
-        backup: string | null;
-    }>;
-    /**
-     * Delete a whole neuron. Quarantine copy first, then the file goes, the
-     * index drops its chunks and the manifest is decremented.
-     *
-     * Synapses are not touched here (the Cortex has no Synapses): the server
-     * calls synapses.removeAllFor(id) right after. Nor is shared state checked
-     * — the server refuses beforehand when the neuron is shared, because the
-     * next sync would simply re-create it from the team log. Nothing is
-     * emitted: there is no neuron-delete op.
-     */
-    forgetNeuron(neuronRef: string): Promise<{
-        neuron_id: string | null;
-        backup: string | null;
-        counts: {
-            facts: number;
-            decisions: number;
-            patterns: number;
-            preferences: number;
-            errors: number;
-            debts: number;
-            connections: number;
-        };
-    }>;
-    /**
-     * Quarantine copies of one neuron, newest first. Stamps sort lexically, so
-     * the file name alone orders them.
-     */
-    private quarantineCopies;
-    /**
-     * Bring a neuron back from quarantine.
-     *
-     * The newest copy is used unless `file` names an exact basename. If the
-     * neuron no longer exists the copy is written back as it was; if it does
-     * (a forget of facts, or the topic was re-created since) the copy is
-     * unioned into it. The quarantine file stays where it is, so a restore is
-     * repeatable. Nothing is emitted.
-     */
-    restoreNeuron(neuronId: string, options?: {
-        file?: string;
-    }): Promise<{
-        neuron: Neuron | null;
-        restored_from: string | null;
-        merged_into_existing: boolean;
-        moved: ReturnType<typeof unionNeuron>['moved'] | null;
-    }>;
-    /**
-     * Fold one neuron into another and delete the first.
-     *
-     * `from` is quarantined, unioned into `into`, and then removed exactly like
-     * forgetNeuron. Each element that actually moved is emitted for `into`, so
-     * a shared target receives the knowledge (the emitter no-ops when `into`
-     * is unshared). Synapses are not touched — the server calls
-     * synapses.rewire(from, into) right after — and the server refuses
-     * beforehand when `from` is shared (unshare first, or the next sync
-     * re-creates it).
-     */
-    mergeNeurons(fromRef: string, intoRef: string): Promise<{
-        from: string | null;
-        into: string | null;
-        backup: string | null;
-        moved: ReturnType<typeof unionNeuron>['moved'] | null;
-    }>;
-    /**
-     * Emit what a union added, by diffing the result against what the target
-     * had. The union is pure, so this is exact: nothing the target already held
-     * is re-announced. The emitter no-ops when the target is not shared.
-     */
-    private emitAdded;
-    /**
-     * Move entries from one neuron to another, whole: text, date, keys,
-     * confidence, retirement. The way to split a neuron that grew past what one
-     * read can carry — learn + forget would do it too, but every entry would be
-     * reborn today and lose the one thing recall uses to tell old from new.
-     *
-     * `targets` are entry ids (factId for facts, entryId for the rest) or exact
-     * texts, any kind. The target neuron is created when missing, with the
-     * source's type and domain. Order is union first, removal second: a crash
-     * in between leaves an entry in both places, never in neither. The source
-     * is quarantined by forget() before anything leaves it. The map never
-     * moves: it describes the system, not an entry.
-     */
-    moveEntries(fromRef: string, targets: string[], intoRef: string, options?: {
-        domain?: string;
-    }): Promise<{
-        from: string | null;
-        into: string | null;
-        created: boolean;
-        moved: number;
-        unmatched: string[];
-        backup: string | null;
-    }>;
-    /**
-     * Fold many small neurons into one digest neuron, in a single pass.
-     *
-     * mergeNeurons would do it one at a time, reindexing a growing target on
-     * every call — quadratic, and minutes on the 766 leftovers this was written
-     * for. Here every source is quarantined, the union is built in memory,
-     * written once and indexed once; only then do the sources go. A source's
-     * NAME is the only context a one-line neuron had ("Phase 1 homepage audit
-     * francortes…"), so its words travel as the fact's keys: searchable, never
-     * shown. The caller picks the sources; nothing here judges them. Unshared
-     * and unconnected sources only — there is no rewiring in this path.
-     */
-    compact(sourceIds: string[], digestName: string, options: {
-        type: NeuronType;
-        domain: string;
-    }): Promise<{
-        into: string | null;
-        folded: string[];
-        skipped: string[];
-        entries: number;
-    }>;
-    /**
-     * Which neurons hold something that looks like a credential.
-     * Reports the kind and where it is, never the value.
-     */
-    auditSecrets(): Promise<Array<{
-        neuron_id: string;
-        name: string;
-        kinds: string[];
-        facts: number;
-        decisions: number;
-        patterns: number;
-        preferences: number;
-        errors: number;
-        debts: number;
-        map: number;
-    }>>;
-    /**
-     * Get all neuron IDs.
-     */
-    allIds(): Promise<string[]>;
-    /**
-     * Count total neurons.
-     */
-    count(): Promise<number>;
-}
-//# sourceMappingURL=cortex.d.ts.map

package/dist/engine/cortex.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cortex.d.ts","sourceRoot":"","sources":["../../src/engine/cortex.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAMrD,OAAO,EAAoD,KAAK,WAAW,EAAE,MAAM,YAAY,CAAC;AAChG,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,MAAM,EAAE,UAAU,EAAkB,UAAU,EAAgC,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAgBjI;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAAG,KAAK,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAAC,SAAS,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAAC,eAAe,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;CAAE;AAC/I,eAAO,MAAM,QAAQ,QAAO,YAAqG,CAAC;AAClI;;;;;GAKG;AACH,eAAO,MAAM,YAAY;WAAkC,YAAY;cAAY,OAAO;EAAK,CAAC;AA6ChG;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAC9C,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,CAgBzD;AAED,8FAA8F;AAC9F,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC;AAEtD,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,UAAU,CAAC;IACjB,yEAAyE;IACzE,IAAI,EAAE,MAAM,CAAC;IACb,wEAAwE;IACxE,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,iEAAiE;IACjE,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,0EAA0E;IAC1E,UAAU,EAAE,MAAM,CAAC;IACnB,sEAAsE;IACtE,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,qFAAqF;AACrF,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAyB1C;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,MAAM,EAAE,EACjB,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,EACzB,GAAG,GAAE,MAAiC,GACrC,kBAAkB,EAAE,CAqHtB;AAED,MAAM,MAAM,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAE/D;;;;GAIG;AACH,MAAM,MAAM,OAAO,GAAG,CACpB,QAAQ,EAAE,MAAM,EAChB,MAAM,EACF;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,CAAC,EAAE,SAAS,CAAA;CAAE,GACvH;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,YAAY,GAAG,WAAW,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAE,GACzF;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC5D;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC7C;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC3C;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC1C;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAChD;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC/C;IAAE,IAAI,EAAE,gBAAgB,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACnD;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE;AACpD,6FAA6F;GAC3F;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,KACrE,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAE1B;;;;GAIG;AACH,MAAM,MAAM,OAAO,GAAG,CAAC,QAAQ,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AA6BjE;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG;IAC3D,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAA;KAAE,CAAC;CAC7I,CAuIA;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAQvD;AAED,qBAAa,MAAM;IAuBL,OAAO,CAAC,KAAK;IAtBzB;;;;;OAKG;IACH,OAAO,CAAC,OAAO,CAAwB;IACvC,OAAO,CAAC,OAAO,CAAwB;IACvC,OAAO,CAAC,OAAO,CAAwB;IAEvC;;;;;;OAMG;IACH,OAAO,CAAC,QAAQ,CAA4B;IAC5C,OAAO,KAAK,KAAK,GAEhB;gBAEmB,KAAK,EAAE,KAAK;IAEhC,yEAAyE;IACzE,YAAY,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE;IAQtE,iBAAiB,IAAI,IAAI;IAOzB,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI;IAIzC,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI;IAIzC,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI;YAI3B,OAAO;IASrB;;;;OAIG;YACW,UAAU;IAOxB,6EAA6E;YAC/D,gBAAgB;YAOhB,IAAI;IAUlB;;;;OAIG;IACG,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;YAoBxC,OAAO;IASrB;;OAEG;IACG,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAW7C;;OAEG;IACG,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAI9C;;;;;;;;;;;OAWG;IACG,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IA6CtD;;;;OAIG;IACG,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAwC/F;;;OAGG;IACG,KAAK,CACT,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS,GAAG,YAAY,GAAG,OAAO,GAAG,MAAM,EACvE,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE;QACR,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,UAAU,CAAC,EAAE,UAAU,CAAC;QACxB,4GAA4G;QAC5G,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAChB;;;;WAIG;QACH,WAAW,CAAC,EAAE,OAAO,CAAC;QACtB,oEAAoE;QACpE,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,8DAA8D;QAC9D,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,wDAAwD;QACxD,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;QACtB;;;;WAIG;QACH,SAAS,CAAC,EAAE,SAAS,CAAC;QACtB;;;;;;WAMG;QACH,eAAe,CAAC,EAAE,OAAO,CAAC;KAC3B,GACA,OAAO,CAAC;QACT,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB;;;;;;WAMG;QACH,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,iBAAiB,CAAC;QAC9D,UAAU,EAAE,MAAM,CAAC;QACnB,8EAA8E;QAC9E,oBAAoB,EAAE,MAAM,EAAE,CAAC;QAC/B;;;;;WAKG;QACH,eAAe,EAAE,KAAK,CAAC;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,UAAU,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;QAC5E,QAAQ,EAAE,MAAM,EAAE,CAAC;QACnB,kFAAkF;QAClF,SAAS,EAAE,OAAO,CAAC;QACnB,+EAA+E;QAC/E,gBAAgB,EAAE,OAAO,CAAC;QAC1B,2EAA2E;QAC3E,eAAe,EAAE;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,YAAY,GAAG,WAAW,CAAC;YAAC,OAAO,CAAC,EAAE,MAAM,CAAC;YAAC,IAAI,CAAC,EAAE,MAAM,CAAA;SAAE,GAAG,IAAI,CAAC;QAC5G,qFAAqF;QACrF,aAAa,CAAC,EAAE,MAAM,CAAC;QACvB,oHAAoH;QACpH,KAAK,CAAC,EAAE;YAAE,UAAU,EAAE,SAAS,CAAC;YAAC,QAAQ,EAAE,OAAO,CAAC;YAAC,MAAM,CAAC,EAAE,WAAW,CAAA;SAAE,CAAC;QAC3E,uFAAuF;QACvF,WAAW,CAAC,EAAE,OAAO,CAAC;QACtB,gHAAgH;QAChH,gBAAgB,CAAC,EAAE,OAAO,CAAC;KAC5B,CAAC;IAqTF;;;;;;;;OAQG;IACG,MAAM,CACV,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EAAE,EACjB,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,UAAU,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,GACpE,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IA6C3E;;;;;;;;;;;;;;OAcG;IACG,MAAM,CACV,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAChD,OAAO,CAAC;QACT,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,QAAQ,EAAE,MAAM,EAAE,CAAC;QACnB,SAAS,EAAE,MAAM,EAAE,CAAC;QACpB,OAAO,EAAE,KAAK,CAAC;YAAE,MAAM,EAAE,MAAM,CAAC;YAAC,EAAE,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,YAAY,GAAG,WAAW,CAAA;SAAE,CAAC,CAAC;KACpF,CAAC;IAqEF;;;;;;;;OAQG;IACH,OAAO,CAAC,kBAAkB;IAY1B;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM;IAgCd;;;;;OAKG;IACH,OAAO,CAAC,UAAU;IA8BlB;;;;;;;;;OASG;IACG,aAAa,CACjB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EAAE,EACjB,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,UAAU,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,GAC/C,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IA2D3E;;;;;;;;;;;OAWG;IACG,OAAO,CACX,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,GAC1E,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,KAAK,CAAC,SAAS,GAAG,QAAQ,GAAG,MAAM,GAAG,MAAM,CAAC,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAsDjH;;;;;;;OAOG;IACG,MAAM,CACV,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,UAAU,CAAA;KAAE,GACrD,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,MAAM,EAAE,SAAS,GAAG,SAAS,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAwCxF;;;;;;;OAOG;IACG,aAAa,CAAC,OAAO,CAAC,EAAE;QAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,IAAI,CAAC,EAAE,UAAU,CAAC;QAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,GAAG,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;KAAE,CAAC;IAOzE;;OAEG;IACG,IAAI,CAAC,OAAO,CAAC,EAAE;QACnB,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,IAAI,CAAC,EAAE,UAAU,CAAC;QAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,+DAA+D;QAC/D,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,GAAG,OAAO,CAAC,KAAK,CAAC;QAChB,EAAE,EAAE,MAAM,CAAC;QACX,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,EAAE,UAAU,CAAC;QACjB,IAAI,EAAE,MAAM,CAAC;QACb,aAAa,EAAE,MAAM,CAAC;QACtB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC,CAAC;IAyCH;;OAEG;IACG,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAYxE;;OAEG;IACG,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAajE;;;;;;;OAOG;IACG,MAAM,CACV,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EAAE,GAChB,OAAO,CAAC;QAAE,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAC;IA6IhF;;;;;;;;;OASG;IACG,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC;QAC7C,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;QACzB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,MAAM,EAAE;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,SAAS,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,MAAM,CAAC;YAAC,WAAW,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,WAAW,EAAE,MAAM,CAAA;SAAE,CAAC;KACzI,CAAC;IA2BF;;;OAGG;YACW,gBAAgB;IAM9B;;;;;;;;OAQG;IACG,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAC1E,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;QAC7B,oBAAoB,EAAE,OAAO,CAAC;QAC9B,KAAK,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;KACvD,CAAC;IAuCF;;;;;;;;;;OAUG;IACG,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC;QAC5D,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,KAAK,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;KACvD,CAAC;IA0BF;;;;OAIG;YACW,SAAS;IAyCvB;;;;;;;;;;;;OAYG;IACG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAC7G,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,OAAO,EAAE,OAAO,CAAC;QACjB,KAAK,EAAE,MAAM,CAAC;QACd,SAAS,EAAE,MAAM,EAAE,CAAC;QACpB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;KACvB,CAAC;IAwDF;;;;;;;;;;;OAWG;IACG,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE;QAAE,IAAI,EAAE,UAAU,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAC7G,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,MAAM,EAAE,MAAM,EAAE,CAAC;QACjB,OAAO,EAAE,MAAM,EAAE,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC;IA8CF;;;OAGG;IACG,YAAY,IAAI,OAAO,CAAC,KAAK,CAAC;QAClC,SAAS,EAAE,MAAM,CAAC;QAClB,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,EAAE,MAAM,EAAE,CAAC;QAChB,KAAK,EAAE,MAAM,CAAC;QACd,SAAS,EAAE,MAAM,CAAC;QAClB,QAAQ,EAAE,MAAM,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;QACpB,MAAM,EAAE,MAAM,CAAC;QACf,KAAK,EAAE,MAAM,CAAC;QACd,GAAG,EAAE,MAAM,CAAC;KACb,CAAC,CAAC;IA8CH;;OAEG;IACG,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAIjC;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;CAI/B"}