@vltpkg/query 0.0.0-0.1730239248325

package/LICENSE

@@ -0,0 +1,15 @@
+Copyright (c) vlt technology, Inc.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+   Subject to the terms and conditions of this license, each copyright holder and contributor hereby grants to those receiving rights under this license a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except for failure to satisfy the conditions of this license) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer this software, where such license applies only to those patent claims, already acquired or hereafter acquired, licensable by such copyright holder or contributor that are necessarily infringed by:
+
+(a) their Contribution(s) (the licensed copyrights of copyright holders and non-copyrightable additions of contributors, in source or binary form) alone; or
+(b) combination of their Contribution(s) with the work of authorship to which such Contribution(s) was added by such copyright holder or contributor, if, at the time the Contribution is added, such addition causes such combination to be necessarily infringed. The patent license shall not apply to any other combinations which include the Contribution.
+Except as expressly stated above, no rights or licenses from any copyright holder or contributor is granted under this license, whether expressly, by implication, estoppel or otherwise.
+
+DISCLAIMER
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

package/README.md

@@ -0,0 +1,90 @@
+# @vltkpkg/query
+
+The **vlt** query syntax engine.
+
+## Usage
+
+```js
+import { Query } from '@vltpkg/query'
+
+const query = new Query({ nodes })
+query.search(':root > *')
+```
+
+## Examples
+
+Querying nodes from a local `node_modules` folder.
+
+```js
+import { actual } from '@vltpkg/graph'
+import { Query } from '@vltpkg/query'
+
+const graph = await actual.load({ projectRoot: process.cwd() })
+const query = new Query([...graph.nodes.values()])
+query.search(':root > *')
+```
+
+## Supported Syntax Reference
+
+The vlt query syntax enable usage of css-selector-like strings to filter
+packages.
+
+Many of the common elements of the CSS language are available, notably:
+
+- `*` Universal selector, matches all selected items.
+- `&` Nesting selector, allows for nesting selectors.
+- `{}` Curly braces, when querying can be used to nest selectors.
+
+Split by group of selectors below is the complete reference to supported
+elements.
+
+### Attribute selectors
+
+Attribute selectors are used to match a value found in the `package.json`
+metadata for each of the nodes being queried to a arbitrary value you choose.
+
+- `[attr]` Matches elements with an `attr` property in its `package.json`.
+- `[attr=value]` Matches elements with a property `attr` whose value is exactly `value`.
+- `[attr^=value]` Matches elements with a property `attr` whose value starts with `value`.
+- `[attr$=value]` Matches elements with a property `attr` whose value ends with `value`.
+- `[attr~=value]` Matches elements with a property `attr` whose value is a whitespace-separated list of words, one of which is exactly `value`.
+- `[attr|=value]` Matches elements with a property `attr` whose value is either `value` or starts with `value-`.
+- `[attr*=value]` Matches elements with a property `attr`.
+- `[attr=value i]` Case-insensitive flag, setting it will cause any comparison to be case-insensitive.
+- `[attr=value s]` Case-sensitive flag, setting it will cause comparisons to be case-sensitive, this is the default behavior.
+
+### Class selectors
+
+- `.prod` Matches prod dependencies to your current project.
+- `.dev` Matches packages that are only used as dev dependencies in your current project.
+- `.optional` Matches packages that are optional to your current project.
+- `.peer` Matches peer dependencies to your current project.
+- `.workspace` Matches the current project worksacpes (listed in your `vlt-workspaces.json` file).
+
+### Combinators
+
+- `>` Child combinator, matches packages that are direct dependencies of the previously selected nodes.
+- ` ` Descendant combinator, matches all packages that are direct & transitive dependencies of the previously selected nodes.
+- `~` Sibling combinator, matches packages that are direct dependencies of all dependents of the previously selected nodes.
+
+### ID Selectors
+
+Identifiers are a shortcut to retrieving packages by name, unfortunately this shortcut only works for unscoped packages, with that in mind it's advised to rely on using **Attribute selectors** (showed above) instead.
+
+e.g: `#foo` is the same as `[name=foo]`
+
+### Pseudo class selectors
+
+- `:attr(key, [attr=value])` The attribute pseudo-class allows for selecting packages based on nested properties of its `package.json` metadata. As an example, here is a query that filters only packages that declares an optional peer dependency named `foo`: `:attr(peerDependenciesMeta, foo, [optional=true])`
+- `:empty` Matches packages that have no dependencies installed.
+- `:has(<selector-list>)` Matches only packages that have valid results for the selector expression used. As an example, here is a query that matches all packages that have a peer dependency on `react`: `:has(.peer[name=react])`
+- `:is(<forgiving-selector-list>)` Useful for writing large selectors in a more compact form, the `:is()` pseudo-class takes a selector list as its arguments and selects any element that can be selected by one of the selectors in that list. As an example, let's say I want to select packages named `a` & `b` that are direct dependencies of my project root: `:root > [name=a], :root > [name=b]` using the `:is()` pseudo-class, that same expression can be shortened to: `:root > :is([name=a], [name=b])`. Similar to the css pseudo-class of the same name, this selector has a forgiving behavior regarding its nested selector list ignoring any usage of non-existing ids, classes, combinators, operators and pseudo-selectors.
+- `:not(<selector-list>)` Negation pseudo-class, select packages that do not match a list of selectors.
+- `:private` Matches packages that have the property `private` set on their `package.json` file.
+- `:type(registry|file|git|remote|workspace)` Matches packages based on their type, e.g, to retrieve all git dependencies: `:type(git)`.
+
+### Pseudo Elements
+
+- `:project` Returns both the root node (as defined below) along with any workspace declared in your project.
+- `:root` Returns the root node, that represents the package defined at the top-level `package.json` of your project folder.
+- `:scope` Returns the current scope of a given selector

package/dist/esm/attribute.d.ts

