blob: 567c44981fed652173b601f97e2f31772e9a5c60 (
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
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
|
/****************************************************************************
**
** 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.
**
****************************************************************************/
/*!
\class QmlProfiler::SortedTimelineModel
\brief Sorted model for timeline data
The SortedTimelineModel lets you keep any kind of range data sorted by
both start and end times, so that visible ranges can easily be computed.
*/
/*!
\fn SortedTimelineModel::clear()
Clears the ranges and their end times.
*/
/*!
\fn int SortedTimelineModel::count() const
Returns the number of ranges in the model.
*/
/*!
\fn qint64 SortedTimelineModel::firstStartTime() const
Returns the begin of the first range in the model.
*/
/*!
\fn qint64 SortedTimelineModel::lastEndTime() const
Returns the end of the last range in the model.
*/
/*!
\fn const SortedTimelineModel<Data>::Range &SortedTimelineModel::range(int index) const
Returns the range data at the specified index.
*/
/*!
\fn Data &SortedTimelineModel::data(int index)
Returns modifiable user data for the range at the specified index.
*/
/*!
\fn int SortedTimelineModel::insert(qint64 startTime, qint64 duration, const Data &item)
Inserts the given data at the given time position and returns its index.
*/
/*!
\fn int SortedTimelineModel::insertStart(qint64 startTime, const Data &item)
Inserts the given data as range start at the given time position and
returns its index. The range end isn't set.
*/
/*!
\fn int SortedTimelineModel::insertEnd(int index, qint64 duration)
Adds a range end for the given start index.
*/
/*!
\fn int SortedTimelineModel::findFirstIndexNoParents(qint64 startTime) const
Looks up the first range with an end time greater than the given time and
returns its index. If no such range is found it returns -1.
*/
/*!
\fn int SortedTimelineModel::findFirstIndex(qint64 startTime) const
Looks up the first range with an end time greater than the given time and
returns its parent's index. If no such range is found it returns -1. If there
is no parent it returns the found range's index. The parent of a range is the
range with the lowest start time that completely covers the child range.
"Completely covers" means:
parent.startTime <= child.startTime && parent.endTime >= child.endTime
*/
/*!
\fn int SortedTimelineModel::findLastIndex(qint64 endTime) const
Looks up the last range with a start time smaller than the given time and
returns its index. If no such range is found it returns -1.
*/
/*!
\fn void computeNesting()
Compute all ranges' parents.
\sa findFirstIndex
*/
|
