@smart-data-engines/sde 0.1.0-dev.0

package/dist/physical.js

@@ -0,0 +1,421 @@
+/**
+ * The physical design vocabulary a placement map can carry, and the rules each element obeys.
+ *
+ * Placement map contract 5 lets a layout say three things about storage beyond tables and column
+ * types: the physical order of an entity's key, a time partition, and indexes of a named method.
+ * They are chosen by the control plane and a library only renders them. Every element is a closed
+ * vocabulary rendered by this library; nothing in a map is pasted into DDL.
+ *
+ * This is the port of the reference's `sde/physical.py`, and it is one module for the reason that
+ * one is: the map parser, the DDL renderer and the adapters' verification all read it, because a
+ * second copy of "which index methods ClickHouse has" is how a map gets signed that no library can
+ * apply. The two data rules - a partition follows the key, and `key_order` only reorders the key -
+ * were measured on PostgreSQL 15.19 and ClickHouse 24.8.14.39 before they were written; the
+ * reference module carries the measurements.
+ */
+import { MapError } from './errors.js';
+import { compareCodePoints } from './canonical.js';
+export const PHYSICAL_DESIGN_SINCE = 5;
+/** The placement map contract that introduced `key_order`, `partition_by` and index methods. */
+export const GRANULARITIES = ['day', 'month', 'year'];
+/**
+ * Time partition sizes. No week: ClickHouse's `toStartOfWeek` depends on a mode, and a closed
+ * vocabulary has no modes.
+ */
+export const TEMPORAL_TYPES = ['date', 'timestamptz'];
+/**
+ * Neutral types a partition may be derived from. `timestamp` is absent on purpose: its ClickHouse
+ * column carries no zone, so the partition a value falls into follows the server's configured
+ * timezone, and a reconfigured server would put one key into two partitions for ever.
+ */
+export const POSTGRES_METHODS = ['brin', 'btree'];
+export const CLICKHOUSE_METHODS = ['bloom_filter', 'minmax', 'set'];
+/** ClickHouse data-skipping index types. It has no B-tree; its primary index is `ORDER BY`. */
+export const INDEX_METHODS = [...POSTGRES_METHODS, ...CLICKHOUSE_METHODS].sort(compareCodePoints);
+export const GRANULARITY_RANGE = [1, 1024];
+export const SET_ROWS_RANGE = [1, 65536];
+/** `set(0)` means unlimited in ClickHouse, an unbounded memory commitment, so zero is outside. */
+const LEGACY_INDEX_KEYS = new Set(['columns', 'entity', 'name']);
+const LATER_INDEX_KEYS = new Set(['granularity', 'max_rows', 'method']);
+const INDEX_KEYS = new Set([...LEGACY_INDEX_KEYS, ...LATER_INDEX_KEYS]);
+export const PARTITION_FUNCTIONS = Object.freeze({
+    day: 'toDate',
+    month: 'toYYYYMM',
+    year: 'toYear',
+});
+/** ClickHouse partition expressions, as its catalogue reports them back. */
+export const PARTITIONING_DIALECTS = new Set(['clickhouse']);
+/**
+ * Dialects that render `partition_by`. PostgreSQL is absent on purpose: declarative partitioning
+ * there needs every partition created before a row can arrive, a lifecycle this product does not
+ * manage, and an unpartitioned table under a map that says otherwise would be a silent drop.
+ */
+export const METHODS_BY_DIALECT = Object.freeze({
+    clickhouse: CLICKHOUSE_METHODS,
+    postgres: POSTGRES_METHODS,
+});
+function isRecord(value) {
+    return typeof value === 'object' && value !== null && !Array.isArray(value);
+}
+function isInteger(value) {
+    return typeof value === 'number' && Number.isInteger(value);
+}
+function show(value) {
+    return value === undefined ? 'undefined' : JSON.stringify(value);
+}
+function sortedKeys(value) {
+    return Object.keys(value).sort(compareCodePoints);
+}
+/** An index's method. Absent means `btree`, what every map before contract 5 meant. */
+export function indexMethod(index) {
+    return index['method'] === undefined ? 'btree' : String(index['method']);
+}
+function nonEmptyNames(value) {
+    return (Array.isArray(value) &&
+        value.length > 0 &&
+        value.every((column) => typeof column === 'string' && column.length > 0));
+}
+/** `key_order`: entity -> the physical order of that entity's key columns. */
+export function parseKeyOrder(raw, where, tables) {
+    if (!isRecord(raw))
+        throw new MapError(`${where}: key_order maps an entity to a list of its key columns`);
+    const out = Object.create(null);
+    for (const entity of sortedKeys(raw)) {
+        const columns = raw[entity];
+        if (!Object.hasOwn(tables, entity)) {
+            throw new MapError(`${where}: key_order names '${entity}', which has no table in this layout. It has ` +
+                `${JSON.stringify(sortedKeys(tables))}.`);
+        }
+        if (!nonEmptyNames(columns)) {
+            throw new MapError(`${where}: key_order['${entity}'] must be a non-empty list of column names`);
+        }
+        if (new Set(columns).size !== columns.length) {
+            throw new MapError(`${where}: key_order['${entity}'] names a column twice: ${JSON.stringify(columns)}. A key ` +
+                'order is a permutation of the key, so each key column appears exactly once.');
+        }
+        out[entity] = [...columns];
+    }
+    return out;
+}
+/** `partition_by`: entity -> `{"field": ..., "granularity": ...}`, and nothing else. */
+export function parsePartitionBy(raw, where, tables) {
+    if (!isRecord(raw)) {
+        throw new MapError(`${where}: partition_by maps an entity to a {field, granularity} object`);
+    }
+    const out = Object.create(null);
+    for (const entity of sortedKeys(raw)) {
+        const spec = raw[entity];
+        if (!Object.hasOwn(tables, entity)) {
+            throw new MapError(`${where}: partition_by names '${entity}', which has no table in this layout. It has ` +
+                `${JSON.stringify(sortedKeys(tables))}.`);
+        }
+        const keys = isRecord(spec) ? sortedKeys(spec) : null;
+        if (keys === null || keys.length !== 2 || keys[0] !== 'field' || keys[1] !== 'granularity') {
+            throw new MapError(`${where}: partition_by['${entity}'] must be exactly {"field": ..., "granularity": ...}; ` +
+                `found keys ${keys === null ? (Array.isArray(spec) ? 'list' : typeof spec) : JSON.stringify(keys)}. ` +
+                'The vocabulary is closed so that nothing in a map is pasted into DDL.');
+        }
+        const record = spec;
+        const field = record['field'];
+        const granularity = record['granularity'];
+        if (typeof field !== 'string' || field.length === 0) {
+            throw new MapError(`${where}: partition_by['${entity}'].field must name a column`);
+        }
+        if (typeof granularity !== 'string' || !GRANULARITIES.includes(granularity)) {
+            throw new MapError(`${where}: partition_by['${entity}'].granularity is ${show(granularity)}; it is one of ` +
+                `${JSON.stringify(GRANULARITIES)}.`);
+        }
+        out[entity] = Object.freeze({ field, granularity });
+    }
+    return out;
+}
+/**
+ * Index definitions, validated where the map arrives rather than when DDL is rendered.
+ *
+ * The structural half applies to every contract and is a tightening; the method, granularity and
+ * `max_rows` keys are contract 5, because an earlier library ignores them and would build a B-tree
+ * where a later one builds BRIN from the same document.
+ */
+export function parseIndexes(raw, where, tables, columns, contract) {
+    if (raw === undefined || raw === null)
+        return [];
+    if (!Array.isArray(raw))
+        throw new MapError(`${where}: indexes is a list of index definitions`);
+    const allowed = contract >= PHYSICAL_DESIGN_SINCE ? INDEX_KEYS : LEGACY_INDEX_KEYS;
+    const out = [];
+    const names = new Set();
+    raw.forEach((index, position) => {
+        const at = `${where}: indexes[${position}]`;
+        if (!isRecord(index))
+            throw new MapError(`${at} must be an object`);
+        const unknown = sortedKeys(index).filter((key) => !allowed.has(key));
+        if (unknown.length > 0) {
+            const later = unknown.filter((key) => LATER_INDEX_KEYS.has(key));
+            if (later.length > 0) {
+                throw new MapError(`${at} uses ${JSON.stringify(later)}, which placement map contract ${PHYSICAL_DESIGN_SINCE} ` +
+                    `introduced, in a document declaring contract ${contract}. A library of that contract ` +
+                    'would ignore the key and create a different index from the same document, which is ' +
+                    'the difference the version exists to prevent.');
+            }
+            throw new MapError(`${at} has keys this format does not define: ${JSON.stringify(unknown)}`);
+        }
+        const entity = index['entity'];
+        const name = index['name'];
+        const cols = index['columns'];
+        if (typeof entity !== 'string' || !Object.hasOwn(tables, entity)) {
+            throw new MapError(`${at} names entity ${show(entity)}, which has no table in this layout. It has ` +
+                `${JSON.stringify(sortedKeys(tables))}.`);
+        }
+        if (typeof name !== 'string' || name.length === 0)
+            throw new MapError(`${at} needs a non-empty name`);
+        if (names.has(name))
+            throw new MapError(`${at} reuses the index name '${name}'`);
+        names.add(name);
+        if (!nonEmptyNames(cols) || new Set(cols).size !== cols.length) {
+            throw new MapError(`${at} needs a non-empty list of distinct column names`);
+        }
+        const declared = Object.hasOwn(columns, entity) ? columns[entity] : undefined;
+        if (declared !== undefined && Object.keys(declared).length > 0) {
+            const missing = cols.filter((column) => !Object.hasOwn(declared, column));
+            if (missing.length > 0) {
+                throw new MapError(`${at} indexes ${JSON.stringify(missing)}, which '${entity}' does not have in this ` +
+                    'layout. An index on a missing column is refused by the engine at CREATE INDEX, in ' +
+                    "the client's process, rather than here.");
+            }
+        }
+        const method = index['method'] === undefined ? 'btree' : index['method'];
+        if (typeof method !== 'string' || !INDEX_METHODS.includes(method)) {
+            throw new MapError(`${at} has method ${show(method)}; the methods are ${JSON.stringify(INDEX_METHODS)}`);
+        }
+        const granularity = index['granularity'];
+        const maxRows = index['max_rows'];
+        if (CLICKHOUSE_METHODS.includes(method)) {
+            const [low, high] = GRANULARITY_RANGE;
+            if (!isInteger(granularity) || granularity < low || granularity > high) {
+                throw new MapError(`${at}: a ${method} index needs an integer granularity from ${low} to ${high}; found ` +
+                    show(granularity));
+            }
+            if (cols.length !== 1) {
+                throw new MapError(`${at}: a ${method} index summarises exactly one column, found ${JSON.stringify(cols)}`);
+            }
+        }
+        else if (granularity !== undefined) {
+            throw new MapError(`${at}: granularity belongs to data-skipping indexes, not ${method}`);
+        }
+        if (method === 'set') {
+            const [low, high] = SET_ROWS_RANGE;
+            if (!isInteger(maxRows) || maxRows < low || maxRows > high) {
+                throw new MapError(`${at}: a set index needs an integer max_rows from ${low} to ${high}; found ` +
+                    `${show(maxRows)}. Zero means unlimited in ClickHouse, which is not a choice this ` +
+                    'format offers.');
+            }
+        }
+        else if (maxRows !== undefined) {
+            throw new MapError(`${at}: max_rows belongs to set indexes, not ${method}`);
+        }
+        out.push({ ...index });
+    });
+    return out;
+}
+/**
+ * The two rules that need the model: a permutation of the key, and a partition on a key column.
+ *
+ * A renderer without the model repeats the key half against the keys it is given (`effectiveKey`,
+ * `partitionExpression`), which keeps the data rule true for a caller that skipped the model.
+ */
+export function checkAgainstModel(where, entity, key, fieldTypes, keyOrder, partition) {
+    if (keyOrder !== undefined && !samePermutation(keyOrder, key)) {
+        throw new MapError(`${where}: key_order['${entity}'] is ${JSON.stringify(keyOrder)} and the declared key is ` +
+            `${JSON.stringify(key)}. A key order reorders the key; it cannot add, drop or replace a ` +
+            'column, because the key is what makes a row the same row in every engine.');
+    }
+    if (partition !== undefined) {
+        const field = partition.field;
+        if (!key.includes(field)) {
+            throw new MapError(`${where}: partition_by['${entity}'] partitions on '${field}', which is not in the key ` +
+                `${JSON.stringify(key)}. ClickHouse collapses rows of one key only inside one ` +
+                'partition, so two writes of one key could land in two partitions and stay two rows ' +
+                'physically for ever - measured: after OPTIMIZE FINAL both remained.');
+        }
+        const kind = Object.hasOwn(fieldTypes, field) ? fieldTypes[field] : undefined;
+        if (kind === undefined || !TEMPORAL_TYPES.includes(kind)) {
+            throw new MapError(`${where}: partition_by['${entity}'] partitions on '${field}', which is ${show(kind)}; a ` +
+                `time partition needs one of ${JSON.stringify(TEMPORAL_TYPES)}.`);
+        }
+    }
+}
+function samePermutation(left, right) {
+    if (left.length !== right.length)
+        return false;
+    const a = [...left].sort(compareCodePoints);
+    const b = [...right].sort(compareCodePoints);
+    return a.every((value, position) => value === b[position]);
+}
+/** The key in physical order: `key_order` when present, the declared order otherwise. */
+export function effectiveKey(where, entity, key, keyOrder, error = MapError) {
+    const ordered = Object.hasOwn(keyOrder, entity) ? keyOrder[entity] : undefined;
+    if (ordered === undefined)
+        return [...key];
+    if (!samePermutation(ordered, key)) {
+        throw new error(`${where}: key_order['${entity}'] is ${JSON.stringify(ordered)} and the key is ` +
+            `${JSON.stringify(key)}. A key order must be a permutation of the key.`);
+    }
+    return [...ordered];
+}
+/** `[function, field]` for a ClickHouse partition, after the key rule is checked again. */
+export function partitionExpression(where, entity, key, partition, error = MapError) {
+    if (partition === undefined)
+        return null;
+    if (!key.includes(partition.field)) {
+        throw new error(`${where}: partition_by['${entity}'] partitions on '${partition.field}', outside the key ` +
+            `${JSON.stringify(key)}; duplicates of one key would survive merges in two partitions.`);
+    }
+    const fn = PARTITION_FUNCTIONS[partition.granularity];
+    if (fn === undefined)
+        throw new error(`${where}: unknown partition granularity ${partition.granularity}`);
+    return [fn, partition.field];
+}
+/**
+ * What a dialect renders, for whoever has to propose a physical design for it.
+ *
+ * The control plane hands the reference's version of this to a model; this port exists so that a
+ * TypeScript caller asking the same question gets the same answer, key for key.
+ */
+export function capabilities(dialect) {
+    const methodsOf = Object.hasOwn(METHODS_BY_DIALECT, dialect) ? METHODS_BY_DIALECT[dialect] : undefined;
+    if (methodsOf === undefined)
+        return { physical_design: false };
+    const methods = {};
+    for (const method of methodsOf) {
+        const entry = {};
+        if (CLICKHOUSE_METHODS.includes(method)) {
+            entry['granularity'] = [...GRANULARITY_RANGE];
+            entry['columns'] = 1;
+        }
+        if (method === 'set')
+            entry['max_rows'] = [...SET_ROWS_RANGE];
+        methods[method] = entry;
+    }
+    return {
+        physical_design: true,
+        key_order: true,
+        partition_granularities: PARTITIONING_DIALECTS.has(dialect) ? [...GRANULARITIES] : [],
+        partition_on: 'a key column of type date or timestamptz',
+        index_methods: methods,
+    };
+}
+export function describeFinding(finding) {
+    return `${finding.table}: ${finding.aspect} is ${finding.found} and the map declares ${finding.declared}`;
+}
+/** The physical expectations of every table a layout names, in table order. */
+export function declaredTables(layout, keys) {
+    const out = [];
+    const entries = Object.entries(layout.tables).sort(([, a], [, b]) => compareCodePoints(a, b));
+    const indexes = [...layout.indexes].sort((a, b) => compareCodePoints(String(a['name']), String(b['name'])));
+    for (const [entity, table] of entries) {
+        const key = Object.hasOwn(keys, entity) ? [...(keys[entity] ?? [])] : [];
+        const where = `table '${table}'`;
+        const ordered = effectiveKey(where, entity, key, layout.keyOrder ?? {});
+        const spec = Object.hasOwn(layout.partitionBy, entity) ? layout.partitionBy[entity] : undefined;
+        const partition = partitionExpression(where, entity, key, spec);
+        const declared = [];
+        for (const index of indexes) {
+            if (String(index['entity']) !== entity)
+                continue;
+            const method = indexMethod(index);
+            const granularity = index['granularity'];
+            declared.push({
+                name: String(index['name']),
+                method,
+                columns: index['columns'].map(String),
+                granularity: typeof granularity === 'number' ? granularity : null,
+                typeFull: method === 'set' ? `set(${String(index['max_rows'])})` : method,
+            });
+        }
+        out.push({ table, key: ordered, partition, indexes: declared });
+    }
+    return out;
+}
+const BARE = /[A-Za-z_][A-Za-z0-9_]*/y;
+/**
+ * ``a, `b c`, d`` -> `["a", "b c", "d"]`: names as ClickHouse's catalogue writes them.
+ *
+ * A name is bare or backtick-quoted with a backslash escaping the next character - the rule this
+ * library writes. Anything else throws: an expression the parser does not understand is not
+ * evidence that the table matches.
+ */
+export function parseIdentifierList(text) {
+    const names = [];
+    let position = 0;
+    const length = text.length;
+    while (position < length) {
+        if (text[position] === '`') {
+            position += 1;
+            let name = '';
+            for (;;) {
+                if (position >= length)
+                    throw new Error(`unterminated quoted name in ${JSON.stringify(text)}`);
+                const char = text[position];
+                if (char === '\\') {
+                    if (position + 1 >= length)
+                        throw new Error(`dangling escape in ${JSON.stringify(text)}`);
+                    name += text[position + 1];
+                    position += 2;
+                    continue;
+                }
+                if (char === '`') {
+                    position += 1;
+                    break;
+                }
+                name += char;
+                position += 1;
+            }
+            names.push(name);
+        }
+        else {
+            BARE.lastIndex = position;
+            const match = BARE.exec(text);
+            if (match === null)
+                throw new Error(`not a list of column names: ${JSON.stringify(text)}`);
+            names.push(match[0]);
+            position = BARE.lastIndex;
+        }
+        if (position < length) {
+            // A separator is only ever between two names: ", " at the end is not a list.
+            if (!text.startsWith(', ', position) || position + 2 >= length) {
+                throw new Error(`not a list of column names: ${JSON.stringify(text)}`);
+            }
+            position += 2;
+        }
+    }
+    return names;
+}
+/** ``toYYYYMM(`at`)`` -> `["toYYYYMM", "at"]`; an empty key -> `null`. */
+export function parsePartitionKey(text) {
+    if (text === '')
+        return null;
+    const match = /^([A-Za-z][A-Za-z0-9]*)\((.*)\)$/s.exec(text);
+    if (match === null)
+        throw new Error(`not a single-function partition key: ${JSON.stringify(text)}`);
+    const names = parseIdentifierList(match[2]);
+    if (names.length !== 1)
+        throw new Error(`not a single-function partition key: ${JSON.stringify(text)}`);
+    return [match[1], names[0]];
+}
+/**
+ * Throw when a table differs physically. Provisioning calls this; sessions do not.
+ *
+ * A session only reports (`session.physical`): the difference is performance, and turning it into
+ * the application's outage is what requirement 3.6 forbids. Provisioning is where a person applying
+ * a map can act on it.
+ */
+export function refuseFindings(findings, error) {
+    if (findings.length === 0)
+        return;
+    const details = findings.map(describeFinding).join('; ');
+    throw new error(`existing tables differ from the physical design this map declares: ${details}. ` +
+        '`CREATE ... IF NOT EXISTS` keeps whatever table or index already has the name, so this ' +
+        'came from an earlier map or from outside SDE. A new layout needs fresh tables (staging), ' +
+        'not the old ones under the new declaration.');
+}
+//# sourceMappingURL=physical.js.map

