@akemi-mio/creativity 0.0.0-stage → 0.1.0

package/dist/NoveltyScorer.js

@@ -0,0 +1,93 @@
+"use strict";
+/**
+ * NoveltyScorer — 代码层新颖度评估
+ *
+ * 在 LLM 自评 novelty 之外，通过文本相似度对输入假设进行再评估：
+ * 1. 与近期假设（past 30）的 idea 文本对比，Jaccard 相似度 > 0.5 → 扣 15 分
+ * 2. 与已拒绝假设的 idea 文本对比，Jaccard 相似度 > 0.6 → 标记为 rejected
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.jaccardSimilarity = jaccardSimilarity;
+exports.evaluateNovelty = evaluateNovelty;
+// ==================== Tokenizer ====================
+/**
+ * 简易 tokenizer：将文本拆分为 token 集合
+ * - 英文词按空格/标点分割、转小写
+ * - 中文按二元组（bigram）拆分（中文分词需要词典，这里用 bigram 近似）
+ * - 去重、去空
+ */
+function tokenize(text) {
+    const tokens = new Set();
+    // 英文/数字 token
+    const enTokens = text
+        .toLowerCase()
+        .split(/[^a-z0-9一-鿿]+/g)
+        .filter((t) => t.length > 1 && /[a-z0-9]/.test(t));
+    for (const t of enTokens)
+        tokens.add(t);
+    // 中文 bigram
+    const chChars = text.replace(/[^一-鿿]/g, '');
+    for (let i = 0; i < chChars.length - 1; i++) {
+        tokens.add(chChars.slice(i, i + 2));
+    }
+    return tokens;
+}
+// ==================== Similarity ====================
+/** Jaccard 相似度：|A ∩ B| / |A ∪ B| */
+function jaccardSimilarity(a, b) {
+    const setA = tokenize(a);
+    const setB = tokenize(b);
+    const union = new Set([...setA, ...setB]);
+    if (union.size === 0)
+        return 0;
+    let intersection = 0;
+    for (const t of setA) {
+        if (setB.has(t))
+            intersection++;
+    }
+    return intersection / union.size;
+}
+/**
+ * 对一条新假设进行代码层新颖度评估
+ *
+ * @param candidate 新假设
+ * @param recentHypotheses 近期假设（用于扣分）
+ * @param rejectedHypotheses 已拒绝假设（用于自动拒绝）
+ * @returns NoveltyVerdict
+ */
+function evaluateNovelty(candidate, recentHypotheses, rejectedHypotheses) {
+    const candidateText = `${candidate.title} ${candidate.idea}`;
+    let adjustedNovelty = candidate.novelty;
+    let mostSimilarTitle = '';
+    let mostSimilarScore = 0;
+    // 1. 与近期假设对比
+    for (const h of recentHypotheses) {
+        const sim = jaccardSimilarity(candidateText, `${h.title} ${h.idea}`);
+        if (sim > mostSimilarScore) {
+            mostSimilarScore = sim;
+            mostSimilarTitle = h.title;
+        }
+    }
+    if (mostSimilarScore > 0.5) {
+        adjustedNovelty = Math.max(0, adjustedNovelty - 15);
+    }
+    // 2. 与已拒绝假设对比 — 高度相似则自动拒绝
+    for (const h of rejectedHypotheses) {
+        const sim = jaccardSimilarity(candidateText, `${h.title} ${h.idea}`);
+        if (sim > 0.6) {
+            return {
+                adjustedNovelty,
+                shouldReject: true,
+                rejectReason: `与已拒绝假设"${h.title}"内容高度相似 (Jaccard=${sim.toFixed(2)})`,
+                mostSimilarTitle: h.title,
+                mostSimilarScore: sim,
+            };
+        }
+    }
+    return {
+        adjustedNovelty,
+        shouldReject: false,
+        mostSimilarTitle,
+        mostSimilarScore,
+    };
+}

package/dist/SourceAggregator.d.ts

