CBTree Class Reference

#include <CBTree.h>

Collaboration diagram for CBTree:

Public Types
typedef std::set< CBNode *, CBNode::nodeOrder >	nodeSet
typedef IOVSvcCallBackFcn	BFCN

Public Member Functions
	CBTree ()
	~CBTree ()
	CBTree (const CBTree &)=delete
CBTree &	operator= (const CBTree &)=delete
CBNode *	addNode (const std::string &name, CBNode *parent)
CBNode *	addNode (const SG::DataProxy *proxy, const std::string &name)
CBNode *	addNode (BFCN *fcn, const CallBackID &cb, const SG::DataProxy *parent_proxy)
CBNode *	addNode (BFCN *fcn, const CallBackID &cb, BFCN *parent_fcn)
CBNode *	replaceProxy (const SG::DataProxy *pOld, const SG::DataProxy *pNew)
void	connectNode (CBNode *node, CBNode *parent)
void	connectNode (const std::string &name, CBNode *parent)
CBNode *	findNode (const std::string &name)
CBNode *	findNode (const std::string &name, CBNode *start)
CBNode *	findNode (const SG::DataProxy *proxy)
CBNode *	findNode (const SG::DataProxy *proxy, CBNode *start)
CBNode *	findNode (BFCN *fcn)
CBNode *	findNode (BFCN *fcn, CBNode *start)
bool	delNode (const SG::DataProxy *prx)
void	printTree () const
void	printTree (const CBNode *start) const
int	maxLevel () const
void	adjustLevels (CBNode *start)
void	listNodes () const
void	listNodes (const int &level, nodeSet::const_iterator &start, nodeSet::const_iterator &end) const
void	cascadeTrigger (const bool b, CBNode *start)
void	cascadeTrigger (const bool b, BFCN *fcn)
void	cascadeTrigger (const bool b, const SG::DataProxy *proxy)
void	clearTrigger () const
void	cascadeFlag (const bool b, CBNode *node) const
void	clearFlag () const
void	traverse (void(*pF)(const CBNode *)) const
void	traverse (const CBNode *, void(*pF)(const CBNode *)) const
void	traverseR (const CBNode *, void(*pF)(const CBNode *)) const
const CBNode *	traverse (const CBNode *(*pF)(const CBNode *)) const
const CBNode *	traverse (const CBNode *, const CBNode *(*pF)(const CBNode *)) const
const CBNode *	traverseR (const CBNode *, const CBNode *(*pF)(const CBNode *)) const
void	traverse (void(*pF)(const CBNode *, const CBNode *)) const
void	traverse (const CBNode *, const CBNode *, void(*pF)(const CBNode *, const CBNode *)) const
void	traverseR (const CBNode *, const CBNode *, void(*pF)(const CBNode *, const CBNode *)) const

Static Private Member Functions
static void	_printTree (const CBNode *, const CBNode *)

Private Attributes
CBNode *	m_root
nodeSet	m_allNodes

Detailed Description

Definition at line 30 of file CBTree.h.

Member Typedef Documentation

BFCN

typedef IOVSvcCallBackFcn CBTree::BFCN

Definition at line 34 of file CBTree.h.

nodeSet

typedef std::set<CBNode*, CBNode::nodeOrder> CBTree::nodeSet

Definition at line 33 of file CBTree.h.

Constructor & Destructor Documentation

CBTree() [1/2]

CBTree::CBTree

(

)

Definition at line 28 of file CBTree.cxx.

               {
  m_root = new CBNode("root",0);
  m_allNodes.insert( m_root );
}

~CBTree()

CBTree::~CBTree

(

)

Definition at line 35 of file CBTree.cxx.

                {
  for(std::set<CBNode*>::iterator itr=m_allNodes.begin();
      itr != m_allNodes.end(); ++itr) {
    delete *itr;
  }
}

CBTree() [2/2]

CBTree::CBTree ( const CBTree & )

delete

Member Function Documentation

_printTree()

