@pyric/ui 0.1.0-alpha.7

package/dist/firestore/index.js

@@ -0,0 +1,28 @@
+export * from './hooks/index.js';
+// Injectable Firestore API bundle (Pyric Studio data-backend swap): defaults to
+// in-process `pyric/firestore`; a consumer can provide the SharedWorker client.
+export { FirestoreApiProvider, useFirestoreApi, } from './firestoreApi.js';
+// M2: read-only display surface
+export { inferType, asVectorView, vectorPreview, truncateVectorsForDisplay, } from './types.js';
+export { defaultFieldEditors, mergeFieldEditors, } from './fieldEditors/registry.js';
+export { FieldRenderer } from './components/FieldRenderer.js';
+export { DocumentPreview, } from './components/DocumentPreview.js';
+export { validateLeaf, validateTree } from './reducers/validation.js';
+export { treeFromData, treeToData } from './reducers/tree.js';
+export { initState, reducer } from './reducers/documentEditor.js';
+export { DocumentEditor, DocumentEditorRoot, DocumentEditorFields, useDocumentEditorContext, } from './components/DocumentEditor.js';
+// M4: operational read/write + admin ops
+export { CollectionList } from './components/CollectionList.js';
+export { DocumentList } from './components/DocumentList.js';
+export { DeleteWithConfirm, } from './components/DeleteWithConfirm.js';
+// M5: improvements over firebase-tools-ui
+export { ReferencePicker, } from './components/ReferencePicker.js';
+// M6: query builder + virtualization
+export { QueryBuilder, } from './components/QueryBuilder.js';
+// M7: create-collection / create-document / JSON-import — pure, tested logic.
+// Presentational wiring lives in the consumer (Pyric Studio's FirestorePane)
+// over these + the existing DocumentEditor/hooks, per the disclosure-over-
+// modals design principles.
+export { validateCollectionId, validateDocumentId } from './validation/ids.js';
+export { parseImport, detectCollisions, firestoreAutoId, } from './import/parseImport.js';
+//# sourceMappingURL=index.js.map

package/dist/firestore/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/firestore/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC;AAEjC,gFAAgF;AAChF,gFAAgF;AAChF,OAAO,EACL,oBAAoB,EACpB,eAAe,GAEhB,MAAM,mBAAmB,CAAC;AAE3B,gCAAgC;AAChC,OAAO,EACL,SAAS,EACT,YAAY,EACZ,aAAa,EACb,yBAAyB,GAG1B,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,mBAAmB,EACnB,iBAAiB,GAClB,MAAM,4BAA4B,CAAC;AAOpC,OAAO,EAAE,aAAa,EAA2B,MAAM,+BAA+B,CAAC;AACvF,OAAO,EACL,eAAe,GAEhB,MAAM,iCAAiC,CAAC;AASzC,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAC9D,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,8BAA8B,CAAC;AAClE,OAAO,EACL,cAAc,EACd,kBAAkB,EAClB,oBAAoB,EACpB,wBAAwB,GAEzB,MAAM,gCAAgC,CAAC;AAExC,yCAAyC;AACzC,OAAO,EAAE,cAAc,EAA4B,MAAM,gCAAgC,CAAC;AAC1F,OAAO,EAAE,YAAY,EAA0B,MAAM,8BAA8B,CAAC;AACpF,OAAO,EACL,iBAAiB,GAElB,MAAM,mCAAmC,CAAC;AAE3C,0CAA0C;AAC1C,OAAO,EACL,eAAe,GAEhB,MAAM,iCAAiC,CAAC;AAEzC,qCAAqC;AACrC,OAAO,EACL,YAAY,GAEb,MAAM,8BAA8B,CAAC;AAEtC,8EAA8E;AAC9E,6EAA6E;AAC7E,2EAA2E;AAC3E,4BAA4B;AAC5B,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAC/E,OAAO,EACL,WAAW,EACX,gBAAgB,EAChB,eAAe,GAIhB,MAAM,yBAAyB,CAAC"}

package/dist/firestore/reducers/defaults.d.ts

@@ -0,0 +1,10 @@
+import type { FieldType } from '../types.js';
+/**
+ * Default value used when a new field of this type is added (or
+ * when an existing field's type is switched). The reducer applies
+ * these so a fresh node always starts in a valid state for its type
+ * — except that map/array start empty (children come from add
+ * actions).
+ */
+export declare function defaultValueFor(type: FieldType): unknown;
+//# sourceMappingURL=defaults.d.ts.map

