1//===- llvm/ADT/DenseSet.h - Dense probed hash table ------------*- C++ -*-===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 10// This file defines the DenseSet class. 11// 12//===----------------------------------------------------------------------===// 13 14#ifndef LLVM_ADT_DENSESET_H 15#define LLVM_ADT_DENSESET_H 16 17#include "llvm/ADT/DenseMap.h" 18 19namespace llvm { 20 21/// DenseSet - This implements a dense probed hash-table based set. 22/// 23/// FIXME: This is currently implemented directly in terms of DenseMap, this 24/// should be optimized later if there is a need. 25template<typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT> > 26class DenseSet { 27 typedef DenseMap<ValueT, char, ValueInfoT> MapTy; 28 MapTy TheMap; 29public: 30 DenseSet(const DenseSet &Other) : TheMap(Other.TheMap) {} 31 explicit DenseSet(unsigned NumInitBuckets = 0) : TheMap(NumInitBuckets) {} 32 33 bool empty() const { return TheMap.empty(); } 34 unsigned size() const { return TheMap.size(); } 35 size_t getMemorySize() const { return TheMap.getMemorySize(); } 36 37 /// Grow the DenseSet so that it has at least Size buckets. Will not shrink 38 /// the Size of the set. 39 void resize(size_t Size) { TheMap.resize(Size); } 40 41 void clear() { 42 TheMap.clear(); 43 } 44 45 bool count(const ValueT &V) const { 46 return TheMap.count(V); 47 } 48 49 bool erase(const ValueT &V) { 50 return TheMap.erase(V); 51 } 52 53 void swap(DenseSet& RHS) { 54 TheMap.swap(RHS.TheMap); 55 } 56 57 DenseSet &operator=(const DenseSet &RHS) { 58 TheMap = RHS.TheMap; 59 return *this; 60 } 61 62 // Iterators. 63 64 class Iterator { 65 typename MapTy::iterator I; 66 friend class DenseSet; 67 public: 68 typedef typename MapTy::iterator::difference_type difference_type; 69 typedef ValueT value_type; 70 typedef value_type *pointer; 71 typedef value_type &reference; 72 typedef std::forward_iterator_tag iterator_category; 73 74 Iterator(const typename MapTy::iterator &i) : I(i) {} 75 76 ValueT& operator*() { return I->first; } 77 ValueT* operator->() { return &I->first; } 78 79 Iterator& operator++() { ++I; return *this; } 80 bool operator==(const Iterator& X) const { return I == X.I; } 81 bool operator!=(const Iterator& X) const { return I != X.I; } 82 }; 83 84 class ConstIterator { 85 typename MapTy::const_iterator I; 86 friend class DenseSet; 87 public: 88 typedef typename MapTy::const_iterator::difference_type difference_type; 89 typedef ValueT value_type; 90 typedef value_type *pointer; 91 typedef value_type &reference; 92 typedef std::forward_iterator_tag iterator_category; 93 94 ConstIterator(const typename MapTy::const_iterator &i) : I(i) {} 95 96 const ValueT& operator*() { return I->first; } 97 const ValueT* operator->() { return &I->first; } 98 99 ConstIterator& operator++() { ++I; return *this; } 100 bool operator==(const ConstIterator& X) const { return I == X.I; } 101 bool operator!=(const ConstIterator& X) const { return I != X.I; } 102 }; 103 104 typedef Iterator iterator; 105 typedef ConstIterator const_iterator; 106 107 iterator begin() { return Iterator(TheMap.begin()); } 108 iterator end() { return Iterator(TheMap.end()); } 109 110 const_iterator begin() const { return ConstIterator(TheMap.begin()); } 111 const_iterator end() const { return ConstIterator(TheMap.end()); } 112 113 iterator find(const ValueT &V) { return Iterator(TheMap.find(V)); } 114 void erase(Iterator I) { return TheMap.erase(I.I); } 115 void erase(ConstIterator CI) { return TheMap.erase(CI.I); } 116 117 std::pair<iterator, bool> insert(const ValueT &V) { 118 return TheMap.insert(std::make_pair(V, 0)); 119 } 120 121 // Range insertion of values. 122 template<typename InputIt> 123 void insert(InputIt I, InputIt E) { 124 for (; I != E; ++I) 125 insert(*I); 126 } 127}; 128 129} // end namespace llvm 130 131#endif 132