#include #include #include #include using namespace std; struct Row{ char t; vector v; Row(char ch, int a, int b, int c, int d, int e, int f, int g) :t{ch}, v{a,b,c,d,e,f,g} {}; bool operator < (const Row &other){ return this->v < other.v; } bool operator > (const Row &other){ return this->v > other.v; } bool operator == (const Row &other){ return this->v == other.v; } bool operator != (const Row &other){ return this->v != other.v; } bool operator >= (const Row &other){ return this->v >= other.v; } bool operator <= (const Row &other){ return this->v <= other.v; } void show(){ cout<t<<" -> "; for(auto i:this->v) cout<< i << ' '; cout<<'\n'; } }; //custom function for vector to sort based on index void sortAtIndex(int i, vector &v, bool asc=true){ sort(v.begin(), v.end(), [i, asc](const Row &a, const Row &b){ if (asc) return a.v[i]b.v[i]; }); }; //generic sortAtIndex for vectors (does not work on custom structs where sort index have to be specified) template void sortAtIndex(T i, vector &v, bool asc=true){ sort(v.begin(), v.end(), [i, asc](const U &a, const U &b){ if (asc) return a[i]b[i]; }); }; //template for filter function: template T filter(const T &container, U predicate) { T result; std::copy_if(container.begin(), container.end(), std::back_inserter(result), predicate); return result; }; //template for find template bool contains(U &vec, const T & elem) { bool result = false; if( find(vec.begin(), vec.end(), elem) != vec.end() ) { result = true; } return result; }; int main(){ //filter test1: vector test1 = {1,4,7,8,9,0}; cout<<"---filter test1:---\n"; cout<<"test1 = "; for(auto i:test1) cout< 5; }); cout<<"test1gt5 = "; for(auto i:test1gt5) cout< x){return x[0]=='z';}); cout<<"test2filtered('z'):\n"; for(auto j:test2filtered){ for(auto i:j) cout< x) { return contains(x, 'z'); }); cout<<"test2findz(vectors containing 'z'):\n"; for(auto j:test2findz){ for(auto i:j) cout< grid{{ Row{'a', 1,2,3,4,5,6,7}, Row{'b', 5,6,7,8,9,1,2}, Row{'c', 0,1,2,2,4,5,6} }}; cout<<"original grid:\n"; for(auto i: grid) i.show(); //push_back works Row d{'d', 2,2,3,4,7,6,9}; grid.push_back(d); cout<<"after push_back(d):\n"; for(auto i: grid) i.show(); //using sort on vector grid: cout<<"after sort grid(sorted by vectors Row.v):\n"; sort(grid.begin(), grid.end()); for(auto i: grid) i.show(); //sort by tag using lambda expression cout<<"sort by tag using lambda expression:\n"; sort(grid.begin(), grid.end(), [](Row const &a, Row const &b){return a.t):\n"; sort(grid.begin(), grid.end(), [](Row const &a, Row const &b){return a.t>b.t;}); for(auto i: grid) i.show(); //using sortAtIndex function(ascending based on index 6): cout<<"after sortAtIndex 6:\n"; sortAtIndex(6, grid); for(auto i: grid) i.show(); //using sortAtIndex function, asc=false(descending based on index 6): cout<<"after sortAtIndex 6:\n"; sortAtIndex(6, grid, false); for(auto i: grid) i.show(); //using sortAtIndex function, asc=false(descending based on index 3): cout<<"after sortAtIndex 3:\n"; sortAtIndex(3, grid); for(auto i: grid) i.show(); //using filter on vector: auto grid2 = filter(grid, [](Row r){ return r.v[1]==2; }); cout<<"row where index 1 == 2:\n"; for(auto i: grid2) i.show(); cout<<"sorted:\n"; sort(grid2.begin(),grid2.end()); for(auto i: grid2) i.show(); //using filter and contains to find Rows contining 7: auto gridfind7 = filter(grid,[](Row x) { return contains(x.v, 7); }); cout<<"gridfind7(Rows in grid containing 7):\n"; for(auto i:gridfind7){ i.show(); }; }

c++SimpleStructSort