|
| 1 | +package org.encalmo.utils |
| 2 | + |
| 3 | +import java.nio.file.{Path, Paths} |
| 4 | + |
| 5 | +import scala.annotation.tailrec |
| 6 | + |
| 7 | +trait FileTree { |
| 8 | + |
| 9 | + type Node = (Int, String) |
| 10 | + type Tree = List[Node] |
| 11 | + |
| 12 | + val middleNode = "├── " |
| 13 | + val endNode = "└── " |
| 14 | + val link = "│ " |
| 15 | + val space = " " * link.length |
| 16 | + |
| 17 | + private val root = Paths.get("/") |
| 18 | + |
| 19 | + def sort(paths: Seq[Path]): Seq[Path] = |
| 20 | + paths.sortWith((pl, pr) => comparePaths(pl, pr, 0)) |
| 21 | + |
| 22 | + def compute(paths: Seq[Path]): Tree = { |
| 23 | + |
| 24 | + def leafs(prefix: Path, p2: Path): Tree = |
| 25 | + (0 until p2.getNameCount).toList |
| 26 | + .map(i => (i + prefix.getNameCount, p2.getName(i).toString)) |
| 27 | + |
| 28 | + sort(paths) |
| 29 | + .foldLeft((List.empty[Node], Option.empty[Path])) { case ((tree, prevPathOpt), path) => |
| 30 | + ( |
| 31 | + prevPathOpt |
| 32 | + .map { prevPath => |
| 33 | + val (prefix, _, outstandingPath) = commonPrefix(root, prevPath, path) |
| 34 | + tree ::: leafs(prefix, outstandingPath) |
| 35 | + } |
| 36 | + .getOrElse(leafs(root, path)), |
| 37 | + Some(path) |
| 38 | + ) |
| 39 | + } |
| 40 | + ._1 |
| 41 | + } |
| 42 | + |
| 43 | + def draw(pathsTree: Tree): String = { |
| 44 | + |
| 45 | + def drawLine(node: String, label: String, marks: List[Int]): (String, List[Int]) = |
| 46 | + ((0 until marks.max).map(i => if (marks.contains(i)) link else space).mkString + node + label, marks) |
| 47 | + |
| 48 | + def draw2(label: String, ls: (List[Int], String)): (String, List[Int]) = |
| 49 | + ((0 until ls._1.max).map(i => if (ls._1.contains(i)) link else space).mkString + ls._2 + label, ls._1) |
| 50 | + |
| 51 | + def append(lineWithMarks: (String, List[Int]), result: String): (String, List[Int]) = |
| 52 | + (trimRight(lineWithMarks._1) + "\n" + result, lineWithMarks._2) |
| 53 | + |
| 54 | + pathsTree.reverse |
| 55 | + .foldLeft(("", List.empty[Int])) { case ((result, marks), (offset, label)) => |
| 56 | + marks match { |
| 57 | + case Nil => drawLine(endNode, label, offset :: Nil) |
| 58 | + case head :: tail => |
| 59 | + append( |
| 60 | + if (offset == head) drawLine(middleNode, label, marks) |
| 61 | + else if (offset < head) |
| 62 | + draw2( |
| 63 | + label, |
| 64 | + tail match { |
| 65 | + case Nil => (offset :: Nil, endNode) |
| 66 | + case x :: _ if x == offset => (tail, middleNode) |
| 67 | + case _ => (offset :: tail, endNode) |
| 68 | + } |
| 69 | + ) |
| 70 | + else { |
| 71 | + val l1 = drawLine(endNode, label, offset :: marks) |
| 72 | + val l2 = drawLine(space, "", offset :: marks) |
| 73 | + (l1._1 + "\n" + l2._1, l1._2) |
| 74 | + }, |
| 75 | + result |
| 76 | + ) |
| 77 | + } |
| 78 | + } |
| 79 | + ._1 |
| 80 | + } |
| 81 | + |
| 82 | + @tailrec |
| 83 | + final def comparePaths(path1: Path, path2: Path, i: Int): Boolean = { |
| 84 | + val c = path1.getName(i).toString.compareToIgnoreCase(path2.getName(i).toString) |
| 85 | + val pc1 = path1.getNameCount |
| 86 | + val pc2 = path2.getNameCount |
| 87 | + if (pc1 - 1 == i || pc2 - 1 == i) { |
| 88 | + if (c != 0) c < 0 else pc1 < pc2 |
| 89 | + } else { |
| 90 | + if (c != 0) c < 0 else comparePaths(path1, path2, i + 1) |
| 91 | + } |
| 92 | + } |
| 93 | + |
| 94 | + @tailrec |
| 95 | + final def commonPrefix(prefix: Path, path1: Path, path2: Path): (Path, Path, Path) = |
| 96 | + if (path1.getNameCount > 0 && path2.getNameCount > 0) { |
| 97 | + if (path1.getName(0) != path2.getName(0)) (prefix, path1, path2) |
| 98 | + else |
| 99 | + commonPrefix( |
| 100 | + prefix.resolve(path1.subpath(0, 1)), |
| 101 | + if (path1.getNameCount == 1) path1 else path1.subpath(1, path1.getNameCount), |
| 102 | + if (path2.getNameCount == 1) path2 else path2.subpath(1, path2.getNameCount) |
| 103 | + ) |
| 104 | + } else (prefix, path1, path2) |
| 105 | + |
| 106 | + def trimRight(string: String): String = string.reverse.dropWhile(_ == ' ').reverse |
| 107 | +} |
| 108 | + |
| 109 | +object FileTree extends FileTree |
0 commit comments