Brummel
72e54f4fd3
The surface-form file extension changes from .ailx to .ail. AILang's
authoring surface now uses the same .ail stem as its canonical JSON
form (.ail.json), giving the language a single coherent extension
family: .ail is the LLM-authored Form A, .ail.json is the canonical
JSON-AST Form B.
Scope (touched):
- 61 example renames examples/**/*.ailx → .ail (git mv)
- 1 rename experiments/.../rendered/ailx.md → ail.md
- 35 content-edited live-toolchain files (crates/, docs/DESIGN.md,
docs/roadmap.md, docs/PROSE_ROUNDTRIP.md, skills/, bench/reference/*.c,
experiment crates under experiments/.../{render,harness,master})
- Experiment-crate cohort rename Cohort::Ailx → Cohort::Ail,
Form::Ailx → Form::Ail, per_cohort/ailx → per_cohort/ail,
{form-only: ailx} → {form-only: ail}, ```ailx → ```ail
Out of scope (deliberately untouched, to preserve honest history):
- docs/journal-archive.md (content-frozen per CLAUDE.md)
- docs/journals/, docs/specs/, docs/plans/, bench/orchestrator-stats/
- experiments/.../runs/ (frozen LLM-output artefacts; models actually
saw .ailx — renaming would falsify the experimental record)
Verification: cargo build/test --workspace green; experiment crate
cargo test green; bench/check.py + compile_check.py + cross_lang.py
all 0-regressed; negative grep for ailx|Ailx|AILX outside the
out-of-scope paths returns zero matches.
Opens immediate follow-up: roadmap.md P2 todo `ail check`/build/run
accept .ail extension — after this rename, .ail is canonical
authoring surface but the CLI still produces a misleading JSON-parse
error on `ail check foo.ail`. That's the next iter.
57 lines
1.6 KiB
C
57 lines
1.6 KiB
C
// Hand-C reference for bench_tree_walk.
|
|
//
|
|
// Same algorithm as examples/bench_tree_walk.ail — build a balanced
|
|
// binary tree of given depth (every value = 1) and sum every node.
|
|
// Three depths: 16 / 18 / 20 (= 65535 / 262143 / 1048575 nodes).
|
|
//
|
|
// Cell layout: { long value; struct node *left; struct node *right; }
|
|
// — 24 bytes. AILang's Tree Node cell is 32 bytes (tag + value + l
|
|
// + r) due to the discriminated-union tag. The Leaf variant is also
|
|
// boxed in AILang (tag-only, ~8 bytes). For C, we use NULL pointers
|
|
// for leaves (no allocation), which is a representation choice that
|
|
// favors C; a fair-er comparison would tag leaves explicitly.
|
|
//
|
|
// Memory policy: malloc, DELIBERATELY no free. Matches AILang's
|
|
// bench_tree_walk under --alloc=rc (implicit-mode, leaks).
|
|
//
|
|
// Build: clang -O2 -o tree_walk tree_walk.c
|
|
// Expected stdout (one int per line):
|
|
// 65535
|
|
// 262143
|
|
// 1048575
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
typedef struct node {
|
|
long value;
|
|
struct node *left;
|
|
struct node *right;
|
|
} node_t;
|
|
|
|
static node_t *build_tree(long depth) {
|
|
if (depth == 0) return NULL;
|
|
node_t *n = (node_t *) malloc(sizeof(node_t));
|
|
n->value = 1;
|
|
n->left = build_tree(depth - 1);
|
|
n->right = build_tree(depth - 1);
|
|
return n;
|
|
}
|
|
|
|
static long sum_tree(const node_t *t) {
|
|
if (t == NULL) return 0;
|
|
return t->value + sum_tree(t->left) + sum_tree(t->right);
|
|
}
|
|
|
|
static void run_one(long depth) {
|
|
const node_t *t = build_tree(depth);
|
|
printf("%ld\n", sum_tree(t));
|
|
}
|
|
|
|
int main(void) {
|
|
run_one(16);
|
|
run_one(18);
|
|
run_one(20);
|
|
return 0;
|
|
}
|