@jesscss/core 2.0.0-alpha.5 → 2.0.0-alpha.6

package/lib/tree/util/recursion-helper.js

@@ -1,43 +0,0 @@
-import { isNode } from './is-node.js';
-/**
- * This memoizes arguments for a call and returns true
- * if the call has called itself with the same arguments.
- *
- * It lazily indexes the arguments when there's a subsequent
- * call.
- */
-export class CallMap {
-    _callMap = new Map();
-    add(call, args) {
-        let set = this._callMap.get(call);
-        if (!set) {
-            this._callMap.set(call, [isNode(args) ? args.sourceNode : undefined]);
-        }
-        else {
-            if (args === undefined && set.includes(undefined)) {
-                return true;
-            }
-            let argsValue = args.valueOf();
-            for (let i = 0; i < set.length; i++) {
-                let item = set[i];
-                let itemValue = item.valueOf();
-                if (itemValue === argsValue) {
-                    return true;
-                }
-            }
-        }
-        return false;
-    }
-    delete(call) {
-        let set = this._callMap.get(call);
-        if (set) {
-            set.pop();
-            if (set.length === 0) {
-                this._callMap.delete(call);
-            }
-            return true;
-        }
-        return false;
-    }
-}
-//# sourceMappingURL=recursion-helper.js.map

