operator< (<stack>)

测试，如果运算符左侧的对象堆大于右侧的对象堆太少。

bool operator<( 
   const stack <Type, Container>& _Left, 
   const stack <Type, Container>& _Right 
);

参数

• _Left
  类型 stack对象。

• _Right
  类型 stack对象。

返回值

true，如果运算符左侧的堆栈与和并不等于于堆栈小于位于运算符的右侧；为 false。

备注

在堆栈对象之间的比较基于元素的一种比较成对。 小于两个堆栈对象之间的关系。根据第一个不相等对比较元素。

示例

// stack_op_lt.cpp
// compile with: /EHsc
#include <stack>
#include <list>
#include <iostream>

int main( )
{
   using namespace std;

   // Declares stacks with list base container
   stack <int, list<int> > s1, s2, s3;

   s1.push( 2 );
   s1.push( 4 );
   s1.push( 6 );
   s1.push( 8 );
   s2.push( 5 );
   s2.push( 10 );
   s3.push( 2 );
   s3.push( 4 );
   s3.push( 6 );
   s3.push( 8 );

   if ( s1 >= s2 )
      cout << "The stack s1 is greater than or equal to "
           << "the stack s2." << endl;
   else
      cout << "The stack s1 is less than "
           << "the stack s2." << endl;

   if ( s1>= s3 )
      cout << "The stack s1 is greater than or equal to "
           << "the stack s3." << endl;
   else
      cout << "The stack s1 is less than "
           << "the stack s3." << endl;

   // to print out the stack s1 ( by unstacking the elements):
   stack <int>::size_type i_size_s1 = s1.size( );
   cout << "The stack s1 from the top down is: ( ";
   unsigned int i;
   for ( i = 1 ; i <= i_size_s1 ; i++ )
   {
      cout << s1.top( ) << " ";
      s1.pop( );
   }
   cout << ")." << endl;
}

要求

页眉： <堆栈>

命名空间: std

请参见

参考

标准模板库