Files
        @ a30d48dab8b8
    
        
              Branch filter: 
        
    Location: tempo-plotter/src/datachunk.cpp
        
            
            a30d48dab8b8
            2.4 KiB
            text/x-c++hdr
        
        
    
    Merge with default
    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 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130  | /*
  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 <QtGlobal>
#include "datachunk.h"
DataChunk::DataChunk(size_t start, size_t capacity)
{
    _start = start;
    _capacity = capacity;
    _size = 0;
    _samples = new double[capacity];
    _min = 0;
    _max = 0;
    _sum = 0;
    _sumSquare = 0;
}
DataChunk::~DataChunk()
{
    delete[] _samples;
}
size_t DataChunk::start() const
{
    return _start;
}
size_t DataChunk::end() const
{
    return _start + _size;
}
bool DataChunk::isFull() const
{
    return left() == 0;
}
size_t DataChunk::size() const
{
    return _size;
}
size_t DataChunk::capacity() const
{
    return _capacity;
}
size_t DataChunk::left() const
{
    return _capacity - _size;
}
double DataChunk::min() const
{
    return _min;
}
double DataChunk::max() const
{
    return _max;
}
double DataChunk::avg() const
{
    return _sum / _size;
}
double DataChunk::meanSquare() const
{
    return _sumSquare / _size;
}
double DataChunk::sample(size_t i) const
{
    Q_ASSERT(i <= _size);
    return _samples[i];
}
void DataChunk::addSamples(double* samples, size_t size)
{
    Q_ASSERT(size > 0 && size <= left());
    // start min&max values from first sample
    if (_size == 0)
    {
        _min = _max = samples[0];
    }
    for (unsigned i = 0; i < size; i++)
    {
        double newSample = samples[i];
        _samples[this->_size + i] = newSample;
        // update min/max and measurements
        if (newSample < _min)
        {
            _min = newSample;
        }
        else if (newSample > _max)
        {
            _max = newSample;
        }
        _sum += newSample;
        _sumSquare += newSample * newSample;
    }
    this->_size += size;
    Q_ASSERT(this->_size <= this->_capacity);
}
 |