package/dist/firestore/reducers/defaults.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"defaults.d.ts","sourceRoot":"","sources":["../../../src/firestore/reducers/defaults.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE7C;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,SAAS,GAAG,OAAO,CA2BxD"}

package/dist/firestore/reducers/defaults.js

@@ -0,0 +1,37 @@
+import { Timestamp, GeoPoint, Bytes } from 'pyric/firestore';
+/**
+ * Default value used when a new field of this type is added (or
+ * when an existing field's type is switched). The reducer applies
+ * these so a fresh node always starts in a valid state for its type
+ * — except that map/array start empty (children come from add
+ * actions).
+ */
+export function defaultValueFor(type) {
+    switch (type) {
+        case 'string':
+            return '';
+        case 'number':
+            return 0;
+        case 'boolean':
+            return false;
+        case 'null':
+            return null;
+        case 'timestamp':
+            return Timestamp.now();
+        case 'geopoint':
+            return new GeoPoint(0, 0);
+        case 'reference':
+            // No default — a fresh reference is invalid until the user
+            // sets a path. The validator will surface that.
+            return { path: '', id: '', firestore: {} };
+        case 'bytes':
+            return Bytes.fromUint8Array(new Uint8Array());
+        case 'vector':
+            // The wire-sentinel both inferType and the vector editor speak.
+            return { __type__: '__vector__', value: [] };
+        case 'map':
+        case 'array':
+            return undefined; // children carry the value
+    }
+}
+//# sourceMappingURL=defaults.js.map

package/dist/firestore/reducers/defaults.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"defaults.js","sourceRoot":"","sources":["../../../src/firestore/reducers/defaults.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAG7D;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,IAAe;IAC7C,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,EAAE,CAAC;QACZ,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC;QACX,KAAK,SAAS;YACZ,OAAO,KAAK,CAAC;QACf,KAAK,MAAM;YACT,OAAO,IAAI,CAAC;QACd,KAAK,WAAW;YACd,OAAO,SAAS,CAAC,GAAG,EAAE,CAAC;QACzB,KAAK,UAAU;YACb,OAAO,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,KAAK,WAAW;YACd,2DAA2D;YAC3D,gDAAgD;YAChD,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;QAC7C,KAAK,OAAO;YACV,OAAO,KAAK,CAAC,cAAc,CAAC,IAAI,UAAU,EAAE,CAAC,CAAC;QAChD,KAAK,QAAQ;YACX,gEAAgE;YAChE,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QAC/C,KAAK,KAAK,CAAC;QACX,KAAK,OAAO;YACV,OAAO,SAAS,CAAC,CAAC,2BAA2B;IACjD,CAAC;AACH,CAAC"}

package/dist/firestore/reducers/documentEditor.d.ts

@@ -0,0 +1,23 @@
+import type { DocumentEditorAction, DocumentEditorState } from './types.js';
+/**
+ * Rehydrate serialized Firestore values back into class instances. Over a
+ * worker / postMessage boundary, a Timestamp/GeoPoint loses its class and
+ * arrives as a plain `{ seconds, nanoseconds }` / `{ latitude, longitude }`;
+ * the editor's validators check `instanceof`, so without this the editor opens
+ * with false "Expected a Timestamp/GeoPoint" errors. Vectors stay as their wire
+ * sentinel (there is no Vector constructor; the editor speaks the sentinel).
+ * The prototype guard stops the recursion from walking INTO instances and
+ * shredding them into plain maps.
+ */
+export declare function rehydrateFirestoreValues(value: unknown): unknown;
+/** Initial state factory. Builds tree + initial snapshot + error count. */
+export declare function initState(initial: Record<string, unknown>): DocumentEditorState;
+/**
+ * Pure reducer. Every action returns a fresh state — no in-place
+ * mutation of `state.tree`. Validation re-runs after the structural
+ * change so `errorCount` is always current. Container nodes (map /
+ * array) ignore actions that don't apply to them rather than
+ * throwing; the components only render valid affordances per type.
+ */
+export declare function reducer(state: DocumentEditorState, action: DocumentEditorAction): DocumentEditorState;
+//# sourceMappingURL=documentEditor.d.ts.map

package/dist/firestore/reducers/documentEditor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"documentEditor.d.ts","sourceRoot":"","sources":["../../../src/firestore/reducers/documentEditor.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,oBAAoB,EACpB,mBAAmB,EAGpB,MAAM,YAAY,CAAC;AAOpB;;;;;;;;;GASG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAmBhE;AAED,2EAA2E;AAC3E,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,mBAAmB,CAI/E;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CACrB,KAAK,EAAE,mBAAmB,EAC1B,MAAM,EAAE,oBAAoB,GAC3B,mBAAmB,CA+CrB"}

