CurveDataCircularBuffer.h

Go to the documentation of this file.

/******************************************************************************
 * Copyright (C) 2015 by Ralf Kaestner                                        *
 * ralf.kaestner@gmail.com                                                    *
 *                                                                            *
 * This program is free software; you can redistribute it and/or modify       *
 * it under the terms of the Lesser 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               *
 * Lesser GNU General Public License for more details.                        *
 *                                                                            *
 * You should have received a copy of the Lesser GNU General Public License   *
 * along with this program. If not, see <http://www.gnu.org/licenses/>.       *
 ******************************************************************************/

#ifndef RQT_MULTIPLOT_CURVE_DATA_CIRCULAR_BUFFER_H
#define RQT_MULTIPLOT_CURVE_DATA_CIRCULAR_BUFFER_H

#include <boost/circular_buffer.hpp>
#include <boost/heap/d_ary_heap.hpp>

#include <rqt_multiplot/CurveData.h>

namespace rqt_multiplot {
  class CurveDataCircularBuffer :
    public CurveData {
  public:
    CurveDataCircularBuffer(size_t capacity = 0);
    ~CurveDataCircularBuffer();

    size_t getCapacity() const;
    size_t getNumPoints() const;
    QPointF getPoint(size_t index) const;
    QVector<size_t> getPointsInDistance(double x, double maxDistance)
      const;
    BoundingRectangle getBounds() const;
    
    void appendPoint(const QPointF& point);
    void clearPoints();
  
  private:
    class Point;
    
    class XCoordinateRef {
    public:
      inline XCoordinateRef(double x = 0.0, size_t index = 0) :
        x_(x),
        index_(index) {
      };

      inline XCoordinateRef(const XCoordinateRef& src) :
        x_(src.x_),
        index_(src.index_) {
      };
      
      inline bool operator==(const XCoordinateRef& reference) const {
        return (x_ == reference.x_);
      };
      
      inline bool operator>(const XCoordinateRef& reference) const {
        return (x_ > reference.x_);
      };
      
      inline bool operator<(const XCoordinateRef& reference) const {
        return (x_ < reference.x_);
      };
      
      double x_;
      size_t index_;
    };
    
    typedef boost::circular_buffer<Point> Points;    
    typedef boost::heap::d_ary_heap<XCoordinateRef, boost::
      heap::arity<2>, boost::heap::mutable_<true>, boost::
      heap::compare<std::greater<XCoordinateRef> > >
      XCoordinateRefMinHeap;
    typedef boost::heap::d_ary_heap<double, boost::heap::arity<2>, 
      boost::heap::mutable_<true>, boost::heap::compare<std::
      greater<double> > > CoordinateMinHeap;
    typedef boost::heap::d_ary_heap<double, boost::heap::arity<2>, 
      boost::heap::mutable_<true>, boost::heap::compare<std::
      less<double> > > CoordinateMaxHeap;
    
    class Point {
    public:
      inline Point(const QPointF& point = QPointF(0.0, 0.0)) :
        x_(point.x()),
        y_(point.y()) {
      };
      
      double x_;
      double y_;
      
      XCoordinateRefMinHeap::handle_type xMinHandle_;
      CoordinateMaxHeap::handle_type xMaxHandle_;
      CoordinateMinHeap::handle_type yMinHandle_;
      CoordinateMaxHeap::handle_type yMaxHandle_;
    };
      
    Points points_;
    
    XCoordinateRefMinHeap xMin_;
    CoordinateMaxHeap xMax_;
    CoordinateMinHeap yMin_;
    CoordinateMaxHeap yMax_;
  };
};

#endif