freelang-editor 11.7.4

package/self/bench/string.js

@@ -0,0 +1,7 @@
+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_find = (f, l) => (l.find(x => f(x)) ?? null);const _fl_every = (f, l) => l.every(x => f(x));const _fl_some = (f, l) => l.some(x => f(x));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_flatten = (l) => l.flat(Infinity);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_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_entries = (o) => (o==null ? [] : Object.entries(o).map(([k,v])=>[k,v]));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_map_set = (o, k, v) => ({...o, [k]: v});const _fl_map_delete = (o, k) => { const c={...o}; delete c[k]; return c; };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);const map_entries = (m) => m instanceof Map ? [...m.entries()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.entries(m) : []);const map_keys = (m) => m instanceof Map ? [...m.keys()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.keys(m) : []);const map_values = (m) => m instanceof Map ? [...m.values()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.values(m) : []);const _fl_file_read = (p) => require('fs').readFileSync(p, 'utf8');const _fl_file_write = (p, c) => require('fs').writeFileSync(p, c);const _fl_file_exists = (p) => require('fs').existsSync(p);const _fl_shell_capture = (cmd) => { try { const {execSync}=require('child_process'); return {stdout:execSync(cmd,{encoding:'utf8'}),stderr:'',code:0}; } catch(e) { return {stdout:'',stderr:String(e),code:1}; } };const _fl_empty_q = (x) => (x==null || x.length===0);const __argv__ = process.argv.slice(2);
+const str_starts_with_q = (s,prefix)=>((_fl_length(prefix)>_fl_length(s))?false:(_fl_substring(s,0,_fl_length(prefix))===prefix));;
+const str_ends_with_q = (s,suffix)=>((_fl_length(suffix)>_fl_length(s))?false:(_fl_substring(s,(_fl_length(s)-_fl_length(suffix)),_fl_length(s))===suffix));;
+const str_repeat = (s,n)=>str_repeat_loop(s,n,"");;
+const str_repeat_loop = (s,n,acc)=>((n<=0)?acc:str_repeat_loop(s,(n-1),_fl_str(acc,s)));;
+const str_pad_left = (s,n,pad)=>((()=>{let diff=(n-_fl_length(s));return ((diff<=0)?s:_fl_str(str_repeat(pad,diff),s));})());;
+const str_pad_right = (s,n,pad)=>((()=>{let diff=(n-_fl_length(s));return ((diff<=0)?s:_fl_str(s,str_repeat(pad,diff)));})());;

package/self/bench/test-ffi.fl

@@ -0,0 +1,3 @@
+(do
+  (file_write "self/bench/test-output.txt" "hello from FFI")
+  (file_read "self/bench/test-output.txt"))

package/self/bench/test-ffi.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_find = (f, l) => (l.find(x => f(x)) ?? null);const _fl_every = (f, l) => l.every(x => f(x));const _fl_some = (f, l) => l.some(x => f(x));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_flatten = (l) => l.flat(Infinity);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_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_entries = (o) => (o==null ? [] : Object.entries(o).map(([k,v])=>[k,v]));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_map_set = (o, k, v) => ({...o, [k]: v});const _fl_map_delete = (o, k) => { const c={...o}; delete c[k]; return c; };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);const map_entries = (m) => m instanceof Map ? [...m.entries()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.entries(m) : []);const map_keys = (m) => m instanceof Map ? [...m.keys()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.keys(m) : []);const map_values = (m) => m instanceof Map ? [...m.values()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.values(m) : []);const now = () => Date.now();const now_ms = () => Date.now();const now_iso = () => new Date().toISOString();const now_unix = () => Math.floor(Date.now()/1000);const regex_match = (s, p) => new RegExp(p).test(s);const regex_find = (s, p) => { const m = s.match(new RegExp(p)); return m ? m[0] : null; };const regex_find_all = (s, p) => s.match(new RegExp(p, 'g')) || [];const regex_replace = (s, p, r) => s.replace(new RegExp(p, 'g'), r);const regex_split = (s, p) => s.split(new RegExp(p));const regex_count = (s, p) => (s.match(new RegExp(p, 'g')) || []).length;const regex_extract = (s, p) => { const m = s.match(new RegExp(p)); return m ? m.slice(1) : []; };const _fl_file_read = (p) => require('fs').readFileSync(p, 'utf8');const _fl_file_write = (p, c) => require('fs').writeFileSync(p, c);const _fl_file_exists = (p) => require('fs').existsSync(p);const _fl_shell_capture = (cmd) => { try { const {execSync}=require('child_process'); return {stdout:execSync(cmd,{encoding:'utf8'}),stderr:'',code:0}; } catch(e) { return {stdout:'',stderr:String(e),code:1}; } };const _fl_empty_q = (x) => (x==null || x.length===0);const __argv__ = process.argv.slice(2);
+(()=>{_fl_file_write("self/bench/test-output.txt","hello from FFI");return _fl_file_read("self/bench/test-output.txt");})();

package/self/bench/test-hof-advanced.fl

