freelang-editor 11.7.4

package/self/self/bench/_bi_str-concat.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_char_at = (s, i) => (s[i] || null);const _fl_replace = (s, a, b) => s.split(a).join(b);const _fl_starts_with = (s, p) => s.startsWith(p);const _fl_ends_with = (s, p) => s.endsWith(p);const _fl_contains = (s, p) => s.includes(p);const _fl_split = (s, sep) => s.split(sep);const _fl_join = (l, sep) => l.join(sep==null?'':sep);const _fl_trim = (s) => s.trim();const _fl_upper = (s) => s.toUpperCase();const _fl_lower = (s) => s.toLowerCase();const _fl_repeat = (s, n) => s.repeat(n);const _fl_index_of = (s, p) => s.indexOf(p);const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_slice = (l, a, b) => l.slice(a, b);const _fl_map = (f, l) => l.map(x => f(x));const _fl_filter = (f, l) => l.filter(x => f(x));const _fl_reduce = (f, init, l) => l.reduce((acc, x) => f(acc, x), init);const _fl_sort = (l, cmp) => [...l].sort(cmp || ((a,b)=>a<b?-1:a>b?1:0));const _fl_reverse = (l) => [...l].reverse();const _fl_distinct = (l) => [...new Set(l)];const _fl_range = (a, b, s) => { let r=[]; let step=s||1; for(let i=a;i<b;i+=step)r.push(i); return r; };const _fl_take = (n, l) => l.slice(0, n);const _fl_drop = (n, l) => l.slice(n);const _fl_flatten = (l) => l.flat(Infinity);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));const _fl_keys = (o) => (o==null ? [] : Object.keys(o));const _fl_values = (o) => (o==null ? [] : Object.values(o));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_merge = (...os) => Object.assign({}, ...os);const _fl_is_map = (x) => (x!=null && typeof x==='object' && !Array.isArray(x));const _fl_type_of = (x) => (x==null?'null':Array.isArray(x)?'list':typeof x);
+console.log(_fl_str("hello"," ","world"));

package/self/self/bench/_bi_str-contains.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_char_at = (s, i) => (s[i] || null);const _fl_replace = (s, a, b) => s.split(a).join(b);const _fl_starts_with = (s, p) => s.startsWith(p);const _fl_ends_with = (s, p) => s.endsWith(p);const _fl_contains = (s, p) => s.includes(p);const _fl_split = (s, sep) => s.split(sep);const _fl_join = (l, sep) => l.join(sep==null?'':sep);const _fl_trim = (s) => s.trim();const _fl_upper = (s) => s.toUpperCase();const _fl_lower = (s) => s.toLowerCase();const _fl_repeat = (s, n) => s.repeat(n);const _fl_index_of = (s, p) => s.indexOf(p);const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_slice = (l, a, b) => l.slice(a, b);const _fl_map = (f, l) => l.map(x => f(x));const _fl_filter = (f, l) => l.filter(x => f(x));const _fl_reduce = (f, init, l) => l.reduce((acc, x) => f(acc, x), init);const _fl_sort = (l, cmp) => [...l].sort(cmp || ((a,b)=>a<b?-1:a>b?1:0));const _fl_reverse = (l) => [...l].reverse();const _fl_distinct = (l) => [...new Set(l)];const _fl_range = (a, b, s) => { let r=[]; let step=s||1; for(let i=a;i<b;i+=step)r.push(i); return r; };const _fl_take = (n, l) => l.slice(0, n);const _fl_drop = (n, l) => l.slice(n);const _fl_flatten = (l) => l.flat(Infinity);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));const _fl_keys = (o) => (o==null ? [] : Object.keys(o));const _fl_values = (o) => (o==null ? [] : Object.values(o));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_merge = (...os) => Object.assign({}, ...os);const _fl_is_map = (x) => (x!=null && typeof x==='object' && !Array.isArray(x));const _fl_type_of = (x) => (x==null?'null':Array.isArray(x)?'list':typeof x);
+console.log(_fl_contains("hello world","lo w"));

package/self/self/bench/_bi_str-ends.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_char_at = (s, i) => (s[i] || null);const _fl_replace = (s, a, b) => s.split(a).join(b);const _fl_starts_with = (s, p) => s.startsWith(p);const _fl_ends_with = (s, p) => s.endsWith(p);const _fl_contains = (s, p) => s.includes(p);const _fl_split = (s, sep) => s.split(sep);const _fl_join = (l, sep) => l.join(sep==null?'':sep);const _fl_trim = (s) => s.trim();const _fl_upper = (s) => s.toUpperCase();const _fl_lower = (s) => s.toLowerCase();const _fl_repeat = (s, n) => s.repeat(n);const _fl_index_of = (s, p) => s.indexOf(p);const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_slice = (l, a, b) => l.slice(a, b);const _fl_map = (f, l) => l.map(x => f(x));const _fl_filter = (f, l) => l.filter(x => f(x));const _fl_reduce = (f, init, l) => l.reduce((acc, x) => f(acc, x), init);const _fl_sort = (l, cmp) => [...l].sort(cmp || ((a,b)=>a<b?-1:a>b?1:0));const _fl_reverse = (l) => [...l].reverse();const _fl_distinct = (l) => [...new Set(l)];const _fl_range = (a, b, s) => { let r=[]; let step=s||1; for(let i=a;i<b;i+=step)r.push(i); return r; };const _fl_take = (n, l) => l.slice(0, n);const _fl_drop = (n, l) => l.slice(n);const _fl_flatten = (l) => l.flat(Infinity);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));const _fl_keys = (o) => (o==null ? [] : Object.keys(o));const _fl_values = (o) => (o==null ? [] : Object.values(o));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_merge = (...os) => Object.assign({}, ...os);const _fl_is_map = (x) => (x!=null && typeof x==='object' && !Array.isArray(x));const _fl_type_of = (x) => (x==null?'null':Array.isArray(x)?'list':typeof x);
+console.log(_fl_ends_with("hello world","world"));

