ThreeDTransverseTracksAlgorithm class. More...

#include "ThreeDTracksBaseAlgorithm.h"

Inheritance diagram for lar_content::ThreeDTracksBaseAlgorithm< T >:

Public Types
typedef OverlapTensor< T >	TensorType

Public Member Functions
	ThreeDTracksBaseAlgorithm ()
	Default constructor. More...

virtual	~ThreeDTracksBaseAlgorithm ()
	Destructor. More...

const TwoDSlidingFitResult &	GetCachedSlidingFitResult (const pandora::Cluster *const pCluster) const
	Get a sliding fit result from the algorithm cache. More...

unsigned int	GetSlidingFitWindow () const
	Get the layer window for the sliding linear fits. More...

virtual bool	MakeClusterSplits (const SplitPositionMap &splitPositionMap)
	Make cluster splits. More...

virtual bool	MakeClusterSplit (const pandora::CartesianVector &splitPosition, const pandora::Cluster &pCurrentCluster, const pandora::Cluster &pLowXCluster, const pandora::Cluster *&pHighXCluster) const
	Make a cluster split. More...

virtual void	UpdateForNewCluster (const pandora::Cluster *const pNewCluster)
	Update to reflect addition of a new cluster to the problem space. More...

virtual void	UpdateUponDeletion (const pandora::Cluster *const pDeletedCluster)
	Update to reflect cluster deletion. More...

virtual void	SelectInputClusters (const pandora::ClusterList *const pInputClusterList, pandora::ClusterList &selectedClusterList) const
	Select a subset of input clusters for processing in this algorithm. More...

virtual void	SetPfoParameters (const ProtoParticle &protoParticle, PandoraContentApi::ParticleFlowObject::Parameters &pfoParameters) const
	Calculate Pfo properties from proto particle. More...

virtual bool	CreateThreeDParticles (const ProtoParticleVector &protoParticleVector)
	Create particles using findings from recent algorithm processing. More...

virtual bool	MakeClusterMerges (const ClusterMergeMap &clusterMergeMap)
	Merge clusters together. More...

virtual void	RemoveUnavailableTensorElements ()
	Update tensor to remove all elements that have been added to pfos and so are unavailable. More...

const pandora::ClusterList &	GetInputClusterListU () const
	Get the input u cluster list. More...

const pandora::ClusterList &	GetInputClusterListV () const
	Get the input v cluster list. More...

const pandora::ClusterList &	GetInputClusterListW () const
	Get the input w cluster list. More...

const pandora::ClusterList &	GetSelectedClusterListU () const
	Get the selected u cluster list. More...

const pandora::ClusterList &	GetSelectedClusterListV () const
	Get the selected v cluster list. More...

const pandora::ClusterList &	GetSelectedClusterListW () const
	Get the selected w cluster list. More...

const std::string &	GetClusterListNameU () const
	Get the name of the u cluster list. More...

const std::string &	GetClusterListNameV () const
	Get the name of the v cluster list. More...

const std::string &	GetClusterListNameW () const
	Get the name of the w cluster list. More...

Static Public Member Functions
static bool	SortSplitPositions (const pandora::CartesianVector &lhs, const pandora::CartesianVector &rhs)
	Sort split position cartesian vectors by increasing x coordinate. More...

Protected Member Functions
virtual void	PreparationStep ()
	Perform any preparatory steps required, e.g. caching expensive fit results for clusters. More...

virtual void	PreparationStep (pandora::ClusterList &clusterList)
	Preparation step for a specific cluster list. More...

virtual void	TidyUp ()
	Tidy member variables in derived class. More...

void	AddToSlidingFitCache (const pandora::Cluster *const pCluster)
	Add a new sliding fit result, for the specified cluster, to the algorithm cache. More...

void	RemoveFromSlidingFitCache (const pandora::Cluster *const pCluster)
	Remova an existing sliding fit result, for the specified cluster, from the algorithm cache. More...

virtual pandora::StatusCode	ReadSettings (const pandora::TiXmlHandle xmlHandle)

virtual void	SelectAllInputClusters ()
	Select a subset of input clusters for processing in this algorithm. More...

virtual void	PerformMainLoop ()
	Main loop over cluster combinations in order to populate the tensor. Responsible for calling CalculateOverlapResult. More...

virtual void	CalculateOverlapResult (const pandora::Cluster const pClusterU, const pandora::Cluster const pClusterV, const pandora::Cluster *const pClusterW)=0
	Calculate cluster overlap result and store in tensor. More...

virtual void	ExamineTensor ()=0
	Examine contents of tensor, collect together best-matching 2D particles and modify clusters as required. More...

Protected Attributes
unsigned int	m_slidingFitWindow
	The layer window for the sliding linear fits. More...

TwoDSlidingFitResultMap	m_slidingFitResultMap
	The sliding fit result map. More...

unsigned int	m_minClusterCaloHits
	The min number of hits in base cluster selection method. More...

float	m_minClusterLengthSquared
	The min length (squared) in base cluster selection method. More...

const pandora::ClusterList *	m_pInputClusterListU
	Address of the input cluster list U. More...

const pandora::ClusterList *	m_pInputClusterListV
	Address of the input cluster list V. More...

const pandora::ClusterList *	m_pInputClusterListW
	Address of the input cluster list W. More...

pandora::ClusterList	m_clusterListU
	The selected modified cluster list U. More...

pandora::ClusterList	m_clusterListV
	The selected modified cluster list V. More...

pandora::ClusterList	m_clusterListW
	The selected modified cluster list W. More...

TensorType	m_overlapTensor
	The overlap tensor. More...

Detailed Description

template<typename T>
class lar_content::ThreeDTracksBaseAlgorithm< T >

ThreeDTransverseTracksAlgorithm class.

Definition at line 28 of file ThreeDTracksBaseAlgorithm.h.

Member Typedef Documentation

template<typename T>

typedef OverlapTensor<T> lar_content::ThreeDBaseAlgorithm< T >::TensorType

inherited

Definition at line 45 of file ThreeDBaseAlgorithm.h.

Constructor & Destructor Documentation

template<typename T >

