1. | Ordered Map | | |
2. | Case Insensitive Map | | |
3. | A Map collection with real-time behavior | | |
4. | Cache Map | | |
5. | Map implementation Optimized for Strings keys | | |
6. | An integer hashmap | | |
7. | An IdentityMap that uses reference-equality instead of object-equality | | |
8. | Int Object HashMap | | |
9. | Concurrent Skip List Map | | |
|
10. | A hash map that uses primitive ints for the key rather than objects. | | |
11. | Integer Map | | |
12. | Copy On Write Map | | |
13. | Expiring Map | | |
14. | Array Map | | |
15. | Int Object HashMap (from CERN) | | |
16. | Int HashMap from jodd.org | | |
17. | String Map | | |
18. | List Map | | |
19. | Map using Locale objects as keys | | |
20. | Map with keys iterated in insertion order | | |
21. | Most Recently Used Map | | |
22. | Multi Map | | |
23. | MultiMap is a Java version of the C++ STL class std::multimap | | |
24. | Object Int Map | | |
25. | Sequenced HashMap | | |
26. | Int Int Map | | |
27. | Int Object Map | | |
28. | Identity HashMap | | |
29. | A java.util.Map interface which can only hold a single object | | |
30. | A multi valued Map | | |
31. | A simple hashmap from keys to integers | | |
32. | A memory-efficient hash map. | | |
33. | An implementation of the java.util.Map interface which can only hold a single object. | | |
34. | Utility methods for operating on memory-efficient maps. | | |
35. | CaseBlindHashMap - a HashMap extension, using Strings as key values. | | |
36. | A fixed size map implementation. | | |
37. | Int HashMap | | |
38. | IntMap provides a simple hashmap from keys to integers | | |
39. | Complex Key HashMap | | |
40. | A Map with multiple values for a key | | |
41. | A Map that accepts int or Integer keys only | | |
42. | A Map where keys are compared by object identity, rather than equals() | | |
43. | Type-safe Map, from char array to String value | | |
44. | A hashtable-based Map implementation with soft keys | | |
45. | List ordered map | | |
46. | Hash map using String values as keys mapped to primitive int values. | | |
47. | Lookup table that stores a list of strings | | |
48. | HashNMap stores multiple values by a single key value. Values can be retrieved using a direct query or by creating an enumeration over the stored elements. | | |
49. | Combines multiple values to form a single composite key. MultiKey can often be used as an alternative to nested maps. | | |