reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
66 using mapped_type = ValueT; 69 using iterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT>; 71 DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT, true>; 123 is_trivially_copyable<ValueT>::value) { 132 P->getSecond().~ValueT(); 185 ValueT lookup(const_arg_type_t<KeyT> Val) const { 189 return ValueT(); 195 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { 202 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { 249 std::pair<iterator, bool> insert_as(std::pair<KeyT, ValueT> &&KV, 277 TheBucket->getSecond().~ValueT(); 285 TheBucket->getSecond().~ValueT(); 299 ValueT &operator[](const KeyT &Key) { 311 ValueT &operator[](KeyT &&Key) { 338 P->getSecond().~ValueT(); 380 ::new (&DestBucket->getSecond()) ValueT(std::move(B->getSecond())); 384 B->getSecond().~ValueT(); 392 const DenseMapBase<OtherBaseT, KeyT, ValueT, KeyInfoT, BucketT> &other) { 400 is_trivially_copyable<ValueT>::value) 410 ValueT(other.getBuckets()[i].getSecond()); 520 ::new (&TheBucket->getSecond()) ValueT(std::forward<ValueArgs>(Values)...); 526 ValueT &&Value, LookupKeyT &Lookup) { 530 ::new (&TheBucket->getSecond()) ValueT(std::move(Value));