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
|
/*
* This file is part of the PulseView project.
*
* Copyright (C) 2014 Joel Holdsworth <joel@airwebreathe.org.uk>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <http://www.gnu.org/licenses/>.
*/
#include <cassert>
#include "tracetreeitem.hpp"
#include "trace.hpp"
#include "tracetreeitemowner.hpp"
using std::find;
using std::make_pair;
using std::max;
using std::min;
using std::pair;
using std::shared_ptr;
using std::static_pointer_cast;
using std::vector;
namespace pv {
namespace views {
namespace trace {
const ViewItemOwner::item_list& TraceTreeItemOwner::child_items() const
{
return items_;
}
vector< shared_ptr<TraceTreeItem> >
TraceTreeItemOwner::trace_tree_child_items() const
{
vector< shared_ptr<TraceTreeItem> > items;
for (auto &i : items_) {
assert(dynamic_pointer_cast<TraceTreeItem>(i));
const shared_ptr<TraceTreeItem> t(
static_pointer_cast<TraceTreeItem>(i));
items.push_back(t);
}
return items;
}
void TraceTreeItemOwner::clear_child_items()
{
for (auto &t : trace_tree_child_items()) {
assert(t->owner() == this);
t->set_owner(nullptr);
}
items_.clear();
}
void TraceTreeItemOwner::add_child_item(shared_ptr<TraceTreeItem> item)
{
assert(!item->owner());
item->set_owner(this);
items_.push_back(item);
extents_changed(true, true);
}
void TraceTreeItemOwner::remove_child_item(shared_ptr<TraceTreeItem> item)
{
assert(item->owner() == this);
item->set_owner(nullptr);
auto iter = find(items_.begin(), items_.end(), item);
assert(iter != items_.end());
items_.erase(iter);
extents_changed(true, true);
}
pair<int, int> TraceTreeItemOwner::v_extents() const
{
bool has_children = false;
pair<int, int> extents(INT_MAX, INT_MIN);
for (const shared_ptr<TraceTreeItem>& t : trace_tree_child_items()) {
assert(t);
if (!t->enabled())
continue;
has_children = true;
const int child_offset = t->layout_v_offset();
const pair<int, int> child_extents = t->v_extents();
extents.first = min(child_extents.first + child_offset,
extents.first);
extents.second = max(child_extents.second + child_offset,
extents.second);
}
if (!has_children)
extents = make_pair(0, 0);
return extents;
}
void TraceTreeItemOwner::restack_items()
{
vector<shared_ptr<TraceTreeItem>> items(trace_tree_child_items());
// Sort by the center line of the extents
stable_sort(items.begin(), items.end(),
[](const shared_ptr<TraceTreeItem> &a, const shared_ptr<TraceTreeItem> &b) {
const auto aext = a->v_extents();
const auto bext = b->v_extents();
return a->layout_v_offset() +
(aext.first + aext.second) / 2 <
b->layout_v_offset() +
(bext.first + bext.second) / 2;
});
int total_offset = 0;
for (shared_ptr<TraceTreeItem> r : items) {
const pair<int, int> extents = r->v_extents();
if (extents.first == 0 && extents.second == 0)
continue;
// We position disabled traces, so that they are close to the
// animation target positon should they be re-enabled
if (r->enabled())
total_offset += -extents.first;
if (!r->dragging())
r->set_layout_v_offset(total_offset);
if (r->enabled())
total_offset += extents.second;
}
}
} // namespace trace
} // namespace views
} // namespace pv
|
