dqm_algorithms::BasicGraphCheck Struct Reference

#include <BasicGraphCheck.h>

Inheritance diagram for dqm_algorithms::BasicGraphCheck:

Collaboration diagram for dqm_algorithms::BasicGraphCheck:

Public Member Functions
	BasicGraphCheck (const std::string &name)
BasicGraphCheck *	clone ()
dqm_core::Result *	execute (const std::string &, const TObject &, const dqm_core::AlgorithmConfig &)
void	printDescription (std::ostream &out)

Private Attributes
std::string	m_name

Detailed Description

Definition at line 18 of file BasicGraphCheck.h.

Constructor & Destructor Documentation

BasicGraphCheck()

dqm_algorithms::BasicGraphCheck::BasicGraphCheck

(

const std::string &

name

)

Definition at line 26 of file BasicGraphCheck.cxx.

  : m_name( name )
{
  dqm_core::AlgorithmManager::instance().registerAlgorithm(name, this);
}

Member Function Documentation

clone()

dqm_algorithms::BasicGraphCheck * dqm_algorithms::BasicGraphCheck::clone

(

)

Definition at line 33 of file BasicGraphCheck.cxx.

{
  
  return new BasicGraphCheck( m_name );
}

execute()

dqm_core::Result * dqm_algorithms::BasicGraphCheck::execute	(	const std::string &	name,
		const TObject &	object,
		const dqm_core::AlgorithmConfig &	config )

Definition at line 41 of file BasicGraphCheck.cxx.

{  
  const TGraph * graph;
  
  if( object.IsA()->InheritsFrom( "TGraph" ) ) {
    graph = static_cast<const TGraph*>(&object);
  } else {
    throw dqm_core::BadConfig( ERS_HERE, name, "does not inherit from TGraph" );
  }
 
  double minstat = dqm_algorithms::tools::GetFirstFromMap( "MinStat", config.getParameters(), -1 );
  
  if (graph->GetN() < minstat ) {
    dqm_core::Result *result = new dqm_core::Result(dqm_core::Result::Undefined);
    result->tags_["InsufficientN"] = graph->GetN();
    return result;
  }
  
  if (m_name == "Graph_Not_Empty") {
    if (graph->GetN() != 0) {
      ERS_DEBUG(1, "Graph " <<graph->GetName()<<" is Not Empty");
      return new dqm_core::Result(dqm_core::Result::Green);
    }else {
      ERS_DEBUG(1, "Graph " <<graph->GetName()<<" is Empty");
      return new dqm_core::Result(dqm_core::Result::Red);
    }
  } else if (m_name == "Graph_Empty") {
    if (graph->GetN() == 0) {
      ERS_DEBUG(1, "Graph " <<graph->GetName()<<" is Empty");
      return new dqm_core::Result(dqm_core::Result::Green);
    }else {
      ERS_DEBUG(1, "Graph " <<graph->GetName()<<" is Not Empty");
      return new dqm_core::Result(dqm_core::Result::Red);
    }
  } else {
    return new dqm_core::Result();
  }
  
  
}

printDescription()

void dqm_algorithms::BasicGraphCheck::printDescription

(

std::ostream &

out

)

Definition at line 85 of file BasicGraphCheck.cxx.

{
  if ( m_name == "Graph_Not_Empty"){
    out<<"Graph_Not_Empty: Checks that graph is not empty\n"<<std::endl;
  } else if ( m_name == "Graph_Empty"){
    out<<"Graph_Empty: Checks that graph is empty\n"<<std::endl;
  }
  
  out<<"Optional Parameter: MinStat: Minimum graph statistics needed to perform Algorithm\n"<<std::endl;
}

Member Data Documentation

m_name

std::string dqm_algorithms::BasicGraphCheck::m_name

private

Definition at line 29 of file BasicGraphCheck.h.

---

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

• BasicGraphCheck.h
• BasicGraphCheck.cxx