Update #47 - Singleplayer lag fixes

sources/main/java/com/carrotsearch/hppc/IntDeque.java

@@ -0,0 +1,77 @@
+package com.carrotsearch.hppc;
+
+import com.carrotsearch.hppc.cursors.IntCursor;
+import com.carrotsearch.hppc.predicates.IntPredicate;
+import com.carrotsearch.hppc.procedures.IntProcedure;
+import java.util.Deque;
+import java.util.Iterator;
+
+/**
+ * A linear collection that supports element insertion and removal at both ends.
+ *
+ * @see Deque
+ */
+@com.carrotsearch.hppc.Generated(date = "2024-06-04T15:20:17+0200", value = "KTypeDeque.java")
+public interface IntDeque extends IntCollection {
+  /**
+   * Removes the first element that equals <code>e</code>.
+   *
+   * @return The deleted element's index or <code>-1</code> if the element was not found.
+   */
+  public int removeFirst(int e);
+
+  /**
+   * Removes the last element that equals <code>e</code>.
+   *
+   * @return The deleted element's index or <code>-1</code> if the element was not found.
+   */
+  public int removeLast(int e);
+
+  /** Inserts the specified element at the front of this deque. */
+  public void addFirst(int e);
+
+  /** Inserts the specified element at the end of this deque. */
+  public void addLast(int e);
+
+  /**
+   * Retrieves and removes the first element of this deque.
+   *
+   * @return the head (first) element of this deque.
+   */
+  public int removeFirst();
+
+  /**
+   * Retrieves and removes the last element of this deque.
+   *
+   * @return the tail of this deque.
+   */
+  public int removeLast();
+
+  /**
+   * Retrieves the first element of this deque but does not remove it.
+   *
+   * @return the head of this deque.
+   */
+  public int getFirst();
+
+  /**
+   * Retrieves the last element of this deque but does not remove it.
+   *
+   * @return the head of this deque.
+   */
+  public int getLast();
+
+  /**
+   * @return An iterator over elements in this deque in tail-to-head order.
+   */
+  public Iterator<IntCursor> descendingIterator();
+
+  /** Applies a <code>procedure</code> to all elements in tail-to-head order. */
+  public <T extends IntProcedure> T descendingForEach(T procedure);
+
+  /**
+   * Applies a <code>predicate</code> to container elements as long, as the predicate returns <code>
+   * true</code>. The iteration is interrupted otherwise.
+   */
+  public <T extends IntPredicate> T descendingForEach(T predicate);
+}