Please correct my errors upvote Clears our entire .pdf
- 1. Please correct my errors. upvote /** * Clears our entire list, making it empty * Remember: All removal operations should be memory-leak free. */ void clear() { // Set a pointer to the head of the list Node<T> *current = head_; // Loop through each node in the list while (current != nullptr) { Node<T> *next = current->getNext(); delete current; current = next; } // Set head and tail pointers to null and reset the size of the list head_ = nullptr; tail_ = nullptr; size_ = 0; } /** * Insert an element after the node pointed to by the pos Iterator * * If the list is currently empty, * ignore the iterator and just make the new node at the head/tail (list of length 1). * * If the incoming iterator is this->end(), insert the element at the tail * * Should return an iterator that points to the newly added node * * To avoid repeated code, it might be a good idea to have other methods * rely on this one. */ Iterator insert_after(Iterator pos, const T& value) { } /** * Insert a new element after the index pos. * Should work with an empty list.
- 2. * * Should return an iterator pointing to the newly created node * * To reduce repeated code, you may want to simply find * an iterator to the node at the pos index, then * send it to the other overload of this method. */ Iterator insert_after(size_t pos, const T &value) { Iterator it = begin(); for (size_t i = 0; i < pos && it != end(); i++) { ++it; } return insert_after(it, value); } /** * Erase the node pointed to by the Iterators cursor. * * If the 'pos' iterator does not point to a valid node, * throw an std::range_error * * Return an iterator to the node AFTER the one we erased, * or this->end() if we just erased the tail */ Iterator erase(Iterator pos) { Node<T> *node = pos.node_; if (node == nullptr || node == head_ || node == tail_) { throw std::range_error("Invalid iterator"); } Node<T> *prevNode = node->prev_; Node<T> *nextNode = node->next_; // Updates the next_ pointer of the previous node to point to the next node or updates the head_ pointer if (prevNode != nullptr) { prevNode->next_ = nextNode; } else {
- 3. head_ = nextNode; } if (nextNode != nullptr) { nextNode->prev_ = prevNode; } else { tail_ = prevNode; } Iterator nextIt(nextNode, head_, tail_); delete node; return nextIt; } /** * Add an element just after the one pointed to by the 'pos' iterator * * Should return an iterator pointing to the newly created node */ Iterator push_after(Iterator pos, const T &value) { Node<T> *node = pos.node_; if (node == nullptr) { throw std::range_error("Invalid iterator"); } Node<T> *nextNode = node->next_; Node<T> *newNode = new Node(value, node, nextNode); node->next_ = newNode; if (nextNode != nullptr) { nextNode->prev_ = newNode; } else { tail_ = newNode; } return Iterator(newNode, head_, tail_); } /** * Add a new element to the front of our list. */
- 4. void push_front(const T &value) { Node<T> *new_node = new Node<T>(value, nullptr, head_); if (head_ == nullptr) { tail_ = new_node; } else { head_->setPrevious(new_node); } head_ = new_node; ++size_; } /** * Add an element to the end of this list. * * Should return an iterator pointing to the newly created node. */ Iterator push_back(const T &value) { Node<T> *new_node = new Node<T>(value, nullptr, tail_); if (tail_ == nullptr) { head_ = new_node; } else { tail_ = new_node; } tail_ = new_node; ++size_; return Iterator(new_node, head_, tail_); }