@@ -0,0 +1,7 @@
+(do
+  (let [[nums (list 1 2 3 4 5)]]
+    (do
+      (println "=== Advanced HOF ===")
+      (println (str "numbers: " nums))
+      (let [[sum-direct (+ 1 2 3 4 5)]]
+        (println (str "sum direct: " sum-direct))))))

package/self/bench/test-hof-advanced.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_find = (f, l) => (l.find(x => f(x)) ?? null);const _fl_every = (f, l) => l.every(x => f(x));const _fl_some = (f, l) => l.some(x => f(x));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_flatten = (l) => l.flat(Infinity);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_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_entries = (o) => (o==null ? [] : Object.entries(o).map(([k,v])=>[k,v]));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_map_set = (o, k, v) => ({...o, [k]: v});const _fl_map_delete = (o, k) => { const c={...o}; delete c[k]; return c; };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);const map_entries = (m) => m instanceof Map ? [...m.entries()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.entries(m) : []);const map_keys = (m) => m instanceof Map ? [...m.keys()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.keys(m) : []);const map_values = (m) => m instanceof Map ? [...m.values()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.values(m) : []);const now = () => Date.now();const now_ms = () => Date.now();const now_iso = () => new Date().toISOString();const now_unix = () => Math.floor(Date.now()/1000);const regex_match = (s, p) => new RegExp(p).test(s);const regex_find = (s, p) => { const m = s.match(new RegExp(p)); return m ? m[0] : null; };const regex_find_all = (s, p) => s.match(new RegExp(p, 'g')) || [];const regex_replace = (s, p, r) => s.replace(new RegExp(p, 'g'), r);const regex_split = (s, p) => s.split(new RegExp(p));const regex_count = (s, p) => (s.match(new RegExp(p, 'g')) || []).length;const regex_extract = (s, p) => { const m = s.match(new RegExp(p)); return m ? m.slice(1) : []; };const _fl_file_read = (p) => require('fs').readFileSync(p, 'utf8');const _fl_file_write = (p, c) => require('fs').writeFileSync(p, c);const _fl_file_exists = (p) => require('fs').existsSync(p);const _fl_shell_capture = (cmd) => { try { const {execSync}=require('child_process'); return {stdout:execSync(cmd,{encoding:'utf8'}),stderr:'',code:0}; } catch(e) { return {stdout:'',stderr:String(e),code:1}; } };const _fl_empty_q = (x) => (x==null || x.length===0);const __argv__ = process.argv.slice(2);const _fl_pg_exec = (db,sql,...args) => null;const _fl_pg_query = (db,sql,...args) => [];const _fl_pg_connect = (cfg) => null;const _fl_mariadb_exec = (db,sql,...args) => null;const _fl_mariadb_query = (db,sql,...args) => [];const _fl_mariadb_one = (db,sql,...args) => null;const _fl_db_query = (path,sql,...args) => [];const _fl_db_exec = (path,sql,...args) => null;
+(()=>{return ((()=>{let nums=[1,2,3,4,5];return (()=>{console.log("=== Advanced HOF ===");console.log(_fl_str("numbers: ",nums));return ((()=>{let sum_direct=(1+2+3+4+5);return console.log(_fl_str("sum direct: ",sum_direct));})());})();})());})();

package/self/bench/test-hof.fl

@@ -0,0 +1,5 @@
+(do
+  (let [[nums (list 1 2 3 4 5)]]
+    (do
+      (println "=== HOF Test ===")
+      (println (str "map with +: test")))))

package/self/bench/test-hof.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_find = (f, l) => (l.find(x => f(x)) ?? null);const _fl_every = (f, l) => l.every(x => f(x));const _fl_some = (f, l) => l.some(x => f(x));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_flatten = (l) => l.flat(Infinity);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_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_entries = (o) => (o==null ? [] : Object.entries(o).map(([k,v])=>[k,v]));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_map_set = (o, k, v) => ({...o, [k]: v});const _fl_map_delete = (o, k) => { const c={...o}; delete c[k]; return c; };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);const map_entries = (m) => m instanceof Map ? [...m.entries()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.entries(m) : []);const map_keys = (m) => m instanceof Map ? [...m.keys()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.keys(m) : []);const map_values = (m) => m instanceof Map ? [...m.values()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.values(m) : []);const now = () => Date.now();const now_ms = () => Date.now();const now_iso = () => new Date().toISOString();const now_unix = () => Math.floor(Date.now()/1000);const regex_match = (s, p) => new RegExp(p).test(s);const regex_find = (s, p) => { const m = s.match(new RegExp(p)); return m ? m[0] : null; };const regex_find_all = (s, p) => s.match(new RegExp(p, 'g')) || [];const regex_replace = (s, p, r) => s.replace(new RegExp(p, 'g'), r);const regex_split = (s, p) => s.split(new RegExp(p));const regex_count = (s, p) => (s.match(new RegExp(p, 'g')) || []).length;const regex_extract = (s, p) => { const m = s.match(new RegExp(p)); return m ? m.slice(1) : []; };const _fl_file_read = (p) => require('fs').readFileSync(p, 'utf8');const _fl_file_write = (p, c) => require('fs').writeFileSync(p, c);const _fl_file_exists = (p) => require('fs').existsSync(p);const _fl_shell_capture = (cmd) => { try { const {execSync}=require('child_process'); return {stdout:execSync(cmd,{encoding:'utf8'}),stderr:'',code:0}; } catch(e) { return {stdout:'',stderr:String(e),code:1}; } };const _fl_empty_q = (x) => (x==null || x.length===0);const __argv__ = process.argv.slice(2);const _fl_pg_exec = (db,sql,...args) => null;const _fl_pg_query = (db,sql,...args) => [];const _fl_pg_connect = (cfg) => null;const _fl_mariadb_exec = (db,sql,...args) => null;const _fl_mariadb_query = (db,sql,...args) => [];const _fl_mariadb_one = (db,sql,...args) => null;const _fl_db_query = (path,sql,...args) => [];const _fl_db_exec = (path,sql,...args) => null;
+(()=>{return ((()=>{let nums=[1,2,3,4,5];return (()=>{console.log("=== HOF Test ===");return console.log(_fl_str("map with +: test"));})();})());})();

