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 stdlib implementation-defined ordering when workers tie for votes

Browse source
This commit is contained in:
theoreticalbts 2015-06-29 15:24:22 -04:00
parent 9719689c34
commit 51bb9025d0
1 changed files with 7 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
libraries/chain/db_maint.cpp
View file

@ -70,8 +70,14 @@ void database::pay_workers( share_type& budget )
active_workers.emplace_back(w); active_workers.emplace_back(w);
}); });
// worker with more votes is preferred
// if two workers exactly tie for votes, worker with lower ID is preferred
std::sort(active_workers.begin(), active_workers.end(), [this](const worker_object& wa, const worker_object& wb) { std::sort(active_workers.begin(), active_workers.end(), [this](const worker_object& wa, const worker_object& wb) {
return wa.approving_stake(_vote_tally_buffer) > wb.approving_stake(_vote_tally_buffer); share_type wa_vote = wa.approving_stake(_vote_tally_buffer);
share_type wb_vote = wb.approving_stake(_vote_tally_buffer);
if( wa_vote != wb_vote )
return wa_vote > wb_vote;
return wa.id < wb.id;
}); });
for( int i = 0; i < active_workers.size() && budget > 0; ++i ) for( int i = 0; i < active_workers.size() && budget > 0; ++i )