beeai-framework 0.1.15 → 0.1.17

package/dist/internals/helpers/math.d.cts

@@ -1,17 +1,6 @@
 /**
  * Copyright 2025 © BeeAI a Series of LF Projects, LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
+ * SPDX-License-Identifier: Apache-2.0
  */
 declare function cosineSimilarity(vecA: number[], vecB: number[]): number;
 declare function cosineSimilarityMatrix(matrixA: number[][], matrixB: number[][]): number[][];

package/dist/internals/helpers/math.d.ts

@@ -1,17 +1,6 @@
 /**
  * Copyright 2025 © BeeAI a Series of LF Projects, LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
+ * SPDX-License-Identifier: Apache-2.0
  */
 declare function cosineSimilarity(vecA: number[], vecB: number[]): number;
 declare function cosineSimilarityMatrix(matrixA: number[][], matrixB: number[][]): number[][];

package/dist/internals/helpers/math.js.map

@@ -1 +1 @@
-{"version":3,"sources":["math.ts"],"names":["cosineSimilarity","vecA","vecB","length","ValueError","dot","reduce","sum","value","index","magA","Math","sqrt","magB","cosineSimilarityMatrix","matrixA","matrixB","map","rowA","rowB"],"mappings":";;;;AAkBO,SAASA,gBAAAA,CAAiBC,MAAgBC,IAAc,EAAA;AAC7D,EAAID,IAAAA,IAAAA,CAAKE,MAAWD,KAAAA,IAAAA,CAAKC,MAAQ,EAAA;AAC/B,IAAM,MAAA,IAAIC,WAAW,gCAAA,CAAA;AACvB;AAEA,EAAA,MAAMC,GAAMJ,GAAAA,IAAAA,CAAKK,MAAO,CAAA,CAACC,GAAKC,EAAAA,KAAAA,EAAOC,KAAUF,KAAAA,GAAAA,GAAMC,KAAQN,GAAAA,IAAAA,CAAKO,KAAAA,CAAAA,EAAQ,CAAA,CAAA;AAC1E,EAAA,MAAMC,IAAOC,GAAAA,IAAAA,CAAKC,IAAKX,CAAAA,IAAAA,CAAKK,MAAO,CAAA,CAACC,GAAKC,EAAAA,KAAAA,KAAUD,GAAMC,GAAAA,KAAAA,IAAS,CAAG,EAAA,CAAA,CAAA,CAAA;AACrE,EAAA,MAAMK,IAAOF,GAAAA,IAAAA,CAAKC,IAAKV,CAAAA,IAAAA,CAAKI,MAAO,CAAA,CAACC,GAAKC,EAAAA,KAAAA,KAAUD,GAAMC,GAAAA,KAAAA,IAAS,CAAG,EAAA,CAAA,CAAA,CAAA;AAErE,EAAIE,IAAAA,IAAAA,KAAS,CAAKG,IAAAA,IAAAA,KAAS,CAAG,EAAA;AAC5B,IAAM,MAAA,IAAIT,WAAW,wCAAA,CAAA;AACvB;AACA,EAAA,OAAOC,OAAOK,IAAOG,GAAAA,IAAAA,CAAAA;AACvB;AAbgBb,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA;AAeT,SAASc,sBAAAA,CAAuBC,SAAqBC,OAAmB,EAAA;AAC7E,EAAKD,IAAAA,CAAAA,OAAAA,CAAQ,CAAA,CAAIZ,EAAAA,MAAAA,IAAU,QAAQY,OAAQ,CAAA,CAAA,CAAIZ,EAAAA,MAAAA,IAAU,CAAI,CAAA,EAAA;AAC3D,IAAM,MAAA,IAAIC,WAAW,gDAAA,CAAA;AACvB;AAEA,EAAA,OAAOW,OAAQE,CAAAA,GAAAA,CAAI,CAACC,IAAAA,KAASF,OAAQC,CAAAA,GAAAA,CAAI,CAACE,IAAAA,KAASnB,gBAAiBkB,CAAAA,IAAAA,EAAMC,IAAAA,CAAAA,CAAAA,CAAAA;AAC5E;AANgBL,MAAAA,CAAAA,sBAAAA,EAAAA,wBAAAA,CAAAA","file":"math.js","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ValueError } from \"@/errors.js\";\n\nexport function cosineSimilarity(vecA: number[], vecB: number[]): number {\n  if (vecA.length !== vecB.length) {\n    throw new ValueError(\"Vectors must have equal length\");\n  }\n  // (cos θ) = (A · B) / (|A| * |B|)\n  const dot = vecA.reduce((sum, value, index) => sum + value * vecB[index], 0);\n  const magA = Math.sqrt(vecA.reduce((sum, value) => sum + value ** 2, 0));\n  const magB = Math.sqrt(vecB.reduce((sum, value) => sum + value ** 2, 0));\n\n  if (magA === 0 || magB === 0) {\n    throw new ValueError(\"Vectors cannot not have zero magnitude\");\n  }\n  return dot / (magA * magB);\n}\n\nexport function cosineSimilarityMatrix(matrixA: number[][], matrixB: number[][]): number[][] {\n  if ((matrixA[0]?.length ?? 0) !== (matrixA[0]?.length ?? 0)) {\n    throw new ValueError(\"Matrices must have the same number of columns.\");\n  }\n\n  return matrixA.map((rowA) => matrixB.map((rowB) => cosineSimilarity(rowA, rowB)));\n}\n"]}
+{"version":3,"sources":["../../../src/internals/helpers/math.ts"],"names":["cosineSimilarity","vecA","vecB","length","ValueError","dot","reduce","sum","value","index","magA","Math","sqrt","magB","cosineSimilarityMatrix","matrixA","matrixB","map","rowA","rowB"],"mappings":";;;;AAOO,SAASA,gBAAAA,CAAiBC,MAAgBC,IAAAA,EAAc;AAC7D,EAAA,IAAID,IAAAA,CAAKE,MAAAA,KAAWD,IAAAA,CAAKC,MAAAA,EAAQ;AAC/B,IAAA,MAAM,IAAIC,WAAW,gCAAA,CAAA;AACvB;AAEA,EAAA,MAAMC,GAAAA,GAAMJ,IAAAA,CAAKK,MAAAA,CAAO,CAACC,GAAAA,EAAKC,KAAAA,EAAOC,KAAAA,KAAUF,GAAAA,GAAMC,KAAAA,GAAQN,IAAAA,CAAKO,KAAAA,CAAAA,EAAQ,CAAA,CAAA;AAC1E,EAAA,MAAMC,IAAAA,GAAOC,IAAAA,CAAKC,IAAAA,CAAKX,IAAAA,CAAKK,MAAAA,CAAO,CAACC,GAAAA,EAAKC,KAAAA,KAAUD,GAAAA,GAAMC,KAAAA,IAAS,CAAA,EAAG,CAAA,CAAA,CAAA;AACrE,EAAA,MAAMK,IAAAA,GAAOF,IAAAA,CAAKC,IAAAA,CAAKV,IAAAA,CAAKI,MAAAA,CAAO,CAACC,GAAAA,EAAKC,KAAAA,KAAUD,GAAAA,GAAMC,KAAAA,IAAS,CAAA,EAAG,CAAA,CAAA,CAAA;AAErE,EAAA,IAAIE,IAAAA,KAAS,CAAA,IAAKG,IAAAA,KAAS,CAAA,EAAG;AAC5B,IAAA,MAAM,IAAIT,WAAW,wCAAA,CAAA;AACvB;AACA,EAAA,OAAOC,OAAOK,IAAAA,GAAOG,IAAAA,CAAAA;AACvB;AAbgBb,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA;AAeT,SAASc,sBAAAA,CAAuBC,SAAqBC,OAAAA,EAAmB;AAC7E,EAAA,IAAA,CAAKD,OAAAA,CAAQ,CAAA,CAAA,EAAIZ,MAAAA,IAAU,QAAQY,OAAAA,CAAQ,CAAA,CAAA,EAAIZ,MAAAA,IAAU,CAAA,CAAA,EAAI;AAC3D,IAAA,MAAM,IAAIC,WAAW,gDAAA,CAAA;AACvB;AAEA,EAAA,OAAOW,OAAAA,CAAQE,GAAAA,CAAI,CAACC,IAAAA,KAASF,OAAAA,CAAQC,GAAAA,CAAI,CAACE,IAAAA,KAASnB,gBAAAA,CAAiBkB,IAAAA,EAAMC,IAAAA,CAAAA,CAAAA,CAAAA;AAC5E;AANgBL,MAAAA,CAAAA,sBAAAA,EAAAA,wBAAAA,CAAAA","file":"math.js","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n * SPDX-License-Identifier: Apache-2.0\n */\n\nimport { ValueError } from \"@/errors.js\";\n\nexport function cosineSimilarity(vecA: number[], vecB: number[]): number {\n  if (vecA.length !== vecB.length) {\n    throw new ValueError(\"Vectors must have equal length\");\n  }\n  // (cos θ) = (A · B) / (|A| * |B|)\n  const dot = vecA.reduce((sum, value, index) => sum + value * vecB[index], 0);\n  const magA = Math.sqrt(vecA.reduce((sum, value) => sum + value ** 2, 0));\n  const magB = Math.sqrt(vecB.reduce((sum, value) => sum + value ** 2, 0));\n\n  if (magA === 0 || magB === 0) {\n    throw new ValueError(\"Vectors cannot not have zero magnitude\");\n  }\n  return dot / (magA * magB);\n}\n\nexport function cosineSimilarityMatrix(matrixA: number[][], matrixB: number[][]): number[][] {\n  if ((matrixA[0]?.length ?? 0) !== (matrixA[0]?.length ?? 0)) {\n    throw new ValueError(\"Matrices must have the same number of columns.\");\n  }\n\n  return matrixA.map((rowA) => matrixB.map((rowB) => cosineSimilarity(rowA, rowB)));\n}\n"]}

package/dist/internals/helpers/number.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["number.ts"],"names":["safeSum","numbers","R","sum","filter","isNonNullish","takeBigger","Math","max","ensureRange","value","options","min","Infinity"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAkBO,SAASA,WAAWC,OAAsC,EAAA;AAC/D,EAAA,OAAOC,aAAEC,GAAIF,CAAAA,OAAAA,EAASG,MAAOF,CAAAA,YAAAA,CAAEG,YAAY,CAAK,IAAA;AAAC,IAAA;AAAE,GAAA,CAAA;AACrD;AAFgBL,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAIT,SAASM,cAAcL,OAAsC,EAAA;AAClE,EAAA,OAAOM,KAAKC,GAAG,CAAA,GAAKP,SAASG,MAAOF,CAAAA,YAAAA,CAAEG,YAAY,CAAK,IAAA;AAAC,IAAA;GAAE,CAAM,IAAA,CAAA;AAClE;AAFgBC,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAIT,SAASG,WAAAA,CAAYC,OAAeC,OAAuC,EAAA;AAChF,EAAOJ,OAAAA,IAAAA,CAAKC,GAAIG,CAAAA,OAAAA,CAAQC,GAAO,IAAA,CAAA,QAAA,EAAWL,IAAKK,CAAAA,GAAAA,CAAIF,KAAOC,EAAAA,OAAAA,CAAQH,GAAOK,IAAAA,QAAAA,CAAAA,CAAAA;AAC3E;AAFgBJ,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA","file":"number.cjs","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport * as R from \"remeda\";\n\nexport function safeSum(...numbers: (number | undefined | null)[]): number {\n  return R.sum(numbers?.filter(R.isNonNullish) || [0]);\n}\n\nexport function takeBigger(...numbers: (number | undefined | null)[]): number {\n  return Math.max(...(numbers?.filter(R.isNonNullish) || [0])) || 0;\n}\n\nexport function ensureRange(value: number, options: { min?: number; max?: number }): number {\n  return Math.max(options.min ?? -Infinity, Math.min(value, options.max ?? Infinity));\n}\n"]}
+{"version":3,"sources":["../../../src/internals/helpers/number.ts"],"names":["safeSum","numbers","R","sum","filter","isNonNullish","takeBigger","Math","max","ensureRange","value","options","min","Infinity"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAOO,SAASA,WAAWC,OAAAA,EAAsC;AAC/D,EAAA,OAAOC,aAAEC,GAAAA,CAAIF,OAAAA,EAASG,MAAAA,CAAOF,YAAAA,CAAEG,YAAY,CAAA,IAAK;AAAC,IAAA;AAAE,GAAA,CAAA;AACrD;AAFgBL,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAIT,SAASM,cAAcL,OAAAA,EAAsC;AAClE,EAAA,OAAOM,KAAKC,GAAAA,CAAG,GAAKP,SAASG,MAAAA,CAAOF,YAAAA,CAAEG,YAAY,CAAA,IAAK;AAAC,IAAA;GAAE,CAAA,IAAM,CAAA;AAClE;AAFgBC,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAIT,SAASG,WAAAA,CAAYC,OAAeC,OAAAA,EAAuC;AAChF,EAAA,OAAOJ,IAAAA,CAAKC,GAAAA,CAAIG,OAAAA,CAAQC,GAAAA,IAAO,CAAA,QAAA,EAAWL,IAAAA,CAAKK,GAAAA,CAAIF,KAAAA,EAAOC,OAAAA,CAAQH,GAAAA,IAAOK,QAAAA,CAAAA,CAAAA;AAC3E;AAFgBJ,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA","file":"number.cjs","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n * SPDX-License-Identifier: Apache-2.0\n */\n\nimport * as R from \"remeda\";\n\nexport function safeSum(...numbers: (number | undefined | null)[]): number {\n  return R.sum(numbers?.filter(R.isNonNullish) || [0]);\n}\n\nexport function takeBigger(...numbers: (number | undefined | null)[]): number {\n  return Math.max(...(numbers?.filter(R.isNonNullish) || [0])) || 0;\n}\n\nexport function ensureRange(value: number, options: { min?: number; max?: number }): number {\n  return Math.max(options.min ?? -Infinity, Math.min(value, options.max ?? Infinity));\n}\n"]}

package/dist/internals/helpers/number.d.cts

@@ -1,17 +1,6 @@
 /**
  * Copyright 2025 © BeeAI a Series of LF Projects, LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
+ * SPDX-License-Identifier: Apache-2.0
  */
 declare function safeSum(...numbers: (number | undefined | null)[]): number;
 declare function takeBigger(...numbers: (number | undefined | null)[]): number;

package/dist/internals/helpers/number.d.ts

@@ -1,17 +1,6 @@
 /**
  * Copyright 2025 © BeeAI a Series of LF Projects, LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
+ * SPDX-License-Identifier: Apache-2.0
  */
 declare function safeSum(...numbers: (number | undefined | null)[]): number;
 declare function takeBigger(...numbers: (number | undefined | null)[]): number;

package/dist/internals/helpers/number.js.map

@@ -1 +1 @@
-{"version":3,"sources":["number.ts"],"names":["safeSum","numbers","R","sum","filter","isNonNullish","takeBigger","Math","max","ensureRange","value","options","min","Infinity"],"mappings":";;;;AAkBO,SAASA,WAAWC,OAAsC,EAAA;AAC/D,EAAA,OAAOC,EAAEC,GAAIF,CAAAA,OAAAA,EAASG,MAAOF,CAAAA,CAAAA,CAAEG,YAAY,CAAK,IAAA;AAAC,IAAA;AAAE,GAAA,CAAA;AACrD;AAFgBL,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAIT,SAASM,cAAcL,OAAsC,EAAA;AAClE,EAAA,OAAOM,KAAKC,GAAG,CAAA,GAAKP,SAASG,MAAOF,CAAAA,CAAAA,CAAEG,YAAY,CAAK,IAAA;AAAC,IAAA;GAAE,CAAM,IAAA,CAAA;AAClE;AAFgBC,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAIT,SAASG,WAAAA,CAAYC,OAAeC,OAAuC,EAAA;AAChF,EAAOJ,OAAAA,IAAAA,CAAKC,GAAIG,CAAAA,OAAAA,CAAQC,GAAO,IAAA,CAAA,QAAA,EAAWL,IAAKK,CAAAA,GAAAA,CAAIF,KAAOC,EAAAA,OAAAA,CAAQH,GAAOK,IAAAA,QAAAA,CAAAA,CAAAA;AAC3E;AAFgBJ,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA","file":"number.js","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport * as R from \"remeda\";\n\nexport function safeSum(...numbers: (number | undefined | null)[]): number {\n  return R.sum(numbers?.filter(R.isNonNullish) || [0]);\n}\n\nexport function takeBigger(...numbers: (number | undefined | null)[]): number {\n  return Math.max(...(numbers?.filter(R.isNonNullish) || [0])) || 0;\n}\n\nexport function ensureRange(value: number, options: { min?: number; max?: number }): number {\n  return Math.max(options.min ?? -Infinity, Math.min(value, options.max ?? Infinity));\n}\n"]}
+{"version":3,"sources":["../../../src/internals/helpers/number.ts"],"names":["safeSum","numbers","R","sum","filter","isNonNullish","takeBigger","Math","max","ensureRange","value","options","min","Infinity"],"mappings":";;;;AAOO,SAASA,WAAWC,OAAAA,EAAsC;AAC/D,EAAA,OAAOC,EAAEC,GAAAA,CAAIF,OAAAA,EAASG,MAAAA,CAAOF,CAAAA,CAAEG,YAAY,CAAA,IAAK;AAAC,IAAA;AAAE,GAAA,CAAA;AACrD;AAFgBL,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAIT,SAASM,cAAcL,OAAAA,EAAsC;AAClE,EAAA,OAAOM,KAAKC,GAAAA,CAAG,GAAKP,SAASG,MAAAA,CAAOF,CAAAA,CAAEG,YAAY,CAAA,IAAK;AAAC,IAAA;GAAE,CAAA,IAAM,CAAA;AAClE;AAFgBC,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAIT,SAASG,WAAAA,CAAYC,OAAeC,OAAAA,EAAuC;AAChF,EAAA,OAAOJ,IAAAA,CAAKC,GAAAA,CAAIG,OAAAA,CAAQC,GAAAA,IAAO,CAAA,QAAA,EAAWL,IAAAA,CAAKK,GAAAA,CAAIF,KAAAA,EAAOC,OAAAA,CAAQH,GAAAA,IAAOK,QAAAA,CAAAA,CAAAA;AAC3E;AAFgBJ,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA","file":"number.js","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n * SPDX-License-Identifier: Apache-2.0\n */\n\nimport * as R from \"remeda\";\n\nexport function safeSum(...numbers: (number | undefined | null)[]): number {\n  return R.sum(numbers?.filter(R.isNonNullish) || [0]);\n}\n\nexport function takeBigger(...numbers: (number | undefined | null)[]): number {\n  return Math.max(...(numbers?.filter(R.isNonNullish) || [0])) || 0;\n}\n\nexport function ensureRange(value: number, options: { min?: number; max?: number }): number {\n  return Math.max(options.min ?? -Infinity, Math.min(value, options.max ?? Infinity));\n}\n"]}