void CBTree::_printTree ( const CBNode * current, const CBNode * parent )

staticprivate

Definition at line 294 of file CBTree.cxx.

                                                                     {
  std::string np;
  int lp;
  if (parent == 0) {
    np = "";
    lp = 0;
  } else {
    np = parent->name();
    lp = parent->level();
  }
    
  for (int i=0; i<lp; ++i) {
    cout << "  ";
  }
 
  for (int i=0; i<(current->level()-lp); ++i) {
    if ( i == 0 ) {
      //      cout << "␕␒";
      cout << "+-";
    } else {
      //      cout << "␒␒";
      cout << "--";
    }
  }
 
  if (current->trigger()) {
    cout << "␛[93;1m" << current->name() << "␛[m";
  } else {
    cout << current->name();
  }
  cout << endl;
  
} 

addNode() [1/4]

CBNode * CBTree::addNode	(	BFCN *	fcn,
		const CallBackID &	cb,
		BFCN *	parent_fcn )

Definition at line 96 of file CBTree.cxx.

                                                                         {
 
  CBNode* parent = findNode(parent_fcn);
 
  if (parent == 0) {
    cout << "ERROR: no parent function found in tree for " << parent_fcn
         << endl;
    return 0;
  }
 
  CBNode* n = new CBNode(fcn, cb, parent);
 
  m_allNodes.insert( n );
 
  return n;
}

addNode() [2/4]

CBNode * CBTree::addNode	(	BFCN *	fcn,
		const CallBackID &	cb,
		const SG::DataProxy *	parent_proxy )

Definition at line 77 of file CBTree.cxx.

                                                  {
 
  CBNode* parent = findNode(proxy);
 
  if (parent == 0) {
    cout << "ERROR: no parent proxy found in tree for " << proxy->name()
         << endl;
    return 0;
  }
 
  CBNode* n = new CBNode(fcn, cb, parent);
 
  m_allNodes.insert( n );
 
  return n;
}

addNode() [3/4]

CBNode * CBTree::addNode	(	const SG::DataProxy *	proxy,
		const std::string &	name )

Definition at line 44 of file CBTree.cxx.

                                                                       {
 
  CBNode* n = new CBNode(proxy, name, m_root);
 
  m_allNodes.insert( n );
 
  return n;
}

addNode() [4/4]

CBNode * CBTree::addNode	(	const std::string &	name,
		CBNode *	parent )

Definition at line 65 of file CBTree.cxx.

                                                             {
  if (parent == 0) {
    parent = m_root;
  }
  CBNode* n = new CBNode(name, parent);
 
  m_allNodes.insert( n );
 
  return n;
}

adjustLevels()

void CBTree::adjustLevels

(

CBNode *

start

)

Definition at line 452 of file CBTree.cxx.

                                       {
  
  int level = start->level();
 
  std::set<CBNode*>::iterator citr = start->children().begin();
  for (;citr != start->children().end(); ++citr) {
    m_allNodes.erase( m_allNodes.find( *citr ) );
    (*citr)->setLevel( level+1 );
    m_allNodes.insert( *citr );
    adjustLevels( *citr );
  }
}

cascadeFlag()

void CBTree::cascadeFlag	(	const bool	b,
		CBNode *	node ) const

Definition at line 428 of file CBTree.cxx.

                                                          {
  if (start == 0) {
    start = m_root;
  }
 
  start->setFlag(b);
 
  for (CBNode* child : start->children()) {
    cascadeFlag(b, child);
  }
}

cascadeTrigger() [1/3]

void CBTree::cascadeTrigger	(	const bool	b,
		BFCN *	fcn )

Definition at line 389 of file CBTree.cxx.

                                                   {
 
  CBNode* start = findNode(fcn);
  if (start == 0) {
    cout << "ERROR cascading trigger from fcn: " << fcn << endl;
    return;
  }
 
  cascadeTrigger(b, start);
 
}

cascadeTrigger() [2/3]

void CBTree::cascadeTrigger	(	const bool	b,
		CBNode *	start )

