Fixed return strict const iterator, replace to range-based loop C++17 and code refactor (#548)

Signed-off-by: Herman Semenov <GermanAizek@yandex.ru>
Co-authored-by: georgemoralis <giorgosmrls@gmail.com>
This commit is contained in:
Herman Semenoff 2024-10-18 08:06:11 +00:00 committed by GitHub
parent 9814a1b788
commit 96ea686eb6
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
8 changed files with 31 additions and 32 deletions

View file

@ -59,7 +59,7 @@ public:
for (auto it = wait_list.begin(); it != wait_list.end();) {
auto* waiter = *it;
if (waiter->need_count > token_count) {
it++;
++it;
continue;
}
it = wait_list.erase(it);
@ -148,7 +148,7 @@ public:
// Find the first with priority less then us and insert right before it.
auto it = wait_list.begin();
while (it != wait_list.end() && (*it)->priority > waiter->priority) {
it++;
++it;
}
wait_list.insert(it, waiter);
return it;