std::uninitialized_fill_n

 

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)

 

Utilità libreria

Tipo di supporto (basic types, RTTI, type traits)

Gestione della memoria dinamica

La gestione degli errori

Programma di utilità

Funzioni variadic

Data e ora

Funzione oggetti

initializer_list (C++11)

bitset

hash (C++11)

Gli operatori relazionali Original: Relational operators The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

rel_ops::operator!= rel_ops::operator> rel_ops::operator<= rel_ops::operator>=

Coppie e tuple Original: Pairs and tuples The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

pair

tuple (C++11)

piecewise_construct_t (C++11)

piecewise_construct (C++11)

Swap, in avanti e spostare Original: Swap, forward and move The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

swap

forward (C++11)

move (C++11)

move_if_noexcept (C++11)

declval (C++11)

 

Gestione della memoria dinamica

Basso livello di gestione della memoria
Allocatori Original: Allocators The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
allocator
allocator_traits (C++11)
allocator_arg_t (C++11)
allocator_arg (C++11)
uses_allocator (C++11)
scoped_allocator_adaptor (C++11)
Non inizializzata stoccaggio Original: Uninitialized storage The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
uninitialized_copy
uninitialized_copy_n (C++11)
uninitialized_fill
uninitialized_fill_n
raw_storage_iterator
get_temporary_buffer
return_temporary_buffer
Puntatori intelligenti Original: Smart pointers The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
unique_ptr (C++11)
shared_ptr (C++11)
weak_ptr (C++11)
auto_ptr (deprecato)
owner_less (C++11)
enable_shared_from_this (C++11)
bad_weak_ptr (C++11)
default_delete (C++11)
Garbage collection supporto Original: Garbage collection support The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
declare_reachable (C++11)
undeclare_reachable (C++11)
declare_no_pointers (C++11)
undeclare_no_pointers (C++11)
pointer_safety (C++11)
get_pointer_safety (C++11)
Varie Original: Miscellaneous The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
pointer_traits (C++11)
addressof (C++11)
align (C++11)
C Library Original: C Library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
malloc calloc	realloc free

 

Defined in header <memory>
template< class ForwardIt, class Size, class T > void uninitialized_fill_n( ForwardIt first, Size count, const T& value )

Copies the given value value to the first count elements in an uninitialized memory area beginning at first. The elements in the uninitialized area are constructed using copy constructor.

Parametri

first	-	the beginning of the range of the elements to initialize
count	-	number of elements to construct
value	-	il valore di costruire gli elementi con Original: the value to construct the elements with The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Type requirements
- ForwardIt must meet the requirements of ForwardIterator.

Valore di ritorno

Iterator all'elemento passato l'ultimo elemento copiato.

Original:

Iterator to the element past the last element copied.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Complessità

Lineare in count

Original:

Linear in count

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Possibile implementazione

template< class ForwardIt, class Size, class T > void uninitialized_fill_n(ForwardIt first, Size count const T& value) { typedef typename std::iterator_traits<ForwardIt>::value_type Value; for (; count > 0; ++first, --count) { ::new (static_cast<void*>(&*first)) Value(value); } return first; }

Vedi anche

uninitialized_fill	copia di un oggetto ad una zona di memoria non inizializzata Original: copies an object to an uninitialized area of memory The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (funzione di modello)