@mojir/dvala 0.0.10 → 0.0.13

package/dist/modules/cli/src/createReadlineInterface.d.ts

@@ -1,5 +0,0 @@
-#!/usr/bin/env node
-import type { ReadLine, ReadLineOptions } from 'node:readline';
-type Options = Required<Pick<ReadLineOptions, 'completer' | 'historySize' | 'prompt'>>;
-export declare function createReadlineInterface(options: Options): ReadLine;
-export {};

package/dist/modules/cli/src/js-interop/Cli/Fs/index.d.ts

@@ -1,2 +0,0 @@
-import type { DvalaModule } from '../../../../../src/builtin/modules/interface';
-export declare function getFsModule(): DvalaModule;

package/dist/modules/cli/src/js-interop/Cli/Proc/index.d.ts

@@ -1,3 +0,0 @@
-import type { DvalaModule } from '../../../../../src/builtin/modules/interface';
-export declare function sys_cwd(): string;
-export declare function getProcModule(): DvalaModule;

package/dist/modules/cli/src/js-interop/Cli/index.d.ts

@@ -1,2 +0,0 @@
-import type { DvalaModule } from '../../../../src/builtin/modules/interface';
-export declare function getCliModules(): DvalaModule[];

package/dist/modules/collection.esm.js

@@ -1,2 +0,0 @@
-function e(e){if(!e.position||!e.code)return"";const n=e.position.column-1,t=e.code.length-n-1;return`${" ".repeat(Math.max(n,0))}^${" ".repeat(Math.max(t,0))}`}class n extends Error{sourceCodeInfo;shortMessage;constructor(t,o){const c=t instanceof Error?t.message:`${t}`;super(function(n,t){if(!t)return n;const o=`${t.position.line}:${t.position.column}`;return`${n}${t.filePath?`\n${t.filePath}:${o}`:`\nLocation ${o}`}\n${t.code}\n${e(t)}`}(c,o)),this.shortMessage=c,this.sourceCodeInfo=o,Object.setPrototypeOf(this,n.prototype),this.name="DvalaError"}getCodeMarker(){return this.sourceCodeInfo&&e(this.sourceCodeInfo)}}const t={Number:1,String:2,NormalExpression:3,SpecialExpression:4,UserDefinedSymbol:5,NormalBuiltinSymbol:6,SpecialBuiltinSymbol:7,ReservedSymbol:8,Binding:9,Spread:10},o=new Set(Object.values(t));const c=new Set(["UserDefined","Partial","Comp","Constantly","Juxt","Complement","EveryPred","SomePred","Fnull","EffectMatcher","Builtin","SpecialBuiltin","Module"]);const l="^^fn^^",i="^^re^^",r="^^ef^^";function a(e){return null!==e&&"object"==typeof e&&(l in e&&"functionType"in e&&("string"==typeof(n=e.functionType)&&c.has(n)));var n}function u(e){return!(!Array.isArray(e)||e.length<2)&&("number"==typeof(n=e[0])&&o.has(n));var n}function s(e){return a(e)?`<function ${e.name||"λ"}>`:u(e)?`${n=e[0],Object.keys(t).find(e=>t[e]===n)}-node`:null===e?"null":"object"==typeof e&&e instanceof RegExp?`${e}`:"object"==typeof e&&e instanceof Error?e.toString():JSON.stringify(e);var n}function d(e,n){return e?.sourceCodeInfo??n}function p(e,t,o){return new n(`Expected ${e}, got ${s(t)}.`,d(t,o))}function f(e){return!(null===e||"object"!=typeof e||Array.isArray(e)||e instanceof RegExp||function(e){return null!==e&&"object"==typeof e&&!!e[l]}(e)||(n=e,null!==n&&"object"==typeof n&&n[i])||function(e){return null!==e&&"object"==typeof e&&!!e[r]}(e));var n}function m(e){return function(e){return Array.isArray(e)||"string"==typeof e}(e)||f(e)}function h(e,n){return y(e,n),e}function y(e,n){if(!m(e))throw p("string, array or object",e,n)}function g(e,n={}){return"number"==typeof e&&(!Number.isNaN(e)&&(!(n.integer&&!Number.isInteger(e))&&(!(n.finite&&!Number.isFinite(e))&&((!n.zero||0===e)&&((!n.nonZero||0!==e)&&(!(n.positive&&e<=0)&&(!(n.negative&&e>=0)&&(!(n.nonPositive&&e>0)&&(!(n.nonNegative&&e<0)&&(!("number"==typeof n.gt&&e<=n.gt)&&(!("number"==typeof n.gte&&e<n.gte)&&(!("number"==typeof n.lt&&e>=n.lt)&&!("number"==typeof n.lte&&e>n.lte)))))))))))))}function v(e,t,o={}){if(!g(e,o))throw new n(`Expected ${function(e){if(e.zero)return"zero";const n=function(e){return e.positive?"positive":e.negative?"negative":e.nonNegative?"non negative":e.nonPositive?"non positive":e.nonZero?"non zero":""}(e),t=e.integer?"integer":"number",o=e.finite?"finite":"",c=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[n,o,t,c].filter(e=>!!e).join(" ")}(o)}, got ${s(e)}.`,d(e,t))}function b(e,n,t={}){if(!function(e,n={}){return!("string"!=typeof e||n.nonEmpty&&0===e.length||n.char&&1!==e.length)}(e,t))throw p(""+(t.nonEmpty?"non empty string":t.char?"character":"string"),e,n)}function x(e,n){return k(e,n),e}function k(e,n){if(!function(e){return"string"==typeof e||"number"==typeof e}(e))throw p("string or number",e,n)}function $(e,n){return!!m(e)&&("string"==typeof e||Array.isArray(e)?!!g(n,{integer:!0})&&(n>=0&&n<e.length):!!Object.getOwnPropertyDescriptor(e,n))}function w(e){return e??null}function A(e){return f(e)?Object.entries(e).reduce((e,n)=>{const[t,o]=n;return e[t]=A(o),e},{}):Array.isArray(e)?e.map(e=>A(e)):e}function E(e){return A(e)}function j(e,n){if(!Array.isArray(e))throw p("array",e,n)}function N(e){return{min:e,max:e}}function T(e,n){if(f(e)){if("string"==typeof n&&$(e,n))return w(e[n])}else if(g(n,{nonNegative:!0,integer:!0})&&n>=0&&n<e.length)return w(e[n])}function D(e,n,t,o){if(y(e,o),Array.isArray(e)||"string"==typeof e){if(v(n,o,{integer:!0}),v(n,o,{gte:0}),v(n,o,{lte:e.length}),"string"==typeof e)return b(t,o,{char:!0}),`${e.slice(0,n)}${t}${e.slice(n+1)}`;const c=[...e];return c[n]=t,c}b(n,o);const c={...e};return c[n]=t,c}function R(e,n,t){const o=E(e);return{coll:o,innerCollMeta:n.slice(0,n.length-1).reduce((e,n)=>{const o=e.coll;let c;return Array.isArray(o)?(v(n,t),c=h(o[n],t)):(!function(e,n){if(!f(e))throw p("object",e,n)}(o,t),b(n,t),$(e.coll,n)||(o[n]={}),c=h(o[n],t)),{coll:c,parent:o}},{coll:o,parent:{}})}}const C={"get-in":{evaluate:(e,n)=>{let t=w(e[0]);const o=e[1]??[],c=w(e[2]);j(o,n);for(const e of o){if(k(e,n),!m(t))return c;{const n=T(t,e);if(void 0===n)return c;t=n}}return t},arity:{min:2,max:3},docs:{category:"collection",returns:{type:"any"},args:{a:{type:"collection"},b:{type:"array"},"not-found":{type:"any"}},variants:[{argumentNames:["a","b"]},{argumentNames:["a","b","not-found"]}],description:"Returns the value in a nested collection, where $b is an array of keys. Returns $not-found if the key is not present. If $not-found is not set, `null` is returned.",seeAlso:["get","collection.assoc-in","collection.update-in"],examples:['\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: "Kalle" }, 6]],\n  [1, 1, "a", 0]\n)','\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: "Kalle" }, 6]],\n  [1, 1, "b", 0]\n)','\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: "Kalle" }, 6]],\n  [1, 1, "b", 0],\n  "Lisa"\n)']}},"assoc-in":{evaluate:([e,n,t],o)=>{if(y(e,o),j(n,o),function(e,n){if(!function(e){return void 0!==e}(e))throw p("not undefined",e,n)}(t,o),1===n.length)return k(n[0],o),D(e,n[0],t,o);const{coll:c,innerCollMeta:l}=R(e,n,o),i=x(n[n.length-1],o),r=x(n[n.length-2],o);return Array.isArray(l.parent)?(v(r,o),l.parent[r]=D(l.coll,i,t,o)):(b(r,o),l.parent[r]=D(l.coll,i,t,o)),c},arity:N(3),docs:{category:"collection",returns:{type:"collection"},args:{coll:{type:"collection"},ks:{type:["number","string"],array:!0},value:{type:"any"}},variants:[{argumentNames:["coll","ks","value"]}],description:"\nAssociates a value in the nested collection $coll, where $ks is an array of keys and $value is the new value.\n\nIf any levels do not exist, objects will be created - and the corresponding keys must be of type string.",seeAlso:["assoc","collection.get-in","collection.update-in"],examples:['\nlet cu = import(collection);\ncu.assoc-in(\n  {},\n  ["a", "b", "c"],\n  "Albert"\n)','\nlet cu = import(collection);\ncu.assoc-in(\n  [1, 2, [1, 2, 3]],\n  [2, 1],\n  "Albert"\n)','\nlet cu = import(collection);\ncu.assoc-in(\n  [1, 2, { name: "albert" }],\n  [2, "name", 0],\n  "A"\n)']}},update:{evaluate:()=>{throw new Error("update: Dvala implementation should be used instead")},arity:{min:3},docs:{category:"collection",returns:{type:"collection"},args:{coll:{type:"collection"},key:{type:["string","number"]},fun:{type:"function"},"fun-args":{type:"any",rest:!0}},variants:[{argumentNames:["coll","key","fun"]},{argumentNames:["coll","key","fun","fun-args"]}],description:"\nUpdates a value in the $coll collection, where $key is a key. $fun is a function\nthat will take the old value and any supplied $fun-args and\nreturn the new value.\nIf the key does not exist, `null` is passed as the old value.",seeAlso:["collection.update-in","assoc"],examples:['\nlet cu = import(collection);\nlet x = { a: 1, b: 2 };\ncu.update(x, "a", inc)','\nlet cu = import(collection);\nlet x = { a: 1, b: 2 };\ncu.update(\n  x,\n  "c",\n  val -> null?(val) ? 0 : inc(val)\n)']}},"update-in":{evaluate:()=>{throw new Error("update-in: Dvala implementation should be used instead")},arity:{min:3},docs:{category:"collection",returns:{type:"collection"},args:{coll:{type:"collection"},ks:{type:"array"},fun:{type:"function"},"fun-args":{type:"any",rest:!0}},variants:[{argumentNames:["coll","ks","fun"]},{argumentNames:["coll","ks","fun","fun-args"]}],description:"Updates a value in the $coll collection, where $ks is an array of\nkeys and $fun is a function that will take the old value and\nany supplied $fun-args and return the new value. If any levels do not exist,\nobjects will be created - and the corresponding keys must be of type string.",seeAlso:["collection.update","collection.assoc-in","collection.get-in"],examples:['\nlet cu = import(collection);\ncu.update-in(\n  { a: [1, 2, 3] },\n  ["a", 1],\n  -> null?($) ? 0 : inc($)\n)','\nlet cu = import(collection);\ncu.update-in(\n  { a: { foo: "bar"} },\n  ["a", "foo"],\n  -> null?($) ? "?" : "!"\n)','\nlet cu = import(collection);\ncu.update-in(\n  { a: { foo: "bar"} },\n  ["a", "baz"],\n  -> null?($) ? "?" : "!"\n)','\nlet cu = import(collection);\ncu.update-in(\n  { a: [1, 2, 3] },\n  ["a", 1],\n  *,\n  10,\n  10,\n  10,\n)']}},filteri:{evaluate:()=>{throw new Error("filteri: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"collection"},args:{a:{type:"collection"},b:{type:"function",description:"The function to call for each element in the collection. The function should take two arguments: the element itself and the index."}},variants:[{argumentNames:["a","b"]}],description:"Creates a new collection with all elements that pass the test implemented by $b. The function is called for each element in the collection, and it should take two arguments: the element itself and the index.",seeAlso:["filter","collection.mapi"],examples:["let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> i % 2 == 0)","let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> x % 2 == 0)","let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> x + i > 3)"]}},mapi:{evaluate:()=>{throw new Error("mapi: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"collection"},args:{a:{type:"collection"},b:{type:"function",description:"The function to call for each element in the collection. The function should take two arguments: the element itself and the index."}},variants:[{argumentNames:["a","b"]}],description:"Creates a new collection populated with the results of calling $b on every element in $a. The function is called for each element in the collection, and it should take two arguments: the element itself and the index.",seeAlso:["map","collection.filteri"],examples:["let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x + i)","let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x * i)","let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x - i)","let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x / i)","let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x % inc(i))"]}},reducei:{evaluate:()=>{throw new Error("reducei: Dvala implementation should be used instead")},arity:N(3),docs:{category:"collection",returns:{type:"any"},args:{coll:{type:"collection"},fun:{type:"function",description:"The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index."},initial:{type:"any",description:"The initial value to use as the accumulator."}},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. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.",seeAlso:["reduce","collection.reducei-right","collection.reductionsi"],examples:["let cu = import(collection); cu.reducei([1, 2, 3], (acc, x, i) -> acc + x + i, 0)",'let cu = import(collection); cu.reducei("Albert", (acc, x, i) -> acc ++ x ++ i, "")','let cu = import(collection); cu.reducei({ a: 1, b: 2 }, -> $1 ++ $3, "")']}},"reduce-right":{evaluate:()=>{throw new Error("reduce-right: Dvala implementation should be used instead")},arity:N(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 (starting from the last item), 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:["reduce","collection.reducei-right"],examples:['let cu = import(collection); cu.reduce-right(["A", "B", "C"], str, "")',"let cu = import(collection); cu.reduce-right({ a: 1, b: 2 }, +, 0)"]}},"reducei-right":{evaluate:()=>{throw new Error("reducei-right: Dvala implementation should be used instead")},arity:N(3),docs:{category:"collection",returns:{type:"any"},args:{coll:{type:"collection"},fun:{type:"function",description:"The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index."},initial:{type:"any",description:"The initial value to use as the accumulator."}},variants:[{argumentNames:["coll","fun","initial"]}],description:"Runs $fun function on each element of the $coll (starting from the last item), 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. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.",seeAlso:["collection.reducei","collection.reduce-right"],examples:["let cu = import(collection); cu.reducei-right([1, 2, 3], (acc, x, i) -> acc + x + i, 0)",'let cu = import(collection); cu.reducei-right("Albert", (acc, x, i) -> acc ++ x ++ i, "")','let cu = import(collection); cu.reducei-right({ a: 1, b: 2 }, -> $1 ++ $3, "")']}},reductions:{evaluate:()=>{throw new Error("reductions: Dvala implementation should be used instead")},arity:N(3),docs:{category:"collection",returns:{type:"any",array:!0},args:{fun:{type:"function"},coll:{type:"collection"},initial:{type:"any"}},variants:[{argumentNames:["coll","fun","initial"]}],description:"Returns an array of the intermediate values of the reduction (see `reduce`) of $coll by $fun.",seeAlso:["reduce","collection.reductionsi"],examples:["let cu = import(collection); cu.reductions([1, 2, 3], +, 0)","let cu = import(collection); cu.reductions([1, 2, 3], +, 10)","let cu = import(collection); cu.reductions([], +, 0)","let cu = import(collection); cu.reductions({ a: 1, b: 2 }, +, 0)","\nlet cu = import(collection);\ncu.reductions(\n  [1, 2, 3, 4, 5, 6, 7, 8, 9],\n  (result, value) -> result + (even?(value) ? value : 0),\n  0\n)"]}},reductionsi:{evaluate:()=>{throw new Error("reductionsi: Dvala implementation should be used instead")},arity:N(3),docs:{category:"collection",returns:{type:"any",array:!0},args:{coll:{type:"collection"},fun:{type:"function",description:"The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index."},initial:{type:"any",description:"The initial value to use as the accumulator."}},variants:[{argumentNames:["coll","fun","initial"]}],description:"Returns an array of the intermediate values of the reduction (see `reduce`) of $coll by $fun. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.",seeAlso:["collection.reductions","collection.reducei"],examples:["let cu = import(collection); cu.reductionsi([1, 2, 3], (acc, x, i) -> acc + x + i, 0)",'let cu = import(collection); cu.reductionsi("Albert", (acc, x, i) -> acc ++ x ++ i, "")','let cu = import(collection); cu.reductionsi({ a: 1, b: 2 }, -> $1 ++ $3, "")']}},"not-empty":{evaluate:([e],n)=>null===e?null:(y(e,n),"string"==typeof e||Array.isArray(e)?e.length>0?e:null:Object.keys(e).length>0?e:null),arity:N(1),docs:{category:"collection",returns:{type:"any"},args:{coll:{type:["collection","null"]}},variants:[{argumentNames:["coll"]}],description:"Returns `null` if $coll is empty or `null`, otherwise $coll.",seeAlso:["empty?","not-empty?"],examples:["let cu = import(collection); cu.not-empty([])","let cu = import(collection); cu.not-empty([1, 2, 3])","let cu = import(collection); cu.not-empty({})","let cu = import(collection); cu.not-empty({ a: 2 })",'let cu = import(collection); cu.not-empty("")','let cu = import(collection); cu.not-empty("Albert")',"let cu = import(collection); cu.not-empty(null)"]}},"every?":{evaluate:()=>{throw new Error("every?: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"boolean"},args:{a:{type:"collection"},b:{type:"function"}},variants:[{argumentNames:["a","b"]}],description:"Returns `true` if all entries in $a pass the test implemented by $b, otherwise returns `false`.",seeAlso:["collection.any?","collection.not-every?","collection.not-any?","functional.every-pred","grid.cell-every?"],examples:["let cu = import(collection); cu.every?([1, 2, 3], number?)","let cu = import(collection); cu.every?([1, 2, 3], even?)",'\nlet cu = import(collection);\ncu.every?(\n  ["Albert", "Mojir", 160, [1, 2]],\n  string?,\n)',"\nlet cu = import(collection);\ncu.every?(\n  [50, 100, 150, 200],\n  -> $ > 10,\n)","let cu = import(collection); cu.every?([], number?)",'let cu = import(collection); cu.every?("", number?)',"let cu = import(collection); cu.every?({}, number?)","\nlet cu = import(collection);\ncu.every?(\n  { a: 2, b: 4},\n  -> even?(second($))\n)","\nlet cu = import(collection);\ncu.every?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)"]}},"any?":{evaluate:()=>{throw new Error("any?: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"boolean"},args:{a:{type:"collection"},b:{type:"function"}},variants:[{argumentNames:["a","b"]}],description:"Returns `true` if any element in $a pass the test implemented by $b, otherwise returns `false`.",seeAlso:["collection.every?","collection.not-any?","collection.not-every?","functional.some-pred","some","grid.some?"],examples:['\nlet cu = import(collection);\ncu.any?(\n  ["Albert", "Mojir", 160, [1, 2]],\n  string?\n)',"\nlet cu = import(collection);\ncu.any?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)","let cu = import(collection); cu.any?([], number?)",'let cu = import(collection); cu.any?("", number?)',"let cu = import(collection); cu.any?({}, number?)","\nlet cu = import(collection);\ncu.any?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)","\nlet cu = import(collection);\ncu.any?(\n  { a: 1, b: 3 },\n  -> even?(second($))\n)"]}},"not-any?":{evaluate:()=>{throw new Error("not-any?: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"boolean"},args:{a:{type:"collection"},b:{type:"function"}},variants:[{argumentNames:["a","b"]}],description:"Returns `false` if any element in $a pass the test implemented by $b, otherwise returns `true`.",seeAlso:["collection.any?","collection.every?","collection.not-every?"],examples:['\nlet cu = import(collection);\ncu.not-any?(\n  ["Albert", "Mojir", 160, [1, 2]],\n  string?\n)',"\nlet cu = import(collection);\ncu.not-any?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)","let cu = import(collection); cu.not-any?([], number?)",'let cu = import(collection); cu.not-any?("", number?)',"let cu = import(collection); cu.not-any?({}, number?)","\nlet cu = import(collection);\ncu.not-any?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)","\nlet cu = import(collection);\ncu.not-any?(\n  { a: 1, b: 3 },\n  -> even?(second($))\n)"]}},"not-every?":{evaluate:()=>{throw new Error("not-every?: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"boolean"},args:{a:{type:"collection"},b:{type:"function"}},variants:[{argumentNames:["a","b"]}],description:"Returns `true` if at least one element in $a does not pass the test implemented by $b, otherwise returns `false`.",seeAlso:["collection.every?","collection.any?","collection.not-any?"],examples:['\nlet cu = import(collection);\ncu.not-every?(\n  ["Albert", "Mojir", 160, [1, 2]],\n  string?\n)',"\nlet cu = import(collection);\ncu.not-every?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)","let cu = import(collection); cu.not-every?([], number?)",'let cu = import(collection); cu.not-every?("", number?)',"let cu = import(collection); cu.not-every?({}, number?)","\nlet cu = import(collection);\ncu.not-every?(\n  { a: 2, b: 4 },\n  -> even?(second($))\n)","\nlet cu = import(collection);\ncu.not-every?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)"]}}},M={name:"collection",functions:C,source:'{\n  update: (coll, key, fn, ...extra-params) ->\n    assoc(coll, key, apply(fn, [get(coll, key), ...extra-params])),\n\n  update-in: (coll, ks, fn, ...extra-params) -> do\n    let k = first(ks);\n    if count(ks) == 1 then\n      assoc(coll, k, apply(fn, [get(coll, k), ...extra-params]))\n    else\n      let inner = get(coll, k);\n      let inner-coll = null?(inner) ? {} : inner;\n      assoc(coll, k, apply(self, [inner-coll, slice(ks, 1), fn, ...extra-params]))\n    end\n  end,\n\n  filteri: (coll, fn) -> do\n    cond\n      case array?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> [nth(coll, i), i],\n          (acc, pair) -> if fn(first(pair), second(pair)) then [...acc, first(pair)] else acc end,\n          []\n        )\n\n      case string?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> [nth(coll, i), i],\n          (acc, pair) -> if fn(first(pair), second(pair)) then ++(acc, first(pair)) else acc end,\n          ""\n        )\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) ->\n          if fn(coll(k), k) then assoc(acc, k, coll(k)) else acc end,\n          {}\n        )\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  mapi: (coll, fn) -> do\n    cond\n      case array?(coll) then\n        for (i in range(count(coll))) -> fn(nth(coll, i), i)\n\n      case string?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> fn(nth(coll, i), i),\n          (acc, ch) -> ++(acc, ch),\n          ""\n        )\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) ->\n          assoc(acc, k, fn(coll(k), k)),\n          {}\n        )\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  reducei: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        loop (acc = initial, i = 0) -> do\n          if i >= count(coll) then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i + 1)\n          end\n        end\n\n      case array?(coll) then\n        loop (acc = initial, i = 0) -> do\n          if i >= count(coll) then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i + 1)\n          end\n        end\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) -> fn(acc, coll(k), k), initial)\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  reduce-right: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        reduce(reverse(coll), fn, initial)\n\n      case array?(coll) then\n        reduce(reverse(coll), fn, initial)\n\n      case object?(coll) then\n        reduce(reverse(keys(coll)), (acc, k) -> fn(acc, coll(k)), initial)\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  reducei-right: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        let len = count(coll);\n        loop (acc = initial, i = len - 1) -> do\n          if i < 0 then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i - 1)\n          end\n        end\n\n      case array?(coll) then\n        let len = count(coll);\n        loop (acc = initial, i = len - 1) -> do\n          if i < 0 then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i - 1)\n          end\n        end\n\n      case object?(coll) then\n        reduce(reverse(keys(coll)), (acc, k) -> fn(acc, coll(k), k), initial)\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  reductions: (coll, fn, initial) -> do\n    let items = cond\n      case string?(coll) then\n        if count(coll) == 0 then [] else for (i in range(count(coll))) -> nth(coll, i) end\n\n      case array?(coll) then coll\n\n      case object?(coll) then\n        for (k in keys(coll)) -> coll(k)\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end;\n    if count(items) == 0 then\n      [initial]\n    else\n      reduce(items, (acc, elem) -> do\n        let prev = last(acc);\n        [...acc, fn(prev, elem)]\n      end, [initial])\n    end\n  end,\n\n  reductionsi: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then do\n        if count(coll) == 0 then\n          [initial]\n        else\n          reduce(\n            for (i in range(count(coll))) -> [nth(coll, i), i],\n            (acc, pair) -> do\n              let prev = last(acc);\n              [...acc, fn(prev, first(pair), second(pair))]\n            end,\n            [initial]\n          )\n        end\n      end\n\n      case array?(coll) then do\n        if count(coll) == 0 then\n          [initial]\n        else\n          reduce(\n            for (i in range(count(coll))) -> [nth(coll, i), i],\n            (acc, pair) -> do\n              let prev = last(acc);\n              [...acc, fn(prev, first(pair), second(pair))]\n            end,\n            [initial]\n          )\n        end\n      end\n\n      case object?(coll) then do\n        let ks = keys(coll);\n        if count(ks) == 0 then\n          [initial]\n        else\n          reduce(ks, (acc, k) -> do\n            let prev = last(acc);\n            [...acc, fn(prev, coll(k), k)]\n          end, [initial])\n        end\n      end\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  "every?": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), "Expected collection")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then true\n        case not(fn(nth(items, i))) then false\n        case true then recur(i + 1)\n      end\n  end,\n\n  "any?": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), "Expected collection")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then false\n        case fn(nth(items, i)) then true\n        case true then recur(i + 1)\n      end\n  end,\n\n  "not-any?": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), "Expected collection")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then true\n        case fn(nth(items, i)) then false\n        case true then recur(i + 1)\n      end\n  end,\n\n  "not-every?": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), "Expected collection")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then false\n        case not(fn(nth(items, i))) then true\n        case true then recur(i + 1)\n      end\n  end\n}',docs:(S=C,Object.fromEntries(Object.entries(S).map(([e,n])=>{if(!n.docs)throw new Error(`Missing docs for function "${e}"`);return[e,n.docs]})))};var S;export{M as collectionUtilsModule};
-//# sourceMappingURL=collection.esm.js.map

package/dist/modules/collection.esm.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"collection.esm.js","sources":["../../src/utils/debug/getCodeMarker.ts","../../src/errors.ts","../../src/constants/constants.ts","../../src/utils/symbols.ts","../../src/utils/debug/debugTools.ts","../../src/utils/debug/getSourceCodeInfo.ts","../../src/utils/getAssertionError.ts","../../src/typeGuards/dvala.ts","../../src/typeGuards/dvalaFunction.ts","../../src/typeGuards/number.ts","../../src/typeGuards/string.ts","../../src/utils/index.ts","../../src/typeGuards/array.ts","../../src/utils/arity.ts","../../src/builtin/modules/collection/index.ts","../../src/builtin/modules/collection/collection.dvala","../../src/builtin/modules/interface.ts"],"sourcesContent":["import type { SourceCodeInfo } from '../../tokenizer/token'\n\nexport function getCodeMarker(sourceCodeInfo: SourceCodeInfo): string {\n  if (!sourceCodeInfo.position || !sourceCodeInfo.code)\n    return ''\n\n  const leftPadding = sourceCodeInfo.position.column - 1\n  const rightPadding = sourceCodeInfo.code.length - leftPadding - 1\n  return `${' '.repeat(Math.max(leftPadding, 0))}^${' '.repeat(Math.max(rightPadding, 0))}`\n}\n","import { getCodeMarker } from '../src/utils/debug/getCodeMarker'\nimport type { Arr } from './interface'\nimport type { SourceCodeInfo } from './tokenizer/token'\n\nfunction getDvalaErrorMessage(message: string, sourceCodeInfo?: SourceCodeInfo) {\n  if (!sourceCodeInfo) {\n    return message\n  }\n  const location = `${sourceCodeInfo.position.line}:${sourceCodeInfo.position.column}`\n  const filePathLine = sourceCodeInfo.filePath\n    ? `\\n${sourceCodeInfo.filePath}:${location}`\n    : `\\nLocation ${location}`\n  const codeLine = `\\n${sourceCodeInfo.code}`\n  const codeMarker = `\\n${getCodeMarker(sourceCodeInfo)}`\n  return `${message}${filePathLine}${codeLine}${codeMarker}`\n}\n\nexport class RecurSignal extends Error {\n  public params: Arr\n  constructor(params: Arr) {\n    super(`recur, params: ${params}`)\n    Object.setPrototypeOf(this, RecurSignal.prototype)\n    this.name = 'RecurSignal'\n    this.params = params\n  }\n}\n\nexport class DvalaError extends Error {\n  public readonly sourceCodeInfo?: SourceCodeInfo\n  public readonly shortMessage: string\n  constructor(err: unknown, sourceCodeInfo: SourceCodeInfo | undefined) {\n    const message = err instanceof Error\n      ? err.message\n      : `${err}`\n\n    super(getDvalaErrorMessage(message, sourceCodeInfo))\n    this.shortMessage = message\n    this.sourceCodeInfo = sourceCodeInfo\n    Object.setPrototypeOf(this, DvalaError.prototype)\n    this.name = 'DvalaError'\n  }\n\n  public getCodeMarker(): string | undefined {\n    return this.sourceCodeInfo && getCodeMarker(this.sourceCodeInfo)\n  }\n}\n\nexport class UserDefinedError extends DvalaError {\n  public userMessage: string\n  constructor(message: string, sourceCodeInfo?: SourceCodeInfo) {\n    super(message, sourceCodeInfo)\n    this.userMessage = message\n    Object.setPrototypeOf(this, UserDefinedError.prototype)\n    this.name = 'UserDefinedError'\n  }\n}\n\nexport class AssertionError extends DvalaError {\n  constructor(message: string | Error, sourceCodeInfo?: SourceCodeInfo) {\n    super(message, sourceCodeInfo)\n    Object.setPrototypeOf(this, AssertionError.prototype)\n    this.name = 'AssertionError'\n  }\n}\n\nexport class UndefinedSymbolError extends DvalaError {\n  public symbol: string\n  constructor(symbolName: string, sourceCodeInfo?: SourceCodeInfo) {\n    const message = `Undefined symbol '${symbolName}'.`\n    super(message, sourceCodeInfo)\n    this.symbol = symbolName\n    Object.setPrototypeOf(this, UndefinedSymbolError.prototype)\n    this.name = 'UndefinedSymbolError'\n  }\n}\n\nexport function isDvalaError(error: unknown): error is DvalaError {\n  return error instanceof DvalaError\n}\n","export const NodeTypes = {\n  Number: 1,\n  String: 2,\n  NormalExpression: 3,\n  SpecialExpression: 4,\n  UserDefinedSymbol: 5,\n  NormalBuiltinSymbol: 6,\n  SpecialBuiltinSymbol: 7,\n  ReservedSymbol: 8,\n  Binding: 9,\n  Spread: 10,\n} as const\n\nconst NodeTypesSet = new Set(Object.values(NodeTypes))\n\nexport type NodeType = typeof NodeTypes[keyof typeof NodeTypes]\n\nexport function getNodeTypeName(type: NodeType): keyof typeof NodeTypes {\n  return Object.keys(NodeTypes).find(key => NodeTypes[key as keyof typeof NodeTypes] === type) as keyof typeof NodeTypes\n}\n\n// TODO, is this needed?\nexport function isNodeType(type: unknown): type is NodeType {\n  return typeof type === 'number' && NodeTypesSet.has(type as NodeType)\n}\n\nconst functionTypes = [\n  'UserDefined',\n  'Partial',\n  'Comp',\n  'Constantly',\n  'Juxt',\n  'Complement',\n  'EveryPred',\n  'SomePred',\n  'Fnull',\n  'EffectMatcher',\n  'Builtin',\n  'SpecialBuiltin',\n  'Module',\n] as const\n\nconst functionTypeSet = new Set(functionTypes)\n\nexport type FunctionType = typeof functionTypes[number]\n\nexport function isFunctionType(type: unknown): type is FunctionType {\n  return typeof type === 'string' && functionTypeSet.has(type as FunctionType)\n}\n","export const FUNCTION_SYMBOL = '^^fn^^'\nexport const REGEXP_SYMBOL = '^^re^^'\nexport const EFFECT_SYMBOL = '^^ef^^'\n","import { getNodeTypeName, isFunctionType, isNodeType } from '../../constants/constants'\nimport type { AstNode, DvalaFunction } from '../../parser/types'\nimport { FUNCTION_SYMBOL } from '../symbols'\n\nfunction isDvalaFunction(func: unknown): func is DvalaFunction {\n  if (func === null || typeof func !== 'object')\n    return false\n\n  return FUNCTION_SYMBOL in func && 'functionType' in func && isFunctionType(func.functionType)\n}\n\nfunction isNode(value: unknown): value is AstNode {\n  if (!Array.isArray(value) || value.length < 2)\n    return false\n  return isNodeType(value[0])\n}\n\nexport function valueToString(value: unknown): string {\n  if (isDvalaFunction(value))\n    // eslint-disable-next-line ts/no-unsafe-member-access\n    return `<function ${(value as any).name || '\\u03BB'}>`\n\n  if (isNode(value))\n    return `${getNodeTypeName(value[0])}-node`\n\n  if (value === null)\n    return 'null'\n\n  if (typeof value === 'object' && value instanceof RegExp)\n    return `${value}`\n\n  if (typeof value === 'object' && value instanceof Error)\n    return value.toString()\n\n  return JSON.stringify(value)\n}\n","import type { SourceCodeInfo } from '../../tokenizer/token'\n\nexport function getSourceCodeInfo(anyValue: any, sourceCodeInfo: SourceCodeInfo | undefined): SourceCodeInfo | undefined {\n  // eslint-disable-next-line ts/no-unsafe-return, ts/no-unsafe-member-access\n  return anyValue?.sourceCodeInfo ?? sourceCodeInfo\n}\n","import { DvalaError } from '../errors'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { valueToString } from './debug/debugTools'\nimport { getSourceCodeInfo } from './debug/getSourceCodeInfo'\n\nexport function getAssertionError(typeName: string, value: unknown, sourceCodeInfo?: SourceCodeInfo): DvalaError {\n  return new DvalaError(`Expected ${typeName}, got ${valueToString(value)}.`, getSourceCodeInfo(value, sourceCodeInfo))\n}\n","import type { Any, Coll, Obj, Seq } from '../interface'\nimport type { EffectRef, FunctionLike, RegularExpression } from '../parser/types'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { getAssertionError } from '../utils/getAssertionError'\nimport { EFFECT_SYMBOL, REGEXP_SYMBOL } from '../utils/symbols'\nimport { isDvalaFunction } from './dvalaFunction'\n\nexport function isAny(value: unknown): value is Any {\n  // TODO weak test\n  return value !== undefined\n}\nexport function asAny(value: unknown, sourceCodeInfo?: SourceCodeInfo): Any {\n  assertAny(value, sourceCodeInfo)\n  return value\n}\nexport function assertAny(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is Any {\n  if (!isAny(value))\n    throw getAssertionError('not undefined', value, sourceCodeInfo)\n}\n\nexport function isSeq(value: unknown): value is Seq {\n  return Array.isArray(value) || typeof value === 'string'\n}\nexport function asSeq(value: unknown, sourceCodeInfo?: SourceCodeInfo): Seq {\n  assertSeq(value, sourceCodeInfo)\n  return value\n}\nexport function assertSeq(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is Seq {\n  if (!isSeq(value))\n    throw getAssertionError('string or array', value, sourceCodeInfo)\n}\n\nexport function isObj(value: unknown): value is Obj {\n  return !(\n    value === null\n    || typeof value !== 'object'\n    || Array.isArray(value)\n    || value instanceof RegExp\n    || isDvalaFunction(value)\n    || isRegularExpression(value)\n    || isEffect(value)\n  )\n}\nexport function asObj(value: unknown, sourceCodeInfo?: SourceCodeInfo): Obj {\n  assertObj(value, sourceCodeInfo)\n  return value\n}\nexport function assertObj(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is Obj {\n  if (!isObj(value))\n    throw getAssertionError('object', value, sourceCodeInfo)\n}\n\nexport function isColl(value: unknown): value is Coll {\n  return isSeq(value) || isObj(value)\n}\nexport function asColl(value: unknown, sourceCodeInfo?: SourceCodeInfo): Coll {\n  assertColl(value, sourceCodeInfo)\n  return value\n}\nexport function assertColl(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is Coll {\n  if (!isColl(value))\n    throw getAssertionError('string, array or object', value, sourceCodeInfo)\n}\n\nexport function isRegularExpression(regexp: unknown): regexp is RegularExpression {\n  if (regexp === null || typeof regexp !== 'object')\n    return false\n\n  return !!(regexp as RegularExpression)[REGEXP_SYMBOL]\n}\nexport function asRegularExpression(value: unknown, sourceCodeInfo?: SourceCodeInfo): RegularExpression {\n  assertRegularExpression(value, sourceCodeInfo)\n  return value\n}\nexport function assertRegularExpression(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): asserts value is RegularExpression {\n  if (!isRegularExpression(value))\n    throw getAssertionError('RegularExpression', value, sourceCodeInfo)\n}\n\nexport function isStringOrRegularExpression(value: unknown): value is string | RegularExpression {\n  return isRegularExpression(value) || typeof value === 'string'\n}\nexport function asStringOrRegularExpression(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): string | RegularExpression {\n  assertStringOrRegularExpression(value, sourceCodeInfo)\n  return value\n}\nexport function assertStringOrRegularExpression(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): asserts value is string | RegularExpression {\n  if (!isStringOrRegularExpression(value))\n    throw getAssertionError('string or RegularExpression', value, sourceCodeInfo)\n}\n\nexport function isEffect(value: unknown): value is EffectRef {\n  if (value === null || typeof value !== 'object')\n    return false\n\n  return !!(value as EffectRef)[EFFECT_SYMBOL]\n}\nexport function asEffect(value: unknown, sourceCodeInfo?: SourceCodeInfo): EffectRef {\n  assertEffect(value, sourceCodeInfo)\n  return value\n}\nexport function assertEffect(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): asserts value is EffectRef {\n  if (!isEffect(value))\n    throw getAssertionError('Effect', value, sourceCodeInfo)\n}\n\nfunction isFunctionLike(value: unknown): value is FunctionLike {\n  if (typeof value === 'number')\n    return true\n  if (isColl(value))\n    return true\n  if (isDvalaFunction(value))\n    return true\n\n  return false\n}\nexport function asFunctionLike(value: unknown, sourceCodeInfo?: SourceCodeInfo): FunctionLike {\n  assertFunctionLike(value, sourceCodeInfo)\n  return value\n}\nexport function assertFunctionLike(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is FunctionLike {\n  if (!isFunctionLike(value))\n    throw getAssertionError('FunctionLike', value, sourceCodeInfo)\n}\n","import type { DvalaFunction, NormalBuiltinFunction, UserDefinedFunction } from '../parser/types'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { getAssertionError } from '../utils/getAssertionError'\nimport { FUNCTION_SYMBOL } from '../utils/symbols'\nimport { isUnknownRecord } from '.'\n\nexport function isDvalaFunction(value: unknown): value is DvalaFunction {\n  if (value === null || typeof value !== 'object')\n    return false\n\n  return !!(value as DvalaFunction)[FUNCTION_SYMBOL]\n}\nexport function asDvalaFunction(value: unknown, sourceCodeInfo?: SourceCodeInfo): DvalaFunction {\n  assertDvalaFunction(value, sourceCodeInfo)\n  return value\n}\nexport function assertDvalaFunction(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is DvalaFunction {\n  if (!isDvalaFunction(value))\n    throw getAssertionError('DvalaFunction', value, sourceCodeInfo)\n}\n\nexport function isUserDefinedFunction(value: unknown): value is UserDefinedFunction {\n  return isDvalaFunction(value) && value.functionType === 'UserDefined'\n}\nexport function asUserDefinedFunction(value: unknown, sourceCodeInfo?: SourceCodeInfo): UserDefinedFunction {\n  assertUserDefinedFunction(value, sourceCodeInfo)\n  return value\n}\nexport function assertUserDefinedFunction(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): asserts value is UserDefinedFunction {\n  if (!isUserDefinedFunction(value))\n    throw getAssertionError('UserDefinedFunction', value, sourceCodeInfo)\n}\n\nexport function isBuiltinFunction(value: unknown): value is NormalBuiltinFunction {\n  return isUnknownRecord(value) && value.functionType === 'Builtin'\n}\n","import { DvalaError } from '../errors'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { valueToString } from '../utils/debug/debugTools'\nimport { getSourceCodeInfo } from '../utils/debug/getSourceCodeInfo'\n\ntype SignOptions =\n  | {\n    positive?: true\n    negative?: never\n    nonPositive?: never\n    nonNegative?: never\n    zero?: never\n    nonZero?: never\n  }\n  | {\n    positive?: never\n    negative?: true\n    nonPositive?: never\n    nonNegative?: never\n    zero?: never\n    nonZero?: never\n  }\n  | {\n    positive?: never\n    negative?: never\n    nonPositive?: true\n    nonNegative?: never\n    zero?: never\n    nonZero?: never\n  }\n  | {\n    positive?: never\n    negative?: never\n    nonPositive?: never\n    nonNegative?: true\n    zero?: never\n    nonZero?: never\n  }\n  | {\n    positive?: never\n    negative?: never\n    nonPositive?: never\n    nonNegative?: never\n    zero?: true\n    nonZero?: never\n  }\n  | {\n    positive?: never\n    negative?: never\n    nonPositive?: never\n    nonNegative?: never\n    zero?: never\n    nonZero?: true\n  }\n\ntype GtOptions =\n  | {\n    gt?: number\n    gte?: never\n  }\n  | {\n    gt?: never\n    gte?: number\n  }\n\ntype LtOptions =\n  | {\n    lt?: number\n    lte?: never\n  }\n  | {\n    lt?: never\n    lte?: number\n  }\n\ntype NumberOptions = {\n  integer?: true\n  finite?: true\n} & SignOptions &\nGtOptions &\nLtOptions\n\nfunction getRangeString(options: NumberOptions): string {\n  const hasUpperAndLowerBound\n    = (typeof options.gt === 'number' || typeof options.gte === 'number')\n      && (typeof options.lt === 'number' || typeof options.lte === 'number')\n  if (hasUpperAndLowerBound) {\n    return `${typeof options.gt === 'number' ? `${options.gt} < n ` : `${options.gte} <= n `}${\n      typeof options.lt === 'number' ? `< ${options.lt}` : `<= ${options.lte}`\n    }`\n  }\n  else if (typeof options.gt === 'number' || typeof options.gte === 'number') {\n    return `${typeof options.gt === 'number' ? `n > ${options.gt}` : `n >= ${options.gte}`}`\n  }\n  else if (typeof options.lt === 'number' || typeof options.lte === 'number') {\n    return `${typeof options.lt === 'number' ? `n < ${options.lt}` : `n <= ${options.lte}`}`\n  }\n  else { return '' }\n}\n\nfunction getSignString(options: NumberOptions): string {\n  return options.positive\n    ? 'positive'\n    : options.negative\n      ? 'negative'\n      : options.nonNegative\n        ? 'non negative'\n        : options.nonPositive\n          ? 'non positive'\n          : options.nonZero\n            ? 'non zero'\n            : ''\n}\n\nfunction getNumberTypeName(options: NumberOptions): string {\n  if (options.zero)\n    return 'zero'\n\n  const sign = getSignString(options)\n  const numberType = options.integer ? 'integer' : 'number'\n  const finite = options.finite ? 'finite' : ''\n  const range = getRangeString(options)\n\n  return [sign, finite, numberType, range].filter(x => !!x).join(' ')\n}\n\nexport function isNumber(value: unknown, options: NumberOptions = {}): value is number {\n  if (typeof value !== 'number')\n    return false\n\n  if (Number.isNaN(value))\n    return false\n\n  if (options.integer && !Number.isInteger(value))\n    return false\n\n  if (options.finite && !Number.isFinite(value))\n    return false\n\n  if (options.zero && value !== 0)\n    return false\n\n  if (options.nonZero && value === 0)\n    return false\n\n  if (options.positive && value <= 0)\n    return false\n\n  if (options.negative && value >= 0)\n    return false\n\n  if (options.nonPositive && value > 0)\n    return false\n\n  if (options.nonNegative && value < 0)\n    return false\n\n  if (typeof options.gt === 'number' && value <= options.gt)\n    return false\n\n  if (typeof options.gte === 'number' && value < options.gte)\n    return false\n\n  if (typeof options.lt === 'number' && value >= options.lt)\n    return false\n\n  if (typeof options.lte === 'number' && value > options.lte)\n    return false\n\n  return true\n}\n\nexport function assertNumber(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n  options: NumberOptions = {},\n): asserts value is number {\n  if (!isNumber(value, options)) {\n    throw new DvalaError(\n      `Expected ${getNumberTypeName(options)}, got ${valueToString(value)}.`,\n      getSourceCodeInfo(value, sourceCodeInfo),\n    )\n  }\n}\n\nexport function asNumber(\n  value: unknown,\n  sourceCodeInfo: SourceCodeInfo | undefined,\n  options: NumberOptions = {},\n): number {\n  assertNumber(value, sourceCodeInfo, options)\n  return value\n}\n","import type { SourceCodeInfo } from '../tokenizer/token'\nimport { getAssertionError } from '../utils/getAssertionError'\n\ntype StringAssertionOptions =\n  | {\n    nonEmpty?: true\n    char?: never\n  }\n  | {\n    nonEmpty?: never\n    char?: true\n  }\n\nexport function isString(value: unknown, options: StringAssertionOptions = {}): value is string {\n  if (typeof value !== 'string')\n    return false\n\n  if (options.nonEmpty && value.length === 0)\n    return false\n\n  if (options.char && value.length !== 1)\n    return false\n\n  return true\n}\n\nexport function assertString(\n  value: unknown,\n  sourceCodeInfo: SourceCodeInfo | undefined,\n  options: StringAssertionOptions = {},\n): asserts value is string {\n  if (!isString(value, options)) {\n    throw getAssertionError(\n      `${options.nonEmpty ? 'non empty string' : options.char ? 'character' : 'string'}`,\n      value,\n      sourceCodeInfo,\n    )\n  }\n}\n\nexport function asString(\n  value: unknown,\n  sourceCodeInfo: SourceCodeInfo | undefined,\n  options: StringAssertionOptions = {},\n): string {\n  assertString(value, sourceCodeInfo, options)\n  return value\n}\n\nexport function isStringOrNumber(value: unknown): value is string | number {\n  return typeof value === 'string' || typeof value === 'number'\n}\nexport function asStringOrNumber(value: unknown, sourceCodeInfo?: SourceCodeInfo): string | number {\n  assertStringOrNumber(value, sourceCodeInfo)\n  return value\n}\nexport function assertStringOrNumber(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): asserts value is string | number {\n  if (!isStringOrNumber(value))\n    throw getAssertionError('string or number', value, sourceCodeInfo)\n}\n","import type { Any, Coll, Obj } from '../interface'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { asAny, isColl, isObj, isRegularExpression } from '../typeGuards/dvala'\nimport { isNumber } from '../typeGuards/number'\nimport { asString, assertStringOrNumber } from '../typeGuards/string'\nimport { isUnknownRecord } from '../typeGuards'\nimport { DvalaError } from '../errors'\n\nexport function collHasKey(coll: unknown, key: string | number): boolean {\n  if (!isColl(coll))\n    return false\n\n  if (typeof coll === 'string' || Array.isArray(coll)) {\n    if (!isNumber(key, { integer: true }))\n      return false\n\n    return key >= 0 && key < coll.length\n  }\n  return !!Object.getOwnPropertyDescriptor(coll, key)\n}\n\nexport function compare<T extends string | number>(a: T, b: T, sourceCodeInfo: SourceCodeInfo | undefined): number {\n  assertStringOrNumber(a, sourceCodeInfo)\n  assertStringOrNumber(b, sourceCodeInfo)\n\n  if (typeof a === 'string' && typeof b === 'string') {\n    return a < b ? -1 : a > b ? 1 : 0\n  }\n  if (typeof a === 'number' && typeof b === 'number') {\n    return Math.sign((a) - (b))\n  }\n  throw new DvalaError(`Cannot compare values of different types: ${typeof a} and ${typeof b}`, sourceCodeInfo)\n}\n\nexport function deepEqual(a: unknown, b: unknown, sourceCodeInfo?: SourceCodeInfo): boolean {\n  if (a === b)\n    return true\n\n  if (typeof a === 'number' && typeof b === 'number')\n    return approxEqual(a, b)\n\n  if (Array.isArray(a) && Array.isArray(b)) {\n    if (a.length !== b.length)\n      return false\n\n    for (let i = 0; i < a.length; i += 1) {\n      if (!deepEqual(asAny(a[i], sourceCodeInfo), asAny(b[i], sourceCodeInfo), sourceCodeInfo))\n        return false\n    }\n    return true\n  }\n  if (isRegularExpression(a) && isRegularExpression(b))\n    return a.s === b.s && a.f === b.f\n\n  if (isUnknownRecord(a) && isUnknownRecord(b)) {\n    const aKeys = Object.keys(a)\n    const bKeys = Object.keys(b)\n    if (aKeys.length !== bKeys.length)\n      return false\n\n    for (let i = 0; i < aKeys.length; i += 1) {\n      const key = asString(aKeys[i], sourceCodeInfo)\n      if (!deepEqual(a[key], b[key], sourceCodeInfo))\n        return false\n    }\n    return true\n  }\n  return false\n}\n\nexport function toNonNegativeInteger(num: number): number {\n  return Math.max(0, Math.ceil(num))\n}\n\nexport function toAny(value: unknown): Any {\n  return (value ?? null) as Any\n}\n\nfunction clone<T>(value: T): T {\n  if (isObj(value)) {\n    return Object.entries(value).reduce((result: Obj, entry) => {\n      const [key, val] = entry\n      result[key] = clone(val)\n      return result\n    }, {}) as T\n  }\n  if (Array.isArray(value))\n    // eslint-disable-next-line ts/no-unsafe-return\n    return value.map(item => clone(item)) as unknown as T\n\n  return value\n}\n\nexport function cloneColl<T extends Coll>(value: T): T {\n  return clone(value)\n}\n\nexport function joinSets<T>(...results: Set<T>[]): Set<T> {\n  const result = new Set<T>()\n  for (const symbols of results)\n    symbols.forEach(symbol => result.add(symbol))\n\n  return result\n}\n\nexport function addToSet<T>(target: Set<T>, source: Set<T>): void {\n  source.forEach(symbol => target.add(symbol))\n}\n\nexport const EPSILON = 1e-10\n\nexport function approxEqual(a: number, b: number, epsilon: number = EPSILON): boolean {\n  if (a === b) {\n    return true\n  }\n\n  const diff = Math.abs(a - b)\n\n  if (a === 0 || b === 0 || diff < epsilon) {\n    // Use absolute error for values near zero\n    return diff < epsilon\n  }\n  const absA = Math.abs(a)\n  const absB = Math.abs(b)\n\n  // Use relative error for larger values\n  return diff / (absA + absB) < epsilon\n}\n\nexport function approxZero(value: number): boolean {\n  return Math.abs(value) < EPSILON\n}\n\nexport function smartTrim(str: string, minIndent = 0): string {\n  const lines = str.split('\\n')\n  while (lines[0]?.match(/^\\s*$/)) {\n    lines.shift() // Remove leading empty lines\n  }\n  while (lines[lines.length - 1]?.match(/^\\s*$/)) {\n    lines.pop() // Remove trailing empty lines\n  }\n  const indent = lines.reduce((acc, line) => {\n    if (line.match(/^\\s*$/))\n      return acc // Skip empty lines\n    const lineIndent = line.match(/^\\s*/)![0].length\n    return Math.min(acc, lineIndent)\n  }, Infinity)\n  return lines.map(line => ' '.repeat(minIndent) + line.slice(indent)).join('\\n').trimEnd()\n}\n","import type { SourceCodeInfo } from '../tokenizer/token'\nimport { getAssertionError } from '../utils/getAssertionError'\n\n// isArray not needed, use Array.isArary\nexport function asArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): unknown[] {\n  assertArray(value, sourceCodeInfo)\n  return value\n}\nexport function assertArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is unknown[] {\n  if (!Array.isArray(value))\n    throw getAssertionError('array', value, sourceCodeInfo)\n}\n\nexport function isStringArray(value: unknown): value is string[] {\n  return Array.isArray(value) && value.every(v => typeof v === 'string')\n}\nexport function asStringArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): string[] {\n  assertStringArray(value, sourceCodeInfo)\n  return value\n}\nexport function assertStringArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is string[] {\n  if (!isStringArray(value))\n    throw getAssertionError('array of strings', value, sourceCodeInfo)\n}\n\nexport function isCharArray(value: unknown): value is string[] {\n  return Array.isArray(value) && value.every(v => typeof v === 'string' && v.length === 1)\n}\nexport function asCharArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): string[] {\n  assertCharArray(value, sourceCodeInfo)\n  return value\n}\nexport function assertCharArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is string[] {\n  if (!isCharArray(value))\n    throw getAssertionError('array of strings', value, sourceCodeInfo)\n}\n","import type { Arity } from '../builtin/interface'\nimport { DvalaError } from '../errors'\nimport type { FunctionLike } from '../parser/types'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { isColl } from '../typeGuards/dvala'\nimport { valueToString } from './debug/debugTools'\n\nexport function arityAccepts(arity: Arity, nbrOfParams: number): boolean {\n  const { min, max } = arity\n  if (typeof min === 'number' && nbrOfParams < min) {\n    return false\n  }\n  if (typeof max === 'number' && nbrOfParams > max) {\n    return false\n  }\n  return true\n}\n\nexport function arityAcceptsMin(arity: Arity, nbrOfParams: number): boolean {\n  const { min } = arity\n  if (typeof min === 'number' && nbrOfParams < min) {\n    return false\n  }\n  return true\n}\n\nexport function getCommonArityFromFunctions(params: FunctionLike[]): Arity | null {\n  return params.reduce((acc: Arity | null, param): Arity | null => {\n    if (acc === null) {\n      return null\n    }\n    const arity: Arity = (typeof param === 'number' || isColl(param)) ? toFixedArity(1) : param.arity\n    const { min: aMin, max: aMax } = arity\n    const { min: bMin, max: bMax } = acc\n    const min = typeof aMin === 'number' && typeof bMin === 'number'\n      ? Math.max(aMin, bMin)\n      : typeof aMin === 'number' ? aMin : typeof bMin === 'number' ? bMin : undefined\n    const max = typeof aMax === 'number' && typeof bMax === 'number'\n      ? Math.min(aMax, bMax)\n      : typeof aMax === 'number' ? aMax : typeof bMax === 'number' ? bMax : undefined\n\n    if (typeof min === 'number' && typeof max === 'number' && min > max) {\n      return null\n    }\n\n    return { min, max }\n  }, {})\n}\n\nexport function getArityFromFunction(param: FunctionLike): Arity {\n  return (typeof param === 'number' || isColl(param)) ? toFixedArity(1) : param.arity\n}\n\nexport function assertNumberOfParams(arity: Arity, length: number, sourceCodeInfo: SourceCodeInfo | undefined): void {\n  const { min, max } = arity\n  if (typeof min === 'number' && length < min) {\n    throw new DvalaError(\n      `Wrong number of arguments, expected at least ${min}, got ${valueToString(length)}.`,\n      sourceCodeInfo,\n    )\n  }\n\n  if (typeof max === 'number' && length > max) {\n    throw new DvalaError(\n      `Wrong number of arguments, expected at most ${max}, got ${valueToString(length)}.`,\n      sourceCodeInfo,\n    )\n  }\n}\n\nexport function canBeOperator(count: Arity): boolean {\n  if (typeof count.max === 'number' && count.max < 2) {\n    return false\n  }\n\n  if (typeof count.min === 'number' && count.min > 2) {\n    return false\n  }\n\n  return true\n}\n\nexport function toFixedArity(arity: number): Arity {\n  return { min: arity, max: arity }\n}\n","import type { Any, Arr, Coll, Obj } from '../../../interface'\nimport type { SourceCodeInfo } from '../../../tokenizer/token'\nimport { cloneColl, collHasKey, toAny } from '../../../utils'\nimport { asColl, assertAny, assertColl, assertObj, isColl, isObj } from '../../../typeGuards/dvala'\nimport type { BuiltinNormalExpressions } from '../../interface'\nimport { assertArray } from '../../../typeGuards/array'\nimport { assertNumber, isNumber } from '../../../typeGuards/number'\nimport { asStringOrNumber, assertString, assertStringOrNumber } from '../../../typeGuards/string'\nimport { toFixedArity } from '../../../utils/arity'\nimport { moduleDocsFromFunctions } from '../interface'\nimport type { DvalaModule } from '../interface'\nimport collectionModuleSource from './collection.dvala'\n\n// --- Private helper: get value from collection by key ---\nfunction get(coll: Coll, key: string | number): Any | undefined {\n  if (isObj(coll)) {\n    if (typeof key === 'string' && collHasKey(coll, key))\n      return toAny(coll[key])\n  }\n  else {\n    if (isNumber(key, { nonNegative: true, integer: true }) && key >= 0 && key < coll.length)\n      return toAny(coll[key])\n  }\n  return undefined\n}\n\n// --- Private helper: assoc value into collection ---\nfunction assoc(coll: Coll, key: string | number, value: Any, sourceCodeInfo?: SourceCodeInfo) {\n  assertColl(coll, sourceCodeInfo)\n  if (Array.isArray(coll) || typeof coll === 'string') {\n    assertNumber(key, sourceCodeInfo, { integer: true })\n    assertNumber(key, sourceCodeInfo, { gte: 0 })\n    assertNumber(key, sourceCodeInfo, { lte: coll.length })\n    if (typeof coll === 'string') {\n      assertString(value, sourceCodeInfo, { char: true })\n      return `${coll.slice(0, key)}${value}${coll.slice(key + 1)}`\n    }\n    const copy = [...coll]\n    copy[key] = value\n    return copy\n  }\n  assertString(key, sourceCodeInfo)\n  const copy = { ...coll }\n  copy[key] = value\n  return copy\n}\n\ninterface CollMeta {\n  coll: Coll\n  parent: Obj | Arr\n}\n\n// --- Private helper: clone and get meta for nested operations ---\nfunction cloneAndGetMeta(\n  originalColl: Coll,\n  keys: Arr,\n  sourceCodeInfo?: SourceCodeInfo,\n): { coll: Coll, innerCollMeta: CollMeta } {\n  const coll = cloneColl(originalColl)\n\n  const butLastKeys = keys.slice(0, keys.length - 1)\n\n  const innerCollMeta = butLastKeys.reduce(\n    (result: CollMeta, key) => {\n      const resultColl = result.coll\n\n      let newResultColl: Coll\n      if (Array.isArray(resultColl)) {\n        assertNumber(key, sourceCodeInfo)\n        newResultColl = asColl(resultColl[key], sourceCodeInfo)\n      }\n      else {\n        assertObj(resultColl, sourceCodeInfo)\n        assertString(key, sourceCodeInfo)\n        if (!collHasKey(result.coll, key))\n          (resultColl)[key] = {}\n\n        newResultColl = asColl(resultColl[key], sourceCodeInfo)\n      }\n\n      return { coll: newResultColl, parent: resultColl }\n    },\n    { coll, parent: {} },\n  )\n  return { coll, innerCollMeta }\n}\n\nconst collectionUtilsFunctions: BuiltinNormalExpressions = {\n  'get-in': {\n    evaluate: (params, sourceCodeInfo): Any => {\n      let coll = toAny(params[0])\n      const keys = params[1] ?? [] // null behaves as empty array\n      const defaultValue = toAny(params[2])\n      assertArray(keys, sourceCodeInfo)\n      for (const key of keys) {\n        assertStringOrNumber(key, sourceCodeInfo)\n        if (isColl(coll)) {\n          const nextValue = get(coll, key)\n          if (nextValue !== undefined)\n            coll = nextValue\n          else\n            return defaultValue\n        }\n        else {\n          return defaultValue\n        }\n      }\n      return coll\n    },\n    arity: { min: 2, max: 3 },\n    docs: {\n      category: 'collection',\n      returns: { type: 'any' },\n      args: {\n        'a': { type: 'collection' },\n        'b': { type: 'array' },\n        'not-found': { type: 'any' },\n      },\n      variants: [\n        { argumentNames: ['a', 'b'] },\n        { argumentNames: ['a', 'b', 'not-found'] },\n      ],\n      description: 'Returns the value in a nested collection, where $b is an array of keys. Returns $not-found if the key is not present. If $not-found is not set, `null` is returned.',\n      seeAlso: ['get', 'collection.assoc-in', 'collection.update-in'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: \"Kalle\" }, 6]],\n  [1, 1, \"a\", 0]\n)`,\n        `\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: \"Kalle\" }, 6]],\n  [1, 1, \"b\", 0]\n)`,\n        `\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: \"Kalle\" }, 6]],\n  [1, 1, \"b\", 0],\n  \"Lisa\"\n)`,\n      ],\n    },\n  },\n  'assoc-in': {\n    evaluate: ([originalColl, keys, value], sourceCodeInfo): Coll => {\n      assertColl(originalColl, sourceCodeInfo)\n      assertArray(keys, sourceCodeInfo)\n      assertAny(value, sourceCodeInfo)\n\n      if (keys.length === 1) {\n        assertStringOrNumber(keys[0], sourceCodeInfo)\n        return assoc(originalColl, keys[0], value, sourceCodeInfo)\n      }\n\n      const { coll, innerCollMeta } = cloneAndGetMeta(originalColl, keys, sourceCodeInfo)\n\n      const lastKey = asStringOrNumber(keys[keys.length - 1], sourceCodeInfo)\n      const parentKey = asStringOrNumber(keys[keys.length - 2], sourceCodeInfo)\n\n      if (Array.isArray(innerCollMeta.parent)) {\n        assertNumber(parentKey, sourceCodeInfo)\n        innerCollMeta.parent[parentKey] = assoc(innerCollMeta.coll, lastKey, value, sourceCodeInfo)\n      }\n      else {\n        assertString(parentKey, sourceCodeInfo)\n        innerCollMeta.parent[parentKey] = assoc(innerCollMeta.coll, lastKey, value, sourceCodeInfo)\n      }\n\n      return coll\n    },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'collection' },\n      args: {\n        coll: { type: 'collection' },\n        ks: { type: ['number', 'string'], array: true },\n        value: { type: 'any' },\n      },\n      variants: [{ argumentNames: ['coll', 'ks', 'value'] }],\n      description: `\nAssociates a value in the nested collection $coll, where $ks is an array of keys and $value is the new value.\n\nIf any levels do not exist, objects will be created - and the corresponding keys must be of type string.`,\n      seeAlso: ['assoc', 'collection.get-in', 'collection.update-in'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.assoc-in(\n  {},\n  [\"a\", \"b\", \"c\"],\n  \"Albert\"\n)`,\n        `\nlet cu = import(collection);\ncu.assoc-in(\n  [1, 2, [1, 2, 3]],\n  [2, 1],\n  \"Albert\"\n)`,\n        `\nlet cu = import(collection);\ncu.assoc-in(\n  [1, 2, { name: \"albert\" }],\n  [2, \"name\", 0],\n  \"A\"\n)`,\n      ],\n    },\n  },\n  'update': {\n    evaluate: () => { throw new Error('update: Dvala implementation should be used instead') },\n    arity: { min: 3 },\n    docs: {\n      category: 'collection',\n      returns: { type: 'collection' },\n      args: {\n        'coll': { type: 'collection' },\n        'key': { type: ['string', 'number'] },\n        'fun': { type: 'function' },\n        'fun-args': { type: 'any', rest: true },\n      },\n      variants: [\n        { argumentNames: ['coll', 'key', 'fun'] },\n        { argumentNames: ['coll', 'key', 'fun', 'fun-args'] },\n      ],\n      description: `\nUpdates a value in the $coll collection, where $key is a key. $fun is a function\nthat will take the old value and any supplied $fun-args and\nreturn the new value.\nIf the key does not exist, \\`null\\` is passed as the old value.`,\n      seeAlso: ['collection.update-in', 'assoc'],\n      examples: [\n        `\nlet cu = import(collection);\nlet x = { a: 1, b: 2 };\ncu.update(x, \"a\", inc)`,\n        `\nlet cu = import(collection);\nlet x = { a: 1, b: 2 };\ncu.update(\n  x,\n  \"c\",\n  val -> null?(val) ? 0 : inc(val)\n)`,\n      ],\n    },\n  },\n  'update-in': {\n    evaluate: () => { throw new Error('update-in: Dvala implementation should be used instead') },\n    arity: { min: 3 },\n    docs: {\n      category: 'collection',\n      returns: { type: 'collection' },\n      args: {\n        'coll': { type: 'collection' },\n        'ks': { type: 'array' },\n        'fun': { type: 'function' },\n        'fun-args': { type: 'any', rest: true },\n      },\n      variants: [\n        { argumentNames: ['coll', 'ks', 'fun'] },\n        { argumentNames: ['coll', 'ks', 'fun', 'fun-args'] },\n      ],\n      description: `Updates a value in the $coll collection, where $ks is an array of\nkeys and $fun is a function that will take the old value and\nany supplied $fun-args and return the new value. If any levels do not exist,\nobjects will be created - and the corresponding keys must be of type string.`,\n      seeAlso: ['collection.update', 'collection.assoc-in', 'collection.get-in'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.update-in(\n  { a: [1, 2, 3] },\n  [\"a\", 1],\n  -> null?($) ? 0 : inc($)\n)`,\n        `\nlet cu = import(collection);\ncu.update-in(\n  { a: { foo: \"bar\"} },\n  [\"a\", \"foo\"],\n  -> null?($) ? \"?\" : \"!\"\n)`,\n        `\nlet cu = import(collection);\ncu.update-in(\n  { a: { foo: \"bar\"} },\n  [\"a\", \"baz\"],\n  -> null?($) ? \"?\" : \"!\"\n)`,\n        `\nlet cu = import(collection);\ncu.update-in(\n  { a: [1, 2, 3] },\n  [\"a\", 1],\n  *,\n  10,\n  10,\n  10,\n)`,\n      ],\n    },\n  },\n  'filteri': {\n    evaluate: () => { throw new Error('filteri: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'collection' },\n      args: {\n        a: { type: 'collection' },\n        b: {\n          type: 'function',\n          description: 'The function to call for each element in the collection. The function should take two arguments: the element itself and the index.',\n        },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Creates a new collection with all elements that pass the test implemented by $b. The function is called for each element in the collection, and it should take two arguments: the element itself and the index.',\n      seeAlso: ['filter', 'collection.mapi'],\n      examples: [\n        'let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> i % 2 == 0)',\n        'let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> x % 2 == 0)',\n        'let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> x + i > 3)',\n      ],\n    },\n  },\n  'mapi': {\n    evaluate: () => { throw new Error('mapi: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'collection' },\n      args: {\n        a: { type: 'collection' },\n        b: {\n          type: 'function',\n          description: 'The function to call for each element in the collection. The function should take two arguments: the element itself and the index.',\n        },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Creates a new collection populated with the results of calling $b on every element in $a. The function is called for each element in the collection, and it should take two arguments: the element itself and the index.',\n      seeAlso: ['map', 'collection.filteri'],\n      examples: [\n        'let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x + i)',\n        'let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x * i)',\n        'let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x - i)',\n        'let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x / i)',\n        'let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x % inc(i))',\n      ],\n    },\n  },\n  'reducei': {\n    evaluate: () => { throw new Error('reducei: Dvala implementation should be used instead') },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any' },\n      args: {\n        coll: { type: 'collection' },\n        fun: {\n          type: 'function',\n          description: 'The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index.',\n        },\n        initial: {\n          type: 'any',\n          description: 'The initial value to use as the accumulator.',\n        },\n      },\n      variants: [{ argumentNames: ['coll', 'fun', 'initial'] }],\n      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. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.',\n      seeAlso: ['reduce', 'collection.reducei-right', 'collection.reductionsi'],\n      examples: [\n        'let cu = import(collection); cu.reducei([1, 2, 3], (acc, x, i) -> acc + x + i, 0)',\n        'let cu = import(collection); cu.reducei(\"Albert\", (acc, x, i) -> acc ++ x ++ i, \"\")',\n        'let cu = import(collection); cu.reducei({ a: 1, b: 2 }, -> $1 ++ $3, \"\")',\n      ],\n    },\n  },\n  'reduce-right': {\n    evaluate: () => { throw new Error('reduce-right: Dvala implementation should be used instead') },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any' },\n      args: {\n        fun: { type: 'function' },\n        coll: { type: 'collection' },\n        initial: { type: 'any' },\n      },\n      variants: [{ argumentNames: ['coll', 'fun', 'initial'] }],\n      description: 'Runs $fun function on each element of the $coll (starting from the last item), 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.',\n      seeAlso: ['reduce', 'collection.reducei-right'],\n      examples: [\n        'let cu = import(collection); cu.reduce-right([\"A\", \"B\", \"C\"], str, \"\")',\n        'let cu = import(collection); cu.reduce-right({ a: 1, b: 2 }, +, 0)',\n      ],\n    },\n  },\n  'reducei-right': {\n    evaluate: () => { throw new Error('reducei-right: Dvala implementation should be used instead') },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any' },\n      args: {\n        coll: { type: 'collection' },\n        fun: {\n          type: 'function',\n          description: 'The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index.',\n        },\n        initial: {\n          type: 'any',\n          description: 'The initial value to use as the accumulator.',\n        },\n      },\n      variants: [{ argumentNames: ['coll', 'fun', 'initial'] }],\n      description: 'Runs $fun function on each element of the $coll (starting from the last item), 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. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.',\n      seeAlso: ['collection.reducei', 'collection.reduce-right'],\n      examples: [\n        'let cu = import(collection); cu.reducei-right([1, 2, 3], (acc, x, i) -> acc + x + i, 0)',\n        'let cu = import(collection); cu.reducei-right(\"Albert\", (acc, x, i) -> acc ++ x ++ i, \"\")',\n        'let cu = import(collection); cu.reducei-right({ a: 1, b: 2 }, -> $1 ++ $3, \"\")',\n      ],\n    },\n  },\n  'reductions': {\n    evaluate: () => { throw new Error('reductions: Dvala implementation should be used instead') },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any', array: true },\n      args: {\n        fun: { type: 'function' },\n        coll: { type: 'collection' },\n        initial: { type: 'any' },\n      },\n      variants: [{ argumentNames: ['coll', 'fun', 'initial'] }],\n      description: 'Returns an array of the intermediate values of the reduction (see `reduce`) of $coll by $fun.',\n      seeAlso: ['reduce', 'collection.reductionsi'],\n      examples: [\n        'let cu = import(collection); cu.reductions([1, 2, 3], +, 0)',\n        'let cu = import(collection); cu.reductions([1, 2, 3], +, 10)',\n        'let cu = import(collection); cu.reductions([], +, 0)',\n        'let cu = import(collection); cu.reductions({ a: 1, b: 2 }, +, 0)',\n        `\nlet cu = import(collection);\ncu.reductions(\n  [1, 2, 3, 4, 5, 6, 7, 8, 9],\n  (result, value) -> result + (even?(value) ? value : 0),\n  0\n)`,\n      ],\n    },\n  },\n  'reductionsi': {\n    evaluate: () => { throw new Error('reductionsi: Dvala implementation should be used instead') },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any', array: true },\n      args: {\n        coll: { type: 'collection' },\n        fun: {\n          type: 'function',\n          description: 'The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index.',\n        },\n        initial: {\n          type: 'any',\n          description: 'The initial value to use as the accumulator.',\n        },\n      },\n      variants: [{ argumentNames: ['coll', 'fun', 'initial'] }],\n      description: 'Returns an array of the intermediate values of the reduction (see `reduce`) of $coll by $fun. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.',\n      seeAlso: ['collection.reductions', 'collection.reducei'],\n      examples: [\n        'let cu = import(collection); cu.reductionsi([1, 2, 3], (acc, x, i) -> acc + x + i, 0)',\n        'let cu = import(collection); cu.reductionsi(\"Albert\", (acc, x, i) -> acc ++ x ++ i, \"\")',\n        'let cu = import(collection); cu.reductionsi({ a: 1, b: 2 }, -> $1 ++ $3, \"\")',\n      ],\n    },\n  },\n  'not-empty': {\n    evaluate: ([coll], sourceCodeInfo): Coll | null => {\n      if (coll === null)\n        return null\n\n      assertColl(coll, sourceCodeInfo)\n      if (typeof coll === 'string')\n        return coll.length > 0 ? coll : null\n\n      if (Array.isArray(coll))\n        return coll.length > 0 ? coll : null\n\n      return Object.keys(coll).length > 0 ? coll : null\n    },\n    arity: toFixedArity(1),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any' },\n      args: {\n        coll: { type: ['collection', 'null'] },\n      },\n      variants: [{ argumentNames: ['coll'] }],\n      description: 'Returns `null` if $coll is empty or `null`, otherwise $coll.',\n      seeAlso: ['empty?', 'not-empty?'],\n      examples: [\n        'let cu = import(collection); cu.not-empty([])',\n        'let cu = import(collection); cu.not-empty([1, 2, 3])',\n        'let cu = import(collection); cu.not-empty({})',\n        'let cu = import(collection); cu.not-empty({ a: 2 })',\n        'let cu = import(collection); cu.not-empty(\"\")',\n        'let cu = import(collection); cu.not-empty(\"Albert\")',\n        'let cu = import(collection); cu.not-empty(null)',\n      ],\n    },\n  },\n  'every?': {\n    evaluate: () => { throw new Error('every?: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'boolean' },\n      args: {\n        a: { type: 'collection' },\n        b: { type: 'function' },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Returns `true` if all entries in $a pass the test implemented by $b, otherwise returns `false`.',\n      seeAlso: ['collection.any?', 'collection.not-every?', 'collection.not-any?', 'functional.every-pred', 'grid.cell-every?'],\n      examples: [\n        'let cu = import(collection); cu.every?([1, 2, 3], number?)',\n        'let cu = import(collection); cu.every?([1, 2, 3], even?)',\n        `\nlet cu = import(collection);\ncu.every?(\n  [\"Albert\", \"Mojir\", 160, [1, 2]],\n  string?,\n)`,\n        `\nlet cu = import(collection);\ncu.every?(\n  [50, 100, 150, 200],\n  -> $ > 10,\n)`,\n        'let cu = import(collection); cu.every?([], number?)',\n        'let cu = import(collection); cu.every?(\"\", number?)',\n        'let cu = import(collection); cu.every?({}, number?)',\n        `\nlet cu = import(collection);\ncu.every?(\n  { a: 2, b: 4},\n  -> even?(second($))\n)`,\n        `\nlet cu = import(collection);\ncu.every?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)`,\n      ],\n    },\n  },\n  'any?': {\n    evaluate: () => { throw new Error('any?: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'boolean' },\n      args: {\n        a: { type: 'collection' },\n        b: { type: 'function' },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Returns `true` if any element in $a pass the test implemented by $b, otherwise returns `false`.',\n      seeAlso: ['collection.every?', 'collection.not-any?', 'collection.not-every?', 'functional.some-pred', 'some', 'grid.some?'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.any?(\n  [\"Albert\", \"Mojir\", 160, [1, 2]],\n  string?\n)`,\n        `\nlet cu = import(collection);\ncu.any?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)`,\n        'let cu = import(collection); cu.any?([], number?)',\n        'let cu = import(collection); cu.any?(\"\", number?)',\n        'let cu = import(collection); cu.any?({}, number?)',\n        `\nlet cu = import(collection);\ncu.any?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)`,\n        `\nlet cu = import(collection);\ncu.any?(\n  { a: 1, b: 3 },\n  -> even?(second($))\n)`,\n      ],\n    },\n  },\n  'not-any?': {\n    evaluate: () => { throw new Error('not-any?: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'boolean' },\n      args: {\n        a: { type: 'collection' },\n        b: { type: 'function' },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Returns `false` if any element in $a pass the test implemented by $b, otherwise returns `true`.',\n      seeAlso: ['collection.any?', 'collection.every?', 'collection.not-every?'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.not-any?(\n  [\"Albert\", \"Mojir\", 160, [1, 2]],\n  string?\n)`,\n        `\nlet cu = import(collection);\ncu.not-any?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)`,\n        'let cu = import(collection); cu.not-any?([], number?)',\n        'let cu = import(collection); cu.not-any?(\"\", number?)',\n        'let cu = import(collection); cu.not-any?({}, number?)',\n        `\nlet cu = import(collection);\ncu.not-any?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)`,\n        `\nlet cu = import(collection);\ncu.not-any?(\n  { a: 1, b: 3 },\n  -> even?(second($))\n)`,\n      ],\n    },\n  },\n  'not-every?': {\n    evaluate: () => { throw new Error('not-every?: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'boolean' },\n      args: {\n        a: { type: 'collection' },\n        b: { type: 'function' },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Returns `true` if at least one element in $a does not pass the test implemented by $b, otherwise returns `false`.',\n      seeAlso: ['collection.every?', 'collection.any?', 'collection.not-any?'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.not-every?(\n  [\"Albert\", \"Mojir\", 160, [1, 2]],\n  string?\n)`,\n        `\nlet cu = import(collection);\ncu.not-every?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)`,\n        'let cu = import(collection); cu.not-every?([], number?)',\n        'let cu = import(collection); cu.not-every?(\"\", number?)',\n        'let cu = import(collection); cu.not-every?({}, number?)',\n        `\nlet cu = import(collection);\ncu.not-every?(\n  { a: 2, b: 4 },\n  -> even?(second($))\n)`,\n        `\nlet cu = import(collection);\ncu.not-every?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)`,\n      ],\n    },\n  },\n}\n\nexport const collectionUtilsModule: DvalaModule = {\n  name: 'collection',\n  functions: collectionUtilsFunctions,\n  source: collectionModuleSource,\n  docs: moduleDocsFromFunctions(collectionUtilsFunctions),\n}\n","{\n  update: (coll, key, fn, ...extra-params) ->\n    assoc(coll, key, apply(fn, [get(coll, key), ...extra-params])),\n\n  update-in: (coll, ks, fn, ...extra-params) -> do\n    let k = first(ks);\n    if count(ks) == 1 then\n      assoc(coll, k, apply(fn, [get(coll, k), ...extra-params]))\n    else\n      let inner = get(coll, k);\n      let inner-coll = null?(inner) ? {} : inner;\n      assoc(coll, k, apply(self, [inner-coll, slice(ks, 1), fn, ...extra-params]))\n    end\n  end,\n\n  filteri: (coll, fn) -> do\n    cond\n      case array?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> [nth(coll, i), i],\n          (acc, pair) -> if fn(first(pair), second(pair)) then [...acc, first(pair)] else acc end,\n          []\n        )\n\n      case string?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> [nth(coll, i), i],\n          (acc, pair) -> if fn(first(pair), second(pair)) then ++(acc, first(pair)) else acc end,\n          \"\"\n        )\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) ->\n          if fn(coll(k), k) then assoc(acc, k, coll(k)) else acc end,\n          {}\n        )\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  mapi: (coll, fn) -> do\n    cond\n      case array?(coll) then\n        for (i in range(count(coll))) -> fn(nth(coll, i), i)\n\n      case string?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> fn(nth(coll, i), i),\n          (acc, ch) -> ++(acc, ch),\n          \"\"\n        )\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) ->\n          assoc(acc, k, fn(coll(k), k)),\n          {}\n        )\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  reducei: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        loop (acc = initial, i = 0) -> do\n          if i >= count(coll) then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i + 1)\n          end\n        end\n\n      case array?(coll) then\n        loop (acc = initial, i = 0) -> do\n          if i >= count(coll) then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i + 1)\n          end\n        end\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) -> fn(acc, coll(k), k), initial)\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  reduce-right: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        reduce(reverse(coll), fn, initial)\n\n      case array?(coll) then\n        reduce(reverse(coll), fn, initial)\n\n      case object?(coll) then\n        reduce(reverse(keys(coll)), (acc, k) -> fn(acc, coll(k)), initial)\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  reducei-right: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        let len = count(coll);\n        loop (acc = initial, i = len - 1) -> do\n          if i < 0 then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i - 1)\n          end\n        end\n\n      case array?(coll) then\n        let len = count(coll);\n        loop (acc = initial, i = len - 1) -> do\n          if i < 0 then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i - 1)\n          end\n        end\n\n      case object?(coll) then\n        reduce(reverse(keys(coll)), (acc, k) -> fn(acc, coll(k), k), initial)\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  reductions: (coll, fn, initial) -> do\n    let items = cond\n      case string?(coll) then\n        if count(coll) == 0 then [] else for (i in range(count(coll))) -> nth(coll, i) end\n\n      case array?(coll) then coll\n\n      case object?(coll) then\n        for (k in keys(coll)) -> coll(k)\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end;\n    if count(items) == 0 then\n      [initial]\n    else\n      reduce(items, (acc, elem) -> do\n        let prev = last(acc);\n        [...acc, fn(prev, elem)]\n      end, [initial])\n    end\n  end,\n\n  reductionsi: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then do\n        if count(coll) == 0 then\n          [initial]\n        else\n          reduce(\n            for (i in range(count(coll))) -> [nth(coll, i), i],\n            (acc, pair) -> do\n              let prev = last(acc);\n              [...acc, fn(prev, first(pair), second(pair))]\n            end,\n            [initial]\n          )\n        end\n      end\n\n      case array?(coll) then do\n        if count(coll) == 0 then\n          [initial]\n        else\n          reduce(\n            for (i in range(count(coll))) -> [nth(coll, i), i],\n            (acc, pair) -> do\n              let prev = last(acc);\n              [...acc, fn(prev, first(pair), second(pair))]\n            end,\n            [initial]\n          )\n        end\n      end\n\n      case object?(coll) then do\n        let ks = keys(coll);\n        if count(ks) == 0 then\n          [initial]\n        else\n          reduce(ks, (acc, k) -> do\n            let prev = last(acc);\n            [...acc, fn(prev, coll(k), k)]\n          end, [initial])\n        end\n      end\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  \"every?\": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), \"Expected collection\")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then true\n        case not(fn(nth(items, i))) then false\n        case true then recur(i + 1)\n      end\n  end,\n\n  \"any?\": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), \"Expected collection\")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then false\n        case fn(nth(items, i)) then true\n        case true then recur(i + 1)\n      end\n  end,\n\n  \"not-any?\": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), \"Expected collection\")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then true\n        case fn(nth(items, i)) then false\n        case true then recur(i + 1)\n      end\n  end,\n\n  \"not-every?\": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), \"Expected collection\")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then false\n        case not(fn(nth(items, i))) then true\n        case true then recur(i + 1)\n      end\n  end\n}","import type { BuiltinNormalExpressions, FunctionDocs } from '../../builtin/interface'\n\n/**\n * Represents a Dvala module that can be imported dynamically.\n * Modules contain a collection of functions that are not part of the core bundle.\n */\nexport interface DvalaModule {\n  /** The name of the module (e.g., 'grid', 'vec', 'mat') */\n  name: string\n  /** The functions provided by this module, keyed by their short name (e.g., 'transpose') */\n  functions: BuiltinNormalExpressions\n  /**\n   * Optional Dvala source code that is evaluated at import time.\n   * The source must evaluate to an object mapping function names to functions.\n   * These are merged with (and may override) the TypeScript `functions`.\n   */\n  source?: string\n  /**\n   * Docs for all functions in this module, including any defined in `source`.\n   * The reference system uses this record as the sole source of truth for\n   * function names and documentation. Not required for user-defined modules.\n   */\n  docs?: Record<string, FunctionDocs>\n}\n\n/**\n * Derives a docs record from a BuiltinNormalExpressions map.\n * Use this for modules whose docs are co-located inline on each function.\n */\nexport function moduleDocsFromFunctions(functions: BuiltinNormalExpressions): Record<string, FunctionDocs> {\n  return Object.fromEntries(\n    Object.entries(functions).map(([k, v]) => {\n      if (!v.docs)\n        throw new Error(`Missing docs for function \"${k}\"`)\n      return [k, v.docs]\n    }),\n  )\n}\n"],"names":["getCodeMarker","sourceCodeInfo","position","code","leftPadding","column","rightPadding","length","repeat","Math","max","DvalaError","Error","shortMessage","constructor","err","message","super","location","line","filePath","getDvalaErrorMessage","this","Object","setPrototypeOf","prototype","name","NodeTypes","Number","String","NormalExpression","SpecialExpression","UserDefinedSymbol","NormalBuiltinSymbol","SpecialBuiltinSymbol","ReservedSymbol","Binding","Spread","NodeTypesSet","Set","values","functionTypeSet","FUNCTION_SYMBOL","REGEXP_SYMBOL","EFFECT_SYMBOL","isDvalaFunction","func","type","functionType","has","isNode","value","Array","isArray","valueToString","keys","find","key","RegExp","toString","JSON","stringify","getSourceCodeInfo","anyValue","getAssertionError","typeName","isObj","regexp","isEffect","isColl","isSeq","asColl","assertColl","isNumber","options","isNaN","integer","isInteger","finite","isFinite","zero","nonZero","positive","negative","nonPositive","nonNegative","gt","gte","lt","lte","assertNumber","sign","getSignString","numberType","range","getRangeString","filter","x","join","getNumberTypeName","assertString","nonEmpty","char","isString","asStringOrNumber","assertStringOrNumber","isStringOrNumber","collHasKey","coll","getOwnPropertyDescriptor","toAny","clone","entries","reduce","result","entry","val","map","item","cloneColl","assertArray","toFixedArity","arity","min","get","assoc","slice","copy","cloneAndGetMeta","originalColl","innerCollMeta","resultColl","newResultColl","assertObj","parent","collectionUtilsFunctions","evaluate","params","defaultValue","nextValue","undefined","docs","category","returns","args","a","b","variants","argumentNames","description","seeAlso","examples","isAny","assertAny","lastKey","parentKey","ks","array","update","fun","rest","filteri","mapi","reducei","initial","reductions","reductionsi","collectionUtilsModule","functions","source","fromEntries","k","v"],"mappings":"AAEM,SAAUA,EAAcC,GAC5B,IAAKA,EAAeC,WAAaD,EAAeE,KAC9C,MAAO,GAET,MAAMC,EAAcH,EAAeC,SAASG,OAAS,EAC/CC,EAAeL,EAAeE,KAAKI,OAASH,EAAc,EAChE,MAAO,GAAG,IAAII,OAAOC,KAAKC,IAAIN,EAAa,OAAO,IAAII,OAAOC,KAAKC,IAAIJ,EAAc,KACtF,CCkBM,MAAOK,UAAmBC,MACdX,eACAY,aAChB,WAAAC,CAAYC,EAAcd,GACxB,MAAMe,EAAUD,aAAeH,MAC3BG,EAAIC,QACJ,GAAGD,IAEPE,MA/BJ,SAA8BD,EAAiBf,GAC7C,IAAKA,EACH,OAAOe,EAET,MAAME,EAAW,GAAGjB,EAAeC,SAASiB,QAAQlB,EAAeC,SAASG,SAM5E,MAAO,GAAGW,IALWf,EAAemB,SAChC,KAAKnB,EAAemB,YAAYF,IAChC,cAAcA,QACIjB,EAAeE,SACbH,EAAcC,IAExC,CAoBUoB,CAAqBL,EAASf,IACpCqB,KAAKT,aAAeG,EACpBM,KAAKrB,eAAiBA,EACtBsB,OAAOC,eAAeF,KAAMX,EAAWc,WACvCH,KAAKI,KAAO,YACb,CAEM,aAAA1B,GACL,OAAOsB,KAAKrB,gBAAkBD,EAAcsB,KAAKrB,eAClD,EC5CI,MAAM0B,EAAY,CACvBC,OAAQ,EACRC,OAAQ,EACRC,iBAAkB,EAClBC,kBAAmB,EACnBC,kBAAmB,EACnBC,oBAAqB,EACrBC,qBAAsB,EACtBC,eAAgB,EAChBC,QAAS,EACTC,OAAQ,IAGJC,EAAe,IAAIC,IAAIhB,OAAOiB,OAAOb,IAa3C,MAgBMc,EAAkB,IAAIF,IAhBN,CACpB,cACA,UACA,OACA,aACA,OACA,aACA,YACA,WACA,QACA,gBACA,UACA,iBACA,WCvCK,MAAMG,EAAkB,SAClBC,EAAgB,SAChBC,EAAgB,SCE7B,SAASC,EAAgBC,GACvB,OAAa,OAATA,GAAiC,iBAATA,IAGrBJ,KAAmBI,GAAQ,iBAAkBA,IFuC7B,iBADMC,EEtC8CD,EAAKE,eFuC7CP,EAAgBQ,IAAIF,KADnD,IAAyBA,CErC/B,CAEA,SAASG,EAAOC,GACd,SAAKC,MAAMC,QAAQF,IAAUA,EAAM5C,OAAS,KFWrB,iBADEwC,EERPI,EAAM,KFSWb,EAAaW,IAAIF,IADhD,IAAqBA,CEP3B,CAEM,SAAUO,EAAcH,GAC5B,OAAIN,EAAgBM,GAEX,aAAcA,EAAczB,MAAQ,OAEzCwB,EAAOC,GACF,GFNqBJ,EEMFI,EAAM,GFL3B5B,OAAOgC,KAAK5B,GAAW6B,KAAKC,GAAO9B,EAAU8B,KAAmCV,UEOzE,OAAVI,EACK,OAEY,iBAAVA,GAAsBA,aAAiBO,OACzC,GAAGP,IAES,iBAAVA,GAAsBA,aAAiBvC,MACzCuC,EAAMQ,WAERC,KAAKC,UAAUV,GFjBlB,IAA0BJ,CEkBhC,CCjCgB,SAAAe,EAAkBC,EAAe9D,GAE/C,OAAO8D,GAAU9D,gBAAkBA,CACrC,UCAgB+D,EAAkBC,EAAkBd,EAAgBlD,GAClE,OAAO,IAAIU,EAAW,YAAYsD,UAAiBX,EAAcH,MAAWW,EAAkBX,EAAOlD,GACvG,CCyBM,SAAUiE,EAAMf,GACpB,QACY,OAAVA,GACoB,iBAAVA,GACPC,MAAMC,QAAQF,IACdA,aAAiBO,QC/BlB,SAA0BP,GAC9B,OAAc,OAAVA,GAAmC,iBAAVA,KAGnBA,EAAwBT,EACpC,CD2BOG,CAAgBM,KA0BagB,EAzBThB,EA0BV,OAAXgB,GAAqC,iBAAXA,GAGpBA,EAA6BxB,KAgCnC,SAAmBQ,GACvB,OAAc,OAAVA,GAAmC,iBAAVA,KAGnBA,EAAoBP,EAChC,CAjEOwB,CAASjB,IAwBV,IAA8BgB,CAtBpC,CAUM,SAAUE,EAAOlB,GACrB,OAjCI,SAAgBA,GACpB,OAAOC,MAAMC,QAAQF,IAA2B,iBAAVA,CACxC,CA+BSmB,CAAMnB,IAAUe,EAAMf,EAC/B,CACgB,SAAAoB,EAAOpB,EAAgBlD,GAErC,OADAuE,EAAWrB,EAAOlD,GACXkD,CACT,CACgB,SAAAqB,EAAWrB,EAAgBlD,GACzC,IAAKoE,EAAOlB,GACV,MAAMa,EAAkB,0BAA2Bb,EAAOlD,EAC9D,UEgEgBwE,EAAStB,EAAgBuB,EAAyB,IAChE,MAAqB,iBAAVvB,KAGPvB,OAAO+C,MAAMxB,OAGbuB,EAAQE,UAAYhD,OAAOiD,UAAU1B,QAGrCuB,EAAQI,SAAWlD,OAAOmD,SAAS5B,QAGnCuB,EAAQM,MAAkB,IAAV7B,OAGhBuB,EAAQO,SAAqB,IAAV9B,OAGnBuB,EAAQQ,UAAY/B,GAAS,OAG7BuB,EAAQS,UAAYhC,GAAS,OAG7BuB,EAAQU,aAAejC,EAAQ,OAG/BuB,EAAQW,aAAelC,EAAQ,OAGT,iBAAfuB,EAAQY,IAAmBnC,GAASuB,EAAQY,QAG5B,iBAAhBZ,EAAQa,KAAoBpC,EAAQuB,EAAQa,SAG7B,iBAAfb,EAAQc,IAAmBrC,GAASuB,EAAQc,OAG5B,iBAAhBd,EAAQe,KAAoBtC,EAAQuB,EAAQe,gBAIzD,CAEM,SAAUC,EACdvC,EACAlD,EACAyE,EAAyB,CAAA,GAEzB,IAAKD,EAAStB,EAAOuB,GACnB,MAAM,IAAI/D,EACR,YAjEN,SAA2B+D,GACzB,GAAIA,EAAQM,KACV,MAAO,OAET,MAAMW,EAlBR,SAAuBjB,GACrB,OAAOA,EAAQQ,SACX,WACAR,EAAQS,SACN,WACAT,EAAQW,YACN,eACAX,EAAQU,YACN,eACAV,EAAQO,QACN,WACA,EACd,CAMeW,CAAclB,GACrBmB,EAAanB,EAAQE,QAAU,UAAY,SAC3CE,EAASJ,EAAQI,OAAS,SAAW,GACrCgB,EAvCR,SAAwBpB,GAItB,MAF2B,iBAAfA,EAAQY,IAA0C,iBAAhBZ,EAAQa,KACxB,iBAAfb,EAAQc,IAA0C,iBAAhBd,EAAQe,IAM1B,iBAAff,EAAQY,IAA0C,iBAAhBZ,EAAQa,IACxB,iBAAfb,EAAQY,GAAkB,OAAOZ,EAAQY,KAAO,QAAQZ,EAAQa,MAEpD,iBAAfb,EAAQc,IAA0C,iBAAhBd,EAAQe,IACxB,iBAAff,EAAQc,GAAkB,OAAOd,EAAQc,KAAO,QAAQd,EAAQe,MAErE,GAVL,GAAyB,iBAAff,EAAQY,GAAkB,GAAGZ,EAAQY,UAAY,GAAGZ,EAAQa,cACrD,iBAAfb,EAAQc,GAAkB,KAAKd,EAAQc,KAAO,MAAMd,EAAQe,OAUzE,CAuBgBM,CAAerB,GAE7B,MAAO,CAACiB,EAAMb,EAAQe,EAAYC,GAAOE,OAAOC,KAAOA,GAAGC,KAAK,IACjE,CAuDkBC,CAAkBzB,WAAiBpB,EAAcH,MAC7DW,EAAkBX,EAAOlD,GAG/B,CC7JM,SAAUmG,EACdjD,EACAlD,EACAyE,EAAkC,CAAA,GAElC,aAlBuBvB,EAAgBuB,EAAkC,IACzE,QAAqB,iBAAVvB,GAGPuB,EAAQ2B,UAA6B,IAAjBlD,EAAM5C,QAG1BmE,EAAQ4B,MAAyB,IAAjBnD,EAAM5C,OAI5B,CAOOgG,CAASpD,EAAOuB,GACnB,MAAMV,EACJ,IAAGU,EAAQ2B,SAAW,mBAAqB3B,EAAQ4B,KAAO,YAAc,UACxEnD,EACAlD,EAGN,CAcgB,SAAAuG,EAAiBrD,EAAgBlD,GAE/C,OADAwG,EAAqBtD,EAAOlD,GACrBkD,CACT,CACgB,SAAAsD,EACdtD,EACAlD,GAEA,IAXI,SAA2BkD,GAC/B,MAAwB,iBAAVA,GAAuC,iBAAVA,CAC7C,CASOuD,CAAiBvD,GACpB,MAAMa,EAAkB,mBAAoBb,EAAOlD,EACvD,CCtDgB,SAAA0G,EAAWC,EAAenD,GACxC,QAAKY,EAAOuC,KAGQ,iBAATA,GAAqBxD,MAAMC,QAAQuD,KACvCnC,EAAShB,EAAK,CAAEmB,SAAS,MAGvBnB,GAAO,GAAKA,EAAMmD,EAAKrG,UAEvBgB,OAAOsF,yBAAyBD,EAAMnD,GACjD,CAuDM,SAAUqD,EAAM3D,GACpB,OAAQA,GAAS,IACnB,CAEA,SAAS4D,EAAS5D,GAChB,OAAIe,EAAMf,GACD5B,OAAOyF,QAAQ7D,GAAO8D,OAAO,CAACC,EAAaC,KAChD,MAAO1D,EAAK2D,GAAOD,EAEnB,OADAD,EAAOzD,GAAOsD,EAAMK,GACbF,GACN,CAAE,GAEH9D,MAAMC,QAAQF,GAETA,EAAMkE,IAAIC,GAAQP,EAAMO,IAE1BnE,CACT,CAEM,SAAUoE,EAA0BpE,GACxC,OAAO4D,EAAM5D,EACf,CCvFgB,SAAAqE,EAAYrE,EAAgBlD,GAC1C,IAAKmD,MAAMC,QAAQF,GACjB,MAAMa,EAAkB,QAASb,EAAOlD,EAC5C,CCuEM,SAAUwH,EAAaC,GAC3B,MAAO,CAAEC,IAAKD,EAAOhH,IAAKgH,EAC5B,CCtEA,SAASE,EAAIhB,EAAYnD,GACvB,GAAIS,EAAM0C,IACR,GAAmB,iBAARnD,GAAoBkD,EAAWC,EAAMnD,GAC9C,OAAOqD,EAAMF,EAAKnD,SAGpB,GAAIgB,EAAShB,EAAK,CAAE4B,aAAa,EAAMT,SAAS,KAAWnB,GAAO,GAAKA,EAAMmD,EAAKrG,OAChF,OAAOuG,EAAMF,EAAKnD,GAGxB,CAGA,SAASoE,EAAMjB,EAAYnD,EAAsBN,EAAYlD,GAE3D,GADAuE,EAAWoC,EAAM3G,GACbmD,MAAMC,QAAQuD,IAAyB,iBAATA,EAAmB,CAInD,GAHAlB,EAAajC,EAAKxD,EAAgB,CAAE2E,SAAS,IAC7Cc,EAAajC,EAAKxD,EAAgB,CAAEsF,IAAK,IACzCG,EAAajC,EAAKxD,EAAgB,CAAEwF,IAAKmB,EAAKrG,SAC1B,iBAATqG,EAET,OADAR,EAAajD,EAAOlD,EAAgB,CAAEqG,MAAM,IACrC,GAAGM,EAAKkB,MAAM,EAAGrE,KAAON,IAAQyD,EAAKkB,MAAMrE,EAAM,KAE1D,MAAMsE,EAAO,IAAInB,GAEjB,OADAmB,EAAKtE,GAAON,EACL4E,CACR,CACD3B,EAAa3C,EAAKxD,GAClB,MAAM8H,EAAO,IAAKnB,GAElB,OADAmB,EAAKtE,GAAON,EACL4E,CACT,CAQA,SAASC,EACPC,EACA1E,EACAtD,GAEA,MAAM2G,EAAOW,EAAUU,GA0BvB,MAAO,CAAErB,OAAMsB,cAxBK3E,EAAKuE,MAAM,EAAGvE,EAAKhD,OAAS,GAEd0G,OAChC,CAACC,EAAkBzD,KACjB,MAAM0E,EAAajB,EAAON,KAE1B,IAAIwB,EAcJ,OAbIhF,MAAMC,QAAQ8E,IAChBzC,EAAajC,EAAKxD,GAClBmI,EAAgB7D,EAAO4D,EAAW1E,GAAMxD,MPtBhC,SAAUkD,EAAgBlD,GACxC,IAAKiE,EAAMf,GACT,MAAMa,EAAkB,SAAUb,EAAOlD,EAC7C,COsBQoI,CAAUF,EAAYlI,GACtBmG,EAAa3C,EAAKxD,GACb0G,EAAWO,EAAON,KAAMnD,KAC3B,EAAaA,GAAO,IAEtB2E,EAAgB7D,EAAO4D,EAAW1E,GAAMxD,IAGnC,CAAE2G,KAAMwB,EAAeE,OAAQH,IAExC,CAAEvB,OAAM0B,OAAQ,CAAA,IAGpB,CAEA,MAAMC,EAAqD,CACzD,SAAU,CACRC,SAAU,CAACC,EAAQxI,KACjB,IAAI2G,EAAOE,EAAM2B,EAAO,IACxB,MAAMlF,EAAOkF,EAAO,IAAM,GACpBC,EAAe5B,EAAM2B,EAAO,IAClCjB,EAAYjE,EAAMtD,GAClB,IAAK,MAAMwD,KAAOF,EAAM,CAEtB,GADAkD,EAAqBhD,EAAKxD,IACtBoE,EAAOuC,GAQT,OAAO8B,EARS,CAChB,MAAMC,EAAYf,EAAIhB,EAAMnD,GAC5B,QAAkBmF,IAAdD,EAGF,OAAOD,EAFP9B,EAAO+B,CAGV,CAIF,CACD,OAAO/B,GAETc,MAAO,CAAEC,IAAK,EAAGjH,IAAK,GACtBmI,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,OACjBiG,KAAM,CACJC,EAAK,CAAElG,KAAM,cACbmG,EAAK,CAAEnG,KAAM,SACb,YAAa,CAAEA,KAAM,QAEvBoG,SAAU,CACR,CAAEC,cAAe,CAAC,IAAK,MACvB,CAAEA,cAAe,CAAC,IAAK,IAAK,eAE9BC,YAAa,sKACbC,QAAS,CAAC,MAAO,sBAAuB,wBACxCC,SAAU,CACR,0GAMA,0GAMA,wHAUN,WAAY,CACVf,SAAU,EAAEP,EAAc1E,EAAMJ,GAAQlD,KAKtC,GAJAuE,EAAWyD,EAAchI,GACzBuH,EAAYjE,EAAMtD,GPvIR,SAAUkD,EAAgBlD,GACxC,IATI,SAAgBkD,GAEpB,YAAiByF,IAAVzF,CACT,CAMOqG,CAAMrG,GACT,MAAMa,EAAkB,gBAAiBb,EAAOlD,EACpD,COqIMwJ,CAAUtG,EAAOlD,GAEG,IAAhBsD,EAAKhD,OAEP,OADAkG,EAAqBlD,EAAK,GAAItD,GACvB4H,EAAMI,EAAc1E,EAAK,GAAIJ,EAAOlD,GAG7C,MAAM2G,KAAEA,EAAIsB,cAAEA,GAAkBF,EAAgBC,EAAc1E,EAAMtD,GAE9DyJ,EAAUlD,EAAiBjD,EAAKA,EAAKhD,OAAS,GAAIN,GAClD0J,EAAYnD,EAAiBjD,EAAKA,EAAKhD,OAAS,GAAIN,GAW1D,OATImD,MAAMC,QAAQ6E,EAAcI,SAC9B5C,EAAaiE,EAAW1J,GACxBiI,EAAcI,OAAOqB,GAAa9B,EAAMK,EAActB,KAAM8C,EAASvG,EAAOlD,KAG5EmG,EAAauD,EAAW1J,GACxBiI,EAAcI,OAAOqB,GAAa9B,EAAMK,EAActB,KAAM8C,EAASvG,EAAOlD,IAGvE2G,GAETc,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,cACjBiG,KAAM,CACJpC,KAAM,CAAE7D,KAAM,cACd6G,GAAI,CAAE7G,KAAM,CAAC,SAAU,UAAW8G,OAAO,GACzC1G,MAAO,CAAEJ,KAAM,QAEjBoG,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,KAAM,WAC3CC,YAAa,8NAIbC,QAAS,CAAC,QAAS,oBAAqB,wBACxCC,SAAU,CACR,yFAOA,+FAOA,8GAUNO,OAAU,CACRtB,SAAU,KAAQ,MAAM,IAAI5H,MAAM,wDAClC8G,MAAO,CAAEC,IAAK,GACdkB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,cACjBiG,KAAM,CACJpC,KAAQ,CAAE7D,KAAM,cAChBU,IAAO,CAAEV,KAAM,CAAC,SAAU,WAC1BgH,IAAO,CAAEhH,KAAM,YACf,WAAY,CAAEA,KAAM,MAAOiH,MAAM,IAEnCb,SAAU,CACR,CAAEC,cAAe,CAAC,OAAQ,MAAO,QACjC,CAAEA,cAAe,CAAC,OAAQ,MAAO,MAAO,cAE1CC,YAAa,wOAKbC,QAAS,CAAC,uBAAwB,SAClCC,SAAU,CACR,kFAIA,8HAWN,YAAa,CACXf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,2DAClC8G,MAAO,CAAEC,IAAK,GACdkB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,cACjBiG,KAAM,CACJpC,KAAQ,CAAE7D,KAAM,cAChB6G,GAAM,CAAE7G,KAAM,SACdgH,IAAO,CAAEhH,KAAM,YACf,WAAY,CAAEA,KAAM,MAAOiH,MAAM,IAEnCb,SAAU,CACR,CAAEC,cAAe,CAAC,OAAQ,KAAM,QAChC,CAAEA,cAAe,CAAC,OAAQ,KAAM,MAAO,cAEzCC,YAAa,8RAIbC,QAAS,CAAC,oBAAqB,sBAAuB,qBACtDC,SAAU,CACR,iHAOA,wHAOA,wHAOA,mHAaNU,QAAW,CACTzB,SAAU,KAAQ,MAAM,IAAI5H,MAAM,yDAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,cACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CACDnG,KAAM,WACNsG,YAAa,uIAGjBF,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,kNACbC,QAAS,CAAC,SAAU,mBACpBC,SAAU,CACR,2EACA,2EACA,6EAINW,KAAQ,CACN1B,SAAU,KAAQ,MAAM,IAAI5H,MAAM,sDAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,cACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CACDnG,KAAM,WACNsG,YAAa,uIAGjBF,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,2NACbC,QAAS,CAAC,MAAO,sBACjBC,SAAU,CACR,mEACA,mEACA,mEACA,mEACA,2EAINY,QAAW,CACT3B,SAAU,KAAQ,MAAM,IAAI5H,MAAM,yDAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,OACjBiG,KAAM,CACJpC,KAAM,CAAE7D,KAAM,cACdgH,IAAK,CACHhH,KAAM,WACNsG,YAAa,0JAEfe,QAAS,CACPrH,KAAM,MACNsG,YAAa,iDAGjBF,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,MAAO,aAC5CC,YAAa,6WACbC,QAAS,CAAC,SAAU,2BAA4B,0BAChDC,SAAU,CACR,oFACA,sFACA,8EAIN,eAAgB,CACdf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,8DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,OACjBiG,KAAM,CACJe,IAAK,CAAEhH,KAAM,YACb6D,KAAM,CAAE7D,KAAM,cACdqH,QAAS,CAAErH,KAAM,QAEnBoG,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,MAAO,aAC5CC,YAAa,wPACbC,QAAS,CAAC,SAAU,4BACpBC,SAAU,CACR,yEACA,wEAIN,gBAAiB,CACff,SAAU,KAAQ,MAAM,IAAI5H,MAAM,+DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,OACjBiG,KAAM,CACJpC,KAAM,CAAE7D,KAAM,cACdgH,IAAK,CACHhH,KAAM,WACNsG,YAAa,0JAEfe,QAAS,CACPrH,KAAM,MACNsG,YAAa,iDAGjBF,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,MAAO,aAC5CC,YAAa,2YACbC,QAAS,CAAC,qBAAsB,2BAChCC,SAAU,CACR,0FACA,4FACA,oFAINc,WAAc,CACZ7B,SAAU,KAAQ,MAAM,IAAI5H,MAAM,4DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,MAAO8G,OAAO,GAC/Bb,KAAM,CACJe,IAAK,CAAEhH,KAAM,YACb6D,KAAM,CAAE7D,KAAM,cACdqH,QAAS,CAAErH,KAAM,QAEnBoG,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,MAAO,aAC5CC,YAAa,gGACbC,QAAS,CAAC,SAAU,0BACpBC,SAAU,CACR,8DACA,+DACA,uDACA,mEACA,uJAUNe,YAAe,CACb9B,SAAU,KAAQ,MAAM,IAAI5H,MAAM,6DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,MAAO8G,OAAO,GAC/Bb,KAAM,CACJpC,KAAM,CAAE7D,KAAM,cACdgH,IAAK,CACHhH,KAAM,WACNsG,YAAa,0JAEfe,QAAS,CACPrH,KAAM,MACNsG,YAAa,iDAGjBF,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,MAAO,aAC5CC,YAAa,mPACbC,QAAS,CAAC,wBAAyB,sBACnCC,SAAU,CACR,wFACA,0FACA,kFAIN,YAAa,CACXf,SAAU,EAAE5B,GAAO3G,IACJ,OAAT2G,EACK,MAETpC,EAAWoC,EAAM3G,GACG,iBAAT2G,GAGPxD,MAAMC,QAAQuD,GAFTA,EAAKrG,OAAS,EAAIqG,EAAO,KAK3BrF,OAAOgC,KAAKqD,GAAMrG,OAAS,EAAIqG,EAAO,MAE/Cc,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,OACjBiG,KAAM,CACJpC,KAAM,CAAE7D,KAAM,CAAC,aAAc,UAE/BoG,SAAU,CAAC,CAAEC,cAAe,CAAC,UAC7BC,YAAa,+DACbC,QAAS,CAAC,SAAU,cACpBC,SAAU,CACR,gDACA,uDACA,gDACA,sDACA,gDACA,sDACA,qDAIN,SAAU,CACRf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,wDAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,WACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CAAEnG,KAAM,aAEboG,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,kGACbC,QAAS,CAAC,kBAAmB,wBAAyB,sBAAuB,wBAAyB,oBACtGC,SAAU,CACR,6DACA,2DACA,iGAMA,sFAMA,sDACA,sDACA,sDACA,yFAMA,6FASN,OAAQ,CACNf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,sDAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,WACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CAAEnG,KAAM,aAEboG,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,kGACbC,QAAS,CAAC,oBAAqB,sBAAuB,wBAAyB,uBAAwB,OAAQ,cAC/GC,SAAU,CACR,8FAMA,qFAMA,oDACA,oDACA,oDACA,wFAMA,2FASN,WAAY,CACVf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,0DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,WACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CAAEnG,KAAM,aAEboG,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,kGACbC,QAAS,CAAC,kBAAmB,oBAAqB,yBAClDC,SAAU,CACR,kGAMA,yFAMA,wDACA,wDACA,wDACA,4FAMA,+FASN,aAAc,CACZf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,4DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,WACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CAAEnG,KAAM,aAEboG,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,oHACbC,QAAS,CAAC,oBAAqB,kBAAmB,uBAClDC,SAAU,CACR,oGAMA,2FAMA,0DACA,0DACA,0DACA,8FAMA,kGAWKgB,EAAqC,CAChD7I,KAAM,aACN8I,UAAWjC,EACXkC,OChsBa,o3ODisBb5B,MEpqBsC2B,EFoqBRjC,EEnqBvBhH,OAAOmJ,YACZnJ,OAAOyF,QAAQwD,GAAWnD,IAAI,EAAEsD,EAAGC,MACjC,IAAKA,EAAE/B,KACL,MAAM,IAAIjI,MAAM,8BAA8B+J,MAChD,MAAO,CAACA,EAAGC,EAAE/B,WALb,IAAkC2B"}