package/self/bench/test-output.txt

@@ -0,0 +1 @@
+hello from FFI

package/self/bench/test-phase15-integration.fl

@@ -0,0 +1,16 @@
+(defn fib [n]
+  (if (<= n 1) n
+      (+ (fib (- n 1)) (fib (- n 2)))))
+
+(do
+  (println "=== Phase 15 Integration ===")
+  (let [[nums (list 5 2 8 1 9)]
+        [sorted (sort nums)]
+        [reversed (reverse sorted)]
+        [fib10 (fib 10)]
+        [str-up (upper "hello")]]
+    (do
+      (println (str "sorted: " sorted))
+      (println (str "reversed: " reversed))
+      (println (str "fib(10): " fib10))
+      (println (str "upper: " str-up)))))

package/self/bench/test-phase15-integration.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_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_find = (f, l) => (l.find(x => f(x)) ?? null);const _fl_every = (f, l) => l.every(x => f(x));const _fl_some = (f, l) => l.some(x => f(x));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_flatten = (l) => l.flat(Infinity);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_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_entries = (o) => (o==null ? [] : Object.entries(o).map(([k,v])=>[k,v]));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_map_set = (o, k, v) => ({...o, [k]: v});const _fl_map_delete = (o, k) => { const c={...o}; delete c[k]; return c; };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);const map_entries = (m) => m instanceof Map ? [...m.entries()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.entries(m) : []);const map_keys = (m) => m instanceof Map ? [...m.keys()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.keys(m) : []);const map_values = (m) => m instanceof Map ? [...m.values()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.values(m) : []);const now = () => Date.now();const now_ms = () => Date.now();const now_iso = () => new Date().toISOString();const now_unix = () => Math.floor(Date.now()/1000);const regex_match = (s, p) => new RegExp(p).test(s);const regex_find = (s, p) => { const m = s.match(new RegExp(p)); return m ? m[0] : null; };const regex_find_all = (s, p) => s.match(new RegExp(p, 'g')) || [];const regex_replace = (s, p, r) => s.replace(new RegExp(p, 'g'), r);const regex_split = (s, p) => s.split(new RegExp(p));const regex_count = (s, p) => (s.match(new RegExp(p, 'g')) || []).length;const regex_extract = (s, p) => { const m = s.match(new RegExp(p)); return m ? m.slice(1) : []; };const _fl_file_read = (p) => require('fs').readFileSync(p, 'utf8');const _fl_file_write = (p, c) => require('fs').writeFileSync(p, c);const _fl_file_exists = (p) => require('fs').existsSync(p);const _fl_shell_capture = (cmd) => { try { const {execSync}=require('child_process'); return {stdout:execSync(cmd,{encoding:'utf8'}),stderr:'',code:0}; } catch(e) { return {stdout:'',stderr:String(e),code:1}; } };const _fl_empty_q = (x) => (x==null || x.length===0);const __argv__ = process.argv.slice(2);const _fl_pg_exec = (db,sql,...args) => null;const _fl_pg_query = (db,sql,...args) => [];const _fl_pg_connect = (cfg) => null;const _fl_mariadb_exec = (db,sql,...args) => null;const _fl_mariadb_query = (db,sql,...args) => [];const _fl_mariadb_one = (db,sql,...args) => null;const _fl_db_query = (path,sql,...args) => [];const _fl_db_exec = (path,sql,...args) => null;
+const fib = (n)=>((n<=1)?n:(fib((n-1))+fib((n-2))));
+(()=>{console.log("=== Phase 15 Integration ===");return ((()=>{let nums=[5,2,8,1,9];let sorted=_fl_sort(nums);let reversed=_fl_reverse(sorted);let fib10=fib(10);let str_up=_fl_upper("hello");return (()=>{console.log(_fl_str("sorted: ",sorted));console.log(_fl_str("reversed: ",reversed));console.log(_fl_str("fib(10): ",fib10));return console.log(_fl_str("upper: ",str_up));})();})());})();

