kinow commented on code in PR #2832:
URL: https://github.com/apache/jena/pull/2832#discussion_r1835530073
##########
jena-core/src/main/java/org/apache/jena/mem/SparseArraySpliterator.java:
##########
@@ -153,48 +153,46 @@ public Spliterator<E> trySplit() {
}
/**
- * Returns an estimate of the number of elements that would be
- * encountered by a {@link #forEachRemaining} traversal, or returns {@link
- * Long#MAX_VALUE} if infinite, unknown, or too expensive to compute.
+ * Returns an estimate of the number of elements that would be encountered
by a
+ * {@link #forEachRemaining} traversal, or returns {@link Long#MAX_VALUE}
if
+ * infinite, unknown, or too expensive to compute.
+ * <p>
+ * If this Spliterator is {@link #SIZED} and has not yet been partially
traversed
+ * or split, or this Spliterator is {@link #SUBSIZED} and has not yet been
+ * partially traversed, this estimate must be an accurate count of
elements that
+ * would be encountered by a complete traversal. Otherwise, this estimate
may be
+ * arbitrarily inaccurate, but must decrease as specified across
invocations of
+ * {@link #trySplit}.
*
- * <p>If this Spliterator is {@link #SIZED} and has not yet been partially
- * traversed or split, or this Spliterator is {@link #SUBSIZED} and has
- * not yet been partially traversed, this estimate must be an accurate
- * count of elements that would be encountered by a complete traversal.
- * Otherwise, this estimate may be arbitrarily inaccurate, but must
decrease
- * as specified across invocations of {@link #trySplit}.
- *
- * @return the estimated size, or {@code Long.MAX_VALUE} if infinite,
- * unknown, or too expensive to compute.
+ * @return the estimated size, or {@code Long.MAX_VALUE} if infinite,
unknown, or
+ * too expensive to compute.
* @apiNote Even an inexact estimate is often useful and inexpensive to
compute.
- * For example, a sub-spliterator of an approximately balanced binary tree
- * may return a value that estimates the number of elements to be half of
- * that of its parent; if the root Spliterator does not maintain an
- * accurate count, it could estimate size to be the power of two
- * corresponding to its maximum depth.
+ * For example, a sub-spliterator of an approximately balanced binary
tree
+ * may return a value that estimates the number of elements to be half
of
+ * that of its parent; if the root Spliterator does not maintain an
accurate
+ * count, it could estimate size to be the power of two corresponding
to its
+ * maximum depth.
Review Comment:
Looks like indentation matters now for annotations, good to know!
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
