@jomae/catalog 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Johannes Maendle
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,61 @@
+# @jomae/catalog
+
+The rule catalog behind [youmightnotneed.dev](https://youmightnotneed.dev).
+Maps npm packages to the modern CSS and HTML that replaces them.
+
+```
+npm install @jomae/catalog
+```
+
+```ts
+import { analyze, baselineLabel } from "@jomae/catalog";
+
+const { findings, summary } = analyze({
+  dependencies: { swiper: "^11.0.0", "react-wrap-balancer": "^1.1.1" },
+});
+
+console.log(summary.replaceableBytes); // 21259
+
+for (const finding of findings) {
+  console.log(finding.rule.title, baselineLabel(finding.baseline.status));
+  console.log(finding.rule.native);
+  console.log(finding.rule.agent.unless); // when to keep the dependency
+}
+```
+
+## detect() is pure
+
+No filesystem, no network, no clock. It takes a parsed dependency map and
+returns findings, which is what lets a website, a CLI and an agent share one
+implementation.
+
+```ts
+import { detect, summarize } from "@jomae/catalog";
+
+const findings = detect(packageJson); // Finding[]
+const summary = summarize(findings);
+```
+
+`dependencies`, `devDependencies` and `peerDependencies` are all read. Version
+ranges are ignored.
+
+## Every finding carries its caveats
+
+`rule.agent.unless` is a non-empty list of the conditions under which the
+dependency is still the correct choice. The schema enforces that it is
+populated. Render it. A replacement shown without its caveats is how this kind
+of tool ends up wrong in public.
+
+`baseline.status` is one of `widely`, `newly` or `limited`, derived from
+[`web-features`](https://github.com/web-platform-dx/web-features) at build time
+rather than hardcoded. A rule reports the status of its least-supported
+required feature, and `baseline.limitedBy` names it.
+
+## Sizes
+
+`replaceableBytes` is minified and gzipped, from a dated snapshot in
+`packageSizes`. It is `null` when nothing matched has a measurement, so you can
+say "size unknown" rather than "0 kB". Phrase totals as "up to": a package
+being installed is not proof that the native approach covers how it is used.
+
+MIT.

package/dist/baseline.d.ts

@@ -0,0 +1,51 @@
+import type { BaselineStatus, Rule } from "./schema.ts";
+/**
+ * One web-features entry, mapped into the catalog's vocabulary.
+ */
+export interface ResolvedFeature {
+    /** The web-features ID. */
+    id: string;
+    /** Human-readable name, e.g. "Scroll snap". */
+    name: string;
+    status: BaselineStatus;
+    /** Date the feature reached its current status, when known. */
+    since: string | null;
+    spec: string | null;
+}
+export interface BaselineInfo {
+    /** The rule's overall status: the least-supported required feature. */
+    status: BaselineStatus;
+    features: ResolvedFeature[];
+    /**
+     * The feature that caps the rule's status. Null when a rule has a single
+     * feature, or when the status came from a manualBaseline.
+     */
+    limitedBy: ResolvedFeature | null;
+    source: "web-features" | "manual";
+    /** Date the underlying data was captured, YYYY-MM-DD. */
+    dataDate: string;
+    /** Why a manual entry exists. Only set when source is "manual". */
+    note: string | null;
+}
+export declare function baselineRank(status: BaselineStatus): number;
+/** Sorts best-supported first. */
+export declare function compareBaseline(a: BaselineStatus, b: BaselineStatus): number;
+export declare function baselineLabel(status: BaselineStatus): string;
+export declare function baselineShortLabel(status: BaselineStatus): string;
+/** The date this catalog's Baseline data was captured. */
+export declare const BASELINE_DATA_DATE: string;
+export declare const WEB_FEATURES_VERSION: string;
+/**
+ * Resolves one web-features ID against the snapshot. An unknown ID resolves to
+ * `unknown` rather than throwing, so a stale snapshot degrades into a visible
+ * "unverified" badge instead of a crash. The catalog tests fail on any
+ * `unknown`, which is where this is meant to be caught.
+ */
+export declare function resolveFeature(id: string): ResolvedFeature;
+/**
+ * Derives a rule's support status. A rule is only as available as its
+ * least-supported required feature, so the weakest one wins. This is the only
+ * place a status is decided, and nothing in the catalog hardcodes one.
+ */
+export declare function resolveBaseline(rule: Rule): BaselineInfo;
+//# sourceMappingURL=baseline.d.ts.map

package/dist/baseline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"baseline.d.ts","sourceRoot":"","sources":["../src/baseline.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AAExD;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,2BAA2B;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,+CAA+C;IAC/C,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,cAAc,CAAC;IACvB,+DAA+D;IAC/D,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;CACrB;AAED,MAAM,WAAW,YAAY;IAC3B,uEAAuE;IACvE,MAAM,EAAE,cAAc,CAAC;IACvB,QAAQ,EAAE,eAAe,EAAE,CAAC;IAC5B;;;OAGG;IACH,SAAS,EAAE,eAAe,GAAG,IAAI,CAAC;IAClC,MAAM,EAAE,cAAc,GAAG,QAAQ,CAAC;IAClC,yDAAyD;IACzD,QAAQ,EAAE,MAAM,CAAC;IACjB,mEAAmE;IACnE,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;CACrB;AAUD,wBAAgB,YAAY,CAAC,MAAM,EAAE,cAAc,GAAG,MAAM,CAE3D;AAED,kCAAkC;AAClC,wBAAgB,eAAe,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,cAAc,GAAG,MAAM,CAE5E;AASD,wBAAgB,aAAa,CAAC,MAAM,EAAE,cAAc,GAAG,MAAM,CAE5D;AASD,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,cAAc,GAAG,MAAM,CAEjE;AAED,0DAA0D;AAC1D,eAAO,MAAM,kBAAkB,QAA+B,CAAC;AAC/D,eAAO,MAAM,oBAAoB,QAAsC,CAAC;AAsBxE;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,eAAe,CAa1D;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,IAAI,GAAG,YAAY,CA2CxD"}

package/dist/baseline.js

@@ -0,0 +1,123 @@
+import { baselineSnapshot } from "./generated/baseline.js";
+/** Higher is better supported. Used to pick the weakest feature in a rule. */
+const RANK = {
+    widely: 3,
+    newly: 2,
+    limited: 1,
+    unknown: 0,
+};
+export function baselineRank(status) {
+    return RANK[status];
+}
+/** Sorts best-supported first. */
+export function compareBaseline(a, b) {
+    return RANK[b] - RANK[a];
+}
+const LABELS = {
+    widely: "Baseline widely available",
+    newly: "Baseline newly available",
+    limited: "Limited availability",
+    unknown: "Support unverified",
+};
+export function baselineLabel(status) {
+    return LABELS[status];
+}
+const SHORT_LABELS = {
+    widely: "widely available",
+    newly: "newly available",
+    limited: "limited",
+    unknown: "unverified",
+};
+export function baselineShortLabel(status) {
+    return SHORT_LABELS[status];
+}
+/** The date this catalog's Baseline data was captured. */
+export const BASELINE_DATA_DATE = baselineSnapshot.generatedOn;
+export const WEB_FEATURES_VERSION = baselineSnapshot.webFeaturesVersion;
+function toStatus(baseline) {
+    if (baseline === "high")
+        return "widely";
+    if (baseline === "low")
+        return "newly";
+    return "limited";
+}
+/**
+ * The date a feature reached its current tier. Widely available features report
+ * when they crossed into widely; newly available ones when they crossed into
+ * newly. A limited feature has not reached either, so it has no date.
+ */
+function sinceDate(status, entry) {
+    if (status === "widely")
+        return entry.highDate;
+    if (status === "newly")
+        return entry.lowDate;
+    return null;
+}
+/**
+ * Resolves one web-features ID against the snapshot. An unknown ID resolves to
+ * `unknown` rather than throwing, so a stale snapshot degrades into a visible
+ * "unverified" badge instead of a crash. The catalog tests fail on any
+ * `unknown`, which is where this is meant to be caught.
+ */
+export function resolveFeature(id) {
+    const entry = baselineSnapshot.features[id];
+    if (!entry) {
+        return { id, name: id, status: "unknown", since: null, spec: null };
+    }
+    const status = toStatus(entry.baseline);
+    return {
+        id,
+        name: entry.name,
+        status,
+        since: sinceDate(status, entry),
+        spec: entry.spec,
+    };
+}
+/**
+ * Derives a rule's support status. A rule is only as available as its
+ * least-supported required feature, so the weakest one wins. This is the only
+ * place a status is decided, and nothing in the catalog hardcodes one.
+ */
+export function resolveBaseline(rule) {
+    if (rule.featureIds.length === 0) {
+        const manual = rule.manualBaseline;
+        if (!manual) {
+            // The schema forbids this, so it can only happen with unvalidated data.
+            return {
+                status: "unknown",
+                features: [],
+                limitedBy: null,
+                source: "manual",
+                dataDate: BASELINE_DATA_DATE,
+                note: null,
+            };
+        }
+        return {
+            status: manual.status,
+            features: [],
+            limitedBy: null,
+            source: "manual",
+            dataDate: manual.verifiedOn,
+            note: manual.note,
+        };
+    }
+    const features = rule.featureIds.map(resolveFeature);
+    let weakest = features[0];
+    for (const feature of features) {
+        if (RANK[feature.status] < RANK[weakest.status])
+            weakest = feature;
+    }
+    // Only name a capping feature when one actually caps the rule. Pointing at
+    // a feature that matches every other one would read as a warning where
+    // there is nothing to warn about.
+    const isCapped = features.some((f) => f.status !== weakest.status);
+    return {
+        status: weakest.status,
+        features,
+        limitedBy: isCapped ? weakest : null,
+        source: "web-features",
+        dataDate: BASELINE_DATA_DATE,
+        note: null,
+    };
+}
+//# sourceMappingURL=baseline.js.map

package/dist/baseline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"baseline.js","sourceRoot":"","sources":["../src/baseline.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAiC3D,8EAA8E;AAC9E,MAAM,IAAI,GAAmC;IAC3C,MAAM,EAAE,CAAC;IACT,KAAK,EAAE,CAAC;IACR,OAAO,EAAE,CAAC;IACV,OAAO,EAAE,CAAC;CACX,CAAC;AAEF,MAAM,UAAU,YAAY,CAAC,MAAsB;IACjD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC;AACtB,CAAC;AAED,kCAAkC;AAClC,MAAM,UAAU,eAAe,CAAC,CAAiB,EAAE,CAAiB;IAClE,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED,MAAM,MAAM,GAAmC;IAC7C,MAAM,EAAE,2BAA2B;IACnC,KAAK,EAAE,0BAA0B;IACjC,OAAO,EAAE,sBAAsB;IAC/B,OAAO,EAAE,oBAAoB;CAC9B,CAAC;AAEF,MAAM,UAAU,aAAa,CAAC,MAAsB;IAClD,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC;AACxB,CAAC;AAED,MAAM,YAAY,GAAmC;IACnD,MAAM,EAAE,kBAAkB;IAC1B,KAAK,EAAE,iBAAiB;IACxB,OAAO,EAAE,SAAS;IAClB,OAAO,EAAE,YAAY;CACtB,CAAC;AAEF,MAAM,UAAU,kBAAkB,CAAC,MAAsB;IACvD,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;AAC9B,CAAC;AAED,0DAA0D;AAC1D,MAAM,CAAC,MAAM,kBAAkB,GAAG,gBAAgB,CAAC,WAAW,CAAC;AAC/D,MAAM,CAAC,MAAM,oBAAoB,GAAG,gBAAgB,CAAC,kBAAkB,CAAC;AAExE,SAAS,QAAQ,CAAC,QAAgC;IAChD,IAAI,QAAQ,KAAK,MAAM;QAAE,OAAO,QAAQ,CAAC;IACzC,IAAI,QAAQ,KAAK,KAAK;QAAE,OAAO,OAAO,CAAC;IACvC,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAChB,MAAsB,EACtB,KAA0D;IAE1D,IAAI,MAAM,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC,QAAQ,CAAC;IAC/C,IAAI,MAAM,KAAK,OAAO;QAAE,OAAO,KAAK,CAAC,OAAO,CAAC;IAC7C,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,EAAU;IACvC,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC5C,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACtE,CAAC;IACD,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACxC,OAAO;QACL,EAAE;QACF,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,MAAM;QACN,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC;QAC/B,IAAI,EAAE,KAAK,CAAC,IAAI;KACjB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,IAAU;IACxC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC;QACnC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,wEAAwE;YACxE,OAAO;gBACL,MAAM,EAAE,SAAS;gBACjB,QAAQ,EAAE,EAAE;gBACZ,SAAS,EAAE,IAAI;gBACf,MAAM,EAAE,QAAQ;gBAChB,QAAQ,EAAE,kBAAkB;gBAC5B,IAAI,EAAE,IAAI;aACX,CAAC;QACJ,CAAC;QACD,OAAO;YACL,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,QAAQ,EAAE,EAAE;YACZ,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,QAAQ;YAChB,QAAQ,EAAE,MAAM,CAAC,UAAU;YAC3B,IAAI,EAAE,MAAM,CAAC,IAAI;SAClB,CAAC;IACJ,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IACrD,IAAI,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAoB,CAAC;IAC7C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,OAAO,GAAG,OAAO,CAAC;IACrE,CAAC;IAED,2EAA2E;IAC3E,uEAAuE;IACvE,kCAAkC;IAClC,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IAEnE,OAAO;QACL,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,QAAQ;QACR,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QACpC,MAAM,EAAE,cAAc;QACtB,QAAQ,EAAE,kBAAkB;QAC5B,IAAI,EAAE,IAAI;KACX,CAAC;AACJ,CAAC"}

package/dist/detect.d.ts

@@ -0,0 +1,81 @@
+import { type BaselineInfo } from "./baseline.ts";
+import type { BaselineStatus, Rule } from "./schema.ts";
+/**
+ * detect() is pure: no filesystem, no network, no `process`, no clock. It takes
+ * a parsed dependency map and returns findings. Every surface (website, CLI,
+ * agent tooling) calls this same function, which is what makes four form
+ * factors cost one implementation.
+ */
+export declare const DEPENDENCY_FIELDS: readonly ["dependencies", "devDependencies", "peerDependencies"];
+export type DependencyField = (typeof DEPENDENCY_FIELDS)[number];
+/** The subset of a package.json that detect() reads. */
+export interface PackageJsonLike {
+    name?: string | undefined;
+    dependencies?: Record<string, string> | undefined;
+    devDependencies?: Record<string, string> | undefined;
+    peerDependencies?: Record<string, string> | undefined;
+}
+export interface MatchedPackage {
+    name: string;
+    /** Every field the package appears in. Versions are ignored in v1. */
+    fields: DependencyField[];
+    /** Minified and gzipped bytes, or null when we have no measurement. */
+    gzip: number | null;
+    /** The version that was measured, not the version installed. */
+    measuredVersion: string | null;
+}
+export interface Finding {
+    rule: Rule;
+    baseline: BaselineInfo;
+    /** The dependencies that caused this rule to fire. Never empty. */
+    matched: MatchedPackage[];
+    /**
+     * Sum of the known sizes of the matched packages. Null when none of them
+     * has a measurement, so callers can say "size unknown" rather than "0 kB".
+     */
+    replaceableBytes: number | null;
+    /** True when at least one matched package has no size data. */
+    hasUnknownSizes: boolean;
+}
+export interface DetectOptions {
+    /** Override the rule set. Used by tests; defaults to the full catalog. */
+    rules?: readonly Rule[] | undefined;
+}
+/**
+ * Maps a dependency list to the rules that cover it.
+ *
+ * A dependency in package.json is not proof of what it is used for, so a
+ * finding is a "this may apply" and every surface renders it with its Baseline
+ * badge and its `unless` conditions.
+ */
+export declare function detect(pkg: PackageJsonLike, options?: DetectOptions): Finding[];
+/**
+ * Heaviest first, because the headline number is kilobytes. Ties break on
+ * support (better-supported first) and then title, so the order is stable.
+ */
+export declare function sortFindings(findings: Finding[]): Finding[];
+export interface Summary {
+    /**
+     * Total known replaceable bytes, minified and gzipped. Phrased as "up to"
+     * everywhere it is shown, because a dependency being present is not proof
+     * that the native approach covers how it is used.
+     */
+    replaceableBytes: number;
+    /** Number of rules that fired. */
+    findingCount: number;
+    /** Number of matched dependencies across all findings. */
+    packageCount: number;
+    /** True when any matched package had no size measurement. */
+    hasUnknownSizes: boolean;
+    /** How many findings sit in each support tier. */
+    byStatus: Record<BaselineStatus, number>;
+}
+/** Pure. Rolls findings up into the numbers a report leads with. */
+export declare function summarize(findings: readonly Finding[]): Summary;
+export interface Report {
+    findings: Finding[];
+    summary: Summary;
+}
+/** Convenience wrapper: detect() plus summarize() in one call. Pure. */
+export declare function analyze(pkg: PackageJsonLike, options?: DetectOptions): Report;
+//# sourceMappingURL=detect.d.ts.map

package/dist/detect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect.d.ts","sourceRoot":"","sources":["../src/detect.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,YAAY,EAGlB,MAAM,eAAe,CAAC;AAGvB,OAAO,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AAExD;;;;;GAKG;AAEH,eAAO,MAAM,iBAAiB,YAC5B,cAAc,EACd,iBAAiB,EACjB,kBAAkB,CACV,CAAC;AAEX,MAAM,MAAM,eAAe,GAAG,CAAC,OAAO,iBAAiB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEjE,wDAAwD;AACxD,MAAM,WAAW,eAAe;IAC9B,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAAC;IAClD,eAAe,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAAC;IACrD,gBAAgB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAAC;CACvD;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,sEAAsE;IACtE,MAAM,EAAE,eAAe,EAAE,CAAC;IAC1B,uEAAuE;IACvE,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,gEAAgE;IAChE,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAED,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,IAAI,CAAC;IACX,QAAQ,EAAE,YAAY,CAAC;IACvB,mEAAmE;IACnE,OAAO,EAAE,cAAc,EAAE,CAAC;IAC1B;;;OAGG;IACH,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,+DAA+D;IAC/D,eAAe,EAAE,OAAO,CAAC;CAC1B;AAED,MAAM,WAAW,aAAa;IAC5B,0EAA0E;IAC1E,KAAK,CAAC,EAAE,SAAS,IAAI,EAAE,GAAG,SAAS,CAAC;CACrC;AA2FD;;;;;;GAMG;AACH,wBAAgB,MAAM,CACpB,GAAG,EAAE,eAAe,EACpB,OAAO,GAAE,aAAkB,GAC1B,OAAO,EAAE,CAkBX;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,CAQ3D;AAED,MAAM,WAAW,OAAO;IACtB;;;;OAIG;IACH,gBAAgB,EAAE,MAAM,CAAC;IACzB,kCAAkC;IAClC,YAAY,EAAE,MAAM,CAAC;IACrB,0DAA0D;IAC1D,YAAY,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,eAAe,EAAE,OAAO,CAAC;IACzB,kDAAkD;IAClD,QAAQ,EAAE,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;CAC1C;AAED,oEAAoE;AACpE,wBAAgB,SAAS,CAAC,QAAQ,EAAE,SAAS,OAAO,EAAE,GAAG,OAAO,CAyB/D;AAED,MAAM,WAAW,MAAM;IACrB,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,OAAO,EAAE,OAAO,CAAC;CAClB;AAED,wEAAwE;AACxE,wBAAgB,OAAO,CACrB,GAAG,EAAE,eAAe,EACpB,OAAO,GAAE,aAAkB,GAC1B,MAAM,CAGR"}

package/dist/detect.js

@@ -0,0 +1,155 @@
+import { compareBaseline, resolveBaseline, } from "./baseline.js";
+import { packageSizes } from "./generated/sizes.js";
+import { rules as defaultRules } from "./rules/index.js";
+/**
+ * detect() is pure: no filesystem, no network, no `process`, no clock. It takes
+ * a parsed dependency map and returns findings. Every surface (website, CLI,
+ * agent tooling) calls this same function, which is what makes four form
+ * factors cost one implementation.
+ */
+export const DEPENDENCY_FIELDS = [
+    "dependencies",
+    "devDependencies",
+    "peerDependencies",
+];
+function readSize(name) {
+    const entry = packageSizes.sizes[name];
+    if (!entry)
+        return { gzip: null, version: null };
+    return { gzip: entry.gzip, version: entry.version };
+}
+/**
+ * Collects the dependency names in a package.json, remembering which fields
+ * each one came from. Names are compared exactly and lowercased, matching how
+ * npm treats them.
+ */
+function collectDependencies(pkg) {
+    const found = new Map();
+    for (const field of DEPENDENCY_FIELDS) {
+        const block = pkg[field];
+        if (!block || typeof block !== "object")
+            continue;
+        for (const rawName of Object.keys(block)) {
+            remember(found, rawName.toLowerCase(), field);
+        }
+    }
+    return found;
+}
+/** Notes that `name` appeared in `field`, without duplicating the field. */
+function remember(found, name, field) {
+    const fields = found.get(name);
+    if (!fields) {
+        found.set(name, [field]);
+        return;
+    }
+    if (!fields.includes(field))
+        fields.push(field);
+}
+/**
+ * Maps a dependency list to the rules that cover it.
+ *
+ * A dependency in package.json is not proof of what it is used for, so a
+ * finding is a "this may apply" and every surface renders it with its Baseline
+ * badge and its `unless` conditions.
+ */
+/**
+ * Finds the packages from one rule that appear in a dependency list. Returns an
+ * empty array when the rule does not apply.
+ */
+function matchRule(rule, installed) {
+    const matched = [];
+    for (const candidate of rule.replaces) {
+        const fields = installed.get(candidate.toLowerCase());
+        if (!fields)
+            continue;
+        const { gzip, version } = readSize(candidate);
+        matched.push({
+            name: candidate,
+            fields: [...fields],
+            gzip,
+            measuredVersion: version,
+        });
+    }
+    return matched;
+}
+/** Sums the sizes we know, and reports whether any were missing. */
+function weigh(matched) {
+    const known = matched.filter((m) => m.gzip !== null);
+    return {
+        replaceableBytes: known.length > 0
+            ? known.reduce((total, m) => total + (m.gzip ?? 0), 0)
+            : null,
+        hasUnknownSizes: known.length !== matched.length,
+    };
+}
+/**
+ * Maps a dependency list to the rules that cover it.
+ *
+ * A dependency in package.json is not proof of what it is used for, so a
+ * finding is a "this may apply" and every surface renders it with its Baseline
+ * badge and its `unless` conditions.
+ */
+export function detect(pkg, options = {}) {
+    const rules = options.rules ?? defaultRules;
+    const installed = collectDependencies(pkg);
+    const findings = [];
+    for (const rule of rules) {
+        const matched = matchRule(rule, installed);
+        if (matched.length === 0)
+            continue;
+        findings.push({
+            rule,
+            baseline: resolveBaseline(rule),
+            matched,
+            ...weigh(matched),
+        });
+    }
+    return sortFindings(findings);
+}
+/**
+ * Heaviest first, because the headline number is kilobytes. Ties break on
+ * support (better-supported first) and then title, so the order is stable.
+ */
+export function sortFindings(findings) {
+    return [...findings].sort((a, b) => {
+        const byBytes = (b.replaceableBytes ?? 0) - (a.replaceableBytes ?? 0);
+        if (byBytes !== 0)
+            return byBytes;
+        const byBaseline = compareBaseline(a.baseline.status, b.baseline.status);
+        if (byBaseline !== 0)
+            return byBaseline;
+        return a.rule.title.localeCompare(b.rule.title);
+    });
+}
+/** Pure. Rolls findings up into the numbers a report leads with. */
+export function summarize(findings) {
+    const byStatus = {
+        widely: 0,
+        newly: 0,
+        limited: 0,
+        unknown: 0,
+    };
+    let replaceableBytes = 0;
+    let packageCount = 0;
+    let hasUnknownSizes = false;
+    for (const finding of findings) {
+        replaceableBytes += finding.replaceableBytes ?? 0;
+        packageCount += finding.matched.length;
+        if (finding.hasUnknownSizes)
+            hasUnknownSizes = true;
+        byStatus[finding.baseline.status] += 1;
+    }
+    return {
+        replaceableBytes,
+        findingCount: findings.length,
+        packageCount,
+        hasUnknownSizes,
+        byStatus,
+    };
+}
+/** Convenience wrapper: detect() plus summarize() in one call. Pure. */
+export function analyze(pkg, options = {}) {
+    const findings = detect(pkg, options);
+    return { findings, summary: summarize(findings) };
+}
+//# sourceMappingURL=detect.js.map

package/dist/detect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect.js","sourceRoot":"","sources":["../src/detect.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,eAAe,EACf,eAAe,GAChB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACpD,OAAO,EAAE,KAAK,IAAI,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAGzD;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,cAAc;IACd,iBAAiB;IACjB,kBAAkB;CACV,CAAC;AAyCX,SAAS,QAAQ,CAAC,IAAY;IAI5B,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IACjD,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC;AACtD,CAAC;AAED;;;;GAIG;AACH,SAAS,mBAAmB,CAC1B,GAAoB;IAEpB,MAAM,KAAK,GAAG,IAAI,GAAG,EAA6B,CAAC;IACnD,KAAK,MAAM,KAAK,IAAI,iBAAiB,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ;YAAE,SAAS;QAClD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACzC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,WAAW,EAAE,EAAE,KAAK,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,4EAA4E;AAC5E,SAAS,QAAQ,CACf,KAAqC,EACrC,IAAY,EACZ,KAAsB;IAEtB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QACzB,OAAO;IACT,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAClD,CAAC;AAED;;;;;;GAMG;AACH;;;GAGG;AACH,SAAS,SAAS,CAChB,IAAU,EACV,SAAiD;IAEjD,MAAM,OAAO,GAAqB,EAAE,CAAC;IAErC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,CAAC;QACtD,IAAI,CAAC,MAAM;YAAE,SAAS;QACtB,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC9C,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,SAAS;YACf,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC;YACnB,IAAI;YACJ,eAAe,EAAE,OAAO;SACzB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,oEAAoE;AACpE,SAAS,KAAK,CAAC,OAAkC;IAI/C,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IACrD,OAAO;QACL,gBAAgB,EACd,KAAK,CAAC,MAAM,GAAG,CAAC;YACd,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;YACtD,CAAC,CAAC,IAAI;QACV,eAAe,EAAE,KAAK,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;KACjD,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,MAAM,CACpB,GAAoB,EACpB,OAAO,GAAkB,EAAE;IAE3B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,YAAY,CAAC;IAC5C,MAAM,SAAS,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAC3C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEnC,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI;YACJ,QAAQ,EAAE,eAAe,CAAC,IAAI,CAAC;YAC/B,OAAO;YACP,GAAG,KAAK,CAAC,OAAO,CAAC;SAClB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,YAAY,CAAC,QAAQ,CAAC,CAAC;AAChC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,QAAmB;IAC9C,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACjC,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,CAAC;QACtE,IAAI,OAAO,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC;QAClC,MAAM,UAAU,GAAG,eAAe,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACzE,IAAI,UAAU,KAAK,CAAC;YAAE,OAAO,UAAU,CAAC;QACxC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC;AAmBD,oEAAoE;AACpE,MAAM,UAAU,SAAS,CAAC,QAA4B;IACpD,MAAM,QAAQ,GAAmC;QAC/C,MAAM,EAAE,CAAC;QACT,KAAK,EAAE,CAAC;QACR,OAAO,EAAE,CAAC;QACV,OAAO,EAAE,CAAC;KACX,CAAC;IACF,IAAI,gBAAgB,GAAG,CAAC,CAAC;IACzB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,eAAe,GAAG,KAAK,CAAC;IAE5B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,gBAAgB,IAAI,OAAO,CAAC,gBAAgB,IAAI,CAAC,CAAC;QAClD,YAAY,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC;QACvC,IAAI,OAAO,CAAC,eAAe;YAAE,eAAe,GAAG,IAAI,CAAC;QACpD,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IAED,OAAO;QACL,gBAAgB;QAChB,YAAY,EAAE,QAAQ,CAAC,MAAM;QAC7B,YAAY;QACZ,eAAe;QACf,QAAQ;KACT,CAAC;AACJ,CAAC;AAOD,wEAAwE;AACxE,MAAM,UAAU,OAAO,CACrB,GAAoB,EACpB,OAAO,GAAkB,EAAE;IAE3B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IACtC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;AACpD,CAAC"}

package/dist/format.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Shared presentation helpers.
+ *
+ * These live in the catalog so the CLI, the website and any future surface
+ * phrase a finding the same way. The phrasing is deliberate: a dependency in
+ * package.json is not proof of what it is used for, so sizes are always "up
+ * to" and a rule always reads as a conditional.
+ */
+/** 20076 becomes "20.1 kB". Uses kB, base 1000, the way npm and bundlers do. */
+export declare function formatBytes(bytes: number): string;
+/** The honest headline. It hedges, and never promises a saving. */
+export declare function formatHeadline(bytes: number, packageCount: number): string;
+/**
+ * Phrases a finding as a condition rather than an instruction. "If you're
+ * using swiper for X, then Y covers that case."
+ */
+export declare function formatConditional(packageNames: readonly string[], when: string, native: string): string;
+/** ["a", "b", "c"] becomes "a, b and c". */
+export declare function formatList(items: readonly string[]): string;
+//# sourceMappingURL=format.d.ts.map

package/dist/format.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.d.ts","sourceRoot":"","sources":["../src/format.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,gFAAgF;AAChF,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAKjD;AAED,mEAAmE;AACnE,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,CAO1E;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,YAAY,EAAE,SAAS,MAAM,EAAE,EAC/B,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,GACb,MAAM,CAGR;AAED,4CAA4C;AAC5C,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAK3D"}

package/dist/format.js

@@ -0,0 +1,45 @@
+/**
+ * Shared presentation helpers.
+ *
+ * These live in the catalog so the CLI, the website and any future surface
+ * phrase a finding the same way. The phrasing is deliberate: a dependency in
+ * package.json is not proof of what it is used for, so sizes are always "up
+ * to" and a rule always reads as a conditional.
+ */
+/** 20076 becomes "20.1 kB". Uses kB, base 1000, the way npm and bundlers do. */
+export function formatBytes(bytes) {
+    if (bytes < 1000)
+        return `${bytes} B`;
+    const kb = bytes / 1000;
+    if (kb < 100)
+        return `${kb.toFixed(1)} kB`;
+    return `${Math.round(kb)} kB`;
+}
+/** The honest headline. It hedges, and never promises a saving. */
+export function formatHeadline(bytes, packageCount) {
+    if (packageCount === 0)
+        return "Nothing here that CSS covers yet";
+    const deps = packageCount === 1 ? "dependency" : "dependencies";
+    if (bytes === 0) {
+        return `${packageCount} ${deps} may have a native equivalent`;
+    }
+    return `Up to ${formatBytes(bytes)} across ${packageCount} ${deps}`;
+}
+/**
+ * Phrases a finding as a condition rather than an instruction. "If you're
+ * using swiper for X, then Y covers that case."
+ */
+export function formatConditional(packageNames, when, native) {
+    const list = formatList(packageNames);
+    return `If you're using ${list} for ${when}, ${native} covers that case.`;
+}
+/** ["a", "b", "c"] becomes "a, b and c". */
+export function formatList(items) {
+    if (items.length === 0)
+        return "";
+    if (items.length === 1)
+        return items[0];
+    const head = items.slice(0, -1).join(", ");
+    return `${head} and ${items.at(-1)}`;
+}
+//# sourceMappingURL=format.js.map

package/dist/format.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.js","sourceRoot":"","sources":["../src/format.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,gFAAgF;AAChF,MAAM,UAAU,WAAW,CAAC,KAAa;IACvC,IAAI,KAAK,GAAG,IAAI;QAAE,OAAO,GAAG,KAAK,IAAI,CAAC;IACtC,MAAM,EAAE,GAAG,KAAK,GAAG,IAAI,CAAC;IACxB,IAAI,EAAE,GAAG,GAAG;QAAE,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC;IAC3C,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC;AAChC,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,cAAc,CAAC,KAAa,EAAE,YAAoB;IAChE,IAAI,YAAY,KAAK,CAAC;QAAE,OAAO,kCAAkC,CAAC;IAClE,MAAM,IAAI,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,CAAC;IAChE,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO,GAAG,YAAY,IAAI,IAAI,+BAA+B,CAAC;IAChE,CAAC;IACD,OAAO,SAAS,WAAW,CAAC,KAAK,CAAC,WAAW,YAAY,IAAI,IAAI,EAAE,CAAC;AACtE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAC/B,YAA+B,EAC/B,IAAY,EACZ,MAAc;IAEd,MAAM,IAAI,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;IACtC,OAAO,mBAAmB,IAAI,QAAQ,IAAI,KAAK,MAAM,oBAAoB,CAAC;AAC5E,CAAC;AAED,4CAA4C;AAC5C,MAAM,UAAU,UAAU,CAAC,KAAwB;IACjD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,CAAC,CAAW,CAAC;IAClD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,OAAO,GAAG,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACvC,CAAC"}

package/dist/generated/baseline.d.ts

@@ -0,0 +1,22 @@
+/** Raw Baseline state for one feature, as web-features reports it. */
+export interface BaselineSnapshotEntry {
+    /** Human-readable feature name, e.g. "Scroll snap". */
+    name: string;
+    /** "high" is widely available, "low" is newly available, false is limited. */
+    baseline: "high" | "low" | false;
+    /** Date the feature became newly available. */
+    lowDate: string | null;
+    /** Date the feature became widely available. */
+    highDate: string | null;
+    /** Canonical specification URL, when web-features records one. */
+    spec: string | null;
+}
+export interface BaselineSnapshot {
+    /** Date this snapshot was generated, YYYY-MM-DD. */
+    generatedOn: string;
+    /** The web-features release the data came from. */
+    webFeaturesVersion: string;
+    features: Record<string, BaselineSnapshotEntry>;
+}
+export declare const baselineSnapshot: BaselineSnapshot;
+//# sourceMappingURL=baseline.d.ts.map

package/dist/generated/baseline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"baseline.d.ts","sourceRoot":"","sources":["../../src/generated/baseline.ts"],"names":[],"mappings":"AAGA,sEAAsE;AACtE,MAAM,WAAW,qBAAqB;IACpC,uDAAuD;IACvD,IAAI,EAAE,MAAM,CAAC;IACb,8EAA8E;IAC9E,QAAQ,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,CAAC;IACjC,+CAA+C;IAC/C,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,gDAAgD;IAChD,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,kEAAkE;IAClE,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;CACrB;AAED,MAAM,WAAW,gBAAgB;IAC/B,oDAAoD;IACpD,WAAW,EAAE,MAAM,CAAC;IACpB,mDAAmD;IACnD,kBAAkB,EAAE,MAAM,CAAC;IAC3B,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;CACjD;AAED,eAAO,MAAM,gBAAgB,EAAE,gBA4O9B,CAAC"}