小于比较列表。
template<typename Key,
typename Mapped>
bool operator<(map<Key, Mapped>% left,
map<Key, Mapped>% right);
参数
left
比较左边的容器。right
比较右边的容器。
备注
如果运算符函数返回 TRUE,最低位置的i,其中,!(right[i] < left[i]) 是正确的,left[i] < right[i]。 否则,返回left->size() < right->size() 您使用它测试 left 在 right 之前是否有序,当2个map按元素比较时。
示例
// cliext_map_operator_lt.cpp
// compile with: /clr
#include <cliext/map>
typedef cliext::map<wchar_t, int> Mymap;
int main()
{
Mymap c1;
c1.insert(Mymap::make_value(L'a', 1));
c1.insert(Mymap::make_value(L'b', 2));
c1.insert(Mymap::make_value(L'c', 3));
// display contents " [a 1] [b 2] [c 3]"
for each (Mymap::value_type elem in c1)
System::Console::Write(" [{0} {1}]", elem->first, elem->second);
System::Console::WriteLine();
// assign to a new container
Mymap c2;
c2.insert(Mymap::make_value(L'a', 1));
c2.insert(Mymap::make_value(L'b', 2));
c2.insert(Mymap::make_value(L'd', 4));
// display contents " [a 1] [b 2] [d 4]"
for each (Mymap::value_type elem in c2)
System::Console::Write(" [{0} {1}]", elem->first, elem->second);
System::Console::WriteLine();
System::Console::WriteLine("[a b c] < [a b c] is {0}",
c1 < c1);
System::Console::WriteLine("[a b c] < [a b d] is {0}",
c1 < c2);
return (0);
}
要求
标头: <cliext/map>
命名空间: cliext