lar_content::ThreeDTracksBaseAlgorithm< T >::ThreeDTracksBaseAlgorithm ( )

Default constructor.

Definition at line 25 of file ThreeDTracksBaseAlgorithm.cc.

                                                         :
     m_slidingFitWindow(20),
     m_minClusterCaloHits(5),
     m_minClusterLengthSquared(3.f * 3.f)
 {
 }

template<typename T >

lar_content::ThreeDTracksBaseAlgorithm< T >::~ThreeDTracksBaseAlgorithm ( )

virtual

Destructor.

Definition at line 35 of file ThreeDTracksBaseAlgorithm.cc.

36 {

37 }

Member Function Documentation

template<typename T>

void lar_content::ThreeDTracksBaseAlgorithm< T >::AddToSlidingFitCache ( const pandora::Cluster *const pCluster )

protected

Add a new sliding fit result, for the specified cluster, to the algorithm cache.

Parameters

pCluster address of the relevant cluster

Definition at line 280 of file ThreeDTracksBaseAlgorithm.cc.

References lar_content::LArGeometryHelper::GetWireZPitch(), lar_content::ThreeDTracksBaseAlgorithm< T >::m_slidingFitResultMap, and lar_content::ThreeDTracksBaseAlgorithm< T >::m_slidingFitWindow.

Referenced by lar_content::ThreeDTracksBaseAlgorithm< T >::PreparationStep(), and lar_content::ThreeDTracksBaseAlgorithm< T >::UpdateForNewCluster().

 {
     const float slidingFitPitch(LArGeometryHelper::GetWireZPitch(this->GetPandora()));
     const TwoDSlidingFitResult slidingFitResult(pCluster, m_slidingFitWindow, slidingFitPitch);
 
     if (!m_slidingFitResultMap.insert(TwoDSlidingFitResultMap::value_type(pCluster, slidingFitResult)).second)
         throw StatusCodeException(STATUS_CODE_FAILURE);
 }

template<typename T>

virtual void lar_content::ThreeDBaseAlgorithm< T >::CalculateOverlapResult	(	const pandora::Cluster *const	pClusterU,
		const pandora::Cluster *const	pClusterV,
		const pandora::Cluster *const	pClusterW
	)

protectedpure virtualinherited

Calculate cluster overlap result and store in tensor.

Parameters

pClusterU	address of U view cluster
pClusterV	address of V view cluster
pClusterW	address of W view cluster

Implemented in lar_content::ThreeDShowersAlgorithm, lar_content::ThreeDTrackFragmentsAlgorithm, lar_content::ThreeDTransverseTracksAlgorithm, lar_content::ThreeDRemnantsAlgorithm, and lar_content::ThreeDLongitudinalTracksAlgorithm.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::PerformMainLoop(), and lar_content::ThreeDBaseAlgorithm< T >::UpdateForNewCluster().

template<typename T >

bool lar_content::ThreeDBaseAlgorithm< T >::CreateThreeDParticles ( const ProtoParticleVector & protoParticleVector )

virtualinherited

Create particles using findings from recent algorithm processing.

Parameters

protoParticleVector	the proto particle vector
whether	particles were created

Definition at line 42 of file ThreeDBaseAlgorithm.cc.

References lar_content::ThreeDBaseAlgorithm< T >::m_outputPfoListName, and lar_content::ThreeDBaseAlgorithm< T >::SetPfoParameters().

Referenced by lar_content::ClearRemnantsTool::CreateThreeDParticles(), lar_content::ClearTracksTool::CreateThreeDParticles(), lar_content::ClearLongitudinalTracksTool::CreateThreeDParticles(), lar_content::ClearTrackFragmentsTool::FindTrackFragments(), lar_content::SimpleShowersTool::Run(), lar_content::MissingTrackTool::Run(), lar_content::ConnectedRemnantsTool::Run(), lar_content::MopUpRemnantsTool::Run(), lar_content::MatchedEndPointsTool::Run(), lar_content::TracksCrossingGapsTool::Run(), lar_content::MissingTrackSegmentTool::Run(), lar_content::LongTracksTool::Run(), and lar_content::ClearShowersTool::Run().

 {
     bool particlesMade(false);
     const PfoList *pPfoList = NULL; std::string pfoListName;
     PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::CreateTemporaryListAndSetCurrent(*this, pPfoList, pfoListName));
 
     for (typename ProtoParticleVector::const_iterator iter = protoParticleVector.begin(), iterEnd = protoParticleVector.end(); iter != iterEnd; ++iter)
     {
         PandoraContentApi::ParticleFlowObject::Parameters pfoParameters;
         this->SetPfoParameters(*iter, pfoParameters);
 
         const ParticleFlowObject *pPfo(NULL);
         PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::ParticleFlowObject::Create(*this, pfoParameters, pPfo));
         particlesMade = true;
     }
 
     if (!pPfoList->empty())
     {
         PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::SaveList<Pfo>(*this, m_outputPfoListName));
         PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::ReplaceCurrentList<Pfo>(*this, m_outputPfoListName));
     }
 
     return particlesMade;
 }

template<typename T>

virtual void lar_content::ThreeDBaseAlgorithm< T >::ExamineTensor ( )

protectedpure virtualinherited

Examine contents of tensor, collect together best-matching 2D particles and modify clusters as required.

Implemented in lar_content::ThreeDShowersAlgorithm, lar_content::ThreeDTrackFragmentsAlgorithm, lar_content::ThreeDTransverseTracksAlgorithm, lar_content::ThreeDLongitudinalTracksAlgorithm, and lar_content::ThreeDRemnantsAlgorithm.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::Run().

template<typename T>

const TwoDSlidingFitResult & lar_content::ThreeDTracksBaseAlgorithm< T >::GetCachedSlidingFitResult ( const pandora::Cluster *const pCluster ) const

Get a sliding fit result from the algorithm cache.

Parameters

pCluster address of the relevant cluster

Definition at line 42 of file ThreeDTracksBaseAlgorithm.cc.

References lar_content::ThreeDTracksBaseAlgorithm< T >::m_slidingFitResultMap.

