//////////////////////////////////////// // List template with Nested class /////////////////////////////////////// // By Paul Caron /////////////////////////////////////// #include using namespace std; template class List{ private: class Node{ public: T data; Node* next=NULL; Node(T data){ this->data=data; } ~Node(){ //cout<<"Node destroyed"<next; delete nodePointer; } } void push_back(T data){ Node* newNode= new Node(data); if(front==NULL){ front=newNode; }else{ back->next=newNode; } count++; back=newNode; } T pop_back(){ if(back==NULL){ //exit(EXIT_FAILURE); return NULL;//throw error } T d=back->data; if(front==back){ delete front; front=NULL; back=NULL; count--; return d; } Node* currentPointer=front; Node* nextPointer=front->next; while(nextPointer!=back){ currentPointer =nextPointer; nextPointer =nextPointer->next; } delete back; currentPointer->next=NULL; back=currentPointer; back->next=NULL; count--; return d; } void push_front(T data){ Node* newNode=new Node(data); newNode->next=front; front=newNode; if(back==NULL){ back=newNode; } count++; } T pop_front(){ if(front==NULL){ //exit(EXIT_FAILURE); return NULL;//throw error } T d = front->data; Node* f=front; front=front->next; if(front==NULL){ back=NULL; } delete f; count--; return d; } void insert(T data, uint32_t index){ if(index>count){ // exit(EXIT_FAILURE); return;//throw error or return } else if(index==count){ push_back(data); return; } else if(index==0){ push_front(data); return; } Node* newNode=new Node(data); Node* previous=front; Node* nodePointer=front; for(uint32_t i=0;inext; } previous->next=newNode; newNode->next=nodePointer; count++; } T remove(uint32_t index){ if(index>=count){ //exit(EXIT_FAILURE); return NULL;//throw error or return } else if(index==count-1){ T d=pop_back(); return d; } else if(index==0){ T d=pop_front(); return d; } Node* previous=front; Node* nodePointer=front; for(uint32_t i=0;inext; } previous->next=nodePointer->next; T d=nodePointer->data; delete nodePointer; count--; return d; } T at(uint32_t index){ if(index >=count){ //exit(EXIT_FAILURE); return NULL;//throw error } Node* nodePointer=front; for(uint32_t i=0;inext; } return nodePointer->data; } uint32_t getCount(){ return count; } void toArray(T* arr){ if(count==0){ return; } Node* nodePointer=front; T* end=arr+count; for(T* i=arr;i!=end;i++){ *i=nodePointer->data; nodePointer=nodePointer->next; } } void sort(){ } }; class Object{ public: int x=4; Object(){ } Object(nullptr_t n){ x=NULL; } }; int main(){ List