Related Functions
concept::stl::sequence Struct Reference

Sequence concept. More...

#include <dox/tag/concept/stl/sequence.hpp>

Inheritance diagram for concept::stl::sequence:
Inheritance graph
[legend]

List of all members.

Public Types

Iterator Types
typedef forward_iterator iterator
 The type used to iterate through the contents of the container.
typedef forward_iterator const_iterator
 The const type used to iterate through the contents of the container.
Basic Types
typedef assignable value_type
 The type of the object the container holds.
typedef value_typepointer
 The type that serves as a pointer to value_type.
typedef value_typereference
 The type that serves as a reference to value_type.
typedef value_type const * const_pointer
 The type that serves as a const pointer to value_type.
typedef value_type const & const_reference
 The type that serves as a pointer to value_type.
typedef size_t size_type
 The unsigned type used to represent the size of the container.
typedef ptrdiff_t difference_type
 The signed integral type used to represent the distance between iterators.

Public Member Functions

Constructors/Destructors
 sequence (size_type n=0)
 Default constructor.
 sequence (value_type const &t, size_type n)
 Fill constructor.
template<class InputIterator >
 sequence (InputIterator f, InputIterator l)
 Range constructor.
Lookup Methods
reference front ()
 Get the first element.
const_reference front () const
 Get the first element.
Size Methods
void resize (size_type n)
 Resize the container.
void resize (size_type n, value_type const &t)
 Resize the container.
Insert/Erase Methods
iterator insert (iterator p, const_reference v)
 Insert an object.
void insert (iterator p, size_type n, const_reference v)
 Fill insert.
void insert (iterator p, input_iterator f, input_iterator l)
 Range insert.
iterator erase (iterator p)
 Erase an element.
iterator erase (iterator f, iterator l)
 Erase a range of elements.
void clear ()
 Erase all elements.
Comparison Methods
bool operator== (equality_comparable const &e)
 Equality operator.
Comparison Methods
bool operator< (less_than_comparable const &l)
 Less-than operator.
Constructors/Destructors
void swap (container &c)
 Swap method.
Iterator Methods
iterator begin ()
 Get an iterator to the beginning.
const_iterator begin () const
 Get an iterator to the beginning.
iterator end ()
 Get an iterator to the end.
const_iterator end () const
 Get an iterator to the end.
Size Methods
size_type size () const
 Get the size of the container.
size_type max_size () const
 Get the maximum size of the container.
bool empty () const
 Check if the container is empty.

Related Functions

(Note that these are not member functions.)

void swap (assignable &a1, assignable &a2)
 Global swap.

Detailed Description

Sequence concept.


Member Typedef Documentation

The const type used to iterate through the contents of the container.

Reimplemented from concept::stl::container.

Reimplemented in concept::stl::list, concept::stl::reversible_container, concept::stl::sorted_associative_container, and concept::ash::hash_list.

The type that serves as a const pointer to value_type.

Reimplemented in concept::stl::pair_associative_container, and concept::ash::hash_matrix.

The type that serves as a pointer to value_type.

Reimplemented in concept::stl::pair_associative_container, and concept::ash::hash_matrix.

typedef ptrdiff_t concept::stl::container::difference_type [inherited]

The signed integral type used to represent the distance between iterators.

The type that serves as a pointer to value_type.

Reimplemented in concept::stl::pair_associative_container, and concept::ash::hash_matrix.

The type that serves as a reference to value_type.

Reimplemented in concept::stl::pair_associative_container, and concept::ash::hash_matrix.

typedef size_t concept::stl::container::size_type [inherited]

The unsigned type used to represent the size of the container.

Reimplemented in concept::ash::hash_matrix.

The type of the object the container holds.

Must be Assignable .

Reimplemented in concept::stl::pair_associative_container, and concept::ash::hash_matrix.


Constructor & Destructor Documentation

Default constructor.

Parameters:
nThe number of expected elements.

Fill constructor.

Parameters:
tThe object to fill the container with (copies).
nThe number of expected elements.
template<class InputIterator >
concept::stl::sequence::sequence ( InputIterator  f,
InputIterator  l 
)

Range constructor.

Parameters:
fThe beginning of the range.
lThe end of the range.

Member Function Documentation

Get an iterator to the beginning.

Returns:
An iterator to the beginning of the container.

Get an iterator to the beginning.

Returns:
A const_iterator to the beginning of the container.

Erase all elements.

bool concept::stl::container::empty ( ) const [inherited]

Check if the container is empty.

Returns:
True if the container is empty.

Get an iterator to the end.

Returns:
An iterator to the end of the container.

Get an iterator to the end.

Returns:
A const_iterator to the end of the container.

Erase an element.

Parameters:
pAn iterator pointing to the element.
Returns:
An iterator to the element after the one that was erased.

Erase a range of elements.

Parameters:
fThe beginning of the range to erase.
lThe end of the range to erase.
Returns:
An iterator to the element after the last erased element.

Get the first element.

Returns:
A reference to the first element in the container.

Get the first element.

Returns:
A const_reference to the first element in the container.

Insert an object.

Parameters:
pAn iterator to the element after the location to insert.
vThe object to insert.
Returns:
An iterator to the inserted element.

Fill insert.

Parameters:
pAn iterator to the element after the location to insert.
nThe number of copies to insert.
vThe object to insert.

Range insert.

Parameters:
pAn iterator to the element after the location to insert.
fThe beginning of the range to insert.
tThe end of the range to insert.

Get the maximum size of the container.

Returns:
The maximum number of elements the container can hold.
bool concept::stl::less_than_comparable::operator< ( less_than_comparable const &  l) [inherited]

Less-than operator.

bool concept::stl::equality_comparable::operator== ( equality_comparable const &  e) [inherited]

Equality operator.

Resize the container.

Equivalent to resize(n, value_type()).

Resize the container.

Parameters:
nThe number of expected elements.
tThe object to fill extra space with.

Modifies the container so that it has exactly n elements, inserting elements at the end or erasing elements from the end if necessary. If any elements are inserted, they are copies of t.

Get the size of the container.

Returns:
The number of elements in the container.
void concept::stl::container::swap ( container c) [inherited]

Swap method.


The documentation for this struct was generated from the following file:


© 2012   AshTL
Licensed under  AGPLv3
Hosted by  Get AshTL at SourceForge.net. Fast, secure and Free Open Source software downloads
Generated by  doxygen 1.7.4