WGH
Reputation: 3519
Container similar to Android's ArrayMap in C++
Android provides an associative container named ArrayMap, which is implemented with two simple arrays.
This container is supposed to be somewhat slower than other data structures, especially when inserting data, but it is very memory-efficient.
Is there such thing already implemented in C++?
Upvotes: 1
Views: 179
Answers (1)
WGH
Reputation: 3519
Boost's flat_map and EASTL's vector_map seem to be the analogues of ArrayMap.
Upvotes: 1
Related Questions
- Custom Memory Allocator for STL map
- How can I implement a fast map having multiple keys?
- Fastest C++ map?
- Minimizing memory overhead using C++ containers (std::map and std::vector too expensive)
- c++ stl map storage and memory usage
- Fast C++ container like the C# HashSet<T> and Dictionary<K,V>?
- std::map performance c++
- Fast map implementation in C++
- Simple and efficient container in C++ with characteristics of map and list containers
- What container type provides better (average) performance than std::map?