GNode.h

Go to the documentation of this file.

#include <iostream>
#include <iomanip>
#include <string>
#include <math.h>
#include <list>

using namespace std;
#ifndef GNODE_H
#define GNODE_H

struct Input
{
    string iname;
    int iid;
};

class GNode
{
    friend class Generator;

    friend ostream &operator<<( ostream & os, const GNode & n )
    {
        return os << n.name << " - " << n.id << " init: " << n.init << " table: " << n.COLS << " by " << n.ROWS << endl;
    }

    public:
    GNode( )
    {
        COLS = 0;
        ROWS = 0;
    }
    ~GNode( )
    {
        /*   for( int i = 0; i < ROWS; ++i)   //When uncommented gives the following error:
             free(table[i]);                // *** glibc detected *** double free or corruption (fasttop): 0x09b24c48 ***
        //   Aborted

        free(table);*/
    };
    int nrows( void )
    {  return ROWS; }
    int ncols( void )
    {  return COLS; }
    string get_name(void)
    {  return name; }
    void set( const string & n, const int & i, const int & _init )
    {
        name = n;
        id = i;
        init = _init;
    }
    bool table_init( const int & );
    void print_table( void );
    void new_input( const Input & n )
    {
        inputs.push_back(n);
    }
    void print_inputs( void );        
    int get_id( void )
    {   return id;  }
    int get_init( void )
    {   return init; }
    
    private:
    int COLS;
    int ROWS;
    int init;
    string name;
    int id;
    bool **table;
    list<Input> inputs;
};
#endif