xfarrow
/
lasd
mirror of https://github.com/xfarrow/lasd.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Library 4 

graphical enhancements
This commit is contained in:
Alessandro Ferro 2021-05-18 09:33:25 +02:00
parent aa71e72169
commit 2c8b963e74
1 changed files with 44 additions and 44 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

88
librerie/exercise4/zmytest/test.cpp
View File

@ -79,25 +79,25 @@ void IntegerFunctions(BST<Data>& bst){
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<<" 4. Insert an element [Insert]"<<std::endl;
std::cout<<" 5. Remove an element [Remove]"<<std::endl;
std::cout<<" 6. Print the minimum element [Min]"<<std::endl;
std::cout<<" 7. Print the minimum element and remove it [Min and Remove]"<<std::endl;
std::cout<<" 8. Remove the minimum element [Remove Min]"<<std::endl;
std::cout<<" 9. Print the maximum element [Max]"<<std::endl;
std::cout<<" 10. Print the maximum element and remove it [Max and Remove]"<<std::endl;
std::cout<<" 11. Remove the maximum element [Remove Max]"<<std::endl;
std::cout<<" 12. Print the predecessor of a given element [Predecessor]"<<std::endl;
std::cout<<" 13. Remove and print the predecessor of a given element [Predecessor and Remove]"<<std::endl;
std::cout<<" 14. Remove the predecessor of a given element [Remove Predecessor]"<<std::endl;
std::cout<<" 15. Print the predecessor of a given element [Successor]"<<std::endl;
std::cout<<" 16. Remove and print the successor of a given element [Successor and Remove]"<<std::endl;
std::cout<<" 17. Remove the successor of a given element [Remove Successor]"<<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;
@ -195,25 +195,25 @@ void FloatFunctions(BST<Data>& bst){
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<<" 4. Insert an element [Insert]"<<std::endl;
std::cout<<" 5. Remove an element [Remove]"<<std::endl;
std::cout<<" 6. Print the minimum element [Min]"<<std::endl;
std::cout<<" 7. Print the minimum element and remove it [Min and Remove]"<<std::endl;
std::cout<<" 8. Remove the minimum element [Remove Min]"<<std::endl;
std::cout<<" 9. Print the maximum element [Max]"<<std::endl;
std::cout<<" 10. Print the maximum element and remove it [Max and Remove]"<<std::endl;
std::cout<<" 11. Remove the maximum element [Remove Max]"<<std::endl;
std::cout<<" 12. Print the predecessor of a given element [Predecessor]"<<std::endl;
std::cout<<" 13. Remove and print the predecessor of a given element [Predecessor and Remove]"<<std::endl;
std::cout<<" 14. Remove the predecessor of a given element [Remove Predecessor]"<<std::endl;
std::cout<<" 15. Print the predecessor of a given element [Successor]"<<std::endl;
std::cout<<" 16. Remove and print the successor of a given element [Successor and Remove]"<<std::endl;
std::cout<<" 17. Remove the successor of a given element [Remove Successor]"<<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;
@ -311,20 +311,20 @@ void StringFunctions(BST<Data>& bst){
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<<" 4. Insert an element [Insert]"<<std::endl;
std::cout<<" 5. Remove an element [Remove]"<<std::endl;
std::cout<<" 6. Print the minimum element [Min]"<<std::endl;
std::cout<<" 7. Print the minimum element and remove it [Min and Remove]"<<std::endl;
std::cout<<" 8. Remove the minimum element [Remove Min]"<<std::endl;
std::cout<<" 9. Print the maximum element [Max]"<<std::endl;
std::cout<<" 10. Print the maximum element and remove it [Max and Remove]"<<std::endl;
std::cout<<" 11. Remove the maximum element [Remove Max]"<<std::endl;
std::cout<<" 12. Print the predecessor of a given element [Predecessor]"<<std::endl;
std::cout<<" 13. Remove and print the predecessor of a given element [Predecessor and Remove]"<<std::endl;
std::cout<<" 14. Remove the predecessor of a given element [Remove Predecessor]"<<std::endl;
std::cout<<" 15. Print the predecessor of a given element [Successor]"<<std::endl;
std::cout<<" 16. Remove and print the successor of a given element [Successor and Remove]"<<std::endl;
std::cout<<" 17. Remove the successor of a given element [Remove Successor]"<<std::endl;
std::cout<<" 18. Node-level operations (debug)"<<std::endl;
std::cout<<" 19. Go back"<<std::endl;
std::cout<<" 20. Quit"<<std::endl;