C++ array - Revision history

VolodyA! V Anarhist: matrices and jagged

2015-05-13T14:59:04Z

matrices and jagged

VolodyA! V Anarhist: placement of data

2015-05-13T14:54:33Z

placement of data

VolodyA! V Anarhist: passing array

2015-05-13T14:52:20Z

passing array

VolodyA! V Anarhist: Created page with "{{FormatInfo | name = C++ array | formattype = electronic | subcat = Data types | subcat2 = C++ data types | subcat3 = | subcat4 = ..."

2015-05-13T14:48:34Z

Created page with "{{FormatInfo | name = C++ array | formattype = electronic | subcat = Data types | subcat2 = C++ data types | subcat3 = | subcat4 = ..."

New page

{{FormatInfo
| name = C++ array
| formattype = electronic
| subcat = Data types
| subcat2 = C++ data types
| subcat3 =
| subcat4 =
| subcat5 =
| thiscat =
| extensions =
| mimetypes =
| locfdd =
| fourccs =
| pronom =
| type code =
| uniform type =
| conforms to =
| released = 1983
| image =
| caption =
}}

C++ array is a way to store a series of data of the same type and purpose, the data then can be accessed by the name of the array and index within it. C++ array index always begins with 0 and goes to the value 1 less than the size of an array.

Index is written within square brackets. This way of indexing data has become so associated with arrays, that many people expect that only arrays can do that. This is not the case, since it is possible to define <code>operator[]</code> for any type.

C++ does not provide safety for dereferencing array elements. It becomes the job of the programmer to track and check that the element really exists within a specific array before trying to do any operations with it. Failing to do so will lead to undefined behaviour.

==Dynamic vs static arrays==
Static arrays must have a known declaration at compile time, meaning that it is not possible to have a scenario where the application makes the decision about the size of an array during its operation. Static arrays are normally placed inside the stack of the program.

Dynamic arrays are placed within the heap and can have the size that it determined at the run time.

Neither of these, however, can have the size, that changes after it has been declared.

==Arrays and pointers==
: See [[C%2B%2B_pointer#Pointer_to_an_array|C++ pointer]]

==See also==
* [[std::array]] C++ array template class

@@ Line 46: / Line 46: @@
 ==Placement of data within the array==
 Data is placed within the array at equal intervals. Usually these intervals are equal to the size of the data type of individual cell. The end of the array may have some padding with unused memory.
 ==See also==
 * [[std::array]] C++ array template class

@@ Line 36: / Line 36: @@
 ==Arrays and pointers==
 : See [[C%2B%2B_pointer#Pointer_to_an_array|C++ pointer]]
 ==See also==
 * [[std::array]] C++ array template class