@astryxdesign/cli 0.7.2-canary.fe2c655 → 0.7.3-canary.02f5fe4

package/foundation/text/suggest-order.mjs

@@ -0,0 +1,363 @@
+// Copyright (c) Meta Platforms, Inc. and affiliates.
+
+/**
+ * @file Order the suggestions a failed lookup prints, best first.
+ *
+ * A failed `component`, `template` or `docs` lookup already knows which
+ * entries to suggest; this module decides their order, so the entry the
+ * caller most likely meant comes first. It never makes a list longer.
+ *
+ * Names are compared as words: `DropdownMenuItem`, `dropdown-menu-item` and
+ * `Dropdown Menu Items` all read as `dropdown menu item`.
+ *
+ * @input  the name the caller typed and the candidate entries
+ * @output the entries, reordered
+ * @position lib: shared by the component, template and docs lookup errors
+ */
+
+import {levenshteinDistance} from './levenshtein.mjs';
+
+/** The score a synonym match gets: an exact keyword's. */
+const SYNONYM_SCORE = 90;
+/** The score a name with exactly the typed words gets: an exact name's. */
+const SAME_WORDS_SCORE = 100;
+
+/**
+ * A word with one trailing plural `s` removed (`tabs` → `tab`), leaving short
+ * words and `ss` endings alone.
+ * @param {string} word
+ * @returns {string}
+ */
+function singular(word) {
+  return word.length > 3 && word.endsWith('s') && !word.endsWith('ss')
+    ? word.slice(0, -1)
+    : word;
+}
+
+/**
+ * A name's words, lowercase and singular: camelCase, PascalCase, kebab-case,
+ * snake_case, slashes and spaces all split.
+ * @param {string} text
+ * @returns {string[]}
+ */
+export function nameWords(text) {
+  /** @type {string[]} */
+  const words = [];
+  for (const part of String(text ?? '').split(/[^A-Za-z0-9]+/)) {
+    if (!part) continue;
+    const found =
+      part.match(/[A-Z]+(?=[A-Z][a-z])|[A-Z]?[a-z]+|[A-Z]+|[0-9]+/g) ?? [];
+    for (const w of found) words.push(singular(w.toLowerCase()));
+  }
+  return words;
+}
+
+/**
+ * How closely one candidate name matches what the caller typed; higher is
+ * closer. Tiers, best first: the same words; every typed word present; some
+ * typed word present; none. Within a tier, more of the typed words and more of
+ * the candidate's own words matched rank higher, and a name that starts with
+ * the typed name (or the reverse) gets a small lift.
+ * @param {string[]} typed - {@link nameWords} of the typed name
+ * @param {string} name
+ * @returns {number}
+ */
+function affinityOf(typed, name) {
+  const words = nameWords(name);
+  if (typed.length === 0 || words.length === 0) return 0;
+  const typedJoined = typed.join('');
+  const joined = words.join('');
+  if (joined === typedJoined) return 40;
+  const have = new Set(words);
+  const want = new Set(typed);
+  const covered = typed.filter(w => have.has(w)).length / typed.length;
+  const precise = words.filter(w => want.has(w)).length / words.length;
+  const prefix =
+    joined.startsWith(typedJoined) || typedJoined.startsWith(joined) ? 1 : 0;
+  const tier = covered === 1 ? 2 : covered > 0 ? 1 : 0;
+  return tier * 10 + covered * 4 + precise * 2 + prefix + precise * 0.01;
+}
+
+/**
+ * The same items, closest to the typed name first; each item is as close as
+ * its closest name. Equal matches keep their original order.
+ * @template T
+ * @param {string} typedName
+ * @param {T[]} items
+ * @param {(item: T) => Array<string | undefined>} namesOf
+ * @returns {T[]}
+ */
+export function orderByAffinity(typedName, items, namesOf) {
+  const typed = nameWords(typedName);
+  const scored = items.map((item, index) => {
+    let best = 0;
+    for (const name of namesOf(item)) {
+      if (name) best = Math.max(best, affinityOf(typed, name));
+    }
+    return {item, index, best};
+  });
+  scored.sort((a, b) => b.best - a.best || a.index - b.index);
+  return scored.map(s => s.item);
+}
+
+/**
+ * Docs route suggestions, closest to the typed route first. When every
+ * suggestion sits under one namespace the typed route also starts with, that
+ * shared part is left out of the comparison: it says nothing about which page
+ * was meant. Equal matches keep their order.
+ * @template {{name: string}} T
+ * @param {string} topic - the typed route
+ * @param {T[]} suggestions
+ * @returns {T[]}
+ */
+export function orderRouteSuggestions(topic, suggestions) {
+  let shared = suggestions.length > 0 ? suggestions[0].name : '';
+  for (const {name} of suggestions) {
+    while (shared && !name.startsWith(shared)) shared = shared.slice(0, -1);
+  }
+  const namespace = shared.slice(0, shared.lastIndexOf('/') + 1);
+  return namespace && topic.startsWith(namespace)
+    ? orderByAffinity(topic.slice(namespace.length), suggestions, s => [
+        s.name.slice(namespace.length),
+      ])
+    : orderByAffinity(topic, suggestions, s => [s.name]);
+}
+
+/** Library names a synonym may start with (`MUI TextField`). */
+const LIBRARY_WORDS = new Set([
+  'mui',
+  'material',
+  'chakra',
+  'ant',
+  'antd',
+  'radix',
+  'bootstrap',
+  'mantine',
+  'shadcn',
+  'headless',
+  'aria',
+  'react',
+]);
+
+/**
+ * The components whose synonyms name what was typed. A synonym matches when
+ * its words, with or without a leading library name, are the typed words
+ * (`MUI TextField` matches `MUI TextField`, `TextField` and `text-field`).
+ * @param {string} needle
+ * @param {Record<string, {synonyms?: string[]}>} cards - component name → its search card
+ * @returns {Set<string>}
+ */
+export function synonymMatches(needle, cards) {
+  const typed = nameWords(needle).join('');
+  /** @type {Set<string>} */
+  const found = new Set();
+  if (!typed) return found;
+  for (const [name, card] of Object.entries(cards ?? {})) {
+    for (const synonym of card?.synonyms ?? []) {
+      const words = nameWords(synonym);
+      const whole = words.join('');
+      while (words.length > 1 && LIBRARY_WORDS.has(words[0])) words.shift();
+      if (whole === typed || words.join('') === typed) {
+        found.add(name);
+        break;
+      }
+    }
+  }
+  return found;
+}
+
+/** Words that name a structural part of a component (`<Family>Footer`). */
+const PART_WORDS = new Set([
+  'header',
+  'footer',
+  'body',
+  'content',
+  'title',
+  'heading',
+  'description',
+  'item',
+  'trigger',
+  'action',
+  'close',
+  'group',
+  'cell',
+  'row',
+  'column',
+  'label',
+  'icon',
+  'root',
+  'wrapper',
+]);
+
+/** Part words that name the same slot of a component family. */
+const SAME_PART = /** @type {Record<string, string[]>} */ ({
+  item: ['item', 'option'],
+  option: ['option', 'item'],
+  header: ['header', 'heading', 'title'],
+  heading: ['heading', 'header', 'title'],
+  title: ['title', 'heading', 'header'],
+});
+
+/**
+ * A suggestion score for a component whose name shares the typed compound
+ * name's words, on the same scale as `searchComponents`, or null. It covers
+ * part names that do not exist: the family part named with other words
+ * (`PickerItem` → `PickerOption`), the part named without its family's
+ * first word (`RailItem` → `SideRailItem`), the part named without its family's
+ * middle word (`FactItem` → `FactListItem`), and the parent of a structural
+ * part that is not its own component (`SheetFooter` → `Sheet`, but not
+ * `SheetMusic`).
+ * @param {string[]} typed - {@link nameWords} of the typed name
+ * @param {string} name
+ * @returns {{score: number, reason: string} | null}
+ */
+function compoundMatch(typed, name) {
+  if (typed.length < 2) return null;
+  const words = nameWords(name);
+  const n = words.length;
+  const t = typed.length;
+  const same = (/** @type {string[]} */ a, /** @type {string[]} */ b) =>
+    a.length === b.length && a.every((w, i) => w === b[i]);
+  if (
+    n >= 2 &&
+    same(words.slice(0, -1), typed.slice(0, -1)) &&
+    (SAME_PART[typed[t - 1]] ?? []).includes(words[n - 1])
+  ) {
+    return {score: 79, reason: 'same part of the family'};
+  }
+  if (n > t && same(words.slice(n - t), typed)) {
+    return {score: 78, reason: 'name ends with the words typed'};
+  }
+  if (n > t && words[0] === typed[0] && words[n - 1] === typed[t - 1]) {
+    return {score: 77, reason: 'same part of the family'};
+  }
+  if (
+    n < t &&
+    same(typed.slice(0, n), words) &&
+    typed.slice(n).every(w => PART_WORDS.has(w))
+  ) {
+    return {score: 72, reason: 'the family this part belongs to'};
+  }
+  return null;
+}
+
+/**
+ * Rank component suggestions for a name that resolved to nothing.
+ *
+ * Every component `searchComponents` scored keeps its score. A component whose
+ * name has exactly the typed words (`chat-messages` for `ChatMessage`) scores
+ * like an exact name; one of whose synonyms is the typed name (see
+ * {@link synonymMatches}) like an exact keyword; one whose name shares the
+ * typed compound name's words (see {@link compoundMatch}) just below a
+ * one-letter typo of a name. Equal scores put synonym matches first, then order by how many of the typed words the
+ * name carries, then by how early the keyword that matched sits in the
+ * component's keywords, then by edit distance, then by shared leading letters,
+ * then by name. The caller decides how many to print.
+ * @param {string} needle - the typed component name (no `XDS` prefix)
+ * @param {Array<{name: string, score: number, reason: string, keywordAt?: number}>} results - `searchComponents` output
+ * @param {string[]} allNames - every component name
+ * @param {Set<string>} [synonyms] - {@link synonymMatches} for the typed name
+ * @returns {Array<{name: string, score: number, reason: string}>}
+ */
+export function rankComponentSuggestions(
+  needle,
+  results,
+  allNames,
+  synonyms = new Set(),
+) {
+  const term = needle.toLowerCase();
+  const typed = nameWords(needle);
+  /** @type {Map<string, {name: string, score: number, reason: string, keywordAt: number}>} */
+  const byName = new Map();
+  for (const r of results) {
+    byName.set(r.name, {
+      name: r.name,
+      score: r.score,
+      reason: r.reason,
+      keywordAt: r.keywordAt ?? Infinity,
+    });
+  }
+  // The typed words are a name's words (`chat-messages` is `ChatMessage`):
+  // that name is meant, ahead of every rule below.
+  const joined = typed.join('');
+  for (const name of allNames) {
+    if (joined && nameWords(name).join('') === joined) {
+      byName.set(name, {
+        name,
+        score: SAME_WORDS_SCORE,
+        reason: 'same name',
+        keywordAt: -1,
+      });
+    }
+  }
+  for (const name of synonyms) {
+    if (!allNames.includes(name)) continue;
+    const prior = byName.get(name);
+    if (!prior || prior.score < SYNONYM_SCORE) {
+      byName.set(name, {
+        name,
+        score: SYNONYM_SCORE,
+        reason: 'another name for it',
+        keywordAt: Infinity,
+      });
+    }
+  }
+  for (const name of allNames) {
+    const match = compoundMatch(typed, name);
+    if (!match) continue;
+    const prior = byName.get(name);
+    if (!prior || match.score > prior.score) {
+      byName.set(name, {
+        name,
+        score: match.score,
+        reason: match.reason,
+        keywordAt: Infinity,
+      });
+    }
+  }
+  /** @param {string} name */
+  const lead = name => {
+    const lower = name.toLowerCase();
+    let i = 0;
+    while (i < term.length && i < lower.length && term[i] === lower[i]) i++;
+    return i / Math.max(term.length, lower.length);
+  };
+  /**
+   * How many typed words the name carries, whole or as a word's start; the
+   * last typed word, the one a compound name is a kind of (`PlaceInput` is an
+   * input), counts a little more.
+   */
+  const shared = (/** @type {string} */ name) => {
+    const words = nameWords(name);
+    const has = (/** @type {string} */ t) =>
+      words.some(
+        w =>
+          w === t ||
+          (Math.min(w.length, t.length) >= 3 &&
+            (w.startsWith(t) || t.startsWith(w))),
+      );
+    const count = typed.filter(has).length;
+    return typed.length > 1 && has(typed[typed.length - 1])
+      ? count + 0.5
+      : count;
+  };
+  return [...byName.values()]
+    .map(r => ({
+      ...r,
+      synonym: synonyms.has(r.name) ? 1 : 0,
+      shared: shared(r.name),
+      distance: levenshteinDistance(term, r.name.toLowerCase()),
+      lead: lead(r.name),
+    }))
+    .sort(
+      (a, b) =>
+        b.score - a.score ||
+        b.synonym - a.synonym ||
+        b.shared - a.shared ||
+        a.keywordAt - b.keywordAt ||
+        a.distance - b.distance ||
+        b.lead - a.lead ||
+        a.name.localeCompare(b.name),
+    )
+    .map(({name, score, reason}) => ({name, score, reason}));
+}

