stl_stack.h File Reference

#include <bits/concept_check.h>
#include <debug/debug.h>

Include dependency graph for stl_stack.h:

Include dependency graph

This graph shows which files directly or indirectly include this file:

Included by dependency graph

Go to the source code of this file.

Namespaces

namespace  std

Classes

class  std::stack< Type, Sequence >
 A standard container giving FILO behavior. More...

Functions

template<typename Type, typename Seq> bool operator== (const stack< Type, Seq > &x, const stack< Type, Seq > &y)
 Stack equality comparison.
template<typename Type, typename Seq> bool operator< (const stack< Type, Seq > &x, const stack< Type, Seq > &y)
 Stack ordering relation.
template<typename Type, typename Seq> bool operator!= (const stack< Type, Seq > &x, const stack< Type, Seq > &y)
 Based on operator==.
template<typename Type, typename Seq> bool operator> (const stack< Type, Seq > &x, const stack< Type, Seq > &y)
 Based on operator<.
template<typename Type, typename Seq> bool operator<= (const stack< Type, Seq > &x, const stack< Type, Seq > &y)
 Based on operator<.
template<typename Type, typename Seq> bool operator>= (const stack< Type, Seq > &x, const stack< Type, Seq > &y)
 Based on operator<.


Detailed Description

This is an internal header file, included by other library headers. You should not attempt to use it directly.

Definition in file stl_stack.h.


Function Documentation

template<typename Type, typename Seq>
bool operator!= const stack< Type, Seq > &  x,
const stack< Type, Seq > &  y
[inline]
 

Based on operator==.

Definition at line 250 of file stl_stack.h.

template<typename Type, typename Seq>
bool std::operator< const stack< Type, Seq > &  x,
const stack< Type, Seq > &  y
[inline]
 

Stack ordering relation.

Parameters:
x A stack.
y A stack of the same type as x.
Returns:
True iff x is lexicographically less than y.
This is an total ordering relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, the elements must be comparable with <, and std::lexicographical_compare() is usually used to make the determination. Definition at line 244 of file stl_stack.h.

template<typename Type, typename Seq>
bool operator<= const stack< Type, Seq > &  x,
const stack< Type, Seq > &  y
[inline]
 

Based on operator<.

Definition at line 262 of file stl_stack.h.

template<typename Type, typename Seq>
bool std::operator== const stack< Type, Seq > &  x,
const stack< Type, Seq > &  y
[inline]
 

Stack equality comparison.

Parameters:
x A stack.
y A stack of the same type as x.
Returns:
True iff the size and elements of the stacks are equal.
This is an equivalence relation. Complexity and semantics depend on the underlying sequence type, but the expected rules are: this relation is linear in the size of the sequences, and stacks are considered equivalent if their sequences compare equal. Definition at line 226 of file stl_stack.h.

References std::stack< Type, Sequence >::c.

template<typename Type, typename Seq>
bool operator> const stack< Type, Seq > &  x,
const stack< Type, Seq > &  y
[inline]
 

Based on operator<.

Definition at line 256 of file stl_stack.h.

template<typename Type, typename Seq>
bool operator>= const stack< Type, Seq > &  x,
const stack< Type, Seq > &  y
[inline]
 

Based on operator<.

Definition at line 268 of file stl_stack.h.


Generated on Wed Sep 8 10:20:50 2004 for libstdc++-v3 Source by doxygen 1.3.8