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

 

C++

Linguaggio

Concetti

Libreria di Utilità

Stringhe

Contenitori

Algoritmi

Iteratori

Libreria matematca

Input/output

Localizzazione

Espressioni regolari(C++11)

Operazioni atomicche(C++11)

Multithreading(C++11)

 

Contenitori libreria

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

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()constnoexcept;		(dal C++11)
const_iterator cbegin()constnoexcept;

Restituisce un iteratore al primo elemento del container.

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

Parametri

(nessuno)

Valore restituito

Iteratore al primo elemento

Complessità

Costante

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.

Vedi anche

end cend	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)