BinaryPropertyMPITree Class Reference

#include <binarytree.h>

Inheritance diagram for BinaryPropertyMPITree:

Collaboration diagram for BinaryPropertyMPITree:

Public Member Functions
	BinaryPropertyMPITree (MInt num_procs)
	~BinaryPropertyMPITree ()
void	printTree ()
BinaryTreeIntNode *	getMyMPILocation ()
BinaryTreeIntNode *	getMyMPIReceiver ()
BinaryTreeIntNode *	getMyLeftMPISender ()
BinaryTreeIntNode *	getMyRightMPISender ()

Protected Member Functions
void	insertBalancedNode (BinaryTreeIntNode *node)

Static Protected Member Functions
static void	printTreeRoot (BinaryTreeIntNode *node, MInt level)

Protected Attributes
BinaryTreeIntNode *	m_myMPILocation
std::queue< BinaryTreeIntNode * > *	m_queue

Additional Inherited Members
Private Member Functions inherited from BinaryTree< T >
	BinaryTree ()
	BinaryTree (BinaryTreeNode< T > *root)
BinaryTreeNode< T > *	getRoot ()
MInt	getMaxDepth ()
MInt	getNodeDepth (BinaryTreeNode< T > *node)
Private Attributes inherited from BinaryTree< T >
BinaryTreeNode< T > *	m_root

Detailed Description

Definition at line 102 of file binarytree.h.

Constructor & Destructor Documentation

BinaryPropertyMPITree()

BinaryPropertyMPITree::BinaryPropertyMPITree ( MInt  num_procs )

inlineexplicit

Definition at line 104 of file binarytree.h.

                                                 : m_myMPILocation(nullptr) {
    MInt rank = globalDomainId();
    m_queue = new std::queue<BinaryTreeIntNode*>;
    for(MInt i = 0; i < num_procs; i++) {
      auto* ins_int = new MInt();
      *ins_int = i;
      auto* ins = new BinaryTreeIntNode(ins_int);
      if(i == 0) {
        m_root = ins;
        m_queue->push(m_root);
      } else {
        insertBalancedNode(ins);
      }
 
      if(i == rank) {
        m_myMPILocation = ins;
      }
    }
  }

~BinaryPropertyMPITree()

BinaryPropertyMPITree::~BinaryPropertyMPITree ( )

inline

Definition at line 123 of file binarytree.h.

                           {
    for(MUlong i = 0; i < m_queue->size(); i++) {
      delete m_queue->front();
      m_queue->pop();
    }
    delete m_queue;
    m_queue = nullptr;
  }

Member Function Documentation

getMyLeftMPISender()

BinaryTreeIntNode * BinaryPropertyMPITree::getMyLeftMPISender ( )

inline

Definition at line 148 of file binarytree.h.

                                          {
    if(m_myMPILocation != nullptr && m_myMPILocation->getLeftChild() != nullptr) {
      return m_myMPILocation->getLeftChild();
    }
    return nullptr;
  }

getMyMPILocation()

BinaryTreeIntNode * BinaryPropertyMPITree::getMyMPILocation ( )

inline

Definition at line 134 of file binarytree.h.

                                        {
    if(m_myMPILocation == nullptr) {
      return nullptr;
    }
    return m_myMPILocation;
  }

getMyMPIReceiver()

BinaryTreeIntNode * BinaryPropertyMPITree::getMyMPIReceiver ( )

inline

Definition at line 141 of file binarytree.h.

                                        {
    if(m_myMPILocation != nullptr && m_myMPILocation->getFather() != nullptr) {
      return m_myMPILocation->getFather();
    }
    return nullptr;
  }

getMyRightMPISender()

BinaryTreeIntNode * BinaryPropertyMPITree::getMyRightMPISender ( )

inline

Definition at line 154 of file binarytree.h.

                                           {
    if(m_myMPILocation != nullptr && m_myMPILocation->getRightChild() != nullptr) {
      return m_myMPILocation->getRightChild();
    }
    return nullptr;
  }

insertBalancedNode()

void BinaryPropertyMPITree::insertBalancedNode ( BinaryTreeIntNode *  node )

inlineprotected

Definition at line 175 of file binarytree.h.

                                                   {
    while(!m_queue->empty()) {
      // full, descend
      if(m_queue->front()->getLeftChild() != nullptr && m_queue->front()->getRightChild() != nullptr) {
        m_queue->push(m_queue->front()->getLeftChild());
        m_queue->push(m_queue->front()->getRightChild());
        m_queue->pop();
      }
      // not full, fill up
      else {
        node->setFather(m_queue->front());
        if(m_queue->front()->getLeftChild() == nullptr) {
          m_queue->front()->setLeftChild(node);
        } else {
          m_queue->front()->setRightChild(node);
        }
 
        break;
      }
    }
  }

printTree()

void BinaryPropertyMPITree::printTree ( )

inline

Definition at line 132 of file binarytree.h.

{ printTreeRoot(m_root, 0); }

printTreeRoot()

static void BinaryPropertyMPITree::printTreeRoot ( BinaryTreeIntNode *  node, MInt  level  )

inlinestaticprotected

Definition at line 165 of file binarytree.h.

                                                                 {
    m_log << "L " << level << ":" << *(node->getObject()) << std::endl;
    if(node->getLeftChild() != nullptr) {
      printTreeRoot(node->getLeftChild(), level + 1);
    }
    if(node->getRightChild() != nullptr) {
      printTreeRoot(node->getRightChild(), level + 1);
    }
  }

Member Data Documentation

m_myMPILocation

BinaryTreeIntNode* BinaryPropertyMPITree::m_myMPILocation

protected

Definition at line 162 of file binarytree.h.

m_queue

std::queue<BinaryTreeIntNode*>* BinaryPropertyMPITree::m_queue

protected

Definition at line 163 of file binarytree.h.

---

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

• /home/gitlab-runner/scratch/builds/oxpnswJ6/1/aia/m-AIA/m-AIA/src/UTIL/binarytree.h