|
| 1 | +// Paths branch softly through the screen, |
| 2 | +// A quiet tree of changed designs; |
| 3 | +// Each leaf remembers what has been, |
| 4 | +// And waits where careful light aligns. |
| 5 | + |
| 6 | +export type FileTreeItem = { |
| 7 | + readonly file: string |
| 8 | +} |
| 9 | + |
| 10 | +export type FileTreeNode = { |
| 11 | + readonly id: number |
| 12 | + readonly name: string |
| 13 | + readonly parent: number | undefined |
| 14 | + readonly children: number[] |
| 15 | + readonly depth: number |
| 16 | + readonly kind: "directory" | "file" |
| 17 | + readonly fileIndex?: number |
| 18 | +} |
| 19 | + |
| 20 | +export type FileTree = { |
| 21 | + readonly roots: number[] |
| 22 | + readonly nodes: FileTreeNode[] |
| 23 | +} |
| 24 | + |
| 25 | +export type FileTreeRow = { |
| 26 | + readonly id: number |
| 27 | + readonly depth: number |
| 28 | + readonly kind: "directory" | "file" |
| 29 | + readonly name: string |
| 30 | + readonly fileIndex?: number |
| 31 | +} |
| 32 | + |
| 33 | +export function buildFileTree(files: readonly FileTreeItem[]): FileTree { |
| 34 | + const roots: number[] = [] |
| 35 | + const nodes: FileTreeNode[] = [] |
| 36 | + const directoryByPath = new Map<string, number>() |
| 37 | + |
| 38 | + files.forEach((file, fileIndex) => { |
| 39 | + const segments = file.file.split("/").filter(Boolean) |
| 40 | + if (segments.length === 0) return |
| 41 | + |
| 42 | + const parent = segments.slice(0, -1).reduce( |
| 43 | + (state, segment) => { |
| 44 | + const directoryPath = state.path ? `${state.path}/${segment}` : segment |
| 45 | + const existing = directoryByPath.get(directoryPath) |
| 46 | + if (existing !== undefined) return { id: existing, path: directoryPath, depth: state.depth + 1 } |
| 47 | + |
| 48 | + const id = addFileTreeNode(nodes, roots, { |
| 49 | + name: segment, |
| 50 | + parent: state.id, |
| 51 | + depth: state.depth, |
| 52 | + kind: "directory", |
| 53 | + }) |
| 54 | + directoryByPath.set(directoryPath, id) |
| 55 | + return { id, path: directoryPath, depth: state.depth + 1 } |
| 56 | + }, |
| 57 | + { id: undefined as number | undefined, path: "", depth: 0 }, |
| 58 | + ) |
| 59 | + |
| 60 | + addFileTreeNode(nodes, roots, { |
| 61 | + name: segments[segments.length - 1]!, |
| 62 | + parent: parent.id, |
| 63 | + depth: parent.depth, |
| 64 | + kind: "file", |
| 65 | + fileIndex, |
| 66 | + }) |
| 67 | + }) |
| 68 | + |
| 69 | + const tree = { roots, nodes } |
| 70 | + tree.roots.sort((left, right) => compareFileTreeNodes(tree, left, right)) |
| 71 | + tree.nodes.forEach((node) => node.children.sort((left, right) => compareFileTreeNodes(tree, left, right))) |
| 72 | + return tree |
| 73 | +} |
| 74 | + |
| 75 | +export function flattenFileTree(tree: FileTree, expanded?: ReadonlySet<number>): FileTreeRow[] { |
| 76 | + const rows: FileTreeRow[] = [] |
| 77 | + const visit = (id: number) => { |
| 78 | + const node = tree.nodes[id]! |
| 79 | + rows.push({ |
| 80 | + id: node.id, |
| 81 | + depth: node.depth, |
| 82 | + kind: node.kind, |
| 83 | + name: node.name, |
| 84 | + fileIndex: node.fileIndex, |
| 85 | + }) |
| 86 | + if (node.kind === "directory" && (!expanded || expanded.has(node.id))) node.children.forEach(visit) |
| 87 | + } |
| 88 | + tree.roots.forEach(visit) |
| 89 | + return rows |
| 90 | +} |
| 91 | + |
| 92 | +export function compareFileTreeNodes(tree: FileTree, left: number, right: number) { |
| 93 | + const leftNode = tree.nodes[left]! |
| 94 | + const rightNode = tree.nodes[right]! |
| 95 | + if (leftNode.kind !== rightNode.kind) return leftNode.kind === "directory" ? -1 : 1 |
| 96 | + if (leftNode.name < rightNode.name) return -1 |
| 97 | + if (leftNode.name > rightNode.name) return 1 |
| 98 | + return left - right |
| 99 | +} |
| 100 | + |
| 101 | +export function moveFileTreeSelection(rows: readonly FileTreeRow[], selected: number | undefined, offset: number) { |
| 102 | + if (rows.length === 0) return undefined |
| 103 | + const index = selected === undefined ? -1 : rows.findIndex((row) => row.id === selected) |
| 104 | + if (index === -1) return rows[0]!.id |
| 105 | + return rows[Math.max(0, Math.min(rows.length - 1, index + offset))]!.id |
| 106 | +} |
| 107 | + |
| 108 | +export function moveFileTreeSelectionToFile( |
| 109 | + rows: readonly FileTreeRow[], |
| 110 | + selected: number | undefined, |
| 111 | + offset: number, |
| 112 | +) { |
| 113 | + const fileRows = rows.filter((row) => row.fileIndex !== undefined) |
| 114 | + if (fileRows.length === 0) return undefined |
| 115 | + const selectedIndex = selected === undefined ? -1 : rows.findIndex((row) => row.id === selected) |
| 116 | + if (selectedIndex === -1) return offset < 0 ? fileRows[fileRows.length - 1]!.id : fileRows[0]!.id |
| 117 | + const next = |
| 118 | + offset < 0 |
| 119 | + ? fileRows.findLast((row) => rows.findIndex((item) => item.id === row.id) < selectedIndex) |
| 120 | + : fileRows.find((row) => rows.findIndex((item) => item.id === row.id) > selectedIndex) |
| 121 | + return next?.id ?? (offset < 0 ? fileRows[0]!.id : fileRows[fileRows.length - 1]!.id) |
| 122 | +} |
| 123 | + |
| 124 | +export function allExpandedFileTreeDirectories(tree: FileTree) { |
| 125 | + return new Set(tree.nodes.filter((node) => node.kind === "directory").map((node) => node.id)) |
| 126 | +} |
| 127 | + |
| 128 | +export function toggleFileTreeDirectory(tree: FileTree, expanded: ReadonlySet<number>, selected: number | undefined) { |
| 129 | + if (selected === undefined || tree.nodes[selected]?.kind !== "directory") return expanded |
| 130 | + const next = new Set(expanded) |
| 131 | + if (next.has(selected)) next.delete(selected) |
| 132 | + else next.add(selected) |
| 133 | + return next |
| 134 | +} |
| 135 | + |
| 136 | +export function setFileTreeDirectoryExpanded( |
| 137 | + tree: FileTree, |
| 138 | + expanded: ReadonlySet<number>, |
| 139 | + selected: number | undefined, |
| 140 | + value: boolean, |
| 141 | +) { |
| 142 | + if (selected === undefined || tree.nodes[selected]?.kind !== "directory") return expanded |
| 143 | + const next = new Set(expanded) |
| 144 | + if (value) next.add(selected) |
| 145 | + else next.delete(selected) |
| 146 | + return next |
| 147 | +} |
| 148 | + |
| 149 | +function addFileTreeNode(nodes: FileTreeNode[], roots: number[], input: Omit<FileTreeNode, "id" | "children">) { |
| 150 | + const id = nodes.length |
| 151 | + nodes.push({ ...input, id, children: [] }) |
| 152 | + if (input.parent === undefined) roots.push(id) |
| 153 | + else nodes[input.parent]!.children.push(id) |
| 154 | + return id |
| 155 | +} |
0 commit comments