|
| 1 | +# Mega parametric — maximum-coverage table-driven tests. |
| 2 | + |
| 3 | +fn assert_eq(actual, expected, msg) { |
| 4 | + if actual != expected { |
| 5 | + test_record_failure(msg + ": expected " + to_string(expected) + " got " + to_string(actual)); |
| 6 | + } |
| 7 | +} |
| 8 | + |
| 9 | +fn assert_true(cond, msg) { if !cond { test_record_failure(msg); } } |
| 10 | + |
| 11 | +# Verify omc_help on every documented builtin returns non-null dict. |
| 12 | +fn test_help_on_all_documented() { |
| 13 | + h names = omc_list_builtins(); |
| 14 | + h i = 0; |
| 15 | + h failures = 0; |
| 16 | + while i < arr_len(names) { |
| 17 | + h n = arr_get(names, i); |
| 18 | + h hd = omc_help(n); |
| 19 | + if str_len(dict_get(hd, "signature")) == 0 { failures = failures + 1; } |
| 20 | + i = i + 1; |
| 21 | + } |
| 22 | + assert_eq(failures, 0, "every builtin has help"); |
| 23 | +} |
| 24 | + |
| 25 | +# Categories list expected ones |
| 26 | +fn test_known_categories_present() { |
| 27 | + h must_have = ["arrays", "dicts", "strings", "math", "substrate", |
| 28 | + "autograd", "tokenizer", "code_intel", "introspection", |
| 29 | + "ml_kernels", "regex", "json", "stdlib", "generators", |
| 30 | + "duals", "exceptions"]; |
| 31 | + h cats = omc_categories(); |
| 32 | + h i = 0; |
| 33 | + while i < arr_len(must_have) { |
| 34 | + h target = arr_get(must_have, i); |
| 35 | + h found = 0; |
| 36 | + h j = 0; |
| 37 | + while j < arr_len(cats) { |
| 38 | + if arr_get(cats, j) == target { found = 1; } |
| 39 | + j = j + 1; |
| 40 | + } |
| 41 | + assert_eq(found, 1, concat_many("category ", target, " present")); |
| 42 | + i = i + 1; |
| 43 | + } |
| 44 | +} |
| 45 | + |
| 46 | +# is_attractor on first 50 integers (with expected attractors). |
| 47 | +fn test_is_attractor_first_50() { |
| 48 | + h fibs = [0, 1, 2, 3, 5, 8, 13, 21, 34]; |
| 49 | + h i = 0; |
| 50 | + while i < 50 { |
| 51 | + h is_fib = 0; |
| 52 | + h j = 0; |
| 53 | + while j < arr_len(fibs) { |
| 54 | + if arr_get(fibs, j) == i { is_fib = 1; } |
| 55 | + j = j + 1; |
| 56 | + } |
| 57 | + assert_eq(is_attractor(i), is_fib, |
| 58 | + concat_many("is_attractor(", to_string(i), ")")); |
| 59 | + i = i + 1; |
| 60 | + } |
| 61 | +} |
| 62 | + |
| 63 | +# Resonance is 1.0 on every Fibonacci up to 89 |
| 64 | +fn test_resonance_on_all_fibs() { |
| 65 | + h fibs = [0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]; |
| 66 | + h r = arr_resonance_vec(fibs); |
| 67 | + h i = 0; |
| 68 | + while i < arr_len(r) { |
| 69 | + h v = arr_get(r, i); |
| 70 | + h diff = v - 1.0; |
| 71 | + if diff < 0.0 { diff = 0.0 - diff; } |
| 72 | + assert_true(diff < 0.001, |
| 73 | + concat_many("res ", to_string(arr_get(fibs, i)), " ≈ 1")); |
| 74 | + i = i + 1; |
| 75 | + } |
| 76 | +} |
| 77 | + |
| 78 | +# Token encode/decode for 30 different snippets |
| 79 | +fn test_token_roundtrip_30() { |
| 80 | + h corpus = [ |
| 81 | + "h x = 1;", |
| 82 | + "h y = 2;", |
| 83 | + "h z = 3;", |
| 84 | + "fn f() {}", |
| 85 | + "fn g() {}", |
| 86 | + "fn h() {}", |
| 87 | + "arr_get(xs, 0)", |
| 88 | + "arr_set(xs, 0, 1)", |
| 89 | + "dict_get(d, \"k\")", |
| 90 | + "dict_set(d, \"k\", 1)", |
| 91 | + "is_attractor(8)", |
| 92 | + "attractor_distance(7)", |
| 93 | + "arr_resonance_vec([1,2,3])", |
| 94 | + "tape_reset();", |
| 95 | + "tape_var(0.0)", |
| 96 | + "tape_backward(loss)", |
| 97 | + "tape_grad(x)", |
| 98 | + "omc_help(\"name\")", |
| 99 | + "omc_explain_error(\"msg\")", |
| 100 | + "omc_code_canonical(src)", |
| 101 | + "omc_token_encode(s)", |
| 102 | + "omc_token_decode(ids)", |
| 103 | + "if x > 0 { return 1; }", |
| 104 | + "while i < n { i = i + 1; }", |
| 105 | + "for v in xs { print(v); }", |
| 106 | + "h sum = arr_sum_int(xs);", |
| 107 | + "h len = arr_len(xs);", |
| 108 | + "arr_softmax([1.0, 2.0])", |
| 109 | + "try { throw 1; } catch e { return e; }", |
| 110 | + "class P { x; y; }", |
| 111 | + ]; |
| 112 | + h i = 0; |
| 113 | + while i < arr_len(corpus) { |
| 114 | + h c = arr_get(corpus, i); |
| 115 | + h back = omc_token_decode(omc_token_encode(c)); |
| 116 | + assert_eq(back, c, concat_many("rt[", to_string(i), "]")); |
| 117 | + i = i + 1; |
| 118 | + } |
| 119 | +} |
| 120 | + |
| 121 | +# Explain-error matches for 12 distinct runtime errors |
| 122 | +fn test_explain_12_errors() { |
| 123 | + h cases = [ |
| 124 | + "Undefined function: foo", |
| 125 | + "arr_get: index 5 out of bounds (len 3)", |
| 126 | + "arr_set: index 99 out of bounds (len 3)", |
| 127 | + "dict_get: first argument must be a dict", |
| 128 | + "arr_matmul: shape mismatch — A is 2x3, B is 5x2", |
| 129 | + "Expected Semicolon, got LParen", |
| 130 | + "Expected identifier, got Harmonic", |
| 131 | + "division by zero", |
| 132 | + "stack overflow", |
| 133 | + "json_parse failed", |
| 134 | + "ragged 2D array", |
| 135 | + "row-broadcast length mismatch", |
| 136 | + ]; |
| 137 | + h i = 0; |
| 138 | + while i < arr_len(cases) { |
| 139 | + h ex = omc_explain_error(arr_get(cases, i)); |
| 140 | + assert_eq(dict_get(ex, "matched"), 1, |
| 141 | + concat_many("err ", to_string(i), " matched")); |
| 142 | + i = i + 1; |
| 143 | + } |
| 144 | +} |
| 145 | + |
| 146 | +# Did_you_mean on 8 typos finds the right one |
| 147 | +fn test_did_you_mean_8_typos() { |
| 148 | + h typos = [ |
| 149 | + ["arr_softmx", "arr_softmax"], |
| 150 | + ["arr_le", "arr_len"], |
| 151 | + ["tape_bckward", "tape_backward"], |
| 152 | + ["omc_hep", "omc_help"], |
| 153 | + ["dict_st", "dict_set"], |
| 154 | + ["str_lne", "str_len"], |
| 155 | + ["is_attractr", "is_attractor"], |
| 156 | + ["arr_softmaxx", "arr_softmax"], |
| 157 | + ]; |
| 158 | + h i = 0; |
| 159 | + while i < arr_len(typos) { |
| 160 | + h pair = arr_get(typos, i); |
| 161 | + h suggestions = omc_did_you_mean(arr_get(pair, 0)); |
| 162 | + h has = 0; |
| 163 | + h j = 0; |
| 164 | + while j < arr_len(suggestions) { |
| 165 | + if arr_get(suggestions, j) == arr_get(pair, 1) { has = 1; } |
| 166 | + j = j + 1; |
| 167 | + } |
| 168 | + assert_eq(has, 1, |
| 169 | + concat_many("typo ", to_string(i), " → ", arr_get(pair, 1))); |
| 170 | + i = i + 1; |
| 171 | + } |
| 172 | +} |
| 173 | + |
| 174 | +# Help_brief / signature / category extracted properly for many builtins. |
| 175 | +fn test_quick_help_30() { |
| 176 | + h names = ["arr_get", "arr_set", "arr_push", "arr_len", "arr_softmax", |
| 177 | + "arr_matmul", "arr_transpose", "dict_get", "dict_set", |
| 178 | + "dict_has", "str_len", "str_split", "str_join", |
| 179 | + "is_attractor", "attractor_distance", "arr_resonance_vec", |
| 180 | + "tape_var", "tape_const", "tape_add", "tape_mul", |
| 181 | + "tape_backward", "tape_grad", "omc_help", "omc_explain_error", |
| 182 | + "omc_code_canonical", "omc_code_equivalent", "omc_token_encode", |
| 183 | + "omc_token_decode", "sha256", "base64_encode"]; |
| 184 | + h i = 0; |
| 185 | + while i < arr_len(names) { |
| 186 | + h n = arr_get(names, i); |
| 187 | + h sig = omc_help_signature(n); |
| 188 | + assert_true(str_len(sig) > 0, |
| 189 | + concat_many(n, " has sig")); |
| 190 | + i = i + 1; |
| 191 | + } |
| 192 | +} |
| 193 | + |
| 194 | +# Each unique builtin's category is a known string. |
| 195 | +fn test_unique_categories_known() { |
| 196 | + h known_cats = ["substrate", "autograd", "tokenizer", "code_intel", |
| 197 | + "generators", "llm_workflow", "introspection", |
| 198 | + "ml_kernels"]; |
| 199 | + h unique = omc_unique_builtins(); |
| 200 | + h i = 0; |
| 201 | + while i < arr_len(unique) { |
| 202 | + h cat = omc_help_category(arr_get(unique, i)); |
| 203 | + h is_known = 0; |
| 204 | + h j = 0; |
| 205 | + while j < arr_len(known_cats) { |
| 206 | + if arr_get(known_cats, j) == cat { is_known = 1; } |
| 207 | + j = j + 1; |
| 208 | + } |
| 209 | + assert_eq(is_known, 1, |
| 210 | + concat_many("unique cat ", arr_get(unique, i))); |
| 211 | + i = i + 1; |
| 212 | + } |
| 213 | +} |
| 214 | + |
| 215 | +# omc_is_unique consistent with unique list |
| 216 | +fn test_is_unique_consistent() { |
| 217 | + h unique = omc_unique_builtins(); |
| 218 | + h i = 0; |
| 219 | + while i < arr_len(unique) { |
| 220 | + assert_eq(omc_is_unique(arr_get(unique, i)), 1, |
| 221 | + concat_many(arr_get(unique, i), " marked")); |
| 222 | + i = i + 1; |
| 223 | + } |
| 224 | +} |
| 225 | + |
| 226 | +# Count in each known category > 0 |
| 227 | +fn test_count_in_each_category() { |
| 228 | + h cats = omc_categories(); |
| 229 | + h i = 0; |
| 230 | + while i < arr_len(cats) { |
| 231 | + h c = arr_get(cats, i); |
| 232 | + h n = omc_count_in_category(c); |
| 233 | + assert_true(n > 0, concat_many("cat ", c, " populated")); |
| 234 | + i = i + 1; |
| 235 | + } |
| 236 | +} |
| 237 | + |
| 238 | +# omc_canonical_hash of equivalent forms matches |
| 239 | +fn test_canonical_hash_equivalents_10() { |
| 240 | + h pairs_a = [ |
| 241 | + "fn f(x) { return x; }", |
| 242 | + "fn add(a, b) { return a + b; }", |
| 243 | + "h x = 1;", |
| 244 | + "if cond { return 1; }", |
| 245 | + "while i < n { i = i + 1; }", |
| 246 | + "fn loss(p, t) { return (p - t) * (p - t); }", |
| 247 | + "fn map_sq(xs) { return arr_map(xs, fn(x) { return x * x; }); }", |
| 248 | + "fn count(xs) { h n = arr_len(xs); return n; }", |
| 249 | + "fn neg(v) { return v * (0 - 1); }", |
| 250 | + "fn id(v) { return v; }", |
| 251 | + ]; |
| 252 | + h pairs_b = [ |
| 253 | + "fn f(y) { return y; }", |
| 254 | + "fn add(p, q) { return p + q; }", |
| 255 | + "h x = 1;", # same code |
| 256 | + "if cond { return 1; }", |
| 257 | + "while j < n { j = j + 1; }", |
| 258 | + "fn loss(pred, target) { return (pred - target) * (pred - target); }", |
| 259 | + "fn map_sq(items) { return arr_map(items, fn(z) { return z * z; }); }", |
| 260 | + "fn count(arr) { h c = arr_len(arr); return c; }", |
| 261 | + "fn neg(w) { return w * (0 - 1); }", |
| 262 | + "fn id(w) { return w; }", |
| 263 | + ]; |
| 264 | + h i = 0; |
| 265 | + while i < arr_len(pairs_a) { |
| 266 | + h h1 = omc_canonical_hash(arr_get(pairs_a, i)); |
| 267 | + h h2 = omc_canonical_hash(arr_get(pairs_b, i)); |
| 268 | + assert_eq(dict_get(h1, "raw"), dict_get(h2, "raw"), |
| 269 | + concat_many("hash equiv ", to_string(i))); |
| 270 | + i = i + 1; |
| 271 | + } |
| 272 | +} |
| 273 | + |
| 274 | +# omc_id stability |
| 275 | +fn test_omc_id_stability() { |
| 276 | + h cases = [ |
| 277 | + "fn f() {}", |
| 278 | + "fn add(x, y) { return x + y; }", |
| 279 | + "h x = 1;", |
| 280 | + ]; |
| 281 | + h i = 0; |
| 282 | + while i < arr_len(cases) { |
| 283 | + h id1 = omc_id(arr_get(cases, i)); |
| 284 | + h id2 = omc_id(arr_get(cases, i)); |
| 285 | + assert_eq(id1, id2, concat_many("id ", to_string(i))); |
| 286 | + i = i + 1; |
| 287 | + } |
| 288 | +} |
0 commit comments