package/dist/internals/helpers/object.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["object.ts"],"names":["assignFactory","target","source","Object","assign","a","b","omitEmptyValues","R","pickBy","isTruthy","omitUndefined","isDefined","hasProp","key","Boolean","prototype","hasOwnProperty","call","hasProps","keys","every","setProp","paths","value","entry","entries","idx","isPlainObject","isArray","TypeError","isLast","length","newValue","getPropStrict","path","getProp","defaultValue","undefined","deleteProps","forEach","updateObject","old","update","val","existing","FrameworkError","context","customMerge","results","processors","finalResult","next","oldValue","takeFirstBy","mapObj","obj","fn","updated","pair"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAuBO,SAASA,cAAqEC,MAAS,EAAA;AAC5F,EAAA,OAAO,CAACC,MAAAA,KAAAA;AACNC,IAAOC,MAAAA,CAAAA,MAAAA,CAAOH,QAAQC,MAAAA,CAAAA;AACxB,GAAA;AACF;AAJgBF,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAMHI,MAAAA,MAAAA,2BACXC,CACAC,EAAAA,CAAAA,KACGN,cAAcK,CAAAA,CAAAA,CAAGC,CAAAA,CAHA,EAAA,QAAA;AAIf,MAAMC,eAAkBC,GAAAA,YAAAA,CAAEC,MAAOD,CAAAA,YAAAA,CAAEE,QAAQ;AAC3C,MAAMC,aAAgBH,GAAAA,YAAAA,CAAEC,MAAOD,CAAAA,YAAAA,CAAEI,SAAS;AAE1C,SAASC,OAAAA,CAAWZ,QAAuBa,GAAY,EAAA;AAC5D,EAAOC,OAAAA,OAAAA,CAAQd,MAAAA,CAAWE,IAAAA,MAAAA,CAAOa,UAAUC,cAAeC,CAAAA,IAAAA,CAAKjB,QAAQa,GAAAA,CAAAA;AACzE;AAFgBD,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAIT,SAASM,SAAYC,IAAiB,EAAA;AAC3C,EAAO,OAAA,CAACnB,WAA0BmB,IAAKC,CAAAA,KAAAA,CAAM,CAACP,GAAQD,KAAAA,OAAAA,CAAQZ,MAAQa,EAAAA,GAAAA,CAAAA,CAAAA;AACxE;AAFgBK,MAAAA,CAAAA,QAAAA,EAAAA,UAAAA,CAAAA;AAIT,SAASG,OAAAA,CAAQrB,MAAiBsB,EAAAA,KAAAA,EAA+BC,KAAc,EAAA;AACpF,EAAWC,KAAAA,MAAAA,KAAAA,IAASF,KAAMG,CAAAA,OAAAA,EAAW,EAAA;AACnC,IAAM,MAAA,CAACC,GAAKb,EAAAA,GAAAA,CAAOW,GAAAA,KAAAA;AACnB,IAAI,IAAA,CAACjB,aAAEoB,aAAc3B,CAAAA,MAAAA,KAAW,CAACO,YAAAA,CAAEqB,OAAQ5B,CAAAA,MAAAA,CAAS,EAAA;AAClD,MAAM,MAAA,IAAI6B,UAAU,8CAAA,CAAA;AACtB;AAEA,IAAMC,MAAAA,MAAAA,GAASJ,GAAQJ,KAAAA,KAAAA,CAAMS,MAAS,GAAA,CAAA;AACtC,IAAA,MAAMC,WAAWF,MAASP,GAAAA,KAAAA,GAASvB,MAAOa,CAAAA,GAAAA,KAAQ,EAAC;AACnDX,IAAAA,MAAAA,CAAOC,OAAOH,MAAQ,EAAA;AAAE,MAAA,CAACa,GAAAA,GAAMmB;KAAS,CAAA;AACxChC,IAAAA,MAAAA,GAASA,OAAOa,GAAAA,CAAAA;AAClB;AACF;AAZgBQ,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAcT,SAASY,aAAAA,CAAcjC,QAA8BkC,IAAY,EAAA;AACtE,EAAA,IAAI,CAAClC,MAAAA,IAAU,EAAEkC,IAAAA,IAAQlC,MAAS,CAAA,EAAA;AAChC,IAAA,MAAM,IAAI6B,SAAAA,CAAU,CAAgCK,6BAAAA,EAAAA,IAAAA,CAAO,CAAA,CAAA,CAAA;AAC7D;AACA,EAAA,OAAOlC,OAAOkC,IAAAA,CAAAA;AAChB;AALgBD,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAOT,SAASE,OACdnC,CAAAA,MAAAA,EACAsB,KACAc,EAAAA,YAAAA,GAAoBC,MAAS,EAAA;AAE7B,EAAA,IAAId,KAAavB,GAAAA,MAAAA;AACjB,EAAA,IAAI,CAACuB,KAAO,EAAA;AACV,IAAOc,OAAAA,MAAAA;AACT;AAEA,EAAA,KAAA,MAAWxB,OAAOS,KAAO,EAAA;AACvB,IAAA,IAAI,CAACV,OAAAA,CAAQW,KAAOV,EAAAA,GAAAA,CAAM,EAAA;AACxB,MAAOuB,OAAAA,YAAAA;AACT;AACAb,IAAAA,KAAAA,GAAQA,MAAMV,GAAAA,CAAAA;AAChB;AACA,EAAOU,OAAAA,KAAAA;AACT;AAjBgBY,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAmBT,SAASG,WAAAA,CAAkCtC,QAAWmB,IAAkB,EAAA;AAC7EA,EAAKoB,IAAAA,CAAAA,OAAAA,CAAQ,CAAC1B,GAAAA,KAAAA;AAEZ,IAAA,OAAOb,OAAOa,GAAAA,CAAAA;GAChB,CAAA;AACF;AALgByB,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAOT,SAASE,YAAAA,CACdC,KACAC,MAAS,EAAA;AAET,EAAA,KAAA,MAAW,CAAC7B,GAAK8B,EAAAA,GAAAA,KAAQzC,MAAOuB,CAAAA,OAAAA,CAAQiB,MAAAA,CAAS,EAAA;AAC/C,IAAME,MAAAA,QAAAA,GAAWH,IAAI5B,GAAAA,CAAAA;AACrB,IAAI+B,IAAAA,QAAAA,KAAaP,MAAaO,IAAAA,QAAAA,KAAa,IAAM,EAAA;AAC/C,MAAA,MAAM,IAAIC,yBACR,CAAA,CAAA,2BAAA,EAA8BhC,GAAAA,CAAAA,gCAAAA,CAAAA,EAC9B,EACA,EAAA;QACEiC,OAAS,EAAA;AACPF,UAAAA,QAAAA;UACAF,MAAQC,EAAAA;AACV;OACF,CAAA;AAEJ;AACAF,IAAAA,GAAAA,CAAI5B,GAAAA,CAAkB8B,GAAAA,GAAAA;AACxB;AACF;AApBgBH,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAsBT,SAASO,WAAAA,CACdC,SACAC,UAEC,EAAA;AAED,EAAID,IAAAA,OAAAA,CAAQjB,WAAW,CAAG,EAAA;AACxB,IAAM,MAAA,IAAIF,UAAU,yCAAA,CAAA;AACtB;AAEA,EAAA,MAAMqB,cAAc,EAAC;AACrB,EAAA,KAAA,MAAWC,QAAQH,OAAS,EAAA;AAC1B,IAAA,KAAA,MAAW,CAACnC,GAAKU,EAAAA,KAAAA,KAAUhB,YAAEkB,CAAAA,OAAAA,CAAQ0B,IAAAA,CAAO,EAAA;AAC1C,MAAMC,MAAAA,QAAAA,GAAWF,YAAYrC,GAAAA,CAAAA;AAE7BqC,MAAYrC,WAAAA,CAAAA,GAAAA,CAAQoC,GAAAA,CAAAA,UAAAA,CAAWpC,GAAAA,CAAAA,IAAQN,aAAE8C,WAAY,CAAA,CAAA,CAAI9B,EAAAA,KAAAA,EAAO6B,QAAAA,CAAAA;AAClE;AACF;AACA,EAAOF,OAAAA,WAAAA;AACT;AAnBgBH,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAqBT,SAASO,OAAyBC,GAAM,EAAA;AAC7C,EAAA,OAAO,SACLC,EAA8B,EAAA;AAE9B,IAAA,MAAMC,UAAU,EAAC;AACjB,IAAA,KAAA,MAAWC,IAAQxD,IAAAA,MAAAA,CAAOuB,OAAQ8B,CAAAA,GAAAA,CAAM,EAAA;AACtC,MAAM,MAAA,CAAC1C,GAAKU,EAAAA,KAAAA,CAASmC,GAAAA,IAAAA;AACrBD,MAAAA,OAAAA,CAAQ5C,GAAAA,CAAAA,GAAO2C,EAAG3C,CAAAA,GAAAA,EAAKU,KAAAA,CAAAA;AACzB;AACA,IAAOkC,OAAAA,OAAAA;AACT,GAAA;AACF;AAXgBH,MAAAA,CAAAA,MAAAA,EAAAA,QAAAA,CAAAA","file":"object.cjs","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport * as R from \"remeda\";\nimport { FrameworkError } from \"@/errors.js\";\n\nexport type Override<T, T2 extends Partial<T>> = {\n  [K in keyof T2]: K extends keyof T ? T2[K] : never;\n};\n\nexport function assignFactory<T extends NonNullable<unknown>, T2 extends Partial<T>>(target: T) {\n  return (source: NonNullable<Override<T, T2>>) => {\n    Object.assign(target, source);\n  };\n}\n\nexport const assign = <T extends NonNullable<unknown>, T2 extends Partial<T>>(\n  a: T,\n  b: NonNullable<Override<T, T2>>,\n) => assignFactory(a)(b);\nexport const omitEmptyValues = R.pickBy(R.isTruthy);\nexport const omitUndefined = R.pickBy(R.isDefined);\n\nexport function hasProp<T>(target: T | undefined, key: keyof T): key is keyof T {\n  return Boolean(target) && Object.prototype.hasOwnProperty.call(target, key);\n}\n\nexport function hasProps<T>(keys: (keyof T)[]) {\n  return (target: T | undefined) => keys.every((key) => hasProp(target, key));\n}\n\nexport function setProp(target: unknown, paths: readonly (keyof any)[], value: unknown) {\n  for (const entry of paths.entries()) {\n    const [idx, key] = entry as [number, keyof object];\n    if (!R.isPlainObject(target) && !R.isArray(target)) {\n      throw new TypeError(\"Only plain objects and arrays are supported!\");\n    }\n\n    const isLast = idx === paths.length - 1;\n    const newValue = isLast ? value : (target[key] ?? {});\n    Object.assign(target, { [key]: newValue });\n    target = target[key];\n  }\n}\n\nexport function getPropStrict(target: NonNullable<unknown>, path: string): any {\n  if (!target || !(path in target)) {\n    throw new TypeError(`Target does not contain key \"${path}\"`);\n  }\n  return target[path as keyof typeof target];\n}\n\nexport function getProp(\n  target: unknown,\n  paths: readonly (keyof any)[],\n  defaultValue: any = undefined,\n) {\n  let value: any = target;\n  if (!value) {\n    return undefined;\n  }\n\n  for (const key of paths) {\n    if (!hasProp(value, key)) {\n      return defaultValue;\n    }\n    value = value[key];\n  }\n  return value;\n}\n\nexport function deleteProps<T, K extends keyof T>(target: T, keys: readonly K[]) {\n  keys.forEach((key) => {\n    // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n    delete target[key];\n  });\n}\n\nexport function updateObject<T extends object, L extends object>(\n  old: T,\n  update: L,\n): asserts old is T & L {\n  for (const [key, val] of Object.entries(update)) {\n    const existing = old[key as keyof T];\n    if (existing !== undefined && existing !== null) {\n      throw new FrameworkError(\n        `Cannot update object. Key '${key}' already exists and is defined.`,\n        [],\n        {\n          context: {\n            existing,\n            update: val,\n          },\n        },\n      );\n    }\n    old[key as keyof T] = val;\n  }\n}\n\nexport function customMerge<T extends NonNullable<unknown>>(\n  results: T[],\n  processors: {\n    [K in keyof T]: (value: T[K], oldValue: T[K]) => T[K];\n  },\n) {\n  if (results.length === 0) {\n    throw new TypeError(\"Cannot merge content of an empty array!\");\n  }\n\n  const finalResult = {} as T;\n  for (const next of results) {\n    for (const [key, value] of R.entries(next)) {\n      const oldValue = finalResult[key as keyof T];\n      // @ts-expect-error weak typing due to  generated types\n      finalResult[key] = (processors[key] ?? R.takeFirstBy(1))(value, oldValue);\n    }\n  }\n  return finalResult;\n}\n\nexport function mapObj<T extends object>(obj: T) {\n  return function <K extends keyof T, R = T[K]>(\n    fn: (key: K, value: T[K]) => R,\n  ): Record<keyof T, R> {\n    const updated = {} as Record<keyof T, R>;\n    for (const pair of Object.entries(obj)) {\n      const [key, value] = pair as [K, T[K]];\n      updated[key] = fn(key, value);\n    }\n    return updated;\n  };\n}\n"]}
+{"version":3,"sources":["../../../src/internals/helpers/object.ts"],"names":["assignFactory","target","source","Object","assign","a","b","omitEmptyValues","R","pickBy","isTruthy","omitUndefined","isDefined","hasProp","key","Boolean","prototype","hasOwnProperty","call","hasProps","keys","every","setProp","paths","value","entry","entries","idx","isPlainObject","isArray","TypeError","isLast","length","newValue","getPropStrict","path","getProp","defaultValue","undefined","deleteProps","forEach","updateObject","old","update","val","existing","FrameworkError","context","customMerge","results","processors","finalResult","next","oldValue","takeFirstBy","mapObj","obj","fn","updated","pair"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAYO,SAASA,cAAqEC,MAAAA,EAAS;AAC5F,EAAA,OAAO,CAACC,MAAAA,KAAAA;AACNC,IAAAA,MAAAA,CAAOC,MAAAA,CAAOH,QAAQC,MAAAA,CAAAA;AACxB,GAAA;AACF;AAJgBF,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAMT,MAAMI,MAAAA,2BACXC,CAAAA,EACAC,CAAAA,KACGN,cAAcK,CAAAA,CAAAA,CAAGC,CAAAA,CAAAA,EAHA,QAAA;AAIf,MAAMC,eAAAA,GAAkBC,YAAAA,CAAEC,MAAAA,CAAOD,YAAAA,CAAEE,QAAQ;AAC3C,MAAMC,aAAAA,GAAgBH,YAAAA,CAAEC,MAAAA,CAAOD,YAAAA,CAAEI,SAAS;AAE1C,SAASC,OAAAA,CAAWZ,QAAuBa,GAAAA,EAAY;AAC5D,EAAA,OAAOC,OAAAA,CAAQd,MAAAA,CAAAA,IAAWE,MAAAA,CAAOa,UAAUC,cAAAA,CAAeC,IAAAA,CAAKjB,QAAQa,GAAAA,CAAAA;AACzE;AAFgBD,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAIT,SAASM,SAAYC,IAAAA,EAAiB;AAC3C,EAAA,OAAO,CAACnB,WAA0BmB,IAAAA,CAAKC,KAAAA,CAAM,CAACP,GAAAA,KAAQD,OAAAA,CAAQZ,MAAAA,EAAQa,GAAAA,CAAAA,CAAAA;AACxE;AAFgBK,MAAAA,CAAAA,QAAAA,EAAAA,UAAAA,CAAAA;AAIT,SAASG,OAAAA,CAAQrB,MAAAA,EAAiBsB,KAAAA,EAA+BC,KAAAA,EAAc;AACpF,EAAA,KAAA,MAAWC,KAAAA,IAASF,KAAAA,CAAMG,OAAAA,EAAO,EAAI;AACnC,IAAA,MAAM,CAACC,GAAAA,EAAKb,GAAAA,CAAAA,GAAOW,KAAAA;AACnB,IAAA,IAAI,CAACjB,aAAEoB,aAAAA,CAAc3B,MAAAA,KAAW,CAACO,YAAAA,CAAEqB,OAAAA,CAAQ5B,MAAAA,CAAAA,EAAS;AAClD,MAAA,MAAM,IAAI6B,UAAU,8CAAA,CAAA;AACtB;AAEA,IAAA,MAAMC,MAAAA,GAASJ,GAAAA,KAAQJ,KAAAA,CAAMS,MAAAA,GAAS,CAAA;AACtC,IAAA,MAAMC,WAAWF,MAAAA,GAASP,KAAAA,GAASvB,MAAAA,CAAOa,GAAAA,KAAQ,EAAC;AACnDX,IAAAA,MAAAA,CAAOC,OAAOH,MAAAA,EAAQ;AAAE,MAAA,CAACa,GAAAA,GAAMmB;KAAS,CAAA;AACxChC,IAAAA,MAAAA,GAASA,OAAOa,GAAAA,CAAAA;AAClB;AACF;AAZgBQ,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAcT,SAASY,aAAAA,CAAcjC,QAA8BkC,IAAAA,EAAY;AACtE,EAAA,IAAI,CAAClC,MAAAA,IAAU,EAAEkC,IAAAA,IAAQlC,MAAAA,CAAAA,EAAS;AAChC,IAAA,MAAM,IAAI6B,SAAAA,CAAU,CAAA,6BAAA,EAAgCK,IAAAA,CAAAA,CAAAA,CAAO,CAAA;AAC7D;AACA,EAAA,OAAOlC,OAAOkC,IAAAA,CAAAA;AAChB;AALgBD,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAOT,SAASE,OAAAA,CACdnC,MAAAA,EACAsB,KAAAA,EACAc,YAAAA,GAAoBC,MAAAA,EAAS;AAE7B,EAAA,IAAId,KAAAA,GAAavB,MAAAA;AACjB,EAAA,IAAI,CAACuB,KAAAA,EAAO;AACV,IAAA,OAAOc,MAAAA;AACT;AAEA,EAAA,KAAA,MAAWxB,OAAOS,KAAAA,EAAO;AACvB,IAAA,IAAI,CAACV,OAAAA,CAAQW,KAAAA,EAAOV,GAAAA,CAAAA,EAAM;AACxB,MAAA,OAAOuB,YAAAA;AACT;AACAb,IAAAA,KAAAA,GAAQA,MAAMV,GAAAA,CAAAA;AAChB;AACA,EAAA,OAAOU,KAAAA;AACT;AAjBgBY,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAmBT,SAASG,WAAAA,CAAkCtC,QAAWmB,IAAAA,EAAkB;AAC7EA,EAAAA,IAAAA,CAAKoB,OAAAA,CAAQ,CAAC1B,GAAAA,KAAAA;AAEZ,IAAA,OAAOb,OAAOa,GAAAA,CAAAA;GAChB,CAAA;AACF;AALgByB,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAOT,SAASE,YAAAA,CACdC,KACAC,MAAAA,EAAS;AAET,EAAA,KAAA,MAAW,CAAC7B,GAAAA,EAAK8B,GAAAA,KAAQzC,MAAAA,CAAOuB,OAAAA,CAAQiB,MAAAA,CAAAA,EAAS;AAC/C,IAAA,MAAME,QAAAA,GAAWH,IAAI5B,GAAAA,CAAAA;AACrB,IAAA,IAAI+B,QAAAA,KAAaP,MAAAA,IAAaO,QAAAA,KAAa,IAAA,EAAM;AAC/C,MAAA,MAAM,IAAIC,yBAAAA,CACR,CAAA,2BAAA,EAA8BhC,GAAAA,CAAAA,gCAAAA,CAAAA,EAC9B,EAAA,EACA;QACEiC,OAAAA,EAAS;AACPF,UAAAA,QAAAA;UACAF,MAAAA,EAAQC;AACV;OACF,CAAA;AAEJ;AACAF,IAAAA,GAAAA,CAAI5B,GAAAA,CAAAA,GAAkB8B,GAAAA;AACxB;AACF;AApBgBH,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAsBT,SAASO,WAAAA,CACdC,SACAC,UAAAA,EAEC;AAED,EAAA,IAAID,OAAAA,CAAQjB,WAAW,CAAA,EAAG;AACxB,IAAA,MAAM,IAAIF,UAAU,yCAAA,CAAA;AACtB;AAEA,EAAA,MAAMqB,cAAc,EAAC;AACrB,EAAA,KAAA,MAAWC,QAAQH,OAAAA,EAAS;AAC1B,IAAA,KAAA,MAAW,CAACnC,GAAAA,EAAKU,KAAAA,KAAUhB,YAAAA,CAAEkB,OAAAA,CAAQ0B,IAAAA,CAAAA,EAAO;AAC1C,MAAA,MAAMC,QAAAA,GAAWF,YAAYrC,GAAAA,CAAAA;AAE7BqC,MAAAA,WAAAA,CAAYrC,GAAAA,CAAAA,GAAAA,CAAQoC,UAAAA,CAAWpC,GAAAA,CAAAA,IAAQN,aAAE8C,WAAAA,CAAY,CAAA,CAAA,EAAI9B,KAAAA,EAAO6B,QAAAA,CAAAA;AAClE;AACF;AACA,EAAA,OAAOF,WAAAA;AACT;AAnBgBH,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAqBT,SAASO,OAAyBC,GAAAA,EAAM;AAC7C,EAAA,OAAO,SACLC,EAAAA,EAA8B;AAE9B,IAAA,MAAMC,UAAU,EAAC;AACjB,IAAA,KAAA,MAAWC,IAAAA,IAAQxD,MAAAA,CAAOuB,OAAAA,CAAQ8B,GAAAA,CAAAA,EAAM;AACtC,MAAA,MAAM,CAAC1C,GAAAA,EAAKU,KAAAA,CAAAA,GAASmC,IAAAA;AACrBD,MAAAA,OAAAA,CAAQ5C,GAAAA,CAAAA,GAAO2C,EAAAA,CAAG3C,GAAAA,EAAKU,KAAAA,CAAAA;AACzB;AACA,IAAA,OAAOkC,OAAAA;AACT,GAAA;AACF;AAXgBH,MAAAA,CAAAA,MAAAA,EAAAA,QAAAA,CAAAA","file":"object.cjs","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n * SPDX-License-Identifier: Apache-2.0\n */\n\nimport * as R from \"remeda\";\nimport { FrameworkError } from \"@/errors.js\";\n\nexport type Override<T, T2 extends Partial<T>> = {\n  [K in keyof T2]: K extends keyof T ? T2[K] : never;\n};\n\nexport function assignFactory<T extends NonNullable<unknown>, T2 extends Partial<T>>(target: T) {\n  return (source: NonNullable<Override<T, T2>>) => {\n    Object.assign(target, source);\n  };\n}\n\nexport const assign = <T extends NonNullable<unknown>, T2 extends Partial<T>>(\n  a: T,\n  b: NonNullable<Override<T, T2>>,\n) => assignFactory(a)(b);\nexport const omitEmptyValues = R.pickBy(R.isTruthy);\nexport const omitUndefined = R.pickBy(R.isDefined);\n\nexport function hasProp<T>(target: T | undefined, key: keyof T): key is keyof T {\n  return Boolean(target) && Object.prototype.hasOwnProperty.call(target, key);\n}\n\nexport function hasProps<T>(keys: (keyof T)[]) {\n  return (target: T | undefined) => keys.every((key) => hasProp(target, key));\n}\n\nexport function setProp(target: unknown, paths: readonly (keyof any)[], value: unknown) {\n  for (const entry of paths.entries()) {\n    const [idx, key] = entry as [number, keyof object];\n    if (!R.isPlainObject(target) && !R.isArray(target)) {\n      throw new TypeError(\"Only plain objects and arrays are supported!\");\n    }\n\n    const isLast = idx === paths.length - 1;\n    const newValue = isLast ? value : (target[key] ?? {});\n    Object.assign(target, { [key]: newValue });\n    target = target[key];\n  }\n}\n\nexport function getPropStrict(target: NonNullable<unknown>, path: string): any {\n  if (!target || !(path in target)) {\n    throw new TypeError(`Target does not contain key \"${path}\"`);\n  }\n  return target[path as keyof typeof target];\n}\n\nexport function getProp(\n  target: unknown,\n  paths: readonly (keyof any)[],\n  defaultValue: any = undefined,\n) {\n  let value: any = target;\n  if (!value) {\n    return undefined;\n  }\n\n  for (const key of paths) {\n    if (!hasProp(value, key)) {\n      return defaultValue;\n    }\n    value = value[key];\n  }\n  return value;\n}\n\nexport function deleteProps<T, K extends keyof T>(target: T, keys: readonly K[]) {\n  keys.forEach((key) => {\n    // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n    delete target[key];\n  });\n}\n\nexport function updateObject<T extends object, L extends object>(\n  old: T,\n  update: L,\n): asserts old is T & L {\n  for (const [key, val] of Object.entries(update)) {\n    const existing = old[key as keyof T];\n    if (existing !== undefined && existing !== null) {\n      throw new FrameworkError(\n        `Cannot update object. Key '${key}' already exists and is defined.`,\n        [],\n        {\n          context: {\n            existing,\n            update: val,\n          },\n        },\n      );\n    }\n    old[key as keyof T] = val;\n  }\n}\n\nexport function customMerge<T extends NonNullable<unknown>>(\n  results: T[],\n  processors: {\n    [K in keyof T]: (value: T[K], oldValue: T[K]) => T[K];\n  },\n) {\n  if (results.length === 0) {\n    throw new TypeError(\"Cannot merge content of an empty array!\");\n  }\n\n  const finalResult = {} as T;\n  for (const next of results) {\n    for (const [key, value] of R.entries(next)) {\n      const oldValue = finalResult[key as keyof T];\n      // @ts-expect-error weak typing due to  generated types\n      finalResult[key] = (processors[key] ?? R.takeFirstBy(1))(value, oldValue);\n    }\n  }\n  return finalResult;\n}\n\nexport function mapObj<T extends object>(obj: T) {\n  return function <K extends keyof T, R = T[K]>(\n    fn: (key: K, value: T[K]) => R,\n  ): Record<keyof T, R> {\n    const updated = {} as Record<keyof T, R>;\n    for (const pair of Object.entries(obj)) {\n      const [key, value] = pair as [K, T[K]];\n      updated[key] = fn(key, value);\n    }\n    return updated;\n  };\n}\n"]}

