Omit a type name where possible

This also allows omitting a header
(though it gets included implicitly by `<queue>` instead,
but that's fine).

This also makes our code slightly more amenable to change,
of course.
This commit is contained in:
ISSOtm authored and Rangi committed 2026-10-17 14:15:54 -04:00
1 parent 170b341315
commit 6883dd903e
1 file changed
+1 -4
+1 -4
View File
@@ -3,7 +3,6 @@
#include "gfx/pal_packing.hpp"
#include <algorithm>
#include <deque>
#include <inttypes.h>
#include <iterator>
#include <numeric>
@@ -398,9 +397,7 @@ std::pair<std::vector<size_t>, size_t> overloadAndRemove(std::vector<ColorSet> c
std::vector<AssignedSets> assignments;
// Begin with all color sets queued up for insertion
for (std::queue<ColorSetAttrs> queue(std::deque<ColorSetAttrs>(RANGE(sortedColorSetIDs)));
!queue.empty();
queue.pop()) {
for (std::queue<ColorSetAttrs> queue({RANGE(sortedColorSetIDs)}); !queue.empty(); queue.pop()) {
ColorSetAttrs const &attrs = queue.front(); // Valid until the `queue.pop()`
verbosePrint(VERB_TRACE, "Handling color set %zu\n", attrs.colorSetIndex);