package/lib/tree/util/recursion-helper.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"recursion-helper.js","sourceRoot":"","sources":["../../../src/tree/util/recursion-helper.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAGtC;;;;;;GAMG;AACH,MAAM,OAAO,OAAO;IACV,QAAQ,GAAG,IAAI,GAAG,EAAmC,CAAC;IAE9D,GAAG,CAAC,IAAU,EAAE,IAAsB;QACpC,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,IAAI,CAAC,UAAmB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAClF,CAAC;aAAM,CAAC;YACN,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;gBAClD,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,SAAS,GAAI,IAAa,CAAC,OAAO,EAAE,CAAC;YAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,IAAI,IAAI,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;gBACnB,IAAI,SAAS,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;gBAC/B,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;oBAC5B,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,CAAC,IAAU;QACf,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,GAAG,EAAE,CAAC;YACR,GAAG,CAAC,GAAG,EAAE,CAAC;YACV,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACrB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC7B,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

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

@@ -1,4 +0,0 @@
-/** Regex constants to re-use */
-export declare const MULTI_LINE_TRIM: RegExp;
-export declare const LIST_ITEM_TRIM: RegExp;
-//# sourceMappingURL=regex.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"regex.d.ts","sourceRoot":"","sources":["../../../src/tree/util/regex.ts"],"names":[],"mappings":"AAAA,gCAAgC;AAChC,eAAO,MAAM,eAAe,QAAgD,CAAC;AAC7E,eAAO,MAAM,cAAc,QAAwC,CAAC"}

package/lib/tree/util/regex.js

@@ -1,4 +0,0 @@
-/** Regex constants to re-use */
-export const MULTI_LINE_TRIM = /^[ \t\r\f]*\n?|[ \t\r\f]*(\n[ \t\r\f]*)?$/gm;
-export const LIST_ITEM_TRIM = /^[ \t\r\f]*|([ \t\r\f]*)((?=\n)|$)/g;
-//# sourceMappingURL=regex.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"regex.js","sourceRoot":"","sources":["../../../src/tree/util/regex.ts"],"names":[],"mappings":"AAAA,gCAAgC;AAChC,MAAM,CAAC,MAAM,eAAe,GAAG,6CAA6C,CAAC;AAC7E,MAAM,CAAC,MAAM,cAAc,GAAG,qCAAqC,CAAC"}

package/lib/tree/util/registry-utils.d.ts

@@ -1,192 +0,0 @@
-import type { Ruleset } from '../ruleset.js';
-import type { Rules } from '../rules.js';
-import type { Mixin } from '../mixin.js';
-import { Node } from '../node.js';
-import { JsFunction } from '../js-function.js';
-import type { Func } from '../function.js';
-import type { Declaration } from '../declaration.js';
-import type { Context } from '../../context.js';
-export type DeclarationFindOptions = {
-    filter?: (n: Node) => boolean;
-    candidates?: Set<Node>;
-    optionalCandidates?: Set<Node>;
-    findAll?: boolean;
-    /** This gets set if any parent is set to readonly */
-    readonly?: boolean;
-    searchParents?: boolean;
-    start?: number;
-    local?: boolean;
-};
-export type FindOptions = DeclarationFindOptions & {
-    childFilterType?: 'Mixin' | 'Ruleset' | undefined;
-    context?: Context;
-    searchedRules?: Set<Rules>;
-    /**
-     * Whether this lookup has an explicit target (e.g., #ns[@foo]).
-     * When true, Rules with isMixinOutput=true will be searchable.
-     * When false or undefined, mixin output Rules will be excluded.
-     */
-    hasTarget?: boolean;
-};
-export declare abstract class Registry<Type extends Node, IndexType extends Type | Set<Type> | Array<{
-    value: Type;
-    [key: string]: any;
-}> = Set<Type>> {
-    rules: Rules;
-    abstract index: Map<string, IndexType>;
-    protected pendingItems: Set<Type>;
-    constructor(rules: Rules);
-    add(item: Type): void;
-    indexPendingItems(): void;
-    _searchRulesChildren(key: string, filterType: 'VarDeclaration' | 'Declaration' | 'Mixin', options?: FindOptions): void;
-    /**
-     * Find the closest declaration from start, in reverse order,
-     * using a binary search
-     */
-    _findClosestByStart(list: Type[], start?: number): Type | undefined;
-    private _findByKey;
-    find(keys: string | string[] | Set<string>, _filterType?: string, _options?: FindOptions): Type[] | Type | Array<{
-        value: Type;
-        [key: string]: any;
-    }> | undefined;
-}
-/**
- * Registry for fast selector-based ruleset lookups
- */
-export declare class RulesetRegistry extends Registry<Ruleset> {
-    index: Map<string, Set<Ruleset<import("../ruleset.js").RulesetValue>>>;
-    /**
-     * Add a ruleset to be indexed later
-     */
-    add(ruleset: Ruleset): void;
-    /**
-     * Index any pending rulesets
-     * Override the base class method to use keySet-based indexing
-     */
-    indexPendingItems(): void;
-    /**
-     * Find candidate rulesets that might match the target selector.
-     * Searches only the local index - all rulesets should be registered
-     * to the extend root's registry during evaluation.
-     */
-    find(keys: string[] | Set<string>): Ruleset[] | undefined;
-}
-/**
- * The mixin registry works a little differently than the selector registry
- * in these ways:
- *
- * 1. The mixin registry can only be indexed by basic element, class, and
- *    id selectors.
- * 2. The index is the start key, not any key found in the selector.
- * 3. '>' and ' ' combinators are ignored.
- * 4. Initial ampersands (implicit or explicit) are ignored.
- * 5. The mixin registry is local to the rules, whereas the selector registry
- *    is global to the file tree.
- * 6. Rulesets and mixins without params will have their children searched
- *    if the first part matches.
- */
-export declare class MixinRegistry extends Registry<Mixin | Ruleset, Array<{
-    value: Mixin | Ruleset;
-    match: string[];
-}>> {
-    index: Map<any, any>;
-    private _indexSelectorStart;
-    indexPendingItems(): void;
-    /**
-     * Check if an entry matches the search criteria.
-     * Handles exact matches, partial matches (compound selector completion), and recursive searches.
-     * This consolidates the matching logic to avoid duplication.
-     */
-    /**
-     * Check if a Ruleset/Mixin matches a given array of keys using the same logic as the registry
-     * This uses the indexed match arrays (same as _checkEntryMatch) rather than direct selector comparison
-     * @param value The Ruleset or Mixin to check
-     * @param keys The array of keys to match against (e.g., [".jo", ".ki"])
-     * @returns true if the Ruleset/Mixin matches the keys using registry matching logic
-     */
-    checkRulesetMatchesKeys(value: Mixin | Ruleset, keys: string[]): boolean;
-    /**
-     * Internal helper that checks if the provided keys appear in sequence within the selector's keys
-     *
-     * For compound selectors like `#header .milk .chips .jo.ki`, when we search for `.jo`, we get:
-     * - The full selector's indexable keys: `["#header", ".milk", ".chips", ".jo", ".ki"]`
-     * - When checking if accumulated keys `[".jo", ".ki"]` match, we check if they appear in sequence
-     */
-    private _checkKeysSubsequence;
-    /**
-     * Find candidate mixins (or rulesets, or both) that might match the target selector
-     *
-     * ...also...
-     *
-     * @todo - Not sure how recursion works here with the match overflow and returning
-     * proper arrays.
-     */
-    find(keys: string | string[], filterType?: 'Mixin' | 'Ruleset' | undefined, options?: FindOptions): (Mixin | Ruleset)[] | undefined;
-}
-/**
- * For either Sass, Jess, or JS functions.
- *
- * Less and Sass can register global functions that can be called from the language
- * without a `@-use` directive.
- *
- * @todo Should the presence of `@-use` directives anywhere in the
- * stylesheet tree cause these global functions to be disabled?
- */
-export declare class FunctionRegistry extends Registry<JsFunction | Func, JsFunction | Func> {
-    index: Map<string, Func | JsFunction>;
-    cloneForRules(rules: Rules): FunctionRegistry;
-    indexPendingItems(): void;
-    find(name: string, filterType?: string, options?: FindOptions): JsFunction | Func | undefined;
-    /**
-     * Override add() to support both Jess API (add(item)) and Less.js API (add(name, func))
-     */
-    add(item: JsFunction | Func): void;
-    add(name: string, func: JsFunction | ((...args: any[]) => any)): void;
-    /**
-     * Less.js-compatible API: Add multiple functions at once
-     * @param functions Object mapping function names to functions
-     */
-    addMultiple(functions: Record<string, JsFunction | ((...args: any[]) => any)>): void;
-    /**
-     * Less.js-compatible API: Get a function by name
-     * Uses case-insensitive lookup and searches parent chain
-     * @param name Function name (case-insensitive)
-     * @returns The function if found, undefined otherwise
-     */
-    get(name: string): JsFunction | Func | undefined;
-    /**
-     * Less.js-compatible API: Get all local functions (without parent chain)
-     * @returns Object mapping function names to functions
-     */
-    getLocalFunctions(): Record<string, JsFunction | Func>;
-    /**
-     * Less.js-compatible API: Create a child registry that inherits from this one
-     * In Less.js, this creates a new registry with prototype inheritance.
-     * In Jess, we create a new registry that searches this one as a parent.
-     *
-     * @returns A new FunctionRegistry that will search this registry when functions aren't found locally
-     */
-    inherit(): FunctionRegistry;
-}
-/**
- *
- * @note - Keys of different types may overlap, but then are filtered when searching.
- *         As in, a variable named `$foo` and a property named `foo` will be in the
- *         same map.
- */
-export declare class DeclarationRegistry extends Registry<Declaration> {
-    index: Map<string, Set<Declaration<import("../declaration.js").DeclarationOptions>>>;
-    indexPendingItems(): void;
-    /**
-     * Get declarations from map and nested rulesets.
-     * This will return a list of all matching nodes.
-     *
-     * @todo - The pattern for mixins will be similar, no? Can this be
-     * re-used / abstracted?
-     *
-     * @todo - Register declarations and index them only when searching.
-     * This would be similar to how we index rulesets for extending.
-     */
-    find(key: string, filterType?: 'VarDeclaration' | 'Declaration', options?: FindOptions): Declaration | undefined;
-}
-//# sourceMappingURL=registry-utils.d.ts.map

package/lib/tree/util/registry-utils.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"registry-utils.d.ts","sourceRoot":"","sources":["../../../src/tree/util/registry-utils.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAE7C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAClC,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAMhD,MAAM,MAAM,sBAAsB,GAAG;IACnC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,OAAO,CAAC;IAC9B,UAAU,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IACvB,kBAAkB,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,qDAAqD;IACrD,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB,CAAC;AAEF,MAAM,MAAM,WAAW,GAAG,sBAAsB,GAAG;IACjD,eAAe,CAAC,EAAE,OAAO,GAAG,SAAS,GAAG,SAAS,CAAC;IAClD,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,aAAa,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;IAC3B;;;;OAIG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB,CAAC;AAEF,8BAAsB,QAAQ,CAC5B,IAAI,SAAS,IAAI,EACjB,SAAS,SAAS,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;IACzC,KAAK,EAAE,IAAI,CAAC;IACZ,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC;CACpB,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;IAKK,KAAK,EAAE,KAAK;IAH/B,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACvC,SAAS,CAAC,YAAY,YAAmB;gBAEtB,KAAK,EAAE,KAAK;IAE/B,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAIrB,iBAAiB;IAajB,oBAAoB,CAClB,GAAG,EAAE,MAAM,EACX,UAAU,EAAE,gBAAgB,GAAG,aAAa,GAAG,OAAO,EACtD,OAAO,GAAE,WAAgB;IAqK3B;;;OAGG;IACH,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM;IAiChD,OAAO,CAAC,UAAU;IA2BlB,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,WAAW,GAAG,IAAI,EAAE,GAAG,IAAI,GAAG,KAAK,CAAC;QAAE,KAAK,EAAE,IAAI,CAAC;QAAC,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAA;KAAE,CAAC,GAAG,SAAS;CAelK;AAED;;GAEG;AACH,qBAAa,eAAgB,SAAQ,QAAQ,CAAC,OAAO,CAAC;IACpD,KAAK,kEAAmC;IAExC;;OAEG;IACM,GAAG,CAAC,OAAO,EAAE,OAAO;IAM7B;;;OAGG;IACM,iBAAiB;IAyB1B;;;;OAIG;IACM,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,OAAO,EAAE,GAAG,SAAS;CAsCnE;AAED;;;;;;;;;;;;;GAaG;AACH,qBAAa,aAAc,SAAQ,QAAQ,CACzC,KAAK,GAAG,OAAO,EACf,KAAK,CAAC;IACJ,KAAK,EAAE,KAAK,GAAG,OAAO,CAAC;IACvB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB,CAAC,CACH;IACC,KAAK,gBAAa;IA0ClB,OAAO,CAAC,mBAAmB;IAyBlB,iBAAiB;IA+F1B;;;;OAIG;IACH;;;;;;OAMG;IACH,uBAAuB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO;IAmDxE;;;;;;OAMG;IACH,OAAO,CAAC,qBAAqB;IAiB7B;;;;;;;OAOG;IACM,IAAI,CACX,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,EACvB,UAAU,GAAE,OAAO,GAAG,SAAS,GAAG,SAAqB,EACvD,OAAO,GAAE,WAAgB,GACxB,CAAC,KAAK,GAAG,OAAO,CAAC,EAAE,GAAG,SAAS;CAgSnC;AAED;;;;;;;;GAQG;AACH,qBAAa,gBAAiB,SAAQ,QAAQ,CAAC,UAAU,GAAG,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;IAClF,KAAK,iCAAwC;IAE7C,aAAa,CAAC,KAAK,EAAE,KAAK,GAAG,gBAAgB;IAQpC,iBAAiB;IAejB,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,WAAW,GAAG,UAAU,GAAG,IAAI,GAAG,SAAS;IAkCtG;;OAEG;IACM,GAAG,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,GAAG,IAAI;IAClC,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,IAAI;IAkC9E;;;OAGG;IACH,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI;IAMpF;;;;;OAKG;IACH,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI,GAAG,SAAS;IAiBhD;;;OAGG;IACH,iBAAiB,IAAI,MAAM,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,CAAC;IAStD;;;;;;OAMG;IACH,OAAO,IAAI,gBAAgB;CA2C5B;AAED;;;;;GAKG;AACH,qBAAa,mBAAoB,SAAQ,QAAQ,CAAC,WAAW,CAAC;IAC5D,KAAK,gFAAuC;IAEnC,iBAAiB;IAa1B;;;;;;;;;OASG;IACM,IAAI,CACX,GAAG,EAAE,MAAM,EACX,UAAU,GAAE,gBAAgB,GAAG,aAAgC,EAC/D,OAAO,CAAC,EAAE,WAAW,GACpB,WAAW,GAAG,SAAS;CA0J3B"}