coding-agent-benchmarks 0.5.0 → 0.5.1

package/dist/utils/dataFetcher.js

@@ -0,0 +1,71 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.fetchUserWithPosts = void 0;
+const fetchWithErrorHandling = async (url) => {
+    try {
+        const response = await fetch(url);
+        if (!response.ok) {
+            const error = {
+                message: `HTTP error ${response.status}: ${response.statusText}`,
+                endpoint: url,
+                statusCode: response.status,
+            };
+            throw new Error(JSON.stringify(error));
+        }
+        const data = await response.json();
+        return data;
+    }
+    catch (error) {
+        if (error instanceof Error && error.message.startsWith('{')) {
+            throw error;
+        }
+        throw new Error(JSON.stringify({
+            message: `Network error: ${error}`,
+            endpoint: url,
+        }));
+    }
+};
+const fetchUserWithPosts = async (userId, baseUrl = 'https://jsonplaceholder.typicode.com') => {
+    try {
+        // Step 1: Fetch user information
+        const user = await fetchWithErrorHandling(`${baseUrl}/users/${userId}`);
+        // Step 2: Fetch user's posts
+        const posts = await fetchWithErrorHandling(`${baseUrl}/posts?userId=${userId}`);
+        // Step 3: Enrich each post with comment counts
+        const enrichedPosts = await Promise.all(posts.map(async (post) => {
+            try {
+                const comments = await fetchWithErrorHandling(`${baseUrl}/comments?postId=${post.id}`);
+                return {
+                    ...post,
+                    commentCount: comments.length,
+                };
+            }
+            catch (error) {
+                // If comment fetching fails, return post with zero comments
+                console.warn(`Failed to fetch comments for post ${post.id}:`, error);
+                return {
+                    ...post,
+                    commentCount: 0,
+                };
+            }
+        }));
+        return {
+            user,
+            posts: enrichedPosts,
+        };
+    }
+    catch (error) {
+        if (error instanceof Error) {
+            try {
+                const fetchError = JSON.parse(error.message);
+                throw new Error(`Failed to fetch user data: ${fetchError.message} (endpoint: ${fetchError.endpoint})`);
+            }
+            catch {
+                throw new Error(`Failed to fetch user data: ${error.message}`);
+            }
+        }
+        throw new Error(`Failed to fetch user data: ${error}`);
+    }
+};
+exports.fetchUserWithPosts = fetchUserWithPosts;
+//# sourceMappingURL=dataFetcher.js.map

package/dist/utils/dataFetcher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dataFetcher.js","sourceRoot":"","sources":["../../src/utils/dataFetcher.ts"],"names":[],"mappings":";;;AAgCA,MAAM,sBAAsB,GAAG,KAAK,EAAK,GAAW,EAAc,EAAE;IAClE,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC;QAElC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;YACjB,MAAM,KAAK,GAAe;gBACxB,OAAO,EAAE,cAAc,QAAQ,CAAC,MAAM,KAAK,QAAQ,CAAC,UAAU,EAAE;gBAChE,QAAQ,EAAE,GAAG;gBACb,UAAU,EAAE,QAAQ,CAAC,MAAM;aAC5B,CAAC;YACF,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QACzC,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;QACnC,OAAO,IAAS,CAAC;IACnB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5D,MAAM,KAAK,CAAC;QACd,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;YAC7B,OAAO,EAAE,kBAAkB,KAAK,EAAE;YAClC,QAAQ,EAAE,GAAG;SACA,CAAC,CAAC,CAAC;IACpB,CAAC;AACH,CAAC,CAAC;AAEK,MAAM,kBAAkB,GAAG,KAAK,EAAE,MAAc,EAAE,UAAkB,sCAAsC,EAG9G,EAAE;IACH,IAAI,CAAC;QACH,iCAAiC;QACjC,MAAM,IAAI,GAAG,MAAM,sBAAsB,CAAO,GAAG,OAAO,UAAU,MAAM,EAAE,CAAC,CAAC;QAE9E,6BAA6B;QAC7B,MAAM,KAAK,GAAG,MAAM,sBAAsB,CAAS,GAAG,OAAO,iBAAiB,MAAM,EAAE,CAAC,CAAC;QAExF,+CAA+C;QAC/C,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,GAAG,CACrC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAyB,EAAE;YAC9C,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,MAAM,sBAAsB,CAC3C,GAAG,OAAO,oBAAoB,IAAI,CAAC,EAAE,EAAE,CACxC,CAAC;gBAEF,OAAO;oBACL,GAAG,IAAI;oBACP,YAAY,EAAE,QAAQ,CAAC,MAAM;iBAC9B,CAAC;YACJ,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,4DAA4D;gBAC5D,OAAO,CAAC,IAAI,CAAC,qCAAqC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;gBACrE,OAAO;oBACL,GAAG,IAAI;oBACP,YAAY,EAAE,CAAC;iBAChB,CAAC;YACJ,CAAC;QACH,CAAC,CAAC,CACH,CAAC;QAEF,OAAO;YACL,IAAI;YACJ,KAAK,EAAE,aAAa;SACrB,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC;gBACH,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAe,CAAC;gBAC3D,MAAM,IAAI,KAAK,CAAC,8BAA8B,UAAU,CAAC,OAAO,eAAe,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC;YACzG,CAAC;YAAC,MAAM,CAAC;gBACP,MAAM,IAAI,KAAK,CAAC,8BAA8B,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,8BAA8B,KAAK,EAAE,CAAC,CAAC;IACzD,CAAC;AACH,CAAC,CAAC;AAjDW,QAAA,kBAAkB,sBAiD7B"}

