blob: c895fcf0f94807593d86bee56152366598fd8810 (
plain) (
blame)
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
#pragma once
#ifdef __GNUC__
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-parameter"
#endif
//===- StringSet.h - An efficient set built on StringMap --------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
///
/// \file
/// StringSet - A set-like wrapper for the StringMap.
///
//===----------------------------------------------------------------------===//
#ifndef LLVM_ADT_STRINGSET_H
#define LLVM_ADT_STRINGSET_H
#include "llvm/ADT/StringMap.h"
namespace llvm {
/// StringSet - A wrapper for StringMap that provides set-like functionality.
template <class AllocatorTy = MallocAllocator>
class StringSet : public StringMap<NoneType, AllocatorTy> {
using Base = StringMap<NoneType, AllocatorTy>;
public:
StringSet() = default;
StringSet(std::initializer_list<StringRef> initializer) {
for (StringRef str : initializer)
insert(str);
}
explicit StringSet(AllocatorTy a) : Base(a) {}
std::pair<typename Base::iterator, bool> insert(StringRef key) {
return Base::try_emplace(key);
}
template <typename InputIt>
void insert(const InputIt &begin, const InputIt &end) {
for (auto it = begin; it != end; ++it)
insert(*it);
}
template <typename ValueTy>
std::pair<typename Base::iterator, bool>
insert(const StringMapEntry<ValueTy> &mapEntry) {
return insert(mapEntry.getKey());
}
/// Check if the set contains the given \c key.
bool contains(StringRef key) const { return Base::FindKey(key) != -1; }
};
} // end namespace llvm
#endif // LLVM_ADT_STRINGSET_H
#ifdef __GNUC__
#pragma GCC diagnostic pop
#endif
|
