@danceiny/gotry 0.0.1-rc.10

package/dist/src/journey.js

@@ -0,0 +1,147 @@
+import { init } from 'z3-solver';
+import { hhmmToMin, minToHhmm } from './model.js';
+let z3Promise = null;
+async function getZ3() {
+    if (!z3Promise) z3Promise = (async ()=>(await init()).Context('main'))();
+    return z3Promise;
+}
+export function evaluateLeg(leg, svc) {
+    const wake = svc.depMin - leg.bufferMin - leg.originTransferMin;
+    const wakeDisplay = wake < 0 ? `${minToHhmm(wake + 1440)}(前一日)` : minToHhmm(wake);
+    const arriveStay = svc.arrMin + leg.destTransferMin;
+    const d2d = arriveStay - wake;
+    let energy;
+    if (leg.redEye && (leg.redEyeDurationMin ?? 0) > 0) {
+        const sleepH = ((leg.redEyeDurationMin ?? 0) - 60) / 60;
+        energy = Math.max(30, Math.min(75, 30 + 8 * sleepH));
+    } else {
+        energy = 100 - 2 * 8;
+        if (wake < 5 * 60) energy -= 30;
+        else if (wake < 6 * 60) energy -= 25;
+        if (arriveStay > 21 * 60) energy -= 10;
+        if (d2d > 6 * 60) energy -= 10;
+        energy = Math.max(0, energy);
+    }
+    return {
+        service: svc.id,
+        dep: minToHhmm(svc.depMin),
+        wake: wakeDisplay,
+        wakeMin: wake,
+        arrive_stay: minToHhmm(arriveStay),
+        door_to_door: `${Math.floor(d2d / 60)}h${String(d2d % 60).padStart(2, '0')}m`,
+        energy_pct: Math.round(energy),
+        price_cny: svc.priceCny
+    };
+}
+function exactlyOne(z3, sels) {
+    const { If, Sum, Int } = z3;
+    return Sum(...sels.map((s)=>If(s, Int.val(1), Int.val(0)))).eq(Int.val(1));
+}
+export async function solveJourney(req) {
+    const z3 = await getZ3();
+    const { Bool, If, Sum, Int, Solver } = z3;
+    const wakeFloor = req.wakeFloorMin ?? hhmmToMin('06:00');
+    const allSels = {};
+    const assertions = {};
+    const legSpecs = req.legs;
+    for (const leg of legSpecs){
+        const sels = leg.services.map((_, i)=>Bool.const(`${leg.id}_s${i}`));
+        allSels[leg.id] = sels;
+        const pick = (attr)=>Sum(...sels.map((s, i)=>If(s, Int.val(leg.services[i][attr]), Int.val(0))));
+        const dep = pick('depMin'), arr = pick('arrMin'), price = pick('priceCny');
+        const wake = dep.sub(Int.val(leg.bufferMin + leg.originTransferMin));
+        const arriveStay = arr.add(Int.val(leg.destTransferMin));
+        if (leg.arriveByMin !== undefined) assertions[`${leg.id}:arrive_by`] = arriveStay.le(Int.val(leg.arriveByMin));
+        if (leg.departAfterMin !== undefined) assertions[`${leg.id}:depart_after`] = dep.ge(Int.val(leg.departAfterMin));
+        if (!leg.redEye) assertions[`${leg.id}:wake_floor`] = wake.ge(Int.val(wakeFloor));
+    }
+    const total = Sum(...legSpecs.flatMap((leg)=>allSels[leg.id].map((s, i)=>If(s, Int.val(leg.services[i].priceCny), Int.val(0)))));
+    if (req.budgetCny !== undefined) assertions['total:budget'] = total.le(Int.val(req.budgetCny));
+    const coreOf = (s)=>{
+        const v = s.unsatCore();
+        const out = [];
+        for(let i = 0; i < v.length(); i++){
+            out.push(String(v.get(i)).replace(/^\|/, '').replace(/\|$/, ''));
+        }
+        return out;
+    };
+    const extract = async (model)=>{
+        const chosen = new Map();
+        for (const leg of legSpecs){
+            for(let i = 0; i < allSels[leg.id].length; i++){
+                const v = await maybeAwait(model.eval(allSels[leg.id][i], true));
+                if (String(v) === 'true') chosen.set(leg.id, leg.services[i]);
+            }
+        }
+        return chosen;
+    };
+    const s = new Solver();
+    for (const sel of Object.values(allSels))s.add(exactlyOne(z3, sel));
+    for (const [name, expr] of Object.entries(assertions))s.addAndTrack(expr, name);
+    if (String(await s.check()) !== 'unsat') {
+        const chosen = await extract(s.model());
+        const legReports = legSpecs.map((leg)=>evaluateLeg(leg, chosen.get(leg.id)));
+        const money = legReports.reduce((a, r)=>a + r.price_cny, 0);
+        const redFlags = [
+            ...legSpecs.map((leg, i)=>leg.redEye && legReports[i].energy_pct < 50 ? `${leg.id} 落地精力仅 ${legReports[i].energy_pct}%(红眼后直奔事务,当日不宜安排重要会议)` : '').filter(Boolean),
+            ...legSpecs.map((leg, i)=>!leg.redEye && legReports[i].wakeMin >= 0 && legReports[i].wakeMin < 6 * 60 ? `${leg.id} 起床 ${legReports[i].wake}(早于 6:00,生物钟代价)` : '').filter(Boolean)
+        ];
+        return {
+            feasible: true,
+            money_cny: money,
+            legs: legReports,
+            red_flags: redFlags
+        };
+    }
+    const core = coreOf(s).sort();
+    const suggestions = [];
+    for (const name of core){
+        const s2 = new Solver();
+        for (const sel of Object.values(allSels))s2.add(exactlyOne(z3, sel));
+        for (const [n2, expr] of Object.entries(assertions)){
+            if (n2 !== name) s2.addAndTrack(expr, n2);
+        }
+        if (String(await s2.check()) !== 'unsat') {
+            const chosen = await extract(s2.model());
+            const rep = legSpecs.map((leg)=>evaluateLeg(leg, chosen.get(leg.id)));
+            suggestions.push({
+                relax: name,
+                money_cny: rep.reduce((a, r)=>a + r.price_cny, 0),
+                legs: rep.map((r, i)=>({
+                        ...r,
+                        leg: legSpecs[i].id
+                    }))
+            });
+        }
+    }
+    return {
+        feasible: false,
+        unsat_core: core,
+        suggestions
+    };
+}
+async function maybeAwait(v) {
+    return v instanceof Promise ? await v : v;
+}
+export function parseFlightPackLegs(pack) {
+    const legs = pack['legs'].map((l)=>({
+            id: String(l['id']),
+            note: l['note'] ? String(l['note']) : undefined,
+            services: l['services'].map((sv)=>({
+                    id: String(sv['id']),
+                    depMin: hhmmToMin(String(sv['dep'])),
+                    arrMin: hhmmToMin(String(sv['arr'])),
+                    priceCny: Number(sv['price_cny'])
+                })),
+            bufferMin: Number(l['buffer_min']),
+            originTransferMin: Number(l['origin_transfer_min']),
+            destTransferMin: Number(l['dest_transfer_min']),
+            arriveByMin: l['arrive_by'] ? hhmmToMin(String(l['arrive_by'])) : undefined,
+            redEye: Boolean(l['red_eye']),
+            redEyeDurationMin: Number(l['red_eye_duration_min'] ?? 0)
+        }));
+    return legs;
+}
+
+
+//# sourceURL=/Users/bytedance/work/gotry/ts/src/journey.ts

