equal
deleted
inserted
replaced
82 * |
82 * |
83 * <p>Spliterators can provide an estimate of the number of remaining elements |
83 * <p>Spliterators can provide an estimate of the number of remaining elements |
84 * via the {@link #estimateSize} method. Ideally, as reflected in characteristic |
84 * via the {@link #estimateSize} method. Ideally, as reflected in characteristic |
85 * {@link #SIZED}, this value corresponds exactly to the number of elements |
85 * {@link #SIZED}, this value corresponds exactly to the number of elements |
86 * that would be encountered in a successful traversal. However, even when not |
86 * that would be encountered in a successful traversal. However, even when not |
87 * exactly known, an estimated value value may still be useful to operations |
87 * exactly known, an estimated value may still be useful to operations |
88 * being performed on the source, such as helping to determine whether it is |
88 * being performed on the source, such as helping to determine whether it is |
89 * preferable to split further or traverse the remaining elements sequentially. |
89 * preferable to split further or traverse the remaining elements sequentially. |
90 * |
90 * |
91 * <p>Despite their obvious utility in parallel algorithms, spliterators are not |
91 * <p>Despite their obvious utility in parallel algorithms, spliterators are not |
92 * expected to be thread-safe; instead, implementations of parallel algorithms |
92 * expected to be thread-safe; instead, implementations of parallel algorithms |