mirror of
https://github.com/XRPLF/rippled.git
synced 2025-11-27 14:35:52 +00:00
The priority scheme was backwards!
This commit is contained in:
@@ -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
|
{ // These comparison operators make the jobs sort in priority order in the job set
|
||||||
if (mType < j.mType)
|
if (mType < j.mType)
|
||||||
return true;
|
return true;
|
||||||
@@ -63,7 +63,7 @@ bool Job::operator<(const Job& j) const
|
|||||||
return mJobIndex < j.mJobIndex;
|
return mJobIndex < j.mJobIndex;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool Job::operator<=(const Job& j) const
|
bool Job::operator>=(const Job& j) const
|
||||||
{
|
{
|
||||||
if (mType < j.mType)
|
if (mType < j.mType)
|
||||||
return true;
|
return true;
|
||||||
@@ -72,7 +72,7 @@ bool Job::operator<=(const Job& j) const
|
|||||||
return mJobIndex <= j.mJobIndex;
|
return mJobIndex <= j.mJobIndex;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool Job::operator>(const Job& j) const
|
bool Job::operator<(const Job& j) const
|
||||||
{
|
{
|
||||||
if (mType < j.mType)
|
if (mType < j.mType)
|
||||||
return false;
|
return false;
|
||||||
@@ -81,7 +81,7 @@ bool Job::operator>(const Job& j) const
|
|||||||
return mJobIndex > j.mJobIndex;
|
return mJobIndex > j.mJobIndex;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool Job::operator>=(const Job& j) const
|
bool Job::operator<=(const Job& j) const
|
||||||
{
|
{
|
||||||
if (mType < j.mType)
|
if (mType < j.mType)
|
||||||
return false;
|
return false;
|
||||||
@@ -251,3 +251,5 @@ void JobQueue::threadEntry()
|
|||||||
--mThreadCount;
|
--mThreadCount;
|
||||||
mJobCond.notify_all();
|
mJobCond.notify_all();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// vim:ts=4
|
||||||
|
|||||||
Reference in New Issue
Block a user