package/dist/src/loop.js

@@ -0,0 +1,360 @@
+import { anythingSearch } from '../capabilities/anything.js';
+export function newState(year = 2026) {
+    return {
+        calendar: {
+            year,
+            assertedWeekdays: {}
+        },
+        profile: {},
+        gates: [],
+        wishes: []
+    };
+}
+export function interviewNext(state) {
+    const p = state.profile;
+    const questions = [];
+    const ww = p.workWindow;
+    if (!p.workWindow && !ww?.vacation) {
+        questions.push({
+            key: 'workWindow',
+            text: '你这两周要远程办公——工作时间是几点到几点、按哪个时区?这决定每天的可玩时段。',
+            why: '工作窗口直接决定每日节奏(普吉 13:00-22:00 与 9:00-18:00 是两种人生)'
+        });
+    }
+    if (!p.bookedResources) {
+        questions.push({
+            key: 'bookedResources',
+            text: '已经有订好的航班或酒店吗?(哪怕只是意向)——已订资源是硬锚点,先告诉我再规划。',
+            why: '已订资源决定哪些段不可动,Kimi 式规划会绕开它们重排'
+        });
+    }
+    if (!p.budgetTier) {
+        questions.push({
+            key: 'budgetTier',
+            text: '预算档位:经济(¥12.6k 级)/ 舒适(¥16.3k 级)/ 便利优先?',
+            why: '分层预算决定班次与住宿的选型口径',
+            options: [
+                {
+                    label: '经济',
+                    tradeOff: '省钱,接驳多走路'
+                },
+                {
+                    label: '舒适',
+                    tradeOff: 'workation 办公质量优先'
+                },
+                {
+                    label: '便利优先',
+                    tradeOff: '时间最省'
+                }
+            ]
+        });
+    }
+    return {
+        questions,
+        missing: questions.map((q)=>q.key)
+    };
+}
+export function validateSpec(spec) {
+    if (!Array.isArray(spec.segments) || spec.segments.length === 0) return '没有段(segments)';
+    for (const seg of spec.segments){
+        if (!seg.id) return '存在缺少 id 的段';
+        if (!Array.isArray(seg.options) || seg.options.length === 0) return `段 ${seg.id} 没有可选方案`;
+        for (const opt of seg.options){
+            const svcs = opt.move?.services;
+            if (!Array.isArray(svcs) || svcs.length === 0) return `段 ${seg.id} 的方案 ${opt.id} 缺少班次(services)`;
+            for (const s of svcs){
+                if (typeof s.depMin !== 'number' || typeof s.arrMin !== 'number') {
+                    return `段 ${seg.id}/${opt.id} 的班次 ${s.id ?? '?'} 缺少时刻(depMin/arrMin)`;
+                }
+            }
+        }
+    }
+    return null;
+}
+export function isComplex(state) {
+    const p = state.profile;
+    return Boolean(p.workWindow && p.bookedResources) && (state.gates.length > 0 || Boolean(state.spec));
+}
+export async function requestDeepPlanning(state) {
+    const ticket = {
+        id: `dp-${Date.now().toString(36)}`,
+        objective: '生成已验证的行程方案:全成本核算 + 动机/约束匹配 + 不失望四条',
+        requestedAt: new Date().toISOString(),
+        etaLabel: '约 1 小时(mock 期:秒级)'
+    };
+    state.gates.push({
+        id: `async-${ticket.id}`,
+        question: `深度规划已启动(${ticket.etaLabel})`,
+        options: []
+    });
+    const reply = '这趟行程跨度大(两周 workation + 三城 + 红眼返程),我切到**深度规划模式**:后台做多轮校验' + '(锚点/工作窗口/全成本/负例排查),做好后通知你。**先留一道选择题给你**,回来直接定:' + '\n1. 预算档位?(经济/舒适/便利优先)';
+    return {
+        reply,
+        ticket
+    };
+}
+export async function collectDeepPlanning(state, ticket, solve) {
+    const spec = state.spec;
+    if (!spec) return {
+        reply: '(内部状态缺失 spec——深度规划未就绪,这是不应发生的路径)',
+        state
+    };
+    state.solve = await solve(spec);
+    state.gates = state.gates.filter((g)=>!g.id.startsWith('async-'));
+    const checks = {
+        '1_承诺时间后必有明确产物': Boolean(state.solve.legs?.length || state.solve.verdicts?.length),
+        '2_产物通过自检清单': state.solve.feasible ? state.solve.legs?.every((l)=>l['energy_pct'] !== undefined) ?? false : Boolean(state.solve.unsat_core?.length),
+        '3_待决问题全部是简单选择题': state.gates.every((g)=>g.id === 'budget' || g.options.length >= 2),
+        '4_做不到的诚实说': state.solve.feasible || Boolean(state.solve.suggestions?.length)
+    };
+    const head = `# 回访交付:${ticket.objective}\n(工单 ${ticket.id},不失望四条:${Object.values(checks).every(Boolean) ? '4/4 ✅' : '有未达项 ❌'})`;
+    return {
+        reply: `${head}\n\n${renderSolve(state)}`,
+        state
+    };
+}
+export function renderSolve(state) {
+    const s = state.solve;
+    if (!s) return '(无求解结果)';
+    const lines = [];
+    if (s.feasible) {
+        lines.push(`**方案可行,机票合计 ¥${s.money_cny}**`);
+        for (const lg of s.legs ?? []){
+            const l = lg;
+            lines.push(`- ${l['leg']} ${l['service']}:${l['dep']} 起飞,${l['wake']} 出发,${l['arrive_stay']} 到,` + `门到门 ${l['door_to_door']},落地精力 ${l['energy_pct']}%,¥${l['price_cny']}`);
+        }
+        for (const e of s.work_window_exclusions ?? []){
+            lines.push(`- 已排除 ${e.option}(工作窗口):${e.reason}`);
+        }
+        for (const n of s.skeleton_notes ?? [])lines.push(`- ${n}`);
+        for (const f of s.red_flags ?? [])lines.push(`- ⚠️ ${f}`);
+    } else {
+        lines.push(`**当前约束下不可行——冲突:${(s.unsat_core ?? []).join('、')}`);
+        for (const sg of s.suggestions ?? [])lines.push(`- 放宽「${sg.relax}」可解(约 ¥${sg.money_cny})`);
+    }
+    if (state.gates.length) {
+        lines.push('', '**待你决定(选择题)**');
+        for (const g of state.gates){
+            lines.push(`- ${g.question} → ${g.options.map((o)=>o.label + (o.tradeOff ? `(${o.tradeOff})` : '')).join(' / ')}`);
+        }
+    }
+    return lines.join('\n');
+}
+export async function runTurn(state, userMsg, llm, history = [], solve = null) {
+    const facts = await llm.extractFacts([
+        ...history,
+        {
+            role: 'user',
+            text: userMsg
+        }
+    ], state);
+    const conflicts = [];
+    if (facts.calendar?.assertedWeekdays) {
+        for (const [date, wd] of Object.entries(facts.calendar.assertedWeekdays)){
+            const prev = state.calendar.assertedWeekdays[date];
+            if (prev && prev !== wd) {
+                conflicts.push(`${date}:已有断言 ${prev},新说法 ${wd}——以先断言为准,如需改请明确说`);
+            } else {
+                state.calendar.assertedWeekdays[date] = wd;
+            }
+        }
+    }
+    Object.assign(state.profile, facts.profile ?? {});
+    const { questions } = interviewNext(state);
+    const blocking = questions.filter((q)=>q.key !== 'budgetTier');
+    const budgetQ = questions.find((q)=>q.key === 'budgetTier');
+    if (budgetQ && !state.gates.some((g)=>g.id === 'budget')) {
+        state.gates.push({
+            id: 'budget',
+            question: budgetQ.text,
+            options: budgetQ.options ?? [
+                {
+                    label: '经济'
+                },
+                {
+                    label: '舒适'
+                },
+                {
+                    label: '便利优先'
+                }
+            ]
+        });
+    }
+    const parts = [];
+    if (conflicts.length) parts.push(`⚠️ 日历冲突:\n${conflicts.map((c)=>`- ${c}`).join('\n')}`);
+    const poiProbe = probePoi(userMsg);
+    if (poiProbe) {
+        const ar = await anythingSearch({
+            keyword: poiProbe
+        });
+        if (ar.verdict === 'hit' && ar.hits && ar.hits.length > 0) {
+            const top = ar.hits.slice(0, 5);
+            const lines = top.map((h, i)=>{
+                const latlng = h.latitude !== undefined && h.longitude !== undefined ? ` @ (${h.latitude.toFixed(3)},${h.longitude.toFixed(3)})` : '';
+                return `  ${i + 1}. [${h.type}] ${h.name}${latlng}`;
+            }).join('\n');
+            parts.push(`**${poiProbe} → hit (${ar.hits.length} 候选项)**\n${lines}\n${ar.evidence}`);
+        } else if (ar.verdict === 'miss') {
+            parts.push(`**${poiProbe} → miss** (酒店-be Anything 一切正常但无候选)\n${ar.evidence}`);
+        } else {
+            parts.push(`**${poiProbe} → unavailable** (${ar.error ?? 'hbcli 不可达'})\n${ar.evidence}`);
+        }
+    }
+    for (const q of blocking)parts.push(await llm.polishQuestion(q));
+    if (blocking.length === 0 && solve) {
+        const spec = await llm.extractSpec([
+            ...history,
+            {
+                role: 'user',
+                text: userMsg
+            }
+        ], state);
+        if (spec && spec.note === 'erhai-candidates') {
+            const { readFile } = await import('node:fs/promises');
+            const { join } = await import('node:path');
+            try {
+                const raw = JSON.parse(await readFile(join(import.meta.dirname, '..', '..', 'data', 'golden_erhai.json'), 'utf-8'));
+                const { parseCandidate, parseRequest } = await import('./model.js');
+                const { segmentsFromCandidate, solveChoiceSegment } = await import('./unified.js');
+                const req = parseRequest(raw['request']);
+                const cands = raw['candidates'].map(parseCandidate);
+                const erhaiSpec = segmentsFromCandidate(req, cands);
+                const result = solveChoiceSegment(erhaiSpec, req);
+                state.solve = result;
+                parts.push(result.answer_md ?? '(候选求解完成)');
+            } catch  {
+                parts.push('(洱海候选求解暂不可用——退回访谈)');
+            }
+        } else {
+            const invalid = spec ? validateSpec(spec) : '翻译器未产出 spec';
+            if (spec && !invalid) {
+                const ext = await llm.extractSlots([
+                    ...history,
+                    {
+                        role: 'user',
+                        text: userMsg
+                    }
+                ]);
+                if (ext) {
+                    const { resolveSlots, specDateMismatches } = await import('./slot-spec.js');
+                    const { buildTimeAnchor } = await import('./time-anchor.js');
+                    const mismatches = specDateMismatches(spec, resolveSlots(ext, buildTimeAnchor()));
+                    if (mismatches.length > 0) {
+                        const lines = mismatches.map((m)=>`- ${m.specAt}:翻译说 ${m.specDate},你的原话换算是 ${m.slotDate}(${m.field})`);
+                        parts.push(`⚠️ 日期分歧,确认后我再算(以你为准):\n${lines.join('\n')}`);
+                        return {
+                            reply: parts.join('\n\n'),
+                            state
+                        };
+                    }
+                }
+                state.spec = spec;
+                state.solve = await solve(spec);
+                parts.push(llm.render ? await llm.render(state) : renderSolve(state));
+            } else if (blocking.length === 0 && invalid) {
+                parts.push(`(行程骨架还不完整:${invalid}——请补充对应信息,我不猜)`);
+            }
+        }
+    } else if (blocking.length === 0) {
+        parts.push('(约束齐备——进入规划,S3 接线后此处产出方案与选择题)');
+    }
+    return {
+        reply: parts.join('\n\n'),
+        state
+    };
+}
+import { join } from 'node:path';
+import { mkdir, rename, writeFile, readFile } from 'node:fs/promises';
+import { ensureLedger, openLedgerIfExists } from './state-ledger.js';
+async function asyncDir(stateRoot) {
+    const root = stateRoot === '.' ? process.cwd() : stateRoot;
+    const dir = join(root, 'gotry-state', 'async');
+    await mkdir(dir, {
+        recursive: true
+    });
+    return dir;
+}
+async function atomicWrite(path, text) {
+    const tmp = `${path}.tmp`;
+    await writeFile(tmp, text, 'utf-8');
+    await rename(tmp, path);
+}
+export async function persistAsyncTicket(ticket, state, stateRoot = '.') {
+    const ledger = ensureLedger(stateRoot);
+    ledger.createWorkflowRun({
+        id: ticket.id,
+        goal: ticket.objective,
+        ticket,
+        state
+    });
+    const dir = await asyncDir(stateRoot);
+    const p = join(dir, `${ticket.id}.json`);
+    await atomicWrite(p, JSON.stringify({
+        ticket,
+        state
+    }, null, 2));
+    return p;
+}
+export async function loadAsyncTicket(ticketId, stateRoot = '.') {
+    const ledger = openLedgerIfExists(stateRoot);
+    const run = ledger?.getWorkflowRun(ticketId);
+    if (run) {
+        return {
+            ticket: JSON.parse(run.ticket_json),
+            state: JSON.parse(run.state_json)
+        };
+    }
+    try {
+        const p = join(await asyncDir(stateRoot), `${ticketId}.json`);
+        return JSON.parse(await readFile(p, 'utf-8'));
+    } catch  {
+        return null;
+    }
+}
+export async function settleAsyncTicket(ticketId, reply, stateRoot = '.') {
+    openLedgerIfExists(stateRoot)?.settleWorkflowRun(ticketId, reply);
+    const dir = await asyncDir(stateRoot);
+    const p = join(dir, `${ticketId}.deliverable.md`);
+    await atomicWrite(p, reply);
+    return p;
+}
+export function makeJournaledSolvePort(ledger, runId, solve, opts) {
+    return async (spec)=>{
+        const step = ledger.getWorkflowStep(runId, 'solve');
+        if (step?.status === 'done' && step.result) {
+            return JSON.parse(step.result);
+        }
+        ledger.markStepIntent(runId, 'solve');
+        opts?.onRealSolve?.();
+        const r = await solve(spec);
+        ledger.markStepDone(runId, 'solve', r);
+        return r;
+    };
+}
+export function probePoi(msg) {
+    const trimmed = msg.trim();
+    if (!trimmed) return null;
+    const cutAtPunct = (s)=>s.split(/[,，。.;；!！?？]/)[0]?.trim() ?? '';
+    const m = trimmed.match(/(查一下|查|搜|找|看看|推荐|告诉我|检索)\s*(.{2,24})/);
+    if (m?.[2]) {
+        const obj = cutAtPunct(m[2]);
+        if (obj.length >= 2) return obj.slice(0, 24);
+    }
+    if (/(酒店|民宿|客栈|饭店)/.test(trimmed)) {
+        const parts = trimmed.split(/(酒店|民宿|客栈|饭店)/);
+        const after = cutAtPunct((parts[2] ?? '').replace(/^[的:：\s]+/, ''));
+        if (after.length >= 2 && /[A-Za-z0-9]/.test(after)) return after.slice(0, 24);
+        const nounAt = trimmed.search(/(酒店|民宿|客栈|饭店)/);
+        const pre = trimmed.slice(Math.max(0, nounAt - 6), nounAt).match(/[一-龥]{2,6}$/);
+        if (pre && !/(机票|车票|和|做|订|的)$/.test(pre[0])) return pre[0];
+    }
+    const q = trimmed.match(/([一-龥a-zA-Z]{2,12})\s*(?:有什么|玩什么|有哪些)/);
+    if (q?.[1]) return q[1];
+    if (trimmed.length <= 12 && !/[,，。.;；!！?？:：]/.test(trimmed) && !/[是有在要想得到说订吧呢]/.test(trimmed)) {
+        return trimmed.slice(0, 24);
+    }
+    return null;
+}
+
+
+//# sourceURL=/Users/bytedance/work/gotry/ts/src/loop.ts

