16d9a8de74
- std container replacements for vector, unordered_map, unordered_set - unordered_map and unordered_set replaced with ska::flat_hash_map - vector replacement is still std:: - unordered_map performance test (std:: vs ska::) - backlog improvements - wiArchive improvements - editor: added option to dump scene to C++ header file - common improvements, refactors
26 lines
606 B
C++
26 lines
606 B
C++
#ifndef WI_UNORDERED_SET_REPLACEMENT
|
|
#define WI_UNORDERED_SET_REPLACEMENT
|
|
// This file is used to allow replacement of std::unordered_set
|
|
|
|
#ifndef WI_UNORDERED_SET_TYPE
|
|
#define WI_UNORDERED_SET_TYPE 1
|
|
#endif // WI_UNORDERED_SET_TYPE
|
|
|
|
#if WI_UNORDERED_SET_TYPE == 1
|
|
#include "Utility/flat_hash_map.hpp"
|
|
#else
|
|
#include <unordered_set>
|
|
#endif // WI_UNORDERED_SET_TYPE
|
|
|
|
namespace wi
|
|
{
|
|
template<typename T>
|
|
#if WI_UNORDERED_SET_TYPE == 1
|
|
using unordered_set = ska::flat_hash_set<T>;
|
|
#else
|
|
using unordered_set = std::unordered_set<T>;
|
|
#endif // WI_UNORDERED_SET_TYPE
|
|
}
|
|
|
|
#endif // WI_UNORDERED_SET_REPLACEMENT
|