Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
Example of range-base for loop
// Testing a c++11 code // Example range-based for loop // Nicrodamus // #include <iostream> #include <vector> #include <algorithm> #include <iterator> using namespace std; template<class T> ostream& operator<<(ostream& cout, const vector<T>& v){ for(T c : v){ cout << " " << c << " "; } return cout; } template<class T> class InitCont{ private: T val; public: InitCont(){}; InitCont(const T& init):val(init){}; ~InitCont(){}; T operator()(){ return val++; }; }; int main() { int sz = 15; // // Integers // vector<int>ivect(sz); InitCont<int>iElem(2); generate(ivect.begin(), ivect.end(), iElem); cout << "ivect = {" << ivect << "}\n"; // // Doubles // vector<double>dvect(sz); InitCont<double>dElem(1.5); generate(dvect.begin(), dvect.end(), dElem); cout << "dvect = {" << dvect << "}\n\n"; // // Characters // vector<char>lc(sz+11); InitCont<char>lcElem('a'); generate(lc.begin(), lc.end(), lcElem); cout << "Lower case set = {" << lc << "}\n"; vector<char>uc(sz+11); InitCont<char>ucElem('A'); generate(uc.begin(), uc.end(), ucElem); cout << "Upper case set = {" << uc << "}\n"; return 0; };
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
barai_1
Scope guarding
Trace
reverse linked list
typedef
Sort row sorted matrix
Prosta implementacja algorytmu Euklidesa (NWD)
CPP - Arrays - Ex.4
test yield
Two-phase sample with GCC
stackse - search stackoverflow differently
Please log in to post a comment.