Referenced by lar_content::UndershootTracksTool::GetIteratorListModifications(), lar_content::OvershootTracksTool::GetIteratorListModifications(), lar_content::MissingTrackSegmentTool::GetSegmentOverlapMap(), lar_content::MissingTrackSegmentTool::GetSlidingFitResultMap(), lar_content::UndershootTracksTool::IsThreeDKink(), lar_content::OvershootTracksTool::IsThreeDKink(), lar_content::TrackSplittingTool::PassesChecks(), and lar_content::TracksCrossingGapsTool::PassesGapChecks().

 {
     TwoDSlidingFitResultMap::const_iterator iter = m_slidingFitResultMap.find(pCluster);
 
     if (m_slidingFitResultMap.end() == iter)
         throw StatusCodeException(STATUS_CODE_NOT_FOUND);
 
     return iter->second;
 }

template<typename T >

const std::string & lar_content::ThreeDBaseAlgorithm< T >::GetClusterListNameU ( ) const

inlineinherited

Get the name of the u cluster list.

Definition at line 271 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::MakeClusterMerges(), lar_content::ThreeDTracksBaseAlgorithm< T >::MakeClusterSplits(), and lar_content::ClearTrackFragmentsTool::ProcessTensorElement().

 {
     return m_inputClusterListNameU;
 }

template<typename T >

const std::string & lar_content::ThreeDBaseAlgorithm< T >::GetClusterListNameV ( ) const

inlineinherited

Get the name of the v cluster list.

Definition at line 279 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::MakeClusterMerges(), lar_content::ThreeDTracksBaseAlgorithm< T >::MakeClusterSplits(), and lar_content::ClearTrackFragmentsTool::ProcessTensorElement().

 {
     return m_inputClusterListNameV;
 }

template<typename T >

const std::string & lar_content::ThreeDBaseAlgorithm< T >::GetClusterListNameW ( ) const

inlineinherited

Get the name of the w cluster list.

Definition at line 287 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::MakeClusterMerges(), lar_content::ThreeDTracksBaseAlgorithm< T >::MakeClusterSplits(), and lar_content::ClearTrackFragmentsTool::ProcessTensorElement().

 {
     return m_inputClusterListNameW;
 }

template<typename T >

const pandora::ClusterList & lar_content::ThreeDBaseAlgorithm< T >::GetInputClusterListU ( ) const

inlineinherited

Get the input u cluster list.

Definition at line 214 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::MissingTrackSegmentTool::GetCandidateClusters(), lar_content::TransverseTensorVisualizationTool::Run(), and lar_content::ShowerTensorVisualizationTool::Run().

 {
     if (NULL == m_pInputClusterListU)
         throw pandora::StatusCodeException(pandora::STATUS_CODE_NOT_INITIALIZED);
 
     return (*m_pInputClusterListU);
 }

template<typename T >

const pandora::ClusterList & lar_content::ThreeDBaseAlgorithm< T >::GetInputClusterListV ( ) const

inlineinherited

Get the input v cluster list.

Definition at line 225 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::MissingTrackSegmentTool::GetCandidateClusters(), lar_content::TransverseTensorVisualizationTool::Run(), and lar_content::ShowerTensorVisualizationTool::Run().

 {
     if (NULL == m_pInputClusterListV)
         throw pandora::StatusCodeException(pandora::STATUS_CODE_NOT_INITIALIZED);
 
     return (*m_pInputClusterListV);
 }

template<typename T >

const pandora::ClusterList & lar_content::ThreeDBaseAlgorithm< T >::GetInputClusterListW ( ) const

inlineinherited

Get the input w cluster list.

Definition at line 236 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::MissingTrackSegmentTool::GetCandidateClusters(), lar_content::TransverseTensorVisualizationTool::Run(), and lar_content::ShowerTensorVisualizationTool::Run().

 {
     if (NULL == m_pInputClusterListW)
         throw pandora::StatusCodeException(pandora::STATUS_CODE_NOT_INITIALIZED);
 
     return (*m_pInputClusterListW);
 }

template<typename T >

const pandora::ClusterList & lar_content::ThreeDBaseAlgorithm< T >::GetSelectedClusterListU ( ) const

inlineinherited

Get the selected u cluster list.

Definition at line 247 of file ThreeDBaseAlgorithm.h.

References lar_content::ProtoParticle::m_clusterListU.

 {
     return m_clusterListU;
 }

template<typename T >

const pandora::ClusterList & lar_content::ThreeDBaseAlgorithm< T >::GetSelectedClusterListV ( ) const

inlineinherited

Get the selected v cluster list.

Definition at line 255 of file ThreeDBaseAlgorithm.h.

References lar_content::ProtoParticle::m_clusterListV.

 {
     return m_clusterListV;
 }

template<typename T >

const pandora::ClusterList & lar_content::ThreeDBaseAlgorithm< T >::GetSelectedClusterListW ( ) const

inlineinherited

Get the selected w cluster list.

Definition at line 263 of file ThreeDBaseAlgorithm.h.

References lar_content::ProtoParticle::m_clusterListW.

 {
     return m_clusterListW;
 }

template<typename T >

unsigned int lar_content::ThreeDTracksBaseAlgorithm< T >::GetSlidingFitWindow ( ) const

inline

Get the layer window for the sliding linear fits.

Returns: the layer window for the sliding linear fits

Definition at line 128 of file ThreeDTracksBaseAlgorithm.h.

References lar_content::ThreeDTracksBaseAlgorithm< T >::m_slidingFitWindow.

Referenced by lar_content::MissingTrackSegmentTool::GetSlidingFitResultMap().

 {
     return m_slidingFitWindow;
 }

template<typename T >

bool lar_content::ThreeDBaseAlgorithm< T >::MakeClusterMerges ( const ClusterMergeMap & clusterMergeMap )

virtualinherited

Merge clusters together.

Parameters

clusterMergeMap the cluster merge map

Returns: whether changes to the tensor have been made

Definition at line 70 of file ThreeDBaseAlgorithm.cc.

