beeai-framework 0.1.2

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

@@ -0,0 +1 @@
+{"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":";;;;;;;;;;;;;;;;;;;;;;;;;;;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,KAAS,CAAA,EAAA;AAE7B,EAAA,IAAId,KAAavB,GAAAA,MAAAA;AACjB,EAAA,IAAI,CAACuB,KAAO,EAAA;AACV,IAAOc,OAAAA,KAAAA,CAAAA;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,KAAaO,CAAAA,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 IBM Corp.\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"]}

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

@@ -0,0 +1,35 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * 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.
+ */
+type Override<T, T2 extends Partial<T>> = {
+    [K in keyof T2]: K extends keyof T ? T2[K] : never;
+};
+declare function assignFactory<T extends NonNullable<unknown>, T2 extends Partial<T>>(target: T): (source: NonNullable<Override<T, T2>>) => void;
+declare const assign: <T extends NonNullable<unknown>, T2 extends Partial<T>>(a: T, b: NonNullable<Override<T, T2>>) => void;
+declare const omitEmptyValues: (data: object) => object;
+declare const omitUndefined: (data: object) => object;
+declare function hasProp<T>(target: T | undefined, key: keyof T): key is keyof T;
+declare function hasProps<T>(keys: (keyof T)[]): (target: T | undefined) => boolean;
+declare function setProp(target: unknown, paths: readonly (keyof any)[], value: unknown): void;
+declare function getPropStrict(target: NonNullable<unknown>, path: string): any;
+declare function getProp(target: unknown, paths: readonly (keyof any)[], defaultValue?: any): any;
+declare function deleteProps<T, K extends keyof T>(target: T, keys: readonly K[]): void;
+declare function updateObject<T extends object, L extends object>(old: T, update: L): asserts old is T & L;
+declare function customMerge<T extends NonNullable<unknown>>(results: T[], processors: {
+    [K in keyof T]: (value: T[K], oldValue: T[K]) => T[K];
+}): T;
+declare function mapObj<T extends object>(obj: T): <K extends keyof T, R = T[K]>(fn: (key: K, value: T[K]) => R) => Record<keyof T, R>;
+
+export { type Override, assign, assignFactory, customMerge, deleteProps, getProp, getPropStrict, hasProp, hasProps, mapObj, omitEmptyValues, omitUndefined, setProp, updateObject };

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

@@ -0,0 +1,35 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * 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.
+ */
+type Override<T, T2 extends Partial<T>> = {
+    [K in keyof T2]: K extends keyof T ? T2[K] : never;
+};
+declare function assignFactory<T extends NonNullable<unknown>, T2 extends Partial<T>>(target: T): (source: NonNullable<Override<T, T2>>) => void;
+declare const assign: <T extends NonNullable<unknown>, T2 extends Partial<T>>(a: T, b: NonNullable<Override<T, T2>>) => void;
+declare const omitEmptyValues: (data: object) => object;
+declare const omitUndefined: (data: object) => object;
+declare function hasProp<T>(target: T | undefined, key: keyof T): key is keyof T;
+declare function hasProps<T>(keys: (keyof T)[]): (target: T | undefined) => boolean;
+declare function setProp(target: unknown, paths: readonly (keyof any)[], value: unknown): void;
+declare function getPropStrict(target: NonNullable<unknown>, path: string): any;
+declare function getProp(target: unknown, paths: readonly (keyof any)[], defaultValue?: any): any;
+declare function deleteProps<T, K extends keyof T>(target: T, keys: readonly K[]): void;
+declare function updateObject<T extends object, L extends object>(old: T, update: L): asserts old is T & L;
+declare function customMerge<T extends NonNullable<unknown>>(results: T[], processors: {
+    [K in keyof T]: (value: T[K], oldValue: T[K]) => T[K];
+}): T;
+declare function mapObj<T extends object>(obj: T): <K extends keyof T, R = T[K]>(fn: (key: K, value: T[K]) => R) => Record<keyof T, R>;
+
+export { type Override, assign, assignFactory, customMerge, deleteProps, getProp, getPropStrict, hasProp, hasProps, mapObj, omitEmptyValues, omitUndefined, setProp, updateObject };

