2014-12-17 02:47:57 +01:00
|
|
|
// Copyright (c) 2014 The Bitcoin Core developers
|
2014-10-31 01:43:19 +01:00
|
|
|
// Distributed under the MIT software license, see the accompanying
|
2014-06-19 15:08:37 +02:00
|
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
|
|
|
|
#ifndef BITCOIN_TIMEDATA_H
|
|
|
|
#define BITCOIN_TIMEDATA_H
|
|
|
|
|
2014-08-20 13:53:42 +02:00
|
|
|
#include <algorithm>
|
|
|
|
#include <assert.h>
|
2014-09-14 12:43:56 +02:00
|
|
|
#include <stdint.h>
|
|
|
|
#include <vector>
|
2014-06-19 15:08:37 +02:00
|
|
|
|
2016-03-30 09:31:32 +02:00
|
|
|
static const int64_t DEFAULT_MAX_TIME_ADJUSTMENT = 70 * 60;
|
|
|
|
|
2014-06-19 15:08:37 +02:00
|
|
|
class CNetAddr;
|
|
|
|
|
2020-07-29 03:23:12 +02:00
|
|
|
/**
|
2014-10-31 01:43:19 +01: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:
|
2017-03-03 15:48:18 +01:00
|
|
|
CMedianFilter(unsigned int _size, T initial_value) : nSize(_size)
|
2014-08-20 13:53:42 +02:00
|
|
|
{
|
2017-03-03 15:48:18 +01:00
|
|
|
vValues.reserve(_size);
|
2014-08-20 13:53:42 +02:00
|
|
|
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
|
|
|
|
{
|
2017-03-03 15:48:18 +01:00
|
|
|
int vSortedSize = vSorted.size();
|
|
|
|
assert(vSortedSize > 0);
|
|
|
|
if (vSortedSize & 1) // Odd number of elements
|
2014-08-20 13:53:42 +02:00
|
|
|
{
|
2017-03-03 15:48:18 +01:00
|
|
|
return vSorted[vSortedSize / 2];
|
2014-09-19 19:21:46 +02:00
|
|
|
} else // Even number of elements
|
2014-08-20 13:53:42 +02:00
|
|
|
{
|
2017-03-03 15:48:18 +01:00
|
|
|
return (vSorted[vSortedSize / 2 - 1] + vSorted[vSortedSize / 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 01:43:19 +01: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);
|
|
|
|
|
2021-01-18 14:27:00 +01:00
|
|
|
/**
|
|
|
|
* Reset the internal state of GetTimeOffset(), GetAdjustedTime() and AddTimeData().
|
|
|
|
*/
|
|
|
|
void TestOnlyResetTimeData();
|
|
|
|
|
2014-08-28 22:21:03 +02:00
|
|
|
#endif // BITCOIN_TIMEDATA_H
|