Skip to content

⚡ Bolt: Optimize FileTree construction #213

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ScottMorris wants to merge 1 commit into
base: main
Choose a base branch
from
Open

⚡ Bolt: Optimize FileTree construction #213

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
45 changes: 26 additions & 19 deletions apps/desktop/src/components/FileTree.tsx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -194,36 +194,43 @@ export function FileTree({

const tree = useMemo(() => {
const root: DisplayNode[] = [];
const pathMap = new Map<string, DisplayNode>();

files.forEach(entry => {
const parts = entry.path.split("/");
let currentLevel = root;
for (const entry of files) {
const parts = entry.path.split('/');
let currentPath = '';
let parentNode: DisplayNode | undefined;

parts.forEach((part, index) => {
const isLast = index === parts.length - 1;
const isDir = isLast ? entry.is_dir : true;
for (let i = 0; i < parts.length; i++) {
const part = parts[i];
currentPath = i === 0 ? part : `${currentPath}/${part}`;

let existing = currentLevel.find(node => node.name === part);
let node = pathMap.get(currentPath);

if (!existing) {
existing = {
if (!node) {
const isLast = i === parts.length - 1;
const isDir = isLast ? entry.is_dir : true;

node = {
name: part,
path: entry.path,
path: currentPath,
isDir: isDir,
children: isDir ? [] : undefined,
};
if (!isLast) {
existing.path = parts.slice(0, index + 1).join("/");
}
pathMap.set(currentPath, node);

currentLevel.push(existing);
if (i === 0) {
root.push(node);
} else {
if (parentNode && parentNode.children) {
parentNode.children.push(node);
}
}
}

if (isDir && existing.children) {
currentLevel = existing.children as DisplayNode[];
}
});
});
parentNode = node;
}
}

const sortNodes = (nodes: DisplayNode[]) => {
nodes.sort((a, b) => {
Expand Down