HPPC: 高性能的Java原生集合實現

HPPC提供了經典Java集合的高性能實現。支持所有原生類似比如：lists, sets 和maps等。專為高性能和高存儲效率優化。

final IntCharOpenHashMap map = prepare(10);

// For the fastest iteration, you can access the sets's data buffers directly.
final int [] keys = map.keys;
final char [] values = map.values;
final boolean [] states = map.allocated;
// Note that the loop is bounded by states.length, not keys.length. This
// can make the code faster due to range check elimination
// (http://wikis.sun.com/display/HotSpotInternals/RangeCheckElimination).
for (int i = 0; i < states.length; i++)
{
    if (states[i]) {
        System.out.println(keys[i] + " -> " + values[i]);
    }
}</pre> 
項目主頁：http://www.baiduhome.net/lib/view/home/1362101377085