#include "memory/allocator.h"
#include <algorithm>
Go to the source code of this file.
Data Structures | |
class | Stack< Type > |
A stack whose storage capacity is variable at run-time. Similar to std::vector. More... | |
Namespaces | |
namespace | std |
Defines | |
#define | INCLUDED_CONTAINER_STACK_H |
Functions | |
template<typename Type > | |
bool | operator< (const Stack< Type > &self, const Stack< Type > &other) |
Returns true if self is lexicographically less than other . | |
template<typename Type > | |
void | std::swap (Stack< Type > &self, Stack< Type > &other) |
Swaps the values of self and other . Overloads std::swap(). |
bool operator< | ( | const Stack< Type > & | self, | |
const Stack< Type > & | other | |||
) | [inline] |
Returns true if self
is lexicographically less than other
.
Definition at line 210 of file stack.h.
References Stack< Type >::begin(), and Stack< Type >::end().