mirror of https://github.com/xfarrow/lasd.git
Alessandro Ferro
parent
cafa032363
commit
e0e8ae4481
|
|
@ -11,6 +11,6 @@ using namespace lasd;
|
|||
|
||||
int main() {
|
||||
std::cout << "Lasd Libraries 2020" << std::endl;
|
||||
lasdtest(); // To call in the menu of your library test!
|
||||
menu();
|
||||
return 0;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,2 +1,719 @@
|
|||
#include"test.hpp"
|
||||
#include<iostream>
|
||||
#include<random>
|
||||
#include<cmath>
|
||||
#include "../zlasdtest/test.hpp"
|
||||
|
||||
// ...
|
||||
using namespace lasd;
|
||||
using namespace std;
|
||||
|
||||
void menu(){
|
||||
|
||||
unsigned short int choice;
|
||||
DataType chosenDataType;
|
||||
|
||||
do{
|
||||
std::cout<<std::endl;
|
||||
std::cout<<" 1. Use your tests (to be used by the professor)"<<std::endl;
|
||||
std::cout<<" 2. Use the library demo"<<std::endl;
|
||||
cout<<endl<<" -> ";
|
||||
std::cin>>std::ws;
|
||||
std::cin>>choice;
|
||||
}while(choice!=1 && choice!=2);
|
||||
switch(choice){
|
||||
case 1:
|
||||
lasdtest();
|
||||
break;
|
||||
case 2:
|
||||
chosenDataType = ChooseDataType();
|
||||
UseChosenType(chosenDataType);
|
||||
break;
|
||||
}
|
||||
}
|
||||
DataType ChooseDataType(){
|
||||
unsigned short int choice;
|
||||
do{
|
||||
std::cout<<"\nChoose a data type:"<<std::endl;
|
||||
std::cout<<" 1. Integer"<<std::endl;
|
||||
std::cout<<" 2. Float"<<std::endl;
|
||||
std::cout<<" 3. String"<<std::endl;
|
||||
cout<<endl<<" -> ";
|
||||
std::cin>>std::ws;
|
||||
std::cin>>choice;
|
||||
}while(!(choice>0 && choice<4));
|
||||
if(choice==1)
|
||||
return DataType::integer;
|
||||
else if(choice==2)
|
||||
return DataType::ffloat;
|
||||
else if(choice==3)
|
||||
return DataType::sstring;
|
||||
}
|
||||
|
||||
void UseChosenType(DataType chosenDataType){
|
||||
if(chosenDataType == DataType::integer){
|
||||
BST<int> bst;
|
||||
bst = GenerateIntegerBST(bst);
|
||||
IntegerFunctions(bst);
|
||||
|
||||
}else if(chosenDataType == DataType::ffloat){
|
||||
BST<float> bst;
|
||||
bst = GenerateFloatBST(bst);
|
||||
FloatFunctions(bst);
|
||||
|
||||
}else if(chosenDataType == DataType::sstring){
|
||||
BST<string> bst;
|
||||
bst = GenerateStringsBST(bst);
|
||||
StringFunctions(bst);
|
||||
}
|
||||
}
|
||||
|
||||
/* ----- integer functions ----- */
|
||||
|
||||
template <typename T>
|
||||
void IntegerFunctions(T& bst){
|
||||
unsigned short int choice;
|
||||
do{
|
||||
std::cout<<std::endl<<std::endl;
|
||||
std::cout<<"Choose one of the following options:"<<std::endl;
|
||||
std::cout<<" 1. Print tree"<<std::endl;
|
||||
std::cout<<" 2. Check exsistence of an element"<<std::endl;
|
||||
std::cout<<" 3. Product of integers less than 'n' "<<std::endl;
|
||||
std::cout<<" 4. (INSERT) Insert an element"<<std::endl;
|
||||
std::cout<<" 5. (REMOVE) Remove an element"<<std::endl;
|
||||
std::cout<<" 6. (MIN) Print the minimum element"<<std::endl;
|
||||
std::cout<<" 7. (MIN AND REMOVE) Print the minimum element and remove it"<<std::endl;
|
||||
std::cout<<" 8. (REMOVE MIN) Remove the minimum element"<<std::endl;
|
||||
std::cout<<" 9. (MAX) Print the maximum element"<<std::endl;
|
||||
std::cout<<" 10. (MAX AND REMOVE) Print the maximum element and remove it"<<std::endl;
|
||||
std::cout<<" 11. (REMOVE MAX) Remove the maximum element"<<std::endl;
|
||||
std::cout<<" 12. (PREDECESSOR) Print the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 13. (PREDECESSOR AND REMOVE) Remove and print the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 14. (REMOVE PREDECESSOR) Remove the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 15. (SUCCESSOR) Print the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 16. (SUCCESSOR AND REMOVE) Remove and print the successor of a given element"<<std::endl;
|
||||
std::cout<<" 17. (REMOVE SUCCESSOR) Remove the successor of a given element"<<std::endl;
|
||||
std::cout<<" 18. Node-level operations (debug)"<<std::endl;
|
||||
std::cout<<" 19. Go back"<<std::endl;
|
||||
std::cout<<" 20. Quit"<<std::endl;
|
||||
|
||||
cout<<endl<<" -> ";
|
||||
std::cin>>std::ws;
|
||||
std::cin>>choice;
|
||||
std::cout<<std::endl;
|
||||
switch(choice){
|
||||
case 1:
|
||||
PrintTree(bst);
|
||||
break;
|
||||
case 2:
|
||||
CheckExistence(bst);
|
||||
break;
|
||||
case 3:
|
||||
ProductsElementsLessThan(bst);
|
||||
break;
|
||||
case 4:
|
||||
InsertElement(bst);
|
||||
break;
|
||||
case 5:
|
||||
RemoveElement(bst);
|
||||
break;
|
||||
case 6:
|
||||
PrintMinimum(bst);
|
||||
break;
|
||||
case 7:
|
||||
PrintMinimumNDelete(bst);
|
||||
break;
|
||||
case 8:
|
||||
RemoveMin(bst);
|
||||
break;
|
||||
case 9:
|
||||
PrintMaximum(bst);
|
||||
break;
|
||||
case 10:
|
||||
PrintMaximumNDelete(bst);
|
||||
break;
|
||||
case 11:
|
||||
RemoveMax(bst);
|
||||
break;
|
||||
case 12:
|
||||
PrintPredecessor(bst);
|
||||
break;
|
||||
case 13:
|
||||
PredecessorNRemove(bst);
|
||||
break;
|
||||
case 14:
|
||||
RemovePredecessor(bst);
|
||||
break;
|
||||
case 15:
|
||||
PrintSuccessor(bst);
|
||||
break;
|
||||
case 16:
|
||||
SuccessorNRemove(bst);
|
||||
break;
|
||||
case 17:
|
||||
RemoveSuccessor(bst);
|
||||
break;
|
||||
case 18:
|
||||
try{
|
||||
NodeOperations(bst.Root());
|
||||
}catch(length_error exc){
|
||||
cout<<exc.what();
|
||||
}
|
||||
break;
|
||||
case 19:
|
||||
menu();
|
||||
}
|
||||
}while(choice!=19 && choice!=20);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void ProductsElementsLessThan(T& tree){
|
||||
int n, acc=1;
|
||||
void (*func)(const int&, const void*, void*) = AccumulateProduct;
|
||||
|
||||
cout<<"Multipy all elements of the tree whose value is less than ";
|
||||
cin>>ws>>n;
|
||||
|
||||
tree.FoldBreadth(func, (void*)&n, (void*)&acc);
|
||||
cout<<"\nThe result is "<<acc<<endl<<endl;
|
||||
|
||||
}
|
||||
|
||||
void AccumulateProduct(const int& data, const void* par, void* acc){
|
||||
if(data < (*(int*)par)){
|
||||
*(int*)acc *= data;
|
||||
}
|
||||
}
|
||||
|
||||
/* ----- float functions ----- */
|
||||
template <typename T>
|
||||
void FloatFunctions(T& bst){
|
||||
unsigned short int choice;
|
||||
do{
|
||||
std::cout<<std::endl<<std::endl;
|
||||
std::cout<<"Choose one of the following options:"<<std::endl;
|
||||
std::cout<<" 1. Print tree"<<std::endl;
|
||||
std::cout<<" 2. Check exsistence of an element"<<std::endl;
|
||||
std::cout<<" 3. Sum of floats greater than 'n' "<<std::endl;
|
||||
std::cout<<" 4. (INSERT) Insert an element"<<std::endl;
|
||||
std::cout<<" 5. (REMOVE) Remove an element"<<std::endl;
|
||||
std::cout<<" 6. (MIN) Print the minimum element"<<std::endl;
|
||||
std::cout<<" 7. (MIN AND REMOVE) Print the minimum element and remove it"<<std::endl;
|
||||
std::cout<<" 8. (REMOVE MIN) Remove the minimum element"<<std::endl;
|
||||
std::cout<<" 9. (MAX) Print the maximum element"<<std::endl;
|
||||
std::cout<<" 10. (MAX AND REMOVE) Print the maximum element and remove it"<<std::endl;
|
||||
std::cout<<" 11. (REMOVE MAX) Remove the maximum element"<<std::endl;
|
||||
std::cout<<" 12. (PREDECESSOR) Print the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 13. (PREDECESSOR AND REMOVE) Remove and print the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 14. (REMOVE PREDECESSOR) Remove the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 15. (SUCCESSOR) Print the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 16. (SUCCESSOR AND REMOVE) Remove and print the successor of a given element"<<std::endl;
|
||||
std::cout<<" 17. (REMOVE SUCCESSOR) Remove the successor of a given element"<<std::endl;
|
||||
std::cout<<" 18. Node-level operations (debug)"<<std::endl;
|
||||
std::cout<<" 19. Go back"<<std::endl;
|
||||
std::cout<<" 20. Quit"<<std::endl;
|
||||
|
||||
cout<<endl<<" -> ";
|
||||
std::cin>>std::ws;
|
||||
std::cin>>choice;
|
||||
std::cout<<std::endl;
|
||||
switch(choice){
|
||||
case 1:
|
||||
PrintTree(bst);
|
||||
break;
|
||||
case 2:
|
||||
CheckExistence(bst);
|
||||
break;
|
||||
case 3:
|
||||
SumElementsGreaterThan(bst);
|
||||
break;
|
||||
case 4:
|
||||
InsertElement(bst);
|
||||
break;
|
||||
case 5:
|
||||
RemoveElement(bst);
|
||||
break;
|
||||
case 6:
|
||||
PrintMinimum(bst);
|
||||
break;
|
||||
case 7:
|
||||
PrintMinimumNDelete(bst);
|
||||
break;
|
||||
case 8:
|
||||
RemoveMin(bst);
|
||||
break;
|
||||
case 9:
|
||||
PrintMaximum(bst);
|
||||
break;
|
||||
case 10:
|
||||
PrintMaximumNDelete(bst);
|
||||
break;
|
||||
case 11:
|
||||
RemoveMax(bst);
|
||||
break;
|
||||
case 12:
|
||||
PrintPredecessor(bst);
|
||||
break;
|
||||
case 13:
|
||||
PredecessorNRemove(bst);
|
||||
break;
|
||||
case 14:
|
||||
RemovePredecessor(bst);
|
||||
break;
|
||||
case 15:
|
||||
PrintSuccessor(bst);
|
||||
break;
|
||||
case 16:
|
||||
SuccessorNRemove(bst);
|
||||
break;
|
||||
case 17:
|
||||
RemoveSuccessor(bst);
|
||||
break;
|
||||
case 18:
|
||||
try{
|
||||
NodeOperations(bst.Root());
|
||||
}catch(length_error exc){
|
||||
cout<<exc.what();
|
||||
}
|
||||
break;
|
||||
case 19:
|
||||
menu();
|
||||
}
|
||||
}while(choice!=19 && choice!=20);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void SumElementsGreaterThan(T& tree){
|
||||
float n, acc = 0;
|
||||
void (*func)(const float&, const void*, void*) = AccumulateSum;
|
||||
|
||||
cout<<"Sum all elements of the tree whose value is greater than ";
|
||||
cin>>ws>>n;
|
||||
|
||||
tree.FoldBreadth(func, (void*)&n, (void*)&acc);
|
||||
cout<<"\nThe result is "<<acc<<endl<<endl;
|
||||
}
|
||||
|
||||
void AccumulateSum(const float& data, const void* par, void* acc){
|
||||
if(data > (*(float*)par)){
|
||||
*(float*)acc += data;
|
||||
}
|
||||
}
|
||||
|
||||
/* ----- string functions ----- */
|
||||
|
||||
template <typename T>
|
||||
void StringFunctions(T& bst){
|
||||
unsigned short int choice;
|
||||
do{
|
||||
std::cout<<std::endl<<std::endl;
|
||||
std::cout<<"Choose one of the following options:"<<std::endl;
|
||||
std::cout<<" 1. Print tree"<<std::endl;
|
||||
std::cout<<" 2. Check exsistence of an element"<<std::endl;
|
||||
std::cout<<" 3. Concatenate strings whose dimension is less or equal than 'n' "<<std::endl;
|
||||
std::cout<<" 4. (INSERT) Insert an element"<<std::endl;
|
||||
std::cout<<" 5. (REMOVE) Remove an element"<<std::endl;
|
||||
std::cout<<" 6. (MIN) Print the minimum element"<<std::endl;
|
||||
std::cout<<" 7. (MIN AND REMOVE) Print the minimum element and remove it"<<std::endl;
|
||||
std::cout<<" 8. (REMOVE MIN) Remove the minimum element"<<std::endl;
|
||||
std::cout<<" 9. (MAX) Print the maximum element"<<std::endl;
|
||||
std::cout<<" 10. (MAX AND REMOVE) Print the maximum element and remove it"<<std::endl;
|
||||
std::cout<<" 11. (REMOVE MAX) Remove the maximum element"<<std::endl;
|
||||
std::cout<<" 12. (PREDECESSOR) Print the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 13. (PREDECESSOR AND REMOVE) Remove and print the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 14. (REMOVE PREDECESSOR) Remove the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 15. (SUCCESSOR) Print the predecessor of a given element"<<std::endl;
|
||||
std::cout<<" 16. (SUCCESSOR AND REMOVE) Remove and print the successor of a given element"<<std::endl;
|
||||
std::cout<<" 17. (REMOVE SUCCESSOR) Remove the successor of a given element"<<std::endl;
|
||||
std::cout<<" 18. Node-level operations (debug)"<<std::endl;
|
||||
std::cout<<" 19. Go back"<<std::endl;
|
||||
std::cout<<" 20. Quit"<<std::endl;
|
||||
|
||||
cout<<endl<<" -> ";
|
||||
std::cin>>std::ws;
|
||||
std::cin>>choice;
|
||||
std::cout<<std::endl;
|
||||
switch(choice){
|
||||
case 1:
|
||||
PrintTree(bst);
|
||||
break;
|
||||
case 2:
|
||||
CheckExistence(bst);
|
||||
break;
|
||||
case 3:
|
||||
ConcatLessThan(bst);
|
||||
break;
|
||||
case 4:
|
||||
InsertElement(bst);
|
||||
break;
|
||||
case 5:
|
||||
RemoveElement(bst);
|
||||
break;
|
||||
case 6:
|
||||
PrintMinimum(bst);
|
||||
break;
|
||||
case 7:
|
||||
PrintMinimumNDelete(bst);
|
||||
break;
|
||||
case 8:
|
||||
RemoveMin(bst);
|
||||
break;
|
||||
case 9:
|
||||
PrintMaximum(bst);
|
||||
break;
|
||||
case 10:
|
||||
PrintMaximumNDelete(bst);
|
||||
break;
|
||||
case 11:
|
||||
RemoveMax(bst);
|
||||
break;
|
||||
case 12:
|
||||
PrintPredecessor(bst);
|
||||
break;
|
||||
case 13:
|
||||
PredecessorNRemove(bst);
|
||||
break;
|
||||
case 14:
|
||||
RemovePredecessor(bst);
|
||||
break;
|
||||
case 15:
|
||||
PrintSuccessor(bst);
|
||||
break;
|
||||
case 16:
|
||||
SuccessorNRemove(bst);
|
||||
break;
|
||||
case 17:
|
||||
RemoveSuccessor(bst);
|
||||
break;
|
||||
case 18:
|
||||
try{
|
||||
NodeOperations(bst.Root());
|
||||
}catch(length_error exc){
|
||||
cout<<exc.what();
|
||||
}
|
||||
break;
|
||||
case 19:
|
||||
menu();
|
||||
}
|
||||
}while(choice!=19 && choice!=20);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void ConcatLessThan(T& tree){
|
||||
int n;
|
||||
string concatenated = "";
|
||||
void (*func)(const string&, const void*, void*) = ConcatAString;
|
||||
|
||||
cout<<"Concatenate all elements of the tree whose length is less or equal than ";
|
||||
cin>>ws>>n;
|
||||
|
||||
tree.FoldBreadth(func, (void*)&n, (void*)&concatenated);
|
||||
cout<<"\nThe result is "<< concatenated << endl << endl;
|
||||
}
|
||||
|
||||
void ConcatAString(const string& data, const void* par, void* acc){
|
||||
if( ((int)data.length()) <= ((*(int*)par)) ){
|
||||
*(string*)acc = *(string*)acc + "-" + data;
|
||||
}
|
||||
}
|
||||
|
||||
/* ----- shared functions ----- */
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void PrintTree(Tree<DTType>& tree){
|
||||
void (*PrinterFunction) (DTType&, void*) = PrintSingleElement;
|
||||
|
||||
cout<<"Pre order:\n";
|
||||
tree.MapPreOrder(PrinterFunction, nullptr);
|
||||
cout<<endl<<endl;
|
||||
|
||||
cout<<"In oder:\n";
|
||||
tree.MapInOrder(PrinterFunction, nullptr);
|
||||
cout<<endl<<endl;
|
||||
|
||||
cout<<"Post order:\n";
|
||||
tree.MapPostOrder(PrinterFunction, nullptr);
|
||||
cout<<endl<<endl;
|
||||
|
||||
cout<<"Breadth order:\n";
|
||||
tree.MapBreadth(PrinterFunction, nullptr);
|
||||
cout<<endl<<endl;
|
||||
}
|
||||
|
||||
template <typename Data>
|
||||
void PrintSingleElement(Data& data, void* _){
|
||||
std::cout << data << " ";
|
||||
}
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void CheckExistence(Tree<DTType>& tree){
|
||||
DTType elementToLookFor;
|
||||
cout<<"\n\nCheck existence in the tree of: ";
|
||||
cin>>ws;
|
||||
cin>>elementToLookFor;
|
||||
cout<<"The element " << ( (!tree.Exists(elementToLookFor))? "does not " : "") << "exists\n\n";
|
||||
}
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void InsertElement(Tree<DTType>& bst){
|
||||
DTType elementToInsert;
|
||||
cout<<"\n\nInsert in the BST the following element: ";
|
||||
cin>>ws;
|
||||
cin>>elementToInsert;
|
||||
bst.Insert(elementToInsert);
|
||||
}
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void RemoveElement(Tree<DTType>& bst){
|
||||
DTType elementToRemove;
|
||||
cout<<"\n\nRemove from the BST the following element: ";
|
||||
cin>>ws;
|
||||
cin>>elementToRemove;
|
||||
bst.Remove(elementToRemove);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void PrintMinimum(T& bst){
|
||||
if(bst.Size()>0)
|
||||
cout<<"\n\nThe minimum element in the BST is "<<bst.Min();
|
||||
else
|
||||
cout<<"\n\nThe tree is empty.";
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void PrintMinimumNDelete(T& bst){
|
||||
if(bst.Size()>0)
|
||||
cout<<"The minimum element in the BST ( "<<bst.MinNRemove()<<" ) has been removed";
|
||||
else
|
||||
cout<<"\n\nThe tree is empty.";
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void RemoveMin(T& bst){
|
||||
if(bst.Size()>0){
|
||||
bst.RemoveMin();
|
||||
cout<<"\n\nThe minimum element has been deleted";
|
||||
}
|
||||
else
|
||||
cout<<"\n\nThe tree is empty";
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void PrintMaximum(T& bst){
|
||||
if(bst.Size()>0)
|
||||
cout<<"\n\nThe maximum element in the BST is "<<bst.Max();
|
||||
else
|
||||
cout<<"\n\nThe tree is empty.";
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void PrintMaximumNDelete(T& bst){
|
||||
if(bst.Size()>0)
|
||||
cout<<"The maximum element in the BST ( "<<bst.MaxNRemove()<<" ) has been removed";
|
||||
else
|
||||
cout<<"\n\nThe tree is empty.";
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void RemoveMax(T& bst){
|
||||
if(bst.Size()>0){
|
||||
bst.RemoveMax();
|
||||
cout<<"\n\nThe maximum element has been deleted";
|
||||
}
|
||||
else
|
||||
cout<<"\n\nThe tree is empty";
|
||||
}
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void PrintPredecessor(Tree<DTType>& bst){
|
||||
DTType lookForPredecessor;
|
||||
cout<<"Print the predecessor of ";
|
||||
cin>>ws;
|
||||
cin>>lookForPredecessor;
|
||||
try{
|
||||
cout<<"The predecessor of "<<lookForPredecessor<<" is "<<bst.Predecessor(lookForPredecessor);
|
||||
}catch(length_error exc){
|
||||
cout<<exc.what();
|
||||
}
|
||||
}
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void PredecessorNRemove(Tree<DTType>& bst){
|
||||
DTType lookForPredecessor;
|
||||
cout<<"Print and delete the predecessor of ";
|
||||
cin>>ws;
|
||||
cin>>lookForPredecessor;
|
||||
try{
|
||||
cout<<"The predecessor of "<<lookForPredecessor<<" was "<<bst.PredecessorNRemove(lookForPredecessor)<<" and has been removed";
|
||||
}catch(length_error exc){
|
||||
cout<<exc.what();
|
||||
}
|
||||
}
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void RemovePredecessor(Tree<DTType>& bst){
|
||||
DTType lookForPredecessor;
|
||||
cout<<"Delete the predecessor of ";
|
||||
cin>>ws;
|
||||
cin>>lookForPredecessor;
|
||||
try{
|
||||
bst.RemovePredecessor(lookForPredecessor);
|
||||
cout<<"The predecessor of "<<lookForPredecessor<<" has been removed";
|
||||
}catch(length_error exc){
|
||||
cout<<exc.what();
|
||||
}
|
||||
}
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void PrintSuccessor(Tree<DTType>& bst){
|
||||
DTType lookForSuccessor;
|
||||
cout<<"Print the successor of ";
|
||||
cin>>ws;
|
||||
cin>>lookForSuccessor;
|
||||
try{
|
||||
cout<<"The successor of "<< lookForSuccessor<<" is "<<bst.Successor(lookForSuccessor);
|
||||
}catch(length_error exc){
|
||||
cout<<exc.what();
|
||||
}
|
||||
}
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void SuccessorNRemove(Tree<DTType>& bst){
|
||||
DTType lookForSuccessor;
|
||||
cout<<"Print and delete the successor of ";
|
||||
cin>>ws;
|
||||
cin>>lookForSuccessor;
|
||||
try{
|
||||
cout<<"The successor of "<<lookForSuccessor<<" was "<<bst.SuccessorNRemove(lookForSuccessor)<<" and has been removed";
|
||||
}catch(length_error exc){
|
||||
cout<<exc.what();
|
||||
}
|
||||
}
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void RemoveSuccessor(Tree<DTType>& bst){
|
||||
DTType lookForSuccessor;
|
||||
cout<<"Delete the successor of ";
|
||||
cin>>ws;
|
||||
cin>>lookForSuccessor;
|
||||
try{
|
||||
bst.RemoveSuccessor(lookForSuccessor);
|
||||
cout<<"The successor of "<<lookForSuccessor<<" has been removed";
|
||||
}catch(length_error exc){
|
||||
cout<<exc.what();
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void NodeOperations(T& currentNode){
|
||||
uint choice;
|
||||
cout<<endl<<endl;
|
||||
cout<<" *** Element in the current node: "<<currentNode.Element()<<" ***"<<endl;
|
||||
cout<<" 1. Go left"<<endl;
|
||||
cout<<" 2. Go Right"<<endl;
|
||||
cout<<" 3. Is this a leaf?"<<endl;
|
||||
cout<<" 4. Go back"<<endl;
|
||||
cout<<endl<<" -> ";
|
||||
cin>>ws;
|
||||
cin>>choice;
|
||||
switch(choice){
|
||||
case 1:
|
||||
if(currentNode.HasLeftChild()) NodeOperations(currentNode.LeftChild());
|
||||
else{
|
||||
cout<<"\nThe node does not have a left child, operation aborted.";
|
||||
NodeOperations(currentNode);
|
||||
}
|
||||
break;
|
||||
|
||||
case 2:
|
||||
if(currentNode.HasRightChild()) NodeOperations(currentNode.RightChild());
|
||||
else {
|
||||
cout<<"\nThe node does not have a right child, operation aborted.";
|
||||
NodeOperations(currentNode);
|
||||
}
|
||||
break;
|
||||
|
||||
case 3:
|
||||
if(currentNode.IsLeaf()) cout<<"\n Yes, the current node is a leaf";
|
||||
else cout<<"\n No, the current node is not a leaf";
|
||||
NodeOperations(currentNode);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/* ----- generator functions ----- */
|
||||
|
||||
template <typename T>
|
||||
T GenerateIntegerBST(T& bst){
|
||||
ulong dim = getDimension();
|
||||
Vector<int> tmp(dim);
|
||||
|
||||
default_random_engine gen(random_device{}());
|
||||
uniform_int_distribution<int> dist(0,1000);
|
||||
|
||||
cout<<"\n\nElements in the binary tree (in breadth order):\n";
|
||||
for(ulong i=0 ; i<dim ; ++i){
|
||||
tmp[i] = dist(gen);
|
||||
cout<<tmp[i]<<" ";
|
||||
}
|
||||
cout<<endl<<endl;
|
||||
|
||||
T tree(tmp);
|
||||
return tree;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
T GenerateFloatBST(T& bst){
|
||||
ulong dim = getDimension();
|
||||
Vector<float> tmp(dim);
|
||||
|
||||
default_random_engine gen(random_device{}());
|
||||
uniform_real_distribution<double> distr(0,5);
|
||||
|
||||
cout<<"\n\nElements in the binary tree (in breadth order):\n";
|
||||
for(unsigned long i = 0; i < dim; ++i){
|
||||
tmp[i] = (round(distr(gen)*10000))/100;
|
||||
cout<<tmp[i]<<" ";
|
||||
}
|
||||
cout<<endl<<endl;
|
||||
|
||||
T tree(tmp);
|
||||
return tree;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
T GenerateStringsBST(T& bst){
|
||||
ulong dim = getDimension();
|
||||
Vector<string> tmp(dim);
|
||||
|
||||
default_random_engine gen(random_device{}());
|
||||
uniform_int_distribution<int> dist(1,5);
|
||||
|
||||
cout<<"\n\nElements in the tree (in breadth order):\n";
|
||||
for(ulong i = 0; i < dim; ++i){
|
||||
tmp[i] = generateRandomString(dist(gen));
|
||||
cout<<tmp[i]<<" ";
|
||||
}
|
||||
cout<<endl<<endl;
|
||||
|
||||
T tree(tmp);
|
||||
return tree;
|
||||
|
||||
}
|
||||
|
||||
string generateRandomString(ulong dim){
|
||||
default_random_engine gen(random_device{}());
|
||||
uniform_int_distribution<char> character('a','z');
|
||||
char newString[dim+1];
|
||||
for(int i=0;i<dim;i++){
|
||||
newString[i]=character(gen);
|
||||
}
|
||||
newString[dim]='\0';
|
||||
return newString;
|
||||
}
|
||||
|
||||
ulong getDimension(){
|
||||
ulong dimension;
|
||||
std::cout<<"Insert the dimension: ";
|
||||
std::cin>>dimension;
|
||||
return dimension;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,11 +1,111 @@
|
|||
|
||||
#ifndef MYTEST_HPP
|
||||
#define MYTEST_HPP
|
||||
#include"../binarytree/lnk/binarytreelnk.hpp"
|
||||
#include"../bst/bst.hpp"
|
||||
|
||||
/* ************************************************************************** */
|
||||
|
||||
// ...
|
||||
enum class DataType{integer,ffloat,sstring};
|
||||
|
||||
/* ************************************************************************** */
|
||||
/* ---- integer functions ---- */
|
||||
|
||||
template <typename T>
|
||||
void IntegerFunctions(T&);
|
||||
|
||||
template <typename T>
|
||||
void ProductsElementsLessThan(T&);
|
||||
|
||||
void AccumulateProduct(const int&, const void*, void*);
|
||||
|
||||
/* ----- float functions ----- */
|
||||
|
||||
template <typename T>
|
||||
void FloatFunctions(T&);
|
||||
|
||||
template <typename T>
|
||||
void SumElementsGreaterThan(T&);
|
||||
|
||||
void AccumulateSum(const float&, const void*, void*);
|
||||
|
||||
/* ----- string functions ----- */
|
||||
|
||||
template <typename T>
|
||||
void StringFunctions(T&);
|
||||
|
||||
template <typename T>
|
||||
void ConcatLessThan(T&);
|
||||
|
||||
void ConcatAString(const std::string&, const void*, void*);
|
||||
|
||||
/* ---- shared functions ---- */
|
||||
void menu();
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void PrintTree(Tree<DTType>&);
|
||||
|
||||
template <typename Data>
|
||||
void PrintSingleElement(Data& data, void* _);
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void CheckExistence(Tree<DTType>& tree);
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void InsertElement(Tree<DTType>&);
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void RemoveElement(Tree<DTType>&);
|
||||
|
||||
template <typename T>
|
||||
void PrintMinimum(T&);
|
||||
|
||||
template <typename T>
|
||||
void PrintMinimumNDelete(T&);
|
||||
|
||||
template <typename T>
|
||||
void RemoveMin(T&);
|
||||
|
||||
template <typename T>
|
||||
void PrintMaximum(T&);
|
||||
|
||||
template <typename T>
|
||||
void PrintMaximumNDelete(T&);
|
||||
|
||||
template <typename T>
|
||||
void RemoveMax(T&);
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void PrintPredecessor(Tree<DTType>&);
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void PredecessorNRemove(Tree<DTType>&);
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void RemovePredecessor(Tree<DTType>&);
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void PrintSuccessor(Tree<DTType>&);
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void SuccessorNRemove(Tree<DTType>&);
|
||||
|
||||
template <template <typename...> class Tree, typename DTType>
|
||||
void RemoveSuccessor(Tree<DTType>&);
|
||||
|
||||
template <typename T>
|
||||
void NodeOperations(T&);
|
||||
|
||||
|
||||
/* ----- generator functions ----- */
|
||||
|
||||
DataType ChooseDataType(); //choose data type
|
||||
void UseChosenType(DataType);
|
||||
template <typename T>
|
||||
T GenerateIntegerBST(T&);
|
||||
template <typename T>
|
||||
T GenerateFloatBST(T&);
|
||||
template <typename T>
|
||||
T GenerateStringsBST(T&);
|
||||
std::string generateRandomString(ulong);
|
||||
ulong getDimension();
|
||||
|
||||
#endif
|
||||
|
|
|
|||
Loading…
Reference in New Issue