polen 0.9.1-next.2 → 0.10.0-next.11

package/build/lib/file-router/sidebar/sidebar-tree.d.ts

@@ -1,9 +0,0 @@
-import * as FileRouter from '../file-router.ts';
-import type { RouteTreeNode } from '../scan-tree.ts';
-import type { Sidebar } from './types.ts';
-export * from './types.ts';
-/**
- * Build sidebar from tree structure
- */
-export declare const buildFromTree: (routeTree: RouteTreeNode, basePath: FileRouter.Path) => Sidebar;
-//# sourceMappingURL=sidebar-tree.d.ts.map

package/build/lib/file-router/sidebar/sidebar-tree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sidebar-tree.d.ts","sourceRoot":"","sources":["../../../../src/lib/file-router/sidebar/sidebar-tree.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,UAAU,MAAM,mBAAmB,CAAA;AAC/C,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AACpD,OAAO,KAAK,EAAyB,OAAO,EAAE,MAAM,YAAY,CAAA;AAEhE,cAAc,YAAY,CAAA;AAE1B;;GAEG;AACH,eAAO,MAAM,aAAa,GAAI,WAAW,aAAa,EAAE,UAAU,UAAU,CAAC,IAAI,KAAG,OAcnF,CAAA"}

package/build/lib/file-router/sidebar/sidebar-tree.js

@@ -1,85 +0,0 @@
-import { Tree } from '#lib/tree/index';
-import { Str } from '@wollybeard/kit';
-import * as FileRouter from "../file-router.js";
-export * from "./types.js";
-/**
- * Build sidebar from tree structure
- */
-export const buildFromTree = (routeTree, basePath) => {
-    const links = [];
-    const sections = [];
-    // Process only the children of the root node
-    for (const child of routeTree.children) {
-        processNode(child, basePath, [], links, sections);
-    }
-    const items = [...links, ...sections];
-    return {
-        items,
-    };
-};
-const processNode = (node, basePath, parentPath, links, sections) => {
-    const currentPath = [...parentPath, node.value.name];
-    if (node.value.type === 'directory') {
-        // This is a directory - create a section
-        const sectionPath = [...basePath, ...currentPath];
-        const sectionPathExp = FileRouter.pathToExpression(sectionPath);
-        const sectionTitle = Str.titlizeSlug(node.value.name);
-        const section = {
-            type: `ItemSection`,
-            title: sectionTitle,
-            pathExp: sectionPathExp.startsWith('/') ? sectionPathExp.slice(1) : sectionPathExp,
-            isLinkToo: false,
-            links: [],
-        };
-        // Check if this directory has an index file
-        const indexChild = node.children.find(child => child.value.type === 'file' && child.value.name === 'index');
-        if (indexChild) {
-            section.isLinkToo = true;
-        }
-        // Process all non-index children as links for this section
-        for (const child of node.children) {
-            if (child.value.type === 'file' && child.value.name !== 'index' && child.value.route) {
-                // Pass the parent path of the route, not the section path
-                const routeParentPath = child.value.route.logical.path.slice(0, -1);
-                section.links.push(routeToItemLink(child.value.route, routeParentPath));
-            }
-            else if (child.value.type === 'directory') {
-                // Recursively process subdirectories
-                // Note: This creates nested sections which the original implementation doesn't support
-                // For now, we'll just add the files from subdirectories to the parent section
-                collectFilesFromDirectory(child, child.value.route?.logical.path || [], section.links);
-            }
-        }
-        sections.push(section);
-    }
-    else if (node.value.type === 'file' && node.value.route) {
-        // This is a top-level file - add as nav
-        if (node.value.name !== 'index') {
-            links.push(routeToItemLink(node.value.route, basePath));
-        }
-    }
-};
-const collectFilesFromDirectory = (node, basePath, links) => {
-    Tree.visit(node, (n) => {
-        if (n.value.type === 'file' && n.value.route && n.value.name !== 'index') {
-            // Use the route's parent path for relative title generation
-            const routeParentPath = n.value.route.logical.path.slice(0, -1);
-            links.push(routeToItemLink(n.value.route, routeParentPath));
-        }
-    });
-};
-const routeToItemLink = (route, basePath) => {
-    const pagePathExp = FileRouter.routeToPathExpression(route);
-    const pageRelative = FileRouter.makeRelativeUnsafe(route, basePath);
-    const pageRelativePathExp = FileRouter.routeToPathExpression(pageRelative);
-    // Remove leading slash for title generation
-    const titlePath = pageRelativePathExp.startsWith('/') ? pageRelativePathExp.slice(1) : pageRelativePathExp;
-    // Use only the last segment for the title
-    const titleSegment = pageRelative.logical.path[pageRelative.logical.path.length - 1] || titlePath;
-    return {
-        type: `ItemLink`,
-        pathExp: pagePathExp.startsWith('/') ? pagePathExp.slice(1) : pagePathExp,
-        title: Str.titlizeSlug(titleSegment),
-    };
-};
-//# sourceMappingURL=sidebar-tree.js.map

