Search  

---

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

Go to the documentation of this file.

#ifndef __J2K__DataType__Huffman__BuildTree_HPP__
#define __J2K__DataType__Huffman__BuildTree_HPP__

// Build Huffman tree from list tmplist
HuffTree* build_tree( List& tmplist ) 
  {
  HuffTree* temp1;
  HuffTree* temp2;
  HuffTree* temp3;
  LettFreq* tempnode;

  for( tmplist.setPos(1); tmplist.isInList(); tmplist.setPos(1) ) 
  {
    // While at least two items left
    tmplist.setFirst();
    temp1     = tmplist.remove();
    temp2     = tmplist.remove();
    tempnode  = new LettFreq( temp1->weight() + temp2->weight() );
    temp3     = new HuffTree( tempnode, temp1, temp2 );

    // return to the list in sorted order
    for( tmplist.setFirst(); tmplist.isInList(); tmplist.next() )
    {
      if ( temp3->weight() <= tmplist.currValue()->weight() ) 
      {
        tmplist.insert( temp3 );        // Put in list
        break;
      }
    }

    if ( !tmplist.isInList() )          // Its the heaviest value
    {
      tmplist.append(temp3);
    }
  }

  tmplist.setFirst();      // Tree now only element on list
  return tmplist.remove(); // Return the tree
}

#endif

---