Namespace
Varianti

std::deque::begin, std::deque::cbegin

Da cppreference.com.
< cpp‎ | container‎ | deque
 
 
 
std :: deque
Membri funzioni
Original:
Member functions
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
deque::deque
deque::~deque
deque::operator=
deque::assign
deque::get_allocator
Elemento accesso
Original:
Element access
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
deque::front
deque::back
Iteratori
Original:
Iterators
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
deque::begin
deque::cbegin

(C++11)
deque::end
deque::cend

(C++11)
deque::rbegin
deque::crbegin

(C++11)
deque::rend
deque::crend

(C++11)
Capacità
Original:
Capacity
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
deque::empty
deque::size
deque::max_size
deque::shrink_to_fit
Modificatori
Original:
Modifiers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
deque::clear
deque::insert
deque::emplace
deque::erase
deque::push_front
deque::emplace_front
deque::pop_front
deque::push_back
deque::emplace_back
deque::pop_back
deque::resize
deque::swap
 
iterator begin();
(fino al c++11)
iterator begin() noexcept;
(dal C++11)
const_iterator begin() const;
(fino al c++11)
const_iterator begin() const noexcept;
(dal C++11)
const_iterator cbegin() const noexcept;

Restituisce un iteratore al primo elemento del container.

Se il container è vuoto, l'iteratore restituito sarà uguale a end().

range-begin-end.svg

Indice

[modifica] Parametri

(nessuno)

[modifica] Valore restituito

Iteratore al primo elemento

[modifica] Complessità

Costante


[modifica] Example

#include <iostream>
#include <deque>
#include <string>
 
int main()
{
	std::deque<int> ints {1, 2, 4, 8, 16};
	std::deque<std::string> fruits {"orange", "apple", "raspberry"};
	std::deque<char> empty;
 
	// Sums all integers in the deque ints (if any), printing only the result.
	int sum = 0;
	for (auto it = ints.cbegin(); it != ints.cend(); it++)
		sum += *it;
	std::cout << "Sum of ints: " << sum << "\n";
 
	// Prints the first fruit in the deque fruits, without checking if there is one.
	std::cout << "First fruit: " << *fruits.begin() << "\n";
 
	if (empty.begin() == empty.end())
		std::cout << "deque 'empty' is indeed empty.\n";
}

Output:

Sum of ints: 31
First fruit: orange
deque 'empty' is indeed empty.

[modifica] Vedi anche

restituisce un iteratore fino alla fine
Original:
returns an iterator to the end
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

(metodo pubblico) [edit]