Formatting

Author: michaelzhao820

.clang-format

@@ -0,0 +1,5 @@
+BasedOnStyle: LLVM
+IndentWidth: 4
+TabWidth: 4
+UseTab: Never
+ContinuationIndentWidth: 8

README.md

@@ -105,7 +105,7 @@ Start the OGO application:
 ```
 
 #### Format Code
-Auto-format Java code according to project standards:
+Auto-format Java and C++ code according to project standards:
 
 ```bash
 ./tasks.sh format

pom.xml

@@ -275,17 +275,17 @@
         </executions>
       </plugin>
       <plugin>
-        <groupId>com.spotify.fmt</groupId>
-        <artifactId>fmt-maven-plugin</artifactId>
-        <version>2.23</version>
+        <groupId>net.revelc.code.formatter</groupId>
+        <artifactId>formatter-maven-plugin</artifactId>
+        <version>2.24.1</version>
         <executions>
-            <execution>
-                <goals>
-                    <goal>format</goal>
-                </goals>
-            </execution>
+          <execution>
+            <goals>
+              <goal>format</goal>
+            </goals>
+          </execution>
         </executions>
-    </plugin>
+      </plugin>
     </plugins>
   </build>
 </project>

src/main/c/src/agent_util.cpp

@@ -54,18 +54,18 @@ searchTag(int l,
 bool UTIL::AGENT::searchTag(int l, int h, const long value,
                             const std::vector<long> &tags, int *index) {
 
-  while (l <= h) {
-    *index = (int)(ceil((l + h) / 2.0));
+    while (l <= h) {
+        *index = (int)(ceil((l + h) / 2.0));
 
-    if (value == tags[*index]) {
-      return true; /* Tag found at index mid */
-    } else if (value > tags[*index]) {
-      l = (*index) + 1;
-    } else {
-      h = (*index) - 1;
+        if (value == tags[*index]) {
+            return true; /* Tag found at index mid */
+        } else if (value > tags[*index]) {
+            l = (*index) + 1;
+        } else {
+            h = (*index) - 1;
+        }
     }
-  }
-  return false;
+    return false;
 }
 
 /**
@@ -79,34 +79,34 @@ bool UTIL::AGENT::searchTag(int l, int h, const long value,
  */
 void UTIL::AGENT::mergeSort(int i, int j, std::vector<long> &a,
                             std::vector<long> &aux) {
-  if (j <= i) {
-    return;
-  }
-  int mid = (i + j) / 2;
-  mergeSort(i, mid, a, aux);
-  mergeSort(mid + 1, j, a, aux);
+    if (j <= i) {
+        return;
+    }
+    int mid = (i + j) / 2;
+    mergeSort(i, mid, a, aux);
+    mergeSort(mid + 1, j, a, aux);
 
-  int pointer_left = i;
-  int pointer_right = mid + 1;
-  int k;
+    int pointer_left = i;
+    int pointer_right = mid + 1;
+    int k;
 
-  for (k = i; k <= j; k++) {
-    if (pointer_left == mid + 1) {
-      aux[k] = a[pointer_right];
-      pointer_right++;
-    } else if (pointer_right == j + 1) {
-      aux[k] = a[pointer_left];
-      pointer_left++;
-    } else if (a[pointer_left] < a[pointer_right]) {
-      aux[k] = a[pointer_left];
-      pointer_left++;
-    } else {
-      aux[k] = a[pointer_right];
-      pointer_right++;
+    for (k = i; k <= j; k++) {
+        if (pointer_left == mid + 1) {
+            aux[k] = a[pointer_right];
+            pointer_right++;
+        } else if (pointer_right == j + 1) {
+            aux[k] = a[pointer_left];
+            pointer_left++;
+        } else if (a[pointer_left] < a[pointer_right]) {
+            aux[k] = a[pointer_left];
+            pointer_left++;
+        } else {
+            aux[k] = a[pointer_right];
+            pointer_right++;
+        }
     }
-  }
 
-  for (k = i; k <= j; k++) {
-    a[k] = aux[k];
-  }
+    for (k = i; k <= j; k++) {
+        a[k] = aux[k];
+    }
 }