Implemented bit mask to memorize last used levels to beautify Dree ou…

…tput (#7)

* print ascii changed

* bitmask memorisation added for clean dree output

* update .gitigore;make clean

.gitignore

@@ -1,2 +1,3 @@
 /compile/main
-.vscode
+.vscode
+obj

src/controller/DirectoryGraph.cpp

@@ -9,14 +9,14 @@ bool DirectoryGraph::isDirectory(const string &pathStr)
     return filesystem::is_directory(path);
 }
 
-DirectoryNode *DirectoryGraph::BuildGraph(const string &directoryName, int depth)
+DirectoryNode *DirectoryGraph::BuildGraph(const string &directoryName, long long depth)
 {
     DirectoryNode *graph = new DirectoryNode(directoryName);
     TraverseDirectoriesDFS(graph, depth, 0);
     return graph;
 }
 
-void DirectoryGraph::TraverseDirectoriesDFS(DirectoryNode *node, int depth, int currentDepth)
+void DirectoryGraph::TraverseDirectoriesDFS(DirectoryNode *node, long long depth, long long currentDepth)
 {
     if (currentDepth > depth)
         return;
@@ -40,19 +40,33 @@ void DirectoryGraph::TraverseDirectoriesDFS(DirectoryNode *node, int depth, int
     }
 }
 
-void DirectoryGraph::PrintGraph(DirectoryNode *node, int depth, int currentDepth)
+void DirectoryGraph::PrintGraph(DirectoryNode *node, long long depth, long long currentDepth, bool isLastChild, long long mask)
 {
     if (currentDepth == depth)
         return;
 
-    for (int i = 0; i < currentDepth * depth; ++i)
-        cout << " ";
-    cout << "└── ";
+    for (long long i = 0; i < currentDepth; i++)
+    {
+        if (((mask >> i) & 1ll) == 0ll)
+            cout << "│    ";
+        else
+            cout << "     ";
+    }
+    isLastChild ? cout << "└── " : cout << "├── ";
 
     cout << node->name << "\n";
-    for (size_t i = 0; i < node->children.size(); ++i)
+    for (size_t i = 0; i < node->children.size(); i++)
     {
         DirectoryNode *child = node->children[i];
-        PrintGraph(child, depth, currentDepth + 1);
+        if (i == node->children.size() - 1)
+        {
+            mask = mask | (1ll << (currentDepth + 1));
+        }
+        PrintGraph(child, depth, currentDepth + 1, i == node->children.size() - 1, mask);
     }
 }
+
+void DirectoryGraph::PrintGraph(DirectoryNode *node, long long depth)
+{
+    this->PrintGraph(node, depth, 0, true, 1);
+}

src/controller/DirectoryGraph.h

@@ -11,14 +11,13 @@ using namespace std;
 class DirectoryGraph
 {
 public:
-    DirectoryNode *BuildGraph(const string &directoryName, int depth);
-
-    void PrintGraph(DirectoryNode *node, int depth, int currentDepth = 0);
+    DirectoryNode *BuildGraph(const string &directoryName, long long depth);
+    void PrintGraph(DirectoryNode *node, long long depth);
 
 private:
     bool isDirectory(const std::string &pathStr);
-
-    void TraverseDirectoriesDFS(DirectoryNode *node, int depth, int currentDepth = 0);
+    void TraverseDirectoriesDFS(DirectoryNode *node, long long depth, long long currentDepth = 0);
+    void PrintGraph(DirectoryNode *node, long long depth, long long currentDepth, bool isLastChild, long long mask);
 };
 
 #endif

src/main.cpp

@@ -8,9 +8,10 @@ using namespace std;
 
 int main()
 {
+    long long depth = 3; // should not be more than 60
     auto currentPath = filesystem::current_path();
     DirectoryGraph builder;
-    auto root = builder.BuildGraph(currentPath, 4);
-    builder.PrintGraph(root, 4);
+    auto root = builder.BuildGraph(currentPath, depth);
+    builder.PrintGraph(root, depth);
     return 0;
 }