X-Git-Url: https://git.novaco.in/?a=blobdiff_plain;f=src%2Futil.h;fp=src%2Futil.h;h=bcb9559cc7435b03ca88c9b0e6e7a462fa597fcb;hb=ba1e2d7c33a2e54e967c248c39439b894881459b;hp=868a8407de4037e3e0bbd3b32518eae7ce1fb9c6;hpb=3f40bc3293e197f08788673da3b68e6cea9c67bf;p=novacoin.git

diff --git a/src/util.h b/src/util.h
index 868a840..bcb9559 100644
--- a/src/util.h
+++ b/src/util.h
@@ -31,7 +31,6 @@
 #endif
 #include <inttypes.h>
 
-#include "netbase.h" // for AddTimeData
 
 static const int32_t nOneHour = 60 * 60;
 static const int32_t nOneDay = 24 * 60 * 60;
@@ -237,13 +236,8 @@ uint64_t GetRand(uint64_t nMax);
 int64_t GetTime();
 int64_t GetTimeMillis();
 int64_t GetTimeMicros();
-
-int64_t GetAdjustedTime();
-int64_t GetTimeOffset();
-int64_t GetNodesOffset();
 std::string FormatFullVersion();
 std::string FormatSubVersion(const std::string& name, int nClientVersion, const std::vector<std::string>& comments);
-void AddTimeData(const CNetAddr& ip, int64_t nTime);
 void runCommand(std::string strCommand);
 
 
@@ -495,62 +489,6 @@ bool TimingResistantEqual(const T& a, const T& b)
     return accumulator == 0;
 }
 
-/** Median filter over a stream of values.
- * Returns the median of the last N numbers
- */
-template <typename T> class CMedianFilter
-{
-private:
-    std::vector<T> vValues;
-    std::vector<T> vSorted;
-    unsigned int nSize;
-public:
-    CMedianFilter(unsigned int size, T initial_value):
-        nSize(size)
-    {
-        vValues.reserve(size);
-        vValues.push_back(initial_value);
-        vSorted = vValues;
-    }
-
-    void input(T value)
-    {
-        if(vValues.size() == nSize)
-        {
-            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
-    {
-        size_t size = vSorted.size();
-        assert(size>0);
-        if(size & 1) // Odd number of elements
-        {
-            return vSorted[size/2];
-        }
-        else // Even number of elements
-        {
-            return (vSorted[size/2-1] + vSorted[size/2]) / 2;
-        }
-    }
-
-    int size() const
-    {
-        return static_cast<int>(vValues.size());
-    }
-
-    std::vector<T> sorted () const
-    {
-        return vSorted;
-    }
-};
-
 bool NewThread(void(*pfn)(void*), void* parg);
 
 #ifdef WIN32
@@ -591,4 +529,3 @@ inline uint32_t ByteReverse(uint32_t value)
 }
 
 #endif
-