package/self/self/bench/_bi_str-index.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_char_at = (s, i) => (s[i] || null);const _fl_replace = (s, a, b) => s.split(a).join(b);const _fl_starts_with = (s, p) => s.startsWith(p);const _fl_ends_with = (s, p) => s.endsWith(p);const _fl_contains = (s, p) => s.includes(p);const _fl_split = (s, sep) => s.split(sep);const _fl_join = (l, sep) => l.join(sep==null?'':sep);const _fl_trim = (s) => s.trim();const _fl_upper = (s) => s.toUpperCase();const _fl_lower = (s) => s.toLowerCase();const _fl_repeat = (s, n) => s.repeat(n);const _fl_index_of = (s, p) => s.indexOf(p);const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_slice = (l, a, b) => l.slice(a, b);const _fl_map = (f, l) => l.map(x => f(x));const _fl_filter = (f, l) => l.filter(x => f(x));const _fl_reduce = (f, init, l) => l.reduce((acc, x) => f(acc, x), init);const _fl_sort = (l, cmp) => [...l].sort(cmp || ((a,b)=>a<b?-1:a>b?1:0));const _fl_reverse = (l) => [...l].reverse();const _fl_distinct = (l) => [...new Set(l)];const _fl_range = (a, b, s) => { let r=[]; let step=s||1; for(let i=a;i<b;i+=step)r.push(i); return r; };const _fl_take = (n, l) => l.slice(0, n);const _fl_drop = (n, l) => l.slice(n);const _fl_flatten = (l) => l.flat(Infinity);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));const _fl_keys = (o) => (o==null ? [] : Object.keys(o));const _fl_values = (o) => (o==null ? [] : Object.values(o));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_merge = (...os) => Object.assign({}, ...os);const _fl_is_map = (x) => (x!=null && typeof x==='object' && !Array.isArray(x));const _fl_type_of = (x) => (x==null?'null':Array.isArray(x)?'list':typeof x);
+console.log(_fl_index_of("hello","ll"));

package/self/self/bench/_bi_str-lower.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_char_at = (s, i) => (s[i] || null);const _fl_replace = (s, a, b) => s.split(a).join(b);const _fl_starts_with = (s, p) => s.startsWith(p);const _fl_ends_with = (s, p) => s.endsWith(p);const _fl_contains = (s, p) => s.includes(p);const _fl_split = (s, sep) => s.split(sep);const _fl_join = (l, sep) => l.join(sep==null?'':sep);const _fl_trim = (s) => s.trim();const _fl_upper = (s) => s.toUpperCase();const _fl_lower = (s) => s.toLowerCase();const _fl_repeat = (s, n) => s.repeat(n);const _fl_index_of = (s, p) => s.indexOf(p);const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_slice = (l, a, b) => l.slice(a, b);const _fl_map = (f, l) => l.map(x => f(x));const _fl_filter = (f, l) => l.filter(x => f(x));const _fl_reduce = (f, init, l) => l.reduce((acc, x) => f(acc, x), init);const _fl_sort = (l, cmp) => [...l].sort(cmp || ((a,b)=>a<b?-1:a>b?1:0));const _fl_reverse = (l) => [...l].reverse();const _fl_distinct = (l) => [...new Set(l)];const _fl_range = (a, b, s) => { let r=[]; let step=s||1; for(let i=a;i<b;i+=step)r.push(i); return r; };const _fl_take = (n, l) => l.slice(0, n);const _fl_drop = (n, l) => l.slice(n);const _fl_flatten = (l) => l.flat(Infinity);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));const _fl_keys = (o) => (o==null ? [] : Object.keys(o));const _fl_values = (o) => (o==null ? [] : Object.values(o));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_merge = (...os) => Object.assign({}, ...os);const _fl_is_map = (x) => (x!=null && typeof x==='object' && !Array.isArray(x));const _fl_type_of = (x) => (x==null?'null':Array.isArray(x)?'list':typeof x);
+console.log(_fl_lower("HI"));

package/self/self/bench/_bi_str-repeat.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_char_at = (s, i) => (s[i] || null);const _fl_replace = (s, a, b) => s.split(a).join(b);const _fl_starts_with = (s, p) => s.startsWith(p);const _fl_ends_with = (s, p) => s.endsWith(p);const _fl_contains = (s, p) => s.includes(p);const _fl_split = (s, sep) => s.split(sep);const _fl_join = (l, sep) => l.join(sep==null?'':sep);const _fl_trim = (s) => s.trim();const _fl_upper = (s) => s.toUpperCase();const _fl_lower = (s) => s.toLowerCase();const _fl_repeat = (s, n) => s.repeat(n);const _fl_index_of = (s, p) => s.indexOf(p);const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_slice = (l, a, b) => l.slice(a, b);const _fl_map = (f, l) => l.map(x => f(x));const _fl_filter = (f, l) => l.filter(x => f(x));const _fl_reduce = (f, init, l) => l.reduce((acc, x) => f(acc, x), init);const _fl_sort = (l, cmp) => [...l].sort(cmp || ((a,b)=>a<b?-1:a>b?1:0));const _fl_reverse = (l) => [...l].reverse();const _fl_distinct = (l) => [...new Set(l)];const _fl_range = (a, b, s) => { let r=[]; let step=s||1; for(let i=a;i<b;i+=step)r.push(i); return r; };const _fl_take = (n, l) => l.slice(0, n);const _fl_drop = (n, l) => l.slice(n);const _fl_flatten = (l) => l.flat(Infinity);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));const _fl_keys = (o) => (o==null ? [] : Object.keys(o));const _fl_values = (o) => (o==null ? [] : Object.values(o));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_merge = (...os) => Object.assign({}, ...os);const _fl_is_map = (x) => (x!=null && typeof x==='object' && !Array.isArray(x));const _fl_type_of = (x) => (x==null?'null':Array.isArray(x)?'list':typeof x);
+console.log(_fl_repeat("ab",3));