@@ -0,0 +1,15 @@
+import type { NodeLike } from '@vltpkg/graph';
+import { ParserState } from './types.js';
+export type ComparatorFn = (attr: string, value?: string) => boolean;
+/**
+ * Retrieve the {@link Manifest} values found at the given `properties`
+ * location for a given {@link Node}.
+ */
+export declare const getManifestPropertyValues: (node: NodeLike, properties: string[], attribute: string) => string[] | undefined;
+export declare const filterAttributes: (state: ParserState, comparator: ComparatorFn | undefined, value: string, propertyName: string, insensitive: boolean, prefixProperties?: string[]) => ParserState;
+export declare const attributeSelectorsMap: Map<string, ComparatorFn>;
+/**
+ * Parse attributes selectors, e.g: `[name]`, `[name=value]`, etc
+ */
+export declare const attribute: (state: ParserState) => Promise<ParserState>;
+//# sourceMappingURL=attribute.d.ts.map

package/dist/esm/attribute.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"attribute.d.ts","sourceRoot":"","sources":["../../src/attribute.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAE7C,OAAO,EAAmB,WAAW,EAAE,MAAM,YAAY,CAAA;AAEzD,MAAM,MAAM,YAAY,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,OAAO,CAAA;AAEpE;;;GAGG;AACH,eAAO,MAAM,yBAAyB,SAC9B,QAAQ,cACF,MAAM,EAAE,aACT,MAAM,KAChB,MAAM,EAAE,GAAG,SA+Db,CAAA;AAID,eAAO,MAAM,gBAAgB,UACpB,WAAW,cACN,YAAY,GAAG,SAAS,SAC7B,MAAM,gBACC,MAAM,eACP,OAAO,qBACF,MAAM,EAAE,KACzB,WA8CF,CAAA;AAcD,eAAO,MAAM,qBAAqB,2BAEjC,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,SAAS,UACb,WAAW,KACjB,OAAO,CAAC,WAAW,CAuBrB,CAAA"}

package/dist/esm/attribute.js

@@ -0,0 +1,131 @@
+import { error } from '@vltpkg/error-cause';
+import { asAttributeNode } from './types.js';
+/**
+ * Retrieve the {@link Manifest} values found at the given `properties`
+ * location for a given {@link Node}.
+ */
+export const getManifestPropertyValues = (node, properties, attribute) => {
+    if (!node.manifest)
+        return;
+    const traverse = new Set([node.manifest]);
+    const props = new Set();
+    for (const key of properties) {
+        for (const prop of traverse) {
+            /* c8 ignore start - should be impossible */
+            if (!prop) {
+                throw error('failed to find nested property in :attr', {
+                    found: properties,
+                });
+            }
+            /* c8 ignore stop */
+            // expand the result list to include nested array values
+            if (Array.isArray(prop)) {
+                for (const p of prop) {
+                    traverse.add(p);
+                }
+                continue;
+            }
+            // guard for inspecting keys of objects next
+            if (typeof prop === 'string' ||
+                typeof prop === 'number' ||
+                typeof prop === 'boolean') {
+                continue;
+            }
+            // assign next value when found
+            if (key in prop) {
+                const nextValue = prop[key];
+                if (nextValue) {
+                    if (key === attribute) {
+                        props.add(nextValue);
+                    }
+                    else {
+                        traverse.delete(prop);
+                        traverse.add(nextValue);
+                    }
+                }
+            }
+        }
+    }
+    // if no value was found after trying a given key
+    // then there's nothing to be collected
+    if (!props.size)
+        return;
+    // expand the result to include array values
+    const collect = new Set();
+    for (const prop of props) {
+        if (Array.isArray(prop)) {
+            for (const p of prop) {
+                collect.add(p ? String(p) : '');
+            }
+        }
+        else {
+            collect.add(String(prop));
+        }
+    }
+    return [...collect];
+};
+// decorator style of function that will filter `ParserState` results
+// based on a provided `comparator` function
+export const filterAttributes = (state, comparator, value, propertyName, insensitive, prefixProperties = []) => {
+    const check = (attr) => comparator?.(insensitive ? String(attr).toLowerCase() : String(attr), insensitive ? value.toLowerCase() : value);
+    const deleteNode = (node) => {
+        for (const edge of node.edgesIn) {
+            state.partial.edges.delete(edge);
+        }
+        state.partial.nodes.delete(node);
+    };
+    for (const node of state.partial.nodes) {
+        const prefixes = prefixProperties.length ? prefixProperties : [propertyName];
+        const attrs = getManifestPropertyValues(node, prefixes, propertyName);
+        // if no attribute value was found, that means the attribute won't match
+        if (!attrs?.length) {
+            deleteNode(node);
+            continue;
+        }
+        // if the node attribute value won't match, then remove the node
+        if (comparator && !attrs.some(check)) {
+            deleteNode(node);
+        }
+    }
+    for (const edge of state.partial.edges) {
+        // edge.name is a special case in order
+        // to be able to match missing nodes by name
+        if (propertyName === 'name' && check(edge.name)) {
+            continue;
+        }
+        // remove any remaining dangling edge
+        if (!edge.to) {
+            state.partial.edges.delete(edge);
+        }
+    }
+    return state;
+};
+// ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Attribute_selectors
+const attributeSelectors = {
+    '=': (attr, value = '') => attr === value,
+    '^=': (attr, value = '') => attr.startsWith(value),
+    '$=': (attr, value = '') => attr.endsWith(value),
+    '~=': (attr, value = '') => new Set(attr.match(/\w+/g)).has(value),
+    '*=': (attr, value = '') => attr.includes(value),
+    '|=': (attr, value = '') => attr === value || attr.startsWith(`${value}-`),
+    undefined: (attr) => !!attr,
+};
+export const attributeSelectorsMap = new Map(Object.entries(attributeSelectors));
+/**
+ * Parse attributes selectors, e.g: `[name]`, `[name=value]`, etc
+ */
+export const attribute = async (state) => {
+    const curr = asAttributeNode(state.current);
+    const operatorFn = attributeSelectorsMap.get(String(curr.operator));
+    if (!operatorFn) {
+        if (state.loose) {
+            return state;
+        }
+        throw new Error(`Unsupported attribute operator: ${curr.operator}`);
+    }
+    const value = curr.value || '';
+    const propertyName = curr.attribute;
+    const insensitive = !!curr.insensitive;
+    return filterAttributes(state, operatorFn, value, propertyName, insensitive);
+};
+//# sourceMappingURL=attribute.js.map

