polen 0.10.0-next.4 → 0.10.0-next.6

package/build/lib/tree/tree.js

@@ -1,134 +0,0 @@
-/**
- * Generic tree data structure and utilities
- */
-/**
- * Create a new tree node
- */
-export const node = (value, children = []) => ({
-    value,
-    children,
-});
-/**
- * Map over a tree, transforming each node's value
- */
-export const map = (tree, mapper, depth = 0, path = []) => {
-    const newPath = [...path, tree.value];
-    return {
-        value: mapper(tree.value, depth, path),
-        children: tree.children.map(child => map(child, mapper, depth + 1, newPath)),
-    };
-};
-/**
- * Visit each node in the tree (depth-first)
- */
-export const visit = (tree, visitor, depth = 0, path = []) => {
-    visitor(tree, depth, path);
-    const newPath = [...path, tree.value];
-    tree.children.forEach(child => visit(child, visitor, depth + 1, newPath));
-};
-/**
- * Find a node in the tree
- */
-export const find = (tree, predicate, depth = 0, path = []) => {
-    if (predicate(tree.value, depth, path)) {
-        return tree;
-    }
-    const newPath = [...path, tree.value];
-    for (const child of tree.children) {
-        const found = find(child, predicate, depth + 1, newPath);
-        if (found)
-            return found;
-    }
-    return undefined;
-};
-/**
- * Filter tree nodes (keeps structure, removes non-matching nodes)
- */
-export const filter = (tree, predicate, depth = 0, path = []) => {
-    const newPath = [...path, tree.value];
-    const filteredChildren = tree.children
-        .map(child => filter(child, predicate, depth + 1, newPath))
-        .filter((child) => child !== undefined);
-    // Keep node if it matches or has matching children
-    if (predicate(tree.value, depth, path) || filteredChildren.length > 0) {
-        return {
-            value: tree.value,
-            children: filteredChildren,
-        };
-    }
-    return undefined;
-};
-/**
- * Sort a tree's children at each level
- */
-export const sort = (tree, compareFn) => ({
-    value: tree.value,
-    children: tree.children
-        .map(child => sort(child, compareFn))
-        .sort((a, b) => compareFn(a.value, b.value)),
-});
-/**
- * Flatten a tree into an array (depth-first)
- */
-export const flatten = (tree) => {
-    const result = [tree.value];
-    tree.children.forEach(child => {
-        result.push(...flatten(child));
-    });
-    return result;
-};
-/**
- * Get the depth of the tree
- */
-export const depth = (tree) => {
-    if (tree.children.length === 0)
-        return 0;
-    return 1 + Math.max(...tree.children.map(depth));
-};
-/**
- * Count total nodes in the tree
- */
-export const count = (tree) => {
-    return 1 + tree.children.reduce((sum, child) => sum + count(child), 0);
-};
-/**
- * Check if a node is a leaf (has no children)
- */
-export const isLeaf = (node) => {
-    return node.children.length === 0;
-};
-/**
- * Get all leaf nodes
- */
-export const leaves = (tree) => {
-    if (isLeaf(tree))
-        return [tree];
-    return tree.children.flatMap(leaves);
-};
-/**
- * Build a tree from a flat list with parent references
- */
-export const fromList = (items, rootId) => {
-    const itemMap = new Map(items.map(item => [item.id, item]));
-    const roots = [];
-    const nodeMap = new Map();
-    // Create all nodes
-    items.forEach(item => {
-        nodeMap.set(item.id, node(item));
-    });
-    // Build hierarchy
-    items.forEach(item => {
-        const itemNode = nodeMap.get(item.id);
-        if (item.parentId === rootId) {
-            roots.push(itemNode);
-        }
-        else if (item.parentId) {
-            const parent = nodeMap.get(item.parentId);
-            if (parent) {
-                parent.children.push(itemNode);
-            }
-        }
-    });
-    return roots;
-};
-//# sourceMappingURL=tree.js.map

