Re: map vs. set (stl)
On May 23, 3:58 pm, Fei Liu <fei...@aepnetworks.com> wrote:
Qwavel wrote:
Let's say I have something like this, where 'name' is a POD type, and
'value' is a class.
std::map< name, value >
But then I realize that 'name' should actually be one of the members
of 'value' class, so I have a redundancy. I then switch and start
using std::set< value >. To make 'value' suitable for this purpose, I
make it look like this...
class value {
const int name;
bool operator<( const value& rhs ) const
{ return name < rhs.name; }
void operator=( const value& rhs );
...
};
This now satisfies the requirements of a set, and it works. Great.
But I feel as though I have really strayed far from the idea of a
set. For example, the key part of my value is constant, but the whole
value is not.
Should I really be using a set like this?
Sounds like you just need a vector...
F
But the set will be sorted so it (like the map) has faster random
lookup then the vector.
OP.