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

package it.unimi.dsi.fastutil.shorts;

import it.unimi.dsi.fastutil.objects.AbstractReferenceCollection;
import it.unimi.dsi.fastutil.objects.ObjectSpliterators;
import java.util.Spliterator;
import it.unimi.dsi.fastutil.objects.ObjectSpliterator;
import java.util.function.Consumer;
import java.util.NoSuchElementException;
import it.unimi.dsi.fastutil.objects.AbstractObjectSet;
import java.util.Set;
import java.util.Collection;
import it.unimi.dsi.fastutil.objects.ObjectSet;
import java.io.ObjectInputStream;
import java.io.IOException;
import java.io.ObjectOutputStream;
import java.util.Iterator;
import java.util.Map;
import it.unimi.dsi.fastutil.objects.ObjectIterator;
import it.unimi.dsi.fastutil.objects.ObjectArrays;
import it.unimi.dsi.fastutil.objects.ReferenceCollection;
import java.io.Serializable;

public class Short2ReferenceArrayMap<V> extends AbstractShort2ReferenceMap<V> implements Serializable, Cloneable
{
    private static final long serialVersionUID = 1L;
    protected transient short[] key;
    protected transient Object[] value;
    protected int size;
    protected transient Short2ReferenceMap.FastEntrySet<V> entries;
    protected transient ShortSet keys;
    protected transient ReferenceCollection<V> values;
    
    public Short2ReferenceArrayMap(final short[] key, final Object[] value) {
        this.key = key;
        this.value = value;
        this.size = key.length;
        if (key.length != value.length) {
            throw new IllegalArgumentException("Keys and values have different lengths (" + key.length + ", " + value.length + ")");
        }
    }
    
    public Short2ReferenceArrayMap() {
        this.key = ShortArrays.EMPTY_ARRAY;
        this.value = ObjectArrays.EMPTY_ARRAY;
    }
    
    public Short2ReferenceArrayMap(final int capacity) {
        this.key = new short[capacity];
        this.value = new Object[capacity];
    }
    
    public Short2ReferenceArrayMap(final Short2ReferenceMap<V> m) {
        this(m.size());
        int i = 0;
        for (final Short2ReferenceMap.Entry<V> e : m.short2ReferenceEntrySet()) {
            this.key[i] = e.getShortKey();
            this.value[i] = e.getValue();
            ++i;
        }
        this.size = i;
    }
    
    public Short2ReferenceArrayMap(final Map<? extends Short, ? extends V> m) {
        this(m.size());
        int i = 0;
        for (final Map.Entry<? extends Short, ? extends V> e : m.entrySet()) {
            this.key[i] = (short)e.getKey();
            this.value[i] = e.getValue();
            ++i;
        }
        this.size = i;
    }
    
    public Short2ReferenceArrayMap(final short[] key, final Object[] value, final int size) {
        this.key = key;
        this.value = value;
        this.size = size;
        if (key.length != value.length) {
            throw new IllegalArgumentException("Keys and values have different lengths (" + key.length + ", " + value.length + ")");
        }
        if (size > key.length) {
            throw new IllegalArgumentException("The provided size (" + size + ") is larger than or equal to the backing-arrays size (" + key.length + ")");
        }
    }
    
    @Override
    public Short2ReferenceMap.FastEntrySet<V> short2ReferenceEntrySet() {
        if (this.entries == null) {
            this.entries = new EntrySet();
        }
        return this.entries;
    }
    
    private int findKey(final short k) {
        final short[] key = this.key;
        int i = this.size;
        while (i-- != 0) {
            if (key[i] == k) {
                return i;
            }
        }
        return -1;
    }
    
    @Override
    public V get(final short k) {
        final short[] key = this.key;
        int i = this.size;
        while (i-- != 0) {
            if (key[i] == k) {
                return (V)this.value[i];
            }
        }
        return this.defRetValue;
    }
    
    @Override
    public int size() {
        return this.size;
    }
    
    @Override
    public void clear() {
        int i = this.size;
        while (i-- != 0) {
            this.value[i] = null;
        }
        this.size = 0;
    }
    
    @Override
    public boolean containsKey(final short k) {
        return this.findKey(k) != -1;
    }
    
    @Override
    public boolean containsValue(final Object v) {
        int i = this.size;
        while (i-- != 0) {
            if (this.value[i] == v) {
                return true;
            }
        }
        return false;
    }
    
    @Override
    public boolean isEmpty() {
        return this.size == 0;
    }
    
