memory works

Author: MatteolusBucket

Settings/config.cfg

@@ -192,6 +192,6 @@
                 MAXREP_MODALITY=type
 
                 MAXREP_NONMAXREP_COLOR=gray
-                MAXREP_MAXREP_COLOR=yellow
-                MAXREP_SUPERMAXIMAL_COLOR=yellow
-                MAXREP_NEARSUPERMAXIMAL_COLOR=yellow
+                MAXREP_MAXREP_COLOR=red
+                MAXREP_SUPERMAXIMAL_COLOR=green
+                MAXREP_NEARSUPERMAXIMAL_COLOR=blue

example/input_example.txt

@@ -1 +1 @@
-ACACACACACCCCAAACACA
+makqiefndaarksleagvdrladtvkvtlgprgrnvvldkkwgaptitndgvtiareveledpyenlgaqlvkevatktndvagdgtttatvlaqalvkeglrnvaagaapaalkrgievsvdavserllenarpvegrqvadvaaisaqsreigdllaeafekvgkdgvitieesssmqtelvitegmqfdkgylspyfvtdperqeavledplilinqgkissiqdflpllekvlkaskplfiiaedvdgealstlivnrlrgtlnvvavkapgfgdrrkamlqdiatltgaqvispevglsldqvdldalgtarrvtvtkdtttivdgagteqdvagrvaqiraeldrtdsdwdreklqerlaklsggigvikvgaatevelkekkhriedavsstraaleegivagggsalvqaakalddsaevsalagdaatavslvkravtqplrwiaenagydgyvvvnrvselpdgdgfnaatgeyenliaagvidpvkvtrsalqnaasiaalvlttealvvekpeedeadhqghnhzmakiiafdeearrglerglntladavkvtlgprgrnvvlekkwgaptitndgvsiakeieledayekigaelvkevakktdevagdgtttatvlaqalvreglrnvaagadplslkrgiekavtavteqlldsakeietkdqiaatasisaadtqigeliaealdkvgkegvitveesntfgleleltegmrfdkgyisqyfvtdperqeailedpyilivnskisnvkdmvgilekvmqsgkplliiaedveaealatlivnkirgtfksvavkapgfgdrrkamltdiailtggqviaeeiglklenadldmlgqarkvvvtkdettivegagdaeqiagrvaqiraeiensdsdydreklqerlaklaggvavikagaatevelkerkhriedavrnakaaveegivagggvaliqagekafenlslegdeatganivkvaidaplkqiafnagfepgvvvdkvrglpageglnaatgeyedllaagvndpvkvtrsalqnaasiaglfltteavvadkpekkaaaapgaddmggmggmggfzmakriiynenarralekgmdilcesvavtlgpkgrnvvlekkfgapqivndgvtiakeielednientgvalirqaasktndaagdgtttatvlahamvkegmrnvvaganaislkrgiekaagflvekiaenarsvedstaiaqvgtisagnddevgqmianamdkvgkegvisleegksmttelevtegmrfekgyispyfatdtermeavldepyilltdkkitlvqdlvpvleqaaragkpllviaediekealatlvvnrlrgvlnvaavkapgfgdrrkamlediavltggqvitedaglkletaklemmgqarrititkdtttlvaegneadvqarceqirrqmdetessydkeklqerlaklaggvavikvgaatetemkdrklrledainstkaaveegivpgggttlahlgpqlaswaadnltgeeligativeraltaplkriaenagqngaviaervrekefnvgfdasvneftdmfaagivdpakvtrsalqnaasiagmvltteciisdkpepkenaptgagmggdfdyzmakriiynenarralekgmdilcesvavtlgpkgrnvvlekkfgapqivndgvtiakeielednientgvalirqaasktndaagdgtttatvlahamvkegmrnvvaganaislkrgiekaagflvekiaenarsvedstaiaqvgtisagnddevgqmianamdkvgkegvisleegksmttelevtegmrfekgyispyfatdtermeavldepyilltdkkitlvqdlvpvleqaaragkpllviaediekealatlvvnrlrgvlnvaavkapgfgdrrkamlediavltggqvitedaglkletaklemmgqarrititkdtttlvaegneadvqarceqirrqmdetessydkeklqerlaklaggvavikvgaatetemkdrklrledainstkaaveegivpgggttlahlgpqlaswaadnltgeeligativeraltaplkriaenagqngaviaervrekefnvgfdasvneftdmfaagivdpakvtrsalqnaasiagmvltteciisdkpepkenapagagmggdfdyzmaksiqydtaarhaleqgidllteavavtlgprgrnvvleqkfgppqivndgitiakeieldnplantgvallrqvaaktndaagdgtttavvlshamvkeglrniaaganpmairrgidqatqflldqiaehalpvkdsnaisqvgtiaagndetvgqmiaaamakvgqqgvisleegqsmqtevevtegmrfdkgyispyfvtdaermvttlddayllltdkkitlvnallpilenvtqtgkplviiaediekealatlvlnqlrgtvrvagvkapgfgdrrkdlladiavltggqvisedtgltlendtlemmgrarqvvitkdhttlisesneaavkarceqihrlidetdssfekeklherlaqlsggvavikvgaatetemkdrklkledainatqaaveegivpgggttlvhlapqledwsaehlvgdeligamilvrslsaplrqivenaglnggvvveqvktlpfntgydalnnqyvdmftagivdpakvtsaglrnaasiagmvltteciiaeqsqattkdlanagzmakeikfgeearkalesgvnkladtvkvtlgpkgrnvvldkkfgapmitndgvtiakeieledafenmgaqlvkevatktndvagdgtttatllaqamvreglknvaaganpmiirkgiskavdsavegikevsqkikgkediarvasisandevignliadamekvtndgvitveesktmgtnlevvegmqfdrgyvsaymitdtekmeavlddpyilitdkkisniqeilpileqivqqgkklviiaedvegealgtlvvnklrgtftcvavkapgfgdrrkamlqdiailtggeviteevglelkettleqlgrarqikvqkentiivdgagsqdelkkriasikaqieettsdfdreklqerlaklsggvaviqvgaatetemkekklriedalaatkaaveegivagggtalinaipkvaklldtvtgdektgvqiilraleepvrqiaanaglegsviveklknspvgtgfdalnekyvnmletgivdpakvtrsalqnaasvasmvlttesvvadkpekeapmpagmpggmggmggmyzmakeirfseearkaleigvnkladtvkvtigpkgrnvildkkfgsplitndgvtiakeieledpyenmgaqlvkevatktndvagdgtttatllaqaiireglknvaagsnpillrkgiqkavdtavatlkansrtienkesiaqvaaisagddeigkliaeamekvgndgvitveesksmgttlevvegmqfdrgyvsaymvtdvekmeatlsepyilitdkkisniqeilpileqivqqgrrlliiaedvegealstlvvnklrgtfevvavkapgfgdrrkamlediailtggrviseeigldlkeatldmlgkattvkiskenttivngageekaikdriaqikrqieettsefdkeklqerlaklsggvavievgaatetelkerklrmedalnatraaveegivpgggtalvavmdevealikdeqtaetktgiqivlkalqeplkqiainaglegavivenvrksdkdhgfdalneqyvnmidagiidptkvtrsalqnaasvaatlltteaavveiksdepampmgggmpgmmzmaakdvkfgadarqrmlrgvdiladavkvtlgpkgrnvvldksfgapritkdgvsvakeieladkfenmgaqmlrevasktndiagdgtttatvlaqaivreghkavaagmnpmdlkrgidkavavvieelkknakkvttpaetaqvgtisangeseigqmiseamqkvgsegvitveeakhfqteldvvegmqfdrgyispyfvtnpekmtadlenpyilihekklsslqpmlpllesvvqsgrplliiaedvdgealatlvvnklrgglkiaavkapgfgdrrkamlediailtggqvisedlgikletvtlnmlgtakkvhidkenttivdgagkaddikgrvkqiraqieetssdydreklqerlaklaggvavirvggstevevkerkdrvddalhatraaveegivpgggtalaratlkleglhyhnddqrvggdiirralqaplrqiahnagedgaviankvlenndynfgfdaqageyknlveagiidpakvvrtalqdaasvagllitteamvaerpekkaapaggpdmggmggmdfzmaakdvkfggdarqrmlrgvdiladavkvtlgpkgrnvvldksfgapritkdgvsvakeieladkfenmgaqmlrevasktndiagdgtttatvlaqaivreghkavaagmnpmdlkrgidkavaavveelkkntkkittpaetaqvgtisangeseigqmiseamqkvgsegvitveeakhfqteldvvegmqfdrgyispyfvtntekmtadlenpyilihekklsslqpmlplleavvqsgrplliiaedvdgealatlvvnklrgglkiaavkapgfgdrrkamlediailtggqvisedlgikletvtlpmlgtakkvridkenttivdgagksddikgrckqiraqieettsdydreklqerlaklaggvavirvggstevevkerkdrvddalhatraaveegivpgggtalarasanlshlhyhnddqrvggdiirkalqaplrqiahnagedgaviankvleskeyafgfdaqageyknlvdagiidptkvvrtalqdaasvagllitteamvaerpekkaapaggpdmggmggmdfzmaakdvkfggearqrmlrgvdiladavkvtlgpkgrnvvldksfgapritkdgvsvakeieladkfenmgaqmvrevasktndvagdgtttatvlaqaivreghkavaagmnpmdlkrgidkavaavveelkknakkvtspsetaqvgtisangekeigemislamqkvgsegvitveeakgiqteldvvegmqfdrgyispyfvtnaekmtadldnpyilihekklsslqpilpllesvvqsgrplviiaedvdgealatlvvnklrgglkiaavkapgfgdrrkamlediailtggqvisedlgiklesvtlpmlgtakkvhiskenttivegagnaddikgrcnqiraqveettsdydreklqerlaklaggvavirvggstevevkerkdrvddalhatraaveegivpgggtalarastalghlhyhnedqkvggeiirkalqaplrqiahnagedgaviagkvlenstytfgfdaqageykdlveagiidpmkvvrtalqdaasvagllitteamvaerpekkappmpggggmggmgdmdfzmaakdvkfgadarqrmlrgvdiladavkvtlgpkgrnvvldksfgapritkdgvsvakeieladkfenmgaqmlrevasktndiagdgtttatvlaqaivreghkavaagmnpmdlkrgidkavavvieelkknakkvttpaetaqvgtisangeseigqmiseamqkvgsegvitveeakhfqteldvvegmqfdrgyispyfvtnpekmtadlenpyilihekklsslqpmlpllesvvqsgrplliiaedvdgealatlvvnklrgglkiaavkapgfgdrrkamlediailtggqvisedlgikletvtlnmlgtakkvhidkenttivdgagkaddikgrvkqiraqieetssdydreklqerlaklaggvavirvggstevevkerkdrvddalhatraaveegivpgggtalaratlkleglhyhnddqrvggdiirralqaplrqiahnagedgaviankvlensdynfgfdaqageyknlveagiidpakvvrtalqdaasvagllitteamvaerpekkaapaggpdmggmggmdfzmaakdvkfgadarqrmlrgvdiladavkvtlgpkgrnvvldksfgapritkdgvsvakeieladkfenmgaqmlrevasktndiagdgtttatvlaqaivreghkavaagmnpmdlkrgidkavavvieelkknakkvttpaetaqvgtisangeseigqmiseamqkvgsegvitieeakhfqteldvvegmqfdrgyispyfvtnpekmtadlenpyilihekklsslqpmlpllesvvqsgrplliiaedvdgealatlvvnklrgglkiaavkapgfgdrrkamlediailtggqvisedlgikletvtlnmlgtakkvhidkenttivdgagkaddikgrvkqiraqieetssdydreklqerlaklaggvavirvggstevevkerkdrvddalhatraaveegivpgggtalaratlkldglhyhnddqrvggdiirralqaplrqiahnagedgaviankvlenndynfgfdaqageyknlveagiidpakvvrtalqdaasvagllitteamvaerpekkaapaggpdmggmggmdfzmaakdvkfggearqrmlrgvdiladavkvtlgpkgrnvvldksfgapritkdgvsvakeieladkfenmgaqmvrevasktndiagdgtttatvlaqaivregakavaagmnpmdlkrgidkavgvvveelkknakkittpaetaqvgtisangeaeigemiskamqkvgsegvitveeakglhteldvvegmqfdrgyispyfvtnaekmtvdldspyilihekklsslqpilplleavvqsgrplliiaedvdgealatlvvnklrgglkiaavkapgfgdrrkamlediailtggqvisedlgiklesvtldmlgtakkvhidkenttivegagnsegikgrcsqiraqieettsdydreklqerlaklaggvavirvggsteievkerkdrvddalhatraaveegivpgggtalarastklgglhfhnddqrvgadiirkalqaplrqiahnagedgaviagkvlendtytfgfdaqmgdykdlvaagiidpmkvvrtalqdaasvagllitteamvaerpekkapampeggmggmggmggmdfzmaakdvkfgagardkllrgvdiladavkvtlgpkgrnvvidksfgapritkdgvtvakeieladkfenlgaqlvrevaskqndlagdgtttatvlaqaiiregaksvaaglnpmdlkrgvdkavalvveelsaqtrkittsaevaqvgtlsangeaeigqmiaeamekvgnegvitveeakgiqteldvvegmqfdrgyvspyfitnaekmiaelenpyilinekklstlqpllpllesvvqsgrplvivaedvegealatlvvnklrgglkiaavkapgfgdrrkamlediailtggqvisedlgikletvtldmlgqaktiriekenttivdgagekadiqgrveqikaqieettsdydreklqerlaklaggvavirvggstevevkerkdrvddalhatraaveegivpgggvallrasqklvgvkadnndqqvgieivrraiqvplkqiaenagvdgavvagdvlrndtytfgydaqsgefkdlvaagiidptkvvrtalqdaasvasllittealiverpekkaapaggpgmgdmdfzmvkelefgeegrrvleegvnklaeavkvtlgpkgrnvileegfgaptitndgvtiakeidvknpfedlgaqtvkevatktndvagdgtttatvlaqaiiqegmknvaaganpmvlkkgiekaveqgvkeirnlstaiedkesiaqvasisaadeeignliadamekvgkdgvisveegrtmgtsletvegmqfdrgylspymatdqeemkanledpyilltdqkissvqdilpllekvaqegkqliivaedvegealatlvvnkirgtfdcvavkapgfgdrrkamlediavltggqvitedkglqlenatksmlgqarsitvtkddttivdgagadndiqqrveqlrrqientssdfdrekleerlaklaggvavvrvgaateteleekkhriedalsatraaveegivpgggtilidvlqglddlelegdeatgadivrraleaplrliadnaghegsviaervknkdkgigfdayngefvdmiesgivdpakvtrsalqnaasaaamllttetlivedededndggggapagaagggmpggmggmpgmmzmpkvlkfdeearralerginkvadtvgitlgpkgrnvvlekkfgsptitndgvtiakeieleepfenmgaqllkevasktndvagdgtttatvlartmirngmknvaagsngmlmrrgiekavdvivdelkkmsipvkdrakiaqvasisandrgigeliaeamskvgedgvitvedsqsvgttlemveglqfdkgyispymitdpermeatledayilindgkisnvkdllpvlekvvqtgkplliisedvegealatlvvnklrgilqvcavkapgfgerrkamlqdiaivtggqviseelgiklenadlsmlgrakkvrvtkeettivegagdseairkraaqikaeleeatseydkeklqerlaklvggvaviqvgaateteqkelkhriedalsatraaveegivagggvalincipalesfienlegdekigaqvvlralseplhliaenagyqgdvivekvrslpkgqglnaatgeyvdmieegiidplkvtrsalqnagsiaamvlttevlvadkpekketpkmpdmpdydzmpkmlkfdeearralerginkvadtvgvtlgpkgrnvvlekkfgsptitndgvtiakeieleepfenmgaqllkevasktndvagdgtttatvlaramirhgmknvaagangmlmrrgiekavdvvvdelkkmaipvkdrakiaqvasisandrgigeliaeamskvgedgvitvedsqsvgttlemveglqfdkgyispymitdpermeatledayilindgkisnvkdllpilekvvqtgkplliiaedvegealatlvvnklrgilqvcavkapgfgdrrkamlqdiaivtggqvvseelgiklenvdlsmlgrakkvrvtkeettivegagdpeairkraaqikaeleeatseydkeklqerlaklvggvaviqvgaateteqkelkhriedalsatraaveegivagggvallncmpalesfintlegdekigaqvvlnalpepmhliaenagfqgdvviekvrnlpkghglnaatgdyvdmieegiidplkvtrsalqnagsiaamvlttealvadkpekkeapkmpempdydzmakqilfdeearralekgvnalantvkvtlgpkgrnvvldkkfgapaitndgvtiardidledpfenmgaqlvkevatktndvagdgtttatllaqaiiregmrnvaaganpmivkkgiekavvtlveeikknskkvetkeaiaqvasisagdaeigkliaeamekvgkdgvitveesktmgtdldvvegmqfdrgyispymitdsdkmeavlsdpyilitdrkigaiadllpvlekvvqqgkelliiaedvegealatlvvnklrgtfravavkapgfgdrrkamledisiitggkviteelgrkldsvtledlgrarqvrvskeettivdgagqadeikarvnqirsqieettsdfdkeklqerlaklaggvaviqvgaatevelkekklriedalnatraaveegivpgggttyldiqdaldklnetgevktgilivrraieepvrqiacnaglegsvvvegvkkagkgvgfnalteeyvdmikagivdpakvtrsalqnaasiaamvltteslvadkpekeaaapagmggmggmggmggmggmmzmaakqvlfgddarvrivrgvnvlanavkttlgpkgrnvvlersfgaptvtkdgvsvakeielkdkfenigaqlvkdvasktsdnagdgtttatvlaqaivmeglkyvaagfnpidlkrgidkavaaavaelkkqskpvttskeiaqvgsisansdssigqiiadamdkvgkegvitvedgksleneldvv