package/dist/esm/attribute.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"attribute.js","sourceRoot":"","sources":["../../src/attribute.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAG3C,OAAO,EAAE,eAAe,EAAe,MAAM,YAAY,CAAA;AAIzD;;;GAGG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,CACvC,IAAc,EACd,UAAoB,EACpB,SAAiB,EACK,EAAE;IACxB,IAAI,CAAC,IAAI,CAAC,QAAQ;QAAE,OAAM;IAE1B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAY,CAAC,IAAI,CAAC,QAAqB,CAAC,CAAC,CAAA;IACjE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAa,CAAA;IAClC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,4CAA4C;YAC5C,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,MAAM,KAAK,CAAC,yCAAyC,EAAE;oBACrD,KAAK,EAAE,UAAU;iBAClB,CAAC,CAAA;YACJ,CAAC;YACD,oBAAoB;YAEpB,wDAAwD;YACxD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;oBACrB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACjB,CAAC;gBACD,SAAQ;YACV,CAAC;YAED,4CAA4C;YAC5C,IACE,OAAO,IAAI,KAAK,QAAQ;gBACxB,OAAO,IAAI,KAAK,QAAQ;gBACxB,OAAO,IAAI,KAAK,SAAS,EACzB,CAAC;gBACD,SAAQ;YACV,CAAC;YAED,+BAA+B;YAC/B,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;gBAChB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;gBAC3B,IAAI,SAAS,EAAE,CAAC;oBACd,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;wBACtB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;oBACtB,CAAC;yBAAM,CAAC;wBACN,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;wBACrB,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;oBACzB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,iDAAiD;IACjD,uCAAuC;IACvC,IAAI,CAAC,KAAK,CAAC,IAAI;QAAE,OAAM;IAEvB,4CAA4C;IAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;YACjC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;QAC3B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,OAAO,CAAC,CAAA;AACrB,CAAC,CAAA;AAED,qEAAqE;AACrE,4CAA4C;AAC5C,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,KAAkB,EAClB,UAAoC,EACpC,KAAa,EACb,YAAoB,EACpB,WAAoB,EACpB,mBAA6B,EAAE,EAClB,EAAE;IACf,MAAM,KAAK,GAAG,CAAC,IAAe,EAAE,EAAE,CAChC,UAAU,EAAE,CACV,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EACvD,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,KAAK,CAC1C,CAAA;IACH,MAAM,UAAU,GAAG,CAAC,IAAc,EAAE,EAAE;QACpC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAClC,CAAC;QACD,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAClC,CAAC,CAAA;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACvC,MAAM,QAAQ,GACZ,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAA;QAC7D,MAAM,KAAK,GAAG,yBAAyB,CACrC,IAAI,EACJ,QAAQ,EACR,YAAY,CACb,CAAA;QAED,wEAAwE;QACxE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC;YACnB,UAAU,CAAC,IAAI,CAAC,CAAA;YAChB,SAAQ;QACV,CAAC;QAED,gEAAgE;QAChE,IAAI,UAAU,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACrC,UAAU,CAAC,IAAI,CAAC,CAAA;QAClB,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACvC,uCAAuC;QACvC,4CAA4C;QAC5C,IAAI,YAAY,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAChD,SAAQ;QACV,CAAC;QACD,qCAAqC;QACrC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAClC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED,4EAA4E;AAC5E,MAAM,kBAAkB,GAAiC;IACvD,GAAG,EAAE,CAAC,IAAY,EAAE,KAAK,GAAG,EAAE,EAAE,EAAE,CAAC,IAAI,KAAK,KAAK;IACjD,IAAI,EAAE,CAAC,IAAY,EAAE,KAAK,GAAG,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;IAC1D,IAAI,EAAE,CAAC,IAAY,EAAE,KAAK,GAAG,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;IACxD,IAAI,EAAE,CAAC,IAAY,EAAE,KAAK,GAAG,EAAE,EAAE,EAAE,CACjC,IAAI,GAAG,CAAS,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;IAChD,IAAI,EAAE,CAAC,IAAY,EAAE,KAAK,GAAG,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;IACxD,IAAI,EAAE,CAAC,IAAY,EAAE,KAAK,GAAG,EAAE,EAAE,EAAE,CACjC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,KAAK,GAAG,CAAC;IAChD,SAAS,EAAE,CAAC,IAAY,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI;CACpC,CAAA;AACD,MAAM,CAAC,MAAM,qBAAqB,GAAG,IAAI,GAAG,CAC1C,MAAM,CAAC,OAAO,CAAC,kBAAkB,CAAC,CACnC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,KAAK,EAC5B,KAAkB,EACI,EAAE;IACxB,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IAC3C,MAAM,UAAU,GAAG,qBAAqB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAA;IACnE,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO,KAAK,CAAA;QACd,CAAC;QAED,MAAM,IAAI,KAAK,CACb,mCAAmC,IAAI,CAAC,QAAQ,EAAE,CACnD,CAAA;IACH,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAA;IAC9B,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAA;IACnC,MAAM,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,CAAA;IACtC,OAAO,gBAAgB,CACrB,KAAK,EACL,UAAU,EACV,KAAK,EACL,YAAY,EACZ,WAAW,CACZ,CAAA;AACH,CAAC,CAAA","sourcesContent":["import { error } from '@vltpkg/error-cause'\nimport type { NodeLike } from '@vltpkg/graph'\nimport type { JSONField } from '@vltpkg/types'\nimport { asAttributeNode, ParserState } from './types.js'\n\nexport type ComparatorFn = (attr: string, value?: string) => boolean\n\n/**\n * Retrieve the {@link Manifest} values found at the given `properties`\n * location for a given {@link Node}.\n */\nexport const getManifestPropertyValues = (\n  node: NodeLike,\n  properties: string[],\n  attribute: string,\n): string[] | undefined => {\n  if (!node.manifest) return\n\n  const traverse = new Set<JSONField>([node.manifest as JSONField])\n  const props = new Set<JSONField>()\n  for (const key of properties) {\n    for (const prop of traverse) {\n      /* c8 ignore start - should be impossible */\n      if (!prop) {\n        throw error('failed to find nested property in :attr', {\n          found: properties,\n        })\n      }\n      /* c8 ignore stop */\n\n      // expand the result list to include nested array values\n      if (Array.isArray(prop)) {\n        for (const p of prop) {\n          traverse.add(p)\n        }\n        continue\n      }\n\n      // guard for inspecting keys of objects next\n      if (\n        typeof prop === 'string' ||\n        typeof prop === 'number' ||\n        typeof prop === 'boolean'\n      ) {\n        continue\n      }\n\n      // assign next value when found\n      if (key in prop) {\n        const nextValue = prop[key]\n        if (nextValue) {\n          if (key === attribute) {\n            props.add(nextValue)\n          } else {\n            traverse.delete(prop)\n            traverse.add(nextValue)\n          }\n        }\n      }\n    }\n  }\n  // if no value was found after trying a given key\n  // then there's nothing to be collected\n  if (!props.size) return\n\n  // expand the result to include array values\n  const collect = new Set<string>()\n  for (const prop of props) {\n    if (Array.isArray(prop)) {\n      for (const p of prop) {\n        collect.add(p ? String(p) : '')\n      }\n    } else {\n      collect.add(String(prop))\n    }\n  }\n\n  return [...collect]\n}\n\n// decorator style of function that will filter `ParserState` results\n// based on a provided `comparator` function\nexport const filterAttributes = (\n  state: ParserState,\n  comparator: ComparatorFn | undefined,\n  value: string,\n  propertyName: string,\n  insensitive: boolean,\n  prefixProperties: string[] = [],\n): ParserState => {\n  const check = (attr: JSONField) =>\n    comparator?.(\n      insensitive ? String(attr).toLowerCase() : String(attr),\n      insensitive ? value.toLowerCase() : value,\n    )\n  const deleteNode = (node: NodeLike) => {\n    for (const edge of node.edgesIn) {\n      state.partial.edges.delete(edge)\n    }\n    state.partial.nodes.delete(node)\n  }\n\n  for (const node of state.partial.nodes) {\n    const prefixes =\n      prefixProperties.length ? prefixProperties : [propertyName]\n    const attrs = getManifestPropertyValues(\n      node,\n      prefixes,\n      propertyName,\n    )\n\n    // if no attribute value was found, that means the attribute won't match\n    if (!attrs?.length) {\n      deleteNode(node)\n      continue\n    }\n\n    // if the node attribute value won't match, then remove the node\n    if (comparator && !attrs.some(check)) {\n      deleteNode(node)\n    }\n  }\n\n  for (const edge of state.partial.edges) {\n    // edge.name is a special case in order\n    // to be able to match missing nodes by name\n    if (propertyName === 'name' && check(edge.name)) {\n      continue\n    }\n    // remove any remaining dangling edge\n    if (!edge.to) {\n      state.partial.edges.delete(edge)\n    }\n  }\n  return state\n}\n\n// ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Attribute_selectors\nconst attributeSelectors: Record<string, ComparatorFn> = {\n  '=': (attr: string, value = '') => attr === value,\n  '^=': (attr: string, value = '') => attr.startsWith(value),\n  '$=': (attr: string, value = '') => attr.endsWith(value),\n  '~=': (attr: string, value = '') =>\n    new Set<string>(attr.match(/\\w+/g)).has(value),\n  '*=': (attr: string, value = '') => attr.includes(value),\n  '|=': (attr: string, value = '') =>\n    attr === value || attr.startsWith(`${value}-`),\n  undefined: (attr: string) => !!attr,\n}\nexport const attributeSelectorsMap = new Map<string, ComparatorFn>(\n  Object.entries(attributeSelectors),\n)\n\n/**\n * Parse attributes selectors, e.g: `[name]`, `[name=value]`, etc\n */\nexport const attribute = async (\n  state: ParserState,\n): Promise<ParserState> => {\n  const curr = asAttributeNode(state.current)\n  const operatorFn = attributeSelectorsMap.get(String(curr.operator))\n  if (!operatorFn) {\n    if (state.loose) {\n      return state\n    }\n\n    throw new Error(\n      `Unsupported attribute operator: ${curr.operator}`,\n    )\n  }\n\n  const value = curr.value || ''\n  const propertyName = curr.attribute\n  const insensitive = !!curr.insensitive\n  return filterAttributes(\n    state,\n    operatorFn,\n    value,\n    propertyName,\n    insensitive,\n  )\n}\n"]}

