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
|
// KDat - a tar-based DAT archiver
// Copyright (C) 1998-2000 Sean Vyain, svyain@mail.tds.net
// Copyright (C) 2001-2002 Lawrence Widman, kdat@cardiothink.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
#include <tqstringlist.h>
#include <tdeglobal.h>
#include <tdelocale.h>
#include "Util.h"
TQString Util::bytesToString( uint bytes )
{
return TDEGlobal::locale()->formatNumber(bytes, 0);
}
TQString Util::kbytesToString( uint kbytes )
{
return TDEGlobal::locale()->formatNumber(kbytes, 0) + 'k';
}
TQString Util::longestCommonPath( const TQStringList& files )
{
TQStringList filesTmp = files;
TQStringList::Iterator i = filesTmp.begin();
uint minLen = (*i).length();
for ( ; i != filesTmp.end(); ++i ) {
if ( minLen > (*i).length() ) {
minLen = (*i).length();
}
}
uint j;
for ( j = 0; j < minLen; j++ ) {
i = filesTmp.begin();
TQString first = *i;
for ( ; i != filesTmp.end(); ++i ) {
if ( first.left(j) != (*i).left(j) ) {
// Prefixes are NOT the same.
break;
}
}
if ( i != filesTmp.end() ) {
// The common prefix is 0 to j-1, inclusive.
break;
}
}
i = filesTmp.begin();
TQString prefix = *i;
int idx = prefix.findRev( '/', j );
if ( idx > -1 ) {
prefix = prefix.left( prefix.findRev( '/', j ) );
} else {
prefix = "";
}
return prefix;
}
|