    @Override
    public V put(final short k, final V v) {
        final int oldKey = this.findKey(k);
        if (oldKey != -1) {
            final V oldValue = (V)this.value[oldKey];
            this.value[oldKey] = v;
            return oldValue;
        }
        if (this.size == this.key.length) {
            final short[] newKey = new short[(this.size == 0) ? 2 : (this.size * 2)];
            final Object[] newValue = new Object[(this.size == 0) ? 2 : (this.size * 2)];
            int i = this.size;
            while (i-- != 0) {
                newKey[i] = this.key[i];
                newValue[i] = this.value[i];
            }
            this.key = newKey;
            this.value = newValue;
        }
        this.key[this.size] = k;
        this.value[this.size] = v;
        ++this.size;
        return this.defRetValue;
    }
    
    @Override
    public V remove(final short k) {
        final int oldPos = this.findKey(k);
        if (oldPos == -1) {
            return this.defRetValue;
        }
        final V oldValue = (V)this.value[oldPos];
        final int tail = this.size - oldPos - 1;
        System.arraycopy(this.key, oldPos + 1, this.key, oldPos, tail);
        System.arraycopy(this.value, oldPos + 1, this.value, oldPos, tail);
        --this.size;
        this.value[this.size] = null;
        return oldValue;
    }
    
    @Override
    public ShortSet keySet() {
        if (this.keys == null) {
            this.keys = new KeySet();
        }
        return this.keys;
    }
    
    @Override
    public ReferenceCollection<V> values() {
        if (this.values == null) {
            this.values = new ValuesCollection();
        }
        return this.values;
    }
    
    public Short2ReferenceArrayMap<V> clone() {
        Short2ReferenceArrayMap<V> c;
        try {
            c = (Short2ReferenceArrayMap)super.clone();
        }
        catch (final CloneNotSupportedException cantHappen) {
            throw new InternalError();
        }
        c.key = this.key.clone();
        c.value = this.value.clone();
        c.entries = null;
        c.keys = null;
        c.values = null;
        return c;
    }
    
    private void writeObject(final ObjectOutputStream s) throws IOException {
        s.defaultWriteObject();
        for (int i = 0, max = this.size; i < max; ++i) {
            s.writeShort(this.key[i]);
            s.writeObject(this.value[i]);
        }
    }
    
    private void readObject(final ObjectInputStream s) throws IOException, ClassNotFoundException {
        s.defaultReadObject();
        this.key = new short[this.size];
        this.value = new Object[this.size];
        for (int i = 0; i < this.size; ++i) {
            this.key[i] = s.readShort();
            this.value[i] = s.readObject();
        }
    }
    
    private final class EntrySet extends AbstractObjectSet<Short2ReferenceMap.Entry<V>> implements Short2ReferenceMap.FastEntrySet<V>
    {
        @Override
        public ObjectIterator<Short2ReferenceMap.Entry<V>> iterator() {
            return new ObjectIterator<Short2ReferenceMap.Entry<V>>() {
                int curr = -1;
                int next = 0;
                
                @Override
                public boolean hasNext() {
                    return this.next < Short2ReferenceArrayMap.this.size;
                }
                
                @Override
                public Short2ReferenceMap.Entry<V> next() {
                    if (!this.hasNext()) {
                        throw new NoSuchElementException();
                    }
                    final short[] key = Short2ReferenceArrayMap.this.key;
                    final int next = this.next;
                    this.curr = next;
                    return new BasicEntry<V>(key[next], Short2ReferenceArrayMap.this.value[this.next++]);
                }
                
                @Override
                public void remove() {
                    if (this.curr == -1) {
                        throw new IllegalStateException();
                    }
                    this.curr = -1;
                    final int tail = Short2ReferenceArrayMap.this.size-- - this.next--;
                    System.arraycopy(Short2ReferenceArrayMap.this.key, this.next + 1, Short2ReferenceArrayMap.this.key, this.next, tail);
                    System.arraycopy(Short2ReferenceArrayMap.this.value, this.next + 1, Short2ReferenceArrayMap.this.value, this.next, tail);
                    Short2ReferenceArrayMap.this.value[Short2ReferenceArrayMap.this.size] = null;
                }
                
                @Override
                public void forEachRemaining(final Consumer<? super Short2ReferenceMap.Entry<V>> action) {
                    final int max = Short2ReferenceArrayMap.this.size;
                    while (this.next < max) {
                        final short[] key = Short2ReferenceArrayMap.this.key;
                        final int next = this.next;
                        this.curr = next;
                        action.accept((Object)new BasicEntry(key[next], Short2ReferenceArrayMap.this.value[this.next++]));
                    }
                }
            };
        }
        