package/self/bench/test-phase19-complete.fl

@@ -0,0 +1,24 @@
+;; 전체 stdlib 모듈 통합 테스트
+(do
+  (println "=== Phase 19: Complete Stdlib Integration ===")
+  
+  ;; String ops
+  (let [[s "hello world"]]
+    (do
+      (println (str "string: " (upper s) " / " (lower s)))
+      (println (str "split: " (split s " ")))))
+  
+  ;; List ops
+  (let [[nums (list 5 2 8 1 9 3)]]
+    (do
+      (println (str "list ops: sort=" (sort nums)))
+      (println (str "list ops: reverse=" (reverse (sort nums))))))
+  
+  ;; Time
+  (let [[t (now_ms)]
+        [iso (now_iso)]]
+    (do
+      (println (str "time: now_ms=" (number? t)))
+      (println (str "time: now_iso=" (string? iso)))))
+  
+  (println "✓ All stdlib modules verified"))

package/self/bench/test-phase19-complete.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_find = (f, l) => (l.find(x => f(x)) ?? null);const _fl_every = (f, l) => l.every(x => f(x));const _fl_some = (f, l) => l.some(x => f(x));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_flatten = (l) => l.flat(Infinity);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_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_entries = (o) => (o==null ? [] : Object.entries(o).map(([k,v])=>[k,v]));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_map_set = (o, k, v) => ({...o, [k]: v});const _fl_map_delete = (o, k) => { const c={...o}; delete c[k]; return c; };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);const map_entries = (m) => m instanceof Map ? [...m.entries()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.entries(m) : []);const map_keys = (m) => m instanceof Map ? [...m.keys()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.keys(m) : []);const map_values = (m) => m instanceof Map ? [...m.values()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.values(m) : []);const now = () => Date.now();const now_ms = () => Date.now();const now_iso = () => new Date().toISOString();const now_unix = () => Math.floor(Date.now()/1000);const regex_match = (s, p) => new RegExp(p).test(s);const regex_find = (s, p) => { const m = s.match(new RegExp(p)); return m ? m[0] : null; };const regex_find_all = (s, p) => s.match(new RegExp(p, 'g')) || [];const regex_replace = (s, p, r) => s.replace(new RegExp(p, 'g'), r);const regex_split = (s, p) => s.split(new RegExp(p));const regex_count = (s, p) => (s.match(new RegExp(p, 'g')) || []).length;const regex_extract = (s, p) => { const m = s.match(new RegExp(p)); return m ? m.slice(1) : []; };const _fl_file_read = (p) => require('fs').readFileSync(p, 'utf8');const _fl_file_write = (p, c) => require('fs').writeFileSync(p, c);const _fl_file_exists = (p) => require('fs').existsSync(p);const _fl_shell_capture = (cmd) => { try { const {execSync}=require('child_process'); return {stdout:execSync(cmd,{encoding:'utf8'}),stderr:'',code:0}; } catch(e) { return {stdout:'',stderr:String(e),code:1}; } };const _fl_empty_q = (x) => (x==null || x.length===0);const __argv__ = process.argv.slice(2);const _fl_pg_exec = (db,sql,...args) => null;const _fl_pg_query = (db,sql,...args) => [];const _fl_pg_connect = (cfg) => null;const _fl_mariadb_exec = (db,sql,...args) => null;const _fl_mariadb_query = (db,sql,...args) => [];const _fl_mariadb_one = (db,sql,...args) => null;const _fl_db_query = (path,sql,...args) => [];const _fl_db_exec = (path,sql,...args) => null;const _fl_server_post = (path,fn) => null;const _fl_server_get = (path,fn) => null;const _fl_server_put = (path,fn) => null;const _fl_server_delete = (path,fn) => null;const _fl_server_start = (port) => null;const _fl_server_stop = () => null;const _fl_http_get = (url) => '';const _fl_http_post = (url,body) => '';const _fl_ws_send = (sid,data) => null;
+(()=>{console.log("=== Phase 19: Complete Stdlib Integration ===");((()=>{let s="hello world";return (()=>{console.log(_fl_str("string: ",_fl_upper(s)," / ",_fl_lower(s)));return console.log(_fl_str("split: ",_fl_split(s," ")));})();})());((()=>{let nums=[5,2,8,1,9,3];return (()=>{console.log(_fl_str("list ops: sort=",_fl_sort(nums)));return console.log(_fl_str("list ops: reverse=",_fl_reverse(_fl_sort(nums))));})();})());((()=>{let t=now_ms();let iso=now_iso();return (()=>{console.log(_fl_str("time: now_ms=",(typeof t==="number")));return console.log(_fl_str("time: now_iso=",(typeof iso==="string")));})();})());return console.log("✓ All stdlib modules verified");})();

package/self/bench/test-stdlib-codegen.fl

