@jesscss/core 2.0.0-alpha.1

package/lib/tree/util/collections.js

@@ -0,0 +1,136 @@
+import isPlainObject from 'lodash-es/isPlainObject.js';
+import { isNode } from './is-node.js';
+const { isArray } = Array;
+export function atIndex(array, index = -1) {
+    if (index >= 0) {
+        return array[index];
+    }
+    /** Use a negative index to access from the last element */
+    return array[array.length + index];
+}
+// type Test = GetEntriesOf<Node<string>>
+// type Test2 = GetEntriesOf<Node<string[]>>
+// type Test3 = GetEntriesOf<Node<{ selector: Node[], foo: 'string' }>>
+export function* getValues(collection, reverse = false) {
+    if (isArray(collection)) {
+        if (reverse) {
+            for (let i = collection.length - 1; i >= 0; i--) {
+                yield collection[i];
+            }
+        }
+        else {
+            let length = collection.length;
+            for (let i = 0; i < length; i++) {
+                yield collection[i];
+            }
+        }
+    }
+    else if (isPlainObject(collection)) {
+        const values = Object.values(collection);
+        for (let value of values) {
+            if (isArray(value)) {
+                yield* getValues(value, reverse);
+            }
+            else {
+                yield value;
+            }
+        }
+    }
+    else {
+        yield collection;
+    }
+}
+export function* getEntries(collection, reverse = false) {
+    if (isArray(collection)) {
+        if (reverse) {
+            for (let i = collection.length - 1; i >= 0; i--) {
+                yield [collection[i], i, collection];
+            }
+        }
+        else {
+            let length = collection.length;
+            for (let i = 0; i < length; i++) {
+                yield [collection[i], i, collection];
+            }
+        }
+    }
+    else if (isPlainObject(collection)) {
+        const entries = Object.entries(collection);
+        for (let [key, value] of entries) {
+            if (isArray(value)) {
+                yield* getEntries(value, reverse);
+            }
+            else {
+                yield [value, key, collection];
+            }
+        }
+    }
+    else if (isNode(collection, ['Mixin', 'Ruleset', 'Rules'])) {
+        let rules;
+        if (collection.type === 'Mixin') {
+            if (collection.value.params?.length) {
+                throw new Error('We can\'t iterate over a mixin with parameters');
+            }
+            rules = collection.value.rules.value;
+        }
+        else if (collection.type === 'Ruleset') {
+            rules = collection.value.rules.value;
+        }
+        else if (collection.type === 'Rules') {
+            rules = collection.value;
+        }
+        for (let [, value] of rules.entries()) {
+            if (value.type === 'Comment') {
+                continue;
+            }
+            if (!isNode(value, 'Declaration')) {
+                throw new Error('We can\'t iterate over rules with non-declarations');
+            }
+            yield [value.value.value, value.value.name, rules];
+        }
+    }
+    else if (isNode(collection) && isArray(collection.value)) {
+        yield* getEntries(collection.value, reverse);
+    }
+    else {
+        yield [collection, 'value', collection];
+    }
+}
+/**
+ * We use { value: unknown } as the type for the node so that
+ * we can easily override the value type when calling.
+ */
+export function* getValuesFromNode(node, reverse = false) {
+    let value = node.value;
+    if (isArray(value) || isPlainObject(value)) {
+        yield* getValues(value, reverse);
+    }
+    else {
+        yield value;
+    }
+}
+/**
+ * This is especially useful, because we don't have to care about what the Node's `value` is,
+ * we can just iterate over it and get the entries, and replace as necessary.
+ */
+export function* getEntriesFromNode(node, reverse = false) {
+    let value = node.value;
+    if (isArray(value) || isPlainObject(value)) {
+        yield* getEntries(value, reverse);
+    }
+    else {
+        yield [value, 'value', node];
+    }
+}
+export function arraysEqual(a, b) {
+    if (a.length !== b.length) {
+        return false;
+    }
+    for (let i = 0; i < a.length; i++) {
+        if (a[i] !== b[i]) {
+            return false;
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=collections.js.map

package/lib/tree/util/collections.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collections.js","sourceRoot":"","sources":["../../../src/tree/util/collections.ts"],"names":[],"mappings":"AAqBA,OAAO,aAAa,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAMtC,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;AAE1B,MAAM,UAAU,OAAO,CAAI,KAAmB,EAAE,QAAgB,CAAC,CAAC;IAChE,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;IACD,2DAA2D;IAC3D,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;AACrC,CAAC;AAuBD,yCAAyC;AACzC,4CAA4C;AAC5C,uEAAuE;AAEvE,MAAM,SAAS,CAAC,CAAC,SAAS,CAAI,UAAa,EAAE,OAAO,GAAG,KAAK;IAC1D,IAAI,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QACxB,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChD,MAAM,UAAU,CAAC,CAAC,CAAE,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,MAAM,UAAU,CAAC,CAAC,CAAE,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;SAAM,IAAI,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,UAAqC,CAAC,CAAC;QACpE,KAAK,IAAI,KAAK,IAAI,MAAM,EAAE,CAAC;YACzB,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnB,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YACnC,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,MAAM,UAAU,CAAC;IACnB,CAAC;AACH,CAAC;AAED,MAAM,SAAS,CAAC,CAAC,UAAU,CAAI,UAAa,EAAE,OAAO,GAAG,KAAK;IAC3D,IAAI,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QACxB,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChD,MAAM,CAAC,UAAU,CAAC,CAAC,CAAE,EAAE,CAAC,EAAE,UAAU,CAAoB,CAAC;YAC3D,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAE,EAAE,CAAC,EAAE,UAAU,CAAoB,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;SAAM,IAAI,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,UAAqC,CAAC,CAAC;QACtE,KAAK,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YACjC,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnB,KAAK,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAA+B,CAAC;YAClE,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,UAAU,CAAoB,CAAC;YACpD,CAAC;QACH,CAAC;IACH,CAAC;SAAM,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;QAC7D,IAAI,KAAa,CAAC;QAClB,IAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAChC,IAAK,UAAoB,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;gBAC/C,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;YACpE,CAAC;YACD,KAAK,GAAI,UAAoB,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC;QAClD,CAAC;aAAM,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACzC,KAAK,GAAI,UAAsB,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC;QACpD,CAAC;aAAM,IAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACvC,KAAK,GAAI,UAAoB,CAAC,KAAK,CAAC;QACtC,CAAC;QACD,KAAK,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,KAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YACvC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC7B,SAAS;YACX,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC;gBAClC,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;YACxE,CAAC;YACD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,KAAM,CAA+B,CAAC;QACpF,CAAC;IACH,CAAC;SAAM,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,OAAO,CAAE,UAAmB,CAAC,KAAK,CAAC,EAAE,CAAC;QACrE,KAAK,CAAC,CAAC,UAAU,CAAE,UAAmB,CAAC,KAAkB,EAAE,OAAO,CAA+B,CAAC;IACpG,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,UAAU,CAAoB,CAAC;IAC7D,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,SAAS,CAAC,CAAC,iBAAiB,CAA+B,IAAO,EAAE,OAAO,GAAG,KAAK;IACvF,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IACvB,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3C,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAkC,CAAC;IACpE,CAAC;SAAM,CAAC;QACN,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,SAAS,CAAC,CAAC,kBAAkB,CAA+B,IAAO,EAAE,OAAO,GAAG,KAAK;IACxF,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IACvB,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3C,KAAK,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAkC,CAAC;IACrE,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,CAAoB,CAAC;IAClD,CAAC;AACH,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,CAAW,EAAE,CAAW;IAClD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAClB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/lib/tree/util/compare.d.ts

@@ -0,0 +1,11 @@
+import { type Node } from '../node.js';
+import type { EqualityMode } from '../../types/modes.js';
+export declare function compare(a: any, b: any, mode?: EqualityMode): 0 | 1 | -1 | undefined;
+/**
+ * Find the actual source order of two nodes, by comparing
+ * their position in their lowest common ancestor in the tree.
+ */
+export declare function comparePosition(a: Node, b: Node): number;
+export declare function compareNodeArray(a: any[], b: any[], mode?: EqualityMode): 0 | 1 | -1 | undefined;
+export { selectorCompare } from './selector-compare.js';
+//# sourceMappingURL=compare.d.ts.map

package/lib/tree/util/compare.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare.d.ts","sourceRoot":"","sources":["../../../src/tree/util/compare.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,KAAK,IAAI,EAAE,MAAM,YAAY,CAAC;AAEvC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAEzD,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,GAAE,YAAuB,0BAepE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,UA8C/C;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,GAAE,YAAuB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAuB1G;AAED,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC"}

package/lib/tree/util/compare.js

@@ -0,0 +1,89 @@
+import { isNode } from './is-node.js';
+import isObject from 'lodash-es/isObject.js';
+export function compare(a, b, mode = 'coerce') {
+    if (a === b) {
+        return 0;
+    }
+    if (!isObject(a) && !isObject(b)) {
+        return a > b ? 1 : -1;
+    }
+    if (isNode(a) && isNode(b)) {
+        return a.compare(b);
+    }
+    /** Do comparison without strict equality */
+    if (mode === 'coerce' && a == b) {
+        return 0;
+    }
+    return undefined;
+}
+/**
+ * Find the actual source order of two nodes, by comparing
+ * their position in their lowest common ancestor in the tree.
+ */
+export function comparePosition(a, b) {
+    /** Find the lowest common ancestor rules */
+    let min = Math.min(a.depth, b.depth);
+    let a0 = a;
+    let b0 = b;
+    /** Get to the same rules depth */
+    if (a.depth !== min) {
+        while (a.depth > min) {
+            a = a.rulesParent;
+        }
+    }
+    else if (b.depth !== min) {
+        while (b.depth > min) {
+            b = b.rulesParent;
+        }
+    }
+    /** Now, get to the same rules ancestor */
+    while (a !== b) {
+        a = a.rulesParent;
+        b = b.rulesParent;
+    }
+    let commonAncestor = a;
+    /** Now, go up the tree to the same ancestor */
+    let aParent = a0;
+    let bParent = b0;
+    while (true) {
+        aParent = aParent.parent;
+        if (aParent === commonAncestor) {
+            break;
+        }
+        a0 = aParent;
+    }
+    while (true) {
+        bParent = bParent.parent;
+        if (bParent === commonAncestor) {
+            break;
+        }
+        b0 = bParent;
+    }
+    /** Now we should have siblings in the nearest common ancestor */
+    return a0.index - b0.index;
+}
+export function compareNodeArray(a, b, mode = 'coerce') {
+    let output;
+    if (a.length !== b.length) {
+        return undefined;
+    }
+    /**
+     * All values must be equal, or less than, or greater than.
+     * Anything else is undefined.
+     */
+    for (let i = 0; i < a.length; i++) {
+        let result = compare(a[i], b[i], mode);
+        if (result === undefined) {
+            return undefined;
+        }
+        if (output === undefined) {
+            output = result;
+        }
+        else if (result !== output) {
+            return undefined;
+        }
+    }
+    return output;
+}
+export { selectorCompare } from './selector-compare.js';
+//# sourceMappingURL=compare.js.map

package/lib/tree/util/compare.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare.js","sourceRoot":"","sources":["../../../src/tree/util/compare.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,QAAQ,MAAM,uBAAuB,CAAC;AAK7C,MAAM,UAAU,OAAO,CAAC,CAAM,EAAE,CAAM,EAAE,OAAqB,QAAQ;IACnE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3B,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,4CAA4C;IAC5C,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,CAAO,EAAE,CAAO;IAC9C,4CAA4C;IAC5C,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAErC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IAEX,kCAAkC;IAClC,IAAI,CAAC,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;QACpB,OAAO,CAAC,CAAC,KAAK,GAAG,GAAG,EAAE,CAAC;YACrB,CAAC,GAAG,CAAC,CAAC,WAAY,CAAC;QACrB,CAAC;IACH,CAAC;SAAM,IAAI,CAAC,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;QAC3B,OAAO,CAAC,CAAC,KAAK,GAAG,GAAG,EAAE,CAAC;YACrB,CAAC,GAAG,CAAC,CAAC,WAAY,CAAC;QACrB,CAAC;IACH,CAAC;IACD,0CAA0C;IAC1C,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACf,CAAC,GAAG,CAAC,CAAC,WAAY,CAAC;QACnB,CAAC,GAAG,CAAC,CAAC,WAAY,CAAC;IACrB,CAAC;IACD,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,+CAA+C;IAC/C,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,IAAI,OAAO,GAAG,EAAE,CAAC;IAEjB,OAAO,IAAI,EAAE,CAAC;QACZ,OAAO,GAAG,OAAO,CAAC,MAAO,CAAC;QAC1B,IAAI,OAAO,KAAK,cAAc,EAAE,CAAC;YAC/B,MAAM;QACR,CAAC;QACD,EAAE,GAAG,OAAO,CAAC;IACf,CAAC;IAED,OAAO,IAAI,EAAE,CAAC;QACZ,OAAO,GAAG,OAAO,CAAC,MAAO,CAAC;QAC1B,IAAI,OAAO,KAAK,cAAc,EAAE,CAAC;YAC/B,MAAM;QACR,CAAC;QACD,EAAE,GAAG,OAAO,CAAC;IACf,CAAC;IAED,iEAAiE;IACjE,OAAO,EAAE,CAAC,KAAM,GAAG,EAAE,CAAC,KAAM,CAAC;AAC/B,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,CAAQ,EAAE,CAAQ,EAAE,OAAqB,QAAQ;IAChF,IAAI,MAA8B,CAAC;IAEnC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,CAAC;QACzC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,GAAG,MAAM,CAAC;QAClB,CAAC;aAAM,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YAC7B,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC"}

package/lib/tree/util/extend-helpers.d.ts

@@ -0,0 +1,2 @@
+export * from "./selector-match-core.js";
+//# sourceMappingURL=extend-helpers.d.ts.map

package/lib/tree/util/extend-helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"extend-helpers.d.ts","sourceRoot":"","sources":["../../../src/tree/util/extend-helpers.ts"],"names":[],"mappings":"AAAA,cAAc,0BAA0B,CAAC"}

package/lib/tree/util/extend-helpers.js

@@ -0,0 +1,2 @@
+export * from "./selector-match-core.js";
+//# sourceMappingURL=extend-helpers.js.map

package/lib/tree/util/extend-helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"extend-helpers.js","sourceRoot":"","sources":["../../../src/tree/util/extend-helpers.ts"],"names":[],"mappings":"AAAA,cAAc,0BAA0B,CAAC"}

package/lib/tree/util/extend-roots.d.ts

@@ -0,0 +1,37 @@
+import type { Context } from '../../context.js';
+import type { AtRule } from '../at-rule.js';
+import type { Rules } from '../rules.js';
+import type { Ruleset } from '../ruleset.js';
+export declare class ExtendRootRegistry {
+    private parentRoot;
+    private childrenRoots;
+    private layerName;
+    private isProtected;
+    private isCompose;
+    private rootsByLayerName;
+    private rootsByNamespace;
+    private layerNames;
+    private allRoots;
+    root?: Rules;
+    extendRootStack: Rules[];
+    getCurrentExtendRoot(): Rules | undefined;
+    registerRoot(rules: Rules, parent?: Rules, options?: {
+        layerName?: string;
+        isProtected?: boolean;
+        isCompose?: boolean;
+        namespace?: string;
+    }): void;
+    pushExtendRoot(rules: Rules): void;
+    popExtendRoot(): void;
+    getVisibleRoots(root: Rules): Set<Rules>;
+    getAccessibleRoots(root: Rules): Set<Rules>;
+    isSameOrDescendantRoot(rulesetRoot: Rules, extendRoot: Rules): boolean;
+    setLayerName(atRule: AtRule, layerName: string): void;
+    getLayerName(atRule: AtRule): string | undefined;
+    takeLayerName(atRule: AtRule): string | undefined;
+    getAllRoots(): Set<Rules>;
+    isProtectedRoot(rules: Rules): boolean;
+}
+export declare function registerRulesetWithRoot(root: Rules, ruleset: Ruleset): void;
+export declare function processExtends(context: Context): void;
+//# sourceMappingURL=extend-roots.d.ts.map

package/lib/tree/util/extend-roots.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"extend-roots.d.ts","sourceRoot":"","sources":["../../../src/tree/util/extend-roots.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAEhD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAG5C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAY7C,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,UAAU,CAA+B;IACjD,OAAO,CAAC,aAAa,CAAoC;IACzD,OAAO,CAAC,SAAS,CAAgC;IACjD,OAAO,CAAC,WAAW,CAAiC;IACpD,OAAO,CAAC,SAAS,CAAiC;IAClD,OAAO,CAAC,gBAAgB,CAAiC;IACzD,OAAO,CAAC,gBAAgB,CAAiC;IACzD,OAAO,CAAC,UAAU,CAAiC;IACnD,OAAO,CAAC,QAAQ,CAAoB;IAEpC,IAAI,CAAC,EAAE,KAAK,CAAC;IACb,eAAe,EAAE,KAAK,EAAE,CAAM;IAE9B,oBAAoB,IAAI,KAAK,GAAG,SAAS;IAIzC,YAAY,CACV,KAAK,EAAE,KAAK,EACZ,MAAM,CAAC,EAAE,KAAK,EACd,OAAO,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,OAAO,CAAC;QAAC,SAAS,CAAC,EAAE,OAAO,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAE,GAC/F,IAAI;IA8CP,cAAc,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI;IAIlC,aAAa,IAAI,IAAI;IAIrB,eAAe,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;IAIxC,kBAAkB,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;IA6D3C,sBAAsB,CAAC,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,GAAG,OAAO;IA2BtE,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAIrD,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAIhD,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAQjD,WAAW,IAAI,GAAG,CAAC,KAAK,CAAC;IAIzB,eAAe,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO;CAGvC;AAYD,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAW3E;AAsED,wBAAgB,cAAc,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,CAwerD"}