lar_content::OverlapTensor< T > Class Template Reference

OverlapTensor class. More...

#include "LArOverlapTensor.h"

Classes
class	Element
	Element class. More...

Public Types
typedef T	OverlapResult
typedef std::vector< Element >	ElementList
typedef std::unordered_map< const pandora::Cluster *, pandora::ClusterList >	ClusterNavigationMap
typedef std::unordered_map< const pandora::Cluster *, OverlapResult >	OverlapList
typedef std::unordered_map< const pandora::Cluster *, OverlapList >	OverlapMatrix
typedef std::unordered_map< const pandora::Cluster *, OverlapMatrix >	TheTensor
typedef TheTensor::const_iterator	const_iterator

Public Member Functions
void	GetUnambiguousElements (const bool ignoreUnavailable, ElementList &elementList) const
	Get unambiguous elements. More...
bool	DefaultAmbiguityFunction (const pandora::ClusterList &clusterListU, const pandora::ClusterList &clusterListV, const pandora::ClusterList &clusterListW, const pandora::Cluster *&pClusterU, const pandora::Cluster *&pClusterV, const pandora::Cluster *&pClusterW) const
	Default ambiguity function, checking that only one U, V and W cluster is found. More...
void	GetNConnections (const pandora::Cluster *const pCluster, const bool ignoreUnavailable, unsigned int &nU, unsigned int &nV, unsigned int &nW) const
	Get the number of connections for a specified cluster. More...
void	GetConnectedElements (const pandora::Cluster *const pCluster, const bool ignoreUnavailable, ElementList &elementList) const
	Get a list of elements connected to a specified cluster. More...
void	GetConnectedElements (const pandora::Cluster *const pCluster, const bool ignoreUnavailable, ElementList &elementList, unsigned int &nU, unsigned int &nV, unsigned int &nW) const
	Get a list of elements connected to a specified cluster. More...
const_iterator	begin () const
	Returns an iterator referring to the first element in the overlap tensor. More...
const_iterator	end () const
	Returns an iterator referring to the past-the-end element in the overlap tensor. More...
void	GetSortedKeyClusters (pandora::ClusterVector &sortedKeyClusters) const
	Get a sorted vector of key clusters (U clusters with current implementation) More...
const OverlapResult &	GetOverlapResult (const pandora::Cluster *const pClusterU, const pandora::Cluster *const pClusterV, const pandora::Cluster *const pClusterW) const
	Get the overlap result for a specified trio of clusters. More...
const OverlapList &	GetOverlapList (const pandora::Cluster *const pClusterU, const pandora::Cluster *const pClusterV) const
	Get the overlap list for a specified pair of clusters. More...
const OverlapMatrix &	GetOverlapMatrix (const pandora::Cluster *const pClusterU) const
	Get the cluster overlap matrix for a specified cluster. More...
const ClusterNavigationMap &	GetClusterNavigationMapUV () const
	Get the cluster navigation map U->V. More...
const ClusterNavigationMap &	GetClusterNavigationMapVW () const
	Get the cluster navigation map V->W. More...
const ClusterNavigationMap &	GetClusterNavigationMapWU () const
	Get the cluster navigation map W->U. More...
void	SetOverlapResult (const pandora::Cluster *const pClusterU, const pandora::Cluster *const pClusterV, const pandora::Cluster *const pClusterW, const OverlapResult &overlapResult)
	Set overlap result. More...
void	ReplaceOverlapResult (const pandora::Cluster *const pClusterU, const pandora::Cluster *const pClusterV, const pandora::Cluster *const pClusterW, const OverlapResult &overlapResult)
	SetReplace an existing overlap result. More...
void	RemoveCluster (const pandora::Cluster *const pCluster)
	Remove entries from tensor corresponding to specified cluster. More...
void	Clear ()
	Clear overlap tensor. More...

