Normalize the left tail of TDigestDouble.getRank()

The left tail branch returned the interpolated weight without dividing by
centroidsWeight_, unlike the mirror-image right tail branch and the reference
implementation. Reachable via heapify() when the first centroid has weight
greater than 1, making getRank() exceed its documented [0, 1] range.

Author: edvancetech07

src/main/java/org/apache/datasketches/tdigest/TDigestDouble.java

@@ -192,7 +192,8 @@ public double getRank(final double value) {
     if (value < firstMean) {
       if ((firstMean - minValue_) > 0) {
         if (value == minValue_) { return 0.5 / centroidsWeight_; }
-        return (1.0 + (((value - minValue_) / (firstMean - minValue_)) * ((centroidWeights_[0] / 2.0) - 1.0)));
+        return (1.0 + (((value - minValue_) / (firstMean - minValue_))
+            * ((centroidWeights_[0] / 2.0) - 1.0))) / centroidsWeight_;
       }
       return 0; // should never happen
     }

src/test/java/org/apache/datasketches/tdigest/TDigestDoubleTest.java

@@ -236,6 +236,26 @@ public void deserializeNaNSingleValue() {
     assertThrows(SketchesArgumentException.class, () -> TDigestDouble.heapify(MemorySegment.ofArray(bytes)));
   }
 
+  @Test
+  public void rankBelowFirstCentroidMean() {
+    // the format allows a first centroid of weight greater than 1, so the left tail of
+    // getRank() must stay normalized just like the right tail
+    final byte[] bytes = serializeNonEmpty();
+    MemorySegment.ofArray(bytes).set(ValueLayout.JAVA_DOUBLE_UNALIGNED, 16, -1); // min
+    MemorySegment.ofArray(bytes).set(ValueLayout.JAVA_LONG_UNALIGNED, 40, 100L); // first weight
+    final TDigestDouble td = TDigestDouble.heapify(MemorySegment.ofArray(bytes));
+    final double totalWeight = td.getTotalWeight();
+    assertEquals(td.getRank(-1), 0.5 / totalWeight);
+    assertEquals(td.getRank(-0.5), (1.0 + (((100 / 2.0) - 1.0) * 0.5)) / totalWeight);
+    double previous = 0;
+    for (int i = 0; i <= 100; i++) {
+      final double rank = td.getRank(-1 + (i / 100.0));
+      assertTrue((rank >= 0) && (rank <= 1), "rank out of [0, 1]: " + rank);
+      assertTrue(rank >= previous, "rank not monotonic: " + rank + " after " + previous);
+      previous = rank;
+    }
+  }
+
   @Test
   public void deserializeFromReferenceImplementationDouble() {
     final byte[] bytes = TestUtil.getFileBytes(resPath, "tdigest_ref_k100_n10000_double.sk");