HomeSort by relevance Sort by last modified time
    Searched defs:SparseSet (Results 1 - 2 of 2) sorted by null

  /external/regex-re2/util/
sparse_set.h 7 // SparseSet<T>(m) is a set of integers in [0, m).
26 // change after visiting. Thus SparseSet can be a convenient
29 // The SparseSet implementation is NOT thread-safe. It is up to the
34 // The SparseSet interface does not present all the usual STL bells and
54 class SparseSet {
56 SparseSet()
59 SparseSet(int max_size) {
75 ~SparseSet() {
174 DISALLOW_EVIL_CONSTRUCTORS(SparseSet);
  /external/llvm/include/llvm/ADT/
SparseSet.h 1 //===--- llvm/ADT/SparseSet.h - Sparse set ----------------------*- C++ -*-===//
10 // This file defines the SparseSet class derived from the version described in
30 /// SparseSetValTraits - Objects in a SparseSet are identified by keys that can
33 /// long as an index can still be derived from the value. SparseSet never
36 /// object. To compute the index from a key, SparseSet uses a separate
39 /// A simple type declaration, SparseSet<Type>, handles these cases:
43 /// The type declaration SparseSet<Type, UnaryFunction> handles:
79 /// SparseSet - Fast set implmentation for objects that can be identified by
82 /// SparseSet allocates memory proportional to the size of the key universe, so
86 /// Compared to DenseSet and DenseMap, SparseSet provides constant-time fas
    [all...]

Completed in 45 milliseconds