@mojir/dvala 0.0.1 → 0.0.2

package/dist/cli/src/utils/maybePromise.d.ts

@@ -0,0 +1,54 @@
+/**
+ * MaybePromise utilities for transparent async support.
+ *
+ * The sync path stays zero-overhead — when no async JS functions are involved,
+ * everything runs synchronously with only `instanceof Promise` checks as overhead.
+ * When an async value is detected, the evaluation chain switches to Promise-based
+ * execution for the remainder.
+ */
+export type MaybePromise<T> = T | Promise<T>;
+/**
+ * Chain a value that might be a Promise. If the value is sync, calls fn synchronously.
+ * If it's a Promise, chains with .then().
+ */
+export declare function chain<T, U>(value: MaybePromise<T>, fn: (v: T) => MaybePromise<U>): MaybePromise<U>;
+/**
+ * Like Array.map but handles MaybePromise callbacks sequentially.
+ * In the sync case, runs as a simple loop. Switches to async only when needed.
+ */
+export declare function mapSequential<T, U>(arr: readonly T[], fn: (elem: T, index: number) => MaybePromise<U>): MaybePromise<U[]>;
+/**
+ * Like Array.reduce but handles MaybePromise callbacks sequentially.
+ * In the sync case, runs as a simple loop. Switches to async only when needed.
+ */
+export declare function reduceSequential<T, U>(arr: readonly T[], fn: (acc: U, elem: T, index: number) => MaybePromise<U>, initial: U): MaybePromise<U>;
+/**
+ * Like Array.forEach but handles MaybePromise callbacks sequentially.
+ * In the sync case, runs as a simple loop. Switches to async only when needed.
+ */
+export declare function forEachSequential<T>(arr: readonly T[], fn: (elem: T, index: number) => MaybePromise<void>): MaybePromise<void>;
+/**
+ * Try/catch that handles MaybePromise values correctly.
+ * If tryFn returns a Promise, catches both sync throws and Promise rejections.
+ */
+export declare function tryCatch<T>(tryFn: () => MaybePromise<T>, catchFn: (error: unknown) => MaybePromise<T>): MaybePromise<T>;
+/**
+ * Like Array.some but handles MaybePromise callbacks sequentially.
+ * Returns the first truthy MaybePromise result, or false.
+ */
+export declare function someSequential<T>(arr: readonly T[], fn: (elem: T, index: number) => MaybePromise<unknown>): MaybePromise<boolean>;
+/**
+ * Like Array.every but handles MaybePromise callbacks sequentially.
+ * Returns false as soon as a falsy result is found.
+ */
+export declare function everySequential<T>(arr: readonly T[], fn: (elem: T, index: number) => MaybePromise<unknown>): MaybePromise<boolean>;
+/**
+ * Like Array.filter but handles MaybePromise callbacks sequentially.
+ * Returns the filtered array.
+ */
+export declare function filterSequential<T>(arr: readonly T[], fn: (elem: T, index: number) => MaybePromise<unknown>): MaybePromise<T[]>;
+/**
+ * Like Array.findIndex but handles MaybePromise callbacks sequentially.
+ * Returns -1 if no element matches.
+ */
+export declare function findIndexSequential<T>(arr: readonly T[], fn: (elem: T, index: number) => MaybePromise<unknown>): MaybePromise<number>;

package/dist/cli/src/utils/symbols.d.ts

@@ -0,0 +1,3 @@
+export declare const FUNCTION_SYMBOL = "^^fn^^";
+export declare const REGEXP_SYMBOL = "^^re^^";
+export declare const EFFECT_SYMBOL = "^^ef^^";

package/dist/common/createFormatter.d.ts

@@ -0,0 +1,6 @@
+import type { FormatterRule } from '../cli/src/cliFormatterRules';
+export type TextFormatter = (text: string) => string;
+export declare function createFormatter(rules: FormatterRule[], options?: {
+    prefix?: string;
+    suffix?: string;
+}): TextFormatter;

package/dist/common/utils.d.ts

@@ -0,0 +1,2 @@
+export declare function stringifyValue(value: unknown, html: boolean): string;
+export declare function findAllOccurrences(input: string, pattern: RegExp): Set<string>;

package/dist/debug.esm.js

