实验报告4：群体类和群体数据(3)

return size; }

template

int LinkedList::ListEmpty(void) const {

return size == 0; }

template

void LinkedList::Next(void) {

if (currPtr != NULL) {

prevPtr = currPtr;

currPtr = currPtr->NextNode(); position++; } }

template

int LinkedList::EndOfList(void) const {

return currPtr == NULL; }

template

int LinkedList::CurrentPosition(void) const {

return position; }

template

void LinkedList::Reset(int pos) {

int startPos;

if (front == NULL) return;

if (pos < 0 || pos > size-1) {

cerr << \ return; }

if(pos == 0) {

prevPtr = NULL; currPtr = front; position = 0; }

11

else {

currPtr = front->NextNode(); prevPtr = front; startPos = 1;

for(position=startPos; position != pos; position++) {

prevPtr = currPtr;

currPtr = currPtr->NextNode(); } } }

template

T& LinkedList::Data(void) {

if (size == 0 || currPtr == NULL) {

cerr << \ exit(1); }

return currPtr->data; }

template

void LinkedList::InsertFront(const T& item) {

if (front != NULL) Reset(); InsertAt(item); }

template

void LinkedList::InsertRear(const T& item) {

Node *newNode; prevPtr = rear;

newNode = GetNode(item); if (rear == NULL)

front = rear = newNode; else {

rear->InsertAfter(newNode); rear = newNode; }

currPtr = rear; position = size;

12

size++; }

template

void LinkedList::InsertAt(const T& item) {

Node *newNode; if (prevPtr == NULL) {

newNode = GetNode(item,front); front = newNode; } else {

newNode = GetNode(item);

prevPtr->InsertAfter(newNode); }

if (prevPtr == rear) {

rear = newNode; position = size; }

currPtr = newNode; size++; }

template

void LinkedList::InsertAfter(const T& item) {

Node *p;

p = GetNode(item); if (front == NULL) {

front = currPtr = rear = p; position = 0; } else {

if (currPtr == NULL) currPtr = prevPtr;

currPtr->InsertAfter(p); if (currPtr == rear) {

rear = p;

position = size; }

13

else

position++;

prevPtr = currPtr; currPtr = p; }

size++; }

template

T LinkedList::DeleteFront(void) {

T item; Reset();

if (front == NULL) {

cerr << \ exit(1); }

item = currPtr->data; DeleteAt(); return item; }

template

void LinkedList::DeleteAt(void) {

Node *p;

if (currPtr == NULL) {

cerr << \ exit(1); }

if (prevPtr == NULL) {

p = front;

front = front->NextNode(); } else

p = prevPtr->DeleteAfter(); if (p == rear) {

rear = prevPtr; position--; }

currPtr = p->NextNode(); FreeNode(p);

14

size--; }

#endif 3、

#ifndef QUEUE_CLASS #define QUEUE_CLASS #include #include using namespace std; #include \template class Queue {

private:

LinkedList queueList; public:

Queue(void);

void QInsert(const T& elt); T QDelete(void); T QFront(void);

int QLength(void) const; int QEmpty(void) const; void QClear(void); };

template Queue::Queue(void) {}

template

int Queue::QLength(void) const {

return queueList.ListSize(); }

template

int Queue::QEmpty(void) const {

return queueList.ListEmpty(); }

template

void Queue::QClear(void) {

queueList.ClearList(); }

template

void Queue::QInsert(const T& elt)

15

百度搜索“77cn”或“免费范文网”即可找到本站免费阅读全部范文。收藏本站方便下次阅读，免费范文网，提供经典小说综合文库实验报告4：群体类和群体数据(3)在线全文阅读。