package/dist/internals/helpers/object.d.cts

@@ -1,17 +1,6 @@
 /**
  * Copyright 2025 © BeeAI a Series of LF Projects, LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
+ * SPDX-License-Identifier: Apache-2.0
  */
 type Override<T, T2 extends Partial<T>> = {
     [K in keyof T2]: K extends keyof T ? T2[K] : never;

package/dist/internals/helpers/object.d.ts

@@ -1,17 +1,6 @@
 /**
  * Copyright 2025 © BeeAI a Series of LF Projects, LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
+ * SPDX-License-Identifier: Apache-2.0
  */
 type Override<T, T2 extends Partial<T>> = {
     [K in keyof T2]: K extends keyof T ? T2[K] : never;

package/dist/internals/helpers/object.js.map

@@ -1 +1 @@
-{"version":3,"sources":["object.ts"],"names":["assignFactory","target","source","Object","assign","a","b","omitEmptyValues","R","pickBy","isTruthy","omitUndefined","isDefined","hasProp","key","Boolean","prototype","hasOwnProperty","call","hasProps","keys","every","setProp","paths","value","entry","entries","idx","isPlainObject","isArray","TypeError","isLast","length","newValue","getPropStrict","path","getProp","defaultValue","undefined","deleteProps","forEach","updateObject","old","update","val","existing","FrameworkError","context","customMerge","results","processors","finalResult","next","oldValue","takeFirstBy","mapObj","obj","fn","updated","pair"],"mappings":";;;;;AAuBO,SAASA,cAAqEC,MAAS,EAAA;AAC5F,EAAA,OAAO,CAACC,MAAAA,KAAAA;AACNC,IAAOC,MAAAA,CAAAA,MAAAA,CAAOH,QAAQC,MAAAA,CAAAA;AACxB,GAAA;AACF;AAJgBF,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAMHI,MAAAA,MAAAA,2BACXC,CACAC,EAAAA,CAAAA,KACGN,cAAcK,CAAAA,CAAAA,CAAGC,CAAAA,CAHA,EAAA,QAAA;AAIf,MAAMC,eAAkBC,GAAAA,CAAAA,CAAEC,MAAOD,CAAAA,CAAAA,CAAEE,QAAQ;AAC3C,MAAMC,aAAgBH,GAAAA,CAAAA,CAAEC,MAAOD,CAAAA,CAAAA,CAAEI,SAAS;AAE1C,SAASC,OAAAA,CAAWZ,QAAuBa,GAAY,EAAA;AAC5D,EAAOC,OAAAA,OAAAA,CAAQd,MAAAA,CAAWE,IAAAA,MAAAA,CAAOa,UAAUC,cAAeC,CAAAA,IAAAA,CAAKjB,QAAQa,GAAAA,CAAAA;AACzE;AAFgBD,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAIT,SAASM,SAAYC,IAAiB,EAAA;AAC3C,EAAO,OAAA,CAACnB,WAA0BmB,IAAKC,CAAAA,KAAAA,CAAM,CAACP,GAAQD,KAAAA,OAAAA,CAAQZ,MAAQa,EAAAA,GAAAA,CAAAA,CAAAA;AACxE;AAFgBK,MAAAA,CAAAA,QAAAA,EAAAA,UAAAA,CAAAA;AAIT,SAASG,OAAAA,CAAQrB,MAAiBsB,EAAAA,KAAAA,EAA+BC,KAAc,EAAA;AACpF,EAAWC,KAAAA,MAAAA,KAAAA,IAASF,KAAMG,CAAAA,OAAAA,EAAW,EAAA;AACnC,IAAM,MAAA,CAACC,GAAKb,EAAAA,GAAAA,CAAOW,GAAAA,KAAAA;AACnB,IAAI,IAAA,CAACjB,EAAEoB,aAAc3B,CAAAA,MAAAA,KAAW,CAACO,CAAAA,CAAEqB,OAAQ5B,CAAAA,MAAAA,CAAS,EAAA;AAClD,MAAM,MAAA,IAAI6B,UAAU,8CAAA,CAAA;AACtB;AAEA,IAAMC,MAAAA,MAAAA,GAASJ,GAAQJ,KAAAA,KAAAA,CAAMS,MAAS,GAAA,CAAA;AACtC,IAAA,MAAMC,WAAWF,MAASP,GAAAA,KAAAA,GAASvB,MAAOa,CAAAA,GAAAA,KAAQ,EAAC;AACnDX,IAAAA,MAAAA,CAAOC,OAAOH,MAAQ,EAAA;AAAE,MAAA,CAACa,GAAAA,GAAMmB;KAAS,CAAA;AACxChC,IAAAA,MAAAA,GAASA,OAAOa,GAAAA,CAAAA;AAClB;AACF;AAZgBQ,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAcT,SAASY,aAAAA,CAAcjC,QAA8BkC,IAAY,EAAA;AACtE,EAAA,IAAI,CAAClC,MAAAA,IAAU,EAAEkC,IAAAA,IAAQlC,MAAS,CAAA,EAAA;AAChC,IAAA,MAAM,IAAI6B,SAAAA,CAAU,CAAgCK,6BAAAA,EAAAA,IAAAA,CAAO,CAAA,CAAA,CAAA;AAC7D;AACA,EAAA,OAAOlC,OAAOkC,IAAAA,CAAAA;AAChB;AALgBD,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAOT,SAASE,OACdnC,CAAAA,MAAAA,EACAsB,KACAc,EAAAA,YAAAA,GAAoBC,MAAS,EAAA;AAE7B,EAAA,IAAId,KAAavB,GAAAA,MAAAA;AACjB,EAAA,IAAI,CAACuB,KAAO,EAAA;AACV,IAAOc,OAAAA,MAAAA;AACT;AAEA,EAAA,KAAA,MAAWxB,OAAOS,KAAO,EAAA;AACvB,IAAA,IAAI,CAACV,OAAAA,CAAQW,KAAOV,EAAAA,GAAAA,CAAM,EAAA;AACxB,MAAOuB,OAAAA,YAAAA;AACT;AACAb,IAAAA,KAAAA,GAAQA,MAAMV,GAAAA,CAAAA;AAChB;AACA,EAAOU,OAAAA,KAAAA;AACT;AAjBgBY,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAmBT,SAASG,WAAAA,CAAkCtC,QAAWmB,IAAkB,EAAA;AAC7EA,EAAKoB,IAAAA,CAAAA,OAAAA,CAAQ,CAAC1B,GAAAA,KAAAA;AAEZ,IAAA,OAAOb,OAAOa,GAAAA,CAAAA;GAChB,CAAA;AACF;AALgByB,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAOT,SAASE,YAAAA,CACdC,KACAC,MAAS,EAAA;AAET,EAAA,KAAA,MAAW,CAAC7B,GAAK8B,EAAAA,GAAAA,KAAQzC,MAAOuB,CAAAA,OAAAA,CAAQiB,MAAAA,CAAS,EAAA;AAC/C,IAAME,MAAAA,QAAAA,GAAWH,IAAI5B,GAAAA,CAAAA;AACrB,IAAI+B,IAAAA,QAAAA,KAAaP,MAAaO,IAAAA,QAAAA,KAAa,IAAM,EAAA;AAC/C,MAAA,MAAM,IAAIC,cACR,CAAA,CAAA,2BAAA,EAA8BhC,GAAAA,CAAAA,gCAAAA,CAAAA,EAC9B,EACA,EAAA;QACEiC,OAAS,EAAA;AACPF,UAAAA,QAAAA;UACAF,MAAQC,EAAAA;AACV;OACF,CAAA;AAEJ;AACAF,IAAAA,GAAAA,CAAI5B,GAAAA,CAAkB8B,GAAAA,GAAAA;AACxB;AACF;AApBgBH,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAsBT,SAASO,WAAAA,CACdC,SACAC,UAEC,EAAA;AAED,EAAID,IAAAA,OAAAA,CAAQjB,WAAW,CAAG,EAAA;AACxB,IAAM,MAAA,IAAIF,UAAU,yCAAA,CAAA;AACtB;AAEA,EAAA,MAAMqB,cAAc,EAAC;AACrB,EAAA,KAAA,MAAWC,QAAQH,OAAS,EAAA;AAC1B,IAAA,KAAA,MAAW,CAACnC,GAAKU,EAAAA,KAAAA,KAAUhB,CAAEkB,CAAAA,OAAAA,CAAQ0B,IAAAA,CAAO,EAAA;AAC1C,MAAMC,MAAAA,QAAAA,GAAWF,YAAYrC,GAAAA,CAAAA;AAE7BqC,MAAYrC,WAAAA,CAAAA,GAAAA,CAAQoC,GAAAA,CAAAA,UAAAA,CAAWpC,GAAAA,CAAAA,IAAQN,EAAE8C,WAAY,CAAA,CAAA,CAAI9B,EAAAA,KAAAA,EAAO6B,QAAAA,CAAAA;AAClE;AACF;AACA,EAAOF,OAAAA,WAAAA;AACT;AAnBgBH,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAqBT,SAASO,OAAyBC,GAAM,EAAA;AAC7C,EAAA,OAAO,SACLC,EAA8B,EAAA;AAE9B,IAAA,MAAMC,UAAU,EAAC;AACjB,IAAA,KAAA,MAAWC,IAAQxD,IAAAA,MAAAA,CAAOuB,OAAQ8B,CAAAA,GAAAA,CAAM,EAAA;AACtC,MAAM,MAAA,CAAC1C,GAAKU,EAAAA,KAAAA,CAASmC,GAAAA,IAAAA;AACrBD,MAAAA,OAAAA,CAAQ5C,GAAAA,CAAAA,GAAO2C,EAAG3C,CAAAA,GAAAA,EAAKU,KAAAA,CAAAA;AACzB;AACA,IAAOkC,OAAAA,OAAAA;AACT,GAAA;AACF;AAXgBH,MAAAA,CAAAA,MAAAA,EAAAA,QAAAA,CAAAA","file":"object.js","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport * as R from \"remeda\";\nimport { FrameworkError } from \"@/errors.js\";\n\nexport type Override<T, T2 extends Partial<T>> = {\n  [K in keyof T2]: K extends keyof T ? T2[K] : never;\n};\n\nexport function assignFactory<T extends NonNullable<unknown>, T2 extends Partial<T>>(target: T) {\n  return (source: NonNullable<Override<T, T2>>) => {\n    Object.assign(target, source);\n  };\n}\n\nexport const assign = <T extends NonNullable<unknown>, T2 extends Partial<T>>(\n  a: T,\n  b: NonNullable<Override<T, T2>>,\n) => assignFactory(a)(b);\nexport const omitEmptyValues = R.pickBy(R.isTruthy);\nexport const omitUndefined = R.pickBy(R.isDefined);\n\nexport function hasProp<T>(target: T | undefined, key: keyof T): key is keyof T {\n  return Boolean(target) && Object.prototype.hasOwnProperty.call(target, key);\n}\n\nexport function hasProps<T>(keys: (keyof T)[]) {\n  return (target: T | undefined) => keys.every((key) => hasProp(target, key));\n}\n\nexport function setProp(target: unknown, paths: readonly (keyof any)[], value: unknown) {\n  for (const entry of paths.entries()) {\n    const [idx, key] = entry as [number, keyof object];\n    if (!R.isPlainObject(target) && !R.isArray(target)) {\n      throw new TypeError(\"Only plain objects and arrays are supported!\");\n    }\n\n    const isLast = idx === paths.length - 1;\n    const newValue = isLast ? value : (target[key] ?? {});\n    Object.assign(target, { [key]: newValue });\n    target = target[key];\n  }\n}\n\nexport function getPropStrict(target: NonNullable<unknown>, path: string): any {\n  if (!target || !(path in target)) {\n    throw new TypeError(`Target does not contain key \"${path}\"`);\n  }\n  return target[path as keyof typeof target];\n}\n\nexport function getProp(\n  target: unknown,\n  paths: readonly (keyof any)[],\n  defaultValue: any = undefined,\n) {\n  let value: any = target;\n  if (!value) {\n    return undefined;\n  }\n\n  for (const key of paths) {\n    if (!hasProp(value, key)) {\n      return defaultValue;\n    }\n    value = value[key];\n  }\n  return value;\n}\n\nexport function deleteProps<T, K extends keyof T>(target: T, keys: readonly K[]) {\n  keys.forEach((key) => {\n    // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n    delete target[key];\n  });\n}\n\nexport function updateObject<T extends object, L extends object>(\n  old: T,\n  update: L,\n): asserts old is T & L {\n  for (const [key, val] of Object.entries(update)) {\n    const existing = old[key as keyof T];\n    if (existing !== undefined && existing !== null) {\n      throw new FrameworkError(\n        `Cannot update object. Key '${key}' already exists and is defined.`,\n        [],\n        {\n          context: {\n            existing,\n            update: val,\n          },\n        },\n      );\n    }\n    old[key as keyof T] = val;\n  }\n}\n\nexport function customMerge<T extends NonNullable<unknown>>(\n  results: T[],\n  processors: {\n    [K in keyof T]: (value: T[K], oldValue: T[K]) => T[K];\n  },\n) {\n  if (results.length === 0) {\n    throw new TypeError(\"Cannot merge content of an empty array!\");\n  }\n\n  const finalResult = {} as T;\n  for (const next of results) {\n    for (const [key, value] of R.entries(next)) {\n      const oldValue = finalResult[key as keyof T];\n      // @ts-expect-error weak typing due to  generated types\n      finalResult[key] = (processors[key] ?? R.takeFirstBy(1))(value, oldValue);\n    }\n  }\n  return finalResult;\n}\n\nexport function mapObj<T extends object>(obj: T) {\n  return function <K extends keyof T, R = T[K]>(\n    fn: (key: K, value: T[K]) => R,\n  ): Record<keyof T, R> {\n    const updated = {} as Record<keyof T, R>;\n    for (const pair of Object.entries(obj)) {\n      const [key, value] = pair as [K, T[K]];\n      updated[key] = fn(key, value);\n    }\n    return updated;\n  };\n}\n"]}
+{"version":3,"sources":["../../../src/internals/helpers/object.ts"],"names":["assignFactory","target","source","Object","assign","a","b","omitEmptyValues","R","pickBy","isTruthy","omitUndefined","isDefined","hasProp","key","Boolean","prototype","hasOwnProperty","call","hasProps","keys","every","setProp","paths","value","entry","entries","idx","isPlainObject","isArray","TypeError","isLast","length","newValue","getPropStrict","path","getProp","defaultValue","undefined","deleteProps","forEach","updateObject","old","update","val","existing","FrameworkError","context","customMerge","results","processors","finalResult","next","oldValue","takeFirstBy","mapObj","obj","fn","updated","pair"],"mappings":";;;;;AAYO,SAASA,cAAqEC,MAAAA,EAAS;AAC5F,EAAA,OAAO,CAACC,MAAAA,KAAAA;AACNC,IAAAA,MAAAA,CAAOC,MAAAA,CAAOH,QAAQC,MAAAA,CAAAA;AACxB,GAAA;AACF;AAJgBF,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAMT,MAAMI,MAAAA,2BACXC,CAAAA,EACAC,CAAAA,KACGN,cAAcK,CAAAA,CAAAA,CAAGC,CAAAA,CAAAA,EAHA,QAAA;AAIf,MAAMC,eAAAA,GAAkBC,CAAAA,CAAEC,MAAAA,CAAOD,CAAAA,CAAEE,QAAQ;AAC3C,MAAMC,aAAAA,GAAgBH,CAAAA,CAAEC,MAAAA,CAAOD,CAAAA,CAAEI,SAAS;AAE1C,SAASC,OAAAA,CAAWZ,QAAuBa,GAAAA,EAAY;AAC5D,EAAA,OAAOC,OAAAA,CAAQd,MAAAA,CAAAA,IAAWE,MAAAA,CAAOa,UAAUC,cAAAA,CAAeC,IAAAA,CAAKjB,QAAQa,GAAAA,CAAAA;AACzE;AAFgBD,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAIT,SAASM,SAAYC,IAAAA,EAAiB;AAC3C,EAAA,OAAO,CAACnB,WAA0BmB,IAAAA,CAAKC,KAAAA,CAAM,CAACP,GAAAA,KAAQD,OAAAA,CAAQZ,MAAAA,EAAQa,GAAAA,CAAAA,CAAAA;AACxE;AAFgBK,MAAAA,CAAAA,QAAAA,EAAAA,UAAAA,CAAAA;AAIT,SAASG,OAAAA,CAAQrB,MAAAA,EAAiBsB,KAAAA,EAA+BC,KAAAA,EAAc;AACpF,EAAA,KAAA,MAAWC,KAAAA,IAASF,KAAAA,CAAMG,OAAAA,EAAO,EAAI;AACnC,IAAA,MAAM,CAACC,GAAAA,EAAKb,GAAAA,CAAAA,GAAOW,KAAAA;AACnB,IAAA,IAAI,CAACjB,EAAEoB,aAAAA,CAAc3B,MAAAA,KAAW,CAACO,CAAAA,CAAEqB,OAAAA,CAAQ5B,MAAAA,CAAAA,EAAS;AAClD,MAAA,MAAM,IAAI6B,UAAU,8CAAA,CAAA;AACtB;AAEA,IAAA,MAAMC,MAAAA,GAASJ,GAAAA,KAAQJ,KAAAA,CAAMS,MAAAA,GAAS,CAAA;AACtC,IAAA,MAAMC,WAAWF,MAAAA,GAASP,KAAAA,GAASvB,MAAAA,CAAOa,GAAAA,KAAQ,EAAC;AACnDX,IAAAA,MAAAA,CAAOC,OAAOH,MAAAA,EAAQ;AAAE,MAAA,CAACa,GAAAA,GAAMmB;KAAS,CAAA;AACxChC,IAAAA,MAAAA,GAASA,OAAOa,GAAAA,CAAAA;AAClB;AACF;AAZgBQ,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAcT,SAASY,aAAAA,CAAcjC,QAA8BkC,IAAAA,EAAY;AACtE,EAAA,IAAI,CAAClC,MAAAA,IAAU,EAAEkC,IAAAA,IAAQlC,MAAAA,CAAAA,EAAS;AAChC,IAAA,MAAM,IAAI6B,SAAAA,CAAU,CAAA,6BAAA,EAAgCK,IAAAA,CAAAA,CAAAA,CAAO,CAAA;AAC7D;AACA,EAAA,OAAOlC,OAAOkC,IAAAA,CAAAA;AAChB;AALgBD,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAOT,SAASE,OAAAA,CACdnC,MAAAA,EACAsB,KAAAA,EACAc,YAAAA,GAAoBC,MAAAA,EAAS;AAE7B,EAAA,IAAId,KAAAA,GAAavB,MAAAA;AACjB,EAAA,IAAI,CAACuB,KAAAA,EAAO;AACV,IAAA,OAAOc,MAAAA;AACT;AAEA,EAAA,KAAA,MAAWxB,OAAOS,KAAAA,EAAO;AACvB,IAAA,IAAI,CAACV,OAAAA,CAAQW,KAAAA,EAAOV,GAAAA,CAAAA,EAAM;AACxB,MAAA,OAAOuB,YAAAA;AACT;AACAb,IAAAA,KAAAA,GAAQA,MAAMV,GAAAA,CAAAA;AAChB;AACA,EAAA,OAAOU,KAAAA;AACT;AAjBgBY,MAAAA,CAAAA,OAAAA,EAAAA,SAAAA,CAAAA;AAmBT,SAASG,WAAAA,CAAkCtC,QAAWmB,IAAAA,EAAkB;AAC7EA,EAAAA,IAAAA,CAAKoB,OAAAA,CAAQ,CAAC1B,GAAAA,KAAAA;AAEZ,IAAA,OAAOb,OAAOa,GAAAA,CAAAA;GAChB,CAAA;AACF;AALgByB,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAOT,SAASE,YAAAA,CACdC,KACAC,MAAAA,EAAS;AAET,EAAA,KAAA,MAAW,CAAC7B,GAAAA,EAAK8B,GAAAA,KAAQzC,MAAAA,CAAOuB,OAAAA,CAAQiB,MAAAA,CAAAA,EAAS;AAC/C,IAAA,MAAME,QAAAA,GAAWH,IAAI5B,GAAAA,CAAAA;AACrB,IAAA,IAAI+B,QAAAA,KAAaP,MAAAA,IAAaO,QAAAA,KAAa,IAAA,EAAM;AAC/C,MAAA,MAAM,IAAIC,cAAAA,CACR,CAAA,2BAAA,EAA8BhC,GAAAA,CAAAA,gCAAAA,CAAAA,EAC9B,EAAA,EACA;QACEiC,OAAAA,EAAS;AACPF,UAAAA,QAAAA;UACAF,MAAAA,EAAQC;AACV;OACF,CAAA;AAEJ;AACAF,IAAAA,GAAAA,CAAI5B,GAAAA,CAAAA,GAAkB8B,GAAAA;AACxB;AACF;AApBgBH,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAsBT,SAASO,WAAAA,CACdC,SACAC,UAAAA,EAEC;AAED,EAAA,IAAID,OAAAA,CAAQjB,WAAW,CAAA,EAAG;AACxB,IAAA,MAAM,IAAIF,UAAU,yCAAA,CAAA;AACtB;AAEA,EAAA,MAAMqB,cAAc,EAAC;AACrB,EAAA,KAAA,MAAWC,QAAQH,OAAAA,EAAS;AAC1B,IAAA,KAAA,MAAW,CAACnC,GAAAA,EAAKU,KAAAA,KAAUhB,CAAAA,CAAEkB,OAAAA,CAAQ0B,IAAAA,CAAAA,EAAO;AAC1C,MAAA,MAAMC,QAAAA,GAAWF,YAAYrC,GAAAA,CAAAA;AAE7BqC,MAAAA,WAAAA,CAAYrC,GAAAA,CAAAA,GAAAA,CAAQoC,UAAAA,CAAWpC,GAAAA,CAAAA,IAAQN,EAAE8C,WAAAA,CAAY,CAAA,CAAA,EAAI9B,KAAAA,EAAO6B,QAAAA,CAAAA;AAClE;AACF;AACA,EAAA,OAAOF,WAAAA;AACT;AAnBgBH,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAqBT,SAASO,OAAyBC,GAAAA,EAAM;AAC7C,EAAA,OAAO,SACLC,EAAAA,EAA8B;AAE9B,IAAA,MAAMC,UAAU,EAAC;AACjB,IAAA,KAAA,MAAWC,IAAAA,IAAQxD,MAAAA,CAAOuB,OAAAA,CAAQ8B,GAAAA,CAAAA,EAAM;AACtC,MAAA,MAAM,CAAC1C,GAAAA,EAAKU,KAAAA,CAAAA,GAASmC,IAAAA;AACrBD,MAAAA,OAAAA,CAAQ5C,GAAAA,CAAAA,GAAO2C,EAAAA,CAAG3C,GAAAA,EAAKU,KAAAA,CAAAA;AACzB;AACA,IAAA,OAAOkC,OAAAA;AACT,GAAA;AACF;AAXgBH,MAAAA,CAAAA,MAAAA,EAAAA,QAAAA,CAAAA","file":"object.js","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n * SPDX-License-Identifier: Apache-2.0\n */\n\nimport * as R from \"remeda\";\nimport { FrameworkError } from \"@/errors.js\";\n\nexport type Override<T, T2 extends Partial<T>> = {\n  [K in keyof T2]: K extends keyof T ? T2[K] : never;\n};\n\nexport function assignFactory<T extends NonNullable<unknown>, T2 extends Partial<T>>(target: T) {\n  return (source: NonNullable<Override<T, T2>>) => {\n    Object.assign(target, source);\n  };\n}\n\nexport const assign = <T extends NonNullable<unknown>, T2 extends Partial<T>>(\n  a: T,\n  b: NonNullable<Override<T, T2>>,\n) => assignFactory(a)(b);\nexport const omitEmptyValues = R.pickBy(R.isTruthy);\nexport const omitUndefined = R.pickBy(R.isDefined);\n\nexport function hasProp<T>(target: T | undefined, key: keyof T): key is keyof T {\n  return Boolean(target) && Object.prototype.hasOwnProperty.call(target, key);\n}\n\nexport function hasProps<T>(keys: (keyof T)[]) {\n  return (target: T | undefined) => keys.every((key) => hasProp(target, key));\n}\n\nexport function setProp(target: unknown, paths: readonly (keyof any)[], value: unknown) {\n  for (const entry of paths.entries()) {\n    const [idx, key] = entry as [number, keyof object];\n    if (!R.isPlainObject(target) && !R.isArray(target)) {\n      throw new TypeError(\"Only plain objects and arrays are supported!\");\n    }\n\n    const isLast = idx === paths.length - 1;\n    const newValue = isLast ? value : (target[key] ?? {});\n    Object.assign(target, { [key]: newValue });\n    target = target[key];\n  }\n}\n\nexport function getPropStrict(target: NonNullable<unknown>, path: string): any {\n  if (!target || !(path in target)) {\n    throw new TypeError(`Target does not contain key \"${path}\"`);\n  }\n  return target[path as keyof typeof target];\n}\n\nexport function getProp(\n  target: unknown,\n  paths: readonly (keyof any)[],\n  defaultValue: any = undefined,\n) {\n  let value: any = target;\n  if (!value) {\n    return undefined;\n  }\n\n  for (const key of paths) {\n    if (!hasProp(value, key)) {\n      return defaultValue;\n    }\n    value = value[key];\n  }\n  return value;\n}\n\nexport function deleteProps<T, K extends keyof T>(target: T, keys: readonly K[]) {\n  keys.forEach((key) => {\n    // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n    delete target[key];\n  });\n}\n\nexport function updateObject<T extends object, L extends object>(\n  old: T,\n  update: L,\n): asserts old is T & L {\n  for (const [key, val] of Object.entries(update)) {\n    const existing = old[key as keyof T];\n    if (existing !== undefined && existing !== null) {\n      throw new FrameworkError(\n        `Cannot update object. Key '${key}' already exists and is defined.`,\n        [],\n        {\n          context: {\n            existing,\n            update: val,\n          },\n        },\n      );\n    }\n    old[key as keyof T] = val;\n  }\n}\n\nexport function customMerge<T extends NonNullable<unknown>>(\n  results: T[],\n  processors: {\n    [K in keyof T]: (value: T[K], oldValue: T[K]) => T[K];\n  },\n) {\n  if (results.length === 0) {\n    throw new TypeError(\"Cannot merge content of an empty array!\");\n  }\n\n  const finalResult = {} as T;\n  for (const next of results) {\n    for (const [key, value] of R.entries(next)) {\n      const oldValue = finalResult[key as keyof T];\n      // @ts-expect-error weak typing due to  generated types\n      finalResult[key] = (processors[key] ?? R.takeFirstBy(1))(value, oldValue);\n    }\n  }\n  return finalResult;\n}\n\nexport function mapObj<T extends object>(obj: T) {\n  return function <K extends keyof T, R = T[K]>(\n    fn: (key: K, value: T[K]) => R,\n  ): Record<keyof T, R> {\n    const updated = {} as Record<keyof T, R>;\n    for (const pair of Object.entries(obj)) {\n      const [key, value] = pair as [K, T[K]];\n      updated[key] = fn(key, value);\n    }\n    return updated;\n  };\n}\n"]}