@@ -0,0 +1,9 @@
+;; Test stdlib module codegen
+(do
+  (println "=== stdlib codegen test ===")
+  (let [[nums (list 1 2 3 4 5)]]
+    (do
+      (println (str "original: " nums))
+      (println (str "reverse: " (reverse nums)))
+      (println (str "sorted: " (sort nums)))
+      (println (str "string ops: " (upper "hello"))))))

package/self/bench/test-stdlib-codegen.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_find = (f, l) => (l.find(x => f(x)) ?? null);const _fl_every = (f, l) => l.every(x => f(x));const _fl_some = (f, l) => l.some(x => f(x));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_flatten = (l) => l.flat(Infinity);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_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_entries = (o) => (o==null ? [] : Object.entries(o).map(([k,v])=>[k,v]));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_map_set = (o, k, v) => ({...o, [k]: v});const _fl_map_delete = (o, k) => { const c={...o}; delete c[k]; return c; };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);const map_entries = (m) => m instanceof Map ? [...m.entries()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.entries(m) : []);const map_keys = (m) => m instanceof Map ? [...m.keys()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.keys(m) : []);const map_values = (m) => m instanceof Map ? [...m.values()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.values(m) : []);const now = () => Date.now();const now_ms = () => Date.now();const now_iso = () => new Date().toISOString();const now_unix = () => Math.floor(Date.now()/1000);const regex_match = (s, p) => new RegExp(p).test(s);const regex_find = (s, p) => { const m = s.match(new RegExp(p)); return m ? m[0] : null; };const regex_find_all = (s, p) => s.match(new RegExp(p, 'g')) || [];const regex_replace = (s, p, r) => s.replace(new RegExp(p, 'g'), r);const regex_split = (s, p) => s.split(new RegExp(p));const regex_count = (s, p) => (s.match(new RegExp(p, 'g')) || []).length;const regex_extract = (s, p) => { const m = s.match(new RegExp(p)); return m ? m.slice(1) : []; };const _fl_file_read = (p) => require('fs').readFileSync(p, 'utf8');const _fl_file_write = (p, c) => require('fs').writeFileSync(p, c);const _fl_file_exists = (p) => require('fs').existsSync(p);const _fl_shell_capture = (cmd) => { try { const {execSync}=require('child_process'); return {stdout:execSync(cmd,{encoding:'utf8'}),stderr:'',code:0}; } catch(e) { return {stdout:'',stderr:String(e),code:1}; } };const _fl_empty_q = (x) => (x==null || x.length===0);const __argv__ = process.argv.slice(2);const _fl_pg_exec = (db,sql,...args) => null;const _fl_pg_query = (db,sql,...args) => [];const _fl_pg_connect = (cfg) => null;const _fl_mariadb_exec = (db,sql,...args) => null;const _fl_mariadb_query = (db,sql,...args) => [];const _fl_mariadb_one = (db,sql,...args) => null;const _fl_db_query = (path,sql,...args) => [];const _fl_db_exec = (path,sql,...args) => null;
+(()=>{console.log("=== stdlib codegen test ===");return ((()=>{let nums=[1,2,3,4,5];return (()=>{console.log(_fl_str("original: ",nums));console.log(_fl_str("reverse: ",_fl_reverse(nums)));console.log(_fl_str("sorted: ",_fl_sort(nums)));return console.log(_fl_str("string ops: ",_fl_upper("hello")));})();})());})();

package/self/bench/test-time.fl

@@ -0,0 +1,8 @@
+(do
+  (let [[t1 (now_ms)]
+        [t2 (now_iso)]
+        [t3 (now_unix)]]
+    (do
+      (println (str "now_ms: " (number? t1)))
+      (println (str "now_iso: " (string? t2)))
+      (println (str "now_unix: " (number? t3))))))

package/self/bench/test-time.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_find = (f, l) => (l.find(x => f(x)) ?? null);const _fl_every = (f, l) => l.every(x => f(x));const _fl_some = (f, l) => l.some(x => f(x));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_flatten = (l) => l.flat(Infinity);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_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_entries = (o) => (o==null ? [] : Object.entries(o).map(([k,v])=>[k,v]));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_map_set = (o, k, v) => ({...o, [k]: v});const _fl_map_delete = (o, k) => { const c={...o}; delete c[k]; return c; };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);const map_entries = (m) => m instanceof Map ? [...m.entries()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.entries(m) : []);const map_keys = (m) => m instanceof Map ? [...m.keys()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.keys(m) : []);const map_values = (m) => m instanceof Map ? [...m.values()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.values(m) : []);const now = () => Date.now();const now_ms = () => Date.now();const now_iso = () => new Date().toISOString();const now_unix = () => Math.floor(Date.now()/1000);const regex_match = (s, p) => new RegExp(p).test(s);const regex_find = (s, p) => { const m = s.match(new RegExp(p)); return m ? m[0] : null; };const regex_find_all = (s, p) => s.match(new RegExp(p, 'g')) || [];const regex_replace = (s, p, r) => s.replace(new RegExp(p, 'g'), r);const regex_split = (s, p) => s.split(new RegExp(p));const regex_count = (s, p) => (s.match(new RegExp(p, 'g')) || []).length;const regex_extract = (s, p) => { const m = s.match(new RegExp(p)); return m ? m.slice(1) : []; };const _fl_file_read = (p) => require('fs').readFileSync(p, 'utf8');const _fl_file_write = (p, c) => require('fs').writeFileSync(p, c);const _fl_file_exists = (p) => require('fs').existsSync(p);const _fl_shell_capture = (cmd) => { try { const {execSync}=require('child_process'); return {stdout:execSync(cmd,{encoding:'utf8'}),stderr:'',code:0}; } catch(e) { return {stdout:'',stderr:String(e),code:1}; } };const _fl_empty_q = (x) => (x==null || x.length===0);const __argv__ = process.argv.slice(2);
+(()=>{return ((()=>{let t1=now_ms();let t2=now_iso();let t3=now_unix();return (()=>{console.log(_fl_str("now_ms: ",(typeof t1==="number")));console.log(_fl_str("now_iso: ",(typeof t2==="string")));return console.log(_fl_str("now_unix: ",(typeof t3==="number")));})();})());})();