package/dist/src/memory-capture.js

@@ -0,0 +1,40 @@
+export function mergeProfile(current, patch) {
+    if (!patch) return null;
+    const base = {
+        weights: current?.weights ?? {},
+        evidence: current?.evidence ?? [],
+        hard: current?.hard ?? {}
+    };
+    const newEvidence = (patch.evidence ?? []).filter(Boolean).filter((e)=>!base.evidence.includes(e));
+    const patchWeights = patch.weights;
+    const weightsChanged = !!patchWeights && Object.keys(patchWeights).length > 0 && JSON.stringify(patchWeights) !== JSON.stringify(base.weights);
+    const hardChanged = !!patch.hard && Object.keys(patch.hard).length > 0 && JSON.stringify(patch.hard) !== JSON.stringify(base.hard);
+    if (newEvidence.length === 0 && !weightsChanged && !hardChanged) return null;
+    let weights = {
+        ...base.weights
+    };
+    if (weightsChanged && newEvidence.length > 0 && patchWeights) {
+        weights = {
+            ...weights,
+            ...patchWeights
+        };
+        const sum = Object.values(weights).reduce((a, b)=>a + b, 0);
+        if (sum > 0) for (const k of Object.keys(weights))weights[k] = Math.round(weights[k] / sum * 100) / 100;
+    }
+    return {
+        weights,
+        evidence: [
+            ...base.evidence,
+            ...newEvidence
+        ],
+        hard: hardChanged ? {
+            ...base.hard,
+            ...patch.hard ?? {}
+        } : {
+            ...base.hard
+        }
+    };
+}
+
+
+//# sourceURL=/Users/bytedance/work/gotry/ts/src/memory-capture.ts

