Skip to content

Commit 670557d

Browse files
author
Gonzalo Diaz
committed
[BREAKING] ⚠️ [REFACTOR] Custom Logger renamed as "Log".
1 parent 99a2fa8 commit 670557d

31 files changed

+107
-107
lines changed

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
package ae;
66

7-
import util.CustomLogger;
7+
import util.Log;
88

99
/**
1010
* {TITLE}.
@@ -22,7 +22,7 @@ public static Integer problem0000() {
2222
Integer result = null;
2323

2424
String log = String.format("Problem 00XX solved: %d", result);
25-
CustomLogger.info(log);
25+
Log.info(log);
2626

2727
return result;
2828
}

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package ae.hackerrank.projecteuler;
22

3-
import util.CustomLogger;
3+
import util.Log;
44

55
/**
66
* Multiples of 3 and 5.
@@ -45,7 +45,7 @@ public static Long euler001(Integer a, Integer b, Integer n) {
4545
- sumOfArithmeticProgression((long) n, lcm);
4646

4747
String log = String.format("Problem 001 solved: %d", result);
48-
CustomLogger.info(log);
48+
Log.info(log);
4949

5050
return result;
5151
}

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package ae.hackerrank.projecteuler;
22

3-
import util.CustomLogger;
3+
import util.Log;
44

55
/**
66
* Even Fibonacci numbers.
@@ -37,7 +37,7 @@ public static Long euler002(Integer n) {
3737
Long result = fibbo(n);
3838

3939
String log = String.format("Problem 002 solved: %d", result);
40-
CustomLogger.info(log);
40+
Log.info(log);
4141

4242
return result;
4343
}

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package ae.hackerrank.warmup;
22

33
import java.util.List;
4-
import util.CustomLogger;
4+
import util.Log;
55

66
/**
77
* Simple Array Sum.
@@ -23,7 +23,7 @@ public static int simpleArraySum(List<Integer> ar) {
2323
}
2424

2525
String log = String.format("simpleArraySum solved: %d", total);
26-
CustomLogger.info(log);
26+
Log.info(log);
2727

2828
return total;
2929
}

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package ae.projecteuler;
22

3-
import util.CustomLogger;
3+
import util.Log;
44

55
/**
66
* Multiples of 3 and 5.
@@ -21,14 +21,14 @@ public static Integer problem0001(Integer top) {
2121
for (i = 0; i < top; i++) {
2222
if (i % 3 == 0 || i % 5 == 0) {
2323
String log = String.format("Line result: %d", i);
24-
CustomLogger.debug(log);
24+
Log.debug(log);
2525

2626
result += i;
2727
}
2828
}
2929

3030
String log = String.format("Problem 0001 solved: %d", result);
31-
CustomLogger.info(log);
31+
Log.info(log);
3232

3333
return result;
3434
}

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package ae.projecteuler;
22

3-
import util.CustomLogger;
3+
import util.Log;
44

55
/**
66
* Even Fibonacci numbers.
@@ -26,7 +26,7 @@ public static Integer problem0002(int top) {
2626
fibo = last2 + last1;
2727

2828
String log = String.format("Fibonacci(%d) = %d", i, fibo);
29-
CustomLogger.debug(log);
29+
Log.debug(log);
3030

3131
if (fibo % 2 == 0) {
3232
evenSum += fibo;
@@ -39,7 +39,7 @@ public static Integer problem0002(int top) {
3939
} while (fibo < top);
4040

4141
String log = String.format("Problem 0002 result: %d", evenSum);
42-
CustomLogger.info(log);
42+
Log.info(log);
4343

4444
return evenSum;
4545
}

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

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
import ae.projecteuler.helper.Divisors;
44
import ae.projecteuler.helper.NaturalNumber;
55
import java.util.Arrays;
6-
import util.CustomLogger;
6+
import util.Log;
77

88

99
/**
@@ -28,7 +28,7 @@ public static Long problem0003(Long top) {
2828

2929
String log;
3030
log = String.format("Divisors of %d: %s", top, Arrays.toString(divs));
31-
CustomLogger.info(log);
31+
Log.info(log);
3232

3333
Long maxPrimeFactor = null;
3434
Integer i = middle;
@@ -38,13 +38,13 @@ public static Long problem0003(Long top) {
3838
boolean prime = NaturalNumber.isPrime(divs[i]);
3939

4040
log = String.format("%d is Prime?: %b", i, prime);
41-
CustomLogger.debug(log);
41+
Log.debug(log);
4242

4343
if (prime) {
4444
maxPrimeFactor = divs[i];
4545

4646
log = String.format("Problem 0003 solved: %d", maxPrimeFactor);
47-
CustomLogger.info(log);
47+
Log.info(log);
4848

4949
return maxPrimeFactor;
5050
}

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010
package ae.projecteuler;
1111

1212
import ae.projecteuler.helper.Palindrome;
13-
import util.CustomLogger;
13+
import util.Log;
1414

1515
/**
1616
* Largest palindrome product.
@@ -42,7 +42,7 @@ public static Integer problem0004(int bottom, int top) {
4242

4343
if (Palindrome.isPalindrome(Long.valueOf((long) j * (long) i))) {
4444
String log = String.format("FOUND: %d x %d = %d is Palindrome", i, j, i * j);
45-
CustomLogger.debug(log);
45+
Log.debug(log);
4646

4747
if (foundPalindrome == null || i * j > foundPalindrome) {
4848
foundi = i;
@@ -64,7 +64,7 @@ public static Integer problem0004(int bottom, int top) {
6464
foundPalindrome,
6565
cycles);
6666

67-
CustomLogger.info(log);
67+
Log.info(log);
6868

6969
return foundPalindrome;
7070
}

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
import java.util.HashMap;
66
import java.util.List;
77
import java.util.Map;
8-
import util.CustomLogger;
8+
import util.Log;
99

1010
/**
1111
* Smallest multiple.
@@ -75,7 +75,7 @@ public static Integer problem0005(Integer bottom, Integer top) {
7575
);
7676

7777
log = String.format("%s", minimumPrimeFactorsCollector.toString());
78-
CustomLogger.info(log);
78+
Log.info(log);
7979
}
8080

8181
result = 1;
@@ -87,7 +87,7 @@ public static Integer problem0005(Integer bottom, Integer top) {
8787
}
8888

8989
log = String.format("Problem 0005 solved: %d", result);
90-
CustomLogger.info(log);
90+
Log.info(log);
9191

9292
return result;
9393
}

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

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
package ae.projecteuler;
44

5-
import util.CustomLogger;
5+
import util.Log;
66

77
/**
88
* Smallest multiple.
@@ -31,10 +31,10 @@ public static Integer problem0005(Integer bottom, Integer top, Integer startFrom
3131

3232
if (fail) {
3333
log = String.format("Fail %d not divisible by %d", test, i);
34-
CustomLogger.debug(log);
34+
Log.debug(log);
3535
} else {
3636
log = String.format("Testing: %d divisible by %d", test, i);
37-
CustomLogger.debug(log);
37+
Log.debug(log);
3838
}
3939

4040
i += 1;
@@ -48,7 +48,7 @@ public static Integer problem0005(Integer bottom, Integer top, Integer startFrom
4848
} while (found == null);
4949

5050
log = String.format("Problem 00005 solved: %d", found);
51-
CustomLogger.info(log);
51+
Log.info(log);
5252

5353
return found;
5454
}

‎algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0006.java

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88

99
package ae.projecteuler;
1010

11-
import util.CustomLogger;
11+
import util.Log;
1212

1313
/**
1414
* Sum square difference.
@@ -40,20 +40,20 @@ public static Integer problem0006(Integer bottom, Integer top) {
4040

4141
String log;
4242
log = String.format("Sum of first %d squares = %d", top, sumOfSquares);
43-
CustomLogger.debug(log);
43+
Log.debug(log);
4444
log = String.format("Base for Square Of Sum of first %d = %d", top, baseForSquareOfSum);
45-
CustomLogger.debug(log);
45+
Log.debug(log);
4646
log = String.format("Square Of Sum of first %d = %d", top, squareOfSum);
47-
CustomLogger.debug(log);
47+
Log.debug(log);
4848

4949
log = String.format("Difference found %d - %d = %d",
5050
squareOfSum,
5151
sumOfSquares,
5252
squareOfSum - sumOfSquares);
53-
CustomLogger.debug(log);
53+
Log.debug(log);
5454

5555
log = String.format("Problem 00006 solved: %d", answer);
56-
CustomLogger.info(log);
56+
Log.info(log);
5757

5858
return answer;
5959
}

‎algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0007.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
import ae.projecteuler.helper.NaturalNumber;
44
import java.util.ArrayList;
5-
import util.CustomLogger;
5+
import util.Log;
66

77
/**
88
* 10001st prime.
@@ -30,20 +30,20 @@ public static Integer problem0007(Integer top) {
3030
primes.add(j);
3131

3232
log = String.format("Prime found %d put in position: %d", j, primes.size());
33-
CustomLogger.debug(log);
33+
Log.debug(log);
3434
}
3535

3636
j = 2 * i + 1;
3737
}
3838

3939
log = String.format("primes count: %d", primes.size());
40-
CustomLogger.info(log);
40+
Log.info(log);
4141

4242
Integer answer = primes.get(primes.size() - 1);
4343
Integer cycles = i;
4444

4545
log = String.format("%d prime number is: %d in %d cycles", top, answer, cycles);
46-
CustomLogger.info(log);
46+
Log.info(log);
4747

4848
return answer;
4949
}

‎algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0008.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
import ae.projecteuler.helper.Product;
44
import java.util.ArrayList;
5-
import util.CustomLogger;
5+
import util.Log;
66

77
/**
88
* Largest product in a series.
@@ -33,15 +33,15 @@ public static Long problem0008(String number, Integer interval) {
3333

3434
Long currentProduct = Product.product(digitsSet.toArray(Long[]::new));
3535
log = String.format("Product beetwen %d and %d is: %d", i, i + interval, currentProduct);
36-
CustomLogger.debug(log);
36+
Log.debug(log);
3737

3838
if (currentProduct > max) {
3939
max = currentProduct;
4040
}
4141
}
4242

4343
log = String.format("Problem 0008 solved: %d", max);
44-
CustomLogger.info(log);
44+
Log.info(log);
4545

4646
return max;
4747
}

‎algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0009.java

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package ae.projecteuler;
22

3-
import util.CustomLogger;
3+
import util.Log;
44

55
/**
66
* Special Pythagorean triplet.
@@ -46,13 +46,13 @@ public static Integer problem0009(Integer limit) {
4646
while (b < c && found == null) {
4747
// TESTING
4848
log = String.format("TESTING: a = %d b = %d c = %d", a, b, c);
49-
CustomLogger.debug(log);
49+
Log.debug(log);
5050
Triplet test = new Problem0009().new Triplet(a, b, c);
5151

5252
if (test.isPythagoreanTriplet()) {
5353
found = test;
5454
log = String.format("FOUND: a = %d b = %d c = %d", a, b, c);
55-
CustomLogger.debug(log);
55+
Log.debug(log);
5656
}
5757

5858
// INCREASE
@@ -68,9 +68,9 @@ public static Integer problem0009(Integer limit) {
6868
}
6969

7070
log = String.format("FOUND: a = %d, b = %d, c = %d", found.ta, found.tb, found.tc);
71-
CustomLogger.info(log);
71+
Log.info(log);
7272
log = String.format("PRODUCT: a * b * c = %d", found.ta * found.tb * found.tc);
73-
CustomLogger.info(log);
73+
Log.info(log);
7474

7575
return found.ta * found.tb * found.tc;
7676
}

‎algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0010.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
import ae.projecteuler.helper.NaturalNumber;
44
import ae.projecteuler.helper.Sum;
55
import java.util.ArrayList;
6-
import util.CustomLogger;
6+
import util.Log;
77

88
/**
99
* Summation of primes.
@@ -30,16 +30,16 @@ public static Long problem0010(Long bottom, Long top) {
3030
if (new NaturalNumber(i).isPrime()) {
3131
primes.add(i);
3232
log = String.format("Prime found %d put in position: %d", i, primes.size());
33-
CustomLogger.debug(log);
33+
Log.debug(log);
3434
}
3535
} while (i < top);
3636

3737
Long result = Sum.sum(primes.toArray(Long[]::new));
3838

3939
log = String.format("primes count: %d", primes.size());
40-
CustomLogger.info(log);
40+
Log.info(log);
4141
log = String.format("Sum of primes below %d is: %d", top, result);
42-
CustomLogger.info(log);
42+
Log.info(log);
4343

4444
return result;
4545
}

0 commit comments

Comments
 (0)