All Downloads are FREE. Search and download functionalities are using the official Maven repository.

java9.util.RASpliterator Maven / Gradle / Ivy

Go to download

Backport of Java 9 java.util.stream API for Android Studio 3+ desugar toolchain, forked from http://sourceforge.net/projects/streamsupport

There is a newer version: 1.7.4
Show newest version
/*
 * Copyright (c) 2016, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.  Oracle designates this
 * particular file as subject to the "Classpath" exception as provided
 * by Oracle in the LICENSE file that accompanied this code.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */
package java9.util;

import java.util.AbstractList;
import java.util.Comparator;
import java.util.ConcurrentModificationException;
import java.util.List;

import java9.util.function.Consumer;

/**
 * An index-based split-by-two, lazily initialized Spliterator covering
 * a List that access elements via {@link List#get}.
 *
 * If access results in an IndexOutOfBoundsException then a
 * ConcurrentModificationException is thrown instead (since the list has
 * been structurally modified while traversing).
 *
 * If the List is an instance of AbstractList then concurrent modification
 * checking is performed using the AbstractList's modCount field.
 */
final class RASpliterator implements Spliterator {
    private final List list;
    private int index; // current index, modified on advance/split
    private int fence; // -1 until used; then one past last index

    // The following fields are valid if covering an AbstractList
    private final AbstractList alist;
    private int expectedModCount; // initialized when fence set

    /** Create new spliterator covering the given range */
    private RASpliterator(List list, int origin, int fence,
            int expectedModCount) {
        this.list = list;
        this.index = origin;
        this.fence = fence;

        this.alist = list instanceof AbstractList ? (AbstractList) list
                : null;
        this.expectedModCount = expectedModCount;
    }

    static  Spliterator spliterator(List list) {
        return new RASpliterator(list, 0, -1, 0);
    }

    private int getFence() { // initialize fence to size on first use
        int hi; // (a specialized variant appears in method forEachRemaining)
        List lst = list;
        if ((hi = fence) < 0) {
            if (alist != null) {
                expectedModCount = getModCount(alist);
            }
            hi = fence = lst.size();
        }
        return hi;
    }

    public Spliterator trySplit() {
        int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
        return (lo >= mid) ? null : // divide range in half unless too small
                new RASpliterator(list, lo, index = mid,
                        expectedModCount);
    }

    public boolean tryAdvance(Consumer action) {
        Objects.requireNonNull(action);
        int hi = getFence(), i = index;
        if (i < hi) {
            index = i + 1;
            action.accept(list.get(i));
            checkAbsListModCount(alist, expectedModCount);
            return true;
        }
        return false;
    }

    public void forEachRemaining(Consumer action) {
        Objects.requireNonNull(action);
        List lst = list;
        int hi = getFence();
        int i = index;
        index = hi;
        try {
            for (; i < hi; ++i) {
                action.accept(lst.get(i));
            }
        } catch (IndexOutOfBoundsException e) {
            // action must have modified the list
            throw new ConcurrentModificationException();
        }
        checkAbsListModCount(alist, expectedModCount);
    }

    public long estimateSize() {
        return (long) (getFence() - index);
    }

    public int characteristics() {
        return Spliterator.ORDERED | Spliterator.SIZED | Spliterator.SUBSIZED;
    }

    private static void checkAbsListModCount(AbstractList alist, int expectedModCount) {
        if (alist != null && getModCount(alist) != expectedModCount) {
            throw new ConcurrentModificationException();
        }
    }

    private static  int getModCount(List lst) {
        return U.getInt(lst, MODCOUNT_OFF);
    }

    // Unsafe mechanics
    private static final sun.misc.Unsafe U = UnsafeAccess.unsafe;
    private static final long MODCOUNT_OFF;
    static {
        try {
            MODCOUNT_OFF = U.objectFieldOffset(AbstractList.class
                    .getDeclaredField("modCount"));
        } catch (Exception e) {
            throw new Error(e);
        }
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy