feat: replaced methods in NonHierarchicalDistanceBasedAlgorithm.java

Author: kikoso

library/src/main/java/com/google/maps/android/clustering/algo/ContinuousZoomEuclideanAlgorithm.java

@@ -19,7 +19,6 @@
 import com.google.maps.android.clustering.Cluster;
 import com.google.maps.android.clustering.ClusterItem;
 import com.google.maps.android.geometry.Bounds;
-import com.google.maps.android.geometry.Point;
 
 import java.util.ArrayList;
 import java.util.Collection;
@@ -122,30 +121,4 @@ public Set<? extends Cluster<T>> getClusters(float zoom) {
         }
         return results;
     }
-
-    /**
-     * Calculates the squared Euclidean distance between two points.
-     *
-     * @param a the first point
-     * @param b the second point
-     * @return the squared Euclidean distance between {@code a} and {@code b}
-     */
-    private double distanceSquared(Point a, Point b) {
-        return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
-    }
-
-    /**
-     * Creates a square bounding box centered at a point with the specified span.
-     *
-     * @param p the center point
-     * @param span the total width/height of the bounding box
-     * @return the {@link Bounds} object representing the search area
-     */
-    private Bounds createBoundsFromSpan(Point p, double span) {
-        double halfSpan = span / 2;
-        return new Bounds(
-                p.x - halfSpan, p.x + halfSpan,
-                p.y - halfSpan, p.y + halfSpan
-        );
-    }
 }

library/src/main/java/com/google/maps/android/clustering/algo/NonHierarchicalDistanceBasedAlgorithm.java

@@ -247,11 +247,25 @@ public int getMaxDistanceBetweenClusteredItems() {
         return mMaxDistance;
     }
 
-    private double distanceSquared(Point a, Point b) {
+    /**
+     * Calculates the squared Euclidean distance between two points.
+     *
+     * @param a the first point
+     * @param b the second point
+     * @return the squared Euclidean distance between {@code a} and {@code b}
+     */
+    protected double distanceSquared(Point a, Point b) {
         return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
     }
 
-    private Bounds createBoundsFromSpan(Point p, double span) {
+    /**
+     * Creates a square bounding box centered at a point with the specified span.
+     *
+     * @param p the center point
+     * @param span the total width/height of the bounding box
+     * @return the {@link Bounds} object representing the search area
+     */
+    protected Bounds createBoundsFromSpan(Point p, double span) {
         // TODO: Use a span that takes into account the visual size of the marker, not just its
         // LatLng.
         double halfSpan = span / 2;

library/src/test/java/com/google/maps/android/clustering/algo/ContinuousZoomEuclideanAlgorithmTest.java

@@ -66,7 +66,7 @@ public Float getZIndex() {
     public void testContinuousZoomMergesClosePairAtLowZoomAndSeparatesAtHighZoom() {
         ContinuousZoomEuclideanAlgorithm<TestClusterItem> algo =
                 new ContinuousZoomEuclideanAlgorithm<>();
-        
+
         Collection<TestClusterItem> items = Arrays.asList(
                 new TestClusterItem(10.0, 10.0),
                 new TestClusterItem(10.0001, 10.0001), // very close to the first