package/dist/utils/imageProcessor.d.ts

@@ -0,0 +1,16 @@
+interface ImageProcessingOptions {
+    readonly width?: number;
+    readonly height?: number;
+    readonly fit?: 'cover' | 'contain' | 'fill' | 'inside' | 'outside';
+    readonly format?: 'jpeg' | 'png' | 'webp';
+    readonly quality?: number;
+}
+interface ProcessingResult {
+    readonly filePath: string;
+    readonly success: boolean;
+    readonly outputPath?: string;
+    readonly error?: string;
+}
+export declare const processBatchImages: (inputPaths: readonly string[], outputDir: string, options?: ImageProcessingOptions) => Promise<readonly ProcessingResult[]>;
+export type { ImageProcessingOptions, ProcessingResult };
+//# sourceMappingURL=imageProcessor.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"imageProcessor.d.ts","sourceRoot":"","sources":["../../src/utils/imageProcessor.ts"],"names":[],"mappings":"AAIA,UAAU,sBAAsB;IAC9B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,GAAG,CAAC,EAAE,OAAO,GAAG,SAAS,GAAG,MAAM,GAAG,QAAQ,GAAG,SAAS,CAAC;IACnE,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,KAAK,GAAG,MAAM,CAAC;IAC1C,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,UAAU,gBAAgB;IACxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAwFD,eAAO,MAAM,kBAAkB,GAC7B,YAAY,SAAS,MAAM,EAAE,EAC7B,WAAW,MAAM,EACjB,UAAS,sBAA2B,KACnC,OAAO,CAAC,SAAS,gBAAgB,EAAE,CASrC,CAAC;AAEF,YAAY,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,CAAC"}

package/dist/utils/imageProcessor.js

@@ -0,0 +1,121 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.processBatchImages = void 0;
+const fs = __importStar(require("fs/promises"));
+const path = __importStar(require("path"));
+const sharp_1 = __importDefault(require("sharp"));
+const SUPPORTED_FORMATS = ['jpg', 'jpeg', 'png', 'webp', 'gif', 'tiff', 'svg'];
+const getFileExtension = (filePath) => {
+    return path.extname(filePath).toLowerCase().slice(1);
+};
+const isValidImageFormat = (filePath) => {
+    const ext = getFileExtension(filePath);
+    return SUPPORTED_FORMATS.includes(ext);
+};
+const ensureDirectoryExists = async (dirPath) => {
+    try {
+        await fs.access(dirPath);
+    }
+    catch {
+        await fs.mkdir(dirPath, { recursive: true });
+    }
+};
+const processImage = async (inputPath, outputDir, options) => {
+    try {
+        if (!isValidImageFormat(inputPath)) {
+            return {
+                filePath: inputPath,
+                success: false,
+                error: `Unsupported image format. Supported: ${SUPPORTED_FORMATS.join(', ')}`
+            };
+        }
+        const fileExists = await fs.access(inputPath)
+            .then(() => true)
+            .catch(() => false);
+        if (!fileExists) {
+            return {
+                filePath: inputPath,
+                success: false,
+                error: 'File does not exist'
+            };
+        }
+        await ensureDirectoryExists(outputDir);
+        const fileName = path.basename(inputPath);
+        const fileNameWithoutExt = path.parse(fileName).name;
+        const outputFormat = options.format || getFileExtension(inputPath);
+        const outputFileName = `${fileNameWithoutExt}.${outputFormat}`;
+        const outputPath = path.join(outputDir, outputFileName);
+        let transform = (0, sharp_1.default)(inputPath);
+        if (options.width || options.height) {
+            transform = transform.resize({
+                width: options.width,
+                height: options.height,
+                fit: options.fit || 'cover'
+            });
+        }
+        if (options.format) {
+            transform = transform.toFormat(options.format, {
+                quality: options.quality || 80
+            });
+        }
+        await transform.toFile(outputPath);
+        return {
+            filePath: inputPath,
+            success: true,
+            outputPath
+        };
+    }
+    catch (error) {
+        return {
+            filePath: inputPath,
+            success: false,
+            error: error instanceof Error ? error.message : String(error)
+        };
+    }
+};
+const processBatchImages = async (inputPaths, outputDir, options = {}) => {
+    const results = [];
+    for (const inputPath of inputPaths) {
+        const result = await processImage(inputPath, outputDir, options);
+        results.push(result);
+    }
+    return results;
+};
+exports.processBatchImages = processBatchImages;
+//# sourceMappingURL=imageProcessor.js.map

