dsh-memory-engine 0.5.6 → 0.5.7

package/lib/render/layout.mjs

@@ -1,5 +1,7 @@
+const SEED = 20261030;
+
 export function layoutMemories(nodes) {
-  let seed = 20261030;
+  let seed = SEED;
   const random = () => ((seed = (seed * 16807) % 2147483647) - 1) / 2147483646;
   function brainPoint(radiusScale) {
     const radius = Math.pow(random(), 1 / 3) * radiusScale;
@@ -11,12 +13,49 @@ export function layoutMemories(nodes) {
       z: radius * Math.sin(phi) * Math.sin(theta) * 0.78,
     };
   }
-  return nodes.map((node) => {
+
+  const placed = nodes.map((node) => {
     const inner = ['人格', '印象', '知识'].includes(node.kind) || node.majorEmotion;
-    const distance = inner ? 14 + Math.pow(random(), 0.65) * 36 : 48 + Math.min(1, node.ageDays / 30) * 58 + random() * 12;
+    // 整体半径放大 1.35 倍：原来 298 个节点挤在一起，点谁都容易点错
+    const distance = (inner ? 14 + Math.pow(random(), 0.65) * 36 : 48 + Math.min(1, node.ageDays / 30) * 58 + random() * 12) * 1.35;
     const baseRadius = node.majorEmotion ? 3.2 : inner
       ? (node.heat === 1 ? 2.4 : node.heat === 2 ? 1.8 : 1.3)
       : (node.heat === 1 ? 2.1 : node.heat === 2 ? 1.5 : 1.0);
-    return { ...node, pos: brainPoint(distance), radius: baseRadius + Math.min(1.4, Math.sqrt(node.degree) * 0.18) };
+    // 连接数加成收敛得更紧一点，避免枢纽节点长得过大压住邻居
+    return { ...node, pos: brainPoint(distance), radius: baseRadius + Math.min(1.1, Math.sqrt(node.degree) * 0.15) };
   });
+
+  // ── 分离松弛：把互相重叠的节点推开 ──
+  // 不做这一步的话，随机落点会让相邻节点的圆重叠，视觉糊成一片，点击也分不清。
+  // 只在世界坐标里推开，不改 z 深度关系太多；迭代次数固定，保证同一份数据每次布局一致。
+  relax(placed, { iterations: 60, gap: 1.55, strength: 0.5 });
+  return placed;
+}
+
+function relax(items, { iterations, gap, strength }) {
+  if (items.length < 2) return;
+  for (let round = 0; round < iterations; round++) {
+    let moved = false;
+    for (let i = 0; i < items.length; i++) {
+      const a = items[i];
+      for (let j = i + 1; j < items.length; j++) {
+        const b = items[j];
+        const dx = b.pos.x - a.pos.x;
+        const dy = b.pos.y - a.pos.y;
+        const dz = b.pos.z - a.pos.z;
+        const dist = Math.hypot(dx, dy, dz) || 1e-6;
+        const minDist = (a.radius + b.radius) * gap;
+        if (dist >= minDist) continue;
+        // 单位向量；重合时用一个确定的、由索引决定的偏移方向，避免除零和随机抖动
+        const ux = dist > 1e-5 ? dx / dist : Math.cos(i * 2.39996);
+        const uy = dist > 1e-5 ? dy / dist : Math.sin(i * 2.39996);
+        const uz = dist > 1e-5 ? dz / dist : 0.35;
+        const push = (minDist - dist) * strength * 0.5;
+        a.pos.x -= ux * push; a.pos.y -= uy * push; a.pos.z -= uz * push;
+        b.pos.x += ux * push; b.pos.y += uy * push; b.pos.z += uz * push;
+        moved = true;
+      }
+    }
+    if (!moved) break;
+  }
 }

package/lib/render/render.mjs

@@ -121,11 +121,17 @@ function fire(id,now) {
   }
 }
 function select(x,y) {
-  let best=null,distance=Infinity;
+  // 命中判定：先按「离光标最近的节点」选，而不是「第一个框住光标的节点」。
+  // 原来要求 值<该节点半径，小节点容易被邻居抢走 → 点错。
+  // 现在给每个节点一个最小容差，再用距离减去一点半径作为打分（同样近时偏向大的那个）。
+  let best=null,bestScore=Infinity;
   for (const star of DATA.stars) {
     if (!star._screen) continue;
     const value=Math.hypot(star._screen.x-x,star._screen.y-y);
-    if (value<star._screen.r && value<distance) {best=star;distance=value;}
+    const tolerance=Math.max(14,star._screen.r*1.15);
+    if (value>tolerance) continue;
+    const score=value-star._screen.r*0.22;
+    if (score<bestScore) {bestScore=score;best=star;}
   }
   if (!best) return;
   fire(best.id,performance.now());

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "dsh-memory-engine",
-  "version": "0.5.6",
+  "version": "0.5.7",
   "description": "Local DSH memory engine with neuron network visualization and private file import",
   "keywords": [
     "dsh",