Private Member Functions
void	GetConnectedElements (const pandora::Cluster *const pCluster, const bool ignoreUnavailable, ElementList &elementList, pandora::ClusterList &clusterListU, pandora::ClusterList &clusterListV, pandora::ClusterList &clusterListW) const
	Get elements connected to a specified cluster. More...
void	ExploreConnections (const pandora::Cluster *const pCluster, const bool ignoreUnavailable, pandora::ClusterList &clusterListU, pandora::ClusterList &clusterListV, pandora::ClusterList &clusterListW) const
	Explore connections associated with a given cluster. More...

Private Attributes
TheTensor	m_overlapTensor
	The overlap tensor. More...
ClusterNavigationMap	m_clusterNavigationMapUV
	The cluster navigation map U->V. More...
ClusterNavigationMap	m_clusterNavigationMapVW
	The cluster navigation map V->W. More...
ClusterNavigationMap	m_clusterNavigationMapWU
	The cluster navigation map W->U. More...

Detailed Description

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

OverlapTensor class.

Definition at line 23 of file LArOverlapTensor.h.

Member Typedef Documentation

template<typename T>

typedef std::unordered_map<const pandora::Cluster*, pandora::ClusterList> lar_content::OverlapTensor< T >::ClusterNavigationMap

Definition at line 144 of file LArOverlapTensor.h.

template<typename T>

typedef TheTensor::const_iterator lar_content::OverlapTensor< T >::const_iterator

Definition at line 149 of file LArOverlapTensor.h.

template<typename T>

typedef std::vector<Element> lar_content::OverlapTensor< T >::ElementList

Definition at line 86 of file LArOverlapTensor.h.

template<typename T>

typedef std::unordered_map<const pandora::Cluster*, OverlapResult> lar_content::OverlapTensor< T >::OverlapList

Definition at line 145 of file LArOverlapTensor.h.

template<typename T>

typedef std::unordered_map<const pandora::Cluster*, OverlapList> lar_content::OverlapTensor< T >::OverlapMatrix

Definition at line 146 of file LArOverlapTensor.h.

template<typename T>

typedef T lar_content::OverlapTensor< T >::OverlapResult

Definition at line 26 of file LArOverlapTensor.h.

template<typename T>

typedef std::unordered_map<const pandora::Cluster*, OverlapMatrix> lar_content::OverlapTensor< T >::TheTensor

Definition at line 147 of file LArOverlapTensor.h.

Member Function Documentation

template<typename T >

OverlapTensor< T >::const_iterator lar_content::OverlapTensor< T >::begin ( ) const

inline

Returns an iterator referring to the first element in the overlap tensor.

Definition at line 303 of file LArOverlapTensor.h.

References lar_content::OverlapTensor< T >::m_overlapTensor.

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

{
    return m_overlapTensor.begin();
}

template<typename T >

void lar_content::OverlapTensor< T >::Clear ( )

inline

Clear overlap tensor.

Definition at line 387 of file LArOverlapTensor.h.

References lar_content::OverlapTensor< T >::m_clusterNavigationMapUV, lar_content::OverlapTensor< T >::m_clusterNavigationMapVW, lar_content::OverlapTensor< T >::m_clusterNavigationMapWU, and lar_content::OverlapTensor< T >::m_overlapTensor.

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

{
    m_overlapTensor.clear();
    m_clusterNavigationMapUV.clear();
    m_clusterNavigationMapVW.clear();
    m_clusterNavigationMapWU.clear();
}

template<typename T>

bool lar_content::OverlapTensor< T >::DefaultAmbiguityFunction	(	const pandora::ClusterList &	clusterListU,
		const pandora::ClusterList &	clusterListV,
		const pandora::ClusterList &	clusterListW,
		const pandora::Cluster *&	pClusterU,
		const pandora::Cluster *&	pClusterV,
		const pandora::Cluster *&	pClusterW
	)		const

Default ambiguity function, checking that only one U, V and W cluster is found.

Parameters