@@ -0,0 +1,2 @@
+function e(e){if(!e.position||!e.code)return"";const t=e.position.column-1,n=e.code.length-t-1;return`${" ".repeat(Math.max(t,0))}^${" ".repeat(Math.max(n,0))}`}class t extends Error{params;constructor(e){super(`recur, params: ${e}`),Object.setPrototypeOf(this,t.prototype),this.name="RecurSignal",this.params=e}}class n extends Error{sourceCodeInfo;shortMessage;constructor(t,r){const s=t instanceof Error?t.message:`${t}`;super(function(t,n){if(!n)return t;const r=`${n.position.line}:${n.position.column}`;return`${t}${n.filePath?`\n${n.filePath}:${r}`:`\nLocation ${r}`}\n${n.code}\n${e(n)}`}(s,r)),this.shortMessage=s,this.sourceCodeInfo=r,Object.setPrototypeOf(this,n.prototype),this.name="DvalaError"}getCodeMarker(){return this.sourceCodeInfo&&e(this.sourceCodeInfo)}}class r extends n{userMessage;constructor(e,t){super(e,t),this.userMessage=e,Object.setPrototypeOf(this,r.prototype),this.name="UserDefinedError"}}class s extends n{constructor(e,t){super(e,t),Object.setPrototypeOf(this,s.prototype),this.name="AssertionError"}}class a extends n{symbol;constructor(e,t){super(`Undefined symbol '${e}'.`,t),this.symbol=e,Object.setPrototypeOf(this,a.prototype),this.name="UndefinedSymbolError"}}const o={Number:1,String:2,NormalExpression:3,SpecialExpression:4,UserDefinedSymbol:5,NormalBuiltinSymbol:6,SpecialBuiltinSymbol:7,ReservedSymbol:8,Binding:9,Spread:10},i=new Set(Object.values(o));function c(e){return Object.keys(o).find(t=>o[t]===e)}const u=new Set(["UserDefined","Partial","Comp","Constantly","Juxt","Complement","EveryPred","SomePred","Fnull","Builtin","SpecialBuiltin","NativeJsFunction","Module"]);const l="^^fn^^",p="^^re^^",f="^^ef^^";function d(e){return null!==e&&"object"==typeof e&&(l in e&&"functionType"in e&&function(e){return"string"==typeof e&&u.has(e)}(e.functionType))}function m(e){return!(!Array.isArray(e)||e.length<2)&&function(e){return"number"==typeof e&&i.has(e)}(e[0])}function y(e){return d(e)?`<function ${e.name||"λ"}>`:m(e)?`${c(e[0])}-node`:null===e?"null":"object"==typeof e&&e instanceof RegExp?`${e}`:"object"==typeof e&&e instanceof Error?e.toString():JSON.stringify(e)}function g(e,t){return e?.sourceCodeInfo??t}function h(e,t,r){return new n(`Expected ${e}, got ${y(t)}.`,g(t,r))}function v(e,t){return b(e,t),e}function b(e,t){if(!function(e){return void 0!==e}(e))throw new n("Unexpected undefined",g(e,t))}function x(e){return null!==e&&"object"==typeof e&&!Array.isArray(e)}function w(e){return null!==e&&"object"==typeof e&&!!e[l]}function k(e){return void 0!==e}function A(e,t){return $(e,t),e}function $(e,t){if(!k(e))throw h("not undefined",e,t)}function E(e){return Array.isArray(e)||"string"==typeof e}function N(e,t){if(!E(e))throw h("string or array",e,t)}function S(e){return!(null===e||"object"!=typeof e||Array.isArray(e)||e instanceof RegExp||w(e)||C(e)||R(e))}function j(e,t){if(!S(e))throw h("object",e,t)}function q(e){return E(e)||S(e)}function I(e,t){if(!q(e))throw h("string, array or object",e,t)}function C(e){return null!==e&&"object"==typeof e&&!!e[p]}function P(e,t){if(!function(e){return C(e)||"string"==typeof e}(e))throw h("string or RegularExpression",e,t)}function R(e){return null!==e&&"object"==typeof e&&!!e[f]}function T(e,t){return O(e,t),e}function O(e,t){if(!function(e){return"number"==typeof e||!!q(e)||!!w(e)}(e))throw h("FunctionLike",e,t)}function U(e,t={}){return"string"==typeof e&&((!t.nonEmpty||0!==e.length)&&(!t.char||1===e.length))}function M(e,t,n={}){if(!U(e,n))throw h(""+(n.nonEmpty?"non empty string":n.char?"character":"string"),e,t)}function V(e,t,n={}){return M(e,t,n),e}function F(e){return"string"==typeof e||"number"==typeof e}function B(e,t){return _(e,t),e}function _(e,t){if(!F(e))throw h("string or number",e,t)}const L={assert:{evaluate:(e,t)=>{const n=e[0],r=2===e.length?e[1]:`${n}`;if(M(r,t),!n)throw new s(r,t);return A(n,t)},arity:{min:1,max:2},docs:{category:"assertion",description:"If $value is falsy it throws `AssertionError` with $message. If no $message is provided, message is set to $value.",returns:{type:"any"},args:{value:{type:"any"},message:{type:"string"}},variants:[{argumentNames:["value"]},{argumentNames:["value","message"]}],examples:['try assert(0, "Expected a positive value") catch (e) e.message end'],seeAlso:["assertion.assert-truthy","assertion.assert-true"],hideOperatorForm:!0}}};function D(e,t={}){return"number"==typeof e&&(!Number.isNaN(e)&&(!(t.integer&&!Number.isInteger(e))&&(!(t.finite&&!Number.isFinite(e))&&((!t.zero||0===e)&&((!t.nonZero||0!==e)&&(!(t.positive&&e<=0)&&(!(t.negative&&e>=0)&&(!(t.nonPositive&&e>0)&&(!(t.nonNegative&&e<0)&&(!("number"==typeof t.gt&&e<=t.gt)&&(!("number"==typeof t.gte&&e<t.gte)&&(!("number"==typeof t.lt&&e>=t.lt)&&!("number"==typeof t.lte&&e>t.lte)))))))))))))}function z(e,t,r={}){if(!D(e,r))throw new n(`Expected ${function(e){if(e.zero)return"zero";const t=function(e){return e.positive?"positive":e.negative?"negative":e.nonNegative?"non negative":e.nonPositive?"non positive":e.nonZero?"non zero":""}(e),n=e.integer?"integer":"number",r=e.finite?"finite":"",s=function(e){return"number"!=typeof e.gt&&"number"!=typeof e.gte||"number"!=typeof e.lt&&"number"!=typeof e.lte?"number"==typeof e.gt||"number"==typeof e.gte?"number"==typeof e.gt?`n > ${e.gt}`:`n >= ${e.gte}`:"number"==typeof e.lt||"number"==typeof e.lte?"number"==typeof e.lt?`n < ${e.lt}`:`n <= ${e.lte}`:"":`${"number"==typeof e.gt?`${e.gt} < n `:`${e.gte} <= n `}${"number"==typeof e.lt?`< ${e.lt}`:`<= ${e.lte}`}`}(e);return[t,r,n,s].filter(e=>!!e).join(" ")}(r)}, got ${y(e)}.`,g(e,t))}function W(e,t){const{min:n}=e;return!("number"==typeof n&&t<n)}function J(e,t,r){const{min:s,max:a}=e;if("number"==typeof s&&t<s)throw new n(`Wrong number of arguments, expected at least ${s}, got ${y(t)}.`,r);if("number"==typeof a&&t>a)throw new n(`Wrong number of arguments, expected at most ${a}, got ${y(t)}.`,r)}function K(e){return{min:e,max:e}}function Y(e,t){return{a:{type:e},b:{type:t}}}const G={"<<":{evaluate:([e,t],n)=>(z(e,n,{integer:!0}),z(t,n,{integer:!0,nonNegative:!0}),e<<t),arity:K(2),docs:{category:"bitwise",returns:{type:"integer"},args:{...Y("integer","integer")},variants:[{argumentNames:["a","b"]}],description:"Shifts $a arithmetically left by $b bit positions.",seeAlso:[">>",">>>"],examples:["1 << 10","<<(1, 10)","<<(-4, 2)"]}},">>":{evaluate:([e,t],n)=>(z(e,n,{integer:!0}),z(t,n,{integer:!0,nonNegative:!0}),e>>t),arity:K(2),docs:{category:"bitwise",returns:{type:"integer"},args:{...Y("integer","integer")},variants:[{argumentNames:["a","b"]}],description:"Shifts $a arithmetically right by $b bit positions.",seeAlso:["<<",">>>"],examples:["2048 >> 10",">>(2048, 10)",">>>(-16, 2)",">>(4, 10)"]}},">>>":{evaluate:([e,t],n)=>(z(e,n,{integer:!0}),z(t,n,{integer:!0,nonNegative:!0}),e>>>t),arity:K(2),docs:{category:"bitwise",returns:{type:"integer"},args:{...Y("integer","integer")},variants:[{argumentNames:["a","b"]}],description:"Shifts $a arithmetically right by $b bit positions without sign extension.",seeAlso:["<<",">>"],examples:["-16 >>> 2",">>>(2048, 10)",">>>(-16, 2)",">>>(4, 10)",">>>(-1, 10)"]}},"&":{evaluate:([e,...t],n)=>(z(e,n,{integer:!0}),t.reduce((e,t)=>(z(t,n,{integer:!0}),e&t),e)),arity:{min:2},docs:{category:"bitwise",returns:{type:"integer"},args:{...Y("integer","integer"),c:{type:"integer",rest:!0}},variants:[{argumentNames:["a","b"]},{argumentNames:["a","b","c"]}],description:"Returns bitwise `and` of all arguments.",seeAlso:["|","xor","bitwise.bit-not","bitwise.bit-and-not"],examples:["0b0011 & 0b0110","&(0b0011, 0b0110)","&(0b0011, 0b0110, 0b1001)"]}},"|":{evaluate:([e,...t],n)=>(z(e,n,{integer:!0}),t.reduce((e,t)=>(z(t,n,{integer:!0}),e|t),e)),arity:{min:2},docs:{category:"bitwise",returns:{type:"integer"},args:{...Y("integer","integer"),c:{type:"integer",rest:!0}},variants:[{argumentNames:["a","b"]},{argumentNames:["a","b","c"]}],description:"Returns bitwise `or` of all arguments.",seeAlso:["&","xor","bitwise.bit-not","bitwise.bit-and-not"],examples:["0b0011 | 0b0110","|(0b0011, 0b0110)","|(0b1000, 0b0100, 0b0010)"]}},xor:{evaluate:([e,...t],n)=>(z(e,n,{integer:!0}),t.reduce((e,t)=>(z(t,n,{integer:!0}),e^t),e)),arity:{min:2},docs:{category:"bitwise",returns:{type:"integer"},args:{...Y("integer","integer"),c:{type:"integer",rest:!0}},variants:[{argumentNames:["a","b"]},{argumentNames:["a","b","c"]}],description:"Returns bitwise `xor` of all arguments.",seeAlso:["&","|","bitwise.bit-not","bitwise.bit-and-not"],examples:["0b0011 xor 0b0110","xor(0b0011, 0b0110)","xor(0b11110000, 0b00111100, 0b10101010)"]}}};function X(e,t){return!!q(e)&&("string"==typeof e||Array.isArray(e)?!!D(t,{integer:!0})&&(t>=0&&t<e.length):!!Object.getOwnPropertyDescriptor(e,t))}function H(e,t,r){if(_(e,r),_(t,r),"string"==typeof e&&"string"==typeof t)return e<t?-1:e>t?1:0;if("number"==typeof e&&"number"==typeof t)return Math.sign(e-t);throw new n(`Cannot compare values of different types: ${typeof e} and ${typeof t}`,r)}function Z(e,t,n){if(e===t)return!0;if("number"==typeof e&&"number"==typeof t)return function(e,t,n=ne){if(e===t)return!0;const r=Math.abs(e-t);if(0===e||0===t||r<n)return r<n;const s=Math.abs(e),a=Math.abs(t);return r/(s+a)<n}(e,t);if(Array.isArray(e)&&Array.isArray(t)){if(e.length!==t.length)return!1;for(let r=0;r<e.length;r+=1)if(!Z(A(e[r],n),A(t[r],n),n))return!1;return!0}if(C(e)&&C(t))return e.s===t.s&&e.f===t.f;if(x(e)&&x(t)){const r=Object.keys(e),s=Object.keys(t);if(r.length!==s.length)return!1;for(let s=0;s<r.length;s+=1){const a=V(r[s],n);if(!Z(e[a],t[a],n))return!1}return!0}return!1}function Q(e){return e??null}function ee(...e){const t=new Set;for(const n of e)n.forEach(e=>t.add(e));return t}function te(e,t){t.forEach(t=>e.add(t))}const ne=1e-10;function re(e,t=0){const n=e.split("\n");for(;n[0]?.match(/^\s*$/);)n.shift();for(;n[n.length-1]?.match(/^\s*$/);)n.pop();const r=n.reduce((e,t)=>{if(t.match(/^\s*$/))return e;const n=t.match(/^\s*/)[0].length;return Math.min(e,n)},1/0);return n.map(e=>" ".repeat(t)+e.slice(r)).join("\n").trimEnd()}function se(e,t){if(!Array.isArray(e))throw h("array",e,t)}function ae(e,t){if(!function(e){return Array.isArray(e)&&e.every(e=>"string"==typeof e)}(e))throw h("array of strings",e,t)}function oe(e,t){if(!function(e){return Array.isArray(e)&&e.every(e=>"string"==typeof e&&1===e.length)}(e))throw h("array of strings",e,t)}function ie(e,t){return e instanceof Promise?e.then(t):t(e)}function ce(e,t){const n=[];for(let r=0;r<e.length;r++){const s=t(e[r],r);if(s instanceof Promise)return ue(s,n,e,t,r);n.push(s)}return n}async function ue(e,t,n,r,s){t.push(await e);for(let e=s+1;e<n.length;e++)t.push(await r(n[e],e));return t}function le(e,t,n){let r=n;for(let n=0;n<e.length;n++){const s=t(r,e[n],n);if(s instanceof Promise)return pe(s,e,t,n);r=s}return r}async function pe(e,t,n,r){let s=await e;for(let e=r+1;e<t.length;e++)s=await n(s,t[e],e);return s}function fe(e,t){for(let n=0;n<e.length;n++){const r=t(e[n],n);if(r instanceof Promise)return de(r,e,t,n)}}async function de(e,t,n,r){await e;for(let e=r+1;e<t.length;e++)await n(t[e],e)}function me(e,t){for(let n=0;n<e.length;n++){const r=t(e[n],n);if(r instanceof Promise)return ye(r,e,t,n);if(r)return n}return-1}async function ye(e,t,n,r){if(await e)return r;for(let e=r+1;e<t.length;e++)if(await n(t[e],e))return e;return-1}const ge={filter:{evaluate:([e,t],n,r,{executeFunction:s})=>{if(I(e,n),O(t,n),Array.isArray(e))return le(e,(e,a)=>ie(s(t,[a],r,n),t=>(t&&e.push(a),e)),[]);if(U(e)){return ie(le(e.split(""),(e,a)=>ie(s(t,[a],r,n),t=>(t&&e.push(a),e)),[]),e=>e.join(""))}return le(Object.entries(e),(e,[a,o])=>ie(s(t,[o],r,n),t=>(t&&(e[a]=o),e)),{})},arity:K(2),docs:{category:"collection",returns:{type:"collection"},args:{a:{type:"collection"},b:{type:"function"},coll:{type:"collection"},fun:{type:"function"}},variants:[{argumentNames:["coll","fun"]}],description:"Creates a new collection with all elements that pass the test implemented by $fun.",seeAlso:["collection.filteri","map","sequence.remove"],examples:['\nfilter(\n  ["Albert", "Mojir", 160, [1, 2]],\n  string?\n)',"\nfilter(\n  [5, 10, 15, 20],\n  -> $ > 10\n)","\nfilter(\n  { a: 1, b: 2 },\n  odd?\n)"]}},map:{evaluate:(e,t,r,{executeFunction:s})=>{const a=T(e.at(-1),t);if(S(e[0]))return function({colls:e,contextStack:t,executeFunction:r,fn:s,sourceCodeInfo:a}){j(e[0],a);const o=Object.keys(e[0]),i={};return e.forEach(e=>{j(e,a);const t=Object.keys(e);if(t.length!==o.length)throw new n(`All objects must have the same keys. Expected: ${o.join(", ")}. Found: ${t.join(", ")}`,a);if(!t.every(e=>o.includes(e)))throw new n(`All objects must have the same keys. Expected: ${o.join(", ")}. Found: ${t.join(", ")}`,a);Object.entries(e).forEach(([e,t])=>{i[e]||(i[e]=[]),i[e].push(t)})}),le(o,(e,n)=>ie(r(s,i[n],t,a),t=>(e[n]=t,e)),{})}({colls:e.slice(0,-1),fn:a,sourceCodeInfo:t,contextStack:r,executeFunction:s});const o=e.slice(0,-1);N(o[0],t);const i="string"==typeof o[0];let c=o[0].length;o.slice(1).forEach(e=>{i?M(e,t):se(e,t),c=Math.min(c,e.length)});const u=[];for(let e=0;e<c;e++)u.push(o.map(t=>t[e]));const l=ce(u,e=>s(a,e,r,t));return i?ie(l,e=>(e.forEach(e=>M(e,t)),e.join(""))):l},arity:{min:2},docs:{category:"collection",returns:{type:"collection"},args:{a:{type:"collection"},b:{type:"function"},colls:{type:"collection",rest:!0,description:"At least one."},fun:{type:"function"}},variants:[{argumentNames:["colls","fun"]}],description:"Creates a new collection populated with the results of calling $fun on every element in $colls.",seeAlso:["collection.mapi","filter","reduce","mapcat","grid.cell-map","grid.cell-mapi"],examples:["[1, 2, 3] map -","[1, 2, 3] map -> -($)",'map(["Albert", "Mojir", 42], str)',"map([1, 2, 3], inc)","map([1, 2, 3], [1, 10, 100], *)","map({ a: 1, b: 2 }, inc)","map({ a: 1, b: 2 }, { a: 10, b: 20 }, +)"]}},reduce:{evaluate:([e,t,n],r,s,{executeFunction:a})=>(I(e,r),O(t,r),$(n,r),"string"==typeof e?(M(n,r),0===e.length?n:le(e.split(""),(e,n)=>a(t,[e,n],s,r),n)):Array.isArray(e)?0===e.length?n:le(e,(e,n)=>a(t,[e,n],s,r),n):0===Object.keys(e).length?n:le(Object.entries(e),(e,[,n])=>a(t,[e,n],s,r),n)),arity:K(3),docs:{category:"collection",returns:{type:"any"},args:{fun:{type:"function"},coll:{type:"collection"},initial:{type:"any"}},variants:[{argumentNames:["coll","fun","initial"]}],description:"Runs $fun function on each element of the $coll, passing in the return value from the calculation on the preceding element. The final result of running the reducer across all elements of the $coll is a single value.",seeAlso:["collection.reduce-right","collection.reducei","collection.reductions","map","grid.cell-reduce","grid.cell-reducei"],examples:["reduce([1, 2, 3], +, 0)","reduce([], +, 0)","reduce({ a: 1, b: 2 }, +, 0)","\nreduce(\n  [1, 2, 3, 4, 5, 6, 7, 8, 9],\n  (result, value) -> result + (even?(value) ? value : 0),\n  0)"]}},get:{evaluate:(e,t)=>{const[n,r]=e,s=Q(e[2]);if(_(r,t),null===n)return s;I(n,t);const a=function(e,t){if(S(e)){if("string"==typeof t&&X(e,t))return Q(e[t])}else if(D(t,{nonNegative:!0,integer:!0})&&t>=0&&t<e.length)return Q(e[t])}(n,r);return void 0===a?s:a},arity:{min:2,max:3},docs:{category:"collection",returns:{type:"any"},args:{a:{type:"collection"},b:{type:["string","integer"]},"not-found":{type:"any",description:"Default value to return if $b is not found."}},variants:[{argumentNames:["a","b"]},{argumentNames:["a","b","not-found"]}],description:"Returns value in $a mapped at $b.",seeAlso:["collection.get-in","contains?","find","nth"],examples:["[1, 2, 3] get 1",'{ a: 1 } get "a"','"Albert" get "3"',"\nget(\n  [1, 2, 3],\n  1, // Optional comma after last argument\n)","\nget(\n  [],\n  1\n)",'\nget(\n  [],\n  1,\n  "default"\n)','\nget(\n  { a: 1 },\n  "a"\n)','\nget(\n  { a: 1 },\n  "b"\n)','\nget(\n  { a: 1 },\n  "b",\n  "default"\n)','\nget(\n  null,\n  "a"\n)','\nget(\n  null,\n  "b",\n  "default"\n)']}},count:{evaluate:([e],t)=>null===e?0:"string"==typeof e?e.length:(I(e,t),Array.isArray(e)?e.length:Object.keys(e).length),arity:K(1),docs:{category:"collection",returns:{type:"number"},args:{coll:{type:["collection","null"]}},variants:[{argumentNames:["coll"]}],description:"Returns number of elements in $coll.",seeAlso:["empty?"],examples:["count([1, 2, 3])","count([])","count({ a: 1 })",'count("")','count("Albert")',"count(null)"]}},"contains?":{evaluate:([e,t],n)=>null!==e&&(I(e,n),U(e)?(M(t,n),e.includes(t)):E(e)?($(t,n),!!e.find(e=>Z(A(e),t,n))):(M(t,n),t in e)),arity:K(2),docs:{category:"collection",returns:{type:"boolean"},args:{a:{type:["collection","null"]},b:{type:["string","integer"]}},variants:[{argumentNames:["a","b"]}],description:"Returns `true` if $a contains $b, otherwise returns `false`. For strings, it checks if substring is included.",seeAlso:["get","find","index-of"],examples:["[1, 2, 3] contains? 1","null contains? 1",'{ a: 1, b: 2 } contains? "a"',"\ncontains?(\n  [],\n  1\n)","\ncontains?(\n  [1],\n  1\n)","\ncontains?(\n  [1, 2, 3],\n  1\n)",'\ncontains?(\n  {},\n  "a"\n)','\ncontains?(\n  { a: 1, b: 2 },\n  "a"\n)']}},assoc:{evaluate:([e,t,n],r)=>(I(e,r),_(t,r),$(n,r),function(e,t,n,r){if(I(e,r),_(t,r),Array.isArray(e)||"string"==typeof e){if(z(t,r,{integer:!0}),z(t,r,{gte:0}),z(t,r,{lte:e.length}),"string"==typeof e)return M(n,r,{char:!0}),`${e.slice(0,t)}${n}${e.slice(t+1)}`;const s=[...e];return s[t]=n,s}M(t,r);const s={...e};return s[t]=n,s}(e,t,n,r)),arity:K(3),docs:{category:"collection",returns:{type:"collection"},args:{coll:{type:"collection"},key:{type:["string","number"]},value:{type:"any"},kvs:{type:"any",description:"Key-value pairs to associate.",rest:!0}},variants:[{argumentNames:["coll","key","value"]},{argumentNames:["coll","key","value","kvs"]}],description:"\nAdd or replace the value of element $key to $value in $coll. Repeated for all key-value pairs in $kvs.\nIf $coll is an 'array', $key must be `number` satisfying `0 <=` $key `<= length`.",seeAlso:["collection.assoc-in","dissoc","merge","collection.update"],examples:['\nassoc(\n  [1, 2, 3],\n  1,\n  "Two"\n)','\nassoc(\n  [1, 2, 3],\n  3,\n  "Four"\n)','\nassoc(\n  { a: 1, b: 2 },\n  "a",\n  "One")','\nassoc(\n  { a: 1, b: 2 },\n  "c",\n  "Three")','\nassoc(\n  "Albert",\n  6,\n  "a")']}},"++":{evaluate:(e,t)=>(D(e[0])||I(e[0],t),Array.isArray(e[0])?e.reduce((e,n)=>(se(n,t),e.concat(n)),[]):F(e[0])?e.reduce((e,n)=>(_(n,t),`${e}${n}`),""):e.reduce((e,n)=>(j(n,t),Object.assign(e,n)),{})),arity:{min:1},docs:{category:"collection",returns:{type:"collection"},args:{a:{type:"collection"},b:{type:"collection"},colls:{type:"collection",rest:!0}},variants:[{argumentNames:["a"]},{argumentNames:["a","colls"]}],description:"Concatenates collections into one collection.",seeAlso:["mapcat","str","join","push","sequence.unshift"],examples:['"Albert" ++ " " ++ "Mojir"','"Albert" ++ "Mojir"','++("Albert", "-", "Mojir")','++("Albert")','++("A", "l", "b", "e", "r", "t")',"++([1, 2], [3, 4])","++([], [3, 4])","++([1, 2], [])","++([1, 2], [3, 4], [5, 6])","++([])","++({ a: 1, b: 2 }, { b: 1, c: 2 })","++({}, { a: 1 })"]}}},he={range:{evaluate:(e,t)=>{const[n,r,s]=e;let a,o,i;z(n,t,{finite:!0}),1===e.length?(a=0,o=n,i=o>=0?1:-1):2===e.length?(z(r,t,{finite:!0}),a=n,o=r,i=o>=a?1:-1):(z(r,t,{finite:!0}),z(s,t,{finite:!0}),a=n,o=r,i=s,z(i,t,o>a?{positive:!0}:o<a?{negative:!0}:{nonZero:!0}));const c=[];for(let e=a;i<0?e>o:e<o;e+=i)c.push(e);return c},arity:{min:1,max:3},docs:{category:"array",returns:{type:"number",array:!0},args:{a:{type:"number"},b:{type:"number"},step:{type:"number"}},variants:[{argumentNames:["b"]},{argumentNames:["a","b"]},{argumentNames:["a","b","step"]}],description:"$range creates an array with a range of numbers from $a to $b (exclusive), by $step.\n\n$a defaults to 0.\n$step defaults to 1.",seeAlso:["repeat","vector.linspace"],examples:["range(4)","range(1, 4)","1 range 10","range(0.4, 4.9)","\nrange(\n  0.25, // start value\n  1,    // end value (exclusive)\n  0.25, // step value\n)"]}},repeat:{evaluate:([e,t],n)=>{z(t,n,{integer:!0,nonNegative:!0});const r=[];for(let n=0;n<t;n+=1)r.push(e);return r},arity:K(2),docs:{category:"array",returns:{type:"any",array:!0},args:{a:{type:"any"},b:{type:"integer"}},variants:[{argumentNames:["a","b"]}],description:"Returns an array with $a repeated $b times.",seeAlso:["range","string.string-repeat"],examples:["repeat(10, 3)","repeat(10, 0)",'"Albert" repeat 5']}},flatten:{evaluate:([e,t],n)=>{se(e,n);const r=void 0===t||t===Number.POSITIVE_INFINITY?Number.POSITIVE_INFINITY:function(e,t,n={}){return z(e,t,n),e}(t,n,{integer:!0,nonNegative:!0});return e.flat(r)},arity:{min:1,max:2},docs:{category:"array",returns:{type:"any",array:!0},args:{x:{type:["array","any"],description:"If $x is not an array, `[ ]` is returned."}},variants:[{argumentNames:["x"]}],description:"Takes a nested array $x and flattens it.",seeAlso:["mapcat"],examples:["flatten([1, 2, [3, 4], 5])",'\nlet foo = "bar";\nflatten([\n  1,\n  " 2 A ",\n  [foo, [4, ["ABC"]]],\n  6,\n])'],hideOperatorForm:!0}},mapcat:{evaluate:([e,t],n,r,{executeFunction:s})=>(se(e,n),O(t,n),ie(ce(e,e=>s(t,[e],r,n)),e=>e.flat(1))),arity:K(2),docs:{category:"array",returns:{type:"collection"},args:{a:{type:"collection"},b:{type:"function"},colls:{type:"collection",array:!0},fun:{type:"function"}},variants:[{argumentNames:["colls","fun"]}],description:"Returns the result of applying concat to the result of applying map to $fun and $colls.",seeAlso:["flatten","map","++"],examples:["[[3, 2, 1, 0], [6, 5, 4], [9, 8, 7]] mapcat reverse","mapcat([[3, 2, 1, 0], [6, 5, 4], [9, 8, 7]], reverse)","[[3, 2, 1, 0,], [6, 5, 4,], [9, 8, 7]] mapcat reverse","\nlet foo = (n) -> do\n  [n - 1, n, n + 1]\nend;\n[1, 2, 3] mapcat foo","\nmapcat(\n  [[1, 2], [2, 2], [2, 3]],\n  -> $ filter odd?\n)"]}},"moving-fn":{evaluate:([e,t,n],r,s,{executeFunction:a})=>{se(e,r),z(t,r,{integer:!0,lte:e.length}),O(n,r);const o=[];for(let n=0;n<=e.length-t;n++)o.push(e.slice(n,n+t));return ce(o,e=>a(n,[e],s,r))},arity:K(3),docs:{category:"array",returns:{type:"array"},args:{arr:{type:"array"},windowSize:{type:"number",description:"The size of the moving window."},fn:{type:"function"}},variants:[{argumentNames:["arr","windowSize","fn"]}],description:"Returns the result of applying $fn to each moving window of size $windowSize in $arr.",seeAlso:["running-fn","vector.moving-mean"],examples:["moving-fn([1, 2, 3], 2, sum)","moving-fn([1, 2, 3], 1, sum)","moving-fn([1, 2, 3], 3, sum)"]}},"running-fn":{evaluate:([e,t],n,r,{executeFunction:s})=>{se(e,n),O(t,n);const a=[];for(let t=0;t<e.length;t+=1)a.push(e.slice(0,t+1));return ce(a,e=>s(t,[e],r,n))},arity:K(2),docs:{category:"array",returns:{type:"array"},args:{a:{type:"array"},b:{type:"function"}},variants:[{argumentNames:["a","b"]}],description:"Returns the result of applying $b to each element of $a.",seeAlso:["moving-fn","vector.running-mean"],examples:["running-fn([1, 2, 3], sum)","running-fn([1, 2, 3], max)","running-fn([1, 2, 3], min)"]}}},ve={nth:{evaluate:(e,t)=>{const[n,r]=e,s=Q(e[2]);if(z(r,t,{integer:!0}),null===n)return s;if(N(n,t),r>=0&&r<n.length){return Q(n[r])}return s},arity:{min:2,max:3},docs:{category:"sequence",returns:{type:"any"},args:{a:{type:"sequence"},b:{type:"integer"},seq:{type:["sequence","null"]},n:{type:"integer"},"not-found":{type:"any"}},variants:[{argumentNames:["seq","n"]},{argumentNames:["seq","n","not-found"]}],description:"Accesses element $n of $seq. Accessing out-of-bounds indices returns $not-found, if present, else `null`.",seeAlso:["first","second","last","get","slice"],examples:["[1, 2, 3] nth 1",'"A string" nth 3',"nth([1, 2, 3], 1)","nth([1, 2, 3], 3)","nth([1, 2, 3], -1)","nth([1, 2, 3], 3, 99)",'nth("A string", 1)','nth("A string", 3)','nth("A string", -3)','nth("A string", 30, "X")',"nth(null, 1)",'nth(null, 1, "Default value")']}},first:{evaluate:([e],t)=>{if(null===e)return null;N(e,t);return Q(e[0])},arity:K(1),docs:{category:"sequence",returns:{type:"any"},args:{seq:{type:["sequence","null"]}},variants:[{argumentNames:["seq"]}],description:"Returns the first element of $seq. If $seq is empty or `null`, `null` is returned.",seeAlso:["second","last","nth","rest","next"],examples:['first(["Albert", "Mojir", 160, [1, 2]])',"first([])","first(null)"]}},last:{evaluate:([e],t)=>{if(null===e)return null;N(e,t);return Q(e.at(-1))},arity:K(1),docs:{category:"sequence",returns:{type:"any"},args:{seq:{type:["sequence","null"]}},variants:[{argumentNames:["seq"]}],description:"Returns the last element of $seq. If $seq is empty, `null` is returned.",seeAlso:["first","second","nth","pop"],examples:['last(["Albert", "Mojir", 160, [1, 2]])',"last([1, 2])","last([1])","last([])","last(null)"]}},pop:{evaluate:([e],t)=>(N(e,t),"string"==typeof e?e.substring(0,e.length-1):e.slice(0,e.length-1)),arity:K(1),docs:{category:"sequence",returns:{type:["sequence","null"],rest:!0},args:{seq:{type:"sequence"}},variants:[{argumentNames:["seq"]}],description:"Returns a copy of $seq with last element removed. If $seq is empty `null` is returned.",seeAlso:["push","last"],examples:["pop([1, 2, 3])","pop([])"]}},"index-of":{evaluate:([e,t],n)=>{if($(t,n),null===e)return null;if(N(e,n),"string"==typeof e){M(t,n);const r=e.indexOf(t);return-1!==r?r:null}{const r=e.findIndex(e=>Z(A(e,n),t),n);return-1!==r?r:null}},arity:K(2),docs:{category:"sequence",returns:{type:["number","null"]},args:{a:{type:"sequence"},b:{type:"any"},seq:{type:["sequence","null"]},x:{type:"any"}},variants:[{argumentNames:["seq","x"]}],description:"Returns the index of $x in $seq. If element is not present in $seq `null` is returned.",seeAlso:["sequence.last-index-of","sequence.position","contains?"],examples:["[[1], [2], [1], [2]] index-of [1]",'index-of(["Albert", "Mojir", 160, [1, 2]], "Mojir")',"index-of([5, 10, 15, 20], 15)","index-of([5, 10, 15, 20], 1)","index-of(null, 1)"]}},push:{evaluate:([e,...t],n)=>(N(e,n),"string"==typeof e?(oe(t,n),[e,...t].join("")):[...e,...t]),arity:{min:2},docs:{category:"sequence",returns:{type:"sequence"},args:{a:{type:"sequence"},b:{type:"any"},seq:{type:"sequence"},values:{type:"any",rest:!0,description:"At least one."}},variants:[{argumentNames:["seq","values"]}],description:"Returns copy of $seq with $values added to the end of it.",seeAlso:["sequence.unshift","pop","++"],examples:["[1, 2, 3] push 4",'"Albert" push "!"',"push([1, 2, 3], 4)","push([1, 2, 3], 4, 5, 6)","\nlet l = [1, 2, 3];\npush(l, 4);\nl"]}},rest:{evaluate:([e],t)=>(N(e,t),Array.isArray(e)?e.length<=1?[]:e.slice(1):e.substring(1)),arity:K(1),docs:{category:"sequence",returns:{type:["sequence","null"]},args:{seq:{type:"sequence"}},variants:[{argumentNames:["seq"]}],description:"If $seq is an array, returns a new array with all but the first element from $seq.\nIf $seq has less than two elements, an empty array is returned.\nFor string $seq returns all but the first characters in $seq.",seeAlso:["next","first"],examples:['rest(["Albert", "Mojir", 160, [1, 2]])','rest(["Albert"])',"rest([])",'rest("Albert")','rest("A",)','rest("")']}},next:{evaluate:([e],t)=>(N(e,t),Array.isArray(e)?e.length<=1?null:e.slice(1):e.length<=1?null:e.substring(1)),arity:K(1),docs:{category:"sequence",returns:{type:["sequence","null"]},args:{seq:{type:"sequence"}},variants:[{argumentNames:["seq"]}],description:"If $seq is an array, returns a new array with all but the first element from $seq. If $seq has less than two elements, `null` is returned. For string $seq returns all but the first characters in $seq. If length of string $seq is less than two, `null` is returned.",seeAlso:["rest","first"],examples:['next(["Albert", "Mojir", 160, [1, 2]])','next(["Albert"])',"next([])",'next("Albert")','next("A",)','next("")']}},reverse:{evaluate:([e],t)=>null===e?null:(N(e,t),Array.isArray(e)?[...e].reverse():e.split("").reverse().join("")),arity:K(1),docs:{category:"sequence",returns:{type:["sequence","null"]},args:{seq:{type:["sequence","null"]}},variants:[{argumentNames:["seq"]}],description:"If $seq is an array, creates a new array with the elements from $seq in reversed order. If $seq is a string, returns new reversed string.",seeAlso:["sort"],examples:['reverse(["Albert", "Mojir", 160, [1, 2]])',"reverse([])",'reverse("Albert")',"reverse(null)"]}},second:{evaluate:([e],t)=>null===e?null:(N(e,t),Q(e[1])),arity:K(1),docs:{category:"sequence",returns:{type:"any"},args:{seq:{type:["sequence","null"]}},variants:[{argumentNames:["seq"]}],description:"Returns the second element of $seq. If $seq has less than two elements or is `null`, `null` is returned.",seeAlso:["first","last","nth"],examples:['second(["Albert", "Mojir", 160, [1, 2]])',"second([1])","second([])","second(null)"]}},slice:{evaluate:(e,t)=>{const[n,r,s]=e;return N(n,t),z(r,t,{integer:!0}),2===e.length?(Array.isArray(n),n.slice(r)):(z(s,t,{integer:!0}),Array.isArray(n),n.slice(r,s))},arity:{min:2,max:3},docs:{category:"sequence",returns:{type:"sequence"},args:{a:{type:"sequence"},b:{type:"integer"},seq:{type:"sequence",rest:!0},start:{type:"integer",description:"Defaults to `0`."},stop:{type:"integer",description:"Defaults lenght of sequence + 1."}},variants:[{argumentNames:["seq"]},{argumentNames:["seq","start"]},{argumentNames:["seq","start","stop"]}],description:"Returns a copy of a portion of $seq from index $start (inclusive) to $stop (exclusive).",seeAlso:["take","drop","sequence.splice","nth"],examples:["[1, 2, 3, 4, 5] slice 2","slice([1, 2, 3, 4, 5], 2, 4)","slice([1, 2, 3, 4, 5], 2)"]}},some:{evaluate:([e,t],n,r,{executeFunction:s})=>{if(O(t,n),null===e)return null;if(N(e,n),0===e.length)return null;return le("string"==typeof e?e.split(""):e,(e,a)=>null!==e?e:ie(s(t,[a],r,n),e=>e?Q(a):null),null)},arity:K(2),docs:{category:"sequence",returns:{type:"any"},args:{a:{type:"sequence"},b:{type:"function"},seq:{type:["sequence","null"]},fun:{type:"function"}},variants:[{argumentNames:["seq","fun"]}],description:"Returns the first element that passes the test implemented by $fun. I no element was found, `null` is returned.",seeAlso:["sequence.position","collection.any?","find"],examples:['\nsome(\n  ["Albert", "Mojir", 160, [1, 2]],\n  string?\n)',"\nsome(\n  [5, 10, 15, 20],\n  -> $ > 10\n)","\nsome(\n  [1, 2, 3, 4],\n  -> $ > 10\n)","\nsome(\n  [],\n  -> $ > 10\n)","\nsome(\n  null,\n  -> $ > 10\n)"]}},sort:{evaluate:(e,t,n,{executeFunction:r})=>{const[s]=e,a=1===e.length,o=a?null:e[1];if(N(s,t),"string"==typeof s){const e=s.split("");return a?e.sort((e,n)=>H(e,n,t)):(O(o,t),e.sort((e,s)=>{const a=r(o,[e,s],n,t);if(a instanceof Promise)throw new TypeError("Async functions cannot be used as sort comparators");return z(a,t,{finite:!0}),a})),e.join("")}const i=[...s];return a?i.sort((e,n)=>(_(e,t),_(n,t),H(e,n,t))):i.sort((e,s)=>{O(o,t);const a=r(o,[e,s],n,t);if(a instanceof Promise)throw new TypeError("Async functions cannot be used as sort comparators");return z(a,t,{finite:!0}),a}),i},arity:{min:1,max:2},docs:{category:"sequence",returns:{type:"any",rest:!0},args:{a:{type:"sequence"},b:{type:"function"},seq:{type:"sequence"},fun:{type:"function"}},variants:[{argumentNames:["seq"]},{argumentNames:["seq","fun"]}],description:"Returns a new sequence with the elements from $seq sorted according to $fun. If no $fun is supplied, builtin `compare` will be used.",seeAlso:["sequence.sort-by","compare","reverse","vector.sort-indices"],examples:["[3, 1, 2] sort (a, b) -> b - a","sort([3, 1, 2])","\nsort(\n  [3, 1, 2],\n  (a, b) -> cond case a < b then -1 case a > b then 1 case true then -1 end\n)","\nsort(\n  [3, 1, 2],\n  (a, b) -> cond case a > b then -1 case a < b then 1 case true then -1 end\n)"]}},take:{evaluate:([e,t],n)=>{z(t,n),N(e,n);const r=Math.max(Math.ceil(t),0);return e.slice(0,r)},arity:K(2),docs:{category:"sequence",returns:{type:"sequence"},args:{a:{type:"sequence"},b:{type:"integer"},n:{type:"integer"},seq:{type:"sequence"}},variants:[{argumentNames:["seq","n"]}],description:"Constructs a new array/string with the $n first elements from $seq.",seeAlso:["take-last","take-while","drop","slice","sequence.split-at"],examples:["take([1, 2, 3, 4, 5], 3)","[1, 2, 3, 4, 5] take 3","take([1, 2, 3, 4, 5], 0)",'take("Albert", 2)','take("Albert", 50)']}},"take-last":{evaluate:([e,t],n)=>{N(e,n),z(t,n);const r=Math.max(Math.ceil(t),0),s=e.length-r;return e.slice(s)},arity:K(2),docs:{category:"sequence",returns:{type:"sequence"},args:{a:{type:"sequence"},b:{type:"integer"},n:{type:"integer"},seq:{type:"sequence"}},variants:[{argumentNames:["seq","n"]}],description:"Constructs a new array with the $n last elements from $seq.",seeAlso:["take","drop-last"],examples:["take-last([1, 2, 3, 4, 5], 3)","[1, 2, 3, 4, 5] take-last 3","take-last([1, 2, 3, 4, 5], 0)"]}},drop:{evaluate:([e,t],n)=>{z(t,n);const r=Math.max(Math.ceil(t),0);return N(e,n),e.slice(r)},arity:K(2),docs:{category:"sequence",returns:{type:"sequence"},args:{a:{type:"sequence"},b:{type:"integer"},seq:{type:"sequence"},n:{type:"integer"}},variants:[{argumentNames:["seq","n"]}],description:"Constructs a new array/string with the $n first elements dropped from $seq.",seeAlso:["drop-last","drop-while","take","slice","sequence.split-at"],examples:["drop([1, 2, 3, 4, 5], 3)","[1, 2, 3, 4, 5] drop 0",'drop("Albert", 2)','drop("Albert", 50)']}},"drop-last":{evaluate:([e,t],n)=>{N(e,n),z(t,n);const r=Math.max(Math.ceil(t),0),s=e.length-r;return e.slice(0,s)},arity:K(2),docs:{category:"sequence",returns:{type:"sequence"},args:{a:{type:"sequence"},b:{type:"integer"},seq:{type:"sequence"},n:{type:"integer"}},variants:[{argumentNames:["seq","n"]}],description:"Constructs a new array with the $n last elements dropped from $seq.",seeAlso:["drop","take-last"],examples:["drop-last([1, 2, 3, 4, 5], 3)","[1, 2, 3, 4, 5] drop-last 3","drop-last([1, 2, 3, 4, 5], 0)"]}},"take-while":{evaluate:([e,t],n,r,{executeFunction:s})=>{N(e,n),O(t,n);const a="string"==typeof e?e.split(""):Array.from(e);return ie(me(a,e=>ie(s(t,[e],r,n),e=>!e)),t=>{const n=-1===t?a:a.slice(0,t);return"string"==typeof e?n.join(""):n})},arity:K(2),docs:{category:"sequence",returns:{type:"sequence"},args:{a:{type:"sequence"},b:{type:"function"},seq:{type:"sequence"},fun:{type:"function"}},variants:[{argumentNames:["seq","fun"]}],description:"Returns the members of $seq in order, stopping before the first one for which `predicate` returns a falsy value.",seeAlso:["take","drop-while","sequence.split-with"],examples:["take-while(\n  [1, 2, 3, 2, 1],\n  -> $ < 3\n)","take-while(\n  [1, 2, 3, 2, 1],\n  -> $ > 3\n)"]}},"drop-while":{evaluate:([e,t],n,r,{executeFunction:s})=>{N(e,n),O(t,n);const a=Array.isArray(e)?e:e.split("");return ie(me(a,e=>ie(s(t,[e],r,n),e=>!e)),t=>-1===t?"string"==typeof e?"":[]:"string"==typeof e?a.slice(t).join(""):e.slice(t))},arity:K(2),docs:{category:"sequence",returns:{type:"sequence"},args:{a:{type:"sequence"},b:{type:"function"},seq:{type:"sequence"},fun:{type:"function"}},variants:[{argumentNames:["seq","fun"]}],description:"Returns the members of $seq in order, skipping the fist elements for witch the `predicate` returns a truethy value.",seeAlso:["drop","take-while","sequence.split-with"],examples:["drop-while(\n  [1, 2, 3, 2, 1],\n  -> $ < 3\n)","drop-while(\n  [1, 2, 3, 2, 1],\n  -> $ > 3\n)"]}}},be=new WeakSet,xe=new WeakSet,we=new WeakSet,ke=new WeakSet,Ae=new WeakSet,$e=new WeakSet,Ee=new WeakSet;function Ne(e){return Array.isArray(e)?(be.has(e)||(Se(e),Ce(e)||Ie(e)),e):e}function Se(e){return!!Array.isArray(e)&&(!!xe.has(e)||!we.has(e)&&(e.every(e=>D(e))?(be.add(e),xe.add(e),!0):(we.add(e),!1)))}function je(e,t){if(!Se(e))throw new n(`Expected a vector, but got ${e}`,t)}function qe(e,t){if(je(e,t),0===e.length)throw new n(`Expected a non empty vector, but got ${e}`,t)}function Ie(e){if(!Array.isArray(e))return!1;if($e.has(e))return!0;if(Ee.has(e))return!1;if(0===e.length)return Ee.add(e),!1;if(!Array.isArray(e[0]))return Ee.add(e),!1;const t=e[0].length;for(const n of e.slice(1)){if(!Array.isArray(n))return Ee.add(e),!1;if(n.length!==t)return Ee.add(e),!1}return be.add(e),$e.add(e),!0}function Ce(e){if(!Array.isArray(e))return!1;if(ke.has(e))return!0;if(Ae.has(e))return!1;if(0===e.length)return Ae.add(e),!1;if(!Array.isArray(e[0])||0===e[0].length)return Ae.add(e),!1;const t=e[0].length;for(const n of e)if(!Array.isArray(n)||n.length!==t||n.some(e=>!D(e)))return Ae.add(e),!1;return be.add(e),$e.add(e),ke.add(e),!0}function Pe(e,t){let r=!1,s=!1;for(const a of e)if(Se(a))r=!0;else if(Ce(a))s=!0;else if(!D(a))throw new n("Invalid parameter type: "+typeof a,t);if(s){if(r)throw new n("Cannot mix vector and matrix types",t);let s=null,a=null;for(const r of e)if(Ce(r))if(null===s)s=r.length,a=r[0].length;else if(r.length!==s||r[0].length!==a)throw new n("Matrix dimensions do not match",t);return["matrix",e.map(e=>Ce(e)?e:Array.from({length:s},()=>Array.from({length:a},()=>e)))]}if(r){let r=null;for(const s of e)if(Se(s))if(null===r)r=s.length;else if(s.length!==r)throw new n("Vector lengths do not match",t);return["vector",e.map(e=>Se(e)?e:Array.from({length:r},()=>e))]}return["number",e]}function Re(e){return(t,n)=>{const[r,s]=Pe(t,n);return"number"===r?e(s[0]):"vector"===r?s[0].map(t=>e(t)):s[0].map(t=>t.map(t=>e(t)))}}function Te(e){return(t,n)=>{const[r,s]=Pe(t,n);return"number"===r?e(s[0],s[1]):"vector"===r?s[0].map((t,n)=>e(t,s[1][n])):s[0].map((t,n)=>t.map((t,r)=>e(t,s[1][n][r])))}}function Oe(e,t){return(n,r)=>{if(0===n.length)return e;const[s,a]=Pe(n,r);if("number"===s)return a.reduce((e,n)=>t(e,n),e);if("vector"===s){const[e,...n]=a;return n.reduce((e,n)=>e.map((e,r)=>t(e,n[r])),e)}{const[e,...n]=a;return n.reduce((e,n)=>e.map((e,r)=>e.map((e,s)=>t(e,n[r][s]))),e)}}}const Ue={inc:{evaluate:Re(e=>e+1),arity:K(1),docs:{category:"math",returns:{type:"number"},args:{x:{type:["number","vector","matrix"]}},variants:[{argumentNames:["x"]}],description:"The `inc` function increments its argument by 1, working on `numbers` and element-wise on `vectors` and `matrices`. When applied to collections, it increases each element by 1 while preserving the original structure.",seeAlso:["dec","+"],examples:["inc(0)","inc(1)","inc(100.1)","inc([1, 2, 3])","inc([[1, 2], [3, 4]])"]}},dec:{evaluate:Re(e=>e-1),arity:K(1),docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{x:{type:["number","vector","matrix"]}},variants:[{argumentNames:["x"]}],description:"The `dec` function decrements its argument by 1, working on `numbers` and element-wise on `vectors` and `matrices`. When applied to collections, it decreases each element by 1 while preserving the original structure.",seeAlso:["inc","-"],examples:["dec(0)","dec(1)","dec(100.1)","dec([1, 2, 3])","dec([[1, 2], [3, 4]])"]}},"+":{evaluate:Oe(0,(e,t)=>e+t),arity:{},docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{a:{type:["number","vector","matrix"]},b:{type:["number","vector","matrix"]},xs:{type:["number","vector","matrix"],rest:!0}},variants:[{argumentNames:["xs"]}],description:"The `+` function performs addition of numbers and element-wise addition of `vectors` and `matrices` of compatible dimensions, returning the same type as its inputs. When used with mixed types, it adds the scalar to each element of the collection.",seeAlso:["-","*","/","inc"],examples:["1 + 2","1 + 20 + 30","+(1, 2, 3, 4)","+()","+(1)","[1, 2, 3] + 2","[1, 2, 3] + [4, 5, 6]","[[1, 2, 3], [4, 5, 6]] + [[7, 8, 9], [10, 11, 12]]","[[1, 2, 3], [4, 5, 6]] + 2"]}},"*":{evaluate:Oe(1,(e,t)=>e*t),arity:{},docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{a:{type:["number","vector","matrix"]},b:{type:["number","vector","matrix"]},xs:{type:["number","vector","matrix"],rest:!0}},variants:[{argumentNames:["xs"]}],description:"The `*` function performs multiplication of `numbers` and element-wise multiplication of `vectors` and `matrices` of compatible dimensions, returning the same type as its inputs. When used with mixed types, it multiplies each element of the collection by the scalar.",seeAlso:["/","+","-","^"],examples:["6 * 7","-1 * 4","*(4, 7)","*(1, 2, 3, 4, 5)","*()","*(8)","[1, 2, 3] * 2","[1, 2, 3] * [4, 5, 6]","[[1, 2, 3], [4, 5, 6]] * [[7, 8, 9], [10, 11, 12]]","[[1, 2, 3], [4, 5, 6]] * 2"]}},"/":{evaluate:(e,t)=>{if(0===e.length)return 1;const[n,r]=Pe(e,t);if("number"===n){const[e,...t]=r;return 0===t.length?1/e:t.reduce((e,t)=>e/t,e)}if("vector"===n){const e=r[0];return r.slice(1).reduce((e,t)=>e.map((e,n)=>e/t[n]),e)}{const e=r[0];return r.slice(1).reduce((e,t)=>e.map((e,n)=>e.map((e,r)=>e/t[n][r])),e)}},arity:{},docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{a:{type:["number","vector","matrix"]},b:{type:["number","vector","matrix"]},xs:{type:["number","vector","matrix"],rest:!0}},variants:[{argumentNames:["xs"]}],description:"The `/` function performs division of `numbers` and element-wise division of `vectors` and `matrices` of compatible dimensions, returning the same type as its inputs. When used with mixed types, it divides each element of the collection by the scalar.",seeAlso:["*","+","-","quot","mod","%"],examples:["12 / 100","-1 / 4","/(7, 4)","/(1, 2, 4, 8)","/()","/(8)","[1, 2, 3] / 2","[1, 2, 3] / [4, 5, 6]","[[1, 2, 3], [4, 5, 6]] / [[7, 8, 9], [10, 11, 12]]","[[1, 2, 3], [4, 5, 6]] / 2"]}},"-":{evaluate:(e,t)=>{if(0===e.length)return 0;const[n,r]=Pe(e,t);if("number"===n){const[e,...t]=r;return 0===t.length?-e:t.reduce((e,t)=>e-t,e)}if("vector"===n){const e=r[0];return r.slice(1).reduce((e,t)=>e.map((e,n)=>e-t[n]),e)}{const e=r[0];return r.slice(1).reduce((e,t)=>e.map((e,n)=>e.map((e,r)=>e-t[n][r])),e)}},arity:{},docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{a:{type:["number","vector","matrix"]},b:{type:["number","vector","matrix"]},xs:{type:["number","vector","matrix"],rest:!0}},variants:[{argumentNames:["xs"]}],description:"Computes difference between first value and sum of the rest. When called with only one argument, it does negation.",seeAlso:["+","*","/","dec","abs"],examples:["50 - 8","1 - 1 - 1","-()","-(4, 2)","-(4, 3, 2, 1,)","[1, 2, 3] - 2","[1, 2, 3] - [4, 5, 6]","[[1, 2, 3], [4, 5, 6]] - [[7, 8, 9], [10, 11, 12]]","[[1, 2, 3], [4, 5, 6]] - 2"]}},quot:{evaluate:Te((e,t)=>Math.trunc(e/t)),arity:K(2),docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{a:{type:["number","vector","matrix"]},b:{type:["number","vector","matrix"]}},variants:[{argumentNames:["a","b"]}],description:"The `quot` function performs integer division truncated toward zero, working on `numbers` and element-wise on `vectors` and `matrices` of compatible dimensions. When used with mixed types, it applies integer division between each element of the collection and the scalar.",seeAlso:["mod","%","/","trunc"],examples:["quot(5, 3)","quot(5.2, 3.1)","quot(-5, 3)","5 quot -3","-5 quot -3","quot(5, 0)","quot(0, 5)","[1, 2, 3] quot 2","2 quot [1, 2, 3]","quot([1, 2, 3], [4, 5, 6])","[[1, 2, 3], [4, 5, 6]] quot [[7, 8, 9], [10, 11, 12]]","quot([[1, 2, 3], [4, 5, 6]], 2)","[[1, 2, 3], [4, 5, 6]] quot [[7, 8, 9], [10, 11, 12]]"]}},mod:{evaluate:Te((e,t)=>e-t*Math.floor(e/t)),arity:K(2),docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{a:{type:["number","vector","matrix"]},b:{type:["number","vector","matrix"]}},variants:[{argumentNames:["a","b"]}],description:"The `mod` function computes the modulo of division with the same sign as the divisor, working on `numbers` and element-wise on `vectors` and `matrices` of compatible dimensions. When used with mixed types, it applies the modulo operation between each element of the collection and the scalar.",seeAlso:["%","quot","/"],examples:["mod(5, 3)","mod(5.2, 3.1)","mod(-5, 3)","5 mod -3","-5 mod -3","[1, 2, 3] mod 2","2 mod [1, 2, 3]","mod([1, 2, 3], [4, 5, 6])","[[1, 2, 3], [4, 5, 6]] mod [[7, 8, 9], [10, 11, 12]]","mod([[1, 2, 3], [4, 5, 6]], 2)"]}},"%":{evaluate:Te((e,t)=>e%t),arity:K(2),docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{a:{type:["number","vector","matrix"]},b:{type:["number","vector","matrix"]}},variants:[{argumentNames:["a","b"]}],description:"The `%` function computes the remainder of division with the same sign as the dividend, working on `numbers` and element-wise on `vectors` and `matrices` of compatible dimensions. When used with mixed types, it applies the remainder operation between each element of the collection and the scalar.",seeAlso:["mod","quot","/"],examples:["5 % 3","5.2 % 3.1","-5 % 3","%(5, -3)","%(-5, -3)","[1, 2, 3] % 2","2 % [1, 2, 3]","%([1, 2, 3], [4, 5, 6])","[[1, 2, 3], [4, 5, 6]] % [[7, 8, 9], [10, 11, 12]]","%([[1, 2, 3], [4, 5, 6]], 2)"]}},sqrt:{evaluate:Re(e=>Math.sqrt(e)),arity:K(1),docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{x:{type:["number","vector","matrix"]}},variants:[{argumentNames:["x"]}],description:"The `sqrt` function calculates the square root of `numbers` and computes element-wise square roots of `vectors` and `matrices`. When applied to collections, it returns the square root of each element while preserving the original structure.",seeAlso:["cbrt","^"],examples:["sqrt(0)","sqrt(9)","sqrt(2)","sqrt(0)","sqrt(9)","sqrt(2)","sqrt([1, 4, 9])","sqrt([[1, 4], [9, 16]])"]}},cbrt:{evaluate:Re(e=>Math.cbrt(e)),arity:K(1),docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{x:{type:["number","vector","matrix"]}},variants:[{argumentNames:["x"]}],description:"The `cbrt` function calculates the cube root of `numbers` and computes element-wise cube roots of `vectors` and `matrices`. When applied to collections, it returns the cube root of each element while preserving the original structure.",seeAlso:["sqrt","^"],examples:["cbrt(0)","cbrt(27)","cbrt(2)","cbrt(1)","cbrt(0)","cbrt(27)","cbrt(2)","cbrt(1)","cbrt([1, 8, 27])","cbrt([[1, 8], [27, 64]])"]}},"^":{evaluate:Te((e,t)=>e**t),arity:K(2),docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{a:{type:["number","vector","matrix"]},b:{type:["number","vector","matrix"]}},variants:[{argumentNames:["a","b"]}],description:"The ^ function computes exponentiation, raising the first argument to the power of the second, working on `numbers` and element-wise on `vectors` and `matrices` of compatible dimensions. When used with mixed types, it applies the power operation between each element of the collection and the scalar.",seeAlso:["sqrt","cbrt","*","math.ln"],examples:["2 ^ 3","2 ^ 0","2 ^ -3","^(-2, 3)","^(-2, -3)","[1, 2, 3] ^ 2","2 ^ [1, 2, 3]","^([1, 2, 3], [4, 5, 6])","[[1, 2, 3], [4, 5, 6]] ^ [[7, 8, 9], [10, 11, 12]]","^([[1, 2, 3], [4, 5, 6]], 2)"]}},round:{evaluate:([e,t],n)=>{const[r,s]=Pe([e],n);if("number"===r){if(void 0===t||0===t)return Math.round(s[0]);{z(t,n,{integer:!0,positive:!0});const e=10**t;return Math.round(s[0]*e)/e}}if("vector"===r){const e=s[0];if(void 0===t||0===t)return e.map(e=>Math.round(e));{z(t,n,{integer:!0,positive:!0});const r=10**t;return e.map(e=>Math.round(e*r)/r)}}{const e=s[0];if(void 0===t||0===t)return e.map(e=>e.map(e=>Math.round(e)));{z(t,n,{integer:!0,positive:!0});const r=10**t;return e.map(e=>e.map(e=>Math.round(e*r)/r))}}},arity:{min:1,max:2},docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{a:{type:["number","vector","matrix"]},b:{type:"integer"}},variants:[{argumentNames:["a"]},{argumentNames:["a","b"]}],description:"The `round` function rounds a `number` to the nearest `integer` or to a specified number of `decimal` places, working on `numbers` and element-wise on `vectors` and `matrices`. When applied to collections, it rounds each element while preserving the original structure.",seeAlso:["floor","ceil","trunc"],examples:["round(2)","round(2.49)","round(2.5)","round(-2.49)","round(-2.5)","round(-2.501)","round(1.23456789, 4)","1.123456789 round 2","round([1.23456789, 2.3456789], 1)","[1.23456789, 2.3456789] round 4","[[1.23456789, 2.3456789], [3.456789, 4.56789]] round 4","round([[1.23456789, 2.3456789], [3.456789, 4.56789]], 2)"]}},trunc:{evaluate:Re(e=>Math.trunc(e)),arity:K(1),docs:{category:"math",returns:{type:["integer","vector","matrix"]},args:{x:{type:["number","vector","matrix"]}},variants:[{argumentNames:["x"]}],description:"The `trunc` function truncates `numbers` toward zero (removing decimal portions without rounding), working on `numbers` and element-wise on `vectors` and `matrices`. When applied to collections, it truncates each element while preserving the original structure.",seeAlso:["round","floor","ceil","quot"],examples:["trunc(2)","trunc(2.49)","trunc(2.5)","trunc(-2.49)","trunc(-2.5)","trunc(-2.501)","trunc([1.23456789, 2.3456789])","trunc([[1.23456789, 2.3456789], [3.456789, 4.56789]])"]}},floor:{evaluate:Re(e=>Math.floor(e)),arity:K(1),docs:{category:"math",returns:{type:["integer","vector","matrix"]},args:{x:{type:["number","vector","matrix"]}},variants:[{argumentNames:["x"]}],description:"The `floor` function returns the largest `integer` less than or equal to a `number`, working on `numbers` and element-wise on `vectors` and `matrices`. When applied to collections, it returns the floor of each element while preserving the original structure.",seeAlso:["ceil","round","trunc"],examples:["floor(2)","floor(2.49)","floor(2.5)","floor(-2.49)","floor(-2.5)","floor(-2.501)","floor([1.23456789, 2.3456789])","floor([[1.23456789, 2.3456789], [3.456789, 4.56789]])"]}},ceil:{evaluate:Re(e=>Math.ceil(e)),arity:K(1),docs:{category:"math",returns:{type:["integer","vector","matrix"]},args:{x:{type:["number","vector","matrix"]}},variants:[{argumentNames:["x"]}],description:"The `ceil` function returns the smallest `integer` greater than or equal to a `number`, working on `numbers` and element-wise on `vectors` and `matrices`. When applied to collections, it returns the ceiling of each element while preserving the original structure.",seeAlso:["floor","round","trunc"],examples:["ceil(2)","ceil(2.49)","ceil(2.5)","ceil(-2.49)","ceil(-2.5)","ceil(-2.501)","ceil([1.23456789, 2.3456789])","ceil([[1.23456789, 2.3456789], [3.456789, 4.56789]])"]}},min:{evaluate:(e,t)=>{if(1===e.length&&Se(e[0])){const n=e[0];return qe(n,t),n.reduce((e,t)=>Math.min(e,t),1/0)}const[n,...r]=e;return z(n,t),r.reduce((e,n)=>(z(n,t),Math.min(e,n)),n)},arity:{min:1},docs:{category:"math",returns:{type:"number"},args:{a:{type:"number"},b:{type:"number"},xs:{type:"number",rest:!0},vector:{type:"vector"}},variants:[{argumentNames:["xs"]},{argumentNames:["vector"]}],description:"Returns the smallest value. Accepts either multiple numbers or a single vector of numbers.",seeAlso:["max","vector.span","vector.min-index"],examples:["2 min 3","min(2, 0, 1)","min(2, -1, 1)","min([2, 0, -1])","12 min 14"]}},max:{evaluate:(e,t)=>{if(1===e.length&&Se(e[0])){const n=e[0];return qe(n,t),n.reduce((e,t)=>Math.max(e,t),-1/0)}const[n,...r]=e;return z(n,t),r.reduce((e,n)=>(z(n,t),Math.max(e,n)),n)},arity:{min:1},docs:{category:"math",returns:{type:"number"},args:{a:{type:"number"},b:{type:"number"},xs:{type:"number",rest:!0},vector:{type:"vector"}},variants:[{argumentNames:["xs"]},{argumentNames:["vector"]}],description:"Returns the largest value. Accepts either multiple numbers or a single vector of numbers.",seeAlso:["min","vector.span","vector.max-index"],examples:["2 max 3","max(2, 0, 1)","max(2, -1, 1)","max([2, 0, -1])","4 max 2"]}},abs:{evaluate:Re(e=>Math.abs(e)),arity:K(1),docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{x:{type:["number","vector","matrix"]}},variants:[{argumentNames:["x"]}],description:"The abs function returns the absolute value (magnitude) of a `number`, working on `numbers` and element-wise on `vectors` and `matrices`. When applied to collections, it returns the absolute value of each element while preserving the original structure.",seeAlso:["sign","-"],examples:["abs(-2.3)","abs(0)","abs(2.5)","abs([1, -2, 3])","abs([[1, -2], [3, -4]])"]}},sign:{evaluate:Re(e=>Math.sign(e)),arity:K(1),docs:{category:"math",returns:{type:["number","vector","matrix"]},args:{x:{type:["number","vector","matrix"]}},variants:[{argumentNames:["x"]}],description:"The `sign` function returns the `sign` of a `number` (-1 for negative, 0 for zero, 1 for positive), working on `numbers` and element-wise on `vectors` and `matrices`. When applied to collections, it returns the sign of each element while preserving the original structure.",seeAlso:["abs"],examples:["sign(-2.3)","sign(-0)","sign(0)","sign(12312)","sign([1, -2, 3])","sign([[1, -2], [3, -4]])"]}}};function Me([e,...t],n){const r=A(e,n);for(const e of t)if(!Z(r,A(e,n),n))return!1;return!0}const Ve={"==":{evaluate:(e,t)=>Me(e,t),arity:{min:1},docs:{category:"misc",returns:{type:"boolean"},args:{a:{type:"any"},b:{type:"any"},x:{type:"any"},ys:{type:"any",rest:!0}},variants:[{argumentNames:["x"]},{argumentNames:["x","ys"]}],description:"Returns `true` if all `values` are structaul equal to each other, otherwise result is `false`.",seeAlso:["!=","identical?"],examples:["1 == 1","[1, 2] == [1, 2]","\n{\n a: 1,\n b: 2,\n} == {\n b: 2,\n a: 1,\n}","==(1, 1)","==(1.01, 1)",'==("1", 1)','==("2", "2", "2", "2")',"==(2, 2, 1, 2)","==([1, 2], [1, 2])","==({ a: 1, b: 2 }, { b: 2, a: 1 })"]}},"!=":{evaluate:(e,t)=>!Me(e,t),arity:{min:1},docs:{category:"misc",returns:{type:"boolean"},args:{a:{type:"any"},b:{type:"any"},x:{type:"any"},ys:{type:"any",rest:!0}},variants:[{argumentNames:["x"]},{argumentNames:["x","ys"]}],description:"Returns `true` if all `values` are not equal to each other, otherwise result is `false`. `(!= a b c)` is same as `(not (== a b c))`.",seeAlso:["==","identical?"],examples:["1 != 2","3 != 3","!=(3)","!=(3, 3, 2)",'!=("3", "2", "1", "0",)',"!=(0, -0)"]}},"identical?":{evaluate:e=>function([e,...t]){for(const n of t)if(n!==e)return!1;return!0}(e),arity:{min:1},docs:{category:"misc",returns:{type:"boolean"},args:{a:{type:"any"},b:{type:"any"}},variants:[{argumentNames:["a","b"]}],description:"Returns true if $a and $b are referential equal.",seeAlso:["==","!="],examples:["identical?({ a: 10, b: 20 }, { b: 20, a: 10 })","identical?([1, true, null], [1, true, null])","identical?(0.3, 0.1 + 0.2)"]}},">":{evaluate:([e,...t],n)=>{let r=B(e);for(const e of t){if(H(r,B(e),n)<=0)return!1;r=B(e)}return!0},arity:{min:1},docs:{category:"misc",returns:{type:"boolean"},args:{a:{type:["number","string"]},b:{type:["number","string"]},x:{type:["number","string"]},ys:{type:["number","string"],rest:!0}},variants:[{argumentNames:["x"]},{argumentNames:["x","ys"]}],description:"Returns `true` if $x and $ys are in decreasing order, `false` otherwise.",seeAlso:["<",">=","<=","compare"],examples:[">(1, 0)",">(1.01, 1)",">(1, 1)",">(4, 3, 2, 1)",">(3, 2, 2, 1)"]}},"<":{evaluate:([e,...t],n)=>{let r=B(e);for(const e of t){if(H(r,B(e),n)>=0)return!1;r=B(e)}return!0},arity:{min:1},docs:{category:"misc",returns:{type:"boolean"},args:{a:{type:["number","string"]},b:{type:["number","string"]},x:{type:["number","string"]},ys:{type:["number","string"],rest:!0}},variants:[{argumentNames:["x"]},{argumentNames:["x","ys"]}],description:"Returns `true` if $x and $ys are in increasing order, `false` otherwise.",seeAlso:[">",">=","<=","compare"],examples:["<(0, 1)","<(1, 1.01)","<(1, 1)","<(1, 2, 2, 3)",'<("a", "b")']}},">=":{evaluate:([e,...t],n)=>{let r=B(e);for(const e of t){if(H(r,B(e),n)<0)return!1;r=B(e)}return!0},arity:{min:1},docs:{category:"misc",returns:{type:"boolean"},args:{a:{type:["number","string"]},b:{type:["number","string"]},x:{type:["number","string"]},ys:{type:["number","string"],rest:!0}},variants:[{argumentNames:["x"]},{argumentNames:["x","ys"]}],description:"Returns `true` if $x and $ys are in non increasing order, `false` otherwise.",seeAlso:[">","<","<=","compare"],examples:["1 >= 1","0 >= 1",">=(1, 0)",">=(1.01, 1)",">=(1, 1)",">=(4, 3, 2, 1)",">=(3, 2, 2, 1)"]}},"<=":{evaluate:([e,...t],n)=>{let r=B(e);for(const e of t){if(H(r,B(e),n)>0)return!1;r=B(e)}return!0},arity:{min:1},docs:{category:"misc",returns:{type:"boolean"},args:{a:{type:["number","string"]},b:{type:["number","string"]},x:{type:["number","string"]},ys:{type:["number","string"],rest:!0}},variants:[{argumentNames:["x"]},{argumentNames:["x","ys"]}],description:"Returns `true` if $x and $ys are in non decreasing order, `false` otherwise.",seeAlso:[">","<",">=","compare"],examples:["1 <= 1","<=(0, 1)","<=(1, 1.01)","<=(1, 1)","<=(1, 2, 3, 4)","<=(1, 2, 2, 3)"]}},not:{evaluate:([e])=>!e,arity:K(1),docs:{category:"misc",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Computes logical negation. Note that any other $x than `false`, `0`, `null` and `''` is truthy.",seeAlso:["boolean"],examples:["not(3)","not(true)",'not("A string")',"not(0)","not(false)","not(null)",'not("")']}},"epoch->iso-date":{evaluate:([e],t)=>(z(e,t),new Date(e).toISOString()),arity:K(1),docs:{category:"misc",returns:{type:"string"},args:{ms:{type:"number"}},variants:[{argumentNames:["ms"]}],description:"Returns IOS date time string from `ms` (milliseconds elapsed since the UNIX epoch).",seeAlso:["iso-date->epoch"],examples:["epoch->iso-date(1649756230899)","epoch->iso-date(0)"]}},"iso-date->epoch":{evaluate:([e],t)=>{M(e,t);const n=new Date(e).valueOf();return z(n,t,{finite:!0}),n},arity:K(1),docs:{category:"misc",returns:{type:"number"},args:{iso:{type:"string"}},variants:[{argumentNames:["iso"]}],description:"Returns milliseconds elapsed since the UNIX epoch to `iso`.",seeAlso:["epoch->iso-date"],examples:['iso-date->epoch("2022-04-12T09:37:10.899Z")','iso-date->epoch("1980-01-01")']}},"write!":{evaluate:(e,t)=>(console.log(...e),e.length>0?A(e[e.length-1],t):null),pure:!1,arity:{},docs:{category:"misc",returns:{type:"any"},args:{values:{type:"any",rest:!0}},variants:[{argumentNames:["values"]}],description:"It logs the $values and then returns the last argument. If called with no arguments `null` is returned.",examples:['write!("A string")','write!(100, "items")','write!(object("a", 10))','write!(["a", "b", "c"])','write!(#"^start")',"write!(null, true, false)"],hideOperatorForm:!0}},boolean:{evaluate:([e])=>!!e,arity:K(1),docs:{category:"misc",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Coerces $x to boolean.",seeAlso:["not","boolean?","true?","false?"],examples:["boolean(0)","boolean(1)","boolean(null)",'boolean("Albert")']}},compare:{evaluate:([e,t],n)=>(_(e,n),_(t,n),H(e,t,n)),arity:K(2),docs:{category:"misc",returns:{type:"number"},args:{a:{type:["number","string"]},b:{type:["number","string"]}},variants:[{argumentNames:["a","b"]}],description:"Compares two values. Returns `-1` if $a < $b, `1` if $a > $b and `0` if $a and $b have the same sort order.",seeAlso:["<",">","<=",">=","sort","sequence.sort-by"],examples:["compare(0, 1)","compare(0, 0)","compare(1, 0)",'compare("Albert", "Mojir")']}},"json-parse":{evaluate:([e],t)=>(M(e,t),JSON.parse(e)),arity:K(1),docs:{category:"misc",returns:{type:"any"},args:{x:{type:"string"}},variants:[{argumentNames:["x"]}],description:"Returns `JSON.parse(`$x`)`.",seeAlso:["json-stringify"],examples:['json-parse("[1, 2, 3]")']}},"json-stringify":{evaluate:([e,t],n)=>($(e,n),void 0===t?JSON.stringify(e):(z(t,n),JSON.stringify(e,null,t))),arity:{min:1,max:2},docs:{category:"misc",returns:{type:"string"},args:{x:{type:"any"},indent:{type:"integer",description:"Number of spaces to use for indentation."}},variants:[{argumentNames:["x"]},{argumentNames:["x","indent"]}],description:"Returns `JSON.stringify(`$x`)`. If second argument is provided, returns `JSON.stringify(`$x`, null, `$indent`)`.",seeAlso:["json-parse"],examples:["json-stringify([1, 2, 3])","json-stringify({ a: { b: 10 }}, 2)"],hideOperatorForm:!0}}},Fe={keys:{evaluate:([e],t)=>(j(e,t),Object.keys(e)),arity:K(1),docs:{category:"object",returns:{type:"any",array:!0},args:{obj:{type:"object"}},variants:[{argumentNames:["obj"]}],description:"Returns array of all keys in $obj.",seeAlso:["vals","entries","zipmap","select-keys"],examples:["keys({})",'keys({ x: 10, y: true, z: "A string" })','keys(object("x", 10, "y", true, "z", "A string"))']}},vals:{evaluate:([e],t)=>(j(e,t),Object.values(e)),arity:K(1),docs:{category:"object",returns:{type:"any",array:!0},args:{obj:{type:"object"}},variants:[{argumentNames:["obj"]}],description:"Returns array of all values in $obj.",seeAlso:["keys","entries","zipmap"],examples:["vals({})",'vals({ x: 10, y: true, z: "A string" })','vals(object("x", 10, "y", true, "z", "A string"))']}},entries:{evaluate:([e],t)=>(j(e,t),Object.entries(e)),arity:K(1),docs:{category:"object",returns:{type:"array"},args:{obj:{type:"object"}},variants:[{argumentNames:["obj"]}],description:"Returns nested array of all key - value pairs in $obj.",seeAlso:["keys","vals","zipmap","find"],examples:["entries({})",'entries({ x: 10, y: true, z: "A string" })','entries(object("x", 10, "y", true, "z", "A string"))']}},find:{evaluate:([e,t],n)=>(j(e,n),M(t,n),X(e,t)?[t,e[t]]:null),arity:K(2),docs:{category:"object",returns:{type:["array","null"]},args:{a:{type:"object"},b:{type:"string"},obj:{type:"object"},key:{type:"string"}},variants:[{argumentNames:["obj","key"]}],description:"Returns entry (key-value pair) for $key, or `null` if $key not present in $obj.",seeAlso:["get","contains?","entries","sequence.position","some"],examples:['{ a: 1, "b": 2 } find "a"','find(object("a", 1, "b", 2), "b")','find(object("a", 1, "b", 2), "c")']}},dissoc:{evaluate:([e,t],n)=>{j(e,n),M(t,n);const r={...e};return delete r[t],r},arity:K(2),docs:{category:"object",returns:{type:"object"},args:{a:{type:"object"},b:{type:"string"},obj:{type:"object"},key:{type:"string"}},variants:[{argumentNames:["obj","key"]}],description:"Return shallow copy of $obj with $key deleted.",seeAlso:["assoc","select-keys"],examples:['{ x: 10, y: 20 } dissoc "y"','dissoc({ x: 10, y: 20 }, "x")','dissoc({ x: 10 }, "y")','\nlet o = { a: 5 };\ndissoc(o, "a");\no']}},merge:{evaluate:(e,t)=>{if(0===e.length)return null;const[n,...r]=e;return j(n,t),r.reduce((e,n)=>(j(n,t),{...e,...n}),{...n})},arity:{min:0},docs:{category:"object",returns:{type:"object"},args:{a:{type:"object"},b:{type:"object"},objs:{type:"object",rest:!0}},variants:[{argumentNames:["objs"]}],description:"Returns a new object created by merging together all arguments.\n\nIf two keys appears in more than one object the value from the last object is used.\nIf no arguments are provided `null` is returned.",seeAlso:["merge-with","assoc"],examples:["{ x: 10 } merge { y: 20 }",'merge(object("x", 10), object("y", 20))','merge(object("x", 10), object("x", 15, "y", 20))']}},"merge-with":{evaluate:(e,t,n,{executeFunction:r})=>{const s=e[0],a=e.at(-1),o=e.slice(1,-1);return j(s,t),O(a,t),le(o,(e,s)=>{j(s,t);return ie(le(Object.entries(s),(e,s)=>{const o=V(s[0],t),i=Q(s[1]);return X(e,o)?ie(r(a,[e[o],i],n,t),t=>(e[o]=t,e)):(e[o]=i,e)},e),e=>e)},{...s})},arity:{min:2},docs:{category:"object",returns:{type:"object"},args:{objs:{type:"object",rest:!0},fun:{type:"function"}},variants:[{argumentNames:["objs","fun"]}],description:"\nReturns a new object created by merging together all arguments.\nIf two keys appears in more than one object $fun is used to calculate the new value.\n\nIf no arguments are provided `null` is returned.",seeAlso:["merge"],examples:['merge-with(object("x", 10), object("y", 20), +)','merge-with(object("x", 10), object("x", 15, "y", 20), +)',"merge-with({ x: 10 }, { x: 20 }, { x: 30 }, { x: 40 }, -)"],hideOperatorForm:!0}},zipmap:{evaluate:([e,t],n)=>{ae(e,n),se(t,n);const r=Math.min(e.length,t.length),s={};for(let a=0;a<r;a+=1){s[V(e[a],n)]=Q(t[a])}return s},arity:K(2),docs:{category:"object",returns:{type:"object"},args:{a:{type:"array"},b:{type:"array"}},variants:[{argumentNames:["a","b"]}],description:"Returns a new object created by mapping $a to $b.",seeAlso:["entries","keys","vals","sequence.interleave"],examples:['["a", "b", "c"] zipmap [1, 2, 3]','zipmap(["a", "b", "c"], [10, null, [1, 2, 3]])','zipmap(["a", "b", "c"], [1])',"zipmap([], [10, null, [1, 2, 3]])"]}},"select-keys":{evaluate:([e,t],n)=>(ae(t,n),j(e,n),t.reduce((t,n)=>(X(e,n)&&(t[n]=Q(e[n])),t),{})),arity:K(2),docs:{category:"object",returns:{type:"object"},args:{a:{type:"object"},b:{type:"array"}},variants:[{argumentNames:["a","b"]}],description:"Returns an object containing only those entries in $a whose key is in $b.",seeAlso:["dissoc","keys"],examples:['{ a: 1, b: 2, c: 3 } select-keys ["a", "b"]','select-keys({ a: 1, b: 2, c: 3 }, ["a", "b"])','select-keys({ a: 1 }, ["a", "b"])']}}},Be={"function?":{evaluate:([e])=>w(e),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is a function, otherwise `false`.",seeAlso:["string?","number?","boolean?","null?","array?","object?","regexp?"],examples:["function?(+)","function?(/)","function?((x, y) -> x + y)","function?(false)",'function?("false")',"function?([1, 2, 3])"]}},"string?":{evaluate:([e])=>"string"==typeof e,arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is a string, otherwise `false`.",seeAlso:["blank?","number?","boolean?","null?","array?","object?","regexp?","function?","collection?","sequence?"],examples:['string?("")','string?("A string")','string?(true ? "A string" : false)',"string?(false)","string?([1, 2, 3])","string?(100)"]}},"number?":{evaluate:([e])=>"number"==typeof e,arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is a number, otherwise `false`.",seeAlso:["integer?","zero?","pos?","neg?","finite?","number","string?","boolean?","null?","function?"],examples:["number?(0)","number?(2)","number?(-0.12)","number?(false)","number?([1, 2, 3])",'number?("A string")']}},"integer?":{evaluate:([e])=>"number"==typeof e&&D(e,{integer:!0}),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is an integer, otherwise `false`.",seeAlso:["number?","number","even?","odd?"],examples:["integer?(0)","integer?(-12)","integer?(42)","integer?(10.1)","integer?((x, y) -> x + y)","integer?(false)",'integer?("false")',"integer?([1, 2, 3])"]}},"boolean?":{evaluate:([e])=>"boolean"==typeof e,arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is a `boolean`, otherwise `false`.",seeAlso:["true?","false?","boolean","string?","number?","null?","function?"],examples:["boolean?(true)","boolean?(false)","boolean?([1, 2, 3])","boolean?(0)",'boolean?("A string")']}},"null?":{evaluate:([e])=>null==e,arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is `null`, otherwise `false`.",seeAlso:["empty?","not-empty?","string?","number?","boolean?","function?"],examples:["null?(null)","null?(false)","null?([1, 2, 3])","null?(0)",'null?("A string")']}},"zero?":{evaluate:([e],t)=>(z(e,t,{finite:!0}),Math.abs(e)<ne),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"number"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is `0`, otherwise `false`.",seeAlso:["pos?","neg?","even?","number?"],examples:["zero?(0)","zero?(-0.0)","zero?(1)","zero?(0.1)"]}},"pos?":{evaluate:([e],t)=>(z(e,t,{finite:!0}),e>0),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"number"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is greater than `0`, otherwise `false`.",seeAlso:["neg?","zero?","number?"],examples:["pos?(0)","pos?(-0.0)","pos?(1)","pos?(-0.1)"]}},"neg?":{evaluate:([e],t)=>(z(e,t,{finite:!0}),e<0),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"number"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is less than `0`, otherwise `false`.",seeAlso:["pos?","zero?","number?"],examples:["neg?(0)","neg?(-0.0)","neg?(1)","neg?(-0.1)"]}},"even?":{evaluate:([e],t)=>(z(e,t,{finite:!0}),e%2==0),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"number"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is even, otherwise `false`.",seeAlso:["odd?","integer?","zero?"],examples:["even?(0)","even?(-0.0)","even?(-1)","even?(2.1)"]}},"odd?":{evaluate:([e],t)=>(z(e,t,{finite:!0}),D(e,{integer:!0})&&e%2!=0),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"number"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is odd, otherwise `false`.",seeAlso:["even?","integer?"],examples:["odd?(1.0)","odd?(1.001)","odd?(-1)","odd?(2.1)"]}},"array?":{evaluate:([e])=>Array.isArray(e),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is an array, otherwise `false`.",seeAlso:["sequence?","collection?","object?","string?","vector?","matrix?","grid?","function?"],examples:["array?([])","array?([1, 2, 3])",'array?(object("a", 10))',"array?(42)","array?(10.1)","array?((x, y) -> x + y)"]}},"collection?":{evaluate:([e])=>q(e),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is a collection i.e. an array, an object or a string, otherwise `false`.",seeAlso:["sequence?","array?","object?","string?"],examples:["collection?([])","collection?([1, 2, 3])",'collection?(object("a", 10))','collection?("Albert")',"collection?(42)","collection?(10.1)","collection?((x, y) -> x + y)"]}},"sequence?":{evaluate:([e])=>E(e),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is a sequence i.e. an array or a string, otherwise `false`.",seeAlso:["collection?","array?","string?"],examples:["sequence?([])","sequence?([1, 2, 3])",'sequence?(object("a", 10))','sequence?("Albert")',"sequence?(42)","sequence?(10.1)","sequence?((x, y) -> x + y)"]}},"object?":{evaluate:([e])=>S(e),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is an object, otherwise `false`.",seeAlso:["collection?","array?","string?","function?"],examples:['object?(object("a", 10))',"object?(42)","object?(10.1)","object?((x, y) -> x + y)",'object?(#"^start")','object?("false")',"object?([1, 2, 3])"]}},"regexp?":{evaluate:([e])=>C(e),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is a regexp, otherwise `false`.",seeAlso:["regexp","re-match","string?","function?"],examples:['regexp?(regexp("^start"))','regexp?(#"^start")',"regexp?(-12)","regexp?({})","regexp?(10.1)","regexp?((x, y) -> x + y)","regexp?(false)",'regexp?("false")',"regexp?([1, 2, 3])"]}},"finite?":{evaluate:([e],t)=>(z(e,t),Number.isFinite(e)),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"number"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is finite, otherwise `false`.",seeAlso:["positive-infinity?","negative-infinity?","number?"],examples:["finite?(1.0)","finite?(1 / 0)","finite?(-1 / 0)"]}},"positive-infinity?":{evaluate:([e],t)=>(z(e,t),e===Number.POSITIVE_INFINITY),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"number"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x equals positive infinity, otherwise `false`.",seeAlso:["negative-infinity?","finite?"],examples:["positive-infinity?(1.0)","positive-infinity?(1 / 0)","positive-infinity?(-1 / 0)"]}},"negative-infinity?":{evaluate:([e],t)=>(z(e,t),e===Number.NEGATIVE_INFINITY),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"number"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x equals negative infinity, otherwise `false`.",seeAlso:["positive-infinity?","finite?"],examples:["negative-infinity?(1.0)","negative-infinity?(1 / 0)","negative-infinity?(-1 / 0)"]}},"true?":{evaluate:([e])=>!0===e,arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is `true`, otherwise `false`.",seeAlso:["false?","boolean?","boolean"],examples:["true?(false)","true?(true)","true?(1)","true?(0)"]}},"false?":{evaluate:([e])=>!1===e,arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is `true`, otherwise `false`.",seeAlso:["true?","boolean?","boolean"],examples:["false?(false)","false?(true)","false?(1)","false?(0)"]}},"empty?":{evaluate:([e],t)=>null===e||(I(e,t),"string"==typeof e||Array.isArray(e)?0===e.length:0===Object.keys(e).length),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:["collection","string","null"]}},variants:[{argumentNames:["x"]}],description:"Returns `true` if $x is empty or `null`, otherwise `false`.",seeAlso:["not-empty?","collection.not-empty","null?","blank?","count"],examples:["empty?([])","empty?([1, 2, 3])","empty?({})","empty?({ a: 2 })",'empty?("")','empty?("Albert")',"empty?(null)"]}},"not-empty?":{evaluate:([e],t)=>null!==e&&(I(e,t),"string"==typeof e||Array.isArray(e)?e.length>0:Object.keys(e).length>0),arity:K(1),docs:{category:"predicate",returns:{type:"boolean"},args:{x:{type:["collection","string","null"]}},variants:[{argumentNames:["x"]}],description:"Returns `false` if $x is empty or `null`, otherwise `true`.",seeAlso:["empty?","collection.not-empty","null?"],examples:["not-empty?([])","not-empty?([1, 2, 3])","not-empty?({})","not-empty?({ a: 2 })",'not-empty?("")','not-empty?("Albert")',"not-empty?(null)"]}},"vector?":{evaluate:([e])=>Se(e),arity:K(1),docs:{category:"predicate",description:"Checks if a value is a `vector`. A `vector` is an array of `numbers`.",seeAlso:["matrix?","grid?","array?"],returns:{type:"boolean"},args:{value:{type:"any",description:"The value to check."}},variants:[{argumentNames:["value"]}],examples:["vector?(1)","vector?([1, 2, 3])",'vector?([1, 2, "3"])']}},"matrix?":{evaluate:([e])=>Ce(e),arity:K(1),docs:{category:"predicate",description:"Checks if a value is a `matrix`. A `matrix` is an array of arrays of `numbers`.",seeAlso:["vector?","grid?","array?"],returns:{type:"boolean"},args:{value:{type:"any",description:"The value to check."}},variants:[{argumentNames:["value"]}],examples:["matrix?(1)","matrix?([1, 2, 3])","matrix?([[1, 2], [3, 4]])",'matrix?([[1, 2], [3, "4"]])',"matrix?([[1, 2], [3]])"]}},"grid?":{evaluate:([e])=>Ie(e),arity:K(1),docs:{category:"predicate",description:"Checks if a `value` is a `grid`. A `grid` is an `array` of `arrays` where all inner `arrays` have the same length.",seeAlso:["vector?","matrix?","array?"],returns:{type:"boolean"},args:{value:{type:"any",description:"The value to check."}},variants:[{argumentNames:["value"]}],examples:['grid?("1")','grid?(["1", 2, 3])','grid?([["1", 2], [3, 4]])','grid?([["1", 2], [3, "4"]])','grid?([["1", 2], [3]])']}}},_e={regexp:{evaluate:([e,t],r)=>{M(e,r);const s=e||"(?:)",a="string"==typeof t?t:"";try{new RegExp(s,a)}catch(e){throw new n(`Invalid regular expression: ${s} ${a}`,r)}return{[p]:!0,sourceCodeInfo:r,s:s,f:a}},arity:{min:1,max:2},docs:{category:"regular-expression",returns:{type:"regexp"},args:{pattern:{type:"string"},flags:{type:"string",description:"Optional flags for the regular expression. Possible values are the same as Javascript RegExp takes."}},variants:[{argumentNames:["pattern"]},{argumentNames:["pattern","flags"]}],description:"Creates a RegExp from $pattern and $flags.",examples:['regexp("^\\s*(.*)$")','#"^\\s*(.*)$"','regexp("albert", "ig")','#"albert"ig'],seeAlso:["-short-regexp","re-match","replace","replace-all","regexp?"],hideOperatorForm:!0}},"re-match":{evaluate:([e,t],n)=>{if(function(e,t){if(!C(e))throw h("RegularExpression",e,t)}(t,n),!U(e))return null;const r=new RegExp(t.s,t.f).exec(e);return r?[...r]:null},arity:K(2),docs:{category:"regular-expression",returns:{type:"any",array:!0},args:{a:{type:"regexp"},b:{type:"string"}},variants:[{argumentNames:["a","b"]}],description:"Matches $b against regular expression $a.\nIf $b is a string and matches the regular expression, a `re-match`-array is returned, otherwise `null` is returned.",seeAlso:["regexp","replace","replace-all","-short-regexp","regexp?"],examples:['re-match("  A string", regexp("^\\\\s*(.*)$"))','re-match("  A string", #"^\\s*(.*)$")','re-match("My name is Albert", #"albert"i)','re-match("My name is Ben", #"albert"i)','re-match(null, #"albert"i)','re-match(1, #"albert"i)','re-match({}, #"albert"i)']}},replace:{evaluate:([e,t,n],r)=>{M(e,r),P(t,r),M(n,r);const s=C(t)?new RegExp(t.s,`${t.f}`):t;return e.replace(s,n)},arity:K(3),docs:{category:"regular-expression",returns:{type:"any",array:!0},args:{a:{type:"string"},b:{type:["regexp","string"]},x:{type:"string"}},variants:[{argumentNames:["a","b","x"]}],description:"Returns a new string with first match of regular expression $b replaced by $x.",seeAlso:["replace-all","regexp","re-match","-short-regexp"],examples:['replace("Duck duck", "u", "i")','replace("Duck duck", #"u", "i")','replace("abcABC", regexp("a", "i"), "-")','replace("abcABC", regexp("a", "gi"), "-")','replace("abcABC", #"a"i, "-")','replace("abcABC", #"a"gi, "-")']}},"replace-all":{evaluate:([e,t,n],r)=>{M(e,r),P(t,r),M(n,r);const s=C(t)?new RegExp(t.s,`${t.f.includes("g")?t.f:`${t.f}g`}`):t;return e.replaceAll(s,n)},arity:K(3),docs:{category:"regular-expression",returns:{type:"any",array:!0},args:{a:{type:"string"},b:{type:["regexp","string"]},x:{type:"string"}},variants:[{argumentNames:["a","b","x"]}],description:"Returns a new string with all matches of regular expression $b replaced by $x.",seeAlso:["replace","regexp","re-match","-short-regexp"],examples:['replace-all("Duck duck", "u", "i")','replace-all("Duck duck", regexp("u"), "i")','replace-all("abcABC", regexp("a", "i"), "-")','replace-all("abcABC", regexp("a", "gi"), "-")','replace-all("abcABC", #"a"i, "-")','replace-all("abcABC", #"a"gi, "-")']}}},Le=/^\s*$/,De={str:{evaluate:e=>e.reduce((e,t)=>e+(null==t?"":S(t)||Array.isArray(t)?JSON.stringify(t):`${t}`),""),arity:{},docs:{category:"string",returns:{type:"string"},args:{values:{type:"any",rest:!0}},variants:[{argumentNames:["values"]}],description:"Concatenats $values into one string. If `value` equals `null` empty string is returned.",seeAlso:["++","join","string.template","string.string-repeat","number"],examples:['str("A string", ", and another string", " ...and more")','str("Just one string")',"str()",'str(0, false, true, null, #"^kalle", [1, 2, 3], {a: "a"})'],hideOperatorForm:!0}},number:{evaluate:([e],t)=>{M(e,t);const r=Number(e);if(Number.isNaN(r))throw new n(`Could not convert '${e}' to a number.`,t);return r},arity:K(1),docs:{category:"string",returns:{type:"number"},args:{s:{type:"string"}},variants:[{argumentNames:["s"]}],description:"Parses $s to a number.",seeAlso:["str","number?","integer?"],examples:['number("10")','number("010")','number("-1.01")']}},"lower-case":{evaluate:([e],t)=>(M(e,t),e.toLowerCase()),arity:K(1),docs:{category:"string",returns:{type:"string"},args:{s:{type:"string"}},variants:[{argumentNames:["s"]}],description:"Returns $s converted to lower case.",seeAlso:["upper-case","string.capitalize"],examples:['lower-case("Albert")','lower-case("")']}},"upper-case":{evaluate:([e],t)=>(M(e,t),e.toUpperCase()),arity:K(1),docs:{category:"string",returns:{type:"string"},args:{s:{type:"string"}},variants:[{argumentNames:["s"]}],description:"Returns $s converted to upper case.",seeAlso:["lower-case","string.capitalize"],examples:['upper-case("Albert")','upper-case("")']}},trim:{evaluate:([e],t)=>(M(e,t),e.trim()),arity:K(1),docs:{category:"string",returns:{type:"string"},args:{s:{type:"string"}},variants:[{argumentNames:["s"]}],description:"Returns a new string with leading and trailing whitespaces removed.",seeAlso:["string.trim-left","string.trim-right","blank?"],examples:['trim("  Albert  ")','trim("   ")','trim("")']}},join:{evaluate:([e,t],n)=>(se(e,n),e.forEach(e=>_(e,n)),M(t,n),e.join(t)),arity:K(2),docs:{category:"string",returns:{type:"string"},args:{a:{type:"array"},b:{type:"string"},arr:{type:"array"},delimiter:{type:"string"}},variants:[{argumentNames:["arr","delimiter"]}],description:"Returns a new string by concatenating all of the elements in $arr, separated by $delimiter.",seeAlso:["split","str","++","sequence.interpose"],examples:['map([0, 1, 2, 3, 4, 5, 6, 7, 8, 9], str) join ", "','([0, 1, 2, 3, 4, 5, 6, 7, 8, 9] map str) join ", "','join(["Albert", 10], ", ")','join(["Albert", "Mojir"], " ")','join(map([0, 1, 2, 3, 4, 5, 6, 7, 8, 9], str), ", ")']}},split:{evaluate:([e,t,n],r)=>{M(e,r),P(t,r),void 0!==n&&z(n,r,{integer:!0,nonNegative:!0});const s="string"==typeof t?t:new RegExp(t.s,t.f);return e.split(s,n)},arity:{min:2,max:3},docs:{category:"string",returns:{type:"string"},args:{a:{type:"string"},b:{type:"string"},s:{type:"string"},delimiter:{type:"string"},limit:{type:"integer"}},variants:[{argumentNames:["s","delimiter"]},{argumentNames:["s","delimiter","limit"]}],description:"Divides $s into an array of substrings. The division is done by searching for `delimiter`. If `limit` as provided, at most `limit` number of substrings are returned.",seeAlso:["join","string.split-lines"],examples:['"Albert Mojir" split " "','split("Albert Mojir", " ")','split("abcdefghijklmnopqrstuvw", #"[aoueiy]")','split("0123456789", "")','split("0123456789", "", 5) map number']}},"blank?":{evaluate:([e],t)=>null===e||(M(e,t),Le.test(e)),arity:K(1),docs:{category:"string",returns:{type:"boolean"},args:{s:{type:["string","null"]}},variants:[{argumentNames:["s"]}],description:"Returns true if $s is null or only contains whitespace characters.",seeAlso:["trim","empty?","string?"],examples:['blank?("")',"blank?(null)",'blank?("\n")','blank?(" ")','blank?(".")']}}},ze={"|>":{evaluate:([e,t],n,r,{executeFunction:s})=>(O(t,n),s(t,[e],r,n)),arity:K(2),docs:{category:"functional",returns:{type:"any"},args:{a:{type:"any"},b:{type:"function"}},variants:[{argumentNames:["a","b"]}],description:"Takes a value $a and a function $b, and returns the result of applying $b to $a.",seeAlso:["apply","comp"],examples:["\n1 |> inc |> inc","range(10)\n  |> map(_, -> $ ^ 2) // [0, 1, 4, 9, 16, 25, 36, 49, 64, 81]\n  |> filter(_, odd?)  // [1, 9, 25, 49, 81]\n  |> reduce(_, +, 0)  // 165\n  |> sqrt             // 12.84523257866513\n  |> round(_, 2)"]}},apply:{evaluate:([e,...t],n,r,{executeFunction:s})=>{O(e,n);const a=t[t.length-1];se(a,n);return s(e,[...t.slice(0,-1),...a],r,n)},arity:{min:2},docs:{category:"functional",returns:{type:"any"},args:{a:{type:"function"},b:{type:"array"},fun:{type:"function"},args:{type:"array"}},variants:[{argumentNames:["fun","args"]}],description:"Call supplied function $fun with specified arguments $args.",seeAlso:["|>"],examples:["\napply(+, [1, 2, 3])","\napply(\n  (x, y) -> sqrt(x ^ 2 + y ^ 2),\n  [3, 4]\n)","\n(x, y) -> sqrt(x ^ 2 + y ^ 2) apply [3, 4]"]}},identity:{evaluate:([e])=>Q(e),arity:K(1),docs:{category:"functional",returns:{type:"any"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns $x.",seeAlso:["constantly","functional.fnull"],examples:["identity(1)",'identity("Albert")',"identity({ a: 1 })","identity(null)"]}},comp:{evaluate:(e,t)=>{return e.forEach(e=>O(e,t)),{[l]:!0,sourceCodeInfo:t,functionType:"Comp",params:e,arity:e.length>0?(n=e.at(-1),"number"==typeof n||q(n)?K(1):n.arity):{min:1,max:1}};var n},arity:{},docs:{category:"functional",returns:{type:"function"},args:{a:{type:"function"},b:{type:"function"},fns:{type:"function",rest:!0}},variants:[{argumentNames:["fns"]}],description:"Takes a variable number of functions and returns a function that is the composition of those.\n\n  The returned function takes a variable number of arguments,\n  applies the rightmost function to the args,\n  the next function (right-to-left) to the result, etc.",seeAlso:["|>","functional.juxt","functional.complement"],examples:["\nlet negative-quotient = comp(-, /);\nnegative-quotient(9, 3)",'\nlet x = { bar: { foo: 42 } };\ncomp("foo", "bar")(x)']}},constantly:{evaluate:([e],t)=>({[l]:!0,sourceCodeInfo:t,functionType:"Constantly",value:Q(e),arity:{}}),arity:K(1),docs:{category:"functional",returns:{type:"function"},args:{x:{type:"any"}},variants:[{argumentNames:["x"]}],description:"Returns a function that takes any number of arguments and always returns $x.",seeAlso:["identity","functional.fnull"],examples:["\nlet always-true = constantly(true);\nalways-true(9, 3)"]}}};function We(e){return re(`\n    ${e.title}\n\n    ${e.description.replace(/`(.+?)`/g,"$1").replace(/\$(\w+)/g,"$1").replace(/\*\*\*(.+)\*\*\*/g,"$1").replace(/\*\*(.+)\*\*/g,"$1")}\n\n    Signature:\n    ${function({title:e,variants:t,args:n,returns:r,_isOperator:s}){const a=t.map(t=>`${`  ${e}(${t.argumentNames.map(e=>{let t="";return n[e].rest&&(t+="..."),t+=e,t}).join(", ")})`} -> ${Je(r)}`),o=s?["","Operator:",`  a ${e} b -> ${Je(r)}`]:[];return[...a,...o]}(e).join("\n    ")}\n\n    Arguments:\n      ${function(e){return Object.entries(e.args).map(([e,t])=>`${e}: ${Je(t)}`)}(e).join("\n      ")}\n\n    Examples:\n${e.examples.map(e=>re(e,4)).join("\n\n")}`)}function Je(e){const t=e.type,n=(Array.isArray(t)?t:[t]).join(" | ");return e.array||e.rest?`Array<${n}>`:n}const Ke={sum:{evaluate:([e],t)=>(je(e,t),e.reduce((e,t)=>e+t,0)),arity:K(1),docs:{category:"vector",returns:{type:"number"},args:{vector:{type:"vector",description:"The vector to sum."}},variants:[{argumentNames:["vector"]}],description:"Returns the **sum** of all elements in the `vector`. Returns `0` for an empty vector.",seeAlso:["prod","mean","median","vector.moving-sum","vector.centered-moving-sum","vector.running-sum","vector.cumsum"],examples:["sum([1, 2, 3, 4, 5])","sum([1, -2, 3])","sum([])"]}},prod:{evaluate:([e],t)=>(je(e,t),e.reduce((e,t)=>e*t,1)),arity:K(1),docs:{category:"vector",returns:{type:"number"},args:{vector:{type:"vector",description:"The vector to multiply."}},variants:[{argumentNames:["vector"]}],description:"Returns the **product** of all elements in the `vector`. Returns `1` for an empty vector.",seeAlso:["sum","mean","median","vector.moving-prod","vector.centered-moving-prod","vector.running-prod","vector.cumprod"],examples:["prod([1, 2, 3, 4, 5])","prod([1, -2, 3])","prod([])"]}},mean:{evaluate:([e],t)=>(qe(e,t),e.reduce((e,t)=>e+t,0)/e.length),arity:K(1),docs:{category:"vector",returns:{type:"number"},args:{vector:{type:"vector",description:"The vector to calculate the mean of."}},variants:[{argumentNames:["vector"]}],description:"Returns the arithmetic **mean** of all elements in the `vector`. Throws for an empty vector.",seeAlso:["median","sum","prod","vector.moving-mean","vector.centered-moving-mean","vector.running-mean","vector.geometric-mean","vector.harmonic-mean","vector.rms","vector.mode"],examples:["mean([1, 2, 3, 4, 5])","mean([1, -2, 3])"]}},median:{evaluate:([e],t)=>(qe(e,t),function(e){const t=[...e].sort((e,t)=>e-t),n=Math.floor(t.length/2);return t.length%2==0?(t[n-1]+t[n])/2:t[n]}(e)),arity:K(1),docs:{category:"vector",returns:{type:"number"},args:{vector:{type:"vector",description:"The vector to calculate the median of."}},variants:[{argumentNames:["vector"]}],description:"Returns the **median** of all elements in the `vector`. For even-length vectors, returns the average of the two middle values. Throws for an empty vector.",seeAlso:["mean","sum","prod","vector.moving-median","vector.centered-moving-median","vector.running-median","vector.mode","vector.quartiles","vector.percentile","vector.iqr","vector.medad"],examples:["median([1, 2, 3, 4, 5])","median([1, 2, 3, 4])","median([3, 1, 4, 1, 5])"]}}},Ye={...L,...G,...ge,...he,...ve,...Ue,...function(e){return{doc:{evaluate:([t],n)=>{if(b(e),O(t,n),!w(t))return"";if("Builtin"===t.functionType){const n=e[t.name];return n?We(n):""}return"UserDefined"===t.functionType||"NativeJsFunction"===t.functionType?t.docString:""},arity:K(1),docs:{category:"meta",returns:{type:"string"},args:{fun:{type:"function"}},variants:[{argumentNames:["fun"]}],description:"Returns documentation string of the $fun.",seeAlso:["arity"],examples:["doc(+)",'\nlet add = (x, y) -> do\n  """\n  Adds two numbers.\n  Args:\n    x: First number.\n    y: Second number.\n  Returns:\n    Sum of x and y.\n  """;\n  x + y;\nend;\n\ndoc(add)']}},arity:{evaluate:([e],t)=>(O(e,t),w(e)?e.arity:K(1)),arity:K(1),docs:{category:"meta",returns:{type:"object"},args:{fun:{type:"function"}},variants:[{argumentNames:["fun"]}],description:"Returns arity of the $fun. The arity is an object with the properties: `min` and `max`. If the function has fixed arity, `min` and `max` are equal to the number of required parameters. If no restrictions apply, empty object is returned.",seeAlso:["doc"],examples:["arity(+)","arity(defined?)","\nlet add = (x, y = 0) -> do\n  x + y;\nend;\n\narity(add)","\nlet foo = (k, ...x) -> do\n  k + x;\nend;\n  arity(foo)"]}}}}({}),...Ve,...Fe,...Be,..._e,...De,...ze,...Ke};Object.entries(Ye).forEach(([e,t])=>{t.name=e});const Ge={...Ye},Xe={},He=[];Object.entries(Ge).forEach(([e,t],n)=>{Xe[e]=n,He.push(t)});const Ze={arity:{},docs:{category:"special-expression",returns:{type:"any"},args:{a:{type:"any"},b:{type:"any"},c:{type:"any",rest:!0}},variants:[{argumentNames:["a","b"]},{argumentNames:["a","b","c"]}],description:"\nComputes logical `and`. Evaluation of expressions starts from left.\nAs soon as an `expression` evaluates to a falsy value, the result is returned.\n\nIf all expressions evaluate to truthy values, the value of the last expression is returned.",examples:["true && 1","&&(1, 1)",'&&(3 > 2, "string")','&&(3 < 2, "string")',"&&(true, true, true, true)","&&(true, true, 0, true)"]},evaluateAsNormalExpression:(e,t)=>{let n=!0;for(const r of e)if(n=A(r,t),!n)break;return n},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n(e[1][1],t,r,s)},Qe={arity:{},docs:{category:"special-expression",customVariants:["cond cond-branch cond-branch ... end"],details:[["cond-branch","case test then body","A branch of the cond expression."],["test","expression","The condition to test."],["body","expressions","The expressions to evaluate if the test is truthy."]],description:"Used for branching. `cond-branches` are tested sequentially from the top. If no branch is tested truthy, `null` is returned.",examples:['\ncond\n  case false then write!("FALSE")\n  case true then write!("TRUE")\nend','\ncond\n  case false then write!("FALSE")\n  case null then write!("null")\nend ?? write!("TRUE")','\ncond\n  case false then write!("FALSE")\n  case null then write!("null")\nend ?? write!("TRUE")']},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n(e[1][1].flat(),t,r,s)},et=11,tt=12,nt=13,rt=14,st=15,at=16;function ot(e,t){if(e[0]===nt)Object.values(e[1][0]).forEach(e=>{e[1][1]&&t(e[1][1]),ot(e,t)});else if(e[0]===rt)for(let n=0;n<e[1][0].length;n+=1){const r=e[1][0][n]??null;null!==r&&(r[1][1]&&t(r[1][1]),ot(r,t))}}function it(e,t,n){const r=e[2],s={};return ie(ct(e,t,n,r,s),()=>s)}function ct(e,t,r,s,a){if(e[0]===nt){!function(e,t){if(!x(e))throw new n(`Expected UnknownRecord, got ${y(e)}.`,g(e,t))}(t,s);const o=new Set;let i;return ie(fe(Object.entries(e[1][0]),([e,n])=>{if(n[0]===tt)return void(i=n);o.add(e);const c=t[e];return ie(void 0!==c?c:n[1][1]?r(n[1][1]):null,e=>{const t=e??null;return $(t,s),ct(n,t,r,s,a)})}),()=>{if(i){const e=Object.entries(t).filter(([e])=>!o.has(e)).reduce((e,[t,n])=>(e[t]=A(n),e),{});a[i[1][0]]=e}})}if(e[0]===rt){let n=null;se(t,s);const o=[];for(let t=0;t<e[1][0].length;t+=1){const r=e[1][0][t]??null;if(null!==r){if(r[0]===tt){n=t;break}o.push({element:r,index:t})}}return ie(fe(o,({element:e,index:n})=>{const o=t[n];return ie(void 0!==o?o:e[1][1]?r(e[1][1]):null,t=>{const n=t??null;return $(n,s),ct(e,n,r,s,a)})}),()=>{if(null!==n){const r=t.slice(n),s=e[1][0][n];a[s[1][0]]=r}})}e[0]===tt?a[e[1][0]]=A(t):a[e[1][0][1]]=A(t)}function ut(e){const t={};return lt(e,t),t}function lt(e,t){if(null!==e)if(e[0]===rt)for(const n of e[1][0])lt(n,t);else if(e[0]===nt)for(const n of Object.values(e[1][0]))lt(n,t);else if(e[0]===tt){if(t[e[1][0]])throw new n(`Duplicate binding name: ${e[1][0]}`,e[2]);t[e[1][0]]=!0}else if(e[0]===et){if(t[e[1][0][1]])throw new n(`Duplicate binding name: ${e[1][0]}`,e[2]);t[e[1][0][1]]=!0}}function pt(e,t,n){const r={};return ie(ft(e,t,n,r),e=>e?r:null)}function ft(e,t,n,r){if(e[0]===at)return!0;if(e[0]===st){const r=e[1][0];return ie(n(r),e=>Z(t,e))}if(e[0]===et){const s=e[1][0],a=e[1][1];if(null==t){if(a)return ie(n(a),e=>(r[s[1]]=A(e),!0));r[s[1]]=t??null}else r[s[1]]=A(t);return!0}if(e[0]===nt){if(!x(t))return!1;const s=new Set;let a;const o=Object.entries(e[1][0]);let i=!0;for(const[e,c]of o)i=ie(i,o=>{if(!o)return!1;if(c[0]===tt)return a=c,!0;s.add(e);const i=t[e];if(void 0===i&&c[0]===st)return ie(n(c[1][0]),e=>Z(void 0,e));return ie(void 0!==i?i:c[1]&&c[1][1]?n(c[1][1]):null,e=>ft(c,e??null,n,r))});return ie(i,e=>{if(!e)return!1;if(a){const e=Object.entries(t).filter(([e])=>!s.has(e)).reduce((e,[t,n])=>(e[t]=A(n),e),{});r[a[1][0]]=e}return!0})}{const s=e;if(!Array.isArray(t))return!1;const a=s[1][0];let o=null;for(let e=0;e<a.length;e+=1){const t=a[e];if(null!==t&&t[0]===tt){o=e;break}}if(null===o&&t.length!==a.length)return!1;if(null!==o&&t.length<o)return!1;let i=!0;for(let e=0;e<a.length;e+=1){const s=a[e];if(null===s)continue;if(s[0]===tt){r[s[1][0]]=t.slice(e);break}const o=s;i=ie(i,s=>!!s&&ft(o,A(t[e]),n,r))}return i}}const dt={arity:{},docs:{category:"special-expression",customVariants:["match value match-branch match-branch ... end"],details:[["value","any","The value to match against patterns."],["match-branch","case pattern [when guard] then body","A branch of the match expression."],["pattern","pattern","A pattern to match: literal, variable, array destructuring, object destructuring, or wildcard (_)."],["guard","expression","An optional guard expression that must be truthy for the match to succeed."],["body","expressions","The expressions to evaluate if the pattern matches."]],description:"Pattern matching expression. Matches `value` against each `pattern` sequentially. If a pattern matches (and the optional `when` guard is truthy), the corresponding `body` is evaluated and its result returned. Bound variables from the pattern are available in the guard and body. If no pattern matches, `null` is returned.",examples:['\nmatch 1\n  case 1 then "One"\n  case 2 then "Two"\nend','\nmatch [1, 2, 3]\n  case [x] then "one element"\n  case [x, y] then "two elements"\n  case [x, ...xs] then "first: " ++ str(x) ++ " rest: " ++ str(xs)\nend','\nmatch { type: "click", x: 10, y: 20 }\n  case { type: "click", x, y } then "Click at " ++ str(x) ++ ", " ++ str(y)\n  case { type: "keydown", key } then "Key: " ++ key\n  case _ then "unknown event"\nend','\nmatch { role: "admin", name: "Alice" }\n  case { role: "admin", name } then "Admin: " ++ name\n  case { role, name } when role == "user" then "User: " ++ name\n  case _ then "Unknown role"\nend']},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>{const a=new Set;n([e[1][1]],t,r,s).forEach(e=>a.add(e));for(const[o,i,c]of e[1][2]){const e={};Object.assign(e,ut(o));const u=t.create(e);c&&n([c],u,r,s).forEach(e=>a.add(e)),n([i],u,r,s).forEach(e=>a.add(e))}return a}},mt={category:"special-expression",returns:{type:"boolean"},args:{symbol:{type:"any"}},variants:[{argumentNames:["symbol"]}],description:"Returns `true` if `symbol` is defined, `false` otherwise.\n\nBuilt-in symbols are always considered defined. For user-defined symbols, checks if the symbol exists in the current scope.",examples:["let x = 42; defined?(x)","defined?(x)","defined?(+)"]},yt={arity:K(1),docs:mt,getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n([e[1][1]],t,r,s)},gt={arity:{},docs:{category:"special-expression",customVariants:["do body end"],details:[["body","expressions","The expressions to evaluate."]],description:"Evaluates `body`. Resulting value is the value of the last expression.",examples:["\ndo\n  let a = 1 + 2 + 3 + 4;\n  let b = -> $ * ( $ + 1 );\n  b(a)\nend"]},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n(e[1][1],t.create({}),r,s)},ht={arity:{},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>function(e,t,n,r,s){const a=new Set,o={self:{value:null}};e[0].forEach(e=>{Object.assign(o,ut(e)),ot(e,e=>{te(a,n([e],t,r,s))})});const i=t.create(o),c=n(e[1],i,r,s);return te(a,c),a}(e[1][1],t,n,r,s)};const vt={arity:{min:2,max:3},docs:{category:"special-expression",customVariants:["if test then true-expr else false-expr","if test then true-expr"],details:[["test","expression","The condition to test."],["true-expr","expression","The expression to evaluate if the test is truthy."],["false-expr","expression","The expression to evaluate if the test is falsy."]],description:"Either `true-expr` or `false-expr` branch is taken. `true-expr` is selected when $test is truthy. If $test is falsy `false-expr` is executed, if no `false-expr` exists, `null` is returned.",examples:['\nif true then\n  write!("TRUE")\nelse\n  write!("FALSE")\nend','if false then write!("TRUE") else write!("FALSE") end','if true then write!("TRUE") end','if false then write!("TRUE") end']},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n(e[1][1].filter(e=>!!e),t,r,s)},bt={arity:{},docs:{category:"special-expression",customVariants:["unless test then true-expr else false-expr end","unless test true-expr end"],details:[["test","expression","The condition to test."],["true-expr","expression","The expressions to evaluate if the test is falsy."],["false-expr","expression","The expressions to evaluate if the test is truthy."]],description:"Either `true-expr` or `false-expr` branch is taken. `true-expr` is selected when $test is falsy. If $test is truthy `false-expr` is executed, if no `false-expr` exists, `null` is returned.",examples:['\nunless true then\n  write!("TRUE")\nelse\n  write!("FALSE")\nend','unless false then write!("TRUE") else write!("FALSE") end','unless true then write!("TRUE") end','unless false then write!("TRUE") end']},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n(e[1][1].filter(e=>!!e),t,r,s)},xt={category:"special-expression",customVariants:["let s = value;"],details:[["s","symbol","The name of the variable to bind."],["value","any","The value to bind to the variable."]],description:"\n  Binds local variables s to `value`. `value` can be any expression. The scope of the variables is the body of the let expression.",examples:['\nlet a = 1 + 2 + 3 + 4;\nlet b = -> $ * ( $ + 1 );\nwrite!("a", a, "b", b)']},wt={arity:K(0),docs:xt,getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>{const a=e[1][1],o=a[1][0],i=a[1][1],c=n([i],t,r,s);return ot(o,e=>{te(c,n([e],t,r,s))}),t.addValues(ut(o),o[2]),c}},kt={arity:{},docs:{category:"special-expression",customVariants:["loop (bindings) -> body"],details:[["bindings","binding pairs","Comma-separated bindings with initial values, e.g. `n = 10, acc = 0`."],["body","expression","The expression to evaluate repeatedly. Use `recur` to loop back with new values."]],description:"Creates a loop with initial bindings. Use `recur` inside the body to jump back to the loop head with new binding values.\n\nIf `recur` is not called, the loop terminates and returns the value of the body expression.",examples:["loop (n = 10, acc = 0) -> do\n  if n == 0 then\n    acc\n  else\n    recur(n - 1, acc + n)\n  end\nend","loop (n = 5, acc = 1) -> do\n  if n <= 1 then\n    acc\n  else\n    recur(n - 1, acc * n)\n  end\nend"]},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>{const a=e[1][1],o=a.reduce((e,t)=>{const n=ut(t[1][0]);return Object.keys(n).forEach(t=>{e[t]={value:!0}}),e},{});return ee(n(a.map(e=>e[1][1]),t,r,s),n([e[1][2]],t.create(o),r,s))}};function At(e,t,n,r,s){const a=new Set,o={},[,i,c]=e[1];return i.forEach(e=>{const[i,c,u,l]=e,[p,f]=i[1];n([f],t.create(o),r,s).forEach(e=>a.add(e)),Object.assign(o,ut(p)),c&&c.forEach(e=>{const[i,c]=e[1];n([c],t.create(o),r,s).forEach(e=>a.add(e)),Object.assign(o,ut(i))}),u&&n([u],t.create(o),r,s).forEach(e=>a.add(e)),l&&n([l],t.create(o),r,s).forEach(e=>a.add(e))}),n([c],t.create(o),r,s).forEach(e=>a.add(e)),a}const $t={category:"special-expression",customVariants:["for (...binding) -> body"],details:[["binding","loop-var in collection [...let-binding] [where whereExpr] [while whileExp]","A for loop binding"],["loop-var","symbol","The name of the loop variable."],["collection","any","The collection to iterate over."],["let-binding","let binding","A let binding to create a local variable."],["whereExpr","expression","An expression that must evaluate to truthy for the loop body to be executed."],["whileExp","expression","An expression that must evaluate to truthy for the loop to continue."],["body","expressions","The expressions to evaluate for each iteration of the loop."]],returns:{type:"any",array:!0},description:"Iterates over `bindings`, evaluates `body` for each `binding` and returns an `array` of results.",examples:["\nfor (i in [1, 2, 3]) -> i * 2\n      ","\nfor (\n  i in range(10) let ii = i ^ 2 while ii < 40 when ii % 3 == 0,\n  j in range(10) when j % 2 == 1\n) -> ii + j\n      "]},Et={arity:K(1),docs:$t,getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>At(e,t,n,r,s)},Nt={category:"special-expression",customVariants:["doseq (...binding) -> body"],details:[["binding","loop-var in collection [...let-binding] [where whereExpr] [while whileExp]","A doseq loop binding"],["loop-var","symbol","The name of the loop variable."],["collection","any","The collection to iterate over."],["let-binding","let binding","A let binding to create a local variable."],["whereExpr","expression","An expression that must evaluate to truthy for the loop body to be executed."],["whileExp","expression","An expression that must evaluate to truthy for the loop to continue."],["body","expressions","The expressions to evaluate for each iteration of the loop."]],returns:{type:"null"},description:"Iterates over `bindings`, evaluates `body` for each `binding` and returns `null`. This is useful for side effects.",examples:["\ndoseq (i in [1, 2, 3]) -> write!(i * 2)\n      "]},St={arity:K(1),docs:Nt,getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>At(e,t,n,r,s)},jt={arity:{},docs:{category:"special-expression",returns:{type:"boolean"},args:{a:{type:"any"},b:{type:"any"},c:{type:"any",rest:!0}},variants:[{argumentNames:["a","b"]},{argumentNames:["a","b","c"]}],description:"\n  Computes logical `or`. Evaluation of expressions evaluation starts from left.\n  As soon as a `expression` evaluates to a truthy value, the result is returned.\n\n  If all expressions evaluate to falsy values, the value of the last expression is returned.",examples:["false || 1","||(1, 1)",'||(3 > 2, "string")','||(3 < 2, "string")',"||(false, false, false, true)","||(1, 2, 3, 4)"]},evaluateAsNormalExpression:(e,t)=>{let n=!1;for(const r of e)if(n=A(r,t),n)break;return n},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n(e[1][1],t,r,s)},qt={arity:{min:1},docs:{category:"special-expression",returns:{type:"any"},args:{a:{type:"any"},b:{type:"any"},c:{type:"any",rest:!0}},variants:[{argumentNames:["a"]},{argumentNames:["a","b"]},{argumentNames:["a","b","c"]}],description:"Nullish coalescing operator. Returns the first non-`null` value.\n\nEvaluation is short-circuited — as soon as a non-`null` value is found, the remaining expressions are not evaluated.\n\nIf all values are `null`, returns `null`.\n\nAlso works with undefined symbols — if a symbol is undefined, it is treated as `null`.",examples:["1 ?? 2","null ?? 2","??(null)",'??(null, "default")','??(1, "default")','false ?? "default"',"??(null, null, 3)"]},evaluateAsNormalExpression:(e,t)=>{for(const n of e){const e=A(n,t);if(null!==e)return e}return null},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n(e[1][1],t,r,s)},It={arity:{},docs:{category:"special-expression",customVariants:["recur(...recur-args)"],description:"Recursevly calls enclosing function or loop with its evaluated `recur-args`.",examples:["\nlet foo = (n) -> do\n  write!(n);\n  if not(zero?(n)) then\n    recur(n - 1)\n  end\nend;\nfoo(3)","\n(n -> do\n  write!(n);\n  if not(zero?(n)) then\n    recur(n - 1)\n  end\nend)(3)","\nloop (n = 3) -> do\n  write!(n);\n  if not(zero?(n)) then\n    recur(n - 1)\n  end\nend"]},evaluateAsNormalExpression:e=>{throw new t(e)},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n(e[1][1],t,r,s)},Ct={arity:K(1),docs:{category:"special-expression",returns:{type:"never"},args:{expr:{type:"any"}},variants:[{argumentNames:["expr"]}],description:"Throws `UserDefinedError` with message set to $expr evaluated. $expr must evaluate to a string.",examples:['try throw("You shall not pass!") catch(error) "Error: " ++ error.message end','try throw(slice("You shall not pass!", 0, 3)) catch(error) "Error: " ++ error.message end']},evaluateAsNormalExpression:(e,t)=>{const n=V(e[0],t,{nonEmpty:!0});throw new r(n,void 0)},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n([e[1][1]],t,r,s)},Pt={arity:{},docs:{category:"special-expression",customVariants:["try { try-body } catch { catch-body }","try { try-body } catch(error) { catch-body }","try { try-body } with { case effect then handler ... } end","try { try-body } with { case effect then handler ... } catch { catch-body }","try { try-body } with { case effect then handler ... } catch(error) { catch-body }"],details:[["try-body","expressions","The expressions to try."],["error","symbol","The error variable to bind."],["catch-body","expression","The expressions to evaluate if the try-body throws an error."],["effect","expression","An expression evaluating to an effect value."],["handler","expression","A function that handles the effect. Its return value resumes the perform call."]],description:"Executes `try-body`. If that throws, the `catch-body` gets executed. Effect handlers can be installed via `with` to intercept `perform` calls. See examples for details.",examples:['\ntry\n  2 / 4\ncatch\n  "Oops!"\nend','\ntry\n  foo()\ncatch(error)\n  "Error: " ++ error.message\nend',"\ntry\n  foo()\ncatch\n  42\nend"]},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>{const[,a,o,i,c]=e[1],u=n([a],t,r,s);let l=new Set;if(i){const e=o?{[o[1]]:{value:!0}}:{};l=n([i],t.create(e),r,s)}let p=new Set;for(const[e,a]of c){p=ee(p,n([e],t,r,s),n([a],t,r,s))}return ee(u,l,p)}},Rt={arity:{},docs:{category:"special-expression",returns:{type:"any",array:!0},args:{values:{type:"any",rest:!0}},variants:[{argumentNames:["values"]}],description:"Makes new array from $values.",examples:["array(1, 2, 3)","array(array(null, false, true))","[]","[1, 2, 3]","[1, 2, ...[3, 4, 5], 6]","[[null, false, true]]","[1, 2, 3][1]"],hideOperatorForm:!0},evaluateAsNormalExpression:(e,t)=>{const n=[];for(const r of e)n.push(A(r,t));return n},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n(e[1][1],t,r,s)},Tt={arity:{},docs:{category:"special-expression",customVariants:["effect(name)"],details:[["name","dotted identifier","The effect name, e.g. `llm.complete` or `dvala.log`."]],description:"Returns the unique effect reference for the given name. Calling `effect` with the same name always returns the same reference. Effect references are first-class values that can be stored, passed, and compared with `==`.",examples:["effect(dvala.log)","==(effect(llm.complete), effect(llm.complete))"]},getUndefinedSymbols:()=>new Set},Ot={arity:{},docs:{category:"special-expression",returns:{type:"object"},args:{kvps:{type:"any",rest:!0,description:"key - value pairs, where key is a string"}},variants:[{argumentNames:["kvps"]}],description:"Constructs a new object. Object members are created from the $kvps key-value pairs. Requires an even number of arguments.",examples:["object()",'\nlet default = {\n  type: "Person",\n  name: "John Doe",\n  age: 42\n};\n\n{\n  ...default,\n  name: "Lisa"\n}','object("x", 10, "y", true, "z", "A string")',"{}","{ a: 1, b: 2 }"],hideOperatorForm:!0},evaluateAsNormalExpression:(e,t)=>{const n={};for(let r=0;r<e.length;r+=2){const s=e[r],a=e[r+1];M(s,t),n[s]=a??null}return n},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>n(e[1][1],t,r,s)},Ut={arity:K(1),docs:{category:"special-expression",description:"Imports all functions from a module as an object. Use destructuring to pick specific functions.",customVariants:["import(module-name)"],returns:{type:"object"},examples:["let v = import(vector); v.stdev([1, 2, 3, 4])","let { linspace } = import(vector); linspace(0, 10, 5)","let g = import(grid); g.row([[1, 2], [3, 4]], 0)"]},getUndefinedSymbols:()=>new Set},Mt={arity:{min:1},docs:{category:"special-expression",customVariants:["parallel(expr1, expr2, ...)"],details:[["expr1, expr2, ...","expressions","Expressions to evaluate concurrently. Typically `perform(...)` calls."]],description:"Evaluates all branch expressions concurrently and returns an array of results in order. Each branch runs as an independent trampoline invocation. If any branch suspends, the entire `parallel` suspends with a composite blob. On resume, branches are resumed one at a time. Only available in async mode (`run()`). Requires at least one branch.",examples:[]},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>ee(...e[1][1].map(e=>n([e],t,r,s)))},Vt={arity:{min:1},docs:{category:"special-expression",customVariants:["perform(eff)","perform(eff, arg1)","perform(eff, arg1, arg2, ...)"],details:[["eff","expression","An expression evaluating to an effect value (from `effect(name)`)."],["arg1, arg2, ...","expressions","Arguments passed to the effect handler."]],description:"Invokes an effect. The nearest enclosing `try/with` handler matching the effect intercepts the call. The handler receives the arguments as an array and its return value becomes the result of `perform`. If no local handler matches, the effect is dispatched to the host.",examples:['\ntry\n  perform(effect(dvala.log), "hello")\nwith\n  case effect(dvala.log) then ([msg]) -> msg\nend\n']},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>{const[,a,o]=e[1];return ee(n([a],t,r,s),n(o,t,r,s))}},Ft={arity:{min:1},docs:{category:"special-expression",customVariants:["race(expr1, expr2, ...)"],details:[["expr1, expr2, ...","expressions","Expressions to race concurrently. Typically `perform(...)` calls."]],description:"Races all branch expressions concurrently. The first branch to complete wins — its value becomes the result. Losing branches are cancelled via AbortSignal. Errored branches are silently dropped. If all branches error, throws an aggregate error. If no branch completes but some suspend, the race suspends. On resume, the host provides the winner value directly. Only available in async mode (`run()`). Requires at least one branch.",examples:[]},getUndefinedSymbols:(e,t,{getUndefinedSymbols:n,builtin:r,evaluateNode:s})=>ee(...e[1][1].map(e=>n([e],t,r,s)))},Bt={"??":0,"&&":1,"||":2,array:3,cond:4,"defined?":5,block:6,doseq:7,"0_lambda":8,for:9,if:10,let:11,loop:12,object:13,recur:14,match:15,throw:16,try:17,unless:18,import:19,effect:20,perform:21,parallel:22,race:23},_t={normalExpressions:Ge,specialExpressions:[qt,Ze,jt,Rt,Qe,yt,gt,St,ht,Et,vt,wt,kt,Ot,It,dt,Ct,Pt,bt,Ut,Tt,Vt,Mt,Ft],allNormalExpressions:He},Lt=Object.keys(Ge),Dt=Object.keys(Bt);function zt(e){return o.UserDefinedSymbol===e[0]}function Wt(e,t){return function(e,t){if(!zt(e))throw h("UserDefinedSymbolNode",e,t)}(e,t),e}function Jt(e){return o.NormalBuiltinSymbol===e[0]}function Kt(e){return o.SpecialBuiltinSymbol===e[0]}function Yt(e){return!!function(e){return e[0]===o.NormalExpression}(e)&&function(e){const t=e[0];return o.UserDefinedSymbol===t||o.NormalBuiltinSymbol===t||o.SpecialBuiltinSymbol===t}(e[1][0])}function Gt(e){return e[0]===o.Spread}class Xt{_contexts;globalContext;values;nativeJsFunctions;modules;valueModules;pure;constructor({contexts:e,values:t,nativeJsFunctions:n,modules:r,valueModules:s,pure:a}){this.globalContext=v(e[0]),this._contexts=e,this.values=t,this.nativeJsFunctions=n,this.modules=r??new Map,this.valueModules=s??new Map,this.pure=a??!1}getContextsRaw(){return this._contexts}getHostValues(){return this.values}getGlobalContextIndex(){return this._contexts.indexOf(this.globalContext)}static fromDeserialized(e){const t=new Xt({contexts:e.contexts,values:e.values,nativeJsFunctions:e.nativeJsFunctions,modules:e.modules,pure:e.pure});return e.globalContextIndex>=0&&e.globalContextIndex<e.contexts.length&&(t.globalContext=e.contexts[e.globalContextIndex]),t}setContextsFromDeserialized(e,t){this._contexts=e,t>=0&&t<e.length&&(this.globalContext=e[t])}getModule(e){return this.modules.get(e)}getValueModule(e){return this.valueModules.has(e)?{value:this.valueModules.get(e),found:!0}:{value:void 0,found:!1}}registerValueModule(e,t){this.valueModules.set(e,t)}create(e){const t=this.globalContext,n=new Xt({contexts:[e,...this._contexts],values:this.values,nativeJsFunctions:this.nativeJsFunctions,modules:this.modules,valueModules:this.valueModules,pure:this.pure});return n.globalContext=t,n}new(e){return new Xt({contexts:[{},e],modules:this.modules,valueModules:this.valueModules,pure:this.pure})}addValues(e,t){const r=this._contexts[0];for(const[s,a]of Object.entries(e)){if(r[s])throw new n(`Cannot redefine value "${s}"`,t);const e=Ht(s);if(e)throw new n(`Cannot shadow ${e}`,t);r[s]={value:Q(a)}}}getValue(e){for(const t of this._contexts){const n=t[e];if(n)return n.value}const t=this.nativeJsFunctions?.[e];return t||this.values?.[e]}lookUp(e){const t=e[1];for(const e of this._contexts){const n=e[t];if(n)return n}const n=this.values?.[t];if(void 0!==n)return{value:Q(n)};const r=this.nativeJsFunctions?.[t];return r?{value:r}:null}evaluateSymbol(e){if(Kt(e)){const t=e[1];switch(t){case Bt["&&"]:case Bt["||"]:case Bt.array:case Bt.object:case Bt["defined?"]:case Bt.recur:case Bt.throw:case Bt["??"]:{const n=v(_t.specialExpressions[t],e[2]);return{[l]:!0,functionType:"SpecialBuiltin",specialBuiltinSymbolType:t,sourceCodeInfo:e[2],arity:n.arity}}default:throw new n(`Unknown special builtin symbol type: ${t}`,e[2])}}if(Jt(e)){const t=e[1],n=He[t],r=n.name;return{[l]:!0,functionType:"Builtin",normalBuiltinSymbolType:t,sourceCodeInfo:e[2],arity:n.arity,name:r}}const t=this.lookUp(e);if(x(r=t)&&void 0!==r.value)return t.value;var r;throw new a(e[1],e[2])}}function Ht(e){return Dt.includes(e)?`special expression "${e}"`:Lt.includes(e)?`builtin function "${e}"`:"self"===e?`builtin value "${e}"`:null}function Zt(e){const t=Ht(e);if(t)throw new n(`Cannot shadow ${t}`,void 0)}const Qt=(e,t,n,r)=>{const s=Array.isArray(e)?e:[[o.SpecialExpression,[Bt.block,e.body]]],a=new Set;for(const e of s)en(e,t,n,r)?.forEach(e=>a.add(e));return a};function en(e,t,r,s){const a=e[0];switch(a){case o.UserDefinedSymbol:{const n=e;return null===t.lookUp(n)?new Set([n[1]]):null}case o.NormalBuiltinSymbol:case o.SpecialBuiltinSymbol:case o.String:case o.Number:case o.ReservedSymbol:case o.Binding:return null;case o.NormalExpression:{const n=e,a=new Set;if(Yt(n)){const[,[e]]=n;if(zt(e)){null===t.lookUp(e)&&a.add(e[1])}}else{const[,[e]]=n;en(e,t,r,s)?.forEach(e=>a.add(e))}for(const e of n[1][1])en(e,t,r,s)?.forEach(e=>a.add(e));return a}case o.SpecialExpression:{const n=e,a=n[1][0];return(0,r.specialExpressions[a].getUndefinedSymbols)(n,t,{getUndefinedSymbols:Qt,builtin:r,evaluateNode:s})}case o.Spread:return en(e[1],t,r,s);default:throw new n(`Unhandled node type: ${a}`,e[2])}}const tn=(1+Math.sqrt(5))/2,nn={E:Math.E,"-E":-Math.E,"ε":Math.E,"-ε":-Math.E,PI:Math.PI,"-PI":-Math.PI,"π":Math.PI,"-π":-Math.PI,PHI:tn,"-PHI":-tn,"φ":tn,"-φ":-tn,POSITIVE_INFINITY:Number.POSITIVE_INFINITY,"∞":Number.POSITIVE_INFINITY,NEGATIVE_INFINITY:Number.NEGATIVE_INFINITY,"-∞":Number.NEGATIVE_INFINITY,MAX_SAFE_INTEGER:Number.MAX_SAFE_INTEGER,MIN_SAFE_INTEGER:Number.MIN_SAFE_INTEGER,MAX_VALUE:Number.MAX_VALUE,MIN_VALUE:Number.MIN_VALUE,NaN:Number.NaN},rn={true:!0,false:!1,null:null,do:null,else:null,case:null,each:null,in:null,when:null,while:null,catch:null,function:null,as:null,then:null,end:null,with:null,_:null,...nn};class sn{k;meta;_brand="SuspensionSignal";constructor(e,t){this.k=e,this.meta=t}}function an(e){return e instanceof sn}const on=new Map;function cn(e){let t=on.get(e);return t||(t={[f]:!0,name:e},on.set(e,t)),t}function un(e,t="value"){if(null===e||"string"==typeof e||"number"==typeof e||"boolean"==typeof e)return null;if(C(e))return null;if(R(e))return null;if(w(e)){if("NativeJsFunction"===e.functionType)return`${t} is a NativeJsFunction (${e.name??"anonymous"}). NativeJsFunctions are not serializable — they are re-injected from bindings on resume.`;if("UserDefined"===e.functionType||"Builtin"===e.functionType||"SpecialBuiltin"===e.functionType||"Module"===e.functionType)return null;if("Partial"===e.functionType){const n=e,r=un(n.function,`${t}.function`);if(r)return r;for(let e=0;e<n.params.length;e++){const r=un(n.params[e],`${t}.params[${e}]`);if(r)return r}return null}if("Comp"===e.functionType){const n=e;for(let e=0;e<n.params.length;e++){const r=un(n.params[e],`${t}.params[${e}]`);if(r)return r}return null}if("Complement"===e.functionType){return un(e.function,`${t}.function`)}if("Constantly"===e.functionType){return un(e.value,`${t}.value`)}if("Juxt"===e.functionType){const n=e;for(let e=0;e<n.params.length;e++){const r=un(n.params[e],`${t}.params[${e}]`);if(r)return r}return null}if("EveryPred"===e.functionType){const n=e;for(let e=0;e<n.params.length;e++){const r=un(n.params[e],`${t}.params[${e}]`);if(r)return r}return null}if("SomePred"===e.functionType){const n=e;for(let e=0;e<n.params.length;e++){const r=un(n.params[e],`${t}.params[${e}]`);if(r)return r}return null}if("Fnull"===e.functionType){const n=e,r=un(n.function,`${t}.function`);if(r)return r;for(let e=0;e<n.params.length;e++){const r=un(n.params[e],`${t}.params[${e}]`);if(r)return r}return null}return`${t} has unknown function type ${e}`}if(Array.isArray(e)){for(let n=0;n<e.length;n++){const r=un(e[n],`${t}[${n}]`);if(r)return r}return null}if("object"==typeof e){for(const[n,r]of Object.entries(e)){const e=un(r,`${t}.${n}`);if(e)return e}return null}return`${t} has unexpected type ${typeof e}`}function ln(e,t){const r=new Map;let s=0;function a(e){if(e instanceof Xt){if(r.has(e))return;r.set(e,s++);for(const t of e.getContextsRaw())for(const e of Object.values(t))a(e.value)}else if(Array.isArray(e))for(const t of e)a(t);else if(null!==e&&"object"==typeof e)for(const t of Object.values(e))a(t)}function o(e,t){if(e instanceof Xt)return{__csRef:r.get(e)};if(w(e)&&"NativeJsFunction"===e.functionType){const r=un(e,t);throw new n(`Cannot serialize continuation: ${r??"NativeJsFunction found in continuation stack"}`,void 0)}if(Array.isArray(e))return e.map((e,n)=>o(e,`${t}[${n}]`));if(null!==e&&"object"==typeof e){const n={};for(const[r,s]of Object.entries(e))n[r]=o(s,`${t}.${r}`);return n}return e}a(e),void 0!==t&&a(t);const i=Array.from(r.entries()).map(([e,t])=>({id:t,contexts:e.getContextsRaw().map((e,n)=>{const r={};for(const[s,a]of Object.entries(e))r[s]={value:o(a.value,`cs[${t}].contexts[${n}].${s}`)};return r}),globalContextIndex:e.getGlobalContextIndex(),pure:e.pure})),c=o(e,"k"),u=void 0!==t?o(t,"meta"):void 0,l={version:1,contextStacks:i,k:c,...void 0!==u?{meta:u}:{}};return JSON.stringify(l)}const pn={"dvala.log":(e,t)=>(console.log(...e),{type:"Value",value:null,k:t}),"dvala.now":(e,t)=>({type:"Value",value:Date.now(),k:t}),"dvala.random":(e,t)=>({type:"Value",value:Math.random(),k:t}),"dvala.sleep":(e,t,r)=>{const s=e[0];if("number"!=typeof s||s<0)throw new n(`dvala.sleep requires a non-negative number argument, got ${"number"==typeof s?s:typeof s}`,r);return new Promise(e=>{setTimeout(()=>e({type:"Value",value:null,k:t}),s)})}};function fn(e,t){switch(e[0]){case o.Number:case o.String:return e[1];case o.NormalBuiltinSymbol:case o.SpecialBuiltinSymbol:case o.UserDefinedSymbol:return t.evaluateSymbol(e);case o.ReservedSymbol:return xn(e);case o.NormalExpression:{const r=function(e,t){const r=e[2];return ie(function(e,t){const r=[],s=[],a=fe(e,(e,a)=>Gt(e)?ie(fn(e[1],t),t=>{if(!Array.isArray(t))throw new n(`Spread operator requires an array, got ${y(e)}`,e[2]);r.push(...t)}):e[0]!==o.ReservedSymbol||"_"!==e[1]?ie(fn(e,t),e=>{r.push(e)}):void s.push(a));return ie(a,()=>({params:r,placeholders:s}))}(e[1][1],t),({params:s,placeholders:o})=>{if(Yt(e)){const i=e[1][0];if(o.length>0){return ie(fn(i,t),e=>({[l]:!0,function:T(e,r),functionType:"Partial",params:s,placeholders:o,sourceCodeInfo:r,arity:K(o.length)}))}if(Jt(i)){const r=i[1],a=_t.allNormalExpressions[r];if(t.pure&&!1===a.pure)throw new n(`Cannot call impure function '${a.name}' in pure mode`,e[2]);return a.evaluate(s,e[2],t,{executeFunction:dn})}{const n=t.getValue(i[1]);if(void 0!==n)return dn(T(n,r),s,t,r);throw new a(i[1],e[2])}}return ie(fn(e[1][0],t),e=>{const n=T(e,r);if(o.length>0){return{[l]:!0,function:n,functionType:"Partial",params:s,placeholders:o,sourceCodeInfo:r,arity:K(o.length)}}return dn(n,s,t,r)})})}(e,t);return ie(r,t=>{if("number"==typeof t&&Number.isNaN(t))throw new n("Number is NaN",e[2]);return Ne(t)})}case o.SpecialExpression:{const r={type:"Eval",node:e,env:t,k:[]};try{return Ne(function(e){let t=e;for(;;){if(t instanceof Promise)throw new n("Unexpected async operation in synchronous context. Use async.run() for async operations.",void 0);if("Value"===t.type&&0===t.k.length)return t.value;t=Bn(t)}}(r))}catch(r){if(r instanceof n&&r.message.includes("Unexpected async operation")){return async function(e){let t=e;for(;;){if(t instanceof Promise&&(t=await t),"Value"===t.type&&0===t.k.length)return t.value;t=Bn(t)}}({type:"Eval",node:e,env:t,k:[]}).then(e=>Ne(e))}throw r}}default:throw new n(`${c(e[0])}-node cannot be evaluated`,e[2])}}function dn(e,t,r,s){if(w(e))return mn(e,t,r,s);if(Array.isArray(e))return hn(e,t,s);if(S(e))return gn(e,t,s);if("string"==typeof e)return vn(e,t,s);if(D(e))return bn(e,t,s);throw new n("Unexpected function type",s)}function mn(e,t,r,s){switch(e.functionType){case"UserDefined":return yn(e,t,r,s);case"Partial":return function(e,t,r,s){const a=[...e.params];if(t.length!==e.placeholders.length)throw new n(`(partial) expects ${e.placeholders.length} arguments, got ${t.length}.`,s);const o=[...t];for(const t of e.placeholders)a.splice(t,0,o.shift());return dn(e.function,a,r,s)}(e,t,r,s);case"Comp":return function(e,t,r,s){const{params:a}=e;if(0===a.length){if(1!==t.length)throw new n(`(comp) expects one argument, got ${y(t.length)}.`,s);return A(t[0],s)}let o=t;for(let e=a.length-1;e>=0;e--){const t=a[e];o=ie(o,e=>ie(dn(T(t,s),e,r,s),e=>[e]))}return ie(o,e=>A(e[0],s))}(e,t,r,s);case"Constantly":return e.value;case"Juxt":return function(e,t,n,r){return ce(e.params,e=>dn(T(e,r),t,n,r))}(e,t,r,s);case"Complement":return ie(dn(e.function,t,r,s),e=>!e);case"EveryPred":return function(e,t,n,r){const s=[];for(const a of e.params)for(const e of t)s.push(()=>dn(T(a,r),[e],n,r));return le(s,(e,t)=>!!e&&ie(t(),e=>!!e),!0)}(e,t,r,s);case"SomePred":return function(e,t,n,r){const s=[];for(const a of e.params)for(const e of t)s.push(()=>dn(T(a,r),[e],n,r));return le(s,(e,t)=>!!e||ie(t(),e=>!!e),!1)}(e,t,r,s);case"Fnull":return function(e,t,n,r){const s=t.map((t,n)=>null===t?Q(e.params[n]):t);return dn(T(e.function,r),s,n,r)}(e,t,r,s);case"Builtin":return function(e,t,r,s){const a=v(_t.allNormalExpressions[e.normalBuiltinSymbolType],s);if(r.pure&&!1===a.pure)throw new n(`Cannot call impure function '${e.name}' in pure mode`,s);return a.evaluate(t,s,r,{executeFunction:dn})}(e,t,r,s);case"SpecialBuiltin":return function(e,t,r,s){const a=v(_t.specialExpressions[e.specialBuiltinSymbolType],s);if(a.evaluateAsNormalExpression)return a.evaluateAsNormalExpression(t,s,r,{executeFunction:dn});throw new n(`Special builtin function ${e.specialBuiltinSymbolType} is not supported as normal expression.`,s)}(e,t,r,s);case"Module":return function(e,t,r,s){const a=r.getModule(e.moduleName);if(!a)throw new n(`Module '${e.moduleName}' not found.`,s);const o=a.functions[e.functionName];if(!o)throw new n(`Function '${e.functionName}' not found in module '${e.moduleName}'.`,s);if(r.pure&&!1===o.pure)throw new n(`Cannot call impure function '${e.functionName}' in pure mode`,s);return J(o.arity,t.length,s),o.evaluate(t,s,r,{executeFunction:dn})}(e,t,r,s);case"NativeJsFunction":return function(e,t,r,s){if(r.pure&&!e.nativeFn.pure)throw new n(`Cannot call impure native function '${e.name}' in pure mode`,s);try{const r=e.nativeFn.fn(...t);return r instanceof Promise?r.then(e=>Q(e),e=>{const t="string"==typeof e?e:x(e)&&"string"==typeof e.message?e.message:"<no message>";throw new n(`Native function threw: "${t}"`,s)}):Q(r)}catch(e){const t="string"==typeof e?e:x(e)&&"string"==typeof e.message?e.message:"<no message>";throw new n(`Native function threw: "${t}"`,s)}}(e,t,r,s)}}function yn(e,r,s,a){function o(r){if(!W(e.arity,r.length))throw new n(`Expected ${e.arity} arguments, got ${r.length}.`,a);const i=e.evaluatedfunction,c=i[0],u=c.filter(e=>e[0]!==tt).length,l=s.create(e.evaluatedfunction[2]),p={self:{value:e}},f=[];let d,m;for(let e=0;e<r.length;e+=1)if(e<u){const t=e;d=ie(d,()=>{const e=Q(r[t]);return ie(it(c[t],e,e=>fn(e,l.create(p))),e=>{Object.entries(e).forEach(([e,t])=>{p[e]={value:t}})})})}else f.push(Q(r[e]));for(let e=r.length;e<u;e++){const t=e;m=ie(m,()=>{const e=c[t];return ie(fn(e[1][1],s.create(p)),t=>ie(it(e,t,e=>fn(e,s.create(p))),e=>{Object.entries(e).forEach(([e,t])=>{p[e]={value:t}})}))})}return ie(d,()=>ie(m,()=>{const e=c.find(e=>e[0]===tt),n=void 0!==e?ie(it(e,f,e=>fn(e,s.create(p))),e=>{Object.entries(e).forEach(([e,t])=>{p[e]={value:t}})}):void 0;return ie(n,()=>{const e=l.create(p),n=le(i[1],(t,n)=>fn(n,e),null);return n instanceof Promise?n.catch(e=>{if(e instanceof t)return o(e.params);throw e}):n})}))}for(;;)try{return o(r)}catch(e){if(e instanceof t){r=e.params;continue}throw e}}function gn(e,t,r){if(1!==t.length)throw new n("Object as function requires one string parameter.",r);const s=t[0];return M(s,r),Q(e[s])}function hn(e,t,r){if(1!==t.length)throw new n("Array as function requires one non negative integer parameter.",r);const s=t[0];return z(s,r,{integer:!0,nonNegative:!0}),Q(e[s])}function vn(e,t,r){if(1!==t.length)throw new n("String as function requires one Obj parameter.",r);const s=Q(t[0]);if(S(s))return Q(s[e]);if(D(s,{integer:!0}))return Q(e[s]);throw new n(`string as function expects Obj or integer parameter, got ${y(s)}`,r)}function bn(e,t,r){if(z(e,void 0,{integer:!0}),1!==t.length)throw new n("Number as function requires one Arr parameter.",r);const s=t[0];return N(s,r),Q(s[e])}function xn(e){const t=e[1];if(!["true","false","null"].includes(t))throw new n(`Reserved symbol ${t} cannot be evaluated`,e[2]);return v(rn[t],e[2])}function wn(e,t,r){switch(e[0]){case o.Number:case o.String:return{type:"Value",value:e[1],k:r};case o.NormalBuiltinSymbol:case o.SpecialBuiltinSymbol:case o.UserDefinedSymbol:return{type:"Value",value:t.evaluateSymbol(e),k:r};case o.ReservedSymbol:return{type:"Value",value:xn(e),k:r};case o.NormalExpression:return function(e,t,n){const r=e[1][1],s=e[2],a={type:"NanCheck",sourceCodeInfo:s},i={type:"EvalArgs",node:e,index:0,params:[],placeholders:[],env:t,sourceCodeInfo:s};let c=0;for(;c<r.length;){const e=r[c];if(e[0]!==o.ReservedSymbol||"_"!==e[1])break;i.placeholders.push(i.params.length),c++}if(i.index=c,c>=r.length)return kn(i,[a,...n]);const u=r[c],l=[i,a,...n];if(Gt(u))return{type:"Eval",node:u[1],env:t,k:l};return{type:"Eval",node:u,env:t,k:l}}(e,t,r);case o.SpecialExpression:return function(e,t,r){const s=e[2],a=e[1][0];switch(a){case Bt.if:case Bt.unless:{const[n,o,i]=e[1][1];return{type:"Eval",node:n,env:t,k:[{type:"IfBranch",thenNode:o,elseNode:i,inverted:a===Bt.unless,env:t,sourceCodeInfo:s},...r]}}case Bt["&&"]:{const n=e[1][1];if(0===n.length)return{type:"Value",value:!0,k:r};const a={type:"And",nodes:n,index:1,env:t,sourceCodeInfo:s};return 1===n.length?{type:"Eval",node:n[0],env:t,k:r}:{type:"Eval",node:n[0],env:t,k:[a,...r]}}case Bt["||"]:{const n=e[1][1];if(0===n.length)return{type:"Value",value:!1,k:r};const a={type:"Or",nodes:n,index:1,env:t,sourceCodeInfo:s};return 1===n.length?{type:"Eval",node:n[0],env:t,k:r}:{type:"Eval",node:n[0],env:t,k:[a,...r]}}case Bt["??"]:{const n=e[1][1];if(0===n.length)return{type:"Value",value:null,k:r};const a=n[0];if(zt(a)&&null===t.lookUp(a)){if(1===n.length)return{type:"Value",value:null,k:r};const e={type:"Qq",nodes:n,index:2,env:t,sourceCodeInfo:s},a=n[1];return zt(a)&&null===t.lookUp(a)?function(e,t){return Sn(e,t)}(e,r):2===n.length?{type:"Eval",node:a,env:t,k:r}:{type:"Eval",node:a,env:t,k:[e,...r]}}const o={type:"Qq",nodes:n,index:1,env:t,sourceCodeInfo:s};return 1===n.length?{type:"Eval",node:a,env:t,k:r}:{type:"Eval",node:a,env:t,k:[o,...r]}}case Bt.cond:{const n=e[1][1];if(0===n.length)return{type:"Value",value:null,k:r};const a={type:"Cond",phase:"test",cases:n,index:0,env:t,sourceCodeInfo:s};return{type:"Eval",node:n[0][0],env:t,k:[a,...r]}}case Bt.match:{const n=e[1][1],a=e[1][2];return{type:"Eval",node:n,env:t,k:[{type:"Match",phase:"matchValue",matchValue:null,cases:a,index:0,bindings:{},env:t,sourceCodeInfo:s},...r]}}case Bt.block:{const n=e[1][1],a={},o=t.create(a);if(0===n.length)return{type:"Value",value:null,k:r};if(1===n.length)return{type:"Eval",node:n[0],env:o,k:r};const i={type:"Sequence",nodes:n,index:1,env:o,sourceCodeInfo:s};return{type:"Eval",node:n[0],env:o,k:[i,...r]}}case Bt.let:{const n=e[1][1],a=n[1][0];return{type:"Eval",node:n[1][1],env:t,k:[{type:"LetBind",target:a,env:t,sourceCodeInfo:s},...r]}}case Bt.loop:{const n=e[1][1],a=e[1][2];if(0===n.length){const e={},o={type:"LoopIterate",bindingNodes:n,bindingContext:e,body:a,env:t.create(e),sourceCodeInfo:s};return{type:"Eval",node:a,env:t.create(e),k:[o,...r]}}const o={type:"LoopBind",phase:"value",bindingNodes:n,index:0,context:{},body:a,env:t,sourceCodeInfo:s};return{type:"Eval",node:n[0][1][1],env:t,k:[o,...r]}}case Bt.for:case Bt.doseq:{const n=e[1][1],o=e[1][2],i=a===Bt.for;if(0===n.length)return{type:"Value",value:i?[]:null,k:r};const c={},u=t.create(c),l={type:"ForLoop",returnResult:i,bindingNodes:n,body:o,result:[],phase:"evalCollection",bindingLevel:0,levelStates:[],context:c,env:u,sourceCodeInfo:s};return{type:"Eval",node:n[0][0][1][1],env:u,k:[l,...r]}}case Bt.try:{const n=e[1][1],a=e[1][2],o=e[1][3],i=e[1][4];if(i&&i.length>0){const e={type:"TryWith",handlers:i.map(([e,n])=>({effectRef:fn(e,t),handlerNode:n})),env:t,sourceCodeInfo:s};if(o){const i={type:"TryCatch",errorSymbol:a?a[1]:null,catchNode:o,env:t,sourceCodeInfo:s};return{type:"Eval",node:n,env:t,k:[e,i,...r]}}return{type:"Eval",node:n,env:t,k:[e,...r]}}if(o){const e={type:"TryCatch",errorSymbol:a?a[1]:null,catchNode:o,env:t,sourceCodeInfo:s};return{type:"Eval",node:n,env:t,k:[e,...r]}}return{type:"Eval",node:n,env:t,k:r}}case Bt.throw:return{type:"Eval",node:e[1][1],env:t,k:[{type:"Throw",sourceCodeInfo:s},...r]};case Bt.recur:{const n=e[1][1];if(0===n.length)return Tn([],r,s);const a={type:"Recur",nodes:n,index:1,params:[],env:t,sourceCodeInfo:s};if(1===n.length){const e={...a,index:1};return{type:"Eval",node:n[0],env:t,k:[e,...r]}}return{type:"Eval",node:n[0],env:t,k:[a,...r]}}case Bt.array:{const n=e[1][1];if(0===n.length)return{type:"Value",value:[],k:r};const a=n[0],o=Gt(a),i={type:"ArrayBuild",nodes:n,index:0,result:[],isSpread:o,env:t,sourceCodeInfo:s};return{type:"Eval",node:o?a[1]:a,env:t,k:[i,...r]}}case Bt.object:{const n=e[1][1];if(0===n.length)return{type:"Value",value:{},k:r};const a=n[0],o=Gt(a),i={type:"ObjectBuild",nodes:n,index:0,result:{},currentKey:null,isSpread:o,env:t,sourceCodeInfo:s};return{type:"Eval",node:o?a[1]:a,env:t,k:[i,...r]}}case Bt["0_lambda"]:{const n=e[1][1],s=e[1][2]??"",a=function(e,t){const n={},r=e[0].reduce((e,t)=>(Object.keys(ut(t)).forEach(t=>{e[t]={value:null}}),e),{});return Qt(e[1],t.new(r),_t,fn).forEach(e=>{const r=t.getValue(e);k(r)&&(n[e]={value:r})}),[e[0],e[1],n]}(n,t),o=a[0].filter(e=>e[0]!==tt&&void 0===e[1][1]).length,i={min:o>0?o:void 0,max:a[0].some(e=>e[0]===tt)?void 0:a[0].length};return{type:"Value",value:{[l]:!0,sourceCodeInfo:e[2],functionType:"UserDefined",name:void 0,evaluatedfunction:a,arity:i,docString:s},k:r}}case Bt["defined?"]:{const n=e[1][1];if(!zt(n))return{type:"Value",value:!0,k:r};return{type:"Value",value:null!==t.lookUp(n),k:r}}case Bt.import:{const a=e[1][1],o=t.getValueModule(a);if(o.found)return{type:"Value",value:o.value,k:r};const i=t.getModule(a);if(!i)throw new n(`Unknown module: '${a}'`,s);const c={};for(const[e,t]of Object.entries(i.functions))c[e]={[l]:!0,sourceCodeInfo:s,functionType:"Module",moduleName:a,functionName:e,arity:t.arity};return{type:"Value",value:c,k:r}}case Bt.effect:return{type:"Value",value:cn(e[1][1]),k:r};case Bt.perform:{const n=[e[1][1],...e[1][2]];if(1===n.length){const e={type:"PerformArgs",argNodes:n,index:1,params:[],env:t,sourceCodeInfo:s};return{type:"Eval",node:n[0],env:t,k:[e,...r]}}const a={type:"PerformArgs",argNodes:n,index:1,params:[],env:t,sourceCodeInfo:s};return{type:"Eval",node:n[0],env:t,k:[a,...r]}}case Bt.parallel:return{type:"Parallel",branches:e[1][1],env:t,k:r};case Bt.race:return{type:"Race",branches:e[1][1],env:t,k:r};default:throw new n(`Unknown special expression type: ${a}`,s)}}(e,t,r);default:throw new n(`${c(e[0])}-node cannot be evaluated`,e[2])}}function kn(e,t){const{node:r,params:s,placeholders:o,env:i,sourceCodeInfo:c}=e;if(Yt(r)){const e=r[1][0];if(o.length>0){const n=i.evaluateSymbol(e);return{type:"Value",value:{[l]:!0,function:T(n,c),functionType:"Partial",params:s,placeholders:o,sourceCodeInfo:c,arity:K(o.length)},k:t}}if(Jt(e)){const r=e[1],a=_t.allNormalExpressions[r];if(i.pure&&!1===a.pure)throw new n(`Cannot call impure function '${a.name}' in pure mode`,c);return Fn(a.evaluate(s,c,i,{executeFunction:dn}),t)}const u=i.getValue(e[1]);if(void 0!==u)return An(T(u,c),s,o,i,c,t);throw new a(e[1],c)}return{type:"Eval",node:r[1][0],env:i,k:[{type:"CallFn",params:s,placeholders:o,env:i,sourceCodeInfo:c},...t]}}function An(e,t,r,s,a,o){if(r.length>0){return{type:"Value",value:{[l]:!0,function:e,functionType:"Partial",params:t,placeholders:r,sourceCodeInfo:a,arity:K(r.length)},k:o}}if(w(e))return function(e,t,n,r,s){switch(e.functionType){case"UserDefined":return $n(e,t,n,r,s);case"Partial":case"Comp":case"Constantly":case"Juxt":case"Complement":case"EveryPred":case"SomePred":case"Fnull":case"Builtin":case"SpecialBuiltin":case"Module":case"NativeJsFunction":return Fn(mn(e,t,n,r),s)}}(e,t,s,a,o);if(Array.isArray(e))return{type:"Value",value:hn(e,t,a),k:o};if(S(e))return{type:"Value",value:gn(e,t,a),k:o};if("string"==typeof e)return{type:"Value",value:vn(e,t,a),k:o};if(D(e))return{type:"Value",value:bn(e,t,a),k:o};throw new n("Unexpected function type",a)}function $n(e,t,r,s,a){if(!W(e.arity,t.length))throw new n(`Expected ${e.arity} arguments, got ${t.length}.`,s);const o=e.evaluatedfunction,i=o[0],c=i.filter(e=>e[0]!==tt).length,u=r.create(e.evaluatedfunction[2]),l={self:{value:e}},p=[];for(let n=0;n<t.length;n+=1)if(n<c){const o=Q(t[n]),c=it(i[n],o,e=>fn(e,u.create(l)));if(c instanceof Promise){return Fn(yn(e,t,r,s),a)}Object.entries(c).forEach(([e,t])=>{l[e]={value:t}})}else p.push(Q(t[n]));for(let n=t.length;n<c;n++){const o=i[n],c=fn(o[1][1],u.create(l));if(c instanceof Promise){return Fn(yn(e,t,r,s),a)}const p=it(o,c,e=>fn(e,u.create(l)));if(p instanceof Promise){return Fn(yn(e,t,r,s),a)}Object.entries(p).forEach(([e,t])=>{l[e]={value:t}})}const f=i.find(e=>e[0]===tt);if(f){const n=it(f,p,e=>fn(e,u.create(l)));if(n instanceof Promise){return Fn(yn(e,t,r,s),a)}Object.entries(n).forEach(([e,t])=>{l[e]={value:t}})}const d=o[1],m=u.create(l);if(0===d.length)return{type:"Value",value:null,k:a};const y={type:"FnBody",fn:e,bodyIndex:1,env:m,outerEnv:r,sourceCodeInfo:s};return d.length,{type:"Eval",node:d[0],env:m,k:[y,...a]}}function En(e,t,s){switch(e.type){case"Sequence":return function(e,t,n){const{nodes:r,index:s,env:a}=e;if(s>=r.length)return{type:"Value",value:t,k:n};const o={...e,index:s+1};if(s===r.length-1)return{type:"Eval",node:r[s],env:a,k:n};return{type:"Eval",node:r[s],env:a,k:[o,...n]}}(e,t,s);case"IfBranch":return function(e,t,n){const{thenNode:r,elseNode:s,inverted:a,env:o}=e,i=a?!t:t;if(i)return{type:"Eval",node:r,env:o,k:n};if(s)return{type:"Eval",node:s,env:o,k:n};return{type:"Value",value:null,k:n}}(e,t,s);case"Cond":return function(e,t,n){const{cases:r,index:s,env:a}=e;if("test"===e.phase){if(t)return{type:"Eval",node:r[s][1],env:a,k:n};const o=s+1;if(o>=r.length)return{type:"Value",value:null,k:n};const i={...e,index:o};return{type:"Eval",node:r[o][0],env:a,k:[i,...n]}}return{type:"Value",value:t,k:n}}(e,t,s);case"Match":return function(e,t,n){const{cases:r,env:s}=e;if("matchValue"===e.phase){const r=t;return Nn({...e,matchValue:r,phase:"guard"},n)}if("guard"===e.phase){if(!t){return Nn({...e,index:e.index+1,bindings:{}},n)}const a={};for(const[t,n]of Object.entries(e.bindings))a[t]={value:n};const o=s.create(a);return{type:"Eval",node:r[e.index][1],env:o,k:n}}return{type:"Value",value:t,k:n}}(e,t,s);case"And":return function(e,t,n){if(!t)return{type:"Value",value:t,k:n};const{nodes:r,index:s,env:a}=e;if(s>=r.length)return{type:"Value",value:t,k:n};if(s===r.length-1)return{type:"Eval",node:r[s],env:a,k:n};const o={...e,index:s+1};return{type:"Eval",node:r[s],env:a,k:[o,...n]}}(e,t,s);case"Or":return function(e,t,n){if(t)return{type:"Value",value:t,k:n};const{nodes:r,index:s,env:a}=e;if(s>=r.length)return{type:"Value",value:t,k:n};if(s===r.length-1)return{type:"Eval",node:r[s],env:a,k:n};const o={...e,index:s+1};return{type:"Eval",node:r[s],env:a,k:[o,...n]}}(e,t,s);case"Qq":return function(e,t,n){if(null!==t)return{type:"Value",value:t,k:n};return Sn(e,n)}(e,t,s);case"ArrayBuild":return function(e,t,r){const{nodes:s,result:a,env:o,sourceCodeInfo:i}=e;if(e.isSpread){if(!Array.isArray(t))throw new n("Spread value is not an array",i);a.push(...t)}else a.push(t);const c=e.index+1;if(c>=s.length)return{type:"Value",value:a,k:r};const u=s[c],l=Gt(u),p={...e,index:c,isSpread:l};return{type:"Eval",node:l?u[1]:u,env:o,k:[p,...r]}}(e,t,s);case"ObjectBuild":return function(e,t,r){const{nodes:s,result:a,env:o,sourceCodeInfo:i}=e;if(e.isSpread){if(!x(t))throw new n("Spread value is not an object",i);Object.assign(a,t);const c=e.index+1;if(c>=s.length)return{type:"Value",value:a,k:r};const u=s[c],l=Gt(u),p={...e,index:c,currentKey:null,isSpread:l};return{type:"Eval",node:l?u[1]:u,env:o,k:[p,...r]}}if(null===e.currentKey){M(t,i);const a=s[e.index+1];if(void 0===a)throw new n("Missing value for key",i);return{type:"Eval",node:a,env:o,k:[{...e,currentKey:t},...r]}}{a[e.currentKey]=t;const n=e.index+2;if(n>=s.length)return{type:"Value",value:a,k:r};const i=s[n],c=Gt(i),u={...e,index:n,currentKey:null,isSpread:c};return{type:"Eval",node:c?i[1]:i,env:o,k:[u,...r]}}}(e,t,s);case"LetBind":return function(e,t,n){const{target:r,env:s,sourceCodeInfo:a}=e,o=it(r,t,e=>fn(e,s));return ie(o,e=>(s.addValues(e,a),{type:"Value",value:t,k:n}))}(e,t,s);case"LoopBind":return function(e,t,n){const{bindingNodes:r,index:s,context:a,body:o,env:i,sourceCodeInfo:c}=e,u=r[s],l=it(u[1][0],t,e=>fn(e,i.create(a)));return ie(l,t=>{Object.entries(t).forEach(([e,t])=>{a[e]={value:t}});const u=s+1;if(u>=r.length){const e=i.create(a);return{type:"Eval",node:o,env:e,k:[{type:"LoopIterate",bindingNodes:r,bindingContext:a,body:o,env:e,sourceCodeInfo:c},...n]}}const l={...e,index:u};return{type:"Eval",node:r[u][1][1],env:i.create(a),k:[l,...n]}})}(e,t,s);case"LoopIterate":return function(e,t,n){return{type:"Value",value:t,k:n}}(0,t,s);case"ForLoop":return function(e,t,r){const{returnResult:s,bindingNodes:a,result:o,env:i,sourceCodeInfo:c,context:u}=e,{asColl:l,isSeq:p}={asColl:(e,t)=>{if("string"==typeof e||Array.isArray(e)||S(e))return e;throw new n(`Expected collection, got ${y(e)}`,t)},isSeq:e=>"string"==typeof e||Array.isArray(e)};switch(e.phase){case"evalCollection":{const n=l(t,c),s=p(n)?n:Object.entries(n);if(0===s.length)return jn(e,r);const o=[...e.levelStates];o[e.bindingLevel]={collection:s,index:0};const f=a[e.bindingLevel];return ie(it(f[0][1][0],A(s[0],c),e=>fn(e,i)),t=>{Object.entries(t).forEach(([e,t])=>{u[e]={value:t}});const n=f[1];return n.length>0?In(e,o,n,0,r):Cn(e,o,r)})}case"evalLet":throw new n("ForLoop evalLet should not reach applyFrame",c);case"evalWhen":{if(!t)return qn(e,r);const n=a[e.bindingLevel][3];if(n){const t={...e,phase:"evalWhile"};return{type:"Eval",node:n,env:i,k:[t,...r]}}return Pn(e,r)}case"evalWhile":if(!t){const t=[...e.levelStates];return t[e.bindingLevel]={...t[e.bindingLevel],index:Number.POSITIVE_INFINITY},qn({...e,levelStates:t},r)}return Pn(e,r);case"evalBody":return s&&o.push(t),qn(e,r);case"evalElement":throw new n(`Unexpected ForLoop phase: ${e.phase}`,c)}return{type:"Value",value:null,k:r}}(e,t,s);case"Throw":return function(e,t,n){M(t,e.sourceCodeInfo,{nonEmpty:!0});const s=new r(t,e.sourceCodeInfo);return Rn(s,n)}(e,t,s);case"Recur":return function(e,t,n){const{nodes:r,index:s,params:a,env:o}=e;if(a.push(t),s>=r.length)return Tn(a,n,e.sourceCodeInfo);const i={...e,index:s+1};return{type:"Eval",node:r[s],env:o,k:[i,...n]}}(e,t,s);case"PerformArgs":return function(e,t,n){const{argNodes:r,index:s,params:a,env:o}=e;if(a.push(t),s>=r.length){const t=a[0];!function(e,t){if(!R(e))throw h("EffectRef",e,t)}(t,e.sourceCodeInfo);return{type:"Perform",effect:t,args:a.slice(1),k:n}}const i={...e,index:s+1};return{type:"Eval",node:r[s],env:o,k:[i,...n]}}(e,t,s);case"TryCatch":case"TryWith":return function(e,t){return{type:"Value",value:e,k:t}}(t,s);case"EffectResume":return function(e,t){return{type:"Value",value:t,k:e.resumeK}}(e,t);case"ParallelResume":return function(e,t,n){return{type:"ParallelResume",value:t,branchCount:e.branchCount,completedBranches:e.completedBranches,suspendedBranches:e.suspendedBranches,k:n}}(e,t,s);case"EvalArgs":return function(e,t,r){const{node:s,params:a,placeholders:i,env:c}=e,u=s[1][1],l=u[e.index];if(Gt(l)){if(!Array.isArray(t))throw new n(`Spread operator requires an array, got ${y(t)}`,l[2]);a.push(...t)}else a.push(t);let p=e.index+1;for(;p<u.length;){const e=u[p];if(e[0]!==o.ReservedSymbol||"_"!==e[1])break;i.push(a.length),p++}if(p>=u.length)return kn({...e,index:p},r);const f={...e,index:p},d=u[p];if(Gt(d))return{type:"Eval",node:d[1],env:c,k:[f,...r]};return{type:"Eval",node:d,env:c,k:[f,...r]}}(e,t,s);case"CallFn":return function(e,t,n){const r=T(t,e.sourceCodeInfo);return An(r,e.params,e.placeholders,e.env,e.sourceCodeInfo,n)}(e,t,s);case"FnBody":return function(e,t,n){const{fn:r,bodyIndex:s,env:a}=e,o=r.evaluatedfunction[1];if(s>=o.length)return{type:"Value",value:t,k:n};const i={...e,bodyIndex:s+1};return{type:"Eval",node:o[s],env:a,k:[i,...n]}}(e,t,s);case"BindingDefault":return function(e,t,r){const{target:s,record:a,env:o,sourceCodeInfo:i}=e,c=it(s,t,e=>fn(e,o));if(c instanceof Promise)throw new n("Async binding default evaluation not supported in trampoline yet",i);return Object.assign(a,c),{type:"Value",value:t,k:r}}(e,t,s);case"NanCheck":return function(e,t,r){if("number"==typeof t&&Number.isNaN(t))throw new n("Number is NaN",e.sourceCodeInfo);return{type:"Value",value:Ne(t),k:r}}(e,t,s);case"DebugStep":return function(e,t,n){if("awaitValue"===e.phase){const r={expression:e.sourceCodeInfo?.code??"",value:t,location:e.sourceCodeInfo?{line:e.sourceCodeInfo.position.line,column:e.sourceCodeInfo.position.column}:{line:0,column:0},env:Vn(e.env)},s={type:"DebugStep",phase:"awaitPerform",sourceCodeInfo:e.sourceCodeInfo,env:e.env};return{type:"Perform",effect:cn("dvala.debug.step"),args:[r],k:[s,...n]}}return{type:"Value",value:t,k:n}}(e,t,s);default:throw new n(`Unhandled frame type: ${e.type}`,void 0)}}function Nn(e,t){const{matchValue:r,cases:s,index:a,env:o,sourceCodeInfo:i}=e;for(let c=a;c<s.length;c++){const[a,u,l]=s[c],p=pt(a,r,e=>fn(e,o));if(p instanceof Promise)throw new n("Async pattern matching not supported in trampoline yet",i);if(null===p)continue;if(l){const n={};for(const[e,t]of Object.entries(p))n[e]={value:t};return{type:"Eval",node:l,env:o.create(n),k:[{...e,phase:"guard",index:c,bindings:p},...t]}}const f={};for(const[e,t]of Object.entries(p))f[e]={value:t};return{type:"Eval",node:u,env:o.create(f),k:t}}return{type:"Value",value:null,k:t}}function Sn(e,t){const{nodes:n,env:r}=e;let{index:s}=e;for(;s<n.length;){const e=n[s];if(!zt(e)||null!==r.lookUp(e))break;s++}if(s>=n.length)return{type:"Value",value:null,k:t};if(s===n.length-1)return{type:"Eval",node:n[s],env:r,k:t};const a={...e,index:s+1};return{type:"Eval",node:n[s],env:r,k:[a,...t]}}function jn(e,t){return{type:"Value",value:e.returnResult?e.result:null,k:t}}function qn(e,t){const{bindingNodes:n,env:r,sourceCodeInfo:s,context:a}=e,o=[...e.levelStates],i=e.bindingLevel,c=o[i],u=c.index+1;if(u>=c.collection.length)return 0===i?jn(e,t):qn({...e,bindingLevel:i-1},t);o[i]={...c,index:u};const l=n[i];return ie(it(l[0][1][0],A(c.collection[u],s),e=>fn(e,r)),n=>{Object.entries(n).forEach(([e,t])=>{a[e]={value:t}});const r=l[1];return r.length>0?In({...e,levelStates:o,bindingLevel:i},o,r,0,t):Cn({...e,levelStates:o,bindingLevel:i},o,t)})}function In(e,t,n,r,s){const{env:a,context:o}=e;let i;for(let e=r;e<n.length;e++){const t=e;i=ie(i,()=>{const e=n[t],[r,s]=e[1];return ie(fn(s,a),e=>ie(it(r,e,e=>fn(e,a)),e=>{Object.entries(e).forEach(([e,t])=>{o[e]={value:t}})}))})}return ie(i,()=>Cn({...e,levelStates:t},t,s))}function Cn(e,t,n){const{bindingNodes:r,env:s}=e,a=r[e.bindingLevel],o=a[2],i=a[3];if(o){return{type:"Eval",node:o,env:s,k:[{...e,levelStates:t,phase:"evalWhen"},...n]}}if(i){return{type:"Eval",node:i,env:s,k:[{...e,levelStates:t,phase:"evalWhile"},...n]}}return Pn({...e,levelStates:t},n)}function Pn(e,t){const{bindingNodes:n,body:r,env:s}=e,a=e.bindingLevel+1;if(a<n.length){return{type:"Eval",node:n[a][0][1][1],env:s,k:[{...e,phase:"evalCollection",bindingLevel:a},...t]}}return{type:"Eval",node:r,env:s,k:[{...e,phase:"evalBody"},...t]}}function Rn(e,t){for(let n=0;n<t.length;n++){const r=t[n];if("TryCatch"===r.type){const{errorSymbol:s,catchNode:a,env:o}=r,i=s?{[s]:{value:e}}:{},c=t.slice(n+1);return{type:"Eval",node:a,env:o.create(i),k:c}}}throw e}function Tn(e,t,r){for(let s=0;s<t.length;s++){const a=t[s];if("LoopIterate"===a.type){const{bindingNodes:o,bindingContext:i,body:c,env:u}=a,l=t.slice(s+1);if(e.length!==o.length)throw new n(`recur expected ${o.length} parameters, got ${e.length}`,r);const p=fe(o,(t,n)=>ie(it(t[1][0],Q(e[n]),e=>fn(e,u)),e=>{Object.entries(e).forEach(([e,t])=>{i[e]={value:t}})}));return ie(p,()=>{const e=u.getContextsRaw()[0];if(e!==i)for(const[t,n]of Object.entries(i))e[t]=n;const t={type:"LoopIterate",bindingNodes:o,bindingContext:i,body:c,env:u,sourceCodeInfo:a.sourceCodeInfo};return{type:"Eval",node:c,env:u,k:[t,...l]}})}if("FnBody"===a.type){const{fn:n,outerEnv:r}=a,o=t.slice(s+1);return $n(n,e,r,a.sourceCodeInfo,o)}}throw new n("recur called outside of loop or function body",r)}function On(e,t,r,s,a,o){for(let n=0;n<r.length;n++){const a=r[n];if("TryWith"===a.type)for(const o of a.handlers)if(R(o.effectRef)&&o.effectRef.name===e.name){const e=r;let i=n+1;i<r.length&&"TryCatch"===r[i].type&&i++;const c=[{type:"EffectResume",resumeK:e,sourceCodeInfo:s},...r.slice(i)];return An(T(fn(o.handlerNode,a.env),a.sourceCodeInfo),[t],[],a.env,s,c)}}const i=a?.[e.name];if(i)return function(e,t,r,s,a){const o=s??(new AbortController).signal;return new Promise((s,i)=>{let c=!1;const u={args:Array.from(t),signal:o,resume:e=>{if(c)throw new n("Effect handler called resume() more than once or after suspend()",a);c=!0,e instanceof Promise?e.then(e=>{s({type:"Value",value:e,k:r})},e=>{try{s(Rn(e instanceof Error?new n(e,a):new n(`${e}`,a),r))}catch(e){i(e)}}):s({type:"Value",value:e,k:r})},suspend:e=>{if(c)throw new n("Effect handler called suspend() more than once or after resume()",a);c=!0,i(new sn(r,e))}};e(u).catch(e=>{if(!c)if(c=!0,an(e))i(e);else try{s(Rn(e instanceof Error?new n(e,a):new n(`${e}`,a),r))}catch(e){i(e)}})})}(i,t,r,o,s);const c=(u=e.name,pn[u]);var u;if(c)return c(t,r,s);throw new n(`Unhandled effect: '${e.name}'`,s)}function Un(e,t){throw new sn(e,t)}async function Mn(e,t,n,r){return _n({type:"Eval",node:e,env:t,k:[]},n,r)}function Vn(e){const t={},n=e.getHostValues();if(n)for(const[e,r]of Object.entries(n))t[e]=r;const r=e.getContextsRaw();for(let e=r.length-1;e>=0;e--)for(const[n,s]of Object.entries(r[e]))t[n]=s.value;return t}function Fn(e,t){return e instanceof Promise?e.then(e=>({type:"Value",value:e,k:t}),e=>Rn(e,t)):{type:"Value",value:e,k:t}}function Bn(e,t,r){try{switch(e.type){case"Value":{if(0===e.k.length)return e;const[t,...n]=e.k;return En(t,e.value,n)}case"Eval":return wn(e.node,e.env,e.k);case"Apply":return En(e.frame,e.value,e.k);case"Perform":return On(e.effect,e.args,e.k,void 0,t,r);case"Parallel":return async function(e,t,r,s,a){const o=a??(new AbortController).signal,i=e.map(e=>Mn(e,t,s,o)),c=await Promise.allSettled(i),u=[],l=[],p=[];for(let e=0;e<c.length;e++){const t=c[e];if("rejected"===t.status)p.push(new n(`${t.reason}`,void 0));else{const n=t.value;switch(n.type){case"completed":u.push({index:e,value:n.value});break;case"suspended":l.push({index:e,blob:n.blob,meta:n.meta});break;case"error":p.push(n.error)}}}if(p.length>0)throw p[0];if(l.length>0)return Un([{type:"ParallelResume",branchCount:e.length,completedBranches:u,suspendedBranches:l.slice(1)},...r],l[0].meta);const f=Array.from({length:e.length});for(const{index:e,value:t}of u)f[e]=t;return{type:"Value",value:f,k:r}}(e.branches,e.env,e.k,t,r);case"Race":return async function(e,t,r,s,a){const o=a??(new AbortController).signal,i=e.map(()=>new AbortController),c=()=>{for(const e of i)e.abort(o.reason)};o.addEventListener("abort",c,{once:!0});try{let a=-1,o=null;const c=e.map(async(e,n)=>{const r=i[n].signal,c=await Mn(e,t,s,r);if("completed"===c.type&&a<0){a=n,o=c.value;for(let e=0;e<i.length;e++)e!==n&&i[e].abort("race: branch lost")}return c}),u=await Promise.allSettled(c);if(a>=0)return{type:"Value",value:o,k:r};const l=[],p=[];for(let e=0;e<u.length;e++){const t=u[e];if("rejected"===t.status)p.push(new n(`${t.reason}`,void 0));else{const e=t.value;switch(e.type){case"suspended":l.push(e.meta??null);break;case"error":p.push(e.error)}}}l.length>0&&Un(r,{type:"race",branches:l});const f=p.map(e=>e.message).join("; ");throw new n(`race: all branches failed: ${f}`,void 0)}finally{o.removeEventListener("abort",c)}}(e.branches,e.env,e.k,t,r);case"ParallelResume":return function(e){const{value:t,branchCount:n,completedBranches:r,suspendedBranches:s,k:a}=e,o=new Set(r.map(e=>e.index)),i=new Set(s.map(e=>e.index));let c=-1;for(let e=0;e<n;e++)if(!o.has(e)&&!i.has(e)){c=e;break}const u=[...r,{index:c,value:t}];if(s.length>0){const e=s[0];return Un([{type:"ParallelResume",branchCount:n,completedBranches:u,suspendedBranches:s.slice(1)},...a],e.meta)}const l=Array.from({length:n});for(const{index:e,value:t}of u)l[e]=t;return{type:"Value",value:l,k:a}}(e)}}catch(t){if(an(t))throw t;return Rn(t,e.k)}}async function _n(e,t,r){const s=null!=t&&"dvala.debug.step"in t;try{let n=e;for(;;){if(n instanceof Promise&&(n=await n),"Value"===n.type&&0===n.k.length)return{type:"completed",value:n.value};if(s&&"Eval"===n.type&&n.node[2]){const e=n.node[0];if(e===o.NormalExpression||e===o.SpecialExpression){const e={type:"DebugStep",phase:"awaitValue",sourceCodeInfo:n.node[2],env:n.env};n={...n,k:[e,...n.k]}}}n=Bn(n,t,r)}}catch(e){if(an(e)){return{type:"suspended",blob:ln(e.k,e.meta),meta:e.meta}}return e instanceof n?{type:"error",error:e}:{type:"error",error:new n(`${e}`,void 0)}}}new Set(Object.keys(pn));const Ln=["^","*","/","%","+","-","<<",">>",">>>","++","<","<=","≤",">",">=","≥","==","!=","!=","&","xor","|","&&","||","??","|>"],Dn=[...Ln,"?",":","->","...",".",",","=",":",";"],zn=new Set(["comment","cond","defined?","block","doseq","if","let","loop","recur","throw","try","unless","while"]);function Wn(e){return!zn.has(e)}const Jn=new Set(Ln);function Kn(e){return Jn.has(e)}const Yn=new Set(Dn);function Gn(e){return Yn.has(e)}const Xn=["(",")","[","]","{","}","'",'"',"`",",",".",";"," ","\n","\r","\t"],Hn=["0","1","2","3","4","5","6","7","8","9",...Xn],Zn=new Set(Xn),Qn=new Set(Hn),er=/\s/,tr=[0],nr=(e,t)=>{if('"'!==e[t])return tr;let n='"',r=1,s=e[t+r],a=!1;for(;s&&('"'!==s||a);)r+=1,a?(a=!1,n+=s):("\\"===s&&(a=!0),n+=s),s=e[t+r];return s?(n+='"',[r+1,["string",n]]):[r,["Error",n,void 0,`Unclosed string at position ${t}`]]};function rr(e,t,n,r){return t===n.slice(r,r+t.length)?[t.length,[e,t]]:tr}const sr=/\d/,ar=/[0-7]/,or=/[0-9a-f]/i,ir=/[01]/,cr=/[\s)\]}(,;]/,ur=(e,t)=>{let n=e[t];if("'"===n){let r=1,s=e[t+r],a=!1;for(;"'"!==s||a;){if(void 0===s)return[r,["Error",n,void 0,`Unclosed quoted symbol at position ${t}`]];r+=1,a?(a=!1,n+=s):("\\"===s&&(a=!0),n+=s),s=e[t+r]}return n+="'",[r+1,["Symbol",n]]}if(!Qn.has(n)){const r=t;let s=e[t+=1];for(;s&&!Zn.has(s);)n+=s,s=e[t+=1];return n.endsWith(":")?[t-r-1,["Symbol",n.slice(0,-1)]]:[t-r,["Symbol",n]]}return tr},lr=[(e,t)=>{let n=e[t];if(!n||!er.test(n))return tr;let r=n;for(n=e[t+=1];n&&er.test(n);)r+=n,n=e[t+=1];return[r.length,["Whitespace",r]]},(e,t)=>{if("/"===e[t]&&"*"===e[t+1]){let n=2,r="/*";for(;("*"!==e[t+n]||"/"!==e[t+n+1])&&t+n+1<e.length;)r+=e[t+n],n+=1;return t+n+1>=e.length?[n,["Error",r,void 0,`Unclosed multi-line comment at position ${t}`]]:(r+="*/",n+=2,[n,["MultiLineComment",r]])}return tr},(e,t)=>{if("/"===e[t]&&"/"===e[t+1]){let n=2,r="//";for(;"\n"!==e[t+n]&&t+n<e.length;)r+=e[t+n],n+=1;return[n,["SingleLineComment",r]]}return tr},(e,t)=>{const n=ur(e,t);if(0===n[0]||!n[1])return tr;let r=n[1][1];r=r.startsWith("'")?r.slice(1,r.length-1):r;return void 0===rn[r]?tr:[n[0],["ReservedSymbol",r]]},(e,t)=>rr("LParen","(",e,t),(e,t)=>rr("RParen",")",e,t),(e,t)=>rr("LBracket","[",e,t),(e,t)=>rr("RBracket","]",e,t),(e,t)=>rr("LBrace","{",e,t),(e,t)=>rr("RBrace","}",e,t),(e,t)=>{if('"'!==e[t]||'"'!==e[t+1]||'"'!==e[t+2])return tr;let n='"""',r=3,s=e[t+r],a=e.slice(t+r,t+r+3),o=!1;for(;s&&('"""'!==a||o);)r+=1,o?(o=!1,n+=s):("\\"===s&&(o=!0),n+=s),s=e[t+r],a=e.slice(t+r,t+r+3);return s?(n+='"""',[r+3,["DocString",n]]):[r,["Error",n,void 0,`Unclosed doc string at position ${t}`]]},nr,(e,t)=>{if("#"!==e[t])return tr;const[n,r]=nr(e,t+1);if(!r)return tr;if("Error"===r[0]){return[n+1,["Error",`#${r[1]}`,void 0,`Unclosed regexp at position ${t}`]]}t+=n+1;let s=n+1,a="";for(;"g"===e[t]||"i"===e[t];)if(a+=e[t],s+=1,t+=1,a.includes(e[t]))return[s,["Error",`#${r[1]}${a}`,void 0,`Duplicated regexp option "${e[t]}"`]];return[s,["RegexpShorthand",`#${r[1]}${a}`]]},(e,t)=>{if("0"!==e[t])return tr;const n=e[t+1],r="b"===n||"B"===n?"binary":"o"===n||"O"===n?"octal":"x"===n||"X"===n?"hex":null;if(null===r)return tr;let s;for(s=t+2;s<e.length;s+=1){const t=e[s];if("binary"===r&&!ir.test(t))break;if("octal"===r&&!ar.test(t))break;if("hex"===r&&!or.test(t))break}const a=s-t;if(a<=2)return tr;const o=e[s];return o&&!cr.test(o)?tr:[a,["BasePrefixedNumber",e.substring(t,s)]]},(e,t)=>{let n;const r="-"===e[t],s="+"===e[t],a=r||s?t+1:t;let o=!1,i=!1;for(n=a;n<e.length;n+=1){const r=e[n];if("_"===r){if(!sr.test(e[n-1])||!sr.test(e[n+1]))return n===a?tr:[n-t+1,["Error",e.substring(t,n+1),void 0,`Invalid number format at position ${n+1}`]]}else if("."===r){if(n===a)return tr;if(o||i)return[n-t+1,["Error",e.substring(t,n+1),void 0,`Invalid number format at position ${n+1}`]];o=!0}else if("e"===r||"E"===r){if(n===a)return tr;if(i)return[n-t+1,["Error",e.substring(t,n+1),void 0,`Invalid number format at position ${n+1}`]];if("."===e[n-1]||"+"===e[n-1]||"-"===e[n-1])return[n-t+1,["Error",e.substring(t,n+1),void 0,`Invalid number format at position ${n+1}`]];"+"!==e[n+1]&&"-"!==e[n+1]||(n+=1),i=!0}else if(!sr.test(r))break}if((r||s)&&n===a)return tr;const c=n-t;if(0===c)return tr;const u=e[n];return u&&":"!==u&&!cr.test(u)?[n-t+1,["Error",e.substring(t,n+1),void 0,`Invalid number format at position ${n+1}`]]:[c,["Number",e.substring(t,n)]]},(e,t)=>{const n=e.slice(t,t+3);if(t+2<e.length&&Gn(n))return[3,["Operator",n]];const r=e.slice(t,t+2);if(t+1<e.length&&Gn(r))return[2,["Operator",r]];const s=e[t]??"";return Gn(s)?[1,["Operator",s]]:tr},ur];function pr(e,t,n){const r=e.substring(0,t+1).split(/\r\n|\r|\n/),s=r[r.length-1],a=function(e,t){return e.split(/\r\n|\r|\n/)[t]}(e,r.length-1);return{code:a,position:{line:r.length,column:s.length},filePath:n}}function fr(e,t){const n=t;if(0===t){const[r,s]=((e,t)=>{if("#"===e[t]&&"!"===e[t+1]){let n=2,r="#!";for(;"\n"!==e[t+n]&&t+n<e.length;)r+=e[t+n],n+=1;return[n,["SingleLineComment",r]]}return tr})(e,t);if(t+=r,r>0)return[t-n,s]}for(const r of lr){const[s,a]=r(e,t);if(t+=s,0!==s)return[t-n,a]}return[1,["Error",e[n],void 0,"Unrecognized character"]]}function dr(e,t){return"Symbol"===e?.[0]&&(!t||e[1]===t)}function mr(e,t){return function(e,t){dr(e,t)||Or("Symbol",void 0,e)}(e,t),e}function yr(e,t){return"ReservedSymbol"===e?.[0]&&(!t||e[1]===t)}function gr(e,t){yr(e,t)||Or("ReservedSymbol",t,e)}function hr(e,t){return gr(e,t),e}function vr(e,t){return"Operator"===e?.[0]&&(!t||e[1]===t)}function br(e,t){vr(e,t)||Or("Operator",t,e)}function xr(e){return"Number"===e?.[0]}function wr(e){return"BasePrefixedNumber"===e?.[0]}function kr(e){return"LParen"===e?.[0]}function Ar(e){kr(e)||Or("LParen",void 0,e)}function $r(e){return"RParen"===e?.[0]}function Er(e){$r(e)||Or("RParen",void 0,e)}function Nr(e){return"LBracket"===e?.[0]}function Sr(e){return function(e){Nr(e)||Or("LBracket",void 0,e)}(e),e}function jr(e){return"RBracket"===e?.[0]}function qr(e){jr(e)||Or("RBracket",void 0,e)}function Ir(e){return"LBrace"===e?.[0]}function Cr(e){return function(e){Ir(e)||Or("LBrace",void 0,e)}(e),e}function Pr(e){return"RBrace"===e?.[0]}function Rr(e){return"string"===e?.[0]}function Tr(e){return"Operator"===e?.[0]&&Kn(e[1])}function Or(e,t,r){const s=r?`${r[0]} '${r[1]}'`:"end of input";throw new n(`Unexpected token: ${s}, expected ${e}${t?` '${t}'`:""}`,r?.[2])}function Ur(e,t){return t&&(e[2]=t),e}function Mr(e,t){return void 0!==Bt[e]&&"fn"!==e&&"defn"!==e?Ur([o.SpecialBuiltinSymbol,Bt[e]],t):void 0!==Xe[e]?Ur([o.NormalBuiltinSymbol,Xe[e]],t):Ur([o.UserDefinedSymbol,e],t)}function Vr(e){return e.substring(1,e.length-1).replace(/(\\{2})|(\\')|\\(.)/g,(e,t,n,r)=>t?"\\":n?"'":`\\${r}`)}const Fr=Object.entries(Xe).reduce((e,[t,n])=>(e[n]=t,e),[]),Br=Object.entries(Bt).reduce((e,[t,n])=>(e[n]=t,e),[]);function _r(e){return zt(e)?e[1]:Jt(e)?Fr[e[1]]:Br[e[1]]}function Lr(e,t,n){const r=Ur([o.NormalExpression,[e,t]],n);return Jt(e)&&J(He[e[1]].arity,r[1][1].length,n),r}function Dr(e){if(e.isAtEnd())return!0;const t=e.tryPeek();return vr(t)?[";",",",":"].includes(t[1]):!!yr(t)&&["else","when","while","case","catch","let","then","end","do"].includes(t[1])}function zr(e,t,r,s,a){const i=e[1];switch(i){case"^":case"*":case"/":case"%":case"+":case"-":case"<<":case">>":case">>>":case"++":case"<":case"<=":case"≤":case">":case">=":case"≥":case"==":case"!=":case"&":case"xor":case"|":case"|>":return Lr(t,[r,s],a);case"&&":case"||":case"??":return Ur([o.SpecialExpression,[Bt[i],[r,s]]],a);default:throw new n(`Unknown binary operator: ${i}`,a)}}class Wr{tokens;position;storedPosition=0;parseExpression;constructor(e){this.tokens=e.tokens,this.position=0}advance(){this.position+=1}tryPeek(){return this.tokens[this.position]}peek(){const e=this.tokens[this.position];if(!e){const e=this.tokens.at(-1),t=e?e[2]:void 0;throw new n("Unexpected end of input",t)}return e}isAtEnd(){return this.position>=this.tokens.length}peekSourceCodeInfo(){const e=this.tryPeek();return e?e[2]:this.tokens.at(-1)?.[2]}storePosition(){return this.storedPosition=this.position}restorePosition(){this.position=this.storedPosition}peekAhead(e){return this.tokens[this.position+e]}getPosition(){return this.position}getTokenAt(e){return this.tokens[e]}}function Jr(e,t){switch(e){case"^":return 12;case"*":case"/":case"%":return 11;case"+":case"-":return 10;case"<<":case">>":case">>>":return 9;case"++":return 8;case"<":case"<=":case"≤":case">":case">=":case"≥":return 7;case"==":case"!=":return 6;case"&":case"xor":case"|":return 5;case"&&":case"||":case"??":return 4;case"|>":return 2;default:throw new n(`Unknown binary operator: ${e}`,t)}}function Kr(e,t){const r=[];for(;!e.isAtEnd()&&!Yr(e,t);)vr(e.tryPeek(),";")?e.advance():r.push(e.parseExpression());if(function(e,t){if(!Yr(e,t))throw new n(`Expected ${t.map(e=>e[1]).join(" or ")}`,e.peekSourceCodeInfo())}(e,t),0===r.length)throw new n("Expected expression",e.peekSourceCodeInfo());return 1===r.length?r[0]:Ur([o.SpecialExpression,[Bt.block,r]],e.peekSourceCodeInfo())}function Yr(e,t){for(const n of t)if(yr(e.tryPeek(),n))return!0;return!1}function Gr(e,t){e.advance();const n=t[1].substring(1,t[1].length-1).replace(/(\\{2})|(\\")|(\\n)|(\\t)|(\\r)|(\\b)|(\\f)|\\(.)/g,(e,t,n,r,s,a,o,i,c)=>t?"\\":r?"\n":s?"\t":a?"\r":o?"\b":i?"\f":n?'"':c);return Ur([o.String,n],t[2])}function Xr(e,t=!1){const r=hr(e.tryPeek(),"do");e.advance();let s="";t&&function(e){return"DocString"===e?.[0]}(e.tryPeek())&&(s=function(e){const t=e.peek(),n=t[2]?["string",t[1].slice(2,-2),t[2]]:["string",t[1].slice(2,-2)],r=Gr(e,n);return re(r[1])}(e),e.isAtEnd()||yr(e.tryPeek(),"end")||(br(e.tryPeek(),";"),e.advance()));const a=[];for(;!e.isAtEnd()&&!yr(e.tryPeek(),"end");)if(a.push(e.parseExpression()),vr(e.tryPeek(),";"))e.advance();else if(!yr(e.tryPeek(),"end"))throw new n("Expected end",e.peekSourceCodeInfo());return gr(e.tryPeek(),"end"),e.advance(),[Ur([o.SpecialExpression,[Bt.block,a]],r[2]),s]}function Hr(e){const t=e.peek();if(e.advance(),!dr(t))throw new n(`Expected symbol token, got ${t[0]}`,t[2]);return"'"===t[1][0]?Mr(Vr(t[1]),t[2]):Mr(t[1],t[2])}function Zr(e){const t=e.peek();e.advance();const n=t[1],r="-"===n[0],s=(r?n.substring(1):n).replace(/_/g,"");return Ur([o.Number,r?-Number(s):Number(s)],t[2])}function Qr(e,{requireDefaultValue:t,noRest:r,allowLiteralPatterns:s}={}){const a=e.tryPeek();if(s&&yr(a,"_"))return e.advance(),Ur([at,[]],a[2]);if(s&&ts(a)){if(xr(a)||wr(a)){const t=Zr(e);return Ur([st,[t]],a[2])}if(Rr(a)){const t=Gr(e,a);return Ur([st,[t]],a[2])}if(yr(a,"true")){e.advance();const t=Ur([o.ReservedSymbol,"true"],a[2]);return Ur([st,[t]],a[2])}if(yr(a,"false")){e.advance();const t=Ur([o.ReservedSymbol,"false"],a[2]);return Ur([st,[t]],a[2])}if(yr(a,"null")){e.advance();const t=Ur([o.ReservedSymbol,"null"],a[2]);return Ur([st,[t]],a[2])}}if(dr(a)){const r=Hr(e);if(!zt(r))throw new n("Expected user defined symbol",a[2]);const s=es(e);if(t&&!s)throw new n("Expected assignment",e.peekSourceCodeInfo());return Ur([et,[r,s]],a[2])}if(vr(a,"...")){if(r)throw new n("Rest element not allowed",a[2]);e.advance();const t=Wt(Hr(e));if(vr(e.tryPeek(),"="))throw new n("Rest argument can not have default value",e.peekSourceCodeInfo());return Ur([tt,[t[1],void 0]],a[2])}if(Nr(a)){e.advance();const r=[];let o=e.peek(),i=!1;for(;!jr(o);){if(i)throw new n("Rest argument must be last",o[2]);if(vr(o,",")){r.push(null),e.advance(),o=e.peek();continue}const t=Qr(e,{allowLiteralPatterns:s});t[0]===tt&&(i=!0),r.push(t),o=e.peek(),jr(o)||(br(o,","),e.advance()),o=e.peek()}e.advance();const c=es(e);if(t&&!c)throw new n("Expected assignment",e.peekSourceCodeInfo());return Ur([rt,[r,c]],a[2])}if(Ir(a)){e.advance();const r={};let o=e.peek(),i=!1;for(;!Pr(o);){if(i)throw new n("Rest argument must be last",o[2]);vr(o,"...")&&(i=!0,e.advance());const t=Hr(e),c=_r(t);if(o=e.peek(),yr(o,"as")){if(i)throw new n("Rest argument can not have alias",o[2]);e.advance();const t=Wt(Hr(e));if(r[t[1]])throw new n(`Duplicate binding name: ${t}`,o[2]);r[c]=Ur([et,[t,es(e)]],a[2])}else if(Pr(o)||vr(o,",")||vr(o,"=")){const s=Wt(t,t[2]);if(r[s[1]])throw new n(`Duplicate binding name: ${s}`,o[2]);if(i&&vr(e.tryPeek(),"="))throw new n("Rest argument can not have default value",e.peekSourceCodeInfo());r[s[1]]=Ur(i?[tt,[s[1],es(e)]]:[et,[s,es(e)]],a[2])}else if(vr(o,":")){if(e.advance(),o=e.peek(),s){if(!Ir(o)&&!Nr(o)&&!ts(o))throw new n("Expected literal, object or array pattern",o[2])}else if(!Ir(o)&&!Nr(o))throw new n("Expected object or array",o[2]);r[c]=Qr(e,{allowLiteralPatterns:s})}Pr(e.peek())||(br(e.peek(),","),e.advance()),o=e.peek()}e.advance(),o=e.peek();const c=es(e);if(t&&!c)throw new n("Expected assignment",o[2]);return Ur([nt,[r,c]],a[2])}throw new n("Expected symbol",e.peekSourceCodeInfo())}function es(e){if(vr(e.tryPeek(),"="))return e.advance(),e.parseExpression()}function ts(e){return xr(e)||wr(e)||Rr(e)||yr(e,"true")||yr(e,"false")||yr(e,"null")}function ns(e,t){e.advance();const n=Qr(e,{requireDefaultValue:!0,noRest:!0}),r=n[1][1];n[1][1]=void 0;const s=Ur([o.Binding,[n,r]],t[2]);return Ur([o.SpecialExpression,[Bt.let,s]],t[2])}function rs(e){const t=function(e){const t=mr(e.tryPeek()),n=Wt(Hr(e));gr(e.tryPeek(),"in"),e.advance();const r=e.parseExpression();return Ur([o.Binding,[Ur([et,[n,void 0]],t[2]),r]],t[2])}(e),r=[];let s=e.peek();ss(s,["let","when","while"]);const a=[];if("let"===s[1])for(r.push("&let");dr(s,"let");){const t=ns(e,s),r=a.flatMap(e=>Object.keys(ut(e[1][0])));if(Object.keys(ut(t[1][1][1][0])).some(e=>r.includes(e)))throw new n("Duplicate binding",t[1][1][2]);a.push(t[1][1]),s=e.peek(),ss(s,["let","when","while"]),s=e.peek()}let i,c;for(;yr(s,"when")||yr(s,"while");){e.advance(),"when"===s[1]?(r.push("&when"),i=e.parseExpression()):(r.push("&while"),c=e.parseExpression()),s=e.peek();ss(s,r.includes("&when")&&r.includes("&while")?[]:r.includes("&when")?["while"]:["when"]),s=e.peek()}return ss(s,[]),[t,a,i,c]}function ss(e,t){if(!function(e,t){if(vr(e,",")||$r(e))return!0;for(const n of t){if("let"===n&&dr(e,"let"))return!0;if(["when","while"].includes(n)&&yr(e,n))return!0}return!1}(e,t)){const r=`${[...t,","].map(e=>`"${e}"`).join(", ")} or ")"`;throw new n(`Expected symbol ${r}`,e[2])}}function as(e){const t=hr(e.tryPeek());e.advance();const n=t[1];return function(e){return e in nn}(n)?Ur([o.Number,nn[n]],t[2]):Ur([o.ReservedSymbol,t[1]],t[2])}const os=/^\$([1-9]\d?)?$/;function is(e){const t=e.peek();if(kr(t)&&dr(e.peekAhead(1))&&vr(e.peekAhead(2),"->"))return null;try{const r=function(e){const t=e.peek();if(dr(t))return[Ur([et,[Hr(e),void 0]],t[2])];Ar(t),e.advance();let r=!1,s=!1;const a=[];for(;!e.isAtEnd()&&!$r(e.peek())&&!dr(e.peek(),"let");){if(r)throw new n("Rest argument must be last",e.peekSourceCodeInfo());const t=Qr(e);if(void 0!==t[1][1]&&(s=!0),t[0]===tt&&(r=!0),s&&!t[1][1])throw new n("Default arguments must be last",e.peekSourceCodeInfo());if(a.push(t),!vr(e.peek(),",")&&!$r(e.peek())&&!dr(e.peek(),"let"))throw new n("Expected comma or closing parenthesis",e.peekSourceCodeInfo());vr(e.peek(),",")&&e.advance()}if(!$r(e.peek()))throw new n("Expected closing parenthesis",e.peekSourceCodeInfo());return e.advance(),a}(e);if(!vr(e.peek(),"->"))return null;let s;e.advance();let a="";if(yr(e.peek(),"do")){const t=Xr(e,!0);a=t[1],s=t[0][1][1]}else s=[e.parseExpression()];return Ur([o.SpecialExpression,[Bt["0_lambda"],[r,s],a]],t[2])}catch{return null}}function cs(e,t){if(e.advance(),Kt(t)&&t[1]===Bt.effect)return function(e,t){const r=t[2],s=e.peek();if(!dr(s))throw new n("effect expects a dotted name identifier",s[2]);let a=s[1];e.advance();for(;vr(e.tryPeek(),".");){e.advance();const t=e.peek();if(!dr(t))throw new n("Expected identifier after dot in effect name",t[2]);a+=`.${t[1]}`,e.advance()}if(!$r(e.tryPeek()))throw new n("Expected closing parenthesis after effect name",e.peekSourceCodeInfo());return e.advance(),Ur([o.SpecialExpression,[Bt.effect,a]],r)}(e,t);const r=[];for(;!e.isAtEnd()&&!$r(e.tryPeek());){vr(e.tryPeek(),"...")?(e.advance(),r.push(Ur([o.Spread,e.parseExpression()],e.peekSourceCodeInfo()))):r.push(e.parseExpression());const t=e.tryPeek();if(!vr(t,",")&&!$r(t))throw new n("Expected comma or closing parenthesis",e.tryPeek()?.[2]);vr(t,",")&&e.advance()}if(!$r(e.tryPeek()))throw new n("Expected closing parenthesis",e.peekSourceCodeInfo());if(e.advance(),!Kt(t))return Jt(t)||zt(t)?Lr(t,r,t[2]):Ur([o.NormalExpression,[t,r]],t[2]);{const e=t[1];if(e===Bt.import){if(1!==r.length)throw new n(`import expects exactly 1 argument, got ${r.length}`,t[2]);const s=r[0];if(!zt(s))throw new n("import expects a module name (symbol), got a non-symbol argument",s[2]??t[2]);const a=s[1];return Ur([o.SpecialExpression,[e,a]],t[2])}const s=e;switch(J(_t.specialExpressions[s].arity,r.length,t[2]),s){case Bt["||"]:case Bt["&&"]:case Bt.recur:case Bt.array:case Bt.object:case Bt["??"]:return Ur([o.SpecialExpression,[s,r]],t[2]);case Bt["defined?"]:{const[e]=r;return Ur([o.SpecialExpression,[s,e]],t[2])}case Bt.throw:{const[e]=r;return Ur([o.SpecialExpression,[s,e]],t[2])}case Bt.perform:{const[e,...n]=r;return Ur([o.SpecialExpression,[s,e,n]],t[2])}case Bt.parallel:case Bt.race:return Ur([o.SpecialExpression,[s,r]],t[2]);case Bt["0_lambda"]:throw new n(`${s} is not allowed`,t[2]);default:throw new n(`Unknown special expression: ${s}`,t[2])}}}function us(e){const t=Cr(e.tryPeek());e.advance();const r=[];for(;!e.isAtEnd()&&!Pr(e.tryPeek());){if(vr(e.tryPeek(),"..."))e.advance(),r.push(Ur([o.Spread,e.parseExpression()],e.peekSourceCodeInfo()));else{const t=e.tryPeek();if(Rr(t)){const n=Gr(e,t);r.push(Ur([o.String,n[1]],t[2]))}else if(dr(t)){const n=t[1].startsWith("'")?Vr(t[1]):t[1];r.push(Ur([o.String,n],t[2])),e.advance()}else{if(!Nr(t))throw new n("Expected key to be a symbol or a string",e.peekSourceCodeInfo());e.advance(),r.push(e.parseExpression()),qr(e.tryPeek()),e.advance()}br(e.tryPeek(),":"),e.advance(),r.push(e.parseExpression())}const t=e.tryPeek();if(!vr(t,",")&&!Pr(t))throw new n("Expected comma or closing brace",e.peekSourceCodeInfo());vr(t,",")&&e.advance()}var s;return Pr(s=e.tryPeek())||Or("RBrace",void 0,s),e.advance(),Ur([o.SpecialExpression,[Bt.object,r]],t[2])}function ls(e){let t=function(e){const t=e.peek();if(kr(t)){e.storePosition();const t=is(e);if(t)return t;e.restorePosition(),e.advance();const r=e.parseExpression();if(!$r(e.peek()))throw new n("Expected closing parenthesis",e.peekSourceCodeInfo());return e.advance(),r}if(vr(t)){const r=t[1];if(Kn(r))return e.advance(),Ur(void 0!==Bt[r]?[o.SpecialBuiltinSymbol,Bt[r]]:[o.NormalBuiltinSymbol,Xe[r]],t[2]);if("->"===r)return function(e){const t=e.peek();e.advance();const r=e.getPosition();let s,a="";if(yr(e.peek(),"do")){const t=Xr(e,!0);a=t[1],s=t[0][1][1]}else s=[e.parseExpression()];const i=e.getPosition()-1;let c=0,u="NOT_SET";for(let s=r;s<=i;s+=1){const r=e.getTokenAt(s);if(dr(r)){const e=os.exec(r[1]);if(e){const r=e[1]??"1";if("1"===r){if(!e[1]&&"WITH_1"===u||e[1]&&"NAKED"===u)throw new n("Please make up your mind, either use $ or $1",t[2]);u=e[1]?"WITH_1":"NAKED"}if(c=Math.max(c,Number(r)),c>20)throw new n("Can't specify more than 20 arguments",t[2])}}}const l=[];for(let e=1;e<=c;e+=1)1===e&&"NAKED"===u?l.push(Ur([et,[[o.UserDefinedSymbol,"$"],void 0]],t[2])):l.push(Ur([et,[[o.UserDefinedSymbol,`$${e}`],void 0]],t[2]));return Ur([o.SpecialExpression,[Bt["0_lambda"],[l,s],a]],t[2])}(e);throw new n(`Illegal operator: ${r}`,t[2])}if(Ir(t))return us(e);if(Nr(t))return function(e){const t=Sr(e.tryPeek());e.advance();const r=[];for(;!e.isAtEnd()&&!jr(e.tryPeek());){vr(e.tryPeek(),"...")?(e.advance(),r.push(Ur([o.Spread,e.parseExpression()],e.peekSourceCodeInfo()))):r.push(e.parseExpression());const t=e.tryPeek();if(!vr(t,",")&&!jr(t))throw new n("Expected comma or closing parenthesis",e.peekSourceCodeInfo());vr(t,",")&&e.advance()}return qr(e.tryPeek()),e.advance(),Ur([o.SpecialExpression,[Bt.array,r]],t[2])}(e);const r=t[0];switch(r){case"Number":case"BasePrefixedNumber":return Zr(e);case"string":return Gr(e,t);case"Symbol":{e.storePosition();const t=is(e);return t||(e.restorePosition(),Hr(e))}case"ReservedSymbol":return as(e);case"RegexpShorthand":return function(e){const t=e.peek();e.advance();const n=t[1].lastIndexOf('"'),r=t[1].substring(2,n),s=t[1].substring(n+1),a=Ur([o.String,r],t[2]),i=Ur([o.String,s],t[2]);return Ur([o.NormalExpression,[Ur([o.NormalBuiltinSymbol,Xe.regexp],t[2]),[a,i]]],t[2])}(e);default:throw new n(`Unknown token type: ${r}`,t[2])}}(e),r=e.tryPeek();for(;vr(r,".")||Nr(r)||kr(r);)if("."===r[1]){e.advance();const s=e.tryPeek();if(!dr(s))throw new n("Expected symbol",e.peekSourceCodeInfo());t=ps(t,Ur([o.String,s[1]],s[2]),r[2]),e.advance(),r=e.tryPeek()}else if(Nr(r)){e.advance();const s=e.parseExpression();if(!jr(e.tryPeek()))throw new n("Expected closing bracket",e.peekSourceCodeInfo());t=ps(t,s,r[2]),e.advance(),r=e.tryPeek()}else kr(r)&&(t=cs(e,t),r=e.tryPeek());return t}function ps(e,t,n){return Ur([o.NormalExpression,[[o.NormalBuiltinSymbol,Xe.get],[e,t]]],n)}function fs(e,t=0){const r=e.tryPeek();let s;if(dr(r))switch(r[1]){case"let":return ns(e,r);case"if":case"unless":s=function(e,t){const n="unless"===t[1];e.advance();const r=e.parseExpression();gr(e.tryPeek(),"then"),e.advance();const s=Kr(e,["else","end"]);let a;return yr(e.tryPeek(),"else")&&(e.advance(),a=Kr(e,["end"])),e.advance(),Ur(n?[o.SpecialExpression,[Bt.unless,[r,s,a]]]:[o.SpecialExpression,[Bt.if,[r,s,a]]],t[2])}(e,r);break;case"cond":s=function(e,t){e.advance();const n=[];for(;!e.isAtEnd()&&!yr(e.tryPeek(),"end");){gr(e.tryPeek(),"case"),e.advance();const t=e.parseExpression();gr(e.tryPeek(),"then"),e.advance();const r=Kr(e,["case","end"]);if(n.push([t,r]),yr(e.tryPeek(),"end"))break}return gr(e.tryPeek()),e.advance(),Ur([o.SpecialExpression,[Bt.cond,n]],t[2])}(e,r);break;case"match":s=function(e,t){e.advance();const n=e.parseExpression(),r=[];for(;!e.isAtEnd()&&!yr(e.tryPeek(),"end");){gr(e.tryPeek(),"case"),e.advance();const t=Qr(e,{allowLiteralPatterns:!0});let n;yr(e.tryPeek(),"when")&&(e.advance(),n=e.parseExpression()),gr(e.tryPeek(),"then"),e.advance();const s=Kr(e,["case","end"]);if(r.push([t,s,n]),yr(e.tryPeek(),"end"))break}return gr(e.tryPeek(),"end"),e.advance(),Ur([o.SpecialExpression,[Bt.match,n,r]],t[2])}(e,r);break;case"for":case"doseq":s=function(e,t){const r="doseq"===t[1];e.advance(),Ar(e.tryPeek()),e.advance();const s=[];for(;!e.isAtEnd()&&!$r(e.tryPeek());){const t=rs(e),r=s.flatMap(e=>Object.keys(ut(e[0][1][0]))),a=ut(t[0][1][0]);if(Object.keys(a).some(e=>r.includes(e)))throw new n("Duplicate binding",t[0][2]);s.push(t),vr(e.tryPeek(),",")&&e.advance()}Er(e.tryPeek()),e.advance(),br(e.tryPeek(),"->"),e.advance();const a=e.parseExpression();return Ur(r?[o.SpecialExpression,[Bt.doseq,s,a]]:[o.SpecialExpression,[Bt.for,s,a]],t[2])}(e,r);break;case"loop":s=function(e,t){e.advance(),Ar(e.tryPeek()),e.advance();const r=[];let s=e.tryPeek();for(;!e.isAtEnd()&&!$r(s);){const t=Qr(e,{requireDefaultValue:!0,noRest:!0}),n=t[1][1];t[1][1]=void 0,r.push(Ur([o.Binding,[t,n]],t[2])),vr(e.tryPeek(),",")&&e.advance(),s=e.tryPeek()}if(0===r.length)throw new n("Expected binding",e.peekSourceCodeInfo());Er(s),e.advance(),br(e.tryPeek(),"->"),e.advance();const a=e.parseExpression();return Ur([o.SpecialExpression,[Bt.loop,r,a]],t[2])}(e,r);break;case"try":s=function(e,t){e.advance();const n=Kr(e,["with","catch"]),r=[];if(yr(e.tryPeek(),"with"))for(e.advance();!e.isAtEnd()&&!yr(e.tryPeek(),"end")&&!yr(e.tryPeek(),"catch");){gr(e.tryPeek(),"case"),e.advance();const t=e.parseExpression();gr(e.tryPeek(),"then"),e.advance();const n=Kr(e,["case","catch","end"]);r.push([t,n])}let s,a;return yr(e.tryPeek(),"catch")&&(e.advance(),kr(e.tryPeek())&&(e.advance(),s=Hr(e),Er(e.tryPeek()),e.advance()),a=Kr(e,["end"])),gr(e.tryPeek(),"end"),e.advance(),Ur([o.SpecialExpression,[Bt.try,n,s,a,r]],t[2])}(e,r)}else yr(r,"do")&&(s=Xr(e)[0]);s||=ls(e);let a=e.tryPeek();for(;!Dr(e);){if(Tr(a)){const n=a[1],r=Jr(n,a[2]);if(r<=t&&(12!==r||12!==t))break;const i=Ur(Bt[n]?[o.SpecialBuiltinSymbol,Bt[n]]:[o.NormalBuiltinSymbol,Xe[n]],a[2]);e.advance();s=zr(a,i,s,fs(e,r),a[2])}else if(dr(a)){if(!Wn(a[1]))break;const r=3;if(r<=t)break;const o=Hr(e),i=fs(e,r);if(Kt(o))throw new n("Special expressions are not allowed in binary functional operators",o[2]);s=Lr(o,[s,i],a[2])}else{if("?"!==a?.[1])break;{if(1<=t)break;e.advance();const r=fs(e);if(!vr(e.tryPeek(),":"))throw new n("Expected :",e.peekSourceCodeInfo());e.advance();const a=fs(e);s=Ur([o.SpecialExpression,[Bt.if,[s,r,a]]],s[2])}}a=e.tryPeek()}return s}function ds(e){e.tokens.forEach(e=>{if("Error"===e[0])throw new n(e[3],e[2])});const t=[],r=function(e){const t=new Wr(e);return t.parseExpression=(e=0)=>fs(t,e),t}(e);for(;!r.isAtEnd();)if(t.push(fs(r,0)),vr(r.tryPeek(),";"))r.advance();else if(!r.isAtEnd())throw new n("Expected ;",r.peekSourceCodeInfo());return t}function ms(e){const t=function(e,{removeWhiteSpace:t}){const n=e.tokens.filter(e=>!(function(e){return"SingleLineComment"===e?.[0]}(e)||function(e){return"MultiLineComment"===e?.[0]}(e)||function(e){return"Shebang"===e?.[0]}(e)||t&&function(e){return"Whitespace"===e?.[0]}(e)));return{...e,tokens:n}}(function(e,t,n){let r=0;const s={tokens:[],filePath:n,hasDebugData:t};for(;r<e.length;){const t=pr(e,r,n),a=fr(e,r),[o,i]=a;r+=o,i&&(t&&(i[2]=t),s.tokens.push(i))}return s}(e,!0,void 0),{removeWhiteSpace:!0});return{body:ds(t),hasDebugData:!0}}function ys(e){const t=[];let r=-1;const s=e?.handlers??{},a=e?.bindings,o=e?.modules,i={...s,"dvala.debug.step":async e=>{e.suspend(e.args[0])}};function c(e){if("suspended"===e.type){const n=function(e){if(null===e||"object"!=typeof e||Array.isArray(e))return{expression:"",value:null,location:{line:0,column:0},env:{}};const t=e,n=t.location;return{expression:t.expression??"",value:t.value,location:{line:n?.line??0,column:n?.column??0},env:t.env??{}}}(e.meta??null),s={blob:e.blob,step:n,timestamp:Date.now()};t.length=r+1,t.push(s),r=t.length-1}else e.type;return e}async function u(e,t){try{const r=o?new Map(o.map(e=>[e.name,e])):void 0,{k:s}=function(e,t){let r;try{r=JSON.parse(e)}catch{throw new n("Invalid suspension blob: not valid JSON",void 0)}if(1!==r.version)throw new n(`Unsupported suspension blob version: ${r.version} (expected 1)`,void 0);const s=new Map;for(const e of r.contextStacks){const n=e.contexts.map(()=>({})),r=Xt.fromDeserialized({contexts:n,globalContextIndex:e.globalContextIndex,values:t?.values,nativeJsFunctions:t?.nativeJsFunctions,modules:t?.modules,pure:e.pure});s.set(e.id,r)}function a(e){if(function(e){return null!==e&&"object"==typeof e&&"__csRef"in e&&"number"==typeof e.__csRef}(e)){const t=s.get(e.__csRef);if(!t)throw new n(`Invalid suspension blob: unknown context stack ref ${e.__csRef}`,void 0);return t}if(Array.isArray(e))return e.map(a);if(null!==e&&"object"==typeof e){const t={};for(const[n,r]of Object.entries(e))t[n]=a(r);return t}return e}for(const e of r.contextStacks){const t=s.get(e.id),n=e.contexts.map(e=>{const t=e,n={};for(const[e,r]of Object.entries(t))n[e]={value:a(r.value)};return n});t.setContextsFromDeserialized(n,e.globalContextIndex)}return{k:a(r.k),meta:void 0!==r.meta?a(r.meta):void 0}}(e,{values:a,modules:r});return await async function(e,t,n){return _n({type:"Value",value:t,k:e},n,(new AbortController).signal)}(s,t,i)}catch(e){return e instanceof n?{type:"error",error:e}:{type:"error",error:new n(`${e}`,void 0)}}}const p={get history(){return t},get currentStep(){return r},get current(){return r>=0&&r<t.length?t[r]:void 0},async run(e){t.length=0,r=-1;try{const t=o?new Map(o.map(e=>[e.name,e])):void 0,r=function(e={},t,r){const s=e.globalContext??{},a=e.contexts?[s,...e.contexts]:[s];let o,i;if(e.bindings)for(const[t,r]of Object.entries(e.bindings)){if(t.includes("."))throw new n(`Dots are not allowed in binding keys: "${t}"`,void 0);if("function"==typeof r){const e={fn:r};Zt(t),i||(i={}),i[t]={functionType:"NativeJsFunction",nativeFn:e,name:t,[l]:!0,arity:e.arity??{},docString:e.docString??""}}else Zt(t),o||(o={}),o[t]=r}const c=new Xt({contexts:a,values:o,modules:t,nativeJsFunctions:i,pure:r});return e.globalModuleScope?c:c.create({})}({bindings:a},t),s=ms(e),u=await async function(e,t,n){const r=(new AbortController).signal;return _n(function(e,t){if(0===e.length)return{type:"Value",value:null,k:[]};if(1===e.length)return{type:"Eval",node:e[0],env:t,k:[]};const n={type:"Sequence",nodes:e,index:1,env:t};return{type:"Eval",node:e[0],env:t,k:[n]}}(e.body,t),n,r)}(s,r,i);return c(u)}catch(e){return e instanceof n?{type:"error",error:e}:{type:"error",error:new n(`${e}`,void 0)}}},async stepForward(){if(r<t.length-1)return r++,{type:"suspended",blob:t[r].blob,meta:t[r].step};if(r<0||r>=t.length)return{type:"error",error:new n("No current step to advance from",void 0)};const e=t[r];return c(await u(e.blob,e.step.value))},async stepBackward(){if(r<=0)return{type:"error",error:new n("Already at the beginning of execution history",void 0)};r--;const e=t[r];return{type:"suspended",blob:e.blob,meta:e.step}},async jumpTo(e){if(e<0||e>=t.length)return{type:"error",error:new n(`Step index ${e} out of range (0..${t.length-1})`,void 0)};r=e;const s=t[r];return{type:"suspended",blob:s.blob,meta:s.step}},async rerunFrom(e,s){if(e<0||e>=t.length)return{type:"error",error:new n(`Step index ${e} out of range (0..${t.length-1})`,void 0)};r=e,t.length=e+1;const a=t[e];return c(await u(a.blob,s))}};return p}export{ys as createDebugger};
+//# sourceMappingURL=debug.esm.js.map