linkstringset.h

C++&datastructure书籍源码,以前外教提供现在与大家共享

#ifndef _LINKSTRINGSET_H
#define _LINKSTRINGEST_H

#include <string>
using namespace std;

class LinkStringSet
{
  public:
    LinkStringSet();
    
    // methods for deep copy
    
    LinkStringSet(const LinkStringSet& set);
    const LinkStringSet& operator =(const LinkStringSet& set);
    ~LinkStringSet();
    
    // accessors
    
    bool contains(const string& s) const;  // true iff s in set
    int  size()                    const;  // # elements in set
    
    // mutators
    
    void insert(const string& s);  // add to set
    void erase(const string& s);   // remove from set
    void clear();                  // delete all elements
    
    friend class LinkStringSetIterator;
    
  private:
  
    struct Node
    {   string info;
        Node * next;
        Node(const string& s, Node * link)
          : info(s), next(link)
        { }
    };
    
    Node * findNode(const string& s) const;  // helper
    void   reclaimNodes(Node * ptr);         // delete/reclaim
    Node * clone() const;                    // copy list
    
    Node * myFirst;
    int    mySize;
};

class LinkStringSetIterator
{
  public:
    LinkStringSetIterator(const LinkStringSet& lset)
      : mySet(lset),
        myCurrent(0)
     { }
     
     void Init()
     {   myCurrent = mySet.myFirst->next;  // first node
     }
     bool HasMore() const
     {   return myCurrent != 0;
     }
     string& Current()
     {   return myCurrent->info;
     }
     string Current() const
     {   return myCurrent->info;
     }
     void Next()
     {   myCurrent = myCurrent->next;
     }
  private:
    typedef LinkStringSet::Node Node;
    const LinkStringSet& mySet;
    Node *         myCurrent;
};

#endif