contains all relevant stuff needed for dealing with a subGraph. More...

#include <SubGraph.h>

Collaboration diagram for SubGraph< FilterType >:

[legend]

Public Types
using	Iterator = typename std::unordered_map< FilterType, MinMax >::iterator
	for better readability.

Public Member Functions
bool	operator== (const SubGraph< FilterType > &b) const
	overloaded '=='-operator

	SubGraph (SubGraphID &id, const std::vector< FilterType > &fIDs)
	constructor, mandatory iDChain musst at least contain one iD.

	~SubGraph ()
	destructor

bool	checkAndReplaceIfMinMax (FilterType fID, double value)
	add filter, if not added yet, checks value and replaces old ones if new one is better. More...

void	wasFound ()
	increases found-counter.

unsigned	getFound () const
	returns found-counter.

bool	checkSharesTrunk (const SubGraph< FilterType > &b) const
	if both graphs have got the same IDs except the last one, they share a trunk.

std::string	print () const
	"print" debugging information to a string

const SubGraphID &	getID () const
	returns iD of this graph

void	prepareDataCollection (std::pair< double, double > quantiles)
	takes care of being able to use the data collector. please use for quantiles [min, max] min ~0 & max ~1 (range 0-1)

void	addValue (FilterType fID, double value)
	adds value to rawDataCollector

const std::unordered_map< FilterType, MinMax > &	getFinalQuantileValues ()
	this deletes the old min and max values stored and replaces them with the quantiles to be found.

unsigned	idCheckAndUpdate (const std::vector< unsigned > &ids)
	for given vector of ids check if any of them is part of subGraphID. If yes, update their SubLayerID. returns number of updated secIDs

std::vector< FullSecID >	getSectorsOfSensor (const VxdID &sensor)
	returns vector containing all sectors for given sensor (if any) and empty vector if no sector of that sensor is here.

Protected Member Functions
void	updateID (const SubGraphID &newID)
	set newID for this subgraph.

Protected Attributes
SubGraphID	m_id
	contains the IDs in the correct order (from outer to inner) as a unique identifier for this graph.

std::unordered_map< FilterType, MinMax >	m_minMaxValues
	contains all min- and max-values found so far for all filters relevant for this Graph. *‍/

unsigned	m_found
	counts number of times this subgraph was found.

std::unordered_map< FilterType, RawDataCollectedMinMax > *	m_rawDataCollected
	takes care of collecting the raw data.

Detailed Description

template<class FilterType>
class Belle2::SubGraph< FilterType >

contains all relevant stuff needed for dealing with a subGraph.

~ 404 bytes per subGraph.

Definition at line 30 of file SubGraph.h.

Member Function Documentation

◆ checkAndReplaceIfMinMax()

bool checkAndReplaceIfMinMax	(	FilterType	fID,
		double	value
	)

inline

add filter, if not added yet, checks value and replaces old ones if new one is better.

returns true if minMax was updated.

Definition at line 65 of file SubGraph.h.

     {
       Iterator pos = m_minMaxValues.find(fID);
       if (pos == m_minMaxValues.end()) {
         B2WARNING("FilterID " << fID << " not known to this subgraph " << m_id.print() << " - nothing added!");
         return false;
       }
       return pos->second.checkAndReplaceIfMinMax(value);
     }

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

tracking/trackFindingVXD/sectorMapTools/include/SubGraph.h

Public Types

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

template<class FilterType> class Belle2::SubGraph< FilterType >

Member Function Documentation

◆ checkAndReplaceIfMinMax()

template<class FilterType>
class Belle2::SubGraph< FilterType >