huffbin.cpp

来自「经典c++程序的实现」· C++ 代码 · 共 29 行

// A copy of bintree.c for huffman coding tests

#include <iostream.h>

#include "..\include\book.h"

//Set to this for bst tests
//typedef int BELEM;

//Set to this for Huffman tree tests
#include "..\include\lettfreq.h"
typedef LettFreq* BELEM;
#include "..\include\bintree.h"
#include "..\include\hufftree.h"

// This creates space for the freelist variable
BinNode* BinNode::freelist = NULL;

void* BinNode::operator new(size_t) {
  if(freelist == NULL) return(::new BinNode);
  BinNode* temp = freelist;  freelist = freelist->left;
  return temp;
}

void BinNode::operator delete(void* ptr) {
  ((BinNode*)ptr)->left = freelist;
  freelist = (BinNode*)ptr;
}