diff --git a/solr/core/src/java/org/apache/solr/util/hll/HLL.java b/solr/core/src/java/org/apache/solr/util/hll/HLL.java index 4210b18c4f2..432401bfc0f 100644 --- a/solr/core/src/java/org/apache/solr/util/hll/HLL.java +++ b/solr/core/src/java/org/apache/solr/util/hll/HLL.java @@ -26,12 +26,12 @@ import com.carrotsearch.hppc.cursors.LongCursor; /** * A probabilistic set of hashed long elements. Useful for computing - * the approximate cardinality of a stream of data in very small storage.

+ * the approximate cardinality of a stream of data in very small storage. * * A modified version of the * 'HyperLogLog' data structure and algorithm is used, which combines both * probabilistic and non-probabilistic techniques to improve the accuracy and - * storage requirements of the original algorithm.

+ * storage requirements of the original algorithm. * * More specifically, initializing and storing a new {@link HLL} will * allocate a sentinel value symbolizing the empty set ({@link HLLType#EMPTY}). @@ -40,7 +40,7 @@ import com.carrotsearch.hppc.cursors.LongCursor; * be sacrificed for memory footprint: the values in the sorted list are * "promoted" to a "{@link HLLType#SPARSE}" map-based HyperLogLog structure. * Finally, when enough registers are set, the map-based HLL will be converted - * to a bit-packed "{@link HLLType#FULL}" HyperLogLog structure.

+ * to a bit-packed "{@link HLLType#FULL}" HyperLogLog structure. * * This data structure is interoperable with the implementations found at: *