@parcel/utils 2.0.0-dev.1528 → 2.0.0-dev.1562
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/lib/index.js +106 -106
- package/lib/index.js.map +1 -1
- package/package.json +7 -7
- package/src/alternatives.js +2 -2
package/lib/index.js
CHANGED
|
@@ -34,7 +34,7 @@ function $parcel$interopDefault(a) {
|
|
|
34
34
|
var $parcel$modules = {};
|
|
35
35
|
var $parcel$inits = {};
|
|
36
36
|
|
|
37
|
-
var parcelRequire = $parcel$global["
|
|
37
|
+
var parcelRequire = $parcel$global["parcelRequire94c2"];
|
|
38
38
|
|
|
39
39
|
if (parcelRequire == null) {
|
|
40
40
|
parcelRequire = function(id) {
|
|
@@ -58,7 +58,7 @@ if (parcelRequire == null) {
|
|
|
58
58
|
$parcel$inits[id] = init;
|
|
59
59
|
};
|
|
60
60
|
|
|
61
|
-
$parcel$global["
|
|
61
|
+
$parcel$global["parcelRequire94c2"] = parcelRequire;
|
|
62
62
|
}
|
|
63
63
|
|
|
64
64
|
var parcelRegister = parcelRequire.register;
|
|
@@ -35956,7 +35956,7 @@ $97291be8279649a5$export$98e6a39c04603d36 = (parcelRequire("kevix"));
|
|
|
35956
35956
|
$97291be8279649a5$export$fac44ee5b035f737 = (parcelRequire("h3JHI"));
|
|
35957
35957
|
|
|
35958
35958
|
|
|
35959
|
-
var $
|
|
35959
|
+
var $f8b9098efafecd39$exports = {};
|
|
35960
35960
|
"use strict";
|
|
35961
35961
|
var $557305711a2937f9$exports = {};
|
|
35962
35962
|
"use strict";
|
|
@@ -36212,17 +36212,17 @@ try {
|
|
|
36212
36212
|
} catch (er) {}
|
|
36213
36213
|
|
|
36214
36214
|
|
|
36215
|
-
const $
|
|
36216
|
-
const $
|
|
36217
|
-
const $
|
|
36218
|
-
const $
|
|
36219
|
-
const $
|
|
36220
|
-
const $
|
|
36221
|
-
const $
|
|
36222
|
-
const $
|
|
36223
|
-
const $
|
|
36224
|
-
const $
|
|
36225
|
-
const $
|
|
36215
|
+
const $f8b9098efafecd39$var$MAX = Symbol("max");
|
|
36216
|
+
const $f8b9098efafecd39$var$LENGTH = Symbol("length");
|
|
36217
|
+
const $f8b9098efafecd39$var$LENGTH_CALCULATOR = Symbol("lengthCalculator");
|
|
36218
|
+
const $f8b9098efafecd39$var$ALLOW_STALE = Symbol("allowStale");
|
|
36219
|
+
const $f8b9098efafecd39$var$MAX_AGE = Symbol("maxAge");
|
|
36220
|
+
const $f8b9098efafecd39$var$DISPOSE = Symbol("dispose");
|
|
36221
|
+
const $f8b9098efafecd39$var$NO_DISPOSE_ON_SET = Symbol("noDisposeOnSet");
|
|
36222
|
+
const $f8b9098efafecd39$var$LRU_LIST = Symbol("lruList");
|
|
36223
|
+
const $f8b9098efafecd39$var$CACHE = Symbol("cache");
|
|
36224
|
+
const $f8b9098efafecd39$var$UPDATE_AGE_ON_GET = Symbol("updateAgeOnGet");
|
|
36225
|
+
const $f8b9098efafecd39$var$naiveLength = ()=>1;
|
|
36226
36226
|
// lruList is a yallist where the head is the youngest
|
|
36227
36227
|
// item, and the tail is the oldest. the list contains the Hit
|
|
36228
36228
|
// objects as the entries.
|
|
@@ -36231,7 +36231,7 @@ const $2928e4313c385acc$var$naiveLength = ()=>1;
|
|
|
36231
36231
|
//
|
|
36232
36232
|
// cache is a Map (or PseudoMap) that matches the keys to
|
|
36233
36233
|
// the Yallist.Node object.
|
|
36234
|
-
class $
|
|
36234
|
+
class $f8b9098efafecd39$var$LRUCache {
|
|
36235
36235
|
constructor(options){
|
|
36236
36236
|
if (typeof options === "number") options = {
|
|
36237
36237
|
max: options
|
|
@@ -36239,160 +36239,160 @@ class $2928e4313c385acc$var$LRUCache {
|
|
|
36239
36239
|
if (!options) options = {};
|
|
36240
36240
|
if (options.max && (typeof options.max !== "number" || options.max < 0)) throw new TypeError("max must be a non-negative number");
|
|
36241
36241
|
// Kind of weird to have a default max of Infinity, but oh well.
|
|
36242
|
-
const max = this[$
|
|
36243
|
-
const lc = options.length || $
|
|
36244
|
-
this[$
|
|
36245
|
-
this[$
|
|
36242
|
+
const max = this[$f8b9098efafecd39$var$MAX] = options.max || Infinity;
|
|
36243
|
+
const lc = options.length || $f8b9098efafecd39$var$naiveLength;
|
|
36244
|
+
this[$f8b9098efafecd39$var$LENGTH_CALCULATOR] = typeof lc !== "function" ? $f8b9098efafecd39$var$naiveLength : lc;
|
|
36245
|
+
this[$f8b9098efafecd39$var$ALLOW_STALE] = options.stale || false;
|
|
36246
36246
|
if (options.maxAge && typeof options.maxAge !== "number") throw new TypeError("maxAge must be a number");
|
|
36247
|
-
this[$
|
|
36248
|
-
this[$
|
|
36249
|
-
this[$
|
|
36250
|
-
this[$
|
|
36247
|
+
this[$f8b9098efafecd39$var$MAX_AGE] = options.maxAge || 0;
|
|
36248
|
+
this[$f8b9098efafecd39$var$DISPOSE] = options.dispose;
|
|
36249
|
+
this[$f8b9098efafecd39$var$NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false;
|
|
36250
|
+
this[$f8b9098efafecd39$var$UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false;
|
|
36251
36251
|
this.reset();
|
|
36252
36252
|
}
|
|
36253
36253
|
// resize the cache when the max changes.
|
|
36254
36254
|
set max(mL) {
|
|
36255
36255
|
if (typeof mL !== "number" || mL < 0) throw new TypeError("max must be a non-negative number");
|
|
36256
|
-
this[$
|
|
36257
|
-
$
|
|
36256
|
+
this[$f8b9098efafecd39$var$MAX] = mL || Infinity;
|
|
36257
|
+
$f8b9098efafecd39$var$trim(this);
|
|
36258
36258
|
}
|
|
36259
36259
|
get max() {
|
|
36260
|
-
return this[$
|
|
36260
|
+
return this[$f8b9098efafecd39$var$MAX];
|
|
36261
36261
|
}
|
|
36262
36262
|
set allowStale(allowStale) {
|
|
36263
|
-
this[$
|
|
36263
|
+
this[$f8b9098efafecd39$var$ALLOW_STALE] = !!allowStale;
|
|
36264
36264
|
}
|
|
36265
36265
|
get allowStale() {
|
|
36266
|
-
return this[$
|
|
36266
|
+
return this[$f8b9098efafecd39$var$ALLOW_STALE];
|
|
36267
36267
|
}
|
|
36268
36268
|
set maxAge(mA) {
|
|
36269
36269
|
if (typeof mA !== "number") throw new TypeError("maxAge must be a non-negative number");
|
|
36270
|
-
this[$
|
|
36271
|
-
$
|
|
36270
|
+
this[$f8b9098efafecd39$var$MAX_AGE] = mA;
|
|
36271
|
+
$f8b9098efafecd39$var$trim(this);
|
|
36272
36272
|
}
|
|
36273
36273
|
get maxAge() {
|
|
36274
|
-
return this[$
|
|
36274
|
+
return this[$f8b9098efafecd39$var$MAX_AGE];
|
|
36275
36275
|
}
|
|
36276
36276
|
// resize the cache when the lengthCalculator changes.
|
|
36277
36277
|
set lengthCalculator(lC) {
|
|
36278
|
-
if (typeof lC !== "function") lC = $
|
|
36279
|
-
if (lC !== this[$
|
|
36280
|
-
this[$
|
|
36281
|
-
this[$
|
|
36282
|
-
this[$
|
|
36283
|
-
hit.length = this[$
|
|
36284
|
-
this[$
|
|
36278
|
+
if (typeof lC !== "function") lC = $f8b9098efafecd39$var$naiveLength;
|
|
36279
|
+
if (lC !== this[$f8b9098efafecd39$var$LENGTH_CALCULATOR]) {
|
|
36280
|
+
this[$f8b9098efafecd39$var$LENGTH_CALCULATOR] = lC;
|
|
36281
|
+
this[$f8b9098efafecd39$var$LENGTH] = 0;
|
|
36282
|
+
this[$f8b9098efafecd39$var$LRU_LIST].forEach((hit)=>{
|
|
36283
|
+
hit.length = this[$f8b9098efafecd39$var$LENGTH_CALCULATOR](hit.value, hit.key);
|
|
36284
|
+
this[$f8b9098efafecd39$var$LENGTH] += hit.length;
|
|
36285
36285
|
});
|
|
36286
36286
|
}
|
|
36287
|
-
$
|
|
36287
|
+
$f8b9098efafecd39$var$trim(this);
|
|
36288
36288
|
}
|
|
36289
36289
|
get lengthCalculator() {
|
|
36290
|
-
return this[$
|
|
36290
|
+
return this[$f8b9098efafecd39$var$LENGTH_CALCULATOR];
|
|
36291
36291
|
}
|
|
36292
36292
|
get length() {
|
|
36293
|
-
return this[$
|
|
36293
|
+
return this[$f8b9098efafecd39$var$LENGTH];
|
|
36294
36294
|
}
|
|
36295
36295
|
get itemCount() {
|
|
36296
|
-
return this[$
|
|
36296
|
+
return this[$f8b9098efafecd39$var$LRU_LIST].length;
|
|
36297
36297
|
}
|
|
36298
36298
|
rforEach(fn, thisp) {
|
|
36299
36299
|
thisp = thisp || this;
|
|
36300
|
-
for(let walker = this[$
|
|
36300
|
+
for(let walker = this[$f8b9098efafecd39$var$LRU_LIST].tail; walker !== null;){
|
|
36301
36301
|
const prev = walker.prev;
|
|
36302
|
-
$
|
|
36302
|
+
$f8b9098efafecd39$var$forEachStep(this, fn, walker, thisp);
|
|
36303
36303
|
walker = prev;
|
|
36304
36304
|
}
|
|
36305
36305
|
}
|
|
36306
36306
|
forEach(fn, thisp) {
|
|
36307
36307
|
thisp = thisp || this;
|
|
36308
|
-
for(let walker = this[$
|
|
36308
|
+
for(let walker = this[$f8b9098efafecd39$var$LRU_LIST].head; walker !== null;){
|
|
36309
36309
|
const next = walker.next;
|
|
36310
|
-
$
|
|
36310
|
+
$f8b9098efafecd39$var$forEachStep(this, fn, walker, thisp);
|
|
36311
36311
|
walker = next;
|
|
36312
36312
|
}
|
|
36313
36313
|
}
|
|
36314
36314
|
keys() {
|
|
36315
|
-
return this[$
|
|
36315
|
+
return this[$f8b9098efafecd39$var$LRU_LIST].toArray().map((k)=>k.key);
|
|
36316
36316
|
}
|
|
36317
36317
|
values() {
|
|
36318
|
-
return this[$
|
|
36318
|
+
return this[$f8b9098efafecd39$var$LRU_LIST].toArray().map((k)=>k.value);
|
|
36319
36319
|
}
|
|
36320
36320
|
reset() {
|
|
36321
|
-
if (this[$
|
|
36322
|
-
this[$
|
|
36321
|
+
if (this[$f8b9098efafecd39$var$DISPOSE] && this[$f8b9098efafecd39$var$LRU_LIST] && this[$f8b9098efafecd39$var$LRU_LIST].length) this[$f8b9098efafecd39$var$LRU_LIST].forEach((hit)=>this[$f8b9098efafecd39$var$DISPOSE](hit.key, hit.value));
|
|
36322
|
+
this[$f8b9098efafecd39$var$CACHE] = new Map() // hash of items by key
|
|
36323
36323
|
;
|
|
36324
|
-
this[$
|
|
36324
|
+
this[$f8b9098efafecd39$var$LRU_LIST] = new $557305711a2937f9$exports() // list of items in order of use recency
|
|
36325
36325
|
;
|
|
36326
|
-
this[$
|
|
36326
|
+
this[$f8b9098efafecd39$var$LENGTH] = 0 // length of items in the list
|
|
36327
36327
|
;
|
|
36328
36328
|
}
|
|
36329
36329
|
dump() {
|
|
36330
|
-
return this[$
|
|
36330
|
+
return this[$f8b9098efafecd39$var$LRU_LIST].map((hit)=>$f8b9098efafecd39$var$isStale(this, hit) ? false : {
|
|
36331
36331
|
k: hit.key,
|
|
36332
36332
|
v: hit.value,
|
|
36333
36333
|
e: hit.now + (hit.maxAge || 0)
|
|
36334
36334
|
}).toArray().filter((h)=>h);
|
|
36335
36335
|
}
|
|
36336
36336
|
dumpLru() {
|
|
36337
|
-
return this[$
|
|
36337
|
+
return this[$f8b9098efafecd39$var$LRU_LIST];
|
|
36338
36338
|
}
|
|
36339
36339
|
set(key, value, maxAge) {
|
|
36340
|
-
maxAge = maxAge || this[$
|
|
36340
|
+
maxAge = maxAge || this[$f8b9098efafecd39$var$MAX_AGE];
|
|
36341
36341
|
if (maxAge && typeof maxAge !== "number") throw new TypeError("maxAge must be a number");
|
|
36342
36342
|
const now = maxAge ? Date.now() : 0;
|
|
36343
|
-
const len = this[$
|
|
36344
|
-
if (this[$
|
|
36345
|
-
if (len > this[$
|
|
36346
|
-
$
|
|
36343
|
+
const len = this[$f8b9098efafecd39$var$LENGTH_CALCULATOR](value, key);
|
|
36344
|
+
if (this[$f8b9098efafecd39$var$CACHE].has(key)) {
|
|
36345
|
+
if (len > this[$f8b9098efafecd39$var$MAX]) {
|
|
36346
|
+
$f8b9098efafecd39$var$del(this, this[$f8b9098efafecd39$var$CACHE].get(key));
|
|
36347
36347
|
return false;
|
|
36348
36348
|
}
|
|
36349
|
-
const node = this[$
|
|
36349
|
+
const node = this[$f8b9098efafecd39$var$CACHE].get(key);
|
|
36350
36350
|
const item = node.value;
|
|
36351
36351
|
// dispose of the old one before overwriting
|
|
36352
36352
|
// split out into 2 ifs for better coverage tracking
|
|
36353
|
-
if (this[$
|
|
36354
|
-
if (!this[$
|
|
36353
|
+
if (this[$f8b9098efafecd39$var$DISPOSE]) {
|
|
36354
|
+
if (!this[$f8b9098efafecd39$var$NO_DISPOSE_ON_SET]) this[$f8b9098efafecd39$var$DISPOSE](key, item.value);
|
|
36355
36355
|
}
|
|
36356
36356
|
item.now = now;
|
|
36357
36357
|
item.maxAge = maxAge;
|
|
36358
36358
|
item.value = value;
|
|
36359
|
-
this[$
|
|
36359
|
+
this[$f8b9098efafecd39$var$LENGTH] += len - item.length;
|
|
36360
36360
|
item.length = len;
|
|
36361
36361
|
this.get(key);
|
|
36362
|
-
$
|
|
36362
|
+
$f8b9098efafecd39$var$trim(this);
|
|
36363
36363
|
return true;
|
|
36364
36364
|
}
|
|
36365
|
-
const hit = new $
|
|
36365
|
+
const hit = new $f8b9098efafecd39$var$Entry(key, value, len, now, maxAge);
|
|
36366
36366
|
// oversized objects fall out of cache automatically.
|
|
36367
|
-
if (hit.length > this[$
|
|
36368
|
-
if (this[$
|
|
36367
|
+
if (hit.length > this[$f8b9098efafecd39$var$MAX]) {
|
|
36368
|
+
if (this[$f8b9098efafecd39$var$DISPOSE]) this[$f8b9098efafecd39$var$DISPOSE](key, value);
|
|
36369
36369
|
return false;
|
|
36370
36370
|
}
|
|
36371
|
-
this[$
|
|
36372
|
-
this[$
|
|
36373
|
-
this[$
|
|
36374
|
-
$
|
|
36371
|
+
this[$f8b9098efafecd39$var$LENGTH] += hit.length;
|
|
36372
|
+
this[$f8b9098efafecd39$var$LRU_LIST].unshift(hit);
|
|
36373
|
+
this[$f8b9098efafecd39$var$CACHE].set(key, this[$f8b9098efafecd39$var$LRU_LIST].head);
|
|
36374
|
+
$f8b9098efafecd39$var$trim(this);
|
|
36375
36375
|
return true;
|
|
36376
36376
|
}
|
|
36377
36377
|
has(key) {
|
|
36378
|
-
if (!this[$
|
|
36379
|
-
const hit = this[$
|
|
36380
|
-
return !$
|
|
36378
|
+
if (!this[$f8b9098efafecd39$var$CACHE].has(key)) return false;
|
|
36379
|
+
const hit = this[$f8b9098efafecd39$var$CACHE].get(key).value;
|
|
36380
|
+
return !$f8b9098efafecd39$var$isStale(this, hit);
|
|
36381
36381
|
}
|
|
36382
36382
|
get(key) {
|
|
36383
|
-
return $
|
|
36383
|
+
return $f8b9098efafecd39$var$get(this, key, true);
|
|
36384
36384
|
}
|
|
36385
36385
|
peek(key) {
|
|
36386
|
-
return $
|
|
36386
|
+
return $f8b9098efafecd39$var$get(this, key, false);
|
|
36387
36387
|
}
|
|
36388
36388
|
pop() {
|
|
36389
|
-
const node = this[$
|
|
36389
|
+
const node = this[$f8b9098efafecd39$var$LRU_LIST].tail;
|
|
36390
36390
|
if (!node) return null;
|
|
36391
|
-
$
|
|
36391
|
+
$f8b9098efafecd39$var$del(this, node);
|
|
36392
36392
|
return node.value;
|
|
36393
36393
|
}
|
|
36394
36394
|
del(key) {
|
|
36395
|
-
$
|
|
36395
|
+
$f8b9098efafecd39$var$del(this, this[$f8b9098efafecd39$var$CACHE].get(key));
|
|
36396
36396
|
}
|
|
36397
36397
|
load(arr) {
|
|
36398
36398
|
// reset the cache
|
|
@@ -36412,48 +36412,48 @@ class $2928e4313c385acc$var$LRUCache {
|
|
|
36412
36412
|
}
|
|
36413
36413
|
}
|
|
36414
36414
|
prune() {
|
|
36415
|
-
this[$
|
|
36415
|
+
this[$f8b9098efafecd39$var$CACHE].forEach((value, key)=>$f8b9098efafecd39$var$get(this, key, false));
|
|
36416
36416
|
}
|
|
36417
36417
|
}
|
|
36418
|
-
const $
|
|
36419
|
-
const node = self[$
|
|
36418
|
+
const $f8b9098efafecd39$var$get = (self, key, doUse)=>{
|
|
36419
|
+
const node = self[$f8b9098efafecd39$var$CACHE].get(key);
|
|
36420
36420
|
if (node) {
|
|
36421
36421
|
const hit = node.value;
|
|
36422
|
-
if ($
|
|
36423
|
-
$
|
|
36424
|
-
if (!self[$
|
|
36422
|
+
if ($f8b9098efafecd39$var$isStale(self, hit)) {
|
|
36423
|
+
$f8b9098efafecd39$var$del(self, node);
|
|
36424
|
+
if (!self[$f8b9098efafecd39$var$ALLOW_STALE]) return undefined;
|
|
36425
36425
|
} else if (doUse) {
|
|
36426
|
-
if (self[$
|
|
36427
|
-
self[$
|
|
36426
|
+
if (self[$f8b9098efafecd39$var$UPDATE_AGE_ON_GET]) node.value.now = Date.now();
|
|
36427
|
+
self[$f8b9098efafecd39$var$LRU_LIST].unshiftNode(node);
|
|
36428
36428
|
}
|
|
36429
36429
|
return hit.value;
|
|
36430
36430
|
}
|
|
36431
36431
|
};
|
|
36432
|
-
const $
|
|
36433
|
-
if (!hit || !hit.maxAge && !self[$
|
|
36432
|
+
const $f8b9098efafecd39$var$isStale = (self, hit)=>{
|
|
36433
|
+
if (!hit || !hit.maxAge && !self[$f8b9098efafecd39$var$MAX_AGE]) return false;
|
|
36434
36434
|
const diff = Date.now() - hit.now;
|
|
36435
|
-
return hit.maxAge ? diff > hit.maxAge : self[$
|
|
36435
|
+
return hit.maxAge ? diff > hit.maxAge : self[$f8b9098efafecd39$var$MAX_AGE] && diff > self[$f8b9098efafecd39$var$MAX_AGE];
|
|
36436
36436
|
};
|
|
36437
|
-
const $
|
|
36438
|
-
if (self[$
|
|
36437
|
+
const $f8b9098efafecd39$var$trim = (self)=>{
|
|
36438
|
+
if (self[$f8b9098efafecd39$var$LENGTH] > self[$f8b9098efafecd39$var$MAX]) for(let walker = self[$f8b9098efafecd39$var$LRU_LIST].tail; self[$f8b9098efafecd39$var$LENGTH] > self[$f8b9098efafecd39$var$MAX] && walker !== null;){
|
|
36439
36439
|
// We know that we're about to delete this one, and also
|
|
36440
36440
|
// what the next least recently used key will be, so just
|
|
36441
36441
|
// go ahead and set it now.
|
|
36442
36442
|
const prev = walker.prev;
|
|
36443
|
-
$
|
|
36443
|
+
$f8b9098efafecd39$var$del(self, walker);
|
|
36444
36444
|
walker = prev;
|
|
36445
36445
|
}
|
|
36446
36446
|
};
|
|
36447
|
-
const $
|
|
36447
|
+
const $f8b9098efafecd39$var$del = (self, node)=>{
|
|
36448
36448
|
if (node) {
|
|
36449
36449
|
const hit = node.value;
|
|
36450
|
-
if (self[$
|
|
36451
|
-
self[$
|
|
36452
|
-
self[$
|
|
36453
|
-
self[$
|
|
36450
|
+
if (self[$f8b9098efafecd39$var$DISPOSE]) self[$f8b9098efafecd39$var$DISPOSE](hit.key, hit.value);
|
|
36451
|
+
self[$f8b9098efafecd39$var$LENGTH] -= hit.length;
|
|
36452
|
+
self[$f8b9098efafecd39$var$CACHE].delete(hit.key);
|
|
36453
|
+
self[$f8b9098efafecd39$var$LRU_LIST].removeNode(node);
|
|
36454
36454
|
}
|
|
36455
36455
|
};
|
|
36456
|
-
class $
|
|
36456
|
+
class $f8b9098efafecd39$var$Entry {
|
|
36457
36457
|
constructor(key, value, length, now, maxAge){
|
|
36458
36458
|
this.key = key;
|
|
36459
36459
|
this.value = value;
|
|
@@ -36462,18 +36462,18 @@ class $2928e4313c385acc$var$Entry {
|
|
|
36462
36462
|
this.maxAge = maxAge || 0;
|
|
36463
36463
|
}
|
|
36464
36464
|
}
|
|
36465
|
-
const $
|
|
36465
|
+
const $f8b9098efafecd39$var$forEachStep = (self, fn, node, thisp)=>{
|
|
36466
36466
|
let hit = node.value;
|
|
36467
|
-
if ($
|
|
36468
|
-
$
|
|
36469
|
-
if (!self[$
|
|
36467
|
+
if ($f8b9098efafecd39$var$isStale(self, hit)) {
|
|
36468
|
+
$f8b9098efafecd39$var$del(self, node);
|
|
36469
|
+
if (!self[$f8b9098efafecd39$var$ALLOW_STALE]) hit = undefined;
|
|
36470
36470
|
}
|
|
36471
36471
|
if (hit) fn.call(thisp, hit.value, hit.key, self);
|
|
36472
36472
|
};
|
|
36473
|
-
$
|
|
36473
|
+
$f8b9098efafecd39$exports = $f8b9098efafecd39$var$LRUCache;
|
|
36474
36474
|
|
|
36475
36475
|
|
|
36476
|
-
const $1b5cf2552daa3eaf$var$configCache = new (0, (/*@__PURE__*/$parcel$interopDefault($
|
|
36476
|
+
const $1b5cf2552daa3eaf$var$configCache = new (0, (/*@__PURE__*/$parcel$interopDefault($f8b9098efafecd39$exports)))({
|
|
36477
36477
|
max: 500
|
|
36478
36478
|
});
|
|
36479
36479
|
const $1b5cf2552daa3eaf$var$resolveCache = new Map();
|
|
@@ -36666,7 +36666,7 @@ async function $92b629003a924abd$export$4eeb1b3271a29661(fs, fileSpecifier, dir,
|
|
|
36666
36666
|
let ext = (0, ($parcel$interopDefault($eJUMF$path))).extname(p);
|
|
36667
36667
|
return ext.length > 0 ? p.slice(0, -ext.length) : p;
|
|
36668
36668
|
});
|
|
36669
|
-
return (0, $f2eb8388071f2c88$export$2115c2c0a84eef61)(potentialFiles, fileSpecifier).slice(0, 2);
|
|
36669
|
+
return (0, $f2eb8388071f2c88$export$2115c2c0a84eef61)(potentialFiles.sort(), fileSpecifier).slice(0, 2);
|
|
36670
36670
|
}
|
|
36671
36671
|
|
|
36672
36672
|
|