summaryrefslogtreecommitdiffstats
path: root/src/rocksdb/util/hash_containers.h
blob: 52be3718c0099eb3388fe24f4405185337136cb2 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
//  Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
//  This source code is licensed under both the GPLv2 (found in the
//  COPYING file in the root directory) and Apache 2.0 License
//  (found in the LICENSE.Apache file in the root directory).

// This header establishes compile-time pluggable implementations of hashed
// container structures, so that deployments have the option of minimal
// dependencies with ok performance (e.g. std::unordered_map) or more
// dependencies with optimized performance (e.g. folly::F14FastMap).

#pragma once

#include "rocksdb/rocksdb_namespace.h"

#ifdef USE_FOLLY

#include <folly/container/F14Map.h>
#include <folly/container/F14Set.h>

namespace ROCKSDB_NAMESPACE {

template <typename K, typename V>
using UnorderedMap = folly::F14FastMap<K, V>;

template <typename K, typename V, typename H>
using UnorderedMapH = folly::F14FastMap<K, V, H>;

template <typename K>
using UnorderedSet = folly::F14FastSet<K>;

}  // namespace ROCKSDB_NAMESPACE

#else

#include <unordered_map>
#include <unordered_set>

namespace ROCKSDB_NAMESPACE {

template <typename K, typename V>
using UnorderedMap = std::unordered_map<K, V>;

template <typename K, typename V, typename H>
using UnorderedMapH = std::unordered_map<K, V, H>;

template <typename K>
using UnorderedSet = std::unordered_set<K>;

}  // namespace ROCKSDB_NAMESPACE

#endif