52     private static long calcSize(long size, long skip, long limit) {  in calcSize()  argument
53         return size >= 0 ? Math.max(-1, Math.min(size - skip, limit)) : -1;  in calcSize()
64     private static long calcSliceFence(long skip, long limit) {  in calcSliceFence()  argument
65         long sliceFence = limit >= 0 ? skip + limit : Long.MAX_VALUE;  in calcSliceFence()
78                                                              long skip, long limit) {  in sliceSpliterator()  argument
80         long sliceFence = calcSliceFence(skip, limit);  in sliceSpliterator()
110                                         long skip, long limit) {  in makeRef()  argument
115                                                       flags(limit)) {  in makeRef()
117                                                          long skip, long limit, long sizeIfKnown) {  in makeRef()
121                     limit = limit >= 0 ? Math.min(limit, sizeIfKnown - skip) : sizeIfKnown - skip;  in makeRef()
124                 return new StreamSpliterators.UnorderedSliceSpliterator.OfRef<>(s, skip, limit);  in makeRef()
134                             calcSliceFence(skip, limit));  in makeRef()
138                             skip, limit, size);  in makeRef()
149 …              return new SliceTask<>(this, helper, spliterator, Nodes.castingArray(), skip, limit).  in makeRef()
165 …         Spliterator<P_IN> s = sliceSpliterator(helper.getSourceShape(), spliterator, skip, limit);  in makeRef()
170                             skip, limit, size);  in makeRef()
178                     return new SliceTask<>(this, helper, spliterator, generator, skip, limit).  in makeRef()
187                     long m = limit >= 0 ? limit : Long.MAX_VALUE;  in makeRef()
226                                     long skip, long limit) {
231                                                    flags(limit)) {
233                     Spliterator.OfInt s, long skip, long limit, long sizeIfKnown) {
237                     limit = limit >= 0 ? Math.min(limit, sizeIfKnown - skip) : sizeIfKnown - skip;
240                 return new StreamSpliterators.UnorderedSliceSpliterator.OfInt(s, skip, limit);
251                             calcSliceFence(skip, limit));
255                             skip, limit, size);
258                     return new SliceTask<>(this, helper, spliterator, Integer[]::new, skip, limit).
274 …         Spliterator<P_IN> s = sliceSpliterator(helper.getSourceShape(), spliterator, skip, limit);
279                             skip, limit, size);
287                     return new SliceTask<>(this, helper, spliterator, generator, skip, limit).
296                     long m = limit >= 0 ? limit : Long.MAX_VALUE;
335                                       long skip, long limit) {
340                                                  flags(limit)) {
342                     Spliterator.OfLong s, long skip, long limit, long sizeIfKnown) {
346                     limit = limit >= 0 ? Math.min(limit, sizeIfKnown - skip) : sizeIfKnown - skip;
349                 return new StreamSpliterators.UnorderedSliceSpliterator.OfLong(s, skip, limit);
360                             calcSliceFence(skip, limit));
364                             skip, limit, size);
367                     return new SliceTask<>(this, helper, spliterator, Long[]::new, skip, limit).
383 …         Spliterator<P_IN> s = sliceSpliterator(helper.getSourceShape(), spliterator, skip, limit);
388                             skip, limit, size);
396                     return new SliceTask<>(this, helper, spliterator, generator, skip, limit).
405                     long m = limit >= 0 ? limit : Long.MAX_VALUE;
444                                           long skip, long limit) {
449                                                      flags(limit)) {
451                     Spliterator.OfDouble s, long skip, long limit, long sizeIfKnown) {
455                     limit = limit >= 0 ? Math.min(limit, sizeIfKnown - skip) : sizeIfKnown - skip;
458                 return new StreamSpliterators.UnorderedSliceSpliterator.OfDouble(s, skip, limit);
469                             calcSliceFence(skip, limit));
473                             skip, limit, size);
476                     return new SliceTask<>(this, helper, spliterator, Double[]::new, skip, limit).
492 …         Spliterator<P_IN> s = sliceSpliterator(helper.getSourceShape(), spliterator, skip, limit);
497                             skip, limit, size);
505                     return new SliceTask<>(this, helper, spliterator, generator, skip, limit).
514                     long m = limit >= 0 ? limit : Long.MAX_VALUE;
543     private static int flags(long limit) {
544         return StreamOpFlag.NOT_SIZED | ((limit != -1) ? StreamOpFlag.IS_SHORT_CIRCUIT : 0);