polycor_old.hpp

/* polycor.hpp */
/* $Id$ */
#ifndef __polycor_old_hpp
#define __polycor_old_hpp

#include <map>
#include <utility>

#ifdef GE_BUILD
#include <trace.hpp>
#else
#include <s2proc/trace.hpp>
#endif

namespace polycor_old
{

namespace PSC
{

  enum SortType
    {
      CS=0,
      CR,
      CM,
      Offset
    };


  // fixed CCF1 row
  typedef std::map<int, std::pair<int, float> > CCF1_ROW;
  //   key: index of RP
  // value: first->index correcponded to CCF1 body in TrSet, second-> max value of CCF1
  
  // array of CCF1 rows in current stride
  typedef std::map<int, CCF1_ROW> ROW_AR;
  //   key: index of fixed CCF1 row
  // value: CCF1_ROW
  
  // array of all strides
  typedef std::map<int, ROW_AR> STRIDE_AR;
  //   key: stride num
  // value: array of CCF1 rows in current stride
  
  
  // container for formed sum row
  //  key: NRP id for CCF1 row (NSP id for CCF2 row)
  //value: body of CCF1 (CCF2 in case of CCF2 row)
  typedef std::map<int, Trace> ROW;

  
  // determines maximum of CCF1 in window limited by window [midle - max_shift, midle + max_shift] 
  bool get_max_in_win(float *samples, int samples_count, int max_shift, std::pair<int, float> &max_pair);

  bool get_intersection(const ROW &add_row, const ROW &sum_row, float &intersection);

  bool stack_rows(ROW &recv_row, ROW &add_row, float max_shift, std::map<int, int> &count_ar, Trace &ccf2, bool stack);
};

};

#endif /* polycor_old.hpp */