Return to Question

Possible Duplicate:
How to find an item in a std::vector?

Is there something in <algorithm> which allows you to check if a std:: container contains something? Or, a way to make one, for example:

if(a.x == b.x && a.y == b.y)
return true;

return false;

Can this only be done with std::map since it uses keys?

Thanks

Is there something in <algorithm> which allows you to check if a std:: container contains something? Or, a way to make one, for example:

if(a.x == b.x && a.y == b.y)
return true;

return false;

Can this only be done with std::map since it uses keys?

Thanks

Possible Duplicate:
How to find an item in a std::vector?

Is there something in <algorithm> which allows you to check if a std:: container contains something? Or, a way to make one, for example:

if(a.x == b.x && a.y == b.y)
return true;

return false;

Can this only be done with std::map since it uses keys?

Thanks

Possible Duplicate:
How to find an item in a std::vector?

Is there something in <algorithm> which allows you to check if a std:: container contains something? Or, a way to make one, for example:

if(a.x == b.x && a.y == b.y)
return true;

return false;

Can this only be done with std::map since it uses keys?

Thanks

Possible Duplicate:
How to find an item in a std::vector?

Is there something in algorithm.h which allows you to check if a std:: container contains something? Or a way to make one ex:

if(a.x == b.x && a.y == b.y)
return true;

return false;

can this only be done with std::map since it uses keys?

Thanks

Possible Duplicate:
How to find an item in a std::vector?

Is there something in <algorithm> which allows you to check if a std:: container contains something? Or, a way to make one, for example:

if(a.x == b.x && a.y == b.y)
return true;

return false;

Can this only be done with std::map since it uses keys?

Thanks