http://labs.carrotsearch.com/hppc.html/hppc: High Performance Primitive Collections. Fundamental data structures (maps, sets, lists, stacks, queues) generated for combinations of object and primitive types to conserve JVM memory and speed up execution. (Carrot Search s.c.)
  • Dawid Weiss
  • Stanisław Osiński 
package com.carrotsearch.hppc.cursors;


A cursor over a collection of ints.

/**
 * A cursor over a collection of <code>ints</code>.
 */
 @com.carrotsearch.hppc.Generated(
    date = "2018-05-21T12:24:04+0200",
    value = "KTypeCursor.java") 
public final class IntCursor {
  
The current value's index in the container this cursor belongs to. The
meaning of this index is defined by the container (usually it will be an
index in the underlying storage buffer).

/**
   * The current value's index in the container this cursor belongs to. The
   * meaning of this index is defined by the container (usually it will be an
   * index in the underlying storage buffer).
   */
  public int index;

  
The current value.

/**
   * The current value.
   */
  public int value;

  @Override
  public String toString() {
    return "[cursor, index: " + index + ", value: " + value + "]";
  }
}