Fix javadoc issues.
diff --git a/src/main/java/org/apache/datasketches/quantilescommon/GenericPartitionBoundaries.java b/src/main/java/org/apache/datasketches/quantilescommon/GenericPartitionBoundaries.java
index 733f784..4db8514 100644
--- a/src/main/java/org/apache/datasketches/quantilescommon/GenericPartitionBoundaries.java
+++ b/src/main/java/org/apache/datasketches/quantilescommon/GenericPartitionBoundaries.java
@@ -83,17 +83,17 @@
* <p>If these results were computed using QuantileSearchCriteria.INCLUSIVE then these sequential boundaries
* are to be interpreted as follows:
* <ul>
- * <li>Partition 1: include all items >= index 0 and <= index 1.</li>
- * <li>Partition 2: include all items > index 1 and <= index 2.</li>
- * <li>Partition N: include all items > index N-1 and <= index N.</li>
+ * <li>Partition 1: include all items ≥ index 0 and ≤ index 1.</li>
+ * <li>Partition 2: include all items > index 1 and ≤ index 2.</li>
+ * <li>Partition N: include all items > index N-1 and ≤ index N.</li>
* </ul>
*
* <p>If these results were computed using QuantileSearchCriteria.EXCLUSIVE then these sequential boundaries
* are to be interpreted as follows:
* <ul>
- * <li>Partition 1: include all items >= index 0 and < index 1.</li>
- * <li>Partition 2: include all items >= index 1 and < index 2.</li>
- * <li>Partition N: include all items >= index N-1 and <= index N.</li>
+ * <li>Partition 1: include all items ≥ index 0 and < index 1.</li>
+ * <li>Partition 2: include all items ≥ index 1 and < index 2.</li>
+ * <li>Partition N: include all items ≥ index N-1 and ≤ index N.</li>
* </ul>
*
* @return an array of boundaries that sequentially define the upper and lower boundaries of partitions.
diff --git a/src/main/java/org/apache/datasketches/quantilescommon/PartitioningFeature.java b/src/main/java/org/apache/datasketches/quantilescommon/PartitioningFeature.java
index 3ff51a3..2c36bb1 100644
--- a/src/main/java/org/apache/datasketches/quantilescommon/PartitioningFeature.java
+++ b/src/main/java/org/apache/datasketches/quantilescommon/PartitioningFeature.java
@@ -37,7 +37,8 @@
* </p>
*
* @param numEquallySized an integer that specifies the number of equally sized partitions between
- * {@link #getMinItem() getMinItem()} and {@link #getMaxItem() getMaxItem()}.
+ * {@link GenericPartitionBoundaries#getMinItem() getMinItem()} and
+ * {@link GenericPartitionBoundaries#getMaxItem() getMaxItem()}.
* This must be a positive integer greater than zero.
* <ul>
* <li>A 1 will return: minItem, maxItem.</li>
@@ -60,7 +61,8 @@
* refers to an approximately equal number of items per partition.
*
* @param numEquallySized an integer that specifies the number of equally sized partitions between
- * {@link #getMinItem() getMinItem()} and {@link #getMaxItem() getMaxItem()}.
+ * {@link GenericPartitionBoundaries#getMinItem() getMinItem()} and
+ * {@link GenericPartitionBoundaries#getMaxItem() getMaxItem()}.
* This must be a positive integer greater than zero.
* <ul>
* <li>A 1 will return: minItem, maxItem.</li>