package/dist/modules/collection.js

@@ -1,2 +0,0 @@
-"use strict";function e(e){if(!e.position||!e.code)return"";const n=e.position.column-1,t=e.code.length-n-1;return`${" ".repeat(Math.max(n,0))}^${" ".repeat(Math.max(t,0))}`}class n extends Error{sourceCodeInfo;shortMessage;constructor(t,o){const c=t instanceof Error?t.message:`${t}`;super(function(n,t){if(!t)return n;const o=`${t.position.line}:${t.position.column}`;return`${n}${t.filePath?`\n${t.filePath}:${o}`:`\nLocation ${o}`}\n${t.code}\n${e(t)}`}(c,o)),this.shortMessage=c,this.sourceCodeInfo=o,Object.setPrototypeOf(this,n.prototype),this.name="DvalaError"}getCodeMarker(){return this.sourceCodeInfo&&e(this.sourceCodeInfo)}}const t={Number:1,String:2,NormalExpression:3,SpecialExpression:4,UserDefinedSymbol:5,NormalBuiltinSymbol:6,SpecialBuiltinSymbol:7,ReservedSymbol:8,Binding:9,Spread:10},o=new Set(Object.values(t));const c=new Set(["UserDefined","Partial","Comp","Constantly","Juxt","Complement","EveryPred","SomePred","Fnull","EffectMatcher","Builtin","SpecialBuiltin","Module"]);const l="^^fn^^",i="^^re^^",r="^^ef^^";function a(e){return null!==e&&"object"==typeof e&&(l in e&&"functionType"in e&&("string"==typeof(n=e.functionType)&&c.has(n)));var n}function u(e){return!(!Array.isArray(e)||e.length<2)&&("number"==typeof(n=e[0])&&o.has(n));var n}function s(e){return a(e)?`<function ${e.name||"λ"}>`:u(e)?`${n=e[0],Object.keys(t).find(e=>t[e]===n)}-node`:null===e?"null":"object"==typeof e&&e instanceof RegExp?`${e}`:"object"==typeof e&&e instanceof Error?e.toString():JSON.stringify(e);var n}function d(e,n){return e?.sourceCodeInfo??n}function p(e,t,o){return new n(`Expected ${e}, got ${s(t)}.`,d(t,o))}function f(e){return!(null===e||"object"!=typeof e||Array.isArray(e)||e instanceof RegExp||function(e){return null!==e&&"object"==typeof e&&!!e[l]}(e)||(n=e,null!==n&&"object"==typeof n&&n[i])||function(e){return null!==e&&"object"==typeof e&&!!e[r]}(e));var n}function m(e){return function(e){return Array.isArray(e)||"string"==typeof e}(e)||f(e)}function h(e,n){return y(e,n),e}function y(e,n){if(!m(e))throw p("string, array or object",e,n)}function g(e,n={}){return"number"==typeof e&&(!Number.isNaN(e)&&(!(n.integer&&!Number.isInteger(e))&&(!(n.finite&&!Number.isFinite(e))&&((!n.zero||0===e)&&((!n.nonZero||0!==e)&&(!(n.positive&&e<=0)&&(!(n.negative&&e>=0)&&(!(n.nonPositive&&e>0)&&(!(n.nonNegative&&e<0)&&(!("number"==typeof n.gt&&e<=n.gt)&&(!("number"==typeof n.gte&&e<n.gte)&&(!("number"==typeof n.lt&&e>=n.lt)&&!("number"==typeof n.lte&&e>n.lte)))))))))))))}function v(e,t,o={}){if(!g(e,o))throw new n(`Expected ${function(e){if(e.zero)return"zero";const n=function(e){return e.positive?"positive":e.negative?"negative":e.nonNegative?"non negative":e.nonPositive?"non positive":e.nonZero?"non zero":""}(e),t=e.integer?"integer":"number",o=e.finite?"finite":"",c=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[n,o,t,c].filter(e=>!!e).join(" ")}(o)}, got ${s(e)}.`,d(e,t))}function b(e,n,t={}){if(!function(e,n={}){return!("string"!=typeof e||n.nonEmpty&&0===e.length||n.char&&1!==e.length)}(e,t))throw p(""+(t.nonEmpty?"non empty string":t.char?"character":"string"),e,n)}function x(e,n){return k(e,n),e}function k(e,n){if(!function(e){return"string"==typeof e||"number"==typeof e}(e))throw p("string or number",e,n)}function $(e,n){return!!m(e)&&("string"==typeof e||Array.isArray(e)?!!g(n,{integer:!0})&&(n>=0&&n<e.length):!!Object.getOwnPropertyDescriptor(e,n))}function w(e){return e??null}function A(e){return f(e)?Object.entries(e).reduce((e,n)=>{const[t,o]=n;return e[t]=A(o),e},{}):Array.isArray(e)?e.map(e=>A(e)):e}function E(e){return A(e)}function j(e,n){if(!Array.isArray(e))throw p("array",e,n)}function N(e){return{min:e,max:e}}function T(e,n){if(f(e)){if("string"==typeof n&&$(e,n))return w(e[n])}else if(g(n,{nonNegative:!0,integer:!0})&&n>=0&&n<e.length)return w(e[n])}function D(e,n,t,o){if(y(e,o),Array.isArray(e)||"string"==typeof e){if(v(n,o,{integer:!0}),v(n,o,{gte:0}),v(n,o,{lte:e.length}),"string"==typeof e)return b(t,o,{char:!0}),`${e.slice(0,n)}${t}${e.slice(n+1)}`;const c=[...e];return c[n]=t,c}b(n,o);const c={...e};return c[n]=t,c}function M(e,n,t){const o=E(e);return{coll:o,innerCollMeta:n.slice(0,n.length-1).reduce((e,n)=>{const o=e.coll;let c;return Array.isArray(o)?(v(n,t),c=h(o[n],t)):(!function(e,n){if(!f(e))throw p("object",e,n)}(o,t),b(n,t),$(e.coll,n)||(o[n]={}),c=h(o[n],t)),{coll:c,parent:o}},{coll:o,parent:{}})}}const R={"get-in":{evaluate:(e,n)=>{let t=w(e[0]);const o=e[1]??[],c=w(e[2]);j(o,n);for(const e of o){if(k(e,n),!m(t))return c;{const n=T(t,e);if(void 0===n)return c;t=n}}return t},arity:{min:2,max:3},docs:{category:"collection",returns:{type:"any"},args:{a:{type:"collection"},b:{type:"array"},"not-found":{type:"any"}},variants:[{argumentNames:["a","b"]},{argumentNames:["a","b","not-found"]}],description:"Returns the value in a nested collection, where $b is an array of keys. Returns $not-found if the key is not present. If $not-found is not set, `null` is returned.",seeAlso:["get","collection.assoc-in","collection.update-in"],examples:['\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: "Kalle" }, 6]],\n  [1, 1, "a", 0]\n)','\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: "Kalle" }, 6]],\n  [1, 1, "b", 0]\n)','\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: "Kalle" }, 6]],\n  [1, 1, "b", 0],\n  "Lisa"\n)']}},"assoc-in":{evaluate:([e,n,t],o)=>{if(y(e,o),j(n,o),function(e,n){if(!function(e){return void 0!==e}(e))throw p("not undefined",e,n)}(t,o),1===n.length)return k(n[0],o),D(e,n[0],t,o);const{coll:c,innerCollMeta:l}=M(e,n,o),i=x(n[n.length-1],o),r=x(n[n.length-2],o);return Array.isArray(l.parent)?(v(r,o),l.parent[r]=D(l.coll,i,t,o)):(b(r,o),l.parent[r]=D(l.coll,i,t,o)),c},arity:N(3),docs:{category:"collection",returns:{type:"collection"},args:{coll:{type:"collection"},ks:{type:["number","string"],array:!0},value:{type:"any"}},variants:[{argumentNames:["coll","ks","value"]}],description:"\nAssociates a value in the nested collection $coll, where $ks is an array of keys and $value is the new value.\n\nIf any levels do not exist, objects will be created - and the corresponding keys must be of type string.",seeAlso:["assoc","collection.get-in","collection.update-in"],examples:['\nlet cu = import(collection);\ncu.assoc-in(\n  {},\n  ["a", "b", "c"],\n  "Albert"\n)','\nlet cu = import(collection);\ncu.assoc-in(\n  [1, 2, [1, 2, 3]],\n  [2, 1],\n  "Albert"\n)','\nlet cu = import(collection);\ncu.assoc-in(\n  [1, 2, { name: "albert" }],\n  [2, "name", 0],\n  "A"\n)']}},update:{evaluate:()=>{throw new Error("update: Dvala implementation should be used instead")},arity:{min:3},docs:{category:"collection",returns:{type:"collection"},args:{coll:{type:"collection"},key:{type:["string","number"]},fun:{type:"function"},"fun-args":{type:"any",rest:!0}},variants:[{argumentNames:["coll","key","fun"]},{argumentNames:["coll","key","fun","fun-args"]}],description:"\nUpdates a value in the $coll collection, where $key is a key. $fun is a function\nthat will take the old value and any supplied $fun-args and\nreturn the new value.\nIf the key does not exist, `null` is passed as the old value.",seeAlso:["collection.update-in","assoc"],examples:['\nlet cu = import(collection);\nlet x = { a: 1, b: 2 };\ncu.update(x, "a", inc)','\nlet cu = import(collection);\nlet x = { a: 1, b: 2 };\ncu.update(\n  x,\n  "c",\n  val -> null?(val) ? 0 : inc(val)\n)']}},"update-in":{evaluate:()=>{throw new Error("update-in: Dvala implementation should be used instead")},arity:{min:3},docs:{category:"collection",returns:{type:"collection"},args:{coll:{type:"collection"},ks:{type:"array"},fun:{type:"function"},"fun-args":{type:"any",rest:!0}},variants:[{argumentNames:["coll","ks","fun"]},{argumentNames:["coll","ks","fun","fun-args"]}],description:"Updates a value in the $coll collection, where $ks is an array of\nkeys and $fun is a function that will take the old value and\nany supplied $fun-args and return the new value. If any levels do not exist,\nobjects will be created - and the corresponding keys must be of type string.",seeAlso:["collection.update","collection.assoc-in","collection.get-in"],examples:['\nlet cu = import(collection);\ncu.update-in(\n  { a: [1, 2, 3] },\n  ["a", 1],\n  -> null?($) ? 0 : inc($)\n)','\nlet cu = import(collection);\ncu.update-in(\n  { a: { foo: "bar"} },\n  ["a", "foo"],\n  -> null?($) ? "?" : "!"\n)','\nlet cu = import(collection);\ncu.update-in(\n  { a: { foo: "bar"} },\n  ["a", "baz"],\n  -> null?($) ? "?" : "!"\n)','\nlet cu = import(collection);\ncu.update-in(\n  { a: [1, 2, 3] },\n  ["a", 1],\n  *,\n  10,\n  10,\n  10,\n)']}},filteri:{evaluate:()=>{throw new Error("filteri: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"collection"},args:{a:{type:"collection"},b:{type:"function",description:"The function to call for each element in the collection. The function should take two arguments: the element itself and the index."}},variants:[{argumentNames:["a","b"]}],description:"Creates a new collection with all elements that pass the test implemented by $b. The function is called for each element in the collection, and it should take two arguments: the element itself and the index.",seeAlso:["filter","collection.mapi"],examples:["let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> i % 2 == 0)","let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> x % 2 == 0)","let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> x + i > 3)"]}},mapi:{evaluate:()=>{throw new Error("mapi: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"collection"},args:{a:{type:"collection"},b:{type:"function",description:"The function to call for each element in the collection. The function should take two arguments: the element itself and the index."}},variants:[{argumentNames:["a","b"]}],description:"Creates a new collection populated with the results of calling $b on every element in $a. The function is called for each element in the collection, and it should take two arguments: the element itself and the index.",seeAlso:["map","collection.filteri"],examples:["let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x + i)","let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x * i)","let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x - i)","let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x / i)","let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x % inc(i))"]}},reducei:{evaluate:()=>{throw new Error("reducei: Dvala implementation should be used instead")},arity:N(3),docs:{category:"collection",returns:{type:"any"},args:{coll:{type:"collection"},fun:{type:"function",description:"The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index."},initial:{type:"any",description:"The initial value to use as the accumulator."}},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. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.",seeAlso:["reduce","collection.reducei-right","collection.reductionsi"],examples:["let cu = import(collection); cu.reducei([1, 2, 3], (acc, x, i) -> acc + x + i, 0)",'let cu = import(collection); cu.reducei("Albert", (acc, x, i) -> acc ++ x ++ i, "")','let cu = import(collection); cu.reducei({ a: 1, b: 2 }, -> $1 ++ $3, "")']}},"reduce-right":{evaluate:()=>{throw new Error("reduce-right: Dvala implementation should be used instead")},arity:N(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 (starting from the last item), 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:["reduce","collection.reducei-right"],examples:['let cu = import(collection); cu.reduce-right(["A", "B", "C"], str, "")',"let cu = import(collection); cu.reduce-right({ a: 1, b: 2 }, +, 0)"]}},"reducei-right":{evaluate:()=>{throw new Error("reducei-right: Dvala implementation should be used instead")},arity:N(3),docs:{category:"collection",returns:{type:"any"},args:{coll:{type:"collection"},fun:{type:"function",description:"The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index."},initial:{type:"any",description:"The initial value to use as the accumulator."}},variants:[{argumentNames:["coll","fun","initial"]}],description:"Runs $fun function on each element of the $coll (starting from the last item), 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. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.",seeAlso:["collection.reducei","collection.reduce-right"],examples:["let cu = import(collection); cu.reducei-right([1, 2, 3], (acc, x, i) -> acc + x + i, 0)",'let cu = import(collection); cu.reducei-right("Albert", (acc, x, i) -> acc ++ x ++ i, "")','let cu = import(collection); cu.reducei-right({ a: 1, b: 2 }, -> $1 ++ $3, "")']}},reductions:{evaluate:()=>{throw new Error("reductions: Dvala implementation should be used instead")},arity:N(3),docs:{category:"collection",returns:{type:"any",array:!0},args:{fun:{type:"function"},coll:{type:"collection"},initial:{type:"any"}},variants:[{argumentNames:["coll","fun","initial"]}],description:"Returns an array of the intermediate values of the reduction (see `reduce`) of $coll by $fun.",seeAlso:["reduce","collection.reductionsi"],examples:["let cu = import(collection); cu.reductions([1, 2, 3], +, 0)","let cu = import(collection); cu.reductions([1, 2, 3], +, 10)","let cu = import(collection); cu.reductions([], +, 0)","let cu = import(collection); cu.reductions({ a: 1, b: 2 }, +, 0)","\nlet cu = import(collection);\ncu.reductions(\n  [1, 2, 3, 4, 5, 6, 7, 8, 9],\n  (result, value) -> result + (even?(value) ? value : 0),\n  0\n)"]}},reductionsi:{evaluate:()=>{throw new Error("reductionsi: Dvala implementation should be used instead")},arity:N(3),docs:{category:"collection",returns:{type:"any",array:!0},args:{coll:{type:"collection"},fun:{type:"function",description:"The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index."},initial:{type:"any",description:"The initial value to use as the accumulator."}},variants:[{argumentNames:["coll","fun","initial"]}],description:"Returns an array of the intermediate values of the reduction (see `reduce`) of $coll by $fun. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.",seeAlso:["collection.reductions","collection.reducei"],examples:["let cu = import(collection); cu.reductionsi([1, 2, 3], (acc, x, i) -> acc + x + i, 0)",'let cu = import(collection); cu.reductionsi("Albert", (acc, x, i) -> acc ++ x ++ i, "")','let cu = import(collection); cu.reductionsi({ a: 1, b: 2 }, -> $1 ++ $3, "")']}},"not-empty":{evaluate:([e],n)=>null===e?null:(y(e,n),"string"==typeof e||Array.isArray(e)?e.length>0?e:null:Object.keys(e).length>0?e:null),arity:N(1),docs:{category:"collection",returns:{type:"any"},args:{coll:{type:["collection","null"]}},variants:[{argumentNames:["coll"]}],description:"Returns `null` if $coll is empty or `null`, otherwise $coll.",seeAlso:["empty?","not-empty?"],examples:["let cu = import(collection); cu.not-empty([])","let cu = import(collection); cu.not-empty([1, 2, 3])","let cu = import(collection); cu.not-empty({})","let cu = import(collection); cu.not-empty({ a: 2 })",'let cu = import(collection); cu.not-empty("")','let cu = import(collection); cu.not-empty("Albert")',"let cu = import(collection); cu.not-empty(null)"]}},"every?":{evaluate:()=>{throw new Error("every?: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"boolean"},args:{a:{type:"collection"},b:{type:"function"}},variants:[{argumentNames:["a","b"]}],description:"Returns `true` if all entries in $a pass the test implemented by $b, otherwise returns `false`.",seeAlso:["collection.any?","collection.not-every?","collection.not-any?","functional.every-pred","grid.cell-every?"],examples:["let cu = import(collection); cu.every?([1, 2, 3], number?)","let cu = import(collection); cu.every?([1, 2, 3], even?)",'\nlet cu = import(collection);\ncu.every?(\n  ["Albert", "Mojir", 160, [1, 2]],\n  string?,\n)',"\nlet cu = import(collection);\ncu.every?(\n  [50, 100, 150, 200],\n  -> $ > 10,\n)","let cu = import(collection); cu.every?([], number?)",'let cu = import(collection); cu.every?("", number?)',"let cu = import(collection); cu.every?({}, number?)","\nlet cu = import(collection);\ncu.every?(\n  { a: 2, b: 4},\n  -> even?(second($))\n)","\nlet cu = import(collection);\ncu.every?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)"]}},"any?":{evaluate:()=>{throw new Error("any?: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"boolean"},args:{a:{type:"collection"},b:{type:"function"}},variants:[{argumentNames:["a","b"]}],description:"Returns `true` if any element in $a pass the test implemented by $b, otherwise returns `false`.",seeAlso:["collection.every?","collection.not-any?","collection.not-every?","functional.some-pred","some","grid.some?"],examples:['\nlet cu = import(collection);\ncu.any?(\n  ["Albert", "Mojir", 160, [1, 2]],\n  string?\n)',"\nlet cu = import(collection);\ncu.any?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)","let cu = import(collection); cu.any?([], number?)",'let cu = import(collection); cu.any?("", number?)',"let cu = import(collection); cu.any?({}, number?)","\nlet cu = import(collection);\ncu.any?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)","\nlet cu = import(collection);\ncu.any?(\n  { a: 1, b: 3 },\n  -> even?(second($))\n)"]}},"not-any?":{evaluate:()=>{throw new Error("not-any?: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"boolean"},args:{a:{type:"collection"},b:{type:"function"}},variants:[{argumentNames:["a","b"]}],description:"Returns `false` if any element in $a pass the test implemented by $b, otherwise returns `true`.",seeAlso:["collection.any?","collection.every?","collection.not-every?"],examples:['\nlet cu = import(collection);\ncu.not-any?(\n  ["Albert", "Mojir", 160, [1, 2]],\n  string?\n)',"\nlet cu = import(collection);\ncu.not-any?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)","let cu = import(collection); cu.not-any?([], number?)",'let cu = import(collection); cu.not-any?("", number?)',"let cu = import(collection); cu.not-any?({}, number?)","\nlet cu = import(collection);\ncu.not-any?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)","\nlet cu = import(collection);\ncu.not-any?(\n  { a: 1, b: 3 },\n  -> even?(second($))\n)"]}},"not-every?":{evaluate:()=>{throw new Error("not-every?: Dvala implementation should be used instead")},arity:N(2),docs:{category:"collection",returns:{type:"boolean"},args:{a:{type:"collection"},b:{type:"function"}},variants:[{argumentNames:["a","b"]}],description:"Returns `true` if at least one element in $a does not pass the test implemented by $b, otherwise returns `false`.",seeAlso:["collection.every?","collection.any?","collection.not-any?"],examples:['\nlet cu = import(collection);\ncu.not-every?(\n  ["Albert", "Mojir", 160, [1, 2]],\n  string?\n)',"\nlet cu = import(collection);\ncu.not-every?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)","let cu = import(collection); cu.not-every?([], number?)",'let cu = import(collection); cu.not-every?("", number?)',"let cu = import(collection); cu.not-every?({}, number?)","\nlet cu = import(collection);\ncu.not-every?(\n  { a: 2, b: 4 },\n  -> even?(second($))\n)","\nlet cu = import(collection);\ncu.not-every?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)"]}}},C={name:"collection",functions:R,source:'{\n  update: (coll, key, fn, ...extra-params) ->\n    assoc(coll, key, apply(fn, [get(coll, key), ...extra-params])),\n\n  update-in: (coll, ks, fn, ...extra-params) -> do\n    let k = first(ks);\n    if count(ks) == 1 then\n      assoc(coll, k, apply(fn, [get(coll, k), ...extra-params]))\n    else\n      let inner = get(coll, k);\n      let inner-coll = null?(inner) ? {} : inner;\n      assoc(coll, k, apply(self, [inner-coll, slice(ks, 1), fn, ...extra-params]))\n    end\n  end,\n\n  filteri: (coll, fn) -> do\n    cond\n      case array?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> [nth(coll, i), i],\n          (acc, pair) -> if fn(first(pair), second(pair)) then [...acc, first(pair)] else acc end,\n          []\n        )\n\n      case string?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> [nth(coll, i), i],\n          (acc, pair) -> if fn(first(pair), second(pair)) then ++(acc, first(pair)) else acc end,\n          ""\n        )\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) ->\n          if fn(coll(k), k) then assoc(acc, k, coll(k)) else acc end,\n          {}\n        )\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  mapi: (coll, fn) -> do\n    cond\n      case array?(coll) then\n        for (i in range(count(coll))) -> fn(nth(coll, i), i)\n\n      case string?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> fn(nth(coll, i), i),\n          (acc, ch) -> ++(acc, ch),\n          ""\n        )\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) ->\n          assoc(acc, k, fn(coll(k), k)),\n          {}\n        )\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  reducei: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        loop (acc = initial, i = 0) -> do\n          if i >= count(coll) then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i + 1)\n          end\n        end\n\n      case array?(coll) then\n        loop (acc = initial, i = 0) -> do\n          if i >= count(coll) then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i + 1)\n          end\n        end\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) -> fn(acc, coll(k), k), initial)\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  reduce-right: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        reduce(reverse(coll), fn, initial)\n\n      case array?(coll) then\n        reduce(reverse(coll), fn, initial)\n\n      case object?(coll) then\n        reduce(reverse(keys(coll)), (acc, k) -> fn(acc, coll(k)), initial)\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  reducei-right: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        let len = count(coll);\n        loop (acc = initial, i = len - 1) -> do\n          if i < 0 then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i - 1)\n          end\n        end\n\n      case array?(coll) then\n        let len = count(coll);\n        loop (acc = initial, i = len - 1) -> do\n          if i < 0 then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i - 1)\n          end\n        end\n\n      case object?(coll) then\n        reduce(reverse(keys(coll)), (acc, k) -> fn(acc, coll(k), k), initial)\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  reductions: (coll, fn, initial) -> do\n    let items = cond\n      case string?(coll) then\n        if count(coll) == 0 then [] else for (i in range(count(coll))) -> nth(coll, i) end\n\n      case array?(coll) then coll\n\n      case object?(coll) then\n        for (k in keys(coll)) -> coll(k)\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end;\n    if count(items) == 0 then\n      [initial]\n    else\n      reduce(items, (acc, elem) -> do\n        let prev = last(acc);\n        [...acc, fn(prev, elem)]\n      end, [initial])\n    end\n  end,\n\n  reductionsi: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then do\n        if count(coll) == 0 then\n          [initial]\n        else\n          reduce(\n            for (i in range(count(coll))) -> [nth(coll, i), i],\n            (acc, pair) -> do\n              let prev = last(acc);\n              [...acc, fn(prev, first(pair), second(pair))]\n            end,\n            [initial]\n          )\n        end\n      end\n\n      case array?(coll) then do\n        if count(coll) == 0 then\n          [initial]\n        else\n          reduce(\n            for (i in range(count(coll))) -> [nth(coll, i), i],\n            (acc, pair) -> do\n              let prev = last(acc);\n              [...acc, fn(prev, first(pair), second(pair))]\n            end,\n            [initial]\n          )\n        end\n      end\n\n      case object?(coll) then do\n        let ks = keys(coll);\n        if count(ks) == 0 then\n          [initial]\n        else\n          reduce(ks, (acc, k) -> do\n            let prev = last(acc);\n            [...acc, fn(prev, coll(k), k)]\n          end, [initial])\n        end\n      end\n\n      case true then\n        perform(effect(dvala.error), "Expected collection")\n    end\n  end,\n\n  "every?": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), "Expected collection")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then true\n        case not(fn(nth(items, i))) then false\n        case true then recur(i + 1)\n      end\n  end,\n\n  "any?": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), "Expected collection")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then false\n        case fn(nth(items, i)) then true\n        case true then recur(i + 1)\n      end\n  end,\n\n  "not-any?": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), "Expected collection")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then true\n        case fn(nth(items, i)) then false\n        case true then recur(i + 1)\n      end\n  end,\n\n  "not-every?": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), "Expected collection")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then false\n        case not(fn(nth(items, i))) then true\n        case true then recur(i + 1)\n      end\n  end\n}',docs:(S=R,Object.fromEntries(Object.entries(S).map(([e,n])=>{if(!n.docs)throw new Error(`Missing docs for function "${e}"`);return[e,n.docs]})))};var S;exports.collectionUtilsModule=C;
-//# sourceMappingURL=collection.js.map