package/dist/internals/helpers/object.js

@@ -0,0 +1,108 @@
+import * as R from 'remeda';
+import { FrameworkError } from '../../errors.js';
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function assignFactory(target) {
+  return (source) => {
+    Object.assign(target, source);
+  };
+}
+__name(assignFactory, "assignFactory");
+const assign = /* @__PURE__ */ __name((a, b) => assignFactory(a)(b), "assign");
+const omitEmptyValues = R.pickBy(R.isTruthy);
+const omitUndefined = R.pickBy(R.isDefined);
+function hasProp(target, key) {
+  return Boolean(target) && Object.prototype.hasOwnProperty.call(target, key);
+}
+__name(hasProp, "hasProp");
+function hasProps(keys) {
+  return (target) => keys.every((key) => hasProp(target, key));
+}
+__name(hasProps, "hasProps");
+function setProp(target, paths, value) {
+  for (const entry of paths.entries()) {
+    const [idx, key] = entry;
+    if (!R.isPlainObject(target) && !R.isArray(target)) {
+      throw new TypeError("Only plain objects and arrays are supported!");
+    }
+    const isLast = idx === paths.length - 1;
+    const newValue = isLast ? value : target[key] ?? {};
+    Object.assign(target, {
+      [key]: newValue
+    });
+    target = target[key];
+  }
+}
+__name(setProp, "setProp");
+function getPropStrict(target, path) {
+  if (!target || !(path in target)) {
+    throw new TypeError(`Target does not contain key "${path}"`);
+  }
+  return target[path];
+}
+__name(getPropStrict, "getPropStrict");
+function getProp(target, paths, defaultValue = void 0) {
+  let value = target;
+  if (!value) {
+    return void 0;
+  }
+  for (const key of paths) {
+    if (!hasProp(value, key)) {
+      return defaultValue;
+    }
+    value = value[key];
+  }
+  return value;
+}
+__name(getProp, "getProp");
+function deleteProps(target, keys) {
+  keys.forEach((key) => {
+    delete target[key];
+  });
+}
+__name(deleteProps, "deleteProps");
+function updateObject(old, update) {
+  for (const [key, val] of Object.entries(update)) {
+    const existing = old[key];
+    if (existing !== void 0 && existing !== null) {
+      throw new FrameworkError(`Cannot update object. Key '${key}' already exists and is defined.`, [], {
+        context: {
+          existing,
+          update: val
+        }
+      });
+    }
+    old[key] = val;
+  }
+}
+__name(updateObject, "updateObject");
+function customMerge(results, processors) {
+  if (results.length === 0) {
+    throw new TypeError("Cannot merge content of an empty array!");
+  }
+  const finalResult = {};
+  for (const next of results) {
+    for (const [key, value] of R.entries(next)) {
+      const oldValue = finalResult[key];
+      finalResult[key] = (processors[key] ?? R.takeFirstBy(1))(value, oldValue);
+    }
+  }
+  return finalResult;
+}
+__name(customMerge, "customMerge");
+function mapObj(obj) {
+  return function(fn) {
+    const updated = {};
+    for (const pair of Object.entries(obj)) {
+      const [key, value] = pair;
+      updated[key] = fn(key, value);
+    }
+    return updated;
+  };
+}
+__name(mapObj, "mapObj");
+
+export { assign, assignFactory, customMerge, deleteProps, getProp, getPropStrict, hasProp, hasProps, mapObj, omitEmptyValues, omitUndefined, setProp, updateObject };
+//# sourceMappingURL=object.js.map
+//# sourceMappingURL=object.js.map

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

@@ -0,0 +1 @@
+{"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":";;;;;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,KAAS,CAAA,EAAA;AAE7B,EAAA,IAAId,KAAavB,GAAAA,MAAAA;AACjB,EAAA,IAAI,CAACuB,KAAO,EAAA;AACV,IAAOc,OAAAA,KAAAA,CAAAA;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,KAAaO,CAAAA,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 IBM Corp.\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"]}

