freelang-editor 11.7.4

package/self/runtime/repl.js

@@ -0,0 +1,186 @@
+// self/runtime/repl.js — Y4-3 단계B
+//
+// readline + Interpreter wrapper. self/runtime/interpreter.js 에 의존.
+// bootstrap.js 의존 없는 REPL 진입점.
+//
+// 사용:
+//   node self/runtime/repl.js
+//
+// 명령:
+//   :q / :quit / :exit  — 종료
+//   :clear              — 입력 버퍼 초기화
+//   :reset              — 세션 (변수/함수) 초기화
+//   :help               — 도움말
+//   :ls                 — 정의된 함수 목록
+//   :stack              — callStack (최근 20개)
+//   :locals             — 현재 변수 dump
+//
+// src/cli.ts cmdRepl 의 핵심 로직을 단순화. fl_history (~/.fl_history) 보존.
+
+const readline = require("readline");
+const fs = require("fs");
+const os = require("os");
+const path = require("path");
+
+const { Interpreter, lex, parse } = require("./interpreter");
+
+const historyPath = (() => {
+  try { return path.join(os.homedir(), ".fl_history"); }
+  catch { return null; }
+})();
+
+let initialHistory = [];
+if (historyPath) {
+  try {
+    if (fs.existsSync(historyPath)) {
+      initialHistory = fs.readFileSync(historyPath, "utf8")
+        .split("\n").filter(l => l.trim()).slice(-500).reverse();
+    }
+  } catch {}
+}
+
+console.log(`FreeLang v11 REPL (self/runtime)  (\x1b[2m:q 종료  :help 도움말  :reset 세션 초기화\x1b[0m)`);
+console.log(`─────────────────────────────────────────`);
+
+const rl = readline.createInterface({
+  input: process.stdin,
+  output: process.stdout,
+  prompt: "\x1b[36mfl>\x1b[0m ",
+  terminal: true,
+  history: initialHistory,
+  historySize: 500,
+});
+
+let buffer = "";
+let sessionInterp = new Interpreter();
+
+function countBalance(s) {
+  let balance = 0;
+  let inStr = false;
+  for (let i = 0; i < s.length; i++) {
+    const ch = s[i];
+    if (ch === '"') {
+      let bs = 0, j = i - 1;
+      while (j >= 0 && s[j] === "\\") { bs++; j--; }
+      if (bs % 2 === 0) inStr = !inStr;
+    }
+    if (!inStr) {
+      if (ch === "(" || ch === "[" || ch === "{") balance++;
+      if (ch === ")" || ch === "]" || ch === "}") balance--;
+    }
+  }
+  return balance;
+}
+
+rl.prompt();
+
+rl.on("line", (line) => {
+  const trimmed = line.trim();
+
+  if (trimmed === ":q" || trimmed === ":quit" || trimmed === ":exit") {
+    console.log("bye.");
+    rl.close();
+    return;
+  }
+  if (trimmed === ":help") {
+    console.log([
+      "  :q / :quit    종료",
+      "  :clear        버퍼 초기화",
+      "  :reset        세션 초기화",
+      "  :help         이 도움말",
+      "  :ls           정의된 함수 목록",
+      "  :stack        callStack (최근 20개)",
+      "  :locals       현재 변수 dump",
+    ].join("\n"));
+    rl.prompt();
+    return;
+  }
+  if (trimmed === ":clear") {
+    buffer = "";
+    console.log("  버퍼 초기화됨.");
+    rl.prompt();
+    return;
+  }
+  if (trimmed === ":reset") {
+    buffer = "";
+    sessionInterp = new Interpreter();
+    console.log("  세션 초기화됨.");
+    rl.prompt();
+    return;
+  }
+  if (trimmed === ":ls") {
+    const fns = [...sessionInterp.context.functions.keys()];
+    console.log(fns.length === 0 ? "(함수 없음)" : fns.slice(0, 50).join("  "));
+    if (fns.length > 50) console.log(`  ... 외 ${fns.length - 50}개`);
+    rl.prompt();
+    return;
+  }
+  if (trimmed === ":stack") {
+    const stack = sessionInterp.callStack || [];
+    if (stack.length === 0) console.log("  (callStack 비어있음)");
+    else {
+      const tail = stack.slice(-20);
+      for (let i = 0; i < tail.length; i++) {
+        const argsStr = tail[i].args ? `(${tail[i].args.join(", ")})` : "";
+        console.log(`  #${stack.length - tail.length + i}: ${tail[i].fn}${argsStr} (line ${tail[i].line})`);
+      }
+    }
+    rl.prompt();
+    return;
+  }
+  if (trimmed === ":locals") {
+    const snap = sessionInterp.context.variables.snapshot
+      ? sessionInterp.context.variables.snapshot()
+      : new Map();
+    if (snap.size === 0) console.log("  (변수 없음)");
+    else {
+      let count = 0;
+      for (const [k, v] of snap) {
+        if (count++ >= 30) { console.log(`  ... ${snap.size - 30}개 더`); break; }
+        const valStr = typeof v === "function" ? "<function>"
+          : v && v.kind === "function-value" ? "<fn-value>"
+          : (() => { try { return JSON.stringify(v)?.slice(0, 60); } catch { return "<unserializable>"; } })();
+        console.log(`  ${k} = ${valStr}`);
+      }
+    }
+    rl.prompt();
+    return;
+  }
+  if (trimmed.startsWith(";")) {
+    rl.prompt();
+    return;
+  }
+
+  buffer += (buffer ? "\n" : "") + line;
+  if (countBalance(buffer) > 0) {
+    process.stdout.write("\x1b[2m  …\x1b[0m ");
+    return;
+  }
+
+  const source = buffer.trim();
+  buffer = "";
+  if (!source) { rl.prompt(); return; }
+
+  try {
+    const ast = parse(lex(source));
+    const ctx = sessionInterp.interpret(ast);
+    const val = ctx.lastValue;
+    if (val !== null && val !== undefined) {
+      if (typeof val === "object") {
+        console.log("\x1b[33m=>\x1b[0m", JSON.stringify(val, null, 2));
+      } else {
+        console.log("\x1b[33m=>\x1b[0m", String(val));
+      }
+    }
+  } catch (err) {
+    console.error("\x1b[31merror:\x1b[0m", err && err.message ? err.message : String(err));
+  }
+
+  if (historyPath && source) {
+    try { fs.appendFileSync(historyPath, source.replace(/\n/g, " ") + "\n"); } catch {}
+  }
+
+  rl.prompt();
+});
+
+rl.on("close", () => process.exit(0));

