#ifndef DISPLAY_MANAGER_H
#define DISPLAY_MANAGER_H

#include "HashTable.h"
#include "BinarySearchTree.h"
#include "CPU.h"

template<typename T>
class DisplayManager {
private:
    HashTable<T> hashTable;
    BinarySearchTree<std::string> bst;

public:
    DisplayManager(HashTable<T>& ht, BinarySearchTree<std::string>& bst);
    ~DisplayManager();

    void displayAll() const;
    void displayTree() const;
};

template<typename T>
DisplayManager<T>::DisplayManager(HashTable<T> &ht, BinarySearchTree<std::string> &bst) {
    this->hashTable = ht;
    this->bst = bst;
}

template<typename T>
DisplayManager<T>::~DisplayManager() {
    // No dynamic memory allocation, so no cleanup needed
}

template<typename T>
void DisplayManager<T>::displayAll() const {
    std::cout << "All CPUs in the database:" << std::endl;

    // Iterate over the HashTable and display each CPU
    for (int i = 0; i < hashTable.getSize(); i++) {
        if (hashTable.getItem(i) != nullptr) {
            std::cout << *(hashTable.getItem(i)) << std::endl;
        }
    }
}

template<typename T>
void DisplayManager<T>::displayTree() const {
    std::cout << "CPU Binary Search Tree:" << std::endl;

    // Call the BST's inorder traversal method to display the tree
    // TODO: Use a proper display function
    bst.inOrder([](const std::string& key) {
        std::cout << key << std::endl;
    });
}

#endif