src/ConfigParser.h

@@ -1,14 +1,13 @@
 //
 // Created by root on 4/29/18.
 //
+#ifndef VISUALSUFFIXTREE_CONDIFPARSER_H
+#define VISUALSUFFIXTREE_CONDIFPARSER_H
+
 #include <string>
 #include "utils/Utils.hpp"
 #include <map>
 
-#ifndef VISUALSUFFIXTREE_CONDIFPARSER_H
-
-#define VISUALSUFFIXTREE_CONDIFPARSER_H
-
 class ConfigParser {
 public:
     ConfigParser(std::string configFileName, std::map<std::string, std::string> * configParameter);

src/ObjNode.h

@@ -1,11 +1,11 @@
 //
 // Created by alessia on 07/05/18.
 //
-#include <string>
-
 #ifndef VISUALSUFFIXTREE_OBJNODE_H
 #define VISUALSUFFIXTREE_OBJNODE_H
 
+#include <string>
+
 using namespace std;
 
 class ObjNode{

src/SvgCreator.cpp

@@ -23,6 +23,8 @@ SvgCreator::SvgCreator(char *inputFileName, char *outputFile, map<string, string
         std::cerr << "Error occurred in loading map" << std::endl;
         exit(-1);
     } //load all the node from the db into a local map
+    else
+        std::cout << "Load data complete. " << std::endl;
 
     this->configParameter = configParameter;
 
@@ -61,23 +63,17 @@ SvgCreator::SvgCreator(char *inputFileName, char *outputFile, map<string, string
         y0 = stoi(configParameter->at("WINDOW_HEIGHT")) - 100;
     }
 
-
     //for each element devo trasformarlo in tmp_basic_nodeinfo
     //todo future create an onject bigger than the normal node object to add more info
-    for(int i = 1; i <= my_map.getNumberOfElement(); i++)  //check theindex start and end ... problem with 0 element check the tree parser
+    for(int i = 1; i <= my_map.getNumberOfElement(); i++)
     {
-        //todo check for the double 1 presence
-        std::cout << my_map.getNode(i)->get_index() << std::endl;
         tmp_basic_nodeInfo tmpNode = createTmpNode(my_map.getNode(i));
-
         general_map.insert({my_map.getNode(i)->get_index(), tmpNode});
     }
 
-
     //set root
     setRootPosition(my_map.getNode(my_map.getNumberOfElement()));
     for(int i = 1; i <= my_map.getNumberOfElement(); i++){
-
         //if not already insert generate the position
         if (plot_map.count(my_map.getNode(i)->get_index()) == 0) {
             setNodePosition(my_map.getNode(i), &my_map);

src/TreeParser.cpp

@@ -42,12 +42,12 @@ TreeParser::TreeParser(char * inputFileName, char * outputFileName, map<string,
 
         //create the node in this way is memory expensive
         //maybe I could have one unique node, add the element and in each loop save just his
-        //serialization version.. todo think about
-        NodeNew *  nodeNew1 = new NodeNew(); //todo (optional) non creare inside , it depends
+
+        NodeNew *  nodeNew1 = new NodeNew();
 
         //Add element
         if(cst.id(*it) != 0){
-            std::cout << "set index: " << cst.id(*it) << std::endl;
+            //std::cout << "set index: " << cst.id(*it) << std::endl;
             nodeNew1->set_index((cst.id(*it)));
             nodeNew1->setDepth(cst.depth(*it));
             nodeNew1->setNodeDepth(cst.node_depth(*it));
@@ -68,14 +68,12 @@ TreeParser::TreeParser(char * inputFileName, char * outputFileName, map<string,
             for (int i = 0; i < new_alphabet->size(); i++) {
                 const cst_t::char_type c = new_alphabet->at(i);
                 nodeNew::index t = cst.id(cst.wl(*it, c));
-                !!!capire come mai non si salva la mappa di wl!!!
                 if (t != numberOfNode) { // == number of node when there isn't a valid wl
                     pair<int, unsigned long> pair = {i, t};
                     wl.insert(pair);
-                    std::cout << "add wl" << std::endl;
+                    //std::cout << "add wl" << std::endl;
                 }
             }
-
             nodeNew1->setWinerLink(&wl);
 
 
@@ -95,15 +93,10 @@ TreeParser::TreeParser(char * inputFileName, char * outputFileName, map<string,
                 }
             }
 
-
             my_map.addNode(nodeNew1);
         }
-
-
-
     }
 
-
     //my_map.showContent();
 
     std::cout << "Tree max depth: " << tree_max_depth << std::endl;

src/TreeParser.h

@@ -1,37 +1,27 @@
 //
 // Created by root on 4/29/18.
 //
-#include <string>
-#include <sdsl/suffix_trees.hpp>
-
 #ifndef VISUALSUFFIXTREE_TREEPARSER_H
 #define VISUALSUFFIXTREE_TREEPARSER_H
 
+#include <string>
+#include <sdsl/suffix_trees.hpp>
+
 using namespace std;
 using namespace sdsl;
 
 typedef cst_sct3<> cst_t;
-
 typedef cst_bfs_iterator<cst_t> iterator1;
 
-class node_type;
 
 class TreeParser {
 
 public:
 
     cst_t cst;                              //declare the suffix tree
 
-    bool VERBOSE;
-
     TreeParser(char *inputFileName, char *outputFileName, map<string, string> *configParameter);
 
-    void printBinFile(string &s, std::ofstream &bin_out);
-
-    //void printNode(NodeInfo *nodeInfo, std::ofstream *bin_out);
-
-    string getEdge(cst_t *cst, iterator1 *it);
-
     vector<cst_t::char_type> alphabet;
 
     double p_pnorm_parameter;
@@ -42,17 +32,6 @@ class TreeParser {
 
     int tree_max_depth = 0;
 
-    void setAlphabet(char *inputFileName, TreeParser *treeParser);
-
-    string print_node_info(cst_t *cst, iterator1 *it) {
-        string msg = "\n\n\nNodeDepth: " + to_string(cst->node_depth(**it)) + " Depth: " + to_string(cst->depth(**it)) +
-                     "-[" + to_string(cst->lb(**it)) +
-                     "-" + to_string(cst->rb(**it)) +
-                     "]";//<< "\nAll String length: " << allstring_length << " parent length: " << parent_strLength << "\nEdge: " << edgeIdx <<"\nEdge coded: " << e.edgeToString(&edgeIdx) << std::endl;
-
-        return msg;
-    }
-
 
     unsigned long nF( iterator1 *it){
 
@@ -170,13 +149,8 @@ class TreeParser {
 
             }
         }
-
         return a;
-
     }
-
-
-
 };
 
 #endif //VISUALSUFFIXTREE_TREEPARSER_H

src/node/Node_2.cpp

@@ -12,16 +12,19 @@
 
 
 NodeNew::NodeNew() {
-    std::cout << "Nodes creator called\n" << std::endl;
+    //std::cout << "Nodes creator called\n" << std::endl;
+
+    children = new std::vector<nodeNew::index>();
+    winerLink = new std::map<int, nodeNew::index >;
 }
 
 //Constructor from data
 NodeNew::NodeNew(std::string ss){
 
-    NodeNew::children = new std::vector<nodeNew::index>();
-    NodeNew::winerLink;
+    children = new std::vector<nodeNew::index>();
+    winerLink = new std::map<int, nodeNew::index >;
 
-    std::cout << "Value read: " << ss << std::endl;
+    //std::cout << "Value read: " << ss << std::endl;
 
     std::string s;
 
@@ -60,8 +63,8 @@ NodeNew::NodeNew(std::string ss){
             token = strtok(NULL, ":");  //check if correct todo
             value = strtok(NULL, ":");
             if(std::strcmp(token, "wlidx")== 0){
-                std::pair<int, unsigned long> pair = {i, strtoul (value, NULL, 0)};
-                NodeNew::winerLink->insert(pair);
+                //std::pair<int, nodeNew::index > pair = {i, strtoul(value, NULL, 0)};
+                NodeNew::winerLink->insert({i, strtoul(value, NULL, 0)});
             }else{
                 std::cout << "Error in parsing wlidx" << std::endl;
             }
@@ -132,11 +135,11 @@ int NodeNew::serialize(std::ostringstream  * valueStream) {
         }
     }
 
-    *valueStream << "klDivergence:" << numberOfChildren<< ":";
-    *valueStream << "pNorm:" << numberOfChildren<< ":";
-    *valueStream << "pNormNoParam:" << numberOfChildren<< ":";
-    *valueStream << "hEntropy:" << numberOfChildren<< ":";
-    *valueStream << "hEntropy2:" << numberOfChildren<< ":";
+    *valueStream << "klDivergence:" << klDivergence<< ":";
+    *valueStream << "pNorm:" << pNorm<< ":";
+    *valueStream << "pNormNoParam:" << pNormNoParam<< ":";
+    *valueStream << "hEntropy:" << hEntropy<< ":";
+    *valueStream << "hEntropy2:" << hEntropy2<< ":";
 
     return 0;
 }
@@ -241,9 +244,14 @@ std::map<int, unsigned long> * NodeNew::getWinerLink() const {
 }
 
 void NodeNew::setWinerLink(std::map<int, nodeNew::index > * wl) {
-    NodeNew::winerLink = new std::map<int, nodeNew::index >(); //support structure
-    for (std::map<int,unsigned long>::iterator it=wl->begin(); it!=wl->end(); ++it)
-        NodeNew::winerLink->insert({10,12});
+    int i = 0;
+    for (std::map<int, unsigned long>::iterator it = wl->begin(); it != wl->end(); ++it) {
+        std::pair<int, nodeNew::index> pippo = {it->first, it->second};
+        NodeNew::winerLink->insert(pippo);
+        i += 1;
+    }
+
+    setNumberOfWinerLink(i);
 }
 
 nodeNew::klDivergence NodeNew::getKlDivergence() const {
@@ -295,9 +303,7 @@ nodeNew::frequency NodeNew::getFrequency() const {
 std::string NodeNew::toString() {
 
     std::ostringstream oss;
-    oss << "Node info\nKey: " << NodeNew::index <<
-        "\nDepth: " << getDepth() ;
-
+    oss << "Node info\nKey: " << NodeNew::index <<  "\nDepth: " << getDepth() ;
 
 
     return oss.str();