 |
Minimum required information about an ANITA event to be clustered. More...
#include <AcclaimClustering.h>
Public Member Functions | |
| Event (Int_t nT=0) | |
| Event (const AnitaEventSummary *sum, AnitaPol::AnitaPol_t pol, Int_t peakInd, Int_t nT=0) | |
| Event (const Event &event) | |
| Event & | operator= (const Event &event) |
| Event (int pol, int peakInd, double peak_phi, double peak_theta, int nT, UInt_t eventNumber, Int_t run, double anita_longitude, double anita_latitude, double anita_altitude, double anita_heading, double coherent_filtered_snr) | |
| TArrowAntarctica * | makeArrowFromAnitaToEvent () |
| void | setupUsefulPat (bool calculateNow=true) |
| void | resetClusteringNumbers () |
| void | deleteArrays () |
| void | setNThresholds (int n) |
| double | logLikelihoodFromPoint (double sourceLon, double sourceLat, double sourceAlt, bool addOverHorizonPenalty=false) const |
| template<class T > | |
| double | logLikelihoodFromPoint (const T &point, bool addOverHorizonPenalty=false) const |
| template<class T > | |
| double | cartesianSeparation (const T &event2) |
| bool | operator< (const Event &other) const |
Public Attributes | |
| UInt_t | eventNumber |
| Int_t | run |
| Event number. | |
| AnitaPol::AnitaPol_t | pol |
| Run. | |
| Int_t | peakIndex |
| Polarization. | |
| Double_t | centre [3] |
| Which peak in the map does this represent? | |
| Double_t | latitude |
| /// Cartesian coordinates, does not persist in ROOT | |
| Double_t | longitude |
| latitude | |
| Double_t | altitude |
| longitude | |
| Double_t | easting |
| longitude | |
| Double_t | northing |
| easting | |
| AnitaEventSummary::PayloadLocation | anita |
| northing | |
| Double_t | theta |
| Anita's position. | |
| Double_t | phi |
| reconstructed theta | |
| Double_t | thetaAdjustmentRequired |
| reconstructed phi | |
| Double_t | sigmaTheta |
| the adjustment from traceBackToContinent | |
| Double_t | sigmaPhi |
| resolution associated with this snr? | |
| Int_t | nThresholds |
| resolution associated with this snr? | |
| Int_t * | cluster |
| Double_t * | dThetaCluster |
| Double_t * | dPhiCluster |
| Bool_t | eventEventClustering |
| Double_t | nearestKnownBaseLogLikelihood |
| Remove huge clusters near MCM before doing event-to-event clustering. | |
| Double_t | nearestKnownBaseSurfaceSeparationKm |
| How far to the nearest known base? | |
| Int_t | nearestKnownBaseCluster |
| How far to the nearest known base? | |
| Int_t | nearestKnownBaseClusterSurface |
| How far to the nearest known base? | |
| Double_t | selfLogLikelihood |
| How far to the nearest known base? | |
| Double_t | nearestEventSurfaceDistanceKm |
| If the event is above the continent surface, this may be non-zero. | |
| UInt_t | nearestEventSurfaceEventNumber |
| How far away to the nearest event, in kilometers? | |
| Double_t | nearestEventSurfaceLogLikelihood |
| What's the event number of the nearest surface neighbour? | |
| UInt_t | nearestEventSurfaceLLEventNumber |
| What's the fitted log likelihood to the nearest surface neighbour? | |
| Int_t | antarcticaHistBin |
| What's the event number of the nearest surface neighbour by LL? | |
| UsefulAdu5Pat | usefulPat |
| Which global bin in the TH2DAntarctica? | |
| Bool_t | fDebug |
| /// Only construct this once | |
Minimum required information about an ANITA event to be clustered.
Definition at line 59 of file AcclaimClustering.h.
| TArrowAntarctica * Acclaim::Clustering::Event::makeArrowFromAnitaToEvent | ( | ) |
Make a TArrowAntarctica that points from ANITA to the event's location on the continent
Definition at line 510 of file AcclaimClustering.cxx.
|
inline |
For sorting based on event number
| other | is another event |
Definition at line 141 of file AcclaimClustering.h.
| void Acclaim::Clustering::Event::setNThresholds | ( | int | n | ) |
Set the N threshold arrays copying what was in there before into the new array, if long enough
| n | The size to set the internal arrays to |
Definition at line 449 of file AcclaimClustering.cxx.
| void Acclaim::Clustering::Event::setupUsefulPat | ( | bool | calculateSource = true | ) |
Since we're not saving the useful pat, this might need to be explicitly called when reading from a tree in the future
| recalculateNow | a boolian for whether or not to fire traceBackToContinent when the usefulPat is initialized |
Definition at line 124 of file AcclaimClustering.cxx.
1.8.11
