1 | /**************************************************************************** |
2 | ** |
3 | ** Copyright (C) 2017 The Qt Company Ltd. |
4 | ** Contact: https://www.qt.io/licensing/ |
5 | ** |
6 | ** This file is part of the examples of the Qt Toolkit. |
7 | ** |
8 | ** $QT_BEGIN_LICENSE:BSD$ |
9 | ** Commercial License Usage |
10 | ** Licensees holding valid commercial Qt licenses may use this file in |
11 | ** accordance with the commercial license agreement provided with the |
12 | ** Software or, alternatively, in accordance with the terms contained in |
13 | ** a written agreement between you and The Qt Company. For licensing terms |
14 | ** and conditions see https://www.qt.io/terms-conditions. For further |
15 | ** information use the contact form at https://www.qt.io/contact-us. |
16 | ** |
17 | ** BSD License Usage |
18 | ** Alternatively, you may use this file under the terms of the BSD license |
19 | ** as follows: |
20 | ** |
21 | ** "Redistribution and use in source and binary forms, with or without |
22 | ** modification, are permitted provided that the following conditions are |
23 | ** met: |
24 | ** * Redistributions of source code must retain the above copyright |
25 | ** notice, this list of conditions and the following disclaimer. |
26 | ** * Redistributions in binary form must reproduce the above copyright |
27 | ** notice, this list of conditions and the following disclaimer in |
28 | ** the documentation and/or other materials provided with the |
29 | ** distribution. |
30 | ** * Neither the name of The Qt Company Ltd nor the names of its |
31 | ** contributors may be used to endorse or promote products derived |
32 | ** from this software without specific prior written permission. |
33 | ** |
34 | ** |
35 | ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
36 | ** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
37 | ** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
38 | ** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
39 | ** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
40 | ** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
41 | ** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
42 | ** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
43 | ** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
44 | ** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
45 | ** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE." |
46 | ** |
47 | ** $QT_END_LICENSE$ |
48 | ** |
49 | ****************************************************************************/ |
50 | |
51 | #include "textprogressbar.h" |
52 | |
53 | #include <QByteArray> |
54 | |
55 | #include <cstdio> |
56 | |
57 | using namespace std; |
58 | |
59 | void TextProgressBar::clear() |
60 | { |
61 | printf("\n" ); |
62 | fflush(stdout); |
63 | |
64 | value = 0; |
65 | maximum = -1; |
66 | iteration = 0; |
67 | } |
68 | |
69 | void TextProgressBar::update() |
70 | { |
71 | ++iteration; |
72 | |
73 | if (maximum > 0) { |
74 | // we know the maximum |
75 | // draw a progress bar |
76 | int percent = value * 100 / maximum; |
77 | int hashes = percent / 2; |
78 | |
79 | QByteArray progressbar(hashes, '#'); |
80 | if (percent % 2) |
81 | progressbar += '>'; |
82 | |
83 | printf("\r[%-50s] %3d%% %s " , |
84 | progressbar.constData(), |
85 | percent, |
86 | qPrintable(message)); |
87 | } else { |
88 | // we don't know the maximum, so we can't draw a progress bar |
89 | int center = (iteration % 48) + 1; // 50 spaces, minus 2 |
90 | QByteArray before(qMax(center - 2, 0), ' '); |
91 | QByteArray after(qMin(center + 2, 50), ' '); |
92 | |
93 | printf("\r[%s###%s] %s " , |
94 | before.constData(), after.constData(), qPrintable(message)); |
95 | } |
96 | } |
97 | |
98 | void TextProgressBar::setMessage(const QString &m) |
99 | { |
100 | message = m; |
101 | } |
102 | |
103 | void TextProgressBar::setStatus(qint64 val, qint64 max) |
104 | { |
105 | value = val; |
106 | maximum = max; |
107 | } |
108 | |