package/dist/modules/collection.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"collection.js","sources":["../../src/utils/debug/getCodeMarker.ts","../../src/errors.ts","../../src/constants/constants.ts","../../src/utils/symbols.ts","../../src/utils/debug/debugTools.ts","../../src/utils/debug/getSourceCodeInfo.ts","../../src/utils/getAssertionError.ts","../../src/typeGuards/dvala.ts","../../src/typeGuards/dvalaFunction.ts","../../src/typeGuards/number.ts","../../src/typeGuards/string.ts","../../src/utils/index.ts","../../src/typeGuards/array.ts","../../src/utils/arity.ts","../../src/builtin/modules/collection/index.ts","../../src/builtin/modules/collection/collection.dvala","../../src/builtin/modules/interface.ts"],"sourcesContent":["import type { SourceCodeInfo } from '../../tokenizer/token'\n\nexport function getCodeMarker(sourceCodeInfo: SourceCodeInfo): string {\n  if (!sourceCodeInfo.position || !sourceCodeInfo.code)\n    return ''\n\n  const leftPadding = sourceCodeInfo.position.column - 1\n  const rightPadding = sourceCodeInfo.code.length - leftPadding - 1\n  return `${' '.repeat(Math.max(leftPadding, 0))}^${' '.repeat(Math.max(rightPadding, 0))}`\n}\n","import { getCodeMarker } from '../src/utils/debug/getCodeMarker'\nimport type { Arr } from './interface'\nimport type { SourceCodeInfo } from './tokenizer/token'\n\nfunction getDvalaErrorMessage(message: string, sourceCodeInfo?: SourceCodeInfo) {\n  if (!sourceCodeInfo) {\n    return message\n  }\n  const location = `${sourceCodeInfo.position.line}:${sourceCodeInfo.position.column}`\n  const filePathLine = sourceCodeInfo.filePath\n    ? `\\n${sourceCodeInfo.filePath}:${location}`\n    : `\\nLocation ${location}`\n  const codeLine = `\\n${sourceCodeInfo.code}`\n  const codeMarker = `\\n${getCodeMarker(sourceCodeInfo)}`\n  return `${message}${filePathLine}${codeLine}${codeMarker}`\n}\n\nexport class RecurSignal extends Error {\n  public params: Arr\n  constructor(params: Arr) {\n    super(`recur, params: ${params}`)\n    Object.setPrototypeOf(this, RecurSignal.prototype)\n    this.name = 'RecurSignal'\n    this.params = params\n  }\n}\n\nexport class DvalaError extends Error {\n  public readonly sourceCodeInfo?: SourceCodeInfo\n  public readonly shortMessage: string\n  constructor(err: unknown, sourceCodeInfo: SourceCodeInfo | undefined) {\n    const message = err instanceof Error\n      ? err.message\n      : `${err}`\n\n    super(getDvalaErrorMessage(message, sourceCodeInfo))\n    this.shortMessage = message\n    this.sourceCodeInfo = sourceCodeInfo\n    Object.setPrototypeOf(this, DvalaError.prototype)\n    this.name = 'DvalaError'\n  }\n\n  public getCodeMarker(): string | undefined {\n    return this.sourceCodeInfo && getCodeMarker(this.sourceCodeInfo)\n  }\n}\n\nexport class UserDefinedError extends DvalaError {\n  public userMessage: string\n  constructor(message: string, sourceCodeInfo?: SourceCodeInfo) {\n    super(message, sourceCodeInfo)\n    this.userMessage = message\n    Object.setPrototypeOf(this, UserDefinedError.prototype)\n    this.name = 'UserDefinedError'\n  }\n}\n\nexport class AssertionError extends DvalaError {\n  constructor(message: string | Error, sourceCodeInfo?: SourceCodeInfo) {\n    super(message, sourceCodeInfo)\n    Object.setPrototypeOf(this, AssertionError.prototype)\n    this.name = 'AssertionError'\n  }\n}\n\nexport class UndefinedSymbolError extends DvalaError {\n  public symbol: string\n  constructor(symbolName: string, sourceCodeInfo?: SourceCodeInfo) {\n    const message = `Undefined symbol '${symbolName}'.`\n    super(message, sourceCodeInfo)\n    this.symbol = symbolName\n    Object.setPrototypeOf(this, UndefinedSymbolError.prototype)\n    this.name = 'UndefinedSymbolError'\n  }\n}\n\nexport function isDvalaError(error: unknown): error is DvalaError {\n  return error instanceof DvalaError\n}\n","export const NodeTypes = {\n  Number: 1,\n  String: 2,\n  NormalExpression: 3,\n  SpecialExpression: 4,\n  UserDefinedSymbol: 5,\n  NormalBuiltinSymbol: 6,\n  SpecialBuiltinSymbol: 7,\n  ReservedSymbol: 8,\n  Binding: 9,\n  Spread: 10,\n} as const\n\nconst NodeTypesSet = new Set(Object.values(NodeTypes))\n\nexport type NodeType = typeof NodeTypes[keyof typeof NodeTypes]\n\nexport function getNodeTypeName(type: NodeType): keyof typeof NodeTypes {\n  return Object.keys(NodeTypes).find(key => NodeTypes[key as keyof typeof NodeTypes] === type) as keyof typeof NodeTypes\n}\n\n// TODO, is this needed?\nexport function isNodeType(type: unknown): type is NodeType {\n  return typeof type === 'number' && NodeTypesSet.has(type as NodeType)\n}\n\nconst functionTypes = [\n  'UserDefined',\n  'Partial',\n  'Comp',\n  'Constantly',\n  'Juxt',\n  'Complement',\n  'EveryPred',\n  'SomePred',\n  'Fnull',\n  'EffectMatcher',\n  'Builtin',\n  'SpecialBuiltin',\n  'Module',\n] as const\n\nconst functionTypeSet = new Set(functionTypes)\n\nexport type FunctionType = typeof functionTypes[number]\n\nexport function isFunctionType(type: unknown): type is FunctionType {\n  return typeof type === 'string' && functionTypeSet.has(type as FunctionType)\n}\n","export const FUNCTION_SYMBOL = '^^fn^^'\nexport const REGEXP_SYMBOL = '^^re^^'\nexport const EFFECT_SYMBOL = '^^ef^^'\n","import { getNodeTypeName, isFunctionType, isNodeType } from '../../constants/constants'\nimport type { AstNode, DvalaFunction } from '../../parser/types'\nimport { FUNCTION_SYMBOL } from '../symbols'\n\nfunction isDvalaFunction(func: unknown): func is DvalaFunction {\n  if (func === null || typeof func !== 'object')\n    return false\n\n  return FUNCTION_SYMBOL in func && 'functionType' in func && isFunctionType(func.functionType)\n}\n\nfunction isNode(value: unknown): value is AstNode {\n  if (!Array.isArray(value) || value.length < 2)\n    return false\n  return isNodeType(value[0])\n}\n\nexport function valueToString(value: unknown): string {\n  if (isDvalaFunction(value))\n    // eslint-disable-next-line ts/no-unsafe-member-access\n    return `<function ${(value as any).name || '\\u03BB'}>`\n\n  if (isNode(value))\n    return `${getNodeTypeName(value[0])}-node`\n\n  if (value === null)\n    return 'null'\n\n  if (typeof value === 'object' && value instanceof RegExp)\n    return `${value}`\n\n  if (typeof value === 'object' && value instanceof Error)\n    return value.toString()\n\n  return JSON.stringify(value)\n}\n","import type { SourceCodeInfo } from '../../tokenizer/token'\n\nexport function getSourceCodeInfo(anyValue: any, sourceCodeInfo: SourceCodeInfo | undefined): SourceCodeInfo | undefined {\n  // eslint-disable-next-line ts/no-unsafe-return, ts/no-unsafe-member-access\n  return anyValue?.sourceCodeInfo ?? sourceCodeInfo\n}\n","import { DvalaError } from '../errors'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { valueToString } from './debug/debugTools'\nimport { getSourceCodeInfo } from './debug/getSourceCodeInfo'\n\nexport function getAssertionError(typeName: string, value: unknown, sourceCodeInfo?: SourceCodeInfo): DvalaError {\n  return new DvalaError(`Expected ${typeName}, got ${valueToString(value)}.`, getSourceCodeInfo(value, sourceCodeInfo))\n}\n","import type { Any, Coll, Obj, Seq } from '../interface'\nimport type { EffectRef, FunctionLike, RegularExpression } from '../parser/types'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { getAssertionError } from '../utils/getAssertionError'\nimport { EFFECT_SYMBOL, REGEXP_SYMBOL } from '../utils/symbols'\nimport { isDvalaFunction } from './dvalaFunction'\n\nexport function isAny(value: unknown): value is Any {\n  // TODO weak test\n  return value !== undefined\n}\nexport function asAny(value: unknown, sourceCodeInfo?: SourceCodeInfo): Any {\n  assertAny(value, sourceCodeInfo)\n  return value\n}\nexport function assertAny(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is Any {\n  if (!isAny(value))\n    throw getAssertionError('not undefined', value, sourceCodeInfo)\n}\n\nexport function isSeq(value: unknown): value is Seq {\n  return Array.isArray(value) || typeof value === 'string'\n}\nexport function asSeq(value: unknown, sourceCodeInfo?: SourceCodeInfo): Seq {\n  assertSeq(value, sourceCodeInfo)\n  return value\n}\nexport function assertSeq(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is Seq {\n  if (!isSeq(value))\n    throw getAssertionError('string or array', value, sourceCodeInfo)\n}\n\nexport function isObj(value: unknown): value is Obj {\n  return !(\n    value === null\n    || typeof value !== 'object'\n    || Array.isArray(value)\n    || value instanceof RegExp\n    || isDvalaFunction(value)\n    || isRegularExpression(value)\n    || isEffect(value)\n  )\n}\nexport function asObj(value: unknown, sourceCodeInfo?: SourceCodeInfo): Obj {\n  assertObj(value, sourceCodeInfo)\n  return value\n}\nexport function assertObj(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is Obj {\n  if (!isObj(value))\n    throw getAssertionError('object', value, sourceCodeInfo)\n}\n\nexport function isColl(value: unknown): value is Coll {\n  return isSeq(value) || isObj(value)\n}\nexport function asColl(value: unknown, sourceCodeInfo?: SourceCodeInfo): Coll {\n  assertColl(value, sourceCodeInfo)\n  return value\n}\nexport function assertColl(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is Coll {\n  if (!isColl(value))\n    throw getAssertionError('string, array or object', value, sourceCodeInfo)\n}\n\nexport function isRegularExpression(regexp: unknown): regexp is RegularExpression {\n  if (regexp === null || typeof regexp !== 'object')\n    return false\n\n  return !!(regexp as RegularExpression)[REGEXP_SYMBOL]\n}\nexport function asRegularExpression(value: unknown, sourceCodeInfo?: SourceCodeInfo): RegularExpression {\n  assertRegularExpression(value, sourceCodeInfo)\n  return value\n}\nexport function assertRegularExpression(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): asserts value is RegularExpression {\n  if (!isRegularExpression(value))\n    throw getAssertionError('RegularExpression', value, sourceCodeInfo)\n}\n\nexport function isStringOrRegularExpression(value: unknown): value is string | RegularExpression {\n  return isRegularExpression(value) || typeof value === 'string'\n}\nexport function asStringOrRegularExpression(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): string | RegularExpression {\n  assertStringOrRegularExpression(value, sourceCodeInfo)\n  return value\n}\nexport function assertStringOrRegularExpression(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): asserts value is string | RegularExpression {\n  if (!isStringOrRegularExpression(value))\n    throw getAssertionError('string or RegularExpression', value, sourceCodeInfo)\n}\n\nexport function isEffect(value: unknown): value is EffectRef {\n  if (value === null || typeof value !== 'object')\n    return false\n\n  return !!(value as EffectRef)[EFFECT_SYMBOL]\n}\nexport function asEffect(value: unknown, sourceCodeInfo?: SourceCodeInfo): EffectRef {\n  assertEffect(value, sourceCodeInfo)\n  return value\n}\nexport function assertEffect(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): asserts value is EffectRef {\n  if (!isEffect(value))\n    throw getAssertionError('Effect', value, sourceCodeInfo)\n}\n\nfunction isFunctionLike(value: unknown): value is FunctionLike {\n  if (typeof value === 'number')\n    return true\n  if (isColl(value))\n    return true\n  if (isDvalaFunction(value))\n    return true\n\n  return false\n}\nexport function asFunctionLike(value: unknown, sourceCodeInfo?: SourceCodeInfo): FunctionLike {\n  assertFunctionLike(value, sourceCodeInfo)\n  return value\n}\nexport function assertFunctionLike(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is FunctionLike {\n  if (!isFunctionLike(value))\n    throw getAssertionError('FunctionLike', value, sourceCodeInfo)\n}\n","import type { DvalaFunction, NormalBuiltinFunction, UserDefinedFunction } from '../parser/types'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { getAssertionError } from '../utils/getAssertionError'\nimport { FUNCTION_SYMBOL } from '../utils/symbols'\nimport { isUnknownRecord } from '.'\n\nexport function isDvalaFunction(value: unknown): value is DvalaFunction {\n  if (value === null || typeof value !== 'object')\n    return false\n\n  return !!(value as DvalaFunction)[FUNCTION_SYMBOL]\n}\nexport function asDvalaFunction(value: unknown, sourceCodeInfo?: SourceCodeInfo): DvalaFunction {\n  assertDvalaFunction(value, sourceCodeInfo)\n  return value\n}\nexport function assertDvalaFunction(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is DvalaFunction {\n  if (!isDvalaFunction(value))\n    throw getAssertionError('DvalaFunction', value, sourceCodeInfo)\n}\n\nexport function isUserDefinedFunction(value: unknown): value is UserDefinedFunction {\n  return isDvalaFunction(value) && value.functionType === 'UserDefined'\n}\nexport function asUserDefinedFunction(value: unknown, sourceCodeInfo?: SourceCodeInfo): UserDefinedFunction {\n  assertUserDefinedFunction(value, sourceCodeInfo)\n  return value\n}\nexport function assertUserDefinedFunction(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): asserts value is UserDefinedFunction {\n  if (!isUserDefinedFunction(value))\n    throw getAssertionError('UserDefinedFunction', value, sourceCodeInfo)\n}\n\nexport function isBuiltinFunction(value: unknown): value is NormalBuiltinFunction {\n  return isUnknownRecord(value) && value.functionType === 'Builtin'\n}\n","import { DvalaError } from '../errors'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { valueToString } from '../utils/debug/debugTools'\nimport { getSourceCodeInfo } from '../utils/debug/getSourceCodeInfo'\n\ntype SignOptions =\n  | {\n    positive?: true\n    negative?: never\n    nonPositive?: never\n    nonNegative?: never\n    zero?: never\n    nonZero?: never\n  }\n  | {\n    positive?: never\n    negative?: true\n    nonPositive?: never\n    nonNegative?: never\n    zero?: never\n    nonZero?: never\n  }\n  | {\n    positive?: never\n    negative?: never\n    nonPositive?: true\n    nonNegative?: never\n    zero?: never\n    nonZero?: never\n  }\n  | {\n    positive?: never\n    negative?: never\n    nonPositive?: never\n    nonNegative?: true\n    zero?: never\n    nonZero?: never\n  }\n  | {\n    positive?: never\n    negative?: never\n    nonPositive?: never\n    nonNegative?: never\n    zero?: true\n    nonZero?: never\n  }\n  | {\n    positive?: never\n    negative?: never\n    nonPositive?: never\n    nonNegative?: never\n    zero?: never\n    nonZero?: true\n  }\n\ntype GtOptions =\n  | {\n    gt?: number\n    gte?: never\n  }\n  | {\n    gt?: never\n    gte?: number\n  }\n\ntype LtOptions =\n  | {\n    lt?: number\n    lte?: never\n  }\n  | {\n    lt?: never\n    lte?: number\n  }\n\ntype NumberOptions = {\n  integer?: true\n  finite?: true\n} & SignOptions &\nGtOptions &\nLtOptions\n\nfunction getRangeString(options: NumberOptions): string {\n  const hasUpperAndLowerBound\n    = (typeof options.gt === 'number' || typeof options.gte === 'number')\n      && (typeof options.lt === 'number' || typeof options.lte === 'number')\n  if (hasUpperAndLowerBound) {\n    return `${typeof options.gt === 'number' ? `${options.gt} < n ` : `${options.gte} <= n `}${\n      typeof options.lt === 'number' ? `< ${options.lt}` : `<= ${options.lte}`\n    }`\n  }\n  else if (typeof options.gt === 'number' || typeof options.gte === 'number') {\n    return `${typeof options.gt === 'number' ? `n > ${options.gt}` : `n >= ${options.gte}`}`\n  }\n  else if (typeof options.lt === 'number' || typeof options.lte === 'number') {\n    return `${typeof options.lt === 'number' ? `n < ${options.lt}` : `n <= ${options.lte}`}`\n  }\n  else { return '' }\n}\n\nfunction getSignString(options: NumberOptions): string {\n  return options.positive\n    ? 'positive'\n    : options.negative\n      ? 'negative'\n      : options.nonNegative\n        ? 'non negative'\n        : options.nonPositive\n          ? 'non positive'\n          : options.nonZero\n            ? 'non zero'\n            : ''\n}\n\nfunction getNumberTypeName(options: NumberOptions): string {\n  if (options.zero)\n    return 'zero'\n\n  const sign = getSignString(options)\n  const numberType = options.integer ? 'integer' : 'number'\n  const finite = options.finite ? 'finite' : ''\n  const range = getRangeString(options)\n\n  return [sign, finite, numberType, range].filter(x => !!x).join(' ')\n}\n\nexport function isNumber(value: unknown, options: NumberOptions = {}): value is number {\n  if (typeof value !== 'number')\n    return false\n\n  if (Number.isNaN(value))\n    return false\n\n  if (options.integer && !Number.isInteger(value))\n    return false\n\n  if (options.finite && !Number.isFinite(value))\n    return false\n\n  if (options.zero && value !== 0)\n    return false\n\n  if (options.nonZero && value === 0)\n    return false\n\n  if (options.positive && value <= 0)\n    return false\n\n  if (options.negative && value >= 0)\n    return false\n\n  if (options.nonPositive && value > 0)\n    return false\n\n  if (options.nonNegative && value < 0)\n    return false\n\n  if (typeof options.gt === 'number' && value <= options.gt)\n    return false\n\n  if (typeof options.gte === 'number' && value < options.gte)\n    return false\n\n  if (typeof options.lt === 'number' && value >= options.lt)\n    return false\n\n  if (typeof options.lte === 'number' && value > options.lte)\n    return false\n\n  return true\n}\n\nexport function assertNumber(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n  options: NumberOptions = {},\n): asserts value is number {\n  if (!isNumber(value, options)) {\n    throw new DvalaError(\n      `Expected ${getNumberTypeName(options)}, got ${valueToString(value)}.`,\n      getSourceCodeInfo(value, sourceCodeInfo),\n    )\n  }\n}\n\nexport function asNumber(\n  value: unknown,\n  sourceCodeInfo: SourceCodeInfo | undefined,\n  options: NumberOptions = {},\n): number {\n  assertNumber(value, sourceCodeInfo, options)\n  return value\n}\n","import type { SourceCodeInfo } from '../tokenizer/token'\nimport { getAssertionError } from '../utils/getAssertionError'\n\ntype StringAssertionOptions =\n  | {\n    nonEmpty?: true\n    char?: never\n  }\n  | {\n    nonEmpty?: never\n    char?: true\n  }\n\nexport function isString(value: unknown, options: StringAssertionOptions = {}): value is string {\n  if (typeof value !== 'string')\n    return false\n\n  if (options.nonEmpty && value.length === 0)\n    return false\n\n  if (options.char && value.length !== 1)\n    return false\n\n  return true\n}\n\nexport function assertString(\n  value: unknown,\n  sourceCodeInfo: SourceCodeInfo | undefined,\n  options: StringAssertionOptions = {},\n): asserts value is string {\n  if (!isString(value, options)) {\n    throw getAssertionError(\n      `${options.nonEmpty ? 'non empty string' : options.char ? 'character' : 'string'}`,\n      value,\n      sourceCodeInfo,\n    )\n  }\n}\n\nexport function asString(\n  value: unknown,\n  sourceCodeInfo: SourceCodeInfo | undefined,\n  options: StringAssertionOptions = {},\n): string {\n  assertString(value, sourceCodeInfo, options)\n  return value\n}\n\nexport function isStringOrNumber(value: unknown): value is string | number {\n  return typeof value === 'string' || typeof value === 'number'\n}\nexport function asStringOrNumber(value: unknown, sourceCodeInfo?: SourceCodeInfo): string | number {\n  assertStringOrNumber(value, sourceCodeInfo)\n  return value\n}\nexport function assertStringOrNumber(\n  value: unknown,\n  sourceCodeInfo?: SourceCodeInfo,\n): asserts value is string | number {\n  if (!isStringOrNumber(value))\n    throw getAssertionError('string or number', value, sourceCodeInfo)\n}\n","import type { Any, Coll, Obj } from '../interface'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { asAny, isColl, isObj, isRegularExpression } from '../typeGuards/dvala'\nimport { isNumber } from '../typeGuards/number'\nimport { asString, assertStringOrNumber } from '../typeGuards/string'\nimport { isUnknownRecord } from '../typeGuards'\nimport { DvalaError } from '../errors'\n\nexport function collHasKey(coll: unknown, key: string | number): boolean {\n  if (!isColl(coll))\n    return false\n\n  if (typeof coll === 'string' || Array.isArray(coll)) {\n    if (!isNumber(key, { integer: true }))\n      return false\n\n    return key >= 0 && key < coll.length\n  }\n  return !!Object.getOwnPropertyDescriptor(coll, key)\n}\n\nexport function compare<T extends string | number>(a: T, b: T, sourceCodeInfo: SourceCodeInfo | undefined): number {\n  assertStringOrNumber(a, sourceCodeInfo)\n  assertStringOrNumber(b, sourceCodeInfo)\n\n  if (typeof a === 'string' && typeof b === 'string') {\n    return a < b ? -1 : a > b ? 1 : 0\n  }\n  if (typeof a === 'number' && typeof b === 'number') {\n    return Math.sign((a) - (b))\n  }\n  throw new DvalaError(`Cannot compare values of different types: ${typeof a} and ${typeof b}`, sourceCodeInfo)\n}\n\nexport function deepEqual(a: unknown, b: unknown, sourceCodeInfo?: SourceCodeInfo): boolean {\n  if (a === b)\n    return true\n\n  if (typeof a === 'number' && typeof b === 'number')\n    return approxEqual(a, b)\n\n  if (Array.isArray(a) && Array.isArray(b)) {\n    if (a.length !== b.length)\n      return false\n\n    for (let i = 0; i < a.length; i += 1) {\n      if (!deepEqual(asAny(a[i], sourceCodeInfo), asAny(b[i], sourceCodeInfo), sourceCodeInfo))\n        return false\n    }\n    return true\n  }\n  if (isRegularExpression(a) && isRegularExpression(b))\n    return a.s === b.s && a.f === b.f\n\n  if (isUnknownRecord(a) && isUnknownRecord(b)) {\n    const aKeys = Object.keys(a)\n    const bKeys = Object.keys(b)\n    if (aKeys.length !== bKeys.length)\n      return false\n\n    for (let i = 0; i < aKeys.length; i += 1) {\n      const key = asString(aKeys[i], sourceCodeInfo)\n      if (!deepEqual(a[key], b[key], sourceCodeInfo))\n        return false\n    }\n    return true\n  }\n  return false\n}\n\nexport function toNonNegativeInteger(num: number): number {\n  return Math.max(0, Math.ceil(num))\n}\n\nexport function toAny(value: unknown): Any {\n  return (value ?? null) as Any\n}\n\nfunction clone<T>(value: T): T {\n  if (isObj(value)) {\n    return Object.entries(value).reduce((result: Obj, entry) => {\n      const [key, val] = entry\n      result[key] = clone(val)\n      return result\n    }, {}) as T\n  }\n  if (Array.isArray(value))\n    // eslint-disable-next-line ts/no-unsafe-return\n    return value.map(item => clone(item)) as unknown as T\n\n  return value\n}\n\nexport function cloneColl<T extends Coll>(value: T): T {\n  return clone(value)\n}\n\nexport function joinSets<T>(...results: Set<T>[]): Set<T> {\n  const result = new Set<T>()\n  for (const symbols of results)\n    symbols.forEach(symbol => result.add(symbol))\n\n  return result\n}\n\nexport function addToSet<T>(target: Set<T>, source: Set<T>): void {\n  source.forEach(symbol => target.add(symbol))\n}\n\nexport const EPSILON = 1e-10\n\nexport function approxEqual(a: number, b: number, epsilon: number = EPSILON): boolean {\n  if (a === b) {\n    return true\n  }\n\n  const diff = Math.abs(a - b)\n\n  if (a === 0 || b === 0 || diff < epsilon) {\n    // Use absolute error for values near zero\n    return diff < epsilon\n  }\n  const absA = Math.abs(a)\n  const absB = Math.abs(b)\n\n  // Use relative error for larger values\n  return diff / (absA + absB) < epsilon\n}\n\nexport function approxZero(value: number): boolean {\n  return Math.abs(value) < EPSILON\n}\n\nexport function smartTrim(str: string, minIndent = 0): string {\n  const lines = str.split('\\n')\n  while (lines[0]?.match(/^\\s*$/)) {\n    lines.shift() // Remove leading empty lines\n  }\n  while (lines[lines.length - 1]?.match(/^\\s*$/)) {\n    lines.pop() // Remove trailing empty lines\n  }\n  const indent = lines.reduce((acc, line) => {\n    if (line.match(/^\\s*$/))\n      return acc // Skip empty lines\n    const lineIndent = line.match(/^\\s*/)![0].length\n    return Math.min(acc, lineIndent)\n  }, Infinity)\n  return lines.map(line => ' '.repeat(minIndent) + line.slice(indent)).join('\\n').trimEnd()\n}\n","import type { SourceCodeInfo } from '../tokenizer/token'\nimport { getAssertionError } from '../utils/getAssertionError'\n\n// isArray not needed, use Array.isArary\nexport function asArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): unknown[] {\n  assertArray(value, sourceCodeInfo)\n  return value\n}\nexport function assertArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is unknown[] {\n  if (!Array.isArray(value))\n    throw getAssertionError('array', value, sourceCodeInfo)\n}\n\nexport function isStringArray(value: unknown): value is string[] {\n  return Array.isArray(value) && value.every(v => typeof v === 'string')\n}\nexport function asStringArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): string[] {\n  assertStringArray(value, sourceCodeInfo)\n  return value\n}\nexport function assertStringArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is string[] {\n  if (!isStringArray(value))\n    throw getAssertionError('array of strings', value, sourceCodeInfo)\n}\n\nexport function isCharArray(value: unknown): value is string[] {\n  return Array.isArray(value) && value.every(v => typeof v === 'string' && v.length === 1)\n}\nexport function asCharArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): string[] {\n  assertCharArray(value, sourceCodeInfo)\n  return value\n}\nexport function assertCharArray(value: unknown, sourceCodeInfo?: SourceCodeInfo): asserts value is string[] {\n  if (!isCharArray(value))\n    throw getAssertionError('array of strings', value, sourceCodeInfo)\n}\n","import type { Arity } from '../builtin/interface'\nimport { DvalaError } from '../errors'\nimport type { FunctionLike } from '../parser/types'\nimport type { SourceCodeInfo } from '../tokenizer/token'\nimport { isColl } from '../typeGuards/dvala'\nimport { valueToString } from './debug/debugTools'\n\nexport function arityAccepts(arity: Arity, nbrOfParams: number): boolean {\n  const { min, max } = arity\n  if (typeof min === 'number' && nbrOfParams < min) {\n    return false\n  }\n  if (typeof max === 'number' && nbrOfParams > max) {\n    return false\n  }\n  return true\n}\n\nexport function arityAcceptsMin(arity: Arity, nbrOfParams: number): boolean {\n  const { min } = arity\n  if (typeof min === 'number' && nbrOfParams < min) {\n    return false\n  }\n  return true\n}\n\nexport function getCommonArityFromFunctions(params: FunctionLike[]): Arity | null {\n  return params.reduce((acc: Arity | null, param): Arity | null => {\n    if (acc === null) {\n      return null\n    }\n    const arity: Arity = (typeof param === 'number' || isColl(param)) ? toFixedArity(1) : param.arity\n    const { min: aMin, max: aMax } = arity\n    const { min: bMin, max: bMax } = acc\n    const min = typeof aMin === 'number' && typeof bMin === 'number'\n      ? Math.max(aMin, bMin)\n      : typeof aMin === 'number' ? aMin : typeof bMin === 'number' ? bMin : undefined\n    const max = typeof aMax === 'number' && typeof bMax === 'number'\n      ? Math.min(aMax, bMax)\n      : typeof aMax === 'number' ? aMax : typeof bMax === 'number' ? bMax : undefined\n\n    if (typeof min === 'number' && typeof max === 'number' && min > max) {\n      return null\n    }\n\n    return { min, max }\n  }, {})\n}\n\nexport function getArityFromFunction(param: FunctionLike): Arity {\n  return (typeof param === 'number' || isColl(param)) ? toFixedArity(1) : param.arity\n}\n\nexport function assertNumberOfParams(arity: Arity, length: number, sourceCodeInfo: SourceCodeInfo | undefined): void {\n  const { min, max } = arity\n  if (typeof min === 'number' && length < min) {\n    throw new DvalaError(\n      `Wrong number of arguments, expected at least ${min}, got ${valueToString(length)}.`,\n      sourceCodeInfo,\n    )\n  }\n\n  if (typeof max === 'number' && length > max) {\n    throw new DvalaError(\n      `Wrong number of arguments, expected at most ${max}, got ${valueToString(length)}.`,\n      sourceCodeInfo,\n    )\n  }\n}\n\nexport function canBeOperator(count: Arity): boolean {\n  if (typeof count.max === 'number' && count.max < 2) {\n    return false\n  }\n\n  if (typeof count.min === 'number' && count.min > 2) {\n    return false\n  }\n\n  return true\n}\n\nexport function toFixedArity(arity: number): Arity {\n  return { min: arity, max: arity }\n}\n","import type { Any, Arr, Coll, Obj } from '../../../interface'\nimport type { SourceCodeInfo } from '../../../tokenizer/token'\nimport { cloneColl, collHasKey, toAny } from '../../../utils'\nimport { asColl, assertAny, assertColl, assertObj, isColl, isObj } from '../../../typeGuards/dvala'\nimport type { BuiltinNormalExpressions } from '../../interface'\nimport { assertArray } from '../../../typeGuards/array'\nimport { assertNumber, isNumber } from '../../../typeGuards/number'\nimport { asStringOrNumber, assertString, assertStringOrNumber } from '../../../typeGuards/string'\nimport { toFixedArity } from '../../../utils/arity'\nimport { moduleDocsFromFunctions } from '../interface'\nimport type { DvalaModule } from '../interface'\nimport collectionModuleSource from './collection.dvala'\n\n// --- Private helper: get value from collection by key ---\nfunction get(coll: Coll, key: string | number): Any | undefined {\n  if (isObj(coll)) {\n    if (typeof key === 'string' && collHasKey(coll, key))\n      return toAny(coll[key])\n  }\n  else {\n    if (isNumber(key, { nonNegative: true, integer: true }) && key >= 0 && key < coll.length)\n      return toAny(coll[key])\n  }\n  return undefined\n}\n\n// --- Private helper: assoc value into collection ---\nfunction assoc(coll: Coll, key: string | number, value: Any, sourceCodeInfo?: SourceCodeInfo) {\n  assertColl(coll, sourceCodeInfo)\n  if (Array.isArray(coll) || typeof coll === 'string') {\n    assertNumber(key, sourceCodeInfo, { integer: true })\n    assertNumber(key, sourceCodeInfo, { gte: 0 })\n    assertNumber(key, sourceCodeInfo, { lte: coll.length })\n    if (typeof coll === 'string') {\n      assertString(value, sourceCodeInfo, { char: true })\n      return `${coll.slice(0, key)}${value}${coll.slice(key + 1)}`\n    }\n    const copy = [...coll]\n    copy[key] = value\n    return copy\n  }\n  assertString(key, sourceCodeInfo)\n  const copy = { ...coll }\n  copy[key] = value\n  return copy\n}\n\ninterface CollMeta {\n  coll: Coll\n  parent: Obj | Arr\n}\n\n// --- Private helper: clone and get meta for nested operations ---\nfunction cloneAndGetMeta(\n  originalColl: Coll,\n  keys: Arr,\n  sourceCodeInfo?: SourceCodeInfo,\n): { coll: Coll, innerCollMeta: CollMeta } {\n  const coll = cloneColl(originalColl)\n\n  const butLastKeys = keys.slice(0, keys.length - 1)\n\n  const innerCollMeta = butLastKeys.reduce(\n    (result: CollMeta, key) => {\n      const resultColl = result.coll\n\n      let newResultColl: Coll\n      if (Array.isArray(resultColl)) {\n        assertNumber(key, sourceCodeInfo)\n        newResultColl = asColl(resultColl[key], sourceCodeInfo)\n      }\n      else {\n        assertObj(resultColl, sourceCodeInfo)\n        assertString(key, sourceCodeInfo)\n        if (!collHasKey(result.coll, key))\n          (resultColl)[key] = {}\n\n        newResultColl = asColl(resultColl[key], sourceCodeInfo)\n      }\n\n      return { coll: newResultColl, parent: resultColl }\n    },\n    { coll, parent: {} },\n  )\n  return { coll, innerCollMeta }\n}\n\nconst collectionUtilsFunctions: BuiltinNormalExpressions = {\n  'get-in': {\n    evaluate: (params, sourceCodeInfo): Any => {\n      let coll = toAny(params[0])\n      const keys = params[1] ?? [] // null behaves as empty array\n      const defaultValue = toAny(params[2])\n      assertArray(keys, sourceCodeInfo)\n      for (const key of keys) {\n        assertStringOrNumber(key, sourceCodeInfo)\n        if (isColl(coll)) {\n          const nextValue = get(coll, key)\n          if (nextValue !== undefined)\n            coll = nextValue\n          else\n            return defaultValue\n        }\n        else {\n          return defaultValue\n        }\n      }\n      return coll\n    },\n    arity: { min: 2, max: 3 },\n    docs: {\n      category: 'collection',\n      returns: { type: 'any' },\n      args: {\n        'a': { type: 'collection' },\n        'b': { type: 'array' },\n        'not-found': { type: 'any' },\n      },\n      variants: [\n        { argumentNames: ['a', 'b'] },\n        { argumentNames: ['a', 'b', 'not-found'] },\n      ],\n      description: 'Returns the value in a nested collection, where $b is an array of keys. Returns $not-found if the key is not present. If $not-found is not set, `null` is returned.',\n      seeAlso: ['get', 'collection.assoc-in', 'collection.update-in'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: \"Kalle\" }, 6]],\n  [1, 1, \"a\", 0]\n)`,\n        `\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: \"Kalle\" }, 6]],\n  [1, 1, \"b\", 0]\n)`,\n        `\nlet cu = import(collection);\ncu.get-in(\n  [[1, 2, 3], [4, { a: \"Kalle\" }, 6]],\n  [1, 1, \"b\", 0],\n  \"Lisa\"\n)`,\n      ],\n    },\n  },\n  'assoc-in': {\n    evaluate: ([originalColl, keys, value], sourceCodeInfo): Coll => {\n      assertColl(originalColl, sourceCodeInfo)\n      assertArray(keys, sourceCodeInfo)\n      assertAny(value, sourceCodeInfo)\n\n      if (keys.length === 1) {\n        assertStringOrNumber(keys[0], sourceCodeInfo)\n        return assoc(originalColl, keys[0], value, sourceCodeInfo)\n      }\n\n      const { coll, innerCollMeta } = cloneAndGetMeta(originalColl, keys, sourceCodeInfo)\n\n      const lastKey = asStringOrNumber(keys[keys.length - 1], sourceCodeInfo)\n      const parentKey = asStringOrNumber(keys[keys.length - 2], sourceCodeInfo)\n\n      if (Array.isArray(innerCollMeta.parent)) {\n        assertNumber(parentKey, sourceCodeInfo)\n        innerCollMeta.parent[parentKey] = assoc(innerCollMeta.coll, lastKey, value, sourceCodeInfo)\n      }\n      else {\n        assertString(parentKey, sourceCodeInfo)\n        innerCollMeta.parent[parentKey] = assoc(innerCollMeta.coll, lastKey, value, sourceCodeInfo)\n      }\n\n      return coll\n    },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'collection' },\n      args: {\n        coll: { type: 'collection' },\n        ks: { type: ['number', 'string'], array: true },\n        value: { type: 'any' },\n      },\n      variants: [{ argumentNames: ['coll', 'ks', 'value'] }],\n      description: `\nAssociates a value in the nested collection $coll, where $ks is an array of keys and $value is the new value.\n\nIf any levels do not exist, objects will be created - and the corresponding keys must be of type string.`,\n      seeAlso: ['assoc', 'collection.get-in', 'collection.update-in'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.assoc-in(\n  {},\n  [\"a\", \"b\", \"c\"],\n  \"Albert\"\n)`,\n        `\nlet cu = import(collection);\ncu.assoc-in(\n  [1, 2, [1, 2, 3]],\n  [2, 1],\n  \"Albert\"\n)`,\n        `\nlet cu = import(collection);\ncu.assoc-in(\n  [1, 2, { name: \"albert\" }],\n  [2, \"name\", 0],\n  \"A\"\n)`,\n      ],\n    },\n  },\n  'update': {\n    evaluate: () => { throw new Error('update: Dvala implementation should be used instead') },\n    arity: { min: 3 },\n    docs: {\n      category: 'collection',\n      returns: { type: 'collection' },\n      args: {\n        'coll': { type: 'collection' },\n        'key': { type: ['string', 'number'] },\n        'fun': { type: 'function' },\n        'fun-args': { type: 'any', rest: true },\n      },\n      variants: [\n        { argumentNames: ['coll', 'key', 'fun'] },\n        { argumentNames: ['coll', 'key', 'fun', 'fun-args'] },\n      ],\n      description: `\nUpdates a value in the $coll collection, where $key is a key. $fun is a function\nthat will take the old value and any supplied $fun-args and\nreturn the new value.\nIf the key does not exist, \\`null\\` is passed as the old value.`,\n      seeAlso: ['collection.update-in', 'assoc'],\n      examples: [\n        `\nlet cu = import(collection);\nlet x = { a: 1, b: 2 };\ncu.update(x, \"a\", inc)`,\n        `\nlet cu = import(collection);\nlet x = { a: 1, b: 2 };\ncu.update(\n  x,\n  \"c\",\n  val -> null?(val) ? 0 : inc(val)\n)`,\n      ],\n    },\n  },\n  'update-in': {\n    evaluate: () => { throw new Error('update-in: Dvala implementation should be used instead') },\n    arity: { min: 3 },\n    docs: {\n      category: 'collection',\n      returns: { type: 'collection' },\n      args: {\n        'coll': { type: 'collection' },\n        'ks': { type: 'array' },\n        'fun': { type: 'function' },\n        'fun-args': { type: 'any', rest: true },\n      },\n      variants: [\n        { argumentNames: ['coll', 'ks', 'fun'] },\n        { argumentNames: ['coll', 'ks', 'fun', 'fun-args'] },\n      ],\n      description: `Updates a value in the $coll collection, where $ks is an array of\nkeys and $fun is a function that will take the old value and\nany supplied $fun-args and return the new value. If any levels do not exist,\nobjects will be created - and the corresponding keys must be of type string.`,\n      seeAlso: ['collection.update', 'collection.assoc-in', 'collection.get-in'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.update-in(\n  { a: [1, 2, 3] },\n  [\"a\", 1],\n  -> null?($) ? 0 : inc($)\n)`,\n        `\nlet cu = import(collection);\ncu.update-in(\n  { a: { foo: \"bar\"} },\n  [\"a\", \"foo\"],\n  -> null?($) ? \"?\" : \"!\"\n)`,\n        `\nlet cu = import(collection);\ncu.update-in(\n  { a: { foo: \"bar\"} },\n  [\"a\", \"baz\"],\n  -> null?($) ? \"?\" : \"!\"\n)`,\n        `\nlet cu = import(collection);\ncu.update-in(\n  { a: [1, 2, 3] },\n  [\"a\", 1],\n  *,\n  10,\n  10,\n  10,\n)`,\n      ],\n    },\n  },\n  'filteri': {\n    evaluate: () => { throw new Error('filteri: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'collection' },\n      args: {\n        a: { type: 'collection' },\n        b: {\n          type: 'function',\n          description: 'The function to call for each element in the collection. The function should take two arguments: the element itself and the index.',\n        },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Creates a new collection with all elements that pass the test implemented by $b. The function is called for each element in the collection, and it should take two arguments: the element itself and the index.',\n      seeAlso: ['filter', 'collection.mapi'],\n      examples: [\n        'let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> i % 2 == 0)',\n        'let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> x % 2 == 0)',\n        'let cu = import(collection); cu.filteri([1, 2, 3], (x, i) -> x + i > 3)',\n      ],\n    },\n  },\n  'mapi': {\n    evaluate: () => { throw new Error('mapi: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'collection' },\n      args: {\n        a: { type: 'collection' },\n        b: {\n          type: 'function',\n          description: 'The function to call for each element in the collection. The function should take two arguments: the element itself and the index.',\n        },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Creates a new collection populated with the results of calling $b on every element in $a. The function is called for each element in the collection, and it should take two arguments: the element itself and the index.',\n      seeAlso: ['map', 'collection.filteri'],\n      examples: [\n        'let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x + i)',\n        'let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x * i)',\n        'let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x - i)',\n        'let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x / i)',\n        'let cu = import(collection); cu.mapi([1, 2, 3], (x, i) -> x % inc(i))',\n      ],\n    },\n  },\n  'reducei': {\n    evaluate: () => { throw new Error('reducei: Dvala implementation should be used instead') },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any' },\n      args: {\n        coll: { type: 'collection' },\n        fun: {\n          type: 'function',\n          description: 'The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index.',\n        },\n        initial: {\n          type: 'any',\n          description: 'The initial value to use as the accumulator.',\n        },\n      },\n      variants: [{ argumentNames: ['coll', 'fun', 'initial'] }],\n      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. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.',\n      seeAlso: ['reduce', 'collection.reducei-right', 'collection.reductionsi'],\n      examples: [\n        'let cu = import(collection); cu.reducei([1, 2, 3], (acc, x, i) -> acc + x + i, 0)',\n        'let cu = import(collection); cu.reducei(\"Albert\", (acc, x, i) -> acc ++ x ++ i, \"\")',\n        'let cu = import(collection); cu.reducei({ a: 1, b: 2 }, -> $1 ++ $3, \"\")',\n      ],\n    },\n  },\n  'reduce-right': {\n    evaluate: () => { throw new Error('reduce-right: Dvala implementation should be used instead') },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any' },\n      args: {\n        fun: { type: 'function' },\n        coll: { type: 'collection' },\n        initial: { type: 'any' },\n      },\n      variants: [{ argumentNames: ['coll', 'fun', 'initial'] }],\n      description: 'Runs $fun function on each element of the $coll (starting from the last item), 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.',\n      seeAlso: ['reduce', 'collection.reducei-right'],\n      examples: [\n        'let cu = import(collection); cu.reduce-right([\"A\", \"B\", \"C\"], str, \"\")',\n        'let cu = import(collection); cu.reduce-right({ a: 1, b: 2 }, +, 0)',\n      ],\n    },\n  },\n  'reducei-right': {\n    evaluate: () => { throw new Error('reducei-right: Dvala implementation should be used instead') },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any' },\n      args: {\n        coll: { type: 'collection' },\n        fun: {\n          type: 'function',\n          description: 'The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index.',\n        },\n        initial: {\n          type: 'any',\n          description: 'The initial value to use as the accumulator.',\n        },\n      },\n      variants: [{ argumentNames: ['coll', 'fun', 'initial'] }],\n      description: 'Runs $fun function on each element of the $coll (starting from the last item), 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. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.',\n      seeAlso: ['collection.reducei', 'collection.reduce-right'],\n      examples: [\n        'let cu = import(collection); cu.reducei-right([1, 2, 3], (acc, x, i) -> acc + x + i, 0)',\n        'let cu = import(collection); cu.reducei-right(\"Albert\", (acc, x, i) -> acc ++ x ++ i, \"\")',\n        'let cu = import(collection); cu.reducei-right({ a: 1, b: 2 }, -> $1 ++ $3, \"\")',\n      ],\n    },\n  },\n  'reductions': {\n    evaluate: () => { throw new Error('reductions: Dvala implementation should be used instead') },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any', array: true },\n      args: {\n        fun: { type: 'function' },\n        coll: { type: 'collection' },\n        initial: { type: 'any' },\n      },\n      variants: [{ argumentNames: ['coll', 'fun', 'initial'] }],\n      description: 'Returns an array of the intermediate values of the reduction (see `reduce`) of $coll by $fun.',\n      seeAlso: ['reduce', 'collection.reductionsi'],\n      examples: [\n        'let cu = import(collection); cu.reductions([1, 2, 3], +, 0)',\n        'let cu = import(collection); cu.reductions([1, 2, 3], +, 10)',\n        'let cu = import(collection); cu.reductions([], +, 0)',\n        'let cu = import(collection); cu.reductions({ a: 1, b: 2 }, +, 0)',\n        `\nlet cu = import(collection);\ncu.reductions(\n  [1, 2, 3, 4, 5, 6, 7, 8, 9],\n  (result, value) -> result + (even?(value) ? value : 0),\n  0\n)`,\n      ],\n    },\n  },\n  'reductionsi': {\n    evaluate: () => { throw new Error('reductionsi: Dvala implementation should be used instead') },\n    arity: toFixedArity(3),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any', array: true },\n      args: {\n        coll: { type: 'collection' },\n        fun: {\n          type: 'function',\n          description: 'The function to call for each element in the collection. The function should take three arguments: the accumulator, the element itself, and the index.',\n        },\n        initial: {\n          type: 'any',\n          description: 'The initial value to use as the accumulator.',\n        },\n      },\n      variants: [{ argumentNames: ['coll', 'fun', 'initial'] }],\n      description: 'Returns an array of the intermediate values of the reduction (see `reduce`) of $coll by $fun. The function is called for each element in the collection, and it should take three arguments: the accumulator, the element itself, and the index.',\n      seeAlso: ['collection.reductions', 'collection.reducei'],\n      examples: [\n        'let cu = import(collection); cu.reductionsi([1, 2, 3], (acc, x, i) -> acc + x + i, 0)',\n        'let cu = import(collection); cu.reductionsi(\"Albert\", (acc, x, i) -> acc ++ x ++ i, \"\")',\n        'let cu = import(collection); cu.reductionsi({ a: 1, b: 2 }, -> $1 ++ $3, \"\")',\n      ],\n    },\n  },\n  'not-empty': {\n    evaluate: ([coll], sourceCodeInfo): Coll | null => {\n      if (coll === null)\n        return null\n\n      assertColl(coll, sourceCodeInfo)\n      if (typeof coll === 'string')\n        return coll.length > 0 ? coll : null\n\n      if (Array.isArray(coll))\n        return coll.length > 0 ? coll : null\n\n      return Object.keys(coll).length > 0 ? coll : null\n    },\n    arity: toFixedArity(1),\n    docs: {\n      category: 'collection',\n      returns: { type: 'any' },\n      args: {\n        coll: { type: ['collection', 'null'] },\n      },\n      variants: [{ argumentNames: ['coll'] }],\n      description: 'Returns `null` if $coll is empty or `null`, otherwise $coll.',\n      seeAlso: ['empty?', 'not-empty?'],\n      examples: [\n        'let cu = import(collection); cu.not-empty([])',\n        'let cu = import(collection); cu.not-empty([1, 2, 3])',\n        'let cu = import(collection); cu.not-empty({})',\n        'let cu = import(collection); cu.not-empty({ a: 2 })',\n        'let cu = import(collection); cu.not-empty(\"\")',\n        'let cu = import(collection); cu.not-empty(\"Albert\")',\n        'let cu = import(collection); cu.not-empty(null)',\n      ],\n    },\n  },\n  'every?': {\n    evaluate: () => { throw new Error('every?: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'boolean' },\n      args: {\n        a: { type: 'collection' },\n        b: { type: 'function' },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Returns `true` if all entries in $a pass the test implemented by $b, otherwise returns `false`.',\n      seeAlso: ['collection.any?', 'collection.not-every?', 'collection.not-any?', 'functional.every-pred', 'grid.cell-every?'],\n      examples: [\n        'let cu = import(collection); cu.every?([1, 2, 3], number?)',\n        'let cu = import(collection); cu.every?([1, 2, 3], even?)',\n        `\nlet cu = import(collection);\ncu.every?(\n  [\"Albert\", \"Mojir\", 160, [1, 2]],\n  string?,\n)`,\n        `\nlet cu = import(collection);\ncu.every?(\n  [50, 100, 150, 200],\n  -> $ > 10,\n)`,\n        'let cu = import(collection); cu.every?([], number?)',\n        'let cu = import(collection); cu.every?(\"\", number?)',\n        'let cu = import(collection); cu.every?({}, number?)',\n        `\nlet cu = import(collection);\ncu.every?(\n  { a: 2, b: 4},\n  -> even?(second($))\n)`,\n        `\nlet cu = import(collection);\ncu.every?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)`,\n      ],\n    },\n  },\n  'any?': {\n    evaluate: () => { throw new Error('any?: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'boolean' },\n      args: {\n        a: { type: 'collection' },\n        b: { type: 'function' },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Returns `true` if any element in $a pass the test implemented by $b, otherwise returns `false`.',\n      seeAlso: ['collection.every?', 'collection.not-any?', 'collection.not-every?', 'functional.some-pred', 'some', 'grid.some?'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.any?(\n  [\"Albert\", \"Mojir\", 160, [1, 2]],\n  string?\n)`,\n        `\nlet cu = import(collection);\ncu.any?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)`,\n        'let cu = import(collection); cu.any?([], number?)',\n        'let cu = import(collection); cu.any?(\"\", number?)',\n        'let cu = import(collection); cu.any?({}, number?)',\n        `\nlet cu = import(collection);\ncu.any?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)`,\n        `\nlet cu = import(collection);\ncu.any?(\n  { a: 1, b: 3 },\n  -> even?(second($))\n)`,\n      ],\n    },\n  },\n  'not-any?': {\n    evaluate: () => { throw new Error('not-any?: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'boolean' },\n      args: {\n        a: { type: 'collection' },\n        b: { type: 'function' },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Returns `false` if any element in $a pass the test implemented by $b, otherwise returns `true`.',\n      seeAlso: ['collection.any?', 'collection.every?', 'collection.not-every?'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.not-any?(\n  [\"Albert\", \"Mojir\", 160, [1, 2]],\n  string?\n)`,\n        `\nlet cu = import(collection);\ncu.not-any?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)`,\n        'let cu = import(collection); cu.not-any?([], number?)',\n        'let cu = import(collection); cu.not-any?(\"\", number?)',\n        'let cu = import(collection); cu.not-any?({}, number?)',\n        `\nlet cu = import(collection);\ncu.not-any?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)`,\n        `\nlet cu = import(collection);\ncu.not-any?(\n  { a: 1, b: 3 },\n  -> even?(second($))\n)`,\n      ],\n    },\n  },\n  'not-every?': {\n    evaluate: () => { throw new Error('not-every?: Dvala implementation should be used instead') },\n    arity: toFixedArity(2),\n    docs: {\n      category: 'collection',\n      returns: { type: 'boolean' },\n      args: {\n        a: { type: 'collection' },\n        b: { type: 'function' },\n      },\n      variants: [{ argumentNames: ['a', 'b'] }],\n      description: 'Returns `true` if at least one element in $a does not pass the test implemented by $b, otherwise returns `false`.',\n      seeAlso: ['collection.every?', 'collection.any?', 'collection.not-any?'],\n      examples: [\n        `\nlet cu = import(collection);\ncu.not-every?(\n  [\"Albert\", \"Mojir\", 160, [1, 2]],\n  string?\n)`,\n        `\nlet cu = import(collection);\ncu.not-every?(\n  [50, 100, 150, 200],\n  x -> x > 10\n)`,\n        'let cu = import(collection); cu.not-every?([], number?)',\n        'let cu = import(collection); cu.not-every?(\"\", number?)',\n        'let cu = import(collection); cu.not-every?({}, number?)',\n        `\nlet cu = import(collection);\ncu.not-every?(\n  { a: 2, b: 4 },\n  -> even?(second($))\n)`,\n        `\nlet cu = import(collection);\ncu.not-every?(\n  { a: 2, b: 3 },\n  -> even?(second($))\n)`,\n      ],\n    },\n  },\n}\n\nexport const collectionUtilsModule: DvalaModule = {\n  name: 'collection',\n  functions: collectionUtilsFunctions,\n  source: collectionModuleSource,\n  docs: moduleDocsFromFunctions(collectionUtilsFunctions),\n}\n","{\n  update: (coll, key, fn, ...extra-params) ->\n    assoc(coll, key, apply(fn, [get(coll, key), ...extra-params])),\n\n  update-in: (coll, ks, fn, ...extra-params) -> do\n    let k = first(ks);\n    if count(ks) == 1 then\n      assoc(coll, k, apply(fn, [get(coll, k), ...extra-params]))\n    else\n      let inner = get(coll, k);\n      let inner-coll = null?(inner) ? {} : inner;\n      assoc(coll, k, apply(self, [inner-coll, slice(ks, 1), fn, ...extra-params]))\n    end\n  end,\n\n  filteri: (coll, fn) -> do\n    cond\n      case array?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> [nth(coll, i), i],\n          (acc, pair) -> if fn(first(pair), second(pair)) then [...acc, first(pair)] else acc end,\n          []\n        )\n\n      case string?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> [nth(coll, i), i],\n          (acc, pair) -> if fn(first(pair), second(pair)) then ++(acc, first(pair)) else acc end,\n          \"\"\n        )\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) ->\n          if fn(coll(k), k) then assoc(acc, k, coll(k)) else acc end,\n          {}\n        )\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  mapi: (coll, fn) -> do\n    cond\n      case array?(coll) then\n        for (i in range(count(coll))) -> fn(nth(coll, i), i)\n\n      case string?(coll) then\n        reduce(\n          for (i in range(count(coll))) -> fn(nth(coll, i), i),\n          (acc, ch) -> ++(acc, ch),\n          \"\"\n        )\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) ->\n          assoc(acc, k, fn(coll(k), k)),\n          {}\n        )\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  reducei: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        loop (acc = initial, i = 0) -> do\n          if i >= count(coll) then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i + 1)\n          end\n        end\n\n      case array?(coll) then\n        loop (acc = initial, i = 0) -> do\n          if i >= count(coll) then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i + 1)\n          end\n        end\n\n      case object?(coll) then\n        reduce(keys(coll), (acc, k) -> fn(acc, coll(k), k), initial)\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  reduce-right: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        reduce(reverse(coll), fn, initial)\n\n      case array?(coll) then\n        reduce(reverse(coll), fn, initial)\n\n      case object?(coll) then\n        reduce(reverse(keys(coll)), (acc, k) -> fn(acc, coll(k)), initial)\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  reducei-right: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then\n        let len = count(coll);\n        loop (acc = initial, i = len - 1) -> do\n          if i < 0 then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i - 1)\n          end\n        end\n\n      case array?(coll) then\n        let len = count(coll);\n        loop (acc = initial, i = len - 1) -> do\n          if i < 0 then\n            acc\n          else\n            recur(fn(acc, nth(coll, i), i), i - 1)\n          end\n        end\n\n      case object?(coll) then\n        reduce(reverse(keys(coll)), (acc, k) -> fn(acc, coll(k), k), initial)\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  reductions: (coll, fn, initial) -> do\n    let items = cond\n      case string?(coll) then\n        if count(coll) == 0 then [] else for (i in range(count(coll))) -> nth(coll, i) end\n\n      case array?(coll) then coll\n\n      case object?(coll) then\n        for (k in keys(coll)) -> coll(k)\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end;\n    if count(items) == 0 then\n      [initial]\n    else\n      reduce(items, (acc, elem) -> do\n        let prev = last(acc);\n        [...acc, fn(prev, elem)]\n      end, [initial])\n    end\n  end,\n\n  reductionsi: (coll, fn, initial) -> do\n    cond\n      case string?(coll) then do\n        if count(coll) == 0 then\n          [initial]\n        else\n          reduce(\n            for (i in range(count(coll))) -> [nth(coll, i), i],\n            (acc, pair) -> do\n              let prev = last(acc);\n              [...acc, fn(prev, first(pair), second(pair))]\n            end,\n            [initial]\n          )\n        end\n      end\n\n      case array?(coll) then do\n        if count(coll) == 0 then\n          [initial]\n        else\n          reduce(\n            for (i in range(count(coll))) -> [nth(coll, i), i],\n            (acc, pair) -> do\n              let prev = last(acc);\n              [...acc, fn(prev, first(pair), second(pair))]\n            end,\n            [initial]\n          )\n        end\n      end\n\n      case object?(coll) then do\n        let ks = keys(coll);\n        if count(ks) == 0 then\n          [initial]\n        else\n          reduce(ks, (acc, k) -> do\n            let prev = last(acc);\n            [...acc, fn(prev, coll(k), k)]\n          end, [initial])\n        end\n      end\n\n      case true then\n        perform(effect(dvala.error), \"Expected collection\")\n    end\n  end,\n\n  \"every?\": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), \"Expected collection\")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then true\n        case not(fn(nth(items, i))) then false\n        case true then recur(i + 1)\n      end\n  end,\n\n  \"any?\": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), \"Expected collection\")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then false\n        case fn(nth(items, i)) then true\n        case true then recur(i + 1)\n      end\n  end,\n\n  \"not-any?\": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), \"Expected collection\")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then true\n        case fn(nth(items, i)) then false\n        case true then recur(i + 1)\n      end\n  end,\n\n  \"not-every?\": (coll, fn) -> do\n    let items = cond\n      case array?(coll) then coll\n      case string?(coll) then for (i in range(count(coll))) -> nth(coll, i)\n      case object?(coll) then for (k in keys(coll)) -> [k, coll(k)]\n      case true then perform(effect(dvala.error), \"Expected collection\")\n    end;\n    loop (i = 0) ->\n      cond\n        case i >= count(items) then false\n        case not(fn(nth(items, i))) then true\n        case true then recur(i + 1)\n      end\n  end\n}","import type { BuiltinNormalExpressions, FunctionDocs } from '../../builtin/interface'\n\n/**\n * Represents a Dvala module that can be imported dynamically.\n * Modules contain a collection of functions that are not part of the core bundle.\n */\nexport interface DvalaModule {\n  /** The name of the module (e.g., 'grid', 'vec', 'mat') */\n  name: string\n  /** The functions provided by this module, keyed by their short name (e.g., 'transpose') */\n  functions: BuiltinNormalExpressions\n  /**\n   * Optional Dvala source code that is evaluated at import time.\n   * The source must evaluate to an object mapping function names to functions.\n   * These are merged with (and may override) the TypeScript `functions`.\n   */\n  source?: string\n  /**\n   * Docs for all functions in this module, including any defined in `source`.\n   * The reference system uses this record as the sole source of truth for\n   * function names and documentation. Not required for user-defined modules.\n   */\n  docs?: Record<string, FunctionDocs>\n}\n\n/**\n * Derives a docs record from a BuiltinNormalExpressions map.\n * Use this for modules whose docs are co-located inline on each function.\n */\nexport function moduleDocsFromFunctions(functions: BuiltinNormalExpressions): Record<string, FunctionDocs> {\n  return Object.fromEntries(\n    Object.entries(functions).map(([k, v]) => {\n      if (!v.docs)\n        throw new Error(`Missing docs for function \"${k}\"`)\n      return [k, v.docs]\n    }),\n  )\n}\n"],"names":["getCodeMarker","sourceCodeInfo","position","code","leftPadding","column","rightPadding","length","repeat","Math","max","DvalaError","Error","shortMessage","constructor","err","message","super","location","line","filePath","getDvalaErrorMessage","this","Object","setPrototypeOf","prototype","name","NodeTypes","Number","String","NormalExpression","SpecialExpression","UserDefinedSymbol","NormalBuiltinSymbol","SpecialBuiltinSymbol","ReservedSymbol","Binding","Spread","NodeTypesSet","Set","values","functionTypeSet","FUNCTION_SYMBOL","REGEXP_SYMBOL","EFFECT_SYMBOL","isDvalaFunction","func","type","functionType","has","isNode","value","Array","isArray","valueToString","keys","find","key","RegExp","toString","JSON","stringify","getSourceCodeInfo","anyValue","getAssertionError","typeName","isObj","regexp","isEffect","isColl","isSeq","asColl","assertColl","isNumber","options","isNaN","integer","isInteger","finite","isFinite","zero","nonZero","positive","negative","nonPositive","nonNegative","gt","gte","lt","lte","assertNumber","sign","getSignString","numberType","range","getRangeString","filter","x","join","getNumberTypeName","assertString","nonEmpty","char","isString","asStringOrNumber","assertStringOrNumber","isStringOrNumber","collHasKey","coll","getOwnPropertyDescriptor","toAny","clone","entries","reduce","result","entry","val","map","item","cloneColl","assertArray","toFixedArity","arity","min","get","assoc","slice","copy","cloneAndGetMeta","originalColl","innerCollMeta","resultColl","newResultColl","assertObj","parent","collectionUtilsFunctions","evaluate","params","defaultValue","nextValue","undefined","docs","category","returns","args","a","b","variants","argumentNames","description","seeAlso","examples","isAny","assertAny","lastKey","parentKey","ks","array","update","fun","rest","filteri","mapi","reducei","initial","reductions","reductionsi","collectionUtilsModule","functions","source","fromEntries","k","v"],"mappings":"aAEM,SAAUA,EAAcC,GAC5B,IAAKA,EAAeC,WAAaD,EAAeE,KAC9C,MAAO,GAET,MAAMC,EAAcH,EAAeC,SAASG,OAAS,EAC/CC,EAAeL,EAAeE,KAAKI,OAASH,EAAc,EAChE,MAAO,GAAG,IAAII,OAAOC,KAAKC,IAAIN,EAAa,OAAO,IAAII,OAAOC,KAAKC,IAAIJ,EAAc,KACtF,CCkBM,MAAOK,UAAmBC,MACdX,eACAY,aAChB,WAAAC,CAAYC,EAAcd,GACxB,MAAMe,EAAUD,aAAeH,MAC3BG,EAAIC,QACJ,GAAGD,IAEPE,MA/BJ,SAA8BD,EAAiBf,GAC7C,IAAKA,EACH,OAAOe,EAET,MAAME,EAAW,GAAGjB,EAAeC,SAASiB,QAAQlB,EAAeC,SAASG,SAM5E,MAAO,GAAGW,IALWf,EAAemB,SAChC,KAAKnB,EAAemB,YAAYF,IAChC,cAAcA,QACIjB,EAAeE,SACbH,EAAcC,IAExC,CAoBUoB,CAAqBL,EAASf,IACpCqB,KAAKT,aAAeG,EACpBM,KAAKrB,eAAiBA,EACtBsB,OAAOC,eAAeF,KAAMX,EAAWc,WACvCH,KAAKI,KAAO,YACb,CAEM,aAAA1B,GACL,OAAOsB,KAAKrB,gBAAkBD,EAAcsB,KAAKrB,eAClD,EC5CI,MAAM0B,EAAY,CACvBC,OAAQ,EACRC,OAAQ,EACRC,iBAAkB,EAClBC,kBAAmB,EACnBC,kBAAmB,EACnBC,oBAAqB,EACrBC,qBAAsB,EACtBC,eAAgB,EAChBC,QAAS,EACTC,OAAQ,IAGJC,EAAe,IAAIC,IAAIhB,OAAOiB,OAAOb,IAa3C,MAgBMc,EAAkB,IAAIF,IAhBN,CACpB,cACA,UACA,OACA,aACA,OACA,aACA,YACA,WACA,QACA,gBACA,UACA,iBACA,WCvCK,MAAMG,EAAkB,SAClBC,EAAgB,SAChBC,EAAgB,SCE7B,SAASC,EAAgBC,GACvB,OAAa,OAATA,GAAiC,iBAATA,IAGrBJ,KAAmBI,GAAQ,iBAAkBA,IFuC7B,iBADMC,EEtC8CD,EAAKE,eFuC7CP,EAAgBQ,IAAIF,KADnD,IAAyBA,CErC/B,CAEA,SAASG,EAAOC,GACd,SAAKC,MAAMC,QAAQF,IAAUA,EAAM5C,OAAS,KFWrB,iBADEwC,EERPI,EAAM,KFSWb,EAAaW,IAAIF,IADhD,IAAqBA,CEP3B,CAEM,SAAUO,EAAcH,GAC5B,OAAIN,EAAgBM,GAEX,aAAcA,EAAczB,MAAQ,OAEzCwB,EAAOC,GACF,GFNqBJ,EEMFI,EAAM,GFL3B5B,OAAOgC,KAAK5B,GAAW6B,KAAKC,GAAO9B,EAAU8B,KAAmCV,UEOzE,OAAVI,EACK,OAEY,iBAAVA,GAAsBA,aAAiBO,OACzC,GAAGP,IAES,iBAAVA,GAAsBA,aAAiBvC,MACzCuC,EAAMQ,WAERC,KAAKC,UAAUV,GFjBlB,IAA0BJ,CEkBhC,CCjCgB,SAAAe,EAAkBC,EAAe9D,GAE/C,OAAO8D,GAAU9D,gBAAkBA,CACrC,UCAgB+D,EAAkBC,EAAkBd,EAAgBlD,GAClE,OAAO,IAAIU,EAAW,YAAYsD,UAAiBX,EAAcH,MAAWW,EAAkBX,EAAOlD,GACvG,CCyBM,SAAUiE,EAAMf,GACpB,QACY,OAAVA,GACoB,iBAAVA,GACPC,MAAMC,QAAQF,IACdA,aAAiBO,QC/BlB,SAA0BP,GAC9B,OAAc,OAAVA,GAAmC,iBAAVA,KAGnBA,EAAwBT,EACpC,CD2BOG,CAAgBM,KA0BagB,EAzBThB,EA0BV,OAAXgB,GAAqC,iBAAXA,GAGpBA,EAA6BxB,KAgCnC,SAAmBQ,GACvB,OAAc,OAAVA,GAAmC,iBAAVA,KAGnBA,EAAoBP,EAChC,CAjEOwB,CAASjB,IAwBV,IAA8BgB,CAtBpC,CAUM,SAAUE,EAAOlB,GACrB,OAjCI,SAAgBA,GACpB,OAAOC,MAAMC,QAAQF,IAA2B,iBAAVA,CACxC,CA+BSmB,CAAMnB,IAAUe,EAAMf,EAC/B,CACgB,SAAAoB,EAAOpB,EAAgBlD,GAErC,OADAuE,EAAWrB,EAAOlD,GACXkD,CACT,CACgB,SAAAqB,EAAWrB,EAAgBlD,GACzC,IAAKoE,EAAOlB,GACV,MAAMa,EAAkB,0BAA2Bb,EAAOlD,EAC9D,UEgEgBwE,EAAStB,EAAgBuB,EAAyB,IAChE,MAAqB,iBAAVvB,KAGPvB,OAAO+C,MAAMxB,OAGbuB,EAAQE,UAAYhD,OAAOiD,UAAU1B,QAGrCuB,EAAQI,SAAWlD,OAAOmD,SAAS5B,QAGnCuB,EAAQM,MAAkB,IAAV7B,OAGhBuB,EAAQO,SAAqB,IAAV9B,OAGnBuB,EAAQQ,UAAY/B,GAAS,OAG7BuB,EAAQS,UAAYhC,GAAS,OAG7BuB,EAAQU,aAAejC,EAAQ,OAG/BuB,EAAQW,aAAelC,EAAQ,OAGT,iBAAfuB,EAAQY,IAAmBnC,GAASuB,EAAQY,QAG5B,iBAAhBZ,EAAQa,KAAoBpC,EAAQuB,EAAQa,SAG7B,iBAAfb,EAAQc,IAAmBrC,GAASuB,EAAQc,OAG5B,iBAAhBd,EAAQe,KAAoBtC,EAAQuB,EAAQe,gBAIzD,CAEM,SAAUC,EACdvC,EACAlD,EACAyE,EAAyB,CAAA,GAEzB,IAAKD,EAAStB,EAAOuB,GACnB,MAAM,IAAI/D,EACR,YAjEN,SAA2B+D,GACzB,GAAIA,EAAQM,KACV,MAAO,OAET,MAAMW,EAlBR,SAAuBjB,GACrB,OAAOA,EAAQQ,SACX,WACAR,EAAQS,SACN,WACAT,EAAQW,YACN,eACAX,EAAQU,YACN,eACAV,EAAQO,QACN,WACA,EACd,CAMeW,CAAclB,GACrBmB,EAAanB,EAAQE,QAAU,UAAY,SAC3CE,EAASJ,EAAQI,OAAS,SAAW,GACrCgB,EAvCR,SAAwBpB,GAItB,MAF2B,iBAAfA,EAAQY,IAA0C,iBAAhBZ,EAAQa,KACxB,iBAAfb,EAAQc,IAA0C,iBAAhBd,EAAQe,IAM1B,iBAAff,EAAQY,IAA0C,iBAAhBZ,EAAQa,IACxB,iBAAfb,EAAQY,GAAkB,OAAOZ,EAAQY,KAAO,QAAQZ,EAAQa,MAEpD,iBAAfb,EAAQc,IAA0C,iBAAhBd,EAAQe,IACxB,iBAAff,EAAQc,GAAkB,OAAOd,EAAQc,KAAO,QAAQd,EAAQe,MAErE,GAVL,GAAyB,iBAAff,EAAQY,GAAkB,GAAGZ,EAAQY,UAAY,GAAGZ,EAAQa,cACrD,iBAAfb,EAAQc,GAAkB,KAAKd,EAAQc,KAAO,MAAMd,EAAQe,OAUzE,CAuBgBM,CAAerB,GAE7B,MAAO,CAACiB,EAAMb,EAAQe,EAAYC,GAAOE,OAAOC,KAAOA,GAAGC,KAAK,IACjE,CAuDkBC,CAAkBzB,WAAiBpB,EAAcH,MAC7DW,EAAkBX,EAAOlD,GAG/B,CC7JM,SAAUmG,EACdjD,EACAlD,EACAyE,EAAkC,CAAA,GAElC,aAlBuBvB,EAAgBuB,EAAkC,IACzE,QAAqB,iBAAVvB,GAGPuB,EAAQ2B,UAA6B,IAAjBlD,EAAM5C,QAG1BmE,EAAQ4B,MAAyB,IAAjBnD,EAAM5C,OAI5B,CAOOgG,CAASpD,EAAOuB,GACnB,MAAMV,EACJ,IAAGU,EAAQ2B,SAAW,mBAAqB3B,EAAQ4B,KAAO,YAAc,UACxEnD,EACAlD,EAGN,CAcgB,SAAAuG,EAAiBrD,EAAgBlD,GAE/C,OADAwG,EAAqBtD,EAAOlD,GACrBkD,CACT,CACgB,SAAAsD,EACdtD,EACAlD,GAEA,IAXI,SAA2BkD,GAC/B,MAAwB,iBAAVA,GAAuC,iBAAVA,CAC7C,CASOuD,CAAiBvD,GACpB,MAAMa,EAAkB,mBAAoBb,EAAOlD,EACvD,CCtDgB,SAAA0G,EAAWC,EAAenD,GACxC,QAAKY,EAAOuC,KAGQ,iBAATA,GAAqBxD,MAAMC,QAAQuD,KACvCnC,EAAShB,EAAK,CAAEmB,SAAS,MAGvBnB,GAAO,GAAKA,EAAMmD,EAAKrG,UAEvBgB,OAAOsF,yBAAyBD,EAAMnD,GACjD,CAuDM,SAAUqD,EAAM3D,GACpB,OAAQA,GAAS,IACnB,CAEA,SAAS4D,EAAS5D,GAChB,OAAIe,EAAMf,GACD5B,OAAOyF,QAAQ7D,GAAO8D,OAAO,CAACC,EAAaC,KAChD,MAAO1D,EAAK2D,GAAOD,EAEnB,OADAD,EAAOzD,GAAOsD,EAAMK,GACbF,GACN,CAAE,GAEH9D,MAAMC,QAAQF,GAETA,EAAMkE,IAAIC,GAAQP,EAAMO,IAE1BnE,CACT,CAEM,SAAUoE,EAA0BpE,GACxC,OAAO4D,EAAM5D,EACf,CCvFgB,SAAAqE,EAAYrE,EAAgBlD,GAC1C,IAAKmD,MAAMC,QAAQF,GACjB,MAAMa,EAAkB,QAASb,EAAOlD,EAC5C,CCuEM,SAAUwH,EAAaC,GAC3B,MAAO,CAAEC,IAAKD,EAAOhH,IAAKgH,EAC5B,CCtEA,SAASE,EAAIhB,EAAYnD,GACvB,GAAIS,EAAM0C,IACR,GAAmB,iBAARnD,GAAoBkD,EAAWC,EAAMnD,GAC9C,OAAOqD,EAAMF,EAAKnD,SAGpB,GAAIgB,EAAShB,EAAK,CAAE4B,aAAa,EAAMT,SAAS,KAAWnB,GAAO,GAAKA,EAAMmD,EAAKrG,OAChF,OAAOuG,EAAMF,EAAKnD,GAGxB,CAGA,SAASoE,EAAMjB,EAAYnD,EAAsBN,EAAYlD,GAE3D,GADAuE,EAAWoC,EAAM3G,GACbmD,MAAMC,QAAQuD,IAAyB,iBAATA,EAAmB,CAInD,GAHAlB,EAAajC,EAAKxD,EAAgB,CAAE2E,SAAS,IAC7Cc,EAAajC,EAAKxD,EAAgB,CAAEsF,IAAK,IACzCG,EAAajC,EAAKxD,EAAgB,CAAEwF,IAAKmB,EAAKrG,SAC1B,iBAATqG,EAET,OADAR,EAAajD,EAAOlD,EAAgB,CAAEqG,MAAM,IACrC,GAAGM,EAAKkB,MAAM,EAAGrE,KAAON,IAAQyD,EAAKkB,MAAMrE,EAAM,KAE1D,MAAMsE,EAAO,IAAInB,GAEjB,OADAmB,EAAKtE,GAAON,EACL4E,CACR,CACD3B,EAAa3C,EAAKxD,GAClB,MAAM8H,EAAO,IAAKnB,GAElB,OADAmB,EAAKtE,GAAON,EACL4E,CACT,CAQA,SAASC,EACPC,EACA1E,EACAtD,GAEA,MAAM2G,EAAOW,EAAUU,GA0BvB,MAAO,CAAErB,OAAMsB,cAxBK3E,EAAKuE,MAAM,EAAGvE,EAAKhD,OAAS,GAEd0G,OAChC,CAACC,EAAkBzD,KACjB,MAAM0E,EAAajB,EAAON,KAE1B,IAAIwB,EAcJ,OAbIhF,MAAMC,QAAQ8E,IAChBzC,EAAajC,EAAKxD,GAClBmI,EAAgB7D,EAAO4D,EAAW1E,GAAMxD,MPtBhC,SAAUkD,EAAgBlD,GACxC,IAAKiE,EAAMf,GACT,MAAMa,EAAkB,SAAUb,EAAOlD,EAC7C,COsBQoI,CAAUF,EAAYlI,GACtBmG,EAAa3C,EAAKxD,GACb0G,EAAWO,EAAON,KAAMnD,KAC3B,EAAaA,GAAO,IAEtB2E,EAAgB7D,EAAO4D,EAAW1E,GAAMxD,IAGnC,CAAE2G,KAAMwB,EAAeE,OAAQH,IAExC,CAAEvB,OAAM0B,OAAQ,CAAA,IAGpB,CAEA,MAAMC,EAAqD,CACzD,SAAU,CACRC,SAAU,CAACC,EAAQxI,KACjB,IAAI2G,EAAOE,EAAM2B,EAAO,IACxB,MAAMlF,EAAOkF,EAAO,IAAM,GACpBC,EAAe5B,EAAM2B,EAAO,IAClCjB,EAAYjE,EAAMtD,GAClB,IAAK,MAAMwD,KAAOF,EAAM,CAEtB,GADAkD,EAAqBhD,EAAKxD,IACtBoE,EAAOuC,GAQT,OAAO8B,EARS,CAChB,MAAMC,EAAYf,EAAIhB,EAAMnD,GAC5B,QAAkBmF,IAAdD,EAGF,OAAOD,EAFP9B,EAAO+B,CAGV,CAIF,CACD,OAAO/B,GAETc,MAAO,CAAEC,IAAK,EAAGjH,IAAK,GACtBmI,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,OACjBiG,KAAM,CACJC,EAAK,CAAElG,KAAM,cACbmG,EAAK,CAAEnG,KAAM,SACb,YAAa,CAAEA,KAAM,QAEvBoG,SAAU,CACR,CAAEC,cAAe,CAAC,IAAK,MACvB,CAAEA,cAAe,CAAC,IAAK,IAAK,eAE9BC,YAAa,sKACbC,QAAS,CAAC,MAAO,sBAAuB,wBACxCC,SAAU,CACR,0GAMA,0GAMA,wHAUN,WAAY,CACVf,SAAU,EAAEP,EAAc1E,EAAMJ,GAAQlD,KAKtC,GAJAuE,EAAWyD,EAAchI,GACzBuH,EAAYjE,EAAMtD,GPvIR,SAAUkD,EAAgBlD,GACxC,IATI,SAAgBkD,GAEpB,YAAiByF,IAAVzF,CACT,CAMOqG,CAAMrG,GACT,MAAMa,EAAkB,gBAAiBb,EAAOlD,EACpD,COqIMwJ,CAAUtG,EAAOlD,GAEG,IAAhBsD,EAAKhD,OAEP,OADAkG,EAAqBlD,EAAK,GAAItD,GACvB4H,EAAMI,EAAc1E,EAAK,GAAIJ,EAAOlD,GAG7C,MAAM2G,KAAEA,EAAIsB,cAAEA,GAAkBF,EAAgBC,EAAc1E,EAAMtD,GAE9DyJ,EAAUlD,EAAiBjD,EAAKA,EAAKhD,OAAS,GAAIN,GAClD0J,EAAYnD,EAAiBjD,EAAKA,EAAKhD,OAAS,GAAIN,GAW1D,OATImD,MAAMC,QAAQ6E,EAAcI,SAC9B5C,EAAaiE,EAAW1J,GACxBiI,EAAcI,OAAOqB,GAAa9B,EAAMK,EAActB,KAAM8C,EAASvG,EAAOlD,KAG5EmG,EAAauD,EAAW1J,GACxBiI,EAAcI,OAAOqB,GAAa9B,EAAMK,EAActB,KAAM8C,EAASvG,EAAOlD,IAGvE2G,GAETc,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,cACjBiG,KAAM,CACJpC,KAAM,CAAE7D,KAAM,cACd6G,GAAI,CAAE7G,KAAM,CAAC,SAAU,UAAW8G,OAAO,GACzC1G,MAAO,CAAEJ,KAAM,QAEjBoG,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,KAAM,WAC3CC,YAAa,8NAIbC,QAAS,CAAC,QAAS,oBAAqB,wBACxCC,SAAU,CACR,yFAOA,+FAOA,8GAUNO,OAAU,CACRtB,SAAU,KAAQ,MAAM,IAAI5H,MAAM,wDAClC8G,MAAO,CAAEC,IAAK,GACdkB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,cACjBiG,KAAM,CACJpC,KAAQ,CAAE7D,KAAM,cAChBU,IAAO,CAAEV,KAAM,CAAC,SAAU,WAC1BgH,IAAO,CAAEhH,KAAM,YACf,WAAY,CAAEA,KAAM,MAAOiH,MAAM,IAEnCb,SAAU,CACR,CAAEC,cAAe,CAAC,OAAQ,MAAO,QACjC,CAAEA,cAAe,CAAC,OAAQ,MAAO,MAAO,cAE1CC,YAAa,wOAKbC,QAAS,CAAC,uBAAwB,SAClCC,SAAU,CACR,kFAIA,8HAWN,YAAa,CACXf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,2DAClC8G,MAAO,CAAEC,IAAK,GACdkB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,cACjBiG,KAAM,CACJpC,KAAQ,CAAE7D,KAAM,cAChB6G,GAAM,CAAE7G,KAAM,SACdgH,IAAO,CAAEhH,KAAM,YACf,WAAY,CAAEA,KAAM,MAAOiH,MAAM,IAEnCb,SAAU,CACR,CAAEC,cAAe,CAAC,OAAQ,KAAM,QAChC,CAAEA,cAAe,CAAC,OAAQ,KAAM,MAAO,cAEzCC,YAAa,8RAIbC,QAAS,CAAC,oBAAqB,sBAAuB,qBACtDC,SAAU,CACR,iHAOA,wHAOA,wHAOA,mHAaNU,QAAW,CACTzB,SAAU,KAAQ,MAAM,IAAI5H,MAAM,yDAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,cACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CACDnG,KAAM,WACNsG,YAAa,uIAGjBF,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,kNACbC,QAAS,CAAC,SAAU,mBACpBC,SAAU,CACR,2EACA,2EACA,6EAINW,KAAQ,CACN1B,SAAU,KAAQ,MAAM,IAAI5H,MAAM,sDAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,cACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CACDnG,KAAM,WACNsG,YAAa,uIAGjBF,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,2NACbC,QAAS,CAAC,MAAO,sBACjBC,SAAU,CACR,mEACA,mEACA,mEACA,mEACA,2EAINY,QAAW,CACT3B,SAAU,KAAQ,MAAM,IAAI5H,MAAM,yDAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,OACjBiG,KAAM,CACJpC,KAAM,CAAE7D,KAAM,cACdgH,IAAK,CACHhH,KAAM,WACNsG,YAAa,0JAEfe,QAAS,CACPrH,KAAM,MACNsG,YAAa,iDAGjBF,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,MAAO,aAC5CC,YAAa,6WACbC,QAAS,CAAC,SAAU,2BAA4B,0BAChDC,SAAU,CACR,oFACA,sFACA,8EAIN,eAAgB,CACdf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,8DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,OACjBiG,KAAM,CACJe,IAAK,CAAEhH,KAAM,YACb6D,KAAM,CAAE7D,KAAM,cACdqH,QAAS,CAAErH,KAAM,QAEnBoG,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,MAAO,aAC5CC,YAAa,wPACbC,QAAS,CAAC,SAAU,4BACpBC,SAAU,CACR,yEACA,wEAIN,gBAAiB,CACff,SAAU,KAAQ,MAAM,IAAI5H,MAAM,+DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,OACjBiG,KAAM,CACJpC,KAAM,CAAE7D,KAAM,cACdgH,IAAK,CACHhH,KAAM,WACNsG,YAAa,0JAEfe,QAAS,CACPrH,KAAM,MACNsG,YAAa,iDAGjBF,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,MAAO,aAC5CC,YAAa,2YACbC,QAAS,CAAC,qBAAsB,2BAChCC,SAAU,CACR,0FACA,4FACA,oFAINc,WAAc,CACZ7B,SAAU,KAAQ,MAAM,IAAI5H,MAAM,4DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,MAAO8G,OAAO,GAC/Bb,KAAM,CACJe,IAAK,CAAEhH,KAAM,YACb6D,KAAM,CAAE7D,KAAM,cACdqH,QAAS,CAAErH,KAAM,QAEnBoG,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,MAAO,aAC5CC,YAAa,gGACbC,QAAS,CAAC,SAAU,0BACpBC,SAAU,CACR,8DACA,+DACA,uDACA,mEACA,uJAUNe,YAAe,CACb9B,SAAU,KAAQ,MAAM,IAAI5H,MAAM,6DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,MAAO8G,OAAO,GAC/Bb,KAAM,CACJpC,KAAM,CAAE7D,KAAM,cACdgH,IAAK,CACHhH,KAAM,WACNsG,YAAa,0JAEfe,QAAS,CACPrH,KAAM,MACNsG,YAAa,iDAGjBF,SAAU,CAAC,CAAEC,cAAe,CAAC,OAAQ,MAAO,aAC5CC,YAAa,mPACbC,QAAS,CAAC,wBAAyB,sBACnCC,SAAU,CACR,wFACA,0FACA,kFAIN,YAAa,CACXf,SAAU,EAAE5B,GAAO3G,IACJ,OAAT2G,EACK,MAETpC,EAAWoC,EAAM3G,GACG,iBAAT2G,GAGPxD,MAAMC,QAAQuD,GAFTA,EAAKrG,OAAS,EAAIqG,EAAO,KAK3BrF,OAAOgC,KAAKqD,GAAMrG,OAAS,EAAIqG,EAAO,MAE/Cc,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,OACjBiG,KAAM,CACJpC,KAAM,CAAE7D,KAAM,CAAC,aAAc,UAE/BoG,SAAU,CAAC,CAAEC,cAAe,CAAC,UAC7BC,YAAa,+DACbC,QAAS,CAAC,SAAU,cACpBC,SAAU,CACR,gDACA,uDACA,gDACA,sDACA,gDACA,sDACA,qDAIN,SAAU,CACRf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,wDAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,WACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CAAEnG,KAAM,aAEboG,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,kGACbC,QAAS,CAAC,kBAAmB,wBAAyB,sBAAuB,wBAAyB,oBACtGC,SAAU,CACR,6DACA,2DACA,iGAMA,sFAMA,sDACA,sDACA,sDACA,yFAMA,6FASN,OAAQ,CACNf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,sDAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,WACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CAAEnG,KAAM,aAEboG,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,kGACbC,QAAS,CAAC,oBAAqB,sBAAuB,wBAAyB,uBAAwB,OAAQ,cAC/GC,SAAU,CACR,8FAMA,qFAMA,oDACA,oDACA,oDACA,wFAMA,2FASN,WAAY,CACVf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,0DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,WACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CAAEnG,KAAM,aAEboG,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,kGACbC,QAAS,CAAC,kBAAmB,oBAAqB,yBAClDC,SAAU,CACR,kGAMA,yFAMA,wDACA,wDACA,wDACA,4FAMA,+FASN,aAAc,CACZf,SAAU,KAAQ,MAAM,IAAI5H,MAAM,4DAClC8G,MAAOD,EAAa,GACpBoB,KAAM,CACJC,SAAU,aACVC,QAAS,CAAEhG,KAAM,WACjBiG,KAAM,CACJC,EAAG,CAAElG,KAAM,cACXmG,EAAG,CAAEnG,KAAM,aAEboG,SAAU,CAAC,CAAEC,cAAe,CAAC,IAAK,OAClCC,YAAa,oHACbC,QAAS,CAAC,oBAAqB,kBAAmB,uBAClDC,SAAU,CACR,oGAMA,2FAMA,0DACA,0DACA,0DACA,8FAMA,kGAWKgB,EAAqC,CAChD7I,KAAM,aACN8I,UAAWjC,EACXkC,OChsBa,o3ODisBb5B,MEpqBsC2B,EFoqBRjC,EEnqBvBhH,OAAOmJ,YACZnJ,OAAOyF,QAAQwD,GAAWnD,IAAI,EAAEsD,EAAGC,MACjC,IAAKA,EAAE/B,KACL,MAAM,IAAIjI,MAAM,8BAA8B+J,MAChD,MAAO,CAACA,EAAGC,EAAE/B,WALb,IAAkC2B"}