package/self/bench/time.js

@@ -0,0 +1,9 @@
+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_find = (f, l) => (l.find(x => f(x)) ?? null);const _fl_every = (f, l) => l.every(x => f(x));const _fl_some = (f, l) => l.some(x => f(x));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_flatten = (l) => l.flat(Infinity);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_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_entries = (o) => (o==null ? [] : Object.entries(o).map(([k,v])=>[k,v]));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_map_set = (o, k, v) => ({...o, [k]: v});const _fl_map_delete = (o, k) => { const c={...o}; delete c[k]; return c; };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);const map_entries = (m) => m instanceof Map ? [...m.entries()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.entries(m) : []);const map_keys = (m) => m instanceof Map ? [...m.keys()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.keys(m) : []);const map_values = (m) => m instanceof Map ? [...m.values()] : (m && typeof m === 'object' && !Array.isArray(m) ? Object.values(m) : []);const _fl_file_read = (p) => require('fs').readFileSync(p, 'utf8');const _fl_file_write = (p, c) => require('fs').writeFileSync(p, c);const _fl_file_exists = (p) => require('fs').existsSync(p);const _fl_shell_capture = (cmd) => { try { const {execSync}=require('child_process'); return {stdout:execSync(cmd,{encoding:'utf8'}),stderr:'',code:0}; } catch(e) { return {stdout:'',stderr:String(e),code:1}; } };const _fl_empty_q = (x) => (x==null || x.length===0);const __argv__ = process.argv.slice(2);
+const now_ms = ()=>now();;
+const now_s = ()=>Math.floor((now()/1000));;
+const time_diff_ms = (t1,t2)=>(t2-t1);;
+const time_elapsed = (start)=>(now()-start);;
+const date_parts = (ts)=>({"ts":ts,"s":Math.floor((ts/1000)),"m":Math.floor((ts/60000)),"h":Math.floor((ts/3600000)),"d":Math.floor((ts/86400000))});;
+const ts_to_s = (ts)=>Math.floor((ts/1000));;
+const s_to_ts = (s)=>(s*1000);;
+const time_ago = (ts)=>((()=>{let diff=(now()-ts);let s=Math.floor((diff/1000));let m=Math.floor((s/60));let h=Math.floor((m/60));let d=Math.floor((h/24));return ((s<60)?_fl_str(s,"s ago"):((m<60)?_fl_str(m,"m ago"):((h<24)?_fl_str(h,"h ago"):(true?_fl_str(d,"d ago"):null))));})());;

package/self/bench/tiny-v12.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_find = (f, l) => (l.find(x => f(x)) ?? null);const _fl_every = (f, l) => l.every(x => f(x));const _fl_some = (f, l) => l.some(x => f(x));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_flatten = (l) => l.flat(Infinity);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_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_entries = (o) => (o==null ? [] : Object.entries(o).map(([k,v])=>[k,v]));const _fl_has_key = (o, k) => (o!=null && k in o);const _fl_map_set = (o, k, v) => ({...o, [k]: v});const _fl_map_delete = (o, k) => { const c={...o}; delete c[k]; return c; };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);const _fl_file_read = (p) => require('fs').readFileSync(p, 'utf8');const _fl_file_write = (p, c) => require('fs').writeFileSync(p, c);const _fl_file_exists = (p) => require('fs').existsSync(p);const _fl_shell_capture = (cmd) => { try { const {execSync}=require('child_process'); return {stdout:execSync(cmd,{encoding:'utf8'}),stderr:'',code:0}; } catch(e) { return {stdout:'',stderr:String(e),code:1}; } };const _fl_empty_q = (x) => (x==null || x.length===0);const __argv__ = process.argv.slice(2);
+console.log(42);

package/self/bench/tiny.fl

@@ -0,0 +1 @@
+(println 42)

package/self/builtins/core.fl

