Merge pull request #329 from sir-gon/develop

[REFACTOR] logging functions moved to their own package for "clean co…

Author: sir-gon

exercises/hackerrank/warmup/aVeryBigSum.go

@@ -4,9 +4,7 @@
 
 package hackerrank
 
-import (
-	utils "gon.cl/algorithms/utils"
-)
+import "gon.cl/algorithms/utils/log"
 
 func AVeryBigSum(ar []uint64) uint64 {
 	var result uint64 = 0
@@ -15,6 +13,6 @@ func AVeryBigSum(ar []uint64) uint64 {
 		result += ar[i]
 	}
 
-	utils.Info("aVeryBigSum answer => %d", result)
+	log.Info("aVeryBigSum answer => %d", result)
 	return result
 }

exercises/hackerrank/warmup/compareTriplets.go

@@ -7,7 +7,7 @@ package hackerrank
 import (
 	"errors"
 
-	utils "gon.cl/algorithms/utils"
+	"gon.cl/algorithms/utils/log"
 )
 
 func CompareTriplets(a []int, b []int) ([]int, error) {
@@ -27,7 +27,7 @@ func CompareTriplets(a []int, b []int) ([]int, error) {
 		}
 	}
 
-	utils.Info("SolveMeFirst answer => %v", awards)
+	log.Info("SolveMeFirst answer => %v", awards)
 
 	return awards, nil
 }

exercises/hackerrank/warmup/diagonalDifference.go

@@ -7,7 +7,7 @@ package hackerrank
 import (
 	"math"
 
-	utils "gon.cl/algorithms/utils"
+	"gon.cl/algorithms/utils/log"
 )
 
 func DiagonalDifference(arr [][]int) int {
@@ -24,8 +24,8 @@ func DiagonalDifference(arr [][]int) int {
 		}
 	}
 
-	utils.Info("diag1 => %d", diag1)
-	utils.Info("diag2 => %d", diag2)
+	log.Info("diag1 => %d", diag1)
+	log.Info("diag2 => %d", diag2)
 
 	return int(math.Abs(float64(diag1 - diag2)))
 }

exercises/hackerrank/warmup/plusMinus.go

@@ -8,7 +8,7 @@ import (
 	"fmt"
 	"strings"
 
-	utils "gon.cl/algorithms/utils"
+	"gon.cl/algorithms/utils/log"
 )
 
 func PlusMinus(arr []int) string {
@@ -37,7 +37,7 @@ func PlusMinus(arr []int) string {
 
 	answer := strings.Join(result, "\n")
 
-	utils.Info("PlusMinus answer => %s", answer)
+	log.Info("PlusMinus answer => %s", answer)
 
 	return answer
 }

exercises/hackerrank/warmup/simpleArraySum.go

@@ -4,9 +4,7 @@
 
 package hackerrank
 
-import (
-	utils "gon.cl/algorithms/utils"
-)
+import "gon.cl/algorithms/utils/log"
 
 func SimpleArraySum(arr []int) int {
 	acum := 0
@@ -15,7 +13,7 @@ func SimpleArraySum(arr []int) int {
 		acum += arr[i]
 	}
 
-	utils.Info("SimpleArraySum answer => %d", acum)
+	log.Info("SimpleArraySum answer => %d", acum)
 
 	return acum
 }

exercises/hackerrank/warmup/solveMeFirst.go

@@ -4,15 +4,13 @@
 
 package hackerrank
 
-import (
-	utils "gon.cl/algorithms/utils"
-)
+import "gon.cl/algorithms/utils/log"
 
 func SolveMeFirst(a int, b int) int {
 
 	var answer = a + b
 
-	utils.Info("SolveMeFirst answer => %d", answer)
+	log.Info("SolveMeFirst answer => %d", answer)
 
 	return answer
 }

exercises/hackerrank/warmup/staircase.go

@@ -7,7 +7,7 @@ package hackerrank
 import (
 	"strings"
 
-	utils "gon.cl/algorithms/utils"
+	"gon.cl/algorithms/utils/log"
 )
 
 func Staircase(n int) string {
@@ -28,7 +28,7 @@ func Staircase(n int) string {
 		result = append(result, line)
 	}
 
-	utils.Info("Staircase answer => %v", result)
+	log.Info("Staircase answer => %v", result)
 
 	return strings.Join(result, "\n")
 }

exercises/hackerrank/warmup/timeConversion.go

@@ -9,7 +9,7 @@ import (
 	"strconv"
 	"strings"
 
-	utils "gon.cl/algorithms/utils"
+	"gon.cl/algorithms/utils/log"
 )
 
 func TimeConversion(s string) string {
@@ -32,7 +32,7 @@ func TimeConversion(s string) string {
 
 	conversion := strings.Join(time, ":")
 
-	utils.Info("TimeConversion answer => %s", conversion)
+	log.Info("TimeConversion answer => %s", conversion)
 
 	return conversion
 }

exercises/problem0000.go

@@ -4,15 +4,13 @@
 
 package exercises
 
-import (
-	utils "gon.cl/algorithms/utils"
-)
+import "gon.cl/algorithms/utils/log"
 
 func Problem0000() int {
 
 	var answer int
 
-	utils.Info("Problem0000 answer => %d", answer)
+	log.Info("Problem0000 answer => %d", answer)
 
 	return answer
 }

exercises/projecteuler/helpers/divisors.go

@@ -4,7 +4,7 @@ import (
 	"math"
 	"sort"
 
-	"gon.cl/algorithms/utils"
+	"gon.cl/algorithms/utils/log"
 )
 
 type Factor struct {
@@ -28,7 +28,7 @@ func Divisors(target int) []int {
 		return divs
 	}
 
-	utils.Debug("Find divisors of %d", target)
+	log.Debug("Find divisors of %d", target)
 
 	// fast divisors finding loop
 	i := int(2)
@@ -50,11 +50,11 @@ func Divisors(target int) []int {
 	}
 
 	divs = append(divs, target)
-	utils.Debug("collected divisors %x", divs)
+	log.Debug("collected divisors %x", divs)
 
 	// sort divisors
 	sort.Slice(divs, func(i, j int) bool { return divs[i] < divs[j] })
-	utils.Debug("sorted divisors %x", divs)
+	log.Debug("sorted divisors %x", divs)
 
 	return divs
 }