package/build/lib/tree/tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tree.js","sourceRoot":"","sources":["../../../src/lib/tree/tree.ts"],"names":[],"mappings":"AAAA;;GAEG;AAaH;;GAEG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAI,KAAQ,EAAE,WAA0B,EAAE,EAAe,EAAE,CAAC,CAAC;IAC/E,KAAK;IACL,QAAQ;CACT,CAAC,CAAA;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CACjB,IAAiB,EACjB,MAAwB,EACxB,KAAK,GAAG,CAAC,EACT,OAAY,EAAE,EACD,EAAE;IACf,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;IACrC,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC;QACtC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;KAC7E,CAAA;AACH,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CACnB,IAAiB,EACjB,OAAuB,EACvB,KAAK,GAAG,CAAC,EACT,OAAY,EAAE,EACR,EAAE;IACR,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAA;IAC1B,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;IACrC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,CAAA;AAC3E,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,IAAiB,EACjB,SAA2B,EAC3B,KAAK,GAAG,CAAC,EACT,OAAY,EAAE,EACW,EAAE;IAC3B,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QACvC,OAAO,IAAI,CAAA;IACb,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;IACrC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,CAAA;QACxD,IAAI,KAAK;YAAE,OAAO,KAAK,CAAA;IACzB,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CACpB,IAAiB,EACjB,SAA2B,EAC3B,KAAK,GAAG,CAAC,EACT,OAAY,EAAE,EACW,EAAE;IAC3B,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;IACrC,MAAM,gBAAgB,GAAG,IAAI,CAAC,QAAQ;SACnC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;SAC1D,MAAM,CAAC,CAAC,KAAK,EAAwB,EAAE,CAAC,KAAK,KAAK,SAAS,CAAC,CAAA;IAE/D,mDAAmD;IACnD,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtE,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,gBAAgB;SAC3B,CAAA;IACH,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,IAAiB,EACjB,SAAiC,EACpB,EAAE,CAAC,CAAC;IACjB,KAAK,EAAE,IAAI,CAAC,KAAK;IACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACpB,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;SACpC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;CAC/C,CAAC,CAAA;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAI,IAAiB,EAAO,EAAE;IACnD,MAAM,MAAM,GAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAChC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAA;IAChC,CAAC,CAAC,CAAA;IACF,OAAO,MAAM,CAAA;AACf,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAI,IAAiB,EAAU,EAAE;IACpD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IACxC,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;AAClD,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAI,IAAiB,EAAU,EAAE;IACpD,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;AACxE,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAI,IAAiB,EAAW,EAAE;IACtD,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAA;AACnC,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAI,IAAiB,EAAiB,EAAE;IAC5D,IAAI,MAAM,CAAC,IAAI,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,CAAA;IAC/B,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;AACtC,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,KAAU,EACV,MAAe,EACA,EAAE;IACjB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAA;IAC3D,MAAM,KAAK,GAAkB,EAAE,CAAA;IAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAA;IAE9C,mBAAmB;IACnB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACnB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;IAClC,CAAC,CAAC,CAAA;IAEF,kBAAkB;IAClB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACnB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAA;QACtC,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QACtB,CAAC;aAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YACzC,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YAChC,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAA;IAEF,OAAO,KAAK,CAAA;AACd,CAAC,CAAA"}

package/src/lib/file-router/scan-tree.test.ts

