// 
// Decompiled by Procyon v0.6.0
// 

package it.unimi.dsi.fastutil.shorts;

import java.util.Spliterator;
import java.io.Serializable;
import java.util.NoSuchElementException;
import it.unimi.dsi.fastutil.BigListIterator;
import java.util.Objects;
import it.unimi.dsi.fastutil.BigList;
import it.unimi.dsi.fastutil.BigArrays;
import java.util.RandomAccess;
import it.unimi.dsi.fastutil.ints.IntSpliterator;
import java.util.Iterator;
import java.util.Collection;

public abstract class AbstractShortBigList extends AbstractShortCollection implements ShortBigList, ShortStack
{
    protected AbstractShortBigList() {
    }
    
    protected void ensureIndex(final long index) {
        if (index < 0L) {
            throw new IndexOutOfBoundsException("Index (" + index + ") is negative");
        }
        if (index > this.size64()) {
            throw new IndexOutOfBoundsException("Index (" + index + ") is greater than list size (" + this.size64() + ")");
        }
    }
    
    protected void ensureRestrictedIndex(final long index) {
        if (index < 0L) {
            throw new IndexOutOfBoundsException("Index (" + index + ") is negative");
        }
        if (index >= this.size64()) {
            throw new IndexOutOfBoundsException("Index (" + index + ") is greater than or equal to list size (" + this.size64() + ")");
        }
    }
    
    @Override
    public void add(final long index, final short k) {
        throw new UnsupportedOperationException();
    }
    
    @Override
    public boolean add(final short k) {
        this.add(this.size64(), k);
        return true;
    }
    
    @Override
    public short removeShort(final long i) {
        throw new UnsupportedOperationException();
    }
    
    @Override
    public short set(final long index, final short k) {
        throw new UnsupportedOperationException();
    }
    
    @Override
    public boolean addAll(long index, final Collection<? extends Short> c) {
        this.ensureIndex(index);
        final Iterator<? extends Short> i = c.iterator();
        final boolean retVal = i.hasNext();
        while (i.hasNext()) {
            this.add(index++, (Short)i.next());
        }
        return retVal;
    }
    
    @Override
    public boolean addAll(final Collection<? extends Short> c) {
        return this.addAll(this.size64(), c);
    }
    
    @Override
    public ShortBigListIterator iterator() {
        return this.listIterator();
    }
    
    @Override
    public ShortBigListIterator listIterator() {
        return this.listIterator(0L);
    }
    
    @Override
    public ShortBigListIterator listIterator(final long index) {
        this.ensureIndex(index);
        return new ShortBigListIterators.AbstractIndexBasedBigListIterator(0L, index) {
            @Override
            protected final short get(final long i) {
                return AbstractShortBigList.this.getShort(i);
            }
            
            @Override
            protected final void add(final long i, final short k) {
                AbstractShortBigList.this.add(i, k);
            }
            
            @Override
            protected final void set(final long i, final short k) {
                AbstractShortBigList.this.set(i, k);
            }
            
            @Override
            protected final void remove(final long i) {
                AbstractShortBigList.this.removeShort(i);
            }
            
            @Override
            protected final long getMaxPos() {
                return AbstractShortBigList.this.size64();
            }
        };
    }
    
    @Override
    public IntSpliterator intSpliterator() {
        if (this instanceof RandomAccess) {
            return ShortSpliterators.widen(this.spliterator());
        }
        return super.intSpliterator();
    }
    
    @Override
    public boolean contains(final short k) {
        return this.indexOf(k) >= 0L;
    }
    
    @Override
    public long indexOf(final short k) {
        final ShortBigListIterator i = this.listIterator();
        while (i.hasNext()) {
            final short e = i.nextShort();
            if (k == e) {
                return i.previousIndex();
            }
        }
        return -1L;
    }
    
    @Override
    public long lastIndexOf(final short k) {
        final ShortBigListIterator i = this.listIterator(this.size64());
        while (i.hasPrevious()) {
            final short e = i.previousShort();
            if (k == e) {
                return i.nextIndex();
            }
        }
        return -1L;
    }
    
    @Override
    public void size(final long size) {
        long i = this.size64();
        if (size > i) {
            while (i++ < size) {
                this.add((short)0);
            }
        }
        else {
            while (i-- != size) {
                this.remove(i);
            }
        }
    }
    