package/dist/firestore/reducers/documentEditor.js

@@ -0,0 +1,199 @@
+import { Timestamp, GeoPoint } from 'pyric/firestore';
+import { cloneTree, collectDescendants, treeFromData } from './tree.js';
+import { validateTree } from './validation.js';
+import { defaultValueFor } from './defaults.js';
+import { isTimestampShape, isGeoPointShape, asVectorView } from '../types.js';
+/**
+ * Rehydrate serialized Firestore values back into class instances. Over a
+ * worker / postMessage boundary, a Timestamp/GeoPoint loses its class and
+ * arrives as a plain `{ seconds, nanoseconds }` / `{ latitude, longitude }`;
+ * the editor's validators check `instanceof`, so without this the editor opens
+ * with false "Expected a Timestamp/GeoPoint" errors. Vectors stay as their wire
+ * sentinel (there is no Vector constructor; the editor speaks the sentinel).
+ * The prototype guard stops the recursion from walking INTO instances and
+ * shredding them into plain maps.
+ */
+export function rehydrateFirestoreValues(value) {
+    if (value === null || typeof value !== 'object')
+        return value;
+    if (asVectorView(value) !== null)
+        return value; // wire-sentinel vector: leave as-is
+    if (isTimestampShape(value)) {
+        const o = value;
+        return new Timestamp(o.seconds ?? o._seconds ?? 0, o.nanoseconds ?? o._nanoseconds ?? 0);
+    }
+    if (isGeoPointShape(value)) {
+        const o = value;
+        return new GeoPoint(o.latitude, o.longitude);
+    }
+    if (Array.isArray(value))
+        return value.map(rehydrateFirestoreValues);
+    const proto = Object.getPrototypeOf(value);
+    if (proto === Object.prototype || proto === null) {
+        const out = {};
+        for (const [k, v] of Object.entries(value))
+            out[k] = rehydrateFirestoreValues(v);
+        return out;
+    }
+    return value; // a class instance (Timestamp, GeoPoint, DocumentReference, …): leave intact
+}
+/** Initial state factory. Builds tree + initial snapshot + error count. */
+export function initState(initial) {
+    const fresh = treeFromData(rehydrateFirestoreValues(initial));
+    const { tree, errorCount } = validateTree(fresh);
+    return { tree, initial: tree, errorCount };
+}
+/**
+ * Pure reducer. Every action returns a fresh state — no in-place
+ * mutation of `state.tree`. Validation re-runs after the structural
+ * change so `errorCount` is always current. Container nodes (map /
+ * array) ignore actions that don't apply to them rather than
+ * throwing; the components only render valid affordances per type.
+ */
+export function reducer(state, action) {
+    switch (action.type) {
+        case 'setValue':
+            return applyAndValidate(state, (t) => setValue(t, action.nodeId, action.value));
+        case 'setType':
+            return applyAndValidate(state, (t) => setType(t, action.nodeId, action.newType));
+        case 'setKey':
+            return applyAndValidate(state, (t) => setKey(t, action.nodeId, action.key));
+        case 'addMapEntry':
+            return applyAndValidate(state, (t) => addMapEntry(t, action.parentId, action.key, action.childType));
+        case 'addArrayEntry':
+            return applyAndValidate(state, (t) => addArrayEntry(t, action.parentId, action.childType));
+        case 'remove':
+            return applyAndValidate(state, (t) => removeNode(t, action.nodeId));
+        case 'reset':
+            return {
+                tree: state.initial,
+                initial: state.initial,
+                errorCount: countErrors(state.initial),
+            };
+        case 'touch': {
+            const node = state.tree.nodes[action.nodeId];
+            if (!node || node.touched)
+                return state; // no-op: already touched
+            const tree = cloneTree(state.tree);
+            tree.nodes[action.nodeId] = { ...tree.nodes[action.nodeId], touched: true };
+            return { ...state, tree };
+        }
+        case 'touchAll': {
+            const tree = cloneTree(state.tree);
+            for (const id of Object.keys(tree.nodes)) {
+                tree.nodes[id] = { ...tree.nodes[id], touched: true };
+            }
+            return { ...state, tree };
+        }
+    }
+}
+function applyAndValidate(state, mutate) {
+    const next = mutate(cloneTree(state.tree));
+    const { tree, errorCount } = validateTree(next);
+    return { ...state, tree, errorCount };
+}
+function countErrors(tree) {
+    let n = 0;
+    for (const node of Object.values(tree.nodes)) {
+        if (node.error)
+            n++;
+    }
+    return n;
+}
+// ---------------------------------------------------------------------------
+// Structural transformations. Each takes a cloned tree (mutable here),
+// mutates it, and returns it. validateTree runs in applyAndValidate.
+function setValue(tree, nodeId, value) {
+    const node = tree.nodes[nodeId];
+    if (!node)
+        return tree;
+    if (node.type === 'map' || node.type === 'array')
+        return tree;
+    tree.nodes[nodeId] = { ...node, value };
+    return tree;
+}
+function setType(tree, nodeId, newType) {
+    const node = tree.nodes[nodeId];
+    if (!node)
+        return tree;
+    // Don't allow switching the root away from `map` — the
+    // serializer assumes the root is a map.
+    if (node.id === tree.rootId && newType !== 'map')
+        return tree;
+    if (node.type === newType)
+        return tree;
+    // If switching away from a container, drop its children.
+    if (node.type === 'map' || node.type === 'array') {
+        const toRemove = (tree.childIds[nodeId] ?? []).slice();
+        for (const childId of toRemove) {
+            for (const descId of collectDescendants(tree, childId)) {
+                delete tree.nodes[descId];
+                delete tree.childIds[descId];
+            }
+        }
+        tree.childIds[nodeId] = [];
+    }
+    const value = newType === 'map' || newType === 'array' ? undefined : defaultValueFor(newType);
+    tree.nodes[nodeId] = { ...node, type: newType, value };
+    return tree;
+}
+function setKey(tree, nodeId, key) {
+    const node = tree.nodes[nodeId];
+    if (!node)
+        return tree;
+    // Only map children carry a key. Array children's positions come
+    // from the parent's child list order.
+    if (node.parentId == null)
+        return tree; // root has no key
+    const parent = tree.nodes[node.parentId];
+    if (!parent || parent.type !== 'map')
+        return tree;
+    tree.nodes[nodeId] = { ...node, key };
+    return tree;
+}
+function addMapEntry(tree, parentId, key, childType) {
+    const parent = tree.nodes[parentId];
+    if (!parent || parent.type !== 'map')
+        return tree;
+    const id = crypto.randomUUID();
+    const value = childType === 'map' || childType === 'array'
+        ? undefined
+        : defaultValueFor(childType);
+    tree.nodes[id] = { id, parentId, key, type: childType, value };
+    tree.childIds[id] = [];
+    tree.childIds[parentId] = [...(tree.childIds[parentId] ?? []), id];
+    return tree;
+}
+function addArrayEntry(tree, parentId, childType) {
+    const parent = tree.nodes[parentId];
+    if (!parent || parent.type !== 'array')
+        return tree;
+    // Firestore disallows nested arrays — guard at the reducer level.
+    if (childType === 'array')
+        return tree;
+    const id = crypto.randomUUID();
+    const value = childType === 'map' ? undefined : defaultValueFor(childType);
+    tree.nodes[id] = { id, parentId, key: null, type: childType, value };
+    tree.childIds[id] = [];
+    tree.childIds[parentId] = [...(tree.childIds[parentId] ?? []), id];
+    return tree;
+}
+function removeNode(tree, nodeId) {
+    const node = tree.nodes[nodeId];
+    if (!node)
+        return tree;
+    // Removing the root is forbidden — it would invalidate the
+    // serializer.
+    if (node.id === tree.rootId)
+        return tree;
+    const ids = collectDescendants(tree, nodeId);
+    for (const id of ids) {
+        delete tree.nodes[id];
+        delete tree.childIds[id];
+    }
+    if (node.parentId != null) {
+        tree.childIds[node.parentId] = (tree.childIds[node.parentId] ?? []).filter((id) => id !== nodeId);
+    }
+    return tree;
+}
+//# sourceMappingURL=documentEditor.js.map