package/dist/src/memory-decay.js

@@ -0,0 +1,31 @@
+export function windowFactor(ageDays) {
+    if (ageDays <= 30) return 1.0;
+    if (ageDays <= 90) return 0.75;
+    if (ageDays <= 180) return 0.5;
+    if (ageDays <= 365) return 0.25;
+    return 0.1;
+}
+export const KIND_WEIGHT = {
+    recalled: 0.25,
+    applied: 0.5,
+    verified_outcome: 1.0
+};
+export function ageDaysOf(ts, now) {
+    const then = new Date(ts).getTime();
+    if (Number.isNaN(then)) return Number.POSITIVE_INFINITY;
+    return Math.max(0, (now.getTime() - then) / 86_400_000);
+}
+export function eventDecayScore(ev, now) {
+    const w = KIND_WEIGHT[ev.kind] ?? 0;
+    return round4(w * windowFactor(ageDaysOf(ev.ts, now)));
+}
+export function decayedConfidence(events, now) {
+    const sum = events.reduce((acc, ev)=>acc + eventDecayScore(ev, now), 0);
+    return round4(Math.min(1, sum));
+}
+function round4(x) {
+    return Math.round(x * 10_000) / 10_000;
+}
+
+
+//# sourceURL=/Users/bytedance/work/gotry/ts/src/memory-decay.ts

