Lines Matching refs:ValueT
38 /// directly compares ValueT, only their indices, so it can map keys to
54 /// For best results, ValueT should not require a destructor.
56 template<typename ValueT>
58 static unsigned getValIndex(const ValueT &Val) {
64 /// generic implementation handles ValueT classes which either provide
67 template<typename KeyT, typename ValueT, typename KeyFunctorT>
69 unsigned operator()(const ValueT &Val) const {
70 return SparseSetValTraits<ValueT>::getValIndex(Val);
117 /// @tparam ValueT The type of objects in the set.
121 template<typename ValueT,
129 using DenseT = SmallVector<ValueT, 8>;
135 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
138 using value_type = ValueT;
139 using reference = ValueT &;
140 using const_reference = const ValueT &;
141 using pointer = ValueT *;
142 using const_pointer = const ValueT *;
253 std::pair<iterator, bool> insert(const ValueT &Val) {
266 ValueT &operator[](const KeyT &Key) {
267 return *insert(ValueT(Key)).first;
270 ValueT pop_back_val() {