package/dist/utils/imageProcessor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"imageProcessor.js","sourceRoot":"","sources":["../../src/utils/imageProcessor.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,gDAAkC;AAClC,2CAA6B;AAC7B,kDAA0B;AAiB1B,MAAM,iBAAiB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAU,CAAC;AAExF,MAAM,gBAAgB,GAAG,CAAC,QAAgB,EAAU,EAAE;IACpD,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC,CAAC;AAEF,MAAM,kBAAkB,GAAG,CAAC,QAAgB,EAAW,EAAE;IACvD,MAAM,GAAG,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACvC,OAAO,iBAAiB,CAAC,QAAQ,CAAC,GAAuC,CAAC,CAAC;AAC7E,CAAC,CAAC;AAEF,MAAM,qBAAqB,GAAG,KAAK,EAAE,OAAe,EAAiB,EAAE;IACrE,IAAI,CAAC;QACH,MAAM,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC/C,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,KAAK,EACxB,SAAiB,EACjB,SAAiB,EACjB,OAA+B,EACJ,EAAE;IAC7B,IAAI,CAAC;QACH,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,EAAE,CAAC;YACnC,OAAO;gBACL,QAAQ,EAAE,SAAS;gBACnB,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,wCAAwC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;aAC9E,CAAC;QACJ,CAAC;QAED,MAAM,UAAU,GAAG,MAAM,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC;aAC1C,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC;aAChB,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAEtB,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO;gBACL,QAAQ,EAAE,SAAS;gBACnB,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,qBAAqB;aAC7B,CAAC;QACJ,CAAC;QAED,MAAM,qBAAqB,CAAC,SAAS,CAAC,CAAC;QAEvC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC1C,MAAM,kBAAkB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC;QACrD,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,IAAI,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACnE,MAAM,cAAc,GAAG,GAAG,kBAAkB,IAAI,YAAY,EAAE,CAAC;QAC/D,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QAExD,IAAI,SAAS,GAAG,IAAA,eAAK,EAAC,SAAS,CAAC,CAAC;QAEjC,IAAI,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACpC,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,KAAK,EAAE,OAAO,CAAC,KAAK;gBACpB,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,GAAG,EAAE,OAAO,CAAC,GAAG,IAAI,OAAO;aAC5B,CAAC,CAAC;QACL,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE;gBAC7C,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,EAAE;aAC/B,CAAC,CAAC;QACL,CAAC;QAED,MAAM,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAEnC,OAAO;YACL,QAAQ,EAAE,SAAS;YACnB,OAAO,EAAE,IAAI;YACb,UAAU;SACX,CAAC;IAEJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,QAAQ,EAAE,SAAS;YACnB,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;SAC9D,CAAC;IACJ,CAAC;AACH,CAAC,CAAC;AAEK,MAAM,kBAAkB,GAAG,KAAK,EACrC,UAA6B,EAC7B,SAAiB,EACjB,UAAkC,EAAE,EACE,EAAE;IACxC,MAAM,OAAO,GAAuB,EAAE,CAAC;IAEvC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QACjE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAbW,QAAA,kBAAkB,sBAa7B"}

package/dist/utils/lcs.d.ts

