[BREAKING] ⚠️ [REFACTOR] Custom Logger renamed as "Log".

Author: Gonzalo Diaz

algorithm-exercises-java/src/main/java/ae/Problem0000.java

@@ -4,7 +4,7 @@
 
 package ae;
 
-import util.CustomLogger;
+import util.Log;
 
 /**
  * {TITLE}.
@@ -22,7 +22,7 @@ public static Integer problem0000() {
     Integer result = null;
 
     String log = String.format("Problem 00XX solved: %d", result);
-    CustomLogger.info(log);
+    Log.info(log);
 
     return result;
   }

algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler001.java

@@ -1,6 +1,6 @@
 package ae.hackerrank.projecteuler;
 
-import util.CustomLogger;
+import util.Log;
 
 /**
  * Multiples of 3 and 5.
@@ -45,7 +45,7 @@ public static Long euler001(Integer a, Integer b, Integer n) {
       - sumOfArithmeticProgression((long) n, lcm);
 
     String log = String.format("Problem 001 solved: %d", result);
-    CustomLogger.info(log);
+    Log.info(log);
 
     return result;
   }

algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler002.java

@@ -1,6 +1,6 @@
 package ae.hackerrank.projecteuler;
 
-import util.CustomLogger;
+import util.Log;
 
 /**
  * Even Fibonacci numbers.
@@ -37,7 +37,7 @@ public static Long euler002(Integer n) {
     Long result = fibbo(n);
 
     String log = String.format("Problem 002 solved: %d", result);
-    CustomLogger.info(log);
+    Log.info(log);
 
     return result;
   }

algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/SimpleArraySum.java

@@ -1,7 +1,7 @@
 package ae.hackerrank.warmup;
 
 import java.util.List;
-import util.CustomLogger;
+import util.Log;
 
 /**
  * Simple Array Sum.
@@ -23,7 +23,7 @@ public static int simpleArraySum(List<Integer> ar) {
     }
 
     String log = String.format("simpleArraySum solved: %d", total);
-    CustomLogger.info(log);
+    Log.info(log);
 
     return total;
   }

algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0001.java

@@ -1,6 +1,6 @@
 package ae.projecteuler;
 
-import util.CustomLogger;
+import util.Log;
 
 /**
  * Multiples of 3 and 5.
@@ -21,14 +21,14 @@ public static Integer problem0001(Integer top) {
     for (i = 0; i < top; i++) {
       if (i % 3 == 0 || i % 5 == 0) {
         String log = String.format("Line result: %d", i);
-        CustomLogger.debug(log);
+        Log.debug(log);
 
         result += i;
       }
     }
 
     String log = String.format("Problem 0001 solved: %d", result);
-    CustomLogger.info(log);
+    Log.info(log);
 
     return result;
   }

algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0002.java

@@ -1,6 +1,6 @@
 package ae.projecteuler;
 
-import util.CustomLogger;
+import util.Log;
 
 /**
  * Even Fibonacci numbers.
@@ -26,7 +26,7 @@ public static Integer problem0002(int top) {
       fibo = last2 + last1;
 
       String log = String.format("Fibonacci(%d) = %d", i, fibo);
-      CustomLogger.debug(log);
+      Log.debug(log);
 
       if (fibo % 2 == 0) {
         evenSum += fibo;
@@ -39,7 +39,7 @@ public static Integer problem0002(int top) {
     } while (fibo < top);
 
     String log = String.format("Problem 0002 result: %d", evenSum);
-    CustomLogger.info(log);
+    Log.info(log);
 
     return evenSum;
   }

algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0003.java

@@ -3,7 +3,7 @@
 import ae.projecteuler.helper.Divisors;
 import ae.projecteuler.helper.NaturalNumber;
 import java.util.Arrays;
-import util.CustomLogger;
+import util.Log;
 
 
 /**
@@ -28,7 +28,7 @@ public static Long problem0003(Long top) {
 
     String log;
     log = String.format("Divisors of %d: %s", top, Arrays.toString(divs));
-    CustomLogger.info(log);
+    Log.info(log);
 
     Long maxPrimeFactor = null;
     Integer i = middle;
@@ -38,13 +38,13 @@ public static Long problem0003(Long top) {
       boolean prime = NaturalNumber.isPrime(divs[i]);
 
       log = String.format("%d is Prime?: %b", i, prime);
-      CustomLogger.debug(log);
+      Log.debug(log);
 
       if (prime) {
         maxPrimeFactor = divs[i];
 
         log = String.format("Problem 0003 solved: %d", maxPrimeFactor);
-        CustomLogger.info(log);
+        Log.info(log);
 
         return maxPrimeFactor;
       }

algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0004.java

@@ -10,7 +10,7 @@
 package ae.projecteuler;
 
 import ae.projecteuler.helper.Palindrome;
-import util.CustomLogger;
+import util.Log;
 
 /**
  * Largest palindrome product.
@@ -42,7 +42,7 @@ public static Integer problem0004(int bottom, int top) {
 
         if (Palindrome.isPalindrome(Long.valueOf((long) j * (long) i))) {
           String log = String.format("FOUND: %d x %d = %d is Palindrome", i, j, i * j);
-          CustomLogger.debug(log);
+          Log.debug(log);
 
           if (foundPalindrome == null || i * j > foundPalindrome) {
             foundi = i;
@@ -64,7 +64,7 @@ public static Integer problem0004(int bottom, int top) {
         foundPalindrome,
         cycles);
 
-    CustomLogger.info(log);
+    Log.info(log);
 
     return foundPalindrome;
   }

algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005.java

@@ -5,7 +5,7 @@
 import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
-import util.CustomLogger;
+import util.Log;
 
 /**
  * Smallest multiple.
@@ -75,7 +75,7 @@ public static Integer problem0005(Integer bottom, Integer top) {
       );
 
       log = String.format("%s", minimumPrimeFactorsCollector.toString());
-      CustomLogger.info(log);
+      Log.info(log);
     }
 
     result = 1;
@@ -87,7 +87,7 @@ public static Integer problem0005(Integer bottom, Integer top) {
     }
 
     log = String.format("Problem 0005 solved: %d", result);
-    CustomLogger.info(log);
+    Log.info(log);
 
     return result;
   }

algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005Simple.java

@@ -2,7 +2,7 @@
 
 package ae.projecteuler;
 
-import util.CustomLogger;
+import util.Log;
 
 /**
  * Smallest multiple.
@@ -31,10 +31,10 @@ public static Integer problem0005(Integer bottom, Integer top, Integer startFrom
 
         if (fail) {
           log = String.format("Fail %d not divisible by %d", test, i);
-          CustomLogger.debug(log);
+          Log.debug(log);
         } else {
           log = String.format("Testing: %d divisible by %d", test, i);
-          CustomLogger.debug(log);
+          Log.debug(log);
         }
 
         i += 1;
@@ -48,7 +48,7 @@ public static Integer problem0005(Integer bottom, Integer top, Integer startFrom
     } while (found == null);
 
     log = String.format("Problem 00005 solved: %d", found);
-    CustomLogger.info(log);
+    Log.info(log);
 
     return found;
   }