clusterListU	cluster list U
clusterListV	cluster list V
clusterListW	cluster list W
pClusterU	to receive the address of the unambiguous U cluster
pClusterV	to receive the address of the unambiguous V cluster
pClusterW	to receive the address of the unambiguous W cluster

Returns

boolean

Definition at line 68 of file LArOverlapTensor.cc.

{
    if ((1 != clusterListU.size()) || (1 != clusterListV.size()) || (1 != clusterListW.size()))
        return false;

    pClusterU = *(clusterListU.begin());
    pClusterV = *(clusterListV.begin());
    pClusterW = *(clusterListW.begin());

    return true;
}

template<typename T >

OverlapTensor< T >::const_iterator lar_content::OverlapTensor< T >::end ( ) const

inline

Returns an iterator referring to the past-the-end element in the overlap tensor.

Definition at line 311 of file LArOverlapTensor.h.

References lar_content::OverlapTensor< T >::m_overlapTensor.

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

{
    return m_overlapTensor.end();
}

template<typename T>

void lar_content::OverlapTensor< T >::ExploreConnections ( const pandora::Cluster *const  pCluster, const bool  ignoreUnavailable, pandora::ClusterList &  clusterListU, pandora::ClusterList &  clusterListV, pandora::ClusterList &  clusterListW  ) const

private

Explore connections associated with a given cluster.

Parameters

pCluster	address of the cluster
clusterListU	connected u clusters
clusterListV	connected v clusters
clusterListW	connected w clusters

Definition at line 273 of file LArOverlapTensor.cc.

{
    if (ignoreUnavailable && !pCluster->IsAvailable())
        return;

    const HitType hitType(LArClusterHelper::GetClusterHitType(pCluster));

    if (!((TPC_VIEW_U == hitType) || (TPC_VIEW_V == hitType) || (TPC_VIEW_W == hitType)))
        throw StatusCodeException(STATUS_CODE_FAILURE);

    ClusterList &clusterList((TPC_VIEW_U == hitType) ? clusterListU : (TPC_VIEW_V == hitType) ? clusterListV : clusterListW);
    const ClusterNavigationMap &navigationMap((TPC_VIEW_U == hitType) ? m_clusterNavigationMapUV : (TPC_VIEW_V == hitType) ? m_clusterNavigationMapVW : m_clusterNavigationMapWU);

    if (clusterList.end() != std::find(clusterList.begin(), clusterList.end(), pCluster))
        return;

    clusterList.push_back(pCluster);
    ClusterNavigationMap::const_iterator iter = navigationMap.find(pCluster);

    if (navigationMap.end() == iter)
        throw StatusCodeException(STATUS_CODE_FAILURE);

    for (ClusterList::const_iterator cIter = iter->second.begin(), cIterEnd = iter->second.end(); cIter != cIterEnd; ++cIter)
        this->ExploreConnections(*cIter, ignoreUnavailable, clusterListU, clusterListV, clusterListW);
}

template<typename T >

const OverlapTensor< T >::ClusterNavigationMap & lar_content::OverlapTensor< T >::GetClusterNavigationMapUV ( ) const

inline

Get the cluster navigation map U->V.

Returns

the cluster navigation map U->V

Definition at line 363 of file LArOverlapTensor.h.

References lar_content::OverlapTensor< T >::m_clusterNavigationMapUV.

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

{
    return m_clusterNavigationMapUV;
}

template<typename T >

const OverlapTensor< T >::ClusterNavigationMap & lar_content::OverlapTensor< T >::GetClusterNavigationMapVW ( ) const

inline

Get the cluster navigation map V->W.

Returns

the cluster navigation map V->W

Definition at line 371 of file LArOverlapTensor.h.

References lar_content::OverlapTensor< T >::m_clusterNavigationMapVW.

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

{
    return m_clusterNavigationMapVW;
}

template<typename T >

const OverlapTensor< T >::ClusterNavigationMap & lar_content::OverlapTensor< T >::GetClusterNavigationMapWU ( ) const

inline