@@ -0,0 +1,37 @@
+/**
+ * Result of the longest common subsequence computation
+ */
+export interface LCSResult {
+    readonly subsequence: string;
+    readonly length: number;
+    readonly matrix: readonly (readonly number[])[];
+}
+/**
+ * Finds the longest common subsequence (LCS) between two strings using dynamic programming.
+ *
+ * Uses a 2D matrix where dp[i][j] represents the length of LCS of str1[0...i-1] and str2[0...j-1].
+ * Time complexity: O(m * n) where m and n are the lengths of the input strings.
+ * Space complexity: O(m * n) for the DP matrix.
+ *
+ * @param str1 - First input string
+ * @param str2 - Second input string
+ * @returns Object containing the LCS string, its length, and the DP matrix
+ */
+export declare const findLongestCommonSubsequence: (str1: string, str2: string) => LCSResult;
+/**
+ * Optimized space-complexity version using only two rows instead of full matrix.
+ * Time complexity: O(m * n)
+ * Space complexity: O(min(m, n))
+ *
+ * Note: This version only returns the length, not the actual subsequence,
+ * since we don't retain the full matrix needed for backtracking.
+ */
+export declare const findLCSLengthOptimized: (str1: string, str2: string) => number;
+/**
+ * Finds all possible longest common subsequences between two strings.
+ * There can be multiple LCS with the same maximum length.
+ *
+ * @returns Array of all LCS strings with maximum length
+ */
+export declare const findAllLCS: (str1: string, str2: string) => readonly string[];
+//# sourceMappingURL=lcs.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"lcs.d.ts","sourceRoot":"","sources":["../../src/utils/lcs.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAAC;CACjD;AAED;;;;;;;;;;GAUG;AACH,eAAO,MAAM,4BAA4B,GACvC,MAAM,MAAM,EACZ,MAAM,MAAM,KACX,SA8BF,CAAC;AA+BF;;;;;;;GAOG;AACH,eAAO,MAAM,sBAAsB,GAAI,MAAM,MAAM,EAAE,MAAM,MAAM,KAAG,MAwBnE,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,UAAU,GAAI,MAAM,MAAM,EAAE,MAAM,MAAM,KAAG,SAAS,MAAM,EAyCtE,CAAC"}

package/dist/utils/lcs.js

