TO SOLVE IT, ONLY WORK ON MINIDEQUE.H FILE (I listed it at the bottom along with Main.cpp).

Main.cpp is given and does not need to be changed, unless needed to to test the program.

Here is the prompt: Introduction The Standard Library provides stack and queue classes (std::stack and std::queue), but they are actually adapters (a kind of wrapper) for the Standard Librarys deque class (std::deque). Deques allow you to add items or remove them from either end of the deque (e.g., push_back, push_front, pop_back, and pop_front). Most Standard Library implementations of std::deque use two back-to-back vectors, a fronthalf vector that you call push_back on when you need to push to the front of the deque, and a backhalf vector that you call push_back on when you need to push to the back of the queue. minideque std::vector fronthalf std::vector backhalf push_front(value) fronthalf.push_back(value) push_back(value) backhalf.push_back(value) pop_front(value) fronthalf.pop_back(value) * pop_back() backhalf.pop_back() * front() usually calls fronthalf.back() -- if fronthalf is empty, will have to call backhalf.front() back() usually calls backhalf.back() -- if backhalf is empty, will have to call fronthalf.front() operator[](i) returns the i-th element of the deque, could be in fronthalf or backhalf. Note that element 0 is the top element of frontvector. The logic needs some adjusting if pop_back is called when the backhalf vector is empty, or if pop_front is called when the fronthalf vector is empty. In those cases, you will want to re-balance the values between the two vectors, making sure you keep the queue items in order - move half the values from fronthalf to backhalf, or vice-versa. It will take a little time to get this part to work correctly. Do not expect it to take 5-10 minutes. Objective You are given a partial implementation of a mini-deque class. minidequeis a templated class that holds the deque. Unlike the actual std::deque class, minideque will NOT have the iterator classes (iterator, const_iterator, reverse_iterator, and const_reverse_iterator). This means you will also NOT have to provide the iterator-based functions: erase, begin and end. For this project, you should use the std::vector class from the C++ standard library. Complete the implementation of class minideque, adding public/private member variables and functions as needed. Your code is tested in the provided main.cpp. Source Code Files You are given skeleton code files with declarations that may be incomplete and without any implementation. Implement the code and ensure that all the tests in main.cpppass successfully. minideque.h:This is to be completed main.cpp: This calls a test function (in minideque.h) that tests the output of your minideque class. You may wish to add additional tests, based on the ones already provided. README.md:You must edit this file to include the name and CSUF email of each student in your group. Do this even if you are working by yourself. This information will be used so that we can enter your grades into Titanium. Hints As you start implementing the minidequeclass, comment out the tests in main.cpp that you havent implemented yet in your class. As you fill in the code for your class, uncomment the matching tests to make sure your class is working. Keep testing your code as you implement it. It is much easier to debug one method in your class than all of the methods at the same time. Do not wait till the very end to test your code. When you complete your project, all of the tests should run correctly. Expected output of running the program is provided below. Speak to your teachers if you need help designing your approach, or are having trouble compiling or debugging your code. const errors can frequently prevent your code from compiling. Note also that it is possible to be 95% of the way finished, but have the impression you are miles away. Your instructor can help you get over that final 5% if you need help. Dont hesitate to ask. EXPECTED OUTPUT: PASSED dq[0] == dq.front(): expected and received 1 PASSED dq[0] == 9: expected and received 9 PASSED dq.front() == 1: expected and received 1 PASSED dq.back() == 9: expected and received 9 PASSED dq.front() == dq.push_front(el): expected and received 2 PASSED dq.front() == dq.push_front(el): expected and received 3 PASSED dq.front() == dq.push_front(el): expected and received 4 PASSED dq.front() == dq.push_front(el): expected and received 5 PASSED dq.front() == dq.push_front(el): expected and received 6 PASSED dq.front() == dq.push_front(el): expected and received 7 PASSED dq.front() == dq.push_front(el): expected and received 8 PASSED dq.back() == dq.push_back(el): expected and received 10 PASSED dq.back() == dq.push_back(el): expected and received 11 PASSED dq.back() == dq.push_back(el): expected and received 12 PASSED dq.back() == dq.push_back(el): expected and received 13 PASSED dq.back() == dq.push_back(el): expected and received 14 PASSED dq.back() == dq.push_back(el): expected and received 15 PASSED dq.back() == dq.push_back(el): expected and received 16 PASSED dq.back() == dq.push_back(el): expected and received 17 PASSED dq.back() == dq.push_back(el): expected and received 18 PASSED dq.back() == dq.push_back(el): expected and received 19 PASSED assign to array index: expected and received 9999 PASSED read from array index: expected and received 9999 clearing the minideque... NOTE: the minideque keeps REBALANCING the front/back to have similar # entries dq.pop_front() ==> 7 6 5 4 3 2 1 | 9 10 11 12 13 14 15 16 17 18 19 , front:7, back:19, size:18 dq.pop_front() ==> 6 5 4 3 2 1 | 9 10 11 12 13 14 15 16 17 18 19 , front:6, back:19, size:17 dq.pop_front() ==> 5 4 3 2 1 | 9 10 11 12 13 14 15 16 17 18 19 , front:5, back:19, size:16 dq.pop_front() ==> 4 3 2 1 | 9 10 11 12 13 14 15 16 17 18 19 , front:4, back:19, size:15 dq.pop_front() ==> 3 2 1 | 9 10 11 12 13 14 15 16 17 18 19 , front:3, back:19, size:14 dq.pop_front() ==> 2 1 | 9 10 11 12 13 14 15 16 17 18 19 , front:2, back:19, size:13 dq.pop_front() ==> 1 | 9 10 11 12 13 14 15 16 17 18 19 , front:1, back:19, size:12 dq.pop_front() ==> | 9 10 11 12 13 14 15 16 17 18 19 , front:9, back:19, size:11 dq.pop_front() ==> 10 11 12 13 14 | 15 16 17 18 19 , front:10, back:19, size:10 PASSED rebalancing fronthalf and backhalf vectors: expected and received 5 dq.pop_front() ==> 11 12 13 14 | 15 16 17 18 19 , front:11, back:19, size:9 dq.pop_front() ==> 12 13 14 | 15 16 17 18 19 , front:12, back:19, size:8 dq.pop_front() ==> 13 14 | 15 16 17 18 19 , front:13, back:19, size:7 dq.pop_front() ==> 14 | 15 16 17 18 19 , front:14, back:19, size:6 dq.pop_front() ==> | 15 16 17 18 19 , front:15, back:19, size:5 dq.pop_front() ==> 16 17 | 18 19 , front:16, back:19, size:4 PASSED rebalancing fronthalf and backhalf vectors: expected and received 2 dq.pop_front() ==> 17 | 18 19 , front:17, back:19, size:3 dq.pop_front() ==> | 18 19 , front:18, back:19, size:2 dq.pop_front() ==> | 19 , front:19, back:19, size:1 dq.pop_front() ==> minideque is empty Passed: 25 out of: 25 total tests. ...done. Program ended with exit code: 0