Get the cluster navigation map W->U.

Returns

the cluster navigation map W->U

Definition at line 379 of file LArOverlapTensor.h.

References lar_content::OverlapTensor< T >::m_clusterNavigationMapWU.

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

{
    return m_clusterNavigationMapWU;
}

template<typename T >

void lar_content::OverlapTensor< T >::GetConnectedElements ( const pandora::Cluster *const  pCluster, const bool  ignoreUnavailable, ElementList &  elementList  ) const

inline

Get a list of elements connected to a specified cluster.

Parameters

pCluster	address of a cluster
ignoreUnavailable	whether to ignore unavailable clusters
elementList	to receive the connected element list

Definition at line 294 of file LArOverlapTensor.h.

Referenced by lar_content::SimpleShowersTool::FindBestShower(), lar_content::MopUpRemnantsTool::FindBestShowers(), lar_content::ClearShowersTool::FindClearShowers(), lar_content::ConnectedRemnantsTool::FindConnectedShowers(), lar_content::LongTracksTool::FindLongTracks(), lar_content::MatchedEndPointsTool::FindMatchedTracks(), lar_content::MissingTrackTool::FindMissingTracks(), lar_content::SplitShowersTool::FindSplitShowers(), lar_content::TracksCrossingGapsTool::FindTracks(), lar_content::TrackSplittingTool::FindTracks(), lar_content::MissingTrackSegmentTool::FindTracks(), lar_content::ClearTrackFragmentsTool::GetAndCheckElementList(), lar_content::ThreeDKinkBaseTool::GetModifications(), lar_content::OverlapTensor< T >::GetNConnections(), lar_content::TransverseTensorVisualizationTool::Run(), and lar_content::ShowerTensorVisualizationTool::Run().

{
    unsigned int nU(0), nV(0), nW(0);
    this->GetConnectedElements(pCluster, ignoreUnavailable, elementList, nU, nV, nW);
}

template<typename T >

void lar_content::OverlapTensor< T >::GetConnectedElements	(	const pandora::Cluster *const	pCluster,
		const bool	ignoreUnavailable,
		ElementList &	elementList,
		unsigned int &	nU,
		unsigned int &	nV,
		unsigned int &	nW
	)		const

Get a list of elements connected to a specified cluster.

Parameters

pCluster	address of a cluster
ignoreUnavailable	whether to ignore unavailable clusters
elementList	to receive the connected element list
nU	to receive the number of u connections
nV	to receive the number of v connections
nW	to receive the number of w connections

Definition at line 84 of file LArOverlapTensor.cc.

{
    ClusterList clusterListU, clusterListV, clusterListW;
    this->GetConnectedElements(pCluster, ignoreUnavailable, elementList, clusterListU, clusterListV, clusterListW);
    nU = clusterListU.size(); nV = clusterListV.size(); nW = clusterListW.size();
}

template<typename T>

void lar_content::OverlapTensor< T >::GetConnectedElements ( const pandora::Cluster *const  pCluster, const bool  ignoreUnavailable, ElementList &  elementList, pandora::ClusterList &  clusterListU, pandora::ClusterList &  clusterListV, pandora::ClusterList &  clusterListW  ) const

private

Get elements connected to a specified cluster.

Parameters

pCluster	address of the cluster
elementList	the element list
clusterListU	connected u clusters
clusterListV	connected v clusters
clusterListW	connected w clusters

template<typename T >

void lar_content::OverlapTensor< T >::GetNConnections ( const pandora::Cluster *const  pCluster, const bool  ignoreUnavailable, unsigned int &  nU, unsigned int &  nV, unsigned int &  nW  ) const

inline

Get the number of connections for a specified cluster.

Parameters

pCluster	address of a cluster
ignoreUnavailable	whether to ignore unavailable clusters
nU	to receive the number of u connections
nV	to receive the number of v connections
nW	to receive the number of w connections

Definition at line 284 of file LArOverlapTensor.h.