@@ -0,0 +1,139 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findAllLCS = exports.findLCSLengthOptimized = exports.findLongestCommonSubsequence = void 0;
+/**
+ * Finds the longest common subsequence (LCS) between two strings using dynamic programming.
+ *
+ * Uses a 2D matrix where dp[i][j] represents the length of LCS of str1[0...i-1] and str2[0...j-1].
+ * Time complexity: O(m * n) where m and n are the lengths of the input strings.
+ * Space complexity: O(m * n) for the DP matrix.
+ *
+ * @param str1 - First input string
+ * @param str2 - Second input string
+ * @returns Object containing the LCS string, its length, and the DP matrix
+ */
+const findLongestCommonSubsequence = (str1, str2) => {
+    const m = str1.length;
+    const n = str2.length;
+    // Initialize DP matrix with zeros
+    const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0));
+    // Build the DP matrix using bottom-up approach
+    for (let i = 1; i <= m; i++) {
+        for (let j = 1; j <= n; j++) {
+            if (str1[i - 1] === str2[j - 1]) {
+                // Characters match: extend the LCS from diagonal
+                dp[i][j] = dp[i - 1][j - 1] + 1;
+            }
+            else {
+                // Characters don't match: take max from left or top
+                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
+            }
+        }
+    }
+    // Backtrack through the matrix to reconstruct the actual subsequence
+    const subsequence = backtrackLCS(str1, str2, dp, m, n);
+    return {
+        subsequence,
+        length: dp[m][n],
+        matrix: dp,
+    };
+};
+exports.findLongestCommonSubsequence = findLongestCommonSubsequence;
+/**
+ * Reconstructs the LCS string by backtracking through the DP matrix.
+ * Starts from bottom-right corner and moves towards top-left based on how values were computed.
+ */
+const backtrackLCS = (str1, str2, dp, i, j) => {
+    // Base case: reached the edge of the matrix
+    if (i === 0 || j === 0) {
+        return "";
+    }
+    // If characters match, this character is part of LCS
+    if (str1[i - 1] === str2[j - 1]) {
+        return backtrackLCS(str1, str2, dp, i - 1, j - 1) + str1[i - 1];
+    }
+    // Move in the direction of larger value (how we computed dp[i][j])
+    if (dp[i - 1][j] > dp[i][j - 1]) {
+        return backtrackLCS(str1, str2, dp, i - 1, j);
+    }
+    else {
+        return backtrackLCS(str1, str2, dp, i, j - 1);
+    }
+};
+/**
+ * Optimized space-complexity version using only two rows instead of full matrix.
+ * Time complexity: O(m * n)
+ * Space complexity: O(min(m, n))
+ *
+ * Note: This version only returns the length, not the actual subsequence,
+ * since we don't retain the full matrix needed for backtracking.
+ */
+const findLCSLengthOptimized = (str1, str2) => {
+    // Ensure str2 is the shorter string to minimize space usage
+    if (str1.length < str2.length) {
+        [str1, str2] = [str2, str1];
+    }
+    const n = str2.length;
+    let prev = Array(n + 1).fill(0);
+    let curr = Array(n + 1).fill(0);
+    str1.split("").forEach((char1) => {
+        for (let j = 1; j <= n; j++) {
+            if (char1 === str2[j - 1]) {
+                curr[j] = prev[j - 1] + 1;
+            }
+            else {
+                curr[j] = Math.max(prev[j], curr[j - 1]);
+            }
+        }
+        // Swap rows for next iteration
+        [prev, curr] = [curr, prev];
+        curr.fill(0);
+    });
+    return prev[n];
+};
+exports.findLCSLengthOptimized = findLCSLengthOptimized;
+/**
+ * Finds all possible longest common subsequences between two strings.
+ * There can be multiple LCS with the same maximum length.
+ *
+ * @returns Array of all LCS strings with maximum length
+ */
+const findAllLCS = (str1, str2) => {
+    const m = str1.length;
+    const n = str2.length;
+    const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0));
+    // Build DP matrix
+    for (let i = 1; i <= m; i++) {
+        for (let j = 1; j <= n; j++) {
+            if (str1[i - 1] === str2[j - 1]) {
+                dp[i][j] = dp[i - 1][j - 1] + 1;
+            }
+            else {
+                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
+            }
+        }
+    }
+    // Collect all LCS using DFS with memoization to avoid duplicates
+    const allLCS = new Set();
+    const collectAllLCS = (i, j, current) => {
+        if (i === 0 || j === 0) {
+            allLCS.add(current);
+            return;
+        }
+        if (str1[i - 1] === str2[j - 1]) {
+            collectAllLCS(i - 1, j - 1, str1[i - 1] + current);
+        }
+        else {
+            if (dp[i - 1][j] >= dp[i][j - 1]) {
+                collectAllLCS(i - 1, j, current);
+            }
+            if (dp[i][j - 1] >= dp[i - 1][j]) {
+                collectAllLCS(i, j - 1, current);
+            }
+        }
+    };
+    collectAllLCS(m, n, "");
+    return Array.from(allLCS);
+};
+exports.findAllLCS = findAllLCS;
+//# sourceMappingURL=lcs.js.map

package/dist/utils/lcs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lcs.js","sourceRoot":"","sources":["../../src/utils/lcs.ts"],"names":[],"mappings":";;;AASA;;;;;;;;;;GAUG;AACI,MAAM,4BAA4B,GAAG,CAC1C,IAAY,EACZ,IAAY,EACD,EAAE;IACb,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAEtB,kCAAkC;IAClC,MAAM,EAAE,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CACxD,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACrB,CAAC;IAEF,+CAA+C;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAChC,iDAAiD;gBACjD,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACN,oDAAoD;gBACpD,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,MAAM,WAAW,GAAG,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAEvD,OAAO;QACL,WAAW;QACX,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,EAAE,EAAE;KACX,CAAC;AACJ,CAAC,CAAC;AAjCW,QAAA,4BAA4B,gCAiCvC;AAEF;;;GAGG;AACH,MAAM,YAAY,GAAG,CACnB,IAAY,EACZ,IAAY,EACZ,EAAkC,EAClC,CAAS,EACT,CAAS,EACD,EAAE;IACV,4CAA4C;IAC5C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,qDAAqD;IACrD,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAChC,OAAO,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,mEAAmE;IACnE,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAChC,OAAO,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;SAAM,CAAC;QACN,OAAO,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC;AACH,CAAC,CAAC;AAEF;;;;;;;GAOG;AACI,MAAM,sBAAsB,GAAG,CAAC,IAAY,EAAE,IAAY,EAAU,EAAE;IAC3E,4DAA4D;IAC5D,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,IAAI,GAAa,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,IAAI,IAAI,GAAa,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE1C,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,+BAA+B;QAC/B,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;IAEH,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC,CAAC;AAxBW,QAAA,sBAAsB,0BAwBjC;AAEF;;;;;GAKG;AACI,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,IAAY,EAAqB,EAAE;IAC1E,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAEtB,MAAM,EAAE,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CACxD,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACrB,CAAC;IAEF,kBAAkB;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAChC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACN,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,OAAe,EAAQ,EAAE;QACpE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACpB,OAAO;QACT,CAAC;QAED,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAChC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;QACrD,CAAC;aAAM,CAAC;YACN,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACjC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YACnC,CAAC;YACD,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjC,aAAa,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IACxB,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC5B,CAAC,CAAC;AAzCW,QAAA,UAAU,cAyCrB"}