package/dist/internals/helpers/paginate.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["paginate.ts"],"names":["paginate","input","acc","cursor","undefined","length","size","data","nextCursor","handler","limit","push"],"mappings":";;;;AAqBA,eAAsBA,SAAwBC,KAA0B,EAAA;AACtE,EAAA,MAAMC,MAAW,EAAA;AACjB,EAAA,IAAIC,MAAwBC,GAAAA,MAAAA;AAC5B,EAAOF,OAAAA,GAAAA,CAAIG,MAASJ,GAAAA,KAAAA,CAAMK,IAAM,EAAA;AAC9B,IAAA,MAAM,EAAEC,IAAMC,EAAAA,UAAAA,EAAe,GAAA,MAAMP,MAAMQ,OAAQ,CAAA;AAC/CN,MAAAA,MAAAA;MACAO,KAAOT,EAAAA,KAAAA,CAAMK,OAAOJ,GAAIG,CAAAA;KAC1B,CAAA;AACAH,IAAIS,GAAAA,CAAAA,IAAAA,CAAI,GAAIJ,IAAAA,CAAAA;AAEZ,IAAA,IAAIC,UAAeJ,KAAAA,MAAAA,IAAaG,IAAKF,CAAAA,MAAAA,KAAW,CAAG,EAAA;AACjD,MAAA;AACF;AACAF,IAASK,MAAAA,GAAAA,UAAAA;AACX;AAEA,EAAIN,IAAAA,GAAAA,CAAIG,MAASJ,GAAAA,KAAAA,CAAMK,IAAM,EAAA;AAC3BJ,IAAAA,GAAAA,CAAIG,SAASJ,KAAMK,CAAAA,IAAAA;AACrB;AAEA,EAAOJ,OAAAA,GAAAA;AACT;AArBsBF,MAAAA,CAAAA,QAAAA,EAAAA,UAAAA,CAAAA","file":"paginate.cjs","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport interface PaginateInput<T, C> {\n  size: number;\n  handler: (data: { cursor?: C; limit: number }) => Promise<{ data: T[]; nextCursor?: C }>;\n}\n\nexport async function paginate<T, C = number>(input: PaginateInput<T, C>): Promise<T[]> {\n  const acc: T[] = [];\n  let cursor: C | undefined = undefined;\n  while (acc.length < input.size) {\n    const { data, nextCursor } = await input.handler({\n      cursor,\n      limit: input.size - acc.length,\n    });\n    acc.push(...data);\n\n    if (nextCursor === undefined || data.length === 0) {\n      break;\n    }\n    cursor = nextCursor;\n  }\n\n  if (acc.length > input.size) {\n    acc.length = input.size;\n  }\n\n  return acc;\n}\n"]}
+{"version":3,"sources":["../../../src/internals/helpers/paginate.ts"],"names":["paginate","input","acc","cursor","undefined","length","size","data","nextCursor","handler","limit","push"],"mappings":";;;;AAUA,eAAsBA,SAAwBC,KAAAA,EAA0B;AACtE,EAAA,MAAMC,MAAW,EAAA;AACjB,EAAA,IAAIC,MAAAA,GAAwBC,MAAAA;AAC5B,EAAA,OAAOF,GAAAA,CAAIG,MAAAA,GAASJ,KAAAA,CAAMK,IAAAA,EAAM;AAC9B,IAAA,MAAM,EAAEC,IAAAA,EAAMC,UAAAA,EAAU,GAAK,MAAMP,MAAMQ,OAAAA,CAAQ;AAC/CN,MAAAA,MAAAA;MACAO,KAAAA,EAAOT,KAAAA,CAAMK,OAAOJ,GAAAA,CAAIG;KAC1B,CAAA;AACAH,IAAAA,GAAAA,CAAIS,IAAAA,CAAI,GAAIJ,IAAAA,CAAAA;AAEZ,IAAA,IAAIC,UAAAA,KAAeJ,MAAAA,IAAaG,IAAAA,CAAKF,MAAAA,KAAW,CAAA,EAAG;AACjD,MAAA;AACF;AACAF,IAAAA,MAAAA,GAASK,UAAAA;AACX;AAEA,EAAA,IAAIN,GAAAA,CAAIG,MAAAA,GAASJ,KAAAA,CAAMK,IAAAA,EAAM;AAC3BJ,IAAAA,GAAAA,CAAIG,SAASJ,KAAAA,CAAMK,IAAAA;AACrB;AAEA,EAAA,OAAOJ,GAAAA;AACT;AArBsBF,MAAAA,CAAAA,QAAAA,EAAAA,UAAAA,CAAAA","file":"paginate.cjs","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n * SPDX-License-Identifier: Apache-2.0\n */\n\nexport interface PaginateInput<T, C> {\n  size: number;\n  handler: (data: { cursor?: C; limit: number }) => Promise<{ data: T[]; nextCursor?: C }>;\n}\n\nexport async function paginate<T, C = number>(input: PaginateInput<T, C>): Promise<T[]> {\n  const acc: T[] = [];\n  let cursor: C | undefined = undefined;\n  while (acc.length < input.size) {\n    const { data, nextCursor } = await input.handler({\n      cursor,\n      limit: input.size - acc.length,\n    });\n    acc.push(...data);\n\n    if (nextCursor === undefined || data.length === 0) {\n      break;\n    }\n    cursor = nextCursor;\n  }\n\n  if (acc.length > input.size) {\n    acc.length = input.size;\n  }\n\n  return acc;\n}\n"]}

