@gitkraken/core-gitlens 0.1.0

package/dist/utils/fuzzy.js

@@ -0,0 +1,134 @@
+const defaultOptions = {
+    caseSensitive: false,
+    consecutiveBonus: 0.15,
+    prefixBonus: 0.2,
+    unmatchedPenalty: 0.05,
+};
+/**
+ * Performs fuzzy matching of a pattern against a target string with scoring.
+ *
+ * The algorithm:
+ * 1. Checks if all characters in the pattern exist in the target (in order)
+ * 2. Calculates a score based on:
+ *    - Exact prefix matches (highest priority)
+ *    - Consecutive character matches
+ *    - Position of matches (earlier is better)
+ *    - Unmatched characters (penalty)
+ *
+ * @param pattern The search pattern
+ * @param target The string to match against
+ * @param options Matching options
+ * @returns Match result with score and matched indices
+ *
+ * @example
+ * fuzzyMatch('mes', 'message:') // { matches: true, score: 0.95, matchedIndices: [0, 1, 2] }
+ * fuzzyMatch('aut', 'author:')  // { matches: true, score: 0.93, matchedIndices: [0, 1, 2] }
+ * fuzzyMatch('msg', 'message:') // { matches: true, score: 0.65, matchedIndices: [0, 2, 3] }
+ */
+export function fuzzyMatch(pattern, target, options) {
+    const opts = { ...defaultOptions, ...options };
+    if (!pattern) {
+        return { matches: true, score: 1, matchedIndices: [] };
+    }
+    if (!target) {
+        return { matches: false, score: 0, matchedIndices: [] };
+    }
+    const patternStr = opts.caseSensitive ? pattern : pattern.toLowerCase();
+    const targetStr = opts.caseSensitive ? target : target.toLowerCase();
+    // Check for exact match first
+    if (patternStr === targetStr) {
+        return {
+            matches: true,
+            score: 1,
+            matchedIndices: Array.from({ length: target.length }, (_, i) => i),
+        };
+    }
+    // Check if pattern is a prefix of target
+    if (targetStr.startsWith(patternStr)) {
+        return {
+            matches: true,
+            score: 0.9 + (patternStr.length / targetStr.length) * 0.1,
+            matchedIndices: Array.from({ length: pattern.length }, (_, i) => i),
+        };
+    }
+    // Perform fuzzy matching
+    const matchedIndices = [];
+    let patternIdx = 0;
+    let targetIdx = 0;
+    let consecutiveMatches = 0;
+    let score = 0;
+    while (patternIdx < patternStr.length && targetIdx < targetStr.length) {
+        if (patternStr[patternIdx] === targetStr[targetIdx]) {
+            matchedIndices.push(targetIdx);
+            // Base score for each match
+            score += 1;
+            // Bonus for consecutive matches
+            if (matchedIndices.length > 1 && matchedIndices.at(-1) === matchedIndices[matchedIndices.length - 2] + 1) {
+                consecutiveMatches++;
+                score += opts.consecutiveBonus * consecutiveMatches;
+            }
+            else {
+                consecutiveMatches = 0;
+            }
+            // Bonus for matches at the start
+            if (targetIdx === patternIdx) {
+                score += opts.prefixBonus;
+            }
+            patternIdx++;
+        }
+        targetIdx++;
+    }
+    // Check if all pattern characters were matched
+    if (patternIdx < patternStr.length) {
+        return { matches: false, score: 0, matchedIndices: [] };
+    }
+    // Apply penalty for unmatched characters
+    const unmatchedCount = targetStr.length - matchedIndices.length;
+    score -= unmatchedCount * opts.unmatchedPenalty;
+    // Normalize score to 0-1 range
+    // Maximum possible score is pattern.length + bonuses
+    const maxScore = patternStr.length * (1 + opts.consecutiveBonus + opts.prefixBonus);
+    const normalizedScore = Math.max(0, Math.min(1, score / maxScore));
+    return {
+        matches: true,
+        score: normalizedScore,
+        matchedIndices: matchedIndices,
+    };
+}
+/**
+ * Filters and sorts an array of items by fuzzy matching against a pattern.
+ *
+ * @param pattern The search pattern
+ * @param items The items to filter and sort
+ * @param getText Function to extract searchable text from each item
+ * @param options Matching options
+ * @returns Filtered and sorted items with their match results
+ *
+ * @example
+ * const operators = [
+ *   { name: 'message:', desc: 'Search messages' },
+ *   { name: 'author:', desc: 'Search authors' }
+ * ];
+ * fuzzyFilter('mes', operators, op => op.name)
+ * // Returns [{ item: { name: 'message:', ... }, match: { score: 0.95, ... } }]
+ */
+export function fuzzyFilter(pattern, items, getText, options) {
+    if (!pattern) {
+        return items.map(item => ({
+            item: item,
+            match: { matches: true, score: 1, matchedIndices: [] },
+        }));
+    }
+    const results = [];
+    for (const item of items) {
+        const text = getText(item);
+        const match = fuzzyMatch(pattern, text, options);
+        if (match.matches) {
+            results.push({ item: item, match: match });
+        }
+    }
+    // Sort by score (descending)
+    results.sort((a, b) => b.match.score - a.match.score);
+    return results;
+}
+//# sourceMappingURL=fuzzy.js.map