package/self/self/bench/_bi_str-split.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_char_at = (s, i) => (s[i] || null);const _fl_replace = (s, a, b) => s.split(a).join(b);const _fl_starts_with = (s, p) => s.startsWith(p);const _fl_ends_with = (s, p) => s.endsWith(p);const _fl_contains = (s, p) => s.includes(p);const _fl_split = (s, sep) => s.split(sep);const _fl_join = (l, sep) => l.join(sep==null?'':sep);const _fl_trim = (s) => s.trim();const _fl_upper = (s) => s.toUpperCase();const _fl_lower = (s) => s.toLowerCase();const _fl_repeat = (s, n) => s.repeat(n);const _fl_index_of = (s, p) => s.indexOf(p);const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_slice = (l, a, b) => l.slice(a, b);const _fl_map = (f, l) => l.map(x => f(x));const _fl_filter = (f, l) => l.filter(x => f(x));const _fl_reduce = (f, init, l) => l.reduce((acc, x) => f(acc, x), init);const _fl_sort = (l, cmp) => [...l].sort(cmp || ((a,b)=>a<b?-1:a>b?1:0));const _fl_reverse = (l) => [...l].reverse();const _fl_distinct = (l) => [...new Set(l)];const _fl_range = (a, b, s) => { let r=[]; let step=s||1; for(let i=a;i<b;i+=step)r.push(i); return r; };const _fl_take = (n, l) => l.slice(0, n);const _fl_drop = (n, l) => l.slice(n);const _fl_flatten = (l) => l.flat(Infinity);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));const _fl_keys = (o) => (o==null ? [] : Object.keys(o));const _fl_values = (o) => (o==null ? [] : Object.values(o));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_merge = (...os) => Object.assign({}, ...os);const _fl_is_map = (x) => (x!=null && typeof x==='object' && !Array.isArray(x));const _fl_type_of = (x) => (x==null?'null':Array.isArray(x)?'list':typeof x);
+console.log(_fl_join(_fl_split("a,b,c",","),"-"));

package/self/self/bench/_bi_str-starts.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_char_at = (s, i) => (s[i] || null);const _fl_replace = (s, a, b) => s.split(a).join(b);const _fl_starts_with = (s, p) => s.startsWith(p);const _fl_ends_with = (s, p) => s.endsWith(p);const _fl_contains = (s, p) => s.includes(p);const _fl_split = (s, sep) => s.split(sep);const _fl_join = (l, sep) => l.join(sep==null?'':sep);const _fl_trim = (s) => s.trim();const _fl_upper = (s) => s.toUpperCase();const _fl_lower = (s) => s.toLowerCase();const _fl_repeat = (s, n) => s.repeat(n);const _fl_index_of = (s, p) => s.indexOf(p);const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_slice = (l, a, b) => l.slice(a, b);const _fl_map = (f, l) => l.map(x => f(x));const _fl_filter = (f, l) => l.filter(x => f(x));const _fl_reduce = (f, init, l) => l.reduce((acc, x) => f(acc, x), init);const _fl_sort = (l, cmp) => [...l].sort(cmp || ((a,b)=>a<b?-1:a>b?1:0));const _fl_reverse = (l) => [...l].reverse();const _fl_distinct = (l) => [...new Set(l)];const _fl_range = (a, b, s) => { let r=[]; let step=s||1; for(let i=a;i<b;i+=step)r.push(i); return r; };const _fl_take = (n, l) => l.slice(0, n);const _fl_drop = (n, l) => l.slice(n);const _fl_flatten = (l) => l.flat(Infinity);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));const _fl_keys = (o) => (o==null ? [] : Object.keys(o));const _fl_values = (o) => (o==null ? [] : Object.values(o));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_merge = (...os) => Object.assign({}, ...os);const _fl_is_map = (x) => (x!=null && typeof x==='object' && !Array.isArray(x));const _fl_type_of = (x) => (x==null?'null':Array.isArray(x)?'list':typeof x);
+console.log(_fl_starts_with("hello world","hello"));