package/dist/esm/class.d.ts

@@ -0,0 +1,6 @@
+import { type ParserState } from './types.js';
+/**
+ * Parse classes, e.g: `.prod`, `.dev`, `.optional`, etc
+ */
+export declare const classFn: (state: ParserState) => Promise<ParserState>;
+//# sourceMappingURL=class.d.ts.map

package/dist/esm/class.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"class.d.ts","sourceRoot":"","sources":["../../src/class.ts"],"names":[],"mappings":"AAAA,OAAO,EAAyB,KAAK,WAAW,EAAE,MAAM,YAAY,CAAA;AAoHpE;;GAEG;AACH,eAAO,MAAM,OAAO,UAAiB,WAAW,yBAW/C,CAAA"}

package/dist/esm/class.js

@@ -0,0 +1,127 @@
+import { asClassNode } from './types.js';
+const classSelectors = {
+    prod: async (state) => {
+        for (const edge of state.partial.edges) {
+            if (edge.type !== 'prod' || edge.from.dev) {
+                state.partial.edges.delete(edge);
+            }
+        }
+        for (const node of state.partial.nodes) {
+            if (!node.edgesIn.size) {
+                state.partial.nodes.delete(node);
+                continue;
+            }
+            const iterator = new Set(node.edgesIn);
+            for (const edge of iterator) {
+                if (!state.partial.edges.has(edge)) {
+                    iterator.delete(edge);
+                }
+            }
+            if (!iterator.size) {
+                state.partial.nodes.delete(node);
+            }
+        }
+        return state;
+    },
+    dev: async (state) => {
+        for (const edge of state.partial.edges) {
+            if (edge.type !== 'dev' && !edge.from.dev) {
+                state.partial.edges.delete(edge);
+            }
+        }
+        for (const node of state.partial.nodes) {
+            if (!node.edgesIn.size) {
+                state.partial.nodes.delete(node);
+                continue;
+            }
+            const iterator = new Set(node.edgesIn);
+            for (const edge of iterator) {
+                if (!state.partial.edges.has(edge)) {
+                    iterator.delete(edge);
+                }
+            }
+            if (!iterator.size) {
+                state.partial.nodes.delete(node);
+            }
+        }
+        return state;
+    },
+    optional: async (state) => {
+        for (const edge of state.partial.edges) {
+            if (edge.type !== 'optional' && !edge.from.optional) {
+                state.partial.edges.delete(edge);
+            }
+        }
+        for (const node of state.partial.nodes) {
+            if (!node.edgesIn.size) {
+                state.partial.nodes.delete(node);
+                continue;
+            }
+            const iterator = new Set(node.edgesIn);
+            for (const edge of iterator) {
+                if (!state.partial.edges.has(edge)) {
+                    iterator.delete(edge);
+                }
+            }
+            if (!iterator.size) {
+                state.partial.nodes.delete(node);
+            }
+        }
+        return state;
+    },
+    peer: async (state) => {
+        for (const edge of state.partial.edges) {
+            if (edge.type !== 'peer') {
+                state.partial.edges.delete(edge);
+            }
+        }
+        for (const node of state.partial.nodes) {
+            if (!node.edgesIn.size) {
+                state.partial.nodes.delete(node);
+                continue;
+            }
+            for (const e of node.edgesIn) {
+                if (!state.partial.edges.has(e)) {
+                    state.partial.nodes.delete(node);
+                }
+            }
+        }
+        return state;
+    },
+    workspace: async (state) => {
+        for (const node of state.partial.nodes) {
+            if (!node.importer || node.mainImporter) {
+                state.partial.nodes.delete(node);
+            }
+        }
+        for (const edge of state.partial.edges) {
+            // workspaces can't be missing
+            if (!edge.to) {
+                state.partial.edges.delete(edge);
+                // keep only edges that are linking to preivously kept nodes
+            }
+            else if (!state.partial.nodes.has(edge.to)) {
+                state.partial.edges.delete(edge);
+            }
+        }
+        return state;
+    },
+    // TBD: all things bundled
+    // bundled: () => false,
+};
+const classSelectorsMap = new Map(Object.entries(classSelectors));
+/**
+ * Parse classes, e.g: `.prod`, `.dev`, `.optional`, etc
+ */
+export const classFn = async (state) => {
+    const curr = asClassNode(state.current);
+    const comparatorFn = curr.value && classSelectorsMap.get(curr.value);
+    if (!comparatorFn) {
+        if (state.loose) {
+            return state;
+        }
+        throw new Error(`Unsupported class: ${state.current.value}`);
+    }
+    return comparatorFn(state);
+};
+//# sourceMappingURL=class.js.map

