ujjwall-R · ujjwall-R · Dec 7, 2023 · Nov 25, 2023
diff --git a/.clang-format b/.clang-format
@@ -0,0 +1,69 @@
+Language:        Cpp
+# BasedOnStyle:  Google
+AccessModifierOffset: -1
+AlignAfterOpenBracket: Align
+AlignOperands:   true
+AlignTrailingComments: true
+AllowAllParametersOfDeclarationOnNextLine: true
+AllowShortBlocksOnASingleLine: false
+AllowShortCaseLabelsOnASingleLine: false
+AllowShortFunctionsOnASingleLine: All
+AllowShortIfStatementsOnASingleLine: true
+AllowShortLoopsOnASingleLine: true
+AlwaysBreakAfterReturnType: None
+AlwaysBreakBeforeMultilineStrings: true
+AlwaysBreakTemplateDeclarations: true
+BinPackArguments: true
+BinPackParameters: true
+BreakBeforeBraces: Attach
+BreakBeforeTernaryOperators: true
+BreakConstructorInitializers: BeforeColon
+BreakStringLiterals: true
+ColumnLimit:     120
+CompactNamespaces: false
+ConstructorInitializerAllOnOneLineOrOnePerLine: true
+ConstructorInitializerIndentWidth: 4
+ContinuationIndentWidth: 4
+Cpp11BracedListStyle: true
+DerivePointerAlignment: true
+DisableFormat:   false
+FixNamespaceComments: true
+IncludeCategories: 
+  - Regex:           '^<.*\.h>'
+    Priority:        1
+  - Regex:           '^<.*'
+    Priority:        2
+  - Regex:           '.*'
+    Priority:        3
+IndentCaseLabels: true
+IndentWidth:     4
+JavaScriptQuotes: Leave
+JavaScriptWrapImports: true
+MacroBlockBegin: ''
+MacroBlockEnd:   ''
+MaxEmptyLinesToKeep: 1
+NamespaceIndentation: None
+ObjCBlockIndentWidth: 2
+ObjCSpaceAfterProperty: false
+ObjCSpaceBeforeProtocolList: false
+PenaltyBreakAssignment: 2
+PenaltyBreakBeforeFirstCallParameter: 1
+PenaltyBreakComment: 300
+PenaltyBreakFirstLessLess: 120
+PenaltyBreakString: 1000
+PenaltyExcessCharacter: 1000000
+PenaltyReturnTypeOnItsOwnLine: 200
+PointerAlignment: Left
+ReflowComments:  false
+SortIncludes:    true
+SortUsingDeclarations: true
+SpaceAfterCStyleCast: false
+SpaceAfterTemplateKeyword: true
+SpaceBeforeAssignmentOperators: true
+SpaceBeforeParens: ControlStatements
+SpaceInEmptyParentheses: false
+SpacesBeforeTrailingComments: 2
+SpacesInContainerLiterals: true
+Standard:        Auto
+TabWidth:        8
+UseTab:          Never
diff --git a/src/controller/DirectoryGraph.cpp b/src/controller/DirectoryGraph.cpp
@@ -1,18 +1,15 @@
 #include "DirectoryGraph.h"
-#include <iostream>
 #include <algorithm>
-#include <string>
 #include <fstream>
+#include <iostream>
+#include <string>
 
 using namespace std;
 
