From b6b48739d4ad0c89318dee4cf243af871cdaf32f Mon Sep 17 00:00:00 2001
From: Daniel Burkhardt <burkhardt.d.b@gmail.com>
Date: Fri, 8 Oct 2021 12:32:35 -0400
Subject: [PATCH] logger.debug -> logger.log_debug

---
 graphtools/api.py       |  4 ++--
 graphtools/base.py      | 12 ++++++------
 graphtools/estimator.py |  2 +-
 graphtools/graphs.py    | 10 +++++-----
 4 files changed, 14 insertions(+), 14 deletions(-)

diff --git a/graphtools/api.py b/graphtools/api.py
index b9a4b1b..27b9a79 100644
--- a/graphtools/api.py
+++ b/graphtools/api.py
@@ -255,7 +255,7 @@ def Graph(
         else:
             msg = msg + " and PyGSP inheritance"
 
-    _logger.debug(msg)
+    _logger.log_debug(msg)
 
     class_names = [p.__name__.replace("Graph", "") for p in parent_classes]
     try:
@@ -273,7 +273,7 @@ def Graph(
                 pass
 
     # build graph and return
-    _logger.debug(
+    _logger.log_debug(
         "Initializing {} with arguments {}".format(
             parent_classes,
             ", ".join(
diff --git a/graphtools/base.py b/graphtools/base.py
index 4789b8a..a1e42e9 100644
--- a/graphtools/base.py
+++ b/graphtools/base.py
@@ -498,10 +498,10 @@ def __init__(
         self.anisotropy = anisotropy
 
         if initialize:
-            _logger.debug("Initializing kernel...")
+            _logger.log_debug("Initializing kernel...")
             self.K
         else:
-            _logger.debug("Not initializing kernel.")
+            _logger.log_debug("Not initializing kernel.")
         super().__init__(**kwargs)
 
     def _check_symmetrization(self, kernel_symm, theta):
@@ -556,18 +556,18 @@ def _build_kernel(self):
     def symmetrize_kernel(self, K):
         # symmetrize
         if self.kernel_symm == "+":
-            _logger.debug("Using addition symmetrization.")
+            _logger.log_debug("Using addition symmetrization.")
             K = (K + K.T) / 2
         elif self.kernel_symm == "*":
-            _logger.debug("Using multiplication symmetrization.")
+            _logger.log_debug("Using multiplication symmetrization.")
             K = K.multiply(K.T)
         elif self.kernel_symm == "mnn":
-            _logger.debug("Using mnn symmetrization (theta = {}).".format(self.theta))
+            _logger.log_debug("Using mnn symmetrization (theta = {}).".format(self.theta))
             K = self.theta * matrix.elementwise_minimum(K, K.T) + (
                 1 - self.theta
             ) * matrix.elementwise_maximum(K, K.T)
         elif self.kernel_symm is None:
-            _logger.debug("Using no symmetrization.")
+            _logger.log_debug("Using no symmetrization.")
             pass
         else:
             raise NotImplementedError
diff --git a/graphtools/estimator.py b/graphtools/estimator.py
index 5cb130f..c8a6171 100644
--- a/graphtools/estimator.py
+++ b/graphtools/estimator.py
@@ -248,7 +248,7 @@ def _set_graph_params(self, **params):
                     )
                 self.graph.set_params(**params)
             except ValueError as e:
-                _logger.debug("Reset graph due to {}".format(str(e)))
+                _logger.log_debug("Reset graph due to {}".format(str(e)))
                 self.graph = None
 
     @abc.abstractmethod
diff --git a/graphtools/graphs.py b/graphtools/graphs.py
index 2caa431..c1fd399 100644
--- a/graphtools/graphs.py
+++ b/graphtools/graphs.py
@@ -370,7 +370,7 @@ def build_kernel_to_data(
 
                 radius = bandwidth * np.power(-1 * np.log(self.thresh), 1 / self.decay)
                 update_idx = np.argwhere(np.max(distances, axis=1) < radius).reshape(-1)
-                _logger.debug(
+                _logger.log_debug(
                     "search_knn = {}; {} remaining".format(search_knn, len(update_idx))
                 )
                 if len(update_idx) > 0:
@@ -399,7 +399,7 @@ def build_kernel_to_data(
                             else radius[i]
                         )
                     ]
-                    _logger.debug(
+                    _logger.log_debug(
                         "search_knn = {}; {} remaining".format(
                             search_knn, len(update_idx)
                         )
@@ -412,7 +412,7 @@ def build_kernel_to_data(
                     ).fit(self.data_nu)
                 if len(update_idx) > 0:
                     if search_knn == knn_max:
-                        _logger.debug(
+                        _logger.log_debug(
                             "knn search to knn_max ({}) on {}".format(
                                 knn_max, len(update_idx)
                             )
@@ -425,7 +425,7 @@ def build_kernel_to_data(
                             distances[idx] = dist_new[i]
                             indices[idx] = ind_new[i]
                     else:
-                        _logger.debug("radius search on {}".format(len(update_idx)))
+                        _logger.log_debug("radius search on {}".format(len(update_idx)))
                         # give up - radius search
                         dist_new, ind_new = knn_tree.radius_neighbors(
                             Y[update_idx, :],
@@ -1302,7 +1302,7 @@ def build_kernel(self):
 
             # iterate through sample ids
             for i, idx in enumerate(self.samples):
-                _logger.debug(
+                _logger.log_debug(
                     "subgraph {}: sample {}, "
                     "n = {}, knn = {}".format(
                         i, idx, np.sum(self.sample_idx == idx), self.knn