package/dist/esm/class.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"class.js","sourceRoot":"","sources":["../../src/class.ts"],"names":[],"mappings":"AAAA,OAAO,EAAY,WAAW,EAAoB,MAAM,YAAY,CAAA;AAEpE,MAAM,cAAc,GAA6B;IAC/C,IAAI,EAAE,KAAK,EAAE,KAAkB,EAAE,EAAE;QACjC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC1C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAClC,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBACvB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBAChC,SAAQ;YACV,CAAC;YACD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YACtC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACnC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBACvB,CAAC;YACH,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;gBACnB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAClC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IACD,GAAG,EAAE,KAAK,EAAE,KAAkB,EAAE,EAAE;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC1C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAClC,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBACvB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBAChC,SAAQ;YACV,CAAC;YACD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YACtC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACnC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBACvB,CAAC;YACH,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;gBACnB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAClC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IACD,QAAQ,EAAE,KAAK,EAAE,KAAkB,EAAE,EAAE;QACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACpD,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAClC,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBACvB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBAChC,SAAQ;YACV,CAAC;YACD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YACtC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACnC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBACvB,CAAC;YACH,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;gBACnB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAClC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IACD,IAAI,EAAE,KAAK,EAAE,KAAkB,EAAE,EAAE;QACjC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAClC,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBACvB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBAChC,SAAQ;YACV,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IACD,SAAS,EAAE,KAAK,EAAE,KAAkB,EAAE,EAAE;QACtC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACxC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAClC,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACvC,8BAA8B;YAC9B,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;gBACb,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBAChC,4DAA4D;YAC9D,CAAC;iBAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC7C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAClC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IACD,0BAA0B;IAC1B,wBAAwB;CACzB,CAAA;AAED,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAC/B,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAC/B,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,KAAK,EAAE,KAAkB,EAAE,EAAE;IAClD,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IACvC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,IAAI,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACpE,IAAI,CAAC,YAAY,EAAE,CAAC;QAClB,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO,KAAK,CAAA;QACd,CAAC;QAED,MAAM,IAAI,KAAK,CAAC,sBAAsB,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;IAC9D,CAAC;IACD,OAAO,YAAY,CAAC,KAAK,CAAC,CAAA;AAC5B,CAAC,CAAA","sourcesContent":["import { ParserFn, asClassNode, type ParserState } from './types.js'\n\nconst classSelectors: Record<string, ParserFn> = {\n  prod: async (state: ParserState) => {\n    for (const edge of state.partial.edges) {\n      if (edge.type !== 'prod' || edge.from.dev) {\n        state.partial.edges.delete(edge)\n      }\n    }\n    for (const node of state.partial.nodes) {\n      if (!node.edgesIn.size) {\n        state.partial.nodes.delete(node)\n        continue\n      }\n      const iterator = new Set(node.edgesIn)\n      for (const edge of iterator) {\n        if (!state.partial.edges.has(edge)) {\n          iterator.delete(edge)\n        }\n      }\n      if (!iterator.size) {\n        state.partial.nodes.delete(node)\n      }\n    }\n    return state\n  },\n  dev: async (state: ParserState) => {\n    for (const edge of state.partial.edges) {\n      if (edge.type !== 'dev' && !edge.from.dev) {\n        state.partial.edges.delete(edge)\n      }\n    }\n    for (const node of state.partial.nodes) {\n      if (!node.edgesIn.size) {\n        state.partial.nodes.delete(node)\n        continue\n      }\n      const iterator = new Set(node.edgesIn)\n      for (const edge of iterator) {\n        if (!state.partial.edges.has(edge)) {\n          iterator.delete(edge)\n        }\n      }\n      if (!iterator.size) {\n        state.partial.nodes.delete(node)\n      }\n    }\n    return state\n  },\n  optional: async (state: ParserState) => {\n    for (const edge of state.partial.edges) {\n      if (edge.type !== 'optional' && !edge.from.optional) {\n        state.partial.edges.delete(edge)\n      }\n    }\n    for (const node of state.partial.nodes) {\n      if (!node.edgesIn.size) {\n        state.partial.nodes.delete(node)\n        continue\n      }\n      const iterator = new Set(node.edgesIn)\n      for (const edge of iterator) {\n        if (!state.partial.edges.has(edge)) {\n          iterator.delete(edge)\n        }\n      }\n      if (!iterator.size) {\n        state.partial.nodes.delete(node)\n      }\n    }\n    return state\n  },\n  peer: async (state: ParserState) => {\n    for (const edge of state.partial.edges) {\n      if (edge.type !== 'peer') {\n        state.partial.edges.delete(edge)\n      }\n    }\n    for (const node of state.partial.nodes) {\n      if (!node.edgesIn.size) {\n        state.partial.nodes.delete(node)\n        continue\n      }\n      for (const e of node.edgesIn) {\n        if (!state.partial.edges.has(e)) {\n          state.partial.nodes.delete(node)\n        }\n      }\n    }\n    return state\n  },\n  workspace: async (state: ParserState) => {\n    for (const node of state.partial.nodes) {\n      if (!node.importer || node.mainImporter) {\n        state.partial.nodes.delete(node)\n      }\n    }\n    for (const edge of state.partial.edges) {\n      // workspaces can't be missing\n      if (!edge.to) {\n        state.partial.edges.delete(edge)\n        // keep only edges that are linking to preivously kept nodes\n      } else if (!state.partial.nodes.has(edge.to)) {\n        state.partial.edges.delete(edge)\n      }\n    }\n    return state\n  },\n  // TBD: all things bundled\n  // bundled: () => false,\n}\n\nconst classSelectorsMap = new Map<string, ParserFn>(\n  Object.entries(classSelectors),\n)\n\n/**\n * Parse classes, e.g: `.prod`, `.dev`, `.optional`, etc\n */\nexport const classFn = async (state: ParserState) => {\n  const curr = asClassNode(state.current)\n  const comparatorFn = curr.value && classSelectorsMap.get(curr.value)\n  if (!comparatorFn) {\n    if (state.loose) {\n      return state\n    }\n\n    throw new Error(`Unsupported class: ${state.current.value}`)\n  }\n  return comparatorFn(state)\n}\n"]}

