⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 list.cpp

📁 C++大学简明教程,解压就行没有密码。希望对大家有用
💻 CPP
字号:
// Tutorial 16: List.cpp
// Class List member-function definitions.
#include <iostream> // required to perform C++-style stream I/O

using namespace std; // for accessing C++ Standard Library members

#include "List.h"  // List class definition

// List constructor
List::List()
{
   // initialize firstItem as a pointer to nothing
   setFirstItem( 0 );
 
} // end constructor

// set the pointer for the first item in the list
void List::setFirstItem( ShoppingItem *newFirstItem )
{
   firstItem = newFirstItem;
} // end function setFirstItem

// return a pointer to the first item in the list
ShoppingItem *List::getFirstItem()
{
   return firstItem;
} // end function getFirstItem

// add an item to the front of the list
void List::addItem( string itemName, int quantity )
{
   // create the new ShoppingItem
   ShoppingItem *newItem = new ShoppingItem( itemName, quantity, 0 );

   // update pointer to next item
   newItem->setNextItem( getFirstItem() ); 
   setFirstItem( newItem ); // add new item to the front of the list

} // end function addItem

// display each item in the list
void List::displayList()
{
   // get a pointer to the head of the list
   ShoppingItem *currentItem = getFirstItem();

   // display a header
   cout << "\nShopping List" << endl;
   cout << "-------------" << endl;

   // display information for each item
   while ( currentItem != 0 )
   {
      currentItem->display(); // display name and quantity
      currentItem = currentItem->getNextItem(); // move to next item
   } // end while

} // end function displayList

// delete each item in the list
void List::deleteList()
{
   // get a pointer to the head of the list
   ShoppingItem *currentItem = getFirstItem();
   
   // delete each item
   while ( currentItem != 0 )
   {
      // store a pointer to the next item
      ShoppingItem *nextItem = currentItem->getNextItem();
      cout << "\nMemory being released for: "
           << currentItem->getName() << endl;

      delete currentItem; // delete the current item

      // place a pointer to the next item in currentItem
      currentItem = nextItem;
   } // end while

} // end function deleteList


/**************************************************************************
 * (C) Copyright 1992-2005 by Deitel & Associates, Inc. and               *
 * Pearson Education, Inc. All Rights Reserved.                           *
 * DISCLAIMER: The authors and publisher of this book have used their     *
 * best efforts in preparing the book. These efforts include the          *
 * development, research, and testing of the theories and programs        *
 * to determine their effectiveness. The authors and publisher make       *
 * no warranty of any kind, expressed or implied, with regard to these    *
 * programs or to the documentation contained in these books. The authors *
 * and publisher shall not be liable in any event for incidental or       *
 * consequential damages in connection with, or arising out of, the       *
 * furnishing, performance, or use of these programs.                     *
 **************************************************************************/

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -