Lines Matching refs:KeyT
31 template<typename KeyT, typename ValueT,
32 typename KeyInfoT = DenseMapInfo<KeyT>,
36 template<typename KeyT, typename ValueT,
37 typename KeyInfoT = DenseMapInfo<KeyT> >
39 typedef std::pair<KeyT, ValueT> BucketT;
46 typedef KeyT key_type;
66 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
71 P->first.~KeyT();
80 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator;
81 typedef DenseMapIterator<KeyT, ValueT,
116 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
131 bool count(const KeyT &Val) const {
136 iterator find(const KeyT &Val) {
142 const_iterator find(const KeyT &Val) const {
152 /// getHashValue(LookupKeyT) and isEqual(LookupKeyT, KeyT) for each key
171 ValueT lookup(const KeyT &Val) const {
181 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
200 bool erase(const KeyT &Val) {
226 value_type& FindAndConstruct(const KeyT &Key) {
234 ValueT &operator[](const KeyT &Key) {
258 (!isPodLike<KeyT>::value || !isPodLike<ValueT>::value)) {
259 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
264 P->first.~KeyT();
287 if (isPodLike<KeyT>::value && isPodLike<ValueT>::value)
291 new (&Buckets[i].first) KeyT(other.Buckets[i].first);
298 BucketT *InsertIntoBucket(const KeyT &Key, const ValueT &Value,
328 static unsigned getHashValue(const KeyT &Val) {
335 static const KeyT getEmptyKey() {
338 static const KeyT getTombstoneKey() {
359 const KeyT EmptyKey = getEmptyKey();
360 const KeyT TombstoneKey = getTombstoneKey();
408 const KeyT EmptyKey = getEmptyKey();
410 new (&Buckets[i].first) KeyT(EmptyKey);
427 const KeyT EmptyKey = getEmptyKey();
429 new (&Buckets[i].first) KeyT(EmptyKey);
432 const KeyT TombstoneKey = getTombstoneKey();
447 B->first.~KeyT();
469 const KeyT EmptyKey = getEmptyKey();
471 new (&Buckets[i].first) KeyT(EmptyKey);
474 const KeyT TombstoneKey = getTombstoneKey();
481 B->first.~KeyT();
503 template<typename KeyT, typename ValueT,
506 typedef std::pair<KeyT, ValueT> Bucket;
507 typedef DenseMapIterator<KeyT, ValueT,
509 KeyT, ValueT, KeyInfoT, true>;
529 DenseMapIterator(const DenseMapIterator<KeyT, ValueT,
558 const KeyT Empty = KeyInfoT::getEmptyKey();
559 const KeyT Tombstone = KeyInfoT::getTombstoneKey();
568 template<typename KeyT, typename ValueT, typename KeyInfoT>
570 capacity_in_bytes(const DenseMap<KeyT, ValueT, KeyInfoT> &X) {
