The array is a collection of homogeneous objects and this array container is defined for constant size arrays or (static size). This container wraps around fixed-size arrays and the information of its size are not lost when declared to a pointer.
In order to utilize arrays, we need to include the array header:
#include <array>
Let’s see an example.
CPP
#include <algorithm>
#include <array>
#include <iostream>
#include <iterator>
#include <string>
using namespace std;
int main() {
array<int, 5> ar1{{3, 4, 5, 1, 2}};
array<int, 5> ar2 = {1, 2, 3, 4, 5};
array<string, 2> ar3 = {{string("a"), "b"}};
cout << "Sizes of arrays are" << endl;
cout << ar1.size() << endl;
cout << ar2.size() << endl;
cout << ar3.size() << endl;
cout << "\nInitial ar1 : ";
for (auto i : ar1)
cout << i << ' ';
sort(ar1.begin(), ar1.end());
cout << "\nsorted ar1 : ";
for (auto i : ar1)
cout << i << ' ';
ar2.fill(10);
cout << "\nFilled ar2 : ";
for (auto i : ar2)
cout << i << ' ';
cout << "\nar3 : ";
for (auto &s : ar3)
cout << s << ' ';
return 0;
}
|
Output: Sizes of arrays are 5 5 2 Initial ar1 : 3 4 5 1 2 sorted ar1 : 1 2 3 4 5 Filled ar2 : 10 10 10 10 10 ar3 : a b
This C++ STL array is a kind of sequential container and is not used extremely in regular programming or in competitive programming but sometimes its member function provides an upper edge to it over the regular normal array that we use in our daily life. So, we are discussing some of the important member function that is used with such kind of array:
Member Functions for Array Template are as follows:
Syntax: array<object_type, arr_size> arr_name;
a) [ ] Operator : This is similar to the normal array, we use it to access the element store at index ‘i’ .
Ex:
C++
#include <iostream>
#include <array>
using namespace std;
int main() {
array <char , 3> arr={'G','f','G'};
cout<<arr[0] <<" "<<arr[2];
return 0;
}
|
b) front( ) and back( ) function: These methods are used to access the first and the last element of the array directly.
C++
#include <iostream>
#include <array>
using namespace std;
int main() {
array <int , 3> arr={'G','f','G'};
cout<<arr.front() <<" "<<arr.back();
return 0;
}
|
c) swap( ) function: This swap function is used to swap the content of the two arrays.
Ex:
C++
#include <iostream>
#include <array>
using namespace std;
int main() {
array <int , 3> arr={'G','f','G'};
array <int , 3> arr1={'M','M','P'};
arr.swap(arr1);
cout<<arr.front() <<" "<<arr.back();
return 0;
}
|
d) empty( ) function: This function is used to check whether the declared STL array is empty or not, if it is empty then it returns true else false.
Ex:
C++
#include <iostream>
#include <array>
using namespace std;
int main() {
array <int , 3> arr={'G','f','G'};
array <int , 3> arr1={'M','M','P'};
bool x = arr.empty();
cout<<boolalpha<<(x);
return 0;
}
|
e) at( ) function: This function is used to access the element stored at a specific location, if we try to access the element which is out of bounds of the array size then it throws an exception.
Ex:
C++
#include <iostream>
#include <array>
using namespace std;
int main() {
array <int , 3> arr={'G','f','G'};
array <int , 3> arr1={'M','M','P'};
cout<< arr.at(2) <<" " << arr1.at(2);
return 0;
}
|
f) fill( ) function: This is specially used to initialize or fill all the indexes of the array with a similar value.
Ex:
C++
#include <iostream>
#include <array>
using namespace std;
int main() {
array <int , 5> arr;
arr.fill(1);
for(int i: arr)
cout<<arr[i]<<" ";
return 0;
}
|
g) size( ) or max_size( ) and sizeof( ) function: Both size( ) or max_size( ) are used to get the maximum number of indexes in the array while sizeof( ) is used to get the total size of array in bytes.
C++
#include <iostream>
#include <array>
using namespace std;
int main() {
array <int , 10> arr;
cout<<arr.size()<<'\n';
cout<<arr.max_size()<<'\n';
cout<<sizeof(arr);
return 0;
}
|
h) data( ): This function returns the pointer to the first element of the array object. Because elements in the array are stored in contiguous memory locations. This data( ) function return us the base address of the string/char type object.
Ex:
C++
#include <iostream>
#include <cstring>
#include <array>
using namespace std;
int main ()
{
const char* str = "GeeksforGeeks";
array<char,13> arr;
memcpy (arr.data(),str,13);
cout << arr.data() << '\n';
return 0;
}
|
I) cbegin( ) and cend( ): go to this gfg link : Click_me
Similar Reads
STD::array in C++
The array is a collection of homogeneous objects and this array container is defined for constant size arrays or (static size). This container wraps around fixed-size arrays and the information of its size are not lost when declared to a pointer. In order to utilize arrays, we need to include the ar
5 min read
array::begin() and array::end() in C++ STL
Array classes are generally more efficient, light-weight and reliable than C-style arrays. The introduction of array class from C++11 has offered a better alternative for C-style arrays. array::begin() begin() function is used to return an iterator pointing to the first element of the array containe
3 min read
array::size() in C++ STL
The array::size() method is used to find the number of elements in the array container. It is the member method std::array class defined inside <array> header file. In this article, we will learn about the array::size() method in C++. Example: [GFGTABS] C++ // C++ Program to illustrate the use
2 min read
array::empty() in C++ STL
Array classes are generally more efficient, light-weight and reliable than C-style arrays. The introduction of array class from C++11 has offered a better alternative for C-style arrays. array::empty() empty() function is used to check if the array container is empty or not. Syntax : arrayname.empty
1 min read
array::front() and array::back() in C++ STL
Array classes are generally more efficient, light-weight, and reliable than C-style arrays. The introduction of array class from C++11 has offered a better alternative for C-style arrays. array::front() This function is used to reference the first element of the array container. This function can be
3 min read
array::at() in C++ STL
Array classes are generally more efficient, light-weight and reliable than C-style arrays. The introduction of array class from C++11 has offered a better alternative for C-style arrays. array::at() This function is used to return the reference to the element present at the position given as the par
2 min read
array::operator[ ] in C++ STL
Array classes are generally more efficient, light-weight, and reliable than C-style arrays. The introduction of array class from C++11 has offered a better alternative for C-style arrays. array::operator[] This operator is used to reference the element present at position given inside the operator.
2 min read
array get() function in C++ STL
The array::get() is a built-in function in C++ STL which returns a reference to the i-th element of the array container. Syntax: get[Tex][/Tex](array_name) Parameters: The function accepts two mandatory parameters which are described below. i - position of an element in the array, with 0 as the posi
2 min read
array data() in C++ STL with Examples
The array::data() is a built-in function in C++ STL which returns an pointer pointing to the first element in the array object. Syntax: array_name.data() Parameters: The function does not accept any parameters. Return Value: The function returns an pointer. Below programs illustrate the above functi
2 min read
array::max_size() in C++ STL
Array classes are generally more efficient, light-weight and reliable than C-style arrays. The introduction of array class from C++11 has offered a better alternative for C-style arrays. array::max_size() This function returns the maximum number of elements that the array container can contain. In c
1 min read