Lines Matching defs:that

61   /// Number of elements in CurArray that contain a value or are a tombstone.
72                       const SmallPtrSetImplBase &that);
74                       const void **RHSSmallStorage, SmallPtrSetImplBase &&that);
137     // Note that -1 is chosen to make clear() efficiently implementable with
147   /// it was already in the set.  This is hidden from the client so that the
148   /// derived class can check that the right type of pointer is passed in.
172   /// that the derived class can check that the right type of pointer is passed
247   /// Note: This method assumes that both sets have the same small size.
289   /// that is.   This is guaranteed to stop because the end() bucket is marked
358 /// typesafe interface that is common across all small sizes.
389   /// Insert the given pointer with an iterator hint that is ignored. This is
405   /// Remove elements that match the given predicate.
480   /// Create an iterator that dereferences to same place as the given pointer.
490 /// Iterates over elements of LHS confirming that each value from LHS is also in
491 /// RHS, and that no additional values are in RHS.
537   // Make sure that SmallSize is a power of two, round up if not.
544   SmallPtrSet(const SmallPtrSet &that) : BaseT(SmallStorage, that) {}
545   SmallPtrSet(SmallPtrSet &&that)
546       : BaseT(SmallStorage, SmallSizePowTwo, that.SmallStorage,
547               std::move(that)) {}