package/dist/src/memory-utility.js

@@ -0,0 +1,55 @@
+export function makeEventId(ev) {
+    return [
+        ev.wish_id,
+        ev.kind,
+        ev.ctx ?? '',
+        ev.attribution ?? ''
+    ].join('|');
+}
+export function appendEvent(events, ev) {
+    const full = {
+        schema: 'memory_utility_observation.v0',
+        event_id: makeEventId(ev),
+        ...ev
+    };
+    if (events.some((e)=>e.event_id === full.event_id)) return {
+        events,
+        appended: false
+    };
+    if (ev.kind === 'verified_outcome' && !ev.attribution) {
+        return appendEvent(events, {
+            ...ev,
+            kind: 'applied'
+        });
+    }
+    return {
+        events: [
+            ...events,
+            full
+        ],
+        appended: true
+    };
+}
+export function projectUtility(events) {
+    const out = {};
+    for (const ev of events){
+        const w = out[ev.wish_id] ??= {
+            wish_id: ev.wish_id,
+            status: 'unknown',
+            recalled: 0,
+            applied: 0,
+            verified: 0
+        };
+        if (ev.kind === 'recalled') w.recalled++;
+        if (ev.kind === 'applied') w.applied++;
+        if (ev.kind === 'verified_outcome') {
+            w.verified++;
+            if (ev.attribution) w.status = ev.attribution;
+        }
+        w.last_event_ts = ev.ts;
+    }
+    return out;
+}
+
+
+//# sourceURL=/Users/bytedance/work/gotry/ts/src/memory-utility.ts