-DirectoryGraph::DirectoryGraph(bool showHidden)
-    : showHidden(showHidden),
-    excludedDirectories()
-{
+DirectoryGraph::DirectoryGraph(bool showHidden) : showHidden(showHidden), excludedDirectories() {
     ifstream file(".dreeignore");
     string line;
-    
+
     while (getline(file, line)) {
         this->excludedDirectories.insert(line);
     }
@@ -21,62 +18,48 @@ DirectoryGraph::DirectoryGraph(bool showHidden)
     this->permissionErrorString = "Note:- Somefiles were omited due to default permission errors!!";
 }
 
-bool DirectoryGraph::isDirectory(const string &pathStr)
-{
+bool DirectoryGraph::isDirectory(const string &pathStr) {
     filesystem::path path(pathStr);
     return filesystem::is_directory(path);
 }
 
-bool DirectoryGraph::isExcluded(const string &dirStr)
-{
+bool DirectoryGraph::isExcluded(const string &dirStr) {
     return (dirStr.front() == '.' || excludedDirectories.find(dirStr) != excludedDirectories.end());
 }
 
-DirectoryNode *DirectoryGraph::BuildGraph(const string &directoryName, long long 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, long long depth, long long currentDepth)
-{
-    if (currentDepth > depth)
-        return;
+void DirectoryGraph::TraverseDirectoriesDFS(DirectoryNode *node, long long depth, long long currentDepth) {
+    if (currentDepth > depth) return;
 
-    try
-    {
-        for (const auto &entry : filesystem::directory_iterator(node->path))
-        {
-            if (!showHidden && isExcluded(entry.path().filename().string()))
-                continue;
+    try {
+        for (const auto &entry : filesystem::directory_iterator(node->path)) {
+            if (!showHidden && isExcluded(entry.path().filename().string())) continue;
 
             string childDirectory = entry.path().string();
             DirectoryNode *child = new DirectoryNode(childDirectory);
             node->children.push_back(child);
         }
-    }
-    catch (const std::exception &e)
-    {
+    } catch (const std::exception &e) {
         this->allFilesPermited = false;
     }
 
-    for (auto ch : node->children)
-    {
-        if (isDirectory(ch->path))
-        {
+    for (auto ch : node->children) {
+        if (isDirectory(ch->path)) {
             TraverseDirectoriesDFS(ch, depth, currentDepth + 1);
         }
     }
 }
 
-void DirectoryGraph::PrintGraphDFS(DirectoryNode *node, long long depth, long long currentDepth, bool isLastChild, long long mask)
-{
-    if (currentDepth == depth)
-        return;
+void DirectoryGraph::PrintGraphDFS(DirectoryNode *node, long long depth, long long currentDepth, bool isLastChild,
+                                   long long mask) {
+    if (currentDepth == depth) return;
 
-    for (long long i = 0; i < currentDepth; i++)
-    {
+    for (long long i = 0; i < currentDepth; i++) {
         if (((mask >> i) & 1ll) == 0ll)
             cout << "│    ";
         else
@@ -85,92 +68,68 @@ void DirectoryGraph::PrintGraphDFS(DirectoryNode *node, long long depth, long lo
     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];
-        if (i == node->children.size() - 1)
-        {
+        if (i == node->children.size() - 1) {
             mask = mask | (1ll << (currentDepth + 1));
         }
         PrintGraphDFS(child, depth, currentDepth + 1, i == node->children.size() - 1, mask);
     }
 }
 
-void DirectoryGraph::PrintGraphDFS(DirectoryNode *node, long long depth)
-{
+void DirectoryGraph::PrintGraphDFS(DirectoryNode *node, long long depth) {
     this->PrintGraphDFS(node, depth, 0ll, true, 1ll);
 }
 
-void DirectoryGraph::TraverseDirectoriesToSearch(DirectoryNode *node, long long depth, long long currentDepth, const string &query, vector<pair<int, DirectoryNode *>> &results)
-{
-    if (currentDepth > depth)
-        return;
+void DirectoryGraph::TraverseDirectoriesToSearch(DirectoryNode *node, long long depth, long long currentDepth,
+                                                 const string &query, vector<pair<int, DirectoryNode *>> &results) {
+    if (currentDepth > depth) return;
 
     int score1 = DirectorySearch::LevenshteinDistance(node->name, query);
     int score2 = DirectorySearch::LevenshteinDistance(node->path, query);
-    if (score1 * 100 <= (50 * query.length()) || score2 * 100 <= (50 * query.length()))
-    {
+    if (score1 * 100 <= (50 * query.length()) || score2 * 100 <= (50 * query.length())) {
         results.push_back({min(score1, score2), node});
     }
 
-    if (!isDirectory(node->path))
-    {
+    if (!isDirectory(node->path)) {
         return;
     }
 
-    try
-    {
-        for (const auto &entry : filesystem::directory_iterator(node->path))
-        {
+    try {
+        for (const auto &entry : filesystem::directory_iterator(node->path)) {
             string childDirectory = entry.path().string();
             DirectoryNode *child = new DirectoryNode(childDirectory);
             node->children.push_back(child);
             TraverseDirectoriesToSearch(child, depth, currentDepth + 1, query, results);
         }
-    }
-    catch (const std::exception &e)
-    {
+    } catch (const std::exception &e) {
     }
 }
 
-void DirectoryGraph::SearchDirectory(const string &directoryName, int searchDepth, const string &query)
-{
+void DirectoryGraph::SearchDirectory(const string &directoryName, int searchDepth, const string &query) {
     DirectoryNode *currDir = new DirectoryNode(directoryName);
     DirectorySearch *searchObject = new DirectorySearch(searchDepth);
     this->TraverseDirectoriesToSearch(currDir, searchDepth, 0, query, searchObject->results);
     sort(searchObject->results.begin(), searchObject->results.end());
-    if (searchObject->results.empty())
-    {
+    if (searchObject->results.empty()) {
         cout << "No results found\n";
-    }
-    else
-    {
-        if (searchObject->results[0].first == 0)
-        {
+    } else {
+        if (searchObject->results[0].first == 0) {
             cout << "Search Results:\n";
             int cnt = 0;
-            for (auto res : searchObject->results)
-            {
-                if (res.first > 0)
-                    break;
+            for (auto res : searchObject->results) {
+                if (res.first > 0) break;
 
                 cout << cnt + 1 << ".\t";
-                cout << res.second->name << "\t\t"
-                     << res.second->path
-                     << "\n";
+                cout << res.second->name << "\t\t" << res.second->path << "\n";
                 cnt++;
             }
-        }
-        else
-        {
+        } else {
             cout << "Couldn't find results. Did you mean?:\n";
             int cnt = 0;
-            for (auto res : searchObject->results)
-            {
+            for (auto res : searchObject->results) {
                 cout << cnt + 1 << ".\t";
-                cout << res.second->name << "\t\t"
-                     << res.second->path
-                     << "\n";
+                cout << res.second->name << "\t\t" << res.second->path << "\n";
                 cnt++;
             }
         }

diff --git a/src/controller/DirectoryGraph.h b/src/controller/DirectoryGraph.h
@@ -1,18 +1,17 @@
 #ifndef DIRECTORYGRAPH_H
 #define DIRECTORYGRAPH_H
 
+#include <filesystem>
 #include <set>
-#include <vector>
 #include <string>
-#include <filesystem>
-#include "../model/DirectoryNode.h"
+#include <vector>
 #include "../controller/DirectorySearch.h"
+#include "../model/DirectoryNode.h"
 
 using namespace std;
 
-class DirectoryGraph
-{
-public:
+class DirectoryGraph {
+   public:
     DirectoryGraph(bool showHidden = false);
     DirectoryNode *BuildGraph(const string &directoryName, long long depth);
 
@@ -22,11 +21,12 @@ class DirectoryGraph
     bool allFilesPermited;
     string permissionErrorString;
 
-private:
+   private:
     bool isDirectory(const string &pathStr);
     void TraverseDirectoriesDFS(DirectoryNode *node, long long depth, long long currentDepth = 0);
     void PrintGraphDFS(DirectoryNode *node, long long depth, long long currentDepth, bool isLastChild, long long mask);
-    void TraverseDirectoriesToSearch(DirectoryNode *node, long long depth, long long currentDepth, const string &query, vector<pair<int, DirectoryNode *>> &results);
+    void TraverseDirectoriesToSearch(DirectoryNode *node, long long depth, long long currentDepth, const string &query,
+                                     vector<pair<int, DirectoryNode *>> &results);
     bool isExcluded(const string &dirStr);
 
     set<string> excludedDirectories;

diff --git a/src/controller/DirectorySearch.cpp b/src/controller/DirectorySearch.cpp
@@ -1,30 +1,22 @@
+#include "DirectorySearch.h"
+#include <algorithm>
 #include <iostream>
 #include <string>
 #include <vector>
-#include <algorithm>
-#include "DirectorySearch.h"
 
 using namespace std;
 
-DirectorySearch::DirectorySearch(int searchDepth)
-{
-    this->searchDepth = searchDepth;
-}
+DirectorySearch::DirectorySearch(int searchDepth) { this->searchDepth = searchDepth; }
 
-int DirectorySearch::LevenshteinDistance(const string &s1, const string &s2)
-{
+int DirectorySearch::LevenshteinDistance(const string &s1, const string &s2) {
     const int m = s1.length();
     const int n = s2.length();
     vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
-    for (int i = 1; i <= m; ++i)
-        dp[i][0] = i;
-    for (int j = 1; j <= n; ++j)
-        dp[0][j] = j;
+    for (int i = 1; i <= m; ++i) dp[i][0] = i;
+    for (int j = 1; j <= n; ++j) dp[0][j] = j;
 
-    for (int i = 1; i <= m; ++i)
-    {
-        for (int j = 1; j <= n; ++j)
-        {
+    for (int i = 1; i <= m; ++i) {
+        for (int j = 1; j <= n; ++j) {
             if (s1[i - 1] == s2[j - 1])
                 dp[i][j] = dp[i - 1][j - 1];
             else

diff --git a/src/controller/DirectorySearch.h b/src/controller/DirectorySearch.h
@@ -1,16 +1,15 @@
 #ifndef DIRECTORYSEARCH_H
 #define DIRECTORYSEARCH_H
 
-#include <vector>
-#include <string>
 #include <filesystem>
+#include <string>
+#include <vector>
 #include "../model/DirectoryNode.h"
 
 using namespace std;
 
-class DirectorySearch
-{
-public:
+class DirectorySearch {
+   public:
     vector<pair<int, DirectoryNode *>> results;
     int searchDepth;
     DirectorySearch(int searchDepth = 60);