forked from pdeitel/CPlusPlus20ForProgrammers
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfig06_01.cpp
executable file
·46 lines (38 loc) · 2.06 KB
/
fig06_01.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
// fig06_01.cpp
// Initializing an array's elements to zeros and printing the array.
#include <fmt/format.h> // C++20: This will be #include <format>
#include <iostream>
#include <array>
int main() {
std::array<int, 5> values; // values is an array of 5 int values
// initialize elements of array values to 0
for (size_t i{0}; i < values.size(); ++i) {
values[i] = 0; // set element at location i to 0
}
std::cout << fmt::format("{:>7}{:>10}\n", "Element", "Value");
// output each array element's value
for (size_t i{0}; i < values.size(); ++i) {
std::cout << fmt::format("{:>7}{:>10}\n", i, values[i]);
}
std::cout << fmt::format("\n{:>7}{:>10}\n", "Element", "Value");
// access elements via the at member function
for (size_t i{0}; i < values.size(); ++i) {
std::cout << fmt::format("{:>7}{:>10}\n", i, values.at(i));
}
// accessing an element outside the array's bounds with at
values.at(10); // throws an exception
}
/**************************************************************************
* (C) Copyright 1992-2022 by Deitel & Associates, Inc. and *
* Pearson Education, Inc. All Rights Reserved. *
* *
* DISCLAIMER: The authors and publisher of this book have used their *
* best efforts in preparing the book. These efforts include the *
* development, research, and testing of the theories and programs *
* to determine their effectiveness. The authors and publisher make *
* no warranty of any kind, expressed or implied, with regard to these *
* programs or to the documentation contained in these books. The authors *
* and publisher shall not be liable in any event for incidental or *
* consequential damages in connection with, or arising out of, the *
* furnishing, performance, or use of these programs. *
**************************************************************************/