package/dist/utils/notifications.d.ts

@@ -0,0 +1,2 @@
+export declare const sendNotificationToUsers: (userIds: readonly string[], sendNotification: (userId: string) => Promise<void>) => Promise<void>;
+//# sourceMappingURL=notifications.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"notifications.d.ts","sourceRoot":"","sources":["../../src/utils/notifications.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,uBAAuB,GAClC,SAAS,SAAS,MAAM,EAAE,EAC1B,kBAAkB,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,KAClD,OAAO,CAAC,IAAI,CAEd,CAAC"}

package/dist/utils/notifications.js

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sendNotificationToUsers = void 0;
+const sendNotificationToUsers = async (userIds, sendNotification) => {
+    await Promise.all(userIds.map((userId) => sendNotification(userId)));
+};
+exports.sendNotificationToUsers = sendNotificationToUsers;
+//# sourceMappingURL=notifications.js.map

package/dist/utils/notifications.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"notifications.js","sourceRoot":"","sources":["../../src/utils/notifications.ts"],"names":[],"mappings":";;;AAAO,MAAM,uBAAuB,GAAG,KAAK,EAC1C,OAA0B,EAC1B,gBAAmD,EACpC,EAAE;IACjB,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACvE,CAAC,CAAC;AALW,QAAA,uBAAuB,2BAKlC"}

package/dist/utils/timeUtils.d.ts

