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;


Reused buffer visualization routines.

See Also:
  • visualizeKeyDistribution.visualizeKeyDistribution(int)
  • visualizeKeyDistribution.visualizeKeyDistribution(int)
/**
 * Reused buffer visualization routines.
 * 
 * @see IntSet#visualizeKeyDistribution(int)
 * @see IntVTypeMap#visualizeKeyDistribution(int)
 */
class IntBufferVisualizer {
  static  String visualizeKeyDistribution(
        int []   buffer, 
      int max, 
      int characters) {
    final StringBuilder b = new StringBuilder();
    final char [] chars = ".123456789X".toCharArray();
    for (int i = 1, start = -1; i <= characters; i++) {
      int end = (int) ((long) i       * max / characters);
      
      if (start + 1 <= end) {
        int taken = 0;
        int slots = 0;
        for (int slot = start + 1; slot <= end; slot++, slots++) {
          if (!((buffer[slot]) == 0)) {
            taken++;
          }
        }
        b.append(chars[Math.min(chars.length - 1, taken * chars.length / slots)]);
        start = end;
      }
    }
    while (b.length() < characters) {
      b.append(' ');
    }
    return b.toString();
  }
}