1 //===- llvm/ADT/SmallSet.h - 'Normally small' sets --------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the SmallSet class.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_ADT_SMALLSET_H
15 #define LLVM_ADT_SMALLSET_H
17 #include "llvm/ADT/None.h"
18 #include "llvm/ADT/SmallPtrSet.h"
19 #include "llvm/ADT/SmallVector.h"
24 /// SmallSet - This maintains a set of unique values, optimizing for the case
25 /// when the set is small (less than N). In this case, the set can be
26 /// maintained with no mallocs. If the set gets large, we expand to using an
27 /// std::set to maintain reasonable lookup times.
29 /// Note that this set does not provide a way to iterate over members in the
31 template <typename T, unsigned N, typename C = std::less<T> >
33 /// Use a SmallVector to hold the elements here (even though it will never
34 /// reach its 'large' stage) to avoid calling the default ctors of elements
35 /// we will never use.
36 SmallVector<T, N> Vector;
38 typedef typename SmallVector<T, N>::const_iterator VIterator;
39 typedef typename SmallVector<T, N>::iterator mutable_iterator;
41 // In small mode SmallPtrSet uses linear search for the elements, so it is
42 // not a good idea to choose this value too high. You may consider using a
43 // DenseSet<> instead if you expect many elements in the set.
44 static_assert(N <= 32, "N should be small");
47 typedef size_t size_type;
50 bool LLVM_ATTRIBUTE_UNUSED_RESULT empty() const {
51 return Vector.empty() && Set.empty();
54 size_type size() const {
55 return isSmall() ? Vector.size() : Set.size();
58 /// count - Return 1 if the element is in the set, 0 otherwise.
59 size_type count(const T &V) const {
61 // Since the collection is small, just do a linear search.
62 return vfind(V) == Vector.end() ? 0 : 1;
68 /// insert - Insert an element into the set if it isn't already there.
69 /// Returns true if the element is inserted (it was not in the set before).
70 /// The first value of the returned pair is unused and provided for
71 /// partial compatibility with the standard library self-associative container
73 // FIXME: Add iterators that abstract over the small and large form, and then
75 std::pair<NoneType, bool> insert(const T &V) {
77 return std::make_pair(None, Set.insert(V).second);
79 VIterator I = vfind(V);
80 if (I != Vector.end()) // Don't reinsert if it already exists.
81 return std::make_pair(None, false);
82 if (Vector.size() < N) {
84 return std::make_pair(None, true);
87 // Otherwise, grow from vector to set.
88 while (!Vector.empty()) {
89 Set.insert(Vector.back());
93 return std::make_pair(None, true);
96 template <typename IterT>
97 void insert(IterT I, IterT E) {
102 bool erase(const T &V) {
105 for (mutable_iterator I = Vector.begin(), E = Vector.end(); I != E; ++I)
119 bool isSmall() const { return Set.empty(); }
121 VIterator vfind(const T &V) const {
122 for (VIterator I = Vector.begin(), E = Vector.end(); I != E; ++I)
129 /// If this set is of pointer values, transparently switch over to using
130 /// SmallPtrSet for performance.
131 template <typename PointeeType, unsigned N>
132 class SmallSet<PointeeType*, N> : public SmallPtrSet<PointeeType*, N> {};
134 } // end namespace llvm