@@ -0,0 +1,150 @@
+;; self/builtins/core.fl — Phase 07/77-86
+;;
+;; native-call 가 위임할 ~60 개 핵심 빌트인.
+;; self-interp 은 이 함수들을 고정된 cond 분기로 호출.
+;;
+;; 각 함수는 [FUNC native-<op> :params [vs] :body ...]
+;; vs = 평가된 인자 리스트.
+;;
+;; 모든 함수는 FL 런타임의 primitive 를 최종적으로 사용 (실제 산술).
+;; 즉 "파서/인터프리터는 100% FL, 최종 연산만 runtime primitive".
+;; 이는 컴파일러가 없는 인터프리터 셀프호스팅에서 불가피.
+
+;; ═══════════════ 산술 (~12) ═══════════════
+
+[FUNC bi-add :params [vs]
+  :body (add-loop vs 0 0)]
+[FUNC add-loop :params [vs i acc]
+  :body (if (>= i (length vs)) acc (add-loop vs (+ i 1) (+ acc (get vs i))))]
+
+[FUNC bi-sub :params [vs]
+  :body (if (= (length vs) 1) (- 0 (get vs 0))
+          (- (get vs 0) (add-loop vs 1 0)))]
+
+[FUNC bi-mul :params [vs]
+  :body (mul-loop vs 0 1)]
+[FUNC mul-loop :params [vs i acc]
+  :body (if (>= i (length vs)) acc (mul-loop vs (+ i 1) (* acc (get vs i))))]
+
+[FUNC bi-div :params [vs] :body (/ (get vs 0) (get vs 1))]
+[FUNC bi-mod :params [vs] :body (% (get vs 0) (get vs 1))]
+[FUNC bi-abs :params [vs] :body (let [[v (get vs 0)]] (if (< v 0) (- 0 v) v))]
+
+[FUNC bi-min :params [vs] :body (min-loop vs 1 (get vs 0))]
+[FUNC min-loop :params [vs i acc]
+  :body (if (>= i (length vs)) acc
+          (let [[x (get vs i)]]
+            (min-loop vs (+ i 1) (if (< x acc) x acc))))]
+
+[FUNC bi-max :params [vs] :body (max-loop vs 1 (get vs 0))]
+[FUNC max-loop :params [vs i acc]
+  :body (if (>= i (length vs)) acc
+          (let [[x (get vs i)]]
+            (max-loop vs (+ i 1) (if (> x acc) x acc))))]
+
+;; ═══════════════ 비교 (~10) ═══════════════
+
+[FUNC bi-lt :params [vs] :body (< (get vs 0) (get vs 1))]
+[FUNC bi-gt :params [vs] :body (> (get vs 0) (get vs 1))]
+[FUNC bi-le :params [vs] :body (<= (get vs 0) (get vs 1))]
+[FUNC bi-ge :params [vs] :body (>= (get vs 0) (get vs 1))]
+[FUNC bi-eq :params [vs] :body (= (get vs 0) (get vs 1))]
+[FUNC bi-ne :params [vs] :body (not (= (get vs 0) (get vs 1)))]
+
+;; ═══════════════ 논리 (5) ═══════════════
+
+[FUNC bi-not :params [vs] :body (not (get vs 0))]
+[FUNC bi-null? :params [vs] :body (null? (get vs 0))]
+[FUNC bi-empty? :params [vs]
+  :body (let [[v (get vs 0)]]
+          (cond [(null? v) true]
+                [(= (length v) 0) true]
+                [true false]))]
+
+;; ═══════════════ 문자열 (~10) ═══════════════
+
+[FUNC bi-str :params [vs] :body (str-loop vs 0 "")]
+[FUNC str-loop :params [vs i acc]
+  :body (if (>= i (length vs)) acc
+          (str-loop vs (+ i 1) (str acc (get vs i))))]
+
+[FUNC bi-length :params [vs] :body (length (get vs 0))]
+[FUNC bi-substring :params [vs]
+  :body (if (>= (length vs) 3)
+          (substring (get vs 0) (get vs 1) (get vs 2))
+          (substring (get vs 0) (get vs 1)))]
+[FUNC bi-char-at :params [vs] :body (char-at (get vs 0) (get vs 1))]
+[FUNC bi-replace :params [vs]
+  :body (replace (get vs 0) (get vs 1) (get vs 2))]
+[FUNC bi-str-to-num :params [vs] :body (str-to-num (get vs 0))]
+[FUNC bi-num-to-str :params [vs] :body (str (get vs 0))]
+
+;; ═══════════════ 리스트 (~15) ═══════════════
+
+[FUNC bi-list :params [vs] :body vs]
+[FUNC bi-first :params [vs]
+  :body (let [[l (get vs 0)]] (if (null? l) null (get l 0)))]
+[FUNC bi-last :params [vs]
+  :body (let [[l (get vs 0)]]
+          (if (null? l) null
+            (if (= (length l) 0) null (get l (- (length l) 1)))))]
+[FUNC bi-rest :params [vs]
+  :body (let [[l (get vs 0)]]
+          (if (or (null? l) (= (length l) 0)) (list)
+            (slice l 1 (length l))))]
+[FUNC bi-append :params [vs] :body (append (get vs 0) (get vs 1))]
+[FUNC bi-get :params [vs] :body (get (get vs 0) (get vs 1))]
+[FUNC bi-slice :params [vs]
+  :body (slice (get vs 0) (get vs 1) (get vs 2))]
+
+;; ═══════════════ I/O ═══════════════
+
+[FUNC bi-println :params [vs] :body (println (if (= (length vs) 0) "" (get vs 0)))]
+[FUNC bi-print :params [vs] :body (println (if (= (length vs) 0) "" (get vs 0)))]
+
+;; ═══════════════ 디스패처 ═══════════════
+;; native-call "+" vals → bi-add vals
+
+[FUNC native-dispatch :params [op vs]
+  :body (cond
+          ;; 산술
+          [(= op "+")         (bi-add vs)]
+          [(= op "-")         (bi-sub vs)]
+          [(= op "*")         (bi-mul vs)]
+          [(= op "/")         (bi-div vs)]
+          [(= op "%")         (bi-mod vs)]
+          [(= op "abs")       (bi-abs vs)]
+          [(= op "min")       (bi-min vs)]
+          [(= op "max")       (bi-max vs)]
+          ;; 비교
+          [(= op "<")         (bi-lt vs)]
+          [(= op ">")         (bi-gt vs)]
+          [(= op "<=")        (bi-le vs)]
+          [(= op ">=")        (bi-ge vs)]
+          [(= op "=")         (bi-eq vs)]
+          [(= op "!=")        (bi-ne vs)]
+          ;; 논리
+          [(= op "not")       (bi-not vs)]
+          [(= op "null?")     (bi-null? vs)]
+          [(= op "empty?")    (bi-empty? vs)]
+          ;; 문자열
+          [(= op "str")       (bi-str vs)]
+          [(= op "concat")    (bi-str vs)]
+          [(= op "length")    (bi-length vs)]
+          [(= op "substring") (bi-substring vs)]
+          [(= op "char-at")   (bi-char-at vs)]
+          [(= op "replace")   (bi-replace vs)]
+          [(= op "str-to-num") (bi-str-to-num vs)]
+          [(= op "num-to-str") (bi-num-to-str vs)]
+          ;; 리스트
+          [(= op "list")      (bi-list vs)]
+          [(= op "first")     (bi-first vs)]
+          [(= op "last")      (bi-last vs)]
+          [(= op "rest")      (bi-rest vs)]
+          [(= op "append")    (bi-append vs)]
+          [(= op "get")       (bi-get vs)]
+          [(= op "slice")     (bi-slice vs)]
+          ;; I/O
+          [(= op "println")   (bi-println vs)]
+          [(= op "print")     (bi-print vs)]
+          [true (error (str "native-dispatch unknown: " op))])]

