Homework.h

//  
// Created by Roshan on 9/20/2023.  
//  

#ifndef ADTS_PART_II_HOMEWORK_H  
#define ADTS_PART_II_HOMEWORK_H  

#include <set>  
#include <stack>  
#include <queue>  

using namespace std;  

class Homework {  

public:  

    Homework();  
    //homework  
    set<int> setUnion (set<int> a, set<int> b);  
    //write a function that removes all negative values from a stack  
    void removeNegatives(stack<int> &s);  
    //reverse a queue  
    void reverseQueue(queue<int> &q);  
    ~Homework();  

};  


#endif //ADTS_PART_II_HOMEWORK_H

Homework.cpp

//  
// Created by Roshan on 9/20/2023.  
//  

#include "Homework.h"  
#include <set>  
#include <stack>  
#include <queue>  

using namespace std;  

Homework::Homework() {  
    // :]  
}  

set<int> Homework::setUnion(set<int> a, set<int> b) {  
    set<int> c;  
    for (auto itr = a.begin(); itr != a.end(); itr++) {  
        // i think you can't do the for each loop with sets  
        c.insert(*itr);  
    }  
    for (auto itr = b.begin(); itr != b.end(); itr++) {  
        c.insert(*itr);  
    }  
    return c;  
}  

void Homework::removeNegatives(stack<int> &s) {  
    stack<int> temp;  
    while (!s.empty()) {  
        if (s.top() >= 0) {  
            temp.push(s.top());  
        }  
        s.pop();  
    }  
    while (!temp.empty()) {  
        s.push(temp.top());  
        temp.pop();  
    }  
}  

void Homework::reverseQueue(queue<int> &q) {  
    stack<int> temp;  
    while (!q.empty()) {  
        temp.push(q.front());  
        q.pop();  
    }  
    while (!temp.empty()) {  
        q.push(temp.top());  
        temp.pop();  
    }  
}  

Homework::~Homework() {  
    // :]  
}

main.cpp

#include <iostream>  
#include <fstream>  
#include <vector>  
#include <stack>  
#include <queue>  
#include <map>  
#include <set>  
#include <map>  

#include "Homework.h"  

using namespace std;  

bool checkBalance(string str){  
    stack<char> s;  
    for (int i = 0; i < str.length(); i++) {  
        if (str[i] == '(' || str[i] == '[' || str[i] == '{')  
            s.push(str[i]);  
        else if (str[i] == ')') {  
            if (s.empty() || s.top() != '(')  
                return false;  
            else  
                s.pop();  
        }  
        else if (str[i] == ']') {  
            if (s.empty() || s.top() != '[')  
                return false;  
            else  
                s.pop();  
        }  
        else if (str[i] == '}') {  
            if (s.empty() || s.top() != '{')  
                return false;  
            else  
                s.pop();  
        }  
    }  
    return s.empty();  
}  

void testCheckBalance(){  
    if (checkBalance("if (num > 0) { x = 3; } else { x = 4; } [x = 5;] (x = 6;) {(x)=={7}}"))  
        cout << "Balanced!" << endl;  
    else  
        cout << "Not balanced!" << endl;  
}  

void testLetterFrequency() {  
    ifstream infile("file.txt");  
    map<char, int> freqMap;  
    char ch;  
    while (infile >> ch) {  
        ch = toupper(ch);  
        if (freqMap.count(ch) == 0)  
            freqMap.insert({ch, 1});  
        else  
            freqMap.at(ch)++;  // freqMap[ch]++;  
    }  

    for (auto itr = freqMap.begin(); itr != freqMap.end(); itr++) {  
        cout << itr->first << " = " << itr->second << endl;  
    }  

}  

set<int> setIntersection(set<int> setA, set<int> setB) {  
    set<int> setC;  
    for (int num: setA) {  
        if (setB.count(num))  
            setC.insert(num);  
    }  

    return setC;  
}  

void testSetIntersection() {  
    set<int> setA;  
    set<int> setB;  
    for (int i = 1; i <= 5; i++) {  
        setA.insert(i);  
    }  

    for (int i = 3; i <= 10; i++) {  
        setB.insert(i);  
    }  

    set<int> setC = setIntersection(setA, setB);  

    for (auto itr = setC.begin(); itr != setC.end(); itr++) {  
        cout << *itr << " ";  
    }  

    cout << endl;  
}  

void testFriends() {  
    cin.ignore();  
    map<string, set<string>> friends;  
    string line;  
    getline(cin, line);  
    while(!line.empty()) {  
        int pos = line.find(" ");  
        string name1 = line.substr(0, pos);  
        string name2 = line.substr(pos + 1);  
        friends[name1].insert(name2);  
        friends[name2].insert(name1);  
        getline(cin, line);  
    }  

    for (auto itr = friends.begin(); itr != friends.end(); itr++) {  
        cout << itr->first << ": ";  
        for (string person: itr->second) {  
            cout << person << " ";  
        }  
        cout << endl;  
    }  

}  

void testSetUnion() {  
    set<int> setA;  
    set<int> setB;  
    for (int i = 1; i <= 5; i++) {  
        setA.insert(i);  
    }  

    for (int i = 3; i <= 10; i++) {  
        setB.insert(i);  
    }  

    Homework hw;  
    set<int> setC = hw.setUnion(setA, setB);  

    for (auto itr = setC.begin(); itr != setC.end(); itr++) {  
        cout << *itr << " ";  
    }  

    cout << endl;  
}  

void testRemoveNegatives(){  
    stack<int> s;  
    s.push(1);  
    s.push(-2);  
    s.push(3);  
    s.push(-4);  
    s.push(5);  
    s.push(-6);  
    s.push(7);  
    s.push(-8);  
    s.push(9);  
    s.push(-10);  
    Homework hw;  
    hw.removeNegatives(s);  
    while (!s.empty()) {  
        cout << s.top() << " ";  
        s.pop();  
    }  
    cout << endl;  
}  

void testReverseQueue(){  
    queue<int> q;  
    q.push(1);  
    q.push(2);  
    q.push(3);  
    q.push(4);  
    Homework hw;  
    hw.reverseQueue(q);  
    while (!q.empty()) {  
        cout << q.front() << " ";  
        q.pop();  
    }  
}  

int main() {  
    cout << "Hooray for ADTs!" << endl;  
    cout << "Choice?" << endl;  
    int choice;  
    cin >> choice;  
    if (choice == 0)  
        testCheckBalance();  
    else if (choice == 1)  
        testLetterFrequency();  
    else if (choice == 2)  
        testSetIntersection();  
    else if (choice == 3)  
        testFriends();  
    else if (choice == 4)  
        testSetUnion();  
    else if (choice == 5)  
        testRemoveNegatives();  
    else if (choice == 6)  
        testReverseQueue();  
    return 0;  
}