| OLD | NEW |
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef COMPONENTS_COPRESENCE_TIMED_MAP_H_ | 5 #ifndef COMPONENTS_COPRESENCE_TIMED_MAP_H_ |
| 6 #define COMPONENTS_COPRESENCE_TIMED_MAP_H_ | 6 #define COMPONENTS_COPRESENCE_TIMED_MAP_H_ |
| 7 | 7 |
| 8 #include <map> | 8 #include <map> |
| 9 #include <queue> | 9 #include <queue> |
| 10 #include <utility> | 10 #include <utility> |
| (...skipping 30 matching lines...) Expand all Loading... |
| 41 ClearOldestToken(); | 41 ClearOldestToken(); |
| 42 } | 42 } |
| 43 | 43 |
| 44 bool HasKey(const KeyType& key) { | 44 bool HasKey(const KeyType& key) { |
| 45 ClearExpiredTokens(); | 45 ClearExpiredTokens(); |
| 46 return map_.find(key) != map_.end(); | 46 return map_.find(key) != map_.end(); |
| 47 } | 47 } |
| 48 | 48 |
| 49 const ValueType& GetValue(const KeyType& key) { | 49 const ValueType& GetValue(const KeyType& key) { |
| 50 ClearExpiredTokens(); | 50 ClearExpiredTokens(); |
| 51 typename std::map<KeyType, ValueType>::const_iterator elt = map_.find(key); | 51 auto elt = map_.find(key); |
| 52 return elt == map_.end() ? kEmptyValue : elt->second; | 52 return elt == map_.end() ? kEmptyValue : elt->second; |
| 53 } | 53 } |
| 54 | 54 |
| 55 void set_clock_for_testing(scoped_ptr<base::TickClock> clock) { | 55 void set_clock_for_testing(scoped_ptr<base::TickClock> clock) { |
| 56 clock_ = clock.Pass(); | 56 clock_ = clock.Pass(); |
| 57 } | 57 } |
| 58 | 58 |
| 59 private: | 59 private: |
| 60 void ClearExpiredTokens() { | 60 void ClearExpiredTokens() { |
| 61 while (!expiry_queue_.empty() && | 61 while (!expiry_queue_.empty() && |
| (...skipping 29 matching lines...) Expand all Loading... |
| 91 // Priority queue with our element keys ordered by the earliest expiring keys | 91 // Priority queue with our element keys ordered by the earliest expiring keys |
| 92 // first. | 92 // first. |
| 93 ExpiryQueue expiry_queue_; | 93 ExpiryQueue expiry_queue_; |
| 94 | 94 |
| 95 DISALLOW_COPY_AND_ASSIGN(TimedMap); | 95 DISALLOW_COPY_AND_ASSIGN(TimedMap); |
| 96 }; | 96 }; |
| 97 | 97 |
| 98 } // namespace copresence | 98 } // namespace copresence |
| 99 | 99 |
| 100 #endif // COMPONENTS_COPRESENCE_TIMED_MAP_H_ | 100 #endif // COMPONENTS_COPRESENCE_TIMED_MAP_H_ |
| OLD | NEW |