@andespindola/brainlink 0.1.0-beta.136 → 0.1.0-beta.137

package/dist/application/frontend/client-js.js

@@ -89,6 +89,7 @@ const state = {
   lastHoverHitAt: 0,
   lastManualZoomAt: 0,
   lastZoomFocus: { x: 0, y: 0, at: 0 },
+  leafFocusRootNodeId: null,
   hierarchyFocusGroupId: null,
   hierarchyFocusStack: [],
   hierarchyRevealFocusGroupId: null,
@@ -1337,6 +1338,68 @@ const arrangeChildGraphNodes = (nodes, group, origin = group) => {
   return arranged
 }
 
+const projectNodesIntoChildGraph = (nodes, focusRenderNode, group) => {
+  if (nodes.length <= 1) {
+    return nodes.map(node => ({ ...node, x: focusRenderNode.x, y: focusRenderNode.y }))
+  }
+
+  let minX = Number.POSITIVE_INFINITY
+  let maxX = Number.NEGATIVE_INFINITY
+  let minY = Number.POSITIVE_INFINITY
+  let maxY = Number.NEGATIVE_INFINITY
+
+  for (let index = 0; index < nodes.length; index += 1) {
+    const node = nodes[index]
+    minX = Math.min(minX, node.x)
+    maxX = Math.max(maxX, node.x)
+    minY = Math.min(minY, node.y)
+    maxY = Math.max(maxY, node.y)
+  }
+
+  const centerX = (minX + maxX) / 2
+  const centerY = (minY + maxY) / 2
+  const spanX = Math.max(1, maxX - minX)
+  const spanY = Math.max(1, maxY - minY)
+  const targetDiameter = Math.max(1, childGraphRenderRadius(group) * 2 * 0.9)
+  const scale = targetDiameter / Math.max(spanX, spanY)
+
+  return nodes.map(node => ({
+    ...node,
+    x: focusRenderNode.x + (node.x - centerX) * scale,
+    y: focusRenderNode.y + (node.y - centerY) * scale
+  }))
+}
+
+const recursiveLeafSubgraphNodes = (rootNodeId, maxNodes = renderNodeBudget) => {
+  const root = state.nodeById.get(rootNodeId)
+  if (!root) {
+    return []
+  }
+
+  const visited = new Set([rootNodeId])
+  const queue = [rootNodeId]
+
+  while (queue.length > 0 && visited.size < maxNodes) {
+    const currentId = queue.shift()
+    const edges = [...(state.visibleEdgeByNode.get(currentId) ?? [])]
+      .filter(edge => edge.target)
+      .sort((left, right) => edgeWeight(right) - edgeWeight(left))
+    for (let edgeIndex = 0; edgeIndex < edges.length && visited.size < maxNodes; edgeIndex += 1) {
+      const edge = edges[edgeIndex]
+      const nextId = edge.source === currentId ? edge.target : edge.source
+      if (!nextId || visited.has(nextId) || !state.nodeById.has(nextId)) {
+        continue
+      }
+      visited.add(nextId)
+      queue.push(nextId)
+    }
+  }
+
+  return [...visited]
+    .map(id => state.nodeById.get(id))
+    .filter(Boolean)
+}
+
 const arrangeChildGroupNodes = (groups, parentGroup, origin) => {
   if (groups.length <= 1) {
     return groups.map(group => ({
@@ -1502,6 +1565,7 @@ const updateHierarchyFocusGroup = (groups, _viewport) => {
       state.selected = null
     }
   }
+  state.leafFocusRootNodeId = null
   state.hierarchyFocusGroupId = null
   return null
 }
@@ -1622,12 +1686,23 @@ const computeHierarchyRenderVisibility = (viewport) => {
   const focusChildGroups = focus.childGroupIds
     .map(groupId => state.groupById.get(groupId))
     .filter(Boolean)
+  if (focusChildGroups.length > 0) {
+    state.leafFocusRootNodeId = null
+  } else if (state.leafFocusRootNodeId && !focusIds.has(state.leafFocusRootNodeId)) {
+    state.leafFocusRootNodeId = null
+  }
   const childTargetLimit = Math.min(renderNodeBudget, Math.max(1, Math.floor(renderNodeBudget * revealProgress)))
   const childLimit = updateHierarchyChildRevealBudget(focus.id, childTargetLimit)
   const focusRenderNode = groupNodes.find(node => node.groupId === focus.id) ?? createGroupRenderNode(focus)
-  const arrangedChildren = focusChildGroups.length > 0
-    ? arrangeChildGroupNodes(focusChildGroups, focus, focusRenderNode)
-    : arrangeChildGraphNodes(rawChildNodes, focus, focusRenderNode)
+  const arrangedChildren = (() => {
+    if (focusChildGroups.length > 0) {
+      return arrangeChildGroupNodes(focusChildGroups, focus, focusRenderNode)
+    }
+    const recursiveNodes = state.leafFocusRootNodeId
+      ? recursiveLeafSubgraphNodes(state.leafFocusRootNodeId, renderNodeBudget)
+      : rawChildNodes
+    return projectNodesIntoChildGraph(recursiveNodes, focusRenderNode, focus)
+  })()
   const childNodes = selectStableSampleNodes(arrangedChildren, childLimit)
     .map(node => interpolateNodeFromGroup(node, focusRenderNode, revealProgress))
   const childIds = new Set(childNodes.map(node => node.id))
@@ -2121,6 +2196,7 @@ const fitView = (options = { useFiltered: true, preferHubCenter: true }) => {
 const resetView = () => fitView({ useFiltered: false, preferHubCenter: false })
 
 const resetHierarchyFocus = () => {
+  state.leafFocusRootNodeId = null
   state.hierarchyFocusGroupId = null
   state.hierarchyFocusStack = []
   state.hierarchyRevealFocusGroupId = null
@@ -3128,6 +3204,22 @@ const expandGroupNode = node => {
   }
 }
 
+const expandLeafNodeGraph = node => {
+  if (!node || node.isGroupNode) return
+  state.selected = node
+  state.leafFocusRootNodeId = node.id
+  state.zoomTransition = {
+    active: true,
+    source: 'group',
+    screenX: state.viewport.width / 2,
+    screenY: state.viewport.height / 2,
+    worldX: node.x,
+    worldY: node.y,
+    targetScale: clampScale(Math.max(state.transform.scale * 1.08, hierarchyMicroExitScale * 1.02))
+  }
+  state.lastZoomFocus = { x: node.x, y: node.y, at: performance.now() }
+  markRenderDirty()
+}
 const handleGroupNodePrimaryClick = node => {
   if (!node?.isGroupNode) return
   const alreadyFocused = state.selected?.isGroupNode && state.selected.groupId === node.groupId
@@ -3138,8 +3230,19 @@ const handleGroupNodePrimaryClick = node => {
   expandGroupNode(node)
 }
 
+const handleLeafNodePrimaryClick = node => {
+  if (!node || node.isGroupNode) return
+  const sameFocusedNode = state.leafFocusRootNodeId === node.id
+  if (!sameFocusedNode) {
+    expandLeafNodeGraph(node)
+    return
+  }
+  selectNode(node, { openContent: true })
+}
+
 const selectNode = (node, options = { openContent: false }) => {
   if (!node) {
+    state.leafFocusRootNodeId = null
     state.selected = null
     if (elements.contentDialog.open) {
       elements.contentDialog.close()
@@ -3376,6 +3479,8 @@ const bindEvents = () => {
       const clickedNode = draggedNode ?? state.hovered
       if (clickedNode?.isGroupNode) {
         handleGroupNodePrimaryClick(clickedNode)
+      } else if (clickedNode && state.hierarchyFocusGroupId) {
+        handleLeafNodePrimaryClick(clickedNode)
       } else {
         selectNode(clickedNode, { openContent: true })
       }
@@ -3465,6 +3570,7 @@ const loadGraph = async (options = { reset: false }) => {
   state.graph = graph
   state.nodes = layout.nodes
   state.groups = layout.groups
+  state.leafFocusRootNodeId = null
   state.hierarchyFocusGroupId = null
   state.hierarchyFocusStack = []
   state.hierarchyRevealFocusGroupId = null

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@andespindola/brainlink",
-  "version": "0.1.0-beta.136",
+  "version": "0.1.0-beta.137",
   "description": "Local-first knowledge memory for agents with Markdown, backlinks, indexing and context retrieval.",
   "type": "module",
   "license": "MIT",