MAIN.CPP GIVEN: // // minideque_project_main.cpp // minideque_project // // #include #include "minideque.h" template bool testAnswer(const std::string& nameOfTest, const T& received, const T& expected); size_t testsPassed = 0; size_t testsFailed = 0; void test_minideque() { minideque dq; dq.push_back(9); testAnswer("dq[0] == dq.front()", dq[0] == dq.front(), true); testAnswer("dq[0] == 9", dq[0], 9); dq.push_front(1); testAnswer("dq.front() == 1", dq.front(), 1); testAnswer("dq.back() == 9", dq.back(), 9); std::vector valuesfront = { 2, 3, 4, 5, 6, 7, 8 }; std::vector valuesback = { 10, 11, 12, 13, 14, 15, 16, 17, 18, 19 }; for (auto el : valuesfront) { dq.push_front(el); testAnswer("dq.front() == dq.push_front(el)", dq.front(), el); } for (auto el : valuesback) { dq.push_back(el); testAnswer("dq.back() == dq.push_back(el)", dq.back(), el); } int value = 9999; dq[0] = value; testAnswer("assign to array index", dq[0], value); testAnswer("read from array index", dq[0], value); std::cout << " clearing the minideque... "; std::cout << "NOTE: the minideque keeps REBALANCING the front/back to have similar # entries "; while (!dq.empty()) { dq.pop_front(); std::cout << "dq.pop_front() ==> " << dq << " "; if (!dq.empty()) { if (dq.front() == 10 || dq.front() == 16) { testAnswer("rebalancing fronthalf and backhalf vectors", dq.fronthalfsize(), dq.backhalfsize()); } } } std::cout << " Passed: " << testsPassed << " out of: " << testsPassed + testsFailed << " total tests. "; } template bool testAnswer(const std::string& nameOfTest, const T& received, const T& expected) { if (received == expected) { std::cout << "PASSED " << nameOfTest << ": expected and received " << received << std::endl; ++testsPassed; return true; } std::cout << "FAILED " << nameOfTest << ": expected " << expected << " but received " << received << std::endl; ++testsFailed; return false; } int main(int argc, const char * argv[]) { test_minideque(); std::cout << " \t\t...done. "; return 0; }

MINIDEQUE.H GIVEN: // // minideque.h // minidequeproject // #ifndef minideque_h #define minideque_h #include #include #include #include #include template class minideque { private: std::vector fronthalf_; std::vector backhalf_; public: minideque() = default; // do not change, C++ defaults are ok minideque(const minideque& other) = default; // rule of three minideque& operator=(const minideque& other) = default; ~minideque() = default; size_t size() const; // TODO size_t fronthalfsize() const; // TODO size_t backhalfsize() const; // TODO bool empty() const; // TODO { if(top == -1) return true; else return false; } // balance queue across both vectors if pop_front/back is requested on an empty vector // e.g., minideque has this: | ABCDEFG // after pop_front BCD | EFG (A discarded) // symmetric logic for converse case: ABCDEFG | ===> ABC | DEF (G discarded) after pop_back void pop_front(); // TODO void pop_back(); // TODO void push_front(const T& value); // TODO void push_back(const T& value); // TODO const T& front() const; // TODO const T& back() const; // TODO T& front(); // TODO T& back(); // TODO const T& operator[](size_t index) const; // TODO T& operator[](size_t index); // TODO void clear(); // TODO friend std::ostream& operator<<(std::ostream& os, const minideque& dq) { // do not change if (dq.empty()) { return os << "minideque is empty"; } dq.printFronthalf(os); os << "| "; dq.printBackhalf(os); os << ", front:" << dq.front() << ", back:" << dq.back() << ", size:" << dq.size(); return os; } void printFronthalf(std::ostream& os=std::cout) const { // do not change if (empty()) { std::cout << "fronthalf vector is empty"; } for (typename std::vector::const_reverse_iterator crit = fronthalf_.crbegin(); crit != fronthalf_.crend(); ++crit) { os << *crit << " "; } } void printBackhalf(std::ostream& os=std::cout) const { // do not change if (empty()) { os << "backhalf vector is empty"; } for (typename std::vector::const_iterator cit = backhalf_.cbegin(); cit != backhalf_.cend(); ++cit) { os << *cit << " "; } } }; #endif /* minideque_h */