@@ -45,7 +45,7 @@ class LinkedList {
4545 Unlink and link the LinkedList correcly;
4646 Increment _size
4747 */
48- virtual bool add (int index, T);
48+ virtual bool add (size_t index, T);
4949 /*
5050 Adds a T object in the end of the LinkedList;
5151 Increment _size;
@@ -60,13 +60,13 @@ class LinkedList {
6060 Set the object at index, with T;
6161 Increment _size;
6262 */
63- virtual bool set (int index, T);
63+ virtual bool set (size_t index, T);
6464 /*
6565 Remove object at index;
6666 If index is not reachable, returns false;
6767 else, decrement _size
6868 */
69- virtual T remove (int index);
69+ virtual T remove (size_t index);
7070 virtual void remove (ListNode<T>* node);
7171 /*
7272 Remove last object;
@@ -81,14 +81,14 @@ class LinkedList {
8181 Return Element if accessible,
8282 else, return false;
8383 */
84- virtual T get (int index);
84+ virtual T get (size_t index);
8585
8686 /*
8787 Clear the entire array
8888 */
8989 virtual void clear ();
9090
91- ListNode<T>* getNode (int index);
91+ ListNode<T>* getNode (size_t index);
9292 virtual void spliceToFront (ListNode<T>* node);
9393 ListNode<T>* getHead () { return root; }
9494 T getLast () const { return last == NULL ? T () : last->data ; }
@@ -145,9 +145,9 @@ LinkedList<T>::~LinkedList()
145145*/
146146
147147template <typename T>
148- ListNode<T>* LinkedList<T>::getNode(int index){
148+ ListNode<T>* LinkedList<T>::getNode(size_t index){
149149
150- int _pos = 0 ;
150+ size_t _pos = 0 ;
151151 ListNode<T>* current = root;
152152
153153 while (_pos < index && current){
@@ -164,7 +164,7 @@ size_t LinkedList<T>::size() const{
164164}
165165
166166template <typename T>
167- bool LinkedList<T>::add(int index, T _t){
167+ bool LinkedList<T>::add(size_t index, T _t){
168168
169169 if (index >= _size)
170170 return add (_t);
@@ -226,7 +226,7 @@ bool LinkedList<T>::unshift(T _t){
226226}
227227
228228template <typename T>
229- bool LinkedList<T>::set(int index, T _t){
229+ bool LinkedList<T>::set(size_t index, T _t){
230230 // Check if index position is in bounds
231231 if (index < 0 || index >= _size)
232232 return false ;
@@ -299,7 +299,7 @@ void LinkedList<T>::remove(ListNode<T>* node){
299299}
300300
301301template <typename T>
302- T LinkedList<T>::remove(int index){
302+ T LinkedList<T>::remove(size_t index){
303303 if (index < 0 || index >= _size)
304304 {
305305 return T ();
@@ -325,7 +325,7 @@ T LinkedList<T>::remove(int index){
325325
326326
327327template <typename T>
328- T LinkedList<T>::get(int index){
328+ T LinkedList<T>::get(size_t index){
329329 ListNode<T> *tmp = getNode (index);
330330
331331 return (tmp ? tmp->data : T ());
0 commit comments