@pgpmjs/slice 0.14.3 → 0.14.5

package/esm/slice.js

@@ -1,6 +1,6 @@
 import { parsePlanFile } from '@pgpmjs/ast/files/plan/parser';
 import { generateChangeLineContent, generateTagLineContent } from '@pgpmjs/ast/files/plan/writer';
-import { minimatch } from 'minimatch';
+import { Minimatch } from 'minimatch';
 import { buildAstEdges, expandClosures } from './closure';
 /**
  * Build a dependency graph from a parsed plan file
@@ -86,6 +86,21 @@ export function extractPackageFromPath(changeName, depth = 1, prefixToStrip = 's
     }
     return 'core';
 }
+/**
+ * Compiling a glob costs far more than matching one, and assigning a plan
+ * evaluates every (change x pattern) pair — hundreds of thousands of pairs on
+ * a large plan over the same handful of patterns — so each pattern is
+ * compiled once and reused. `Minimatch` instances are stateless.
+ */
+const patternMatchers = new Map();
+function patternMatcher(pattern) {
+    let matcher = patternMatchers.get(pattern);
+    if (!matcher) {
+        matcher = new Minimatch(pattern, { dot: true });
+        patternMatchers.set(pattern, matcher);
+    }
+    return matcher;
+}
 /**
  * Find the matching package for a change using pattern-based strategy.
  * Returns the first matching slice's package name, or undefined if no match.
@@ -93,7 +108,7 @@ export function extractPackageFromPath(changeName, depth = 1, prefixToStrip = 's
 export function findMatchingPattern(changeName, strategy) {
     for (const slice of strategy.slices) {
         for (const pattern of slice.patterns) {
-            if (minimatch(changeName, pattern, { dot: true })) {
+            if (patternMatcher(pattern).match(changeName)) {
                 return slice.packageName;
             }
         }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@pgpmjs/slice",
-  "version": "0.14.3",
+  "version": "0.14.5",
   "author": "Constructive <developers@constructive.io>",
   "description": "PGPM plan slicing — split a monolithic pgpm plan into packages with pattern strategies and opt-in AST-based dependency closure",
   "main": "index.js",
@@ -42,10 +42,10 @@
     "makage": "^0.3.0"
   },
   "dependencies": {
-    "@pgpmjs/ast": "^0.11.2",
-    "@pgpmjs/transform": "^0.23.1",
-    "minimatch": "^10.2.5",
+    "@pgpmjs/ast": "^0.11.3",
+    "@pgpmjs/transform": "^0.23.3",
+    "minimatch": "^10.2.6",
     "plpgsql-parser": "^18.5.3"
   },
-  "gitHead": "43121004a8bedd2c5fcf7bf33208079d55bad01f"
+  "gitHead": "905c4c530f09ac15621b554225be060609a4a0a3"
 }

package/slice.js

@@ -102,6 +102,21 @@ function extractPackageFromPath(changeName, depth = 1, prefixToStrip = 'schemas'
     }
     return 'core';
 }
+/**
+ * Compiling a glob costs far more than matching one, and assigning a plan
+ * evaluates every (change x pattern) pair — hundreds of thousands of pairs on
+ * a large plan over the same handful of patterns — so each pattern is
+ * compiled once and reused. `Minimatch` instances are stateless.
+ */
+const patternMatchers = new Map();
+function patternMatcher(pattern) {
+    let matcher = patternMatchers.get(pattern);
+    if (!matcher) {
+        matcher = new minimatch_1.Minimatch(pattern, { dot: true });
+        patternMatchers.set(pattern, matcher);
+    }
+    return matcher;
+}
 /**
  * Find the matching package for a change using pattern-based strategy.
  * Returns the first matching slice's package name, or undefined if no match.
@@ -109,7 +124,7 @@ function extractPackageFromPath(changeName, depth = 1, prefixToStrip = 'schemas'
 function findMatchingPattern(changeName, strategy) {
     for (const slice of strategy.slices) {
         for (const pattern of slice.patterns) {
-            if ((0, minimatch_1.minimatch)(changeName, pattern, { dot: true })) {
+            if (patternMatcher(pattern).match(changeName)) {
                 return slice.packageName;
             }
         }