beeai-framework 0.1.2

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

@@ -0,0 +1,19 @@
+/**
+ * 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 transformAsyncIterable<A, B, A2>(generator: AsyncGenerator<A, B> | AsyncIterableIterator<A>, transformer: (old: A) => A2): AsyncGenerator<A2, B>;
+declare function isAsyncIterable<T>(value: any): value is AsyncIterable<T>;
+
+export { isAsyncIterable, transformAsyncIterable };

package/dist/internals/helpers/stream.js

@@ -0,0 +1,18 @@
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+async function* transformAsyncIterable(generator, transformer) {
+  let next;
+  while (!(next = await generator.next()).done) {
+    yield transformer(next.value);
+  }
+  return next.value;
+}
+__name(transformAsyncIterable, "transformAsyncIterable");
+function isAsyncIterable(value) {
+  return Boolean(value && Symbol.asyncIterator in value);
+}
+__name(isAsyncIterable, "isAsyncIterable");
+
+export { isAsyncIterable, transformAsyncIterable };
+//# sourceMappingURL=stream.js.map
+//# sourceMappingURL=stream.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/stream.ts"],"names":["transformAsyncIterable","generator","transformer","next","done","value","isAsyncIterable","Boolean","Symbol","asyncIterator"],"mappings":";;AAgBA,gBAAuBA,sBAAAA,CACrBC,WACAC,WAA2B,EAAA;AAE3B,EAAIC,IAAAA,IAAAA;AACJ,EAAA,OAAO,EAAEA,IAAO,GAAA,MAAMF,SAAUE,CAAAA,IAAAA,IAAQC,IAAM,EAAA;AAC5C,IAAMF,MAAAA,WAAAA,CAAYC,KAAKE,KAAK,CAAA;AAC9B;AACA,EAAA,OAAOF,IAAKE,CAAAA,KAAAA;AACd;AATuBL,MAAAA,CAAAA,sBAAAA,EAAAA,wBAAAA,CAAAA;AAWhB,SAASM,gBAAmBD,KAAU,EAAA;AAC3C,EAAA,OAAOE,OAAQF,CAAAA,KAAAA,IAASG,MAAOC,CAAAA,aAAAA,IAAiBJ,KAAAA,CAAAA;AAClD;AAFgBC,MAAAA,CAAAA,eAAAA,EAAAA,iBAAAA,CAAAA","file":"stream.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 async function* transformAsyncIterable<A, B, A2>(\n  generator: AsyncGenerator<A, B> | AsyncIterableIterator<A>,\n  transformer: (old: A) => A2,\n): AsyncGenerator<A2, B> {\n  let next: IteratorResult<A, B>;\n  while (!(next = await generator.next()).done) {\n    yield transformer(next.value);\n  }\n  return next.value;\n}\n\nexport function isAsyncIterable<T>(value: any): value is AsyncIterable<T> {\n  return Boolean(value && Symbol.asyncIterator in value);\n}\n"]}

package/dist/internals/helpers/string.cjs

@@ -0,0 +1,230 @@
+'use strict';
+
+var R = require('remeda');
+var errors_cjs = require('../../errors.cjs');
+
+function _interopNamespace(e) {
+  if (e && e.__esModule) return e;
+  var n = Object.create(null);
+  if (e) {
+    Object.keys(e).forEach(function (k) {
+      if (k !== 'default') {
+        var d = Object.getOwnPropertyDescriptor(e, k);
+        Object.defineProperty(n, k, d.get ? d : {
+          enumerable: true,
+          get: function () { return e[k]; }
+        });
+      }
+    });
+  }
+  n.default = e;
+  return Object.freeze(n);
+}
+
+var R__namespace = /*#__PURE__*/_interopNamespace(R);
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function* splitString(text, options) {
+  yield* recursiveSplitString(text, {
+    ...options,
+    trim: options?.trim ?? false,
+    separators: []
+  });
+}
+__name(splitString, "splitString");
+function* mergeStrings(chunks, sep, options) {
+  const tmpChunks = [];
+  let tmpOverlap = 0;
+  const toDoc = /* @__PURE__ */ __name((parts) => {
+    const text = parts.join(sep);
+    return options.trim ? text.trim() : text;
+  }, "toDoc");
+  for (const chunk of chunks) {
+    if (tmpOverlap + chunk.length + tmpChunks.length * sep.length > options.size) {
+      if (tmpChunks.length > 0) {
+        const doc2 = toDoc(tmpChunks);
+        if (doc2) {
+          yield doc2;
+        }
+        while (tmpOverlap > options.overlap || tmpOverlap + chunk.length + tmpChunks.length * sep.length > options.size && tmpOverlap > 0) {
+          const tmp = tmpChunks.shift();
+          tmpOverlap -= tmp.length;
+        }
+      }
+    }
+    tmpChunks.push(chunk);
+    tmpOverlap += chunk.length;
+  }
+  const doc = toDoc(tmpChunks);
+  if (doc) {
+    yield doc;
+  }
+}
+__name(mergeStrings, "mergeStrings");
+function* recursiveSplitString(text, options) {
+  if (options.size <= 0 || options.overlap < 0) {
+    throw new Error("size must be positive and overlap must be non-negative");
+  }
+  if (options.overlap >= options.size) {
+    throw new Error("overlap must be less than size");
+  }
+  const goodSplits = [];
+  const [separator, ...remainingSeparators] = R.unique([
+    ...options.separators ?? [],
+    ""
+  ]);
+  for (const chunk of text.split(separator).filter(Boolean)) {
+    if (chunk.length < options.size) {
+      goodSplits.push(chunk);
+      continue;
+    }
+    if (goodSplits.length > 0) {
+      yield* mergeStrings(goodSplits, separator, options);
+      goodSplits.length = 0;
+    }
+    if (remainingSeparators.length === 0) {
+      yield chunk;
+    } else {
+      yield* recursiveSplitString(chunk, {
+        ...options,
+        separators: remainingSeparators
+      });
+    }
+  }
+  if (goodSplits.length > 0) {
+    yield* mergeStrings(goodSplits, separator, options);
+  }
+}
+__name(recursiveSplitString, "recursiveSplitString");
+const Comparator = {
+  EQ: [
+    0
+  ],
+  GT: [
+    1
+  ],
+  GTE: [
+    0,
+    1
+  ],
+  LT: [
+    -1
+  ],
+  LTE: [
+    -1,
+    0
+  ]
+};
+function compareVersion(a, comparator, b) {
+  const diff = a.replace("v", "").trim().localeCompare(b.replace("v", "").trim(), void 0, {
+    numeric: true,
+    sensitivity: "base"
+  });
+  const diffNormalized = Math.min(1, Math.max(-1, diff));
+  return R__namespace.isIncludedIn(diffNormalized, comparator);
+}
+__name(compareVersion, "compareVersion");
+function isJsonLikeString(value) {
+  if (!value) {
+    return false;
+  }
+  return value.startsWith("{") && value.endsWith("}");
+}
+__name(isJsonLikeString, "isJsonLikeString");
+function halveString(value, seq, includeSeq = false) {
+  if (seq === "") {
+    return [
+      value
+    ];
+  }
+  const index = value.indexOf(seq);
+  if (index === -1) {
+    return [
+      value
+    ];
+  } else {
+    return [
+      value.slice(0, index),
+      value.slice(index + (includeSeq ? 0 : seq.length))
+    ];
+  }
+}
+__name(halveString, "halveString");
+function countSharedStartEndLetters(a, b) {
+  if (!R.isString(a) || !R.isString(b)) {
+    throw new errors_cjs.ValueError("Provided values must be all strings.");
+  }
+  const minLength = Math.min(a.length, b.length);
+  for (let i = 0; i < minLength; i++) {
+    if (a.at((i + 1) * -1) !== b.at(i)) {
+      return i;
+    }
+  }
+  return minLength;
+}
+__name(countSharedStartEndLetters, "countSharedStartEndLetters");
+function findFirstPair(text, pair, options = {}) {
+  const [opening, closing] = pair || [];
+  if (!pair || !opening || !closing) {
+    throw new errors_cjs.ValueError(`The "pair" parameter is required and must be non-empty!`);
+  }
+  let balance = 0;
+  let startIndex = -1;
+  const pairOverlap = options.allowOverlap ? countSharedStartEndLetters(opening, closing) : 0;
+  const isSame = opening === closing;
+  for (let index = 0; index < text.length; index++) {
+    if (text.substring(index, index + opening.length) === opening && (!isSame || balance === 0)) {
+      if (balance === 0) {
+        startIndex = index;
+      }
+      balance++;
+      if (!options.allowOverlap) {
+        index += opening.length - 1;
+      }
+    } else if (text.substring(index, index + closing.length) === closing) {
+      if (balance > 0) {
+        balance--;
+        if (balance === 0) {
+          const inner = {
+            start: startIndex + opening.length,
+            get end() {
+              let innerEnd = index;
+              const innerSize = innerEnd - this.start;
+              if (innerSize < 0) {
+                innerEnd = this.start;
+              } else {
+                innerEnd += pairOverlap;
+              }
+              return innerEnd;
+            }
+          };
+          return {
+            start: startIndex,
+            end: index + closing.length,
+            pair,
+            inner: text.substring(inner.start, inner.end),
+            outer: text.substring(startIndex, index + closing.length)
+          };
+        }
+      }
+      if (!options.allowOverlap) {
+        index += closing.length - 1;
+      }
+    }
+  }
+  return null;
+}
+__name(findFirstPair, "findFirstPair");
+
+exports.Comparator = Comparator;
+exports.compareVersion = compareVersion;
+exports.countSharedStartEndLetters = countSharedStartEndLetters;
+exports.findFirstPair = findFirstPair;
+exports.halveString = halveString;
+exports.isJsonLikeString = isJsonLikeString;
+exports.mergeStrings = mergeStrings;
+exports.recursiveSplitString = recursiveSplitString;
+exports.splitString = splitString;
+//# sourceMappingURL=string.cjs.map
+//# sourceMappingURL=string.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/string.ts"],"names":["splitString","text","options","recursiveSplitString","trim","separators","mergeStrings","chunks","sep","tmpChunks","tmpOverlap","toDoc","parts","join","chunk","length","size","doc","overlap","tmp","shift","push","Error","goodSplits","separator","remainingSeparators","unique","split","filter","Boolean","Comparator","EQ","GT","GTE","LT","LTE","compareVersion","a","comparator","b","diff","replace","localeCompare","undefined","numeric","sensitivity","diffNormalized","Math","min","max","R","isIncludedIn","isJsonLikeString","value","startsWith","endsWith","halveString","seq","includeSeq","index","indexOf","slice","countSharedStartEndLetters","isString","ValueError","minLength","i","at","findFirstPair","pair","opening","closing","balance","startIndex","pairOverlap","allowOverlap","isSame","substring","inner","start","end","innerEnd","innerSize","outer"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAqBO,UAAUA,WAAAA,CACfC,MACAC,OAA0D,EAAA;AAE1D,EAAA,OAAOC,qBAAqBF,IAAM,EAAA;IAAE,GAAGC,OAAAA;AAASE,IAAAA,IAAAA,EAAMF,SAASE,IAAQ,IAAA,KAAA;AAAOC,IAAAA,UAAAA,EAAY;GAAG,CAAA;AAC/F;AALiBL,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAOV,UAAUM,YAAAA,CACfC,MACAC,EAAAA,GAAAA,EACAN,OAA0D,EAAA;AAE1D,EAAA,MAAMO,YAAsB,EAAA;AAC5B,EAAA,IAAIC,UAAa,GAAA,CAAA;AAEjB,EAAMC,MAAAA,KAAAA,2BAASC,KAAAA,KAAAA;AACb,IAAMX,MAAAA,IAAAA,GAAOW,KAAMC,CAAAA,IAAAA,CAAKL,GAAAA,CAAAA;AACxB,IAAA,OAAON,OAAQE,CAAAA,IAAAA,GAAOH,IAAKG,CAAAA,IAAAA,EAASH,GAAAA,IAAAA;GAFxB,EAAA,OAAA,CAAA;AAKd,EAAA,KAAA,MAAWa,SAASP,MAAQ,EAAA;AAC1B,IAAIG,IAAAA,UAAAA,GAAaI,MAAMC,MAASN,GAAAA,SAAAA,CAAUM,SAASP,GAAIO,CAAAA,MAAAA,GAASb,QAAQc,IAAM,EAAA;AAC5E,MAAIP,IAAAA,SAAAA,CAAUM,SAAS,CAAG,EAAA;AACxB,QAAME,MAAAA,IAAAA,GAAMN,MAAMF,SAAAA,CAAAA;AAClB,QAAA,IAAIQ,IAAK,EAAA;AACP,UAAMA,MAAAA,IAAAA;AACR;AAEA,QAAA,OACEP,UAAaR,GAAAA,OAAAA,CAAQgB,OACpBR,IAAAA,UAAAA,GAAaI,KAAMC,CAAAA,MAAAA,GAASN,SAAUM,CAAAA,MAAAA,GAASP,GAAIO,CAAAA,MAAAA,GAASb,OAAQc,CAAAA,IAAAA,IACnEN,aAAa,CACf,EAAA;AACA,UAAMS,MAAAA,GAAAA,GAAMV,UAAUW,KAAK,EAAA;AAC3BV,UAAAA,UAAAA,IAAcS,GAAIJ,CAAAA,MAAAA;AACpB;AACF;AACF;AACAN,IAAAA,SAAAA,CAAUY,KAAKP,KAAAA,CAAAA;AACfJ,IAAAA,UAAAA,IAAcI,KAAMC,CAAAA,MAAAA;AACtB;AAEA,EAAME,MAAAA,GAAAA,GAAMN,MAAMF,SAAAA,CAAAA;AAClB,EAAA,IAAIQ,GAAK,EAAA;AACP,IAAMA,MAAAA,GAAAA;AACR;AACF;AAvCiBX,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAyCV,UAAUH,oBAAAA,CACfF,MACAC,OAAgF,EAAA;AAEhF,EAAA,IAAIA,OAAQc,CAAAA,IAAAA,IAAQ,CAAKd,IAAAA,OAAAA,CAAQgB,UAAU,CAAG,EAAA;AAC5C,IAAM,MAAA,IAAII,MAAM,wDAAA,CAAA;AAClB;AACA,EAAIpB,IAAAA,OAAAA,CAAQgB,OAAWhB,IAAAA,OAAAA,CAAQc,IAAM,EAAA;AACnC,IAAM,MAAA,IAAIM,MAAM,gCAAA,CAAA;AAClB;AAEA,EAAA,MAAMC,aAAuB,EAAA;AAC7B,EAAA,MAAM,CAACC,SAAAA,EAAW,GAAGC,mBAAAA,IAAuBC,QAAO,CAAA;AAAKxB,IAAAA,GAAAA,OAAAA,CAAQG,cAAc,EAAA;AAAK,IAAA;AAAG,GAAA,CAAA;AAEtF,EAAA,KAAA,MAAWS,SAASb,IAAK0B,CAAAA,KAAAA,CAAMH,SAAAA,CAAWI,CAAAA,MAAAA,CAAOC,OAAAA,CAAU,EAAA;AACzD,IAAIf,IAAAA,KAAAA,CAAMC,MAASb,GAAAA,OAAAA,CAAQc,IAAM,EAAA;AAC/BO,MAAAA,UAAAA,CAAWF,KAAKP,KAAAA,CAAAA;AAChB,MAAA;AACF;AAEA,IAAIS,IAAAA,UAAAA,CAAWR,SAAS,CAAG,EAAA;AACzB,MAAOT,OAAAA,YAAAA,CAAaiB,UAAYC,EAAAA,SAAAA,EAAWtB,OAAAA,CAAAA;AAC3CqB,MAAAA,UAAAA,CAAWR,MAAS,GAAA,CAAA;AACtB;AAEA,IAAIU,IAAAA,mBAAAA,CAAoBV,WAAW,CAAG,EAAA;AACpC,MAAMD,MAAAA,KAAAA;KACD,MAAA;AACL,MAAA,OAAOX,qBAAqBW,KAAO,EAAA;QAAE,GAAGZ,OAAAA;QAASG,UAAYoB,EAAAA;OAAoB,CAAA;AACnF;AACF;AAEA,EAAIF,IAAAA,UAAAA,CAAWR,SAAS,CAAG,EAAA;AACzB,IAAOT,OAAAA,YAAAA,CAAaiB,UAAYC,EAAAA,SAAAA,EAAWtB,OAAAA,CAAAA;AAC7C;AACF;AAnCiBC,MAAAA,CAAAA,oBAAAA,EAAAA,sBAAAA,CAAAA;AAqCV,MAAM2B,UAAa,GAAA;EACxBC,EAAI,EAAA;AAAC,IAAA;;EACLC,EAAI,EAAA;AAAC,IAAA;;EACLC,GAAK,EAAA;AAAC,IAAA,CAAA;AAAG,IAAA;;EACTC,EAAI,EAAA;AAAC,IAAA,CAAA;;EACLC,GAAK,EAAA;AAAC,IAAA,CAAA,CAAA;AAAI,IAAA;;AACZ;AAEO,SAASC,cAAAA,CACdC,CACAC,EAAAA,UAAAA,EACAC,CAAS,EAAA;AAET,EAAA,MAAMC,OAAOH,CAAEI,CAAAA,OAAAA,CAAQ,GAAK,EAAA,EAAA,EAAIrC,IAAI,EAAA,CAAGsC,aAAcH,CAAAA,CAAAA,CAAEE,QAAQ,GAAK,EAAA,EAAA,CAAIrC,CAAAA,IAAAA,IAAQuC,KAAW,CAAA,EAAA;IACzFC,OAAS,EAAA,IAAA;IACTC,WAAa,EAAA;GACf,CAAA;AACA,EAAMC,MAAAA,cAAAA,GAAiBC,KAAKC,GAAI,CAAA,CAAA,EAAGD,KAAKE,GAAI,CAAA,CAAA,CAAA,EAAIT,IAAAA,CAAAA,CAAAA;AAChD,EAAOU,OAAAA,YAAAA,CAAEC,YAAaL,CAAAA,cAAAA,EAAgBR,UAAAA,CAAAA;AACxC;AAXgBF,MAAAA,CAAAA,cAAAA,EAAAA,gBAAAA,CAAAA;AAaT,SAASgB,iBAAiBC,KAAyB,EAAA;AACxD,EAAA,IAAI,CAACA,KAAO,EAAA;AACV,IAAO,OAAA,KAAA;AACT;AACA,EAAA,OAAOA,MAAMC,UAAW,CAAA,GAAA,CAAQD,IAAAA,KAAAA,CAAME,SAAS,GAAA,CAAA;AACjD;AALgBH,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA;AAOT,SAASI,WACdH,CAAAA,KAAAA,EACAI,GACAC,EAAAA,UAAAA,GAAa,KAAK,EAAA;AAElB,EAAA,IAAID,QAAQ,EAAI,EAAA;AACd,IAAO,OAAA;AAACJ,MAAAA;;AACV;AAEA,EAAMM,MAAAA,KAAAA,GAAQN,KAAMO,CAAAA,OAAAA,CAAQH,GAAAA,CAAAA;AAC5B,EAAA,IAAIE,UAAU,CAAI,CAAA,EAAA;AAChB,IAAO,OAAA;AAACN,MAAAA;;GACH,MAAA;AACL,IAAO,OAAA;MAACA,KAAMQ,CAAAA,KAAAA,CAAM,GAAGF,KAAAA,CAAAA;AAAQN,MAAAA,KAAAA,CAAMQ,KAAMF,CAAAA,KAAAA,IAASD,UAAa,GAAA,CAAA,GAAID,IAAI1C,MAAK,CAAA;;AAChF;AACF;AAfgByC,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAiBT,SAASM,0BAAAA,CAA2BzB,GAAWE,CAAS,EAAA;AAC7D,EAAA,IAAI,CAACwB,UAAS1B,CAAAA,CAAAA,KAAM,CAAC0B,UAAAA,CAASxB,CAAAA,CAAI,EAAA;AAChC,IAAM,MAAA,IAAIyB,sBAAW,sCAAA,CAAA;AACvB;AAEA,EAAA,MAAMC,YAAYlB,IAAKC,CAAAA,GAAAA,CAAIX,CAAEtB,CAAAA,MAAAA,EAAQwB,EAAExB,MAAM,CAAA;AAC7C,EAAA,KAAA,IAASmD,CAAI,GAAA,CAAA,EAAGA,CAAID,GAAAA,SAAAA,EAAWC,CAAK,EAAA,EAAA;AAClC,IAAI7B,IAAAA,CAAAA,CAAE8B,IAAID,CAAI,GAAA,CAAA,IAAK,EAAC,CAAO3B,KAAAA,CAAAA,CAAE4B,EAAGD,CAAAA,CAAAA,CAAI,EAAA;AAClC,MAAOA,OAAAA,CAAAA;AACT;AACF;AACA,EAAOD,OAAAA,SAAAA;AACT;AAZgBH,MAAAA,CAAAA,0BAAAA,EAAAA,4BAAAA,CAAAA;AAcT,SAASM,aACdnE,CAAAA,IAAAA,EACAoE,IACAnE,EAAAA,OAAAA,GAAsC,EAAE,EAAA;AAExC,EAAA,MAAM,CAACoE,OAAAA,EAASC,OAAAA,CAAAA,GAAWF,QAAQ,EAAA;AACnC,EAAA,IAAI,CAACA,IAAAA,IAAQ,CAACC,OAAAA,IAAW,CAACC,OAAS,EAAA;AACjC,IAAM,MAAA,IAAIP,sBAAW,CAAyD,uDAAA,CAAA,CAAA;AAChF;AAEA,EAAA,IAAIQ,OAAU,GAAA,CAAA;AACd,EAAA,IAAIC,UAAa,GAAA,CAAA,CAAA;AACjB,EAAA,MAAMC,cAAcxE,OAAQyE,CAAAA,YAAAA,GAAeb,0BAA2BQ,CAAAA,OAAAA,EAASC,OAAAA,CAAW,GAAA,CAAA;AAE1F,EAAA,MAAMK,SAASN,OAAYC,KAAAA,OAAAA;AAC3B,EAAA,KAAA,IAASZ,KAAQ,GAAA,CAAA,EAAGA,KAAQ1D,GAAAA,IAAAA,CAAKc,QAAQ4C,KAAS,EAAA,EAAA;AAChD,IAAI1D,IAAAA,IAAAA,CAAK4E,SAAUlB,CAAAA,KAAAA,EAAOA,KAAQW,GAAAA,OAAAA,CAAQvD,MAAM,CAAA,KAAMuD,OAAY,KAAA,CAACM,MAAUJ,IAAAA,OAAAA,KAAY,CAAI,CAAA,EAAA;AAC3F,MAAA,IAAIA,YAAY,CAAG,EAAA;AACjBC,QAAad,UAAAA,GAAAA,KAAAA;AACf;AACAa,MAAAA,OAAAA,EAAAA;AACA,MAAI,IAAA,CAACtE,QAAQyE,YAAc,EAAA;AACzBhB,QAAAA,KAAAA,IAASW,QAAQvD,MAAS,GAAA,CAAA;AAC5B;AACF,KAAA,MAAA,IAAWd,KAAK4E,SAAUlB,CAAAA,KAAAA,EAAOA,QAAQY,OAAQxD,CAAAA,MAAM,MAAMwD,OAAS,EAAA;AACpE,MAAA,IAAIC,UAAU,CAAG,EAAA;AACfA,QAAAA,OAAAA,EAAAA;AACA,QAAA,IAAIA,YAAY,CAAG,EAAA;AACjB,UAAA,MAAMM,KAAQ,GAAA;AACZC,YAAAA,KAAAA,EAAON,aAAaH,OAAQvD,CAAAA,MAAAA;AAC5B,YAAA,IAAIiE,GAAM,GAAA;AACR,cAAA,IAAIC,QAAWtB,GAAAA,KAAAA;AACf,cAAMuB,MAAAA,SAAAA,GAAYD,WAAW,IAAKF,CAAAA,KAAAA;AAElC,cAAA,IAAIG,YAAY,CAAG,EAAA;AACjBD,gBAAAA,QAAAA,GAAW,IAAKF,CAAAA,KAAAA;eACX,MAAA;AACLE,gBAAYP,QAAAA,IAAAA,WAAAA;AACd;AAEA,cAAOO,OAAAA,QAAAA;AACT;AACF,WAAA;AAEA,UAAO,OAAA;YACLF,KAAON,EAAAA,UAAAA;AACPO,YAAAA,GAAAA,EAAKrB,QAAQY,OAAQxD,CAAAA,MAAAA;AACrBsD,YAAAA,IAAAA;AACAS,YAAAA,KAAAA,EAAO7E,IAAK4E,CAAAA,SAAAA,CAAUC,KAAMC,CAAAA,KAAAA,EAAOD,MAAME,GAAG,CAAA;AAC5CG,YAAAA,KAAAA,EAAOlF,IAAK4E,CAAAA,SAAAA,CAAUJ,UAAYd,EAAAA,KAAAA,GAAQY,QAAQxD,MAAM;AAC1D,WAAA;AACF;AACF;AACA,MAAI,IAAA,CAACb,QAAQyE,YAAc,EAAA;AACzBhB,QAAAA,KAAAA,IAASY,QAAQxD,MAAS,GAAA,CAAA;AAC5B;AACF;AACF;AAEA,EAAO,OAAA,IAAA;AACT;AA5DgBqD,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA","file":"string.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 { ValueOf } from \"@/internals/types.js\";\nimport * as R from \"remeda\";\nimport { ValueError } from \"@/errors.js\";\nimport { isString, unique } from \"remeda\";\n\nexport function* splitString(\n  text: string,\n  options: { size: number; overlap: number; trim?: boolean },\n) {\n  yield* recursiveSplitString(text, { ...options, trim: options?.trim ?? false, separators: [] });\n}\n\nexport function* mergeStrings(\n  chunks: string[],\n  sep: string,\n  options: { size: number; overlap: number; trim?: boolean },\n) {\n  const tmpChunks: string[] = [];\n  let tmpOverlap = 0;\n\n  const toDoc = (parts: string[]) => {\n    const text = parts.join(sep);\n    return options.trim ? text.trim() : text;\n  };\n\n  for (const chunk of chunks) {\n    if (tmpOverlap + chunk.length + tmpChunks.length * sep.length > options.size) {\n      if (tmpChunks.length > 0) {\n        const doc = toDoc(tmpChunks);\n        if (doc) {\n          yield doc;\n        }\n\n        while (\n          tmpOverlap > options.overlap ||\n          (tmpOverlap + chunk.length + tmpChunks.length * sep.length > options.size &&\n            tmpOverlap > 0)\n        ) {\n          const tmp = tmpChunks.shift()!;\n          tmpOverlap -= tmp.length;\n        }\n      }\n    }\n    tmpChunks.push(chunk);\n    tmpOverlap += chunk.length;\n  }\n\n  const doc = toDoc(tmpChunks);\n  if (doc) {\n    yield doc;\n  }\n}\n\nexport function* recursiveSplitString(\n  text: string,\n  options: { size: number; overlap: number; separators: string[]; trim?: boolean },\n): Generator<string> {\n  if (options.size <= 0 || options.overlap < 0) {\n    throw new Error(\"size must be positive and overlap must be non-negative\");\n  }\n  if (options.overlap >= options.size) {\n    throw new Error(\"overlap must be less than size\");\n  }\n\n  const goodSplits: string[] = [];\n  const [separator, ...remainingSeparators] = unique([...(options.separators ?? []), \"\"]);\n\n  for (const chunk of text.split(separator).filter(Boolean)) {\n    if (chunk.length < options.size) {\n      goodSplits.push(chunk);\n      continue;\n    }\n\n    if (goodSplits.length > 0) {\n      yield* mergeStrings(goodSplits, separator, options);\n      goodSplits.length = 0;\n    }\n\n    if (remainingSeparators.length === 0) {\n      yield chunk;\n    } else {\n      yield* recursiveSplitString(chunk, { ...options, separators: remainingSeparators });\n    }\n  }\n\n  if (goodSplits.length > 0) {\n    yield* mergeStrings(goodSplits, separator, options);\n  }\n}\n\nexport const Comparator = {\n  EQ: [0] as const,\n  GT: [1] as const,\n  GTE: [0, 1] as const,\n  LT: [-1] as const,\n  LTE: [-1, 0] as const,\n} as const;\n\nexport function compareVersion(\n  a: string,\n  comparator: ValueOf<typeof Comparator>,\n  b: string,\n): boolean {\n  const diff = a.replace(\"v\", \"\").trim().localeCompare(b.replace(\"v\", \"\").trim(), undefined, {\n    numeric: true,\n    sensitivity: \"base\",\n  });\n  const diffNormalized = Math.min(1, Math.max(-1, diff));\n  return R.isIncludedIn(diffNormalized, comparator);\n}\n\nexport function isJsonLikeString(value: string | undefined): value is string {\n  if (!value) {\n    return false;\n  }\n  return value.startsWith(\"{\") && value.endsWith(\"}\");\n}\n\nexport function halveString(\n  value: string,\n  seq: string,\n  includeSeq = false,\n): [string] | [string, string] {\n  if (seq === \"\") {\n    return [value];\n  }\n\n  const index = value.indexOf(seq);\n  if (index === -1) {\n    return [value];\n  } else {\n    return [value.slice(0, index), value.slice(index + (includeSeq ? 0 : seq.length))];\n  }\n}\n\nexport function countSharedStartEndLetters(a: string, b: string): number {\n  if (!isString(a) || !isString(b)) {\n    throw new ValueError(\"Provided values must be all strings.\");\n  }\n\n  const minLength = Math.min(a.length, b.length);\n  for (let i = 0; i < minLength; i++) {\n    if (a.at((i + 1) * -1) !== b.at(i)) {\n      return i;\n    }\n  }\n  return minLength;\n}\n\nexport function findFirstPair(\n  text: string,\n  pair: [string, string],\n  options: { allowOverlap?: boolean } = {},\n) {\n  const [opening, closing] = pair || [];\n  if (!pair || !opening || !closing) {\n    throw new ValueError(`The \"pair\" parameter is required and must be non-empty!`);\n  }\n\n  let balance = 0;\n  let startIndex = -1;\n  const pairOverlap = options.allowOverlap ? countSharedStartEndLetters(opening, closing) : 0;\n\n  const isSame = opening === closing;\n  for (let index = 0; index < text.length; index++) {\n    if (text.substring(index, index + opening.length) === opening && (!isSame || balance === 0)) {\n      if (balance === 0) {\n        startIndex = index;\n      }\n      balance++;\n      if (!options.allowOverlap) {\n        index += opening.length - 1;\n      }\n    } else if (text.substring(index, index + closing.length) === closing) {\n      if (balance > 0) {\n        balance--;\n        if (balance === 0) {\n          const inner = {\n            start: startIndex + opening.length,\n            get end() {\n              let innerEnd = index;\n              const innerSize = innerEnd - this.start;\n\n              if (innerSize < 0) {\n                innerEnd = this.start;\n              } else {\n                innerEnd += pairOverlap;\n              }\n\n              return innerEnd;\n            },\n          };\n\n          return {\n            start: startIndex,\n            end: index + closing.length,\n            pair,\n            inner: text.substring(inner.start, inner.end),\n            outer: text.substring(startIndex, index + closing.length),\n          };\n        }\n      }\n      if (!options.allowOverlap) {\n        index += closing.length - 1;\n      }\n    }\n  }\n\n  return null;\n}\n"]}

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

