Container for ordered access to it's elements. More...

Inherits concepts::Container_concept.

Public Member Functions
value_type &	operator[] (size_type n)
	The subscript operator.
iterator	begin ()
	Return an iterator that points at the first element.
iterator	end ()
	Return an iterator that points "after" the last element.
size_type	size ()
	Return number of elements in the container.
size_type	max_size ()
	Return maximum number of elements in the container.
bool	empty ()
	Return true if the container is empty.
Public Attributes
typedef	value_type
	Type of elements of the container.
typedef	iterator
	Type of the iterators returned by begin() and end().
typedef	size_type
	Type of the element-counts returned by size() and maxsize().

Detailed Description

Container for ordered access to it's elements.

A container that allows ordered access to its elements. The access is assumed to be read- and writeable, i.e. the subscript operator returns a reference to the actual elemen

Member Function Documentation

iterator concepts::Container_concept::begin ( ) [inherited]

Return an iterator that points at the first element.

bool concepts::Container_concept::empty ( ) [inline, inherited]

Return true if the container is empty.

iterator concepts::Container_concept::end ( ) [inherited]

Return an iterator that points "after" the last element.

I.e. dereferencing this iterator does not need to work, but (equality) comparison to any iterator that has finished iterating over all elements of the container should yield true

size_type concepts::Container_concept::max_size ( ) [inherited]

Return maximum number of elements in the container.

If the container is not limited in size, return 0.

value_type& concepts::RandomAccessContainer_concept::operator[] ( size_type n )

The subscript operator.

size_type concepts::Container_concept::size ( ) [inherited]

Return number of elements in the container.