@@ -1,3 +1,6 @@
+/**
+ * Time difference units
+ */
 export interface TimeDifference {
     milliseconds: number;
     seconds: number;
@@ -5,5 +8,17 @@ export interface TimeDifference {
     hours: number;
     days: number;
 }
-export declare const calculateTimeDifference: (startDate: Date, endDate: Date) => TimeDifference;
+/**
+ * Calculate the absolute time difference between two dates
+ */
+export declare const getTimeDifference: (date1: Date, date2: Date) => TimeDifference;
+/**
+ * Calculate the signed time difference between two dates (date2 - date1)
+ * Positive if date2 is after date1, negative if before
+ */
+export declare const getSignedTimeDifference: (date1: Date, date2: Date) => TimeDifference;
+/**
+ * Format time difference as human-readable string
+ */
+export declare const formatTimeDifference: (diff: TimeDifference) => string;
 //# sourceMappingURL=timeUtils.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"timeUtils.d.ts","sourceRoot":"","sources":["../../src/utils/timeUtils.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,cAAc;IAC7B,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd;AAkBD,eAAO,MAAM,uBAAuB,GAAI,WAAW,IAAI,EAAE,SAAS,IAAI,KAAG,cAUxE,CAAC"}
+{"version":3,"file":"timeUtils.d.ts","sourceRoot":"","sources":["../../src/utils/timeUtils.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd;AAoBD;;GAEG;AACH,eAAO,MAAM,iBAAiB,GAC5B,OAAO,IAAI,EACX,OAAO,IAAI,KACV,cAGF,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,uBAAuB,GAClC,OAAO,IAAI,EACX,OAAO,IAAI,KACV,cAGF,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,oBAAoB,GAAI,MAAM,cAAc,KAAG,MAmB3D,CAAC"}

package/dist/utils/timeUtils.js

@@ -1,23 +1,60 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.calculateTimeDifference = void 0;
-const MILLISECONDS_PER_SECOND = 1000;
-const SECONDS_PER_MINUTE = 60;
-const MINUTES_PER_HOUR = 60;
-const HOURS_PER_DAY = 24;
-const millisecondsToSeconds = (ms) => ms / MILLISECONDS_PER_SECOND;
-const millisecondsToMinutes = (ms) => ms / (MILLISECONDS_PER_SECOND * SECONDS_PER_MINUTE);
-const millisecondsToHours = (ms) => ms / (MILLISECONDS_PER_SECOND * SECONDS_PER_MINUTE * MINUTES_PER_HOUR);
-const millisecondsToDays = (ms) => ms / (MILLISECONDS_PER_SECOND * SECONDS_PER_MINUTE * MINUTES_PER_HOUR * HOURS_PER_DAY);
-const calculateTimeDifference = (startDate, endDate) => {
-    const milliseconds = Math.abs(endDate.getTime() - startDate.getTime());
+exports.formatTimeDifference = exports.getSignedTimeDifference = exports.getTimeDifference = void 0;
+/**
+ * Convert milliseconds to other time units
+ */
+const convertMilliseconds = (ms) => {
+    const seconds = ms / 1000;
+    const minutes = seconds / 60;
+    const hours = minutes / 60;
+    const days = hours / 24;
     return {
-        milliseconds,
-        seconds: millisecondsToSeconds(milliseconds),
-        minutes: millisecondsToMinutes(milliseconds),
-        hours: millisecondsToHours(milliseconds),
-        days: millisecondsToDays(milliseconds),
+        milliseconds: ms,
+        seconds,
+        minutes,
+        hours,
+        days,
     };
 };
-exports.calculateTimeDifference = calculateTimeDifference;
+/**
+ * Calculate the absolute time difference between two dates
+ */
+const getTimeDifference = (date1, date2) => {
+    const ms = Math.abs(date1.getTime() - date2.getTime());
+    return convertMilliseconds(ms);
+};
+exports.getTimeDifference = getTimeDifference;
+/**
+ * Calculate the signed time difference between two dates (date2 - date1)
+ * Positive if date2 is after date1, negative if before
+ */
+const getSignedTimeDifference = (date1, date2) => {
+    const ms = date2.getTime() - date1.getTime();
+    return convertMilliseconds(ms);
+};
+exports.getSignedTimeDifference = getSignedTimeDifference;
+/**
+ * Format time difference as human-readable string
+ */
+const formatTimeDifference = (diff) => {
+    const absDays = Math.abs(diff.days);
+    const absHours = Math.abs(diff.hours);
+    const absMinutes = Math.abs(diff.minutes);
+    const absSeconds = Math.abs(diff.seconds);
+    if (absDays >= 1) {
+        return `${diff.days.toFixed(2)} days`;
+    }
+    if (absHours >= 1) {
+        return `${diff.hours.toFixed(2)} hours`;
+    }
+    if (absMinutes >= 1) {
+        return `${diff.minutes.toFixed(2)} minutes`;
+    }
+    if (absSeconds >= 1) {
+        return `${diff.seconds.toFixed(2)} seconds`;
+    }
+    return `${diff.milliseconds} milliseconds`;
+};
+exports.formatTimeDifference = formatTimeDifference;
 //# sourceMappingURL=timeUtils.js.map

package/dist/utils/timeUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"timeUtils.js","sourceRoot":"","sources":["../../src/utils/timeUtils.ts"],"names":[],"mappings":";;;AAQA,MAAM,uBAAuB,GAAG,IAAI,CAAC;AACrC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAC9B,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAC5B,MAAM,aAAa,GAAG,EAAE,CAAC;AAEzB,MAAM,qBAAqB,GAAG,CAAC,EAAU,EAAU,EAAE,CAAC,EAAE,GAAG,uBAAuB,CAAC;AAEnF,MAAM,qBAAqB,GAAG,CAAC,EAAU,EAAU,EAAE,CACnD,EAAE,GAAG,CAAC,uBAAuB,GAAG,kBAAkB,CAAC,CAAC;AAEtD,MAAM,mBAAmB,GAAG,CAAC,EAAU,EAAU,EAAE,CACjD,EAAE,GAAG,CAAC,uBAAuB,GAAG,kBAAkB,GAAG,gBAAgB,CAAC,CAAC;AAEzE,MAAM,kBAAkB,GAAG,CAAC,EAAU,EAAU,EAAE,CAChD,EAAE,GAAG,CAAC,uBAAuB,GAAG,kBAAkB,GAAG,gBAAgB,GAAG,aAAa,CAAC,CAAC;AAElF,MAAM,uBAAuB,GAAG,CAAC,SAAe,EAAE,OAAa,EAAkB,EAAE;IACxF,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;IAEvE,OAAO;QACL,YAAY;QACZ,OAAO,EAAE,qBAAqB,CAAC,YAAY,CAAC;QAC5C,OAAO,EAAE,qBAAqB,CAAC,YAAY,CAAC;QAC5C,KAAK,EAAE,mBAAmB,CAAC,YAAY,CAAC;QACxC,IAAI,EAAE,kBAAkB,CAAC,YAAY,CAAC;KACvC,CAAC;AACJ,CAAC,CAAC;AAVW,QAAA,uBAAuB,2BAUlC"}
+{"version":3,"file":"timeUtils.js","sourceRoot":"","sources":["../../src/utils/timeUtils.ts"],"names":[],"mappings":";;;AAWA;;GAEG;AACH,MAAM,mBAAmB,GAAG,CAAC,EAAU,EAAkB,EAAE;IACzD,MAAM,OAAO,GAAG,EAAE,GAAG,IAAI,CAAC;IAC1B,MAAM,OAAO,GAAG,OAAO,GAAG,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,OAAO,GAAG,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;IAExB,OAAO;QACL,YAAY,EAAE,EAAE;QAChB,OAAO;QACP,OAAO;QACP,KAAK;QACL,IAAI;KACL,CAAC;AACJ,CAAC,CAAC;AAEF;;GAEG;AACI,MAAM,iBAAiB,GAAG,CAC/B,KAAW,EACX,KAAW,EACK,EAAE;IAClB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IACvD,OAAO,mBAAmB,CAAC,EAAE,CAAC,CAAC;AACjC,CAAC,CAAC;AANW,QAAA,iBAAiB,qBAM5B;AAEF;;;GAGG;AACI,MAAM,uBAAuB,GAAG,CACrC,KAAW,EACX,KAAW,EACK,EAAE;IAClB,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;IAC7C,OAAO,mBAAmB,CAAC,EAAE,CAAC,CAAC;AACjC,CAAC,CAAC;AANW,QAAA,uBAAuB,2BAMlC;AAEF;;GAEG;AACI,MAAM,oBAAoB,GAAG,CAAC,IAAoB,EAAU,EAAE;IACnE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAE1C,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;IACxC,CAAC;IACD,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;QAClB,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC1C,CAAC;IACD,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;QACpB,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC;IAC9C,CAAC;IACD,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;QACpB,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC;IAC9C,CAAC;IACD,OAAO,GAAG,IAAI,CAAC,YAAY,eAAe,CAAC;AAC7C,CAAC,CAAC;AAnBW,QAAA,oBAAoB,wBAmB/B"}

package/dist/utils/userReport.d.ts

@@ -0,0 +1,10 @@
+/**
+ * User report printing utilities
+ */
+export interface UserWithStatus {
+    name: string;
+    email: string;
+    accountStatus: string;
+}
+export declare const printUserReport: (users: readonly UserWithStatus[]) => void;
+//# sourceMappingURL=userReport.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"userReport.d.ts","sourceRoot":"","sources":["../../src/utils/userReport.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,eAAO,MAAM,eAAe,GAAI,OAAO,SAAS,cAAc,EAAE,KAAG,IAYlE,CAAC"}

package/dist/utils/userReport.js

@@ -0,0 +1,19 @@
+"use strict";
+/**
+ * User report printing utilities
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.printUserReport = void 0;
+const printUserReport = (users) => {
+    console.log('\n=== User Report ===\n');
+    users.forEach((user, index) => {
+        console.log(`User #${index + 1}:`);
+        console.log(`  Name:           ${user.name}`);
+        console.log(`  Email:          ${user.email}`);
+        console.log(`  Account Status: ${user.accountStatus}`);
+        console.log('');
+    });
+    console.log(`Total Users: ${users.length}\n`);
+};
+exports.printUserReport = printUserReport;
+//# sourceMappingURL=userReport.js.map

package/dist/utils/userReport.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"userReport.js","sourceRoot":"","sources":["../../src/utils/userReport.ts"],"names":[],"mappings":";AAAA;;GAEG;;;AAQI,MAAM,eAAe,GAAG,CAAC,KAAgC,EAAQ,EAAE;IACxE,OAAO,CAAC,GAAG,CAAC,yBAAyB,CAAC,CAAC;IAEvC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QAC5B,OAAO,CAAC,GAAG,CAAC,SAAS,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,CAAC,GAAG,CAAC,qBAAqB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC9C,OAAO,CAAC,GAAG,CAAC,qBAAqB,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC/C,OAAO,CAAC,GAAG,CAAC,qBAAqB,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QACvD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,GAAG,CAAC,gBAAgB,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;AAChD,CAAC,CAAC;AAZW,QAAA,eAAe,mBAY1B"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "coding-agent-benchmarks",
-  "version": "0.5.0",
+  "version": "0.5.1",
   "description": "Testing coding agents (GitHub Copilot CLI, Claude Code, etc.) with your repo's context to evaluate their code generation quality.",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",