@polka-codes/cli 0.1.6 → 0.1.8

package/dist/utils/listFiles.js

@@ -1,100 +0,0 @@
-import { promises as fs } from 'node:fs';
-import { join, relative, resolve } from 'node:path';
-import ignore from 'ignore';
-/** Default patterns commonly ignored in projects of various languages. */
-const DEFAULT_IGNORES = [
-    '__pycache__',
-    '.DS_Store',
-    '.env',
-    '.git',
-    '.idea',
-    '.svn',
-    '.temp',
-    '.vscode',
-    'coverage',
-    'dist',
-    'node_modules',
-    'out',
-    'Thumbs.db',
-];
-/**
- * Reads a `.gitignore` file in `dirPath` (if it exists) and appends its lines
- * to the `basePatterns`. Returns a new array without mutating the original.
- */
-async function extendPatterns(basePatterns, dirPath) {
-    try {
-        const gitignorePath = join(dirPath, '.gitignore');
-        const content = await fs.readFile(gitignorePath, 'utf8');
-        const lines = content.split(/\r?\n/).filter(Boolean);
-        return [...basePatterns, ...lines];
-    }
-    catch {
-        // No .gitignore or unreadable
-        return basePatterns;
-    }
-}
-/** Creates an `ignore` instance from the given patterns. */
-function createIgnore(patterns) {
-    return ignore().add(patterns);
-}
-/**
- * Lists files under `dirPath` in BFS order, respecting:
- *   - A default set of ignores
- *   - A root .gitignore under `cwd`
- *   - Any .gitignore files in child directories (merged as we go)
- *
- * Returns `[files, limitReached]`:
- *   - `files` is the array of file paths (relative to `cwd`)
- *   - `limitReached` is `true` if `maxCount` was hit, otherwise `false`
- */
-export async function listFiles(dirPath, recursive, maxCount, cwd) {
-    // Merge default ignores with root .gitignore (if found)
-    let rootPatterns = [...DEFAULT_IGNORES];
-    try {
-        const rootGitignore = await fs.readFile(join(cwd, '.gitignore'), 'utf8');
-        const lines = rootGitignore.split(/\r?\n/).filter(Boolean);
-        rootPatterns = [...rootPatterns, ...lines];
-    }
-    catch {
-        // No .gitignore at root or unreadable; ignore silently
-    }
-    // Final results (relative to `cwd`) and indicator if we reached the limit
-    const results = [];
-    // BFS queue
-    // Each entry holds the directory path and the patterns inherited from its parent
-    const queue = [{ path: resolve(dirPath), patterns: rootPatterns }];
-    // Perform BFS until queue is empty or maxCount is reached
-    while (queue.length > 0) {
-        // biome-ignore lint/style/noNonNullAssertion: checked above
-        const { path: currentPath, patterns: parentPatterns } = queue.shift();
-        // Merge parent's patterns with local .gitignore
-        const mergedPatterns = await extendPatterns(parentPatterns, currentPath);
-        const folderIg = createIgnore(mergedPatterns);
-        const entries = await fs.readdir(currentPath, { withFileTypes: true });
-        for (const entry of entries) {
-            const fullPath = join(currentPath, entry.name);
-            // Convert full path to something relative to `cwd`
-            const relPath = relative(cwd, fullPath).replace(/\\/g, '/');
-            if (folderIg.ignores(relPath)) {
-                continue; // Skip ignored entries
-            }
-            if (entry.isDirectory()) {
-                if (recursive) {
-                    queue.push({ path: fullPath, patterns: mergedPatterns });
-                }
-            }
-            else {
-                results.push(relPath);
-                if (results.length >= maxCount) {
-                    results.sort();
-                    // Stop searching as soon as we reach maxCount
-                    return [results, true];
-                }
-            }
-        }
-    }
-    results.sort();
-    // If we exhaust the BFS queue, we did not reach maxCount
-    return [results, false];
-}
-//# sourceMappingURL=listFiles.js.map