        @Override
        public ObjectIterator<Short2ReferenceMap.Entry<V>> fastIterator() {
            return new ObjectIterator<Short2ReferenceMap.Entry<V>>() {
                int next = 0;
                int curr = -1;
                final BasicEntry<V> entry = new BasicEntry<V>();
                
                @Override
                public boolean hasNext() {
                    return this.next < Short2ReferenceArrayMap.this.size;
                }
                
                @Override
                public Short2ReferenceMap.Entry<V> next() {
                    if (!this.hasNext()) {
                        throw new NoSuchElementException();
                    }
                    final BasicEntry<V> entry = this.entry;
                    final short[] key = Short2ReferenceArrayMap.this.key;
                    final int next = this.next;
                    this.curr = next;
                    entry.key = key[next];
                    this.entry.value = (V)Short2ReferenceArrayMap.this.value[this.next++];
                    return this.entry;
                }
                
                @Override
                public void remove() {
                    if (this.curr == -1) {
                        throw new IllegalStateException();
                    }
                    this.curr = -1;
                    final int tail = Short2ReferenceArrayMap.this.size-- - this.next--;
                    System.arraycopy(Short2ReferenceArrayMap.this.key, this.next + 1, Short2ReferenceArrayMap.this.key, this.next, tail);
                    System.arraycopy(Short2ReferenceArrayMap.this.value, this.next + 1, Short2ReferenceArrayMap.this.value, this.next, tail);
                    Short2ReferenceArrayMap.this.value[Short2ReferenceArrayMap.this.size] = null;
                }
                
                @Override
                public void forEachRemaining(final Consumer<? super Short2ReferenceMap.Entry<V>> action) {
                    final int max = Short2ReferenceArrayMap.this.size;
                    while (this.next < max) {
                        final BasicEntry<V> entry = this.entry;
                        final short[] key = Short2ReferenceArrayMap.this.key;
                        final int next = this.next;
                        this.curr = next;
                        entry.key = key[next];
                        this.entry.value = (V)Short2ReferenceArrayMap.this.value[this.next++];
                        action.accept(this.entry);
                    }
                }
            };
        }
        
        @Override
        public ObjectSpliterator<Short2ReferenceMap.Entry<V>> spliterator() {
            return new EntrySetSpliterator(0, Short2ReferenceArrayMap.this.size);
        }
        
        @Override
        public void forEach(final Consumer<? super Short2ReferenceMap.Entry<V>> action) {
            for (int i = 0, max = Short2ReferenceArrayMap.this.size; i < max; ++i) {
                action.accept((Object)new BasicEntry(Short2ReferenceArrayMap.this.key[i], (V)Short2ReferenceArrayMap.this.value[i]));
            }
        }
        
        @Override
        public void fastForEach(final Consumer<? super Short2ReferenceMap.Entry<V>> action) {
            final BasicEntry<V> entry = new BasicEntry<V>();
            for (int i = 0, max = Short2ReferenceArrayMap.this.size; i < max; ++i) {
                entry.key = Short2ReferenceArrayMap.this.key[i];
                entry.value = (V)Short2ReferenceArrayMap.this.value[i];
                action.accept(entry);
            }
        }
        
        @Override
        public int size() {
            return Short2ReferenceArrayMap.this.size;
        }
        
        @Override
        public boolean contains(final Object o) {
            if (!(o instanceof Map.Entry)) {
                return false;
            }
            final Map.Entry<?, ?> e = (Map.Entry<?, ?>)o;
            if (e.getKey() == null || !(e.getKey() instanceof Short)) {
                return false;
            }
            final short k = (short)e.getKey();
            return Short2ReferenceArrayMap.this.containsKey(k) && Short2ReferenceArrayMap.this.get(k) == e.getValue();
        }
        