References lar_content::OverlapTensor< T >::GetConnectedElements().

{
    ElementList elementList;
    this->GetConnectedElements(pCluster, ignoreUnavailable, elementList, nU, nV, nW);
}

template<typename T >

const OverlapTensor< T >::OverlapList & lar_content::OverlapTensor< T >::GetOverlapList ( const pandora::Cluster *const  pClusterU, const pandora::Cluster *const  pClusterV  ) const

inline

Get the overlap list for a specified pair of clusters.

Parameters

pClusterU	address of cluster u
pClusterV	address of cluster v

Returns

the cluster overlap list

Definition at line 334 of file LArOverlapTensor.h.

References lar_content::OverlapTensor< T >::GetOverlapMatrix().

Referenced by lar_content::OverlapTensor< T >::GetOverlapResult().

{
    const OverlapMatrix &overlapMatrix(this->GetOverlapMatrix(pClusterU));
    typename OverlapMatrix::const_iterator iter = overlapMatrix.find(pClusterV);

    if (overlapMatrix.end() == iter)
        throw pandora::StatusCodeException(pandora::STATUS_CODE_NOT_FOUND);

    return iter->second;
}

template<typename T >

const OverlapTensor< T >::OverlapMatrix & lar_content::OverlapTensor< T >::GetOverlapMatrix ( const pandora::Cluster *const  pClusterU ) const

inline

Get the cluster overlap matrix for a specified cluster.

Parameters

pClusterU

address of cluster u

Returns

the cluster overlap matrix

Definition at line 349 of file LArOverlapTensor.h.

References lar_content::OverlapTensor< T >::m_overlapTensor.

Referenced by lar_content::OverlapTensor< T >::GetOverlapList().

{
    typename TheTensor::const_iterator iter = m_overlapTensor.find(pClusterU);

    if (m_overlapTensor.end() == iter)
        throw pandora::StatusCodeException(pandora::STATUS_CODE_NOT_FOUND);

    return iter->second;
}

template<typename T >

const OverlapTensor< T >::OverlapResult & lar_content::OverlapTensor< T >::GetOverlapResult ( const pandora::Cluster *const  pClusterU, const pandora::Cluster *const  pClusterV, const pandora::Cluster *const  pClusterW  ) const

inline

Get the overlap result for a specified trio of clusters.

Parameters

pClusterU	address of cluster u
pClusterV	address of cluster v
pClusterW	address of cluster w

Returns

the address of the overlap result

Definition at line 319 of file LArOverlapTensor.h.

References lar_content::OverlapTensor< T >::GetOverlapList().

Referenced by lar_content::ThreeDTrackFragmentsAlgorithm::PerformMainLoop().

{
    const OverlapList &overlapList(this->GetOverlapList(pClusterU, pClusterV));
    typename OverlapList::const_iterator iter = overlapList.find(pClusterW);

    if (overlapList.end() == iter)
        throw pandora::StatusCodeException(pandora::STATUS_CODE_NOT_FOUND);

    return iter->second;
}

template<typename T>

void lar_content::OverlapTensor< T >::GetSortedKeyClusters

(

pandora::ClusterVector &

sortedKeyClusters

)

const

Get a sorted vector of key clusters (U clusters with current implementation)

Parameters

sortedKeyClusters

to receive the sorted vector of key clusters

Definition at line 95 of file LArOverlapTensor.cc.

References evd::details::begin(), and evd::details::end().

Referenced by lar_content::SimpleShowersTool::FindBestShower(), lar_content::MopUpRemnantsTool::FindBestShowers(), lar_content::ClearShowersTool::FindClearShowers(), lar_content::ConnectedRemnantsTool::FindConnectedShowers(), lar_content::LongTracksTool::FindLongTracks(), lar_content::MatchedEndPointsTool::FindMatchedTracks(), lar_content::MissingTrackTool::FindMissingTracks(), lar_content::SplitShowersTool::FindSplitShowers(), lar_content::ClearTrackFragmentsTool::FindTrackFragments(), lar_content::TracksCrossingGapsTool::FindTracks(), lar_content::TrackSplittingTool::FindTracks(), lar_content::MissingTrackSegmentTool::FindTracks(), lar_content::ThreeDKinkBaseTool::GetModifications(), lar_content::ShowerTensorVisualizationTool::Run(), and lar_content::TransverseTensorVisualizationTool::Run().

