@shopify/cli 3.74.1 → 3.75.1

package/dist/{npa-JAX2F6CO.js → npa-E675GQOI.js}

@@ -10,9 +10,9 @@ import {
   init_cjs_shims
 } from "./chunk-PKR7KJ6P.js";
 
-// ../../node_modules/.pnpm/lru-cache@10.2.2/node_modules/lru-cache/dist/commonjs/index.js
+// ../../node_modules/.pnpm/lru-cache@10.4.3/node_modules/lru-cache/dist/commonjs/index.js
 var require_commonjs = __commonJS({
-  "../../node_modules/.pnpm/lru-cache@10.2.2/node_modules/lru-cache/dist/commonjs/index.js"(exports) {
+  "../../node_modules/.pnpm/lru-cache@10.4.3/node_modules/lru-cache/dist/commonjs/index.js"(exports) {
     "use strict";
     init_cjs_shims();
     Object.defineProperty(exports, "__esModule", { value: !0 });
@@ -76,14 +76,13 @@ var require_commonjs = __commonJS({
         return this.heap[--this.length];
       }
     }, LRUCache = class _LRUCache {
-      // properties coming in from the options of these, only max and maxSize
-      // really *need* to be protected. The rest can be modified, as they just
-      // set defaults for various methods.
+      // options that cannot be changed without disaster
       #max;
       #maxSize;
       #dispose;
       #disposeAfter;
       #fetchMethod;
+      #memoMethod;
       /**
        * {@link LRUCache.OptionsBase.ttl}
        */
@@ -229,6 +228,9 @@ var require_commonjs = __commonJS({
       get fetchMethod() {
         return this.#fetchMethod;
       }
+      get memoMethod() {
+        return this.#memoMethod;
+      }
       /**
        * {@link LRUCache.OptionsBase.dispose} (read-only)
        */
@@ -242,7 +244,7 @@ var require_commonjs = __commonJS({
         return this.#disposeAfter;
       }
       constructor(options) {
-        let { max = 0, ttl, ttlResolution = 1, ttlAutopurge, updateAgeOnGet, updateAgeOnHas, allowStale, dispose, disposeAfter, noDisposeOnSet, noUpdateTTL, maxSize = 0, maxEntrySize = 0, sizeCalculation, fetchMethod, noDeleteOnFetchRejection, noDeleteOnStaleGet, allowStaleOnFetchRejection, allowStaleOnFetchAbort, ignoreFetchAbort } = options;
+        let { max = 0, ttl, ttlResolution = 1, ttlAutopurge, updateAgeOnGet, updateAgeOnHas, allowStale, dispose, disposeAfter, noDisposeOnSet, noUpdateTTL, maxSize = 0, maxEntrySize = 0, sizeCalculation, fetchMethod, memoMethod, noDeleteOnFetchRejection, noDeleteOnStaleGet, allowStaleOnFetchRejection, allowStaleOnFetchAbort, ignoreFetchAbort } = options;
         if (max !== 0 && !isPosInt(max))
           throw new TypeError("max option must be a nonnegative integer");
         let UintArray = max ? getUintArray(max) : Array;
@@ -254,7 +256,9 @@ var require_commonjs = __commonJS({
           if (typeof this.sizeCalculation != "function")
             throw new TypeError("sizeCalculation set to non-function");
         }
-        if (fetchMethod !== void 0 && typeof fetchMethod != "function")
+        if (memoMethod !== void 0 && typeof memoMethod != "function")
+          throw new TypeError("memoMethod must be a function if defined");
+        if (this.#memoMethod = memoMethod, fetchMethod !== void 0 && typeof fetchMethod != "function")
           throw new TypeError("fetchMethod must be a function if specified");
         if (this.#fetchMethod = fetchMethod, this.#hasFetchMethod = !!fetchMethod, this.#keyMap = /* @__PURE__ */ new Map(), this.#keyList = new Array(max).fill(void 0), this.#valList = new Array(max).fill(void 0), this.#next = new UintArray(max), this.#prev = new UintArray(max), this.#head = 0, this.#tail = 0, this.#free = Stack.create(max), this.#size = 0, this.#calculatedSize = 0, typeof dispose == "function" && (this.#dispose = dispose), typeof disposeAfter == "function" ? (this.#disposeAfter = disposeAfter, this.#disposed = []) : (this.#disposeAfter = void 0, this.#disposed = void 0), this.#hasDispose = !!this.#dispose, this.#hasDisposeAfter = !!this.#disposeAfter, this.noDisposeOnSet = !!noDisposeOnSet, this.noUpdateTTL = !!noUpdateTTL, this.noDeleteOnFetchRejection = !!noDeleteOnFetchRejection, this.allowStaleOnFetchRejection = !!allowStaleOnFetchRejection, this.allowStaleOnFetchAbort = !!allowStaleOnFetchAbort, this.ignoreFetchAbort = !!ignoreFetchAbort, this.maxEntrySize !== 0) {
           if (this.#maxSize !== 0 && !isPosInt(this.#maxSize))
@@ -276,7 +280,8 @@ var require_commonjs = __commonJS({
         }
       }
       /**
-       * Return the remaining TTL time for a given entry key
+       * Return the number of ms left in the item's TTL. If item is not in cache,
+       * returns `0`. Returns `Infinity` if item is in cache without a defined TTL.
        */
       getRemainingTTL(key) {
         return this.#keyMap.has(key) ? 1 / 0 : 0;
@@ -286,7 +291,7 @@ var require_commonjs = __commonJS({
         this.#ttls = ttls, this.#starts = starts, this.#setItemTTL = (index, ttl, start = perf.now()) => {
           if (starts[index] = ttl !== 0 ? start : 0, ttls[index] = ttl, ttl !== 0 && this.ttlAutopurge) {
             let t = setTimeout(() => {
-              this.#isStale(index) && this.delete(this.#keyList[index]);
+              this.#isStale(index) && this.#delete(this.#keyList[index], "expire");
             }, ttl + 1);
             t.unref && t.unref();
           }
@@ -447,13 +452,14 @@ var require_commonjs = __commonJS({
         return this.entries();
       }
       /**
-       * A String value that is used in the creation of the default string description of an object.
-       * Called by the built-in method Object.prototype.toString.
+       * A String value that is used in the creation of the default string
+       * description of an object. Called by the built-in method
+       * `Object.prototype.toString`.
        */
       [Symbol.toStringTag] = "LRUCache";
       /**
        * Find a value for which the supplied fn method returns a truthy value,
-       * similar to Array.find().  fn is called as fn(value, key, cache).
+       * similar to `Array.find()`. fn is called as `fn(value, key, cache)`.
        */
       find(fn, getOptions = {}) {
         for (let i of this.#indexes()) {
@@ -463,10 +469,15 @@ var require_commonjs = __commonJS({
         }
       }
       /**
-       * Call the supplied function on each item in the cache, in order from
-       * most recently used to least recently used.  fn is called as
-       * fn(value, key, cache).  Does not update age or recenty of use.
-       * Does not iterate over stale values.
+       * Call the supplied function on each item in the cache, in order from most
+       * recently used to least recently used.
+       *
+       * `fn` is called as `fn(value, key, cache)`.
+       *
+       * If `thisp` is provided, function will be called in the `this`-context of
+       * the provided object, or the cache if no `thisp` object is provided.
+       *
+       * Does not update age or recenty of use, or iterate over stale values.
        */
       forEach(fn, thisp = this) {
         for (let i of this.#indexes()) {
@@ -491,14 +502,20 @@ var require_commonjs = __commonJS({
       purgeStale() {
         let deleted = !1;
         for (let i of this.#rindexes({ allowStale: !0 }))
-          this.#isStale(i) && (this.delete(this.#keyList[i]), deleted = !0);
+          this.#isStale(i) && (this.#delete(this.#keyList[i], "expire"), deleted = !0);
         return deleted;
       }
       /**
        * Get the extended info about a given entry, to get its value, size, and
-       * TTL info simultaneously. Like {@link LRUCache#dump}, but just for a
-       * single key. Always returns stale values, if their info is found in the
-       * cache, so be sure to check for expired TTLs if relevant.
+       * TTL info simultaneously. Returns `undefined` if the key is not present.
+       *
+       * Unlike {@link LRUCache#dump}, which is designed to be portable and survive
+       * serialization, the `start` value is always the current timestamp, and the
+       * `ttl` is a calculated remaining time to live (negative if expired).
+       *
+       * Always returns stale values, if their info is found in the cache, so be
+       * sure to check for expirations (ie, a negative {@link LRUCache.Entry#ttl})
+       * if relevant.
        */
       info(key) {
         let i = this.#keyMap.get(key);
@@ -519,7 +536,16 @@ var require_commonjs = __commonJS({
       }
       /**
        * Return an array of [key, {@link LRUCache.Entry}] tuples which can be
-       * passed to cache.load()
+       * passed to {@link LRLUCache#load}.
+       *
+       * The `start` fields are calculated relative to a portable `Date.now()`
+       * timestamp, even if `performance.now()` is available.
+       *
+       * Stale entries are always included in the `dump`, even if
+       * {@link LRUCache.OptionsBase.allowStale} is false.
+       *
+       * Note: this returns an actual array, not a generator, so it can be more
+       * easily passed around.
        */
       dump() {
         let arr = [];
@@ -539,8 +565,12 @@ var require_commonjs = __commonJS({
       }
       /**
        * Reset the cache and load in the items in entries in the order listed.
-       * Note that the shape of the resulting cache may be different if the
-       * same options are not used in both caches.
+       *
+       * The shape of the resulting cache may be different if the same options are
+       * not used in both caches.
+       *
+       * The `start` fields are assumed to be calculated relative to a portable
+       * `Date.now()` timestamp, even if `performance.now()` is available.
        */
       load(arr) {
         this.clear();
@@ -557,13 +587,37 @@ var require_commonjs = __commonJS({
        *
        * Note: if `undefined` is specified as a value, this is an alias for
        * {@link LRUCache#delete}
+       *
+       * Fields on the {@link LRUCache.SetOptions} options param will override
+       * their corresponding values in the constructor options for the scope
+       * of this single `set()` operation.
+       *
+       * If `start` is provided, then that will set the effective start
+       * time for the TTL calculation. Note that this must be a previous
+       * value of `performance.now()` if supported, or a previous value of
+       * `Date.now()` if not.
+       *
+       * Options object may also include `size`, which will prevent
+       * calling the `sizeCalculation` function and just use the specified
+       * number if it is a positive integer, and `noDisposeOnSet` which
+       * will prevent calling a `dispose` function in the case of
+       * overwrites.
+       *
+       * If the `size` (or return value of `sizeCalculation`) for a given
+       * entry is greater than `maxEntrySize`, then the item will not be
+       * added to the cache.
+       *
+       * Will update the recency of the entry.
+       *
+       * If the value is `undefined`, then this is an alias for
+       * `cache.delete(key)`. `undefined` is never stored in the cache.
        */
       set(k, v, setOptions = {}) {
         if (v === void 0)
           return this.delete(k), this;
         let { ttl = this.ttl, start, noDisposeOnSet = this.noDisposeOnSet, sizeCalculation = this.sizeCalculation, status } = setOptions, { noUpdateTTL = this.noUpdateTTL } = setOptions, size = this.#requireSize(k, v, setOptions.size || 0, sizeCalculation);
         if (this.maxEntrySize && size > this.maxEntrySize)
-          return status && (status.set = "miss", status.maxEntrySizeExceeded = !0), this.delete(k), this;
+          return status && (status.set = "miss", status.maxEntrySizeExceeded = !0), this.#delete(k, "set"), this;
         let index = this.#size === 0 ? void 0 : this.#keyMap.get(k);
         if (index === void 0)
           index = this.#size === 0 ? this.#tail : this.#free.length !== 0 ? this.#free.pop() : this.#size === this.#max ? this.#evict(!1) : this.#size, this.#keyList[index] = k, this.#valList[index] = v, this.#keyMap.set(k, index), this.#next[this.#tail] = index, this.#prev[index] = this.#tail, this.#tail = index, this.#size++, this.#addItemSize(index, size, status), status && (status.set = "add"), noUpdateTTL = !1;
@@ -621,6 +675,14 @@ var require_commonjs = __commonJS({
        * Will return false if the item is stale, even though it is technically
        * in the cache.
        *
+       * Check if a key is in the cache, without updating the recency of
+       * use. Age is updated if {@link LRUCache.OptionsBase.updateAgeOnHas} is set
+       * to `true` in either the options or the constructor.
+       *
+       * Will return `false` if the item is stale, even though it is technically in
+       * the cache. The difference can be determined (if it matters) by using a
+       * `status` argument, and inspecting the `has` field.
+       *
        * Will not update item age unless
        * {@link LRUCache.OptionsBase.updateAgeOnHas} is set.
        */
@@ -667,10 +729,10 @@ var require_commonjs = __commonJS({
           if (options.status && (aborted && !updateCache ? (options.status.fetchAborted = !0, options.status.fetchError = ac.signal.reason, ignoreAbort && (options.status.fetchAbortIgnored = !0)) : options.status.fetchResolved = !0), aborted && !ignoreAbort && !updateCache)
             return fetchFail(ac.signal.reason);
           let bf2 = p;
-          return this.#valList[index] === p && (v2 === void 0 ? bf2.__staleWhileFetching ? this.#valList[index] = bf2.__staleWhileFetching : this.delete(k) : (options.status && (options.status.fetchUpdated = !0), this.set(k, v2, fetchOpts.options))), v2;
+          return this.#valList[index] === p && (v2 === void 0 ? bf2.__staleWhileFetching ? this.#valList[index] = bf2.__staleWhileFetching : this.#delete(k, "fetch") : (options.status && (options.status.fetchUpdated = !0), this.set(k, v2, fetchOpts.options))), v2;
         }, eb = (er) => (options.status && (options.status.fetchRejected = !0, options.status.fetchError = er), fetchFail(er)), fetchFail = (er) => {
           let { aborted } = ac.signal, allowStaleAborted = aborted && options.allowStaleOnFetchAbort, allowStale = allowStaleAborted || options.allowStaleOnFetchRejection, noDelete = allowStale || options.noDeleteOnFetchRejection, bf2 = p;
-          if (this.#valList[index] === p && (!noDelete || bf2.__staleWhileFetching === void 0 ? this.delete(k) : allowStaleAborted || (this.#valList[index] = bf2.__staleWhileFetching)), allowStale)
+          if (this.#valList[index] === p && (!noDelete || bf2.__staleWhileFetching === void 0 ? this.#delete(k, "fetch") : allowStaleAborted || (this.#valList[index] = bf2.__staleWhileFetching)), allowStale)
             return options.status && bf2.__staleWhileFetching !== void 0 && (options.status.returnedStale = !0), bf2.__staleWhileFetching;
           if (bf2.__returned === bf2)
             throw er;
@@ -756,6 +818,25 @@ var require_commonjs = __commonJS({
           return status && (status.fetch = isStale ? "stale" : "refresh", staleVal && isStale && (status.returnedStale = !0)), staleVal ? p.__staleWhileFetching : p.__returned = p;
         }
       }
+      async forceFetch(k, fetchOptions = {}) {
+        let v = await this.fetch(k, fetchOptions);
+        if (v === void 0)
+          throw new Error("fetch() returned undefined");
+        return v;
+      }
+      memo(k, memoOptions = {}) {
+        let memoMethod = this.#memoMethod;
+        if (!memoMethod)
+          throw new Error("no memoMethod provided to constructor");
+        let { context, forceRefresh, ...options } = memoOptions, v = this.get(k, options);
+        if (!forceRefresh && v !== void 0)
+          return v;
+        let vv = memoMethod(k, v, {
+          options,
+          context
+        });
+        return this.set(k, vv, options), vv;
+      }
       /**
        * Return a value from the cache. Will update the recency of the cache
        * entry found.
@@ -766,7 +847,7 @@ var require_commonjs = __commonJS({
         let { allowStale = this.allowStale, updateAgeOnGet = this.updateAgeOnGet, noDeleteOnStaleGet = this.noDeleteOnStaleGet, status } = getOptions, index = this.#keyMap.get(k);
         if (index !== void 0) {
           let value = this.#valList[index], fetching = this.#isBackgroundFetch(value);
-          return status && this.#statusTTL(status, index), this.#isStale(index) ? (status && (status.get = "stale"), fetching ? (status && allowStale && value.__staleWhileFetching !== void 0 && (status.returnedStale = !0), allowStale ? value.__staleWhileFetching : void 0) : (noDeleteOnStaleGet || this.delete(k), status && allowStale && (status.returnedStale = !0), allowStale ? value : void 0)) : (status && (status.get = "hit"), fetching ? value.__staleWhileFetching : (this.#moveToTail(index), updateAgeOnGet && this.#updateItemAge(index), value));
+          return status && this.#statusTTL(status, index), this.#isStale(index) ? (status && (status.get = "stale"), fetching ? (status && allowStale && value.__staleWhileFetching !== void 0 && (status.returnedStale = !0), allowStale ? value.__staleWhileFetching : void 0) : (noDeleteOnStaleGet || this.#delete(k, "expire"), status && allowStale && (status.returnedStale = !0), allowStale ? value : void 0)) : (status && (status.get = "hit"), fetching ? value.__staleWhileFetching : (this.#moveToTail(index), updateAgeOnGet && this.#updateItemAge(index), value));
         } else status && (status.get = "miss");
       }
       #connect(p, n) {
@@ -777,19 +858,23 @@ var require_commonjs = __commonJS({
       }
       /**
        * Deletes a key out of the cache.
+       *
        * Returns true if the key was deleted, false otherwise.
        */
       delete(k) {
+        return this.#delete(k, "delete");
+      }
+      #delete(k, reason) {
         let deleted = !1;
         if (this.#size !== 0) {
           let index = this.#keyMap.get(k);
           if (index !== void 0)
             if (deleted = !0, this.#size === 1)
-              this.clear();
+              this.#clear(reason);
             else {
               this.#removeItemSize(index);
               let v = this.#valList[index];
-              if (this.#isBackgroundFetch(v) ? v.__abortController.abort(new Error("deleted")) : (this.#hasDispose || this.#hasDisposeAfter) && (this.#hasDispose && this.#dispose?.(v, k, "delete"), this.#hasDisposeAfter && this.#disposed?.push([v, k, "delete"])), this.#keyMap.delete(k), this.#keyList[index] = void 0, this.#valList[index] = void 0, index === this.#tail)
+              if (this.#isBackgroundFetch(v) ? v.__abortController.abort(new Error("deleted")) : (this.#hasDispose || this.#hasDisposeAfter) && (this.#hasDispose && this.#dispose?.(v, k, reason), this.#hasDisposeAfter && this.#disposed?.push([v, k, reason])), this.#keyMap.delete(k), this.#keyList[index] = void 0, this.#valList[index] = void 0, index === this.#tail)
                 this.#tail = this.#prev[index];
               else if (index === this.#head)
                 this.#head = this.#next[index];
@@ -813,13 +898,16 @@ var require_commonjs = __commonJS({
        * Clear the cache entirely, throwing away all values.
        */
       clear() {
+        return this.#clear("delete");
+      }
+      #clear(reason) {
         for (let index of this.#rindexes({ allowStale: !0 })) {
           let v = this.#valList[index];
           if (this.#isBackgroundFetch(v))
             v.__abortController.abort(new Error("deleted"));
           else {
             let k = this.#keyList[index];
-            this.#hasDispose && this.#dispose?.(v, k, "delete"), this.#hasDisposeAfter && this.#disposed?.push([v, k, "delete"]);
+            this.#hasDispose && this.#dispose?.(v, k, reason), this.#hasDisposeAfter && this.#disposed?.push([v, k, reason]);
           }
         }
         if (this.#keyMap.clear(), this.#valList.fill(void 0), this.#keyList.fill(void 0), this.#ttls && this.#starts && (this.#ttls.fill(0), this.#starts.fill(0)), this.#sizes && this.#sizes.fill(0), this.#head = 0, this.#tail = 0, this.#free.length = 0, this.#calculatedSize = 0, this.#size = 0, this.#hasDisposeAfter && this.#disposed) {
@@ -1294,9 +1382,9 @@ var require_lib3 = __commonJS({
   }
 });
 
-// ../../node_modules/.pnpm/npm-package-arg@11.0.2/node_modules/npm-package-arg/lib/npa.js
+// ../../node_modules/.pnpm/npm-package-arg@11.0.3/node_modules/npm-package-arg/lib/npa.js
 var require_npa = __commonJS({
-  "../../node_modules/.pnpm/npm-package-arg@11.0.2/node_modules/npm-package-arg/lib/npa.js"(exports, module) {
+  "../../node_modules/.pnpm/npm-package-arg@11.0.3/node_modules/npm-package-arg/lib/npa.js"(exports, module) {
     init_cjs_shims();
     module.exports = npa;
     module.exports.resolve = resolve;
@@ -1464,6 +1552,8 @@ var require_npa = __commonJS({
         throw new Error("nested aliases not supported");
       if (!subSpec.registry)
         throw new Error("aliases only work for registry deps");
+      if (!subSpec.name)
+        throw new Error("aliases must have a name");
       return res.subSpec = subSpec, res.registry = !0, res.type = "alias", res.saveSpec = null, res.fetchSpec = null, res;
     }
     function fromRegistry(res) {
@@ -1485,4 +1575,4 @@ var require_npa = __commonJS({
   }
 });
 export default require_npa();
-//# sourceMappingURL=npa-JAX2F6CO.js.map
+//# sourceMappingURL=npa-E675GQOI.js.map