npm - dominds - Versions diffs - 1.22.1 → 1.23.1 - Mend

dominds 1.22.1 → 1.23.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (127) hide show

package/dist/tools/team_mgmt.js CHANGED Viewed

@@ -4009,7 +4009,7 @@ async function renderModelParamsManual(language) {
                 '想查看某个 provider 的“有效配置” `model_param_options`：优先用 `team_mgmt_list_models({ source: \"effective\", provider_pattern: \"<providerKey>\", model_pattern: \"*\", include_param_options: true })`（会列出该 provider 可用的参数说明）。',
                 '常见参数示例（不同 provider 支持不同）：例如 `reasoning_effort`、`verbosity`、`temperature` 等。对内置 `codex` provider，这些参数应写在 `model_params.codex.*` 下。',
                 '`model_params` 命名空间按 `apiType` 精确区分：官方 OpenAI 用 `openai`，OpenAI 兼容 Chat Completions 用 `openai-compatible`；官方 Anthropic 用 `anthropic`，Anthropic 兼容网关用 `anthropic-compatible`。同一个成员可以同时配置多套 namespace，运行时只读取当前 provider 对应的一套。',
-                '`model_params.openai-compatible.thinking` / `reasoning_effort` 属于 OpenAI-compatible Chat Completions 参数：`thinking` 可写 boolean 简写或 provider 自己文档里的 object；运行时会按当前 provider 透传；如果上游模型/网关不支持，对方可能拒绝请求。',
+                '`model_params.openai-compatible.thinking` / `reasoning_effort` 属于 OpenAI-compatible Chat Completions 参数：普通 provider 的 `thinking` 可写 boolean 简写或 provider 自己文档里的 object；内置 `kimi-code` provider 还支持 `auto|off|low|medium|high` 档位并会展开成 Kimi Code 专用请求字段。如果上游模型/网关不支持，对方可能拒绝请求。',
                 '`model_params.anthropic.thinking` 使用 Anthropic 官方 object（例如 `{ type: adaptive }`、`{ type: enabled, budget_tokens: 1024 }` 或 `{ type: disabled }`）；`model_params.anthropic-compatible.thinking` 使用 boolean（`true` 发送 `thinking.type=enabled`，`false` 发送 `thinking.type=disabled`）。',
                 '常见坑：不要把 `reasoning_effort` / `verbosity` 直接写在 `member_defaults` 或 `members.<id>` 根上（会被忽略，并会被 team.yaml 校验提示）；应写在 `model_params.codex.*` 下。',
                 '`model_param_options.<ns>.<param>.prominent: true`：表示“初始化/团队管理时应显式讨论并选定”的参数。不要依赖 provider/model 的隐含默认值。',
@@ -4041,7 +4041,7 @@ async function renderModelParamsManual(language) {
             'To inspect a provider’s effective `model_param_options`, prefer `team_mgmt_list_models({ source: \"effective\", provider_pattern: \"<providerKey>\", model_pattern: \"*\", include_param_options: true })` (lists the parameters documented for that provider).',
             'Common examples (provider-dependent): e.g. `reasoning_effort`, `verbosity`, `temperature`, etc. For the built-in `codex` provider, these go under `model_params.codex.*`.',
             '`model_params` namespaces are split by exact `apiType`: official OpenAI uses `openai`, OpenAI-compatible Chat Completions uses `openai-compatible`; official Anthropic uses `anthropic`, Anthropic-compatible gateways use `anthropic-compatible`. A member can configure multiple namespaces at once; runtime reads only the namespace matching the selected provider.',
-            '`model_params.openai-compatible.thinking` / `reasoning_effort` are OpenAI-compatible Chat Completions params: `thinking` accepts a boolean shorthand or the provider-documented object shape; Dominds passes them through for the current provider; unsupported upstream models/gateways may reject the request.',
+            '`model_params.openai-compatible.thinking` / `reasoning_effort` are OpenAI-compatible Chat Completions params: for ordinary providers, `thinking` accepts a boolean shorthand or the provider-documented object shape; the built-in `kimi-code` provider also accepts `auto|off|low|medium|high` and expands it into Kimi Code request fields. Unsupported upstream models/gateways may reject the request.',
             '`model_params.anthropic.thinking` uses the official Anthropic object shape (for example `{ type: adaptive }`, `{ type: enabled, budget_tokens: 1024 }`, or `{ type: disabled }`); `model_params.anthropic-compatible.thinking` uses a boolean (`true` sends `thinking.type=enabled`, `false` sends `thinking.type=disabled`).',
             'Common pitfall: do not put `reasoning_effort` / `verbosity` directly under `member_defaults` or `members.<id>` (they are ignored and will be flagged by team.yaml validation); put them under `model_params.codex.*`.',
             '`model_param_options.<ns>.<param>.prominent: true` means “discuss and pick explicitly during bootstrap/team management”. Do not rely on implicit provider/model defaults.',

package/dist/utils/task-package.d.ts CHANGED Viewed

@@ -107,6 +107,7 @@ export type TaskPackageChangeMindTargetParseResult = {
     kind: 'err';
     error: TaskPackageChangeMindTargetError;
 };
+export type TaskPackageContentHash = `crc32:${string}`;
 export declare function isTaskPackagePath(taskDocPath: string): boolean;
 export declare function taskPackageSectionFromSelector(selector: string): TaskPackageSection | null;
 export declare function bearInMindSectionFromSelector(selector: string): BearInMindSection | null;
@@ -120,11 +121,25 @@ export declare function updateTaskPackageByChangeMindTarget(params: {
     taskPackageDirFullPath: string;
     target: TaskPackageChangeMindTarget;
     content: string;
+    previousContentHash: string;
     updatedBy?: string;
 }): Promise<{
     kind: 'updated';
 } | {
     kind: 'missing';
+} | {
+    kind: 'content_hash_mismatch';
+    currentContentHash: TaskPackageContentHash;
+}>;
+export declare function readTaskPackageByChangeMindTarget(params: {
+    taskPackageDirFullPath: string;
+    target: TaskPackageChangeMindTarget;
+}): Promise<{
+    kind: 'present';
+    content: string;
+    contentHash: TaskPackageContentHash;
+} | {
+    kind: 'missing';
 }>;
 export declare function createTaskPackageByChangeMindTarget(params: {
     taskPackageDirFullPath: string;
@@ -151,6 +166,7 @@ export declare function deleteTaskPackageByChangeMindTarget(params: {
 } | {
     kind: 'missing';
 }>;
+export declare function computeTaskPackageContentHash(content: string): TaskPackageContentHash;
 export declare function taskPackageRelativePathForChangeMindTarget(target: TaskPackageChangeMindTarget): string;
 export declare function ensureTaskPackage(taskPackageDirFullPath: string, _updatedBy?: string): Promise<void>;
 export declare function readTaskPackageSections(taskPackageDirFullPath: string): Promise<TaskPackageSectionsState>;

package/dist/utils/task-package.js CHANGED Viewed

@@ -53,9 +53,11 @@ exports.parseTaskPackageChangeMindTarget = parseTaskPackageChangeMindTarget;
 exports.taskPackageFilenameForSection = taskPackageFilenameForSection;
 exports.bearInMindFilenameForSection = bearInMindFilenameForSection;
 exports.updateTaskPackageByChangeMindTarget = updateTaskPackageByChangeMindTarget;
+exports.readTaskPackageByChangeMindTarget = readTaskPackageByChangeMindTarget;
 exports.createTaskPackageByChangeMindTarget = createTaskPackageByChangeMindTarget;
 exports.appendTaskPackageByChangeMindTarget = appendTaskPackageByChangeMindTarget;
 exports.deleteTaskPackageByChangeMindTarget = deleteTaskPackageByChangeMindTarget;
+exports.computeTaskPackageContentHash = computeTaskPackageContentHash;
 exports.taskPackageRelativePathForChangeMindTarget = taskPackageRelativePathForChangeMindTarget;
 exports.ensureTaskPackage = ensureTaskPackage;
 exports.readTaskPackageSections = readTaskPackageSections;
@@ -65,6 +67,8 @@ exports.readTaskPackageForInjection = readTaskPackageForInjection;
 exports.updateTaskPackageSection = updateTaskPackageSection;
 const fs = __importStar(require("fs"));
 const path = __importStar(require("path"));
+const zlib_1 = require("zlib");
+const async_fifo_mutex_1 = require("../runtime/async-fifo-mutex");
 const taskPackageIdentifierRe = /^[a-zA-Z][a-zA-Z0-9_-]*(?:\.[a-zA-Z0-9_-]+)*$/;
 function isTaskPackageIdentifier(value) {
     return taskPackageIdentifierRe.test(value);
@@ -77,6 +81,25 @@ exports.BEAR_IN_MIND_SECTIONS = [
     'decisions',
     'risks',
 ];
+const taskPackageFileLocks = new Map();
+function getTaskPackageFileLock(filePath) {
+    const key = path.resolve(filePath);
+    const existing = taskPackageFileLocks.get(key);
+    if (existing)
+        return existing;
+    const created = new async_fifo_mutex_1.AsyncFifoMutex();
+    taskPackageFileLocks.set(key, created);
+    return created;
+}
+async function withTaskPackageFileLock(filePath, fn) {
+    const release = await getTaskPackageFileLock(filePath).acquire();
+    try {
+        return await fn();
+    }
+    finally {
+        release();
+    }
+}
 const sectionToFilename = {
     goals: 'goals.md',
     constraints: 'constraints.md',
@@ -188,99 +211,152 @@ function bearInMindFilenameForSection(section) {
     return bearInMindSectionToFilename[section];
 }
 async function updateTaskPackageByChangeMindTarget(params) {
-    const { taskPackageDirFullPath, target, content } = params;
+    const { taskPackageDirFullPath, target, content, previousContentHash } = params;
     const filePath = taskPackageFilePathForChangeMindTarget(taskPackageDirFullPath, target);
-    try {
-        const st = await fs.promises.stat(filePath);
-        if (!st.isFile()) {
-            throw new Error(`Taskdoc section target is not a file: ${filePath}`);
+    return await withTaskPackageFileLock(filePath, async () => {
+        try {
+            const st = await fs.promises.stat(filePath);
+            if (!st.isFile()) {
+                throw new Error(`Taskdoc section target is not a file: ${filePath}`);
+            }
+            const currentContent = await fs.promises.readFile(filePath, 'utf8');
+            const currentContentHash = computeTaskPackageContentHash(currentContent);
+            if (currentContentHash !== previousContentHash) {
+                return { kind: 'content_hash_mismatch', currentContentHash };
+            }
+            await writeExistingMarkdownFileWithCanonicalEnding(filePath, content);
+            return { kind: 'updated' };
         }
-        await writeExistingMarkdownFileWithCanonicalEnding(filePath, content);
-        return { kind: 'updated' };
-    }
-    catch (err) {
-        if (typeof err === 'object' &&
-            err !== null &&
-            'code' in err &&
-            err.code === 'ENOENT') {
-            return { kind: 'missing' };
+        catch (err) {
+            if (typeof err === 'object' &&
+                err !== null &&
+                'code' in err &&
+                err.code === 'ENOENT') {
+                return { kind: 'missing' };
+            }
+            throw err;
         }
-        throw err;
-    }
+    });
+}
+async function readTaskPackageByChangeMindTarget(params) {
+    const filePath = taskPackageFilePathForChangeMindTarget(params.taskPackageDirFullPath, params.target);
+    return await withTaskPackageFileLock(filePath, async () => {
+        const content = await readTextFileIfPresent(filePath);
+        if (content === null)
+            return { kind: 'missing' };
+        return { kind: 'present', content, contentHash: computeTaskPackageContentHash(content) };
+    });
 }
 async function createTaskPackageByChangeMindTarget(params) {
     const { taskPackageDirFullPath, target, content, updatedBy } = params;
     await ensureTaskPackage(taskPackageDirFullPath, updatedBy);
     const filePath = taskPackageFilePathForChangeMindTarget(taskPackageDirFullPath, target);
-    await fs.promises.mkdir(path.dirname(filePath), { recursive: true });
-    try {
-        await writeNewMarkdownFileWithCanonicalEnding(filePath, content);
-        return { kind: 'created' };
-    }
-    catch (err) {
-        if (typeof err === 'object' &&
-            err !== null &&
-            'code' in err &&
-            err.code === 'EEXIST') {
-            return { kind: 'exists' };
+    return await withTaskPackageFileLock(filePath, async () => {
+        await fs.promises.mkdir(path.dirname(filePath), { recursive: true });
+        try {
+            await writeNewMarkdownFileWithCanonicalEnding(filePath, content);
+            return { kind: 'created' };
         }
-        throw err;
-    }
+        catch (err) {
+            if (typeof err === 'object' &&
+                err !== null &&
+                'code' in err &&
+                err.code === 'EEXIST') {
+                return { kind: 'exists' };
+            }
+            throw err;
+        }
+    });
 }
 async function appendTaskPackageByChangeMindTarget(params) {
     const { taskPackageDirFullPath, target, content, sep, updatedBy } = params;
     await ensureTaskPackage(taskPackageDirFullPath, updatedBy);
     const filePath = taskPackageFilePathForChangeMindTarget(taskPackageDirFullPath, target);
-    await fs.promises.mkdir(path.dirname(filePath), { recursive: true });
-    const current = await readTextFileIfPresent(filePath);
-    const next = current === null || current.trim() === '' ? content : joinForAppend(current, content, sep);
-    await writeMarkdownFileWithCanonicalEnding(filePath, next);
+    await withTaskPackageFileLock(filePath, async () => {
+        await fs.promises.mkdir(path.dirname(filePath), { recursive: true });
+        const current = await readTextFileIfPresent(filePath);
+        const next = current === null || current.trim() === '' ? content : joinForAppend(current, content, sep);
+        await writeMarkdownFileWithCanonicalEnding(filePath, next);
+    });
 }
 async function deleteTaskPackageByChangeMindTarget(params) {
     const filePath = taskPackageFilePathForChangeMindTarget(params.taskPackageDirFullPath, params.target);
-    try {
+    return await withTaskPackageFileLock(filePath, async () => {
+        try {
+            const st = await fs.promises.stat(filePath);
+            if (!st.isFile()) {
+                throw new Error(`Taskdoc section target is not a file: ${filePath}`);
+            }
+            await fs.promises.unlink(filePath);
+            return { kind: 'deleted' };
+        }
+        catch (err) {
+            if (typeof err === 'object' &&
+                err !== null &&
+                'code' in err &&
+                err.code === 'ENOENT') {
+                return { kind: 'missing' };
+            }
+            throw err;
+        }
+    });
+}
+async function writeMarkdownFileWithCanonicalEnding(filePath, content) {
+    await writeMarkdownFileWithCanonicalEndingViaRename(filePath, content, 'overwrite');
+}
+async function writeExistingMarkdownFileWithCanonicalEnding(filePath, content) {
+    await writeMarkdownFileWithCanonicalEndingViaRename(filePath, content, 'replace-existing');
+}
+async function writeNewMarkdownFileWithCanonicalEnding(filePath, content) {
+    await fs.promises.writeFile(filePath, withCanonicalMarkdownFileEnding(content), {
+        encoding: 'utf8',
+        flag: 'wx',
+    });
+}
+async function writeMarkdownFileWithCanonicalEndingViaRename(filePath, content, mode) {
+    const tempFilePath = path.join(path.dirname(filePath), `.${path.basename(filePath)}.${process.pid}.${Date.now()}.tmp`);
+    if (mode === 'replace-existing') {
         const st = await fs.promises.stat(filePath);
         if (!st.isFile()) {
             throw new Error(`Taskdoc section target is not a file: ${filePath}`);
         }
+    }
+    try {
+        await fs.promises.writeFile(tempFilePath, withCanonicalMarkdownFileEnding(content), {
+            encoding: 'utf8',
+            flag: 'wx',
+        });
+        await fs.promises.rename(tempFilePath, filePath);
+    }
+    catch (err) {
+        await removeTempFileIfPresent(tempFilePath);
+        throw err;
+    }
+}
+async function removeTempFileIfPresent(filePath) {
+    try {
         await fs.promises.unlink(filePath);
-        return { kind: 'deleted' };
     }
     catch (err) {
         if (typeof err === 'object' &&
             err !== null &&
             'code' in err &&
             err.code === 'ENOENT') {
-            return { kind: 'missing' };
+            return;
         }
         throw err;
     }
 }
-async function writeMarkdownFileWithCanonicalEnding(filePath, content) {
-    await fs.promises.writeFile(filePath, withCanonicalMarkdownFileEnding(content), 'utf8');
-}
-async function writeExistingMarkdownFileWithCanonicalEnding(filePath, content) {
-    const handle = await fs.promises.open(filePath, 'r+');
-    try {
-        await handle.truncate(0);
-        await handle.writeFile(withCanonicalMarkdownFileEnding(content), 'utf8');
-    }
-    finally {
-        await handle.close();
-    }
-}
-async function writeNewMarkdownFileWithCanonicalEnding(filePath, content) {
-    await fs.promises.writeFile(filePath, withCanonicalMarkdownFileEnding(content), {
-        encoding: 'utf8',
-        flag: 'wx',
-    });
-}
 function withCanonicalMarkdownFileEnding(content) {
     const stripped = stripTrailingMarkdownFileNewlines(content);
     if (stripped === '')
         return '';
     return `${stripped}\n`;
 }
+function computeTaskPackageContentHash(content) {
+    const checksum = (0, zlib_1.crc32)(withCanonicalMarkdownFileEnding(content)) >>> 0;
+    return `crc32:${checksum.toString(16).padStart(8, '0')}`;
+}
 function taskPackageRelativePathForChangeMindTarget(target) {
     switch (target.kind) {
         case 'top_level':

package/dist/utils/taskdoc.js CHANGED Viewed

@@ -199,10 +199,10 @@ If you provided a regular file path (e.g. a \`.md\`), that is unexpected. Please
                     const entries = [];
                     for (const cat of extra.categories) {
                         for (const selector of cat.selectors) {
-                            entries.push(`- \`${cat.category}/${selector}.md\`（读：\`recall_taskdoc({\"category\":\"${cat.category}\",\"selector\":\"${selector}\"})\`；追加：\`mind_more({\"category\":\"${cat.category}\",\"selector\":\"${selector}\",\"items\":[\"...\"]})\`；替换：\`change_mind({\"category\":\"${cat.category}\",\"selector\":\"${selector}\",\"content\":\"...\"})\`）`);
+                            entries.push(`- \`${cat.category}/${selector}.md\`（读/取 content_hash：\`recall_taskdoc({\"category\":\"${cat.category}\",\"selector\":\"${selector}\"})\`；追加：\`mind_more({\"category\":\"${cat.category}\",\"selector\":\"${selector}\",\"items\":[\"...\"]})\`；替换：先 recall 取得 content_hash，再 \`change_mind({\"category\":\"${cat.category}\",\"selector\":\"${selector}\",\"content\":\"...\",\"previous_content_hash\":\"crc32:...\"})\`）`);
                         }
                     }
-                    const header = `**额外章节索引（不会自动注入；需要时用 \`recall_taskdoc\` 显式读取）：**`;
+                    const header = `**额外章节索引（不会自动注入；需要时用 \`recall_taskdoc\` 显式读取/取 content_hash）：**`;
                     const body = entries.length > 0 ? entries : ['- （无）'];
                     const truncatedLine = extra.truncated
                         ? `- ⚠️ 已截断：目录条目过多，仅展示前 64 项。`
@@ -219,10 +219,10 @@ If you provided a regular file path (e.g. a \`.md\`), that is unexpected. Please
                 const entries = [];
                 for (const cat of extra.categories) {
                     for (const selector of cat.selectors) {
-                        entries.push(`- \`${cat.category}/${selector}.md\` (read: \`recall_taskdoc({\"category\":\"${cat.category}\",\"selector\":\"${selector}\"})\`; append: \`mind_more({\"category\":\"${cat.category}\",\"selector\":\"${selector}\",\"items\":[\"...\"]})\`; replace: \`change_mind({\"category\":\"${cat.category}\",\"selector\":\"${selector}\",\"content\":\"...\"})\`)`);
+                        entries.push(`- \`${cat.category}/${selector}.md\` (read/get content_hash: \`recall_taskdoc({\"category\":\"${cat.category}\",\"selector\":\"${selector}\"})\`; append: \`mind_more({\"category\":\"${cat.category}\",\"selector\":\"${selector}\",\"items\":[\"...\"]})\`; replace: recall first for content_hash, then \`change_mind({\"category\":\"${cat.category}\",\"selector\":\"${selector}\",\"content\":\"...\",\"previous_content_hash\":\"crc32:...\"})\`)`);
                     }
                 }
-                const header = `**Extra sections index (NOT auto-injected; use \`recall_taskdoc\` when needed):**`;
+                const header = `**Extra sections index (NOT auto-injected; use \`recall_taskdoc\` to read/get content_hash):**`;
                 const body = entries.length > 0 ? entries : ['- (none)'];
                 const truncatedLine = extra.truncated
                     ? `- ⚠️ Truncated: too many entries; showing first 64.`
@@ -259,11 +259,11 @@ If you provided a regular file path (e.g. a \`.md\`), that is unexpected. Please
                 const presentSectionLine = presentSectionsZh.length === 0
                     ? []
                     : [
-                        `- 已存在常驻分段（${presentSectionsZh.map((s) => `\`${s}\``).join(' / ')}）需要追加少量条目时，使用 \`mind_more\`；需要整体改写/合并时，使用 \`change_mind\`。没有把握时不要覆盖，优先新增额外章节或追加小条目。`,
+                        `- 已存在常驻分段（${presentSectionsZh.map((s) => `\`${s}\``).join(' / ')}）需要追加少量条目时，使用 \`mind_more\`；需要整体改写/合并时，先用 \`recall_taskdoc({"selector":"<selector>"})\` 显式取得该分段当前 \`content_hash\`，再用 \`change_mind\` 并带上它作为 \`previous_content_hash\`。没有把握时不要覆盖，优先新增额外章节或追加小条目。`,
                     ];
                 const maintenanceLine = isSideDialog
                     ? `- 支线对话中不允许 \`do_mind\` / \`mind_more\` / \`change_mind\` / \`never_mind\`：需要更新时请诉请差遣牒维护人 @${taskdocMaintainerId} 执行更新，并提供要新增的章节、要追加的条目、已合并好的“分段全文替换稿”或要删除的章节（禁止覆盖/抹掉他人条目）。`
-                    : `- 维护方式：少量新增条目优先用 \`mind_more({\"items\":[\"...\"]})\` 追加到 \`progress\`（也可指定 selector/category）；需要删除陈旧项、重排或压缩时，用 \`change_mind\` 指定分段做整章替换。`;
+                    : `- 维护方式：少量新增条目优先用 \`mind_more({\"items\":[\"...\"]})\` 追加到 \`progress\`（也可指定 selector/category）；需要删除陈旧项、重排或压缩时，先用 \`recall_taskdoc\` 显式取得当前 \`content_hash\`，再用 \`change_mind\` 指定分段做整章替换，并必须带上它作为 \`previous_content_hash\`。`;
                 return [
                     `**差遣牒结构（封装差遣牒 \`*.tsk/\`）：**`,
                     `- 我们的差遣牒是一个 \`*.tsk/\` 目录：顶层 3 个分段（\`goals\` / \`constraints\` / \`progress\`）一定会自动注入；\`bearinmind/\`（固定白名单）可选自动注入；其他章节不会自动注入，仅以“目录索引”形式提示并需用 \`recall_taskdoc\` 显式读取。`,
@@ -306,11 +306,11 @@ If you provided a regular file path (e.g. a \`.md\`), that is unexpected. Please
             const presentSectionLine = presentSectionsEn.length === 0
                 ? []
                 : [
-                    `- For existing resident sections (${presentSectionsEn.map((s) => `\`${s}\``).join(' / ')}), use \`mind_more\` to append small notes, and use \`change_mind\` for full-section rewrite/merge. If unsure, do not overwrite; prefer creating an extra section or appending small notes.`,
+                    `- For existing resident sections (${presentSectionsEn.map((s) => `\`${s}\``).join(' / ')}), use \`mind_more\` to append small notes; for full-section rewrite/merge, first call \`recall_taskdoc({"selector":"<selector>"})\` to get the current \`content_hash\`, then pass it to \`change_mind\` as \`previous_content_hash\`. If unsure, do not overwrite; prefer creating an extra section or appending small notes.`,
                 ];
             const maintenanceLine = isSideDialog
                 ? `- Side Dialogs cannot call \`do_mind\` / \`mind_more\` / \`change_mind\` / \`never_mind\`: ask the Taskdoc maintainer @${taskdocMaintainerId} to apply updates, and provide the new section to create, entries to append, a fully merged full-section replacement draft, or the section to delete (do not overwrite/delete other contributors).`
-                : `- Maintenance: for small additions, prefer \`mind_more({\"items\":[\"...\"]})\` to append to \`progress\` (selector/category may be specified); when stale entries must be removed, reordered, or compressed, use \`change_mind\` for a full-section replacement.`;
+                : `- Maintenance: for small additions, prefer \`mind_more({\"items\":[\"...\"]})\` to append to \`progress\` (selector/category may be specified); when stale entries must be removed, reordered, or compressed, first call \`recall_taskdoc\` to get the current \`content_hash\`, then use \`change_mind\` for a full-section replacement with that value as \`previous_content_hash\`.`;
             const bearEn = bearInMindStatus === 'absent'
                 ? 'absent'
                 : bearInMindStatus === 'invalid'
@@ -350,7 +350,7 @@ If you provided a regular file path (e.g. a \`.md\`), that is unexpected. Please
             if (language === 'zh') {
                 const howToUpdate = isSideDialog
                     ? `⚠️ **注意：** 差遣牒是封装的。不要用文件工具去读/写/列目录 \`*.tsk/\` 下的任何路径。\n支线对话中不允许 \`do_mind\` / \`mind_more\` / \`change_mind\` / \`never_mind\`：请诉请差遣牒维护人 @${taskdocMaintainerId} 执行更新，并提供要新增的章节、要追加的条目、合并好的“分段全文替换稿”或要删除的章节（禁止覆盖/抹掉他人条目）。`
-                    : `⚠️ **注意：** 差遣牒是封装的。不要用文件工具去读/写/列目录 \`*.tsk/\` 下的任何路径。\n请在当前对话中用函数工具 \`mind_more\` 追加少量条目，或用 \`change_mind\` 做整章替换；缺失章节用 \`do_mind\` 创建；禁止覆盖/抹掉他人条目。`;
+                    : `⚠️ **注意：** 差遣牒是封装的。不要用文件工具去读/写/列目录 \`*.tsk/\` 下的任何路径。\n请在当前对话中用函数工具 \`mind_more\` 追加少量条目；需要整章替换时，先用 \`recall_taskdoc\` 取得当前 \`content_hash\`，再用带 \`previous_content_hash\` 的 \`change_mind\`；缺失章节用 \`do_mind\` 创建；禁止覆盖/抹掉他人条目。`;
                 return {
                     type: 'environment_msg',
                     role: 'user',
@@ -365,7 +365,7 @@ ${howToUpdate}`,
             }
             const howToUpdate = isSideDialog
                 ? `⚠️ **Note:** Taskdocs are encapsulated. Do not use file tools to read/write/list anything under \`*.tsk/\`.\nSide Dialogs cannot call \`do_mind\` / \`mind_more\` / \`change_mind\` / \`never_mind\`; ask the Taskdoc maintainer @${taskdocMaintainerId} with the new section to create, entries to append, a merged full-section replacement draft, or the section to delete (do not overwrite/delete other contributors).`
-                : `⚠️ **Note:** Taskdocs are encapsulated. Do not use file tools to read/write/list anything under \`*.tsk/\`.\nIn this dialog, use \`mind_more\` for small append-only updates, or \`change_mind\` for full-section replacements; create missing sections with \`do_mind\`; do not overwrite/delete other contributors.`;
+                : `⚠️ **Note:** Taskdocs are encapsulated. Do not use file tools to read/write/list anything under \`*.tsk/\`.\nIn this dialog, use \`mind_more\` for small append-only updates; for full-section replacements, first use \`recall_taskdoc\` to get the current \`content_hash\`, then call \`change_mind\` with \`previous_content_hash\`; create missing sections with \`do_mind\`; do not overwrite/delete other contributors.`;
             return {
                 type: 'environment_msg',
                 role: 'user',
@@ -381,7 +381,7 @@ ${howToUpdate}`,
         if (language === 'zh') {
             const footerLine = isSideDialog
                 ? `*支线对话中不允许 \`do_mind\` / \`mind_more\` / \`change_mind\` / \`never_mind\`：请诉请差遣牒维护人 @${taskdocMaintainerId} 执行更新，并提供要新增的章节、要追加的条目、合并好的“分段全文替换稿”或要删除的章节（禁止覆盖/抹掉他人条目）。*`
-                : `*在当前对话中用 \`mind_more\` 追加少量条目，或用 \`change_mind\` 替换整段；缺失章节用 \`do_mind\` 创建；更新时禁止覆盖他人条目。*`;
+                : `*在当前对话中用 \`mind_more\` 追加少量条目；需要整段替换时先用 \`recall_taskdoc\` 取得当前 \`content_hash\`，再用带 \`previous_content_hash\` 的 \`change_mind\`；缺失章节用 \`do_mind\` 创建；更新时禁止覆盖他人条目。*`;
             return {
                 type: 'environment_msg',
                 role: 'user',
@@ -404,7 +404,7 @@ ${footerLine}
         }
         const footerLine = isSideDialog
             ? `*Side Dialogs cannot call \`do_mind\` / \`mind_more\` / \`change_mind\` / \`never_mind\`; ask the Taskdoc maintainer @${taskdocMaintainerId} with the new section to create, entries to append, a merged full-section replacement draft, or the section to delete (do not overwrite/delete other contributors).*`
-            : `*In this dialog, use \`mind_more\` for small append-only updates, or \`change_mind\` for full-section replacements; create missing sections with \`do_mind\`; do not overwrite other contributors.*`;
+            : `*In this dialog, use \`mind_more\` for small append-only updates; for full-section replacements, first use \`recall_taskdoc\` to get the current \`content_hash\`, then call \`change_mind\` with \`previous_content_hash\`; create missing sections with \`do_mind\`; do not overwrite other contributors.*`;
         return {
             type: 'environment_msg',
             role: 'user',

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "dominds",
-  "version": "1.22.1",
+  "version": "1.23.1",
   "description": "Dominds CLI and aggregation shell for the LongRun AI kernel/runtime packages.",
   "type": "commonjs",
   "publishConfig": {

package/webapp/dist/assets/{_basePickBy-DUbW5G8a.js → _basePickBy-C3SVVywm.js} RENAMED Viewed

@@ -1,5 +1,5 @@
-import { e as isSymbol, c as baseFlatten, g as baseIteratee, k as keys, h as baseFindIndex, j as baseEach, l as arrayMap, m as hasPath, n as castPath, t as toKey, o as baseGet } from "./_baseUniq-vou1IeXB.js";
-import { aU as isObject, aC as baseRest, aV as isIterateeCall, aW as keysIn, aX as eq, aY as isArrayLike, aZ as isArray, a_ as identity, a$ as isIndex, b0 as assignValue } from "./index-B3WzTLcD.js";
+import { e as isSymbol, c as baseFlatten, g as baseIteratee, k as keys, h as baseFindIndex, j as baseEach, l as arrayMap, m as hasPath, n as castPath, t as toKey, o as baseGet } from "./_baseUniq-egNq6cCa.js";
+import { aU as isObject, aC as baseRest, aV as isIterateeCall, aW as keysIn, aX as eq, aY as isArrayLike, aZ as isArray, a_ as identity, a$ as isIndex, b0 as assignValue } from "./index-CGbZlct2.js";
 var reWhitespace = /\s/;
 function trimmedEndIndex(string) {
   var index = string.length;
@@ -193,4 +193,4 @@ export {
   map as m,
   toFinite as t
 };
-//# sourceMappingURL=_basePickBy-DUbW5G8a.js.map
+//# sourceMappingURL=_basePickBy-C3SVVywm.js.map

package/webapp/dist/assets/{_basePickBy-DUbW5G8a.js.map → _basePickBy-C3SVVywm.js.map} RENAMED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"_basePickBy-DUbW5G8a.js","sources":["../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_trimmedEndIndex.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseTrim.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/toNumber.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/toFinite.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/toInteger.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/flatten.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/defaults.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/last.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_createFind.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/findIndex.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/find.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseMap.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/map.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/has.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseLt.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseExtremum.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/min.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_basePickBy.js"],"sourcesContent":["/** Used to match a single whitespace character. /\nvar reWhitespace = /\\s/;\n\n/\n Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n \n @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n /\nfunction trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n}\n\nexport default trimmedEndIndex;\n","import trimmedEndIndex from './_trimmedEndIndex.js';\n\n/* Used to match leading whitespace. /\nvar reTrimStart = /^\\s+/;\n\n/\n The base implementation of `_.trim`.\n \n @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n /\nfunction baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n}\n\nexport default baseTrim;\n","import baseTrim from './_baseTrim.js';\nimport isObject from './isObject.js';\nimport isSymbol from './isSymbol.js';\n\n/* Used as references for various `Number` constants. /\nvar NAN = 0 / 0;\n\n/* Used to detect bad signed hexadecimal string values. /\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/* Used to detect binary string values. /\nvar reIsBinary = /^0b[01]+$/i;\n\n/* Used to detect octal string values. /\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/* Built-in method references without a dependency on `root`. /\nvar freeParseInt = parseInt;\n\n/\n Converts `value` to a number.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to process.\n @returns {number} Returns the number.\n * @example\n \n _.toNumber(3.2);\n * // => 3.2\n \n _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n \n _.toNumber(Infinity);\n * // => Infinity\n \n _.toNumber('3.2');\n * // => 3.2\n /\nfunction toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = baseTrim(value);\n var isBinary = reIsBinary.test(value);\n return (isBinary \|\| reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nexport default toNumber;\n","import toNumber from './toNumber.js';\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0,\n MAX_INTEGER = 1.7976931348623157e+308;\n\n/\n Converts `value` to a finite number.\n \n @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {number} Returns the converted number.\n * @example\n \n _.toFinite(3.2);\n * // => 3.2\n \n _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n \n _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n \n _.toFinite('3.2');\n * // => 3.2\n /\nfunction toFinite(value) {\n if (!value) {\n return value === 0 ? value : 0;\n }\n value = toNumber(value);\n if (value === INFINITY \|\| value === -INFINITY) {\n var sign = (value < 0 ? -1 : 1);\n return sign MAX_INTEGER;\n }\n return value === value ? value : 0;\n}\n\nexport default toFinite;\n","import toFinite from './toFinite.js';\n\n/*\n Converts `value` to an integer.\n \n Note: This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {number} Returns the converted integer.\n * @example\n \n _.toInteger(3.2);\n * // => 3\n \n _.toInteger(Number.MIN_VALUE);\n * // => 0\n \n _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n \n _.toInteger('3.2');\n * // => 3\n /\nfunction toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nexport default toInteger;\n","import baseFlatten from './_baseFlatten.js';\n\n/\n Flattens `array` a single level deep.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n \n _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n /\nfunction flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n}\n\nexport default flatten;\n","import baseRest from './_baseRest.js';\nimport eq from './eq.js';\nimport isIterateeCall from './_isIterateeCall.js';\nimport keysIn from './keysIn.js';\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n \n Note: This method mutates `object`.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n \n _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n /\nvar defaults = baseRest(function(object, sources) {\n object = Object(object);\n\n var index = -1;\n var length = sources.length;\n var guard = length > 2 ? sources[2] : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n length = 1;\n }\n\n while (++index < length) {\n var source = sources[index];\n var props = keysIn(source);\n var propsIndex = -1;\n var propsLength = props.length;\n\n while (++propsIndex < propsLength) {\n var key = props[propsIndex];\n var value = object[key];\n\n if (value === undefined \|\|\n (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n object[key] = source[key];\n }\n }\n }\n\n return object;\n});\n\nexport default defaults;\n","/\n Gets the last element of `array`.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {} Returns the last element of `array`.\n @example\n \n _.last([1, 2, 3]);\n * // => 3\n /\nfunction last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n}\n\nexport default last;\n","import baseIteratee from './_baseIteratee.js';\nimport isArrayLike from './isArrayLike.js';\nimport keys from './keys.js';\n\n/\n Creates a `_.find` or `_.findLast` function.\n \n @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n /\nfunction createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = baseIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n}\n\nexport default createFind;\n","import baseFindIndex from './_baseFindIndex.js';\nimport baseIteratee from './_baseIteratee.js';\nimport toInteger from './toInteger.js';\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeMax = Math.max;\n\n/\n This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n \n @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n \n var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n \n _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n \n // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n \n // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n \n // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n /\nfunction findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nexport default findIndex;\n","import createFind from './_createFind.js';\nimport findIndex from './findIndex.js';\n\n/\n Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index\|key, collection).\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {} Returns the matched element, else `undefined`.\n @example\n \n var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n \n _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n \n // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n \n // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n \n // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n /\nvar find = createFind(findIndex);\n\nexport default find;\n","import baseEach from './_baseEach.js';\nimport isArrayLike from './isArrayLike.js';\n\n/\n The base implementation of `_.map` without support for iteratee shorthands.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n /\nfunction baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n}\n\nexport default baseMap;\n","import arrayMap from './_arrayMap.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseMap from './_baseMap.js';\nimport isArray from './isArray.js';\n\n/\n Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index\|key, collection).\n \n Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n \n The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n \n function square(n) {\n * return n * n;\n * }\n \n _.map([4, 8], square);\n * // => [16, 64]\n \n _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n \n var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n \n // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n /\nfunction map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, baseIteratee(iteratee, 3));\n}\n\nexport default map;\n","/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n The base implementation of `_.has` without support for deep paths.\n \n @private\n * @param {Object} [object] The object to query.\n * @param {Array\|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n /\nfunction baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n}\n\nexport default baseHas;\n","import baseHas from './_baseHas.js';\nimport hasPath from './_hasPath.js';\n\n/\n Checks if `path` is a direct property of `object`.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n \n var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n \n _.has(object, 'a');\n * // => true\n \n _.has(object, 'a.b');\n * // => true\n \n _.has(object, ['a', 'b']);\n * // => true\n \n _.has(other, 'a');\n * // => false\n /\nfunction has(object, path) {\n return object != null && hasPath(object, path, baseHas);\n}\n\nexport default has;\n","/\n The base implementation of `_.lt` which doesn't coerce arguments.\n \n @private\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n /\nfunction baseLt(value, other) {\n return value < other;\n}\n\nexport default baseLt;\n","import isSymbol from './isSymbol.js';\n\n/\n The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n \n @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {} Returns the extremum value.\n /\nfunction baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n}\n\nexport default baseExtremum;\n","import baseExtremum from './_baseExtremum.js';\nimport baseLt from './_baseLt.js';\nimport identity from './identity.js';\n\n/*\n Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {} Returns the minimum value.\n @example\n \n _.min([4, 2, 8, 6]);\n * // => 2\n \n _.min([]);\n * // => undefined\n /\nfunction min(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseLt)\n : undefined;\n}\n\nexport default min;\n","import assignValue from './_assignValue.js';\nimport castPath from './_castPath.js';\nimport isIndex from './_isIndex.js';\nimport isObject from './isObject.js';\nimport toKey from './_toKey.js';\n\n/\n The base implementation of `_.set`.\n \n @private\n * @param {Object} object The object to modify.\n * @param {Array\|string} path The path of the property to set.\n * @param {} value The value to set.\n @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n /\nfunction baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' \|\| key === 'constructor' \|\| key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n}\n\nexport default baseSet;\n","import baseGet from './_baseGet.js';\nimport baseSet from './_baseSet.js';\nimport castPath from './_castPath.js';\n\n/\n The base implementation of `_.pickBy` without support for iteratee shorthands.\n \n @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n}\n\nexport default basePickBy;\n"],"names":["objectProto","hasOwnProperty","collection"],"mappings":";;AACA,IAAI,eAAe;AAUnB,SAAS,gBAAgB,QAAQ;AAC/B,MAAI,QAAQ,OAAO;AAEnB,SAAO,WAAW,aAAa,KAAK,OAAO,OAAO,KAAK,CAAC,GAAG;AAAA,EAAC;AAC5D,SAAO;AACT;ACbA,IAAI,cAAc;AASlB,SAAS,SAAS,QAAQ;AACxB,SAAO,SACH,OAAO,MAAM,GAAG,gBAAgB,MAAM,IAAI,CAAC,EAAE,QAAQ,aAAa,EAAE,IACpE;AACN;ACXA,IAAI,MAAM,IAAI;AAGd,IAAI,aAAa;AAGjB,IAAI,aAAa;AAGjB,IAAI,YAAY;AAGhB,IAAI,eAAe;AAyBnB,SAAS,SAAS,OAAO;AACvB,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO;AAAA,EACT;AACA,MAAI,SAAS,KAAK,GAAG;AACnB,WAAO;AAAA,EACT;AACA,MAAI,SAAS,KAAK,GAAG;AACnB,QAAI,QAAQ,OAAO,MAAM,WAAW,aAAa,MAAM,QAAO,IAAK;AACnE,YAAQ,SAAS,KAAK,IAAK,QAAQ,KAAM;AAAA,EAC3C;AACA,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO,UAAU,IAAI,QAAQ,CAAC;AAAA,EAChC;AACA,UAAQ,SAAS,KAAK;AACtB,MAAI,WAAW,WAAW,KAAK,KAAK;AACpC,SAAQ,YAAY,UAAU,KAAK,KAAK,IACpC,aAAa,MAAM,MAAM,CAAC,GAAG,WAAW,IAAI,CAAC,IAC5C,WAAW,KAAK,KAAK,IAAI,MAAM,CAAC;AACvC;AC1DA,IAAI,WAAW,IAAI,GACf,cAAc;AAyBlB,SAAS,SAAS,OAAO;AACvB,MAAI,CAAC,OAAO;AACV,WAAO,UAAU,IAAI,QAAQ;AAAA,EAC/B;AACA,UAAQ,SAAS,KAAK;AACtB,MAAI,UAAU,YAAY,UAAU,CAAC,UAAU;AAC7C,QAAI,OAAQ,QAAQ,IAAI,KAAK;AAC7B,WAAO,OAAO;AAAA,EAChB;AACA,SAAO,UAAU,QAAQ,QAAQ;AACnC;ACXA,SAAS,UAAU,OAAO;AACxB,MAAI,SAAS,SAAS,KAAK,GACvB,YAAY,SAAS;AAEzB,SAAO,WAAW,SAAU,YAAY,SAAS,YAAY,SAAU;AACzE;ACjBA,SAAS,QAAQ,OAAO;AACtB,MAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,SAAO,SAAS,YAAY,KAAQ,IAAI,CAAA;AAC1C;ACbA,IAAIA,gBAAc,OAAO;AAGzB,IAAIC,mBAAiBD,cAAY;AAuB9B,IAAC,WAAW,SAAS,SAAS,QAAQ,SAAS;AAChD,WAAS,OAAO,MAAM;AAEtB,MAAI,QAAQ;AACZ,MAAI,SAAS,QAAQ;AACrB,MAAI,QAAQ,SAAS,IAAI,QAAQ,CAAC,IAAI;AAEtC,MAAI,SAAS,eAAe,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,KAAK,GAAG;AAC1D,aAAS;AAAA,EACX;AAEA,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,SAAS,QAAQ,KAAK;AAC1B,QAAI,QAAQ,OAAO,MAAM;AACzB,QAAI,aAAa;AACjB,QAAI,cAAc,MAAM;AAExB,WAAO,EAAE,aAAa,aAAa;AACjC,UAAI,MAAM,MAAM,UAAU;AAC1B,UAAI,QAAQ,OAAO,GAAG;AAEtB,UAAI,UAAU,UACT,GAAG,OAAOA,cAAY,GAAG,CAAC,KAAK,CAACC,iBAAe,KAAK,QAAQ,GAAG,GAAI;AACtE,eAAO,GAAG,IAAI,OAAO,GAAG;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT,CAAC;AC/CD,SAAS,KAAK,OAAO;AACnB,MAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,SAAO,SAAS,MAAM,SAAS,CAAC,IAAI;AACtC;ACNA,SAAS,WAAW,eAAe;AACjC,SAAO,SAAS,YAAY,WAAW,WAAW;AAChD,QAAI,WAAW,OAAO,UAAU;AAChC,QAAI,CAAC,YAAY,UAAU,GAAG;AAC5B,UAAI,WAAW,aAAa,SAAY;AACxC,mBAAa,KAAK,UAAU;AAC5B,kBAAY,SAAS,KAAK;AAAE,eAAO,SAAS,SAAS,GAAG,GAAG,KAAK,QAAQ;AAAA,MAAG;AAAA,IAC7E;AACA,QAAI,QAAQ,cAAc,YAAY,WAAW,SAAS;AAC1D,WAAO,QAAQ,KAAK,SAAS,WAAW,WAAW,KAAK,IAAI,KAAK,IAAI;AAAA,EACvE;AACF;ACjBA,IAAI,YAAY,KAAK;AAqCrB,SAAS,UAAU,OAAO,WAAW,WAAW;AAC9C,MAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ;AACX,WAAO;AAAA,EACT;AACA,MAAI,QAAQ,aAAa,OAAO,IAAI,UAAU,SAAS;AACvD,MAAI,QAAQ,GAAG;AACb,YAAQ,UAAU,SAAS,OAAO,CAAC;AAAA,EACrC;AACA,SAAO,cAAc,OAAO,aAAa,SAAY,GAAG,KAAK;AAC/D;ACbG,IAAC,OAAO,WAAW,SAAS;AC5B/B,SAAS,QAAQ,YAAY,UAAU;AACrC,MAAI,QAAQ,IACR,SAAS,YAAY,UAAU,IAAI,MAAM,WAAW,MAAM,IAAI,CAAA;AAElE,WAAS,YAAY,SAAS,OAAO,KAAKC,aAAY;AACpD,WAAO,EAAE,KAAK,IAAI,SAAS,OAAO,KAAKA,WAAU;AAAA,EACnD,CAAC;AACD,SAAO;AACT;AC4BA,SAAS,IAAI,YAAY,UAAU;AACjC,MAAI,OAAO,QAAQ,UAAU,IAAI,WAAW;AAC5C,SAAO,KAAK,YAAY,aAAa,QAAW,CAAC;AACnD;ACjDA,IAAI,cAAc,OAAO;AAGzB,IAAI,iBAAiB,YAAY;AAUjC,SAAS,QAAQ,QAAQ,KAAK;AAC5B,SAAO,UAAU,QAAQ,eAAe,KAAK,QAAQ,GAAG;AAC1D;ACcA,SAAS,IAAI,QAAQ,MAAM;AACzB,SAAO,UAAU,QAAQ,QAAQ,QAAQ,MAAM,OAAO;AACxD;ACvBA,SAAS,OAAO,OAAO,OAAO;AAC5B,SAAO,QAAQ;AACjB;ACCA,SAAS,aAAa,OAAO,UAAU,YAAY;AACjD,MAAI,QAAQ,IACR,SAAS,MAAM;AAEnB,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,QAAQ,MAAM,KAAK,GACnB,UAAU,SAAS,KAAK;AAE5B,QAAI,WAAW,SAAS,aAAa,SAC5B,YAAY,WAAW,CAAC,SAAS,OAAO,IACzC,WAAW,SAAS,QAAQ,IAC7B;AACL,UAAI,WAAW,SACX,SAAS;AAAA,IACf;AAAA,EACF;AACA,SAAO;AACT;ACPA,SAAS,IAAI,OAAO;AAClB,SAAQ,SAAS,MAAM,SACnB,aAAa,OAAO,UAAU,MAAM,IACpC;AACN;ACVA,SAAS,QAAQ,QAAQ,MAAM,OAAO,YAAY;AAChD,MAAI,CAAC,SAAS,MAAM,GAAG;AACrB,WAAO;AAAA,EACT;AACA,SAAO,SAAS,MAAM,MAAM;AAE5B,MAAI,QAAQ,IACR,SAAS,KAAK,QACd,YAAY,SAAS,GACrB,SAAS;AAEb,SAAO,UAAU,QAAQ,EAAE,QAAQ,QAAQ;AACzC,QAAI,MAAM,MAAM,KAAK,KAAK,CAAC,GACvB,WAAW;AAEf,QAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,aAAa;AACvE,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,WAAW;AACtB,UAAI,WAAW,OAAO,GAAG;AACzB,iBAA4D;AAC5D,UAAI,aAAa,QAAW;AAC1B,mBAAW,SAAS,QAAQ,IACxB,WACC,QAAQ,KAAK,QAAQ,CAAC,CAAC,IAAI,CAAA,IAAK;MACvC;AAAA,IACF;AACA,gBAAY,QAAQ,KAAK,QAAQ;AACjC,aAAS,OAAO,GAAG;AAAA,EACrB;AACA,SAAO;AACT;ACnCA,SAAS,WAAW,QAAQ,OAAO,WAAW;AAC5C,MAAI,QAAQ,IACR,SAAS,MAAM,QACf,SAAS,CAAA;AAEb,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,OAAO,MAAM,KAAK,GAClB,QAAQ,QAAQ,QAAQ,IAAI;AAEhC,QAAI,UAAU,OAAO,IAAI,GAAG;AAC1B,cAAQ,QAAQ,SAAS,MAAM,MAAM,GAAG,KAAK;AAAA,IAC/C;AAAA,EACF;AACA,SAAO;AACT;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19]}
1	+ {"version":3,"file":"_basePickBy-C3SVVywm.js","sources":["../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_trimmedEndIndex.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseTrim.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/toNumber.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/toFinite.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/toInteger.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/flatten.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/defaults.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/last.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_createFind.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/findIndex.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/find.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseMap.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/map.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/has.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseLt.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseExtremum.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/min.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_baseSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.23/node_modules/lodash-es/_basePickBy.js"],"sourcesContent":["/** Used to match a single whitespace character. /\nvar reWhitespace = /\\s/;\n\n/\n Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n \n @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n /\nfunction trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n}\n\nexport default trimmedEndIndex;\n","import trimmedEndIndex from './_trimmedEndIndex.js';\n\n/* Used to match leading whitespace. /\nvar reTrimStart = /^\\s+/;\n\n/\n The base implementation of `_.trim`.\n \n @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n /\nfunction baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n}\n\nexport default baseTrim;\n","import baseTrim from './_baseTrim.js';\nimport isObject from './isObject.js';\nimport isSymbol from './isSymbol.js';\n\n/* Used as references for various `Number` constants. /\nvar NAN = 0 / 0;\n\n/* Used to detect bad signed hexadecimal string values. /\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/* Used to detect binary string values. /\nvar reIsBinary = /^0b[01]+$/i;\n\n/* Used to detect octal string values. /\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/* Built-in method references without a dependency on `root`. /\nvar freeParseInt = parseInt;\n\n/\n Converts `value` to a number.\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to process.\n @returns {number} Returns the number.\n * @example\n \n _.toNumber(3.2);\n * // => 3.2\n \n _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n \n _.toNumber(Infinity);\n * // => Infinity\n \n _.toNumber('3.2');\n * // => 3.2\n /\nfunction toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = baseTrim(value);\n var isBinary = reIsBinary.test(value);\n return (isBinary \|\| reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nexport default toNumber;\n","import toNumber from './toNumber.js';\n\n/* Used as references for various `Number` constants. /\nvar INFINITY = 1 / 0,\n MAX_INTEGER = 1.7976931348623157e+308;\n\n/\n Converts `value` to a finite number.\n \n @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {number} Returns the converted number.\n * @example\n \n _.toFinite(3.2);\n * // => 3.2\n \n _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n \n _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n \n _.toFinite('3.2');\n * // => 3.2\n /\nfunction toFinite(value) {\n if (!value) {\n return value === 0 ? value : 0;\n }\n value = toNumber(value);\n if (value === INFINITY \|\| value === -INFINITY) {\n var sign = (value < 0 ? -1 : 1);\n return sign MAX_INTEGER;\n }\n return value === value ? value : 0;\n}\n\nexport default toFinite;\n","import toFinite from './toFinite.js';\n\n/*\n Converts `value` to an integer.\n \n Note: This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n \n @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {} value The value to convert.\n @returns {number} Returns the converted integer.\n * @example\n \n _.toInteger(3.2);\n * // => 3\n \n _.toInteger(Number.MIN_VALUE);\n * // => 0\n \n _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n \n _.toInteger('3.2');\n * // => 3\n /\nfunction toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nexport default toInteger;\n","import baseFlatten from './_baseFlatten.js';\n\n/\n Flattens `array` a single level deep.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n \n _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n /\nfunction flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n}\n\nexport default flatten;\n","import baseRest from './_baseRest.js';\nimport eq from './eq.js';\nimport isIterateeCall from './_isIterateeCall.js';\nimport keysIn from './keysIn.js';\n\n/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n \n Note: This method mutates `object`.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n \n _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n /\nvar defaults = baseRest(function(object, sources) {\n object = Object(object);\n\n var index = -1;\n var length = sources.length;\n var guard = length > 2 ? sources[2] : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n length = 1;\n }\n\n while (++index < length) {\n var source = sources[index];\n var props = keysIn(source);\n var propsIndex = -1;\n var propsLength = props.length;\n\n while (++propsIndex < propsLength) {\n var key = props[propsIndex];\n var value = object[key];\n\n if (value === undefined \|\|\n (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n object[key] = source[key];\n }\n }\n }\n\n return object;\n});\n\nexport default defaults;\n","/\n Gets the last element of `array`.\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {} Returns the last element of `array`.\n @example\n \n _.last([1, 2, 3]);\n * // => 3\n /\nfunction last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n}\n\nexport default last;\n","import baseIteratee from './_baseIteratee.js';\nimport isArrayLike from './isArrayLike.js';\nimport keys from './keys.js';\n\n/\n Creates a `_.find` or `_.findLast` function.\n \n @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n /\nfunction createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = baseIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n}\n\nexport default createFind;\n","import baseFindIndex from './_baseFindIndex.js';\nimport baseIteratee from './_baseIteratee.js';\nimport toInteger from './toInteger.js';\n\n/ Built-in method references for those with the same name as other `lodash` methods. /\nvar nativeMax = Math.max;\n\n/\n This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n \n @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n \n var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n \n _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n \n // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n \n // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n \n // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n /\nfunction findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nexport default findIndex;\n","import createFind from './_createFind.js';\nimport findIndex from './findIndex.js';\n\n/\n Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index\|key, collection).\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {} Returns the matched element, else `undefined`.\n @example\n \n var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n \n _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n \n // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n \n // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n \n // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n /\nvar find = createFind(findIndex);\n\nexport default find;\n","import baseEach from './_baseEach.js';\nimport isArrayLike from './isArrayLike.js';\n\n/\n The base implementation of `_.map` without support for iteratee shorthands.\n \n @private\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n /\nfunction baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n}\n\nexport default baseMap;\n","import arrayMap from './_arrayMap.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseMap from './_baseMap.js';\nimport isArray from './isArray.js';\n\n/\n Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index\|key, collection).\n \n Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n \n The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n \n @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array\|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n \n function square(n) {\n * return n * n;\n * }\n \n _.map([4, 8], square);\n * // => [16, 64]\n \n _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n \n var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n \n // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n /\nfunction map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, baseIteratee(iteratee, 3));\n}\n\nexport default map;\n","/* Used for built-in method references. /\nvar objectProto = Object.prototype;\n\n/* Used to check objects for own properties. /\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/\n The base implementation of `_.has` without support for deep paths.\n \n @private\n * @param {Object} [object] The object to query.\n * @param {Array\|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n /\nfunction baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n}\n\nexport default baseHas;\n","import baseHas from './_baseHas.js';\nimport hasPath from './_hasPath.js';\n\n/\n Checks if `path` is a direct property of `object`.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array\|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n \n var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n \n _.has(object, 'a');\n * // => true\n \n _.has(object, 'a.b');\n * // => true\n \n _.has(object, ['a', 'b']);\n * // => true\n \n _.has(other, 'a');\n * // => false\n /\nfunction has(object, path) {\n return object != null && hasPath(object, path, baseHas);\n}\n\nexport default has;\n","/\n The base implementation of `_.lt` which doesn't coerce arguments.\n \n @private\n * @param {} value The value to compare.\n @param {} other The other value to compare.\n @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n /\nfunction baseLt(value, other) {\n return value < other;\n}\n\nexport default baseLt;\n","import isSymbol from './isSymbol.js';\n\n/\n The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n \n @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {} Returns the extremum value.\n /\nfunction baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n}\n\nexport default baseExtremum;\n","import baseExtremum from './_baseExtremum.js';\nimport baseLt from './_baseLt.js';\nimport identity from './identity.js';\n\n/*\n Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n \n @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {} Returns the minimum value.\n @example\n \n _.min([4, 2, 8, 6]);\n * // => 2\n \n _.min([]);\n * // => undefined\n /\nfunction min(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseLt)\n : undefined;\n}\n\nexport default min;\n","import assignValue from './_assignValue.js';\nimport castPath from './_castPath.js';\nimport isIndex from './_isIndex.js';\nimport isObject from './isObject.js';\nimport toKey from './_toKey.js';\n\n/\n The base implementation of `_.set`.\n \n @private\n * @param {Object} object The object to modify.\n * @param {Array\|string} path The path of the property to set.\n * @param {} value The value to set.\n @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n /\nfunction baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' \|\| key === 'constructor' \|\| key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n}\n\nexport default baseSet;\n","import baseGet from './_baseGet.js';\nimport baseSet from './_baseSet.js';\nimport castPath from './_castPath.js';\n\n/\n The base implementation of `_.pickBy` without support for iteratee shorthands.\n \n @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n}\n\nexport default basePickBy;\n"],"names":["objectProto","hasOwnProperty","collection"],"mappings":";;AACA,IAAI,eAAe;AAUnB,SAAS,gBAAgB,QAAQ;AAC/B,MAAI,QAAQ,OAAO;AAEnB,SAAO,WAAW,aAAa,KAAK,OAAO,OAAO,KAAK,CAAC,GAAG;AAAA,EAAC;AAC5D,SAAO;AACT;ACbA,IAAI,cAAc;AASlB,SAAS,SAAS,QAAQ;AACxB,SAAO,SACH,OAAO,MAAM,GAAG,gBAAgB,MAAM,IAAI,CAAC,EAAE,QAAQ,aAAa,EAAE,IACpE;AACN;ACXA,IAAI,MAAM,IAAI;AAGd,IAAI,aAAa;AAGjB,IAAI,aAAa;AAGjB,IAAI,YAAY;AAGhB,IAAI,eAAe;AAyBnB,SAAS,SAAS,OAAO;AACvB,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO;AAAA,EACT;AACA,MAAI,SAAS,KAAK,GAAG;AACnB,WAAO;AAAA,EACT;AACA,MAAI,SAAS,KAAK,GAAG;AACnB,QAAI,QAAQ,OAAO,MAAM,WAAW,aAAa,MAAM,QAAO,IAAK;AACnE,YAAQ,SAAS,KAAK,IAAK,QAAQ,KAAM;AAAA,EAC3C;AACA,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO,UAAU,IAAI,QAAQ,CAAC;AAAA,EAChC;AACA,UAAQ,SAAS,KAAK;AACtB,MAAI,WAAW,WAAW,KAAK,KAAK;AACpC,SAAQ,YAAY,UAAU,KAAK,KAAK,IACpC,aAAa,MAAM,MAAM,CAAC,GAAG,WAAW,IAAI,CAAC,IAC5C,WAAW,KAAK,KAAK,IAAI,MAAM,CAAC;AACvC;AC1DA,IAAI,WAAW,IAAI,GACf,cAAc;AAyBlB,SAAS,SAAS,OAAO;AACvB,MAAI,CAAC,OAAO;AACV,WAAO,UAAU,IAAI,QAAQ;AAAA,EAC/B;AACA,UAAQ,SAAS,KAAK;AACtB,MAAI,UAAU,YAAY,UAAU,CAAC,UAAU;AAC7C,QAAI,OAAQ,QAAQ,IAAI,KAAK;AAC7B,WAAO,OAAO;AAAA,EAChB;AACA,SAAO,UAAU,QAAQ,QAAQ;AACnC;ACXA,SAAS,UAAU,OAAO;AACxB,MAAI,SAAS,SAAS,KAAK,GACvB,YAAY,SAAS;AAEzB,SAAO,WAAW,SAAU,YAAY,SAAS,YAAY,SAAU;AACzE;ACjBA,SAAS,QAAQ,OAAO;AACtB,MAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,SAAO,SAAS,YAAY,KAAQ,IAAI,CAAA;AAC1C;ACbA,IAAIA,gBAAc,OAAO;AAGzB,IAAIC,mBAAiBD,cAAY;AAuB9B,IAAC,WAAW,SAAS,SAAS,QAAQ,SAAS;AAChD,WAAS,OAAO,MAAM;AAEtB,MAAI,QAAQ;AACZ,MAAI,SAAS,QAAQ;AACrB,MAAI,QAAQ,SAAS,IAAI,QAAQ,CAAC,IAAI;AAEtC,MAAI,SAAS,eAAe,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,KAAK,GAAG;AAC1D,aAAS;AAAA,EACX;AAEA,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,SAAS,QAAQ,KAAK;AAC1B,QAAI,QAAQ,OAAO,MAAM;AACzB,QAAI,aAAa;AACjB,QAAI,cAAc,MAAM;AAExB,WAAO,EAAE,aAAa,aAAa;AACjC,UAAI,MAAM,MAAM,UAAU;AAC1B,UAAI,QAAQ,OAAO,GAAG;AAEtB,UAAI,UAAU,UACT,GAAG,OAAOA,cAAY,GAAG,CAAC,KAAK,CAACC,iBAAe,KAAK,QAAQ,GAAG,GAAI;AACtE,eAAO,GAAG,IAAI,OAAO,GAAG;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT,CAAC;AC/CD,SAAS,KAAK,OAAO;AACnB,MAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,SAAO,SAAS,MAAM,SAAS,CAAC,IAAI;AACtC;ACNA,SAAS,WAAW,eAAe;AACjC,SAAO,SAAS,YAAY,WAAW,WAAW;AAChD,QAAI,WAAW,OAAO,UAAU;AAChC,QAAI,CAAC,YAAY,UAAU,GAAG;AAC5B,UAAI,WAAW,aAAa,SAAY;AACxC,mBAAa,KAAK,UAAU;AAC5B,kBAAY,SAAS,KAAK;AAAE,eAAO,SAAS,SAAS,GAAG,GAAG,KAAK,QAAQ;AAAA,MAAG;AAAA,IAC7E;AACA,QAAI,QAAQ,cAAc,YAAY,WAAW,SAAS;AAC1D,WAAO,QAAQ,KAAK,SAAS,WAAW,WAAW,KAAK,IAAI,KAAK,IAAI;AAAA,EACvE;AACF;ACjBA,IAAI,YAAY,KAAK;AAqCrB,SAAS,UAAU,OAAO,WAAW,WAAW;AAC9C,MAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ;AACX,WAAO;AAAA,EACT;AACA,MAAI,QAAQ,aAAa,OAAO,IAAI,UAAU,SAAS;AACvD,MAAI,QAAQ,GAAG;AACb,YAAQ,UAAU,SAAS,OAAO,CAAC;AAAA,EACrC;AACA,SAAO,cAAc,OAAO,aAAa,SAAY,GAAG,KAAK;AAC/D;ACbG,IAAC,OAAO,WAAW,SAAS;AC5B/B,SAAS,QAAQ,YAAY,UAAU;AACrC,MAAI,QAAQ,IACR,SAAS,YAAY,UAAU,IAAI,MAAM,WAAW,MAAM,IAAI,CAAA;AAElE,WAAS,YAAY,SAAS,OAAO,KAAKC,aAAY;AACpD,WAAO,EAAE,KAAK,IAAI,SAAS,OAAO,KAAKA,WAAU;AAAA,EACnD,CAAC;AACD,SAAO;AACT;AC4BA,SAAS,IAAI,YAAY,UAAU;AACjC,MAAI,OAAO,QAAQ,UAAU,IAAI,WAAW;AAC5C,SAAO,KAAK,YAAY,aAAa,QAAW,CAAC;AACnD;ACjDA,IAAI,cAAc,OAAO;AAGzB,IAAI,iBAAiB,YAAY;AAUjC,SAAS,QAAQ,QAAQ,KAAK;AAC5B,SAAO,UAAU,QAAQ,eAAe,KAAK,QAAQ,GAAG;AAC1D;ACcA,SAAS,IAAI,QAAQ,MAAM;AACzB,SAAO,UAAU,QAAQ,QAAQ,QAAQ,MAAM,OAAO;AACxD;ACvBA,SAAS,OAAO,OAAO,OAAO;AAC5B,SAAO,QAAQ;AACjB;ACCA,SAAS,aAAa,OAAO,UAAU,YAAY;AACjD,MAAI,QAAQ,IACR,SAAS,MAAM;AAEnB,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,QAAQ,MAAM,KAAK,GACnB,UAAU,SAAS,KAAK;AAE5B,QAAI,WAAW,SAAS,aAAa,SAC5B,YAAY,WAAW,CAAC,SAAS,OAAO,IACzC,WAAW,SAAS,QAAQ,IAC7B;AACL,UAAI,WAAW,SACX,SAAS;AAAA,IACf;AAAA,EACF;AACA,SAAO;AACT;ACPA,SAAS,IAAI,OAAO;AAClB,SAAQ,SAAS,MAAM,SACnB,aAAa,OAAO,UAAU,MAAM,IACpC;AACN;ACVA,SAAS,QAAQ,QAAQ,MAAM,OAAO,YAAY;AAChD,MAAI,CAAC,SAAS,MAAM,GAAG;AACrB,WAAO;AAAA,EACT;AACA,SAAO,SAAS,MAAM,MAAM;AAE5B,MAAI,QAAQ,IACR,SAAS,KAAK,QACd,YAAY,SAAS,GACrB,SAAS;AAEb,SAAO,UAAU,QAAQ,EAAE,QAAQ,QAAQ;AACzC,QAAI,MAAM,MAAM,KAAK,KAAK,CAAC,GACvB,WAAW;AAEf,QAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,aAAa;AACvE,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,WAAW;AACtB,UAAI,WAAW,OAAO,GAAG;AACzB,iBAA4D;AAC5D,UAAI,aAAa,QAAW;AAC1B,mBAAW,SAAS,QAAQ,IACxB,WACC,QAAQ,KAAK,QAAQ,CAAC,CAAC,IAAI,CAAA,IAAK;MACvC;AAAA,IACF;AACA,gBAAY,QAAQ,KAAK,QAAQ;AACjC,aAAS,OAAO,GAAG;AAAA,EACrB;AACA,SAAO;AACT;ACnCA,SAAS,WAAW,QAAQ,OAAO,WAAW;AAC5C,MAAI,QAAQ,IACR,SAAS,MAAM,QACf,SAAS,CAAA;AAEb,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,OAAO,MAAM,KAAK,GAClB,QAAQ,QAAQ,QAAQ,IAAI;AAEhC,QAAI,UAAU,OAAO,IAAI,GAAG;AAC1B,cAAQ,QAAQ,SAAS,MAAM,MAAM,GAAG,KAAK;AAAA,IAC/C;AAAA,EACF;AACA,SAAO;AACT;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19]}

package/webapp/dist/assets/{_baseUniq-vou1IeXB.js → _baseUniq-egNq6cCa.js} RENAMED Viewed

@@ -1,4 +1,4 @@
-import { bh as isObjectLike, bi as baseGetTag, aZ as isArray, bj as Symbol$1, aY as isArrayLike, bk as arrayLikeKeys, bl as baseKeys, bm as memoize, bn as isArguments, bo as copyObject, aW as keysIn, bp as getPrototype, bq as cloneArrayBuffer, br as cloneTypedArray, bs as getTag, bf as baseUnary, bt as nodeUtil, aU as isObject, bu as copyArray, bv as isBuffer, bw as cloneBuffer, bx as initCloneObject, by as Stack, b0 as assignValue, bz as MapCache, aX as eq, bA as Uint8Array, bB as isTypedArray, bC as isLength, a$ as isIndex, a_ as identity, bd as baseFor, bD as Set } from "./index-B3WzTLcD.js";
+import { bh as isObjectLike, bi as baseGetTag, aZ as isArray, bj as Symbol$1, aY as isArrayLike, bk as arrayLikeKeys, bl as baseKeys, bm as memoize, bn as isArguments, bo as copyObject, aW as keysIn, bp as getPrototype, bq as cloneArrayBuffer, br as cloneTypedArray, bs as getTag, bf as baseUnary, bt as nodeUtil, aU as isObject, bu as copyArray, bv as isBuffer, bw as cloneBuffer, bx as initCloneObject, by as Stack, b0 as assignValue, bz as MapCache, aX as eq, bA as Uint8Array, bB as isTypedArray, bC as isLength, a$ as isIndex, a_ as identity, bd as baseFor, bD as Set } from "./index-CGbZlct2.js";
 var symbolTag$3 = "[object Symbol]";
 function isSymbol(value) {
   return typeof value == "symbol" || isObjectLike(value) && baseGetTag(value) == symbolTag$3;
@@ -833,4 +833,4 @@ export {
   baseIndexOf as y,
   getAllKeysIn as z
 };
-//# sourceMappingURL=_baseUniq-vou1IeXB.js.map
+//# sourceMappingURL=_baseUniq-egNq6cCa.js.map