dsh-code 1.0.5 → 1.0.6

package/src/render/export.ts

@@ -7,7 +7,7 @@
  */
 
 import { assertNever } from '@deepseek-ai/dsh-util-values'
-import { imageLabels, type TranscriptView } from './projection.ts'
+import { fileLabels, imageLabels, type TranscriptView } from './projection.ts'
 
 /**
  * Render the transcript as a standalone markdown document.
@@ -15,6 +15,10 @@ import { imageLabels, type TranscriptView } from './projection.ts'
  * @param sessionId - the full session identity for the header.
  * @returns the complete markdown text.
  */
+/** Both user and queued rows export the same attachment label block. */
+const attachmentLabels = (entry: { images?: readonly unknown[]; files?: readonly unknown[] }): string =>
+  [imageLabels(entry.images as never), fileLabels(entry.files as never)].filter(label => label !== '').join('\n')
+
 export function buildExportMarkdown(view: TranscriptView, sessionId: string): string {
   const out: string[] = [
     view.title === ''
@@ -23,13 +27,19 @@ export function buildExportMarkdown(view: TranscriptView, sessionId: string): st
     `> session ${sessionId}`,
     '',
   ]
+  // The effective system prompt (v3 surface nodes) heads the export in a
+  // collapsed block: visible when audited, out of the way when scrolled.
+  if (view.systemPrompt !== '') {
+    out.push('<details><summary>system prompt</summary>', '', view.systemPrompt, '', '</details>', '')
+  }
   for (const entry of view.entries) {
     switch (entry.kind) {
       case 'user':
         if (entry.notice) {
           out.push(`> ⤷ context: ${entry.text}`, '')
         } else {
-          out.push('## user', '', entry.text, ...(imageLabels(entry.images) === '' ? [] : [imageLabels(entry.images)]), '')
+          const attachments = attachmentLabels(entry)
+          out.push('## user', '', entry.text, ...(attachments === '' ? [] : [attachments]), '')
         }
         break
       case 'assistant':
@@ -68,7 +78,7 @@ export function buildExportMarkdown(view: TranscriptView, sessionId: string): st
         break
       case 'pending':
         // Codex PendingSteer: queued prompts export like ordinary user rows.
-        out.push('## user', '', entry.text, ...(imageLabels(entry.images) === '' ? [] : [imageLabels(entry.images)]), '')
+        out.push('## user', '', entry.text, ...(attachmentLabels(entry) === '' ? [] : [attachmentLabels(entry)]), '')
         break
       default:
         assertNever(entry, 'transcript entry kind')

package/src/render/fuzzy.ts

@@ -0,0 +1,83 @@
+/**
+ * Shared fuzzy ranking for `/` and `@` menu candidates: the query must be a
+ * case-insensitive ordered subsequence of the candidate name. Prefix hits
+ * rank first, then the strongest alignment score, then the source order of
+ * the input. Ported from the upstream web client's ui-primitives
+ * (rank-by-name.ts) so the terminal matches the web menu's discovery feel;
+ * the algorithm is unchanged, only the module's home moved.
+ *
+ * @module @deepseek-ai/dsh-code/render/fuzzy
+ */
+
+/** One match with its stable source position. */
+interface Ranked<T> {
+  readonly item: T
+  readonly index: number
+  readonly prefix: boolean
+  readonly score: number
+}
+
+/** Extra weight for name starts and separator boundaries. */
+function boundaryBonus(name: string, index: number): number {
+  return index === 0 || name.charAt(index - 1) === '-' || name.charAt(index - 1) === '_' ? 8 : 0
+}
+
+/**
+ * Score the strongest ordered-subsequence alignment in O(name × query).
+ * Boundary and adjacent matches earn weight; skipped and leading characters
+ * cost weight. Undefined when the query is not a subsequence of the name.
+ */
+function alignmentScore(name: string, query: string): number | undefined {
+  if (query.length > name.length) return undefined
+  const noMatch = Number.NEGATIVE_INFINITY
+  let previous = Array<number>(name.length).fill(noMatch)
+  for (let index = 0; index < name.length; index++) {
+    if (name.charAt(index) === query.charAt(0)) previous[index] = 1 + boundaryBonus(name, index) - index
+  }
+  for (let queryIndex = 1; queryIndex < query.length; queryIndex++) {
+    const current = Array<number>(name.length).fill(noMatch)
+    // Sweep the previous row once: `left` is its score one character back
+    // (the adjacent continuation), `leftLeft` two back (the earliest gapped one).
+    let left = noMatch
+    let leftLeft = noMatch
+    let bestGapped = noMatch
+    for (const [index, prior] of previous.entries()) {
+      if (leftLeft !== noMatch) bestGapped = Math.max(bestGapped, leftLeft + index - 2)
+      if (name.charAt(index) === query.charAt(queryIndex)) {
+        const bonus = 1 + boundaryBonus(name, index)
+        let score = noMatch
+        if (left !== noMatch) score = left + bonus + 4
+        if (bestGapped !== noMatch) score = Math.max(score, bestGapped + bonus + 1 - index)
+        current[index] = score
+      }
+      leftLeft = left
+      left = prior
+    }
+    previous = current
+  }
+  let best = noMatch
+  for (const score of previous) best = Math.max(best, score)
+  return best === noMatch ? undefined : best
+}
+
+/**
+ * Rank named items by a menu query.
+ * @param items - candidates in source order (the caller's composition order
+ * is the final tie-breaker, e.g. local commands before registry entries).
+ * @param rawQuery - the text typed after the trigger, matched case-insensitively.
+ * @returns the matching items: prefix hits first, then by alignment score,
+ * then in source order. The input list itself for an empty query.
+ */
+export function rankByName<T extends { readonly name: string }>(items: readonly T[], rawQuery: string): readonly T[] {
+  const query = rawQuery.toLowerCase()
+  if (query === '') return items
+  const ranked: Ranked<T>[] = []
+  items.forEach((item, index) => {
+    const name = item.name.toLowerCase()
+    const score = alignmentScore(name, query)
+    if (score !== undefined) ranked.push({ item, index, prefix: name.startsWith(query), score })
+  })
+  ranked.sort((left, right) =>
+    Number(right.prefix) - Number(left.prefix) || right.score - left.score || left.index - right.index)
+  return ranked.map(match => match.item)
+}