/*📜🖋📜🖋📜🖋📜🖋📜🖋📜🖋📜🖋📜🖋*\ programmed by: __ __ ___ _ _ _ __ _ ®© | \ / |/ \| |_| | / \ | \ | | | |\V/| | O | _ |/ Δ \| |\\| | |_| V |_|\___/|_| |_|_/ \_|_| \__| All Ryts Reserved. \*📜🖋📜🖋📜🖋📜🖋📜🖋📜🖋📜🖋📜🖋*/ #include using namespace std; /* ---------- NOTE: ---------- The class List is just the rename to the vector and it just add some more functionality to it, and also to make easy to work with it. If u dont understand the methods of class list, then go to the main() function and u'll understand each of them. Hope u'll like it.😊 */ //some constants: auto const Last=-1; auto const DoesNotExist=-1; #define InitList initializer_list template class List final { vector

v; public: List(vector

l={}):v(l) {} List(InitList

l):v(l) {} List(const List

&l):v(l.v){} auto operator+(List

l) { auto r=v; for(auto ele:l.v) r.push_back(ele); return List(r); } auto operator+=(List

l) { for(auto ele:l.v) v.push_back(ele); return *this; } auto operator+=(InitList

l) { return (*this).operator+=(List(l)); } auto& operator*() {return v;} auto operator*(int n) { vector

r; for(int i=0;i l) {return v==l.v;} bool operator!=(List

l) {return v!=l.v;} bool operator<=(List

l) {return v<=l.v;} bool operator>=(List

l) {return v>=l.v;} bool operator<(List

l) {return v(List

l) {return v>l.v;} auto operator!() {return Rev();} void operator~() {v.clear();} Dt& operator[](unsigned i) {return v[i];} friend ostream& operator<<(ostream &os, List

obj) { auto vt=obj.v; cout<<'{'; for(auto i=vt.begin(); i &l) { auto vec=l.v; return vec.size(); } bool IsEmpty() {return v.empty();} bool IsNotEmpty() {return (v.empty()==false)?true:false;} bool HasNot(Dt ele) { if(this->Has(ele)) return false; else return true; } bool Has(Dt ele) { auto it=find(v.begin(),v.end(),ele); if(it!=v.end()) return true; else return false; } long IndexOf(Dt ele) { auto it=find(v.begin(),v.end(),ele); if(it!=v.end()) return distance(v.begin(),it); else return DoesNotExist; } void Add(Dt ele) {v.push_back(ele);} void Insert(Dt ele,int idx) { if(idx < int(v.size())) v.insert(v.begin()+idx,1,ele); else if(idx > int(v.size())) cerr<<"Error: Insertion failed due to invalid index.\n"; } auto Count(Dt ele) {return count(v.begin(),v.end(),ele);} void Clear() {v.clear();} void Pop() {v.pop_back();} void Remove(Dt ele) { if(this->Has(ele)) v.erase(v.begin()+IndexOf(ele)); else { cerr<<"Error: "< l) {for(auto ele:l.v) Remove(ele);} void RemoveItems(InitList

l) {RemoveItems(List(l));} void RemoveAt(Dt idx) { if(this->IsNotEmpty() and idx < int(v.size())) v.erase(v.begin()+idx); else if(this->IsEmpty()) { cerr<<"Error: Can\'t perform remove operation on empty List!\n"; exit(0); } else if(idx > int(v.size())) { cerr<<"Error: Can\'t perform remove operation on invalid index!\n"; exit(0); } } auto Sort(bool reverse=false) { if(reverse==false) sort(v.begin(),v.end()); else if(reverse==true) sort(v.begin(),v.end(),greater

()); return *this; } auto Sort(auto Func,bool reverse=false) { if(reverse==false) sort(v.begin(),v.end(),Func); else if(reverse==true) { sort(v.begin(),v.end(),Func); ::reverse(v.begin(),v.end()); } return *this; } //for slicing auto operator()(int start, int end=Last, unsigned step=1) { vector

r{}; if(this->IsNotEmpty()) { if(end == Last or end > int(v.size())) end=v.size(); else if(end<-1) end=v.size()+end; if(start<0) start=v.size()+start; for(int i=start;i r{}; for(int i=v.size()-1;i>=0;i+=rstep) r.push_back(v[i]); return List(r); } }; auto Range(int s,int e,int step=1) { vector v{}; if(e<0)//if e is -ve,step should also be -ve { if(not(step<0))//if it is not step*=(-1);//make it } for(int i=s;i!=e;i+=step) v.push_back(i); return v; } auto Range(int e) { return Range(0,e); } int main() { List a;//declaring a List object and it is default for integers //now we have created a list of type integer but it empty and we can directly print it either using cout. cout<<"a:"<{4,5,6})< langs={"Go","JS","R"}; cout< a:"<<(c > a)<= {2,3,4,5}:" //comparing 'c' with anonymous list <<(c >= List<>{2,3,4,5}); //Thats all!! //Thanks for reading. }

List class.cpp