    @Override
    public ShortBigList subList(final long from, final long to) {
        this.ensureIndex(from);
        this.ensureIndex(to);
        if (from > to) {
            throw new IndexOutOfBoundsException("Start index (" + from + ") is greater than end index (" + to + ")");
        }
        return (this instanceof RandomAccess) ? new ShortRandomAccessSubList(this, from, to) : new ShortSubList(this, from, to);
    }
    
    @Override
    public void forEach(final ShortConsumer action) {
        if (this instanceof RandomAccess) {
            for (long i = 0L, max = this.size64(); i < max; ++i) {
                action.accept(this.getShort(i));
            }
        }
        else {
            super.forEach(action);
        }
    }
    
    @Override
    public void removeElements(final long from, final long to) {
        this.ensureIndex(to);
        final ShortBigListIterator i = this.listIterator(from);
        long n = to - from;
        if (n < 0L) {
            throw new IllegalArgumentException("Start index (" + from + ") is greater than end index (" + to + ")");
        }
        while (n-- != 0L) {
            i.nextShort();
            i.remove();
        }
    }
    
    @Override
    public void addElements(long index, final short[][] a, long offset, long length) {
        this.ensureIndex(index);
        BigArrays.ensureOffsetLength(a, offset, length);
        if (this instanceof RandomAccess) {
            while (length-- != 0L) {
                this.add(index++, BigArrays.get(a, offset++));
            }
        }
        else {
            final ShortBigListIterator iter = this.listIterator(index);
            while (length-- != 0L) {
                iter.add(BigArrays.get(a, offset++));
            }
        }
    }
    
    @Override
    public void addElements(final long index, final short[][] a) {
        this.addElements(index, a, 0L, BigArrays.length(a));
    }
    
    @Override
    public void getElements(final long from, final short[][] a, long offset, long length) {
        this.ensureIndex(from);
        BigArrays.ensureOffsetLength(a, offset, length);
        if (from + length > this.size64()) {
            throw new IndexOutOfBoundsException("End index (" + (from + length) + ") is greater than list size (" + this.size64() + ")");
        }
        if (this instanceof RandomAccess) {
            long current = from;
            while (length-- != 0L) {
                BigArrays.set(a, offset++, this.getShort(current++));
            }
        }
        else {
            final ShortBigListIterator i = this.listIterator(from);
            while (length-- != 0L) {
                BigArrays.set(a, offset++, i.nextShort());
            }
        }
    }
    
    @Override
    public void setElements(final long index, final short[][] a, final long offset, final long length) {
        this.ensureIndex(index);
        BigArrays.ensureOffsetLength(a, offset, length);
        if (index + length > this.size64()) {
            throw new IndexOutOfBoundsException("End index (" + (index + length) + ") is greater than list size (" + this.size64() + ")");
        }
        if (this instanceof RandomAccess) {
            for (long i = 0L; i < length; ++i) {
                this.set(i + index, BigArrays.get(a, i + offset));
            }
        }
        else {
            final ShortBigListIterator iter = this.listIterator(index);
            long j = 0L;
            while (j < length) {
                iter.nextShort();
                iter.set(BigArrays.get(a, offset + j++));
            }
        }
    }
    
    @Override
    public void clear() {
        this.removeElements(0L, this.size64());
    }
    
    @Deprecated
    @Override
    public int size() {
        return (int)Math.min(2147483647L, this.size64());
    }
    
    @Override
    public int hashCode() {
        final ShortIterator i = this.iterator();
        int h = 1;
        long s = this.size64();
        while (s-- != 0L) {
            final short k = i.nextShort();
            h = 31 * h + k;
        }
        return h;
    }
    
    @Override
    public boolean equals(final Object o) {
        if (o == this) {
            return true;
        }
        if (!(o instanceof BigList)) {
            return false;
        }
        final BigList<?> l = (BigList<?>)o;
        long s = this.size64();
        if (s != l.size64()) {
            return false;
        }
        if (l instanceof ShortBigList) {
            final ShortBigListIterator i1 = this.listIterator();
            final ShortBigListIterator i2 = ((ShortBigList)l).listIterator();
            while (s-- != 0L) {
                if (i1.nextShort() != i2.nextShort()) {
                    return false;
                }
            }
            return true;
        }
        final BigListIterator<?> i3 = this.listIterator();
        final BigListIterator<?> i4 = l.listIterator();
        while (s-- != 0L) {
            if (!Objects.equals(i3.next(), i4.next())) {
                return false;
            }
        }
        return true;
    }
    