{
    for (typename TheTensor::const_iterator iterU = this->begin(), iterUEnd = this->end(); iterU != iterUEnd; ++iterU)
        sortedKeyClusters.push_back(iterU->first);

    std::sort(sortedKeyClusters.begin(), sortedKeyClusters.end(), LArClusterHelper::SortByNHits);
}

template<typename T >

void lar_content::OverlapTensor< T >::GetUnambiguousElements	(	const bool	ignoreUnavailable,
		ElementList &	elementList
	)		const

Get unambiguous elements.

Parameters

ignoreUnavailable	whether to ignore unavailable clusters
elementList	to receive the unambiguous element list

Definition at line 31 of file LArOverlapTensor.cc.

References evd::details::begin(), and evd::details::end().

Referenced by lar_content::ClearRemnantsTool::Run(), lar_content::ClearTracksTool::Run(), and lar_content::ClearLongitudinalTracksTool::Run().

{
    for (typename TheTensor::const_iterator iterU = this->begin(), iterUEnd = this->end(); iterU != iterUEnd; ++iterU)
    {
        ElementList tempElementList;
        ClusterList clusterListU, clusterListV, clusterListW;
        this->GetConnectedElements(iterU->first, ignoreUnavailable, tempElementList, clusterListU, clusterListV, clusterListW);

        const Cluster *pClusterU(NULL), *pClusterV(NULL), *pClusterW(NULL);
        if (!this->DefaultAmbiguityFunction(clusterListU, clusterListV, clusterListW, pClusterU, pClusterV, pClusterW))
            continue;

        // ATTN With HIT_CUSTOM definitions, it is possible to navigate from different U clusters to same combination
        if (iterU->first != pClusterU)
            continue;

        if ((NULL == pClusterU) || (NULL == pClusterV) || (NULL == pClusterW))
            continue;

        typename OverlapMatrix::const_iterator iterV = iterU->second.find(pClusterV);
        if (iterU->second.end() == iterV)
            throw StatusCodeException(STATUS_CODE_FAILURE);

        typename OverlapList::const_iterator iterW = iterV->second.find(pClusterW);
        if (iterV->second.end() == iterW)
            throw StatusCodeException(STATUS_CODE_FAILURE);

        Element element(pClusterU, pClusterV, pClusterW, iterW->second);
        elementList.push_back(element);
    }

    std::sort(elementList.begin(), elementList.end());
}

template<typename T >

void lar_content::OverlapTensor< T >::RemoveCluster

(

const pandora::Cluster *const

pCluster

)

Remove entries from tensor corresponding to specified cluster.

Parameters

pCluster

address of the cluster

Definition at line 154 of file LArOverlapTensor.cc.

References evd::details::begin(), and evd::details::end().

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