@@ -1,189 +0,0 @@
-import { Tree } from '#lib/tree/index'
-import { describe, expect, test } from 'vitest'
-import type { RouteTreeNode } from './scan-tree.ts'
-
-// Helper to create a mock route tree structure for testing
-const mockRouteTree = (structure: Record<string, any>): RouteTreeNode => {
-  const sortNodes = (nodes: RouteTreeNode[]): RouteTreeNode[] => {
-    return nodes.sort((a, b) => {
-      // If both have orders, sort by order
-      if (a.value.order !== undefined && b.value.order !== undefined) {
-        return a.value.order - b.value.order
-      }
-      // If only one has order, it comes first
-      if (a.value.order !== undefined) return -1
-      if (b.value.order !== undefined) return 1
-      // Otherwise sort alphabetically
-      return a.value.name.localeCompare(b.value.name)
-    })
-  }
-
-  const buildNode = (name: string, value: any): RouteTreeNode => {
-    const parsed = name.match(/^(?<order>\d+)[_-](?<name>.+)$/)
-    const nodeName = parsed?.groups?.[`name`] ?? name
-    const order = parsed?.groups?.[`order`] ? parseInt(parsed.groups[`order`], 10) : undefined
-
-    if (typeof value === 'object' && !value.isFile) {
-      // Directory node
-      const children = Object.entries(value).map(([childName, childValue]) => buildNode(childName, childValue))
-      return Tree.node(
-        { name: nodeName, order, type: 'directory' },
-        sortNodes(children),
-      )
-    } else {
-      // File node - strip extension (but keep 'index' as is)
-      const nameWithoutExtension = nodeName.replace(/\.(md|mdx)$/, '')
-      return Tree.node({ name: nameWithoutExtension, order, type: 'file', route: value })
-    }
-  }
-
-  const children = Object.entries(structure).map(([name, value]) => buildNode(name, value))
-  return Tree.node(
-    { name: 'root', type: 'directory' },
-    sortNodes(children),
-  )
-}
-
-describe('scan-tree structure', () => {
-  test('builds tree from flat file structure', () => {
-    const tree = mockRouteTree({
-      'getting-started.md': { isFile: true },
-      'guide': {
-        'introduction.md': { isFile: true },
-        'basics.md': { isFile: true },
-      },
-      'api': {
-        'reference.md': { isFile: true },
-      },
-    })
-
-    expect(tree.value.name).toBe('root')
-    expect(tree.children).toHaveLength(3)
-
-    const guide = tree.children.find(c => c.value.name === 'guide')
-    expect(guide).toBeDefined()
-    expect(guide!.children).toHaveLength(2)
-  })
-
-  test('handles numbered prefixes on files', () => {
-    const tree = mockRouteTree({
-      '10_getting-started.md': { isFile: true },
-      '20_configuration.md': { isFile: true },
-      '30_advanced.md': { isFile: true },
-    })
-
-    const children = tree.children
-    expect(children[0]!.value).toMatchObject({ name: 'getting-started', order: 10 })
-    expect(children[1]!.value).toMatchObject({ name: 'configuration', order: 20 })
-    expect(children[2]!.value).toMatchObject({ name: 'advanced', order: 30 })
-  })
-
-  test('handles numbered prefixes on directories', () => {
-    const tree = mockRouteTree({
-      '10_guide': {
-        'intro.md': { isFile: true },
-      },
-      '20_api': {
-        'reference.md': { isFile: true },
-      },
-      '05_quickstart': {
-        'index.md': { isFile: true },
-      },
-    })
-
-    const children = tree.children
-    expect(children[0]!.value).toMatchObject({ name: 'quickstart', order: 5 })
-    expect(children[1]!.value).toMatchObject({ name: 'guide', order: 10 })
-    expect(children[2]!.value).toMatchObject({ name: 'api', order: 20 })
-  })
-
-  test('handles mixed numbered and non-numbered items', () => {
-    const tree = mockRouteTree({
-      '10_guide': {
-        'intro.md': { isFile: true },
-      },
-      'troubleshooting': {
-        'common.md': { isFile: true },
-      },
-      '05_quickstart': {
-        'index.md': { isFile: true },
-      },
-      'api': {
-        'reference.md': { isFile: true },
-      },
-    })
-
-    // After sorting: numbered items first (5, 10), then alphabetical (api, troubleshooting)
-    const childNames = tree.children.map(c => c.value.name)
-    expect(childNames).toEqual(['quickstart', 'guide', 'api', 'troubleshooting'])
-  })
-
-  test('handles nested numbered prefixes', () => {
-    const tree = mockRouteTree({
-      '10_guide': {
-        '10_getting-started.md': { isFile: true },
-        '20_basics.md': { isFile: true },
-        'troubleshooting.md': { isFile: true },
-        '05_prerequisites.md': { isFile: true },
-      },
-    })
-
-    const guide = tree.children[0]!
-    expect(guide.value.name).toBe('guide')
-
-    const guideChildNames = guide.children.map(c => c.value.name)
-    expect(guideChildNames).toEqual(['prerequisites', 'getting-started', 'basics', 'troubleshooting'])
-  })
-
-  test('handles index files', () => {
-    const tree = mockRouteTree({
-      'guide': {
-        'index.md': { isFile: true },
-        'intro.md': { isFile: true },
-      },
-    })
-
-    const guide = tree.children[0]!
-    expect(guide.children).toHaveLength(2)
-    expect(guide.children.map(c => c.value.name)).toContain('index')
-    expect(guide.children.map(c => c.value.name)).toContain('intro')
-  })
-
-  test('creates directory nodes with correct type', () => {
-    const tree = mockRouteTree({
-      '10_guide': {
-        'intro.md': { isFile: true },
-      },
-      'api-reference.md': { isFile: true },
-    })
-
-    expect(tree.value.type).toBe('directory')
-
-    const guide = tree.children.find(c => c.value.name === 'guide')
-    expect(guide?.value.type).toBe('directory')
-    expect(guide?.value.order).toBe(10)
-
-    const apiRef = tree.children.find(c => c.value.name === 'api-reference')
-    expect(apiRef?.value.type).toBe('file')
-  })
-
-  test('handles file collisions with same order number - last wins', () => {
-    // This test simulates what would happen if the scanner processes files in order
-    // The mock doesn't actually test the scanner logic but documents expected behavior
-    const tree = mockRouteTree({
-      '10_about.md': { isFile: true, processedFirst: true },
-      '10-about.md': { isFile: true, processedLast: true }, // Same order, same logical name
-    })
-
-    // In the real scanner, only one 'about' node would exist
-    // The test structure above would result in duplicate nodes in our mock
-    // Document the expected behavior: last processed file should win
-    const aboutNodes = tree.children.filter(c => c.value.name === 'about')
-
-    // Note: This mock creates duplicates; real scanner would replace
-    expect(aboutNodes.length).toBeGreaterThan(0)
-
-    // Document that when orders are equal, last file processed wins
-    // This aligns with the linter message about "file processed later is being kept"
-  })
-})