package/dist/utils/listFiles.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"listFiles.js","sourceRoot":"","sources":["../../src/utils/listFiles.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,SAAS,CAAA;AACxC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AACnD,OAAO,MAAuB,MAAM,QAAQ,CAAA;AAE5C,0EAA0E;AAC1E,MAAM,eAAe,GAAG;IACtB,aAAa;IACb,WAAW;IACX,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,OAAO;IACP,SAAS;IACT,UAAU;IACV,MAAM;IACN,cAAc;IACd,KAAK;IACL,WAAW;CACZ,CAAA;AAED;;;GAGG;AACH,KAAK,UAAU,cAAc,CAAC,YAAsB,EAAE,OAAe;IACnE,IAAI,CAAC;QACH,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;QACjD,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC,CAAA;QACxD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QACpD,OAAO,CAAC,GAAG,YAAY,EAAE,GAAG,KAAK,CAAC,CAAA;IACpC,CAAC;IAAC,MAAM,CAAC;QACP,8BAA8B;QAC9B,OAAO,YAAY,CAAA;IACrB,CAAC;AACH,CAAC;AAED,4DAA4D;AAC5D,SAAS,YAAY,CAAC,QAAkB;IACtC,OAAO,MAAM,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;AAC/B,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,OAAe,EAAE,SAAkB,EAAE,QAAgB,EAAE,GAAW;IAChG,wDAAwD;IACxD,IAAI,YAAY,GAAG,CAAC,GAAG,eAAe,CAAC,CAAA;IACvC,IAAI,CAAC;QACH,MAAM,aAAa,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,EAAE,MAAM,CAAC,CAAA;QACxE,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QAC1D,YAAY,GAAG,CAAC,GAAG,YAAY,EAAE,GAAG,KAAK,CAAC,CAAA;IAC5C,CAAC;IAAC,MAAM,CAAC;QACP,uDAAuD;IACzD,CAAC;IAED,0EAA0E;IAC1E,MAAM,OAAO,GAAa,EAAE,CAAA;IAE5B,YAAY;IACZ,iFAAiF;IACjF,MAAM,KAAK,GAAgD,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC,CAAA;IAE/G,0DAA0D;IAC1D,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,4DAA4D;QAC5D,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QAEtE,gDAAgD;QAChD,MAAM,cAAc,GAAG,MAAM,cAAc,CAAC,cAAc,EAAE,WAAW,CAAC,CAAA;QACxE,MAAM,QAAQ,GAAG,YAAY,CAAC,cAAc,CAAC,CAAA;QAE7C,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAA;QAEtE,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;YAC9C,mDAAmD;YACnD,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;YAE3D,IAAI,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC9B,SAAQ,CAAC,uBAAuB;YAClC,CAAC;YAED,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;gBACxB,IAAI,SAAS,EAAE,CAAC;oBACd,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAA;gBAC1D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;gBACrB,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;oBAC/B,OAAO,CAAC,IAAI,EAAE,CAAA;oBACd,8CAA8C;oBAC9C,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,IAAI,EAAE,CAAA;IACd,yDAAyD;IACzD,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;AACzB,CAAC"}

package/dist/utils/replaceInFile.d.ts

@@ -1,2 +0,0 @@
-export declare const replaceInFile: (fileContent: string, diff: string) => Promise<string>;
-//# sourceMappingURL=replaceInFile.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"replaceInFile.d.ts","sourceRoot":"","sources":["../../src/utils/replaceInFile.ts"],"names":[],"mappings":"AAQA,eAAO,MAAM,aAAa,gBAAuB,MAAM,QAAQ,MAAM,KAAG,OAAO,CAAC,MAAM,CAoFrF,CAAA"}

package/dist/utils/replaceInFile.js

@@ -1,85 +0,0 @@
-/* Example diff block format:
-  <<<<<<< SEARCH
-  // original text
-  =======
-  // replacement text
-  >>>>>>> REPLACE
-*/
-export const replaceInFile = async (fileContent, diff) => {
-    // Regex to match blocks of the form:
-    // <<<<<<< SEARCH
-    // (some lines)
-    // =======
-    // (some lines)
-    // >>>>>>> REPLACE
-    const blockPattern = /<<<<<+ SEARCH\s*\r?\n([\s\S]*?)\r?\n=======[ \t]*\r?\n([\s\S]*?)\r?\n?>>>>>+ REPLACE/g;
-    // Parse diff blocks
-    const blocks = [];
-    for (let match = blockPattern.exec(diff); match !== null; match = blockPattern.exec(diff)) {
-        blocks.push({ search: match[1], replace: match[2] });
-    }
-    if (blocks.length === 0) {
-        throw new Error('No valid diff blocks found.');
-    }
-    // Helper: try to find the search text in fileContent with progressive relaxation
-    const findAndReplace = (content, search, replace) => {
-        // 1) Direct exact match
-        let index = content.indexOf(search);
-        if (index !== -1) {
-            return content.slice(0, index) + replace + content.slice(index + search.length);
-        }
-        // 2) Trim leading/ending whitespace in search and content
-        const trimmedSearch = search.trim();
-        const trimmedContent = content.trim();
-        const offset = content.indexOf(trimmedContent); // to restore original indexing if found
-        index = trimmedContent.indexOf(trimmedSearch);
-        if (index !== -1) {
-            // compute correct absolute index in the original content
-            const absoluteIndex = offset + index;
-            return content.slice(0, absoluteIndex) + replace + content.slice(absoluteIndex + trimmedSearch.length);
-        }
-        // 3) Whitespace-agnostic match:
-        //    Replace all consecutive whitespace in search and content with a single marker
-        //    to see if there's a match ignoring whitespace diffs
-        const normalizedSearch = trimmedSearch.replace(/\s+/g, ' ');
-        const normalizedContent = trimmedContent.replace(/\s+/g, ' ');
-        index = normalizedContent.indexOf(normalizedSearch);
-        if (index !== -1) {
-            // Find actual location in the original content. We do a rough approach here:
-            // We know the substring's "normalized" start is at 'index' in normalizedContent.
-            // A simple way is to walk through the original trimmedContent to find where that occurs.
-            // For brevity, we'll do a naive re-scan and hope it's correct in typical cases.
-            let runningIndex = 0;
-            let actualPos = offset;
-            for (const segment of trimmedSearch.replace(/\s+/g, ' ').split(' ')) {
-                const segIndex = content.indexOf(segment, actualPos);
-                if (segIndex === -1) {
-                    break; // mismatch, won't happen if we truly found it
-                }
-                if (runningIndex === 0) {
-                    // First segment helps define the start
-                    actualPos = segIndex;
-                }
-                else {
-                    // Move just after the segment to keep scanning
-                    actualPos = segIndex + segment.length;
-                }
-                runningIndex++;
-            }
-            // By the time we’re done, actualPos should be the end of the matched substring.
-            // We do a length calc for the final replacement index:
-            // but we need the total length of trimmedSearch minus whitespace. We'll reconstruct:
-            const strippedSearch = trimmedSearch.replace(/\s+/g, '');
-            const endPos = actualPos; // The end of the final segment
-            const startPos = endPos - strippedSearch.length;
-            return content.slice(0, startPos) + replace + content.slice(endPos);
-        }
-        throw new Error(`Could not find the following text in file:\n${search}`);
-    };
-    let updatedFile = fileContent;
-    for (const { search, replace } of blocks) {
-        updatedFile = findAndReplace(updatedFile, search, replace);
-    }
-    return updatedFile;
-};
-//# sourceMappingURL=replaceInFile.js.map