package/dist/firestore/reducers/documentEditor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"documentEditor.js","sourceRoot":"","sources":["../../../src/firestore/reducers/documentEditor.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AACxE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAc;IACrD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9D,IAAI,YAAY,CAAC,KAAK,CAAC,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC,CAAC,oCAAoC;IACpF,IAAI,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,KAA+B,CAAC;QAC1C,OAAO,IAAI,SAAS,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC;IAC3F,CAAC;IACD,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,KAA+B,CAAC;QAC1C,OAAO,IAAI,QAAQ,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;IAC/C,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;IACrE,MAAM,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IAC3C,IAAI,KAAK,KAAK,MAAM,CAAC,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACjD,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAAC;QACjF,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,KAAK,CAAC,CAAC,6EAA6E;AAC7F,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,SAAS,CAAC,OAAgC;IACxD,MAAM,KAAK,GAAG,YAAY,CAAC,wBAAwB,CAAC,OAAO,CAA4B,CAAC,CAAC;IACzF,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACjD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;AAC7C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CACrB,KAA0B,EAC1B,MAA4B;IAE5B,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,UAAU;YACb,OAAO,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAElF,KAAK,SAAS;YACZ,OAAO,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QAEnF,KAAK,QAAQ;YACX,OAAO,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QAE9E,KAAK,aAAa;YAChB,OAAO,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CACnC,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,SAAS,CAAC,CAC9D,CAAC;QAEJ,KAAK,eAAe;YAClB,OAAO,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CACnC,aAAa,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAS,CAAC,CACpD,CAAC;QAEJ,KAAK,QAAQ;YACX,OAAO,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAEtE,KAAK,OAAO;YACV,OAAO;gBACL,IAAI,EAAE,KAAK,CAAC,OAAO;gBACnB,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC;aACvC,CAAC;QAEJ,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO;gBAAE,OAAO,KAAK,CAAC,CAAC,yBAAyB;YAClE,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;YAC7E,OAAO,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE,CAAC;QAC5B,CAAC;QAED,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACnC,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;YACzD,CAAC;YACD,OAAO,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE,CAAC;QAC5B,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB,CACvB,KAA0B,EAC1B,MAAwC;IAExC,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3C,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAChD,OAAO,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;AACxC,CAAC;AAED,SAAS,WAAW,CAAC,IAAgB;IACnC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7C,IAAI,IAAI,CAAC,KAAK;YAAE,CAAC,EAAE,CAAC;IACtB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,8EAA8E;AAC9E,uEAAuE;AACvE,qEAAqE;AAErE,SAAS,QAAQ,CAAC,IAAgB,EAAE,MAAc,EAAE,KAAc;IAChE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IAC9D,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC;IACxC,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,OAAO,CACd,IAAgB,EAChB,MAAc,EACd,OAA0B;IAE1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,uDAAuD;IACvD,wCAAwC;IACxC,IAAI,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,IAAI,OAAO,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC;IAC9D,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IAEvC,yDAAyD;IACzD,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACjD,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;QACvD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,KAAK,MAAM,MAAM,IAAI,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;gBACvD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC1B,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;IAC7B,CAAC;IAED,MAAM,KAAK,GACT,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;IAClF,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACvD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,MAAM,CAAC,IAAgB,EAAE,MAAc,EAAE,GAAW;IAC3D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,iEAAiE;IACjE,sCAAsC;IACtC,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC,CAAC,kBAAkB;IAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC;IAClD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;IACtC,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAClB,IAAgB,EAChB,QAAgB,EAChB,GAAW,EACX,SAA4B;IAE5B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACpC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC;IAClD,MAAM,EAAE,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;IAC/B,MAAM,KAAK,GACT,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,OAAO;QAC1C,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;IACjC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAC/D,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;IACvB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IACnE,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,aAAa,CACpB,IAAgB,EAChB,QAAgB,EAChB,SAA4B;IAE5B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACpC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IACpD,kEAAkE;IAClE,IAAI,SAAS,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IACvC,MAAM,EAAE,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;IAC/B,MAAM,KAAK,GACT,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;IAC/D,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IACrE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;IACvB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IACnE,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,UAAU,CAAC,IAAgB,EAAE,MAAc;IAClD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,2DAA2D;IAC3D,cAAc;IACd,IAAI,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEzC,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC7C,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CACxE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CACtB,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/firestore/reducers/tree.d.ts

@@ -0,0 +1,28 @@
+import type { EditorTree } from './types.js';
+/**
+ * Build a normalized editor tree from a Firestore-shaped object.
+ * The root node is a virtual `map` that holds the document's
+ * top-level fields. Order of children mirrors `Object.entries` (the
+ * renderer is responsible for any sort it wants).
+ */
+export declare function treeFromData(data: Record<string, unknown>): EditorTree;
+/**
+ * Serialize a tree back to a Firestore-shaped object. Leaf values
+ * pass through unchanged (so a `Timestamp` round-trips as the same
+ * `Timestamp` instance). Maps recurse with their sorted keys; arrays
+ * recurse in `childIds` order.
+ */
+export declare function treeToData(tree: EditorTree): Record<string, unknown>;
+/**
+ * Deep-clone a tree. Cheap because nodes are flat — no
+ * Firestore values traverse this path (`Timestamp`, `Bytes` etc.
+ * are stored as references, not copies, and that's fine because
+ * the reducer never mutates the value, only replaces the node).
+ */
+export declare function cloneTree(tree: EditorTree): EditorTree;
+/**
+ * Collect a node and all its descendants. Used by `remove` to wipe
+ * an entire subtree from the lookup tables in one pass.
+ */
+export declare function collectDescendants(tree: EditorTree, nodeId: string): string[];
+//# sourceMappingURL=tree.d.ts.map

package/dist/firestore/reducers/tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.d.ts","sourceRoot":"","sources":["../../../src/firestore/reducers/tree.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAa,MAAM,YAAY,CAAC;AAOxD;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,UAAU,CAatE;AAqCD;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAOpE;AA6BD;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,UAAU,GAAG,UAAU,CAUtD;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAW7E"}

package/dist/firestore/reducers/tree.js

@@ -0,0 +1,129 @@
+import { inferType } from '../types.js';
+/** Web-standard uuid generator. Browser-only target. */
+function uuid() {
+    return crypto.randomUUID();
+}
+/**
+ * Build a normalized editor tree from a Firestore-shaped object.
+ * The root node is a virtual `map` that holds the document's
+ * top-level fields. Order of children mirrors `Object.entries` (the
+ * renderer is responsible for any sort it wants).
+ */
+export function treeFromData(data) {
+    const rootId = uuid();
+    const tree = {
+        rootId,
+        nodes: {
+            [rootId]: { id: rootId, parentId: null, key: null, type: 'map', value: undefined },
+        },
+        childIds: { [rootId]: [] },
+    };
+    for (const [key, value] of Object.entries(data)) {
+        addSubtree(tree, rootId, key, value);
+    }
+    return tree;
+}
+function addSubtree(tree, parentId, key, value) {
+    const type = inferType(value);
+    const id = uuid();
+    const node = {
+        id,
+        parentId,
+        key,
+        type,
+        value: isContainer(type) ? undefined : value,
+    };
+    tree.nodes[id] = node;
+    tree.childIds[id] = [];
+    tree.childIds[parentId].push(id);
+    if (type === 'map' && value && typeof value === 'object') {
+        for (const [childKey, childValue] of Object.entries(value)) {
+            addSubtree(tree, id, childKey, childValue);
+        }
+    }
+    else if (type === 'array' && Array.isArray(value)) {
+        for (const childValue of value) {
+            addSubtree(tree, id, null, childValue);
+        }
+    }
+    return id;
+}
+function isContainer(type) {
+    return type === 'map' || type === 'array';
+}
+/**
+ * Serialize a tree back to a Firestore-shaped object. Leaf values
+ * pass through unchanged (so a `Timestamp` round-trips as the same
+ * `Timestamp` instance). Maps recurse with their sorted keys; arrays
+ * recurse in `childIds` order.
+ */
+export function treeToData(tree) {
+    const root = tree.nodes[tree.rootId];
+    if (!root || root.type !== 'map') {
+        throw new Error('treeToData: tree root must be a map node');
+    }
+    const result = serializeNode(tree, tree.rootId);
+    return result;
+}
+function serializeNode(tree, nodeId) {
+    const node = tree.nodes[nodeId];
+    if (!node)
+        throw new Error(`serializeNode: missing node ${nodeId}`);
+    switch (node.type) {
+        case 'map': {
+            const out = {};
+            for (const childId of tree.childIds[nodeId] ?? []) {
+                const child = tree.nodes[childId];
+                if (!child)
+                    continue;
+                if (child.key == null)
+                    continue; // map child must have a key
+                out[child.key] = serializeNode(tree, childId);
+            }
+            return out;
+        }
+        case 'array': {
+            const out = [];
+            for (const childId of tree.childIds[nodeId] ?? []) {
+                out.push(serializeNode(tree, childId));
+            }
+            return out;
+        }
+        default:
+            return node.value;
+    }
+}
+/**
+ * Deep-clone a tree. Cheap because nodes are flat — no
+ * Firestore values traverse this path (`Timestamp`, `Bytes` etc.
+ * are stored as references, not copies, and that's fine because
+ * the reducer never mutates the value, only replaces the node).
+ */
+export function cloneTree(tree) {
+    const nodes = {};
+    for (const [id, node] of Object.entries(tree.nodes)) {
+        nodes[id] = { ...node };
+    }
+    const childIds = {};
+    for (const [id, ids] of Object.entries(tree.childIds)) {
+        childIds[id] = [...ids];
+    }
+    return { rootId: tree.rootId, nodes, childIds };
+}
+/**
+ * Collect a node and all its descendants. Used by `remove` to wipe
+ * an entire subtree from the lookup tables in one pass.
+ */
+export function collectDescendants(tree, nodeId) {
+    const out = [nodeId];
+    const queue = [nodeId];
+    while (queue.length) {
+        const current = queue.shift();
+        for (const childId of tree.childIds[current] ?? []) {
+            out.push(childId);
+            queue.push(childId);
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=tree.js.map

package/dist/firestore/reducers/tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.js","sourceRoot":"","sources":["../../../src/firestore/reducers/tree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAkB,MAAM,aAAa,CAAC;AAGxD,wDAAwD;AACxD,SAAS,IAAI;IACX,OAAO,MAAM,CAAC,UAAU,EAAE,CAAC;AAC7B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,IAA6B;IACxD,MAAM,MAAM,GAAG,IAAI,EAAE,CAAC;IACtB,MAAM,IAAI,GAAe;QACvB,MAAM;QACN,KAAK,EAAE;YACL,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE;SACnF;QACD,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE;KAC3B,CAAC;IACF,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,UAAU,CACjB,IAAgB,EAChB,QAAgB,EAChB,GAAkB,EAClB,KAAc;IAEd,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,IAAI,EAAE,CAAC;IAClB,MAAM,IAAI,GAAc;QACtB,EAAE;QACF,QAAQ;QACR,GAAG;QACH,IAAI;QACJ,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK;KAC7C,CAAC;IACF,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IACtB,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;IACvB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEjC,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACzD,KAAK,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3D,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;SAAM,IAAI,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACpD,KAAK,MAAM,UAAU,IAAI,KAAK,EAAE,CAAC;YAC/B,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAS,WAAW,CAAC,IAAe;IAClC,OAAO,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,OAAO,CAAC;AAC5C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,IAAgB;IACzC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC9D,CAAC;IACD,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAChD,OAAO,MAAiC,CAAC;AAC3C,CAAC;AAED,SAAS,aAAa,CAAC,IAAgB,EAAE,MAAc;IACrD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,MAAM,EAAE,CAAC,CAAC;IAEpE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,GAAG,GAA4B,EAAE,CAAC;YACxC,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBAClC,IAAI,CAAC,KAAK;oBAAE,SAAS;gBACrB,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI;oBAAE,SAAS,CAAC,4BAA4B;gBAC7D,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAChD,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,GAAG,GAAc,EAAE,CAAC;YAC1B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClD,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;YACzC,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,IAAgB;IACxC,MAAM,KAAK,GAA8B,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACpD,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;IAC1B,CAAC;IACD,MAAM,QAAQ,GAA6B,EAAE,CAAC;IAC9C,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtD,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAClD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAgB,EAAE,MAAc;IACjE,MAAM,GAAG,GAAa,CAAC,MAAM,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;IACvB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACnD,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/firestore/reducers/types.d.ts

@@ -0,0 +1,112 @@
+import type { FieldType } from '../types.js';
+/**
+ * One node in the normalized editor tree. Every Firestore field —
+ * leaf or container — is a node with a uuid, a parent pointer, a
+ * type, and a value. Containers (map, array) carry no value of
+ * their own; their children represent the value.
+ */
+export interface FieldNode {
+    /** Stable uuid. Used as React `key` and as the action target. */
+    id: string;
+    /** Parent uuid; `null` for the root. */
+    parentId: string | null;
+    /**
+     * Map children carry their key here. Array children carry `null`
+     * (position comes from the parent's `childIds` order). The root
+     * also carries `null` (it has no parent).
+     */
+    key: string | null;
+    /** Discriminated type. Drives which editor renders. */
+    type: FieldType;
+    /**
+     * Leaf value. `undefined` for `map` / `array` — those carry their
+     * value as children. `null` field type has `value === null`.
+     */
+    value: unknown;
+    /**
+     * Validation error message attached to the node by the reducer
+     * after every action. `undefined` when valid. Computed on EVERY
+     * action regardless of {@link touched} — `errorCount` / `isValid`
+     * must reflect the true state so Save stays disabled. `touched`
+     * governs only whether a consumer chooses to DISPLAY the error.
+     */
+    error?: string;
+    /**
+     * Set once the field has been blurred (or a submit attempt swept
+     * the whole tree via `touchAll`). Consumers gate error display on
+     * `touched && error` so a freshly-added empty row doesn't show
+     * "Field name is required" before the user has interacted with it.
+     */
+    touched?: boolean;
+}
+/**
+ * Normalized tree of nodes. `nodes` is the lookup; `childIds` is the
+ * ordered child list per parent. The root node is itself a `map`
+ * node (its children are the document's top-level fields).
+ */
+export interface EditorTree {
+    rootId: string;
+    nodes: Record<string, FieldNode>;
+    childIds: Record<string, string[]>;
+}
+/**
+ * Discriminated union of every action the reducer accepts. Each
+ * action carries a `type` discriminator plus the data the reducer
+ * needs to apply it.
+ */
+export type DocumentEditorAction = {
+    type: 'setValue';
+    nodeId: string;
+    value: unknown;
+} | {
+    type: 'setType';
+    nodeId: string;
+    newType: FieldType;
+} | {
+    type: 'setKey';
+    nodeId: string;
+    key: string;
+} | {
+    type: 'addMapEntry';
+    parentId: string;
+    key: string;
+    childType: FieldType;
+} | {
+    type: 'addArrayEntry';
+    parentId: string;
+    childType: FieldType;
+} | {
+    type: 'remove';
+    nodeId: string;
+} | {
+    type: 'reset';
+}
+/** Mark one node touched (dispatched on blur). Doesn't change any
+ *  value — only gates error display for consumers that check it. */
+ | {
+    type: 'touch';
+    nodeId: string;
+}
+/** Mark every node touched (dispatched on a submit attempt), so
+ *  errors that were hidden pre-interaction all surface at once. */
+ | {
+    type: 'touchAll';
+};
+/**
+ * Reducer state. `tree` is the live document under edit; `initial`
+ * is the snapshot the editor was constructed from (used to
+ * implement `reset` and `isDirty`).
+ */
+export interface DocumentEditorState {
+    tree: EditorTree;
+    /** Frozen copy of the tree at construction. `reset` restores from
+     *  here; `isDirty` is computed by comparing serializations. */
+    initial: EditorTree;
+    /**
+     * Count of nodes with an active `error`. Derived after every
+     * action; the reducer keeps it in state to avoid a tree walk on
+     * every render.
+     */
+    errorCount: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/firestore/reducers/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/firestore/reducers/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE7C;;;;;GAKG;AACH,MAAM,WAAW,SAAS;IACxB,iEAAiE;IACjE,EAAE,EAAE,MAAM,CAAC;IACX,wCAAwC;IACxC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB;;;;OAIG;IACH,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IACnB,uDAAuD;IACvD,IAAI,EAAE,SAAS,CAAC;IAChB;;;OAGG;IACH,KAAK,EAAE,OAAO,CAAC;IACf;;;;;;OAMG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;;OAKG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACjC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;CACpC;AAED;;;;GAIG;AACH,MAAM,MAAM,oBAAoB,GAC5B;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACpD;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,SAAS,CAAA;CAAE,GACvD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAC/C;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,SAAS,CAAA;CAAE,GAC5E;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,SAAS,CAAA;CAAE,GACjE;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAClC;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE;AACnB;oEACoE;GAClE;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE;AACnC;mEACmE;GACjE;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,CAAC;AAEzB;;;;GAIG;AACH,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,UAAU,CAAC;IACjB;mEAC+D;IAC/D,OAAO,EAAE,UAAU,CAAC;IACpB;;;;OAIG;IACH,UAAU,EAAE,MAAM,CAAC;CACpB"}

package/dist/firestore/reducers/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/firestore/reducers/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/firestore/reducers/types.ts"],"names":[],"mappings":""}

package/dist/firestore/reducers/validation.d.ts

@@ -0,0 +1,25 @@
+import type { FieldType } from '../types.js';
+import type { EditorTree } from './types.js';
+/**
+ * Per-type leaf validator. Returns an error message when the value
+ * doesn't satisfy the type's constraints, `undefined` when valid.
+ *
+ * `map` and `array` aren't validated here — their integrity comes
+ * from their children + (for maps) sibling-key uniqueness, which
+ * is enforced in {@link validateTree}.
+ */
+export declare function validateLeaf(type: FieldType, value: unknown): string | undefined;
+/**
+ * Walk the tree, attach an `error` to each node, and return the
+ * mutated tree along with the total error count. The function does
+ * not mutate the input; it returns a fresh tree.
+ *
+ * Per-leaf errors come from {@link validateLeaf}. Map nodes
+ * additionally surface duplicate-key + empty-key errors on the
+ * offending children (not on the parent).
+ */
+export declare function validateTree(tree: EditorTree): {
+    tree: EditorTree;
+    errorCount: number;
+};
+//# sourceMappingURL=validation.d.ts.map