DataSet.cpp

/*
 * Recursive Neural Networks: neural networks for data structures 
 *
 * Copyright (C) 2018 Alessandro Vullo 
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
*/

#include "require.h"
#include "General.h"
#include "InstanceParser.h"
#include "DataSet.h"
#include <iostream>
using namespace std;

DataSet::DataSet(const char* fname, bool own): _own(own), _nnodes(0) {
  ifstream is(fname);
  assure(is, fname);

  uint length;
  is >> length;
  require(length, "Dataset size == 0");
  
  InstanceParser parser;
  for(uint i=0; i<length; ++i) {
    Instance* instance = parser.read(is);
    require(instance, "Error reading instance");
    push_back(instance);
    _nnodes += instance->num_nodes();
  }
  is.close();
  
  if(!size()) {
    cerr << "Error! Reading " << fname << " results in an empty data set.";
    require(0, "Aborting...");
  }
  require(length == size(), "Error: mismatch in reading declared number of instances");
}

DataSet::~DataSet() {
  if(_own) {
    iterator it = begin();
    while(it != end()) {
      delete *it; *it = 0;
      ++it;
    }
  }
}

void DataSet::add(Instance* i) { push_back(i); }

// shuffle data set instances
void DataSet::shuffle() {
  for (uint k=0; k<size(); ++k) {
    int f1 = rand();
    int f2 = rand();
    int p1 = (int)((double)f1/(1.0+(double)(RAND_MAX))*size());
    int p2 = (int)((double)f2/(1.0+(double)(RAND_MAX))*size());
    
    Instance* tmp = this->operator[](p1);
    (*this)[p1] = (*this)[p2];
    (*this)[p2] = tmp;
  }
}