package com.carrotsearch.hppc;

import java.util.*;

import com.carrotsearch.hppc.cursors.*;
import com.carrotsearch.hppc.predicates.IntPredicate;
import com.carrotsearch.hppc.procedures.*;

import static com.carrotsearch.hppc.Containers.*;

An array-backed list of ints.
/**
 * An array-backed list of ints.
 */
  
 @com.carrotsearch.hppc.Generated(
    date = "2018-05-21T12:24:05+0200",
    value = "KTypeArrayList.java") 
public class IntArrayList
  extends AbstractIntCollection 
  implements IntIndexedContainer,
             Preallocable,
             Cloneable
{
  
An immutable empty buffer (array).
/**
   * An immutable empty buffer (array).
   */
  public final static 
                 int [] 
  
          EMPTY_ARRAY = 
                 new int [0]; 
 ; 

  
Internal array for storing the list. The array may be larger than the current size (size()). /**
   * Internal array for storing the list. The array may be larger than the current size
   * ({@link #size()}).
   */
  public 
                 int [] 
 
          buffer = EMPTY_ARRAY;

  
Current number of elements stored in buffer. /**
   * Current number of elements stored in {@link #buffer}.
   */
  public int elementsCount;

  
Buffer resizing strategy.
/**
   * Buffer resizing strategy.
   */
  protected final ArraySizingStrategy resizer;

  
New instance with sane defaults.
/**
   * New instance with sane defaults.
   */
  public IntArrayList() {
    this(DEFAULT_EXPECTED_ELEMENTS);
  }

  
New instance with sane defaults.
Params:
expectedElements – 
         The expected number of elements guaranteed not to cause buffer
         expansion (inclusive)./**
   * New instance with sane defaults.
   * 
   * @param expectedElements
   *          The expected number of elements guaranteed not to cause buffer
   *          expansion (inclusive).
   */
  public IntArrayList(int expectedElements) {
    this(expectedElements, new BoundedProportionalArraySizingStrategy());
  }


  
New instance with sane defaults.
Params:
expectedElements – 
         The expected number of elements guaranteed not to cause buffer
         expansion (inclusive).
resizer – 
         Underlying buffer sizing strategy./**
   * New instance with sane defaults.
   * 
   * @param expectedElements
   *          The expected number of elements guaranteed not to cause buffer
   *          expansion (inclusive).
   * 
   * @param resizer
   *          Underlying buffer sizing strategy.
   */
  public IntArrayList(int expectedElements, ArraySizingStrategy resizer) {
    assert resizer != null;
    this.resizer = resizer;
    ensureCapacity(expectedElements);
  }

  
Creates a new list from the elements of another container in its
iteration order.
/**
   * Creates a new list from the elements of another container in its
   * iteration order.
   */
  public IntArrayList(IntContainer container) {
    this(container.size());
    addAll(container);
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public void add(int e1) {
    ensureBufferSpace(1);
    buffer[elementsCount++] = e1;
  }

  
Appends two elements at the end of the list. To add more than two elements,
use add (vararg-version) or access the buffer directly (tight
loop).
/**
   * Appends two elements at the end of the list. To add more than two elements,
   * use <code>add</code> (vararg-version) or access the buffer directly (tight
   * loop).
   */
  public void add(int e1, int e2) {
    ensureBufferSpace(2);
    buffer[elementsCount++] = e1;
    buffer[elementsCount++] = e2;
  }

  
Add all elements from a range of given array to the list.
/**
   * Add all elements from a range of given array to the list.
   */
  public void add(int[] elements, int start, int length) {
    assert length >= 0 : "Length must be >= 0";

    ensureBufferSpace(length);
    System.arraycopy(elements, start, buffer, elementsCount, length);
    elementsCount += length;
  }

  
Vararg-signature method for adding elements at the end of the list.

This method is handy, but costly if used in tight loops (anonymous array
passing)

/**
   * Vararg-signature method for adding elements at the end of the list.
   * <p>
   * <b>This method is handy, but costly if used in tight loops (anonymous array
   * passing)</b>
   * </p>
   */
  /*  */
  public final void add(int... elements) {
    add(elements, 0, elements.length);
  }

  
Adds all elements from another container.
/**
   * Adds all elements from another container.
   */
  public int addAll(IntContainer container) {
    final int size = container.size();
    ensureBufferSpace(size);

    for (IntCursor cursor : container) {
      add(cursor.value);
    }

    return size;
  }

  
Adds all elements from another iterable.
/**
   * Adds all elements from another iterable.
   */
  public int addAll(Iterable<? extends IntCursor> iterable) {
    int size = 0;
    for (IntCursor cursor : iterable) {
      add(cursor.value);
      size++;
    }
    return size;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public void insert(int index, int e1) {
    assert (index >= 0 && index <= size()) : "Index " + index + " out of bounds [" + 0 + ", " + size() + "].";

    ensureBufferSpace(1);
    System.arraycopy(buffer, index, buffer, index + 1, elementsCount - index);
    buffer[index] = e1;
    elementsCount++;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public int get(int index) {
    assert (index >= 0 && index < size()) : "Index " + index + " out of bounds [" + 0 + ", " + size() + ").";

    return  buffer[index];
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public int set(int index, int e1) {
    assert (index >= 0 && index < size()) : "Index " + index + " out of bounds [" + 0 + ", " + size() + ").";

    final int v =  buffer[index];
    buffer[index] = e1;
    return v;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public int remove(int index) {
    assert (index >= 0 && index < size()) : "Index " + index + " out of bounds [" + 0 + ", " + size() + ").";

    final int v =  buffer[index];
    if (index + 1 < elementsCount) {
      System.arraycopy(buffer, index + 1, buffer, index, elementsCount - index - 1);
    }
    elementsCount--;
    buffer[elementsCount] = 0;
    return v;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public void removeRange(int fromIndex, int toIndex) {
    assert (fromIndex >= 0 && fromIndex <= size()) 
      : "Index " + fromIndex + " out of bounds [" + 0 + ", " + size() + ").";
    assert (toIndex >= 0 && toIndex <= size()) 
      : "Index " + toIndex + " out of bounds [" + 0 + ", " + size() + "].";
    assert fromIndex <= toIndex 
      : "fromIndex must be <= toIndex: " + fromIndex + ", " + toIndex;

    System.arraycopy(buffer, toIndex, buffer, fromIndex, elementsCount - toIndex);
    final int count = toIndex - fromIndex;
    elementsCount -= count;
    Arrays.fill(buffer, elementsCount, elementsCount + count, 0);
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public int removeFirst(int e1) {
    final int index = indexOf(e1);
    if (index >= 0)
      remove(index);
    return index;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public int removeLast(int e1) {
    final int index = lastIndexOf(e1);
    if (index >= 0)
      remove(index);
    return index;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public int removeAll(int e1) {
    int to = 0;
    for (int from = 0; from < elementsCount; from++) {
      if (((buffer[from]) == ( e1))) {
        buffer[from] = 0;
        continue;
      }

      if (to != from) {
        buffer[to] = buffer[from];
        buffer[from] = 0;
      }
      to++;
    }

    final int deleted = elementsCount - to;
    this.elementsCount = to;
    return deleted;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public boolean contains(int e1) {
    return indexOf(e1) >= 0;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public int indexOf(int e1) {
    for (int i = 0; i < elementsCount; i++) {
      if (((buffer[i]) == ( e1))) {
        return i;
      }
    }

    return -1;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public int lastIndexOf(int e1) {
    for (int i = elementsCount - 1; i >= 0; i--) {
      if (((buffer[i]) == ( e1))) {
        return i;
      }
    }

    return -1;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public boolean isEmpty() {
    return elementsCount == 0;
  }

  
Ensure this container can hold at least the given number of elements
without resizing its buffers.
Params:
expectedElements – 
         The total number of elements, inclusive./**
   * Ensure this container can hold at least the given number of elements
   * without resizing its buffers.
   * 
   * @param expectedElements
   *          The total number of elements, inclusive.
   */
  @Override
  public void ensureCapacity(int expectedElements) {
    final int bufferLen = (buffer == null ? 0 : buffer.length);
    if (expectedElements > bufferLen) {
      ensureBufferSpace(expectedElements - size());
    }
  }

  
Ensures the internal buffer has enough free slots to store
expectedAdditions. Increases internal buffer size if needed.
/**
   * Ensures the internal buffer has enough free slots to store
   * <code>expectedAdditions</code>. Increases internal buffer size if needed.
   */
  protected void ensureBufferSpace(int expectedAdditions) {
    final int bufferLen = (buffer == null ? 0 : buffer.length);
    if (elementsCount + expectedAdditions > bufferLen) {
      final int newSize = resizer.grow(bufferLen, elementsCount, expectedAdditions);
      assert newSize >= elementsCount + expectedAdditions : "Resizer failed to" + " return sensible new size: "
          + newSize + " <= " + (elementsCount + expectedAdditions);

      this.buffer = Arrays.copyOf(buffer, newSize);
    }
  }

  
Truncate or expand the list to the new size. If the list is truncated, the buffer will not be reallocated (use trimToSize() if you need a truncated buffer), but the truncated values will be reset to the default value (zero). If the list is expanded, the elements beyond the current size are initialized with JVM-defaults (zero or null values).
/**
   * Truncate or expand the list to the new size. If the list is truncated, the
   * buffer will not be reallocated (use {@link #trimToSize()} if you need a
   * truncated buffer), but the truncated values will be reset to the default
   * value (zero). If the list is expanded, the elements beyond the current size
   * are initialized with JVM-defaults (zero or <code>null</code> values).
   */
  public void resize(int newSize) {
    if (newSize <= buffer.length) {
      if (newSize < elementsCount) {
        Arrays.fill(buffer, newSize, elementsCount, 0);
      } else {
        Arrays.fill(buffer, elementsCount, newSize, 0);
      }
    } else {
      ensureCapacity(newSize);
    }
    this.elementsCount = newSize;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public int size() {
    return elementsCount;
  }

  
Trim the internal buffer to the current size.
/**
   * Trim the internal buffer to the current size.
   */
  public void trimToSize() {
    if (size() != this.buffer.length) {
      this.buffer =  toArray();
    }
  }

  
Sets the number of stored elements to zero. Releases and initializes the internal storage array to default values. To clear the list without cleaning the buffer, simply set the elementsCount field to zero. /**
   * Sets the number of stored elements to zero. Releases and initializes the
   * internal storage array to default values. To clear the list without
   * cleaning the buffer, simply set the {@link #elementsCount} field to zero.
   */
  @Override
  public void clear() {
    Arrays.fill(buffer, 0, elementsCount, 0);
    this.elementsCount = 0;
  }

  
Sets the number of stored elements to zero and releases the internal
storage array.
/**
   * Sets the number of stored elements to zero and releases the internal
   * storage array.
   */
  @Override
  public void release() {
    this.buffer =  EMPTY_ARRAY;
    this.elementsCount = 0;
  }

  
{@inheritDoc}
The returned array is sized to match exactly
the number of elements of the stack.
/**
   * {@inheritDoc}
   * 
   * <p>The returned array is sized to match exactly
   * the number of elements of the stack.</p>
   */
  @Override
     public int [] toArray()
 
  {
    return Arrays.copyOf(buffer, elementsCount);
  }

  
Clone this object. The returned clone will reuse the same hash function and
array resizing strategy.
/**
   * Clone this object. The returned clone will reuse the same hash function and
   * array resizing strategy.
   */
  @Override
  public IntArrayList clone() {
    try {
      /*  */
      final IntArrayList cloned = (IntArrayList) super.clone();
      cloned.buffer = buffer.clone();
      return cloned;
    } catch (CloneNotSupportedException e) {
      throw new RuntimeException(e);
    }
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public int hashCode() {
    int h = 1, max = elementsCount;
    for (int i = 0; i < max; i++) {
      h = 31 * h + BitMixer.mix(this.buffer[i]);
    }
    return h;
  }

  
Returns true only if the other object is an instance of 
the same class and with the same elements. 
/**
   * Returns <code>true</code> only if the other object is an instance of 
   * the same class and with the same elements. 
     */
  @Override
  public boolean equals(Object obj) {
      return obj != null &&
             getClass() == obj.getClass() &&
             equalElements(getClass().cast(obj));
  }

  
Compare index-aligned elements against another IntIndexedContainer. /**
   * Compare index-aligned elements against another 
   * {@link IntIndexedContainer}. 
   */
  protected boolean equalElements(IntArrayList other) {
    int max = size();
    if (other.size() != max) {
      return false;
    }

    for (int i = 0; i < max; i++) {
      if (!((other.get(i)) == ( get(i)))) {
        return false;
      }
    }

    return true;
  }

  
An iterator implementation for IntArrayList.iterator. /**
   * An iterator implementation for {@link IntArrayList#iterator}.
   */
  final static class ValueIterator extends AbstractIterator<IntCursor> {
    private final IntCursor cursor;

    private final int[] buffer;
    private final int size;

    public ValueIterator(int[] buffer, int size) {
      this.cursor = new IntCursor();
      this.cursor.index = -1;
      this.size = size;
      this.buffer = buffer;
    }

    @Override
    protected IntCursor fetch() {
      if (cursor.index + 1 == size)
        return done();

      cursor.value = buffer[++cursor.index];
      return cursor;
    }
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public Iterator<IntCursor> iterator() {
    return new ValueIterator( buffer, size());
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public <T extends IntProcedure> T forEach(T procedure) {
    return forEach(procedure, 0, size());
  }

  
Applies procedure to a slice of the list,
fromIndex, inclusive, to toIndex, exclusive.
/**
   * Applies <code>procedure</code> to a slice of the list,
   * <code>fromIndex</code>, inclusive, to <code>toIndex</code>, exclusive.
   */
  public <T extends IntProcedure> T forEach(T procedure, int fromIndex, final int toIndex) {
    assert (fromIndex >= 0 && fromIndex <= size()) :
        "Index " + fromIndex + " out of bounds [" + 0 + ", " + size() + ").";

    assert (toIndex >= 0 && toIndex <= size()) :
        "Index " + toIndex + " out of bounds [" + 0 + ", " + size() + "].";
    
    assert fromIndex <= toIndex : "fromIndex must be <= toIndex: "
        + fromIndex + ", " + toIndex;

    final int [] buffer =  this.buffer;
    for (int i = fromIndex; i < toIndex; i++) {
        procedure.apply(buffer[i]);
    }

    return procedure;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public int removeAll(IntPredicate predicate) {
    final int[] buffer =  this.buffer;
    final int elementsCount = this.elementsCount;
    int to = 0;
    int from = 0;
    try {
      for (; from < elementsCount; from++) {
        if (predicate.apply(buffer[from])) {
          buffer[from] = 0;
          continue;
        }

        if (to != from) {
          buffer[to] = buffer[from];
          buffer[from] = 0;
        }
        to++;
      }
    } finally {
      // Keep the list in a consistent state, even if the predicate throws an exception.
      for (; from < elementsCount; from++) {
        if (to != from) {
          buffer[to] = buffer[from];
          buffer[from] = 0;
        }
        to++;
      }

      this.elementsCount = to;
    }

    return elementsCount - to;
  }

  
{@inheritDoc}
/**
   * {@inheritDoc}
   */
  @Override
  public <T extends IntPredicate> T forEach(T predicate) {
    return forEach(predicate, 0, size());
  }

  
Applies predicate to a slice of the list,
fromIndex, inclusive, to toIndex, exclusive, or
until predicate returns false.
/**
   * Applies <code>predicate</code> to a slice of the list,
   * <code>fromIndex</code>, inclusive, to <code>toIndex</code>, exclusive, or
   * until predicate returns <code>false</code>.
   */
  public <T extends IntPredicate> T forEach(T predicate, int fromIndex, final int toIndex) {
    assert (fromIndex >= 0 && fromIndex <= size()) 
      : "Index " + fromIndex + " out of bounds [" + 0 + ", " + size() + ").";
    assert (toIndex >= 0 && toIndex <= size()) 
      : "Index " + toIndex + " out of bounds [" + 0 + ", " + size() + "].";
    assert fromIndex <= toIndex 
      : "fromIndex must be <= toIndex: " + fromIndex + ", " + toIndex;

    final int[] buffer =  this.buffer;
    for (int i = fromIndex; i < toIndex; i++) {
      if (!predicate.apply(buffer[i]))
        break;
    }
    
    return predicate;
  }

    
Create a list from a variable number of arguments or an array of int.
The elements are copied from the argument to the internal buffer.
/**
     * Create a list from a variable number of arguments or an array of <code>int</code>.
     * The elements are copied from the argument to the internal buffer.
     */
    /*  */
  public static  IntArrayList from(int... elements) {
    final IntArrayList list = new IntArrayList(elements.length);
    list.add(elements);
    return list;
  }
}