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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
|
/****************************************************************************
**
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of Qt Creator.
**
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
****************************************************************************/
#ifndef SORTEDTIMELINEMODEL_H
#define SORTEDTIMELINEMODEL_H
#include <QVector>
#include <QLinkedList>
namespace QmlProfiler {
template<class Data>
class SortedTimelineModel {
public:
struct Range : public Data {
Range() : Data(), start(-1), duration(-1), parent(-1) {}
Range(qint64 start, qint64 duration, const Data &item) :
Data(item), start(start), duration(duration), parent(-1) {}
qint64 start;
qint64 duration;
int parent;
inline qint64 timestamp() const {return start;}
};
struct RangeEnd {
RangeEnd() : startIndex(-1), end(-1) {}
RangeEnd(int startIndex, qint64 end) :
startIndex(startIndex), end(end) {}
int startIndex;
qint64 end;
inline qint64 timestamp() const {return end;}
};
void clear()
{
ranges.clear();
endTimes.clear();
}
inline int count() const { return ranges.count(); }
inline qint64 lastEndTime() const { return endTimes.last().end; }
inline qint64 firstStartTime() const { return ranges.first().start; }
inline const Range &range(int index) { return ranges[index]; }
inline Data &data(int index) { return ranges[index]; }
inline int insert(qint64 startTime, qint64 duration, const Data &item)
{
/* Doing insert-sort here is preferable as most of the time the times will actually be
* presorted in the right way. So usually this will just result in appending. */
int index = insertSorted(ranges, Range(startTime, duration, item));
insertSorted(endTimes, RangeEnd(index, startTime + duration));
return index;
}
inline int insertStart(qint64 startTime, const Data &item)
{
return insertSorted(ranges, Range(startTime, 0, item));
}
inline void insertEnd(int index, qint64 duration)
{
ranges[index].duration = duration;
insertSorted(endTimes, RangeEnd(index, ranges[index].start + duration));
}
inline int findFirstIndex(qint64 startTime) const
{
int index = findFirstIndexNoParents(startTime);
if (index == -1)
return -1;
int parent = ranges[index].parent;
return parent == -1 ? index : parent;
}
inline int findFirstIndexNoParents(qint64 startTime) const
{
// in the "endtime" list, find the first event that ends after startTime
if (endTimes.isEmpty())
return -1;
if (endTimes.count() == 1 || endTimes.first().end >= startTime)
return endTimes.first().startIndex;
if (endTimes.last().end <= startTime)
return -1;
return endTimes[lowerBound(endTimes, startTime) + 1].startIndex;
}
inline int findLastIndex(qint64 endTime) const
{
// in the "starttime" list, find the last event that starts before endtime
if (ranges.isEmpty() || ranges.first().start >= endTime)
return -1;
if (ranges.count() == 1)
return 0;
if (ranges.last().start <= endTime)
return ranges.count() - 1;
return lowerBound(ranges, endTime);
}
inline void computeNesting()
{
QLinkedList<int> parents;
for (int range = 0; range != count(); ++range) {
Range ¤t = ranges[range];
for (QLinkedList<int>::iterator parent = parents.begin(); parent != parents.end();) {
qint64 parentEnd = ranges[*parent].start + ranges[*parent].duration;
if (parentEnd < current.start) {
parent = parents.erase(parent);
} else if (parentEnd >= current.start + current.duration) {
current.parent = *parent;
break;
} else {
++parent;
}
}
parents.append(range);
}
}
protected:
template<typename RangeDelimiter>
static inline int insertSorted(QVector<RangeDelimiter> &container, const RangeDelimiter &item)
{
for (int i = container.count();;) {
if (i == 0) {
container.prepend(item);
return 0;
}
if (container[--i].timestamp() <= item.timestamp()) {
container.insert(++i, item);
return i;
}
}
}
template<typename RangeDelimiter>
static inline int lowerBound(const QVector<RangeDelimiter> container, qint64 time)
{
int fromIndex = 0;
int toIndex = container.count() - 1;
while (toIndex - fromIndex > 1) {
int midIndex = (fromIndex + toIndex)/2;
if (container[midIndex].timestamp() < time)
fromIndex = midIndex;
else
toIndex = midIndex;
}
return fromIndex;
}
QVector<Range> ranges;
QVector<RangeEnd> endTimes;
};
}
#endif
|