package/src/lib/file-router/scan-tree.ts

@@ -1,205 +0,0 @@
-import { TinyGlobby } from '#dep/tiny-globby/index'
-import { Tree, type TreeNode } from '#lib/tree/index'
-import { Path, Str } from '@wollybeard/kit'
-import type { Diagnostic } from './linter.ts'
-import type { Route, RouteFile } from './route.ts'
-
-//
-// Types
-//
-
-export type RouteTreeNodeType = 'directory' | 'file'
-
-export interface RouteTreeNodeValue {
-  name: string
-  order?: number
-  type: RouteTreeNodeType
-  route?: Route // Only present for file nodes
-}
-
-export type RouteTreeNode = TreeNode<RouteTreeNodeValue>
-
-export interface ScanTreeResult {
-  routeTree: RouteTreeNode
-  diagnostics: Diagnostic[]
-}
-
-//
-// Constants
-//
-
-const conventions = {
-  index: {
-    name: `index`,
-  },
-  numberedPrefix: {
-    pattern: Str.pattern<{ groups: ['order', 'name'] }>(/^(?<order>\d+)[_-](?<name>.+)$/),
-  },
-}
-
-//
-// Helpers
-//
-
-const parseSegment = (segment: string): { name: string; order?: number } => {
-  const match = Str.match(segment, conventions.numberedPrefix.pattern)
-  if (match) {
-    return {
-      name: match.groups.name,
-      order: parseInt(match.groups.order, 10),
-    }
-  }
-  return { name: segment }
-}
-
-const buildRouteTreeFromPaths = async (paths: string[], rootDir: string): Promise<RouteTreeNode> => {
-  // Root node (represents the pages directory itself)
-  const root = Tree.node<RouteTreeNodeValue>({
-    name: 'root',
-    type: 'directory',
-  })
-
-  // Process each file path
-  for (const filePath of paths) {
-    const relativePath = Path.relative(rootDir, filePath)
-
-    // Split the path into segments
-    const segments = relativePath.split(Path.sep).filter(s => s.length > 0)
-    if (segments.length === 0) continue // Skip root directory
-
-    // Navigate/create path in tree
-    let currentNode = root
-
-    for (let i = 0; i < segments.length; i++) {
-      const segment = segments[i]!
-      const isLast = i === segments.length - 1
-
-      // Parse segment for ordering
-      let segmentName = segment
-      // Strip extension for files
-      if (isLast && (segment.endsWith('.md') || segment.endsWith('.mdx'))) {
-        segmentName = segment.replace(/\.(md|mdx)$/, '')
-      }
-      const parsed = parseSegment(segmentName)
-
-      // Find existing child
-      const existingChildIndex = currentNode.children.findIndex(child => child.value.name === parsed.name)
-      let childNode = existingChildIndex >= 0 ? currentNode.children[existingChildIndex] : undefined
-
-      if (!childNode) {
-        // Create new node
-        if (isLast) {
-          // This is a file
-          const route = filePathToRoute(filePath, rootDir)
-          childNode = Tree.node<RouteTreeNodeValue>({
-            name: parsed.name,
-            order: parsed.order,
-            type: 'file',
-            route,
-          })
-        } else {
-          // This is a directory (implicit from file path)
-          childNode = Tree.node<RouteTreeNodeValue>({
-            name: parsed.name,
-            order: parsed.order,
-            type: 'directory',
-          })
-        }
-        currentNode.children.push(childNode)
-      } else if (isLast && childNode.value.type === 'file') {
-        // Handle collision for files with same name
-        // If new file has higher or equal order, replace the existing one (last wins for ties)
-        if (
-          parsed.order !== undefined
-          && (childNode.value.order === undefined || parsed.order >= childNode.value.order)
-        ) {
-          const route = filePathToRoute(filePath, rootDir)
-          const newNode = Tree.node<RouteTreeNodeValue>({
-            name: parsed.name,
-            order: parsed.order,
-            type: 'file',
-            route,
-          })
-          currentNode.children[existingChildIndex] = newNode
-          childNode = newNode
-        }
-        // Otherwise keep the existing node (when existing has higher order)
-      }
-
-      currentNode = childNode
-    }
-  }
-
-  // Sort the tree
-  return sortRouteTree(root)
-}
-
-const sortRouteTree = (tree: RouteTreeNode): RouteTreeNode => {
-  return Tree.sort(tree, (a, b) => {
-    // If both have orders, sort by order
-    if (a.order !== undefined && b.order !== undefined) {
-      return a.order - b.order
-    }
-    // If only one has order, it comes first
-    if (a.order !== undefined) return -1
-    if (b.order !== undefined) return 1
-    // Otherwise sort alphabetically
-    return a.name.localeCompare(b.name)
-  })
-}
-
-//
-// Main scan function
-//
-
-export const scanTree = async (parameters: {
-  dir: string
-  glob?: string
-}): Promise<ScanTreeResult> => {
-  const { dir, glob = `**/*` } = parameters
-
-  // Get all files
-  const filePaths = await TinyGlobby.glob(glob, {
-    absolute: true,
-    cwd: dir,
-    onlyFiles: true,
-  })
-
-  // Build tree structure (directories will be created implicitly)
-  const routeTree = await buildRouteTreeFromPaths(filePaths, dir)
-
-  // TODO: Implement tree-based linting
-  const diagnostics: Diagnostic[] = []
-
-  return {
-    routeTree,
-    diagnostics,
-  }
-}
-
-// Reuse existing route creation logic
-const filePathToRoute = (filePathExpression: string, rootDir: string): Route => {
-  const file: RouteFile = {
-    path: {
-      absolute: Path.parse(filePathExpression),
-      relative: Path.parse(Path.relative(rootDir, filePathExpression)),
-    },
-  }
-
-  const dirPath = Str.split(Str.removeSurrounding(file.path.relative.dir, Path.sep), Path.sep)
-
-  // Parse numbered prefix from filename
-  const prefixMatch = file.path.relative.name.match(conventions.numberedPrefix.pattern)
-  const order = prefixMatch?.groups?.[`order`] ? parseInt(prefixMatch.groups[`order`], 10) : undefined
-  const nameWithoutPrefix = prefixMatch?.groups?.[`name`] ?? file.path.relative.name
-
-  const logical = {
-    path: nameWithoutPrefix === conventions.index.name ? dirPath : dirPath.concat(nameWithoutPrefix),
-    order,
-  }
-
-  return {
-    logical,
-    file,
-  }
-}

