Java Spliterators.spliterator方法代碼示例

import java.util.Spliterators; //導入方法依賴的package包/類
@Override
public Spliterator<E> trySplit() {
  Node<E> p;
  int s = getEst();
  if (s > 1 && (p = current) != null) {
    int n = batch + BATCH_UNIT;
    if (n > s) {
      n = s;
    }
    if (n > MAX_BATCH) {
      n = MAX_BATCH;
    }
    Object[] a = new Object[n];
    int j = 0;
    do {
      a[j++] = p.item;
    } while ((p = p.next) != null && j < n);
    current = p;
    batch = j;
    est = s - j;
    return Spliterators.spliterator(a, 0, j, Spliterator.ORDERED);
  }
  return null;
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
public Spliterator<E> trySplit() {
    Node<E> p, q;
    if ((p = current()) == null || (q = p.next) == null)
        return null;
    int i = 0, n = batch = Math.min(batch + 1, MAX_BATCH);
    Object[] a = null;
    do {
        final E e;
        if ((e = p.item) != null) {
            if (a == null)
                a = new Object[n];
            a[i++] = e;
        }
        if (p == (p = q))
            p = first();
    } while (p != null && (q = p.next) != null && i < n);
    setCurrent(p);
    return (i == 0) ? null :
        Spliterators.spliterator(a, 0, i, (Spliterator.ORDERED |
                                           Spliterator.NONNULL |
                                           Spliterator.CONCURRENT));
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
public Spliterator<E> spliterator() {
    synchronized (l.lock) {
        return Spliterators.spliterator(
                getArrayChecked(), offset, offset + size,
                Spliterator.IMMUTABLE | Spliterator.ORDERED);
    }
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
public Spliterator<E> trySplit() {
    Node p;
    final LinkedTransferQueue<E> q = this.queue;
    int b = batch;
    int n = (b <= 0) ? 1 : (b >= MAX_BATCH) ? MAX_BATCH : b + 1;
    if (!exhausted &&
        ((p = current) != null || (p = q.firstDataNode()) != null) &&
        p.next != null) {
        Object[] a = new Object[n];
        int i = 0;
        do {
            Object e = p.item;
            if (e != p && (a[i] = e) != null)
                ++i;
            if (p == (p = p.next))
                p = q.firstDataNode();
        } while (p != null && i < n && p.isData);
        if ((current = p) == null)
            exhausted = true;
        if (i > 0) {
            batch = i;
            return Spliterators.spliterator
                (a, 0, i, Spliterator.ORDERED | Spliterator.NONNULL |
                 Spliterator.CONCURRENT);
        }
    }
    return null;
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
public Spliterator<E> trySplit() {
    Node<E> h;
    final LinkedBlockingQueue<E> q = this.queue;
    int b = batch;
    int n = (b <= 0) ? 1 : (b >= MAX_BATCH) ? MAX_BATCH : b + 1;
    if (!exhausted &&
        ((h = current) != null || (h = q.head.next) != null) &&
        h.next != null) {
        Object[] a = new Object[n];
        int i = 0;
        Node<E> p = current;
        q.fullyLock();
        try {
            if (p != null || (p = q.head.next) != null) {
                do {
                    if ((a[i] = p.item) != null)
                        ++i;
                } while ((p = p.next) != null && i < n);
            }
        } finally {
            q.fullyUnlock();
        }
        if ((current = p) == null) {
            est = 0L;
            exhausted = true;
        }
        else if ((est -= i) < 0L)
            est = 0L;
        if (i > 0) {
            batch = i;
            return Spliterators.spliterator
                (a, 0, i, Spliterator.ORDERED | Spliterator.NONNULL |
                 Spliterator.CONCURRENT);
        }
    }
    return null;
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
/**
 * {@inheritDoc}
 */
@Override
public Spliterator<Item> spliterator() {
    return new Spliterator<Item>() {
        int currentElementIdx = 0;

        /**
         * {@inheritDoc}
         */
        @Override
        public boolean tryAdvance(Consumer<? super Item> action) {
            if (null == action) {
                throw new NullPointerException();
            }
            if (currentElementIdx < topPosition) {
                action.accept(internalArray[currentElementIdx]);
                currentElementIdx++;
                return true;
            } else {
                return false;
            }
        }

        /**
         * {@inheritDoc}
         */
        @Override
        public Spliterator<Item> trySplit() {
            return Spliterators.spliterator(
                    Arrays.copyOfRange(internalArray, currentElementIdx, internalArray.length)
                    , IMMUTABLE | SIZED
            );
        }

        /**
         * {@inheritDoc}
         */
        @Override
        public long estimateSize() {
            return size() - currentElementIdx;
        }

        /**
         * {@inheritDoc}
         */
        @Override
        public int characteristics() {
            return IMMUTABLE | SIZED;
        }
    };
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
Spliterator<Entry<K, V>> entrySpliterator() {
  return Spliterators.spliterator(
      entryIterator(), size(), (this instanceof SetMultimap) ? Spliterator.DISTINCT : 0);
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
@Override
public Spliterator<E> spliterator() {
  return Spliterators.spliterator(array, SPLITERATOR_CHARACTERISTICS);
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
Spliterator<Entry<K, V>> entrySpliterator() {
  return Spliterators.spliterator(
      entryIterator(),
      size(),
      Spliterator.DISTINCT | Spliterator.NONNULL | Spliterator.IMMUTABLE | Spliterator.ORDERED);
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
@Override
public Spliterator<E> spliterator() {
  return Spliterators.spliterator(this, SPLITERATOR_CHARACTERISTICS);
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
@Override
public Spliterator<E> spliterator() {
  return Spliterators.spliterator(elements, SPLITERATOR_CHARACTERISTICS);
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
@Override
public Spliterator<Entry<K, V>> spliterator() {
  return Spliterators.spliterator(entries, ImmutableSet.SPLITERATOR_CHARACTERISTICS);
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
private Spliterator.OfInt spliterator() {
  return Spliterators.spliterator(array, start, end, Spliterator.IMMUTABLE | Spliterator.ORDERED);
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
/**
 * Returns a Spliterator over entries in this object.
 * A default implementation is provided which is equivalent to the
 * default implementation on the Collection interface.
 * @return a Spliterator over entries in this object
 */
public default Spliterator<Entry> spliterator() {
    return Spliterators.spliterator(this.iterator(), this.size(), 0);
}
 

import java.util.Spliterators; //導入方法依賴的package包/類
/**
 * Returns a {@link Spliterator} over the elements in this queue.
 *
 * <p>The returned spliterator is
 * <a href="package-summary.html#Weakly"><i>weakly consistent</i></a>.
 *
 * <p>The {@code Spliterator} reports {@link Spliterator#CONCURRENT},
 * {@link Spliterator#ORDERED}, and {@link Spliterator#NONNULL}.
 *
 * @implNote
 * The {@code Spliterator} implements {@code trySplit} to permit limited
 * parallelism.
 *
 * @return a {@code Spliterator} over the elements in this queue
 * @since 1.8
 */
public Spliterator<E> spliterator() {
    return Spliterators.spliterator
        (this, Spliterator.ORDERED | Spliterator.NONNULL |
         Spliterator.CONCURRENT);
}