References lar_content::LArClusterHelper::GetClusterHitType(), lar_content::ThreeDBaseAlgorithm< T >::GetClusterListNameU(), lar_content::ThreeDBaseAlgorithm< T >::GetClusterListNameV(), lar_content::ThreeDBaseAlgorithm< T >::GetClusterListNameW(), lar_content::LArClusterHelper::SortByNHits(), lar_content::ThreeDBaseAlgorithm< T >::UpdateForNewCluster(), and lar_content::ThreeDBaseAlgorithm< T >::UpdateUponDeletion().

Referenced by lar_content::SplitShowersTool::ApplyChanges(), lar_content::ThreeDKinkBaseTool::ApplyChanges(), lar_content::ConnectedRemnantsTool::Run(), and lar_content::MissingTrackSegmentTool::Run().

 {
     ClusterSet deletedClusters;
 
     ClusterList parentClusters;
     for (const auto &mapEntry : clusterMergeMap) parentClusters.push_back(mapEntry.first);
     parentClusters.sort(LArClusterHelper::SortByNHits);
 
     for (const Cluster *const pParentCluster : parentClusters)
     {
         const HitType hitType(LArClusterHelper::GetClusterHitType(pParentCluster));
         const std::string clusterListName((TPC_VIEW_U == hitType) ? this->GetClusterListNameU() : (TPC_VIEW_V == hitType) ? this->GetClusterListNameV() : this->GetClusterListNameW());
 
         if (!((TPC_VIEW_U == hitType) || (TPC_VIEW_V == hitType) || (TPC_VIEW_W == hitType)))
             throw StatusCodeException(STATUS_CODE_FAILURE);
 
         ClusterList daughterClusters(clusterMergeMap.at(pParentCluster));
         daughterClusters.sort(LArClusterHelper::SortByNHits);
 
         for (const Cluster *const pDaughterCluster : daughterClusters)
         {
             if (deletedClusters.count(pParentCluster) || deletedClusters.count(pDaughterCluster))
                 throw StatusCodeException(STATUS_CODE_FAILURE);
 
             this->UpdateUponDeletion(pDaughterCluster);
             this->UpdateUponDeletion(pParentCluster);
             PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::MergeAndDeleteClusters(*this, pParentCluster, pDaughterCluster, clusterListName, clusterListName));
 
             this->UpdateForNewCluster(pParentCluster);
             deletedClusters.insert(pDaughterCluster);
         }
     }
 
     return !(deletedClusters.empty());
 }

template<typename T>

bool lar_content::ThreeDTracksBaseAlgorithm< T >::MakeClusterSplit	(	const pandora::CartesianVector &	splitPosition,
		const pandora::Cluster *&	pCurrentCluster,
		const pandora::Cluster *&	pLowXCluster,
		const pandora::Cluster *&	pHighXCluster
	)		const

virtual

Make a cluster split.

Parameters

splitPosition	the split position
pCurrentCluster	the cluster to split
pLowXCluster	to receive the low x cluster
pHighXCluster	to receive the high x cluster

Returns: whether a cluster split occurred

Definition at line 101 of file ThreeDTracksBaseAlgorithm.cc.

References f, lar_content::LArPointingCluster::GetInnerVertex(), lar_content::LArPointingCluster::GetOuterVertex(), and lar_content::LArPointingCluster::Vertex::GetPosition().

Referenced by lar_content::ThreeDTracksBaseAlgorithm< T >::MakeClusterSplits().

 {
     CartesianVector lowXEnd(0.f, 0.f, 0.f), highXEnd(0.f, 0.f, 0.f);
 
     try
     {
         LArPointingCluster pointingCluster(pCurrentCluster);
         const bool innerIsLowX(pointingCluster.GetInnerVertex().GetPosition().GetX() < pointingCluster.GetOuterVertex().GetPosition().GetX());
         lowXEnd = (innerIsLowX ? pointingCluster.GetInnerVertex().GetPosition() : pointingCluster.GetOuterVertex().GetPosition());
         highXEnd = (innerIsLowX ? pointingCluster.GetOuterVertex().GetPosition() : pointingCluster.GetInnerVertex().GetPosition());
     }
     catch (const StatusCodeException &) {return false;}
 
     const CartesianVector lowXUnitVector((lowXEnd - splitPosition).GetUnitVector());
     const CartesianVector highXUnitVector((highXEnd - splitPosition).GetUnitVector());
 
     CaloHitList caloHitList;
     pCurrentCluster->GetOrderedCaloHitList().FillCaloHitList(caloHitList);
 
     std::string originalListName, fragmentListName;
     const ClusterList clusterList(1, pCurrentCluster);
     PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::InitializeFragmentation(*this, clusterList, originalListName, fragmentListName));
 
     pLowXCluster = NULL;
     pHighXCluster = NULL;
 
     for (CaloHitList::const_iterator hIter = caloHitList.begin(), hIterEnd = caloHitList.end(); hIter != hIterEnd; ++hIter)
     {
         const CaloHit *const pCaloHit = *hIter;
         const CartesianVector unitVector((pCaloHit->GetPositionVector() - splitPosition).GetUnitVector());
 
         const float dotProductLowX(unitVector.GetDotProduct(lowXUnitVector));
         const float dotProductHighX(unitVector.GetDotProduct(highXUnitVector));
         const Cluster *&pClusterToModify((dotProductLowX > dotProductHighX) ? pLowXCluster : pHighXCluster);
 
         if (NULL == pClusterToModify)
         {
             PandoraContentApi::Cluster::Parameters parameters;
             parameters.m_caloHitList.push_back(pCaloHit);
             PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::Cluster::Create(*this, parameters, pClusterToModify));
         }
         else
         {
             PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::AddToCluster(*this, pClusterToModify, pCaloHit));
         }
     }
 
     if ((NULL == pLowXCluster) || (NULL == pHighXCluster))
     {
         PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::EndFragmentation(*this, originalListName, fragmentListName));
         return false;
     }
 
     PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::EndFragmentation(*this, fragmentListName, originalListName));
     return true;
 }

template<typename T >

bool lar_content::ThreeDTracksBaseAlgorithm< T >::MakeClusterSplits ( const SplitPositionMap & splitPositionMap )

virtual

Make cluster splits.

Parameters

splitPositionMap the split position map

Returns: whether changes to the tensor have been made