    @Override
    public int compareTo(final BigList<? extends Short> l) {
        if (l == this) {
            return 0;
        }
        if (l instanceof ShortBigList) {
            final ShortBigListIterator i1 = this.listIterator();
            final ShortBigListIterator i2 = ((ShortBigList)l).listIterator();
            while (i1.hasNext() && i2.hasNext()) {
                final short e1 = i1.nextShort();
                final short e2 = i2.nextShort();
                final int r;
                if ((r = Short.compare(e1, e2)) != 0) {
                    return r;
                }
            }
            return i2.hasNext() ? -1 : (i1.hasNext() ? 1 : 0);
        }
        final BigListIterator<? extends Short> i3 = this.listIterator();
        final BigListIterator<? extends Short> i4 = l.listIterator();
        while (i3.hasNext() && i4.hasNext()) {
            final int r;
            if ((r = i3.next().compareTo(i4.next())) != 0) {
                return r;
            }
        }
        return i4.hasNext() ? -1 : (i3.hasNext() ? 1 : 0);
    }
    
    @Override
    public void push(final short o) {
        this.add(o);
    }
    
    @Override
    public short popShort() {
        if (this.isEmpty()) {
            throw new NoSuchElementException();
        }
        return this.removeShort(this.size64() - 1L);
    }
    
    @Override
    public short topShort() {
        if (this.isEmpty()) {
            throw new NoSuchElementException();
        }
        return this.getShort(this.size64() - 1L);
    }
    
    @Override
    public short peekShort(final int i) {
        return this.getShort(this.size64() - 1L - i);
    }
    
    @Override
    public boolean rem(final short k) {
        final long index = this.indexOf(k);
        if (index == -1L) {
            return false;
        }
        this.removeShort(index);
        return true;
    }
    
    @Override
    public boolean addAll(final long index, final ShortCollection c) {
        return this.addAll(index, (Collection<? extends Short>)c);
    }
    
    @Override
    public boolean addAll(final ShortCollection c) {
        return this.addAll(this.size64(), c);
    }
    
    @Deprecated
    @Override
    public void add(final long index, final Short ok) {
        this.add(index, (short)ok);
    }
    
    @Deprecated
    @Override
    public Short set(final long index, final Short ok) {
        return this.set(index, (short)ok);
    }
    
    @Deprecated
    @Override
    public Short get(final long index) {
        return this.getShort(index);
    }
    
    @Deprecated
    @Override
    public long indexOf(final Object ok) {
        return this.indexOf((short)ok);
    }
    
    @Deprecated
    @Override
    public long lastIndexOf(final Object ok) {
        return this.lastIndexOf((short)ok);
    }
    
    @Deprecated
    @Override
    public Short remove(final long index) {
        return this.removeShort(index);
    }
    
    @Deprecated
    @Override
    public void push(final Short o) {
        this.push((short)o);
    }
    
    @Deprecated
    @Override
    public Short pop() {
        return this.popShort();
    }
    
    @Deprecated
    @Override
    public Short top() {
        return this.topShort();
    }
    
    @Deprecated
    @Override
    public Short peek(final int i) {
        return this.peekShort(i);
    }
    
    @Override
    public String toString() {
        final StringBuilder s = new StringBuilder();
        final ShortIterator i = this.iterator();
        long n = this.size64();
        boolean first = true;
        s.append("[");
        while (n-- != 0L) {
            if (first) {
                first = false;
            }
            else {
                s.append(", ");
            }
            final short k = i.nextShort();
            s.append(String.valueOf(k));
        }
        s.append("]");
        return s.toString();
    }
    
    static final class IndexBasedSpliterator extends ShortBigSpliterators.LateBindingSizeIndexBasedSpliterator
    {
        final ShortBigList l;
        
