|
Today was a better day, i made a lot of progress.
I worked until lunch with adding the functionality of the class.
During the day i realized that having a number sent in while adding numbers to the list was not a good solution for when i sent in single numbers later. Because if this is reworked the function to instead go through the exciting nodes in order to find the right place in the list. I found that drawing a diagram of the nodes really helped me visualize what i was doing.
During the day i added functionality for push_front, push_back, pop_front, pop_back, search, size and erase.
My favorite piece of code today is this from the push_back function, partially because i like the name loopnode and partially because i liked how it works.
node loopnode = *pn_first.next;
while (loopnode.next != nullptr)
{
loopnode = *loopnode.next;
}
loopnode.next = &newNode;
This piece of code creates a temporary node, then loops through the existing nodes until it finds the last one who’s pointer will be undeclared. It then sets the final nodes pointer to the new node.
The downside of today however is that i only managed to test the push_front function properly, but i should be able to have all of the code looked through tomorrow.
 
|