package/src/lib/file-router/sidebar/index.ts

@@ -1,3 +0,0 @@
-export * as SidebarTree from './sidebar-tree.ts'
-// Re-export SidebarTree as Sidebar for backward compatibility
-export * as Sidebar from './sidebar-tree.ts'

package/src/lib/file-router/sidebar/sidebar-tree.test.ts

@@ -1,123 +0,0 @@
-import { Tree } from '#lib/tree/index'
-import { describe, expect, test } from 'vitest'
-import type { RouteTreeNode, RouteTreeNodeValue } from '../scan-tree.ts'
-import { buildFromTree } from './sidebar-tree.ts'
-
-// Helper to create mock routes
-const mockRoute = (path: string[]) => ({
-  logical: { path },
-  file: {
-    path: {
-      absolute: { root: '/', dir: '/', base: 'file.md', ext: '.md', name: 'file' },
-      relative: { root: '', dir: '', base: 'file.md', ext: '.md', name: 'file' },
-    },
-  },
-})
-
-// Helper to create file node
-const fileNode = (name: string, route: any): RouteTreeNode =>
-  Tree.node<RouteTreeNodeValue>({ name, type: 'file', route })
-
-// Helper to create directory node
-const dirNode = (name: string, children: RouteTreeNode[] = []): RouteTreeNode =>
-  Tree.node<RouteTreeNodeValue>({ name, type: 'directory' }, children)
-
-describe('sidebar-tree', () => {
-  test('builds sidebar from simple tree', () => {
-    const tree = dirNode('root', [
-      fileNode('getting-started', mockRoute(['getting-started'])),
-      dirNode('guide', [
-        fileNode('introduction', mockRoute(['guide', 'introduction'])),
-        fileNode('basics', mockRoute(['guide', 'basics'])),
-      ]),
-    ])
-
-    const sidebar = buildFromTree(tree, [])
-
-    expect(sidebar.items).toHaveLength(2)
-    expect(sidebar.items[0]).toMatchObject({
-      type: 'ItemLink',
-      pathExp: 'getting-started',
-      title: 'Getting Started',
-    })
-    const section = sidebar.items[1]
-    expect(section).toBeDefined()
-    expect(section!.type).toBe('ItemSection')
-    if (section!.type === 'ItemSection') {
-      expect(section).toMatchObject({
-        type: 'ItemSection',
-        title: 'Guide',
-        pathExp: 'guide',
-        isLinkToo: false,
-      })
-      expect(section!.links).toHaveLength(2)
-    }
-  })
-
-  test('handles index files correctly', () => {
-    const tree = dirNode('root', [
-      dirNode('guide', [
-        fileNode('index', mockRoute(['guide'])),
-        fileNode('introduction', mockRoute(['guide', 'introduction'])),
-      ]),
-    ])
-
-    const sidebar = buildFromTree(tree, [])
-
-    expect(sidebar.items).toHaveLength(1)
-    const section = sidebar.items[0]
-    expect(section).toBeDefined()
-    expect(section!.type).toBe('ItemSection')
-    if (section!.type === 'ItemSection') {
-      expect(section).toMatchObject({
-        type: 'ItemSection',
-        title: 'Guide',
-        pathExp: 'guide',
-        isLinkToo: true, // Should be true because of index file
-      })
-      expect(section!.links).toHaveLength(1) // Only introduction, not index
-    }
-  })
-
-  test('respects node ordering from tree', () => {
-    const tree = dirNode('root', [
-      Tree.node<RouteTreeNodeValue>({ name: 'quickstart', order: 5, type: 'file', route: mockRoute(['quickstart']) }),
-      Tree.node<RouteTreeNodeValue>({ name: 'guide', order: 10, type: 'file', route: mockRoute(['guide']) }),
-      fileNode('api', mockRoute(['api'])),
-      fileNode('troubleshooting', mockRoute(['troubleshooting'])),
-    ])
-
-    const sidebar = buildFromTree(tree, [])
-
-    // Tree should already be sorted, so sidebar should maintain that order
-    const titles = sidebar.items.map(item => item.title)
-    expect(titles).toEqual(['Quickstart', 'Guide', 'Api', 'Troubleshooting'])
-  })
-
-  test('handles nested directories', () => {
-    const tree = dirNode('root', [
-      dirNode('guide', [
-        fileNode('intro', mockRoute(['guide', 'intro'])),
-        dirNode('advanced', [
-          fileNode('performance', mockRoute(['guide', 'advanced', 'performance'])),
-          fileNode('optimization', mockRoute(['guide', 'advanced', 'optimization'])),
-        ]),
-      ]),
-    ])
-
-    const sidebar = buildFromTree(tree, [])
-
-    expect(sidebar.items).toHaveLength(1)
-    const guideSection = sidebar.items[0]
-    expect(guideSection).toBeDefined()
-    expect(guideSection!.type).toBe('ItemSection')
-    if (guideSection!.type === 'ItemSection') {
-      expect(guideSection!.links).toHaveLength(3) // intro + 2 from advanced subdirectory
-
-      const navTitles = guideSection!.links.map(nav => nav.title)
-      expect(navTitles).toContain('Intro')
-      expect(navTitles).toContain('Performance')
-      expect(navTitles).toContain('Optimization')
-    }
-  })
-})