/* Copyright (C) 2018 Paul Davis 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include "canvas/grid.h" #include "canvas/rectangle.h" using namespace ArdourCanvas; Grid::Grid (Canvas* canvas) : Item (canvas) , spacing (0) , top_padding (0), right_padding (0), bottom_padding (0), left_padding (0) , top_margin (0), right_margin (0), bottom_margin (0), left_margin (0) , homogenous (false) { self = new Rectangle (this); self->set_outline (false); self->set_fill (false); } Grid::Grid (Item* parent) : Item (parent) , spacing (0) , top_padding (0), right_padding (0), bottom_padding (0), left_padding (0) , top_margin (0), right_margin (0), bottom_margin (0), left_margin (0) , homogenous (false) { self = new Rectangle (this); self->set_outline (false); self->set_fill (false); } Grid::Grid (Item* parent, Duple const & p) : Item (parent, p) , spacing (0) , top_padding (0), right_padding (0), bottom_padding (0), left_padding (0) , top_margin (0), right_margin (0), bottom_margin (0), left_margin (0) , homogenous (false) { self = new Rectangle (this); self->set_outline (false); self->set_fill (false); } void Grid::render (Rect const & area, Cairo::RefPtr context) const { Item::render_children (area, context); } void Grid::compute_bounding_box () const { _bounding_box = boost::none; if (_items.empty()) { _bounding_box_dirty = false; return; } add_child_bounding_boxes (!collapse_on_hide); if (_bounding_box) { Rect r = _bounding_box.get(); _bounding_box = r.expand (top_padding + outline_width() + top_margin, right_padding + outline_width() + right_margin, bottom_padding + outline_width() + bottom_margin, left_padding + outline_width() + left_margin); } _bounding_box_dirty = false; } void Grid::set_spacing (double s) { spacing = s; } void Grid::set_padding (double t, double r, double b, double l) { double last = t; top_padding = t; if (r >= 0) { last = r; } right_padding = last; if (b >= 0) { last = b; } bottom_padding = last; if (l >= 0) { last = l; } left_padding = last; } void Grid::set_margin (double t, double r, double b, double l) { double last = t; top_margin = t; if (r >= 0) { last = r; } right_margin = last; if (b >= 0) { last = b; } bottom_margin = last; if (l >= 0) { last = l; } left_margin = last; } void Grid::reset_self () { if (_bounding_box_dirty) { compute_bounding_box (); } if (!_bounding_box) { self->hide (); return; } Rect r (_bounding_box.get()); /* XXX need to shrink by margin */ self->set (r); } void Grid::reposition_children () { Duple previous_edge (0, 0); Distance largest_width = 0; Distance largest_height = 0; if (homogenous) { for (std::list::iterator i = _items.begin(); ++i != _items.end(); ++i) { boost::optional bb = (*i)->bounding_box(); if (bb) { largest_height = std::max (largest_height, bb.get().height()); largest_width = std::max (largest_width, bb.get().width()); } } } for (std::list::iterator i = _items.begin(); ++i != _items.end(); ++i) { } _bounding_box_dirty = true; reset_self (); } void Grid::place (Item* i, Duple at) { } void Grid::child_changed () { /* catch visibility and size changes */ Item::child_changed (); reposition_children (); } void Grid::set_collapse_on_hide (bool yn) { if (collapse_on_hide != yn) { collapse_on_hide = yn; reposition_children (); } }