package/self/self/bench/_bi_str-trim.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_char_at = (s, i) => (s[i] || null);const _fl_replace = (s, a, b) => s.split(a).join(b);const _fl_starts_with = (s, p) => s.startsWith(p);const _fl_ends_with = (s, p) => s.endsWith(p);const _fl_contains = (s, p) => s.includes(p);const _fl_split = (s, sep) => s.split(sep);const _fl_join = (l, sep) => l.join(sep==null?'':sep);const _fl_trim = (s) => s.trim();const _fl_upper = (s) => s.toUpperCase();const _fl_lower = (s) => s.toLowerCase();const _fl_repeat = (s, n) => s.repeat(n);const _fl_index_of = (s, p) => s.indexOf(p);const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_slice = (l, a, b) => l.slice(a, b);const _fl_map = (f, l) => l.map(x => f(x));const _fl_filter = (f, l) => l.filter(x => f(x));const _fl_reduce = (f, init, l) => l.reduce((acc, x) => f(acc, x), init);const _fl_sort = (l, cmp) => [...l].sort(cmp || ((a,b)=>a<b?-1:a>b?1:0));const _fl_reverse = (l) => [...l].reverse();const _fl_distinct = (l) => [...new Set(l)];const _fl_range = (a, b, s) => { let r=[]; let step=s||1; for(let i=a;i<b;i+=step)r.push(i); return r; };const _fl_take = (n, l) => l.slice(0, n);const _fl_drop = (n, l) => l.slice(n);const _fl_flatten = (l) => l.flat(Infinity);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));const _fl_keys = (o) => (o==null ? [] : Object.keys(o));const _fl_values = (o) => (o==null ? [] : Object.values(o));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_merge = (...os) => Object.assign({}, ...os);const _fl_is_map = (x) => (x!=null && typeof x==='object' && !Array.isArray(x));const _fl_type_of = (x) => (x==null?'null':Array.isArray(x)?'list':typeof x);
+console.log(_fl_trim("  hi  "));

package/self/self/bench/_bi_str-upper.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_char_at = (s, i) => (s[i] || null);const _fl_replace = (s, a, b) => s.split(a).join(b);const _fl_starts_with = (s, p) => s.startsWith(p);const _fl_ends_with = (s, p) => s.endsWith(p);const _fl_contains = (s, p) => s.includes(p);const _fl_split = (s, sep) => s.split(sep);const _fl_join = (l, sep) => l.join(sep==null?'':sep);const _fl_trim = (s) => s.trim();const _fl_upper = (s) => s.toUpperCase();const _fl_lower = (s) => s.toLowerCase();const _fl_repeat = (s, n) => s.repeat(n);const _fl_index_of = (s, p) => s.indexOf(p);const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_slice = (l, a, b) => l.slice(a, b);const _fl_map = (f, l) => l.map(x => f(x));const _fl_filter = (f, l) => l.filter(x => f(x));const _fl_reduce = (f, init, l) => l.reduce((acc, x) => f(acc, x), init);const _fl_sort = (l, cmp) => [...l].sort(cmp || ((a,b)=>a<b?-1:a>b?1:0));const _fl_reverse = (l) => [...l].reverse();const _fl_distinct = (l) => [...new Set(l)];const _fl_range = (a, b, s) => { let r=[]; let step=s||1; for(let i=a;i<b;i+=step)r.push(i); return r; };const _fl_take = (n, l) => l.slice(0, n);const _fl_drop = (n, l) => l.slice(n);const _fl_flatten = (l) => l.flat(Infinity);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));const _fl_keys = (o) => (o==null ? [] : Object.keys(o));const _fl_values = (o) => (o==null ? [] : Object.values(o));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_merge = (...os) => Object.assign({}, ...os);const _fl_is_map = (x) => (x!=null && typeof x==='object' && !Array.isArray(x));const _fl_type_of = (x) => (x==null?'null':Array.isArray(x)?'list':typeof x);
+console.log(_fl_upper("hi"));

package/self/self/bench/_ext_abs-neg.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+console.log(Math.abs((0-42)));

package/self/self/bench/_ext_and.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+console.log((3));

package/self/self/bench/_ext_cond-1.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+((()=>{let g=85;return console.log(((g>=90)?"A":((g>=80)?"B":(null?"F":null))));})());

package/self/self/bench/_ext_cond-2.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+console.log((null?1:(null?2:(null?99:null))));

package/self/self/bench/_ext_do-seq.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+(()=>{console.log(1);console.log(2);return console.log(3);})();

package/self/self/bench/_ext_fact20.js

@@ -0,0 +1,3 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+const fact = (n)=>((n<=1)?1:(n*fact((n-1))));
+console.log(fact(20));

package/self/self/bench/_ext_fib25.js

@@ -0,0 +1,3 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+const fib = (n)=>((n<2)?n:(fib((n-1))+fib((n-2))));
+console.log(fib(25));

package/self/self/bench/_ext_length.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+console.log(_fl_length("hello"));

package/self/self/bench/_ext_let-1d.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+((()=>{let x=5;let y=10;return console.log((x+y));})());

package/self/self/bench/_ext_let-2d.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+((()=>{let x=3;let y=4;return console.log((x*y));})());

package/self/self/bench/_ext_list-sum.js

@@ -0,0 +1,3 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+const add = (a,b)=>(a+b);
+console.log(add(_fl_get([30],1),5));

package/self/self/bench/_ext_math.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+console.log(Math.min(2));

package/self/self/bench/_ext_or.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+console.log((null||null||42));

package/self/self/bench/_ext_str.js

@@ -0,0 +1,2 @@
+const _fl_str = (...xs) => xs.map(x => x==null?'null':String(x)).join('');const _fl_length = (x) => (x==null ? 0 : x.length);const _fl_substring = (s, a, b) => (b==null ? s.slice(a) : s.slice(a, b));const _fl_first = (l) => (l==null || l.length===0 ? null : l[0]);const _fl_last = (l) => (l==null || l.length===0 ? null : l[l.length-1]);const _fl_rest = (l) => (l==null || l.length===0 ? [] : l.slice(1));const _fl_append = (a, b) => (Array.isArray(b) ? [...a, ...b] : [...a, b]);const _fl_get = (o, k) => (o==null ? null : (o[k]===undefined ? null : o[k]));
+console.log(_fl_str("x=",5," y=",10));

