#ifndef _ANALYZER_BYTES_H_#define _ANALYZER_BYTES_H_#include <fstream>#include <sstream>#include <iostream>#include <vector>#include "gzstream.h"#include "graph.h"#include "utility.h"#define TX_BYTE_UNICAST				0#define TX_MSG_UNICAST				1#define TX_BYTE_BROADCAST			2#define TX_MSG_BROADCAST			3#define RX_BYTE_UNICAST				4#define RX_MSG_UNICAST				5#define RX_BYTE_BROADCAST			6#define RX_MSG_BROADCAST			7#define TIME						8#define ENERGY						9#define MSG_PHYSIC					10#define BYTES_PHYSIC				11#define ROUNDS_RAJA					12#define CONNECTED_CH				13#define VIRTUAL_LEN_0				14#define VIRTUAL_LEN_1				15#define VIRTUAL_LEN_2				16#define TO_ERASE_VIRTUAL_LEN_0		17#define TO_ERASE_VIRTUAL_LEN_1		18#define TO_ERASE_VIRTUAL_LEN_2		19#define ERASED_VIRTUAL_LEN_0		20#define ERASED_VIRTUAL_LEN_1		21#define ERASED_VIRTUAL_LEN_2_2		22#define ERASED_VIRTUAL_LEN_2_1		23/*** Questo file analizza gli shortest path e crea i file a partire dalla * cartella di destinazione passata come parametro. * E'possibile analizzare gli shortest path dei vari livelli dello stack * di simulazione. Le cartelle vengono create in base alla stringa che * descrive lo stack. */using namespace std;extern bool use_zipped;typedef vector<double> Result;typedef pair<string, Result> ResultLayer;typedef map<int, ResultLayer> ResultLayers;void analyze_bytes(string resultFile, 				   ResultLayers & results, 				   map<int, int> & totalNodes, 				   map<int, int> & activeNodes, 				   map<int, int> & CH,				   int & topologies);#endif