Definition at line 374 of file CBTree.cxx.

                                                       {
  if (start == 0) {
    start = m_root;
  }
 
  start->setTrigger(b);
 
  std::set<CBNode*>::iterator citr = start->children().begin();
  for (;citr!=start->children().end(); ++citr) {
    cascadeTrigger(b, *citr);
  }
}

cascadeTrigger() [3/3]

void CBTree::cascadeTrigger	(	const bool	b,
		const SG::DataProxy *	proxy )

Definition at line 403 of file CBTree.cxx.

                                                                  {
 
  CBNode* start = findNode(proxy);
  if (start == 0) {
    cout << "ERROR cascading trigger from proxy: " << proxy->name() << endl;
    return;
  }
 
  cascadeTrigger(b, start);
 
}

clearFlag()

void CBTree::clearFlag

(

)

const

Definition at line 442 of file CBTree.cxx.

                             {
  nodeSet::const_iterator itr;
  for (itr=m_allNodes.begin(); itr != m_allNodes.end(); ++itr) {
    (*itr)->setFlag(false);
  }
}

clearTrigger()

void CBTree::clearTrigger

(

)

const

Definition at line 417 of file CBTree.cxx.

                                {
 
  nodeSet::const_iterator itr;
  for (itr=m_allNodes.begin(); itr != m_allNodes.end(); ++itr) {
    (*itr)->setTrigger(false);
  }
 
}

connectNode() [1/2]

void CBTree::connectNode	(	CBNode *	node,
		CBNode *	parent )

Definition at line 144 of file CBTree.cxx.

                                                     {
 
  // check to see if we're creating a loop
  cascadeFlag(true, node);
  if (parent->flag()) {
    cout << "ERROR: cannot connect " << node->name() << " to "
         << parent->name() << " as a loop would be formed"
         << endl;
    return;
  }
  clearFlag();
 
  node->addParent( parent );
  parent->addChild( node );
  if (node->level() < (parent->level() + 1)) {
    // we need to erase it first and then reinsert it as the ordering
    // critereon has changed. Do this for all children too.
    m_allNodes.erase( m_allNodes.find( node ) );
    node->setLevel( parent->level() + 1);
    m_allNodes.insert( node );
 
    adjustLevels( node );
 
  }
}

connectNode() [2/2]

void CBTree::connectNode	(	const std::string &	name,
		CBNode *	parent )

Definition at line 172 of file CBTree.cxx.

                                                              {
  CBNode* n = findNode(name);
  if (n == 0) {
    addNode(name,parent);
  } else {
    connectNode(n, parent);
  }
}

delNode()

bool CBTree::delNode

(

const SG::DataProxy *

prx

)

Definition at line 114 of file CBTree.cxx.

                                           {
  CBNode *n = findNode(prx);
  if (n == 0) {
    cout << "ERROR: no node with DataProxy " << prx->name() << " found in tree"
         << endl;
    return false;
  }
  
  bool b(true);
  for ( auto p : n->parents() ) {
    if (!p->delChild( n )) {
      cout << "ERROR: CBTree::delNode : unable to delete child " 
           << n->name() << " from parent " << p->name() << endl;
      b = false;
    }
  }
  
  for (auto c : n->children()) {
    if (!c->delParent( n )) {
      cout << "ERROR: CBTree::delNode : unable to delete parent " 
           << n->name() << " from child " << c->name() << endl;
      b = false;
    }
  }
  
  return b;
}

findNode() [1/6]

CBNode * CBTree::findNode

(

BFCN *

fcn

)

Definition at line 211 of file CBTree.cxx.

                                  {
  return findNode(fcn, m_root);
}

findNode() [2/6]

CBNode * CBTree::findNode	(	BFCN *	fcn,
		CBNode *	start )