package/self/self/bench/_fact15.js

@@ -0,0 +1,2 @@
+const fact = (n)=>((n<=1)?1:(n*fact((n-1))));
+console.log(fact(15));

package/self/self/bench/_fb_fact15.js

@@ -0,0 +1,2 @@
+const fact = (n)=>((n<=1)?1:(n*fact((n-1))));
+console.log(fact(15))

package/self/self/bench/_fb_func-fact.js

@@ -0,0 +1,2 @@
+const fact = (n)=>((n<=1)?1:(n*fact((n-1))));
+console.log(fact(10))

package/self/self/bench/_fb_func-multi.js

@@ -0,0 +1,2 @@
+const add3 = (a,b,c)=>(a+b+c);
+console.log(add3(30))

package/self/self/bench/_fb_func-mutual.js

@@ -0,0 +1,3 @@
+const even_q = (n)=>((n===0)?1:odd_q((n-1)));
+const odd_q = (n)=>((n===0)?0:even_q((n-1)));
+console.log(even_q(10))

package/self/self/bench/_fb_func-simple.js

@@ -0,0 +1,2 @@
+const double = (x)=>(x*2);
+console.log(double(21))

package/self/self/bench/_fib.js

@@ -0,0 +1,2 @@
+const fib = (n)=>((n<2)?n:(fib((n-1))+fib((n-2))));
+console.log(fib(20));

package/self/self/bench/_fn_async-await-seq.js

@@ -0,0 +1,2 @@
+const inc=(x)=>x+1;const dbl=(x)=>x*2;const neg=(x)=>-x;const addn=(x,n)=>x+n;const muln=(x,n)=>x*n;const sleep=(ms)=>new Promise(r=>setTimeout(r,ms));
+(async()=>{(await sleep(10));return console.log(42);})();

package/self/self/bench/_fn_async-print.js

@@ -0,0 +1,2 @@
+const inc=(x)=>x+1;const dbl=(x)=>x*2;const neg=(x)=>-x;const addn=(x,n)=>x+n;const muln=(x,n)=>x*n;const sleep=(ms)=>new Promise(r=>setTimeout(r,ms));
+(async()=>{return console.log((1+2));})();

package/self/self/bench/_fn_call-form.js

@@ -0,0 +1,2 @@
+const inc=(x)=>x+1;const dbl=(x)=>x*2;const neg=(x)=>-x;const addn=(x,n)=>x+n;const muln=(x,n)=>x*n;const sleep=(ms)=>new Promise(r=>setTimeout(r,ms));
+console.log(inc(10));

package/self/self/bench/_fn_compose.js

@@ -0,0 +1,2 @@
+const inc=(x)=>x+1;const dbl=(x)=>x*2;const neg=(x)=>-x;const addn=(x,n)=>x+n;const muln=(x,n)=>x*n;const sleep=(ms)=>new Promise(r=>setTimeout(r,ms));
+console.log(((__x)=>inc(dbl(__x)))(5));

package/self/self/bench/_fn_pipe.js

@@ -0,0 +1,2 @@
+const inc=(x)=>x+1;const dbl=(x)=>x*2;const neg=(x)=>-x;const addn=(x,n)=>x+n;const muln=(x,n)=>x*n;const sleep=(ms)=>new Promise(r=>setTimeout(r,ms));
+console.log(((__x)=>dbl(inc(__x)))(5));

package/self/self/bench/_fn_thread-first-sexpr.js

@@ -0,0 +1,2 @@
+const inc=(x)=>x+1;const dbl=(x)=>x*2;const neg=(x)=>-x;const addn=(x,n)=>x+n;const muln=(x,n)=>x*n;const sleep=(ms)=>new Promise(r=>setTimeout(r,ms));
+console.log(dbl(addn(10,3)));

package/self/self/bench/_fn_thread-first.js

@@ -0,0 +1,2 @@
+const inc=(x)=>x+1;const dbl=(x)=>x*2;const neg=(x)=>-x;const addn=(x,n)=>x+n;const muln=(x,n)=>x*n;const sleep=(ms)=>new Promise(r=>setTimeout(r,ms));
+console.log(dbl(inc(5)));

package/self/self/bench/_fn_thread-last.js

@@ -0,0 +1,2 @@
+const inc=(x)=>x+1;const dbl=(x)=>x*2;const neg=(x)=>-x;const addn=(x,n)=>x+n;const muln=(x,n)=>x*n;const sleep=(ms)=>new Promise(r=>setTimeout(r,ms));
+console.log(dbl(addn(3,5)));

package/self/self/bench/_generated.js

@@ -0,0 +1,2 @@
+const fact = (n)=>((n<=1)?1:(n*fact((n-1))));
+console.log(fact(10));

package/self/self/bench/_mt_match-default.js

@@ -0,0 +1,2 @@
+const _fl_get=(o,k)=>(o==null?null:(o[k]===undefined?null:o[k]));
+console.log(((__v)=>{if(((__v===1))&&(true)){return "a";}if(((__v===2))&&(true)){return "b";}return "z";})(99));

package/self/self/bench/_mt_match-num.js

@@ -0,0 +1,2 @@
+const _fl_get=(o,k)=>(o==null?null:(o[k]===undefined?null:o[k]));
+console.log(((__v)=>{if(((__v===1))&&(true)){return "a";}if(((__v===2))&&(true)){return "b";}if(((__v===3))&&(true)){return "c";}return "z";})(2));

package/self/self/bench/_mt_match-str.js