package/dist/utils/replaceInFile.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"replaceInFile.js","sourceRoot":"","sources":["../../src/utils/replaceInFile.ts"],"names":[],"mappings":"AAAA;;;;;;EAME;AAEF,MAAM,CAAC,MAAM,aAAa,GAAG,KAAK,EAAE,WAAmB,EAAE,IAAY,EAAmB,EAAE;IACxF,qCAAqC;IACrC,iBAAiB;IACjB,eAAe;IACf,UAAU;IACV,eAAe;IACf,kBAAkB;IAClB,MAAM,YAAY,GAAG,uFAAuF,CAAA;IAE5G,oBAAoB;IACpB,MAAM,MAAM,GAA0C,EAAE,CAAA;IACxD,KAAK,IAAI,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,KAAK,IAAI,EAAE,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1F,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;IACtD,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAA;IAChD,CAAC;IAED,iFAAiF;IACjF,MAAM,cAAc,GAAG,CAAC,OAAe,EAAE,MAAc,EAAE,OAAe,EAAU,EAAE;QAClF,wBAAwB;QACxB,IAAI,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;QACnC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;QACjF,CAAC;QAED,0DAA0D;QAC1D,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,EAAE,CAAA;QACnC,MAAM,cAAc,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;QACrC,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,CAAA,CAAC,wCAAwC;QACvF,KAAK,GAAG,cAAc,CAAC,OAAO,CAAC,aAAa,CAAC,CAAA;QAC7C,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,yDAAyD;YACzD,MAAM,aAAa,GAAG,MAAM,GAAG,KAAK,CAAA;YACpC,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,GAAG,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAC,MAAM,CAAC,CAAA;QACxG,CAAC;QAED,gCAAgC;QAChC,mFAAmF;QACnF,yDAAyD;QACzD,MAAM,gBAAgB,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;QAC3D,MAAM,iBAAiB,GAAG,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;QAC7D,KAAK,GAAG,iBAAiB,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAA;QACnD,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,6EAA6E;YAC7E,iFAAiF;YACjF,yFAAyF;YACzF,gFAAgF;YAChF,IAAI,YAAY,GAAG,CAAC,CAAA;YACpB,IAAI,SAAS,GAAG,MAAM,CAAA;YACtB,KAAK,MAAM,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpE,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;gBACpD,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;oBACpB,MAAK,CAAC,8CAA8C;gBACtD,CAAC;gBACD,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;oBACvB,uCAAuC;oBACvC,SAAS,GAAG,QAAQ,CAAA;gBACtB,CAAC;qBAAM,CAAC;oBACN,+CAA+C;oBAC/C,SAAS,GAAG,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAA;gBACvC,CAAC;gBACD,YAAY,EAAE,CAAA;YAChB,CAAC;YAED,gFAAgF;YAChF,uDAAuD;YACvD,qFAAqF;YACrF,MAAM,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;YACxD,MAAM,MAAM,GAAG,SAAS,CAAA,CAAC,+BAA+B;YACxD,MAAM,QAAQ,GAAG,MAAM,GAAG,cAAc,CAAC,MAAM,CAAA;YAE/C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;QACrE,CAAC;QAED,MAAM,IAAI,KAAK,CAAC,+CAA+C,MAAM,EAAE,CAAC,CAAA;IAC1E,CAAC,CAAA;IAED,IAAI,WAAW,GAAG,WAAW,CAAA;IAC7B,KAAK,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,MAAM,EAAE,CAAC;QACzC,WAAW,GAAG,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;IAC5D,CAAC;IAED,OAAO,WAAW,CAAA;AACpB,CAAC,CAAA"}