如何用C 中的struct定義為類構造頭檔案

如果我有一個包含結構的類。如何在頭檔案中宣告該結構？

請參閱下面的示例。這是正確的語法嗎？

背景關系：我的教授有一個 IList.h 檔案，我們必須在 LinkedList 類中實作它。這就是為什么我的示例中有繼承語法的原因。

鏈表檔案

#include "LinkedList.h"


class LinkedList : public IList {

      struct Node
   {
      int data;
      struct Node *next;
   }


};

鏈表

#ifndef LINKED_LIST_
#define LINKED_LIST_

#include "IList.h"

class LinkedList: public IList
{
   protected:
      struct Node;


};

串列檔案

//  Modified from code created by Frank M. Carrano and Timothy M. Henry.
//  Copyright (c) 2017 Pearson Education, Hoboken, New Jersey.

#ifndef I_LIST_
#define I_LIST_

class IList
{
public:
   /** Constructor */
   IList () : traverseCount(0) { }
    
   /** Destroys object and frees memory allocated by object.
    (See C   Interlude 2) */
   virtual ~IList () { }

   /** Gets the current number of entries in this list.
    @return The integer number of entries currently in the list. */
   virtual int getCurrentSize() const = 0;
   
   /** Sees whether this list is empty.
    @return True if the list is empty, or false if not. */
   virtual bool isEmpty() const = 0;
   
   /** Adds a new entry to this list.
    @post  If successful, newEntry is stored in the list and
       the count of items in the list has increased by 1.
    @param newEntry  The object to be added as a new entry.
    @return  True if addition was successful, or false if not. */
   virtual bool add(int newEntry) = 0;
   
   /** Removes one occurrence of a given entry from this list,
       if possible.
    @post  If successful, anEntry has been removed from the list
       and the count of items in the list has decreased by 1.
    @param anEntry  The entry to be removed.
    @return  True if removal was successful, or false if not. */
   virtual bool remove(int anEntry) = 0;
   
   /** Removes all entries from this list.
    @post  List contains no items, and the count of items is 0. */
   virtual void clear() = 0;
   
   /** Tests whether this list contains a given entry.
    @param anEntry  The entry to locate.
    @return  True if list contains anEntry, or false otherwise. */
   virtual bool contains(int anEntry) = 0;
    
   /** Get the count of number of nodes traversed.
    @return  The integer number of nodes traversed since last time the count was reset. */
    virtual int getTraverseCount() const { return traverseCount; }
     
   /** Reset the count of nodes traversed to zero. */
    virtual void resetTraverseCount() { traverseCount = 0; }
    
protected:
    int traverseCount;
}; // end IList

#endif

uj5u.com熱心網友回復：

你需要重新宣告至少從純虛方法IList在你的LinkedList班，否則LinkedList將是一個抽象類，所以編譯器不會讓你實體化一個LinkedList物件：

// LinkedList.h
#ifndef LINKED_LIST_
#define LINKED_LIST_

#include "IList.h"

class LinkedList: public IList
{
public:
   LinkedList();

   virtual ~LinkedList();

   virtual int getCurrentSize() const;

   virtual bool isEmpty() const;

   virtual bool add(int newEntry);

   virtual bool remove(int anEntry);

   virtual void clear();

   virtual bool contains(int anEntry);

private:
   struct Node
   {
      int data;
      struct Node *next;
   };

   struct Node *first;
};

#endif

...然后您需要在 LinkedList.cpp 中為您的方法撰寫實際代碼：

// LinkedList.cpp
#include "LinkList.h"

LinkedList :: LinkedList()
{
    [... code goes here...]
}

LinkedList :: ~LinkedList()
{
    [... code goes here...]
}

int LinkedList :: getCurrentSize() const
{
    [... code goes here...]
}

bool LinkedList :: isEmpty() const
{
    [... code goes here...]
}

bool LinkedList :: add(int newEntry)
{
    [... code goes here...]
}

bool LinkedList :: remove(int anEntry)
{
    [... code goes here...]
}

void LinkedList :: clear()
{
    [... code goes here...]
}

bool LinkedList :: contains(int anEntry)
{
    [... code goes here...]
}

標籤：C 遗产 结构 头文件

上一篇：為什么這個元素的寬度不是0？

下一篇：運行我的程式時讀取訪問沖突