{
    ClusterList additionalRemovals;

    if (m_clusterNavigationMapUV.erase(pCluster) > 0)
    {
        typename TheTensor::iterator iter = m_overlapTensor.find(pCluster);

        if (m_overlapTensor.end() != iter)
            m_overlapTensor.erase(iter);

        for (ClusterNavigationMap::iterator navIter = m_clusterNavigationMapWU.begin(); navIter != m_clusterNavigationMapWU.end(); )
        {
            ClusterNavigationMap::iterator thisIter = navIter++;
            ClusterList::iterator listIter = std::find(thisIter->second.begin(), thisIter->second.end(), pCluster);

            if (thisIter->second.end() != listIter)
                thisIter->second.erase(listIter);

            if (thisIter->second.empty())
                additionalRemovals.push_back(thisIter->first);
        }
    }

    if (m_clusterNavigationMapVW.erase(pCluster) > 0)
    {
        for (typename TheTensor::iterator iterU = m_overlapTensor.begin(), iterUEnd = m_overlapTensor.end(); iterU != iterUEnd; ++iterU)
        {
            typename OverlapMatrix::iterator iter = iterU->second.find(pCluster);

            if (iterU->second.end() != iter)
                iterU->second.erase(iter);
        }

        for (ClusterNavigationMap::iterator navIter = m_clusterNavigationMapUV.begin(); navIter != m_clusterNavigationMapUV.end(); )
        {
            ClusterNavigationMap::iterator thisIter = navIter++;
            ClusterList::iterator listIter = std::find(thisIter->second.begin(), thisIter->second.end(), pCluster);

            if (thisIter->second.end() != listIter)
                thisIter->second.erase(listIter);

            if (thisIter->second.empty())
                additionalRemovals.push_back(thisIter->first);
        }
    }

    if (m_clusterNavigationMapWU.erase(pCluster) > 0)
    {
        for (typename TheTensor::iterator iterU = m_overlapTensor.begin(), iterUEnd = m_overlapTensor.end(); iterU != iterUEnd; ++iterU)
        {
            for (typename OverlapMatrix::iterator iterV = iterU->second.begin(), iterVEnd = iterU->second.end(); iterV != iterVEnd; ++iterV)
            {
                typename OverlapList::iterator iter = iterV->second.find(pCluster);

                if (iterV->second.end() != iter)
                    iterV->second.erase(iter);
            }
        }

        for (ClusterNavigationMap::iterator navIter = m_clusterNavigationMapVW.begin(); navIter != m_clusterNavigationMapVW.end(); )
        {
            ClusterNavigationMap::iterator thisIter = navIter++;
            ClusterList::iterator listIter = std::find(thisIter->second.begin(), thisIter->second.end(), pCluster);

            if (thisIter->second.end() != listIter)
                thisIter->second.erase(listIter);

            if (thisIter->second.empty())
                additionalRemovals.push_back(thisIter->first);
        }
    }

    additionalRemovals.sort(LArClusterHelper::SortByNHits);

    for (ClusterList::const_iterator iter = additionalRemovals.begin(), iterEnd = additionalRemovals.end(); iter != iterEnd; ++iter)
        this->RemoveCluster(*iter);
}

template<typename T >

void lar_content::OverlapTensor< T >::ReplaceOverlapResult	(	const pandora::Cluster *const	pClusterU,
		const pandora::Cluster *const	pClusterV,
		const pandora::Cluster *const	pClusterW,
		const OverlapResult &	overlapResult
	)

SetReplace an existing overlap result.

Parameters

pClusterU	address of cluster u
pClusterV	address of cluster v
pClusterW	address of cluster w
overlapResult	the overlap result

Definition at line 130 of file LArOverlapTensor.cc.

Referenced by lar_content::ThreeDTrackFragmentsAlgorithm::PerformMainLoop().

{
    typename TheTensor::iterator iterU = m_overlapTensor.find(pClusterU);

    if (m_overlapTensor.end() == iterU)
        throw pandora::StatusCodeException(pandora::STATUS_CODE_INVALID_PARAMETER);

    typename OverlapMatrix::iterator iterV = iterU->second.find(pClusterV);

    if (iterU->second.end() == iterV)
        throw pandora::StatusCodeException(pandora::STATUS_CODE_INVALID_PARAMETER);

    typename OverlapList::iterator iterW = iterV->second.find(pClusterW);

    if (iterV->second.end() == iterW)
        throw pandora::StatusCodeException(pandora::STATUS_CODE_INVALID_PARAMETER);

    iterW->second = overlapResult;
}

template<typename T >

void lar_content::OverlapTensor< T >::SetOverlapResult	(	const pandora::Cluster *const	pClusterU,
		const pandora::Cluster *const	pClusterV,
		const pandora::Cluster *const	pClusterW,
		const OverlapResult &	overlapResult
	)

