mirror of https://github.com/AxioDL/metaforce.git
Stop trying to make <ranges> happen, it's not going to happen
This commit is contained in:
parent
bdb173b1b4
commit
2c79d64978
|
@ -1 +1 @@
|
||||||
Subproject commit 7865694d75f2b5aad9337af9702ab54e1c1b6e01
|
Subproject commit 89986bdd650685261311a87b37f504baee342eff
|
|
@ -1 +1 @@
|
||||||
Subproject commit 45f56d21f1fc30e3f4290b832d4459e08bdfcc13
|
Subproject commit 2f53b2174040eb0bc84fce8799b7a9be630eabd5
|
|
@ -17,7 +17,6 @@
|
||||||
#define _WIN32_IE 0x0400
|
#define _WIN32_IE 0x0400
|
||||||
#endif
|
#endif
|
||||||
#include <shlobj.h>
|
#include <shlobj.h>
|
||||||
#include <ranges>
|
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#ifdef __APPLE__
|
#ifdef __APPLE__
|
||||||
|
@ -243,8 +242,8 @@ hecl::DirectoryEnumerator::DirectoryEnumerator(std::string_view path, Mode mode,
|
||||||
|
|
||||||
m_entries.reserve(sort.size());
|
m_entries.reserve(sort.size());
|
||||||
if (reverse) {
|
if (reverse) {
|
||||||
for (auto& it : std::ranges::reverse_view(sort)) {
|
for (auto it = sort.crbegin(); it != sort.crend(); ++it) {
|
||||||
m_entries.emplace_back(std::move(it.second));
|
m_entries.emplace_back(std::move(it->second));
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
for (auto& e : sort) {
|
for (auto& e : sort) {
|
||||||
|
@ -285,8 +284,8 @@ hecl::DirectoryEnumerator::DirectoryEnumerator(std::string_view path, Mode mode,
|
||||||
|
|
||||||
m_entries.reserve(m_entries.size() + sort.size());
|
m_entries.reserve(m_entries.size() + sort.size());
|
||||||
if (reverse) {
|
if (reverse) {
|
||||||
for (auto& it : std::ranges::reverse_view(sort)) {
|
for (auto it = sort.crbegin(); it != sort.crend(); ++it) {
|
||||||
m_entries.emplace_back(std::move(it.second));
|
m_entries.emplace_back(std::move(it->second));
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
for (auto& e : sort) {
|
for (auto& e : sort) {
|
||||||
|
@ -315,8 +314,8 @@ hecl::DirectoryEnumerator::DirectoryEnumerator(std::string_view path, Mode mode,
|
||||||
|
|
||||||
m_entries.reserve(m_entries.size() + sort.size());
|
m_entries.reserve(m_entries.size() + sort.size());
|
||||||
if (reverse) {
|
if (reverse) {
|
||||||
for (auto& e : std::ranges::reverse_view(sort)) {
|
for (auto it = sort.crbegin(); it != sort.crend(); ++it) {
|
||||||
m_entries.emplace_back(std::move(e.second));
|
m_entries.emplace_back(std::move(it->second));
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
for (auto& e : sort) {
|
for (auto& e : sort) {
|
||||||
|
|
Loading…
Reference in New Issue