【发布时间】:2014-05-23 23:38:34
【问题描述】:
我收到以下错误:
二进制表达式的操作数无效(“
basic_ostream<char,std::_1::char_traits<char>>”和“value_type”(又名“qElem”)) 发生在:cout << "Your first task is to: " << tasks.front() << endl;
代码建议我在&tasks.front() 处放置一个&,但我不想接收0xfdlkajd 的值,我希望将第一个值存储在我的向量中。任何帮助将不胜感激。
我的代码:
#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
【问题讨论】:
-
qElem 必须实现操作符
-
@agrum 我有另一个相对的错误问题,我只是认为为它创建一个全新的问题是一种浪费。我已经更新了上面的代码并添加了排序功能。现在我正在尝试在我的入队函数中使用该排序函数,但出现以下错误:对类型“vector
”的非 const 左值引用不能绑定到不相关类型“value_type”的值(又名“qElem” ) 我做错了什么?
标签: c++ data-structures vector