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;


Anything that can preallocate buffers given prior knowledge of the number of
stored elements.

/**
 * Anything that can preallocate buffers given prior knowledge of the number of
 * stored elements.
 */
public interface Preallocable {
  
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.
   */
  public void ensureCapacity(int expectedElements);
}