package/foundation/text/suggest-order.test.mjs

@@ -0,0 +1,259 @@
+// Copyright (c) Meta Platforms, Inc. and affiliates.
+
+import {describe, expect, it} from 'vitest';
+import {
+  nameWords,
+  orderByAffinity,
+  orderRouteSuggestions,
+  rankComponentSuggestions,
+  synonymMatches,
+} from './suggest-order.mjs';
+
+describe('nameWords', () => {
+  it('reads every spelling of a name as the same words', () => {
+    expect(nameWords('DropdownMenuItems')).toEqual([
+      'dropdown',
+      'menu',
+      'item',
+    ]);
+    expect(nameWords('dropdown-menu-item')).toEqual([
+      'dropdown',
+      'menu',
+      'item',
+    ]);
+    expect(nameWords('Dropdown Menu Item')).toEqual([
+      'dropdown',
+      'menu',
+      'item',
+    ]);
+    expect(nameWords('cli/api_HTMLParser')).toEqual([
+      'cli',
+      'api',
+      'html',
+      'parser',
+    ]);
+  });
+
+  it('keeps short words and double-s endings', () => {
+    expect(nameWords('Gas')).toEqual(['gas']);
+    expect(nameWords('Glass')).toEqual(['glass']);
+  });
+});
+
+describe('orderByAffinity', () => {
+  const names = (/** @type {string[]} */ list, /** @type {string} */ typed) =>
+    orderByAffinity(typed, list, n => [n]);
+
+  it('puts the same words first, then every typed word, then some', () => {
+    expect(
+      names(
+        ['zeta-panel', 'wide-panel-grid', 'panel-grid', 'grid-panel-x'],
+        'PanelGrid',
+      ),
+    ).toEqual(['panel-grid', 'wide-panel-grid', 'grid-panel-x', 'zeta-panel']);
+  });
+
+  it('matches a title as well as an id', () => {
+    const items = [
+      {id: 'alpha', title: 'Something Else'},
+      {id: 'beta', title: 'Wave Editor'},
+    ];
+    expect(
+      orderByAffinity('Wave Editor', items, i => [i.id, i.title]).map(
+        i => i.id,
+      ),
+    ).toEqual(['beta', 'alpha']);
+  });
+
+  it('keeps the original order between equal matches and never changes the list', () => {
+    const list = ['c', 'b', 'a', 'route/b-thing', 'route/a-thing'];
+    const out = names(list, 'thing');
+    expect(out).toEqual(['route/b-thing', 'route/a-thing', 'c', 'b', 'a']);
+    expect([...out].sort()).toEqual([...list].sort());
+  });
+
+  it('ranks a route by its words', () => {
+    expect(
+      names(
+        ['basics/basics-color', 'basics/basics-size', 'basics/basics-usage'],
+        'basics/usage',
+      ),
+    ).toEqual([
+      'basics/basics-usage',
+      'basics/basics-color',
+      'basics/basics-size',
+    ]);
+  });
+});
+
+describe('rankComponentSuggestions', () => {
+  const all = [
+    'Zebra',
+    'Picker',
+    'MultiPicker',
+    'PickerOption',
+    'Gadget',
+    'SideRailItem',
+    'Sheet',
+  ];
+
+  it('breaks a tie by where the typed name sits in the keywords', () => {
+    const results = [
+      {name: 'MultiPicker', score: 90, reason: 'keyword', keywordAt: 3},
+      {name: 'Picker', score: 90, reason: 'keyword', keywordAt: 0},
+      {name: 'Gadget', score: 90, reason: 'keyword', keywordAt: 5},
+    ];
+    expect(
+      rankComponentSuggestions('Pick', results, all).map(r => r.name),
+    ).toEqual(['Picker', 'MultiPicker', 'Gadget']);
+  });
+
+  it('breaks a remaining tie by edit distance, not by the alphabet', () => {
+    const results = [
+      {name: 'Gadget', score: 70, reason: 'keyword'},
+      {name: 'Sheet', score: 70, reason: 'keyword'},
+    ];
+    expect(
+      rankComponentSuggestions('Sheets', results, all).map(r => r.name),
+    ).toEqual(['Sheet', 'Gadget']);
+  });
+
+  it('finds the family part named with other words', () => {
+    const results = [{name: 'Picker', score: 70, reason: 'keyword'}];
+    expect(rankComponentSuggestions('PickerItem', results, all)[0].name).toBe(
+      'PickerOption',
+    );
+  });
+
+  it('finds the part named without its first word', () => {
+    expect(rankComponentSuggestions('RailItem', [], all)[0].name).toBe(
+      'SideRailItem',
+    );
+  });
+
+  it('finds the family of a part that is not its own component', () => {
+    expect(rankComponentSuggestions('SheetFooter', [], all)[0].name).toBe(
+      'Sheet',
+    );
+  });
+
+  it('puts a name with exactly the typed words first, ahead of every rule', () => {
+    const results = [{name: 'Picker', score: 80, reason: 'similar name'}];
+    const ranked = rankComponentSuggestions(
+      'pickers',
+      results,
+      all,
+      new Set(['Gadget']),
+    );
+    expect(ranked[0].name).toBe('Picker');
+    expect(rankComponentSuggestions('side-rail-item', [], all)[0].name).toBe(
+      'SideRailItem',
+    );
+  });
+
+  it('names a family only for a structural part', () => {
+    expect(
+      rankComponentSuggestions('SheetMusic', [], all).map(r => r.name),
+    ).not.toContain('Sheet');
+  });
+
+  it('does not let a lifted entry borrow a weaker keyword position', () => {
+    const results = [
+      {name: 'Picker', score: 90, reason: 'keyword', keywordAt: 2},
+      {name: 'MultiPicker', score: 70, reason: 'keyword', keywordAt: 0},
+    ];
+    const ranked = rankComponentSuggestions(
+      'Pick',
+      results,
+      all,
+      new Set(['Picker', 'MultiPicker']),
+    );
+    expect(ranked.map(r => r.name).slice(0, 2)).toEqual([
+      'Picker',
+      'MultiPicker',
+    ]);
+  });
+
+  it('never lowers a score search gave', () => {
+    const results = [{name: 'Picker', score: 100, reason: 'exact name'}];
+    const ranked = rankComponentSuggestions('PickerItem', results, all);
+    expect(ranked[0]).toEqual({
+      name: 'Picker',
+      score: 100,
+      reason: 'exact name',
+    });
+  });
+
+  it('suggests only catalog names', () => {
+    const ranked = rankComponentSuggestions('PickerWidgetItem', [], all);
+    for (const r of ranked) expect(all).toContain(r.name);
+  });
+});
+
+describe('synonymMatches', () => {
+  const cards = {
+    Picker: {synonyms: ['choice box', 'Acme ChoiceBox', 'MUI Choice Field']},
+    Sheet: {synonyms: ['side sheet', 'choice']},
+  };
+
+  it('matches a synonym in any spelling, without a leading library name', () => {
+    expect([...synonymMatches('ChoiceField', cards)]).toEqual(['Picker']);
+    expect([...synonymMatches('choice-box', cards)]).toEqual(['Picker']);
+    expect([...synonymMatches('SideSheets', cards)]).toEqual(['Sheet']);
+    expect([...synonymMatches('MUI Choice Field', cards)]).toEqual(['Picker']);
+  });
+
+  it('needs every word to match', () => {
+    expect([...synonymMatches('Side', cards)]).toEqual([]);
+    expect([...synonymMatches('', cards)]).toEqual([]);
+  });
+
+  it('puts a synonym match first among equal scores, and only real names', () => {
+    const all = ['Gadget', 'Picker'];
+    const results = [
+      {name: 'Gadget', score: 90, reason: 'keyword', keywordAt: 0},
+    ];
+    const ranked = rankComponentSuggestions(
+      'ChoiceField',
+      results,
+      all,
+      new Set(['Picker', 'NotInCatalog']),
+    );
+    expect(ranked.map(r => r.name)).toEqual(['Picker', 'Gadget']);
+  });
+});
+
+describe('orderRouteSuggestions', () => {
+  const kids = [
+    'guide/start',
+    'guide/building-blocks',
+    'guide/ship',
+    'guide/help',
+  ].map(name => ({name}));
+  const names = (/** @type {{name: string}[]} */ list) => list.map(s => s.name);
+
+  it('keeps tree order when no child matches, at any depth', () => {
+    expect(names(orderRouteSuggestions('guide/theme', kids))).toEqual(
+      names(kids),
+    );
+    expect(names(orderRouteSuggestions('guide/theme/colors', kids))).toEqual(
+      names(kids),
+    );
+  });
+
+  it('puts the child the route names first', () => {
+    expect(names(orderRouteSuggestions('guide/ship-it', kids))[0]).toBe(
+      'guide/ship',
+    );
+    expect(names(orderRouteSuggestions('guide/help/extra', kids))[0]).toBe(
+      'guide/help',
+    );
+  });
+
+  it('compares whole routes when the suggestions share no namespace', () => {
+    const roots = [{name: 'cli'}, {name: 'guide'}, {name: 'theme'}];
+    expect(names(orderRouteSuggestions('theme/quick-start', roots))[0]).toBe(
+      'theme',
+    );
+  });
+});