Set overlap result.

Parameters

pClusterU	address of cluster u
pClusterV	address of cluster v
pClusterW	address of cluster w
overlapResult	the overlap result

Definition at line 106 of file LArOverlapTensor.cc.

Referenced by lar_content::ThreeDRemnantsAlgorithm::CalculateOverlapResult(), lar_content::ThreeDTrackFragmentsAlgorithm::PerformMainLoop(), lar_content::ThreeDShowersAlgorithm::RemoveFromSlidingFitCache(), lar_content::ThreeDLongitudinalTracksAlgorithm::ThreeDLongitudinalTracksAlgorithm(), and lar_content::ThreeDTransverseTracksAlgorithm::ThreeDTransverseTracksAlgorithm().

{
    OverlapList &overlapList = m_overlapTensor[pClusterU][pClusterV];
    typename OverlapList::const_iterator iter = overlapList.find(pClusterW);

    if (overlapList.end() != iter)
        throw pandora::StatusCodeException(pandora::STATUS_CODE_ALREADY_PRESENT);

    if (!overlapList.insert(typename OverlapList::value_type(pClusterW, overlapResult)).second)
        throw pandora::StatusCodeException(pandora::STATUS_CODE_FAILURE);

    ClusterList &navigationUV(m_clusterNavigationMapUV[pClusterU]);
    ClusterList &navigationVW(m_clusterNavigationMapVW[pClusterV]);
    ClusterList &navigationWU(m_clusterNavigationMapWU[pClusterW]);

    if (navigationUV.end() == std::find(navigationUV.begin(), navigationUV.end(), pClusterV)) navigationUV.push_back(pClusterV);
    if (navigationVW.end() == std::find(navigationVW.begin(), navigationVW.end(), pClusterW)) navigationVW.push_back(pClusterW);
    if (navigationWU.end() == std::find(navigationWU.begin(), navigationWU.end(), pClusterU)) navigationWU.push_back(pClusterU);
}

Member Data Documentation

template<typename T>

ClusterNavigationMap lar_content::OverlapTensor< T >::m_clusterNavigationMapUV

private

The cluster navigation map U->V.

Definition at line 276 of file LArOverlapTensor.h.

Referenced by lar_content::OverlapTensor< T >::Clear(), and lar_content::OverlapTensor< T >::GetClusterNavigationMapUV().

template<typename T>

ClusterNavigationMap lar_content::OverlapTensor< T >::m_clusterNavigationMapVW

private

The cluster navigation map V->W.

Definition at line 277 of file LArOverlapTensor.h.

Referenced by lar_content::OverlapTensor< T >::Clear(), and lar_content::OverlapTensor< T >::GetClusterNavigationMapVW().

template<typename T>

ClusterNavigationMap lar_content::OverlapTensor< T >::m_clusterNavigationMapWU

private

The cluster navigation map W->U.

Definition at line 278 of file LArOverlapTensor.h.

Referenced by lar_content::OverlapTensor< T >::Clear(), and lar_content::OverlapTensor< T >::GetClusterNavigationMapWU().

template<typename T>

TheTensor lar_content::OverlapTensor< T >::m_overlapTensor

private

The overlap tensor.

Definition at line 275 of file LArOverlapTensor.h.

Referenced by lar_content::OverlapTensor< T >::begin(), lar_content::OverlapTensor< T >::Clear(), lar_content::OverlapTensor< T >::end(), and lar_content::OverlapTensor< T >::GetOverlapMatrix().

---

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

• /cvmfs/larsoft.opensciencegrid.org/products/larpandoracontent/v03_14_03/source/larpandoracontent/LArObjects/LArOverlapTensor.h
• /cvmfs/larsoft.opensciencegrid.org/products/larpandoracontent/v03_14_03/source/larpandoracontent/LArObjects/LArOverlapTensor.cc