package/self/runtime-helpers.ts

@@ -0,0 +1,282 @@
+/**
+ * FreeLang v11 Runtime Helpers
+ * 자체호스팅을 위한 필수 헬퍼 함수 모음
+ *
+ * 생성: 2026-04-29
+ * 목표: bootstrap.js에서 자동 추출한 _fl_* 헬퍼 36개를 TS로 재구현
+ *
+ * 사용법:
+ * - codegen의 프리앰블에 이 파일을 주입
+ * - stage1-new.js 빌드 시 esbuild로 번들링
+ * - self-host compile/run 검증
+ */
+
+// ─────────────────────────────────────────────────────
+// 타입 정의
+// ─────────────────────────────────────────────────────
+
+type FlValue = any;
+type FlFn = (...args: any[]) => any;
+type FlArray = FlValue[];
+type FlMap = Record<string, FlValue>;
+
+// ─────────────────────────────────────────────────────
+// 카테고리 1: 타입 체크 (8개)
+// ─────────────────────────────────────────────────────
+
+export function _fl_null_q(v: FlValue): boolean {
+  return v === null || v === undefined;
+}
+
+export function _fl_true_q(v: FlValue): boolean {
+  return v === true;
+}
+
+export function _fl_false_q(v: FlValue): boolean {
+  return v === false;
+}
+
+export function _fl_number_q(v: FlValue): boolean {
+  return typeof v === 'number';
+}
+
+export function _fl_string_q(v: FlValue): boolean {
+  return typeof v === 'string';
+}
+
+export function _fl_list_q(v: FlValue): boolean {
+  return Array.isArray(v);
+}
+
+export function _fl_map_q(v: FlValue): boolean {
+  return v !== null && typeof v === 'object' && !Array.isArray(v);
+}
+
+export function _fl_fn_q(v: FlValue): boolean {
+  return typeof v === 'function' || (v && typeof v === 'object' && v.__fn === true);
+}
+
+// ─────────────────────────────────────────────────────
+// 카테고리 2: 배열 조작 (8개)
+// ─────────────────────────────────────────────────────
+
+export function _fl_length(arr: FlValue): number {
+  if (Array.isArray(arr)) return arr.length;
+  if (typeof arr === 'object' && arr !== null) return Object.keys(arr).length;
+  if (typeof arr === 'string') return arr.length;
+  return 0;
+}
+
+export function _fl_first(arr: FlArray): FlValue {
+  return Array.isArray(arr) ? arr[0] : null;
+}
+
+export function _fl_last(arr: FlArray): FlValue {
+  return Array.isArray(arr) ? arr[arr.length - 1] : null;
+}
+
+export function _fl_rest(arr: FlArray): FlArray {
+  return Array.isArray(arr) ? arr.slice(1) : [];
+}
+
+export function _fl_append(arr: FlArray, item: FlValue): FlArray {
+  return Array.isArray(arr) ? [...arr, item] : [item];
+}
+
+export function _fl_get(obj: FlValue, key: FlValue, defaultVal?: FlValue): FlValue {
+  if (Array.isArray(obj) && typeof key === 'number') {
+    return obj[key] ?? defaultVal ?? null;
+  }
+  if (typeof obj === 'object' && obj !== null) {
+    const result = obj[String(key)];
+    return result !== undefined ? result : (defaultVal ?? null);
+  }
+  return defaultVal ?? null;
+}
+
+export function _fl_map_set(obj: FlMap, key: FlValue, value: FlValue): FlMap {
+  return { ...obj, [String(key)]: value };
+}
+
+export function _fl_keys(obj: FlValue): string[] {
+  if (typeof obj === 'object' && obj !== null) {
+    return Object.keys(obj);
+  }
+  return [];
+}
+
+// ─────────────────────────────────────────────────────
+// 카테고리 3: 문자열 조작 (5개)
+// ─────────────────────────────────────────────────────
+
+export function _fl_str(...args: FlValue[]): string {
+  return args.map(v => {
+    if (v === null || v === undefined) return '';
+    if (typeof v === 'object') return JSON.stringify(v);
+    return String(v);
+  }).join('');
+}
+
+export function _fl_lower(s: string): string {
+  return String(s).toLowerCase();
+}
+
+export function _fl_upper(s: string): string {
+  return String(s).toUpperCase();
+}
+
+export function _fl_trim(s: string): string {
+  return String(s).trim();
+}
+
+export function _fl_contains_q(s: string, substr: string): boolean {
+  return String(s).includes(String(substr));
+}
+
+// ─────────────────────────────────────────────────────
+// 카테고리 4: 문자 분류 (5개)
+// ─────────────────────────────────────────────────────
+
+export function _fl_is_alpha_q(c: string): boolean {
+  const ch = String(c)[0];
+  return /[a-zA-Z]/.test(ch);
+}
+
+export function _fl_is_digit_q(c: string): boolean {
+  const ch = String(c)[0];
+  return /[0-9]/.test(ch);
+}
+
+export function _fl_is_alnum_q(c: string): boolean {
+  const ch = String(c)[0];
+  return /[a-zA-Z0-9]/.test(ch);
+}
+
+export function _fl_is_space_q(c: string): boolean {
+  const ch = String(c)[0];
+  return /\s/.test(ch);
+}
+
+export function _fl_is_symbol_char_q(c: string): boolean {
+  const ch = String(c)[0];
+  return /[!@#$%^&*\-_+=]/.test(ch);
+}
+
+// ─────────────────────────────────────────────────────
+// 카테고리 5: 고차 함수 (3개)
+// ─────────────────────────────────────────────────────
+
+export function _fl_map(fn: FlFn, arr: FlArray): FlArray {
+  return arr.map(item => fn([item]));
+}
+
+export function _fl_filter(arr: FlArray, fn: FlFn): FlArray {
+  return arr.filter(item => {
+    const result = fn([item]);
+    return result !== false && result !== null;
+  });
+}
+
+export function _fl_reduce(fn: FlFn, init: FlValue, arr: FlArray): FlValue {
+  return arr.reduce((acc, item) => fn([acc, item]), init);
+}
+
+// ─────────────────────────────────────────────────────
+// 카테고리 6: 조건부 로직 (2개)
+// ─────────────────────────────────────────────────────
+
+export function _fl_empty_q(v: FlValue): boolean {
+  if (v === null || v === undefined) return true;
+  if (Array.isArray(v)) return v.length === 0;
+  if (typeof v === 'object') return Object.keys(v).length === 0;
+  if (typeof v === 'string') return v === '';
+  return false;
+}
+
+export function _fl_has_key_q(obj: FlValue, key: FlValue): boolean {
+  if (typeof obj === 'object' && obj !== null) {
+    return String(key) in obj;
+  }
+  return false;
+}
+
+// ─────────────────────────────────────────────────────
+// 카테고리 7: I/O (2개)
+// ─────────────────────────────────────────────────────
+
+export function _fl_print(msg: FlValue): FlValue {
+  console.log(msg);
+  return msg;
+}
+
+export function _fl_array_q(v: FlValue): boolean {
+  return Array.isArray(v);
+}
+
+// ─────────────────────────────────────────────────────
+// 카테고리 8: HTTP (2개) — 자체호스팅용 스텁
+// ─────────────────────────────────────────────────────
+
+export function _fl_request(obj: FlMap): FlMap {
+  // HTTP 요청 처리 (서버 모드용 스텁)
+  return { status: 200, body: '{}', error: null };
+}
+
+export function _fl_response(obj: FlMap): FlMap {
+  // HTTP 응답 처리 (서버 모드용 스텁)
+  return obj;
+}
+
+// ─────────────────────────────────────────────────────
+// 카테고리 9: 기타 (1개)
+// ─────────────────────────────────────────────────────
+
+export function _fl_wait_and_respond(fn: FlFn, timeout?: number): FlValue {
+  // 비동기 작업 (현재 동기로 처리)
+  return fn([]);
+}
+
+// ─────────────────────────────────────────────────────
+// 헬퍼 맵 (codegen 주입용)
+// ─────────────────────────────────────────────────────
+
+export const RUNTIME_HELPERS: Record<string, FlFn> = {
+  _fl_null_q,
+  _fl_true_q,
+  _fl_false_q,
+  _fl_number_q,
+  _fl_string_q,
+  _fl_list_q,
+  _fl_map_q,
+  _fl_fn_q,
+  _fl_length,
+  _fl_first,
+  _fl_last,
+  _fl_rest,
+  _fl_append,
+  _fl_get,
+  _fl_map_set,
+  _fl_keys,
+  _fl_str,
+  _fl_lower,
+  _fl_upper,
+  _fl_trim,
+  _fl_contains_q,
+  _fl_is_alpha_q,
+  _fl_is_digit_q,
+  _fl_is_alnum_q,
+  _fl_is_space_q,
+  _fl_is_symbol_char_q,
+  _fl_map,
+  _fl_filter,
+  _fl_reduce,
+  _fl_empty_q,
+  _fl_has_key_q,
+  _fl_print,
+  _fl_array_q,
+  _fl_request,
+  _fl_response,
+  _fl_wait_and_respond,
+};
+
+export default RUNTIME_HELPERS;

package/self/scope.fl

@@ -0,0 +1,80 @@
+;; self/scope.fl — 변수 스코프 (Phase 04/46-52)
+;;
+;; 구조: scope = list of maps. top 이 현재, last 가 global.
+;; push-scope: 새 map 을 앞에 붙임.
+;; pop-scope: 첫번째 제거.
+;; set: 최상위 scope 에 기록.
+;; get: top → ... → global 순 탐색.
+;; x 정규화: "x" 또는 "x" 둘 다 같은 key 로 저장/조회.
+
+;; ──────────────────────────────────────
+;; 46 make-scope / push / pop
+;; ──────────────────────────────────────
+
+[FUNC make-scope :params [] :body (list {})]
+
+[FUNC push-scope :params [s]
+  :body (append (list {}) s)]
+
+[FUNC pop-scope :params [s]
+  :body (if (= (length s) 0) s (slice s 1 (length s)))]
+
+;; ──────────────────────────────────────
+;; 47 $ 접두사 정규화
+;; ──────────────────────────────────────
+
+[FUNC norm-key :params [k]
+  :body (if (null? k) ""
+          (if (and (>= (length k) 1) (= (char-at k 0) "$"))
+            (substring k 1 (length k))
+            k))]
+
+;; ──────────────────────────────────────
+;; 48 has? / get / set
+;; ──────────────────────────────────────
+
+;; scope chain 에서 키 탐색. first match return.
+[FUNC has-key? :params [s k]
+  :body (has-key-loop s (norm-key k) 0)]
+
+[FUNC has-key-loop :params [s k i]
+  :body (cond
+          [(>= i (length s)) false]
+          [(not (null? (get (get s i) k))) true]
+          [true (has-key-loop s k (+ i 1))])]
+
+[FUNC scope-get :params [s k]
+  :body (scope-get-loop s (norm-key k) 0)]
+
+[FUNC scope-get-loop :params [s k i]
+  :body (cond
+          [(>= i (length s)) null]
+          [(not (null? (get (get s i) k))) (get (get s i) k)]
+          [true (scope-get-loop s k (+ i 1))])]
+
+;; 최상위 scope 에 set. 새 scope 반환.
+[FUNC scope-set :params [s k v]
+  :body (let [[nk (norm-key k)]
+              [top (get s 0)]
+              [rest (slice s 1 (length s))]
+              [top2 (json_set top nk v)]]
+          (append (list top2) rest))]
+
+;; ──────────────────────────────────────
+;; 49 snapshot (closure capture)
+;; ──────────────────────────────────────
+
+[FUNC scope-snapshot :params [s] :body s]
+
+;; ──────────────────────────────────────
+;; 50 restore (rollback 은 pop 의 alias)
+;; ──────────────────────────────────────
+
+[FUNC scope-restore :params [old new] :body old]
+
+;; ──────────────────────────────────────
+;; 52 test helpers — (다중 스코프 시퀀스 재현)
+;; ──────────────────────────────────────
+
+[FUNC scope-debug :params [s]
+  :body (str "scope-depth=" (length s)))

package/self/scope.self.js

@@ -0,0 +1 @@
+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);