package/dist/esm/combinator.d.ts

@@ -0,0 +1,6 @@
+import { type ParserState } from './types.js';
+/**
+ * Parse css-style combinators, e.g: `>`, `~` and ` `
+ */
+export declare const combinator: (state: ParserState) => Promise<ParserState>;
+//# sourceMappingURL=combinator.d.ts.map

package/dist/esm/combinator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"combinator.d.ts","sourceRoot":"","sources":["../../src/combinator.ts"],"names":[],"mappings":"AACA,OAAO,EACL,KAAK,WAAW,EAGjB,MAAM,YAAY,CAAA;AA6GnB;;GAEG;AACH,eAAO,MAAM,UAAU,UAAiB,WAAW,yBAYlD,CAAA"}

package/dist/esm/combinator.js

@@ -0,0 +1,108 @@
+import { asCombinatorNode, } from './types.js';
+/**
+ * Returns a new set of nodes, containing all direct dependencies
+ * of the current list of nodes used.
+ *
+ * ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Child_combinator
+ */
+const childCombinator = async (state) => {
+    const traverse = new Set(state.partial.nodes);
+    state.partial.edges.clear();
+    state.partial.nodes.clear();
+    // visit direct children of the current list of nodes
+    // collecting refs to these children and the edges that
+    // connected them.
+    for (const node of traverse) {
+        for (const edge of node.edgesOut.values()) {
+            if (edge.to) {
+                state.partial.edges.add(edge);
+                state.partial.nodes.add(edge.to);
+            }
+        }
+    }
+    return state;
+};
+/**
+ * Returns a new set of nodes, containing nodes that are also children
+ * of all parent nodes to the current list of nodes used.
+ *
+ * Note: The subsequent-sibling comparator has a behavior that is
+ * somehow approximative of that of its css counterpart, given that
+ * in the context of dependency graphs the order of appearance is
+ * not necessarily controlled by the end user. The approach for
+ * this comparator is to match all siblings of a node.
+ *
+ * ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Subsequent-sibling_combinator
+ */
+const subsequentSiblingCombinator = async (state) => {
+    const traverse = new Set(state.partial.nodes);
+    state.partial.edges.clear();
+    state.partial.nodes.clear();
+    // visits direct parents of the current list of node and then
+    // visit their children, collecting refs to all children and edges
+    // that are not in the original list of nodes.
+    for (const node of traverse) {
+        for (const edge of node.edgesIn) {
+            const parents = edge.from.edgesOut.values();
+            for (const edge of parents) {
+                if (edge.to && edge.to !== node) {
+                    state.partial.edges.add(edge);
+                    state.partial.nodes.add(edge.to);
+                }
+            }
+        }
+    }
+    return state;
+};
+/**
+ * Returns a new set of nodes containing all nodes that are descendents
+ * to items in the current list of nodes.
+ *
+ * ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Descendant_combinator
+ */
+const descendentCombinator = async (state) => {
+    // spaces between tags selectors are a noop
+    if (state.prev?.type === 'tag' || state.next?.type === 'tag') {
+        return state;
+    }
+    const traverse = new Set(state.partial.nodes);
+    state.partial.edges.clear();
+    state.partial.nodes.clear();
+    // breadth-first traversal of the graph, starting from the current
+    // list of nodes, collecting all nodes and edges along the way
+    for (const node of traverse) {
+        const children = new Set();
+        for (const edge of node.edgesOut.values()) {
+            if (edge.to) {
+                children.add(edge.to);
+                state.partial.edges.add(edge);
+                state.partial.nodes.add(edge.to);
+            }
+        }
+        for (const child of children) {
+            traverse.add(child);
+        }
+    }
+    return state;
+};
+const combinatorSelectors = {
+    '>': childCombinator,
+    '~': subsequentSiblingCombinator,
+    ' ': descendentCombinator,
+};
+const combinatorSelectorsMap = new Map(Object.entries(combinatorSelectors));
+/**
+ * Parse css-style combinators, e.g: `>`, `~` and ` `
+ */
+export const combinator = async (state) => {
+    const curr = asCombinatorNode(state.current);
+    const parserFn = curr.value && combinatorSelectorsMap.get(curr.value);
+    if (!parserFn) {
+        if (state.loose) {
+            return state;
+        }
+        throw new Error(`Unsupported combinator: ${state.current.value}`);
+    }
+    return parserFn(state);
+};
+//# sourceMappingURL=combinator.js.map

