stl_queue.h File Reference

#include <bits/concept_check.h>

Include dependency graph for stl_queue.h:

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

Go to the source code of this file.

Namespaces

namespace  std

Functions

template<typename Type, typename Sequence>
bool operator== (const queue< Type, Sequence > &x, const queue< Type, Sequence > &y)
 Queue equality comparison.
template<typename Type, typename Sequence>
bool operator< (const queue< Type, Sequence > &x, const queue< Type, Sequence > &y)
 Queue ordering relation.
template<typename Type, typename Sequence>
bool operator!= (const queue< Type, Sequence > &x, const queue< Type, Sequence > &y)
 Based on operator==.
template<typename Type, typename Sequence>
bool operator> (const queue< Type, Sequence > &x, const queue< Type, Sequence > &y)
 Based on operator<.
template<typename Type, typename Sequence>
bool operator<= (const queue< Type, Sequence > &x, const queue< Type, Sequence > &y)
 Based on operator<.
template<typename Type, typename Sequence>
bool operator>= (const queue< Type, Sequence > &x, const queue< Type, Sequence > &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_queue.h.


Function Documentation

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

Based on operator==.

Definition at line 247 of file stl_queue.h.

template<typename Type, typename Sequence>
bool operator< const queue< Type, Sequence > &  x,
const queue< Type, Sequence > &  y
[inline]
 

Queue ordering relation.

Parameters:
x A queue.
y A queue of the same type as x.
Returns:
True iff x is lexographically 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::lexographical_compare() is usually used to make the determination.

Definition at line 241 of file stl_queue.h.

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

Based on operator<.

Definition at line 259 of file stl_queue.h.

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

Queue equality comparison.

Parameters:
x A queue.
y A queue of the same type as x.
Returns:
True iff the size and elements of the queues 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 queues are considered equivalent if their sequences compare equal.

Definition at line 224 of file stl_queue.h.

template<typename Type, typename Sequence>
bool operator> const queue< Type, Sequence > &  x,
const queue< Type, Sequence > &  y
[inline]
 

Based on operator<.

Definition at line 253 of file stl_queue.h.

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

Based on operator<.

Definition at line 265 of file stl_queue.h.


Generated on Thu Feb 10 23:23:36 2005 for libstdc++-v3 Source by  doxygen 1.4.0