package/self/self/bench/_bi_list-distinct.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_distinct([1,2,2,3,3,3,4]));

package/self/self/bench/_bi_list-filter-even.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_filter(((x)=>((x%2)===0)),[1,2,3,4,5]));

package/self/self/bench/_bi_list-first.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_first([10,20,30]));

package/self/self/bench/_bi_list-last.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_last([10,20,30]));

package/self/self/bench/_bi_list-map-inc.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_map(((x)=>(x+1)),[1,2,3]));

package/self/self/bench/_bi_list-range.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_range(0,5));

package/self/self/bench/_bi_list-reduce-sum.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_reduce(((a,b)=>(a+b)),0,[1,2,3,4]));

package/self/self/bench/_bi_list-reverse.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_reverse([1,2,3]));

package/self/self/bench/_bi_list-sort.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_sort([3,1,4,1,5,9,2,6]));

package/self/self/bench/_bi_list-take.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_take(3,[10,20,30,40,50]));

package/self/self/bench/_bi_map-has.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_has_key(JSON.parse("{\"a\":1}"),"a"));

package/self/self/bench/_bi_map-keys.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_keys(JSON.parse("{\"a\":1,\"b\":2}")));

package/self/self/bench/_bi_map-values.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_values(JSON.parse("{\"a\":1,\"b\":2}")));