polen 0.9.1-next.1 → 0.10.0-next.10

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/debug/debug.ts

@@ -1,120 +0,0 @@
-import { Arr, Str } from '@wollybeard/kit'
-import { colorize } from 'consola/utils'
-import { inspect } from 'node:util'
-import { calcIsEnabledFromEnv } from './environment-variable.ts'
-
-type DebugParameters = [event: string, payload?: unknown]
-
-export interface Debug {
-  (...args: DebugParameters): void
-  toggle: (isEnabled: boolean) => void
-  sub: (subNamespace: string | string[]) => Debug
-}
-
-interface State {
-  isEnabled: boolean
-}
-
-// todo:
-// const Option = {
-//   else:
-//     <alternative>(alternative: alternative) => <value>(value: value): value extends undefined ? alternative : value => {
-//       if (value === undefined || value === null) {
-//         return alternative as any
-//       }
-//       return value as any
-//     },
-// }
-
-// const namespaceToString = (namespace: string[] = []): string => {
-//   return formatNamespaceSegment(namespace.join(`_`))
-//   // todo:
-//   // const x = Option.else([] as string[])
-//   // const y = x(namespace)
-//   // const z = Fn.pipe(
-//   //   namespace,
-//   //   x,
-//   //   // Option.else([]),
-//   //   // (_) => Array.is(_) ? _ : [],
-//   //   // Str.joinWith(`_`),
-//   //   // Str.Case.upper,
-//   // )
-// }
-
-const formatNamespaceSegment = (segment: string): string => {
-  return Str.Case.snake(segment).toUpperCase()
-}
-
-export const create = (namespaceInput?: string | string[], initialState?: State): Debug => {
-  const namespace = Arr.sure(namespaceInput ?? [])
-  const isDebugEnabledFromEnv = calcIsEnabledFromEnv(process.env, namespace)
-
-  const state: State = initialState ?? {
-    isEnabled: isDebugEnabledFromEnv,
-  }
-
-  const debug: Debug = (...args) => {
-    const isPayloadPassed = args.length === 2
-    const [event, payload] = args
-
-    if (state.isEnabled) {
-      // If a payload is an array then default depth to 1 so that we see its _contents_
-      const isPayloadArray = Array.isArray(payload)
-      const depthBoost = isPayloadArray ? 1 : 0
-      const defaultDepth = 3
-      const debugDepth = parseNumberOr(process.env[`DEBUG_DEPTH`], defaultDepth) + depthBoost
-      const isPayloadDisabled = debugDepth < 0
-
-      const payloadRendered = isPayloadPassed && !isPayloadDisabled
-        ? inspect(payload, {
-          colors: true,
-          depth: debugDepth,
-          // compact: true,
-          maxStringLength: 1000,
-        })
-        : ``
-
-      const formatNamespaceSegmentAnsi = (segment: string): string => {
-        return colorize(`bold`, colorize(`bgYellowBright`, ` ` + formatNamespaceSegment(segment) + ` `))
-      }
-
-      const namespaceRendered = namespace.map(formatNamespaceSegmentAnsi).join(` `)
-      const eventRendered = colorize(
-        `bold`,
-        colorize(
-          `bgMagentaBright`,
-          ` ` + formatNamespaceSegment(event) + ` `,
-        ),
-      )
-      const prefixRendered = `${namespaceRendered} ${eventRendered}`
-
-      console.debug(prefixRendered, payloadRendered)
-    }
-  }
-
-  debug.toggle = (isEnabled: boolean) => {
-    state.isEnabled = isEnabled
-  }
-
-  debug.sub = (subNamespace: string | string[]) => {
-    const s = Arr.sure(subNamespace)
-    const stateCopy = structuredClone(state)
-    return create([...namespace, ...s], stateCopy)
-  }
-
-  return debug
-}
-
-const parseNumberOr = (str: string | undefined, defaultValue: number): number => {
-  if (str === ``) return defaultValue
-
-  const parsed = Number(str)
-  if (Number.isNaN(parsed)) {
-    return defaultValue
-  }
-  return parsed
-}
-
-// initialize root debug
-
-export const debugGlobal = create()

package/src/lib/debug/environment-variable.ts

@@ -1,56 +0,0 @@
-import { Arr, Language } from '@wollybeard/kit'
-
-export const enVarName = `DEBUG`
-
-export const deliminator = `,`
-export const wildcard = `*`
-export const enVarEnabledValuesStatic = [`true`, wildcard, `1`]
-
-export const calcIsEnabledFromEnv = (
-  enVars: Record<string, unknown>,
-  namespace?: string[],
-): boolean => {
-  const namespace_ = namespace?.map(_ => _.toLowerCase())
-
-  const includeFilters = typeof enVars[enVarName] === `string`
-    ? enVars[enVarName]
-      .trim()
-      .toLowerCase()
-      .split(deliminator)
-      .map(patternExpression => {
-        return patternExpression
-          .trim()
-          .split(`:`)
-          .map(_ => _.trim())
-      })
-    : undefined
-
-  if (!includeFilters) return false
-
-  if (includeFilters.length === 0) return false
-
-  // If any is like * then it means "enable everything"
-  if (
-    includeFilters.some(includeFilter => {
-      if (includeFilter.length === 1 && enVarEnabledValuesStatic.includes(includeFilter[0]!)) return true
-    })
-  ) return true
-
-  // At this point, if there is no namespace (e.g. root), then we cannot match anything
-  if (!namespace_) return false
-
-  for (const includeFilter of includeFilters) {
-    if (Arr.getLast(includeFilter) !== wildcard) {
-      return includeFilter.join() === namespace_.join()
-    }
-
-    let i = 0
-    for (const segment of includeFilter) {
-      if (segment === wildcard) return true
-      if (segment !== namespace_[i]) return false
-      i++
-    }
-  }
-
-  Language.never()
-}

package/src/lib/debug/index.ts

@@ -1 +0,0 @@
-export * as Debug from './debug.ts'

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"
-  })
-})