tracetreeitemowner.cpp

Go to the documentation of this file.

/*
 * 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, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
 */

#include <cassert>

#include "tracetreeitem.hpp"
#include "tracetreeitemowner.hpp"
#include "trace.hpp"

using std::dynamic_pointer_cast;
using std::max;
using std::make_pair;
using std::min;
using std::pair;
using std::set;
using std::shared_ptr;
using std::static_pointer_cast;
using std::vector;

namespace pv {
namespace view {

const ViewItemOwner::item_list& TraceTreeItemOwner::child_items() const
{
    return items_;
}

vector< std::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(std::shared_ptr<TraceTreeItem> item)
{
    assert(!item->owner());
    item->set_owner(this);
    items_.push_back(item);

    extents_changed(true, true);
}

void TraceTreeItemOwner::remove_child_item(std::shared_ptr<TraceTreeItem> item)
{
    assert(item->owner() == this);
    item->set_owner(nullptr);
    auto iter = std::find(items_.begin(), items_.end(), item);
    assert(iter != items_.end());
    items_.erase(iter);

    extents_changed(true, true);
}

pair<int, int> TraceTreeItemOwner::v_extents() const
{
    pair<int, int> extents(INT_MAX, INT_MIN);

    for (const shared_ptr<TraceTreeItem> t : trace_tree_child_items()) {
        assert(t);
        if (!t->enabled())
            continue;

        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);
    }

    return extents;
}

bool TraceTreeItemOwner::reassign_bgcolour_states(bool next_bgcolour_state)
{
    vector< shared_ptr<TraceTreeItem> > items = trace_tree_child_items();

    // Sort items according to vertical position
    sort(items.begin(), items.end(),
        [](const shared_ptr<TraceTreeItem> a, const shared_ptr<TraceTreeItem> b) {
        return a->layout_v_offset() > b->layout_v_offset(); });

    for (const shared_ptr<TraceTreeItem> item : items) {
        item->set_bgcolour_state(next_bgcolour_state);
        next_bgcolour_state = !next_bgcolour_state;
    }

    return next_bgcolour_state;
}

void TraceTreeItemOwner::restack_items()
{
}

} // view
} // pv