Definition at line 55 of file ThreeDTracksBaseAlgorithm.cc.

References lar_content::LArClusterHelper::GetClusterHitType(), lar_content::ThreeDBaseAlgorithm< T >::GetClusterListNameU(), lar_content::ThreeDBaseAlgorithm< T >::GetClusterListNameV(), lar_content::ThreeDBaseAlgorithm< T >::GetClusterListNameW(), lar_content::ThreeDTracksBaseAlgorithm< T >::MakeClusterSplit(), lar_content::LArClusterHelper::SortByNHits(), lar_content::ThreeDTracksBaseAlgorithm< T >::SortSplitPositions(), lar_content::ThreeDTracksBaseAlgorithm< T >::UpdateForNewCluster(), and lar_content::ThreeDTracksBaseAlgorithm< T >::UpdateUponDeletion().

Referenced by lar_content::ThreeDKinkBaseTool::ApplyChanges(), and lar_content::TrackSplittingTool::Run().

 {
     bool changesMade(false);
 
     ClusterList splitClusters;
     for (const auto &mapEntry : splitPositionMap) splitClusters.push_back(mapEntry.first);
     splitClusters.sort(LArClusterHelper::SortByNHits);
 
     for (const Cluster *pCurrentCluster : splitClusters)
     {
         CartesianPointVector splitPositions(splitPositionMap.at(pCurrentCluster));
         std::sort(splitPositions.begin(), splitPositions.end(), ThreeDTracksBaseAlgorithm::SortSplitPositions);
 
         const HitType hitType(LArClusterHelper::GetClusterHitType(pCurrentCluster));
         const std::string clusterListName((TPC_VIEW_U == hitType) ? this->GetClusterListNameU() : (TPC_VIEW_V == hitType) ? this->GetClusterListNameV() : this->GetClusterListNameW());
 
         if (!((TPC_VIEW_U == hitType) || (TPC_VIEW_V == hitType) || (TPC_VIEW_W == hitType)))
             throw StatusCodeException(STATUS_CODE_FAILURE);
 
         PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::ReplaceCurrentList<Cluster>(*this, clusterListName));
 
         for (CartesianPointVector::const_iterator sIter = splitPositions.begin(), sIterEnd = splitPositions.end(); sIter != sIterEnd; ++sIter)
         {
             const Cluster *pLowXCluster(NULL), *pHighXCluster(NULL);
             this->UpdateUponDeletion(pCurrentCluster);
 
             if (this->MakeClusterSplit(*sIter, pCurrentCluster, pLowXCluster, pHighXCluster))
             {
                 changesMade = true;
                 this->UpdateForNewCluster(pLowXCluster);
                 this->UpdateForNewCluster(pHighXCluster);
                 pCurrentCluster = pHighXCluster;
             }
             else
             {
                 this->UpdateForNewCluster(pCurrentCluster);
             }
         }
     }
 
     return changesMade;
 }

template<typename T >

void lar_content::ThreeDBaseAlgorithm< T >::PerformMainLoop ( )

protectedvirtualinherited

Main loop over cluster combinations in order to populate the tensor. Responsible for calling CalculateOverlapResult.

Reimplemented in lar_content::ThreeDTrackFragmentsAlgorithm.

Definition at line 280 of file ThreeDBaseAlgorithm.cc.

References lar_content::ThreeDBaseAlgorithm< T >::CalculateOverlapResult(), lar_content::ThreeDBaseAlgorithm< T >::m_clusterListU, lar_content::ThreeDBaseAlgorithm< T >::m_clusterListV, lar_content::ThreeDBaseAlgorithm< T >::m_clusterListW, and lar_content::LArClusterHelper::SortByNHits().

Referenced by lar_content::ThreeDBaseAlgorithm< T >::Run().

 {
     ClusterVector clusterVectorU(m_clusterListU.begin(), m_clusterListU.end());
     ClusterVector clusterVectorV(m_clusterListV.begin(), m_clusterListV.end());
     ClusterVector clusterVectorW(m_clusterListW.begin(), m_clusterListW.end());
     std::sort(clusterVectorU.begin(), clusterVectorU.end(), LArClusterHelper::SortByNHits);
     std::sort(clusterVectorV.begin(), clusterVectorV.end(), LArClusterHelper::SortByNHits);
     std::sort(clusterVectorW.begin(), clusterVectorW.end(), LArClusterHelper::SortByNHits);
 
     for (const Cluster *const pClusterU : clusterVectorU)
     {
         for (const Cluster *const pClusterV : clusterVectorV)
         {
             for (const Cluster *const pClusterW : clusterVectorW)
                 this->CalculateOverlapResult(pClusterU, pClusterV, pClusterW);
         }
     }
 }

template<typename T >

void lar_content::ThreeDTracksBaseAlgorithm< T >::PreparationStep ( )

protectedvirtual

Perform any preparatory steps required, e.g. caching expensive fit results for clusters.

Reimplemented from lar_content::ThreeDBaseAlgorithm< T >.

Definition at line 237 of file ThreeDTracksBaseAlgorithm.cc.

References lar_content::ThreeDTracksBaseAlgorithm< T >::AddToSlidingFitCache(), lar_content::ThreeDBaseAlgorithm< T >::m_clusterListU, lar_content::ThreeDBaseAlgorithm< T >::m_clusterListV, and lar_content::ThreeDBaseAlgorithm< T >::m_clusterListW.

 {
     this->PreparationStep(this->m_clusterListU);
     this->PreparationStep(this->m_clusterListV);
     this->PreparationStep(this->m_clusterListW);
 }

template<typename T>

virtual void lar_content::ThreeDTracksBaseAlgorithm< T >::PreparationStep ( pandora::ClusterList & clusterList )

protectedvirtual

Preparation step for a specific cluster list.

Parameters

clusterList the cluster list

template<typename T>

StatusCode lar_content::ThreeDTracksBaseAlgorithm< T >::ReadSettings ( const pandora::TiXmlHandle xmlHandle )

protectedvirtual

Reimplemented from lar_content::ThreeDBaseAlgorithm< T >.