@@ -0,0 +1,21 @@
+import type { CreativitySource } from './types';
+export type SourceDomain = 'module' | 'behavior' | 'observation' | 'external' | 'failure' | 'feedback';
+export interface SourceProvider {
+    domain: SourceDomain;
+    name: string;
+    collect: () => CreativitySource[];
+}
+/**
+ * SourceAggregator — 来源总线
+ *
+ * 统一收集多域来源，做去重、每域限流与失败降级，
+ * 供创意产生与发酵两端共用同一份信号。
+ */
+export declare class SourceAggregator {
+    private providers;
+    private maxPerDomain;
+    private minDomains;
+    constructor(maxPerDomain?: number, minDomains?: number);
+    addProvider(provider: SourceProvider): void;
+    build(): CreativitySource[];
+}

package/dist/SourceAggregator.js

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SourceAggregator = void 0;
+const Logger_1 = require("@akemi-mio/core/logger/Logger");
+/**
+ * SourceAggregator — 来源总线
+ *
+ * 统一收集多域来源，做去重、每域限流与失败降级，
+ * 供创意产生与发酵两端共用同一份信号。
+ */
+class SourceAggregator {
+    providers = [];
+    maxPerDomain;
+    minDomains;
+    constructor(maxPerDomain = 4, minDomains = 3) {
+        this.maxPerDomain = maxPerDomain;
+        this.minDomains = minDomains;
+    }
+    addProvider(provider) {
+        this.providers.push(provider);
+    }
+    build() {
+        const byDomain = new Map();
+        const seen = new Set();
+        for (const provider of this.providers) {
+            let collected = [];
+            try {
+                collected = provider.collect() ?? [];
+            }
+            catch (err) {
+                (0, Logger_1.log)('WARN', 'source_provider_failed', { provider: provider.name, error: String(err?.message ?? err) });
+                continue;
+            }
+            const unique = collected.filter((s) => {
+                const key = `${provider.domain}:${s.name}`;
+                if (seen.has(key))
+                    return false;
+                seen.add(key);
+                return true;
+            });
+            const list = byDomain.get(provider.domain) ?? [];
+            byDomain.set(provider.domain, [...list, ...unique]);
+        }
+        const output = [];
+        let domainsWithData = 0;
+        for (const [domain, sources] of byDomain) {
+            if (sources.length > 0)
+                domainsWithData++;
+            const sorted = [...sources].sort((a, b) => b.weight - a.weight);
+            output.push(...sorted.slice(0, this.maxPerDomain));
+        }
+        if (domainsWithData < this.minDomains) {
+            (0, Logger_1.log)('WARN', 'source_aggregator_low_diversity', { domains: domainsWithData, min: this.minDomains });
+        }
+        (0, Logger_1.log)('INFO', 'source_aggregator_build', { total: output.length, domains: domainsWithData });
+        return output;
+    }
+}
+exports.SourceAggregator = SourceAggregator;

package/dist/TemplateLibrary.d.ts

@@ -0,0 +1,29 @@
+import type { CreativitySource, ConceptCombo, Hypothesis } from './types';
+/**
+ * TemplateLibrary — 本地假设生成引擎
+ *
+ * 使用方式：
+ *   1. selectBest(combo, sources) 根据来源类型选择 2-3 个最佳模板
+ *   2. fill(template, sourceA, sourceB) 填充模板内容
+ *   3. 直接 generate(combo, sources) 一站式生成 Hypothesis
+ */
+export declare class TemplateLibrary {
+    private rng;
+    constructor(seed?: number);
+    /**
+     * 为一个 ConceptCombo 生成一条假设
+     * @returns 生成的 Hypothesis，如果无适用模板则返回 null
+     */
+    generate(combo: ConceptCombo, sources: CreativitySource[]): Hypothesis | null;
+    /**
+     * 返回适用于某个类型组合的所有模板列表
+     * @param nameKey 对 source name 排序后的组合键，用于 nameFit 二次路由
+     */
+    private selectForType;
+    private typeKey;
+    /** 对 source name 排序生成 nameFit 查询键 */
+    private nameKey;
+    private stableHash;
+    /** 评分的小幅随机扰动（0-15），保持一定多样性 */
+    private scoreNoise;
+}