package/dist/internals/helpers/paginate.d.cts

@@ -1,17 +1,6 @@
 /**
  * Copyright 2025 © BeeAI a Series of LF Projects, LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
+ * SPDX-License-Identifier: Apache-2.0
  */
 interface PaginateInput<T, C> {
     size: number;

package/dist/internals/helpers/paginate.d.ts

@@ -1,17 +1,6 @@
 /**
  * Copyright 2025 © BeeAI a Series of LF Projects, LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
+ * SPDX-License-Identifier: Apache-2.0
  */
 interface PaginateInput<T, C> {
     size: number;

package/dist/internals/helpers/paginate.js.map

@@ -1 +1 @@
-{"version":3,"sources":["paginate.ts"],"names":["paginate","input","acc","cursor","undefined","length","size","data","nextCursor","handler","limit","push"],"mappings":";;AAqBA,eAAsBA,SAAwBC,KAA0B,EAAA;AACtE,EAAA,MAAMC,MAAW,EAAA;AACjB,EAAA,IAAIC,MAAwBC,GAAAA,MAAAA;AAC5B,EAAOF,OAAAA,GAAAA,CAAIG,MAASJ,GAAAA,KAAAA,CAAMK,IAAM,EAAA;AAC9B,IAAA,MAAM,EAAEC,IAAMC,EAAAA,UAAAA,EAAe,GAAA,MAAMP,MAAMQ,OAAQ,CAAA;AAC/CN,MAAAA,MAAAA;MACAO,KAAOT,EAAAA,KAAAA,CAAMK,OAAOJ,GAAIG,CAAAA;KAC1B,CAAA;AACAH,IAAIS,GAAAA,CAAAA,IAAAA,CAAI,GAAIJ,IAAAA,CAAAA;AAEZ,IAAA,IAAIC,UAAeJ,KAAAA,MAAAA,IAAaG,IAAKF,CAAAA,MAAAA,KAAW,CAAG,EAAA;AACjD,MAAA;AACF;AACAF,IAASK,MAAAA,GAAAA,UAAAA;AACX;AAEA,EAAIN,IAAAA,GAAAA,CAAIG,MAASJ,GAAAA,KAAAA,CAAMK,IAAM,EAAA;AAC3BJ,IAAAA,GAAAA,CAAIG,SAASJ,KAAMK,CAAAA,IAAAA;AACrB;AAEA,EAAOJ,OAAAA,GAAAA;AACT;AArBsBF,MAAAA,CAAAA,QAAAA,EAAAA,UAAAA,CAAAA","file":"paginate.js","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport interface PaginateInput<T, C> {\n  size: number;\n  handler: (data: { cursor?: C; limit: number }) => Promise<{ data: T[]; nextCursor?: C }>;\n}\n\nexport async function paginate<T, C = number>(input: PaginateInput<T, C>): Promise<T[]> {\n  const acc: T[] = [];\n  let cursor: C | undefined = undefined;\n  while (acc.length < input.size) {\n    const { data, nextCursor } = await input.handler({\n      cursor,\n      limit: input.size - acc.length,\n    });\n    acc.push(...data);\n\n    if (nextCursor === undefined || data.length === 0) {\n      break;\n    }\n    cursor = nextCursor;\n  }\n\n  if (acc.length > input.size) {\n    acc.length = input.size;\n  }\n\n  return acc;\n}\n"]}
+{"version":3,"sources":["../../../src/internals/helpers/paginate.ts"],"names":["paginate","input","acc","cursor","undefined","length","size","data","nextCursor","handler","limit","push"],"mappings":";;AAUA,eAAsBA,SAAwBC,KAAAA,EAA0B;AACtE,EAAA,MAAMC,MAAW,EAAA;AACjB,EAAA,IAAIC,MAAAA,GAAwBC,MAAAA;AAC5B,EAAA,OAAOF,GAAAA,CAAIG,MAAAA,GAASJ,KAAAA,CAAMK,IAAAA,EAAM;AAC9B,IAAA,MAAM,EAAEC,IAAAA,EAAMC,UAAAA,EAAU,GAAK,MAAMP,MAAMQ,OAAAA,CAAQ;AAC/CN,MAAAA,MAAAA;MACAO,KAAAA,EAAOT,KAAAA,CAAMK,OAAOJ,GAAAA,CAAIG;KAC1B,CAAA;AACAH,IAAAA,GAAAA,CAAIS,IAAAA,CAAI,GAAIJ,IAAAA,CAAAA;AAEZ,IAAA,IAAIC,UAAAA,KAAeJ,MAAAA,IAAaG,IAAAA,CAAKF,MAAAA,KAAW,CAAA,EAAG;AACjD,MAAA;AACF;AACAF,IAAAA,MAAAA,GAASK,UAAAA;AACX;AAEA,EAAA,IAAIN,GAAAA,CAAIG,MAAAA,GAASJ,KAAAA,CAAMK,IAAAA,EAAM;AAC3BJ,IAAAA,GAAAA,CAAIG,SAASJ,KAAAA,CAAMK,IAAAA;AACrB;AAEA,EAAA,OAAOJ,GAAAA;AACT;AArBsBF,MAAAA,CAAAA,QAAAA,EAAAA,UAAAA,CAAAA","file":"paginate.js","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n * SPDX-License-Identifier: Apache-2.0\n */\n\nexport interface PaginateInput<T, C> {\n  size: number;\n  handler: (data: { cursor?: C; limit: number }) => Promise<{ data: T[]; nextCursor?: C }>;\n}\n\nexport async function paginate<T, C = number>(input: PaginateInput<T, C>): Promise<T[]> {\n  const acc: T[] = [];\n  let cursor: C | undefined = undefined;\n  while (acc.length < input.size) {\n    const { data, nextCursor } = await input.handler({\n      cursor,\n      limit: input.size - acc.length,\n    });\n    acc.push(...data);\n\n    if (nextCursor === undefined || data.length === 0) {\n      break;\n    }\n    cursor = nextCursor;\n  }\n\n  if (acc.length > input.size) {\n    acc.length = input.size;\n  }\n\n  return acc;\n}\n"]}

package/dist/internals/helpers/promise.cjs

