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
|
/******************************************************************************
*
* Copyright (C) 2002 Hugo PEREIRA <mailto: hugo.pereira@free.fr>
*
* This 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 software 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, see <http://www.gnu.org/licenses/>.
*
*******************************************************************************/
#include "PathHistory.h"
#include "Debug.h"
//__________________________________________________________________
PathHistory::PathHistory( QObject* parent ):
QObject( parent ),
Counter( "PathHistory" )
{}
//__________________________________________________________________
FileRecord::List PathHistory::previousPathList() const
{
FileRecord::List out;
for( int index = 0; index < index_; ++index )
{ out.append( pathList_[index] ); }
return out;
}
//__________________________________________________________________
FileRecord::List PathHistory::nextPathList() const
{
FileRecord::List out;
for( int index = index_+1; index < pathList_.size(); ++index )
{ out.append( pathList_[index] ); }
return out;
}
//__________________________________________________________________
void PathHistory::setPathList( const FileRecord::List& pathList )
{
Debug::Throw( "PathHistory::setPathList.\n" );
pathList_ = pathList;
index_ = pathList.size()-1;
emit contentsChanged();
}
//__________________________________________________________________
void PathHistory::add( const FileRecord& path )
{
Debug::Throw() << "PathHistory::add - " << path << endl;
// make sure path is valid
if( path.file().isEmpty() ) return;
// make sure path is different from current
if( !pathList_.empty() && pathList_[index_].file() == path.file() )
{
pathList_[index_] = path;
return;
}
// remove everything that is after index_ from pathList_
while( pathList_.size() > index_+1 ) pathList_.removeLast();
// insert new path
pathList_.append( path );
index_ = pathList_.size()-1;
emit contentsChanged();
return;
}
//__________________________________________
void PathHistory::clear()
{
Debug::Throw( "PathHistory::clear.\n" );
pathList_.clear();
index_ = 0;
emit contentsChanged();
}
//__________________________________________________________________
File PathHistory::selectPath( int index )
{
Debug::Throw( "PathHistory::selectPath.\n" );
index_ = qMin( index, pathList_.size()-1 );
return pathList_[index_].file();
}
//_______________________________________________
void PathHistory::_setMaxSize( int value )
{
Debug::Throw( "PathHistory::_setMaxSize.\n" );
maxSize_ = value;
return;
}
//___________________________________________________________________
FileRecord::List PathHistory::_truncatedList( FileRecord::List records ) const
{
if( maxSize_ > 0 )
{
while( records.size() > maxSize_ )
{ records.removeFirst(); }
}
return records;
}
|