package/dist/utils/fuzzy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fuzzy.js","sourceRoot":"","sources":["../../src/utils/fuzzy.ts"],"names":[],"mappings":"AA0BA,MAAM,cAAc,GAAgC;IACnD,aAAa,EAAE,KAAK;IACpB,gBAAgB,EAAE,IAAI;IACtB,WAAW,EAAE,GAAG;IAChB,gBAAgB,EAAE,IAAI;CACtB,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,UAAU,CAAC,OAAe,EAAE,MAAc,EAAE,OAA2B;IACtF,MAAM,IAAI,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,OAAO,EAAE,CAAC;IAE/C,IAAI,CAAC,OAAO,EAAE,CAAC;QACd,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;IACxD,CAAC;IAED,IAAI,CAAC,MAAM,EAAE,CAAC;QACb,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;IACzD,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;IACxE,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;IAErE,8BAA8B;IAC9B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO;YACN,OAAO,EAAE,IAAI;YACb,KAAK,EAAE,CAAC;YACR,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;SAClE,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,IAAI,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QACtC,OAAO;YACN,OAAO,EAAE,IAAI;YACb,KAAK,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,GAAG;YACzD,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;SACnE,CAAC;IACH,CAAC;IAED,yBAAyB;IACzB,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,UAAU,GAAG,UAAU,CAAC,MAAM,IAAI,SAAS,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC;QACvE,IAAI,UAAU,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YACrD,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAE/B,4BAA4B;YAC5B,KAAK,IAAI,CAAC,CAAC;YAEX,gCAAgC;YAChC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,IAAI,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,cAAc,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1G,kBAAkB,EAAE,CAAC;gBACrB,KAAK,IAAI,IAAI,CAAC,gBAAgB,GAAG,kBAAkB,CAAC;YACrD,CAAC;iBAAM,CAAC;gBACP,kBAAkB,GAAG,CAAC,CAAC;YACxB,CAAC;YAED,iCAAiC;YACjC,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;gBAC9B,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC;YAC3B,CAAC;YAED,UAAU,EAAE,CAAC;QACd,CAAC;QACD,SAAS,EAAE,CAAC;IACb,CAAC;IAED,+CAA+C;IAC/C,IAAI,UAAU,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;QACpC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;IACzD,CAAC;IAED,yCAAyC;IACzC,MAAM,cAAc,GAAG,SAAS,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC;IAChE,KAAK,IAAI,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC;IAEhD,+BAA+B;IAC/B,qDAAqD;IACrD,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;IACpF,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC;IAEnE,OAAO;QACN,OAAO,EAAE,IAAI;QACb,KAAK,EAAE,eAAe;QACtB,cAAc,EAAE,cAAc;KAC9B,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,WAAW,CAC1B,OAAe,EACf,KAAU,EACV,OAA4B,EAC5B,OAA2B;IAE3B,IAAI,CAAC,OAAO,EAAE,CAAC;QACd,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,EAAE,IAAI;YACV,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE;SACtD,CAAC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,OAAO,GAAgD,EAAE,CAAC;IAEhE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAEjD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACnB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QAC5C,CAAC;IACF,CAAC;IAED,6BAA6B;IAC7B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAEtD,OAAO,OAAO,CAAC;AAChB,CAAC"}

