mirror of
https://github.com/DeusData/codebase-memory-mcp.git
synced 2026-11-04 10:48:20 +00:00
Martin Vogel
3f5ae18852
- cbm_toon_* renamed to cbm_tree_* (the emitters have emitted tree syntax
since the format flip; the name now matches).
- format enums reduced to [tree, json], default tree; dead tree/toon flags
removed; tool RESPONSE descriptions rewritten for the grouped-tree
contract (group prefix printed once, full qn = prefix + '.' + name).
- format:'json' is now the json-stringified tree: the SAME grouped model
serialized as JSON — {total, cols, groups:[{qn_prefix, file,
rows:[[column-ordered cells]]}], has_more} for search, per-leg
{cols, groups} for trace (risk/args columns follow the flags),
query_graph's columns+rows shape already complied. Per-row key envelopes
and the legacy property blob are gone (blob-never-spills pinned by test);
requested add columns in both encodings.
- include_connected keeps the per-node-object shape (nested neighbors) —
the one remaining legacy consumer, conversion tracked.
- legacy verbose emitters deleted (bfs_to_json_array).
Full suite 6,367 passed / 0 failed; lint clean.
Signed-off-by: Martin Vogel <martin.vogel.tech@gmail.com>
55 lines
2.3 KiB
C
55 lines
2.3 KiB
C
/* compact_out.h — TOON (Token-Oriented Object Notation) emission helpers.
|
|
*
|
|
* Tool responses are consumed by LLM agents, where every byte is context
|
|
* tokens. TOON encodes the same data as JSON but declares tabular fields
|
|
* once in a header and streams rows line by line, cutting 40-60% of tokens
|
|
* on homogeneous result sets at equal-or-better retrieval accuracy
|
|
* (toonformat.dev/guide/benchmarks). Emitters here cover the subset we
|
|
* emit: scalar key-value lines and flat tables with explicit [N] lengths.
|
|
*
|
|
* Quoting: a cell/scalar is double-quoted iff it is empty, has leading or
|
|
* trailing whitespace, contains a comma, quote, newline, or CR, or would
|
|
* read as a non-string literal (true/false/null/number). Quotes and
|
|
* backslashes are escaped JSON-style; newlines become \n.
|
|
*/
|
|
#ifndef CBM_MCP_COMPACT_OUT_H
|
|
#define CBM_MCP_COMPACT_OUT_H
|
|
|
|
#include <stdbool.h>
|
|
#include <stddef.h>
|
|
|
|
/* Minimal growing string buffer (OOM-safe: sticky flag, finish returns NULL). */
|
|
typedef struct {
|
|
char *buf;
|
|
size_t len;
|
|
size_t cap;
|
|
bool oom;
|
|
} cbm_sb_t;
|
|
|
|
void cbm_sb_init(cbm_sb_t *sb);
|
|
void cbm_sb_append_n(cbm_sb_t *sb, const char *s, size_t n);
|
|
void cbm_sb_append(cbm_sb_t *sb, const char *s);
|
|
/* Returns the heap buffer (caller frees) and resets sb. NULL on OOM. */
|
|
char *cbm_sb_finish(cbm_sb_t *sb);
|
|
void cbm_sb_free(cbm_sb_t *sb);
|
|
|
|
/* `key: value` scalar lines (top-level, no indent). */
|
|
void cbm_tree_scalar_str(cbm_sb_t *sb, const char *key, const char *val);
|
|
void cbm_tree_scalar_int(cbm_sb_t *sb, const char *key, long long v);
|
|
void cbm_tree_scalar_bool(cbm_sb_t *sb, const char *key, bool v);
|
|
|
|
/* `key[n]{col1,col2,...}:` table header; rows follow at 2-space indent. */
|
|
void cbm_tree_table_header(cbm_sb_t *sb, const char *key, int n, const char *const *cols,
|
|
int ncols);
|
|
|
|
/* Row cells: call row_begin, then cell_* per column (first=true for the
|
|
* first cell), then row_end. Empty/NULL strings emit as empty cells. */
|
|
void cbm_tree_row_begin(cbm_sb_t *sb);
|
|
void cbm_tree_cell_str(cbm_sb_t *sb, const char *val, bool first);
|
|
void cbm_tree_cell_int(cbm_sb_t *sb, long long v, bool first);
|
|
void cbm_tree_cell_real(cbm_sb_t *sb, double v, bool first);
|
|
void cbm_tree_cell_bool(cbm_sb_t *sb, bool v, bool first);
|
|
void cbm_tree_row_end(cbm_sb_t *sb);
|
|
|
|
#endif /* CBM_MCP_COMPACT_OUT_H */
|