package/build/lib/file-router/sidebar/sidebar-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sidebar-tree.js","sourceRoot":"","sources":["../../../../src/lib/file-router/sidebar/sidebar-tree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAA;AACtC,OAAO,EAAE,GAAG,EAAE,MAAM,iBAAiB,CAAA;AACrC,OAAO,KAAK,UAAU,MAAM,mBAAmB,CAAA;AAI/C,cAAc,YAAY,CAAA;AAE1B;;GAEG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,SAAwB,EAAE,QAAyB,EAAW,EAAE;IAC5F,MAAM,KAAK,GAAe,EAAE,CAAA;IAC5B,MAAM,QAAQ,GAAkB,EAAE,CAAA;IAElC,6CAA6C;IAC7C,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;QACvC,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAA;IACnD,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,QAAQ,CAAC,CAAA;IAErC,OAAO;QACL,KAAK;KACN,CAAA;AACH,CAAC,CAAA;AAED,MAAM,WAAW,GAAG,CAClB,IAAmB,EACnB,QAAyB,EACzB,UAAoB,EACpB,KAAiB,EACjB,QAAuB,EACjB,EAAE;IACR,MAAM,WAAW,GAAG,CAAC,GAAG,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;IAEpD,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACpC,yCAAyC;QACzC,MAAM,WAAW,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,WAAW,CAAC,CAAA;QACjD,MAAM,cAAc,GAAG,UAAU,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAA;QAC/D,MAAM,YAAY,GAAG,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAErD,MAAM,OAAO,GAAgB;YAC3B,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,YAAY;YACnB,OAAO,EAAE,cAAc,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;YAClF,SAAS,EAAE,KAAK;YAChB,KAAK,EAAE,EAAE;SACV,CAAA;QAED,4CAA4C;QAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,CAAA;QAC3G,IAAI,UAAU,EAAE,CAAC;YACf,OAAO,CAAC,SAAS,GAAG,IAAI,CAAA;QAC1B,CAAC;QAED,2DAA2D;QAC3D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;gBACrF,0DAA0D;gBAC1D,MAAM,eAAe,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;gBACnE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC,CAAA;YACzE,CAAC;iBAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBAC5C,qCAAqC;gBACrC,uFAAuF;gBACvF,8EAA8E;gBAC9E,yBAAyB,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,IAAI,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,CAAA;YACxF,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACxB,CAAC;SAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1D,wCAAwC;QACxC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAChC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAA;QACzD,CAAC;IACH,CAAC;AACH,CAAC,CAAA;AAED,MAAM,yBAAyB,GAAG,CAChC,IAAmB,EACnB,QAAyB,EACzB,KAAiB,EACX,EAAE;IACR,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;QACrB,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACzE,4DAA4D;YAC5D,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;YAC/D,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC,CAAA;QAC7D,CAAC;IACH,CAAC,CAAC,CAAA;AACJ,CAAC,CAAA;AAED,MAAM,eAAe,GAAG,CAAC,KAAuB,EAAE,QAAyB,EAAY,EAAE;IACvF,MAAM,WAAW,GAAG,UAAU,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAA;IAC3D,MAAM,YAAY,GAAG,UAAU,CAAC,kBAAkB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;IACnE,MAAM,mBAAmB,GAAG,UAAU,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAA;IAE1E,4CAA4C;IAC5C,MAAM,SAAS,GAAG,mBAAmB,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAA;IAE1G,0CAA0C;IAC1C,MAAM,YAAY,GAAG,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,SAAS,CAAA;IAEjG,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,OAAO,EAAE,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW;QACzE,KAAK,EAAE,GAAG,CAAC,WAAW,CAAC,YAAY,CAAC;KACrC,CAAA;AACH,CAAC,CAAA"}

