2017-11-09 19:34:51 +01:00
|
|
|
/*
|
|
|
|
|
* This file is part of the Flowee project
|
|
|
|
|
* Copyright (C) 2014 The Bitcoin Core developers
|
|
|
|
|
*
|
|
|
|
|
* 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, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
*/
|
2014-06-19 15:08:37 +02:00
|
|
|
|
2018-01-16 10:47:52 +00:00
|
|
|
#ifndef FLOWEE_TIMEDATA_H
|
|
|
|
|
#define FLOWEE_TIMEDATA_H
|
2014-06-19 15:08:37 +02:00
|
|
|
|
2014-08-20 13:53:42 +02:00
|
|
|
#include <algorithm>
|
2017-08-17 20:53:23 -06:00
|
|
|
#include <cassert>
|
|
|
|
|
#include <cstdint>
|
2014-09-14 12:43:56 +02:00
|
|
|
#include <vector>
|
2014-06-19 15:08:37 +02:00
|
|
|
|
|
|
|
|
class CNetAddr;
|
|
|
|
|
|
2014-10-31 08:43:19 +08:00
|
|
|
/**
|
|
|
|
|
* Median filter over a stream of values.
|
2014-08-20 13:53:42 +02:00
|
|
|
* Returns the median of the last N numbers
|
|
|
|
|
*/
|
2014-09-19 19:21:46 +02:00
|
|
|
template <typename T>
|
|
|
|
|
class CMedianFilter
|
2014-08-20 13:53:42 +02:00
|
|
|
{
|
|
|
|
|
private:
|
|
|
|
|
std::vector<T> vValues;
|
|
|
|
|
std::vector<T> vSorted;
|
|
|
|
|
unsigned int nSize;
|
2014-09-19 19:21:46 +02:00
|
|
|
|
2014-08-20 13:53:42 +02:00
|
|
|
public:
|
2014-09-19 19:21:46 +02:00
|
|
|
CMedianFilter(unsigned int size, T initial_value) : nSize(size)
|
2014-08-20 13:53:42 +02:00
|
|
|
{
|
|
|
|
|
vValues.reserve(size);
|
|
|
|
|
vValues.push_back(initial_value);
|
|
|
|
|
vSorted = vValues;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void input(T value)
|
|
|
|
|
{
|
2014-09-19 19:21:46 +02:00
|
|
|
if (vValues.size() == nSize) {
|
2014-08-20 13:53:42 +02:00
|
|
|
vValues.erase(vValues.begin());
|
|
|
|
|
}
|
|
|
|
|
vValues.push_back(value);
|
|
|
|
|
|
|
|
|
|
vSorted.resize(vValues.size());
|
|
|
|
|
std::copy(vValues.begin(), vValues.end(), vSorted.begin());
|
|
|
|
|
std::sort(vSorted.begin(), vSorted.end());
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
T median() const
|
|
|
|
|
{
|
|
|
|
|
int size = vSorted.size();
|
2014-09-19 19:21:46 +02:00
|
|
|
assert(size > 0);
|
|
|
|
|
if (size & 1) // Odd number of elements
|
2014-08-20 13:53:42 +02:00
|
|
|
{
|
2014-09-19 19:21:46 +02:00
|
|
|
return vSorted[size / 2];
|
|
|
|
|
} else // Even number of elements
|
2014-08-20 13:53:42 +02:00
|
|
|
{
|
2014-09-19 19:21:46 +02:00
|
|
|
return (vSorted[size / 2 - 1] + vSorted[size / 2]) / 2;
|
2014-08-20 13:53:42 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int size() const
|
|
|
|
|
{
|
|
|
|
|
return vValues.size();
|
|
|
|
|
}
|
|
|
|
|
|
2014-09-19 19:21:46 +02:00
|
|
|
std::vector<T> sorted() const
|
2014-08-20 13:53:42 +02:00
|
|
|
{
|
|
|
|
|
return vSorted;
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
2014-10-31 08:43:19 +08:00
|
|
|
/** Functions to keep track of adjusted P2P time */
|
2014-06-19 15:08:37 +02:00
|
|
|
int64_t GetTimeOffset();
|
|
|
|
|
int64_t GetAdjustedTime();
|
|
|
|
|
void AddTimeData(const CNetAddr& ip, int64_t nTime);
|
|
|
|
|
|
2018-01-16 10:47:52 +00:00
|
|
|
#endif
|