| LOW | gates/_lib.ts | 1 | // Shared by the gates: local and cluster exec (ssh through the bastion's | COMMENT |
| LOW | gates/ping.ts | 1 | #!/usr/bin/env bun | COMMENT |
| LOW | gates/ping.ts | 21 | // the command's own; a dead origin costs one run under four seconds; bend | COMMENT |
| LOW | gates/_run.ts | 1 | #!/usr/bin/env bun | COMMENT |
| LOW | gates/repo.ts | 1 | #!/usr/bin/env bun | COMMENT |
| LOW | gates/test.ts | 1 | #!/usr/bin/env bun | COMMENT |
| LOW | gates/safe.ts | 1 | #!/usr/bin/env bun | COMMENT |
| LOW | gates/perf.ts | 1 | #!/usr/bin/env bun | COMMENT |
| LOW | bench/runtime/tree-matmul/main.c | 1 | // Native C twin of main.bend: recursive block matrix multiply over | COMMENT |
| LOW | bench/runtime/nbody/main.c | 1 | // Native C translation of main.bend: chaotic three-body ensemble, | COMMENT |
| LOW | bench/runtime/raytrace/main.ts | 1 | // Single-threaded TypeScript twin of main.bend. | COMMENT |
| LOW | bench/runtime/raytrace/main.c | 1 | // Single-threaded C twin of main.bend. Same | COMMENT |
| LOW | bench/runtime/lexer/main.c | 1 | // Native C twin of main.bend: same generator (the template expanded | COMMENT |
| LOW | bench/runtime/tree-radix/main.c | 1 | // Native C twin of main.bend: same trie sort (gen -> to_map/merge | COMMENT |
| LOW | bench/runtime/symreg/main.c | 1 | // Single-threaded C twin of main.bend. Same | COMMENT |
| LOW | bench/runtime/merkle/main.c | 1 | // Native C twin of main.bend: same Speck32/64 leaf stream, Merkle | COMMENT |
| LOW | bench/runtime/hashmap/main.c | 1 | // Native C twin of main.bend: a hash table with separate chaining | COMMENT |
| LOW | bench/runtime/bfs/main.c | 1 | // Native C twin of main.bend: breadth-first search over 2^DEPTH | COMMENT |
| LOW | bench/runtime/editdist/main.c | 1 | // Native C twin of main.bend: Levenshtein edit distance by dynamic | COMMENT |
| LOW | bench/runtime/tree-bitonic/main.c | 1 | // Native C twin of main.bend: same tree-shaped bitonic sorting | COMMENT |
| LOW | bench/runtime/queens/main.c | 1 | // Single-threaded C twin of main.bend. Same algorithm, same shape: | COMMENT |
| LOW | bench/runtime/histogram/main.c | 1 | // Native C twin of main.bend: a histogram of R fresh batches of 2^D keys | COMMENT |
| LOW | bend2/bend.ts | 1 | // NOTE: this file was 99% human-designed and audited. | COMMENT |
| LOW | bend2/bend.ts | 21 | // Term ::= | COMMENT |
| LOW | bend2/bend.ts | 41 | // | COMMENT |
| LOW | bend2/bend.ts | 61 | // Arrow | A "->" B | @_:A -> B | COMMENT |
| LOW | bend2/bend.ts | 81 | // is, import, Type, Data, Kind, Quant ("as" reads only on an import | COMMENT |
| LOW | bend2/bend.ts | 101 | // right-associative; the domain of a written @ or & binder stops at the | COMMENT |
| LOW | bend2/bend.ts | 121 | // ">"-headed operator never fires -- space your comparisons and | COMMENT |
| LOW | bend2/bend.ts | 141 | // Do-Notation | COMMENT |
| LOW | bend2/bend.ts | 161 | // ------ | COMMENT |
| LOW | bend2/bend.ts | 181 | // (Atkey scales the argument's measure by the binder's ω), and a | COMMENT |
| LOW | bend2/bend.ts | 201 | // Data fits every kind, every kind fits Type and Kind(&0), and a meet | COMMENT |
| LOW | bend2/bend.ts | 221 | // equality is intensional; elimination is the J axiom, %e@E : P; f, | COMMENT |
| LOW | bend2/bend.ts | 2641 | continue; | COMMENT |
| LOW | bend2/bend.ts | 2841 | // field) becomes a share Var: index -1, its value the raw term; the | COMMENT |
| LOW | bend2/bend.ts | 3101 | } | COMMENT |
| LOW | bend2/bend.ts | 3261 | } | COMMENT |
| LOW | bend2/bend.ts | 3341 | return term_infer(book, lhs, term_force(tm), qt, ctx, d, sp); | COMMENT |
| LOW | bend2/bend.ts | 3441 | // where a is dead if q is -, and consumed once otherwise: its | COMMENT |
| LOW | bend2/bend.ts | 3641 | // as the constructor it is | COMMENT |
| LOW | bend2/bend.ts | 3841 | // its event (a law: type checked at its law, defined at its fill), so | COMMENT |
| LOW | bend2/safe.ts | 1 | // Safe | COMMENT |
| LOW | bend2/safe.ts | 21 | // which ends in λ{(): ..; λ{}}. A default arm binds the tag and the | COMMENT |
| LOW | bend2/safe.ts | 261 | const ws = ns.flatMap(why); | COMMENT |
| LOW | bend2/safe.ts | 1201 | // Group | COMMENT |
| LOW | bend2/comp.ts | 3181 | #elif !BEND_RTC | COMMENT |
| LOW | bend2/comp.ts | 3201 | #include <sys/select.h> | COMMENT |
| LOW | bend2/comp.ts | 3221 | // preserve_* attributes need clang 19+ and an optimized build. A segment is | COMMENT |
| LOW | bend2/comp.ts | 3241 | #else | COMMENT |
| LOW | bend2/comp.ts | 3261 | #endif | COMMENT |
| LOW | bend2/comp.ts | 3281 | #else | COMMENT |
| LOW | bend2/comp.ts | 3361 | | COMMENT |
| LOW | bend2/comp.ts | 3381 | #define CUBE_T 128 | COMMENT |
| LOW | bend2/comp.ts | 3401 | #define H_BUMP 0 | COMMENT |
| LOW | bend2/comp.ts | 3481 | #define fid_arity(x) FID_T[x].ar | COMMENT |
| LOW | bend2/comp.ts | 3541 | #endif | COMMENT |
| LOW | bend2/comp.ts | 4341 | // Work | COMMENT |
| LOW | bend2/comp.ts | 5181 | } | COMMENT |
| LOW | bend2/comp.ts | 5361 | return rv[0]; | COMMENT |
| 9 more matches not shown… |
Adjusted legacy signal; badge bands: 25 / 50 / 75 (different from dashboard bands).