Open 0x7CFE opened 11 years ago
When using std::map as a cache we usually do not need ordered collection traversal features. Moreover, insert/access operations on std::map is O(log N) whereas insert to hash container (like unordered_map) is nearly O(1).
This may improve performance of VM.
When using std::map as a cache we usually do not need ordered collection traversal features. Moreover, insert/access operations on std::map is O(log N) whereas insert to hash container (like unordered_map) is nearly O(1).
This may improve performance of VM.