Recommended
Recommended
More Related Content
What's hot
What's hot (20)
Similar to Modern_CPP-Range-Based For Loop.pptx
Similar to Modern_CPP-Range-Based For Loop.pptx (20)
More from Mohammed Sikander
More from Mohammed Sikander (20)
Recently uploaded
Recently uploaded (20)
Modern_CPP-Range-Based For Loop.pptx
- 1. Programming with Sikander CorporateTrainer: C, Modern C++, Python, Linux System Prog Video : https://youtu.be/cSH1dm9dXHM
- 2. Applying Range Based For loop – Fixed Size Arrays Vector and List Array 2 Programming with Sikander : Modern C++: Range Based For Loop
- 3. Executes a for loop over a range Used as a more readable equivalent to the traditional for loop operating over a range of values, such as all elements in a container. 3 Syntax : for ( for-range-declaration : expression ) { statement } Programming with Sikander : Modern C++: Range Based For Loop
- 4. 4 Programming with Sikander : Modern C++: Range Based For Loop
- 5. 5 Programming with Sikander : Modern C++: Range Based For Loop
- 6. 6 Programming with Sikander : Modern C++: Range Based For Loop
- 7. 7 Programming with Sikander : Modern C++: Range Based For Loop
- 8. 8 Programming with Sikander : Modern C++: Range Based For Loop
- 9. Can modify the elements of container. Does not make copy of elements. Is faster. 9 Programming with Sikander : Modern C++: Range Based For Loop
- 10. 10 Programming with Sikander : Modern C++: Range Based For Loop
- 11. Cannot be applied on pointers. 11 Programming with Sikander : Modern C++: Range Based For Loop
- 12. 12 Programming with Sikander : Modern C++: Range Based For Loop
- 13. Cannot traverse a part of list. Cannot traverse in reverse order. Cannot be applied to pointers. 13 Programming with Sikander : Modern C++: Range Based For Loop
- 14. 14 Programming with Sikander : Modern C++: Range Based For Loop
- 15. 15 Programming with Sikander : Modern C++: Range Based For Loop
- 16. Range based for loop can be applied on containers to simplify the programs. It can be applied on sequence and associative containers. It can be applied for all containers for which we can apply begin and end algorithm or contains begin and end members functions Cannot be used to traverse part of list. Cannot be applied on pointers. 16 Programming with Sikander : Modern C++: Range Based For Loop
Editor's Notes
- https://www.ibm.com/docs/en/i/7.3?topic=specifiers-auto-type-specifier-c11
- #include <iostream> using namespace std; int main() { int arr[5] = {5 , 10 , 12, 20 , 40}; for(int i : arr) cout << i << endl; return 0; }
- #include <iostream> using namespace std; int main() { double arr[5] = {5.2 , 10.5 , 1.2, 2.3 , 4.5}; for(double i : arr) cout << i << endl; return 0; }
- #include <iostream> using namespace std; int main() { double arr[5] = {5.2 , 10.5 , 1.2, 2.3 , 4.5}; for(double i : arr) cout << i << endl; return 0; }
- #include <iostream> using namespace std; int main() { int arr[5] = {5 , 10 , 12, 20 , 40}; for(int ele : arr) ele = ele + 2; for(int ele : arr) cout << ele << endl; return 0; }
- #include <iostream> using namespace std; int main() { int arr[5] = {5 , 10 , 12, 20 , 40}; for(int &ele : arr) ele = ele + 2; for(int ele : arr) cout << ele << endl; return 0; }
- int main() { int arr[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }; for(int &ele : arr ) { ele = ele + x; } for( const int &ele : arr ) { cout << ele << " "; } return 0; }
- #include <iostream> using namespace std; int main() { int iarr[5] = { 1, 2, 3, 4, 5}; double darr[5] = {5.2 , 10.5 , 1.2, 2.3 , 4.5}; for(const auto &ele : iarr ) { cout << ele << " "; } cout << endl; for(const auto &ele : darr ) { cout << ele << " "; } return 0; }
- #include <iostream> #include <vector> using namespace std; void printArray(int arr[]) { for (const auto &ele : arr) cout << ele << ' '; cout << endl; } int main() { int arr[] = {0, 7, 2, 3, 4, 5}; for (const auto &ele : arr) cout << ele << ' '; cout << endl; printArray ( arr ); }
- #include <iostream> #include <vector> #include <list> using namespace std; int main() { std::vector<int> v = {0, 7, 2, 3, 4, 5}; for (const auto &ele : v) std::cout << ele << ' '; cout << endl; std::list<int> lst = {8, 6, 4, 2, 1}; for (const auto &ele : lst) std::cout << ele << ' '; }
- #include <iostream> #include <vector> #include <list> using namespace std; void printVector(vector <int> &v) { cout <<"Elements of Vector in Function \n"; for (const auto &ele : v) cout << ele << ' '; cout << endl; } int main() { vector<int> v = {0, 7, 2, 3, 4, 5}; cout <<"Elements of Vector in Main \n"; for (const auto &ele : v) cout << ele << ' '; cout << endl; printVector ( v ); }
- #include <iostream> #include <vector> #include <map> using namespace std; class Base { public : Base() { } Base(const Base &b) { cout <<"Base Copy Constructor \n"; } virtual void display() { cout <<"Base Display \n"; } }; class Derived : public Base { public : Derived(){} Derived(const Derived &b) : Base(b) { cout <<"Derived Copy Constructor \n"; } virtual void display() { cout <<"Derived Display \n"; } }; int main() { vector < Base *> v; v.push_back((new Base())); v.push_back((new Base())); v.push_back((new Derived())); v.push_back((new Derived())); for(Base *ele : v) ele->display(); }