package/dist/esm/combinator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"combinator.js","sourceRoot":"","sources":["../../src/combinator.ts"],"names":[],"mappings":"AACA,OAAO,EAGL,gBAAgB,GACjB,MAAM,YAAY,CAAA;AAEnB;;;;;GAKG;AACH,MAAM,eAAe,GAAG,KAAK,EAAE,KAAkB,EAAE,EAAE;IACnD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IAC7C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;IAC3B,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;IAE3B,qDAAqD;IACrD,uDAAuD;IACvD,kBAAkB;IAClB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;gBACZ,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAC7B,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED;;;;;;;;;;;GAWG;AACH,MAAM,2BAA2B,GAAG,KAAK,EAAE,KAAkB,EAAE,EAAE;IAC/D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IAC7C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;IAC3B,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;IAE3B,6DAA6D;IAC7D,kEAAkE;IAClE,8CAA8C;IAC9C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,MAAM,OAAO,GACX,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAA;YAC7B,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;gBAC3B,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;oBAChC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;oBAC7B,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,oBAAoB,GAAG,KAAK,EAAE,KAAkB,EAAE,EAAE;IACxD,2CAA2C;IAC3C,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,KAAK,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,KAAK,KAAK,EAAE,CAAC;QAC7D,OAAO,KAAK,CAAA;IACd,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAW,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IACvD,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;IAC3B,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;IAE3B,kEAAkE;IAClE,8DAA8D;IAC9D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAY,CAAA;QACpC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;gBACZ,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACrB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAC7B,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAClC,CAAC;QACH,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACrB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED,MAAM,mBAAmB,GAAG;IAC1B,GAAG,EAAE,eAAe;IACpB,GAAG,EAAE,2BAA2B;IAChC,GAAG,EAAE,oBAAoB;CAC1B,CAAA;AAED,MAAM,sBAAsB,GAAG,IAAI,GAAG,CACpC,MAAM,CAAC,OAAO,CAAC,mBAAmB,CAAC,CACpC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,KAAK,EAAE,KAAkB,EAAE,EAAE;IACrD,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IAC5C,MAAM,QAAQ,GACZ,IAAI,CAAC,KAAK,IAAI,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACtD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO,KAAK,CAAA;QACd,CAAC;QAED,MAAM,IAAI,KAAK,CAAC,2BAA2B,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;IACnE,CAAC;IACD,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAA;AACxB,CAAC,CAAA","sourcesContent":["import type { EdgeLike, NodeLike } from '@vltpkg/graph'\nimport {\n  type ParserState,\n  type ParserFn,\n  asCombinatorNode,\n} from './types.js'\n\n/**\n * Returns a new set of nodes, containing all direct dependencies\n * of the current list of nodes used.\n *\n * ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Child_combinator\n */\nconst childCombinator = async (state: ParserState) => {\n  const traverse = new Set(state.partial.nodes)\n  state.partial.edges.clear()\n  state.partial.nodes.clear()\n\n  // visit direct children of the current list of nodes\n  // collecting refs to these children and the edges that\n  // connected them.\n  for (const node of traverse) {\n    for (const edge of node.edgesOut.values()) {\n      if (edge.to) {\n        state.partial.edges.add(edge)\n        state.partial.nodes.add(edge.to)\n      }\n    }\n  }\n\n  return state\n}\n\n/**\n * Returns a new set of nodes, containing nodes that are also children\n * of all parent nodes to the current list of nodes used.\n *\n * Note: The subsequent-sibling comparator has a behavior that is\n * somehow approximative of that of its css counterpart, given that\n * in the context of dependency graphs the order of appearance is\n * not necessarily controlled by the end user. The approach for\n * this comparator is to match all siblings of a node.\n *\n * ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Subsequent-sibling_combinator\n */\nconst subsequentSiblingCombinator = async (state: ParserState) => {\n  const traverse = new Set(state.partial.nodes)\n  state.partial.edges.clear()\n  state.partial.nodes.clear()\n\n  // visits direct parents of the current list of node and then\n  // visit their children, collecting refs to all children and edges\n  // that are not in the original list of nodes.\n  for (const node of traverse) {\n    for (const edge of node.edgesIn) {\n      const parents: IterableIterator<EdgeLike> =\n        edge.from.edgesOut.values()\n      for (const edge of parents) {\n        if (edge.to && edge.to !== node) {\n          state.partial.edges.add(edge)\n          state.partial.nodes.add(edge.to)\n        }\n      }\n    }\n  }\n\n  return state\n}\n\n/**\n * Returns a new set of nodes containing all nodes that are descendents\n * to items in the current list of nodes.\n *\n * ref: https://developer.mozilla.org/en-US/docs/Web/CSS/Descendant_combinator\n */\nconst descendentCombinator = async (state: ParserState) => {\n  // spaces between tags selectors are a noop\n  if (state.prev?.type === 'tag' || state.next?.type === 'tag') {\n    return state\n  }\n\n  const traverse = new Set<NodeLike>(state.partial.nodes)\n  state.partial.edges.clear()\n  state.partial.nodes.clear()\n\n  // breadth-first traversal of the graph, starting from the current\n  // list of nodes, collecting all nodes and edges along the way\n  for (const node of traverse) {\n    const children = new Set<NodeLike>()\n    for (const edge of node.edgesOut.values()) {\n      if (edge.to) {\n        children.add(edge.to)\n        state.partial.edges.add(edge)\n        state.partial.nodes.add(edge.to)\n      }\n    }\n    for (const child of children) {\n      traverse.add(child)\n    }\n  }\n\n  return state\n}\n\nconst combinatorSelectors = {\n  '>': childCombinator,\n  '~': subsequentSiblingCombinator,\n  ' ': descendentCombinator,\n}\n\nconst combinatorSelectorsMap = new Map<string, ParserFn>(\n  Object.entries(combinatorSelectors),\n)\n\n/**\n * Parse css-style combinators, e.g: `>`, `~` and ` `\n */\nexport const combinator = async (state: ParserState) => {\n  const curr = asCombinatorNode(state.current)\n  const parserFn =\n    curr.value && combinatorSelectorsMap.get(curr.value)\n  if (!parserFn) {\n    if (state.loose) {\n      return state\n    }\n\n    throw new Error(`Unsupported combinator: ${state.current.value}`)\n  }\n  return parserFn(state)\n}\n"]}