@@ -87,9 +87,8 @@ class LazyPromise {
   handler;
   constructor(handler) {
     this.handler = handler;
-    this[_Symbol_toStringTag] = "Promise";
   }
-  [_Symbol_toStringTag = Symbol.toStringTag];
+  [Symbol.toStringTag] = "Promise";
   async before() {
   }
   then(onfulfilled, onrejected) {
@@ -127,7 +126,6 @@ async function* toAsyncGenerator(promise) {
   yield await promise;
 }
 __name(toAsyncGenerator, "toAsyncGenerator");
-var _Symbol_toStringTag;
 
 exports.LazyPromise = LazyPromise;
 exports.arrayFromAsync = arrayFromAsync;

package/dist/internals/helpers/promise.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["promise.ts"],"names":["isPromiseLike","value","isPromise","isFunction","getProp","arrayFromAsync","generator","limit","Infinity","results","chunk","length","push","emitterToGenerator","fn","queue","emit","data","then","done","catch","error","Promise","resolve","setImmediate","shift","asyncProperties","obj","Object","fromEntries","all","entries","map","key","safeExecute","handler","onError","onSuccess","result","err","e","asyncExecute","LazyPromise","constructor","Symbol","toStringTag","before","onfulfilled","onrejected","undefined","finally","onfinally","signalRace","signal","onAbort","reject","aborted","reason","signalFn","addEventListener","removeEventListener","executeSequentially","tasks","task","toAsyncGenerator","promise"],"mappings":";;;;;;;AAmBO,SAASA,cAAiBC,KAAc,EAAA;AAC7C,EAAA,OAAOC,gBAAUD,CAAAA,KAAAA,CAAUE,IAAAA,iBAAAA,CAAWC,mBAAQH,KAAO,EAAA;AAAC,IAAA;GAAO,CAAA,CAAA;AAC/D;AAFgBD,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAIhB,eAAsBK,cAAAA,CACpBC,WACAC,KAAc,EAAA;AAEdA,EAAAA,KAAAA,GAAQA,KAASC,IAAAA,QAAAA;AACjB,EAAA,MAAMC,UAAe,EAAA;AACrB,EAAA,WAAA,MAAiBC,SAASJ,SAAW,EAAA;AACnC,IAAIG,IAAAA,OAAAA,CAAQE,UAAUJ,KAAO,EAAA;AAC3B,MAAA;AACF;AACAE,IAAAA,OAAAA,CAAQG,KAAKF,KAAAA,CAAAA;AACf;AACA,EAAOD,OAAAA,OAAAA;AACT;AAbsBJ,MAAAA,CAAAA,cAAAA,EAAAA,gBAAAA,CAAAA;AAgBtB,gBAAuBQ,mBAAyBC,EAA8B,EAAA;AAO5E,EAAA,MAAMC,QAAgB,EAAA;AACtB,EAAA,KAAKD,EAAG,CAAA;IACNE,IAAM,kBAAA,MAAA,CAAA,CAACC,IAAYF,KAAAA,KAAAA,CAAMH,IAAK,CAAA;AAAEK,MAAAA;AAAK,KAAA,CAA/B,EAAA,MAAA;AACR,GAAA,CACGC,CAAAA,IAAAA,CAAK,MAAMH,KAAAA,CAAMH,IAAK,CAAA;IAAEO,IAAM,EAAA;AAAK,GAAA,CAAA,CACnCC,CAAAA,KAAAA,CAAM,CAACC,KAAAA,KAAUN,MAAMH,IAAK,CAAA;AAAES,IAAAA,KAAAA;IAAOF,IAAM,EAAA;AAAK,GAAA,CAAA,CAAA;AAEnD,EAAA,OAAO,IAAM,EAAA;AACX,IAAOJ,OAAAA,KAAAA,CAAMJ,WAAW,CAAG,EAAA;AACzB,MAAA,MAAM,IAAIW,OAAQ,CAAA,CAACC,OAAYC,KAAAA,YAAAA,CAAaD,OAAAA,CAAAA,CAAAA;AAC9C;AAEA,IAAA,MAAM,EAAEN,IAAME,EAAAA,IAAAA,EAAME,KAAK,EAAA,GAAKN,MAAMU,KAAK,EAAA;AACzC,IAAA,IAAIJ,KAAO,EAAA;AACT,MAAMA,MAAAA,KAAAA;AACR;AACA,IAAA,IAAIF,IAAM,EAAA;AACR,MAAA;AACF;AACA,IAAMF,MAAAA,IAAAA;AACR;AACF;AA5BuBJ,MAAAA,CAAAA,kBAAAA,EAAAA,oBAAAA,CAAAA;AA8BvB,eAAsBa,gBACpBC,GAAM,EAAA;AAEN,EAAA,OAAOC,MAAOC,CAAAA,WAAAA,CACZ,MAAMP,OAAAA,CAAQQ,IAAIF,MAAOG,CAAAA,OAAAA,CAAQJ,GAAAA,CAAAA,CAAKK,GAAI,CAAA,OAAO,CAACC,GAAAA,EAAKhC,KAAAA,CAAW,KAAA;AAACgC,IAAAA,GAAAA;IAAK,MAAMhC;AAAM,GAAA,CAAA,CAAA,CAAA;AAExF;AANsByB,MAAAA,CAAAA,eAAAA,EAAAA,iBAAAA,CAAAA;AAcf,SAASQ,WAAe,CAAA,EAAEC,OAASC,EAAAA,OAAAA,EAASC,WAAkC,EAAA;AACnF,EAAI,IAAA;AACF,IAAA,MAAMC,SAASH,OAAAA,EAAAA;AACf,IAAInC,IAAAA,aAAAA,CAAiBsC,MAAAA,CAAS,EAAA;AAC5BA,MAAOpB,MAAAA,CAAAA,IAAAA,CACL,CAACoB,OAAAA,KAAWD,SAAYC,GAAAA,OAAAA,GACxB,CAACC,GAAAA,KAAQH,OAAUG,GAAAA,GAAAA,CAAAA,CAAAA;KAEhB,MAAA;AACLF,MAAAA,SAAAA,GAAYC,MAAAA,CAAAA;AACd;AACF,GAAA,CAAA,OAASE,CAAG,EAAA;AACVJ,IAAAA,OAAAA,GAAUI,CAAAA,CAAAA;AACZ;AACF;AAdgBN,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAgBT,SAASO,aAAgBN,OAAgB,EAAA;AAC9C,EAAA,OAAO,IAAIb,OAAAA,CAAQ,CAACe,SAAAA,EAAWD,OAAAA,KAAAA;AAC7BF,IAAY,WAAA,CAAA;AACVC,MAAAA,OAAAA;AACAE,MAAAA,SAAAA;AACAD,MAAAA;KACF,CAAA;GACF,CAAA;AACF;AARgBK,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAUT,MAAMC,WAAAA,CAAAA;EA7Gb;;;;AA8GEC,EAAAA,WAAAA,CAA+BR,OAA2B,EAAA;SAA3BA,OAAAA,GAAAA,OAAAA;AAErBS,IAAAA,IAAAA,CAAAA,mBAAAA,CAAsB,GAAA,SAAA;AAF2B;EAElD,CAACA,mBAAAA,GAAAA,OAAOC,WAAW;AAE5B,EAAA,MAAgBC,MAAwB,GAAA;AAAC;AAEzC5B,EAAAA,IAAAA,CACE6B,aACAC,UAC8B,EAAA;AAC9B,IAAO,OAAA,IAAA,CAAKF,MAAM,EAAA,CAAG5B,IAAK,CAAA,IAAA,CAAKiB,OAAO,CAAA,CAAEjB,IAAK6B,CAAAA,WAAAA,CAAa3B,CAAAA,KAAAA,CAAM4B,UAAAA,CAAAA;AAClE;AAEA5B,EAAAA,KAAAA,CACE4B,UACsB,EAAA;AACtB,IAAO,OAAA,IAAA,CAAKF,MAAM,EAAA,CAAG5B,IAAK,CAAA,IAAA,CAAKiB,OAAO,CAAA,CAAEjB,IAAK+B,CAAAA,MAAAA,CAAW7B,CAAAA,KAAAA,CAAM4B,UAAAA,CAAAA;AAChE;AAEAE,EAAAA,OAAAA,CAAQC,SAAyD,EAAA;AAC/D,IAAO,OAAA,IAAA,CAAKL,QAAS5B,CAAAA,IAAAA,CAAK,KAAKiB,OAAO,CAAA,CAAEe,QAAQC,SAAAA,CAAAA;AAClD;AACF;AAEA,eAAsBC,UAAAA,CACpBtC,EACAuC,EAAAA,MAAAA,EACAC,OAAoB,EAAA;AAEpB,EAAA,OAAO,IAAIhC,OAAAA,CAAW,CAACC,OAAAA,EAASgC,MAAAA,KAAAA;AAC9B,IAAA,IAAIF,QAAQG,OAAS,EAAA;AACnBD,MAAAA,MAAAA,CAAOF,OAAOI,MAAM,CAAA;AACpB,MAAA;AACF;AAEA,IAAA,MAAMC,2BAAW,MAAA,CAAA,MAAA;AACfJ,MAAAA,OAAAA,IAAAA;AACAC,MAAAA,MAAAA,CAAOF,QAAQI,MAAAA,CAAAA;KAFA,EAAA,UAAA,CAAA;AAIjBJ,IAAQM,MAAAA,EAAAA,gBAAAA,GAAmB,SAASD,QAAAA,CAAAA;AACpC5C,IAAAA,EAAAA,EACGI,CAAAA,IAAAA,CAAKK,OAAAA,CAAAA,CACLH,KAAMmC,CAAAA,MAAAA,CACNL,CAAAA,OAAAA,CAAQ,MAAMG,MAAAA,EAAQO,mBAAsB,GAAA,OAAA,EAASF,QAAAA,CAAAA,CAAAA;GAC1D,CAAA;AACF;AArBsBN,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAuBtB,eAAsBS,oBAAoBC,KAA6B,EAAA;AACrE,EAAA,KAAA,MAAWC,QAAQD,KAAO,EAAA;AACxB,IAAA,MAAMC,IAAAA,EAAAA;AACR;AACF;AAJsBF,MAAAA,CAAAA,mBAAAA,EAAAA,qBAAAA,CAAAA;AAMtB,gBAAuBG,iBAAoBC,OAAU,EAAA;AACnD,EAAA,MAAM,MAAMA,OAAAA;AACd;AAFuBD,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA","file":"promise.cjs","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { isFunction, isPromise } from \"remeda\";\nimport { getProp } from \"@/internals/helpers/object.js\";\n\nexport function isPromiseLike<T>(value: unknown): value is PromiseLike<T> {\n  return isPromise(value) || isFunction(getProp(value, [\"then\"]));\n}\n\nexport async function arrayFromAsync<A, B>(\n  generator: AsyncGenerator<A, B> | AsyncIterableIterator<A> | AsyncIterable<A>,\n  limit?: number,\n) {\n  limit = limit ?? Infinity;\n  const results: A[] = [];\n  for await (const chunk of generator) {\n    if (results.length >= limit) {\n      break;\n    }\n    results.push(chunk);\n  }\n  return results;\n}\n\nexport type EmitterToGeneratorFn<T, R> = (data: { emit: (data: T) => void }) => Promise<R>;\nexport async function* emitterToGenerator<T, R>(fn: EmitterToGeneratorFn<T, R>) {\n  interface Data {\n    data?: T;\n    error?: Error;\n    done?: boolean;\n  }\n\n  const queue: Data[] = [];\n  void fn({\n    emit: (data: T) => queue.push({ data }),\n  })\n    .then(() => queue.push({ done: true }))\n    .catch((error) => queue.push({ error, done: true }));\n\n  while (true) {\n    while (queue.length === 0) {\n      await new Promise((resolve) => setImmediate(resolve));\n    }\n\n    const { data, done, error } = queue.shift()!;\n    if (error) {\n      throw error;\n    }\n    if (done) {\n      break;\n    }\n    yield data!;\n  }\n}\n\nexport async function asyncProperties<T extends NonNullable<unknown>>(\n  obj: T,\n): Promise<{ [K in keyof T]: Awaited<T[K]> }> {\n  return Object.fromEntries(\n    await Promise.all(Object.entries(obj).map(async ([key, value]) => [key, await value])),\n  );\n}\n\ninterface SafeExecuteOptions<T> {\n  handler: () => T;\n  onSuccess?: (result: T) => void;\n  onError?: (err: Error) => void;\n}\n\nexport function safeExecute<T>({ handler, onError, onSuccess }: SafeExecuteOptions<T>): void {\n  try {\n    const result = handler();\n    if (isPromiseLike<T>(result)) {\n      result.then(\n        (result) => onSuccess?.(result),\n        (err) => onError?.(err),\n      );\n    } else {\n      onSuccess?.(result);\n    }\n  } catch (e) {\n    onError?.(e);\n  }\n}\n\nexport function asyncExecute<R>(handler: () => R): Promise<R> {\n  return new Promise((onSuccess, onError) => {\n    safeExecute({\n      handler,\n      onSuccess,\n      onError,\n    });\n  });\n}\n\nexport class LazyPromise<R> implements Promise<R> {\n  constructor(protected readonly handler: () => Promise<R>) {}\n\n  readonly [Symbol.toStringTag] = \"Promise\";\n\n  protected async before(): Promise<void> {}\n\n  then<TResult1 = R, TResult2 = never>(\n    onfulfilled?: ((value: R) => PromiseLike<TResult1> | TResult1) | undefined | null,\n    onrejected?: ((reason: any) => PromiseLike<TResult2> | TResult2) | undefined | null,\n  ): Promise<TResult1 | TResult2> {\n    return this.before().then(this.handler).then(onfulfilled).catch(onrejected);\n  }\n\n  catch<TResult = never>(\n    onrejected?: ((reason: any) => PromiseLike<TResult> | TResult) | undefined | null,\n  ): Promise<R | TResult> {\n    return this.before().then(this.handler).then(undefined).catch(onrejected);\n  }\n\n  finally(onfinally?: (() => void) | undefined | null): Promise<R> {\n    return this.before().then(this.handler).finally(onfinally);\n  }\n}\n\nexport async function signalRace<R>(\n  fn: () => Promise<R>,\n  signal?: AbortSignal,\n  onAbort?: () => void,\n): Promise<R> {\n  return new Promise<R>((resolve, reject) => {\n    if (signal?.aborted) {\n      reject(signal.reason);\n      return;\n    }\n\n    const signalFn = () => {\n      onAbort?.();\n      reject(signal?.reason);\n    };\n    signal?.addEventListener?.(\"abort\", signalFn);\n    fn()\n      .then(resolve)\n      .catch(reject)\n      .finally(() => signal?.removeEventListener?.(\"abort\", signalFn));\n  });\n}\n\nexport async function executeSequentially(tasks: (() => Promise<any>)[]): Promise<void> {\n  for (const task of tasks) {\n    await task();\n  }\n}\n\nexport async function* toAsyncGenerator<T>(promise: T): AsyncGenerator<Awaited<T>> {\n  yield await promise;\n}\n"]}
+{"version":3,"sources":["../../../src/internals/helpers/promise.ts"],"names":["isPromiseLike","value","isPromise","isFunction","getProp","arrayFromAsync","generator","limit","Infinity","results","chunk","length","push","emitterToGenerator","fn","queue","emit","data","then","done","catch","error","Promise","resolve","setImmediate","shift","asyncProperties","obj","Object","fromEntries","all","entries","map","key","safeExecute","handler","onError","onSuccess","result","err","e","asyncExecute","LazyPromise","Symbol","toStringTag","before","onfulfilled","onrejected","undefined","finally","onfinally","signalRace","signal","onAbort","reject","aborted","reason","signalFn","addEventListener","removeEventListener","executeSequentially","tasks","task","toAsyncGenerator","promise"],"mappings":";;;;;;;AAQO,SAASA,cAAiBC,KAAAA,EAAc;AAC7C,EAAA,OAAOC,gBAAAA,CAAUD,KAAAA,CAAAA,IAAUE,iBAAAA,CAAWC,mBAAQH,KAAAA,EAAO;AAAC,IAAA;GAAO,CAAA,CAAA;AAC/D;AAFgBD,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAIhB,eAAsBK,cAAAA,CACpBC,WACAC,KAAAA,EAAc;AAEdA,EAAAA,KAAAA,GAAQA,KAAAA,IAASC,QAAAA;AACjB,EAAA,MAAMC,UAAe,EAAA;AACrB,EAAA,WAAA,MAAiBC,SAASJ,SAAAA,EAAW;AACnC,IAAA,IAAIG,OAAAA,CAAQE,UAAUJ,KAAAA,EAAO;AAC3B,MAAA;AACF;AACAE,IAAAA,OAAAA,CAAQG,KAAKF,KAAAA,CAAAA;AACf;AACA,EAAA,OAAOD,OAAAA;AACT;AAbsBJ,MAAAA,CAAAA,cAAAA,EAAAA,gBAAAA,CAAAA;AAgBtB,gBAAuBQ,mBAAyBC,EAAAA,EAA8B;AAO5E,EAAA,MAAMC,QAAgB,EAAA;AACtB,EAAA,KAAKD,EAAAA,CAAG;IACNE,IAAAA,kBAAM,MAAA,CAAA,CAACC,IAAAA,KAAYF,KAAAA,CAAMH,IAAAA,CAAK;AAAEK,MAAAA;AAAK,KAAA,CAAA,EAA/B,MAAA;AACR,GAAA,CAAA,CACGC,IAAAA,CAAK,MAAMH,KAAAA,CAAMH,IAAAA,CAAK;IAAEO,IAAAA,EAAM;AAAK,GAAA,CAAA,CAAA,CACnCC,KAAAA,CAAM,CAACC,KAAAA,KAAUN,MAAMH,IAAAA,CAAK;AAAES,IAAAA,KAAAA;IAAOF,IAAAA,EAAM;AAAK,GAAA,CAAA,CAAA;AAEnD,EAAA,OAAO,IAAA,EAAM;AACX,IAAA,OAAOJ,KAAAA,CAAMJ,WAAW,CAAA,EAAG;AACzB,MAAA,MAAM,IAAIW,OAAAA,CAAQ,CAACC,OAAAA,KAAYC,YAAAA,CAAaD,OAAAA,CAAAA,CAAAA;AAC9C;AAEA,IAAA,MAAM,EAAEN,IAAAA,EAAME,IAAAA,EAAME,KAAAA,EAAK,GAAKN,MAAMU,KAAAA,EAAK;AACzC,IAAA,IAAIJ,KAAAA,EAAO;AACT,MAAA,MAAMA,KAAAA;AACR;AACA,IAAA,IAAIF,IAAAA,EAAM;AACR,MAAA;AACF;AACA,IAAA,MAAMF,IAAAA;AACR;AACF;AA5BuBJ,MAAAA,CAAAA,kBAAAA,EAAAA,oBAAAA,CAAAA;AA8BvB,eAAsBa,gBACpBC,GAAAA,EAAM;AAEN,EAAA,OAAOC,MAAAA,CAAOC,WAAAA,CACZ,MAAMP,OAAAA,CAAQQ,IAAIF,MAAAA,CAAOG,OAAAA,CAAQJ,GAAAA,CAAAA,CAAKK,GAAAA,CAAI,OAAO,CAACC,GAAAA,EAAKhC,KAAAA,CAAAA,KAAW;AAACgC,IAAAA,GAAAA;IAAK,MAAMhC;AAAM,GAAA,CAAA,CAAA,CAAA;AAExF;AANsByB,MAAAA,CAAAA,eAAAA,EAAAA,iBAAAA,CAAAA;AAcf,SAASQ,WAAAA,CAAe,EAAEC,OAAAA,EAASC,OAAAA,EAASC,WAAS,EAAyB;AACnF,EAAA,IAAI;AACF,IAAA,MAAMC,SAASH,OAAAA,EAAAA;AACf,IAAA,IAAInC,aAAAA,CAAiBsC,MAAAA,CAAAA,EAAS;AAC5BA,MAAAA,MAAAA,CAAOpB,IAAAA,CACL,CAACoB,OAAAA,KAAWD,SAAAA,GAAYC,OAAAA,GACxB,CAACC,GAAAA,KAAQH,OAAAA,GAAUG,GAAAA,CAAAA,CAAAA;KAEvB,MAAO;AACLF,MAAAA,SAAAA,GAAYC,MAAAA,CAAAA;AACd;AACF,GAAA,CAAA,OAASE,CAAAA,EAAG;AACVJ,IAAAA,OAAAA,GAAUI,CAAAA,CAAAA;AACZ;AACF;AAdgBN,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAgBT,SAASO,aAAgBN,OAAAA,EAAgB;AAC9C,EAAA,OAAO,IAAIb,OAAAA,CAAQ,CAACe,SAAAA,EAAWD,OAAAA,KAAAA;AAC7BF,IAAAA,WAAAA,CAAY;AACVC,MAAAA,OAAAA;AACAE,MAAAA,SAAAA;AACAD,MAAAA;KACF,CAAA;GACF,CAAA;AACF;AARgBK,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAUT,MAAMC,WAAAA,CAAAA;EAlGb;;;;AAmGE,EAAA,WAAA,CAA+BP,OAAAA,EAA2B;SAA3BA,OAAAA,GAAAA,OAAAA;AAA4B;EAElD,CAACQ,MAAAA,CAAOC,WAAW,IAAI,SAAA;AAEhC,EAAA,MAAgBC,MAAAA,GAAwB;AAAC;AAEzC3B,EAAAA,IAAAA,CACE4B,aACAC,UAAAA,EAC8B;AAC9B,IAAA,OAAO,IAAA,CAAKF,MAAAA,EAAM,CAAG3B,IAAAA,CAAK,IAAA,CAAKiB,OAAO,CAAA,CAAEjB,IAAAA,CAAK4B,WAAAA,CAAAA,CAAa1B,KAAAA,CAAM2B,UAAAA,CAAAA;AAClE;AAEA3B,EAAAA,KAAAA,CACE2B,UAAAA,EACsB;AACtB,IAAA,OAAO,IAAA,CAAKF,MAAAA,EAAM,CAAG3B,IAAAA,CAAK,IAAA,CAAKiB,OAAO,CAAA,CAAEjB,IAAAA,CAAK8B,MAAAA,CAAAA,CAAW5B,KAAAA,CAAM2B,UAAAA,CAAAA;AAChE;AAEAE,EAAAA,OAAAA,CAAQC,SAAAA,EAAyD;AAC/D,IAAA,OAAO,IAAA,CAAKL,QAAM,CAAG3B,IAAAA,CAAK,KAAKiB,OAAO,CAAA,CAAEc,QAAQC,SAAAA,CAAAA;AAClD;AACF;AAEA,eAAsBC,UAAAA,CACpBrC,EAAAA,EACAsC,MAAAA,EACAC,OAAAA,EAAoB;AAEpB,EAAA,OAAO,IAAI/B,OAAAA,CAAW,CAACC,OAAAA,EAAS+B,MAAAA,KAAAA;AAC9B,IAAA,IAAIF,QAAQG,OAAAA,EAAS;AACnBD,MAAAA,MAAAA,CAAOF,OAAOI,MAAM,CAAA;AACpB,MAAA;AACF;AAEA,IAAA,MAAMC,2BAAW,MAAA,CAAA,MAAA;AACfJ,MAAAA,OAAAA,IAAAA;AACAC,MAAAA,MAAAA,CAAOF,QAAQI,MAAAA,CAAAA;KACjB,EAHiB,UAAA,CAAA;AAIjBJ,IAAAA,MAAAA,EAAQM,gBAAAA,GAAmB,SAASD,QAAAA,CAAAA;AACpC3C,IAAAA,EAAAA,EAAAA,CACGI,IAAAA,CAAKK,OAAAA,CAAAA,CACLH,KAAAA,CAAMkC,MAAAA,CAAAA,CACNL,OAAAA,CAAQ,MAAMG,MAAAA,EAAQO,mBAAAA,GAAsB,OAAA,EAASF,QAAAA,CAAAA,CAAAA;GAC1D,CAAA;AACF;AArBsBN,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAuBtB,eAAsBS,oBAAoBC,KAAAA,EAA6B;AACrE,EAAA,KAAA,MAAWC,QAAQD,KAAAA,EAAO;AACxB,IAAA,MAAMC,IAAAA,EAAAA;AACR;AACF;AAJsBF,MAAAA,CAAAA,mBAAAA,EAAAA,qBAAAA,CAAAA;AAMtB,gBAAuBG,iBAAoBC,OAAAA,EAAU;AACnD,EAAA,MAAM,MAAMA,OAAAA;AACd;AAFuBD,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA","file":"promise.cjs","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n * SPDX-License-Identifier: Apache-2.0\n */\n\nimport { isFunction, isPromise } from \"remeda\";\nimport { getProp } from \"@/internals/helpers/object.js\";\n\nexport function isPromiseLike<T>(value: unknown): value is PromiseLike<T> {\n  return isPromise(value) || isFunction(getProp(value, [\"then\"]));\n}\n\nexport async function arrayFromAsync<A, B>(\n  generator: AsyncGenerator<A, B> | AsyncIterableIterator<A> | AsyncIterable<A>,\n  limit?: number,\n) {\n  limit = limit ?? Infinity;\n  const results: A[] = [];\n  for await (const chunk of generator) {\n    if (results.length >= limit) {\n      break;\n    }\n    results.push(chunk);\n  }\n  return results;\n}\n\nexport type EmitterToGeneratorFn<T, R> = (data: { emit: (data: T) => void }) => Promise<R>;\nexport async function* emitterToGenerator<T, R>(fn: EmitterToGeneratorFn<T, R>) {\n  interface Data {\n    data?: T;\n    error?: Error;\n    done?: boolean;\n  }\n\n  const queue: Data[] = [];\n  void fn({\n    emit: (data: T) => queue.push({ data }),\n  })\n    .then(() => queue.push({ done: true }))\n    .catch((error) => queue.push({ error, done: true }));\n\n  while (true) {\n    while (queue.length === 0) {\n      await new Promise((resolve) => setImmediate(resolve));\n    }\n\n    const { data, done, error } = queue.shift()!;\n    if (error) {\n      throw error;\n    }\n    if (done) {\n      break;\n    }\n    yield data!;\n  }\n}\n\nexport async function asyncProperties<T extends NonNullable<unknown>>(\n  obj: T,\n): Promise<{ [K in keyof T]: Awaited<T[K]> }> {\n  return Object.fromEntries(\n    await Promise.all(Object.entries(obj).map(async ([key, value]) => [key, await value])),\n  );\n}\n\ninterface SafeExecuteOptions<T> {\n  handler: () => T;\n  onSuccess?: (result: T) => void;\n  onError?: (err: Error) => void;\n}\n\nexport function safeExecute<T>({ handler, onError, onSuccess }: SafeExecuteOptions<T>): void {\n  try {\n    const result = handler();\n    if (isPromiseLike<T>(result)) {\n      result.then(\n        (result) => onSuccess?.(result),\n        (err) => onError?.(err),\n      );\n    } else {\n      onSuccess?.(result);\n    }\n  } catch (e) {\n    onError?.(e);\n  }\n}\n\nexport function asyncExecute<R>(handler: () => R): Promise<R> {\n  return new Promise((onSuccess, onError) => {\n    safeExecute({\n      handler,\n      onSuccess,\n      onError,\n    });\n  });\n}\n\nexport class LazyPromise<R> implements Promise<R> {\n  constructor(protected readonly handler: () => Promise<R>) {}\n\n  readonly [Symbol.toStringTag] = \"Promise\";\n\n  protected async before(): Promise<void> {}\n\n  then<TResult1 = R, TResult2 = never>(\n    onfulfilled?: ((value: R) => PromiseLike<TResult1> | TResult1) | undefined | null,\n    onrejected?: ((reason: any) => PromiseLike<TResult2> | TResult2) | undefined | null,\n  ): Promise<TResult1 | TResult2> {\n    return this.before().then(this.handler).then(onfulfilled).catch(onrejected);\n  }\n\n  catch<TResult = never>(\n    onrejected?: ((reason: any) => PromiseLike<TResult> | TResult) | undefined | null,\n  ): Promise<R | TResult> {\n    return this.before().then(this.handler).then(undefined).catch(onrejected);\n  }\n\n  finally(onfinally?: (() => void) | undefined | null): Promise<R> {\n    return this.before().then(this.handler).finally(onfinally);\n  }\n}\n\nexport async function signalRace<R>(\n  fn: () => Promise<R>,\n  signal?: AbortSignal,\n  onAbort?: () => void,\n): Promise<R> {\n  return new Promise<R>((resolve, reject) => {\n    if (signal?.aborted) {\n      reject(signal.reason);\n      return;\n    }\n\n    const signalFn = () => {\n      onAbort?.();\n      reject(signal?.reason);\n    };\n    signal?.addEventListener?.(\"abort\", signalFn);\n    fn()\n      .then(resolve)\n      .catch(reject)\n      .finally(() => signal?.removeEventListener?.(\"abort\", signalFn));\n  });\n}\n\nexport async function executeSequentially(tasks: (() => Promise<any>)[]): Promise<void> {\n  for (const task of tasks) {\n    await task();\n  }\n}\n\nexport async function* toAsyncGenerator<T>(promise: T): AsyncGenerator<Awaited<T>> {\n  yield await promise;\n}\n"]}

package/dist/internals/helpers/promise.d.cts

