Search  

---

C:/temp/src/j2k/DataType/Huffman/HuffBin.hpp

Go to the documentation of this file.

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

#include <j2k/Fred/Basic.hpp>

// Set this for BST tests
// typedef int Belem;

// Set to this for Huffman tree tests

#include <j2k/DataType/LettFreq.hpp>

typedef LettFreq* Belem;

#include <j2k/DataType/BinTree.hpp>
#include <j2k/DataType/HuffTree.hpp>

// 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;
}

---