Private REPO
Create binary prefix string using HUffman algorithm reading a file. A demo at the end of the post
exec.cpp
DataSet.h
DataSet.cpp
HElement.h
HElement.cpp
DataCharString.h
DataCharString.cpp
Huffman.h
Huffman.cpp
Demo
Input
Output
PHP Code:
https://bitbucket.org/xgiovio/huffman
exec.cpp
PHP Code:
#include <vector>
#include <iostream>
#include <string>
#include <ctime>
#include <fstream>
#include <algorithm>
#include "DataSet.h"
#include "HElement.h"
#include "Huffman.h"
int main(int n_parameters, char** parameters) {
std::vector<DataCharString> table_code;
huffman_p (huffman_f ( read_data (*(parameters + 1) ) ), &table_code);
std::sort (table_code.begin(), table_code.end());
for (std::vector<DataCharString>::iterator i = table_code.begin() ; i!= table_code.end() ; ++i){
std::cout << "Char: " << (*i).getChar() << " - Code: " << (*i).getCode() << std::endl;
}
std::cin.get();
return 0;
}
PHP Code:
#pragma once
#include <cstdlib>
class HElement;
class DataSet
{
public:
DataSet(char in_character, float in_frequency, HElement * in_t_list = NULL);
virtual ~DataSet(void);
char getcharacter();
float getfrequency();
void increment_frequency();
HElement * gett_list();
void operator= (DataSet& in);
bool operator==(const char& in);
bool operator< (DataSet &in);
static bool order_dec (DataSet &a, DataSet &b);
private:
char character;
float frequency;
HElement * t_list;
};
PHP Code:
#include "DataSet.h"
#include <iostream>
DataSet::DataSet(char in_character, float in_frequency,HElement * in_t_list)
{
character = in_character;
frequency = in_frequency;
t_list = in_t_list;
}
DataSet::~DataSet(void)
{
// bisogna deallocare la roba in t_list
}
char DataSet::getcharacter(){
return character;
}
float DataSet::getfrequency(){
return frequency;
}
void DataSet::increment_frequency(){
++frequency;
}
HElement * DataSet::gett_list(){
return t_list;
}
void DataSet::operator= (DataSet& in){
character = in.getcharacter();
frequency = in.getfrequency();
t_list = in.gett_list();
}
bool DataSet::operator< (DataSet &in){
if ( this->frequency < in.getfrequency() ){
return true;
} else {
return false;
}
}
bool DataSet::order_dec (DataSet &a, DataSet &b){
return !(a < b );
}
bool DataSet::operator==(const char& in){
if (this->getcharacter() == in)
return true;
return false;
}
PHP Code:
#pragma once
#include "DataSet.h"
class HElement
{
public:
HElement(bool status, DataSet left , DataSet right );
HElement(bool status, DataSet in_core );
HElement(DataSet single);
virtual ~HElement(void);
bool isconcrete();
HElement * getleft_p ();
HElement * getright_p ();
DataSet getcore();
private:
bool concrete;
HElement * left_p;
HElement * right_p;
DataSet core;
};
PHP Code:
#include "HElement.h"
HElement::HElement(bool status, DataSet left , DataSet right)
:core(DataSet(0,0))
{
concrete = status;
if (left.gett_list() == NULL){
left_p = new HElement(true,left);
}else{
left_p = left.gett_list();
}
if (right.gett_list() == NULL){
right_p = new HElement(true,right);
}else{
right_p = right.gett_list();
}
}
HElement::HElement(bool status, DataSet in_core )
:core(in_core)
{
concrete = status;
left_p = right_p = NULL;
}
HElement::HElement(DataSet single)
:core(DataSet(0,0))
{
concrete = false;
left_p = new HElement(true,single);
right_p = NULL;
}
bool HElement::isconcrete(){
return concrete;
}
HElement * HElement::getleft_p (){
return left_p;
}
HElement * HElement::getright_p (){
return right_p;
}
DataSet HElement::getcore(){
return core;
}
HElement::~HElement(void)
{
}
PHP Code:
#pragma once
#include <string>
class DataCharString
{
public:
DataCharString(char a, std::string in_s);
virtual ~DataCharString(void);
std::string getCode ();
char getChar ();
bool operator< (DataCharString & in);
private:
char character;
std::string code;
};
PHP Code:
#include "DataCharString.h"
DataCharString::DataCharString(char a, std::string in_s)
{
character = a;
code = in_s;
}
std::string DataCharString::getCode (){
return code;
}
char DataCharString::getChar (){
return character;
}
bool DataCharString::operator< (DataCharString & in){
if (code.length() < in.getCode().length())
return true;
return false;
}
DataCharString::~DataCharString(void)
{
}
PHP Code:
#pragma once
#include "HElement.h"
#include <vector>
#include <cstdlib>
#include "DataCharString.h"
HElement * huffman_f(std::vector <DataSet> in);
void huffman_p (HElement * list, std::vector <DataCharString> * vect , std::string in_s = "");
std::vector<DataSet> & read_data (char* file);
PHP Code:
// Huffman.cpp : Defines the entry point for the console application.
//
#include <vector>
#include <iostream>
#include <iterator>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <fstream>
#include "DataSet.h"
#include "HElement.h"
#include "DataCharString.h"
HElement * huffman_f(std::vector <DataSet> in){
std::vector<DataSet>::iterator it;
HElement* t;
DataSet * first;
DataSet * second ;
int i;
if (in.size() == 1)
return new HElement ((in[0]));
if (in.size() == 0)
return NULL;
for ( i = in.size() - 1 ; i>0 ; --i){
std::sort(in.begin(), in.begin() + i + 1 ,DataSet::order_dec);
second = &(in[i]);
first = &(in[i - 1]);
t = new HElement (false, * first, * second );
in.erase(in.begin() + i - 1);
in.insert(in.begin() + i - 1 ,DataSet (0,t->getleft_p()->getcore().getfrequency() + t->getright_p()->getcore().getfrequency(),t));
}
return (*(in.begin())).gett_list();
}
void huffman_p (HElement * list, std::vector <DataCharString> * vect , std::string in_s){
if (list != NULL){
if (list->isconcrete()){
DataCharString * t;
t = new DataCharString (list->getcore().getcharacter(),in_s );
(*vect).push_back(*t);
free(t);
}else{
huffman_p (list->getleft_p(),vect, in_s + "0");
huffman_p (list->getright_p(),vect,in_s + "1");
}
}
}
std::vector<DataSet> & read_data (char* file){
try {
std::fstream f (file ,std::ios_base::in );
if (f.good()){
std::vector<DataSet> *ridden_data = new std::vector<DataSet> ();
DataSet * t;
std::vector<DataSet>::iterator it;
for (char input = f.get(); f.good() ; input = f.get() ){
it = std::find((*ridden_data).begin(),(*ridden_data).end(), input );
if ((*ridden_data).size() == 0 || it==(*ridden_data).end()){
t = new DataSet (input,1);
(*ridden_data).push_back (*t);
free(t);
}else{
(*it).increment_frequency();
}
}
return *ridden_data;
}else{
std::cout << "Error reading file" << std::endl;
exit(-1);
}
}
catch ( std::ios_base::failure & e){
std::cout << "Error reading file" << std::endl;
exit(-1);
}
}
Demo
Input
PHP Code:
Lorem ipsum dolor sit amet, consectetur adipiscing elit. In sodales, est ut suscipit molestie, dui magna auctor augue, eget mattis purus enim sagittis massa. Suspendisse sit amet arcu convallis, placerat neque condimentum, tincidunt lectus. Nunc non erat id nibh iaculis condimentum. Nam ac neque eget nisl euismod adipiscing commodo porttitor dolor. Sed convallis interdum nisi, mattis ultrices est blandit cursus. Aenean in lectus lacinia velit congue consectetur. Nunc convallis imperdiet feugiat. Nulla facilisi. Nunc eros erat, laoreet ut tortor nec, ultrices rhoncus nibh. Nulla at adipiscing velit, sit amet vehicula sapien.
Cum sociis natoque penatibus et magnis dis parturient montes, nascetur ridiculus mus. Nullam porttitor fringilla turpis, et tempor ipsum adipiscing tristique. Aliquam vel sem sollicitudin, adipiscing dui eu, placerat velit. Aliquam diam nisl, sollicitudin sed nulla sed, tempor tristique ante. Cras id pharetra dui, et commodo nisi. Curabitur in felis porttitor arcu posuere venenatis. Fusce diam enim, mollis sed rutrum eget, elementum id quam. Sed interdum ultricies lacus. Maecenas vehicula ornare viverra. Pellentesque orci libero, sodales sed pulvinar ac, semper et mauris. Curabitur tincidunt lacus non blandit bibendum. Integer varius a purus nec iaculis. Morbi sagittis tellus vel varius laoreet. Etiam lobortis consectetur nunc, vel pellentesque orci pellentesque nec. Curabitur tempor tincidunt elit.
Proin a turpis in felis rhoncus imperdiet a sit amet orci. Maecenas quis tortor ut enim cursus ultricies quis eu nulla. Morbi sed iaculis sem, eget hendrerit urna. Donec commodo orci sit amet porttitor lacinia. Nunc bibendum aliquam augue non hendrerit. Nulla facilisi. Morbi erat nibh, interdum non ante vitae, accumsan tempor lacus. Fusce facilisis nunc quis augue dapibus lacinia. Phasellus fringilla volutpat ullamcorper.
Maecenas consectetur in mi quis ullamcorper. In posuere tempor nibh, vitae faucibus est cursus sit amet. Mauris vehicula nisi suscipit dignissim auctor. Ut at urna turpis. Integer venenatis nec enim eget sodales. Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia Curae; Nam a tempor nulla. Sed ut diam sodales, fringilla massa ac, mattis dui. Nam tellus urna, tempor sit amet massa id, ornare gravida magna.
Pellentesque sodales ligula nibh, ac varius erat mattis varius. Duis nunc ante, volutpat ultrices scelerisque eu, blandit sit amet mi. Mauris placerat a libero eget sollicitudin. Nunc eleifend rhoncus tincidunt. Nam fringilla congue odio a pulvinar. Interdum et malesuada fames ac ante ipsum primis in faucibus. Aenean vulputate laoreet ipsum vitae vehicula. Duis quis sem ac metus congue dapibus sit amet eget metus. Suspendisse eu metus rhoncus, varius erat sit amet, posuere risus. Ut eleifend urna non nulla pulvinar, ac rutrum ligula luctus. Morbi cursus volutpat elit. Duis porta odio sed feugiat aliquam. In neque dui, laoreet a malesuada nec, blandit id metus. Phasellus bibendum nulla magna, vel ornare dui pellentesque ullamcorper.
The standard Lorem Ipsum passage, used since the 1500s
"Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum."
Section 1.10.32 of "de Finibus Bonorum et Malorum", written by Cicero in 45 BC
"Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque laudantium, totam rem aperiam, eaque ipsa quae ab illo inventore veritatis et quasi architecto beatae vitae dicta sunt explicabo. Nemo enim ipsam voluptatem quia voluptas sit aspernatur aut odit aut fugit, sed quia consequuntur magni dolores eos qui ratione voluptatem sequi nesciunt. Neque porro quisquam est, qui dolorem ipsum quia dolor sit amet, consectetur, adipisci velit, sed quia non numquam eius modi tempora incidunt ut labore et dolore magnam aliquam quaerat voluptatem. Ut enim ad minima veniam, quis nostrum exercitationem ullam corporis suscipit laboriosam, nisi ut aliquid ex ea commodi consequatur? Quis autem vel eum iure reprehenderit qui in ea voluptate velit esse quam nihil molestiae consequatur, vel illum qui dolorem eum fugiat quo voluptas nulla pariatur?"
1914 translation by H. Rackham
"But I must explain to you how all this mistaken idea of denouncing pleasure and praising pain was born and I will give you a complete account of the system, and expound the actual teachings of the great explorer of the truth, the master-builder of human happiness. No one rejects, dislikes, or avoids pleasure itself, because it is pleasure, but because those who do not know how to pursue pleasure rationally encounter consequences that are extremely painful. Nor again is there anyone who loves or pursues or desires to obtain pain of itself, because it is pain, but because occasionally circumstances occur in which toil and pain can procure him some great pleasure. To take a trivial example, which of us ever undertakes laborious physical exercise, except to obtain some advantage from it? But who has any right to find fault with a man who chooses to enjoy a pleasure that has no annoying consequences, or one who avoids a pain that produces no resultant pleasure?"
Section 1.10.33 of "de Finibus Bonorum et Malorum", written by Cicero in 45 BC
"At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Temporibus autem quibusdam et aut officiis debitis aut rerum necessitatibus saepe eveniet ut et voluptates repudiandae sint et molestiae non recusandae. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat."
1914 translation by H. Rackham
"On the other hand, we denounce with righteous indignation and dislike men who are so beguiled and demoralized by the charms of pleasure of the moment, so blinded by desire, that they cannot foresee the pain and trouble that are bound to ensue; and equal blame belongs to those who fail in their duty through weakness of will, which is the same as saying through shrinking from toil and pain. These cases are perfectly simple and easy to distinguish. In a free hour, when our power of choice is untrammelled and when nothing prevents our being able to do what we like best, every pleasure is to be welcomed and every pain avoided. But in certain circumstances and owing to the claims of duty or the obligations of business it will frequently occur that pleasures have to be repudiated and annoyances accepted. The wise man therefore always holds in these matters to this principle of selection: he rejects pleasures to secure other greater pleasures, or else he endures pains to avoid worse pains."
PHP Code:
Char: - Code: 0 // the space character
Char: e - Code: 10
Char: i - Code: 110
Char: a - Code: 1110
Char: t - Code: 11110
Char: u - Code: 111110
Char: s - Code: 1111110
Char: n - Code: 11111110
Char: o - Code: 111111110
Char: r - Code: 1111111110
Char: l - Code: 11111111110
Char: c - Code: 111111111110
Char: m - Code: 1111111111110
Char: d - Code: 11111111111110
Char: p - Code: 111111111111110
Char: h - Code: 1111111111111110
Char: . - Code: 11111111111111111
Char: b - Code: 111111111111111100
Char: , - Code: 1111111111111111010
Char: v - Code: 11111111111111110110
Char: g - Code: 111111111111111101110
Char: q - Code: 1111111111111111011110
Char: f - Code: 11111111111111110111110
Char: w - Code: 111111111111111101111110
Char: y - Code: 1111111111111111011111110
Char:
- Code: 11111111111111110111111110 /// this is /n character
Char: M - Code: 1111111111111111011111111100
Char: k - Code: 1111111111111111011111111101
Char: N - Code: 1111111111111111011111111110
Char: x - Code: 11111111111111110111111111110
Char: " - Code: 111111111111111101111111111110
Char: I - Code: 1111111111111111011111111111110
Char: C - Code: 11111111111111110111111111111110
Char: T - Code: 1111111111111111011111111111111100
Char: P - Code: 1111111111111111011111111111111101
Char: 1 - Code: 1111111111111111011111111111111110
Char: S - Code: 11111111111111110111111111111111110
Char: B - Code: 111111111111111101111111111111111110
Char: E - Code: 11111111111111110111111111111111111100
Char: 3 - Code: 11111111111111110111111111111111111101
Char: A - Code: 11111111111111110111111111111111111110
Char: D - Code: 111111111111111101111111111111111111110
Char: ? - Code: 11111111111111110111111111111111111111100
Char: U - Code: 11111111111111110111111111111111111111110
Char: F - Code: 111111111111111101111111111111111111111010
Char: 0 - Code: 111111111111111101111111111111111111111110
Char: H - Code: 1111111111111111011111111111111111111110110
Char: R - Code: 1111111111111111011111111111111111111110111
Char: 4 - Code: 1111111111111111011111111111111111111111110
Char: L - Code: 11111111111111110111111111111111111111111111
Char: j - Code: 111111111111111101111111111111111111111111100
Char: 5 - Code: 1111111111111111011111111111111111111111111010
Char: 9 - Code: 111111111111111101111111111111111111111111101100
Char: ; - Code: 1111111111111111011111111111111111111111111011010
Char: z - Code: 1111111111111111011111111111111111111111111011100
Char: : - Code: 1111111111111111011111111111111111111111111011101
Char: 2 - Code: 1111111111111111011111111111111111111111111011110
Char: V - Code: 1111111111111111011111111111111111111111111011111
Char: O - Code: 11111111111111110111111111111111111111111110110111
Char: - - Code: 111111111111111101111111111111111111111111101101100
Char: Q - Code: 111111111111111101111111111111111111111111101101101