package/dist/utils/hash.d.ts

@@ -0,0 +1,32 @@
+/**
+ * FNV-1a 32-bit hash — fast, non-cryptographic hash with excellent distribution.
+ * Pure integer math, no allocations.
+ */
+export declare function fnv1aHash(s: string): number;
+/**
+ * FNV-1a 64-bit hash — fast, non-cryptographic hash with excellent distribution.
+ * Uses split hi/lo 32-bit integers to avoid BigInt allocation overhead.
+ * The 64-bit prime 0x100000001b3 decomposes as (0x100 << 32) + 0x1b3,
+ * keeping all intermediate products under 2^41 (safe for JS number math).
+ *
+ * Why 64-bit instead of 32-bit:
+ *
+ * The probability of successful token regeneration without a hash collision is
+ * P1 ≈ 1 - 2^-32, which is very high.
+ * But if the token is updated hourly, then the probability for a user
+ * of having a year without consecutive collisions:
+ * PY = P1^hours
+ * which measn that probability of having at least one collision is:
+ * EY = 1 - PY = 2 * 10^-6
+ * Which means that 2 users of 1M have a chance to have it.
+ *
+ * It does not mean that they open an issue, they probably won't even notice.
+ * But it might happen with a real person in real life.
+ *
+ * By using fnv1aHash64 we reduce the chance to 0.
+ */
+export declare function fnv1aHash64(str: string): string;
+export declare function microhash(s: undefined, length: number): undefined;
+export declare function microhash(s: string, length?: number): string;
+export declare function microhash(s: string | undefined, length?: number): string | undefined;
+//# sourceMappingURL=hash.d.ts.map

package/dist/utils/hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../src/utils/hash.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAO3C;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAiB/C;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;AACnE,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;AAC9D,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC"}

package/dist/utils/hash.js

@@ -0,0 +1,53 @@
+/**
+ * FNV-1a 32-bit hash — fast, non-cryptographic hash with excellent distribution.
+ * Pure integer math, no allocations.
+ */
+export function fnv1aHash(s) {
+    let hash = 0x811c9dc5; // FNV offset basis
+    for (let i = 0; i < s.length; i++) {
+        hash ^= s.charCodeAt(i);
+        hash = Math.imul(hash, 0x01000193); // FNV prime, true 32-bit multiply
+    }
+    return hash;
+}
+/**
+ * FNV-1a 64-bit hash — fast, non-cryptographic hash with excellent distribution.
+ * Uses split hi/lo 32-bit integers to avoid BigInt allocation overhead.
+ * The 64-bit prime 0x100000001b3 decomposes as (0x100 << 32) + 0x1b3,
+ * keeping all intermediate products under 2^41 (safe for JS number math).
+ *
+ * Why 64-bit instead of 32-bit:
+ *
+ * The probability of successful token regeneration without a hash collision is
+ * P1 ≈ 1 - 2^-32, which is very high.
+ * But if the token is updated hourly, then the probability for a user
+ * of having a year without consecutive collisions:
+ * PY = P1^hours
+ * which measn that probability of having at least one collision is:
+ * EY = 1 - PY = 2 * 10^-6
+ * Which means that 2 users of 1M have a chance to have it.
+ *
+ * It does not mean that they open an issue, they probably won't even notice.
+ * But it might happen with a real person in real life.
+ *
+ * By using fnv1aHash64 we reduce the chance to 0.
+ */
+export function fnv1aHash64(str) {
+    // FNV-1a 64-bit offset basis: 0xcbf29ce484222325
+    let hi = 0xcbf29ce4;
+    let lo = 0x84222325;
+    for (let i = 0; i < str.length; i++) {
+        lo = (lo ^ str.charCodeAt(i)) >>> 0;
+        // Multiply (hi:lo) by prime 0x100000001b3 = (0x100:0x1b3)
+        const loProduct = lo * 0x1b3;
+        const newLo = loProduct >>> 0;
+        const carry = (loProduct - newLo) / 0x100000000;
+        hi = (hi * 0x1b3 + lo * 0x100 + carry) >>> 0;
+        lo = newLo;
+    }
+    return (hi >>> 0).toString(16).padStart(8, '0') + (lo >>> 0).toString(16).padStart(8, '0');
+}
+export function microhash(s, length = 4) {
+    return !s ? undefined : `@${(fnv1aHash(s) >>> 0).toString(16).padStart(8, '0').substring(0, length)}`;
+}
+//# sourceMappingURL=hash.js.map

