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 entries of an associative container (int keys and double
values).

/**
 * A cursor over entries of an associative container (int keys and double
 * values).
 */
 @com.carrotsearch.hppc.Generated(
    date = "2018-05-21T12:24:04+0200",
    value = "KTypeVTypeCursor.java") 
public final class IntDoubleCursor {
  
The current key and 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 key and 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 key.

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

  
The current value.

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

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