        IndexBasedSpliterator(final ShortBigList l, final long pos) {
            super(pos);
            this.l = l;
        }
        
        IndexBasedSpliterator(final ShortBigList l, final long pos, final long maxPos) {
            super(pos, maxPos);
            this.l = l;
        }
        
        @Override
        protected final long getMaxPosFromBackingStore() {
            return this.l.size64();
        }
        
        @Override
        protected final short get(final long i) {
            return this.l.getShort(i);
        }
        
        @Override
        protected final IndexBasedSpliterator makeForSplit(final long pos, final long maxPos) {
            return new IndexBasedSpliterator(this.l, pos, maxPos);
        }
    }
    
    public static class ShortSubList extends AbstractShortBigList implements Serializable
    {
        private static final long serialVersionUID = -7046029254386353129L;
        protected final ShortBigList l;
        protected final long from;
        protected long to;
        
        public ShortSubList(final ShortBigList l, final long from, final long to) {
            this.l = l;
            this.from = from;
            this.to = to;
        }
        
        private boolean assertRange() {
            assert this.from <= this.l.size64();
            assert this.to <= this.l.size64();
            assert this.to >= this.from;
            return true;
        }
        
        @Override
        public boolean add(final short k) {
            this.l.add(this.to, k);
            ++this.to;
            assert this.assertRange();
            return true;
        }
        
        @Override
        public void add(final long index, final short k) {
            this.ensureIndex(index);
            this.l.add(this.from + index, k);
            ++this.to;
            assert this.assertRange();
        }
        
        @Override
        public boolean addAll(final long index, final Collection<? extends Short> c) {
            this.ensureIndex(index);
            this.to += c.size();
            return this.l.addAll(this.from + index, c);
        }
        
        @Override
        public short getShort(final long index) {
            this.ensureRestrictedIndex(index);
            return this.l.getShort(this.from + index);
        }
        
        @Override
        public short removeShort(final long index) {
            this.ensureRestrictedIndex(index);
            --this.to;
            return this.l.removeShort(this.from + index);
        }
        
        @Override
        public short set(final long index, final short k) {
            this.ensureRestrictedIndex(index);
            return this.l.set(this.from + index, k);
        }
        
        @Override
        public long size64() {
            return this.to - this.from;
        }
        
        @Override
        public void getElements(final long from, final short[][] a, final long offset, final long length) {
            this.ensureIndex(from);
            if (from + length > this.size64()) {
                throw new IndexOutOfBoundsException("End index (" + from + length + ") is greater than list size (" + this.size64() + ")");
            }
            this.l.getElements(this.from + from, a, offset, length);
        }
        
        @Override
        public void removeElements(final long from, final long to) {
            this.ensureIndex(from);
            this.ensureIndex(to);
            this.l.removeElements(this.from + from, this.from + to);
            this.to -= to - from;
            assert this.assertRange();
        }
        
        @Override
        public void addElements(final long index, final short[][] a, final long offset, final long length) {
            this.ensureIndex(index);
            this.l.addElements(this.from + index, a, offset, length);
            this.to += length;
            assert this.assertRange();
        }
        
        @Override
        public ShortBigListIterator listIterator(final long index) {
            this.ensureIndex(index);
            return (this.l instanceof RandomAccess) ? new RandomAccessIter(index) : new ParentWrappingIter(this.l.listIterator(index + this.from));
        }
        
        @Override
        public ShortSpliterator spliterator() {
            return (this.l instanceof RandomAccess) ? new IndexBasedSpliterator(this.l, this.from, this.to) : super.spliterator();
        }
        
        @Override
        public IntSpliterator intSpliterator() {
            if (this.l instanceof RandomAccess) {
                return ShortSpliterators.widen(this.spliterator());
            }
            return super.intSpliterator();
        }
        
        @Override
        public ShortBigList subList(final long from, final long to) {
            this.ensureIndex(from);
            this.ensureIndex(to);
            if (from > to) {
                throw new IllegalArgumentException("Start index (" + from + ") is greater than end index (" + to + ")");
            }
            return new ShortSubList(this, from, to);
        }
        
        @Override
        public boolean rem(final short k) {
            final long index = this.indexOf(k);
            if (index == -1L) {
                return false;
            }
            --this.to;
            this.l.removeShort(this.from + index);
            assert this.assertRange();
            return true;
        }
        