package/dist/physical.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"physical.js","sourceRoot":"","sources":["../src/physical.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AACtC,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAA;AAElD,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAA;AACtC,gGAAgG;AAEhG,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAU,CAAA;AAC9D;;;GAGG;AAEH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,MAAM,EAAE,aAAa,CAAU,CAAA;AAC9D;;;;GAIG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,MAAM,EAAE,OAAO,CAAU,CAAA;AAC1D,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,cAAc,EAAE,QAAQ,EAAE,KAAK,CAAU,CAAA;AAC5E,+FAA+F;AAE/F,MAAM,CAAC,MAAM,aAAa,GAAsB,CAAC,GAAG,gBAAgB,EAAE,GAAG,kBAAkB,CAAC,CAAC,IAAI,CAC/F,iBAAiB,CAClB,CAAA;AAED,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,EAAE,IAAI,CAAU,CAAA;AACnD,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC,EAAE,KAAK,CAAU,CAAA;AACjD,kGAAkG;AAElG,MAAM,iBAAiB,GAAwB,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAA;AACrF,MAAM,gBAAgB,GAAwB,IAAI,GAAG,CAAC,CAAC,aAAa,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAA;AAC5F,MAAM,UAAU,GAAwB,IAAI,GAAG,CAAC,CAAC,GAAG,iBAAiB,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAA;AAE5F,MAAM,CAAC,MAAM,mBAAmB,GAAqC,MAAM,CAAC,MAAM,CAAC;IACjF,GAAG,EAAE,QAAQ;IACb,KAAK,EAAE,UAAU;IACjB,IAAI,EAAE,QAAQ;CACf,CAAC,CAAA;AACF,4EAA4E;AAE5E,MAAM,CAAC,MAAM,qBAAqB,GAAwB,IAAI,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAA;AACjF;;;;GAIG;AAEH,MAAM,CAAC,MAAM,kBAAkB,GAAgD,MAAM,CAAC,MAAM,CAAC;IAC3F,UAAU,EAAE,kBAAkB;IAC9B,QAAQ,EAAE,gBAAgB;CAC3B,CAAC,CAAA;AAMF,SAAS,QAAQ,CAAC,KAAc;IAC9B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;AAC7E,CAAC;AAED,SAAS,SAAS,CAAC,KAAc;IAC/B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;AAC7D,CAAC;AAED,SAAS,IAAI,CAAC,KAAc;IAC1B,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;AAClE,CAAC;AAED,SAAS,UAAU,CAAC,KAA8B;IAChD,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAA;AACnD,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,WAAW,CAAC,KAAwC;IAClE,OAAO,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAA;AAC1E,CAAC;AAED,SAAS,aAAa,CAAC,KAAc;IACnC,OAAO,CACL,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QACpB,KAAK,CAAC,MAAM,GAAG,CAAC;QAChB,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CACzE,CAAA;AACH,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,aAAa,CAC3B,GAAY,EACZ,KAAa,EACb,MAAwC;IAExC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,QAAQ,CAAC,GAAG,KAAK,yDAAyD,CAAC,CAAA;IACzG,MAAM,GAAG,GAAsC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAClE,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAA;QAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,QAAQ,CAChB,GAAG,KAAK,sBAAsB,MAAM,+CAA+C;gBACjF,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAC3C,CAAA;QACH,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,QAAQ,CAAC,GAAG,KAAK,gBAAgB,MAAM,6CAA6C,CAAC,CAAA;QACjG,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;YAC7C,MAAM,IAAI,QAAQ,CAChB,GAAG,KAAK,gBAAgB,MAAM,4BAA4B,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,UAAU;gBACzF,6EAA6E,CAChF,CAAA;QACH,CAAC;QACD,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAA;IAC5B,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,wFAAwF;AACxF,MAAM,UAAU,gBAAgB,CAC9B,GAAY,EACZ,KAAa,EACb,MAAwC;IAExC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,QAAQ,CAAC,GAAG,KAAK,gEAAgE,CAAC,CAAA;IAC9F,CAAC;IACD,MAAM,GAAG,GAAkC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC9D,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAA;QACxB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,QAAQ,CAChB,GAAG,KAAK,yBAAyB,MAAM,+CAA+C;gBACpF,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAC3C,CAAA;QACH,CAAC;QACD,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QACrD,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,CAAC;YAC3F,MAAM,IAAI,QAAQ,CAChB,GAAG,KAAK,mBAAmB,MAAM,yDAAyD;gBACxF,cAAc,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI;gBACrG,uEAAuE,CAC1E,CAAA;QACH,CAAC;QACD,MAAM,MAAM,GAAG,IAA+B,CAAA;QAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;QAC7B,MAAM,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC,CAAA;QACzC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpD,MAAM,IAAI,QAAQ,CAAC,GAAG,KAAK,mBAAmB,MAAM,6BAA6B,CAAC,CAAA;QACpF,CAAC;QACD,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,CAAE,aAAmC,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;YACnG,MAAM,IAAI,QAAQ,CAChB,GAAG,KAAK,mBAAmB,MAAM,qBAAqB,IAAI,CAAC,WAAW,CAAC,iBAAiB;gBACtF,GAAG,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CACtC,CAAA;QACH,CAAC;QACD,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAA;IACrD,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,GAAY,EACZ,KAAa,EACb,MAAwC,EACxC,OAAmE,EACnE,QAAgB;IAEhB,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,EAAE,CAAA;IAChD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,QAAQ,CAAC,GAAG,KAAK,0CAA0C,CAAC,CAAA;IAC/F,MAAM,OAAO,GAAG,QAAQ,IAAI,qBAAqB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,iBAAiB,CAAA;IAClF,MAAM,GAAG,GAAwC,EAAE,CAAA;IACnD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,GAAG,CAAC,OAAO,CAAC,CAAC,KAAc,EAAE,QAAgB,EAAE,EAAE;QAC/C,MAAM,EAAE,GAAG,GAAG,KAAK,aAAa,QAAQ,GAAG,CAAA;QAC3C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,MAAM,IAAI,QAAQ,CAAC,GAAG,EAAE,oBAAoB,CAAC,CAAA;QACnE,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACpE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YAChE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,MAAM,IAAI,QAAQ,CAChB,GAAG,EAAE,SAAS,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,kCAAkC,qBAAqB,GAAG;oBAC3F,gDAAgD,QAAQ,+BAA+B;oBACvF,qFAAqF;oBACrF,+CAA+C,CAClD,CAAA;YACH,CAAC;YACD,MAAM,IAAI,QAAQ,CAAC,GAAG,EAAE,0CAA0C,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;QAC9F,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAA;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAA;QAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAA;QAC7B,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;YACjE,MAAM,IAAI,QAAQ,CAChB,GAAG,EAAE,iBAAiB,IAAI,CAAC,MAAM,CAAC,8CAA8C;gBAC9E,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAC3C,CAAA;QACH,CAAC;QACD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,QAAQ,CAAC,GAAG,EAAE,yBAAyB,CAAC,CAAA;QACrG,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,QAAQ,CAAC,GAAG,EAAE,2BAA2B,IAAI,GAAG,CAAC,CAAA;QAChF,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACf,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/D,MAAM,IAAI,QAAQ,CAAC,GAAG,EAAE,kDAAkD,CAAC,CAAA;QAC7E,CAAC;QACD,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;QAC7E,IAAI,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/D,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAA;YACzE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,IAAI,QAAQ,CAChB,GAAG,EAAE,YAAY,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,YAAY,MAAM,0BAA0B;oBAClF,oFAAoF;oBACpF,yCAAyC,CAC5C,CAAA;YACH,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;QACxE,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAClE,MAAM,IAAI,QAAQ,CAAC,GAAG,EAAE,eAAe,IAAI,CAAC,MAAM,CAAC,qBAAqB,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,EAAE,CAAC,CAAA;QAC1G,CAAC;QACD,MAAM,WAAW,GAAG,KAAK,CAAC,aAAa,CAAC,CAAA;QACxC,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,CAAA;QACjC,IAAK,kBAAwC,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/D,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,iBAAiB,CAAA;YACrC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,WAAW,GAAG,GAAG,IAAI,WAAW,GAAG,IAAI,EAAE,CAAC;gBACvE,MAAM,IAAI,QAAQ,CAChB,GAAG,EAAE,OAAO,MAAM,4CAA4C,GAAG,OAAO,IAAI,UAAU;oBACpF,IAAI,CAAC,WAAW,CAAC,CACpB,CAAA;YACH,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,MAAM,IAAI,QAAQ,CAAC,GAAG,EAAE,OAAO,MAAM,+CAA+C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC7G,CAAC;QACH,CAAC;aAAM,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YACrC,MAAM,IAAI,QAAQ,CAAC,GAAG,EAAE,uDAAuD,MAAM,EAAE,CAAC,CAAA;QAC1F,CAAC;QACD,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,cAAc,CAAA;YAClC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,GAAG,IAAI,OAAO,GAAG,IAAI,EAAE,CAAC;gBAC3D,MAAM,IAAI,QAAQ,CAChB,GAAG,EAAE,gDAAgD,GAAG,OAAO,IAAI,UAAU;oBAC3E,GAAG,IAAI,CAAC,OAAO,CAAC,mEAAmE;oBACnF,gBAAgB,CACnB,CAAA;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACjC,MAAM,IAAI,QAAQ,CAAC,GAAG,EAAE,0CAA0C,MAAM,EAAE,CAAC,CAAA;QAC7E,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAA;IACxB,CAAC,CAAC,CAAA;IACF,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAa,EACb,MAAc,EACd,GAAsB,EACtB,UAA4C,EAC5C,QAAuC,EACvC,SAAoC;IAEpC,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC;QAC9D,MAAM,IAAI,QAAQ,CAChB,GAAG,KAAK,gBAAgB,MAAM,SAAS,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,2BAA2B;YACxF,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,mEAAmE;YACzF,2EAA2E,CAC9E,CAAA;IACH,CAAC;IACD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAA;QAC7B,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,QAAQ,CAChB,GAAG,KAAK,mBAAmB,MAAM,qBAAqB,KAAK,6BAA6B;gBACtF,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,yDAAyD;gBAC/E,qFAAqF;gBACrF,qEAAqE,CACxE,CAAA;QACH,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;QAC7E,IAAI,IAAI,KAAK,SAAS,IAAI,CAAE,cAAoC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAChF,MAAM,IAAI,QAAQ,CAChB,GAAG,KAAK,mBAAmB,MAAM,qBAAqB,KAAK,eAAe,IAAI,CAAC,IAAI,CAAC,MAAM;gBACxF,+BAA+B,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,CACnE,CAAA;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,IAAuB,EAAE,KAAwB;IACxE,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IAC9C,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAA;IAC3C,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAA;IAC5C,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAA;AAC5D,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,YAAY,CAC1B,KAAa,EACb,MAAc,EACd,GAAsB,EACtB,QAAqD,EACrD,QAAoB,QAAQ;IAE5B,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IAC9E,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,CAAC,GAAG,GAAG,CAAC,CAAA;IAC1C,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,KAAK,CACb,GAAG,KAAK,gBAAgB,MAAM,SAAS,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,kBAAkB;YAC9E,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,iDAAiD,CAC1E,CAAA;IACH,CAAC;IACD,OAAO,CAAC,GAAG,OAAO,CAAC,CAAA;AACrB,CAAC;AAED,2FAA2F;AAC3F,MAAM,UAAU,mBAAmB,CACjC,KAAa,EACb,MAAc,EACd,GAAsB,EACtB,SAAoC,EACpC,QAAoB,QAAQ;IAE5B,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,IAAI,CAAA;IACxC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,KAAK,CACb,GAAG,KAAK,mBAAmB,MAAM,qBAAqB,SAAS,CAAC,KAAK,qBAAqB;YACxF,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,iEAAiE,CAC1F,CAAA;IACH,CAAC;IACD,MAAM,EAAE,GAAG,mBAAmB,CAAC,SAAS,CAAC,WAAW,CAAC,CAAA;IACrD,IAAI,EAAE,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,mCAAmC,SAAS,CAAC,WAAW,EAAE,CAAC,CAAA;IACzG,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,KAAK,CAAC,CAAA;AAC9B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,OAAe;IAC1C,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IACtG,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,EAAE,eAAe,EAAE,KAAK,EAAE,CAAA;IAC9D,MAAM,OAAO,GAA4B,EAAE,CAAA;IAC3C,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;QAC/B,MAAM,KAAK,GAA4B,EAAE,CAAA;QACzC,IAAK,kBAAwC,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/D,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,iBAAiB,CAAC,CAAA;YAC7C,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;QACtB,CAAC;QACD,IAAI,MAAM,KAAK,KAAK;YAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,CAAA;QAC7D,OAAO,CAAC,MAAM,CAAC,GAAG,KAAK,CAAA;IACzB,CAAC;IACD,OAAO;QACL,eAAe,EAAE,IAAI;QACrB,SAAS,EAAE,IAAI;QACf,uBAAuB,EAAE,qBAAqB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE;QACrF,YAAY,EAAE,0CAA0C;QACxD,aAAa,EAAE,OAAO;KACvB,CAAA;AACH,CAAC;AAkBD,MAAM,UAAU,eAAe,CAAC,OAAwB;IACtD,OAAO,GAAG,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,MAAM,OAAO,OAAO,CAAC,KAAK,yBAAyB,OAAO,CAAC,QAAQ,EAAE,CAAA;AAC3G,CAAC;AAwBD,+EAA+E;AAC/E,MAAM,UAAU,cAAc,CAC5B,MAAsB,EACtB,IAAiD;IAEjD,MAAM,GAAG,GAAoB,EAAE,CAAA;IAC/B,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC7F,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IAC3G,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;QACxE,MAAM,KAAK,GAAG,UAAU,KAAK,GAAG,CAAA;QAChC,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAA;QACvE,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;QAC/F,MAAM,SAAS,GAAG,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;QAC/D,MAAM,QAAQ,GAAoB,EAAE,CAAA;QACpC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,KAAK,MAAM;gBAAE,SAAQ;YAChD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,CAAA;YACjC,MAAM,WAAW,GAAG,KAAK,CAAC,aAAa,CAAC,CAAA;YACxC,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC3B,MAAM;gBACN,OAAO,EAAG,KAAK,CAAC,SAAS,CAAe,CAAC,GAAG,CAAC,MAAM,CAAC;gBACpD,WAAW,EAAE,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI;gBACjE,QAAQ,EAAE,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM;aAC1E,CAAC,CAAA;QACJ,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAA;IACjE,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,MAAM,IAAI,GAAG,yBAAyB,CAAA;AAEtC;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,IAAI,QAAQ,GAAG,CAAC,CAAA;IAChB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;IAC1B,OAAO,QAAQ,GAAG,MAAM,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,EAAE,CAAC;YAC3B,QAAQ,IAAI,CAAC,CAAA;YACb,IAAI,IAAI,GAAG,EAAE,CAAA;YACb,SAAS,CAAC;gBACR,IAAI,QAAQ,IAAI,MAAM;oBAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAC9F,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAE,CAAA;gBAC5B,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBAClB,IAAI,QAAQ,GAAG,CAAC,IAAI,MAAM;wBAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;oBACzF,IAAI,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAE,CAAA;oBAC3B,QAAQ,IAAI,CAAC,CAAA;oBACb,SAAQ;gBACV,CAAC;gBACD,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;oBACjB,QAAQ,IAAI,CAAC,CAAA;oBACb,MAAK;gBACP,CAAC;gBACD,IAAI,IAAI,IAAI,CAAA;gBACZ,QAAQ,IAAI,CAAC,CAAA;YACf,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAClB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC7B,IAAI,KAAK,KAAK,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC1F,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YACpB,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAA;QAC3B,CAAC;QACD,IAAI,QAAQ,GAAG,MAAM,EAAE,CAAC;YACtB,6EAA6E;YAC7E,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;gBAC/D,MAAM,IAAI,KAAK,CAAC,+BAA+B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACxE,CAAC;YACD,QAAQ,IAAI,CAAC,CAAA;QACf,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC5C,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,IAAI,CAAA;IAC5B,MAAM,KAAK,GAAG,mCAAmC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC5D,IAAI,KAAK,KAAK,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACnG,MAAM,KAAK,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAA;IAC5C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACvG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,CAAA;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,QAAoC,EAAE,KAAiB;IACpF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAM;IACjC,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACxD,MAAM,IAAI,KAAK,CACb,sEAAsE,OAAO,IAAI;QAC/E,yFAAyF;QACzF,2FAA2F;QAC3F,6CAA6C,CAChD,CAAA;AACH,CAAC"}

package/dist/placement.d.ts

@@ -0,0 +1,157 @@
+/**
+ * The placement map: where every group lives, and where every operation goes.
+ *
+ * The only instruction this library takes from outside, and therefore the one input that refuses
+ * rather than degrades. A bad signature, a mismatched model version, an unknown contract version:
+ * all of them stop the library from starting, because the map decides where data is written.
+ *
+ * An unsigned map is valid - that is the no-account mode, and it is a supported way to use this
+ * library rather than a gap. What is refused is a map carrying a signature, and therefore claiming to
+ * come from us, when there is no key to check the claim against.
+ */
+import type { LogicalModel } from './model.js';
+import type { PartitionSpec } from './physical.js';
+export interface PhysicalLayout {
+    readonly tables: Readonly<Record<string, string>>;
+    readonly columns: Readonly<Record<string, Readonly<Record<string, string>>>>;
+    readonly indexes: readonly Readonly<Record<string, unknown>>[];
+    /** Entity -> `{field, granularity}`, contract 5. See `physical.ts`. */
+    readonly partitionBy: Readonly<Record<string, PartitionSpec>>;
+    /**
+     * Entity -> its key columns in physical order, contract 5. Absent: the declared order.
+     *
+     * Optional in the type because a layout written by hand before contract 5 has no reason to carry
+     * it, and absent means exactly what every earlier map meant.
+     */
+    readonly keyOrder?: Readonly<Record<string, readonly string[]>>;
+}
+export interface Materialization {
+    readonly id: string;
+    readonly engine: string;
+    readonly layout: PhysicalLayout;
+    readonly lagBudgetMs: number | null;
+}
+export interface GroupPlacement {
+    readonly group: string;
+    readonly source: Materialization;
+    readonly derived: readonly Materialization[];
+    /**
+     * Derived copies that writes are **also** sent to, additionally and never authoritatively.
+     *
+     * This is how a migration reaches a library, and the reason no phase name appears anywhere in a
+     * map. A library does not need to know what `DUAL_WRITE` means; it needs to know where writes go
+     * and where reads go, and both were already things a map says. The phase in the document as well
+     * would be a second representation of a fact the fan-out and the routing table already carry.
+     *
+     * This runtime has no engine adapters, so it never performs the fan-out - and it parses and
+     * refuses exactly as the reference implementation does, because a fan-out target read differently
+     * in two languages is a row written to one copy and not the other.
+     */
+    readonly alsoWrite: readonly Materialization[];
+    readonly writeEpoch?: number | undefined;
+}
+export interface PlacementMap {
+    readonly contract: number;
+    readonly modelVersion: string;
+    readonly mapVersion: number;
+    readonly groups: Readonly<Record<string, GroupPlacement>>;
+    readonly routing: Readonly<Record<string, string>>;
+    readonly signed: boolean;
+    /**
+     * Which of the caller's public keys verified this map, by the caller's own name for it.
+     *
+     * `null` for an unsigned map and also for one verified against a bare key, where there was no
+     * name to report; `signed` tells those apart.
+     *
+     * Public because a rotation needs it. Adding a key is safe and reversible; **removing** one is
+     * the irreversible half, and a client cannot know when the old key is safe to drop without
+     * seeing which key the maps they are actually receiving were signed with.
+     */
+    readonly projectId?: string | undefined;
+    readonly fingerprint?: string | undefined;
+    readonly verifiedWith: string | null;
+}
+export interface LoadOptions {
+    readonly model?: LogicalModel;
+    /**
+     * Raw 32-byte Ed25519 public key, or several of them under the caller's own names.
+     *
+     * The mapping form is what makes a rotation possible without breaking the client: while both
+     * keys are configured, maps signed with either are accepted. What a runbook needs is not a key
+     * but something to *remove*, and "remove k1" is only an instruction if k1 is what the client
+     * wrote in their configuration.
+     */
+    readonly publicKey?: Uint8Array | Readonly<Record<string, Uint8Array>>;
+    readonly requireSignature?: boolean;
+}
+export declare const MAP_CONTRACT = 5;
+/**
+ * The placement map's format version, which is not the IR's - see `CONTRACT`.
+ *
+ * Five since 23 September 2026, for the physical design vocabulary (`physical.ts`): the order of a
+ * key, a time partition, and index methods. An earlier library would ignore `"method": "brin"` and
+ * build a B-tree from the same document, which is a loosening and therefore a bump. A contract-5
+ * library reads contracts 1 to 4 with their meaning unchanged, and refuses the new keys in them.
+ *
+ * Two because the map gained `also_write`, which a contract-1 library would ignore while a
+ * contract-2 one honours it: the same document, two different sets of engines written to, and the
+ * difference decided by which version happens to be installed. A loosening bumps the number.
+ */
+export declare const ALSO_WRITE_SINCE = 2;
+/**
+ * The contract that introduced `also_write`.
+ *
+ * A document declaring an earlier contract and carrying the key is refused. That is a *tightening*
+ * - no bump - and it exists because of who makes the mistake: a producer that grew the key and
+ * forgot to raise the number, which is what happened on the control-plane side of the very change
+ * that added it.
+ */
+export declare const MAP_CONTRACT_FLOOR = 1;
+/**
+ * The oldest map format this library still reads.
+ *
+ * Backwards compatible, forwards strict, and the asymmetry is knowledge rather than kindness: every
+ * contract-1 document is a valid contract-2 one with a key absent, which reads as "no dual write"
+ * and is a complete meaning. What came after this library cannot be known, so a higher number is
+ * refused rather than interpreted.
+ */
+export declare const WATERMARK_TABLE = "sde_map_state";
+/**
+ * The table the Python library keeps its map bookkeeping in: the highest map version applied
+ * against an engine, which is what stops an older signed map being loaded over a newer one.
+ *
+ * This runtime has no engine adapters, so it never writes that table - and it refuses a layout
+ * naming it anyway. The rule is a *parsing* rule, and a parsing rule that holds in one language
+ * and not the other is exactly the divergence the conformance suite exists to catch: one map, two
+ * libraries, accepted here and refused there. Nothing in this file could have discovered that on
+ * its own.
+ */
+export declare const BACKFILL_TABLE = "sde_backfill_state";
+/**
+ * The table the Python library keeps its backfill progress in: how many rows of each entity a
+ * migration has copied into an engine, which is what lets an interrupted backfill resume.
+ *
+ * The second reserved name, and the reason the refusal below is written over a table of them
+ * rather than over one string.
+ */
+export declare const RESERVED_TABLES: ReadonlyArray<readonly [string, string]>;
+/**
+ * Verify, and report **which** of the caller's keys did it.
+ *
+ * **Every key is tried, and `key_id` only decides the order.** The signature block is excluded
+ * from the signed payload in its entirety, so `key_id` is not covered by the signature and anybody
+ * can edit it. Treating it as authoritative would be trusting an attacker's annotation; making it
+ * authenticated would change what the payload is, which recomputes every signature ever issued and
+ * is a contract bump in every language at once. As an ordering it costs nothing to be wrong about.
+ *
+ * The cost of accepting a set is real: **an old key verifies for as long as the client keeps it.**
+ * This library has no clock, so it cannot expire one - and that same absence is what makes "you
+ * stop paying and nothing breaks" true. Revocation is the client removing a key from their own
+ * configuration, which is why the id that verified is reported.
+ */
+/** Internal shared verifier for signed instruction envelopes; not a package entry point. */
+export declare function verifyMapSignature(raw: Record<string, unknown>, publicKey: Uint8Array | Readonly<Record<string, Uint8Array>>): string | null;
+export declare function loadMap(raw: unknown, options?: LoadOptions): PlacementMap;
+export declare function fingerprintOf(map: PlacementMap): string | undefined;
+export declare function placementOf(map: PlacementMap, group: string): GroupPlacement;
+export declare function materializationById(placement: GroupPlacement, id: string): Materialization;