/*SlowSort.h
 *Class designed to first time-order raw data, and then based on a given coincidence window
 *sort the raw data into coincidence structures. Utilizes dictionary elements DPPChannel and
 *CoincEvent. Based on work by S. Balak, K. Macon, and E. Good from LSU. 
 *
 *Gordon M. Oct. 2019
 *
 *Refurbished and updated Jan 2020 GWM
 */
#ifndef SLOW_SORT_H
#define SLOW_SORT_H

#include "CompassHit.h"
#include "DataStructs.h"
#include "ChannelMap.h"
#include <TH2.h>

using namespace std;

class SlowSort {

  public:
    SlowSort();
    SlowSort(double windowSize, const string& mapfile);
    ~SlowSort();
    inline void SetWindowSize(double window) { coincWindow = window; };
    inline bool SetMapFile(const std::string& mapfile) { return cmap.FillMap(mapfile); };
    bool AddHitToEvent(CompassHit& mhit);
    CoincEvent GetEvent();
    inline TH2F* GetEventStats() { return event_stats; };
    void FlushHitsToEvent(); //For use with *last* hit list
    inline bool IsEventReady() { return eventFlag; };

  private:
    void InitVariableMaps();
    void Reset();
    void StartEvent();
    void ProcessEvent();

    double coincWindow;
    vector<DPPChannel> hitList;
    bool eventFlag;
    DPPChannel hit;
    CoincEvent event;
    CoincEvent blank;
  
    double startTime, previousHitTime;    
    unordered_map<int, vector<DetectorHit>*> fpVMap;
    unordered_map<int, vector<DetectorHit>*> sabreVMap;

    TH2F* event_stats;

    ChannelMap cmap;
 
};

#endif