        @Override
        public boolean addAll(final long index, final ShortCollection c) {
            return super.addAll(index, c);
        }
        
        @Override
        public boolean addAll(final long index, final ShortBigList l) {
            return super.addAll(index, l);
        }
        
        private final class RandomAccessIter extends ShortBigListIterators.AbstractIndexBasedBigListIterator
        {
            RandomAccessIter(final long pos) {
                super(0L, pos);
            }
            
            @Override
            protected final short get(final long i) {
                return ShortSubList.this.l.getShort(ShortSubList.this.from + i);
            }
            
            @Override
            protected final void add(final long i, final short k) {
                ShortSubList.this.add(i, k);
            }
            
            @Override
            protected final void set(final long i, final short k) {
                ShortSubList.this.set(i, k);
            }
            
            @Override
            protected final void remove(final long i) {
                ShortSubList.this.removeShort(i);
            }
            
            @Override
            protected final long getMaxPos() {
                return ShortSubList.this.to - ShortSubList.this.from;
            }
            
            @Override
            public void add(final short k) {
                super.add(k);
                assert ShortSubList.this.assertRange();
            }
            
            @Override
            public void remove() {
                super.remove();
                assert ShortSubList.this.assertRange();
            }
        }
        
        private class ParentWrappingIter implements ShortBigListIterator
        {
            private ShortBigListIterator parent;
            
            ParentWrappingIter(final ShortBigListIterator parent) {
                this.parent = parent;
            }
            
            @Override
            public long nextIndex() {
                return this.parent.nextIndex() - ShortSubList.this.from;
            }
            
            @Override
            public long previousIndex() {
                return this.parent.previousIndex() - ShortSubList.this.from;
            }
            
            @Override
            public boolean hasNext() {
                return this.parent.nextIndex() < ShortSubList.this.to;
            }
            
            @Override
            public boolean hasPrevious() {
                return this.parent.previousIndex() >= ShortSubList.this.from;
            }
            
            @Override
            public short nextShort() {
                if (!this.hasNext()) {
                    throw new NoSuchElementException();
                }
                return this.parent.nextShort();
            }
            
            @Override
            public short previousShort() {
                if (!this.hasPrevious()) {
                    throw new NoSuchElementException();
                }
                return this.parent.previousShort();
            }
            
            @Override
            public void add(final short k) {
                this.parent.add(k);
            }
            
            @Override
            public void set(final short k) {
                this.parent.set(k);
            }
            
            @Override
            public void remove() {
                this.parent.remove();
            }
            
            @Override
            public long back(final long n) {
                if (n < 0L) {
                    throw new IllegalArgumentException("Argument must be nonnegative: " + n);
                }
                final long currentPos = this.parent.previousIndex();
                long parentNewPos = currentPos - n;
                if (parentNewPos < ShortSubList.this.from - 1L) {
                    parentNewPos = ShortSubList.this.from - 1L;
                }
                final long toSkip = parentNewPos - currentPos;
                return this.parent.back(toSkip);
            }
            
            @Override
            public long skip(final long n) {
                if (n < 0L) {
                    throw new IllegalArgumentException("Argument must be nonnegative: " + n);
                }
                final long currentPos = this.parent.nextIndex();
                long parentNewPos = currentPos + n;
                if (parentNewPos > ShortSubList.this.to) {
                    parentNewPos = ShortSubList.this.to;
                }
                final long toSkip = parentNewPos - currentPos;
                return this.parent.skip(toSkip);
            }
        }
    }
    
    public static class ShortRandomAccessSubList extends ShortSubList implements RandomAccess
    {
        private static final long serialVersionUID = -107070782945191929L;
        
        public ShortRandomAccessSubList(final ShortBigList l, final long from, final long to) {
            super(l, from, to);
        }
        
        @Override
        public ShortBigList subList(final long from, final long to) {
            this.ensureIndex(from);
            this.ensureIndex(to);
            if (from > to) {
                throw new IllegalArgumentException("Start index (" + from + ") is greater than end index (" + to + ")");
            }
            return new ShortRandomAccessSubList(this, from, to);
        }
    }
}