Reimplemented in lar_content::ThreeDTrackFragmentsAlgorithm, lar_content::ThreeDTransverseTracksAlgorithm, and lar_content::ThreeDLongitudinalTracksAlgorithm.

Definition at line 303 of file ThreeDTracksBaseAlgorithm.cc.

References lar_content::ThreeDTracksBaseAlgorithm< T >::m_minClusterCaloHits, lar_content::ThreeDTracksBaseAlgorithm< T >::m_minClusterLengthSquared, lar_content::ThreeDTracksBaseAlgorithm< T >::m_slidingFitWindow, and lar_content::ThreeDBaseAlgorithm< T >::ReadSettings().

Referenced by lar_content::ThreeDLongitudinalTracksAlgorithm::ReadSettings(), lar_content::ThreeDTransverseTracksAlgorithm::ReadSettings(), and lar_content::ThreeDTrackFragmentsAlgorithm::ReadSettings().

 {
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
         "SlidingFitWindow", m_slidingFitWindow));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
         "MinClusterCaloHits", m_minClusterCaloHits));
 
     float minClusterLength = std::sqrt(m_minClusterLengthSquared);
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
         "MinClusterLength", minClusterLength));
     m_minClusterLengthSquared = minClusterLength * minClusterLength;
 
     return ThreeDBaseAlgorithm<T>::ReadSettings(xmlHandle);
 }

template<typename T>

void lar_content::ThreeDTracksBaseAlgorithm< T >::RemoveFromSlidingFitCache ( const pandora::Cluster *const pCluster )

protected

Remova an existing sliding fit result, for the specified cluster, from the algorithm cache.

Parameters

pCluster address of the relevant cluster

Definition at line 292 of file ThreeDTracksBaseAlgorithm.cc.

References lar_content::ThreeDTracksBaseAlgorithm< T >::m_slidingFitResultMap.

Referenced by lar_content::ThreeDTracksBaseAlgorithm< T >::UpdateUponDeletion().

 {
     TwoDSlidingFitResultMap::iterator iter = m_slidingFitResultMap.find(pCluster);
 
     if (m_slidingFitResultMap.end() != iter)
         m_slidingFitResultMap.erase(iter);
 }

template<typename T >

void lar_content::ThreeDBaseAlgorithm< T >::RemoveUnavailableTensorElements ( )

virtualinherited

Update tensor to remove all elements that have been added to pfos and so are unavailable.

Definition at line 175 of file ThreeDBaseAlgorithm.cc.

References lar_content::OverlapTensor< T >::GetClusterNavigationMapUV(), lar_content::OverlapTensor< T >::GetClusterNavigationMapVW(), lar_content::OverlapTensor< T >::GetClusterNavigationMapWU(), lar_content::ThreeDBaseAlgorithm< T >::m_overlapTensor, lar_content::LArClusterHelper::SortByNHits(), and lar_content::ThreeDBaseAlgorithm< T >::UpdateUponDeletion().

 {
     const typename TensorType::ClusterNavigationMap &navigationMapUV(m_overlapTensor.GetClusterNavigationMapUV());
     const typename TensorType::ClusterNavigationMap &navigationMapVW(m_overlapTensor.GetClusterNavigationMapVW());
     const typename TensorType::ClusterNavigationMap &navigationMapWU(m_overlapTensor.GetClusterNavigationMapWU());
     ClusterList usedClusters;
 
     for (typename TensorType::ClusterNavigationMap::const_iterator iter = navigationMapUV.begin(), iterEnd = navigationMapUV.end(); iter != iterEnd; ++iter)
     {
         if (!(iter->first->IsAvailable()))
             usedClusters.push_back(iter->first);
     }
 
     for (typename TensorType::ClusterNavigationMap::const_iterator iter = navigationMapVW.begin(), iterEnd = navigationMapVW.end(); iter != iterEnd; ++iter)
     {
         if (!(iter->first->IsAvailable()))
             usedClusters.push_back(iter->first);
     }
 
     for (typename TensorType::ClusterNavigationMap::const_iterator iter = navigationMapWU.begin(), iterEnd = navigationMapWU.end(); iter != iterEnd; ++iter)
     {
         if (!(iter->first->IsAvailable()))
             usedClusters.push_back(iter->first);
     }
 
     usedClusters.sort(LArClusterHelper::SortByNHits);
 
     for (ClusterList::const_iterator iter = usedClusters.begin(), iterEnd = usedClusters.end(); iter != iterEnd; ++iter)
         this->UpdateUponDeletion(*iter);
 }

template<typename T >

void lar_content::ThreeDBaseAlgorithm< T >::SelectAllInputClusters ( )

protectedvirtualinherited

Select a subset of input clusters for processing in this algorithm.

Definition at line 209 of file ThreeDBaseAlgorithm.cc.

References lar_content::ThreeDBaseAlgorithm< T >::m_clusterListU, lar_content::ThreeDBaseAlgorithm< T >::m_clusterListV, lar_content::ThreeDBaseAlgorithm< T >::m_clusterListW, lar_content::ThreeDBaseAlgorithm< T >::m_pInputClusterListU, lar_content::ThreeDBaseAlgorithm< T >::m_pInputClusterListV, lar_content::ThreeDBaseAlgorithm< T >::m_pInputClusterListW, and lar_content::ThreeDBaseAlgorithm< T >::SelectInputClusters().

Referenced by lar_content::ThreeDBaseAlgorithm< T >::Run().

 {
     this->SelectInputClusters(m_pInputClusterListU, m_clusterListU);
     this->SelectInputClusters(m_pInputClusterListV, m_clusterListV);
     this->SelectInputClusters(m_pInputClusterListW, m_clusterListW);
 }

template<typename T>

void lar_content::ThreeDTracksBaseAlgorithm< T >::SelectInputClusters	(	const pandora::ClusterList *const	pInputClusterList,
		pandora::ClusterList &	selectedClusterList
	)		const

virtual

Select a subset of input clusters for processing in this algorithm.

Parameters

pInputClusterList	address of an input cluster list
selectedClusterList	to receive the selected cluster list

Implements lar_content::ThreeDBaseAlgorithm< T >.

Definition at line 199 of file ThreeDTracksBaseAlgorithm.cc.

