c-resources/CPlusPlus20ForProgrammers-m.../examples/ch06/fig06_03.cpp

66 lines
2.5 KiB
C++
Raw Normal View History

2024-04-09 06:45:18 +00:00
// fig06_03.cpp
// Using range-based for.
#include <iostream>
#include <array>
int main() {
std::array items{1, 2, 3, 4, 5}; // type inferred as array<int, 5>
2024-04-16 06:03:08 +00:00
std::array items2{1, 2, 3, 4, 5};
2024-04-09 06:45:18 +00:00
// display items before modification
std::cout << "items before modification: ";
for (const int& item : items) { // item is a reference to a const int
2024-04-16 06:03:08 +00:00
std::cout << item << "<-- items\n";
2024-04-09 06:45:18 +00:00
}
2024-04-16 06:03:08 +00:00
std::cout << "items2 before modification:\n";
for (const int& item : items) { // item is a reference to a const int
std::cout << item << "<-- items2\n";
}
2024-04-09 06:45:18 +00:00
// multiply the elements of items by 2
for (int& item : items) { // item is a reference to an int
item *= 2;
}
2024-04-16 06:03:08 +00:00
for (int item : items2) { // item is a reference to an int
item *= 2;
}
2024-04-09 06:45:18 +00:00
// display items after modification
2024-04-16 06:03:08 +00:00
std::cout << "\nitems after modification: \n ";
2024-04-09 06:45:18 +00:00
for (const int& item : items) {
2024-04-16 06:03:08 +00:00
std::cout << item << "<-- items\n";
2024-04-09 06:45:18 +00:00
}
2024-04-16 06:03:08 +00:00
// display items after modification
std::cout << "\nitems2 after modification:\n ";
for (const int& item : items2) {
std::cout << item << "<-- items2\n";
}
2024-04-09 06:45:18 +00:00
// sum elements of items using range-based for with initialization
std::cout << "\n\ncalculating a running total of items' values:\n";
for (int runningTotal{0}; const int& item : items) {
runningTotal += item;
2024-04-16 06:03:08 +00:00
std::cout << " running total "<< item << runningTotal<<"\n";
2024-04-09 06:45:18 +00:00
}
}
/**************************************************************************
* (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. *
**************************************************************************/