@@ -1,17 +1,6 @@
 /**
  * Copyright 2025 © BeeAI a Series of LF Projects, LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
+ * SPDX-License-Identifier: Apache-2.0
  */
 declare function isPromiseLike<T>(value: unknown): value is PromiseLike<T>;
 declare function arrayFromAsync<A, B>(generator: AsyncGenerator<A, B> | AsyncIterableIterator<A> | AsyncIterable<A>, limit?: number): Promise<A[]>;

package/dist/internals/helpers/promise.d.ts

@@ -1,17 +1,6 @@
 /**
  * Copyright 2025 © BeeAI a Series of LF Projects, LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
+ * SPDX-License-Identifier: Apache-2.0
  */
 declare function isPromiseLike<T>(value: unknown): value is PromiseLike<T>;
 declare function arrayFromAsync<A, B>(generator: AsyncGenerator<A, B> | AsyncIterableIterator<A> | AsyncIterable<A>, limit?: number): Promise<A[]>;

package/dist/internals/helpers/promise.js

@@ -85,9 +85,8 @@ class LazyPromise {
   handler;
   constructor(handler) {
     this.handler = handler;
-    this[_Symbol_toStringTag] = "Promise";
   }
-  [_Symbol_toStringTag = Symbol.toStringTag];
+  [Symbol.toStringTag] = "Promise";
   async before() {
   }
   then(onfulfilled, onrejected) {
@@ -125,7 +124,6 @@ async function* toAsyncGenerator(promise) {
   yield await promise;
 }
 __name(toAsyncGenerator, "toAsyncGenerator");
-var _Symbol_toStringTag;
 
 export { LazyPromise, arrayFromAsync, asyncExecute, asyncProperties, emitterToGenerator, executeSequentially, isPromiseLike, safeExecute, signalRace, toAsyncGenerator };
 //# sourceMappingURL=promise.js.map

package/dist/internals/helpers/promise.js.map

@@ -1 +1 @@
-{"version":3,"sources":["promise.ts"],"names":["isPromiseLike","value","isPromise","isFunction","getProp","arrayFromAsync","generator","limit","Infinity","results","chunk","length","push","emitterToGenerator","fn","queue","emit","data","then","done","catch","error","Promise","resolve","setImmediate","shift","asyncProperties","obj","Object","fromEntries","all","entries","map","key","safeExecute","handler","onError","onSuccess","result","err","e","asyncExecute","LazyPromise","constructor","Symbol","toStringTag","before","onfulfilled","onrejected","undefined","finally","onfinally","signalRace","signal","onAbort","reject","aborted","reason","signalFn","addEventListener","removeEventListener","executeSequentially","tasks","task","toAsyncGenerator","promise"],"mappings":";;;;;AAmBO,SAASA,cAAiBC,KAAc,EAAA;AAC7C,EAAA,OAAOC,SAAUD,CAAAA,KAAAA,CAAUE,IAAAA,UAAAA,CAAWC,QAAQH,KAAO,EAAA;AAAC,IAAA;GAAO,CAAA,CAAA;AAC/D;AAFgBD,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAIhB,eAAsBK,cAAAA,CACpBC,WACAC,KAAc,EAAA;AAEdA,EAAAA,KAAAA,GAAQA,KAASC,IAAAA,QAAAA;AACjB,EAAA,MAAMC,UAAe,EAAA;AACrB,EAAA,WAAA,MAAiBC,SAASJ,SAAW,EAAA;AACnC,IAAIG,IAAAA,OAAAA,CAAQE,UAAUJ,KAAO,EAAA;AAC3B,MAAA;AACF;AACAE,IAAAA,OAAAA,CAAQG,KAAKF,KAAAA,CAAAA;AACf;AACA,EAAOD,OAAAA,OAAAA;AACT;AAbsBJ,MAAAA,CAAAA,cAAAA,EAAAA,gBAAAA,CAAAA;AAgBtB,gBAAuBQ,mBAAyBC,EAA8B,EAAA;AAO5E,EAAA,MAAMC,QAAgB,EAAA;AACtB,EAAA,KAAKD,EAAG,CAAA;IACNE,IAAM,kBAAA,MAAA,CAAA,CAACC,IAAYF,KAAAA,KAAAA,CAAMH,IAAK,CAAA;AAAEK,MAAAA;AAAK,KAAA,CAA/B,EAAA,MAAA;AACR,GAAA,CACGC,CAAAA,IAAAA,CAAK,MAAMH,KAAAA,CAAMH,IAAK,CAAA;IAAEO,IAAM,EAAA;AAAK,GAAA,CAAA,CACnCC,CAAAA,KAAAA,CAAM,CAACC,KAAAA,KAAUN,MAAMH,IAAK,CAAA;AAAES,IAAAA,KAAAA;IAAOF,IAAM,EAAA;AAAK,GAAA,CAAA,CAAA;AAEnD,EAAA,OAAO,IAAM,EAAA;AACX,IAAOJ,OAAAA,KAAAA,CAAMJ,WAAW,CAAG,EAAA;AACzB,MAAA,MAAM,IAAIW,OAAQ,CAAA,CAACC,OAAYC,KAAAA,YAAAA,CAAaD,OAAAA,CAAAA,CAAAA;AAC9C;AAEA,IAAA,MAAM,EAAEN,IAAME,EAAAA,IAAAA,EAAME,KAAK,EAAA,GAAKN,MAAMU,KAAK,EAAA;AACzC,IAAA,IAAIJ,KAAO,EAAA;AACT,MAAMA,MAAAA,KAAAA;AACR;AACA,IAAA,IAAIF,IAAM,EAAA;AACR,MAAA;AACF;AACA,IAAMF,MAAAA,IAAAA;AACR;AACF;AA5BuBJ,MAAAA,CAAAA,kBAAAA,EAAAA,oBAAAA,CAAAA;AA8BvB,eAAsBa,gBACpBC,GAAM,EAAA;AAEN,EAAA,OAAOC,MAAOC,CAAAA,WAAAA,CACZ,MAAMP,OAAAA,CAAQQ,IAAIF,MAAOG,CAAAA,OAAAA,CAAQJ,GAAAA,CAAAA,CAAKK,GAAI,CAAA,OAAO,CAACC,GAAAA,EAAKhC,KAAAA,CAAW,KAAA;AAACgC,IAAAA,GAAAA;IAAK,MAAMhC;AAAM,GAAA,CAAA,CAAA,CAAA;AAExF;AANsByB,MAAAA,CAAAA,eAAAA,EAAAA,iBAAAA,CAAAA;AAcf,SAASQ,WAAe,CAAA,EAAEC,OAASC,EAAAA,OAAAA,EAASC,WAAkC,EAAA;AACnF,EAAI,IAAA;AACF,IAAA,MAAMC,SAASH,OAAAA,EAAAA;AACf,IAAInC,IAAAA,aAAAA,CAAiBsC,MAAAA,CAAS,EAAA;AAC5BA,MAAOpB,MAAAA,CAAAA,IAAAA,CACL,CAACoB,OAAAA,KAAWD,SAAYC,GAAAA,OAAAA,GACxB,CAACC,GAAAA,KAAQH,OAAUG,GAAAA,GAAAA,CAAAA,CAAAA;KAEhB,MAAA;AACLF,MAAAA,SAAAA,GAAYC,MAAAA,CAAAA;AACd;AACF,GAAA,CAAA,OAASE,CAAG,EAAA;AACVJ,IAAAA,OAAAA,GAAUI,CAAAA,CAAAA;AACZ;AACF;AAdgBN,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAgBT,SAASO,aAAgBN,OAAgB,EAAA;AAC9C,EAAA,OAAO,IAAIb,OAAAA,CAAQ,CAACe,SAAAA,EAAWD,OAAAA,KAAAA;AAC7BF,IAAY,WAAA,CAAA;AACVC,MAAAA,OAAAA;AACAE,MAAAA,SAAAA;AACAD,MAAAA;KACF,CAAA;GACF,CAAA;AACF;AARgBK,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAUT,MAAMC,WAAAA,CAAAA;EA7Gb;;;;AA8GEC,EAAAA,WAAAA,CAA+BR,OAA2B,EAAA;SAA3BA,OAAAA,GAAAA,OAAAA;AAErBS,IAAAA,IAAAA,CAAAA,mBAAAA,CAAsB,GAAA,SAAA;AAF2B;EAElD,CAACA,mBAAAA,GAAAA,OAAOC,WAAW;AAE5B,EAAA,MAAgBC,MAAwB,GAAA;AAAC;AAEzC5B,EAAAA,IAAAA,CACE6B,aACAC,UAC8B,EAAA;AAC9B,IAAO,OAAA,IAAA,CAAKF,MAAM,EAAA,CAAG5B,IAAK,CAAA,IAAA,CAAKiB,OAAO,CAAA,CAAEjB,IAAK6B,CAAAA,WAAAA,CAAa3B,CAAAA,KAAAA,CAAM4B,UAAAA,CAAAA;AAClE;AAEA5B,EAAAA,KAAAA,CACE4B,UACsB,EAAA;AACtB,IAAO,OAAA,IAAA,CAAKF,MAAM,EAAA,CAAG5B,IAAK,CAAA,IAAA,CAAKiB,OAAO,CAAA,CAAEjB,IAAK+B,CAAAA,MAAAA,CAAW7B,CAAAA,KAAAA,CAAM4B,UAAAA,CAAAA;AAChE;AAEAE,EAAAA,OAAAA,CAAQC,SAAyD,EAAA;AAC/D,IAAO,OAAA,IAAA,CAAKL,QAAS5B,CAAAA,IAAAA,CAAK,KAAKiB,OAAO,CAAA,CAAEe,QAAQC,SAAAA,CAAAA;AAClD;AACF;AAEA,eAAsBC,UAAAA,CACpBtC,EACAuC,EAAAA,MAAAA,EACAC,OAAoB,EAAA;AAEpB,EAAA,OAAO,IAAIhC,OAAAA,CAAW,CAACC,OAAAA,EAASgC,MAAAA,KAAAA;AAC9B,IAAA,IAAIF,QAAQG,OAAS,EAAA;AACnBD,MAAAA,MAAAA,CAAOF,OAAOI,MAAM,CAAA;AACpB,MAAA;AACF;AAEA,IAAA,MAAMC,2BAAW,MAAA,CAAA,MAAA;AACfJ,MAAAA,OAAAA,IAAAA;AACAC,MAAAA,MAAAA,CAAOF,QAAQI,MAAAA,CAAAA;KAFA,EAAA,UAAA,CAAA;AAIjBJ,IAAQM,MAAAA,EAAAA,gBAAAA,GAAmB,SAASD,QAAAA,CAAAA;AACpC5C,IAAAA,EAAAA,EACGI,CAAAA,IAAAA,CAAKK,OAAAA,CAAAA,CACLH,KAAMmC,CAAAA,MAAAA,CACNL,CAAAA,OAAAA,CAAQ,MAAMG,MAAAA,EAAQO,mBAAsB,GAAA,OAAA,EAASF,QAAAA,CAAAA,CAAAA;GAC1D,CAAA;AACF;AArBsBN,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAuBtB,eAAsBS,oBAAoBC,KAA6B,EAAA;AACrE,EAAA,KAAA,MAAWC,QAAQD,KAAO,EAAA;AACxB,IAAA,MAAMC,IAAAA,EAAAA;AACR;AACF;AAJsBF,MAAAA,CAAAA,mBAAAA,EAAAA,qBAAAA,CAAAA;AAMtB,gBAAuBG,iBAAoBC,OAAU,EAAA;AACnD,EAAA,MAAM,MAAMA,OAAAA;AACd;AAFuBD,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA","file":"promise.js","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { isFunction, isPromise } from \"remeda\";\nimport { getProp } from \"@/internals/helpers/object.js\";\n\nexport function isPromiseLike<T>(value: unknown): value is PromiseLike<T> {\n  return isPromise(value) || isFunction(getProp(value, [\"then\"]));\n}\n\nexport async function arrayFromAsync<A, B>(\n  generator: AsyncGenerator<A, B> | AsyncIterableIterator<A> | AsyncIterable<A>,\n  limit?: number,\n) {\n  limit = limit ?? Infinity;\n  const results: A[] = [];\n  for await (const chunk of generator) {\n    if (results.length >= limit) {\n      break;\n    }\n    results.push(chunk);\n  }\n  return results;\n}\n\nexport type EmitterToGeneratorFn<T, R> = (data: { emit: (data: T) => void }) => Promise<R>;\nexport async function* emitterToGenerator<T, R>(fn: EmitterToGeneratorFn<T, R>) {\n  interface Data {\n    data?: T;\n    error?: Error;\n    done?: boolean;\n  }\n\n  const queue: Data[] = [];\n  void fn({\n    emit: (data: T) => queue.push({ data }),\n  })\n    .then(() => queue.push({ done: true }))\n    .catch((error) => queue.push({ error, done: true }));\n\n  while (true) {\n    while (queue.length === 0) {\n      await new Promise((resolve) => setImmediate(resolve));\n    }\n\n    const { data, done, error } = queue.shift()!;\n    if (error) {\n      throw error;\n    }\n    if (done) {\n      break;\n    }\n    yield data!;\n  }\n}\n\nexport async function asyncProperties<T extends NonNullable<unknown>>(\n  obj: T,\n): Promise<{ [K in keyof T]: Awaited<T[K]> }> {\n  return Object.fromEntries(\n    await Promise.all(Object.entries(obj).map(async ([key, value]) => [key, await value])),\n  );\n}\n\ninterface SafeExecuteOptions<T> {\n  handler: () => T;\n  onSuccess?: (result: T) => void;\n  onError?: (err: Error) => void;\n}\n\nexport function safeExecute<T>({ handler, onError, onSuccess }: SafeExecuteOptions<T>): void {\n  try {\n    const result = handler();\n    if (isPromiseLike<T>(result)) {\n      result.then(\n        (result) => onSuccess?.(result),\n        (err) => onError?.(err),\n      );\n    } else {\n      onSuccess?.(result);\n    }\n  } catch (e) {\n    onError?.(e);\n  }\n}\n\nexport function asyncExecute<R>(handler: () => R): Promise<R> {\n  return new Promise((onSuccess, onError) => {\n    safeExecute({\n      handler,\n      onSuccess,\n      onError,\n    });\n  });\n}\n\nexport class LazyPromise<R> implements Promise<R> {\n  constructor(protected readonly handler: () => Promise<R>) {}\n\n  readonly [Symbol.toStringTag] = \"Promise\";\n\n  protected async before(): Promise<void> {}\n\n  then<TResult1 = R, TResult2 = never>(\n    onfulfilled?: ((value: R) => PromiseLike<TResult1> | TResult1) | undefined | null,\n    onrejected?: ((reason: any) => PromiseLike<TResult2> | TResult2) | undefined | null,\n  ): Promise<TResult1 | TResult2> {\n    return this.before().then(this.handler).then(onfulfilled).catch(onrejected);\n  }\n\n  catch<TResult = never>(\n    onrejected?: ((reason: any) => PromiseLike<TResult> | TResult) | undefined | null,\n  ): Promise<R | TResult> {\n    return this.before().then(this.handler).then(undefined).catch(onrejected);\n  }\n\n  finally(onfinally?: (() => void) | undefined | null): Promise<R> {\n    return this.before().then(this.handler).finally(onfinally);\n  }\n}\n\nexport async function signalRace<R>(\n  fn: () => Promise<R>,\n  signal?: AbortSignal,\n  onAbort?: () => void,\n): Promise<R> {\n  return new Promise<R>((resolve, reject) => {\n    if (signal?.aborted) {\n      reject(signal.reason);\n      return;\n    }\n\n    const signalFn = () => {\n      onAbort?.();\n      reject(signal?.reason);\n    };\n    signal?.addEventListener?.(\"abort\", signalFn);\n    fn()\n      .then(resolve)\n      .catch(reject)\n      .finally(() => signal?.removeEventListener?.(\"abort\", signalFn));\n  });\n}\n\nexport async function executeSequentially(tasks: (() => Promise<any>)[]): Promise<void> {\n  for (const task of tasks) {\n    await task();\n  }\n}\n\nexport async function* toAsyncGenerator<T>(promise: T): AsyncGenerator<Awaited<T>> {\n  yield await promise;\n}\n"]}
+{"version":3,"sources":["../../../src/internals/helpers/promise.ts"],"names":["isPromiseLike","value","isPromise","isFunction","getProp","arrayFromAsync","generator","limit","Infinity","results","chunk","length","push","emitterToGenerator","fn","queue","emit","data","then","done","catch","error","Promise","resolve","setImmediate","shift","asyncProperties","obj","Object","fromEntries","all","entries","map","key","safeExecute","handler","onError","onSuccess","result","err","e","asyncExecute","LazyPromise","Symbol","toStringTag","before","onfulfilled","onrejected","undefined","finally","onfinally","signalRace","signal","onAbort","reject","aborted","reason","signalFn","addEventListener","removeEventListener","executeSequentially","tasks","task","toAsyncGenerator","promise"],"mappings":";;;;;AAQO,SAASA,cAAiBC,KAAAA,EAAc;AAC7C,EAAA,OAAOC,SAAAA,CAAUD,KAAAA,CAAAA,IAAUE,UAAAA,CAAWC,QAAQH,KAAAA,EAAO;AAAC,IAAA;GAAO,CAAA,CAAA;AAC/D;AAFgBD,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA;AAIhB,eAAsBK,cAAAA,CACpBC,WACAC,KAAAA,EAAc;AAEdA,EAAAA,KAAAA,GAAQA,KAAAA,IAASC,QAAAA;AACjB,EAAA,MAAMC,UAAe,EAAA;AACrB,EAAA,WAAA,MAAiBC,SAASJ,SAAAA,EAAW;AACnC,IAAA,IAAIG,OAAAA,CAAQE,UAAUJ,KAAAA,EAAO;AAC3B,MAAA;AACF;AACAE,IAAAA,OAAAA,CAAQG,KAAKF,KAAAA,CAAAA;AACf;AACA,EAAA,OAAOD,OAAAA;AACT;AAbsBJ,MAAAA,CAAAA,cAAAA,EAAAA,gBAAAA,CAAAA;AAgBtB,gBAAuBQ,mBAAyBC,EAAAA,EAA8B;AAO5E,EAAA,MAAMC,QAAgB,EAAA;AACtB,EAAA,KAAKD,EAAAA,CAAG;IACNE,IAAAA,kBAAM,MAAA,CAAA,CAACC,IAAAA,KAAYF,KAAAA,CAAMH,IAAAA,CAAK;AAAEK,MAAAA;AAAK,KAAA,CAAA,EAA/B,MAAA;AACR,GAAA,CAAA,CACGC,IAAAA,CAAK,MAAMH,KAAAA,CAAMH,IAAAA,CAAK;IAAEO,IAAAA,EAAM;AAAK,GAAA,CAAA,CAAA,CACnCC,KAAAA,CAAM,CAACC,KAAAA,KAAUN,MAAMH,IAAAA,CAAK;AAAES,IAAAA,KAAAA;IAAOF,IAAAA,EAAM;AAAK,GAAA,CAAA,CAAA;AAEnD,EAAA,OAAO,IAAA,EAAM;AACX,IAAA,OAAOJ,KAAAA,CAAMJ,WAAW,CAAA,EAAG;AACzB,MAAA,MAAM,IAAIW,OAAAA,CAAQ,CAACC,OAAAA,KAAYC,YAAAA,CAAaD,OAAAA,CAAAA,CAAAA;AAC9C;AAEA,IAAA,MAAM,EAAEN,IAAAA,EAAME,IAAAA,EAAME,KAAAA,EAAK,GAAKN,MAAMU,KAAAA,EAAK;AACzC,IAAA,IAAIJ,KAAAA,EAAO;AACT,MAAA,MAAMA,KAAAA;AACR;AACA,IAAA,IAAIF,IAAAA,EAAM;AACR,MAAA;AACF;AACA,IAAA,MAAMF,IAAAA;AACR;AACF;AA5BuBJ,MAAAA,CAAAA,kBAAAA,EAAAA,oBAAAA,CAAAA;AA8BvB,eAAsBa,gBACpBC,GAAAA,EAAM;AAEN,EAAA,OAAOC,MAAAA,CAAOC,WAAAA,CACZ,MAAMP,OAAAA,CAAQQ,IAAIF,MAAAA,CAAOG,OAAAA,CAAQJ,GAAAA,CAAAA,CAAKK,GAAAA,CAAI,OAAO,CAACC,GAAAA,EAAKhC,KAAAA,CAAAA,KAAW;AAACgC,IAAAA,GAAAA;IAAK,MAAMhC;AAAM,GAAA,CAAA,CAAA,CAAA;AAExF;AANsByB,MAAAA,CAAAA,eAAAA,EAAAA,iBAAAA,CAAAA;AAcf,SAASQ,WAAAA,CAAe,EAAEC,OAAAA,EAASC,OAAAA,EAASC,WAAS,EAAyB;AACnF,EAAA,IAAI;AACF,IAAA,MAAMC,SAASH,OAAAA,EAAAA;AACf,IAAA,IAAInC,aAAAA,CAAiBsC,MAAAA,CAAAA,EAAS;AAC5BA,MAAAA,MAAAA,CAAOpB,IAAAA,CACL,CAACoB,OAAAA,KAAWD,SAAAA,GAAYC,OAAAA,GACxB,CAACC,GAAAA,KAAQH,OAAAA,GAAUG,GAAAA,CAAAA,CAAAA;KAEvB,MAAO;AACLF,MAAAA,SAAAA,GAAYC,MAAAA,CAAAA;AACd;AACF,GAAA,CAAA,OAASE,CAAAA,EAAG;AACVJ,IAAAA,OAAAA,GAAUI,CAAAA,CAAAA;AACZ;AACF;AAdgBN,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAgBT,SAASO,aAAgBN,OAAAA,EAAgB;AAC9C,EAAA,OAAO,IAAIb,OAAAA,CAAQ,CAACe,SAAAA,EAAWD,OAAAA,KAAAA;AAC7BF,IAAAA,WAAAA,CAAY;AACVC,MAAAA,OAAAA;AACAE,MAAAA,SAAAA;AACAD,MAAAA;KACF,CAAA;GACF,CAAA;AACF;AARgBK,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAUT,MAAMC,WAAAA,CAAAA;EAlGb;;;;AAmGE,EAAA,WAAA,CAA+BP,OAAAA,EAA2B;SAA3BA,OAAAA,GAAAA,OAAAA;AAA4B;EAElD,CAACQ,MAAAA,CAAOC,WAAW,IAAI,SAAA;AAEhC,EAAA,MAAgBC,MAAAA,GAAwB;AAAC;AAEzC3B,EAAAA,IAAAA,CACE4B,aACAC,UAAAA,EAC8B;AAC9B,IAAA,OAAO,IAAA,CAAKF,MAAAA,EAAM,CAAG3B,IAAAA,CAAK,IAAA,CAAKiB,OAAO,CAAA,CAAEjB,IAAAA,CAAK4B,WAAAA,CAAAA,CAAa1B,KAAAA,CAAM2B,UAAAA,CAAAA;AAClE;AAEA3B,EAAAA,KAAAA,CACE2B,UAAAA,EACsB;AACtB,IAAA,OAAO,IAAA,CAAKF,MAAAA,EAAM,CAAG3B,IAAAA,CAAK,IAAA,CAAKiB,OAAO,CAAA,CAAEjB,IAAAA,CAAK8B,MAAAA,CAAAA,CAAW5B,KAAAA,CAAM2B,UAAAA,CAAAA;AAChE;AAEAE,EAAAA,OAAAA,CAAQC,SAAAA,EAAyD;AAC/D,IAAA,OAAO,IAAA,CAAKL,QAAM,CAAG3B,IAAAA,CAAK,KAAKiB,OAAO,CAAA,CAAEc,QAAQC,SAAAA,CAAAA;AAClD;AACF;AAEA,eAAsBC,UAAAA,CACpBrC,EAAAA,EACAsC,MAAAA,EACAC,OAAAA,EAAoB;AAEpB,EAAA,OAAO,IAAI/B,OAAAA,CAAW,CAACC,OAAAA,EAAS+B,MAAAA,KAAAA;AAC9B,IAAA,IAAIF,QAAQG,OAAAA,EAAS;AACnBD,MAAAA,MAAAA,CAAOF,OAAOI,MAAM,CAAA;AACpB,MAAA;AACF;AAEA,IAAA,MAAMC,2BAAW,MAAA,CAAA,MAAA;AACfJ,MAAAA,OAAAA,IAAAA;AACAC,MAAAA,MAAAA,CAAOF,QAAQI,MAAAA,CAAAA;KACjB,EAHiB,UAAA,CAAA;AAIjBJ,IAAAA,MAAAA,EAAQM,gBAAAA,GAAmB,SAASD,QAAAA,CAAAA;AACpC3C,IAAAA,EAAAA,EAAAA,CACGI,IAAAA,CAAKK,OAAAA,CAAAA,CACLH,KAAAA,CAAMkC,MAAAA,CAAAA,CACNL,OAAAA,CAAQ,MAAMG,MAAAA,EAAQO,mBAAAA,GAAsB,OAAA,EAASF,QAAAA,CAAAA,CAAAA;GAC1D,CAAA;AACF;AArBsBN,MAAAA,CAAAA,UAAAA,EAAAA,YAAAA,CAAAA;AAuBtB,eAAsBS,oBAAoBC,KAAAA,EAA6B;AACrE,EAAA,KAAA,MAAWC,QAAQD,KAAAA,EAAO;AACxB,IAAA,MAAMC,IAAAA,EAAAA;AACR;AACF;AAJsBF,MAAAA,CAAAA,mBAAAA,EAAAA,qBAAAA,CAAAA;AAMtB,gBAAuBG,iBAAoBC,OAAAA,EAAU;AACnD,EAAA,MAAM,MAAMA,OAAAA;AACd;AAFuBD,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA","file":"promise.js","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n * SPDX-License-Identifier: Apache-2.0\n */\n\nimport { isFunction, isPromise } from \"remeda\";\nimport { getProp } from \"@/internals/helpers/object.js\";\n\nexport function isPromiseLike<T>(value: unknown): value is PromiseLike<T> {\n  return isPromise(value) || isFunction(getProp(value, [\"then\"]));\n}\n\nexport async function arrayFromAsync<A, B>(\n  generator: AsyncGenerator<A, B> | AsyncIterableIterator<A> | AsyncIterable<A>,\n  limit?: number,\n) {\n  limit = limit ?? Infinity;\n  const results: A[] = [];\n  for await (const chunk of generator) {\n    if (results.length >= limit) {\n      break;\n    }\n    results.push(chunk);\n  }\n  return results;\n}\n\nexport type EmitterToGeneratorFn<T, R> = (data: { emit: (data: T) => void }) => Promise<R>;\nexport async function* emitterToGenerator<T, R>(fn: EmitterToGeneratorFn<T, R>) {\n  interface Data {\n    data?: T;\n    error?: Error;\n    done?: boolean;\n  }\n\n  const queue: Data[] = [];\n  void fn({\n    emit: (data: T) => queue.push({ data }),\n  })\n    .then(() => queue.push({ done: true }))\n    .catch((error) => queue.push({ error, done: true }));\n\n  while (true) {\n    while (queue.length === 0) {\n      await new Promise((resolve) => setImmediate(resolve));\n    }\n\n    const { data, done, error } = queue.shift()!;\n    if (error) {\n      throw error;\n    }\n    if (done) {\n      break;\n    }\n    yield data!;\n  }\n}\n\nexport async function asyncProperties<T extends NonNullable<unknown>>(\n  obj: T,\n): Promise<{ [K in keyof T]: Awaited<T[K]> }> {\n  return Object.fromEntries(\n    await Promise.all(Object.entries(obj).map(async ([key, value]) => [key, await value])),\n  );\n}\n\ninterface SafeExecuteOptions<T> {\n  handler: () => T;\n  onSuccess?: (result: T) => void;\n  onError?: (err: Error) => void;\n}\n\nexport function safeExecute<T>({ handler, onError, onSuccess }: SafeExecuteOptions<T>): void {\n  try {\n    const result = handler();\n    if (isPromiseLike<T>(result)) {\n      result.then(\n        (result) => onSuccess?.(result),\n        (err) => onError?.(err),\n      );\n    } else {\n      onSuccess?.(result);\n    }\n  } catch (e) {\n    onError?.(e);\n  }\n}\n\nexport function asyncExecute<R>(handler: () => R): Promise<R> {\n  return new Promise((onSuccess, onError) => {\n    safeExecute({\n      handler,\n      onSuccess,\n      onError,\n    });\n  });\n}\n\nexport class LazyPromise<R> implements Promise<R> {\n  constructor(protected readonly handler: () => Promise<R>) {}\n\n  readonly [Symbol.toStringTag] = \"Promise\";\n\n  protected async before(): Promise<void> {}\n\n  then<TResult1 = R, TResult2 = never>(\n    onfulfilled?: ((value: R) => PromiseLike<TResult1> | TResult1) | undefined | null,\n    onrejected?: ((reason: any) => PromiseLike<TResult2> | TResult2) | undefined | null,\n  ): Promise<TResult1 | TResult2> {\n    return this.before().then(this.handler).then(onfulfilled).catch(onrejected);\n  }\n\n  catch<TResult = never>(\n    onrejected?: ((reason: any) => PromiseLike<TResult> | TResult) | undefined | null,\n  ): Promise<R | TResult> {\n    return this.before().then(this.handler).then(undefined).catch(onrejected);\n  }\n\n  finally(onfinally?: (() => void) | undefined | null): Promise<R> {\n    return this.before().then(this.handler).finally(onfinally);\n  }\n}\n\nexport async function signalRace<R>(\n  fn: () => Promise<R>,\n  signal?: AbortSignal,\n  onAbort?: () => void,\n): Promise<R> {\n  return new Promise<R>((resolve, reject) => {\n    if (signal?.aborted) {\n      reject(signal.reason);\n      return;\n    }\n\n    const signalFn = () => {\n      onAbort?.();\n      reject(signal?.reason);\n    };\n    signal?.addEventListener?.(\"abort\", signalFn);\n    fn()\n      .then(resolve)\n      .catch(reject)\n      .finally(() => signal?.removeEventListener?.(\"abort\", signalFn));\n  });\n}\n\nexport async function executeSequentially(tasks: (() => Promise<any>)[]): Promise<void> {\n  for (const task of tasks) {\n    await task();\n  }\n}\n\nexport async function* toAsyncGenerator<T>(promise: T): AsyncGenerator<Awaited<T>> {\n  yield await promise;\n}\n"]}