package/build/lib/file-router/sidebar/types.d.ts

@@ -1,17 +0,0 @@
-export interface Sidebar {
-    items: Item[];
-}
-export type Item = ItemLink | ItemSection;
-export interface ItemLink {
-    type: `ItemLink`;
-    title: string;
-    pathExp: string;
-}
-export interface ItemSection {
-    type: `ItemSection`;
-    title: string;
-    pathExp: string;
-    isLinkToo: boolean;
-    links: ItemLink[];
-}
-//# sourceMappingURL=types.d.ts.map

package/build/lib/file-router/sidebar/types.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/lib/file-router/sidebar/types.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,OAAO;IACtB,KAAK,EAAE,IAAI,EAAE,CAAA;CACd;AAED,MAAM,MAAM,IAAI,GAAG,QAAQ,GAAG,WAAW,CAAA;AAEzC,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,UAAU,CAAA;IAChB,KAAK,EAAE,MAAM,CAAA;IACb,OAAO,EAAE,MAAM,CAAA;CAChB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,aAAa,CAAA;IACnB,KAAK,EAAE,MAAM,CAAA;IACb,OAAO,EAAE,MAAM,CAAA;IACf,SAAS,EAAE,OAAO,CAAA;IAClB,KAAK,EAAE,QAAQ,EAAE,CAAA;CAClB"}

package/build/lib/file-router/sidebar/types.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=types.js.map

package/build/lib/file-router/sidebar/types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/lib/file-router/sidebar/types.ts"],"names":[],"mappings":""}

package/build/lib/tree/index.d.ts

@@ -1,3 +0,0 @@
-export * as Tree from './tree.ts';
-export type { TreeMapper, TreeNode, TreePredicate, TreeVisitor } from './tree.ts';
-//# sourceMappingURL=index.d.ts.map

package/build/lib/tree/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/lib/tree/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AACjC,YAAY,EAAE,UAAU,EAAE,QAAQ,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,WAAW,CAAA"}

package/build/lib/tree/index.js

@@ -1,2 +0,0 @@
-export * as Tree from "./tree.js";
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/lib/tree/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA"}

package/build/lib/tree/tree.d.ts

@@ -1,62 +0,0 @@
-/**
- * Generic tree data structure and utilities
- */
-export interface TreeNode<T> {
-    value: T;
-    children: TreeNode<T>[];
-}
-export type TreeVisitor<T, R = void> = (node: TreeNode<T>, depth: number, path: T[]) => R;
-export type TreeMapper<T, U> = (value: T, depth: number, path: T[]) => U;
-export type TreePredicate<T> = (value: T, depth: number, path: T[]) => boolean;
-/**
- * Create a new tree node
- */
-export declare const node: <T>(value: T, children?: TreeNode<T>[]) => TreeNode<T>;
-/**
- * Map over a tree, transforming each node's value
- */
-export declare const map: <T, U>(tree: TreeNode<T>, mapper: TreeMapper<T, U>, depth?: number, path?: T[]) => TreeNode<U>;
-/**
- * Visit each node in the tree (depth-first)
- */
-export declare const visit: <T>(tree: TreeNode<T>, visitor: TreeVisitor<T>, depth?: number, path?: T[]) => void;
-/**
- * Find a node in the tree
- */
-export declare const find: <T>(tree: TreeNode<T>, predicate: TreePredicate<T>, depth?: number, path?: T[]) => TreeNode<T> | undefined;
-/**
- * Filter tree nodes (keeps structure, removes non-matching nodes)
- */
-export declare const filter: <T>(tree: TreeNode<T>, predicate: TreePredicate<T>, depth?: number, path?: T[]) => TreeNode<T> | undefined;
-/**
- * Sort a tree's children at each level
- */
-export declare const sort: <T>(tree: TreeNode<T>, compareFn: (a: T, b: T) => number) => TreeNode<T>;
-/**
- * Flatten a tree into an array (depth-first)
- */
-export declare const flatten: <T>(tree: TreeNode<T>) => T[];
-/**
- * Get the depth of the tree
- */
-export declare const depth: <T>(tree: TreeNode<T>) => number;
-/**
- * Count total nodes in the tree
- */
-export declare const count: <T>(tree: TreeNode<T>) => number;
-/**
- * Check if a node is a leaf (has no children)
- */
-export declare const isLeaf: <T>(node: TreeNode<T>) => boolean;
-/**
- * Get all leaf nodes
- */
-export declare const leaves: <T>(tree: TreeNode<T>) => TreeNode<T>[];
-/**
- * Build a tree from a flat list with parent references
- */
-export declare const fromList: <T extends {
-    id: string;
-    parentId?: string;
-}>(items: T[], rootId?: string) => TreeNode<T>[];
-//# sourceMappingURL=tree.d.ts.map

