ArchiveComparisons.h

//-*-C++-*-
/***************************************************************************
 *
 *   Copyright (C) 2021 by Willem van Straten
 *   Licensed under the Academic Free License version 2.1
 *
 ***************************************************************************/
 
// psrchive/More/General/Pulsar/ArchiveComparisons.h
 
#ifndef __ArchiveComparisons_h
#define __ArchiveComparisons_h
 
#include "Pulsar/ArchiveStatistic.h"
#include "Pulsar/ScrunchFactor.h"
 
#include "ndArray.h"
 
class BinaryStatistic;
class UnaryStatistic;
 
namespace Pulsar {
 
  class CompareWith;
  
  class ArchiveComparisons : public Identifiable::Proxy<ArchiveStatistic>
  {
 
  public:
 
    ArchiveComparisons (BinaryStatistic*);
    
    void set_Archive (const Archive*);
  
    double get ();
 
    class Interface;
  
    TextInterface::Parser* get_interface ();
 
    ArchiveComparisons* clone () const;
 
    const std::string& get_what () const { return what; }
    void set_what (const std::string& t) { what = t; }
 
    const std::string& get_way () const { return way; }
    void set_way (const std::string& t) { way = t; }

    void set_compute_subint (const std::vector<bool>& flags)
    { compute_subint = flags; }

    void set_compute_chan (const std::vector<bool>& flags)
    { compute_chan = flags; }

    void set_bscrunch (const ScrunchFactor& f);
    
    const ScrunchFactor get_bscrunch () const { return bscrunch_factor; }

    void set_setup_Archive (const Archive*);

    /* Not all archive comparisons require a global set up */
    bool get_setup ();
 
  protected:

    Reference::To<CompareWith> compare;

    Reference::To<BinaryStatistic> stat;

    ndArray<2,double> result;

    std::vector<bool> compute_subint;

    std::vector<bool> compute_chan;

    ScrunchFactor bscrunch_factor;
 
    // what to compare
    std::string what;
    // dimension along which to compare
    std::string way;
 
    void build ();
    bool built;
 
    void build_compare ();
    void init_compare (const Archive* arch);
  };
 
}
 
#endif