@byline/core 0.9.3

package/dist/services/populate.js

@@ -0,0 +1,484 @@
+/**
+ * This Source Code is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/.
+ *
+ * Copyright (c) Infonomic Company Limited
+ */
+import { applyBeforeRead } from '../auth/apply-before-read.js';
+import { ERR_READ_BUDGET_EXCEEDED } from '../lib/errors.js';
+import { parseWhere } from '../query/parse-where.js';
+import { applyAfterRead } from './document-read.js';
+import { populateRichTextFields } from './richtext-populate.js';
+// ---------------------------------------------------------------------------
+// ReadContext — recursion guard
+// ---------------------------------------------------------------------------
+const DEFAULT_MAX_READS = 500;
+const DEFAULT_MAX_DEPTH = 8;
+/** Build a fresh ReadContext. */
+export function createReadContext(overrides) {
+    return {
+        visited: overrides?.visited ?? new Set(),
+        afterReadFired: overrides?.afterReadFired ?? new Set(),
+        beforeReadCache: overrides?.beforeReadCache ?? new Map(),
+        readCount: overrides?.readCount ?? 0,
+        maxReads: overrides?.maxReads ?? DEFAULT_MAX_READS,
+        maxDepth: overrides?.maxDepth ?? DEFAULT_MAX_DEPTH,
+    };
+}
+// ---------------------------------------------------------------------------
+// Main entry
+// ---------------------------------------------------------------------------
+/**
+ * Populate relation leaves in `opts.documents` in place, one DB
+ * round-trip per depth level per target collection.
+ */
+export async function populateDocuments(opts) {
+    const ctx = opts.readContext ?? createReadContext();
+    const populate = opts.populate;
+    const requestedDepth = opts.depth ?? (populate !== undefined ? 1 : 0);
+    const maxDepth = Math.max(0, Math.min(requestedDepth, ctx.maxDepth));
+    // Mark the input documents as visited regardless of whether we populate —
+    // a future read-side hook that triggers further reads will then skip
+    // re-materialising documents it has already seen.
+    for (const doc of opts.documents) {
+        const id = doc?.document_id;
+        if (typeof id === 'string') {
+            ctx.visited.add(visitedKey(opts.collectionId, id));
+        }
+    }
+    if (populate === undefined || maxDepth === 0 || opts.documents.length === 0) {
+        return;
+    }
+    // Per-call cache: collection lookup key → resolved CollectionDefinition.
+    // Populated on first hit via synthetic match, path match, or a one-time
+    // `db.queries.collections.getCollectionById` fallback. Negative results
+    // are cached too (null) so we never double-query a missing target.
+    const defCache = new Map();
+    const sourceDef = await resolveCollectionDef(opts.db, opts.collections, opts.collectionId, defCache);
+    if (!sourceDef) {
+        // Cannot walk without field definitions; leave documents untouched.
+        return;
+    }
+    let current = opts.documents.map((doc) => ({
+        doc,
+        fieldDefs: sourceDef.fields,
+        populate,
+    }));
+    for (let level = 0; level < maxDepth; level++) {
+        const allLeaves = [];
+        for (const entry of current) {
+            if (entry.doc?.fields && typeof entry.doc.fields === 'object') {
+                collectRelationLeaves(entry.doc.fields, entry.fieldDefs, entry.populate, allLeaves);
+            }
+        }
+        if (allLeaves.length === 0)
+            break;
+        // Group by target collection so we batch one query per target.
+        const byTarget = new Map();
+        for (const leaf of allLeaves) {
+            const tid = leaf.value.targetCollectionId;
+            const arr = byTarget.get(tid);
+            if (arr)
+                arr.push(leaf);
+            else
+                byTarget.set(tid, [leaf]);
+        }
+        const nextLevel = [];
+        const queuedForNext = new Set();
+        for (const [targetCollectionId, leaves] of byTarget) {
+            const targetDef = await resolveCollectionDef(opts.db, opts.collections, targetCollectionId, defCache);
+            const selectList = buildBatchSelect(leaves, targetDef);
+            // Only fetch IDs we haven't materialised earlier in this request.
+            const idsToFetch = Array.from(new Set(leaves
+                .filter((l) => !ctx.visited.has(visitedKey(targetCollectionId, l.value.targetDocumentId)))
+                .map((l) => l.value.targetDocumentId)));
+            // Resolve the target collection's `beforeRead` predicate, if any.
+            // The cache on `ctx.beforeReadCache` ensures each (collectionPath,
+            // actor) tuple only runs through the hook once per request, even
+            // across populate fanout where the same target collection may be
+            // visited from multiple sources.
+            const targetFilters = await resolveBeforeReadFiltersForTarget({
+                targetDef,
+                collections: opts.collections,
+                requestContext: opts.requestContext,
+                readContext: ctx,
+                bypassBeforeRead: opts.bypassBeforeRead,
+                db: opts.db,
+            });
+            let fetched = [];
+            if (idsToFetch.length > 0) {
+                fetched = await opts.db.queries.documents.getDocumentsByDocumentIds({
+                    collection_id: targetCollectionId,
+                    document_ids: idsToFetch,
+                    locale: opts.locale,
+                    fields: selectList,
+                    readMode: opts.readMode,
+                    filters: targetFilters,
+                });
+            }
+            const byId = new Map();
+            for (const d of fetched) {
+                if (typeof d?.document_id === 'string')
+                    byId.set(d.document_id, d);
+            }
+            // First pass: replace leaves with envelopes (reading visited state
+            // before we update it). Each envelope preserves the original link
+            // metadata (`targetDocumentId`, `targetCollectionId`, and any
+            // `relationshipType` / `cascadeDelete`) so consumers can
+            // round-trip or inspect the relationship regardless of outcome.
+            for (const leaf of leaves) {
+                const { targetDocumentId, targetCollectionId } = leaf.value;
+                const key = visitedKey(targetCollectionId, targetDocumentId);
+                if (ctx.visited.has(key)) {
+                    leaf.parent[leaf.key] = {
+                        ...leaf.value,
+                        _resolved: true,
+                        _cycle: true,
+                    };
+                    continue;
+                }
+                const fetchedDoc = byId.get(targetDocumentId);
+                if (fetchedDoc === undefined) {
+                    leaf.parent[leaf.key] = {
+                        ...leaf.value,
+                        _resolved: false,
+                    };
+                    continue;
+                }
+                leaf.parent[leaf.key] = {
+                    ...leaf.value,
+                    _resolved: true,
+                    document: fetchedDoc,
+                };
+            }
+            // Second pass: mark freshly fetched docs visited, update readCount,
+            // fire `afterRead`, enforce the budget, and queue them for the next
+            // level (dedup by id).
+            //
+            // `afterRead` fires here rather than after the full walk so the hook
+            // can mutate targets before their envelopes land in the source tree.
+            // A target's own direct relations may still be raw refs at this point
+            // (they populate on the next depth level); a hook that wants to
+            // observe populated grandchildren should run at the outer / source
+            // level where populate has fully returned.
+            for (const d of fetched) {
+                const id = d.document_id;
+                const key = visitedKey(targetCollectionId, id);
+                if (ctx.visited.has(key))
+                    continue;
+                ctx.visited.add(key);
+                ctx.readCount += 1;
+                if (ctx.readCount > ctx.maxReads) {
+                    throw ERR_READ_BUDGET_EXCEEDED({
+                        message: `populate exceeded read budget (maxReads=${ctx.maxReads})`,
+                        details: {
+                            readCount: ctx.readCount,
+                            maxReads: ctx.maxReads,
+                            targetCollectionId,
+                            targetDocumentId: id,
+                        },
+                    });
+                }
+                if (targetDef) {
+                    // Rich-text populate runs *before* the user-land afterRead hook
+                    // so hook authors observe fully-populated rich-text content. The
+                    // gate (per-field `populateRelationsOnRead`) lives inside the
+                    // service; passing the function unconditionally is correct.
+                    if (opts.richTextPopulate) {
+                        await populateRichTextFields({
+                            fields: targetDef.fields,
+                            collectionPath: targetDef.path,
+                            documents: [d],
+                            populate: opts.richTextPopulate,
+                            readContext: ctx,
+                        });
+                    }
+                    await applyAfterRead({ doc: d, definition: targetDef, readContext: ctx });
+                }
+                if (!targetDef || queuedForNext.has(key))
+                    continue;
+                const childPopulate = reduceChildPopulate(leaves, id);
+                if (childPopulate === undefined)
+                    continue;
+                queuedForNext.add(key);
+                nextLevel.push({
+                    doc: d,
+                    fieldDefs: targetDef.fields,
+                    populate: childPopulate,
+                });
+            }
+        }
+        current = nextLevel;
+        if (current.length === 0)
+            break;
+    }
+}
+// ---------------------------------------------------------------------------
+// Internals
+// ---------------------------------------------------------------------------
+function visitedKey(collectionId, documentId) {
+    return `${collectionId}:${documentId}`;
+}
+/**
+ * Resolve a collection reference (DB UUID *or* path) to its
+ * `CollectionDefinition`. Tries in order:
+ *
+ *   1. Synthetic `.id` match on the collections array — supports unit
+ *      tests that attach a synthetic id, and is a cheap win when the
+ *      caller has pre-decorated collections with DB UUIDs.
+ *   2. Direct `.path` match — the public API of CollectionDefinition.
+ *   3. DB fallback via `getCollectionById(id)` — resolves a real DB
+ *      UUID to its path, then matches on the path. This is the
+ *      production path for the admin server fn and `@byline/client`,
+ *      which both pass DB UUIDs as `collectionId` / `target_collection_id`.
+ *
+ * Results (including misses) are cached in `cache` for the duration of
+ * the current populate call.
+ */
+async function resolveCollectionDef(db, collections, id, cache) {
+    if (cache.has(id)) {
+        return cache.get(id) ?? undefined;
+    }
+    // 1. Synthetic `.id` (tests, pre-decorated arrays)
+    let def = collections.find((c) => c.id === id) ??
+        // 2. Path match
+        collections.find((c) => c.path === id);
+    // 3. DB fallback
+    if (!def) {
+        try {
+            const row = await db.queries.collections.getCollectionById(id);
+            if (row && typeof row.path === 'string') {
+                def = collections.find((c) => c.path === row.path);
+            }
+        }
+        catch {
+            // Missing target collection is handled by the caller via the
+            // unresolved-stub path — swallow lookup errors here.
+        }
+    }
+    cache.set(id, def ?? null);
+    return def;
+}
+/**
+ * Resolve the per-target-collection `beforeRead` predicate for a populate
+ * batch fetch and compile it to `DocumentFilter[]`. Skipped when:
+ *   - the target collection definition could not be resolved (in which
+ *     case populate emits an unresolved stub anyway),
+ *   - no `requestContext` was threaded in (synthetic / test call paths
+ *     that don't go through `CollectionHandle`),
+ *   - `bypassBeforeRead` is set (admin tooling, seeds, migrations).
+ *
+ * Returns `undefined` when no scoping applies, so the adapter can skip
+ * the EXISTS-loop entirely.
+ */
+async function resolveBeforeReadFiltersForTarget(params) {
+    const { targetDef, collections, requestContext, readContext, bypassBeforeRead, db } = params;
+    if (!targetDef || !requestContext || bypassBeforeRead)
+        return undefined;
+    const predicate = await applyBeforeRead({
+        definition: targetDef,
+        requestContext,
+        readContext,
+    });
+    if (predicate == null)
+        return undefined;
+    const parsed = await parseWhere(predicate, targetDef, {
+        collections,
+        resolveCollectionId: async (path) => {
+            // Match the target collection by path against the loaded collection
+            // list first (cheap, in-memory); fall back to a DB lookup for cases
+            // where a hook references a collection not loaded into the same
+            // populate context. This mirrors `CollectionHandle`'s parser ctx.
+            const local = collections.find((c) => c.path === path);
+            if (local?.id)
+                return local.id;
+            const row = await db.queries.collections.getCollectionByPath(path);
+            return row?.id ?? '';
+        },
+    });
+    return parsed.filters.length > 0 ? parsed.filters : undefined;
+}
+/**
+ * Walk `fields` against `fieldDefs` and collect every relation leaf whose
+ * name matches `populate`. Recurses through `group` / `array` / `blocks`
+ * using the same populate spec (structure field names do not scope the
+ * match — if `populate: { author: true }` is given, every `author`
+ * relation found in the tree matches).
+ */
+function collectRelationLeaves(fields, fieldDefs, populate, acc) {
+    for (const def of fieldDefs) {
+        const rawValue = fields[def.name];
+        if (rawValue == null)
+            continue;
+        if (def.type === 'relation') {
+            const sub = matchesPopulate(def.name, populate);
+            if (sub === undefined)
+                continue;
+            if (!isRelatedDocumentValue(rawValue))
+                continue;
+            // Skip leaves that have already been replaced (e.g. via shared-ref
+            // duplication at the previous level); only raw RelatedDocumentValues
+            // are candidates for population.
+            if ('_resolved' in rawValue)
+                continue;
+            acc.push({
+                parent: fields,
+                key: def.name,
+                field: def,
+                value: rawValue,
+                sub,
+            });
+            continue;
+        }
+        if (def.type === 'group') {
+            if (typeof rawValue === 'object' && !Array.isArray(rawValue)) {
+                collectRelationLeaves(rawValue, def.fields, populate, acc);
+            }
+            continue;
+        }
+        if (def.type === 'array') {
+            if (Array.isArray(rawValue)) {
+                for (const item of rawValue) {
+                    if (item && typeof item === 'object' && !Array.isArray(item)) {
+                        collectRelationLeaves(item, def.fields, populate, acc);
+                    }
+                }
+            }
+            continue;
+        }
+        if (def.type === 'blocks') {
+            if (Array.isArray(rawValue)) {
+                for (const item of rawValue) {
+                    if (item && typeof item === 'object' && !Array.isArray(item)) {
+                        // Reconstructed block items carry `_type` set to the variant's `blockType`.
+                        const blockType = item._type;
+                        if (typeof blockType !== 'string')
+                            continue;
+                        const block = def.blocks.find((b) => b.blockType === blockType);
+                        if (!block)
+                            continue;
+                        collectRelationLeaves(item, block.fields, populate, acc);
+                    }
+                }
+            }
+        }
+    }
+}
+function matchesPopulate(fieldName, populate) {
+    if (populate === true)
+        return true;
+    if (populate === '*')
+        return '*';
+    const spec = populate[fieldName];
+    return spec;
+}
+function isRelatedDocumentValue(v) {
+    return (typeof v === 'object' &&
+        v !== null &&
+        typeof v.targetDocumentId === 'string' &&
+        typeof v.targetCollectionId === 'string');
+}
+/**
+ * Build the `fields` array for a batch fetch against a single target
+ * collection.
+ *
+ *   - Any leaf with `sub === '*'` → `undefined` (fetch all fields).
+ *   - Otherwise → union of explicit `select` lists from each leaf,
+ *     merged with the target's identity field (`useAsTitle`, falling
+ *     back to the first text field). `sub === true` contributes no
+ *     selects, so a batch of only-`true` leaves collapses to the
+ *     identity field alone — the default projection.
+ *
+ * Document metadata (`document_id`, `collection_id`, `path`, `status`,
+ * timestamps) lives on the row itself and is always returned — it does
+ * not need to appear in the `fields` list.
+ */
+function buildBatchSelect(leaves, targetDef) {
+    const union = new Set();
+    for (const leaf of leaves) {
+        if (leaf.sub === '*')
+            return undefined;
+        if (leaf.sub === true)
+            continue;
+        const select = leaf.sub.select;
+        if (select) {
+            for (const name of select)
+                union.add(name);
+        }
+    }
+    if (targetDef) {
+        const identity = resolveIdentityField(targetDef);
+        if (identity)
+            union.add(identity);
+    }
+    return Array.from(union);
+}
+/**
+ * The field that represents a target document's identity for populate's
+ * default projection. Prefers `useAsTitle` (server-safe schema-level
+ * config), falling back to the first declared text field.
+ */
+function resolveIdentityField(def) {
+    if (def.useAsTitle)
+        return def.useAsTitle;
+    const firstText = def.fields.find((f) => f.type === 'text');
+    return firstText?.name;
+}
+/**
+ * Merge the per-leaf sub-populate specs for all leaves pointing at a
+ * single (now-populated) target document into a single PopulateSpec for
+ * the next level's walk of that document. Returns `undefined` if the
+ * leaves don't request any nested population (in which case the populated
+ * document's own relations stay as raw refs).
+ *
+ * Sub-spec semantics at the next level:
+ *   - `'*'`  → propagate `'*'` (scope=all, full projection, recursive).
+ *              `'*'` wins over `true` when both appear in the same batch
+ *              so the caller's "full document" intent is preserved.
+ *   - `true` → recurse into every relation of the target (scope=all,
+ *              default projection).
+ *   - object → forward any nested `populate` map; ignore `select`.
+ */
+function reduceChildPopulate(leaves, targetDocumentId) {
+    let anyStar = false;
+    let anyTrue = false;
+    const merged = {};
+    let hasMerged = false;
+    for (const l of leaves) {
+        if (l.value.targetDocumentId !== targetDocumentId)
+            continue;
+        if (l.sub === '*') {
+            anyStar = true;
+            break;
+        }
+        if (l.sub === true) {
+            anyTrue = true;
+            continue;
+        }
+        if (l.sub.populate !== undefined) {
+            for (const [k, v] of Object.entries(l.sub.populate)) {
+                merged[k] = v;
+                hasMerged = true;
+            }
+        }
+    }
+    if (anyStar)
+        return '*';
+    if (anyTrue)
+        return true;
+    if (hasMerged)
+        return merged;
+    return undefined;
+}
+// ---------------------------------------------------------------------------
+// Internal re-exports for tests
+// ---------------------------------------------------------------------------
+export const __internal = {
+    collectRelationLeaves,
+    matchesPopulate,
+    buildBatchSelect,
+    reduceChildPopulate,
+    visitedKey,
+};
+//# sourceMappingURL=populate.js.map