package/build/lib/tree/tree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"tree.d.ts","sourceRoot":"","sources":["../../../src/lib/tree/tree.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,MAAM,WAAW,QAAQ,CAAC,CAAC;IACzB,KAAK,EAAE,CAAC,CAAA;IACR,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAA;CACxB;AAED,MAAM,MAAM,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;AAEzF,MAAM,MAAM,UAAU,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;AAExE,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,OAAO,CAAA;AAE9E;;GAEG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,OAAO,CAAC,EAAE,WAAU,QAAQ,CAAC,CAAC,CAAC,EAAO,KAAG,QAAQ,CAAC,CAAC,CAGzE,CAAA;AAEF;;GAEG;AACH,eAAO,MAAM,GAAG,GAAI,CAAC,EAAE,CAAC,EACtB,MAAM,QAAQ,CAAC,CAAC,CAAC,EACjB,QAAQ,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EACxB,cAAS,EACT,OAAM,CAAC,EAAO,KACb,QAAQ,CAAC,CAAC,CAMZ,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,KAAK,GAAI,CAAC,EACrB,MAAM,QAAQ,CAAC,CAAC,CAAC,EACjB,SAAS,WAAW,CAAC,CAAC,CAAC,EACvB,cAAS,EACT,OAAM,CAAC,EAAO,KACb,IAIF,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EACpB,MAAM,QAAQ,CAAC,CAAC,CAAC,EACjB,WAAW,aAAa,CAAC,CAAC,CAAC,EAC3B,cAAS,EACT,OAAM,CAAC,EAAO,KACb,QAAQ,CAAC,CAAC,CAAC,GAAG,SAUhB,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,MAAM,GAAI,CAAC,EACtB,MAAM,QAAQ,CAAC,CAAC,CAAC,EACjB,WAAW,aAAa,CAAC,CAAC,CAAC,EAC3B,cAAS,EACT,OAAM,CAAC,EAAO,KACb,QAAQ,CAAC,CAAC,CAAC,GAAG,SAehB,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EACpB,MAAM,QAAQ,CAAC,CAAC,CAAC,EACjB,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,KAChC,QAAQ,CAAC,CAAC,CAKX,CAAA;AAEF;;GAEG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC,KAAG,CAAC,EAM/C,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,KAAK,GAAI,CAAC,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC,KAAG,MAG5C,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,KAAK,GAAI,CAAC,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC,KAAG,MAE5C,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,MAAM,GAAI,CAAC,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC,KAAG,OAE7C,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,MAAM,GAAI,CAAC,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC,KAAG,QAAQ,CAAC,CAAC,CAAC,EAGxD,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,SAAS;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,EAClE,OAAO,CAAC,EAAE,EACV,SAAS,MAAM,KACd,QAAQ,CAAC,CAAC,CAAC,EAwBb,CAAA"}

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