OLD | NEW |
| (Empty) |
1 // Copyright 2016 The Chromium Authors. All rights reserved. | |
2 // Use of this source code is governed by a BSD-style license that can be | |
3 // found in the LICENSE file. | |
4 | |
5 #ifndef {{"_".join(config.protocol.namespace)}}_Collections_h | |
6 #define {{"_".join(config.protocol.namespace)}}_Collections_h | |
7 | |
8 #include "{{config.protocol.package}}/Forward.h" | |
9 #include <cstddef> | |
10 | |
11 #if defined(__APPLE__) && !defined(_LIBCPP_VERSION) | |
12 #include <map> | |
13 #include <set> | |
14 | |
15 {% for namespace in config.protocol.namespace %} | |
16 namespace {{namespace}} { | |
17 {% endfor %} | |
18 | |
19 template <class Key, class T> using HashMap = std::map<Key, T>; | |
20 template <class Key> using HashSet = std::set<Key>; | |
21 | |
22 {% for namespace in config.protocol.namespace %} | |
23 } // namespace {{namespace}} | |
24 {% endfor %} | |
25 | |
26 #else | |
27 #include <unordered_map> | |
28 #include <unordered_set> | |
29 | |
30 {% for namespace in config.protocol.namespace %} | |
31 namespace {{namespace}} { | |
32 {% endfor %} | |
33 | |
34 template <class Key, class T> using HashMap = std::unordered_map<Key, T>; | |
35 template <class Key> using HashSet = std::unordered_set<Key>; | |
36 | |
37 {% for namespace in config.protocol.namespace %} | |
38 } // namespace {{namespace}} | |
39 {% endfor %} | |
40 | |
41 #endif // defined(__APPLE__) && !defined(_LIBCPP_VERSION) | |
42 | |
43 // Macro that returns a compile time constant with the length of an array, but g
ives an error if passed a non-array. | |
44 template<typename T, std::size_t Size> char (&ArrayLengthHelperFunction(T (&)[Si
ze]))[Size]; | |
45 // GCC needs some help to deduce a 0 length array. | |
46 #if defined(__GNUC__) | |
47 template<typename T> char (&ArrayLengthHelperFunction(T (&)[0]))[0]; | |
48 #endif | |
49 #define PROTOCOL_ARRAY_LENGTH(array) sizeof(::ArrayLengthHelperFunction(array)) | |
50 | |
51 #endif // !defined({{"_".join(config.protocol.namespace)}}_Collections_h) | |
OLD | NEW |