/********************************
 * HUFFMAN DECODER              *
 * Code Copyright 2000          *
 * Jonathan Sapan '03           *
 * (unless noted otherwise)     *
 ********************************/



#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <math.h>
#include "tree.h"


FILE *inputFile;
FILE *outputFile;

extern int bitBuffer[BIT_BUFF_SIZE];
extern unsigned char byteBuffer[BYTE_BUFF_SIZE];

extern int bit_num; 
extern int byte_num;


main(int argc, char *argv[])
{	
	int i;
	unsigned char a;
	unsigned int number;
	letter char_array[CHARS];
	
	inputFile  = fopen(argv[1], "rb");
	outputFile = fopen(argv[2], "wb");
	
/*--------------------------------------------------------------------*/	
	if ( argc != 3 ) /*Check to see if program was called properly*/
	{
		fprintf(stdout, "TOO FEW ARGUMENTS\n" );
		exit(EXIT_SUCCESS);
	}
/*--------------------------------------------------------------------*/


/*--------------------------------------------------------------------*/	
	if ( (inputFile == NULL) || (outputFile == NULL) )
	{
		fprintf(stdout, "INVALID FILE SPECIFIED\n");
		exit(EXIT_SUCCESS);
	}
/*--------------------------------------------------------------------*/

	for (i=0; i<CHARS; i++)
	{
		char_array[i].freq = 0;
		char_array[i].ascii = i;
	}
	
	while ( !feof(inputFile) )
	{
		fread(&a, 1, 1, inputFile);
		fread(&number, sizeof(unsigned int), 1, inputFile);
	
		if ( (a == 0) && (number == 0) )
			break;
		
		char_array[(int)a].freq = number;		
	}
	
	qsort( char_array, CHARS, sizeof(letter),  compare );
	

	
	for(i=0; char_array[i].freq == 0; i++)  
		;
		
		
	for(i = i; i < CHARS; i++)
		InsertNode( NewNode( char_array[i] ) );
		
			
/*	

	Call to Display() outputs frequency table	
*/	
	Display();
	
	merge();
	
	decode();
	
	return 0;
	
}