1//===- StringSet.h - An efficient set built on StringMap --------*- C++ -*-===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// StringSet - A set-like wrapper for the StringMap.
10//
11//===----------------------------------------------------------------------===//
12
13#ifndef LLVM_ADT_STRINGSET_H
14#define LLVM_ADT_STRINGSET_H
15
16#include "llvm/ADT/StringMap.h"
17
18namespace llvm {
19
20/// StringSet - A wrapper for StringMap that provides set-like functionality.
21template <class AllocatorTy = MallocAllocator>
22class StringSet : public StringMap<NoneType, AllocatorTy> {
23 using Base = StringMap<NoneType, AllocatorTy>;
24
25public:
26 StringSet() = default;
27 StringSet(std::initializer_list<StringRef> initializer) {
28 for (StringRef str : initializer)
29 insert(str);
30 }
31 explicit StringSet(AllocatorTy a) : Base(a) {}
32
33 std::pair<typename Base::iterator, bool> insert(StringRef key) {
34 return Base::try_emplace(key);
35 }
36
37 template <typename InputIt>
38 void insert(const InputIt &begin, const InputIt &end) {
39 for (auto it = begin; it != end; ++it)
40 insert(*it);
41 }
42
43 template <typename ValueTy>
44 std::pair<typename Base::iterator, bool>
45 insert(const StringMapEntry<ValueTy> &mapEntry) {
46 return insert(mapEntry.getKey());
47 }
48
49 /// Check if the set contains the given \c key.
50 bool contains(StringRef key) const { return Base::FindKey(key) != -1; }
51};
52
53} // end namespace llvm
54
55#endif // LLVM_ADT_STRINGSET_H
56