#ifndef LINKLIST_H
template class LinkedList
;
// External pointers to the list
node * myFirst;
node * myCurrent;
node * myPrevious;
// The number of nodes in the list
int mySize;
// Member functions
node * getNode(const E &item);
};
template
LinkedList::LinkedList()
: myFirst(0), myCurrent(0), myPrevious(0), mySize(0)
template
LinkedList::LinkedList(const LinkedList &list)
: myFirst(0), myCurrent(0), myPrevious(0), mySize(0)
}
template
LinkedList& LinkedList:
perator = (const LinkedList &rhs)
return *this;
}
template
LinkedList::~LinkedList()
template
void LinkedList::first()
}
template
void LinkedList::next()
template
E LinkedList::access()
template
void LinkedList::modify(const E &item)
template
bool LinkedList::atEnd() const
template
bool LinkedList::empty() const
template
int LinkedList::length() const
template
void LinkedList::insert(const E &item)
template
LinkedList::node * LinkedList::getNode
(const E &item)
template
E LinkedList::remove()
__________________