testUtils.C File Reference

#include "TreeNode.h"
#include "testUtils.h"
#include "parUtils.h"
#include "seqUtils.h"
#include <cstring>

Go to the source code of this file.

Namespaces
namespace	ot
namespace	ot::test
Functions
bool	isBalanced (unsigned int dim, unsigned int maxDepth, char *failFileName, const std::vector< ot::TreeNode > &nodes, bool incCorn, unsigned int maxLevDiff)
bool	isBalancedInternal (unsigned int dim, unsigned int maxDepth, char *failFileName, const std::vector< ot::TreeNode > &nodes, ot::TreeNode holder, bool incCorn, unsigned int maxLevDiff)
bool	isComplete (const std::vector< ot::TreeNode > &nodes)
bool	isLinear (const std::vector< ot::TreeNode > &nodes)

---

Detailed Description

Author:

Rahul Sampath, rahul.sampath@gmail.com

Definition in file testUtils.C.

---

Function Documentation

bool ot::test::isBalanced (  unsigned int  dim, unsigned int  maxDepth, char *  failFileName, const std::vector< TreeNode > &  nodes, bool  incCorn, unsigned int  maxLevDiff = 1 )

Parameters: dim[in]  The dimension of the tree. maxDepth[in]  The maximum depth of the tree. nodes[in]  The vector of nodes that have to be tested. Returns: true if for every element in the vector, all the neighbours that balanced it are also present in the vector and false otherwise. Remarks: The function uses Binary Search and hence expects the vector of nodes to be sorted. Definition at line 76 of file testUtils.C. References ot::test::isBalancedInternal(). Referenced by main().

bool ot::test::isBalancedInternal (  unsigned int  dim, unsigned int  maxDepth, char *  failFileName, const std::vector< ot::TreeNode > &  nodes, ot::TreeNode  holder, bool  incCorn, unsigned int  maxLevDiff = 1 )

Definition at line 82 of file testUtils.C. References ot::TreeNode::getAnchor(), ot::TreeNode::getDFD(), ot::TreeNode::isAncestor(), seq::makeVectorUnique(), seq::maxLowerBound(), and ot::writeNodesToFile(). Referenced by ot::test::isBalanced().

bool ot::test::isComplete (  const std::vector< TreeNode > &  nodes  )

Parameters: nodes[in]  The vector of nodes that have to be tested. Returns: true if the sum of the volumes of the nodes in the vector equals the volume of the domain and false otherwise. Remarks: The vector of nodes is expected to be unique and linear. Definition at line 27 of file testUtils.C. References sort(). Referenced by main().

bool ot::test::isLinear (  const std::vector< TreeNode > &  nodes  )

Parameters: nodes[in]  The vector of nodes that have to be tested. Returns: false if any ancestor of any element in the vector is also present in the vector and true otherwise. Remarks: The function uses Binary Search and hence expects the vector of nodes to be sorted. Definition at line 17 of file testUtils.C. Referenced by main().

---