Peerplays_Blockchain/peerplays_migrated
1
0
Fork 0
Code Issues 35 Pull requests 4 Projects Releases 20 Packages Wiki Activity Actions

db_maint.cpp: Avoid implementation-defined ordering when votable objects tie for votes

Browse source
This commit is contained in:
theoreticalbts 2015-07-08 15:00:46 -04:00
parent 5a01e255e2
commit 2f9e636618
1 changed files with 5 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
libraries/chain/db_maint.cpp
View file

@ -44,7 +44,11 @@ vector<std::reference_wrapper<const typename Index::object_type>> database::sort
[](const ObjectType& o) { return std::cref(o); }); [](const ObjectType& o) { return std::cref(o); });
std::partial_sort(refs.begin(), refs.begin() + count, refs.end(), std::partial_sort(refs.begin(), refs.begin() + count, refs.end(),
[this](const ObjectType& a, const ObjectType& b)->bool { [this](const ObjectType& a, const ObjectType& b)->bool {
return _vote_tally_buffer[a.vote_id] > _vote_tally_buffer[b.vote_id]; share_type oa_vote = _vote_tally_buffer[a.vote_id];
share_type ob_vote = _vote_tally_buffer[b.vote_id];
if( oa_vote != ob_vote )
return oa_vote > ob_vote;
return a.vote_id < b.vote_id;
}); });
refs.resize(count, refs.front()); refs.resize(count, refs.front());