我无法对包含指向模板类对象的指针的列表进行排序。 模板
class Node{
public:
Node(void){}
Node(T choice, vector<T> & data);
Node(T choice, vector<T> & data, player p, int level, int pos, Node<T> *pred, which side);
void addNodes(void);
static list<Node<T> * > Nodes;
friend class MyBinomialTree<Node<T>, T>;
bool sorter(const Node<T> * lhs, const Node<T> * rhs);// as * &lhs doesn't work too
private:
Node<T> * left;
Node<T> * right;
T chosen_;
vector<T> data_;
bool isLeaf;
//...
};
课外:
template<class T>
bool Node<T>::sorter(const Node<T> * lhs, const Node<T> * rhs){
if((*lhs).level_==(*rhs).level_){
return (*lhs).pos_<(*rhs).pos_;
}else{
return (*lhs).level_<(*rhs).level_;
}
}
然后我想在打印前排序,我有
template<class T>
void Node<T>::print(void){
std::sort(Node<T>::Nodes.begin(),Node<T>::Nodes.end(),&Node<T>::sorter);
cout<<endl<<"after sort:"<<endl;
list<Node<T> * >::iterator it=Node<T>::Nodes.begin();cout<<endl;
while(it!=Node<T>::Nodes.end()){
//...
}
}
错误:
c:\program files\microsoft visual studio 10.0\vc\include\algorithm(3806): error C2784: 'std::complex<_Other> std::operator -(const _Ty &,const std::complex<_Other> &)' : could not deduce template argument for 'const std::complex<_Other> &' from 'std::_List_iterator<_Mylist>'
with
[
_Mylist=std::_List_val<Node<int> *,std::allocator<Node<int> *>>
]
c:\program files\microsoft visual studio 10.0\vc\include\xcomplex(52) : see declaration of 'std::operator -'
c:\documents and settings\cf16r\moje dokumenty\visual studio 2010\projects\binomial_tree\binomial_tree\mybinomialtree.h(136) : see reference to function template instantiation 'void std::sort<std::_List_iterator<_Mylist>,bool(__thiscall Node<T>::* )(const Node<T> *,const Node<T> *)>(_RanIt,_RanIt,_Pr)' being compiled
with
[
_Mylist=std::_List_val<Node<int> *,std::allocator<Node<int> *>>,
T=int,
_RanIt=std::_List_iterator<std::_List_val<Node<int> *,std::allocator<Node<int> *>>>,
_Pr=bool (__thiscall Node<int>::* )(const Node<int> *,const Node<int> *)
]
答案 0 :(得分:3)
std::sort
需要随机访问迭代器,因此它不能与std::list
迭代器一起使用。
http://msdn.microsoft.com/en-us/library/ecdecxh1(v=vs.100).aspx
请务必仔细阅读模板功能的文档。模板错误可能是一个噩梦。
编辑:
正如Christian所说,std::list
有自己的排序方法。您可以进行以下两项更改:
bool sorter(const Node<T> * lhs, const Node<T> * rhs);
static bool sorter(const Node<T> * lhs, const Node<T> * rhs);
std::sort(Node<T>::Nodes.begin(),Node<T>::Nodes.end(),&Node<T>::sorter);
Nodes.sort(&Node<T>::sorter);