std :: sort 오류 :

Question

Node 클래스의 일부 인스턴스와 Node 클래스의 벡터를 만든 다음 해당 인스턴스를 벡터 에 푸시했고 함수 객체 "ListCompare"를 만들어 벡터를 정렬했습니다.

하지만 정렬 기능에서 "ListCompare"유형의 개체 호출에 대해 일치하는 함수가 없습니다.

왜 오류가 발생합니까?

아래 코드와 오류가 작성되었습니다.

#include <iostream> 
#include "cocos2d.h" 

using namespace cocos2d; 

class Node 
{ 

public: 
    Node(int x,int y,CCPoint playerTilePos): m_tilePosX(x),m_tilePosY(y),m_costFromStart(0),m_costFromNextToGoal(0),m_playerTilePos(playerTilePos){}; 
    Node(const Node &obj); 
    virtual ~Node(){}; 

    int getPosX(void) const { return m_tilePosX; } 
    int getPosY(void) const { return m_tilePosY; } 

    int getTotalCost(void) const { return m_costFromStart + m_costFromNextToGoal; } 

    int getConstFromStart(void) const { return m_costFromStart; } 
    void setCostFromStart(int var) { m_costFromStart = var; } 

    int getCostFromNextToGoal(void)const { return (std::abs((int)m_playerTilePos.x - m_tilePosX) + std::abs((int)m_playerTilePos.y - m_tilePosY));} 
    void setCostNextToGoal(int var) { m_costFromNextToGoal = var; } 


    bool operator == (Node node) 
    { 
     return (m_tilePosX == node.m_tilePosX && m_tilePosY == node.m_tilePosY); 
    } 



    void operator = (Node node) 
    { 
     m_tilePosX = node.m_tilePosX; 
     m_tilePosY = node.m_tilePosY; 
     m_costFromStart = node.m_costFromStart; 
     m_costFromNextToGoal = node.m_costFromNextToGoal; 
    } 





private: 

    int m_tilePosX; 
    int m_tilePosY;  
    int m_costFromStart; 
    int m_costFromNextToGoal; 
    CCPoint m_playerTilePos; 
}; 


std::vector<Node>List; 



class ListCompare{ 
public: 
    bool operator()(Node& pNode1,Node& pNode2) 
    { 
      return pNode1.getTotalCost() > pNode2.getTotalCost(); 
    } 
}; 








//-------------------------------------------------------------- 
//　　　　　　　　　　　　　START 
//-------------------------------------------------------------- 

void main() 
{ 

    List openList; 

    //initialize 
    CCPoint pos = ccp(100,100); 

    Node startNode(10,10,pos); 

    //cost is 1000 
    startNode.setCostNextToGoal(1000); 

    std::cout << startNode.getTotalCost << std::endl; //totalcost = 0 + 1000 = 1000 

    openList.pushBack(startNode); 



    Node nextNode(20,20,pos); 

    NextNode.setCostNextToGoal(2000); 

    std::cout << NextNode.getTotalCost << std::endl; //totalcost = 0 + 2000 = 2000 


    openList.pushBack(NextNode); 


    std::sort(openList.begin(),openList.end(),ListCompare()); 

} 

-------------------------------- 오류 --------- ------------------------- ListCompare::operator()에서

template<typename _Tp, typename _Compare> 
    inline const _Tp& 
    __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) 
    { 
     // concept requirements 
     __glibcxx_function_requires(_BinaryFunctionConcept<_Compare,bool,_Tp,_Tp>) 

     if (__comp(__a, __b)) //the error part."No matching function for call to object of type "ListCompare" " 
    if (__comp(__b, __c)) 
     return __b; 
    else if (__comp(__a, __c)) 
     return __c; 
    else 
     return __a; 
    else if (__comp(__a, __c)) 
     return __a; 
    else if (__comp(__b, __c)) 
     return __c; 
    else 
     return __b; 
} 

Answer 1

당신은 const를 참조로 매개 변수를 취할 필요가있다.

class ListCompare 
{ 
public: 
    bool operator()(const Node& pNode1, const Node& pNode2) const 
    { 
     return pNode1.getTotalCost() > pNode2.getTotalCost(); 
    } 
};