Definition at line 217 of file CBTree.cxx.

                                                 {
 
  if (start->fcn() == fcn) {
    return start;
  } else {
 
    CBNode *c;
    std::set<CBNode*>::const_iterator citr = start->children().begin();
    for (; citr != start->children().end(); ++citr) {
      c = findNode(fcn,*citr);
      if (c != 0) {
        return c;
      }
    }
  }
 
  return 0;
}

findNode() [3/6]

CBNode * CBTree::findNode

(

const SG::DataProxy *

proxy

)

Definition at line 183 of file CBTree.cxx.

                                                 {
 
  return findNode(proxy, m_root);
 
}

findNode() [4/6]

CBNode * CBTree::findNode	(	const SG::DataProxy *	proxy,
		CBNode *	start )

Definition at line 191 of file CBTree.cxx.

                                                                {
 
  if ( start->proxy() == proxy ) {
    return start;
  } else {
 
    for ( auto c : start->children() ) {
      c = findNode(proxy, c);
      if (c != 0) {
        return c;
      }
    }
  }
 
  return 0;
  
}

findNode() [5/6]

CBNode * CBTree::findNode

(

const std::string &

name

)

Definition at line 238 of file CBTree.cxx.

                                              {
  return findNode(name, m_root);
}

findNode() [6/6]

CBNode * CBTree::findNode	(	const std::string &	name,
		CBNode *	start )

Definition at line 244 of file CBTree.cxx.

                                                             {
 
  if (start->name() == name) {
    return start;
  } else {
 
    CBNode *c;
    std::set<CBNode*>::const_iterator citr = start->children().begin();
    for (; citr != start->children().end(); ++citr) {
      c = findNode(name,*citr);
      if (c != 0) {
        return c;
      }
    }
  }
 
  return 0;
}

listNodes() [1/2]

void CBTree::listNodes

(

)

const

Definition at line 337 of file CBTree.cxx.

                             {
  nodeSet::const_iterator citr = m_allNodes.begin();
  for (; citr != m_allNodes.end(); ++citr) {
    cout << (*citr)->name()  << "  " << *citr << "  " << (*citr)->level() 
         << "  " << (*citr)->trigger() << endl;
  }
}

listNodes() [2/2]

void CBTree::listNodes	(	const int &	level,
		nodeSet::const_iterator &	start,
		nodeSet::const_iterator &	end ) const

Definition at line 347 of file CBTree.cxx.

                                                         {
 
  bool s = false;
 
  start = m_allNodes.end();
  end = m_allNodes.end();
 
  nodeSet::const_iterator citr = m_allNodes.begin();
  for (; citr != m_allNodes.end(); ++citr) {
    if (!s && (*citr)->level() == level) {
      s = true;
      start = citr;
    }
 
    if (s && (*citr)->level() != level) {
      end = citr;
      break;
    }
  }
 
  return;
}

maxLevel()

int CBTree::maxLevel

(

)

const

Definition at line 329 of file CBTree.cxx.

                           {
  nodeSet::const_iterator itr = m_allNodes.end();
  --itr;
  return (*itr)->level();
}

operator=()

CBTree & CBTree::operator= ( const CBTree & )

delete

printTree() [1/2]

void CBTree::printTree

(

)

const

Definition at line 265 of file CBTree.cxx.

                             {
  cout << "total entries: " << m_allNodes.size() << "  max levels: "
       << maxLevel() << endl;
  traverse( m_root, 0, &CBTree::_printTree );
}

printTree() [2/2]

void CBTree::printTree

(

const CBNode *

start

)

const

Definition at line 273 of file CBTree.cxx.

                                                  {
 
  for (int i=0; i<start->level(); ++i) {
    cout << "  ";
  }
 
  if (start->trigger()) {
    cout << "␛[93;1m";
  }
  cout << start->name();
  if (start->trigger()) {
    cout << "␛[m";
  }
  cout << endl;
 
  for (const CBNode* child : start->children()) {
    printTree( child );
  }
 
}

replaceProxy()

CBNode * CBTree::replaceProxy	(	const SG::DataProxy *	pOld,
		const SG::DataProxy *	pNew )

