@graphql-codegen/cli 4.0.1-rc-20230601142157-34bca752f → 4.0.2-alpha-20230706143738-f59fb0497

package/cjs/utils/watcher.js

@@ -185,27 +185,39 @@ const findHighestCommonDirectory = async (files) => {
 };
 /**
  * Find the longest common prefix of an array of paths, where each item in
- * the array an array of path segments which comprise an absolute path when
- * joined together by a path separator
+ * the array is an array of path segments which comprise an absolute path when
+ * joined together by a path separator.
  *
  * Adapted from:
  * https://duncan-mcardle.medium.com/leetcode-problem-14-longest-common-prefix-javascript-3bc6a2f777c4
  *
- * @param splitPaths An array of arrays, where each item is a path split by its separator
- * @returns An array of path segments representing the longest common prefix of splitPaths
+ * This version has been adjusted to support Windows paths, by treating the drive letter
+ * as a separate segment and accounting for Windows-style backslashes as path separators.
+ *
+ * @param splitPaths An array of arrays, where each item is a path split by its separator.
+ *                   The first item is treated separately as it could be a drive letter in Windows.
+ * @returns An array of path segments representing the longest common prefix of splitPaths.
  */
 const longestCommonPrefix = (splitPaths) => {
     // Return early on empty input
     if (!splitPaths.length) {
         return [];
     }
+    // Added: handle Windows drive letters
+    const driveLetter = splitPaths[0][0];
+    if (driveLetter && splitPaths.every(string => string[0] === driveLetter)) {
+        splitPaths = splitPaths.map(path => path.slice(1));
+    }
+    else {
+        return [];
+    }
     // Loop through the segments of the first path
     for (let i = 0; i <= splitPaths[0].length; i++) {
         // Check if this path segment is present in the same position of every path
         if (!splitPaths.every(string => string[i] === splitPaths[0][i])) {
             // If not, return the path segments up to and including the previous segment
-            return splitPaths[0].slice(0, i);
+            return [driveLetter, ...splitPaths[0].slice(0, i)];
         }
     }
-    return splitPaths[0];
+    return [driveLetter, ...splitPaths[0]];
 };

package/esm/utils/watcher.js

@@ -180,27 +180,39 @@ const findHighestCommonDirectory = async (files) => {
 };
 /**
  * Find the longest common prefix of an array of paths, where each item in
- * the array an array of path segments which comprise an absolute path when
- * joined together by a path separator
+ * the array is an array of path segments which comprise an absolute path when
+ * joined together by a path separator.
  *
  * Adapted from:
  * https://duncan-mcardle.medium.com/leetcode-problem-14-longest-common-prefix-javascript-3bc6a2f777c4
  *
- * @param splitPaths An array of arrays, where each item is a path split by its separator
- * @returns An array of path segments representing the longest common prefix of splitPaths
+ * This version has been adjusted to support Windows paths, by treating the drive letter
+ * as a separate segment and accounting for Windows-style backslashes as path separators.
+ *
+ * @param splitPaths An array of arrays, where each item is a path split by its separator.
+ *                   The first item is treated separately as it could be a drive letter in Windows.
+ * @returns An array of path segments representing the longest common prefix of splitPaths.
  */
 const longestCommonPrefix = (splitPaths) => {
     // Return early on empty input
     if (!splitPaths.length) {
         return [];
     }
+    // Added: handle Windows drive letters
+    const driveLetter = splitPaths[0][0];
+    if (driveLetter && splitPaths.every(string => string[0] === driveLetter)) {
+        splitPaths = splitPaths.map(path => path.slice(1));
+    }
+    else {
+        return [];
+    }
     // Loop through the segments of the first path
     for (let i = 0; i <= splitPaths[0].length; i++) {
         // Check if this path segment is present in the same position of every path
         if (!splitPaths.every(string => string[i] === splitPaths[0][i])) {
             // If not, return the path segments up to and including the previous segment
-            return splitPaths[0].slice(0, i);
+            return [driveLetter, ...splitPaths[0].slice(0, i)];
         }
     }
-    return splitPaths[0];
+    return [driveLetter, ...splitPaths[0]];
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@graphql-codegen/cli",
-  "version": "4.0.1-rc-20230601142157-34bca752f",
+  "version": "4.0.2-alpha-20230706143738-f59fb0497",
   "peerDependencies": {
     "graphql": "^0.8.0 || ^0.9.0 || ^0.10.0 || ^0.11.0 || ^0.12.0 || ^0.13.0 || ^14.0.0 || ^15.0.0 || ^16.0.0"
   },