llvm.org GIT mirror llvm / release_24 include / llvm / ADT / DenseSet.h
release_24

Tree @release_24 (Download .tar.gz)

DenseSet.h @release_24raw · history · blame

//===- llvm/ADT/DenseSet.h - Dense probed hash table ------------*- C++ -*-===//
//
//                     The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file defines the DenseSet class.
//
//===----------------------------------------------------------------------===//

#ifndef LLVM_ADT_DENSESET_H
#define LLVM_ADT_DENSESET_H

#include "llvm/ADT/DenseMap.h"

namespace llvm {

/// DenseSet - This implements a dense probed hash-table based set.
///
/// FIXME: This is currently implemented directly in terms of DenseMap, this
/// should be optimized later if there is a need.
template<typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT> >
class DenseSet {
  typedef DenseMap<ValueT, char, ValueInfoT> MapTy;
  MapTy TheMap;
public:
  DenseSet(const DenseSet &Other) : TheMap(Other.TheMap) {}
  explicit DenseSet(unsigned NumInitBuckets = 64) : TheMap(NumInitBuckets) {}
  
  bool empty() const { return TheMap.empty(); }
  unsigned size() const { return TheMap.size(); }  
  
  void clear() {
    TheMap.clear();
  }
  
  bool count(const ValueT &V) const {
    return TheMap.count(V);
  }
  
  void erase(const ValueT &V) {
    TheMap.erase(V);
  }
  
  DenseSet &operator=(const DenseSet &RHS) {
    TheMap = RHS.TheMap;
    return *this;
  }
  
  // Iterators.
  
  class Iterator {
    typename MapTy::iterator I;
  public:
    Iterator(const typename MapTy::iterator &i) : I(i) {}
    
    ValueT& operator*() { return I->first; }
    ValueT* operator->() { return &I->first; }
    
    Iterator& operator++() { ++I; return *this; };
    bool operator==(const Iterator& X) const { return I == X.I; }
    bool operator!=(const Iterator& X) const { return I != X.I; }
  };
  
  class ConstIterator {
    typename MapTy::const_iterator I;
  public:
    ConstIterator(const typename MapTy::const_iterator &i) : I(i) {}
    
    const ValueT& operator*() { return I->first; }
    const ValueT* operator->() { return &I->first; }
    
    ConstIterator& operator++() { ++I; return *this; };
    bool operator==(const ConstIterator& X) const { return I == X.I; }
    bool operator!=(const ConstIterator& X) const { return I != X.I; }
  };
  
  typedef Iterator      iterator;
  typedef ConstIterator const_iterator;
  
  iterator begin() { return Iterator(TheMap.begin()); }
  iterator end() { return Iterator(TheMap.end()); }
  
  const_iterator begin() const { return ConstIterator(TheMap.begin()); }
  const_iterator end() const { return ConstIterator(TheMap.end()); }

  std::pair<iterator, bool> insert(const ValueT &V) {
    return TheMap.insert(std::make_pair(V, 0));
  }
};

} // end namespace llvm

#endif