rangespecifier.hpp

神经网络是序列预测,C++实现

#ifndef RANGESPECIFIER_HPP
#define RANGESPECIFIER_HPP

#include <iostream>
#include <algorithm>
using namespace std;

template<class T>
class RangeSpecifier {

 public:
  T* dates;             // intersection dates
  unsigned int* arg1;   // index of intersections of arg1
  unsigned int* arg2;   // index of intersections of arg2
  unsigned int size;    // also the length of all the internal vectors: dates, arg1, arg2

  ~RangeSpecifier() {
    delete []arg1;
    delete []arg2;
    delete []dates;
  }

  RangeSpecifier(const RangeSpecifier &r) {
    arg1 = new unsigned int[r.size];
    arg2 = new unsigned int[r.size];
    dates = new T[r.size];

    if(arg1==NULL || arg2==NULL || dates==NULL) {
      cerr << "ERROR: RangeSpecifier(const RangeSpecifier &r)"
	" out of memory" << endl;
      size = 0;
      delete []arg1;
      delete []arg2;
      delete []dates;
      arg1 = NULL;
      arg2 = NULL;
      dates = NULL;
    } else {
      size = r.size;
      memcpy(arg1,r.arg1,sizeof(unsigned int)*r.size);
      memcpy(arg2,r.arg2,sizeof(unsigned int)*r.size);
      memcpy(dates,r.dates,sizeof(T)*r.size);
    }
  }

  RangeSpecifier() {
    dates = NULL;
    arg1 = NULL;
    arg2 = NULL;
    size = 0;
  }

  RangeSpecifier(T *dates1, 
		 T *dates2, 
		 const unsigned int& length_arg1, 
		 const unsigned int& length_arg2) {

    // find size of smaller of the two arguments
    unsigned int bufferSize = length_arg1 < length_arg2 ? length_arg1 : length_arg2;

    // alloc new buffer for dates, size is smallest of the two arguments
    dates = new T[bufferSize];

    // if we can't get memory then print error and return NULL range specifier
    if(dates==NULL) {
      cerr << "ERROR: RangeSpecifier" << endl;
      cerr << "out of memory" << endl;
      size = 0;
      arg1 = NULL;
      arg2 = NULL;
      dates = NULL;
      return;
    }

    // find size of date intersection
    T *dates_end =  set_intersection(dates1, dates1+length_arg1, dates2, dates2+length_arg2, dates);
	
    size = distance(dates,dates_end);

    // if there is no intersection then specifier has no size, and elements should be set to null
    // must delete buffer of dates that we allocated
    if(size==0) {
      delete []dates;
      arg1 = NULL;
      arg2 = NULL;
      dates = NULL;
    }

    // since we have some dates in the intersection
    // we can alloc space for the intersection points
    arg1 = new unsigned int[size];
    arg2 = new unsigned int[size];
	
    // if we cannot get memory, then print error, release any memory that was allocated and return
    if(arg1==NULL || arg2==NULL) {
      cerr << "ERROR: RangeSpecifier::RangeSpecifier" << endl;
      cerr << "out of memory" << endl;
      delete []arg1;
      delete []arg2;
      delete []dates;
      arg1 = NULL;
      arg2 = NULL;
      dates = NULL;
      size = 0;
      return;
    }


    // placeholders to find intersecting dates
    unsigned int date1_index = 0;
    unsigned int date2_index = 0;
    unsigned int dates_index = 0;

    // go through all the dates in the intersection
    while(dates_index < size) {
		
      // catch up arg 1 to dates intersection
      while(dates[dates_index] != dates1[date1_index]) {
	date1_index++;
      }

      // catch up arg 2 to dates intersection
      while(dates[dates_index] != dates2[date2_index]) {
	date2_index++;
      }

      // when equal, record position of matching elements
      if(dates[dates_index] == dates1[date1_index] && dates[dates_index] == dates2[date2_index]) {
	arg1[dates_index] = date1_index;
	arg2[dates_index] = date2_index;
	dates_index++;
	date1_index++;
	date2_index++;
      }
    }
  }


};


#endif