package/dist/internals/helpers/prototype.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["prototype.ts"],"names":["traversePrototypeChain","value","excluded","node","undefined","Object","getPrototypeOf","has","isDirectInstanceOf","object","constructor","R","isTruthy","prototype","findDescriptor","target","property","descriptor","getOwnPropertyDescriptor"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAmBO,UAAUA,sBAAAA,CAAuBC,OAAgBC,QAAmB,EAAA;AACzE,EAAA,IAAIC,IAAOF,GAAAA,KAAAA;AACX,EAAOE,OAAAA,IAAAA,KAAS,IAAQA,IAAAA,IAAAA,KAASC,MAAW,EAAA;AAC1CD,IAAOE,IAAAA,GAAAA,MAAAA,CAAOC,eAAeH,IAAAA,CAAAA;AAC7B,IAAA,IAAI,CAACD,QAAAA,EAAUK,GAAMJ,GAAAA,IAAAA,CAAO,EAAA;AAC1B,MAAMA,MAAAA,IAAAA;AACR;AACF;AACF;AARiBH,MAAAA,CAAAA,sBAAAA,EAAAA,wBAAAA,CAAAA;AAUV,SAASQ,kBAAAA,CACdC,QACAC,WAAgC,EAAA;AAEhC,EAAOC,OAAAA,YAAAA,CAAEC,SAASH,MAAAA,CAAAA,IAAWJ,OAAOC,cAAeG,CAAAA,MAAAA,MAAYC,WAAYG,CAAAA,SAAAA;AAC7E;AALgBL,MAAAA,CAAAA,kBAAAA,EAAAA,oBAAAA,CAAAA;AAOT,SAASM,cAAAA,CACdC,QACAC,QAAiB,EAAA;AAEjB,EAAWb,KAAAA,MAAAA,IAAAA,IAAQH,sBAAuBe,CAAAA,MAAAA,CAAS,EAAA;AACjD,IAAA,MAAME,UAAaZ,GAAAA,MAAAA,CAAOa,wBAAyBf,CAAAA,IAAAA,EAAMa,QAAAA,CAAAA;AACzD,IAAA,IAAIC,UAAY,EAAA;AACd,MAAOA,OAAAA,UAAAA;AACT;AACF;AACA,EAAO,OAAA,IAAA;AACT;AAXgBH,MAAAA,CAAAA,cAAAA,EAAAA,gBAAAA,CAAAA","file":"prototype.cjs","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ClassConstructor } from \"@/internals/types.js\";\nimport * as R from \"remeda\";\n\nexport function* traversePrototypeChain(value: unknown, excluded?: Set<any>) {\n  let node = value;\n  while (node !== null && node !== undefined) {\n    node = Object.getPrototypeOf(node);\n    if (!excluded?.has?.(node)) {\n      yield node;\n    }\n  }\n}\n\nexport function isDirectInstanceOf<A>(\n  object: unknown,\n  constructor: ClassConstructor<A>,\n): object is A {\n  return R.isTruthy(object) && Object.getPrototypeOf(object) === constructor.prototype;\n}\n\nexport function findDescriptor<T extends NonNullable<unknown>>(\n  target: T,\n  property: keyof T,\n): PropertyDescriptor | null {\n  for (const node of traversePrototypeChain(target)) {\n    const descriptor = Object.getOwnPropertyDescriptor(node, property);\n    if (descriptor) {\n      return descriptor;\n    }\n  }\n  return null;\n}\n"]}
+{"version":3,"sources":["../../../src/internals/helpers/prototype.ts"],"names":["traversePrototypeChain","value","excluded","node","undefined","Object","getPrototypeOf","has","isDirectInstanceOf","object","constructor","R","isTruthy","prototype","findDescriptor","target","property","descriptor","getOwnPropertyDescriptor"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAQO,UAAUA,sBAAAA,CAAuBC,OAAgBC,QAAAA,EAAmB;AACzE,EAAA,IAAIC,IAAAA,GAAOF,KAAAA;AACX,EAAA,OAAOE,IAAAA,KAAS,IAAA,IAAQA,IAAAA,KAASC,MAAAA,EAAW;AAC1CD,IAAAA,IAAAA,GAAOE,MAAAA,CAAOC,eAAeH,IAAAA,CAAAA;AAC7B,IAAA,IAAI,CAACD,QAAAA,EAAUK,GAAAA,GAAMJ,IAAAA,CAAAA,EAAO;AAC1B,MAAA,MAAMA,IAAAA;AACR;AACF;AACF;AARiBH,MAAAA,CAAAA,sBAAAA,EAAAA,wBAAAA,CAAAA;AAUV,SAASQ,kBAAAA,CACdC,QACAC,WAAAA,EAAgC;AAEhC,EAAA,OAAOC,YAAAA,CAAEC,SAASH,MAAAA,CAAAA,IAAWJ,OAAOC,cAAAA,CAAeG,MAAAA,MAAYC,WAAAA,CAAYG,SAAAA;AAC7E;AALgBL,MAAAA,CAAAA,kBAAAA,EAAAA,oBAAAA,CAAAA;AAOT,SAASM,cAAAA,CACdC,QACAC,QAAAA,EAAiB;AAEjB,EAAA,KAAA,MAAWb,IAAAA,IAAQH,sBAAAA,CAAuBe,MAAAA,CAAAA,EAAS;AACjD,IAAA,MAAME,UAAAA,GAAaZ,MAAAA,CAAOa,wBAAAA,CAAyBf,IAAAA,EAAMa,QAAAA,CAAAA;AACzD,IAAA,IAAIC,UAAAA,EAAY;AACd,MAAA,OAAOA,UAAAA;AACT;AACF;AACA,EAAA,OAAO,IAAA;AACT;AAXgBH,MAAAA,CAAAA,cAAAA,EAAAA,gBAAAA,CAAAA","file":"prototype.cjs","sourcesContent":["/**\n * Copyright 2025 © BeeAI a Series of LF Projects, LLC\n * SPDX-License-Identifier: Apache-2.0\n */\n\nimport { ClassConstructor } from \"@/internals/types.js\";\nimport * as R from \"remeda\";\n\nexport function* traversePrototypeChain(value: unknown, excluded?: Set<any>) {\n  let node = value;\n  while (node !== null && node !== undefined) {\n    node = Object.getPrototypeOf(node);\n    if (!excluded?.has?.(node)) {\n      yield node;\n    }\n  }\n}\n\nexport function isDirectInstanceOf<A>(\n  object: unknown,\n  constructor: ClassConstructor<A>,\n): object is A {\n  return R.isTruthy(object) && Object.getPrototypeOf(object) === constructor.prototype;\n}\n\nexport function findDescriptor<T extends NonNullable<unknown>>(\n  target: T,\n  property: keyof T,\n): PropertyDescriptor | null {\n  for (const node of traversePrototypeChain(target)) {\n    const descriptor = Object.getOwnPropertyDescriptor(node, property);\n    if (descriptor) {\n      return descriptor;\n    }\n  }\n  return null;\n}\n"]}

package/dist/internals/helpers/prototype.d.cts

@@ -3,18 +3,7 @@ import './guards.cjs';
 
 /**
  * Copyright 2025 © BeeAI a Series of LF Projects, LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
+ * SPDX-License-Identifier: Apache-2.0
  */
 
 declare function traversePrototypeChain(value: unknown, excluded?: Set<any>): Generator<unknown, void, unknown>;