Yes, what I actually want is a structure, where I can access values by the key, but, the the data structure is unsorted (i.e., sorted only by order of insertion).
Does std::unordered map satisfy this?
I have also tried a std::vector<std::pair<key,value>>, but, in order to access by key, don't I MANUALLY need to iterate through the elements, until I get the correct one?
Is there a data structure that allows for DIRECT access by key, and, that is unsorted.
By direct, i mean that the structure has a "get-value-by-key" implementation. I don't care about how it does it, I.e., about time complexity, as long as it is not absolutely unreasonable", of course, but, it should obviously at max be O(n), but again, without me having to implement it myself, or having tomyself loop through the elements.