/* plot-auto.h * * Copyright (C) 2009, 2010 Francesco Abbate * * 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 3 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 Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef AGGPLOT_PLOT_AUTO_H #define AGGPLOT_PLOT_AUTO_H #include "plot.h" #include "rect.h" #include "agg_array.h" #include "agg_basics.h" template class plot_auto : public plot { typedef plot_item item; typedef agg::pod_bvector item_list; public: plot_auto() : plot(true), m_bbox_updated(true) { }; virtual ~plot_auto() { }; virtual void add(VertexSource* vs, agg::rgba8& color, bool outline); virtual void before_draw() { check_bounding_box(); }; virtual bool pop_layer(); private: void calc_layer_bounding_box(item_list& layer, opt_rect& rect); void check_bounding_box(); void calc_bounding_box(); bool fit_inside(VertexSource *obj) const; // bounding box bool m_bbox_updated; }; template void plot_auto::add(VS* vs, agg::rgba8& color, bool outline) { item d(vs, color, outline); if (!this->fit_inside(vs)) { this->m_bbox_updated = false; this->m_need_redraw = true; } pod_list *nn = new pod_list(d); this->m_drawing_queue = pod_list::push_back(this->m_drawing_queue, nn); RM::acquire(vs); } template void plot_auto::check_bounding_box() { if (this->m_bbox_updated) return; this->calc_bounding_box(); if (this->m_rect.is_defined()) { const agg::rect_base& bb = this->m_rect.rect(); this->m_ux = units(bb.x1, bb.x2); this->m_uy = units(bb.y1, bb.y2); this->compute_user_trans(); this->m_bbox_updated = true; } } template void plot_auto::calc_layer_bounding_box(plot_auto::item_list& layer, opt_rect& rect) { for (unsigned j = 0; j < layer.size(); j++) { item& d = layer[j]; agg::rect_base r; d.vs->bounding_box(&r.x1, &r.y1, &r.x2, &r.y2); rect.add(r); } } template void plot_auto::calc_bounding_box() { opt_rect box; calc_layer_bounding_box(this->m_root_layer, box); for (unsigned j = 0; j < this->m_layers.size(); j++) { calc_layer_bounding_box(*(this->m_layers[j]), box); } for (pod_list *t = this->m_drawing_queue; t; t = t->next()) { const item& d = t->content(); agg::rect_base r; d.vs->bounding_box(&r.x1, &r.y1, &r.x2, &r.y2); box.add(r); } this->m_rect = box; } template bool plot_auto::fit_inside(VS* obj) const { if (!this->m_bbox_updated || !this->m_rect.is_defined()) return false; agg::rect_base r; obj->bounding_box(&r.x1, &r.y1, &r.x2, &r.y2); const agg::rect_base& bb = this->m_rect.rect(); return bb.hit_test(r.x1, r.y1) && bb.hit_test(r.x2, r.y2); } template bool plot_auto::pop_layer() { bool retval = this->plot::pop_layer(); this->m_bbox_updated = false; return retval; } #endif