-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathspecialize.h
More file actions
92 lines (69 loc) · 2.47 KB
/
specialize.h
File metadata and controls
92 lines (69 loc) · 2.47 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#pragma once
// This header provides a cleaner mechanism for declaring template
// specializations via typedefs without lots of code clutter.
#ifdef __cplusplus
#define SPECIALIZE_ITER(name) \
typedef name::iterator name##Iter; \
typedef name::const_iterator name##ConstIter;
#ifdef QT_VERSION
// We're building with Qt -- Use Qt-specific container types
#include <QVector>
#define SPECIALIZE_VECTOR(type, name) \
using name##Vector = QVector<type>; \
SPECIALIZE_ITER(name##Vector)
#include <QMap>
#define SPECIALIZE_MAP(key, value, name) \
using name##Map = QMap<key, value>; \
SPECIALIZE_ITER(name##Map)
#define map_key(iter) iter.key()
#define map_value(iter) iter.value()
#include <QList>
#define SPECIALIZE_LIST(type, name) \
using name##List = QList<type>; \
SPECIALIZE_ITER(name##List)
#include <QSharedPointer>
#define SPECIALIZE_SHAREDPTR(type, name) \
using name##Pointer = QSharedPointer<type>;
#include <QWeakPointer>
#define SPECIALIZE_WEAKPTR(type, name) \
using name##WeakPointer = QWeakPointer<type>;
#include <QQueue>
#define SPECIALIZE_QUEUE(type, name) \
using name##Queue = QQueue<type>;
#include <QPair>
#define SPECIALIZE_PAIR(type1, type2, name) \
using name##Pair = QPair<type1, type2>;
#include <QSet>
#define SPECIALIZE_SET(type, name) \
using name##Set = QSet<type>;
#else // Using STL
#include <vector>
#define SPECIALIZE_VECTOR(type, name) \
using name##Vector = std::vector<type>; \
SPECIALIZE_ITER(name##Vector)
#include <map>
#define SPECIALIZE_MAP(key, value, name) \
using name##Map = std::map<key, value>; \
SPECIALIZE_ITER(name##Map)
#define map_key(iter) iter->first
#define map_value(iter) iter->second
#include <list>
#define SPECIALIZE_LIST(type, name) \
using name##List = std::list<type>; \
SPECIALIZE_ITER(name##List)
#include <memory>
#define SPECIALIZE_SHAREDPTR(type, name) \
using name##Pointer = std::shared_ptr<type>;
#define SPECIALIZE_WEAKPTR(type, name) \
using name##WeakPointer = std::weak_ptr<type>;
#include <queue>
#define SPECIALIZE_QUEUE(type, name) \
using name##Queue = std::queue<type>;
#include <set>
#define SPECIALIZE_SET(type, name) \
using name##Set = std::set<type>;
#include <utility>
#define SPECIALIZE_PAIR(type1, type2, name) \
using name##Pair = std::pair<type1, type2>;
#endif // QT_VERSION
#endif // __cplusplus