ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-11-26 14:05:51 +00:00
Code Issues Packages Projects Releases Wiki Activity

The priority scheme was backwards!

Browse Source
This commit is contained in:
JoelKatz
2013-01-10 15:29:52 -08:00
parent 83d1d3a122
commit db1322f741
1 changed files with 6 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/cpp/ripple/JobQueue.cpp
View File

@@ -54,7 +54,7 @@ const char* Job::toString(JobType t)
}
}
bool Job::operator<(const Job& j) const
bool Job::operator>(const Job& j) const
{ // These comparison operators make the jobs sort in priority order in the job set
if (mType < j.mType)
return true;
@@ -63,7 +63,7 @@ bool Job::operator<(const Job& j) const
return mJobIndex < j.mJobIndex;
}
bool Job::operator<=(const Job& j) const
bool Job::operator>=(const Job& j) const
{
if (mType < j.mType)
return true;
@@ -72,7 +72,7 @@ bool Job::operator<=(const Job& j) const
return mJobIndex <= j.mJobIndex;
}
bool Job::operator>(const Job& j) const
bool Job::operator<(const Job& j) const
{
if (mType < j.mType)
return false;
@@ -81,7 +81,7 @@ bool Job::operator>(const Job& j) const
return mJobIndex > j.mJobIndex;
}
bool Job::operator>=(const Job& j) const
bool Job::operator<=(const Job& j) const
{
if (mType < j.mType)
return false;
@@ -251,3 +251,5 @@ void JobQueue::threadEntry()
--mThreadCount;
mJobCond.notify_all();
}
// vim:ts=4