1

我正在尝试对包含我制作的对象的节点向量进行排序。我要比较的是该对象的值（相关性）。我收到一个错误：

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();
        }
}
4

1 回答 1

4

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());
}
于 2013-11-06T19:59:04.723 回答