        @Override
        public boolean remove(final Object o) {
            if (!(o instanceof Map.Entry)) {
                return false;
            }
            final Map.Entry<?, ?> e = (Map.Entry<?, ?>)o;
            if (e.getKey() == null || !(e.getKey() instanceof Short)) {
                return false;
            }
            final short k = (short)e.getKey();
            final V v = (V)e.getValue();
            final int oldPos = Short2ReferenceArrayMap.this.findKey(k);
            if (oldPos == -1 || v != Short2ReferenceArrayMap.this.value[oldPos]) {
                return false;
            }
            final int tail = Short2ReferenceArrayMap.this.size - oldPos - 1;
            System.arraycopy(Short2ReferenceArrayMap.this.key, oldPos + 1, Short2ReferenceArrayMap.this.key, oldPos, tail);
            System.arraycopy(Short2ReferenceArrayMap.this.value, oldPos + 1, Short2ReferenceArrayMap.this.value, oldPos, tail);
            final Short2ReferenceArrayMap this$0 = Short2ReferenceArrayMap.this;
            --this$0.size;
            Short2ReferenceArrayMap.this.value[Short2ReferenceArrayMap.this.size] = null;
            return true;
        }
        
        final class EntrySetSpliterator extends ObjectSpliterators.EarlyBindingSizeIndexBasedSpliterator<Short2ReferenceMap.Entry<V>> implements ObjectSpliterator<Short2ReferenceMap.Entry<V>>
        {
            EntrySetSpliterator(final int pos, final int maxPos) {
                super(pos, maxPos);
            }
            
            @Override
            public int characteristics() {
                return 16465;
            }
            
            @Override
            protected final Short2ReferenceMap.Entry<V> get(final int location) {
                return new BasicEntry<V>(Short2ReferenceArrayMap.this.key[location], (V)Short2ReferenceArrayMap.this.value[location]);
            }
            
            @Override
            protected final EntrySetSpliterator makeForSplit(final int pos, final int maxPos) {
                return new EntrySetSpliterator(pos, maxPos);
            }
        }
    }
    
    private final class KeySet extends AbstractShortSet
    {
        @Override
        public boolean contains(final short k) {
            return Short2ReferenceArrayMap.this.findKey(k) != -1;
        }
        
        @Override
        public boolean remove(final short k) {
            final int oldPos = Short2ReferenceArrayMap.this.findKey(k);
            if (oldPos == -1) {
                return false;
            }
            final int tail = Short2ReferenceArrayMap.this.size - oldPos - 1;
            System.arraycopy(Short2ReferenceArrayMap.this.key, oldPos + 1, Short2ReferenceArrayMap.this.key, oldPos, tail);
            System.arraycopy(Short2ReferenceArrayMap.this.value, oldPos + 1, Short2ReferenceArrayMap.this.value, oldPos, tail);
            final Short2ReferenceArrayMap this$0 = Short2ReferenceArrayMap.this;
            --this$0.size;
            Short2ReferenceArrayMap.this.value[Short2ReferenceArrayMap.this.size] = null;
            return true;
        }
        
        @Override
        public ShortIterator iterator() {
            return new ShortIterator() {
                int pos = 0;
                
                @Override
                public boolean hasNext() {
                    return this.pos < Short2ReferenceArrayMap.this.size;
                }
                
                @Override
                public short nextShort() {
                    if (!this.hasNext()) {
                        throw new NoSuchElementException();
                    }
                    return Short2ReferenceArrayMap.this.key[this.pos++];
                }
                
                @Override
                public void remove() {
                    if (this.pos == 0) {
                        throw new IllegalStateException();
                    }
                    final int tail = Short2ReferenceArrayMap.this.size - this.pos;
                    System.arraycopy(Short2ReferenceArrayMap.this.key, this.pos, Short2ReferenceArrayMap.this.key, this.pos - 1, tail);
                    System.arraycopy(Short2ReferenceArrayMap.this.value, this.pos, Short2ReferenceArrayMap.this.value, this.pos - 1, tail);
                    final Short2ReferenceArrayMap this$0 = Short2ReferenceArrayMap.this;
                    --this$0.size;
                    --this.pos;
                    Short2ReferenceArrayMap.this.value[Short2ReferenceArrayMap.this.size] = null;
                }
                
                @Override
                public void forEachRemaining(final ShortConsumer action) {
                    final int max = Short2ReferenceArrayMap.this.size;
                    while (this.pos < max) {
                        action.accept(Short2ReferenceArrayMap.this.key[this.pos++]);
                    }
                }
            };
        }
        
        @Override
        public ShortSpliterator spliterator() {
            return new KeySetSpliterator(0, Short2ReferenceArrayMap.this.size);
        }
        
        @Override
        public void forEach(final ShortConsumer action) {
            for (int i = 0, max = Short2ReferenceArrayMap.this.size; i < max; ++i) {
                action.accept(Short2ReferenceArrayMap.this.key[i]);
            }
        }
        
