Changes in modules/UniqueObjectFinder.cc [93da593:77e9ae1] in git

File:

• modules/UniqueObjectFinder.cc (modified) (9 diffs)

modules/UniqueObjectFinder.cc

@@ -17 +17 @@
  */
 
-
 /** \class UniqueObjectFinder
  *
@@ -32 +31 @@
 #include "classes/DelphesFormula.h"
 
+#include "ExRootAnalysis/ExRootClassifier.h"
+#include "ExRootAnalysis/ExRootFilter.h"
 #include "ExRootAnalysis/ExRootResult.h"
-#include "ExRootAnalysis/ExRootFilter.h"
-#include "ExRootAnalysis/ExRootClassifier.h"
 
+#include "TDatabasePDG.h"
+#include "TFormula.h"
+#include "TLorentzVector.h"
 #include "TMath.h"
+#include "TObjArray.h"
+#include "TRandom3.h"
 #include "TString.h"
-#include "TFormula.h"
-#include "TRandom3.h"
-#include "TObjArray.h"
-#include "TDatabasePDG.h"
-#include "TLorentzVector.h"
 
-#include <algorithm> 
-#include <stdexcept>
+#include <algorithm>
 #include <iostream>
 #include <sstream>
+#include <stdexcept>
 
 using namespace std;
@@ -67 +66 @@
 void UniqueObjectFinder::Init()
 {
+  // use GetUniqueID algorithm to find unique objects (faster than the default Overlaps method)
+  fUseUniqueID = GetBool("UseUniqueID", false);
+
   // import arrays with output from other modules
 
@@ -77 +79 @@
 
   size = param.GetSize();
-  for(i = 0; i < size/2; ++i)
+  for(i = 0; i < size / 2; ++i)
   {
-    array = ImportArray(param[i*2].GetString());
+    array = ImportArray(param[i * 2].GetString());
     iterator = array->MakeIterator();
 
-    fInputMap.push_back(make_pair(iterator, ExportArray(param[i*2 + 1].GetString())));
+    fInputMap.push_back(make_pair(iterator, ExportArray(param[i * 2 + 1].GetString())));
   }
 }
@@ -90 +92 @@
 void UniqueObjectFinder::Finish()
 {
-  vector< pair< TIterator *, TObjArray * > >::iterator itInputMap;
+  vector<pair<TIterator *, TObjArray *> >::iterator itInputMap;
   TIterator *iterator;
 
@@ -106 +108 @@
 {
   Candidate *candidate;
-  vector< pair< TIterator *, TObjArray * > >::iterator itInputMap;
+  vector<pair<TIterator *, TObjArray *> >::iterator itInputMap;
   TIterator *iterator;
   TObjArray *array;
@@ -118 +120 @@
     // loop over all candidates
     iterator->Reset();
-    while((candidate = static_cast<Candidate*>(iterator->Next())))
+    while((candidate = static_cast<Candidate *>(iterator->Next())))
     {
       if(Unique(candidate, itInputMap))
@@ -130 +132 @@
 //------------------------------------------------------------------------------
 
-Bool_t UniqueObjectFinder::Unique(Candidate *candidate, vector< pair< TIterator *, TObjArray * > >::iterator itInputMap)
+Bool_t UniqueObjectFinder::Unique(Candidate *candidate, vector<pair<TIterator *, TObjArray *> >::iterator itInputMap)
 {
   Candidate *previousCandidate;
-  vector< pair< TIterator *, TObjArray * > >::iterator previousItInputMap;
+  vector<pair<TIterator *, TObjArray *> >::iterator previousItInputMap;
   TObjArray *array;
 
@@ -144 +146 @@
     // loop over all candidates
     iterator.Reset();
-    while((previousCandidate = static_cast<Candidate*>(iterator.Next())))
+    while((previousCandidate = static_cast<Candidate *>(iterator.Next())))
     {
-      if(candidate->Overlaps(previousCandidate))
+      if(fUseUniqueID)
       {
-        return kFALSE;
+        if(candidate->GetUniqueID() == previousCandidate->GetUniqueID())
+        {
+          return kFALSE;
+        }
+      }
+      else
+      {
+        if(candidate->Overlaps(previousCandidate))
+        {
+          return kFALSE;
+        }
       }
     }