package/dist/utils/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../src/utils/hash.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS;IAClC,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,mBAAmB;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,kCAAkC;IACvE,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW;IACtC,iDAAiD;IACjD,IAAI,EAAE,GAAG,UAAU,CAAC;IACpB,IAAI,EAAE,GAAG,UAAU,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAEpC,0DAA0D;QAC1D,MAAM,SAAS,GAAG,EAAE,GAAG,KAAK,CAAC;QAC7B,MAAM,KAAK,GAAG,SAAS,KAAK,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,WAAW,CAAC;QAChD,EAAE,GAAG,CAAC,EAAE,GAAG,KAAK,GAAG,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC7C,EAAE,GAAG,KAAK,CAAC;IACZ,CAAC;IAED,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC5F,CAAC;AAKD,MAAM,UAAU,SAAS,CAAC,CAAqB,EAAE,SAAiB,CAAC;IAClE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC;AACvG,CAAC"}

package/dist/utils/hex.d.ts

@@ -0,0 +1,2 @@
+export { convertToHex, decodeUtf8Hex, encodeUtf8Hex } from '#env/hex.js';
+//# sourceMappingURL=hex.d.ts.map

package/dist/utils/hex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hex.d.ts","sourceRoot":"","sources":["../../src/utils/hex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC"}

package/dist/utils/hex.js

@@ -0,0 +1,2 @@
+export { convertToHex, decodeUtf8Hex, encodeUtf8Hex } from '#env/hex.js';
+//# sourceMappingURL=hex.js.map

package/dist/utils/hex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hex.js","sourceRoot":"","sources":["../../src/utils/hex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC"}

package/dist/utils/hrtime.d.ts

@@ -0,0 +1,4 @@
+import { hrtime } from '#env/hrtime.js';
+export { hrtime };
+export declare function getDurationMilliseconds(start: [number, number]): number;
+//# sourceMappingURL=hrtime.d.ts.map

package/dist/utils/hrtime.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hrtime.d.ts","sourceRoot":"","sources":["../../src/utils/hrtime.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAExC,OAAO,EAAE,MAAM,EAAE,CAAC;AAElB,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAGvE"}

package/dist/utils/hrtime.js

@@ -0,0 +1,7 @@
+import { hrtime } from '#env/hrtime.js';
+export { hrtime };
+export function getDurationMilliseconds(start) {
+    const [secs, nanosecs] = hrtime(start);
+    return secs * 1000 + Math.floor(nanosecs / 1000000);
+}
+//# sourceMappingURL=hrtime.js.map

package/dist/utils/hrtime.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hrtime.js","sourceRoot":"","sources":["../../src/utils/hrtime.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAExC,OAAO,EAAE,MAAM,EAAE,CAAC;AAElB,MAAM,UAAU,uBAAuB,CAAC,KAAuB;IAC9D,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IACvC,OAAO,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC;AACrD,CAAC"}

package/dist/utils/iterable.d.ts

