/afs/in2p3.fr/throng/virgo/virgoDev/GWOLLUM/v1r3/src/Segments/Segments.h

Go to the documentation of this file.

//  Author : florent robinet (LAL - Orsay): robinet@lal.in2p3.fr
#ifndef __Segments__
#define __Segments__

#include "CUtils.h"
#include "ReadAscii.h"
#include "TFile.h"
#include "TTree.h"
#include "TH1.h"

using namespace std;

class Segments {
  
 public:
  
  Segments(void);
  
  Segments(const string segment_file, const int ncol=2, const int default_tag=-1);

  Segments(TTree *segment_tree);

  Segments(const vector<double> segment_starts, const vector<double> segment_ends);

  Segments(const double segment_start, const double segment_end, const int segment_tag=-1);

  virtual ~Segments(void);  
  inline bool GetStatus(void) const { return status; };

  inline int GetNsegments(void){ return (int)seg_start.size(); };

  int GetNSegmentsWithTag(const int tag);

  inline vector<double> GetStarts(void){ return seg_start; };

  inline vector<double> GetEnds(void){ return seg_end; };

  inline vector<int> GetTags(void){ return seg_tag; };

  double GetStart(const int s=0);

  double GetEnd(const int s=0);

  int GetTag(const int s);

  inline double GetLiveTime(void){ return livetime_tot; };

  double GetLiveTime(const double gps_start, const double gps_end);

  double GetLiveTime(const int s);

  TH1I* GetHisto(const double offset=0.0);

  TH1I* GetHisto(const double gps_start, const double gps_end, const double offset=0.0);

  TTree* GetTree(void);

  TTree* GetTree(const double gps_start, const double gps_end);

  int GetClosestSegment(const double gps, vector<double> &seg);

  bool IsInsideSegment(const double gps);

  bool IsInsideSegment(const double gps, int &seg_n);
      
  bool ApplyPadding(const double pad_low, const double pad_up);

  bool AddSegment(const double gps_start, const double gps_end, const int tag=-1);

  bool Append(Segments *Seg);

  bool Intersect(Segments *Seg);

  bool Intersect(const double gps_start, const double gps_end, const int tag=-1);

  bool Reverse(void);

  bool Reset(void);

  bool SetTag(const int s, const int tag);

  bool SetTags(const int tag);

  bool Dump(int ncol=2);

  bool Write(const string txtfilename, const int ncol=2);
  
  bool WriteROOT(const string rootfilename);
    
 protected:
  
  bool status;                
  vector<double> seg_start;   
  vector<double> seg_end;     
  vector<int> seg_tag;        
  double livetime_tot;        
 
 private:
  
  bool CheckConsistency(void);
  bool SetMarks(void);        
  bool ComputeLiveTime(void); 
  bool MergeOverlaps(void);   
 
  vector <int> time_mark;     
  vector <int> n_mark;        

  inline int  TagProduct(const int tag1, const int tag2){
    if(tag1<0) return -1;
    else if (tag2<0) return -1;
    else if (tag1==tag2) return tag1;
    else if (tag1>tag2) return tag1;
    else if (tag1<tag2) return tag2;
    else return -1; // should never happen
    return -1; // should never happen
  };                          


  ClassDef(Segments,0)
};

#endif

---