I am receiving the following error:
Invalid operands to binary expression ("
basic_ostream<char,std::_1::char_traits<char>>
' and 'value_type
' (aka 'qElem
')) which occurs at:cout << "Your first task is to: " << tasks.front() << endl;
The code suggest I place a &
at &tasks.front()
but I do not want to receive a value of 0xfdlkajd
, I want the first value stored within my vector. Any help will be greatly appreciated.
My code:
#ifndef Queue_queue_h
#define Queue_queue_h
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct qElem { //qElem Struct
string s;
string p;
qElem(string task, string priority) : s(task), p(priority) {}
};
//Establishing my Template and PriQueue Class
template <class T> //Template
class PriQueue
{
public:
vector<qElem> tasks;
//PriQueue();
void enqueue(T str, int pri); //Adds to queue
void dequeue(); //Deletes from queue
void peek(); //Prints the first value in queue
void size(); //Prints how many in queue
void sort(vector<qElem*> &tasks); //Sort according to priority
private:
int count = 0;
};
template <class T1>
void PriQueue<T1>::enqueue(T1 str, int pri) //Adding an element to the queue
{
tasks.push_back(qElem(str, pri));
sort(tasks); //NEW ERROR IS HERE
count++;
}
template <class T1>
void PriQueue<T1>::dequeue() //Removing an element from the front of the queue
{
//tasks.erase(tasks.begin());
tasks.erase(tasks.begin());
if (tasks.empty()) {
cout << "You have no tasks!" << endl;
}
else {
}
count--;
}
template <class T1>
void PriQueue<T1>::peek() //Returning a value at front of the queue (NOT removing it)
{
if (tasks.empty()) {
cout << "You have no tasks!" << endl;
}
else {
cout << "Your first task is to: " << tasks.front().s << endl;
}
//Testing Purposes only
/*
cout << "Your tasks are:";
for (typename vector<T1>::iterator i = tasks.begin() ; i != tasks.end(); ++i)
cout << " " << *i << ",";
cout << endl;
*/
}
template <class T1>
void PriQueue<T1>::size() //Returning the number of items in the queue.
{
cout << "You have " << count << " tasks in queue." << endl;
}
template <class T>
void PriQueue<T>::sort(vector<qElem*> &tasks) {
bool sortUp = true;
for(int i = 0; i < tasks.size();i++)
for(int j = i+1; j < tasks.size(); j++)
{
if(sortUp)
{
if(tasks[i] > tasks[j])
swap(tasks[i],tasks[j]);
}
else if(tasks[i] < tasks[j]) //else sortDown
swap(tasks[i],tasks[j]);
}
}
#endif
The compiler has no idea how to print out a qElem
. If you want to print out the task only, use cout << "..." << tasks.front().s << endl;
. The compiler knows how to print a std::string
. (You can also implement your own operator <<
overload for qElem
, but that's probably overkill in this case.)
Note that your code has lots of problems. Why are you using a template PriQueue
when your qElem
only stores std::string
s? Why are you using class members ( ss
and pp
) to store temporary values in your constructor? Is your priority an int
(constructor) or a std::string
( qElem
) or a T
?
qElem must implement the operator<<
struct qElem { //qElem Struct
string s;
string p;
qElem(string task, string priority) : s(task), p(priority) {}
std::ostream& operator<<(std::ostream& os, const qElem & obj)
{
os << s << "/" << p;
return os;
}
};
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.