package/dist/services/populate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"populate.js","sourceRoot":"","sources":["../../src/services/populate.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAgIH,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAA;AAC9D,OAAO,EAAE,wBAAwB,EAAE,MAAM,kBAAkB,CAAA;AAC3D,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAA;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAA;AACnD,OAAO,EAAE,sBAAsB,EAAE,MAAM,wBAAwB,CAAA;AAoB/D,8EAA8E;AAC9E,gCAAgC;AAChC,8EAA8E;AAE9E,MAAM,iBAAiB,GAAG,GAAG,CAAA;AAC7B,MAAM,iBAAiB,GAAG,CAAC,CAAA;AAE3B,iCAAiC;AACjC,MAAM,UAAU,iBAAiB,CAAC,SAAgC;IAChE,OAAO;QACL,OAAO,EAAE,SAAS,EAAE,OAAO,IAAI,IAAI,GAAG,EAAE;QACxC,cAAc,EAAE,SAAS,EAAE,cAAc,IAAI,IAAI,GAAG,EAAE;QACtD,eAAe,EAAE,SAAS,EAAE,eAAe,IAAI,IAAI,GAAG,EAAE;QACxD,SAAS,EAAE,SAAS,EAAE,SAAS,IAAI,CAAC;QACpC,QAAQ,EAAE,SAAS,EAAE,QAAQ,IAAI,iBAAiB;QAClD,QAAQ,EAAE,SAAS,EAAE,QAAQ,IAAI,iBAAiB;KACnD,CAAA;AACH,CAAC;AA+ID,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,IAAqB;IAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,IAAI,iBAAiB,EAAE,CAAA;IACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;IAC9B,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACrE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAA;IAEpE,0EAA0E;IAC1E,qEAAqE;IACrE,kDAAkD;IAClD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACjC,MAAM,EAAE,GAAG,GAAG,EAAE,WAAW,CAAA;QAC3B,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;YAC3B,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,CAAA;QACpD,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5E,OAAM;IACR,CAAC;IAED,yEAAyE;IACzE,wEAAwE;IACxE,wEAAwE;IACxE,mEAAmE;IACnE,MAAM,QAAQ,GAAuB,IAAI,GAAG,EAAE,CAAA;IAE9C,MAAM,SAAS,GAAG,MAAM,oBAAoB,CAC1C,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,YAAY,EACjB,QAAQ,CACT,CAAA;IACD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,oEAAoE;QACpE,OAAM;IACR,CAAC;IAUD,IAAI,OAAO,GAAiB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACvD,GAAG;QACH,SAAS,EAAE,SAAS,CAAC,MAAM;QAC3B,QAAQ;KACT,CAAC,CAAC,CAAA;IAEH,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9C,MAAM,SAAS,GAAsB,EAAE,CAAA;QACvC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,GAAG,EAAE,MAAM,IAAI,OAAO,KAAK,CAAC,GAAG,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBAC9D,qBAAqB,CACnB,KAAK,CAAC,GAAG,CAAC,MAA6B,EACvC,KAAK,CAAC,SAAS,EACf,KAAK,CAAC,QAAQ,EACd,SAAS,CACV,CAAA;YACH,CAAC;QACH,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,MAAK;QAEjC,+DAA+D;QAC/D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6B,CAAA;QACrD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAA;YACzC,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC7B,IAAI,GAAG;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;;gBAClB,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAA;QAChC,CAAC;QAED,MAAM,SAAS,GAAiB,EAAE,CAAA;QAClC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAA;QAEvC,KAAK,MAAM,CAAC,kBAAkB,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACpD,MAAM,SAAS,GAAG,MAAM,oBAAoB,CAC1C,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,WAAW,EAChB,kBAAkB,EAClB,QAAQ,CACT,CAAA;YACD,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;YAEtD,kEAAkE;YAClE,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAC3B,IAAI,GAAG,CACL,MAAM;iBACH,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,kBAAkB,EAAE,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAClF;iBACA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CACxC,CACF,CAAA;YAED,kEAAkE;YAClE,mEAAmE;YACnE,iEAAiE;YACjE,iEAAiE;YACjE,iCAAiC;YACjC,MAAM,aAAa,GAAG,MAAM,iCAAiC,CAAC;gBAC5D,SAAS;gBACT,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,cAAc,EAAE,IAAI,CAAC,cAAc;gBACnC,WAAW,EAAE,GAAG;gBAChB,gBAAgB,EAAE,IAAI,CAAC,gBAAgB;gBACvC,EAAE,EAAE,IAAI,CAAC,EAAE;aACZ,CAAC,CAAA;YAEF,IAAI,OAAO,GAAU,EAAE,CAAA;YACvB,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,OAAO,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,yBAAyB,CAAC;oBAClE,aAAa,EAAE,kBAAkB;oBACjC,YAAY,EAAE,UAAU;oBACxB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,MAAM,EAAE,UAAU;oBAClB,QAAQ,EAAE,IAAI,CAAC,QAAQ;oBACvB,OAAO,EAAE,aAAa;iBACvB,CAAC,CAAA;YACJ,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAe,CAAA;YACnC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,IAAI,OAAO,CAAC,EAAE,WAAW,KAAK,QAAQ;oBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAA;YACpE,CAAC;YAED,mEAAmE;YACnE,kEAAkE;YAClE,8DAA8D;YAC9D,yDAAyD;YACzD,gEAAgE;YAChE,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;gBAC1B,MAAM,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,GAAG,IAAI,CAAC,KAAK,CAAA;gBAC3D,MAAM,GAAG,GAAG,UAAU,CAAC,kBAAkB,EAAE,gBAAgB,CAAC,CAAA;gBAE5D,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAU,CAAC,GAAG;wBAC7B,GAAG,IAAI,CAAC,KAAK;wBACb,SAAS,EAAE,IAAI;wBACf,MAAM,EAAE,IAAI;qBACgB,CAAA;oBAC9B,SAAQ;gBACV,CAAC;gBAED,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAA;gBAC7C,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;oBAC7B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAU,CAAC,GAAG;wBAC7B,GAAG,IAAI,CAAC,KAAK;wBACb,SAAS,EAAE,KAAK;qBACiB,CAAA;oBACnC,SAAQ;gBACV,CAAC;gBAED,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAU,CAAC,GAAG;oBAC7B,GAAG,IAAI,CAAC,KAAK;oBACb,SAAS,EAAE,IAAI;oBACf,QAAQ,EAAE,UAAU;iBACY,CAAA;YACpC,CAAC;YAED,oEAAoE;YACpE,oEAAoE;YACpE,uBAAuB;YACvB,EAAE;YACF,qEAAqE;YACrE,qEAAqE;YACrE,sEAAsE;YACtE,gEAAgE;YAChE,mEAAmE;YACnE,2CAA2C;YAC3C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,MAAM,EAAE,GAAG,CAAC,CAAC,WAAqB,CAAA;gBAClC,MAAM,GAAG,GAAG,UAAU,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAA;gBAC9C,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAQ;gBAClC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACpB,GAAG,CAAC,SAAS,IAAI,CAAC,CAAA;gBAClB,IAAI,GAAG,CAAC,SAAS,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;oBACjC,MAAM,wBAAwB,CAAC;wBAC7B,OAAO,EAAE,2CAA2C,GAAG,CAAC,QAAQ,GAAG;wBACnE,OAAO,EAAE;4BACP,SAAS,EAAE,GAAG,CAAC,SAAS;4BACxB,QAAQ,EAAE,GAAG,CAAC,QAAQ;4BACtB,kBAAkB;4BAClB,gBAAgB,EAAE,EAAE;yBACrB;qBACF,CAAC,CAAA;gBACJ,CAAC;gBAED,IAAI,SAAS,EAAE,CAAC;oBACd,gEAAgE;oBAChE,iEAAiE;oBACjE,8DAA8D;oBAC9D,4DAA4D;oBAC5D,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;wBAC1B,MAAM,sBAAsB,CAAC;4BAC3B,MAAM,EAAE,SAAS,CAAC,MAAM;4BACxB,cAAc,EAAE,SAAS,CAAC,IAAI;4BAC9B,SAAS,EAAE,CAAC,CAAC,CAAC;4BACd,QAAQ,EAAE,IAAI,CAAC,gBAAgB;4BAC/B,WAAW,EAAE,GAAG;yBACjB,CAAC,CAAA;oBACJ,CAAC;oBACD,MAAM,cAAc,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,UAAU,EAAE,SAAS,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC,CAAA;gBAC3E,CAAC;gBAED,IAAI,CAAC,SAAS,IAAI,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAQ;gBAElD,MAAM,aAAa,GAAG,mBAAmB,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;gBACrD,IAAI,aAAa,KAAK,SAAS;oBAAE,SAAQ;gBAEzC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACtB,SAAS,CAAC,IAAI,CAAC;oBACb,GAAG,EAAE,CAAC;oBACN,SAAS,EAAE,SAAS,CAAC,MAAM;oBAC3B,QAAQ,EAAE,aAAa;iBACxB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;QAED,OAAO,GAAG,SAAS,CAAA;QACnB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,MAAK;IACjC,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E,SAAS,UAAU,CAAC,YAAoB,EAAE,UAAkB;IAC1D,OAAO,GAAG,YAAY,IAAI,UAAU,EAAE,CAAA;AACxC,CAAC;AAKD;;;;;;;;;;;;;;;GAeG;AACH,KAAK,UAAU,oBAAoB,CACjC,EAAc,EACd,WAAmC,EACnC,EAAU,EACV,KAAyB;IAEzB,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;QAClB,OAAO,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,CAAA;IACnC,CAAC;IAED,mDAAmD;IACnD,IAAI,GAAG,GACL,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAS,CAAC,EAAE,KAAK,EAAE,CAAC;QAC7C,gBAAgB;QAChB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,CAAA;IAExC,iBAAiB;IACjB,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAA;YAC9D,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACxC,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAA;YACpD,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,6DAA6D;YAC7D,qDAAqD;QACvD,CAAC;IACH,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,IAAI,CAAC,CAAA;IAC1B,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,KAAK,UAAU,iCAAiC,CAAC,MAOhD;IACC,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,cAAc,EAAE,WAAW,EAAE,gBAAgB,EAAE,EAAE,EAAE,GAAG,MAAM,CAAA;IAC5F,IAAI,CAAC,SAAS,IAAI,CAAC,cAAc,IAAI,gBAAgB;QAAE,OAAO,SAAS,CAAA;IAEvE,MAAM,SAAS,GAAG,MAAM,eAAe,CAAC;QACtC,UAAU,EAAE,SAAS;QACrB,cAAc;QACd,WAAW;KACZ,CAAC,CAAA;IACF,IAAI,SAAS,IAAI,IAAI;QAAE,OAAO,SAAS,CAAA;IAEvC,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,SAAS,EAAE,SAAS,EAAE;QACpD,WAAW;QACX,mBAAmB,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;YAClC,oEAAoE;YACpE,oEAAoE;YACpE,gEAAgE;YAChE,kEAAkE;YAClE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAExC,CAAA;YACb,IAAI,KAAK,EAAE,EAAE;gBAAE,OAAO,KAAK,CAAC,EAAE,CAAA;YAC9B,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAA;YAClE,OAAO,GAAG,EAAE,EAAE,IAAI,EAAE,CAAA;QACtB,CAAC;KACF,CAAC,CAAA;IACF,OAAO,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAA;AAC/D,CAAC;AAsBD;;;;;;GAMG;AACH,SAAS,qBAAqB,CAC5B,MAA2B,EAC3B,SAAmB,EACnB,QAAsB,EACtB,GAAsB;IAEtB,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjC,IAAI,QAAQ,IAAI,IAAI;YAAE,SAAQ;QAE9B,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;YAC/C,IAAI,GAAG,KAAK,SAAS;gBAAE,SAAQ;YAC/B,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC;gBAAE,SAAQ;YAC/C,mEAAmE;YACnE,qEAAqE;YACrE,iCAAiC;YACjC,IAAI,WAAW,IAAK,QAAgC;gBAAE,SAAQ;YAC9D,GAAG,CAAC,IAAI,CAAC;gBACP,MAAM,EAAE,MAAM;gBACd,GAAG,EAAE,GAAG,CAAC,IAAI;gBACb,KAAK,EAAE,GAAG;gBACV,KAAK,EAAE,QAAQ;gBACf,GAAG;aACJ,CAAC,CAAA;YACF,SAAQ;QACV,CAAC;QAED,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACzB,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC7D,qBAAqB,CAAC,QAA+B,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAA;YACnF,CAAC;YACD,SAAQ;QACV,CAAC;QAED,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,IAAI,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC7D,qBAAqB,CAAC,IAA2B,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAA;oBAC/E,CAAC;gBACH,CAAC;YACH,CAAC;YACD,SAAQ;QACV,CAAC;QAED,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC1B,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,IAAI,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC7D,4EAA4E;wBAC5E,MAAM,SAAS,GAAI,IAA4B,CAAC,KAAK,CAAA;wBACrD,IAAI,OAAO,SAAS,KAAK,QAAQ;4BAAE,SAAQ;wBAC3C,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAA;wBAC/D,IAAI,CAAC,KAAK;4BAAE,SAAQ;wBACpB,qBAAqB,CAAC,IAA2B,EAAE,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAA;oBACjF,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,SAAiB,EAAE,QAAsB;IAChE,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,IAAI,CAAA;IAClC,IAAI,QAAQ,KAAK,GAAG;QAAE,OAAO,GAAG,CAAA;IAChC,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAA;IAChC,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,sBAAsB,CAAC,CAAU;IACxC,OAAO,CACL,OAAO,CAAC,KAAK,QAAQ;QACrB,CAAC,KAAK,IAAI;QACV,OAAQ,CAAS,CAAC,gBAAgB,KAAK,QAAQ;QAC/C,OAAQ,CAAS,CAAC,kBAAkB,KAAK,QAAQ,CAClD,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,gBAAgB,CACvB,MAAyB,EACzB,SAA2C;IAE3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG;YAAE,OAAO,SAAS,CAAA;QACtC,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI;YAAE,SAAQ;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAA;QAC9B,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,MAAM,IAAI,IAAI,MAAM;gBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC5C,CAAC;IACH,CAAC;IACD,IAAI,SAAS,EAAE,CAAC;QACd,MAAM,QAAQ,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAA;QAChD,IAAI,QAAQ;YAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IACnC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;AAC1B,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,GAAyB;IACrD,IAAI,GAAG,CAAC,UAAU;QAAE,OAAO,GAAG,CAAC,UAAU,CAAA;IACzC,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAA;IAC3D,OAAO,SAAS,EAAE,IAAI,CAAA;AACxB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,mBAAmB,CAC1B,MAAyB,EACzB,gBAAwB;IAExB,IAAI,OAAO,GAAG,KAAK,CAAA;IACnB,IAAI,OAAO,GAAG,KAAK,CAAA;IACnB,MAAM,MAAM,GAAgB,EAAE,CAAA;IAC9B,IAAI,SAAS,GAAG,KAAK,CAAA;IACrB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,KAAK,CAAC,gBAAgB,KAAK,gBAAgB;YAAE,SAAQ;QAC3D,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YAClB,OAAO,GAAG,IAAI,CAAA;YACd,MAAK;QACP,CAAC;QACD,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC;YACnB,OAAO,GAAG,IAAI,CAAA;YACd,SAAQ;QACV,CAAC;QACD,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACpD,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;gBACb,SAAS,GAAG,IAAI,CAAA;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,OAAO;QAAE,OAAO,GAAG,CAAA;IACvB,IAAI,OAAO;QAAE,OAAO,IAAI,CAAA;IACxB,IAAI,SAAS;QAAE,OAAO,MAAM,CAAA;IAC5B,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,8EAA8E;AAC9E,gCAAgC;AAChC,8EAA8E;AAE9E,MAAM,CAAC,MAAM,UAAU,GAAG;IACxB,qBAAqB;IACrB,eAAe;IACf,gBAAgB;IAChB,mBAAmB;IACnB,UAAU;CACX,CAAA"}

package/dist/services/populate.test.node.d.ts

@@ -0,0 +1,9 @@
+/**
+ * This Source Code is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/.
+ *
+ * Copyright (c) Infonomic Company Limited
+ */
+export {};
+//# sourceMappingURL=populate.test.node.d.ts.map

package/dist/services/populate.test.node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"populate.test.node.d.ts","sourceRoot":"","sources":["../../src/services/populate.test.node.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}