binnode3.h

来自「一本全面剖析C++数据结构算法的书籍」· C头文件 代码 · 共 26 行

#ifndef Node_
#define Node_

template <class T> class Chain;

class Node {
   friend ostream& operator<<(ostream&, const Node &);
   friend void BinSort(Chain<Node>&, int);
   friend void main(void);
   public:
      int operator !=(Node x) const
      {return (score != x.score
               || name[0] != x.name[0]);}
      operator int() const {return score;}
   private:
      int score;
      char *name;
};

ostream& operator<<(ostream& out, const Node& x)
   {out << x.score << ' ' << x.name[0] << ' '; return out;}

#endif