Definition at line 55 of file CBTree.cxx.

                                                                             {
  assert (0 != pOld);
  assert (0 != pNew);
  CBNode* n(findNode(pOld));
  if (0 != n) n->setProxy(pNew);
  return n;
}

traverse() [1/6]

const CBNode * CBTree::traverse

(

const CBNode *(*

pF )(const CBNode *)

)

const

Definition at line 546 of file CBTree.cxx.

                                                                        {
 
  return traverse(m_root, pf);
 
}

traverse() [2/6]

const CBNode * CBTree::traverse	(	const CBNode *	current,
		const CBNode *(*	pF )(const CBNode *) ) const

Definition at line 552 of file CBTree.cxx.

                                                                                               {
 
  const CBNode *n = (*pf)(current);
 
  if ( n != 0 ) {
    return n;
  } else {
 
    for (const CBNode* child : current->children()) {
      const CBNode* c = traverse(child, pf );
      if (c != 0) {
        return c;
      }
    }
  }
 
  return 0;
    
}

traverse() [3/6]

void CBTree::traverse	(	const CBNode *	current,
		const CBNode *	parent,
		void(*	pF )(const CBNode *, const CBNode *) ) const

Definition at line 515 of file CBTree.cxx.

                                                                      {
 
  if (current == 0) { return; }
  
  (*pf)(current,parent);
 
  for (const CBNode* child : current->children()) {
    traverse( child, current, pf);
  }
 
}

traverse() [4/6]

void CBTree::traverse	(	const CBNode *	current,
		void(*	pF )(const CBNode *) ) const

Definition at line 477 of file CBTree.cxx.

                                                                            {
 
  if (current == 0) { return; }
  
  (*pf)(current);
 
  for (const CBNode* child : current->children()) {
    traverse( child, pf);
  }
 
}

traverse() [5/6]

void CBTree::traverse

(

void(*

pF )(const CBNode *)

)

const

Definition at line 469 of file CBTree.cxx.

                                                     {
  
  const CBNode* current = m_root;
 
  traverse(current, pf);
 
}

traverse() [6/6]

void CBTree::traverse

(

void(*

pF )(const CBNode *, const CBNode *)

)

const

Definition at line 507 of file CBTree.cxx.

                                                                   {
  
  const CBNode* current = m_root;
 
  traverse(current,0, pf);
 
}

traverseR() [1/3]

const CBNode * CBTree::traverseR	(	const CBNode *	current,
		const CBNode *(*	pF )(const CBNode *) ) const

Definition at line 572 of file CBTree.cxx.

                                                                                                {
 
  const CBNode *n = (*pf)(current);
 
  if ( n != 0 ) {
    return n;
  } else {
 
    for (const CBNode* parent : current->parents()) {
      const CBNode* c = traverseR(parent, pf );
      if (c != 0) {
        return c;
      }
    }
  }
 
  return 0;
    
}

traverseR() [2/3]

void CBTree::traverseR	(	const CBNode *	current,
		const CBNode *	child,
		void(*	pF )(const CBNode *, const CBNode *) ) const

Definition at line 528 of file CBTree.cxx.

                                                                       {
 
  if (current == 0) { return; }
  
  (*pf)(current,child);
  
  for (const CBNode* parent : current->parents()) {
    traverseR( parent, current, pf);
  }
 
}

traverseR() [3/3]

void CBTree::traverseR	(	const CBNode *	current,
		void(*	pF )(const CBNode *) ) const

Definition at line 489 of file CBTree.cxx.

                                                                             {
  // traverse tree in reverse
 
  if (current == 0) { return; }
  
  (*pf)(current);
 
  for (const CBNode* parent : current->parents()) {
    traverseR( parent, pf);
  }
 
}

Member Data Documentation

m_allNodes

nodeSet CBTree::m_allNodes

private

Definition at line 101 of file CBTree.h.

m_root

CBNode* CBTree::m_root

private

Definition at line 100 of file CBTree.h.

---

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

• CBTree.h
• CBTree.cxx