1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89
/* Copyright © 2017 Hasan Yavuz Özderya This file is part of serialplot. serialplot 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. serialplot 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 serialplot. If not, see <http://www.gnu.org/licenses/>. */ #include "framebufferseries.h" FrameBufferSeries::FrameBufferSeries(FrameBuffer* buffer) { xAsIndex = true; _xmin = 0; _xmax = 1; _buffer = buffer; int_index_start = 0; int_index_end = 0; } void FrameBufferSeries::setXAxis(bool asIndex, double xmin, double xmax) { xAsIndex = asIndex; _xmin = xmin; _xmax = xmax; } size_t FrameBufferSeries::size() const { return int_index_end - int_index_start; } QPointF FrameBufferSeries::sample(size_t i) const { i += int_index_start; if (xAsIndex) { return QPointF(i, _buffer->sample(i)); } else { return QPointF(i * (_xmax - _xmin) / _buffer->size() + _xmin, _buffer->sample(i)); } } QRectF FrameBufferSeries::boundingRect() const { if (xAsIndex) { return _buffer->boundingRect(); } else { auto rect = _buffer->boundingRect(); rect.setLeft(_xmin); rect.setRight(_xmax); return rect; } } void FrameBufferSeries::setRectOfInterest(const QRectF& rect) { if (xAsIndex) { int_index_start = rect.left(); int_index_end = rect.right(); } else { double xsize = _xmax - _xmin; size_t bsize = _buffer->size(); int_index_start = bsize * (rect.left()-_xmin) / xsize; int_index_end = bsize * (rect.right()-_xmin) / xsize; } int_index_start = std::max(int_index_start, (size_t) 0); int_index_end = std::min(_buffer->size(), int_index_end); }