Function computeCommonPrefix

website/src/lib/parser.worker.ts:495–513

* Compute the longest common directory prefix of all queued file paths. * e.g. ["/home/user/proj/src/a.ts", "/home/user/proj/lib/b.ts"] * → "/home/user/proj"

(paths: string[])

 *   → "/home/user/proj"
 */
function computeCommonPrefix(paths: string[]): string {
  if (paths.length === 0) return '';
  const dirs = paths.map(p => {
    const norm = p.replace(/\\/g, '/');
    return norm.substring(0, norm.lastIndexOf('/'));
  });
  const first = dirs[0].split('/');
  let common = first;
  for (let i = 1; i < dirs.length; i++) {
    const parts = dirs[i].split('/');
    const newCommon: string[] = [];
    for (let j = 0; j < Math.min(common.length, parts.length); j++) {
      if (common[j] === parts[j]) newCommon.push(common[j]);
      else break;
    }
    common = newCommon;
  }
  return common.join('/');
}

/**
 * Lazily create (or return cached) Folder nodes for the repo-relative segments only.