lcsim/src/org/lcsim/recon/pfa/structural
diff -u -r1.1 -r1.2
--- MergeClustersCrossingSubDetectorBoundaries.java 28 Sep 2010 10:16:35 -0000 1.1
+++ MergeClustersCrossingSubDetectorBoundaries.java 28 Sep 2010 13:35:44 -0000 1.2
@@ -14,7 +14,7 @@
* An algorithm to merge clusters that get split because crossing
* subdetector boundaries.
*
- * @version $Id: MergeClustersCrossingSubDetectorBoundaries.java,v 1.1 2010/09/28 10:16:35 zaidan Exp $
+ * @version $Id: MergeClustersCrossingSubDetectorBoundaries.java,v 1.2 2010/09/28 13:35:44 zaidan Exp $
* @author Remi Zaidan <[log in to unmask]>
*/
@@ -191,7 +191,7 @@
// Store new output
int flag = 1<<LCIOConstants.CLBIT_HITS;
m_event.put(m_outputName, m_outputLargeClusterList, Cluster.class, flag);
- m_event.put(m_inputName+"Original", m_inputLargeClusterList, Cluster.class, flag);
+ m_event.put(m_outputName+"Original", m_inputLargeClusterList, Cluster.class, flag);
}
/**
lcsim/src/org/lcsim/recon/pfa/structural
diff -u -r1.15 -r1.16
--- SetUpDTreeForReclustering.java 28 Sep 2010 10:16:35 -0000 1.15
+++ SetUpDTreeForReclustering.java 28 Sep 2010 13:35:44 -0000 1.16
@@ -259,8 +259,8 @@
// RZ. Merge DTrees crossing sub-detector boundaries
add(new MergeClustersCrossingSubDetectorBoundaries("DTreeClustersAll", "DTreeClusters"));
- // add(new TransientFlagDriver("DTreeClusters"));
-
+ add(new TransientFlagDriver("DTreeClusters"));
+ add(new TransientFlagDriver("DTreeClustersOriginal"));
// OK, now go back and look for hits near boundaries (for use when making MIPs
// with a layer-based algorithm so it can cross from endcap to barrel).
