Files
        @ 71441196d1c5
    
        
              Branch filter: 
        
    Location: tempo-plotter/src/indexbuffer.cpp - annotation
        
            
            71441196d1c5
            1.2 KiB
            text/x-c++hdr
        
        
    
    Merge with default
    f8c253a6ab5f 7dd5ac90961f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f f8c253a6ab5f 7dd5ac90961f 7dd5ac90961f 7dd5ac90961f 7dd5ac90961f 7dd5ac90961f 7dd5ac90961f 7dd5ac90961f 7dd5ac90961f 7dd5ac90961f 7dd5ac90961f 7dd5ac90961f 7dd5ac90961f  | /*
  Copyright © 2018 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 <QtGlobal>
#include "indexbuffer.h"
IndexBuffer::IndexBuffer(unsigned n)
{
    _size = n;
}
unsigned IndexBuffer::size() const
{
    return _size;
}
void IndexBuffer::resize(unsigned n)
{
    _size = n;
}
double IndexBuffer::sample(unsigned i) const
{
    Q_ASSERT(i < _size);
    return i;
}
Range IndexBuffer::limits() const
{
    return Range{0, _size-1.};
}
int IndexBuffer::findIndex(double value) const
{
    if (value < 0 || value > size() - 1)
    {
        return OUT_OF_RANGE;
    }
    else
    {
        return value;
    }
}
 |