References lar_content::LArClusterHelper::GetLengthSquared(), lar_content::ThreeDTracksBaseAlgorithm< T >::m_minClusterCaloHits, and lar_content::ThreeDTracksBaseAlgorithm< T >::m_minClusterLengthSquared.

Referenced by lar_content::ClearTrackFragmentsTool::UpdateTensor().

 {
     for (ClusterList::const_iterator iter = pInputClusterList->begin(), iterEnd = pInputClusterList->end(); iter != iterEnd; ++iter)
     {
         const Cluster *const pCluster = *iter;
 
         if (!pCluster->IsAvailable())
             continue;
 
         if (pCluster->GetNCaloHits() < m_minClusterCaloHits)
             continue;
 
         if (LArClusterHelper::GetLengthSquared(pCluster) < m_minClusterLengthSquared)
             continue;
 
         selectedClusterList.push_back(pCluster);
     }
 }

template<typename T >

void lar_content::ThreeDTracksBaseAlgorithm< T >::SetPfoParameters	(	const ProtoParticle &	protoParticle,
		PandoraContentApi::ParticleFlowObject::Parameters &	pfoParameters
	)		const

virtual

Calculate Pfo properties from proto particle.

Parameters

protoParticle	the input proto particle
pfoParameters	the output pfo parameters

Implements lar_content::ThreeDBaseAlgorithm< T >.

Definition at line 221 of file ThreeDTracksBaseAlgorithm.cc.

References f, lar_content::ProtoParticle::m_clusterListU, lar_content::ProtoParticle::m_clusterListV, and lar_content::ProtoParticle::m_clusterListW.

 {
     // TODO Correct these placeholder parameters
     pfoParameters.m_particleId = MU_MINUS; // Track
     pfoParameters.m_charge = PdgTable::GetParticleCharge(pfoParameters.m_particleId.Get());
     pfoParameters.m_mass = PdgTable::GetParticleMass(pfoParameters.m_particleId.Get());
     pfoParameters.m_energy = 0.f;
     pfoParameters.m_momentum = CartesianVector(0.f, 0.f, 0.f);
     pfoParameters.m_clusterList.insert(pfoParameters.m_clusterList.end(), protoParticle.m_clusterListU.begin(), protoParticle.m_clusterListU.end());
     pfoParameters.m_clusterList.insert(pfoParameters.m_clusterList.end(), protoParticle.m_clusterListV.begin(), protoParticle.m_clusterListV.end());
     pfoParameters.m_clusterList.insert(pfoParameters.m_clusterList.end(), protoParticle.m_clusterListW.begin(), protoParticle.m_clusterListW.end());
 }

template<typename T >

bool lar_content::ThreeDTracksBaseAlgorithm< T >::SortSplitPositions	(	const pandora::CartesianVector &	lhs,
		const pandora::CartesianVector &	rhs
	)

static

Sort split position cartesian vectors by increasing x coordinate.

Parameters

lhs	the first cartesian vector
rhs	the second cartesian vector

Definition at line 162 of file ThreeDTracksBaseAlgorithm.cc.

Referenced by lar_content::ThreeDTracksBaseAlgorithm< T >::MakeClusterSplits().

 {
     return (lhs.GetX() < rhs.GetX());
 }

template<typename T >

void lar_content::ThreeDTracksBaseAlgorithm< T >::TidyUp ( )

protectedvirtual

Tidy member variables in derived class.

Reimplemented from lar_content::ThreeDBaseAlgorithm< T >.

Definition at line 271 of file ThreeDTracksBaseAlgorithm.cc.

References lar_content::ThreeDTracksBaseAlgorithm< T >::m_slidingFitResultMap, and lar_content::ThreeDBaseAlgorithm< T >::TidyUp().

 {
     m_slidingFitResultMap.clear();
     return ThreeDBaseAlgorithm<T>::TidyUp();
 }

template<typename T>

void lar_content::ThreeDTracksBaseAlgorithm< T >::UpdateForNewCluster ( const pandora::Cluster *const pNewCluster )

virtual

Update to reflect addition of a new cluster to the problem space.

Parameters

pNewCluster address of the new cluster

Reimplemented from lar_content::ThreeDBaseAlgorithm< T >.

Reimplemented in lar_content::ThreeDTrackFragmentsAlgorithm.

Definition at line 170 of file ThreeDTracksBaseAlgorithm.cc.

References lar_content::ThreeDTracksBaseAlgorithm< T >::AddToSlidingFitCache(), and lar_content::ThreeDBaseAlgorithm< T >::UpdateForNewCluster().

Referenced by lar_content::ThreeDTracksBaseAlgorithm< T >::MakeClusterSplits().

 {
     try
     {
         this->AddToSlidingFitCache(pNewCluster);
     }
     catch (StatusCodeException &statusCodeException)
     {
         if (STATUS_CODE_FAILURE == statusCodeException.GetStatusCode())
             throw statusCodeException;
 
         return;
     }
 
     ThreeDBaseAlgorithm<T>::UpdateForNewCluster(pNewCluster);
 }

template<typename T>

void lar_content::ThreeDTracksBaseAlgorithm< T >::UpdateUponDeletion ( const pandora::Cluster *const pDeletedCluster )

virtual

Update to reflect cluster deletion.

Parameters

pDeletedCluster address of the deleted cluster

Reimplemented from lar_content::ThreeDBaseAlgorithm< T >.

Definition at line 190 of file ThreeDTracksBaseAlgorithm.cc.

References lar_content::ThreeDTracksBaseAlgorithm< T >::RemoveFromSlidingFitCache(), and lar_content::ThreeDBaseAlgorithm< T >::UpdateUponDeletion().

Referenced by lar_content::ThreeDTracksBaseAlgorithm< T >::MakeClusterSplits(), and lar_content::ClearTrackFragmentsTool::UpdateTensor().

 {
     this->RemoveFromSlidingFitCache(pDeletedCluster);
     ThreeDBaseAlgorithm<T>::UpdateUponDeletion(pDeletedCluster);
 }

Member Data Documentation

template<typename T>