@@ -0,0 +1,65 @@
+export declare function chunk<T>(source: T[], size: number): Iterable<T[]>;
+export declare function chunkByStringLength(source: string[], maxLength: number): Iterable<string[]>;
+export declare function concat<T>(...sources: (Iterable<T> | IterableIterator<T>)[]): Iterable<T>;
+export declare function count<T>(source: Iterable<T> | IterableIterator<T> | undefined, predicate?: (item: T) => boolean): number;
+export declare function every<T>(source: Iterable<T> | IterableIterator<T>, predicate: (item: T) => boolean): boolean;
+export declare function filter<T>(source: Iterable<T | undefined | null> | IterableIterator<T | undefined | null>): Iterable<NonNullable<T>>;
+export declare function filter<T, U extends T>(source: Iterable<T> | IterableIterator<T>, predicate: (item: T) => item is U): Iterable<U>;
+export declare function filter<T>(source: Iterable<T> | IterableIterator<T>, predicate: (item: T) => boolean): Iterable<T>;
+export declare function filterMap<T, TMapped>(source: Iterable<T> | IterableIterator<T>, predicateMapper: (item: T) => TMapped | undefined | null): Iterable<TMapped>;
+export declare function forEach<T>(source: Iterable<T> | IterableIterator<T>, fn: (item: T, index: number) => void): void;
+export declare function find<T>(source: Iterable<T> | IterableIterator<T>, predicate: (item: T) => boolean): T | undefined;
+export declare function findIndex<T>(source: Iterable<T> | IterableIterator<T>, predicate: (item: T) => boolean): number;
+export declare function findLast<T>(source: Iterable<T> | IterableIterator<T>, predicate: (item: T) => boolean): T | undefined;
+export declare function first<T>(source: Iterable<T> | IterableIterator<T>): T | undefined;
+export declare function flatCount<T>(source: Iterable<T> | IterableIterator<T> | undefined, accumulator: (item: T) => number): number;
+export declare function flatMap<T, TMapped>(source: Iterable<T> | IterableIterator<T>, mapper: (item: T) => Iterable<TMapped>): IterableIterator<TMapped>;
+export declare function flatten<T>(source: Iterable<Iterable<T>> | IterableIterator<IterableIterator<T>>): IterableIterator<T>;
+export declare function groupBy<T, K extends PropertyKey>(source: Iterable<T> | IterableIterator<T>, getGroupingKey: (item: T) => K): Record<string, T[]>;
+export declare function groupByMap<TKey, TValue>(source: Iterable<TValue> | IterableIterator<TValue>, getGroupingKey: (item: TValue) => TKey, options?: {
+    filterNullGroups?: boolean;
+}): Map<TKey, TValue[]>;
+export declare function groupByFilterMap<TKey, TValue, TMapped>(source: Iterable<TValue> | IterableIterator<TValue>, getGroupingKey: (item: TValue) => TKey, predicateMapper: (item: TValue) => TMapped | null | undefined): Map<TKey, TMapped[]>;
+export declare function has<T>(source: Iterable<T> | IterableIterator<T>, item: T): boolean;
+export declare function isIterable(source: Iterable<any>): boolean;
+export declare function join(source: Iterable<any>, separator: string): string;
+export declare function last<T>(source: Iterable<T>): T | undefined;
+export declare function map<T, TMapped>(source: Iterable<T> | IterableIterator<T>, mapper: (item: T) => TMapped): IterableIterator<TMapped>;
+export declare function max(source: Iterable<number> | IterableIterator<number>): number;
+export declare function max<T>(source: Iterable<T> | IterableIterator<T>, getValue: (item: T) => number): number;
+export declare function min(source: Iterable<number> | IterableIterator<number>): number;
+export declare function min<T>(source: Iterable<T> | IterableIterator<T>, getValue: (item: T) => number): number;
+export declare function next<T>(source: IterableIterator<T>): T;
+export declare function skip<T>(source: Iterable<T> | IterableIterator<T>, count: number): IterableIterator<T>;
+export declare function slice<T>(source: Iterable<T> | IterableIterator<T>, start: number, end: number): Iterable<T>;
+export declare function some<T>(source: Iterable<T> | IterableIterator<T>, predicate?: (item: T) => boolean): boolean;
+export declare function sum<T extends number>(source: Iterable<T> | IterableIterator<T> | undefined): number;
+export declare function sum<T>(source: Iterable<T> | IterableIterator<T> | undefined, getValue: (item: T) => number): number;
+export declare function take<T>(source: Iterable<T> | IterableIterator<T>, count: number): Iterable<T>;
+export declare function union<T>(...sources: (Iterable<T> | IterableIterator<T> | undefined)[]): Iterable<T>;
+export declare function uniqueBy<TKey, TValue>(source: Iterable<TValue> | IterableIterator<TValue>, getUniqueKey: (item: TValue) => TKey, onDuplicate: (original: TValue, current: TValue) => TValue | void): IterableIterator<TValue>;
+/**
+ * Consumes an async generator and returns its final return value.
+ *
+ * Async generators can both yield values (via `yield`) and return a final value (via `return`).
+ * The `for await` loop only iterates over yielded values and doesn't capture the return value.
+ * This helper consumes all yielded values and returns the final return value.
+ *
+ * @param generator The async generator to consume
+ * @param onProgress Optional callback to process each yielded value
+ * @returns The final return value from the generator, or undefined if the generator doesn't return a value
+ *
+ * @example
+ * ```typescript
+ * async function* myGenerator() {
+ *   yield 1;
+ *   yield 2;
+ *   return { final: 'result' };
+ * }
+ *
+ * const result = await consumeAsyncGenerator(myGenerator());
+ * // result = { final: 'result' }
+ * ```
+ */
+export declare function getAsyncGeneratorReturnValue<TYield, TReturn>(generator: AsyncGenerator<TYield, TReturn, void>, onProgress?: (value: TYield) => void | Promise<void>): Promise<TReturn | undefined>;
+//# sourceMappingURL=iterable.d.ts.map

