PolicyChronologic.h

Go to the documentation of this file.

#ifndef VEC_CHRONOLOGIC_ORDER
#define VEC_CHRONOLOGIC_ORDER

#include <vector>
#include <algorithm>

typedef enum {CHRONO = true, NO_CHRONO = false} EPChrono;

// To make clear if public or protected/private function
// Maybe can be used directly, without redirection from ListDataStock

template <class T>
class VecChronologic {

protected:
  EPChrono bpolicy() const { return EPChrono::CHRONO; }
  std::string policy() const { return "\t policy VecChronologic"; }


  void order_impl( std::vector<T> & vec, EPChrono b_chronologic ) {
#ifdef DEBUG_CPP
    std::cout << "Policy <Chronologic> order b_chrono " <<  b_chronologic << std::endl;
#endif
    // entry is already chronologic nothing to do
    if ( b_chronologic == EPChrono::CHRONO ) 
      return;
    //else need to invert the data
#ifdef DEBUG_CPP
    std::cout << "Reverse " << std::endl;
#endif
    std::reverse( vec.begin(), vec.end() );
    return;
  }
  const T & chronologic_at_impl( const std::vector<T> & vec_ordered, unsigned int position ) const {
    //need to check ?? or error ??
    return vec_ordered [ position ];
  }
  const T & no_chronologic_at_impl( const std::vector<T> & vec_ordered, unsigned int position ) const {
      return vec_ordered [ vec_ordered.size() - position - 1 ];
  }
  // used by AddToList to replace the last element
  void Erase_LastChrono( std::vector<T> & vec_ordered ) { vec_ordered.erase( vec_ordered.end()-1 ) ;}

  void AddChronoToList( std::vector<T> & vec_ordered, const std::vector<T> & new_vec, const int first_to_skip ) {
#ifdef DEBUG_CPP
    std::cout << "AddChronoToList Chronologic " << std::endl;
#endif
    vec_ordered.insert ( vec_ordered.end(), new_vec.begin()+first_to_skip, new_vec.end() );
  }
  time_t FirstChronologic( const std::vector<T> & vec_ordered ) const { return vec_ordered[ 0 ].GetDate(); }
  time_t LastChronologic( const std::vector<T> & vec_ordered) const { return vec_ordered[ vec_ordered.size()-1 ].GetDate(); }
};

template <class T>
class VecNoChronologic {

protected:

  EPChrono bpolicy() const { return EPChrono::NO_CHRONO; }
  std::string policy() const { return "\t policy VecNoChronologic"; }

  void order_impl( std::vector<T> & vec, EPChrono b_chronologic ) {
#ifdef DEBUG_CPP
    std::cout << "Policy <NoChronologic> order_impl b_chrono " <<  b_chronologic << std::endl;
#endif
     // entry is already non-chronologic nothing to do
     if ( b_chronologic == EPChrono::NO_CHRONO )
       return;
     //else need to invert
#ifdef DEBUG_CPP
     std::cout << "Reverse " << std::endl;
#endif
     std::reverse( vec.begin(), vec.end() );
     return;
  }
  //need to check, maybe problem with boundary
  const T & chronologic_at_impl( const std::vector<T> & vec_no_ordered, unsigned int position ) const {
      return vec_no_ordered [ vec_no_ordered.size() - position - 1];
  }
  const T & no_chronologic_at_impl( const std::vector<T> & vec_no_ordered, unsigned int position ) const {
      return vec_no_ordered [ position ];
  }
  void Erase_LastChrono ( std::vector<T> & vec_no_ordered ) { vec_no_ordered.erase ( vec_no_ordered.begin() );}

  void AddChronoToList( std::vector<T> & vec_no_ordered, const std::vector<T> & new_vec, const int first_to_skip ) {
#ifdef DEBUG_CPP
          std::cout << "AddChronoToList NoChronologic " << std::endl;
#endif
          // insert a non-chrono list at the beginning of the vector
          vec_no_ordered.insert ( vec_no_ordered.begin(), new_vec.begin(), new_vec.end()-first_to_skip );
  }

  time_t FirstChronologic ( const std::vector<T> & vec_no_ordered ) const { return vec_no_ordered[ vec_no_ordered.size()-1 ].GetDate(); }
  time_t LastChronologic ( const std::vector<T> & vec_no_ordered ) const { return vec_no_ordered[ 0 ].GetDate(); }
};

#endif // VEC_CHRONOLOGIC_ORDER