/usr/include/libktorrent/torrent/timeestimator.h is in libktorrent-dev 1.3.1-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /***************************************************************************
* Copyright (C) 2006 by Ivan Vasić *
* ivasic@gmail.com *
* *
* 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 2 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, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#ifndef BTTIMEESTIMATOR_H
#define BTTIMEESTIMATOR_H
#include <climits>
#include <ktorrent_export.h>
#include <util/constants.h>
namespace bt
{
class TorrentControl;
/**
* Simple queue class for samples. Optimized for speed and size
* without possibility to dynamically resize itself.
* @author Ivan Vasic <ivasic@gmail.com>
*/
class SampleQueue
{
public:
SampleQueue(int max);
~SampleQueue();
/**
* Inserts new sample into the queue. The oldest sample is overwritten.
*/
void push(Uint32 sample);
Uint32 first();
Uint32 last();
bool isFull();
/**
* This function will return the number of samples in queue until it counts m_size number of elements.
* After this point it will always return m_size since no samples are being deleted.
*/
int count();
/**
* Returns the sum of all samples.
*/
Uint32 sum();
private:
int m_size;
int m_count;
int m_start;
int m_end;
Uint32* m_samples;
};
/**
* ETA estimator class. It will use different algorithms for different download phases.
* @author Ivan Vasic <ivasic@gmail.com>
*/
class KTORRENT_EXPORT TimeEstimator
{
public:
static const int NEVER = INT_MAX;
static const int ALREADY_FINISHED = 0;
enum ETAlgorithm
{
ETA_KT, //ktorrent default algorithm - combination of the following according to our tests
ETA_CSA, //current speed algorithm
ETA_GASA, //global average speed algorithm
ETA_WINX, //window of X algorithm
ETA_MAVG //moving average algorithm
};
TimeEstimator(TorrentControl* tc);
~TimeEstimator();
///Returns ETA for m_tc torrent.
int estimate();
static void setAlgorithm(ETAlgorithm theValue);
static ETAlgorithm algorithm() { return m_algorithm; }
private:
int estimateCSA();
int estimateGASA();
int estimateWINX();
int estimateMAVG();
int estimateKT();
Uint32 sample() const;
Uint64 bytesLeft() const;
TorrentControl* m_tc;
SampleQueue* m_samples;
Uint32 m_lastAvg;
int m_lastETA;
//last percentage
double m_perc;
static ETAlgorithm m_algorithm;
};
}
#endif
|