package/dist/internals/helpers/paginate.cjs

@@ -0,0 +1,28 @@
+'use strict';
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+async function paginate(input) {
+  const acc = [];
+  let cursor = void 0;
+  while (acc.length < input.size) {
+    const { data, nextCursor } = await input.handler({
+      cursor,
+      limit: input.size - acc.length
+    });
+    acc.push(...data);
+    if (nextCursor === void 0 || data.length === 0) {
+      break;
+    }
+    cursor = nextCursor;
+  }
+  if (acc.length > input.size) {
+    acc.length = input.size;
+  }
+  return acc;
+}
+__name(paginate, "paginate");
+
+exports.paginate = paginate;
+//# sourceMappingURL=paginate.cjs.map
+//# sourceMappingURL=paginate.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/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,KAAAA,CAAAA;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,KAAAA,CAAAA,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 IBM Corp.\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"]}

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

@@ -0,0 +1,28 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * 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.
+ */
+interface PaginateInput<T, C> {
+    size: number;
+    handler: (data: {
+        cursor?: C;
+        limit: number;
+    }) => Promise<{
+        data: T[];
+        nextCursor?: C;
+    }>;
+}
+declare function paginate<T, C = number>(input: PaginateInput<T, C>): Promise<T[]>;
+
+export { type PaginateInput, paginate };

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

@@ -0,0 +1,28 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * 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.
+ */
+interface PaginateInput<T, C> {
+    size: number;
+    handler: (data: {
+        cursor?: C;
+        limit: number;
+    }) => Promise<{
+        data: T[];
+        nextCursor?: C;
+    }>;
+}
+declare function paginate<T, C = number>(input: PaginateInput<T, C>): Promise<T[]>;
+
+export { type PaginateInput, paginate };

package/dist/internals/helpers/paginate.js

@@ -0,0 +1,26 @@
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+async function paginate(input) {
+  const acc = [];
+  let cursor = void 0;
+  while (acc.length < input.size) {
+    const { data, nextCursor } = await input.handler({
+      cursor,
+      limit: input.size - acc.length
+    });
+    acc.push(...data);
+    if (nextCursor === void 0 || data.length === 0) {
+      break;
+    }
+    cursor = nextCursor;
+  }
+  if (acc.length > input.size) {
+    acc.length = input.size;
+  }
+  return acc;
+}
+__name(paginate, "paginate");
+
+export { paginate };
+//# sourceMappingURL=paginate.js.map
+//# sourceMappingURL=paginate.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/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,KAAAA,CAAAA;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,KAAAA,CAAAA,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 IBM Corp.\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"]}

package/dist/internals/helpers/promise.cjs