package/foundation/xle/browser-imports.test.mjs

@@ -0,0 +1,74 @@
+// Copyright (c) Meta Platforms, Inc. and affiliates.
+
+/**
+ * `@astryxdesign/cli/xle` (browser.mjs) runs in browsers: nothing it imports,
+ * directly or through other modules, may load a Node built-in.
+ */
+
+import {describe, expect, it} from 'vitest';
+import * as fs from 'node:fs';
+import * as path from 'node:path';
+
+const ENTRY = path.join(import.meta.dirname, 'browser.mjs');
+
+/** Every module specifier a file imports or re-exports, static or dynamic. */
+const SPECIFIER =
+  /(?:\bimport\s*(?:[\w*{}\s,$]+\s*from\s*)?|\bexport\s*[\w*{}\s,$]+\s*from\s*|\bimport\s*\(\s*)['"]([^'"]+)['"]/gu;
+
+/**
+ * The files `entry` reaches through relative imports, with the bare and
+ * `node:` specifiers each one names.
+ * @param {string} entry
+ * @returns {Map<string, string[]>}
+ */
+function importGraph(entry) {
+  /** @type {Map<string, string[]>} */
+  const graph = new Map();
+  const queue = [entry];
+  while (queue.length > 0) {
+    const file = /** @type {string} */ (queue.pop());
+    if (graph.has(file)) continue;
+    // Comments hold JSDoc type imports (`import('./x').T`), which load nothing.
+    const source = fs
+      .readFileSync(file, 'utf8')
+      .replace(/\/\*[\s\S]*?\*\//gu, '')
+      .replace(/^\s*\/\/.*$/gmu, '');
+    /** @type {string[]} */
+    const external = [];
+    for (const [, spec] of source.matchAll(SPECIFIER)) {
+      if (spec.startsWith('.')) {
+        queue.push(path.resolve(path.dirname(file), spec));
+      } else {
+        external.push(spec);
+      }
+    }
+    graph.set(file, external);
+  }
+  return graph;
+}
+
+describe('the xle browser export', () => {
+  it('reaches no Node built-in and no AsyncLocalStorage', () => {
+    const graph = importGraph(ENTRY);
+    // The walk reaches the parser, validator and expander.
+    expect(graph.size).toBeGreaterThan(3);
+    const builtins = [...graph].flatMap(([file, specs]) =>
+      specs
+        .filter(
+          spec =>
+            spec.startsWith('node:') ||
+            /^(?:fs|path|os|child_process|async_hooks|url)$/u.test(spec),
+        )
+        .map(
+          spec => `${path.relative(import.meta.dirname, file)} imports ${spec}`,
+        ),
+    );
+    expect(builtins).toEqual([]);
+    const storage = [...graph.keys()]
+      .filter(file =>
+        fs.readFileSync(file, 'utf8').includes('AsyncLocalStorage'),
+      )
+      .map(file => path.relative(import.meta.dirname, file));
+    expect(storage).toEqual([]);
+  });
+});