noham/archived-Reclass
1
0
Fork 0
mirror of https://github.com/NohamR/Reclass.git synced 2026-05-10 19:59:21 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat: sort primitives alphabetically in type chooser

Browse Source
This commit is contained in:
IChooseYou
2026-02-20 07:37:32 -07:00
parent 2d3ce63b54
commit 0cfd7ad87a
1 changed files with 9 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/typeselectorpopup.cpp
View File

@@ -653,7 +653,11 @@ void TypeSelectorPopup::applyFilter(const QString& text) {
composites.append(t); composites.append(t);
} }
// For non-Root modes, sort primitives: same-size first, then rest auto alphabetical = [](const TypeEntry& a, const TypeEntry& b) {
return a.displayName.compare(b.displayName, Qt::CaseInsensitive) < 0;
};
// For non-Root modes, sort primitives: same-size first, then rest — alphabetical within each group
if (m_mode != TypePopupMode::Root && m_currentNodeSize > 0 && !primitives.isEmpty()) { if (m_mode != TypePopupMode::Root && m_currentNodeSize > 0 && !primitives.isEmpty()) {
QVector<TypeEntry> sameSize, other; QVector<TypeEntry> sameSize, other;
for (const auto& p : primitives) { for (const auto& p : primitives) {
@@ -662,7 +666,11 @@ void TypeSelectorPopup::applyFilter(const QString& text) {
else else
other.append(p); other.append(p);
} }
std::sort(sameSize.begin(), sameSize.end(), alphabetical);
std::sort(other.begin(), other.end(), alphabetical);
primitives = sameSize + other; primitives = sameSize + other;
} else {
std::sort(primitives.begin(), primitives.end(), alphabetical);
} }
// Helper lambdas for appending sections // Helper lambdas for appending sections