@parcel/utils 2.0.0-nightly.1256 → 2.0.0-nightly.1266

package/lib/index.js

@@ -3475,6 +3475,8 @@ $parcel$export(module.exports, "matchSourceMappingURL", () => $46fc74961fdcfe31$
 $parcel$export(module.exports, "loadSourceMapUrl", () => $46fc74961fdcfe31$export$527a92fa675f5e93);
 $parcel$export(module.exports, "loadSourceMap", () => $46fc74961fdcfe31$export$c500fecaca54de65);
 $parcel$export(module.exports, "remapSourceLocation", () => $46fc74961fdcfe31$export$2fed780245c466c1);
+$parcel$export(module.exports, "BitSet", () => $2c32463ab90dab73$export$33dc8f3f7b9e35df);
+$parcel$export(module.exports, "stripAnsi", () => (/*@__PURE__*/$parcel$interopDefault($f709bcec854d2334$exports)));
 function $fddc9169ba2fd655$export$2e2bcd8739ae039(string, startIndex = 0) {
     let lines = 1;
     for(let i = startIndex; i < string.length; i++)if (string.charAt(i) === "\n") lines++;
@@ -36823,5 +36825,106 @@ function $46fc74961fdcfe31$export$2fed780245c466c1(loc, originalMap) {
 
 
 
+// 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 $2c32463ab90dab73$var$BIGINT_ZERO = 0n; // $FlowFixMe
+const $2c32463ab90dab73$var$BIGINT_ONE = 1n; // $FlowFixMe
+let $2c32463ab90dab73$var$numberToBigInt = (v)=>BigInt(v);
+let $2c32463ab90dab73$var$bitUnion = (a, b)=>a | b;
+class $2c32463ab90dab73$export$33dc8f3f7b9e35df {
+    constructor({ initial: initial , items: items , lookup: lookup  }){
+        if (initial instanceof $2c32463ab90dab73$export$33dc8f3f7b9e35df) this._value = initial === null || initial === void 0 ? void 0 : initial._value;
+        else if (initial) this._value = initial;
+        else this._value = $2c32463ab90dab73$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], $2c32463ab90dab73$var$numberToBigInt(i));
+        return new $2c32463ab90dab73$export$33dc8f3f7b9e35df({
+            items: items,
+            lookup: lookup
+        });
+    }
+    static union(a, b) {
+        return new $2c32463ab90dab73$export$33dc8f3f7b9e35df({
+            initial: $2c32463ab90dab73$var$bitUnion(a._value, b._value),
+            lookup: a._lookup,
+            items: a._items
+        });
+    }
+    #getIndex(item) {
+        return (0, (/*@__PURE__*/$parcel$interopDefault($812806c6461f2963$exports)))(this._lookup.get(item), "Item is missing from BitSet");
+    }
+    add(item) {
+        this._value |= $2c32463ab90dab73$var$BIGINT_ONE << this.#getIndex(item);
+    }
+    delete(item) {
+        this._value &= ~($2c32463ab90dab73$var$BIGINT_ONE << this.#getIndex(item));
+    }
+    has(item) {
+        return Boolean(this._value & $2c32463ab90dab73$var$BIGINT_ONE << this.#getIndex(item));
+    }
+    intersect(v) {
+        this._value = this._value & v._value;
+    }
+    union(v) {
+        this._value = $2c32463ab90dab73$var$bitUnion(this._value, v._value);
+    }
+    clear() {
+        this._value = $2c32463ab90dab73$var$BIGINT_ZERO;
+    }
+    cloneEmpty() {
+        return new $2c32463ab90dab73$export$33dc8f3f7b9e35df({
+            lookup: this._lookup,
+            items: this._items
+        });
+    }
+    clone() {
+        return new $2c32463ab90dab73$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 > $2c32463ab90dab73$var$BIGINT_ZERO){
+            // Get last set bit
+            i = tmpValue.toString(2).length - 1;
+            values.push(this._items[i]); // Unset last set bit
+            tmpValue &= ~($2c32463ab90dab73$var$BIGINT_ONE << $2c32463ab90dab73$var$numberToBigInt(i));
+        }
+        return values;
+    }
+}
+
+
+var $f709bcec854d2334$exports = {};
+"use strict";
+var $55a853fa49f658b3$exports = {};
+"use strict";
+$55a853fa49f658b3$exports = ({ onlyFirst: onlyFirst = false  } = {})=>{
+    const pattern = [
+        "[\\u001B\\u009B][[\\]()#;?]*(?:(?:(?:(?:;[-a-zA-Z\\d\\/#&.:=?%@~_]+)*|[a-zA-Z\\d]+(?:;[-a-zA-Z\\d\\/#&.:=?%@~_]*)*)?\\u0007)",
+        "(?:(?:\\d{1,4}(?:;\\d{0,4})*)?[\\dA-PR-TZcf-ntqry=><~]))"
+    ].join("|");
+    return new RegExp(pattern, onlyFirst ? undefined : "g");
+};
+
+
+$f709bcec854d2334$exports = (string)=>typeof string === "string" ? string.replace($55a853fa49f658b3$exports(), "") : string;
+
+
+
 
 //# sourceMappingURL=index.js.map