@@ -0,0 +1,143 @@
+'use strict';
+
+var remeda = require('remeda');
+var object_cjs = require('./object.cjs');
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function isPromiseLike(value) {
+  return remeda.isPromise(value) || remeda.isFunction(object_cjs.getProp(value, [
+    "then"
+  ]));
+}
+__name(isPromiseLike, "isPromiseLike");
+async function arrayFromAsync(generator, limit) {
+  limit = limit ?? Infinity;
+  const results = [];
+  for await (const chunk of generator) {
+    if (results.length >= limit) {
+      break;
+    }
+    results.push(chunk);
+  }
+  return results;
+}
+__name(arrayFromAsync, "arrayFromAsync");
+async function* emitterToGenerator(fn) {
+  const queue = [];
+  void fn({
+    emit: /* @__PURE__ */ __name((data) => queue.push({
+      data
+    }), "emit")
+  }).then(() => queue.push({
+    done: true
+  })).catch((error) => queue.push({
+    error,
+    done: true
+  }));
+  while (true) {
+    while (queue.length === 0) {
+      await new Promise((resolve) => setImmediate(resolve));
+    }
+    const { data, done, error } = queue.shift();
+    if (error) {
+      throw error;
+    }
+    if (done) {
+      break;
+    }
+    yield data;
+  }
+}
+__name(emitterToGenerator, "emitterToGenerator");
+async function asyncProperties(obj) {
+  return Object.fromEntries(await Promise.all(Object.entries(obj).map(async ([key, value]) => [
+    key,
+    await value
+  ])));
+}
+__name(asyncProperties, "asyncProperties");
+function safeExecute({ handler, onError, onSuccess }) {
+  try {
+    const result = handler();
+    if (isPromiseLike(result)) {
+      result.then((result2) => onSuccess?.(result2), (err) => onError?.(err));
+    } else {
+      onSuccess?.(result);
+    }
+  } catch (e) {
+    onError?.(e);
+  }
+}
+__name(safeExecute, "safeExecute");
+function asyncExecute(handler) {
+  return new Promise((onSuccess, onError) => {
+    safeExecute({
+      handler,
+      onSuccess,
+      onError
+    });
+  });
+}
+__name(asyncExecute, "asyncExecute");
+class LazyPromise {
+  static {
+    __name(this, "LazyPromise");
+  }
+  handler;
+  constructor(handler) {
+    this.handler = handler;
+    this[_Symbol_toStringTag] = "Promise";
+  }
+  [_Symbol_toStringTag = Symbol.toStringTag];
+  async before() {
+  }
+  then(onfulfilled, onrejected) {
+    return this.before().then(this.handler).then(onfulfilled).catch(onrejected);
+  }
+  catch(onrejected) {
+    return this.before().then(this.handler).then(void 0).catch(onrejected);
+  }
+  finally(onfinally) {
+    return this.before().then(this.handler).finally(onfinally);
+  }
+}
+async function signalRace(fn, signal, onAbort) {
+  return new Promise((resolve, reject) => {
+    if (signal?.aborted) {
+      reject(signal.reason);
+      return;
+    }
+    const signalFn = /* @__PURE__ */ __name(() => {
+      onAbort?.();
+      reject(signal?.reason);
+    }, "signalFn");
+    signal?.addEventListener?.("abort", signalFn);
+    fn().then(resolve).catch(reject).finally(() => signal?.removeEventListener?.("abort", signalFn));
+  });
+}
+__name(signalRace, "signalRace");
+async function executeSequentially(tasks) {
+  for (const task of tasks) {
+    await task();
+  }
+}
+__name(executeSequentially, "executeSequentially");
+async function* toAsyncGenerator(promise) {
+  yield await promise;
+}
+__name(toAsyncGenerator, "toAsyncGenerator");
+var _Symbol_toStringTag;
+
+exports.LazyPromise = LazyPromise;
+exports.arrayFromAsync = arrayFromAsync;
+exports.asyncExecute = asyncExecute;
+exports.asyncProperties = asyncProperties;
+exports.emitterToGenerator = emitterToGenerator;
+exports.executeSequentially = executeSequentially;
+exports.isPromiseLike = isPromiseLike;
+exports.safeExecute = safeExecute;
+exports.signalRace = signalRace;
+exports.toAsyncGenerator = toAsyncGenerator;
+//# sourceMappingURL=promise.cjs.map
+//# sourceMappingURL=promise.cjs.map

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

@@ -0,0 +1 @@
+{"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","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,KAAAA,CAAAA,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 IBM Corp.\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"]}

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