        @Override
        public int size() {
            return Short2ReferenceArrayMap.this.size;
        }
        
        @Override
        public void clear() {
            Short2ReferenceArrayMap.this.clear();
        }
        
        final class KeySetSpliterator extends ShortSpliterators.EarlyBindingSizeIndexBasedSpliterator implements ShortSpliterator
        {
            KeySetSpliterator(final int pos, final int maxPos) {
                super(pos, maxPos);
            }
            
            @Override
            public int characteristics() {
                return 16721;
            }
            
            @Override
            protected final short get(final int location) {
                return Short2ReferenceArrayMap.this.key[location];
            }
            
            @Override
            protected final KeySetSpliterator makeForSplit(final int pos, final int maxPos) {
                return new KeySetSpliterator(pos, maxPos);
            }
            
            @Override
            public void forEachRemaining(final ShortConsumer action) {
                final int max = Short2ReferenceArrayMap.this.size;
                while (this.pos < max) {
                    action.accept(Short2ReferenceArrayMap.this.key[this.pos++]);
                }
            }
        }
    }
    
    private final class ValuesCollection extends AbstractReferenceCollection<V>
    {
        @Override
        public boolean contains(final Object v) {
            return Short2ReferenceArrayMap.this.containsValue(v);
        }
        
        @Override
        public ObjectIterator<V> iterator() {
            return new ObjectIterator<V>() {
                int pos = 0;
                
                @Override
                public boolean hasNext() {
                    return this.pos < Short2ReferenceArrayMap.this.size;
                }
                
                @Override
                public V next() {
                    if (!this.hasNext()) {
                        throw new NoSuchElementException();
                    }
                    return (V)Short2ReferenceArrayMap.this.value[this.pos++];
                }
                
                @Override
                public void remove() {
                    if (this.pos == 0) {
                        throw new IllegalStateException();
                    }
                    final int tail = Short2ReferenceArrayMap.this.size - this.pos;
                    System.arraycopy(Short2ReferenceArrayMap.this.key, this.pos, Short2ReferenceArrayMap.this.key, this.pos - 1, tail);
                    System.arraycopy(Short2ReferenceArrayMap.this.value, this.pos, Short2ReferenceArrayMap.this.value, this.pos - 1, tail);
                    final Short2ReferenceArrayMap this$0 = Short2ReferenceArrayMap.this;
                    --this$0.size;
                    --this.pos;
                    Short2ReferenceArrayMap.this.value[Short2ReferenceArrayMap.this.size] = null;
                }
                
                @Override
                public void forEachRemaining(final Consumer<? super V> action) {
                    final int max = Short2ReferenceArrayMap.this.size;
                    while (this.pos < max) {
                        action.accept((Object)Short2ReferenceArrayMap.this.value[this.pos++]);
                    }
                }
            };
        }
        
        @Override
        public ObjectSpliterator<V> spliterator() {
            return new ValuesSpliterator(0, Short2ReferenceArrayMap.this.size);
        }
        
        @Override
        public void forEach(final Consumer<? super V> action) {
            for (int i = 0, max = Short2ReferenceArrayMap.this.size; i < max; ++i) {
                action.accept((Object)Short2ReferenceArrayMap.this.value[i]);
            }
        }
        
        @Override
        public int size() {
            return Short2ReferenceArrayMap.this.size;
        }
        
        @Override
        public void clear() {
            Short2ReferenceArrayMap.this.clear();
        }
        
        final class ValuesSpliterator extends ObjectSpliterators.EarlyBindingSizeIndexBasedSpliterator<V> implements ObjectSpliterator<V>
        {
            ValuesSpliterator(final int pos, final int maxPos) {
                super(pos, maxPos);
            }
            
            @Override
            public int characteristics() {
                return 16464;
            }
            
            @Override
            protected final V get(final int location) {
                return (V)Short2ReferenceArrayMap.this.value[location];
            }
            
            @Override
            protected final ValuesSpliterator makeForSplit(final int pos, final int maxPos) {
                return new ValuesSpliterator(pos, maxPos);
            }
            
            @Override
            public void forEachRemaining(final Consumer<? super V> action) {
                final int max = Short2ReferenceArrayMap.this.size;
                while (this.pos < max) {
                    action.accept((Object)Short2ReferenceArrayMap.this.value[this.pos++]);
                }
            }
        }
    }
}