@@ -0,0 +1,2 @@
+const _fl_get=(o,k)=>(o==null?null:(o[k]===undefined?null:o[k]));
+console.log(((__v)=>{if(((__v==="fail"))&&(true)){return 0;}if(((__v==="ok"))&&(true)){return 1;}return _1;})("ok"));

package/self/self/bench/_mt_match-var.js

@@ -0,0 +1,2 @@
+const _fl_get=(o,k)=>(o==null?null:(o[k]===undefined?null:o[k]));
+console.log(((__v)=>{if((true)&&(true)){let n=__v;return "got-n";}return null;})(7));

package/self/self/bench/_mt_match-wild.js

@@ -0,0 +1,2 @@
+const _fl_get=(o,k)=>(o==null?null:(o[k]===undefined?null:o[k]));
+console.log(((__v)=>{if((true)&&(true)){return "anything";}return null;})(42));

package/self/self/bench/_mt_struct-make.js

@@ -0,0 +1,4 @@
+const _fl_get=(o,k)=>(o==null?null:(o[k]===undefined?null:o[k]));
+const Point=(x,y)=>({__struct:"Point",x,y});
+const p=Point(3,4);
+console.log((_fl_get(p,"x")+_fl_get(p,"y")));

package/self/self/bench/_mt_struct-tag.js

@@ -0,0 +1,4 @@
+const _fl_get=(o,k)=>(o==null?null:(o[k]===undefined?null:o[k]));
+const User=(name,age)=>({__struct:"User",name,age});
+const u=User("kim",30);
+console.log(_fl_get(u,"__struct"));

package/self/self/bench/_rs_combo.js

@@ -0,0 +1,3 @@
+const double = (x)=>(x*2);
+const add = (a,b)=>(a+b);
+((()=>{let x=double(5);let y=add(7);return console.log((x+y));})())

package/self/self/bench/_rs_gcd.js

@@ -0,0 +1,2 @@
+const math_gcd = (a,b)=>((b===0)?a:math_gcd(b,(a%b)));
+console.log(math_gcd(18))

package/self/self/bench/_rs_grade.js

@@ -0,0 +1,2 @@
+const grade = (s)=>((s>=90)?"A":((s>=80)?"B":((s>=70)?"C":(null?"F":null))));
+console.log(grade(87))

package/self/self/bench/_rs_mutual-fib.js

@@ -0,0 +1,2 @@
+const fib = (n)=>((n===0)?0:((n===1)?1:(null?(fib((n-1))+fib((n-2))):null)));
+console.log(fib(15))

package/self/self/bench/_rs_range-sum.js

@@ -0,0 +1,2 @@
+const range_loop = (s,e,acc)=>((s>=e)?acc:range_loop((s+1),e,(acc+s)));
+console.log(range_loop(0))

package/self/self/bench/_rs_sum-5k.js

@@ -0,0 +1,2 @@
+const sum = (i,n,acc)=>((i>=n)?acc:sum((i+1),n,(acc+i)));
+console.log(sum(0))

package/self/self/bench/_sf_loop-fact-10.js

@@ -0,0 +1 @@
+console.log(((()=>{let n=10;let p=1;while(true){let __r=(()=>{return ((n===0)?p:{__recur:true,a:[(n-1),(p*n)]});})();if(__r&&__r.__recur){[n,p]=__r.a;continue;}return __r;}})()));

package/self/self/bench/_sf_loop-sum-10k.js

@@ -0,0 +1 @@
+console.log(((()=>{let i=0;let acc=0;while(true){let __r=(()=>{return ((i>=10001)?acc:{__recur:true,a:[(i+1),(acc+i)]});})();if(__r&&__r.__recur){[i,acc]=__r.a;continue;}return __r;}})()));

package/self/self/bench/_sf_set-x.js

@@ -0,0 +1,3 @@
+let x=10;
+(x=42);
+console.log(x);

package/self/self/bench/_sf_throw-catch.js

@@ -0,0 +1 @@
+console.log((()=>{try{return (()=>{throw new Error(String("boom"))})();}catch(e){return "caught";}})())

package/self/self/bench/_sf_while-5.js

@@ -0,0 +1,3 @@
+let i=0;
+(()=>{while((i<5)){(i=(i+1));}})();
+console.log(i);

package/self/stdlib/ai.fl

