Front Insertion Sequence

Type requirements

None, except for those imposed by the requirements of Front Insertion Sequence.

Public base classes

None.

Members
Member Where defined Description
value_type Container The type of object, T, stored in the slist.
pointer Container Pointer to T.
reference Container Reference to T
const_reference Container Const reference to T
size_type Container An unsigned integral type.
difference_type Container A signed integral type.
iterator Container Iterator used to iterate through an slist.
const_iterator Container Const iterator used to iterate through an slist.
iterator begin() Container Returns an iterator pointing to the beginning of the slist.
iterator end() Container Returns an iterator pointing to the end of the slist.
const_iterator begin() const Container Returns a const_iterator pointing to the beginning of the slist.
const_iterator end() const Container Returns a const_iterator pointing to the end of the slist.
size_type size() const Container Returns the size of the slist. Note: you should not assume that this function is constant time. It is permitted to be O(N), where N is the number of elements in the slist. If you wish to test whether an slist is empty, you should write L.empty() rather than L.size() == 0.
size_type max_size() const Container Returns the largest possible size of the slist.
bool empty() const Container true if the slist's size is 0.
slist()
Добавить отзыв
ВСЕ ОТЗЫВЫ О КНИГЕ В ИЗБРАННОЕ

0

Вы можете отметить интересные вам фрагменты текста, которые будут доступны по уникальной ссылке в адресной строке браузера.

Отметить Добавить цитату