Method selectForQuery

src/knowledge/loader.js:195–233

* Pick the most relevant knowledge notes for the given query, fitting under * the token budget. Returns an array of { name, content, relPath }.

(query, opts = {})

   * the token budget. Returns an array of { name, content, relPath }.
   */
  selectForQuery(query, opts = {}) {
    if (this.disabled) return [];
    const index = this._buildIndex();
    if (index.length === 0) return [];
    const queryTokens = this._tokenize(query);
    if (queryTokens.length === 0) return [];

    const scored = index
      .map(e => ({ e, score: this._scoreEntry(e, queryTokens) }))
      .filter(s => s.score > 0)
      .sort((a, b) => b.score - a.score);

    const maxChars = (opts.maxTokens || this.maxTokens) * 4;
    const out = [];
    let used = 0;
    for (const { e, score } of scored) {
      const body = e._bodyCache !== undefined ? e._bodyCache : (() => {
        try { return fs.readFileSync(e.path, 'utf-8'); } catch { return ''; }
      })();
      // Skip front-matter if present
      const cleaned = body.replace(/^---\n[\s\S]*?\n---\n/, '').trim();
      if (!cleaned) continue;
      // Per-entry hard cap to prevent one note swallowing the whole budget
      const truncated = cleaned.length > 1500
        ? cleaned.slice(0, 1500) + '\n[...truncated]'
        : cleaned;
      if (used + truncated.length > maxChars) {
        if (out.length === 0) {
          // Always include at least the top hit, but truncated to fit
          const fit = truncated.slice(0, Math.max(0, maxChars - 100));
          out.push({ name: e.name, content: fit, relPath: e.relPath, score });
        }
        break;
      }
      out.push({ name: e.name, content: truncated, relPath: e.relPath, score });
      used += truncated.length;
    }
    return out;
  }

  /**
   * Format selected entries as a system-prompt block. Returns '' if nothing