KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
Correct me I'm wrong but std::map is an ordered map, thus each time I insert a value the map uses an algorithm to sort its items internally, which takes some time. My application gets information regarding some items on a constant interval. This app keeps a map which is defined like this: ::std::map<DWORD, myItem*> At first all items are considered "new" to the app. An "Item" object is being allocated and added to this map, associating its id and a pointer to it. When it's not a "new" item (just an update of this object) my app should find the object at the map, using the given id, and update. Most of the times I get updates. My question is: Is there any faster map implementation or should I keep using this one? Am I better use unordered_map?
Tags (comma-separated)
Save Edits
Cancel