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 CC_SURFACES_SURFACE_ID_H_ | 5 #ifndef CC_SURFACES_SURFACE_ID_H_ |
6 #define CC_SURFACES_SURFACE_ID_H_ | 6 #define CC_SURFACES_SURFACE_ID_H_ |
7 | 7 |
8 #include <stddef.h> | 8 #include <stddef.h> |
9 #include <stdint.h> | 9 #include <stdint.h> |
10 | 10 |
(...skipping 15 matching lines...) Expand all Loading... | |
26 } | 26 } |
27 | 27 |
28 inline bool operator!=(const SurfaceId& a, const SurfaceId& b) { | 28 inline bool operator!=(const SurfaceId& a, const SurfaceId& b) { |
29 return !(a == b); | 29 return !(a == b); |
30 } | 30 } |
31 | 31 |
32 inline bool operator<(const SurfaceId& a, const SurfaceId& b) { | 32 inline bool operator<(const SurfaceId& a, const SurfaceId& b) { |
33 return a.id < b.id; | 33 return a.id < b.id; |
34 } | 34 } |
35 | 35 |
36 struct SurfaceIdHash { | |
37 size_t operator()(const SurfaceId& key) const { | |
38 return std::hash<uint64_t>()(key.id); | |
dcheng
2016/01/27 00:25:46
#include <functional>?
lfg
2016/01/27 00:41:01
Ugh, you're right. (For some reason I thought that
| |
39 } | |
40 }; | |
41 | |
36 } // namespace cc | 42 } // namespace cc |
37 | 43 |
38 namespace BASE_HASH_NAMESPACE { | 44 namespace BASE_HASH_NAMESPACE { |
39 template <> | 45 template <> |
40 struct hash<cc::SurfaceId> { | 46 struct hash<cc::SurfaceId> { |
41 size_t operator()(cc::SurfaceId key) const { | 47 size_t operator()(cc::SurfaceId key) const { |
42 return hash<uint64_t>()(key.id); | 48 return hash<uint64_t>()(key.id); |
43 } | 49 } |
44 }; | 50 }; |
45 } // namespace BASE_HASH_NAMESPACE | 51 } // namespace BASE_HASH_NAMESPACE |
46 | 52 |
47 #endif // CC_SURFACES_SURFACE_ID_H_ | 53 #endif // CC_SURFACES_SURFACE_ID_H_ |
OLD | NEW |