package/dist/esm/id.d.ts

@@ -0,0 +1,6 @@
+import { type ParserState } from './types.js';
+/**
+ * Parse ids, e.g: `#foo`
+ */
+export declare const id: (state: ParserState) => Promise<ParserState>;
+//# sourceMappingURL=id.d.ts.map

package/dist/esm/id.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"id.d.ts","sourceRoot":"","sources":["../../src/id.ts"],"names":[],"mappings":"AACA,OAAO,EAAoB,KAAK,WAAW,EAAE,MAAM,YAAY,CAAA;AAM/D;;GAEG;AACH,eAAO,MAAM,EAAE,UAAiB,WAAW,yBAc1C,CAAA"}

package/dist/esm/id.js

@@ -0,0 +1,20 @@
+import { error } from '@vltpkg/error-cause';
+import { asIdentifierNode } from './types.js';
+import { attributeSelectorsMap, filterAttributes, } from './attribute.js';
+/**
+ * Parse ids, e.g: `#foo`
+ */
+export const id = async (state) => {
+    const { value } = asIdentifierNode(state.current);
+    const comparator = attributeSelectorsMap.get('=');
+    /* c8 ignore start - should not be possible */
+    if (!value) {
+        throw error('Missing identifier name');
+    }
+    if (!comparator) {
+        throw error('Could not find attribute selector comparator');
+    }
+    /* c8 ignore stop */
+    return filterAttributes(state, comparator, value, 'name', true);
+};
+//# sourceMappingURL=id.js.map

package/dist/esm/id.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"id.js","sourceRoot":"","sources":["../../src/id.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,gBAAgB,EAAoB,MAAM,YAAY,CAAA;AAC/D,OAAO,EACL,qBAAqB,EACrB,gBAAgB,GACjB,MAAM,gBAAgB,CAAA;AAEvB;;GAEG;AACH,MAAM,CAAC,MAAM,EAAE,GAAG,KAAK,EAAE,KAAkB,EAAE,EAAE;IAC7C,MAAM,EAAE,KAAK,EAAE,GAAG,gBAAgB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IACjD,MAAM,UAAU,GAAG,qBAAqB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAEjD,8CAA8C;IAC9C,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,KAAK,CAAC,yBAAyB,CAAC,CAAA;IACxC,CAAC;IACD,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,MAAM,KAAK,CAAC,8CAA8C,CAAC,CAAA;IAC7D,CAAC;IACD,oBAAoB;IAEpB,OAAO,gBAAgB,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAA;AACjE,CAAC,CAAA","sourcesContent":["import { error } from '@vltpkg/error-cause'\nimport { asIdentifierNode, type ParserState } from './types.js'\nimport {\n  attributeSelectorsMap,\n  filterAttributes,\n} from './attribute.js'\n\n/**\n * Parse ids, e.g: `#foo`\n */\nexport const id = async (state: ParserState) => {\n  const { value } = asIdentifierNode(state.current)\n  const comparator = attributeSelectorsMap.get('=')\n\n  /* c8 ignore start - should not be possible */\n  if (!value) {\n    throw error('Missing identifier name')\n  }\n  if (!comparator) {\n    throw error('Could not find attribute selector comparator')\n  }\n  /* c8 ignore stop */\n\n  return filterAttributes(state, comparator, value, 'name', true)\n}\n"]}

package/dist/esm/index.d.ts

@@ -0,0 +1,13 @@
+import type { GraphLike } from '@vltpkg/graph';
+import { type ParserState, QueryResponse } from './types.js';
+export * from './types.js';
+export declare const walk: (state: ParserState) => Promise<ParserState>;
+export type QueryOptions = {
+    graph: GraphLike;
+};
+export declare class Query {
+    #private;
+    constructor({ graph }: QueryOptions);
+    search(query: string): Promise<QueryResponse>;
+}
+//# sourceMappingURL=index.d.ts.map

package/dist/esm/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAY,SAAS,EAAY,MAAM,eAAe,CAAA;AAOlE,OAAO,EAEL,KAAK,WAAW,EAKhB,aAAa,EACd,MAAM,YAAY,CAAA;AAEnB,cAAc,YAAY,CAAA;AAiC1B,eAAO,MAAM,IAAI,UACR,WAAW,KACjB,OAAO,CAAC,WAAW,CAiDrB,CAAA;AAED,MAAM,MAAM,YAAY,GAAG;IACzB,KAAK,EAAE,SAAS,CAAA;CACjB,CAAA;AAED,qBAAa,KAAK;;gBAIJ,EAAE,KAAK,EAAE,EAAE,YAAY;IAK7B,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC;CA0CpD"}