|
| 1 | +# Parametric v3 — table-driven tests with many sub-assertions. |
| 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 | +fn approx_eq(a, b, tol) { |
| 12 | + h d = a - b; |
| 13 | + if d < 0.0 { d = 0.0 - d; } |
| 14 | + return d <= tol; |
| 15 | +} |
| 16 | + |
| 17 | +# Verify is_attractor on a wide range |
| 18 | +fn test_is_attractor_table() { |
| 19 | + h fibs = [0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765]; |
| 20 | + h i = 0; |
| 21 | + while i < arr_len(fibs) { |
| 22 | + assert_eq(is_attractor(arr_get(fibs, i)), 1, |
| 23 | + concat_many("fib ", to_string(arr_get(fibs, i)))); |
| 24 | + i = i + 1; |
| 25 | + } |
| 26 | +} |
| 27 | + |
| 28 | +# Non-attractors within range |
| 29 | +fn test_non_attractor_table() { |
| 30 | + h non = [4, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, |
| 31 | + 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33]; |
| 32 | + h i = 0; |
| 33 | + while i < arr_len(non) { |
| 34 | + assert_eq(is_attractor(arr_get(non, i)), 0, |
| 35 | + concat_many("non-fib ", to_string(arr_get(non, i)))); |
| 36 | + i = i + 1; |
| 37 | + } |
| 38 | +} |
| 39 | + |
| 40 | +# attractor_distance on Fibonacci is 0 |
| 41 | +fn test_distance_zero_on_fibs() { |
| 42 | + h fibs = [0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144]; |
| 43 | + h i = 0; |
| 44 | + while i < arr_len(fibs) { |
| 45 | + assert_eq(attractor_distance(arr_get(fibs, i)), 0, |
| 46 | + concat_many("d(", to_string(arr_get(fibs, i)), ") = 0")); |
| 47 | + i = i + 1; |
| 48 | + } |
| 49 | +} |
| 50 | + |
| 51 | +# arr_dot |
| 52 | +fn test_arr_dot_table() { |
| 53 | + h pairs_a = [ |
| 54 | + [1.0, 2.0, 3.0], |
| 55 | + [1.0, 0.0], |
| 56 | + [3.0, 4.0], |
| 57 | + ]; |
| 58 | + h pairs_b = [ |
| 59 | + [4.0, 5.0, 6.0], |
| 60 | + [1.0, 1.0], |
| 61 | + [3.0, 4.0], |
| 62 | + ]; |
| 63 | + h expected = [32.0, 1.0, 25.0]; |
| 64 | + h i = 0; |
| 65 | + while i < arr_len(pairs_a) { |
| 66 | + h d = arr_dot(arr_get(pairs_a, i), arr_get(pairs_b, i)); |
| 67 | + assert_true(approx_eq(d, arr_get(expected, i), 0.001), |
| 68 | + concat_many("dot ", to_string(i))); |
| 69 | + i = i + 1; |
| 70 | + } |
| 71 | +} |
| 72 | + |
| 73 | +# arr_sum_int |
| 74 | +fn test_arr_sum_int_table() { |
| 75 | + h arrays = [ |
| 76 | + [1, 2, 3, 4, 5], |
| 77 | + [10, 20, 30], |
| 78 | + [0], |
| 79 | + [], |
| 80 | + [0 - 5, 5, 0 - 3, 3], |
| 81 | + ]; |
| 82 | + h expected = [15, 60, 0, 0, 0]; |
| 83 | + h i = 0; |
| 84 | + while i < arr_len(arrays) { |
| 85 | + h s = arr_sum_int(arr_get(arrays, i)); |
| 86 | + assert_eq(s, arr_get(expected, i), concat_many("sum ", to_string(i))); |
| 87 | + i = i + 1; |
| 88 | + } |
| 89 | +} |
| 90 | + |
| 91 | +# arr_max_int and arr_min_int |
| 92 | +fn test_arr_minmax_table() { |
| 93 | + h arrays = [ |
| 94 | + [3, 1, 4, 1, 5, 9, 2, 6], |
| 95 | + [10, 10, 10], |
| 96 | + [0 - 5, 0 - 3, 0 - 7], |
| 97 | + ]; |
| 98 | + h max_expected = [9, 10, 0 - 3]; |
| 99 | + h min_expected = [1, 10, 0 - 7]; |
| 100 | + h i = 0; |
| 101 | + while i < arr_len(arrays) { |
| 102 | + assert_eq(arr_max_int(arr_get(arrays, i)), arr_get(max_expected, i), |
| 103 | + concat_many("max ", to_string(i))); |
| 104 | + assert_eq(arr_min_int(arr_get(arrays, i)), arr_get(min_expected, i), |
| 105 | + concat_many("min ", to_string(i))); |
| 106 | + i = i + 1; |
| 107 | + } |
| 108 | +} |
| 109 | + |
| 110 | +# str_len |
| 111 | +fn test_str_len_table() { |
| 112 | + h strings = ["", "a", "hello", "1234567890"]; |
| 113 | + h expected = [0, 1, 5, 10]; |
| 114 | + h i = 0; |
| 115 | + while i < arr_len(strings) { |
| 116 | + assert_eq(str_len(arr_get(strings, i)), arr_get(expected, i), |
| 117 | + concat_many("len ", to_string(i))); |
| 118 | + i = i + 1; |
| 119 | + } |
| 120 | +} |
| 121 | + |
| 122 | +# concat_many with various arities |
| 123 | +fn test_concat_many_arities() { |
| 124 | + assert_eq(concat_many("a"), "a", "1 arg"); |
| 125 | + assert_eq(concat_many("a", "b"), "ab", "2 args"); |
| 126 | + assert_eq(concat_many("a", "b", "c"), "abc", "3 args"); |
| 127 | + assert_eq(concat_many("a", "b", "c", "d"), "abcd", "4 args"); |
| 128 | + assert_eq(concat_many("x=", 1, " y=", 2), "x=1 y=2", "mixed types"); |
| 129 | +} |
| 130 | + |
| 131 | +# arr_resonance_vec on attractors all near 1 |
| 132 | +fn test_resonance_table() { |
| 133 | + h fibs = [1, 2, 3, 5, 8, 13, 21]; |
| 134 | + h r = arr_resonance_vec(fibs); |
| 135 | + h i = 0; |
| 136 | + while i < arr_len(r) { |
| 137 | + h v = arr_get(r, i); |
| 138 | + h d = v - 1.0; |
| 139 | + if d < 0.0 { d = 0.0 - d; } |
| 140 | + assert_true(d < 0.001, concat_many("r ", to_string(i))); |
| 141 | + i = i + 1; |
| 142 | + } |
| 143 | +} |
| 144 | + |
| 145 | +# omc_help on each unique returns category 'substrate' or specific known cat |
| 146 | +fn test_unique_categories_make_sense() { |
| 147 | + h unique = omc_unique_builtins(); |
| 148 | + h i = 0; |
| 149 | + while i < arr_len(unique) { |
| 150 | + h n = arr_get(unique, i); |
| 151 | + h hd = omc_help(n); |
| 152 | + h cat = dict_get(hd, "category"); |
| 153 | + # All unique builtins should have a category |
| 154 | + assert_true(str_len(cat) > 0, |
| 155 | + concat_many(n, " has cat")); |
| 156 | + i = i + 1; |
| 157 | + } |
| 158 | +} |
| 159 | + |
| 160 | +# Canonical hash determinism |
| 161 | +fn test_canonical_hash_deterministic() { |
| 162 | + h cases = [ |
| 163 | + "fn f() { return 1; }", |
| 164 | + "h x = arr_softmax([1.0, 2.0]);", |
| 165 | + "fn loss(p, t) { return (p - t) * (p - t); }", |
| 166 | + ]; |
| 167 | + h i = 0; |
| 168 | + while i < arr_len(cases) { |
| 169 | + h h1 = omc_canonical_hash(arr_get(cases, i)); |
| 170 | + h h2 = omc_canonical_hash(arr_get(cases, i)); |
| 171 | + assert_eq(dict_get(h1, "raw"), dict_get(h2, "raw"), |
| 172 | + concat_many("hash ", to_string(i))); |
| 173 | + i = i + 1; |
| 174 | + } |
| 175 | +} |
| 176 | + |
| 177 | +# Token vocab IDs are dense and stable |
| 178 | +fn test_token_vocab_size_growing() { |
| 179 | + h size = omc_token_vocab_size(); |
| 180 | + # Should be >100 since we've expanded the dict many times. |
| 181 | + assert_true(size > 100, "vocab size > 100"); |
| 182 | +} |
0 commit comments