package/dist/utils/iterable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterable.d.ts","sourceRoot":"","sources":["../../src/utils/iterable.ts"],"names":[],"mappings":"AAmCA,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAEjE;AA6CD,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAE3F;AA2CD,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAExF;AAED,wBAAgB,KAAK,CAAC,CAAC,EACtB,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,SAAS,EACrD,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC9B,MAAM,CAUR;AAED,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAK5G;AAwCD,wBAAgB,MAAM,CAAC,CAAC,EACvB,MAAM,EAAE,QAAQ,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,GAC7E,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5B,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACpC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EACzC,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,IAAI,CAAC,GAC/B,QAAQ,CAAC,CAAC,CAAC,CAAC;AACf,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;AA+CnH,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,EACnC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EACzC,eAAe,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,SAAS,GAAG,IAAI,GACtD,QAAQ,CAAC,OAAO,CAAC,CAEnB;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI,CAMhH;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,GAAG,SAAS,CAKjH;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAO/G;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,GAAG,SAAS,CAQrH;AAED,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAEjF;AAED,wBAAgB,SAAS,CAAC,CAAC,EAC1B,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,SAAS,EACrD,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAC9B,MAAM,CAQR;AAoDD,wBAAgB,OAAO,CAAC,CAAC,EAAE,OAAO,EACjC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EACzC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,QAAQ,CAAC,OAAO,CAAC,GACpC,gBAAgB,CAAC,OAAO,CAAC,CAE3B;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAErH;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,SAAS,WAAW,EAC/C,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EACzC,cAAc,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAC5B,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAerB;AAED,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EACtC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,EACnD,cAAc,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,EACtC,OAAO,CAAC,EAAE;IAAE,gBAAgB,CAAC,EAAE,OAAO,CAAA;CAAE,GACtC,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAkBrB;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EACrD,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,EACnD,cAAc,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,EACtC,eAAe,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,GAAG,IAAI,GAAG,SAAS,GAC3D,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAiBtB;AAED,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,OAAO,CAElF;AAED,wBAAgB,UAAU,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,OAAO,CAEzD;AAED,wBAAgB,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAcrE;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAM1D;AAoCD,wBAAgB,GAAG,CAAC,CAAC,EAAE,OAAO,EAC7B,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EACzC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC1B,gBAAgB,CAAC,OAAO,CAAC,CAE3B;AAED,wBAAgB,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;AACjF,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,CAAC;AAoBzG,wBAAgB,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;AACjF,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,CAAC;AAoBzG,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,CAEtD;AAgDD,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAErG;AAED,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAE3G;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAK5G;AAED,wBAAgB,GAAG,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,MAAM,CAAC;AACrG,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,CAAC;AAsDrH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAE7F;AAmDD,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAEnG;AAED,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EACpC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,EACnD,YAAY,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,EACpC,WAAW,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI,GAC/D,gBAAgB,CAAC,MAAM,CAAC,CAkB1B;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAsB,4BAA4B,CAAC,MAAM,EAAE,OAAO,EACjE,SAAS,EAAE,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,EAChD,UAAU,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,GAClD,OAAO,CAAC,OAAO,GAAG,SAAS,CAAC,CAa9B"}