Singly Linked List

copy over all the files provided for you 
the files are in the usual place

copy over you SLinkedList.h and main from the previous lab

For this assignment you will add more functionality to your Singly Linked List



Run the Example Program to see the Singly Linked List in action 

for tonight's lab you Will complete the public Destructor and InsertAfter  functions
as well as a private Search function

Search will return a pointer to a SListNode


make sure to use LogLow to log a messages EXACTLY  like the example.
you will not recieve credit if your log does not behave like the example


YOU WILL NOT RECIEVE HELP TRYING TO DEBUG YOUR FUNCTIONS..
focus on doing your functions one at a time and make the logging match the example 
if you do this you should be able to complete the lab with out help.
 


you will be able to see each node being deleted in the descructor by viewing the log

2019-11-04 23:02:36,320 INFO [default] Start SLinkedList::~SLinkedList() [with T = int]
2019-11-04 23:02:36,320 INFO [default] p1:0x5566f99a0590

2019-11-04 23:02:36,320 INFO [default] p2:0

2019-11-04 23:02:36,320 INFO [default] start of  loop
2019-11-04 23:02:36,320 INFO [default] p1:0x5566f99a0590
2019-11-04 23:02:36,320 INFO [default] p2:0
2019-11-04 23:02:36,320 INFO [default] incrementing both pointers
2019-11-04 23:02:36,320 INFO [default] p1:0x5566f99a0570
2019-11-04 23:02:36,320 INFO [default] p2:0x5566f99a0590
2019-11-04 23:02:36,320 INFO [default] Deleting node with address 0x5566f99a0590 and value 55

2019-11-04 23:02:36,320 INFO [default] start of  loop
2019-11-04 23:02:36,320 INFO [default] p1:0x5566f99a0570
2019-11-04 23:02:36,320 INFO [default] p2:0x5566f99a0590
2019-11-04 23:02:36,320 INFO [default] incrementing both pointers
2019-11-04 23:02:36,320 INFO [default] p1:0x5566f99a0550
2019-11-04 23:02:36,320 INFO [default] p2:0x5566f99a0570
2019-11-04 23:02:36,320 INFO [default] Deleting node with address 0x5566f99a0570 and value 44

2019-11-04 23:02:36,320 INFO [default] start of  loop
2019-11-04 23:02:36,320 INFO [default] p1:0x5566f99a0550
2019-11-04 23:02:36,320 INFO [default] p2:0x5566f99a0570
2019-11-04 23:02:36,320 INFO [default] incrementing both pointers
2019-11-04 23:02:36,320 INFO [default] p1:0x5566f999b200
2019-11-04 23:02:36,320 INFO [default] p2:0x5566f99a0550
2019-11-04 23:02:36,320 INFO [default] Deleting node with address 0x5566f99a0550 and value 33

2019-11-04 23:02:36,320 INFO [default] start of  loop
2019-11-04 23:02:36,320 INFO [default] p1:0x5566f999b200
2019-11-04 23:02:36,320 INFO [default] p2:0x5566f99a0550
2019-11-04 23:02:36,320 INFO [default] incrementing both pointers
2019-11-04 23:02:36,320 INFO [default] p1:0
2019-11-04 23:02:36,320 INFO [default] p2:0x5566f999b200
2019-11-04 23:02:36,320 INFO [default] Deleting node with address 0x5566f999b200 and value 22

2019-11-04 23:02:36,320 INFO [default] End SLinkedList::~SLinkedList() [with T = int]


here is the output of the destructor when the values 22,33,44,55 were added


YOUR ToString MUST WORK WITH THE WEBPAGE  
viewlist


test files have been provided for you make sure you program output matches the examples
when you redirect in ALL of your testfiles.... MAKE SURE you have one for each datatype


After you add your destructor to clean up the nodes you should not have a memory leak
you can see this when you run 
valgrind --leak-check=full ./runme_int  < YourIntTestfile 

==7604== LEAK SUMMARY:
==7604==    definitely lost: 0 bytes in 0 blocks
==7604==    indirectly lost: 0 bytes in 0 blocks
==7604==      possibly lost: 0 bytes in 0 blocks

BEFORE ASKING FOR GRADING

make sure your output matches that of the runable examples when redirecting in your testfiles
make sure you have testfiles for all the types
make sure that your program does not have a memory leak