@@ -0,0 +1,45 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * 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.
+ */
+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[]>;
+type EmitterToGeneratorFn<T, R> = (data: {
+    emit: (data: T) => void;
+}) => Promise<R>;
+declare function emitterToGenerator<T, R>(fn: EmitterToGeneratorFn<T, R>): AsyncGenerator<Awaited<NonNullable<T>>, void, unknown>;
+declare function asyncProperties<T extends NonNullable<unknown>>(obj: T): Promise<{
+    [K in keyof T]: Awaited<T[K]>;
+}>;
+interface SafeExecuteOptions<T> {
+    handler: () => T;
+    onSuccess?: (result: T) => void;
+    onError?: (err: Error) => void;
+}
+declare function safeExecute<T>({ handler, onError, onSuccess }: SafeExecuteOptions<T>): void;
+declare function asyncExecute<R>(handler: () => R): Promise<R>;
+declare class LazyPromise<R> implements Promise<R> {
+    protected readonly handler: () => Promise<R>;
+    constructor(handler: () => Promise<R>);
+    readonly [Symbol.toStringTag] = "Promise";
+    protected before(): Promise<void>;
+    then<TResult1 = R, TResult2 = never>(onfulfilled?: ((value: R) => PromiseLike<TResult1> | TResult1) | undefined | null, onrejected?: ((reason: any) => PromiseLike<TResult2> | TResult2) | undefined | null): Promise<TResult1 | TResult2>;
+    catch<TResult = never>(onrejected?: ((reason: any) => PromiseLike<TResult> | TResult) | undefined | null): Promise<R | TResult>;
+    finally(onfinally?: (() => void) | undefined | null): Promise<R>;
+}
+declare function signalRace<R>(fn: () => Promise<R>, signal?: AbortSignal, onAbort?: () => void): Promise<R>;
+declare function executeSequentially(tasks: (() => Promise<any>)[]): Promise<void>;
+declare function toAsyncGenerator<T>(promise: T): AsyncGenerator<Awaited<T>>;
+
+export { type EmitterToGeneratorFn, LazyPromise, arrayFromAsync, asyncExecute, asyncProperties, emitterToGenerator, executeSequentially, isPromiseLike, safeExecute, signalRace, toAsyncGenerator };

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

@@ -0,0 +1,45 @@
+/**
+ * Copyright 2025 IBM Corp.
+ *
+ * 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.
+ */
+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[]>;
+type EmitterToGeneratorFn<T, R> = (data: {
+    emit: (data: T) => void;
+}) => Promise<R>;
+declare function emitterToGenerator<T, R>(fn: EmitterToGeneratorFn<T, R>): AsyncGenerator<Awaited<NonNullable<T>>, void, unknown>;
+declare function asyncProperties<T extends NonNullable<unknown>>(obj: T): Promise<{
+    [K in keyof T]: Awaited<T[K]>;
+}>;
+interface SafeExecuteOptions<T> {
+    handler: () => T;
+    onSuccess?: (result: T) => void;
+    onError?: (err: Error) => void;
+}
+declare function safeExecute<T>({ handler, onError, onSuccess }: SafeExecuteOptions<T>): void;
+declare function asyncExecute<R>(handler: () => R): Promise<R>;
+declare class LazyPromise<R> implements Promise<R> {
+    protected readonly handler: () => Promise<R>;
+    constructor(handler: () => Promise<R>);
+    readonly [Symbol.toStringTag] = "Promise";
+    protected before(): Promise<void>;
+    then<TResult1 = R, TResult2 = never>(onfulfilled?: ((value: R) => PromiseLike<TResult1> | TResult1) | undefined | null, onrejected?: ((reason: any) => PromiseLike<TResult2> | TResult2) | undefined | null): Promise<TResult1 | TResult2>;
+    catch<TResult = never>(onrejected?: ((reason: any) => PromiseLike<TResult> | TResult) | undefined | null): Promise<R | TResult>;
+    finally(onfinally?: (() => void) | undefined | null): Promise<R>;
+}
+declare function signalRace<R>(fn: () => Promise<R>, signal?: AbortSignal, onAbort?: () => void): Promise<R>;
+declare function executeSequentially(tasks: (() => Promise<any>)[]): Promise<void>;
+declare function toAsyncGenerator<T>(promise: T): AsyncGenerator<Awaited<T>>;
+
+export { type EmitterToGeneratorFn, LazyPromise, arrayFromAsync, asyncExecute, asyncProperties, emitterToGenerator, executeSequentially, isPromiseLike, safeExecute, signalRace, toAsyncGenerator };