xfarrow/lasd
1
0
Fork 0
mirror of https://github.com/xfarrow/lasd.git synced 2025-06-05 21:49:14 +02:00
Code Issues Packages Projects Releases Wiki Activity

Library 3

Browse Source 
Added template
This commit is contained in:
Alessandro Ferro
2021-04-24 16:58:05 +02:00
parent d080cf6fcc
commit 31bf18d985
46 changed files with 4175 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

83
librerie/exercise3/zlasdtest/binarytree/binarytree.hpp Normal file
View File

@ -0,0 +1,83 @@
#ifndef BINARYTREETEST_HPP
#define BINARYTREETEST_HPP
#include "../../binarytree/binarytree.hpp"
/* ************************************************************************** */
template <typename Data>
void GetElement(uint& testnum, uint& testerr, const typename lasd::BinaryTree<Data>::Node& nod, bool chk, const Data& val) {
bool tst;
testnum++;
std::cout << " " << testnum << " The data of the node is \"" << nod.Element() << "\": ";
std::cout << ((tst = ((nod.Element() == val) == chk)) ? "Correct" : "Error") << "!" << std::endl;
testerr += (1 - (uint) tst);
}
template <typename Data>
void SetElement(uint& testnum, uint& testerr, const typename lasd::BinaryTree<Data>::Node& nod, bool chk, const Data& val) {
bool tst;
testnum++;
std::cout << " " << testnum << " Setting the front of the linear container to \"" << val << "\": ";
nod.Element() = val;
std::cout << ((tst = ((nod.Element() == val) == chk)) ? "Correct" : "Error") << "!" << std::endl;
testerr += (1 - (uint) tst);
}
template <typename Data>
void IsLeaf(uint& testnum, uint& testerr, const typename lasd::BinaryTree<Data>::Node& nod, bool chk) {
bool tst;
testnum++;
std::cout << " " << testnum << " The node is " << ((tst = nod.IsLeaf()) ? "" : "not ") << "a leaf: ";
std::cout << ((tst = (tst == chk)) ? "Correct" : "Error") << "!" << std::endl;
testerr += (1 - (uint) tst);
}
template <typename Data>
void HasLeftChild(uint& testnum, uint& testerr, const typename lasd::BinaryTree<Data>::Node& nod, bool chk) {
bool tst;
testnum++;
std::cout << " " << testnum << " The node does " << ((tst = nod.HasLeftChild()) ? "" : "not ") << "have a left child: ";
std::cout << ((tst = (tst == chk)) ? "Correct" : "Error") << "!" << std::endl;
testerr += (1 - (uint) tst);
}
template <typename Data>
void HasRightChild(uint& testnum, uint& testerr, const typename lasd::BinaryTree<Data>::Node& nod, bool chk) {
bool tst;
testnum++;
std::cout << " " << testnum << " The node does " << ((tst = nod.HasRightChild()) ? "" : "not ") << "have a right child: ";
std::cout << ((tst = (tst == chk)) ? "Correct" : "Error") << "!" << std::endl;
testerr += (1 - (uint) tst);
}
template <typename Data>
void Root(uint& testnum, uint& testerr, lasd::BinaryTree<Data>& bt, bool chk, const Data& val) {
bool tst;
testnum++;
try {
std::cout << " " << testnum << " Root of the tree with value \"" << bt.Root().Element() << "\": ";
std::cout << ((tst = (((bt.Root().Element() == val) && (bt.Root().Element() == val)) == chk)) ? "Correct" : "Error") << "!" << std::endl;
} catch(std::length_error exc) {
std::cout << "\"" << exc.what() << "\": " << ((tst = !chk) ? "Correct" : "Error") << "!" << std::endl;
}
testerr += (1 - (uint) tst);
}
template <typename Data>
void EqualTrees(uint& testnum, uint& testerr, const lasd::BinaryTree<Data>& bt1, const lasd::BinaryTree<Data>& bt2, bool chk) {
bool tst;
testnum++;
try {
std::cout << " " << testnum << " The two trees are " << ((tst = (bt1 == bt2)) ? "" : "not ") << "equal: ";
std::cout << ((tst = (tst == chk)) ? "Correct" : "Error") << "!" << std::endl;
} catch(std::exception exc) {
std::cout << "\"" << exc.what() << "\": " << ((tst = !chk) ? "Correct" : "Error") << "!" << std::endl;
}
testerr += (1 - (uint) tst);
}
/* ************************************************************************** */
#endif