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

請參閱

參考

標準樣板程式庫