我有一个名为HPC_user的类,并尝试按降序排列HPC_user的向量,其中一个成员变量为活动。似乎std :: sort应该用第三个参数完成工作。所以我遵循这个线程并定义了一个更大的新结构。
Sorting a vector in descending order
struct cpuComp
{
bool operator()(HPC_user const & a, HPC_user const & b)
{
return a.get_activity() > b.get_activity();
}
};
int main()
{
// do something;
std::vector<HPC_user> users = db2class(ins, days);
std::sort(users[0], users[len], cpuComp());
//.....
}
当我编译代码时,我遇到了一些错误:
In file included from db2class.cpp:3:
In file included from /usr/include/c++/4.2.1/iostream:44:
In file included from /usr/include/c++/4.2.1/ostream:44:
In file included from /usr/include/c++/4.2.1/ios:44:
In file included from /usr/include/c++/4.2.1/bits/char_traits.h:45:
In file included from /usr/include/c++/4.2.1/bits/stl_algobase.h:74:
/usr/include/c++/4.2.1/bits/stl_iterator_base_types.h:128:35: error: no type named 'iterator_category' in 'HPC_user'
typedef typename _Iterator::iterator_category iterator_category;
~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/usr/include/c++/4.2.1/bits/stl_algo.h:2854:24: note: in instantiation of template class 'std::iterator_traits<HPC_user>'
requested here
typedef typename iterator_traits<_RandomAccessIterator>::value_type
^
db2class.cpp:119:3: note: in instantiation of function template specialization 'std::sort<HPC_user, bool (*)(const HPC_user &,
const HPC_user &)>' requested here
std::sort(users[0], users[len], cpuComp);
^
In file included from db2class.cpp:3:
In file included from /usr/include/c++/4.2.1/iostream:44:
In file included from /usr/include/c++/4.2.1/ostream:44:
In file included from /usr/include/c++/4.2.1/ios:47:
In file included from /usr/include/c++/4.2.1/bits/ios_base.h:46:
In file included from /usr/include/c++/4.2.1/bits/locale_classes.h:46:
In file included from /usr/include/c++/4.2.1/string:56:
In file included from /usr/include/c++/4.2.1/algorithm:67:
/usr/include/c++/4.2.1/bits/stl_algo.h:2864:19: error: invalid operands to binary expression ('HPC_user' and 'HPC_user')
if (__first != __last)
~~~~~~~ ^ ~~~~~~
db2class.cpp:122:3: note: in instantiation of function template specialization 'std::sort<HPC_user, cpuComp>' requested here
std::sort(users[0], users[len], cpuComp());
^
/usr/include/c++/4.2.1/bits/postypes.h:206:5: note: candidate template ignored: failed template argument deduction
operator!=(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs)
^
/usr/include/c++/4.2.1/bits/stl_pair.h:109:5: note: candidate template ignored: failed template argument deduction
operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
^
/usr/include/c++/4.2.1/bits/stl_iterator.h:294:5: note: candidate template ignored: failed template argument deduction
operator!=(const reverse_iterator<_Iterator>& __x,
^
/usr/include/c++/4.2.1/bits/stl_iterator.h:344:5: note: candidate template ignored: failed template argument deduction
operator!=(const reverse_iterator<_IteratorL>& __x,
^
/usr/include/c++/4.2.1/bits/allocator.h:120:5: note: candidate template ignored: failed template argument deduction
operator!=(const allocator<_T1>&, const allocator<_T2>&)
^
/usr/include/c++/4.2.1/bits/basic_string.h:2188:5: note: candidate template ignored: failed template argument deduction
operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
我做错了什么?排序类向量的正确方法是什么?
答案 0 :(得分:6)
你想要这个:
std::sort(users.begin(), users.end(), cpuComp());
答案 1 :(得分:0)
std::sort
适用于迭代器或指针,因此您的选项是:
std::sort(users.begin(), users.end(), cpuComp());
std::sort(&users[0], &users[len], cpuComp()); // assuming len == users.size()
使用&amp; users [n]形式,在元素中指定子范围会稍微容易一些。
迭代器提供了更多抽象 - 使用正确的迭代器,您可以按照标准要求std::vector
的方式对未在内存中连续存储其数据的容器进行排序。如果你开始使用迭代器,那么你是否应该改用以后使用这样的容器,你甚至不需要纠正排序行,如果你忘了它就不会在运行时行为不端。因此,最好将迭代器与标准算法一起使用,并采用与您自己的代码类似的方法。