std::map::insert trouble

I have very simple and stupid trouble:

std::map<b2Vec2, b2Body*> mTakePoints;
mTakePoints.insert(std::make_pair(point, body));

Compiler says:

In file included from /usr/include/c++/4.4/string:50,
                 from /usr/include/ClanLib-2.2/ClanLib/Display/../Core/Text/string_types.h:34,
                 from /usr/include/ClanLib-2.2/ClanLib/Display/display.h:35,
                 from /usr/include/ClanLib-2.2/ClanLib/display.h:40,
                 from /home/pfight/Themisto/include/World/Actions/Action.hpp:21,
                 from /home/pfight/Themisto/include/World/Actions/TakeAction.hpp:21,
                 from /home/pfight/Themisto/src/World/Actions/TakeAction.cpp:18:
/usr/include/c++/4.4/bits/stl_function.h: In member function ‘bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = b2Vec2]’:
/usr/include/c++/4.4/bits/stl_tree.h:1170:   instantiated from ‘std::pair<typename std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator, bool> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(const _Val&) [with _Key = b2Vec2, _Val = std::pair<const b2Vec2, b2Body*>, _KeyOfValue = std::_Select1st<std::pair<const b2Vec2, b2Body*> >, _Compare = std::less<b2Vec2>, _Alloc = std::allocator<std::pair<const b2Vec2, b2Body*> >]’
/usr/include/c++/4.4/bits/stl_map.h:500:   instantiated from ‘std::pair<typename std::_Rb_tree<_Key, std::pair<const _Key, _Tp>, std::_Select1st<std::pair<const _Key, _Tp> >, _Compare, typename _Alloc::rebind<std::pair<const _Key, _Tp> >::other>::iterator, bool> std::map<_Key, _Tp, _Compare, _Alloc>::insert(const std::pair<const _Key, _Tp>&) [with _Key = b2Vec2, _Tp = b2Body*, _Compare = std::less<b2Vec2>, _Alloc = std::allocator<std::pair<const b2Vec2, b2Body*> >]’
/home/pfight/Themisto/src/World/Actions/TakeAction.cpp:43:   instantiated from here
/usr/include/c++/4.4/bits/stl_function.h:230: error: no match for ‘operator<’ in ‘__x < __y’
/usr/include/ClanLib-2.2/ClanLib/Display/../Core/Text/string_data16.h:383: note: candidates are: bool operator<(const CL_StringData16&, const wchar_t*)
/usr/include/ClanLib-2.2/ClanLib/Display/../Core/Text/string_data16.h:382: note:                 bool operator<(const wchar_t*, const CL_StringData16&)
/usr/include/ClanLib-2.2/ClanLib/Display/../Core/Text/string_data16.h:381: note:                 bool operator<(const CL_StringData16&, const CL_StringData16&)
/usr/include/ClanLib-2.2/ClanLib/Displa开发者_如何学Goy/../Core/Text/string_data8.h:383: note:                 bool operator<(const CL_StringData8&, const char*)
/usr/include/ClanLib-2.2/ClanLib/Display/../Core/Text/string_data8.h:382: note:                 bool operator<(const char*, const CL_StringData8&)
/usr/include/ClanLib-2.2/ClanLib/Display/../Core/Text/string_data8.h:381: note:                 bool operator<(const CL_StringData8&, const CL_StringData8&)

TakeAction.cpp:43 it is row with insert call. For fun I tried next:

std::pair<b2Vec2, b2Body*> item(point, body);
mTakePoints.insert(item);

All the same.

I'm pretty confused, explain please, what is wrong?

Did you define the following operator:?

bool operator< (const b2Vec2&, const b2Vec2&)

std::map requires that the less-than operator be defined for keys, or that a less-than operator be provided as a template argument. In particular, std::map is implemented as a (sorted) binary tree, and needs operator< to figure out where to put new items.

For map, set and the like ordered containers must be told where to put new items. This is done by implementing the less-than operator:

bool operator< (const b2Vec2& first, const b2Vec2& second) 
{
   return first.some_attribute < second.some_attribute;
}

You can see in the compilation error that it was missing:

/usr/include/c++/4.4/bits/stl_function.h:230: error: no match for ‘operator<’ in ‘__x < __y’

The rest of the output tells you that the compiler tried to find a suitable operator and failed.