blob: f0b4e8b8d4e45cb7d5326da1235e1b73ec5957c8 (
plain)
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
|
/***************************************************************************
graph.cpp
-------------------
begin : Sat Sep 29 2001
copyright : (C) 2001 - 2012 by Roland Riegel
email : feedback@roland-riegel.de
***************************************************************************/
/***************************************************************************
* *
* 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. *
* *
***************************************************************************/
#include "graph.h"
#include "setting.h"
#include "settingstore.h"
#include "window.h"
using namespace std;
Graph::Graph()
: m_heightOfBars(5), m_maxDeflection(10 * 1024 * 1024 / 8)
{
}
Graph::~Graph()
{
}
// sets the number of the graph's vertical #-bars
void Graph::setNumOfBars(unsigned int numOfBars)
{
// vertically resize the graph's value list
m_values.resize(numOfBars);
}
// sets the height of the graph's vertical #-bars
void Graph::setHeightOfBars(unsigned int heightOfBars)
{
m_heightOfBars = heightOfBars;
}
void Graph::setMaxDeflection(unsigned long long maxDeflection)
{
m_maxDeflection = maxDeflection;
}
// new traffic measurement has been made => update the graph's value list
void Graph::update(unsigned long long value)
{
// [new_value] = Bytes/s
// put new value to the beginning of the list, it becomes the first #-bar
m_values.push_front(value);
// delete the last #-bar of the list, but keep at least one
if(m_values.size() > 1)
m_values.pop_back();
}
// print the graph with the upper left corner at the coordinates (x, y)
void Graph::print(Window& window, int x, int y)
{
window.setXY(x, y);
// cycle through through the lines
for(unsigned int l = 0; l < m_heightOfBars; l++)
{
// for each line cycle through the rows
for(list<unsigned long long>::reverse_iterator r = m_values.rbegin(); r != m_values.rend() ; r++)
{
unsigned long long trafficPerLine = m_maxDeflection / m_heightOfBars;
unsigned long long lowerLimit = m_maxDeflection * (m_heightOfBars - l - 1) / m_heightOfBars;
if(*r < lowerLimit)
{
window.print(' ');
}
else
{
unsigned long long restOfTraffic = *r - lowerLimit;
if(restOfTraffic >= trafficPerLine)
window.print('#');
else if(restOfTraffic >= trafficPerLine * 7 / 10)
window.print('|');
else if(restOfTraffic >= trafficPerLine * 3 / 10)
window.print('.');
else
window.print(' ');
}
}
window.print('\n');
window.setX(x);
}
}
// reset all traffic values in the graph to zero
void Graph::resetTrafficData()
{
int size = m_values.size();
m_values.clear();
m_values.resize(size);
}
|
