@parcel/utils 2.0.0-nightly.1376 → 2.0.0-nightly.1381

package/lib/index.js

@@ -3475,7 +3475,6 @@ $parcel$export(module.exports, "matchSourceMappingURL", () => $58ae611e06043814$
 $parcel$export(module.exports, "loadSourceMapUrl", () => $58ae611e06043814$export$527a92fa675f5e93);
 $parcel$export(module.exports, "loadSourceMap", () => $58ae611e06043814$export$c500fecaca54de65);
 $parcel$export(module.exports, "remapSourceLocation", () => $58ae611e06043814$export$2fed780245c466c1);
-$parcel$export(module.exports, "BitSet", () => $0f54b57eb7ece508$export$33dc8f3f7b9e35df);
 $parcel$export(module.exports, "stripAnsi", () => (/*@__PURE__*/$parcel$interopDefault($166044cf9ce846b7$exports)));
 function $e7d0753bf78fdf0d$export$2e2bcd8739ae039(string, startIndex = 0) {
     let lines = 1;
@@ -35153,7 +35152,7 @@ var $fc60114c9ddc0bb9$var$util = {
         return typeof c === "string" && (c >= "a" && c <= "z" || c >= "A" && c <= "Z" || c === "$" || c === "_" || $fc60114c9ddc0bb9$var$unicode.ID_Start.test(c));
     },
     isIdContinueChar (c) {
-        return typeof c === "string" && (c >= "a" && c <= "z" || c >= "A" && c <= "Z" || c >= "0" && c <= "9" || c === "$" || c === "_" || c === "‌" || c === "‍" || $fc60114c9ddc0bb9$var$unicode.ID_Continue.test(c));
+        return typeof c === "string" && (c >= "a" && c <= "z" || c >= "A" && c <= "Z" || c >= "0" && c <= "9" || c === "$" || c === "_" || c === "\u200C" || c === "\u200D" || $fc60114c9ddc0bb9$var$unicode.ID_Continue.test(c));
     },
     isDigit (c) {
         return typeof c === "string" && /[0-9]/.test(c);
@@ -35419,8 +35418,8 @@ const $fc60114c9ddc0bb9$var$lexStates = {
         switch($fc60114c9ddc0bb9$var$c){
             case "$":
             case "_":
-            case "‌":
-            case "‍":
+            case "\u200C":
+            case "\u200D":
                 $fc60114c9ddc0bb9$var$buffer += $fc60114c9ddc0bb9$var$read();
                 return;
             case "\\":
@@ -35441,8 +35440,8 @@ const $fc60114c9ddc0bb9$var$lexStates = {
         switch(u){
             case "$":
             case "_":
-            case "‌":
-            case "‍":
+            case "\u200C":
+            case "\u200D":
                 break;
             default:
                 if (!$fc60114c9ddc0bb9$var$util.isIdContinueChar(u)) throw $fc60114c9ddc0bb9$var$invalidIdentifier();
@@ -37540,97 +37539,6 @@ function $58ae611e06043814$export$2fed780245c466c1(loc, originalMap) {
 }
 
 
-
-// As our current version of flow doesn't support BigInt's, these values/types
-// have been hoisted to keep the flow errors to a minimum. This can be removed
-// if we upgrade to a flow version that supports BigInt's
-// $FlowFixMe
-// $FlowFixMe
-const $0f54b57eb7ece508$var$BIGINT_ZERO = 0n;
-// $FlowFixMe
-const $0f54b57eb7ece508$var$BIGINT_ONE = 1n;
-// $FlowFixMe
-let $0f54b57eb7ece508$var$numberToBigInt = (v)=>BigInt(v);
-let $0f54b57eb7ece508$var$bitUnion = (a, b)=>a | b;
-class $0f54b57eb7ece508$export$33dc8f3f7b9e35df {
-    constructor({ initial: initial, items: items, lookup: lookup }){
-        var _initial;
-        if (initial instanceof $0f54b57eb7ece508$export$33dc8f3f7b9e35df) this._value = (_initial = initial) === null || _initial === void 0 ? void 0 : _initial._value;
-        else if (initial) this._value = initial;
-        else this._value = $0f54b57eb7ece508$var$BIGINT_ZERO;
-        this._items = items;
-        this._lookup = lookup;
-    }
-    static from(items) {
-        let lookup = new Map();
-        for(let i = 0; i < items.length; i++)lookup.set(items[i], $0f54b57eb7ece508$var$numberToBigInt(i));
-        return new $0f54b57eb7ece508$export$33dc8f3f7b9e35df({
-            items: items,
-            lookup: lookup
-        });
-    }
-    static union(a, b) {
-        return new $0f54b57eb7ece508$export$33dc8f3f7b9e35df({
-            initial: $0f54b57eb7ece508$var$bitUnion(a._value, b._value),
-            lookup: a._lookup,
-            items: a._items
-        });
-    }
-    #getIndex(item) {
-        return (0, (/*@__PURE__*/$parcel$interopDefault($3fb15c2a4d9dd820$exports)))(this._lookup.get(item), "Item is missing from BitSet");
-    }
-    add(item) {
-        this._value |= $0f54b57eb7ece508$var$BIGINT_ONE << this.#getIndex(item);
-    }
-    delete(item) {
-        this._value &= ~($0f54b57eb7ece508$var$BIGINT_ONE << this.#getIndex(item));
-    }
-    has(item) {
-        return Boolean(this._value & $0f54b57eb7ece508$var$BIGINT_ONE << this.#getIndex(item));
-    }
-    intersect(v) {
-        this._value = this._value & v._value;
-    }
-    union(v) {
-        this._value = $0f54b57eb7ece508$var$bitUnion(this._value, v._value);
-    }
-    clear() {
-        this._value = $0f54b57eb7ece508$var$BIGINT_ZERO;
-    }
-    cloneEmpty() {
-        return new $0f54b57eb7ece508$export$33dc8f3f7b9e35df({
-            lookup: this._lookup,
-            items: this._items
-        });
-    }
-    clone() {
-        return new $0f54b57eb7ece508$export$33dc8f3f7b9e35df({
-            lookup: this._lookup,
-            items: this._items,
-            initial: this._value
-        });
-    }
-    values() {
-        let values = [];
-        let tmpValue = this._value;
-        let i;
-        // This implementation is optimized for BitSets that contain a very small percentage
-        // of items compared to the total number of potential items. This makes sense for
-        // our bundler use-cases where Sets often contain <1% coverage of the total item count.
-        // In cases where Sets contain a larger percentage of the total items, a regular looping
-        // strategy would be more performant.
-        while(tmpValue > $0f54b57eb7ece508$var$BIGINT_ZERO){
-            // Get last set bit
-            i = tmpValue.toString(2).length - 1;
-            values.push(this._items[i]);
-            // Unset last set bit
-            tmpValue &= ~($0f54b57eb7ece508$var$BIGINT_ONE << $0f54b57eb7ece508$var$numberToBigInt(i));
-        }
-        return values;
-    }
-}
-
-
 var $166044cf9ce846b7$exports = {};
 "use strict";
 var $d1a267d3dbd285eb$exports = {};