Huffman.h

#pragma once
//Haffman's algorithm

//ïîäêëþ÷àåì áèáëèîòåêè
#include <iostream>
#include <functional>
//î÷åðåäü ñ ïðèîðèòåòàìè
#include <queue>
//àññîöèàòèíûé ìàññèâ(êàðòà)
#include <map>
#include <algorithm>
#include <bitset>
#include "tree.h"


//ñòðóêòóðà äëÿ õðàíåíèÿ ñèìâîëà, ñ åãî ÷àñòîòîé â òåêñòå
struct Freq_Letter{
	//ñèìâîë
	char ch;
	//÷àñòîòà
	int frequency;
	//îïðåäåëèì êîíñòðóêòîð äëÿ ñòðóêòóðû
	Freq_Letter(char ch_ = 'a', int frequency_ = 0): ch(ch_), frequency(frequency_){};
};


bool greaterFreqLet(const Freq_Letter& l1, const Freq_Letter& l2);


//Ôóíêöèÿ âîçâðàùàåò àññîöèàòèâíûé ìàññèâ, â êîòîðîì ñîäåðæèòñÿ
//char - ñèìâîë, vector<bool> - åãî ïðåäñòàâëåíèå â âèäå áèòîâ
//ïðîãðàììà ïðîñòåéøàÿ, ïðèíèìàåò â êà÷åñòâå àðãóìåíòà string
void  Huffman_get_code(std::string in_file, std::string out_file);

//1 - óäà÷íîå êîäèðîâàíèå, 0 - ïðîâàë
bool writeHuffmancode(std::string file_in, std::string file_out, 
					  std::map<char, std::vector<bool>> code_map, long int count_sym);


//÷òåíèå è êîäèðîâêà â íîðìàëüíóþ ôîðìó
bool Huffman_decode(std::string in_file, std::string out_file);