trigger ci

Author: zfogg

src/boolean.c

@@ -2,63 +2,57 @@
 
 // Test if a binary number is zero.
 bool binEQZero(const bin x) {
-    for (bin_int_t i = 0; i < BIN_BITS; i++) {
-        if (x.bits[i])
-            return false;
-    }
-    return true;
+  for (bin_int_t i = 0; i < BIN_BITS; i++) {
+    if (x.bits[i])
+      return false;
+  }
+  return true;
 }
 
 // Test if a binary number is one.
 bool binEQOne(const bin x) {
-    // Check if the least significant bit is 1 and all others are 0
-    if (!x.bits[0])
-        return false;
-    for (bin_int_t i = 1; i < BIN_BITS; i++) {
-        if (x.bits[i])
-            return false;
-    }
-    return true;
+  // Check if the least significant bit is 1 and all others are 0
+  if (!x.bits[0])
+    return false;
+  for (bin_int_t i = 1; i < BIN_BITS; i++) {
+    if (x.bits[i])
+      return false;
+  }
+  return true;
 }
 
 // Test if a binary number is the maximum value.
 bool binEQMax(const bin x) {
-    for (bin_int_t i = 0; i < BIN_BITS; i++) {
-        if (!x.bits[i])
-            return false;
-    }
-    return true;
+  for (bin_int_t i = 0; i < BIN_BITS; i++) {
+    if (!x.bits[i])
+      return false;
+  }
+  return true;
 }
 
 // Test if two binary numbers are equal.
 bool binEQ(const bin x, const bin y) {
-    for (bin_int_t i = 0; i < BIN_BITS; i++) {
-        if (x.bits[i] != y.bits[i])
-            return false;
-    }
-    return true;
+  for (bin_int_t i = 0; i < BIN_BITS; i++) {
+    if (x.bits[i] != y.bits[i])
+      return false;
+  }
+  return true;
 }
 
 // Test if a binary number is greater than another.
 bool binGT(const bin x, const bin y) {
-    for (int i = BIN_BITS-1; i >= 0; --i) {
-        if (x.bits[i] != y.bits[i])
-            return x.bits[i] && !y.bits[i];
-    }
-    return false;
+  for (int i = BIN_BITS - 1; i >= 0; --i) {
+    if (x.bits[i] != y.bits[i])
+      return x.bits[i] && !y.bits[i];
+  }
+  return false;
 }
 
-// Test if a binary number is less than another.
-bool binLT(const bin x, const bin y) {
-    return !binEQ(x, y) && !binGT(x, y);
-}
+// Test if binary number is less than another.
+bool binLT(const bin x, const bin y) { return !binEQ(x, y) && !binGT(x, y); }
 
 // Test if a binary number is greater than or equal to another.
-bool binGTEQ(const bin x, const bin y) {
-    return !binLT(x, y);
-}
+bool binGTEQ(const bin x, const bin y) { return !binLT(x, y); }
 
 // Test if a binary number is less than or equal to another.
-bool binLTEQ(const bin x, const bin y) {
-    return !binGT(x, y);
-}
+bool binLTEQ(const bin x, const bin y) { return !binGT(x, y); }

src/math.h

@@ -37,8 +37,8 @@ bin binIncrement(const bin x);
  * @param y The binary number to subtract (subtrahend)
  * @return The difference of x and y as a binary number (x - y)
  *
- * @note This function performs standard binary subtraction with borrow handling.
- *       If y > x, the result will be the two's complement representation.
+ * @note This function performs standard binary subtraction with borrow
+ * handling. If y > x, the result will be the two's complement representation.
  */
 bin binSubtract(const bin x, const bin y);
 
@@ -113,7 +113,8 @@ bin binPow(const bin x, const bin y);
  * @param x The binary number to calculate the square root of
  * @return The square root of x as a binary number
  *
- * @note This function implements the Newton-Raphson method for square root calculation.
+ * @note This function implements the Newton-Raphson method for square root
+ * calculation.
  */
 bin binSqrt(const bin x);