]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * This file is part of the PulseView project. | |
3 | * | |
4 | * Copyright (C) 2014 Joel Holdsworth <joel@airwebreathe.org.uk> | |
5 | * | |
6 | * This program is free software; you can redistribute it and/or modify | |
7 | * it under the terms of the GNU General Public License as published by | |
8 | * the Free Software Foundation; either version 2 of the License, or | |
9 | * (at your option) any later version. | |
10 | * | |
11 | * This program is distributed in the hope that it will be useful, | |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | * GNU General Public License for more details. | |
15 | * | |
16 | * You should have received a copy of the GNU General Public License | |
17 | * along with this program; if not, write to the Free Software | |
18 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
19 | */ | |
20 | ||
21 | #include <cassert> | |
22 | ||
23 | #include "rowitem.hpp" | |
24 | #include "rowitemowner.hpp" | |
25 | ||
26 | using std::max; | |
27 | using std::make_pair; | |
28 | using std::min; | |
29 | using std::pair; | |
30 | using std::shared_ptr; | |
31 | using std::vector; | |
32 | ||
33 | namespace pv { | |
34 | namespace view { | |
35 | ||
36 | vector< shared_ptr<RowItem> >& RowItemOwner::child_items() | |
37 | { | |
38 | return items_; | |
39 | } | |
40 | ||
41 | const vector< shared_ptr<RowItem> >& RowItemOwner::child_items() const | |
42 | { | |
43 | return items_; | |
44 | } | |
45 | ||
46 | void RowItemOwner::clear_child_items() | |
47 | { | |
48 | for (auto &i : items_) { | |
49 | assert(i->owner() == this); | |
50 | i->set_owner(nullptr); | |
51 | } | |
52 | items_.clear(); | |
53 | } | |
54 | ||
55 | void RowItemOwner::add_child_item(std::shared_ptr<RowItem> item) | |
56 | { | |
57 | assert(!item->owner()); | |
58 | item->set_owner(this); | |
59 | items_.push_back(item); | |
60 | ||
61 | extents_changed(true, true); | |
62 | } | |
63 | ||
64 | void RowItemOwner::remove_child_item(std::shared_ptr<RowItem> item) | |
65 | { | |
66 | assert(item->owner() == this); | |
67 | item->set_owner(nullptr); | |
68 | auto iter = std::find(items_.begin(), items_.end(), item); | |
69 | assert(iter != items_.end()); | |
70 | items_.erase(iter); | |
71 | ||
72 | extents_changed(true, true); | |
73 | } | |
74 | ||
75 | RowItemOwner::iterator RowItemOwner::begin() | |
76 | { | |
77 | return iterator(this, items_.begin()); | |
78 | } | |
79 | ||
80 | RowItemOwner::iterator RowItemOwner::end() | |
81 | { | |
82 | return iterator(this); | |
83 | } | |
84 | ||
85 | RowItemOwner::const_iterator RowItemOwner::begin() const | |
86 | { | |
87 | return const_iterator(this, items_.cbegin()); | |
88 | } | |
89 | ||
90 | RowItemOwner::const_iterator RowItemOwner::end() const | |
91 | { | |
92 | return const_iterator(this); | |
93 | } | |
94 | ||
95 | pair<int, int> RowItemOwner::v_extents() const | |
96 | { | |
97 | pair<int, int> extents(INT_MAX, INT_MIN); | |
98 | ||
99 | for (const shared_ptr<RowItem> r : child_items()) { | |
100 | assert(r); | |
101 | if (!r->enabled()) | |
102 | continue; | |
103 | ||
104 | const int child_offset = r->layout_v_offset(); | |
105 | const pair<int, int> child_extents = r->v_extents(); | |
106 | extents.first = min(child_extents.first + child_offset, | |
107 | extents.first); | |
108 | extents.second = max(child_extents.second + child_offset, | |
109 | extents.second); | |
110 | } | |
111 | ||
112 | return extents; | |
113 | } | |
114 | ||
115 | void RowItemOwner::restack_items() | |
116 | { | |
117 | } | |
118 | ||
119 | } // view | |
120 | } // pv |