@@ -0,0 +1,57 @@
+import { ValueOf } from '../types.cjs';
+import './guards.cjs';
+
+/**
+ * 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 splitString(text: string, options: {
+    size: number;
+    overlap: number;
+    trim?: boolean;
+}): Generator<string, void, any>;
+declare function mergeStrings(chunks: string[], sep: string, options: {
+    size: number;
+    overlap: number;
+    trim?: boolean;
+}): Generator<string, void, unknown>;
+declare function recursiveSplitString(text: string, options: {
+    size: number;
+    overlap: number;
+    separators: string[];
+    trim?: boolean;
+}): Generator<string>;
+declare const Comparator: {
+    readonly EQ: readonly [0];
+    readonly GT: readonly [1];
+    readonly GTE: readonly [0, 1];
+    readonly LT: readonly [-1];
+    readonly LTE: readonly [-1, 0];
+};
+declare function compareVersion(a: string, comparator: ValueOf<typeof Comparator>, b: string): boolean;
+declare function isJsonLikeString(value: string | undefined): value is string;
+declare function halveString(value: string, seq: string, includeSeq?: boolean): [string] | [string, string];
+declare function countSharedStartEndLetters(a: string, b: string): number;
+declare function findFirstPair(text: string, pair: [string, string], options?: {
+    allowOverlap?: boolean;
+}): {
+    start: number;
+    end: number;
+    pair: [string, string];
+    inner: string;
+    outer: string;
+} | null;
+
+export { Comparator, compareVersion, countSharedStartEndLetters, findFirstPair, halveString, isJsonLikeString, mergeStrings, recursiveSplitString, splitString };

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

@@ -0,0 +1,57 @@
+import { ValueOf } from '../types.js';
+import './guards.js';
+
+/**
+ * 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 splitString(text: string, options: {
+    size: number;
+    overlap: number;
+    trim?: boolean;
+}): Generator<string, void, any>;
+declare function mergeStrings(chunks: string[], sep: string, options: {
+    size: number;
+    overlap: number;
+    trim?: boolean;
+}): Generator<string, void, unknown>;
+declare function recursiveSplitString(text: string, options: {
+    size: number;
+    overlap: number;
+    separators: string[];
+    trim?: boolean;
+}): Generator<string>;
+declare const Comparator: {
+    readonly EQ: readonly [0];
+    readonly GT: readonly [1];
+    readonly GTE: readonly [0, 1];
+    readonly LT: readonly [-1];
+    readonly LTE: readonly [-1, 0];
+};
+declare function compareVersion(a: string, comparator: ValueOf<typeof Comparator>, b: string): boolean;
+declare function isJsonLikeString(value: string | undefined): value is string;
+declare function halveString(value: string, seq: string, includeSeq?: boolean): [string] | [string, string];
+declare function countSharedStartEndLetters(a: string, b: string): number;
+declare function findFirstPair(text: string, pair: [string, string], options?: {
+    allowOverlap?: boolean;
+}): {
+    start: number;
+    end: number;
+    pair: [string, string];
+    inner: string;
+    outer: string;
+} | null;
+
+export { Comparator, compareVersion, countSharedStartEndLetters, findFirstPair, halveString, isJsonLikeString, mergeStrings, recursiveSplitString, splitString };

package/dist/internals/helpers/string.js

@@ -0,0 +1,201 @@
+import * as R from 'remeda';
+import { unique, isString } from 'remeda';
+import { ValueError } from '../../errors.js';
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function* splitString(text, options) {
+  yield* recursiveSplitString(text, {
+    ...options,
+    trim: options?.trim ?? false,
+    separators: []
+  });
+}
+__name(splitString, "splitString");
+function* mergeStrings(chunks, sep, options) {
+  const tmpChunks = [];
+  let tmpOverlap = 0;
+  const toDoc = /* @__PURE__ */ __name((parts) => {
+    const text = parts.join(sep);
+    return options.trim ? text.trim() : text;
+  }, "toDoc");
+  for (const chunk of chunks) {
+    if (tmpOverlap + chunk.length + tmpChunks.length * sep.length > options.size) {
+      if (tmpChunks.length > 0) {
+        const doc2 = toDoc(tmpChunks);
+        if (doc2) {
+          yield doc2;
+        }
+        while (tmpOverlap > options.overlap || tmpOverlap + chunk.length + tmpChunks.length * sep.length > options.size && tmpOverlap > 0) {
+          const tmp = tmpChunks.shift();
+          tmpOverlap -= tmp.length;
+        }
+      }
+    }
+    tmpChunks.push(chunk);
+    tmpOverlap += chunk.length;
+  }
+  const doc = toDoc(tmpChunks);
+  if (doc) {
+    yield doc;
+  }
+}
+__name(mergeStrings, "mergeStrings");
+function* recursiveSplitString(text, options) {
+  if (options.size <= 0 || options.overlap < 0) {
+    throw new Error("size must be positive and overlap must be non-negative");
+  }
+  if (options.overlap >= options.size) {
+    throw new Error("overlap must be less than size");
+  }
+  const goodSplits = [];
+  const [separator, ...remainingSeparators] = unique([
+    ...options.separators ?? [],
+    ""
+  ]);
+  for (const chunk of text.split(separator).filter(Boolean)) {
+    if (chunk.length < options.size) {
+      goodSplits.push(chunk);
+      continue;
+    }
+    if (goodSplits.length > 0) {
+      yield* mergeStrings(goodSplits, separator, options);
+      goodSplits.length = 0;
+    }
+    if (remainingSeparators.length === 0) {
+      yield chunk;
+    } else {
+      yield* recursiveSplitString(chunk, {
+        ...options,
+        separators: remainingSeparators
+      });
+    }
+  }
+  if (goodSplits.length > 0) {
+    yield* mergeStrings(goodSplits, separator, options);
+  }
+}
+__name(recursiveSplitString, "recursiveSplitString");
+const Comparator = {
+  EQ: [
+    0
+  ],
+  GT: [
+    1
+  ],
+  GTE: [
+    0,
+    1
+  ],
+  LT: [
+    -1
+  ],
+  LTE: [
+    -1,
+    0
+  ]
+};
+function compareVersion(a, comparator, b) {
+  const diff = a.replace("v", "").trim().localeCompare(b.replace("v", "").trim(), void 0, {
+    numeric: true,
+    sensitivity: "base"
+  });
+  const diffNormalized = Math.min(1, Math.max(-1, diff));
+  return R.isIncludedIn(diffNormalized, comparator);
+}
+__name(compareVersion, "compareVersion");
+function isJsonLikeString(value) {
+  if (!value) {
+    return false;
+  }
+  return value.startsWith("{") && value.endsWith("}");
+}
+__name(isJsonLikeString, "isJsonLikeString");
+function halveString(value, seq, includeSeq = false) {
+  if (seq === "") {
+    return [
+      value
+    ];
+  }
+  const index = value.indexOf(seq);
+  if (index === -1) {
+    return [
+      value
+    ];
+  } else {
+    return [
+      value.slice(0, index),
+      value.slice(index + (includeSeq ? 0 : seq.length))
+    ];
+  }
+}
+__name(halveString, "halveString");
+function countSharedStartEndLetters(a, b) {
+  if (!isString(a) || !isString(b)) {
+    throw new ValueError("Provided values must be all strings.");
+  }
+  const minLength = Math.min(a.length, b.length);
+  for (let i = 0; i < minLength; i++) {
+    if (a.at((i + 1) * -1) !== b.at(i)) {
+      return i;
+    }
+  }
+  return minLength;
+}
+__name(countSharedStartEndLetters, "countSharedStartEndLetters");
+function findFirstPair(text, pair, options = {}) {
+  const [opening, closing] = pair || [];
+  if (!pair || !opening || !closing) {
+    throw new ValueError(`The "pair" parameter is required and must be non-empty!`);
+  }
+  let balance = 0;
+  let startIndex = -1;
+  const pairOverlap = options.allowOverlap ? countSharedStartEndLetters(opening, closing) : 0;
+  const isSame = opening === closing;
+  for (let index = 0; index < text.length; index++) {
+    if (text.substring(index, index + opening.length) === opening && (!isSame || balance === 0)) {
+      if (balance === 0) {
+        startIndex = index;
+      }
+      balance++;
+      if (!options.allowOverlap) {
+        index += opening.length - 1;
+      }
+    } else if (text.substring(index, index + closing.length) === closing) {
+      if (balance > 0) {
+        balance--;
+        if (balance === 0) {
+          const inner = {
+            start: startIndex + opening.length,
+            get end() {
+              let innerEnd = index;
+              const innerSize = innerEnd - this.start;
+              if (innerSize < 0) {
+                innerEnd = this.start;
+              } else {
+                innerEnd += pairOverlap;
+              }
+              return innerEnd;
+            }
+          };
+          return {
+            start: startIndex,
+            end: index + closing.length,
+            pair,
+            inner: text.substring(inner.start, inner.end),
+            outer: text.substring(startIndex, index + closing.length)
+          };
+        }
+      }
+      if (!options.allowOverlap) {
+        index += closing.length - 1;
+      }
+    }
+  }
+  return null;
+}
+__name(findFirstPair, "findFirstPair");
+
+export { Comparator, compareVersion, countSharedStartEndLetters, findFirstPair, halveString, isJsonLikeString, mergeStrings, recursiveSplitString, splitString };
+//# sourceMappingURL=string.js.map
+//# sourceMappingURL=string.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/internals/helpers/string.ts"],"names":["splitString","text","options","recursiveSplitString","trim","separators","mergeStrings","chunks","sep","tmpChunks","tmpOverlap","toDoc","parts","join","chunk","length","size","doc","overlap","tmp","shift","push","Error","goodSplits","separator","remainingSeparators","unique","split","filter","Boolean","Comparator","EQ","GT","GTE","LT","LTE","compareVersion","a","comparator","b","diff","replace","localeCompare","undefined","numeric","sensitivity","diffNormalized","Math","min","max","R","isIncludedIn","isJsonLikeString","value","startsWith","endsWith","halveString","seq","includeSeq","index","indexOf","slice","countSharedStartEndLetters","isString","ValueError","minLength","i","at","findFirstPair","pair","opening","closing","balance","startIndex","pairOverlap","allowOverlap","isSame","substring","inner","start","end","innerEnd","innerSize","outer"],"mappings":";;;;;;AAqBO,UAAUA,WAAAA,CACfC,MACAC,OAA0D,EAAA;AAE1D,EAAA,OAAOC,qBAAqBF,IAAM,EAAA;IAAE,GAAGC,OAAAA;AAASE,IAAAA,IAAAA,EAAMF,SAASE,IAAQ,IAAA,KAAA;AAAOC,IAAAA,UAAAA,EAAY;GAAG,CAAA;AAC/F;AALiBL,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAOV,UAAUM,YAAAA,CACfC,MACAC,EAAAA,GAAAA,EACAN,OAA0D,EAAA;AAE1D,EAAA,MAAMO,YAAsB,EAAA;AAC5B,EAAA,IAAIC,UAAa,GAAA,CAAA;AAEjB,EAAMC,MAAAA,KAAAA,2BAASC,KAAAA,KAAAA;AACb,IAAMX,MAAAA,IAAAA,GAAOW,KAAMC,CAAAA,IAAAA,CAAKL,GAAAA,CAAAA;AACxB,IAAA,OAAON,OAAQE,CAAAA,IAAAA,GAAOH,IAAKG,CAAAA,IAAAA,EAASH,GAAAA,IAAAA;GAFxB,EAAA,OAAA,CAAA;AAKd,EAAA,KAAA,MAAWa,SAASP,MAAQ,EAAA;AAC1B,IAAIG,IAAAA,UAAAA,GAAaI,MAAMC,MAASN,GAAAA,SAAAA,CAAUM,SAASP,GAAIO,CAAAA,MAAAA,GAASb,QAAQc,IAAM,EAAA;AAC5E,MAAIP,IAAAA,SAAAA,CAAUM,SAAS,CAAG,EAAA;AACxB,QAAME,MAAAA,IAAAA,GAAMN,MAAMF,SAAAA,CAAAA;AAClB,QAAA,IAAIQ,IAAK,EAAA;AACP,UAAMA,MAAAA,IAAAA;AACR;AAEA,QAAA,OACEP,UAAaR,GAAAA,OAAAA,CAAQgB,OACpBR,IAAAA,UAAAA,GAAaI,KAAMC,CAAAA,MAAAA,GAASN,SAAUM,CAAAA,MAAAA,GAASP,GAAIO,CAAAA,MAAAA,GAASb,OAAQc,CAAAA,IAAAA,IACnEN,aAAa,CACf,EAAA;AACA,UAAMS,MAAAA,GAAAA,GAAMV,UAAUW,KAAK,EAAA;AAC3BV,UAAAA,UAAAA,IAAcS,GAAIJ,CAAAA,MAAAA;AACpB;AACF;AACF;AACAN,IAAAA,SAAAA,CAAUY,KAAKP,KAAAA,CAAAA;AACfJ,IAAAA,UAAAA,IAAcI,KAAMC,CAAAA,MAAAA;AACtB;AAEA,EAAME,MAAAA,GAAAA,GAAMN,MAAMF,SAAAA,CAAAA;AAClB,EAAA,IAAIQ,GAAK,EAAA;AACP,IAAMA,MAAAA,GAAAA;AACR;AACF;AAvCiBX,MAAAA,CAAAA,YAAAA,EAAAA,cAAAA,CAAAA;AAyCV,UAAUH,oBAAAA,CACfF,MACAC,OAAgF,EAAA;AAEhF,EAAA,IAAIA,OAAQc,CAAAA,IAAAA,IAAQ,CAAKd,IAAAA,OAAAA,CAAQgB,UAAU,CAAG,EAAA;AAC5C,IAAM,MAAA,IAAII,MAAM,wDAAA,CAAA;AAClB;AACA,EAAIpB,IAAAA,OAAAA,CAAQgB,OAAWhB,IAAAA,OAAAA,CAAQc,IAAM,EAAA;AACnC,IAAM,MAAA,IAAIM,MAAM,gCAAA,CAAA;AAClB;AAEA,EAAA,MAAMC,aAAuB,EAAA;AAC7B,EAAA,MAAM,CAACC,SAAAA,EAAW,GAAGC,mBAAAA,IAAuBC,MAAO,CAAA;AAAKxB,IAAAA,GAAAA,OAAAA,CAAQG,cAAc,EAAA;AAAK,IAAA;AAAG,GAAA,CAAA;AAEtF,EAAA,KAAA,MAAWS,SAASb,IAAK0B,CAAAA,KAAAA,CAAMH,SAAAA,CAAWI,CAAAA,MAAAA,CAAOC,OAAAA,CAAU,EAAA;AACzD,IAAIf,IAAAA,KAAAA,CAAMC,MAASb,GAAAA,OAAAA,CAAQc,IAAM,EAAA;AAC/BO,MAAAA,UAAAA,CAAWF,KAAKP,KAAAA,CAAAA;AAChB,MAAA;AACF;AAEA,IAAIS,IAAAA,UAAAA,CAAWR,SAAS,CAAG,EAAA;AACzB,MAAOT,OAAAA,YAAAA,CAAaiB,UAAYC,EAAAA,SAAAA,EAAWtB,OAAAA,CAAAA;AAC3CqB,MAAAA,UAAAA,CAAWR,MAAS,GAAA,CAAA;AACtB;AAEA,IAAIU,IAAAA,mBAAAA,CAAoBV,WAAW,CAAG,EAAA;AACpC,MAAMD,MAAAA,KAAAA;KACD,MAAA;AACL,MAAA,OAAOX,qBAAqBW,KAAO,EAAA;QAAE,GAAGZ,OAAAA;QAASG,UAAYoB,EAAAA;OAAoB,CAAA;AACnF;AACF;AAEA,EAAIF,IAAAA,UAAAA,CAAWR,SAAS,CAAG,EAAA;AACzB,IAAOT,OAAAA,YAAAA,CAAaiB,UAAYC,EAAAA,SAAAA,EAAWtB,OAAAA,CAAAA;AAC7C;AACF;AAnCiBC,MAAAA,CAAAA,oBAAAA,EAAAA,sBAAAA,CAAAA;AAqCV,MAAM2B,UAAa,GAAA;EACxBC,EAAI,EAAA;AAAC,IAAA;;EACLC,EAAI,EAAA;AAAC,IAAA;;EACLC,GAAK,EAAA;AAAC,IAAA,CAAA;AAAG,IAAA;;EACTC,EAAI,EAAA;AAAC,IAAA,CAAA;;EACLC,GAAK,EAAA;AAAC,IAAA,CAAA,CAAA;AAAI,IAAA;;AACZ;AAEO,SAASC,cAAAA,CACdC,CACAC,EAAAA,UAAAA,EACAC,CAAS,EAAA;AAET,EAAA,MAAMC,OAAOH,CAAEI,CAAAA,OAAAA,CAAQ,GAAK,EAAA,EAAA,EAAIrC,IAAI,EAAA,CAAGsC,aAAcH,CAAAA,CAAAA,CAAEE,QAAQ,GAAK,EAAA,EAAA,CAAIrC,CAAAA,IAAAA,IAAQuC,KAAW,CAAA,EAAA;IACzFC,OAAS,EAAA,IAAA;IACTC,WAAa,EAAA;GACf,CAAA;AACA,EAAMC,MAAAA,cAAAA,GAAiBC,KAAKC,GAAI,CAAA,CAAA,EAAGD,KAAKE,GAAI,CAAA,CAAA,CAAA,EAAIT,IAAAA,CAAAA,CAAAA;AAChD,EAAOU,OAAAA,CAAAA,CAAEC,YAAaL,CAAAA,cAAAA,EAAgBR,UAAAA,CAAAA;AACxC;AAXgBF,MAAAA,CAAAA,cAAAA,EAAAA,gBAAAA,CAAAA;AAaT,SAASgB,iBAAiBC,KAAyB,EAAA;AACxD,EAAA,IAAI,CAACA,KAAO,EAAA;AACV,IAAO,OAAA,KAAA;AACT;AACA,EAAA,OAAOA,MAAMC,UAAW,CAAA,GAAA,CAAQD,IAAAA,KAAAA,CAAME,SAAS,GAAA,CAAA;AACjD;AALgBH,MAAAA,CAAAA,gBAAAA,EAAAA,kBAAAA,CAAAA;AAOT,SAASI,WACdH,CAAAA,KAAAA,EACAI,GACAC,EAAAA,UAAAA,GAAa,KAAK,EAAA;AAElB,EAAA,IAAID,QAAQ,EAAI,EAAA;AACd,IAAO,OAAA;AAACJ,MAAAA;;AACV;AAEA,EAAMM,MAAAA,KAAAA,GAAQN,KAAMO,CAAAA,OAAAA,CAAQH,GAAAA,CAAAA;AAC5B,EAAA,IAAIE,UAAU,CAAI,CAAA,EAAA;AAChB,IAAO,OAAA;AAACN,MAAAA;;GACH,MAAA;AACL,IAAO,OAAA;MAACA,KAAMQ,CAAAA,KAAAA,CAAM,GAAGF,KAAAA,CAAAA;AAAQN,MAAAA,KAAAA,CAAMQ,KAAMF,CAAAA,KAAAA,IAASD,UAAa,GAAA,CAAA,GAAID,IAAI1C,MAAK,CAAA;;AAChF;AACF;AAfgByC,MAAAA,CAAAA,WAAAA,EAAAA,aAAAA,CAAAA;AAiBT,SAASM,0BAAAA,CAA2BzB,GAAWE,CAAS,EAAA;AAC7D,EAAA,IAAI,CAACwB,QAAS1B,CAAAA,CAAAA,KAAM,CAAC0B,QAAAA,CAASxB,CAAAA,CAAI,EAAA;AAChC,IAAM,MAAA,IAAIyB,WAAW,sCAAA,CAAA;AACvB;AAEA,EAAA,MAAMC,YAAYlB,IAAKC,CAAAA,GAAAA,CAAIX,CAAEtB,CAAAA,MAAAA,EAAQwB,EAAExB,MAAM,CAAA;AAC7C,EAAA,KAAA,IAASmD,CAAI,GAAA,CAAA,EAAGA,CAAID,GAAAA,SAAAA,EAAWC,CAAK,EAAA,EAAA;AAClC,IAAI7B,IAAAA,CAAAA,CAAE8B,IAAID,CAAI,GAAA,CAAA,IAAK,EAAC,CAAO3B,KAAAA,CAAAA,CAAE4B,EAAGD,CAAAA,CAAAA,CAAI,EAAA;AAClC,MAAOA,OAAAA,CAAAA;AACT;AACF;AACA,EAAOD,OAAAA,SAAAA;AACT;AAZgBH,MAAAA,CAAAA,0BAAAA,EAAAA,4BAAAA,CAAAA;AAcT,SAASM,aACdnE,CAAAA,IAAAA,EACAoE,IACAnE,EAAAA,OAAAA,GAAsC,EAAE,EAAA;AAExC,EAAA,MAAM,CAACoE,OAAAA,EAASC,OAAAA,CAAAA,GAAWF,QAAQ,EAAA;AACnC,EAAA,IAAI,CAACA,IAAAA,IAAQ,CAACC,OAAAA,IAAW,CAACC,OAAS,EAAA;AACjC,IAAM,MAAA,IAAIP,WAAW,CAAyD,uDAAA,CAAA,CAAA;AAChF;AAEA,EAAA,IAAIQ,OAAU,GAAA,CAAA;AACd,EAAA,IAAIC,UAAa,GAAA,CAAA,CAAA;AACjB,EAAA,MAAMC,cAAcxE,OAAQyE,CAAAA,YAAAA,GAAeb,0BAA2BQ,CAAAA,OAAAA,EAASC,OAAAA,CAAW,GAAA,CAAA;AAE1F,EAAA,MAAMK,SAASN,OAAYC,KAAAA,OAAAA;AAC3B,EAAA,KAAA,IAASZ,KAAQ,GAAA,CAAA,EAAGA,KAAQ1D,GAAAA,IAAAA,CAAKc,QAAQ4C,KAAS,EAAA,EAAA;AAChD,IAAI1D,IAAAA,IAAAA,CAAK4E,SAAUlB,CAAAA,KAAAA,EAAOA,KAAQW,GAAAA,OAAAA,CAAQvD,MAAM,CAAA,KAAMuD,OAAY,KAAA,CAACM,MAAUJ,IAAAA,OAAAA,KAAY,CAAI,CAAA,EAAA;AAC3F,MAAA,IAAIA,YAAY,CAAG,EAAA;AACjBC,QAAad,UAAAA,GAAAA,KAAAA;AACf;AACAa,MAAAA,OAAAA,EAAAA;AACA,MAAI,IAAA,CAACtE,QAAQyE,YAAc,EAAA;AACzBhB,QAAAA,KAAAA,IAASW,QAAQvD,MAAS,GAAA,CAAA;AAC5B;AACF,KAAA,MAAA,IAAWd,KAAK4E,SAAUlB,CAAAA,KAAAA,EAAOA,QAAQY,OAAQxD,CAAAA,MAAM,MAAMwD,OAAS,EAAA;AACpE,MAAA,IAAIC,UAAU,CAAG,EAAA;AACfA,QAAAA,OAAAA,EAAAA;AACA,QAAA,IAAIA,YAAY,CAAG,EAAA;AACjB,UAAA,MAAMM,KAAQ,GAAA;AACZC,YAAAA,KAAAA,EAAON,aAAaH,OAAQvD,CAAAA,MAAAA;AAC5B,YAAA,IAAIiE,GAAM,GAAA;AACR,cAAA,IAAIC,QAAWtB,GAAAA,KAAAA;AACf,cAAMuB,MAAAA,SAAAA,GAAYD,WAAW,IAAKF,CAAAA,KAAAA;AAElC,cAAA,IAAIG,YAAY,CAAG,EAAA;AACjBD,gBAAAA,QAAAA,GAAW,IAAKF,CAAAA,KAAAA;eACX,MAAA;AACLE,gBAAYP,QAAAA,IAAAA,WAAAA;AACd;AAEA,cAAOO,OAAAA,QAAAA;AACT;AACF,WAAA;AAEA,UAAO,OAAA;YACLF,KAAON,EAAAA,UAAAA;AACPO,YAAAA,GAAAA,EAAKrB,QAAQY,OAAQxD,CAAAA,MAAAA;AACrBsD,YAAAA,IAAAA;AACAS,YAAAA,KAAAA,EAAO7E,IAAK4E,CAAAA,SAAAA,CAAUC,KAAMC,CAAAA,KAAAA,EAAOD,MAAME,GAAG,CAAA;AAC5CG,YAAAA,KAAAA,EAAOlF,IAAK4E,CAAAA,SAAAA,CAAUJ,UAAYd,EAAAA,KAAAA,GAAQY,QAAQxD,MAAM;AAC1D,WAAA;AACF;AACF;AACA,MAAI,IAAA,CAACb,QAAQyE,YAAc,EAAA;AACzBhB,QAAAA,KAAAA,IAASY,QAAQxD,MAAS,GAAA,CAAA;AAC5B;AACF;AACF;AAEA,EAAO,OAAA,IAAA;AACT;AA5DgBqD,MAAAA,CAAAA,aAAAA,EAAAA,eAAAA,CAAAA","file":"string.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 { ValueOf } from \"@/internals/types.js\";\nimport * as R from \"remeda\";\nimport { ValueError } from \"@/errors.js\";\nimport { isString, unique } from \"remeda\";\n\nexport function* splitString(\n  text: string,\n  options: { size: number; overlap: number; trim?: boolean },\n) {\n  yield* recursiveSplitString(text, { ...options, trim: options?.trim ?? false, separators: [] });\n}\n\nexport function* mergeStrings(\n  chunks: string[],\n  sep: string,\n  options: { size: number; overlap: number; trim?: boolean },\n) {\n  const tmpChunks: string[] = [];\n  let tmpOverlap = 0;\n\n  const toDoc = (parts: string[]) => {\n    const text = parts.join(sep);\n    return options.trim ? text.trim() : text;\n  };\n\n  for (const chunk of chunks) {\n    if (tmpOverlap + chunk.length + tmpChunks.length * sep.length > options.size) {\n      if (tmpChunks.length > 0) {\n        const doc = toDoc(tmpChunks);\n        if (doc) {\n          yield doc;\n        }\n\n        while (\n          tmpOverlap > options.overlap ||\n          (tmpOverlap + chunk.length + tmpChunks.length * sep.length > options.size &&\n            tmpOverlap > 0)\n        ) {\n          const tmp = tmpChunks.shift()!;\n          tmpOverlap -= tmp.length;\n        }\n      }\n    }\n    tmpChunks.push(chunk);\n    tmpOverlap += chunk.length;\n  }\n\n  const doc = toDoc(tmpChunks);\n  if (doc) {\n    yield doc;\n  }\n}\n\nexport function* recursiveSplitString(\n  text: string,\n  options: { size: number; overlap: number; separators: string[]; trim?: boolean },\n): Generator<string> {\n  if (options.size <= 0 || options.overlap < 0) {\n    throw new Error(\"size must be positive and overlap must be non-negative\");\n  }\n  if (options.overlap >= options.size) {\n    throw new Error(\"overlap must be less than size\");\n  }\n\n  const goodSplits: string[] = [];\n  const [separator, ...remainingSeparators] = unique([...(options.separators ?? []), \"\"]);\n\n  for (const chunk of text.split(separator).filter(Boolean)) {\n    if (chunk.length < options.size) {\n      goodSplits.push(chunk);\n      continue;\n    }\n\n    if (goodSplits.length > 0) {\n      yield* mergeStrings(goodSplits, separator, options);\n      goodSplits.length = 0;\n    }\n\n    if (remainingSeparators.length === 0) {\n      yield chunk;\n    } else {\n      yield* recursiveSplitString(chunk, { ...options, separators: remainingSeparators });\n    }\n  }\n\n  if (goodSplits.length > 0) {\n    yield* mergeStrings(goodSplits, separator, options);\n  }\n}\n\nexport const Comparator = {\n  EQ: [0] as const,\n  GT: [1] as const,\n  GTE: [0, 1] as const,\n  LT: [-1] as const,\n  LTE: [-1, 0] as const,\n} as const;\n\nexport function compareVersion(\n  a: string,\n  comparator: ValueOf<typeof Comparator>,\n  b: string,\n): boolean {\n  const diff = a.replace(\"v\", \"\").trim().localeCompare(b.replace(\"v\", \"\").trim(), undefined, {\n    numeric: true,\n    sensitivity: \"base\",\n  });\n  const diffNormalized = Math.min(1, Math.max(-1, diff));\n  return R.isIncludedIn(diffNormalized, comparator);\n}\n\nexport function isJsonLikeString(value: string | undefined): value is string {\n  if (!value) {\n    return false;\n  }\n  return value.startsWith(\"{\") && value.endsWith(\"}\");\n}\n\nexport function halveString(\n  value: string,\n  seq: string,\n  includeSeq = false,\n): [string] | [string, string] {\n  if (seq === \"\") {\n    return [value];\n  }\n\n  const index = value.indexOf(seq);\n  if (index === -1) {\n    return [value];\n  } else {\n    return [value.slice(0, index), value.slice(index + (includeSeq ? 0 : seq.length))];\n  }\n}\n\nexport function countSharedStartEndLetters(a: string, b: string): number {\n  if (!isString(a) || !isString(b)) {\n    throw new ValueError(\"Provided values must be all strings.\");\n  }\n\n  const minLength = Math.min(a.length, b.length);\n  for (let i = 0; i < minLength; i++) {\n    if (a.at((i + 1) * -1) !== b.at(i)) {\n      return i;\n    }\n  }\n  return minLength;\n}\n\nexport function findFirstPair(\n  text: string,\n  pair: [string, string],\n  options: { allowOverlap?: boolean } = {},\n) {\n  const [opening, closing] = pair || [];\n  if (!pair || !opening || !closing) {\n    throw new ValueError(`The \"pair\" parameter is required and must be non-empty!`);\n  }\n\n  let balance = 0;\n  let startIndex = -1;\n  const pairOverlap = options.allowOverlap ? countSharedStartEndLetters(opening, closing) : 0;\n\n  const isSame = opening === closing;\n  for (let index = 0; index < text.length; index++) {\n    if (text.substring(index, index + opening.length) === opening && (!isSame || balance === 0)) {\n      if (balance === 0) {\n        startIndex = index;\n      }\n      balance++;\n      if (!options.allowOverlap) {\n        index += opening.length - 1;\n      }\n    } else if (text.substring(index, index + closing.length) === closing) {\n      if (balance > 0) {\n        balance--;\n        if (balance === 0) {\n          const inner = {\n            start: startIndex + opening.length,\n            get end() {\n              let innerEnd = index;\n              const innerSize = innerEnd - this.start;\n\n              if (innerSize < 0) {\n                innerEnd = this.start;\n              } else {\n                innerEnd += pairOverlap;\n              }\n\n              return innerEnd;\n            },\n          };\n\n          return {\n            start: startIndex,\n            end: index + closing.length,\n            pair,\n            inner: text.substring(inner.start, inner.end),\n            outer: text.substring(startIndex, index + closing.length),\n          };\n        }\n      }\n      if (!options.allowOverlap) {\n        index += closing.length - 1;\n      }\n    }\n  }\n\n  return null;\n}\n"]}