pv/view/tracetreeitemowner.cpp

   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 "tracetreeitem.hpp"
  24 #include "tracetreeitemowner.hpp"
  25 #include "trace.hpp"
  26
  27 using std::dynamic_pointer_cast;
  28 using std::max;
  29 using std::make_pair;
  30 using std::min;
  31 using std::pair;
  32 using std::set;
  33 using std::shared_ptr;
  34 using std::vector;
  35
  36 namespace pv {
  37 namespace view {
  38
  39 vector< shared_ptr<TraceTreeItem> >& TraceTreeItemOwner::child_items()
  40 {
  41         return items_;
  42 }
  43
  44 const vector< shared_ptr<TraceTreeItem> >& TraceTreeItemOwner::child_items() const
  45 {
  46         return items_;
  47 }
  48
  49 void TraceTreeItemOwner::clear_child_items()
  50 {
  51         for (auto &i : items_) {
  52                 assert(i->owner() == this);
  53                 i->set_owner(nullptr);
  54         }
  55         items_.clear();
  56 }
  57
  58 void TraceTreeItemOwner::add_child_item(std::shared_ptr<TraceTreeItem> item)
  59 {
  60         assert(!item->owner());
  61         item->set_owner(this);
  62         items_.push_back(item);
  63
  64         extents_changed(true, true);
  65 }
  66
  67 void TraceTreeItemOwner::remove_child_item(std::shared_ptr<TraceTreeItem> item)
  68 {
  69         assert(item->owner() == this);
  70         item->set_owner(nullptr);
  71         auto iter = std::find(items_.begin(), items_.end(), item);
  72         assert(iter != items_.end());
  73         items_.erase(iter);
  74
  75         extents_changed(true, true);
  76 }
  77
  78 TraceTreeItemOwner::iterator TraceTreeItemOwner::begin()
  79 {
  80         return iterator(this, items_.begin());
  81 }
  82
  83 TraceTreeItemOwner::iterator TraceTreeItemOwner::end()
  84 {
  85         return iterator(this);
  86 }
  87
  88 TraceTreeItemOwner::const_iterator TraceTreeItemOwner::begin() const
  89 {
  90         return const_iterator(this, items_.cbegin());
  91 }
  92
  93 TraceTreeItemOwner::const_iterator TraceTreeItemOwner::end() const
  94 {
  95         return const_iterator(this);
  96 }
  97
  98 set< TraceTreeItemOwner* > TraceTreeItemOwner::list_row_item_owners()
  99 {
 100         set< TraceTreeItemOwner* > owners;
 101         for (const auto &r : *this)
 102                 owners.insert(r->owner());
 103         return owners;
 104 }
 105
 106 pair<int, int> TraceTreeItemOwner::v_extents() const
 107 {
 108         pair<int, int> extents(INT_MAX, INT_MIN);
 109
 110         for (const shared_ptr<TraceTreeItem> r : child_items()) {
 111                 assert(r);
 112                 if (!r->enabled())
 113                         continue;
 114
 115                 const int child_offset = r->layout_v_offset();
 116                 const pair<int, int> child_extents = r->v_extents();
 117                 extents.first = min(child_extents.first + child_offset,
 118                         extents.first);
 119                 extents.second = max(child_extents.second + child_offset,
 120                         extents.second);
 121         }
 122
 123         return extents;
 124 }
 125
 126 void TraceTreeItemOwner::restack_items()
 127 {
 128 }
 129
 130 } // view
 131 } // pv