@@ -0,0 +1,73 @@
+;; AI 라이브러리 — 벡터 연산 + 프롬프트 + 순위 결정
+;; Phase 3-D: AI 에이전트 핵심 함수
+
+;; 1️⃣ vector-add — 벡터 덧셈
+;; [1 2 3] + [4 5 6] = [5 7 9]
+(defun vector-add [v1 v2]
+  (map (fn [i] (+ (get v1 i) (get v2 i)))
+       (range 0 (length v1))))
+
+;; 2️⃣ vector-dot — 내적 (dot product)
+;; [1 0 0] · [0 1 0] = 0
+;; [1 2 3] · [4 5 6] = 1*4 + 2*5 + 3*6 = 32
+(defun vector-dot [v1 v2]
+  (reduce (fn [acc i]
+    (+ acc (* (get v1 i) (get v2 i))))
+   0
+   (range 0 (length v1))))
+
+;; 3️⃣ vector-magnitude — 벡터 크기 (norm)
+;; |[3 4]| = sqrt(9 + 16) = 5
+(defun vector-magnitude [v]
+  (math-sqrt (vector-dot v v)))
+
+;; 4️⃣ cosine-sim — 코사인 유사도
+;; 범위: -1 (반대 방향) ~ 1 (같은 방향)
+;; 수직 벡터: 0
+(defun cosine-sim [v1 v2]
+  (let [[dot (vector-dot v1 v2)]
+        [mag1 (vector-magnitude v1)]
+        [mag2 (vector-magnitude v2)]]
+    (if (or (= mag1 0) (= mag2 0))
+      0  ; 크기가 0이면 유사도 0
+      (/ dot (* mag1 mag2)))))
+
+;; 5️⃣ score-candidates — 후보 점수 계산
+;; 결과: [{:idx 0 :score 0.95} {:idx 1 :score 0.87} ...]
+(defun score-candidates [query candidates]
+  (map-indexed (fn [idx cand]
+    {:idx idx :score (cosine-sim query cand)})
+   candidates))
+
+;; 6️⃣ prompt-template — 프롬프트 템플릿 채우기
+;; "Hello {name}, your query: {query}" + {:name "Alice" :query "help"}
+;; → "Hello Alice, your query: help"
+(defun prompt-template [template vars]
+  (reduce (fn [acc [key val]]
+    (str-replace acc 
+                  (str "{" key "}")
+                  (str val)))
+   template
+   (map-entries vars)))
+
+;; 7️⃣ top-k-retrieval — 상위 K개 반환 (점수 내림차순)
+;; 입력: [{:idx 0 :score 0.9} {:idx 1 :score 0.7} {:idx 2 :score 0.95}]
+;; K=2 → [{:idx 2 :score 0.95} {:idx 0 :score 0.9}]
+(defun top-k-retrieval [scored-list k]
+  (take k 
+    (reverse (sort scored-list 
+      (fn [a b] (< (get a :score) (get b :score)))))))
+
+;; ─────────────────────────────────────────────────────
+;; 유틸리티 함수
+;; ─────────────────────────────────────────────────────
+
+;; map-indexed — 인덱스와 함께 매핑
+(defun map-indexed [f lst]
+  (let [[indices (range 0 (length lst))]]
+    (map (fn [i] (f i (get lst i))) indices)))
+
+;; map-entries — 맵의 키-값 쌍 리스트로 변환
+;; {:a 1 :b 2} → [[:a 1] [:b 2]]
+(defun map-entries [m]
+  (map (fn [k] [k (get m k)]) (keys m)))

package/self/stdlib/assert.fl

@@ -0,0 +1,30 @@
+;; self/stdlib/assert.fl — Phase 26 Part 3
+;; 고급 assertion 함수
+
+[FUNC assert-matches :params [val pattern]
+  :body (if (regex-match pattern (str val)) true
+          (throw (str "assert-matches failed: " val " does not match " pattern)))]
+
+[FUNC assert-includes :params [list item]
+  :body (if (contains? list item) true
+          (throw (str "assert-includes failed: " item " not in " list)))]
+
+[FUNC assert-excludes :params [list item]
+  :body (if (not (contains? list item)) true
+          (throw (str "assert-excludes failed: " item " found in " list)))]
+
+[FUNC assert-length :params [coll len]
+  :body (if (= (length coll) len) true
+          (throw (str "assert-length failed: expected " len " got " (length coll))))]
+
+[FUNC assert-range :params [val min max]
+  :body (if (and (>= val min) (<= val max)) true
+          (throw (str "assert-range failed: " val " not in [" min "," max "]")))]
+
+[FUNC assert-type :params [val type]
+  :body (if (= (typeof val) type) true
+          (throw (str "assert-type failed: expected " type " got " (typeof val))))]
+
+[FUNC assert-throws :params [fn]
+  :body (try (do (fn) false)
+          (catch e true))]

package/self/stdlib/async.fl

@@ -0,0 +1,48 @@
+;; self/stdlib/async.fl — Phase 27
+;; 비동기 연산 (Promise-like patterns)
+;; 단순화: self-parser 호환 버전
+
+[FUNC promise-new :params [executor]
+  :body (promise_new executor)]
+
+[FUNC promise-resolve :params [value]
+  :body (promise_resolve value)]
+
+[FUNC promise-reject :params [reason]
+  :body (promise_reject reason)]
+
+[FUNC promise-then :params [promise handler]
+  :body (promise_then promise handler)]
+
+[FUNC promise-catch :params [promise handler]
+  :body (promise_catch promise handler)]
+
+[FUNC promise-finally :params [promise handler]
+  :body (promise_finally promise handler)]
+
+[FUNC promise-all :params [promises]
+  :body (promise_all promises)]
+
+[FUNC promise-race :params [promises]
+  :body (promise_race promises)]
+
+[FUNC promise-any :params [promises]
+  :body (promise_any promises)]
+
+[FUNC timeout :params [ms]
+  :body (timeout (floor ms))]
+
+[FUNC delay :params [ms]
+  :body (delay (floor ms))]
+
+[FUNC once :params [fn]
+  :body (once_impl fn)]
+
+[FUNC debounce :params [fn ms]
+  :body (debounce_impl fn (floor ms))]
+
+[FUNC throttle :params [fn ms]
+  :body (throttle_impl fn (floor ms))]
+
+[FUNC retry :params [fn max-attempts]
+  :body (retry_impl fn (floor max-attempts))]

package/self/stdlib/base64.fl

