我正在尝试对节点的 vector 进行排序,这些节点的数据包含我创建的对象。我正在比较的东西是该对象的值(相关性)。我收到一个错误:
BST.h:148: error: argument of type âbool (BST<Play>::)(BST<Play>::node*, BST<Play>::node*)â does not match âbool (BST<Play>::*)(BST<Play>::node*, BST<Play>::node*)â
我从未见过像这样的错误,它在我称之为“排序”的那一行被调用。
#ifndef BST_H
#define BST_H
#include "Play.h"
#include <algorithm>
#include <vector>
#include <iostream>
template<typename T>
class BST
{
public:
struct node{
T data;
node *left;
node *right;
node *parent;
node(const T & theData, node *lt, node *rt, node *pt):
data(theData), left(lt), right(rt), parent(pt) {}
};
std::vector<node*> tempVec;
bool sorterFunc(node* x, node* y) {
return (y->data.getRelevance() < x->data.getRelevance());
}
void list(std::string offense, std::string defense, int downforplay, int yardstogo, int yardline, int minutes, node* &t, int level){
tempVec.clear();
float relevance;
if(t==NULL){
return;
}
if(level ==1){
tempCount--;
if(offense==t->data.getoTeam()){
if(downforplay==t->data.getDown()){
int yardabove = yardstogo+1;
int yardbelow = yardstogo-1;
if(yardstogo==t->data.getYard() || yardbelow==t->data.getYard() || yardabove==t->data.getYard()){
if(yardline >= t->data.getStartLoc() - percentback(yardline) && yardline <= (t->data.getStartLoc() + percentback(yardline))){
relevance= -((float)abs(minutes - t->data.getMinutes())*(float(5/3)) + (float)abs(yardstogo - t->data.getYard()) + (float)abs(yardline - t->data.getStartLoc()));
if(defense == t->data.getdTeam())
relevance += 100;
t->data.setRelevance(relevance);
tempVec.push_back(t);
}
}
}
}
}
else{
list(offense, defense, downforplay, yardstogo, yardline, minutes, t->left, level-1);
list(offense, defense, downforplay, yardstogo, yardline, minutes, t->left, level-1);
}
}
void listFunc(std::string offense, std::string defense, int downforplay, int yardstogo, int yardline, int n, int minutes){
tempCount = treeCount;
for(int i=1; tempCount>0; i++)
list(offense, defense, downforplay, yardstogo, yardline, minutes, root, i);
std::sort(tempVec.begin(), tempVec.end(), sorterFunc);
for(int i=0; i<n; i++)
std::cout << tempVec[i]->data.getwholePlay() << std::endl << tempVec[i]->data.getRelevance();
}
}
最佳答案
sorterFunc
是成员函数。因此,它只能在实例上运行。但是,您尝试将其用作比较node*
的函数:
std::sort(tempVec.begin(), tempVec.end(), sorterFunc);
现在,
std::sort
将在某个位置调用sorterFunc
,但这将失败,因为没有可使用的实例: sorterFunc( someNodePointer, someOtherNodePointer);
// ^^. missing instance
您不希望
sorterFunc
在任何实例上运行。改为static
:static bool sorterFunc(node* x, node* y) {
return (y->data.getRelevance() < x->data.getRelevance());
}