@b2bc-devkit/sheetorm 0.1.0

package/dist/npm/query/QueryEngine.js

@@ -0,0 +1,453 @@
+/**
+ * QueryEngine — pure in-memory filter, sort, paginate, and group engine.
+ *
+ * Every function operates on plain entity arrays and returns new arrays
+ * without mutating the input.  The implementation is heavily optimised for
+ * the GAS V8 runtime (limited JIT, no SIMD, high GC cost):
+ *
+ *   - Filters are **compiled** into predicate closures once; the hot loop
+ *     invokes closures instead of evaluating operator strings.
+ *   - Sort keys are **pre-extracted** into column-major arrays to avoid
+ *     repeated field navigation during comparison callbacks.
+ *   - The `in` operator converts to a `Set` when the value list exceeds
+ *     8 elements for O(1) membership checks.
+ *   - String comparison operators (`contains`, `startsWith`, `search`)
+ *     are case-insensitive and pre-lower the filter value once.
+ *
+ * @module QueryEngine
+ */
+import { SheetOrmLogger } from "../utils/SheetOrmLogger.js";
+/**
+ * Split a field path into segments for nested property access.
+ *
+ * Single-segment paths (no dots or slashes) return `null` to signal the
+ * fast-path in {@link compileFieldAccessor} — a direct property read.
+ *
+ * @param field - Dot- or slash-separated field path (e.g. `"address.city"`).
+ * @returns Array of segments, or `null` for a simple field name.
+ */
+function splitFieldPath(field) {
+    if (field.indexOf(".") === -1 && field.indexOf("/") === -1)
+        return null;
+    return field.replace(/\//g, ".").split(".");
+}
+/**
+ * Pre-compile a field accessor closure for the given field path.
+ *
+ * Simple fields return a direct property reader; nested paths return a
+ * closure that walks each segment, returning `undefined` for missing
+ * intermediate objects.
+ *
+ * @param field - Dot-separated field path.
+ * @returns Accessor function: `(entity) => fieldValue`.
+ */
+function compileFieldAccessor(field) {
+    const parts = splitFieldPath(field);
+    if (parts === null) {
+        // Simple field — direct property access (fast path)
+        return (entity) => entity[field];
+    }
+    // Nested field — walk the path with null-safe navigation
+    return (entity) => {
+        let current = entity;
+        for (let i = 0; i < parts.length; i++) {
+            if (current == null)
+                return undefined;
+            current = current[parts[i]];
+        }
+        return current;
+    };
+}
+/**
+ * Compile a single {@link Filter} into a fast predicate function.
+ *
+ * Pre-computes the field accessor and, for the `in` operator, converts
+ * large value arrays (>8 elements) to a `Set` for O(1) membership checks.
+ *
+ * Supported operators: `=`, `!=`, `<`, `>`, `<=`, `>=`, `contains`,
+ * `startsWith`, `in`, `search`.
+ *
+ * @param f - The filter to compile.
+ * @returns Predicate function: `(entity) => boolean`.
+ */
+function compileFilter(f) {
+    const accessor = compileFieldAccessor(f.field);
+    const op = f.operator;
+    const fv = f.value;
+    switch (op) {
+        case "=":
+            return (e) => accessor(e) === fv;
+        case "!=":
+            return (e) => accessor(e) !== fv;
+        case "<":
+            return (e) => {
+                const v = accessor(e);
+                if (typeof v !== typeof fv)
+                    return false;
+                return v < fv;
+            };
+        case ">":
+            return (e) => {
+                const v = accessor(e);
+                if (typeof v !== typeof fv)
+                    return false;
+                return v > fv;
+            };
+        case "<=":
+            return (e) => {
+                const v = accessor(e);
+                if (typeof v !== typeof fv)
+                    return false;
+                return v <= fv;
+            };
+        case ">=":
+            return (e) => {
+                const v = accessor(e);
+                if (typeof v !== typeof fv)
+                    return false;
+                return v >= fv;
+            };
+        case "contains": {
+            // Case-insensitive substring match
+            if (typeof fv !== "string")
+                return () => false;
+            const lowerC = fv.toLowerCase();
+            return (e) => {
+                const v = accessor(e);
+                return typeof v === "string" && v.toLowerCase().includes(lowerC);
+            };
+        }
+        case "startsWith": {
+            // Case-insensitive prefix match
+            if (typeof fv !== "string")
+                return () => false;
+            const lowerS = fv.toLowerCase();
+            return (e) => {
+                const v = accessor(e);
+                return typeof v === "string" && v.toLowerCase().startsWith(lowerS);
+            };
+        }
+        case "in": {
+            // Membership check — uses Set for large lists (>8) for O(1) lookups
+            if (!Array.isArray(fv))
+                return () => false;
+            if (fv.length > 8) {
+                const set = new Set(fv);
+                return (e) => set.has(accessor(e));
+            }
+            return (e) => fv.includes(accessor(e));
+        }
+        case "search": {
+            // Case-insensitive substring search (same as "contains" but semantically distinct —
+            // in SheetRepository.find() the "search" operator can leverage n-gram indexes)
+            if (typeof fv !== "string")
+                return () => false;
+            const lowerSr = fv.toLowerCase();
+            return (e) => {
+                const v = accessor(e);
+                return typeof v === "string" && v.toLowerCase().includes(lowerSr);
+            };
+        }
+        default:
+            return () => false;
+    }
+}
+/**
+ * Filter entities by an array of filters using AND logic.
+ *
+ * All predicates are compiled once; the hot loop uses a labeled `continue outer`
+ * to short-circuit on the first failing predicate per entity (minimal GC pressure).
+ *
+ * @typeParam T - Entity type.
+ * @param entities - Source array (not mutated).
+ * @param filters  - Filters to apply (all must match — AND).
+ * @returns New array of matching entities.
+ */
+function filterEntities(entities, filters) {
+    if (!filters || filters.length === 0)
+        return entities;
+    // Compile all filter predicates once
+    const predicates = new Array(filters.length);
+    for (let i = 0; i < filters.length; i++) {
+        predicates[i] = compileFilter(filters[i]);
+    }
+    const len = entities.length;
+    const predLen = predicates.length;
+    const result = [];
+    // Labeled loop: `continue outer` skips to next entity on first failing predicate
+    outer: for (let i = 0; i < len; i++) {
+        const entity = entities[i];
+        for (let j = 0; j < predLen; j++) {
+            if (!predicates[j](entity))
+                continue outer;
+        }
+        result.push(entity);
+    }
+    return result;
+}
+/**
+ * Filter entities with OR-connected groups of AND-connected filters.
+ *
+ * An entity matches if it satisfies **any** group (OR), where within each
+ * group all filters must match (AND).  Empty groups never match.
+ *
+ * @typeParam T - Entity type.
+ * @param entities - Source array (not mutated).
+ * @param groups   - Array of filter groups (outer=OR, inner=AND).
+ * @returns New array of matching entities.
+ */
+function filterEntitiesOr(entities, groups) {
+    if (!groups || groups.length === 0)
+        return entities;
+    // Compile each group into an array of predicate closures
+    const compiledGroups = new Array(groups.length);
+    for (let g = 0; g < groups.length; g++) {
+        const group = groups[g];
+        const predicates = new Array(group.length);
+        for (let i = 0; i < group.length; i++) {
+            predicates[i] = compileFilter(group[i]);
+        }
+        compiledGroups[g] = predicates;
+    }
+    const len = entities.length;
+    const numGroups = compiledGroups.length;
+    const result = [];
+    for (let i = 0; i < len; i++) {
+        const entity = entities[i];
+        let matched = false;
+        // Try each group — entity matches if ANY group's predicates all pass
+        for (let g = 0; g < numGroups; g++) {
+            const predicates = compiledGroups[g];
+            const predLen = predicates.length;
+            // An empty group never matches — it has no conditions to satisfy
+            let groupMatch = predLen > 0;
+            for (let j = 0; j < predLen; j++) {
+                if (!predicates[j](entity)) {
+                    groupMatch = false;
+                    break;
+                }
+            }
+            if (groupMatch) {
+                matched = true;
+                break;
+            }
+        }
+        if (matched)
+            result.push(entity);
+    }
+    return result;
+}
+/**
+ * Sort entities by multiple {@link SortClause} fields.
+ *
+ * **Performance strategy** (optimised for GAS V8):
+ *
+ * 1. Sort keys are **pre-extracted** into column-major arrays
+ *    (`keys[sortIndex][entityIndex]`) so the comparator never calls
+ *    field accessors — it reads from pre-populated primitive arrays.
+ * 2. An **index array** is sorted instead of the entities themselves,
+ *    avoiding expensive object moves in the V8 sort implementation.
+ * 3. The final result is assembled from the sorted indices in one pass.
+ *
+ * Null handling: `null`/`undefined` values sort **first** (before any
+ * non-null value) regardless of direction.
+ *
+ * @typeParam T - Entity type.
+ * @param entities - Source array (not mutated).
+ * @param sorts    - Sort clauses in priority order (first = primary sort).
+ * @returns New sorted array.
+ */
+function sortEntities(entities, sorts) {
+    if (!sorts || sorts.length === 0)
+        return entities;
+    const len = entities.length;
+    const numSorts = sorts.length;
+    // Pre-compile field accessors and direction multipliers (+1 for asc, -1 for desc)
+    const accessors = new Array(numSorts);
+    const directions = new Array(numSorts);
+    for (let s = 0; s < numSorts; s++) {
+        accessors[s] = compileFieldAccessor(sorts[s].field);
+        directions[s] = sorts[s].direction === "desc" ? -1 : 1;
+    }
+    // Pre-extract sort keys into column-major layout: keys[sortIndex][entityIndex]
+    // This avoids repeated field accessor calls during the sort comparator
+    const keys = new Array(numSorts);
+    for (let s = 0; s < numSorts; s++) {
+        const accessor = accessors[s];
+        const col = new Array(len);
+        for (let i = 0; i < len; i++) {
+            col[i] = accessor(entities[i]);
+        }
+        keys[s] = col;
+    }
+    // Build index array — sort indices instead of objects to avoid expensive moves
+    const indices = new Array(len);
+    for (let i = 0; i < len; i++)
+        indices[i] = i;
+    // Multi-key comparator using pre-extracted key columns
+    indices.sort((ai, bi) => {
+        for (let s = 0; s < numSorts; s++) {
+            const aVal = keys[s][ai];
+            const bVal = keys[s][bi];
+            let cmp;
+            if (aVal === bVal) {
+                cmp = 0;
+            }
+            else if (aVal == null) {
+                cmp = -1; // Nulls sort first
+            }
+            else if (bVal == null) {
+                cmp = 1; // Nulls sort first
+            }
+            else if (typeof aVal === "number" && typeof bVal === "number") {
+                cmp = aVal - bVal; // Numeric comparison (avoids string coercion)
+            }
+            else {
+                cmp = String(aVal).localeCompare(String(bVal)); // String fallback
+            }
+            if (cmp !== 0)
+                return cmp * directions[s]; // Apply asc/desc multiplier
+        }
+        return 0; // All keys equal — stable order
+    });
+    // Build sorted result array from the sorted index permutation
+    const result = new Array(len);
+    for (let i = 0; i < len; i++) {
+        result[i] = entities[indices[i]];
+    }
+    return result;
+}
+/**
+ * Apply pagination (offset + limit) to an entity array.
+ *
+ * Both `offset` and `limit` are sanitised: non-finite, negative, or
+ * fractional values are clamped to safe defaults (0 for offset, full
+ * length for limit).
+ *
+ * @typeParam T - Entity type.
+ * @param entities - Source array.
+ * @param offset   - Number of items to skip from the start.
+ * @param limit    - Maximum number of items to return.
+ * @returns Paginated result with metadata (total, hasNext, etc.).
+ */
+function paginateEntities(entities, offset, limit) {
+    const safeOffset = Number.isFinite(offset) && offset >= 0 ? Math.floor(offset) : 0;
+    const safeLimit = Number.isFinite(limit) && limit >= 0 ? Math.floor(limit) : entities.length;
+    const total = entities.length;
+    const sliced = entities.slice(safeOffset, safeOffset + safeLimit);
+    return {
+        items: sliced,
+        total,
+        offset: safeOffset,
+        limit: safeLimit,
+        hasNext: safeOffset + safeLimit < total,
+    };
+}
+/**
+ * Group entities by a single field, producing one {@link GroupResult} per distinct value.
+ *
+ * Uses a `Map` keyed by the field value to collect entities in insertion
+ * order.  The pre-compiled field accessor avoids repeated path resolution.
+ *
+ * @typeParam T - Entity type.
+ * @param entities - Source array (not mutated).
+ * @param field    - Dot-separated field path to group by.
+ * @returns Array of group results, each containing key, count, and items.
+ */
+function groupEntities(entities, field) {
+    const accessor = compileFieldAccessor(field);
+    const groups = new Map();
+    // Distribute entities into groups by their field value
+    for (let i = 0, len = entities.length; i < len; i++) {
+        const entity = entities[i];
+        const key = accessor(entity);
+        const existing = groups.get(key);
+        if (existing) {
+            existing.push(entity);
+        }
+        else {
+            groups.set(key, [entity]);
+        }
+    }
+    // Convert Map entries to GroupResult array
+    const results = [];
+    groups.forEach((items, key) => {
+        results.push({ key, count: items.length, items });
+    });
+    return results;
+}
+/**
+ * Execute a complete query pipeline on an in-memory entity array.
+ *
+ * Pipeline stages (executed in order):
+ *
+ * 1. **Filter**: `whereGroups` (OR of ANDs) takes precedence over `where`
+ *    (simple AND).  If both are present, only `whereGroups` is applied.
+ * 2. **Sort**: Multi-field sort via {@link sortEntities}.
+ * 3. **Paginate**: `offset` and `limit` applied via `Array.slice`.
+ *
+ * This function does NOT call {@link paginateEntities} — it applies a
+ * lighter slice-only pagination without producing a `PaginatedResult`
+ * wrapper.  The caller (typically {@link SheetRepository}) is responsible
+ * for wrapping the result if needed.
+ *
+ * @typeParam T - Entity type.
+ * @param entities - Full entity array to query against.
+ * @param options  - Query options controlling filter, sort, and pagination.
+ * @returns Filtered, sorted, and paginated entity array.
+ */
+function executeQuery(entities, options) {
+    SheetOrmLogger.log(`[QueryEngine] executeQuery in=${entities.length}` +
+        ` where=${options.where?.length ?? 0}` +
+        ` whereGroups=${options.whereGroups?.length ?? 0}` +
+        ` orderBy=${options.orderBy?.length ?? 0}` +
+        ` offset=${options.offset ?? "-"} limit=${options.limit ?? "-"}`);
+    let result = entities;
+    // Stage 1: Filter — whereGroups (OR of ANDs) takes precedence over where (AND)
+    if (options.whereGroups && options.whereGroups.length > 0) {
+        result = filterEntitiesOr(result, options.whereGroups);
+    }
+    else if (options.where && options.where.length > 0) {
+        result = filterEntities(result, options.where);
+    }
+    // Stage 2: Sort — multi-field ordering
+    if (options.orderBy && options.orderBy.length > 0) {
+        result = sortEntities(result, options.orderBy);
+    }
+    // Stage 3: Paginate — slice-only (no PaginatedResult wrapper)
+    if (options.offset !== undefined || options.limit !== undefined) {
+        const rawOffset = options.offset ?? 0;
+        const offset = Number.isFinite(rawOffset) && rawOffset >= 0 ? Math.floor(rawOffset) : 0;
+        const limit = options.limit !== undefined
+            ? Number.isFinite(options.limit) && options.limit >= 0
+                ? Math.floor(options.limit)
+                : result.length
+            : result.length;
+        result = result.slice(offset, offset + limit);
+    }
+    SheetOrmLogger.log(`[QueryEngine] executeQuery out=${result.length}`);
+    return result;
+}
+/**
+ * Static facade exposing the query engine's pure functions as class methods.
+ *
+ * All methods are stateless — they operate on the provided entity array
+ * and return new arrays without side effects.  The class form exists so
+ * that callers can reference `QueryEngine.filterEntities(...)` instead of
+ * importing individual module-level functions.
+ */
+export class QueryEngine {
+}
+/** Filter entities with AND-connected conditions. */
+QueryEngine.filterEntities = filterEntities;
+/** Filter entities with OR-connected groups of AND-connected conditions. */
+QueryEngine.filterEntitiesOr = filterEntitiesOr;
+/** Sort entities by multiple fields with asc/desc directions. */
+QueryEngine.sortEntities = sortEntities;
+/** Paginate entities and return metadata (total, hasNext, etc.). */
+QueryEngine.paginateEntities = paginateEntities;
+/** Group entities by a field into key/count/items buckets. */
+QueryEngine.groupEntities = groupEntities;
+/** Execute a full filter → sort → paginate pipeline. */
+QueryEngine.executeQuery = executeQuery;
+//# sourceMappingURL=QueryEngine.js.map

package/dist/npm/query/QueryEngine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryEngine.js","sourceRoot":"","sources":["../../../src/query/QueryEngine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAQH,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAE5D;;;;;;;;GAQG;AACH,SAAS,cAAc,CAAC,KAAa;IACnC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACxE,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AAC9C,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,oBAAoB,CAAC,KAAa;IACzC,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACnB,oDAAoD;QACpD,OAAO,CAAC,MAAc,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC;IACD,yDAAyD;IACzD,OAAO,CAAC,MAAc,EAAE,EAAE;QACxB,IAAI,OAAO,GAAY,MAAM,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,OAAO,IAAI,IAAI;gBAAE,OAAO,SAAS,CAAC;YACtC,OAAO,GAAI,OAAmC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,aAAa,CAAC,CAAS;IAC9B,MAAM,QAAQ,GAAG,oBAAoB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC/C,MAAM,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC;IAEnB,QAAQ,EAAE,EAAE,CAAC;QACX,KAAK,GAAG;YACN,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;QACnC,KAAK,IAAI;YACP,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;QACnC,KAAK,GAAG;YACN,OAAO,CAAC,CAAC,EAAE,EAAE;gBACX,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,OAAO,CAAC,KAAK,OAAO,EAAE;oBAAE,OAAO,KAAK,CAAC;gBACzC,OAAQ,CAAY,GAAI,EAAa,CAAC;YACxC,CAAC,CAAC;QACJ,KAAK,GAAG;YACN,OAAO,CAAC,CAAC,EAAE,EAAE;gBACX,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,OAAO,CAAC,KAAK,OAAO,EAAE;oBAAE,OAAO,KAAK,CAAC;gBACzC,OAAQ,CAAY,GAAI,EAAa,CAAC;YACxC,CAAC,CAAC;QACJ,KAAK,IAAI;YACP,OAAO,CAAC,CAAC,EAAE,EAAE;gBACX,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,OAAO,CAAC,KAAK,OAAO,EAAE;oBAAE,OAAO,KAAK,CAAC;gBACzC,OAAQ,CAAY,IAAK,EAAa,CAAC;YACzC,CAAC,CAAC;QACJ,KAAK,IAAI;YACP,OAAO,CAAC,CAAC,EAAE,EAAE;gBACX,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,OAAO,CAAC,KAAK,OAAO,EAAE;oBAAE,OAAO,KAAK,CAAC;gBACzC,OAAQ,CAAY,IAAK,EAAa,CAAC;YACzC,CAAC,CAAC;QACJ,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,mCAAmC;YACnC,IAAI,OAAO,EAAE,KAAK,QAAQ;gBAAE,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;YAC/C,MAAM,MAAM,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;YAChC,OAAO,CAAC,CAAC,EAAE,EAAE;gBACX,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACtB,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACnE,CAAC,CAAC;QACJ,CAAC;QACD,KAAK,YAAY,CAAC,CAAC,CAAC;YAClB,gCAAgC;YAChC,IAAI,OAAO,EAAE,KAAK,QAAQ;gBAAE,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;YAC/C,MAAM,MAAM,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;YAChC,OAAO,CAAC,CAAC,EAAE,EAAE;gBACX,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACtB,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YACrE,CAAC,CAAC;QACJ,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,oEAAoE;YACpE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;gBAAE,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;YAC3C,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAClB,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxB,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC;YACD,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,oFAAoF;YACpF,+EAA+E;YAC/E,IAAI,OAAO,EAAE,KAAK,QAAQ;gBAAE,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;YAC/C,MAAM,OAAO,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;YACjC,OAAO,CAAC,CAAC,EAAE,EAAE;gBACX,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACtB,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACpE,CAAC,CAAC;QACJ,CAAC;QACD;YACE,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;IACvB,CAAC;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,cAAc,CAAmB,QAAa,EAAE,OAAiB;IACxE,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAEtD,qCAAqC;IACrC,MAAM,UAAU,GAAG,IAAI,KAAK,CAA8B,OAAO,CAAC,MAAM,CAAC,CAAC;IAC1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,UAAU,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC5B,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC;IAClC,MAAM,MAAM,GAAQ,EAAE,CAAC;IAEvB,iFAAiF;IACjF,KAAK,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBAAE,SAAS,KAAK,CAAC;QAC7C,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,gBAAgB,CAAmB,QAAa,EAAE,MAAkB;IAC3E,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAEpD,yDAAyD;IACzD,MAAM,cAAc,GAA8C,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC3F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,UAAU,GAAG,IAAI,KAAK,CAA8B,KAAK,CAAC,MAAM,CAAC,CAAC;QACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,UAAU,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,cAAc,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;IACjC,CAAC;IAED,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC5B,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,CAAC;IACxC,MAAM,MAAM,GAAQ,EAAE,CAAC;IAEvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,qEAAqE;QACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC;YAClC,iEAAiE;YACjE,IAAI,UAAU,GAAG,OAAO,GAAG,CAAC,CAAC;YAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3B,UAAU,GAAG,KAAK,CAAC;oBACnB,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,UAAU,EAAE,CAAC;gBACf,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,OAAO;YAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,YAAY,CAAmB,QAAa,EAAE,KAAmB;IACxE,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAElD,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;IAE9B,kFAAkF;IAClF,MAAM,SAAS,GAAuC,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC1E,MAAM,UAAU,GAAa,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,SAAS,CAAC,CAAC,CAAC,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACpD,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,+EAA+E;IAC/E,uEAAuE;IACvE,MAAM,IAAI,GAAgB,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IAChB,CAAC;IAED,+EAA+E;IAC/E,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE7C,uDAAuD;IACvD,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,GAAW,CAAC;YAChB,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,GAAG,GAAG,CAAC,CAAC;YACV,CAAC;iBAAM,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB;YAC/B,CAAC;iBAAM,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,GAAG,GAAG,CAAC,CAAC,CAAC,mBAAmB;YAC9B,CAAC;iBAAM,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAChE,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,8CAA8C;YACnE,CAAC;iBAAM,CAAC;gBACN,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,kBAAkB;YACpE,CAAC;YACD,IAAI,GAAG,KAAK,CAAC;gBAAE,OAAO,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,4BAA4B;QACzE,CAAC;QACD,OAAO,CAAC,CAAC,CAAC,gCAAgC;IAC5C,CAAC,CAAC,CAAC;IAEH,8DAA8D;IAC9D,MAAM,MAAM,GAAG,IAAI,KAAK,CAAI,GAAG,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,gBAAgB,CAAI,QAAa,EAAE,MAAc,EAAE,KAAa;IACvE,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnF,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC7F,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC9B,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,GAAG,SAAS,CAAC,CAAC;IAClE,OAAO;QACL,KAAK,EAAE,MAAM;QACb,KAAK;QACL,MAAM,EAAE,UAAU;QAClB,KAAK,EAAE,SAAS;QAChB,OAAO,EAAE,UAAU,GAAG,SAAS,GAAG,KAAK;KACxC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,aAAa,CAAmB,QAAa,EAAE,KAAa;IACnE,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgB,CAAC;IAEvC,uDAAuD;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACpD,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,2CAA2C;IAC3C,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QAC5B,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,YAAY,CAAmB,QAAa,EAAE,OAAqB;IAC1E,cAAc,CAAC,GAAG,CAChB,iCAAiC,QAAQ,CAAC,MAAM,EAAE;QAChD,UAAU,OAAO,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC,EAAE;QACtC,gBAAgB,OAAO,CAAC,WAAW,EAAE,MAAM,IAAI,CAAC,EAAE;QAClD,YAAY,OAAO,CAAC,OAAO,EAAE,MAAM,IAAI,CAAC,EAAE;QAC1C,WAAW,OAAO,CAAC,MAAM,IAAI,GAAG,UAAU,OAAO,CAAC,KAAK,IAAI,GAAG,EAAE,CACnE,CAAC;IACF,IAAI,MAAM,GAAG,QAAQ,CAAC;IAEtB,+EAA+E;IAC/E,IAAI,OAAO,CAAC,WAAW,IAAI,OAAO,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1D,MAAM,GAAG,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC;IACzD,CAAC;SAAM,IAAI,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrD,MAAM,GAAG,cAAc,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC;IAED,uCAAuC;IACvC,IAAI,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClD,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IACjD,CAAC;IAED,8DAA8D;IAC9D,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAChE,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxF,MAAM,KAAK,GACT,OAAO,CAAC,KAAK,KAAK,SAAS;YACzB,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,KAAK,IAAI,CAAC;gBACpD,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAC3B,CAAC,CAAC,MAAM,CAAC,MAAM;YACjB,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QACpB,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC;IAChD,CAAC;IAED,cAAc,CAAC,GAAG,CAAC,kCAAkC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IACtE,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,WAAW;;AACtB,qDAAqD;AAC9C,0BAAc,GAAG,cAAc,CAAC;AACvC,4EAA4E;AACrE,4BAAgB,GAAG,gBAAgB,CAAC;AAC3C,iEAAiE;AAC1D,wBAAY,GAAG,YAAY,CAAC;AACnC,oEAAoE;AAC7D,4BAAgB,GAAG,gBAAgB,CAAC;AAC3C,8DAA8D;AACvD,yBAAa,GAAG,aAAa,CAAC;AACrC,wDAAwD;AACjD,wBAAY,GAAG,YAAY,CAAC"}

package/dist/npm/storage/GoogleSheetAdapter.d.ts

@@ -0,0 +1,120 @@
+/**
+ * Google Apps Script adapter implementing the ISheetAdapter interface.
+ *
+ * Wraps a single GAS `Sheet` object (one tab in a Spreadsheet) and
+ * translates 0-based data indexes used by the ORM into 1-based sheet
+ * rows required by the GAS Range API. Row 1 is always the header row;
+ * data rows start at row 2.
+ *
+ * All multi-cell reads/writes are performed with `getRange().getValues()`
+ * / `setValues()` to minimise GAS API calls (each call adds ~300 ms of
+ * latency in the Apps Script runtime).
+ *
+ * @module GoogleSheetAdapter
+ */
+import type { ISheetAdapter } from "../core/types/ISheetAdapter.js";
+/**
+ * Production implementation of {@link ISheetAdapter} for Google Apps Script.
+ * Delegates every operation to the underlying `GoogleAppsScript.Spreadsheet.Sheet`.
+ */
+export declare class GoogleSheetAdapter implements ISheetAdapter {
+    /** The wrapped GAS Sheet object representing one spreadsheet tab. */
+    private sheet;
+    /**
+     * @param sheet - A GAS Sheet object obtained via Spreadsheet.getSheetByName()
+     *                or Spreadsheet.insertSheet().
+     */
+    constructor(sheet: GoogleAppsScript.Spreadsheet.Sheet);
+    /** Return the name of the underlying sheet tab. */
+    getName(): string;
+    /**
+     * Read the header row (row 1) and return the column names as strings.
+     * Returns an empty array if the sheet has no columns.
+     */
+    getHeaders(): string[];
+    /**
+     * Overwrite the header row (row 1) with the given column names.
+     * No-op if the headers array is empty.
+     */
+    setHeaders(headers: string[]): void;
+    /**
+     * Read all data rows (row 2+) as a 2D array.
+     * Returns an empty array if the sheet has no data rows.
+     */
+    getAllData(): unknown[][];
+    /**
+     * Return the number of data rows (excludes the header row).
+     * Computed as `lastRow - 1`, where lastRow includes the header.
+     */
+    getRowCount(): number;
+    /** Append a single row after the last occupied row using GAS appendRow(). */
+    appendRow(values: unknown[]): void;
+    /**
+     * Append multiple rows in a single setValues() API call.
+     * Much faster than calling appendRow() in a loop (~300 ms per call saved).
+     */
+    appendRows(rows: unknown[][]): void;
+    /**
+     * Write rows starting at the given 0-based data index.
+     * Overwrites existing cells — used for batch-update operations.
+     *
+     * @param startRowIndex - 0-based data index (sheet row = index + 2).
+     * @param rows          - 2D array of values.
+     */
+    writeRowsAt(startRowIndex: number, rows: unknown[][]): void;
+    /**
+     * Overwrite a single data row.
+     *
+     * @param rowIndex - 0-based data index (sheet row = index + 2).
+     * @param values   - Column values.
+     */
+    updateRow(rowIndex: number, values: unknown[]): void;
+    /**
+     * Overwrite multiple rows, batching contiguous groups into single
+     * setValues() calls to minimise GAS API round-trips.
+     *
+     * Example: updating rows 3, 4, 5, 10, 11 produces two setValues() calls
+     * instead of five.
+     */
+    updateRows(updates: Array<{
+        rowIndex: number;
+        values: unknown[];
+    }>): void;
+    /**
+     * Delete a single data row. GAS deleteRow() shifts all rows below up by one.
+     * @param rowIndex - 0-based data index.
+     */
+    deleteRow(rowIndex: number): void;
+    /**
+     * Delete multiple data rows by index.
+     * Rows are deleted from bottom to top so that earlier indexes remain valid.
+     */
+    deleteRows(rowIndexes: number[]): void;
+    /**
+     * Read a single data row.
+     * @param rowIndex - 0-based data index.
+     * @returns Array of cell values.
+     */
+    getRow(rowIndex: number): unknown[];
+    /**
+     * Replace all data rows (row 2+) with the provided 2D array.
+     *
+     * If the new data has fewer rows than the old data, surplus old rows
+     * are cleared. If the new data is narrower (fewer columns), surplus
+     * columns in the written region are also cleared.
+     */
+    replaceAllData(rows: unknown[][]): void;
+    /** Clear the entire sheet (headers + data). */
+    clear(): void;
+    /** Force-flush pending changes to the spreadsheet (calls SpreadsheetApp.flush()). */
+    flush(): void;
+    /**
+     * L1 optimisation: Write the header row and all data rows in a single
+     * setValues() API call.  Row 1 = headers, row 2+ = data.
+     *
+     * Used for newly-created sheets to avoid a separate setHeaders() round-trip
+     * (~700 ms saved per new table at first save).
+     */
+    writeAllRowsWithHeaders(headers: string[], rows: unknown[][]): void;
+}
+//# sourceMappingURL=GoogleSheetAdapter.d.ts.map

package/dist/npm/storage/GoogleSheetAdapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GoogleSheetAdapter.d.ts","sourceRoot":"","sources":["../../../src/storage/GoogleSheetAdapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAGpE;;;GAGG;AACH,qBAAa,kBAAmB,YAAW,aAAa;IACtD,qEAAqE;IACrE,OAAO,CAAC,KAAK,CAAqC;IAElD;;;OAGG;gBACS,KAAK,EAAE,gBAAgB,CAAC,WAAW,CAAC,KAAK;IAIrD,mDAAmD;IACnD,OAAO,IAAI,MAAM;IAIjB;;;OAGG;IACH,UAAU,IAAI,MAAM,EAAE;IAStB;;;OAGG;IACH,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI;IAKnC;;;OAGG;IACH,UAAU,IAAI,OAAO,EAAE,EAAE;IAgBzB;;;OAGG;IACH,WAAW,IAAI,MAAM;IAOrB,6EAA6E;IAC7E,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI;IAIlC;;;OAGG;IACH,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,GAAG,IAAI;IAWnC;;;;;;OAMG;IACH,WAAW,CAAC,aAAa,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,GAAG,IAAI;IAW3D;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI;IAMpD;;;;;;OAMG;IACH,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,GAAG,IAAI;IAiCzE;;;OAGG;IACH,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI;IAKjC;;;OAGG;IACH,UAAU,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,IAAI;IAQtC;;;;OAIG;IACH,MAAM,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,EAAE;IAOnC;;;;;;OAMG;IACH,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,GAAG,IAAI;IAuBvC,+CAA+C;IAC/C,KAAK,IAAI,IAAI;IAIb,qFAAqF;IACrF,KAAK,IAAI,IAAI;IAIb;;;;;;OAMG;IACH,uBAAuB,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,GAAG,IAAI;CASpE"}