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;


A set of chars.

/**
 * A set of <code>char</code>s.
 */
 @com.carrotsearch.hppc.Generated(
    date = "2018-05-21T12:24:05+0200",
    value = "KTypeSet.java") 
public interface CharSet extends CharCollection {
  
Adds k to the set.

Returns:Returns true if this element was not part of the set
        before. Returns false if an equal element is already part of
        the set, does not replace the existing element with the argument.
/**
   * Adds <code>k</code> to the set.
   * 
   * @return Returns <code>true</code> if this element was not part of the set
   *         before. Returns <code>false</code> if an equal element is already part of
   *         the set, <b>does not replace the existing element</b> with the argument.
   */
  public boolean add(char k);

  
Visually depict the distribution of keys.

Params:
  • characters – 
         The number of characters to "squeeze" the entire buffer into.
Returns:Returns a sequence of characters where '.' depicts an empty
        fragment of the internal buffer and 'X' depicts full or nearly full
        capacity within the buffer's range and anything between 1 and 9 is between.
/**
   * Visually depict the distribution of keys.
   * 
   * @param characters
   *          The number of characters to "squeeze" the entire buffer into.
   * @return Returns a sequence of characters where '.' depicts an empty
   *         fragment of the internal buffer and 'X' depicts full or nearly full
   *         capacity within the buffer's range and anything between 1 and 9 is between.
   */
  public String visualizeKeyDistribution(int characters);
}