tdlight-team/tdlight
tdlight-team/tdlight
1
1
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Use FlatHashTable instead of std::unordered_map/std::unordered_set.

Browse Source
This commit is contained in:
levlam 2022-06-30 00:59:27 +03:00
parent e43d90c089
commit cb559c396d
2 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
tdutils/td/utils/FlatHashMap.h
View File

@ -7,17 +7,17 @@
#pragma once #pragma once
//#include "td/utils/FlatHashMapChunks.h" //#include "td/utils/FlatHashMapChunks.h"
//#include "td/utils/FlatHashTable.h" #include "td/utils/FlatHashTable.h"
//#include "td/utils/MapNode.h" #include "td/utils/MapNode.h"
#include <functional> #include <functional>
#include <unordered_map> //#include <unordered_map>
namespace td { namespace td {
template <class KeyT, class ValueT, class HashT = std::hash<KeyT>, class EqT = std::equal_to<KeyT>> template <class KeyT, class ValueT, class HashT = std::hash<KeyT>, class EqT = std::equal_to<KeyT>>
//using FlatHashMap = FlatHashTable<MapNode<KeyT, ValueT>, HashT, EqT>; using FlatHashMap = FlatHashTable<MapNode<KeyT, ValueT>, HashT, EqT>;
//using FlatHashMap = FlatHashMapChunks<KeyT, ValueT, HashT, EqT>; //using FlatHashMap = FlatHashMapChunks<KeyT, ValueT, HashT, EqT>;
using FlatHashMap = std::unordered_map<KeyT, ValueT, HashT, EqT>; //using FlatHashMap = std::unordered_map<KeyT, ValueT, HashT, EqT>;
} // namespace td } // namespace td

10
tdutils/td/utils/FlatHashSet.h
View File

@ -7,17 +7,17 @@
#pragma once #pragma once
//#include "td/utils/FlatHashMapChunks.h" //#include "td/utils/FlatHashMapChunks.h"
//#include "td/utils/FlatHashTable.h" #include "td/utils/FlatHashTable.h"
//#include "td/utils/SetNode.h" #include "td/utils/SetNode.h"
#include <functional> #include <functional>
#include <unordered_set> //#include <unordered_set>
namespace td { namespace td {
template <class KeyT, class HashT = std::hash<KeyT>, class EqT = std::equal_to<KeyT>> template <class KeyT, class HashT = std::hash<KeyT>, class EqT = std::equal_to<KeyT>>
//using FlatHashSet = FlatHashTable<SetNode<KeyT>, HashT, EqT>; using FlatHashSet = FlatHashTable<SetNode<KeyT>, HashT, EqT>;
//using FlatHashSet = FlatHashSetChunks<KeyT, HashT, EqT>; //using FlatHashSet = FlatHashSetChunks<KeyT, HashT, EqT>;
using FlatHashSet = std::unordered_set<KeyT, HashT, EqT>; //using FlatHashSet = std::unordered_set<KeyT, HashT, EqT>;
} // namespace td } // namespace td