pandora::ClusterList lar_content::ThreeDBaseAlgorithm< T >::m_clusterListU

protectedinherited

The selected modified cluster list U.

Definition at line 196 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::PerformMainLoop(), lar_content::ThreeDTracksBaseAlgorithm< T >::PreparationStep(), lar_content::ThreeDBaseAlgorithm< T >::SelectAllInputClusters(), lar_content::ThreeDBaseAlgorithm< T >::TidyUp(), lar_content::ThreeDBaseAlgorithm< T >::UpdateForNewCluster(), and lar_content::ThreeDBaseAlgorithm< T >::UpdateUponDeletion().

template<typename T>

pandora::ClusterList lar_content::ThreeDBaseAlgorithm< T >::m_clusterListV

protectedinherited

The selected modified cluster list V.

Definition at line 197 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::PerformMainLoop(), lar_content::ThreeDTracksBaseAlgorithm< T >::PreparationStep(), lar_content::ThreeDBaseAlgorithm< T >::SelectAllInputClusters(), lar_content::ThreeDBaseAlgorithm< T >::TidyUp(), lar_content::ThreeDBaseAlgorithm< T >::UpdateForNewCluster(), and lar_content::ThreeDBaseAlgorithm< T >::UpdateUponDeletion().

template<typename T>

pandora::ClusterList lar_content::ThreeDBaseAlgorithm< T >::m_clusterListW

protectedinherited

The selected modified cluster list W.

Definition at line 198 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::PerformMainLoop(), lar_content::ThreeDTracksBaseAlgorithm< T >::PreparationStep(), lar_content::ThreeDBaseAlgorithm< T >::SelectAllInputClusters(), lar_content::ThreeDBaseAlgorithm< T >::TidyUp(), lar_content::ThreeDBaseAlgorithm< T >::UpdateForNewCluster(), and lar_content::ThreeDBaseAlgorithm< T >::UpdateUponDeletion().

template<typename T>

unsigned int lar_content::ThreeDTracksBaseAlgorithm< T >::m_minClusterCaloHits

protected

The min number of hits in base cluster selection method.

Definition at line 121 of file ThreeDTracksBaseAlgorithm.h.

Referenced by lar_content::ThreeDTracksBaseAlgorithm< T >::ReadSettings(), and lar_content::ThreeDTracksBaseAlgorithm< T >::SelectInputClusters().

template<typename T>

float lar_content::ThreeDTracksBaseAlgorithm< T >::m_minClusterLengthSquared

protected

The min length (squared) in base cluster selection method.

Definition at line 122 of file ThreeDTracksBaseAlgorithm.h.

Referenced by lar_content::ThreeDTracksBaseAlgorithm< T >::ReadSettings(), and lar_content::ThreeDTracksBaseAlgorithm< T >::SelectInputClusters().

template<typename T>

TensorType lar_content::ThreeDBaseAlgorithm< T >::m_overlapTensor

protectedinherited

The overlap tensor.

Definition at line 200 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::RemoveUnavailableTensorElements(), lar_content::ThreeDBaseAlgorithm< T >::TidyUp(), and lar_content::ThreeDBaseAlgorithm< T >::UpdateUponDeletion().

template<typename T>

const pandora::ClusterList* lar_content::ThreeDBaseAlgorithm< T >::m_pInputClusterListU

protectedinherited

Address of the input cluster list U.

Definition at line 192 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::Run(), lar_content::ThreeDBaseAlgorithm< T >::SelectAllInputClusters(), and lar_content::ThreeDBaseAlgorithm< T >::TidyUp().

template<typename T>

const pandora::ClusterList* lar_content::ThreeDBaseAlgorithm< T >::m_pInputClusterListV

protectedinherited

Address of the input cluster list V.

Definition at line 193 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::Run(), lar_content::ThreeDBaseAlgorithm< T >::SelectAllInputClusters(), and lar_content::ThreeDBaseAlgorithm< T >::TidyUp().

template<typename T>

const pandora::ClusterList* lar_content::ThreeDBaseAlgorithm< T >::m_pInputClusterListW

protectedinherited

Address of the input cluster list W.

Definition at line 194 of file ThreeDBaseAlgorithm.h.

Referenced by lar_content::ThreeDBaseAlgorithm< T >::Run(), lar_content::ThreeDBaseAlgorithm< T >::SelectAllInputClusters(), and lar_content::ThreeDBaseAlgorithm< T >::TidyUp().

template<typename T>

TwoDSlidingFitResultMap lar_content::ThreeDTracksBaseAlgorithm< T >::m_slidingFitResultMap

protected

The sliding fit result map.

Definition at line 119 of file ThreeDTracksBaseAlgorithm.h.

Referenced by lar_content::ThreeDTracksBaseAlgorithm< T >::AddToSlidingFitCache(), lar_content::ThreeDTracksBaseAlgorithm< T >::GetCachedSlidingFitResult(), lar_content::ThreeDTracksBaseAlgorithm< T >::RemoveFromSlidingFitCache(), and lar_content::ThreeDTracksBaseAlgorithm< T >::TidyUp().

template<typename T>

unsigned int lar_content::ThreeDTracksBaseAlgorithm< T >::m_slidingFitWindow

protected

The layer window for the sliding linear fits.

Definition at line 118 of file ThreeDTracksBaseAlgorithm.h.

Referenced by lar_content::ThreeDTracksBaseAlgorithm< T >::AddToSlidingFitCache(), lar_content::ThreeDTracksBaseAlgorithm< T >::GetSlidingFitWindow(), and lar_content::ThreeDTracksBaseAlgorithm< T >::ReadSettings().

The documentation for this class was generated from the following files:

larpandoracontent/v03_13_02/source/larpandoracontent/LArThreeDReco/LArThreeDBase/ThreeDTracksBaseAlgorithm.h
larpandoracontent/v03_13_02/source/larpandoracontent/LArThreeDReco/LArThreeDBase/ThreeDTracksBaseAlgorithm.cc

Public Types

Public Member Functions

Static Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

template<typename T> class lar_content::ThreeDTracksBaseAlgorithm< T >

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation

template<typename T>
class lar_content::ThreeDTracksBaseAlgorithm< T >