mirror of
				https://github.com/ton-blockchain/ton
				synced 2025-03-09 15:40:10 +00:00 
			
		
		
		
	* getactorstats query for validator-engine-console * celldb in-memory mode (--celldb-in-memory option) * rldp2: bugfix - do not estimate speed while nothing is sent * add simple ed25519 benchmark * fix compilation errors of different platforms and move to c++20 * fix some warnings * turn on TON_USE_ABSEIL for glibc 2.27 nix build --------- Co-authored-by: birydrad <>
		
			
				
	
	
		
			44 lines
		
	
	
	
		
			1.5 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			44 lines
		
	
	
	
		
			1.5 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|     This file is part of TON Blockchain Library.
 | |
| 
 | |
|     TON Blockchain Library is free software: you can redistribute it and/or modify
 | |
|     it under the terms of the GNU Lesser General Public License as published by
 | |
|     the Free Software Foundation, either version 2 of the License, or
 | |
|     (at your option) any later version.
 | |
| 
 | |
|     TON Blockchain Library is distributed in the hope that it will be useful,
 | |
|     but WITHOUT ANY WARRANTY; without even the implied warranty of
 | |
|     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | |
|     GNU Lesser General Public License for more details.
 | |
| 
 | |
|     You should have received a copy of the GNU Lesser General Public License
 | |
|     along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
 | |
| 
 | |
|     Copyright 2017-2020 Telegram Systems LLP
 | |
| */
 | |
| #pragma once
 | |
| 
 | |
| #include "td/utils/Hash.h"
 | |
| 
 | |
| #if TD_HAVE_ABSL
 | |
| #include <absl/container/flat_hash_map.h>
 | |
| #include <absl/container/node_hash_map.h>
 | |
| #else
 | |
| #include <unordered_map>
 | |
| #endif
 | |
| 
 | |
| namespace td {
 | |
| 
 | |
| #if TD_HAVE_ABSL
 | |
| template <class Key, class Value, class H = Hash<Key>>
 | |
| using HashMap = absl::flat_hash_map<Key, Value, H>;
 | |
| template <class Key, class Value, class H = Hash<Key>, class E = std::equal_to<>>
 | |
| using NodeHashMap = absl::node_hash_map<Key, Value, H, E>;
 | |
| #else
 | |
| template <class Key, class Value, class H = Hash<Key>>
 | |
| using HashMap = std::unordered_map<Key, Value, H>;
 | |
| template <class Key, class Value, class H = Hash<Key>>
 | |
| using NodeHashMap = std::unordered_map<Key, Value, H>;
 | |
| #endif
 | |
| 
 | |
| }  // namespace td
 |