36 lines
3.4 KiB
JavaScript
36 lines
3.4 KiB
JavaScript
'use strict';
|
|
const crypto=require('node:crypto');
|
|
const {fail}=require('./validation.cjs');
|
|
const canonical=v=>Array.isArray(v)?v.map(canonical):v&&typeof v==='object'?Object.fromEntries(Object.keys(v).sort().map(k=>[k,canonical(v[k])])):v;
|
|
const digest=v=>crypto.createHash('sha256').update(JSON.stringify(canonical(v))).digest('hex');
|
|
const text=v=>v===undefined||v===null?'':String(v).trim();
|
|
function identity(value){const row=value?.sample||value?.row||value?.event||value||{};return {source:text(row.source),portalSource:text(row.portalSource),taskId:text(row.taskId)};}
|
|
function taskIdentity(value){const item=identity(value);if(!item.source||!item.taskId)fail('缺少来源和通知任务标识。',409);return digest(['notification-task',item.source,item.portalSource,item.taskId]);}
|
|
// A legacy row with no native portal source is ambiguous. Treat it as an
|
|
// overlapping namespace, never guess v4/v8 and create a second notification.
|
|
function sameTask(a,b){a=identity(a);b=identity(b);return !!a.source&&!!a.taskId&&a.source===b.source&&a.taskId===b.taskId&&(!a.portalSource||!b.portalSource||a.portalSource===b.portalSource);}
|
|
function records(store,kind,value){
|
|
const context=require('./read-context.cjs').state(store);if(!context)return store.all(kind).filter(row=>sameTask(row,value));
|
|
const key=item=>JSON.stringify([item.source,item.taskId]),index=context.index('task:'+kind,()=>{
|
|
const groups=new Map();for(const row of store.all(kind)){const item=identity(row);if(!item.source||!item.taskId)continue;const k=key(item);if(!groups.has(k))groups.set(k,[]);groups.get(k).push(row);}return groups;
|
|
});
|
|
// Keep all portal variants: a legacy row without portalSource overlaps every
|
|
// native namespace, and lookup must still reject multiple matching records.
|
|
return (index.get(key(identity(value)))||[]).filter(row=>sameTask(row,value));
|
|
}
|
|
function lookup(store,kind,value){const rows=records(store,kind,value);if(rows.length>1)fail('同一通知任务存在多条旧记录,须人工核验,禁止新建或自动合并。',409);return rows[0]||null;}
|
|
function normalize(value){const row=structuredClone(value);for(const key of ['connectionId','source','portalSource','instanceId','taskId','revision'])if(row[key]!==undefined&&row[key]!==null)row[key]=text(row[key]);if(!text(row.revision))delete row.revision;return row;}
|
|
function fingerprint(value){const row=normalize(value);delete row.connectionId;return digest(row);}
|
|
function legacyRevisionMissing(previous,incoming){
|
|
const old=previous?.sample||previous?.row||previous?.event||previous||{},next=incoming?.sample||incoming?.row||incoming?.event||incoming||{};
|
|
return !previous?.taskKey&&text(old.revision)==='0'&&!old.revisionSource&&old.reportedRevision===undefined&&!text(next.revision)&&next.reportedRevision===undefined;
|
|
}
|
|
function equivalent(previous,incoming){
|
|
const old=previous?.sample||previous?.row||previous?.event||previous;
|
|
if(fingerprint(old)===fingerprint(incoming))return true;
|
|
if(!legacyRevisionMissing(previous,incoming))return false;
|
|
const without=structuredClone(old);delete without.revision;return fingerprint(without)===fingerprint(incoming);
|
|
}
|
|
function assertUnprocessedReceipt(store,value){if(records(store,'processed-task-receipts',value).length)fail('通知任务已有处理或发送回执,禁止重复生成归档和邮件。',409);}
|
|
module.exports={identity,taskIdentity,sameTask,records,lookup,normalize,fingerprint,digest,assertUnprocessedReceipt,legacyRevisionMissing,equivalent};
|