队列小于比较。
template<typename Value,
typename Container>
bool operator<(queue<Value, Container>% left,
queue<Value, Container>% right);
参数
left
比较左边的容器。right
比较右边的容器。
备注
如果运算符函数返回 TRUE,最低位置的i,其中,!(right[i] < left[i]) 是正确的,left[i] < right[i]。 否则,返回left->queue::size (STL/CLR)() < right->size(),当2个队列按元素比较时,您可以用它测试left是否在right之前排序。
示例
// cliext_queue_operator_lt.cpp
// compile with: /clr
#include <cliext/queue>
typedef cliext::queue<wchar_t> Myqueue;
int main()
{
Myqueue c1;
c1.push(L'a');
c1.push(L'b');
c1.push(L'c');
// display contents " a b c"
for each (wchar_t elem in c1.get_container())
System::Console::Write(" {0}", elem);
System::Console::WriteLine();
// assign to a new container
Myqueue c2;
c2.push(L'a');
c2.push(L'b');
c2.push(L'd');
// display contents " a b d"
for each (wchar_t elem in c2.get_container())
System::Console::Write(" {0}", elem);
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/queue>
命名空间: cliext