package/self/char-class.fl

@@ -0,0 +1,45 @@
+;; self/char-class.fl — char predicates (Phase 01/12)
+;;
+;; 모든 predicate 는 1-char string 을 받아 boolean 반환.
+;; FL 에 char 타입 없음 — (char-at s i) 는 1-char string.
+
+(defn is-digit? [c]
+  (if (null? c) false
+    (and (>= c "0") (<= c "9"))))
+
+(defn is-alpha? [c]
+  (if (null? c) false
+    (or (and (>= c "a") (<= c "z"))
+        (and (>= c "A") (<= c "Z")))))
+
+(defn is-alnum? [c]
+  (or (is-digit? c) (is-alpha? c)))
+
+(defn is-space? [c]
+  (or (= c " ") (= c "\t") (= c "\n") (= c "\r")))
+
+;; S-expression 식별자 구성 가능 문자: alnum + - _ ? ! / . < > = + * % & | ^ ~
+;; (괄호/대괄호/중괄호/따옴표/콤마/백틱/@/#/$/:는 제외 — 구분자)
+(defn is-symbol-char? [c]
+  (if (null? c) false
+    (or (is-alnum? c)
+        (= c "-") (= c "_") (= c "?") (= c "!")
+        (= c "/") (= c ".") (= c "<") (= c ">")
+        (= c "=") (= c "+") (= c "*") (= c "%")
+        (= c "&") (= c "|") (= c "^") (= c "~"))))
+
+;; 심볼의 첫 글자로 허용 (숫자 제외, 일부 연산자 포함)
+(defn is-symbol-start? [c]
+  (if (null? c) false
+    (or (is-alpha? c)
+        (= c "-") (= c "_") (= c "/") (= c "<") (= c ">")
+        (= c "=") (= c "+") (= c "*") (= c "%")
+        (= c "&") (= c "|") (= c "^") (= c "~") (= c "!") (= c "?"))))
+
+(defn is-paren? [c]
+  (or (= c "(") (= c ")")
+      (= c "[") (= c "]")
+      (= c "{") (= c "}")))
+
+(defn is-quote? [c]
+  (= c "\""))