TreeNode.cpp

#include <iostream>
#include <cstring>
#include <iomanip>
#include "TreeNode.h"

void TreeNode::printFormatted(int aIndent) const {
  // Indent the current entry
  for (int k = 0; k < aIndent; ++k)
    std::cout << ' ';

  // Print the node info
  if (mNodeMark.empty())
    std::cout << '<' << mNodeName << "> " << mBranchLength;
  else
    std::cout << '<' << mNodeName << ">#" << mNodeMark << ' ' << mBranchLength;

  // End line
  std::cout << std::endl;

  // Print the children (indented by 3 spaces)
  std::vector<TreeNode *>::const_iterator in(mChildrenList.begin());
  const std::vector<TreeNode *>::const_iterator end(mChildrenList.end());
  for (; in != end; ++in)
    (*in)->printFormatted(aIndent + 3);
}

void TreeNode::printNode(void) const {
  // Print the node info
  std::cout << mNodeName;
  if (!mNodeMark.empty())
    std::cout << '#' << mNodeMark;
  std::cout << std::setprecision(6) << ":" << mBranchLength;
}

void TreeNode::printNodeWoutLen(void) const {
  // Print the node info
  std::cout << mNodeName;
  if (!mNodeMark.empty())
    std::cout << '#' << mNodeMark;
  // std::cout  << std::setprecision(6) << ":" << mBranchLength;
}

void TreeNode::clearNode(void) {
  // Recursively remove the nodes
  if (!mChildrenList.empty()) {
    std::vector<TreeNode *>::iterator in(mChildrenList.begin());
    const std::vector<TreeNode *>::iterator end(mChildrenList.end());
    for (; in != end; ++in)
      (*in)->clearNode();
    for (in = mChildrenList.begin(); in != end; ++in)
      delete (*in);
  }

  // Special case for the root node
  if (!mParent) {
    mChildrenList.clear();
  }
}