blob: 668695877ef8fb154cfcbacf03cb3c0f36eb351d (
plain)
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
|
// Copyright (C) 2018 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only
#ifndef QRECURSIONWATCHER_P_H
#define QRECURSIONWATCHER_P_H
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists purely as an
// implementation detail. This header file may change from version to
// version without notice, or even be removed.
//
// We mean it.
//
#include <QtCore/private/qglobal_p.h>
QT_BEGIN_NAMESPACE
class QRecursionNode;
class QRecursionNode {
public:
inline QRecursionNode();
bool *_r;
};
template<class T, QRecursionNode T::*Node>
class QRecursionWatcher {
public:
inline QRecursionWatcher(T *);
inline ~QRecursionWatcher();
inline bool hasRecursed() const;
private:
T *_t;
bool _r;
};
QRecursionNode::QRecursionNode()
: _r(nullptr)
{
}
template<class T, QRecursionNode T::*Node>
QRecursionWatcher<T, Node>::QRecursionWatcher(T *t)
: _t(t), _r(false)
{
if ((_t->*Node)._r) *(_t->*Node)._r = true;
(_t->*Node)._r = &_r;
}
template<class T, QRecursionNode T::*Node>
QRecursionWatcher<T, Node>::~QRecursionWatcher()
{
if ((_t->*Node)._r == &_r) (_t->*Node)._r = nullptr;
}
template<class T, QRecursionNode T::*Node>
bool QRecursionWatcher<T, Node>::hasRecursed() const
{
return _r;
}
QT_END_NAMESPACE
#endif // QRECURSIONWATCHER_P_H
|
