booster.h

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

#ifndef Booster_
#define Booster_

template <class T> class BinaryTreeNode;

class Booster {
    friend void main(void);
    friend void PlaceBoosters(BinaryTreeNode<Booster> *);
   public:
      void Output(ostream& out) const
      {out << boost << ' ' << D << ' ' << d << ' ';}
//   private: g++ has a problem when main is a friend
      int D,       // degradation to leaf
          d;       // degradation from parent
      bool boost;  // true iff booster here
};

// overload <<
ostream& operator<<(ostream& out, Booster x)
   {x.Output(out); return out;}

#endif