@@ -0,0 +1,22 @@
+;; self/stdlib/base64.fl — Phase 26 Part 3
+;; Base64 인코딩/디코딩
+
+[FUNC base64-encode :params [s]
+  :body (let [[b (str s)]]
+          (base64_encode b))]
+
+[FUNC base64-decode :params [s]
+  :body (base64_decode (str s))]
+
+[FUNC is-base64? :params [s]
+  :body (let [[pat "^[A-Za-z0-9+/]*={0,2}$"]]
+          (if (= (% (length s) 4) 0)
+            (regex-match pat s)
+            false))]
+
+[FUNC base64-safe-encode :params [s]
+  :body (let [[encoded (base64-encode s)]]
+          (replace (replace (str encoded) "+" "-") "/" "_"))]
+
+[FUNC base64-safe-decode :params [s]
+  :body (base64-decode (replace (replace (str s) "-" "+") "_" "/"))]

package/self/stdlib/binary.fl

@@ -0,0 +1,30 @@
+;; self/stdlib/binary.fl — Phase 26 Part 3
+;; 비트 연산
+
+[FUNC bit-and :params [a b] :body (bit-and-op a b)]
+[FUNC bit-and-op :params [a b] :body (floor (/ (mod (* a b) 256) 1))]
+
+[FUNC bit-or :params [a b] :body (floor (+ (- a (bit-and a b)) (- b (bit-and a b))))]
+
+[FUNC bit-xor :params [a b] :body (floor (+ (bit-and a (bit-or 255 (- b 1))) (bit-and b (bit-or 255 (- a 1)))))]
+
+[FUNC bit-not :params [a] :body (- 255 (mod (floor a) 256))]
+
+[FUNC bit-shift-left :params [n bits] :body (* n (pow 2 bits))]
+
+[FUNC bit-shift-right :params [n bits] :body (floor (/ n (pow 2 bits)))]
+
+[FUNC bit-count-ones :params [n]
+  :body (bit-count-loop (mod (floor n) 256) 0 0)]
+[FUNC bit-count-loop :params [n i count]
+  :body (if (>= i 8) count
+          (bit-count-loop (floor (/ n 2)) (+ i 1)
+            (+ count (mod n 2))))]
+
+[FUNC bytes-to-hex :params [bytes]
+  :body (bytes-hex-loop bytes 0 "")]
+[FUNC bytes-hex-loop :params [bytes i acc]
+  :body (if (>= i (length bytes)) acc
+          (let [[byte (get bytes i)]
+                [hex (pad-zero (floor (% byte 256)) 2)]]
+            (bytes-hex-loop bytes (+ i 1) (str acc hex))))]

package/self/stdlib/build.fl

@@ -0,0 +1,69 @@
+;; self/stdlib/build.fl — Phase 29
+;; 빌드 시스템 (정적 생성, 번들링, 최적화)
+
+[FUNC build-static :params [input-dir output-dir]
+  :body (build-static-recursive (str input-dir) (str output-dir) (file_list (str input-dir)))]
+[FUNC build-static-recursive :params [input output files]
+  :body (if (= (length files) 0) (str "Built to " output)
+          (let [[file (get files 0)]]
+            (do (build-static-file (str input "/" file) (str output "/" file))
+                (build-static-recursive input output (rest files)))))]
+
+[FUNC build-static-file :params [src dest]
+  :body (if (ends-with? (str src) ".fl")
+          (do (file_write (str dest)
+                         (node bootstrap.js run (str src)))
+              (str "✅ " src " → " dest))
+          (file_copy (str src) (str dest)))]
+
+[FUNC bundle-assets :params [dir]
+  :body (bundle-assets-loop (file_list (str dir)) (str dir) (list))]
+[FUNC bundle-assets-loop :params [files dir acc]
+  :body (if (= (length files) 0) acc
+          (let [[file (get files 0)]
+                [path (str dir "/" file)]]
+            (bundle-assets-loop (rest files) dir
+              (if (is-asset-file? path)
+                (append acc (list path))
+                acc))))]
+
+[FUNC is-asset-file? :params [path]
+  :body (let [[ext (lower (path-extname (str path)))]]
+          (contains? (list ".css" ".js" ".png" ".jpg" ".svg" ".webp")
+                    ext))]
+
+[FUNC minify-html :params [html]
+  :body (let [[content (str html)]]
+          (replace (replace (replace content "\n" " ") "  " " ") "  " " "))]
+
+[FUNC minify-css :params [css]
+  :body (replace (replace (str css) "\n" "") " { " "{")]
+
+[FUNC minify-js :params [js]
+  :body (str js)]
+
+[FUNC optimize-images :params [dir]
+  :body (optimize-images-loop (file_list (str dir)) (str dir))]
+[FUNC optimize-images-loop :params [files dir]
+  :body (if (= (length files) 0) (str "Images optimized in " dir)
+          (let [[file (get files 0)]
+                [path (str dir "/" file)]]
+            (do (if (is-image-file? path)
+                  (image_optimize path 80))
+                (optimize-images-loop (rest files) dir))))]
+
+[FUNC generate-sitemap :params [pages domain]
+  :body (str "<?xml version=\"1.0\" encoding=\"UTF-8\"?>"
+             "<urlset xmlns=\"http://www.sitemaps.org/schemas/sitemap/0.9\">"
+             (generate-sitemap-entries pages (str domain))
+             "</urlset>")]
+[FUNC generate-sitemap-entries :params [pages domain]
+  :body (if (= (length pages) 0) ""
+          (str "<url><loc>" domain "/" (get pages 0) "</loc></url>"
+               (generate-sitemap-entries (rest pages) domain)))]
+
+[FUNC build-report :params [build-time file-count total-size]
+  :body (list
+    (str "Build Time: " build-time "ms")
+    (str "Files: " file-count)
+    (str "Total Size: " (/ total-size 1024) "KB"))]