1
edit
Changes
m
; Constructor: Does not accept parameters. Initializes list to safe empty state.
; ListNode(const T& v = T(), ListNode<T>* n = NULL): Constructor. Note the default values. Initializes the internally held value These functions are similar to v and the next pointer to n.; ListNode(const ListNode<T>& src): Copy constructor. Should initialize the internally held value to src's internally held value. Should initialize '''next''' to '''NULL'''.; ListNode& operator=(const ListNode<T>& src): Assignment operator. Should set the internally held value to src's internally held value. Should set '''next''' to '''NULL'''. Should do '''NOTHING''' in the case of '''self-assignment''' (ie ListNode<T> x; x = x;). Returns a reference to the current object.; ~ListNode(): Destructor. As this node does not allocate any memory, this function can remain emptytheir IntListNode counterparts.
=== Class; next: List<T>, Files [listNext getter.h], Test: 1 ===A templated linked list classConst function. Similar to IntListDoes not accept parameters. Similarly to IntList, because it needs to be able Returns pointer to set the next pointer on ListNode<T> objects, this class '''may''' need to be a friend of the ListNode<T> class (this depends on how you implement these classes)node.
The exact specs follow=== Class:List<T>, Files [list.h], Test Number: 1 ===A templated linked list class. Similar to IntList. Uses ListNode<T> as a node class.
no edit summary
{{OOP344 Index Extended | 20141}}
= Introduction =
In this assignment, you will construct an integer linked list, adapt it into a templated linked list, then create a '''bonus''' object editor.
== Testing ==
Use the testing package linked [https://scs.senecac.on.ca/~hasan.kamal-al-deen/public_resources/oop344/a3test_mar262014a3test_apr032014.zip here(Updated March 26 April 3 2014)] to test your assignment. Please read the notes/comments in a3test.cpp.
== Expectations ==
Build the classes IntList and IntListNode. Place the headers in intlist.h and the implementation in intlist.cpp. These classes form an integer linked list.
=== Class: IntListNode, Files: [intlist.h, intlist.cpp], TestNumber: 0 ===
Integer linked list node. Node is considered last in the list if its next pointer is NULL. Note the public and protected sections below. You may need to make IntList a friend of this class.
:* Pointer to next node in list. Defaults to NULL.
; Copy Constructor: Initializes internal value as a copy of the source's internal value. Sets this object's next pointer to NULL.
; Standard Assignment Operator: Assigns source's internal value to the current object's internal value. Sets this object's next pointer to NULL. Does not alter the object in the case of self-assignment. Returns a reference to the current object.
; val: Val getter. Const function. Does not accept parameters. Returns internal value.
; next: Next getter. Const function. Does not accept parameters. Returns pointer to the next node.
=== Class: IntList, Files [intlist.h, intlist.cpp], TestNumber: 0 ===
Integer linked list. Uses IntListNode as a node class.
==== Recommended members Members ====
* Pointer to head node in list
* Current size (number of nodes) of list
==== Public Functions ====
; Constructor: Does not accept parameters. Initializes list to safe empty state.
; size: Size getter. Const function. Does not receive parameters. Should return number of nodes in list.
; head: Head getter. Const function. Returns pointer to head node in list.
; clear: Removes all nodes in the list. Has no effect if the list is empty. Does not accept parameters. Does not return anything.
; Destructor: Should ensure that all memory allocated by the list has been deallocated. You are encouraged to use the functions available to you.
; Standard Assignment Operator: Clears this list of all nodes. Then, refills list with the same number of nodes as in the source list. Value of each new node should equal the value of corresponding node in source list. Should not alter object in the case of self-assignment. Should return a reference to the current object.
; Copy Constructor: Initializes object to safe state then copies source list into current list. Similar to assignment operator.
These two classes are almost identical to IntListNode and IntList, except that they are templated.
In the specs below, note the sections that are marked '''<big><u><i>Important'''</i></u></big>. Those sections will have more than just a template parameter change from the int version of the list.
=== Class: ListNode<T>, Files: [list.h], TestNumber: 1 ===
Templated ListNode class. Similar to IntListNode but templated to hold any type.
==== Public Functions ====
; Constructor: Accepts two arguments.:* <big><u><i>Important</i></u></big> const T val() constreference to initialize node's value. Defaults to a default constructed T.: Val getter* Pointer to next node in the list. Returns Defaults to NULL.; Copy Constructor: Initializes internal value as a copy of the source's internal value internally held. Sets this object's next pointer to NULL.; void val(const T&)Standard Assignment Operator: Val setterAssigns source's internal value to the current object's internal value. Sets this object's next pointer to NULL. Does not alter the internally held value object in the case of self-assignment. Returns a reference to the incoming valuecurrent object.
; ListNodeval: Val getter. Const function. Does not accept parameters. Returns internal value.; val: Val setter. <big><Tu><i>Important</i></u></big>* next() receives a const: Next getterT reference. Sets internal value to received reference. Returns the internally held next pointerDoes not return anything.
==== Internal Variables Recommended Members ====; ListNode<T>* _head: The Pointer to head of the list. Should be NULL when the node in list is empty.; int _size: The * Current size (number of elements currently in the nodes) of list.
==== Public Functions ====
; List()Constructor: Default constructorDoes not accept parameters. Should set size to 0 and head to NULL.; List(const List<T>& src): Copy constructor. Should copy the Initializes list of nodes managed by '''src'''. This means that an entirely new list of nodes must be created, one node for each node managed by '''src''', and the value held by each of those nodes must '''equal''' the value held by the corresponding node managed by '''src'''. When this constructor is finished, the size of the current list should be the same as the size of src.<br/><br/>'''TIP:''' After initializing the current object to a '''safe and empty state''', don't forget that you may call '''any member function''' that the current list has!; List<T>& operator=(const List<T>& src): Assignment operator. Should behave similarly to the copy constructor. '''ADDITIONALLY:''' Should do '''NOTHING''' in the case of '''self-assignment''' (ie List<int> x; x = x;). If taking action, should clear the list of all nodes before creating new ones ('''make sure that you do NOT leak memory!'''). Should return a reference to the current object.
; int size() const: Size getter. Returns the current value Const function. Does not receive parameters. Should return number of the size membernodes in list.; ListNode<T>* head() const: Head getter. Const function. Returns the current value of the pointer to head pointernode in list. ; void push(const T& v): Adds a new node to the '''end of the list''' holding . I'll say that again, '''END OF THE LIST'''. <big><u><i>Important</i></u></big> receives a const T reference. The new node's value should be set to the value v. Should increment sizereceived reference.; void pop(): Destroys the '''last node in the list. Should do '''NOTHING''' if the list is currently empty. Should decrement size if a node was destroyed. I'''NOTE:''' If a node was destroyedll say that again, make sure that '''ANY POINTERS POINTING TO ITLAST NODE IN THE LIST''', that your code has access to, are set to NULL. Does not receive any arguments. Does not return anything.; void clear(): Destroys Removes all nodes in the list. Has no effect if the list is currently empty. When Does not accept parameters. Does not return anything. ; Destructor: Should ensure that all memory allocated by the list has been deallocated. You are encouraged to use the functions available to you. ; Standard Assignment Operator: Clears this function is finishedlist of all nodes. Then, head refills list with the same number of nodes as in the source list. Value of each new node should point equal the value of corresponding node in source list. Should not alter object in the case of self-assignment. Should return a reference to the current object.; Copy Constructor: Initializes object to NULL and size should be 0safe state then copies source list into current list. Similar to assignment operator.
== Submission ==
Please only submit '''ONCE YOUR CODE SUCCESSFULLY PASSES ALL TESTS!''' This includes the '''COMMON SENSE TEST''' which is the test that you perform '''yourself''' on your own code to ensure that it matches with what is required '''in the spec'''. ; Section A, C: Please submit via blackboard.; Section B: Please see your instructor's specific instructions on how to submit.
