| Package | Description |
|---|---|
| net.lecousin.framework.collections.map |
Implementations of Maps.
|
| Modifier and Type | Class and Description |
|---|---|
class |
HalfByteHashMap<T>
This class uses the 4 lower bits of a byte as a hash code, then for each hash code
associates an ordered array.
In other words, it splits bytes over 16 buckets, each bucket containing up to 16 key-value pairs. The insert and remove operations are costly because we need to reallocate and order the arrays, but the get operation is fast, while using reasonable amount of memory. |
Copyright © 2019. All rights reserved.