107 lines
2.6 KiB
C++
107 lines
2.6 KiB
C++
/*
|
|
Name: UndoManager
|
|
Written By: Kevin Galvan Serrano
|
|
Modified By:
|
|
Purpose: Manage the undo delete functionality
|
|
Input: HashTable, BinarySearchTree, and Stack objects
|
|
Output: Messages confirming undo operations
|
|
Procedure: Uses a Stack to keep track of deleted CPUs and reinserts them when undoing a deletion
|
|
*/
|
|
|
|
/*
|
|
Name: addToUndoStack
|
|
Written By: Kevin Galvan Serrano
|
|
Modified By:
|
|
Purpose: Add a deleted CPU to the undo stack
|
|
Input: CPU object
|
|
Output: None
|
|
Procedure: Pushes the deleted CPU onto the undo stack
|
|
*/
|
|
|
|
/*
|
|
Name: undoDelete
|
|
Written By: Kevin Galvan Serrano
|
|
Modified By:
|
|
Purpose: Undo the most recent CPU deletion
|
|
Input: None
|
|
Output: Message confirming the undo operation
|
|
Procedure: Pops a CPU from the undo stack and reinserts it into the HashTable and BinarySearchTree
|
|
*/
|
|
|
|
#ifndef UNDO_MANAGER_H
|
|
#define UNDO_MANAGER_H
|
|
|
|
#include "HashTable.h"
|
|
#include "BinarySearchTree.h"
|
|
#include "Stack.h"
|
|
#include "CPU.h"
|
|
|
|
template<typename T>
|
|
class UndoManager {
|
|
private:
|
|
HashTable<T> *hashTable;
|
|
BinarySearchTree<std::string> *bst;
|
|
Stack<T> *undoStack;
|
|
|
|
public:
|
|
UndoManager(HashTable<T> *ht, BinarySearchTree<std::string> *bst);
|
|
|
|
~UndoManager();
|
|
|
|
void addToUndoStack(const T &cpu);
|
|
|
|
void undoDelete();
|
|
|
|
void clearUndoStack();
|
|
};
|
|
|
|
template<typename T>
|
|
UndoManager<T>::UndoManager(HashTable<T> *ht, BinarySearchTree<std::string> *bst) {
|
|
this->hashTable = ht;
|
|
this->bst = bst;
|
|
this->undoStack = new Stack<CPU>();
|
|
}
|
|
|
|
template<typename T>
|
|
UndoManager<T>::~UndoManager() {
|
|
delete undoStack;
|
|
}
|
|
|
|
template<typename T>
|
|
void UndoManager<T>::addToUndoStack(const T &cpu) {
|
|
undoStack->push(cpu);
|
|
}
|
|
|
|
template<typename T>
|
|
void UndoManager<T>::undoDelete() {
|
|
if (!undoStack->isEmpty()) {
|
|
T lastDeleted = undoStack->pop();
|
|
|
|
// Check if the CPU is already in the HashTable
|
|
T foundCPU;
|
|
foundCPU.setCpuId(lastDeleted.getCpuId());
|
|
if (hashTable->search(foundCPU, foundCPU, key_to_index) != -1) {
|
|
std::cout << "Undo failed: CPU \"" << lastDeleted.getCpuId() << "\" already exists in the HashTable." << std::endl;
|
|
return;
|
|
}
|
|
|
|
// Reinsert the CPU into the HashTable and BST
|
|
hashTable->insert(lastDeleted, key_to_index);
|
|
bst->insert(lastDeleted.getCpuId());
|
|
|
|
std::cout << "Undo successful. CPU reinserted:" << std::endl;
|
|
std::cout << lastDeleted << std::endl;
|
|
} else {
|
|
std::cout << "No deletions to undo." << std::endl;
|
|
}
|
|
}
|
|
|
|
template<typename T>
|
|
void UndoManager<T>::clearUndoStack() {
|
|
while (!undoStack->isEmpty()) {
|
|
undoStack->pop();
|
|
}
|
|
}
|
|
|
|
#endif
|