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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
#ifndef OptionModel_h
#define OptionModel_h
/******************************************************************************
*
* 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 "Counter.h"
#include "Debug.h"
#include "Options.h"
#include "TreeModel.h"
#include <array>
using OptionPair = Options::Pair;
//___________________________________________________________________
inline bool operator == ( const OptionPair& first, const OptionPair& second )
{ return first.first == second.first && first.second.raw() == second.second.raw(); }
//___________________________________________________________________
namespace Base
{
//* isChild operator, needed for TreeModel
template<> bool isChild<OptionPair>( const OptionPair&, const OptionPair& );
}
//___________________________________________________________________
class OptionModel: public TreeModel<OptionPair>, private Base::Counter<OptionModel>
{
Q_OBJECT
public:
//* column type enumeration
enum ColumnType
{
Name,
Current,
Value,
DefaultValue,
Flags,
nColumns
};
//* constructor
explicit OptionModel( QObject* parent = nullptr ):
TreeModel<OptionPair>( parent ),
Counter( "OptionModel" )
{}
//* set model read only
void setReadOnly( bool value )
{ readOnly_ = value; }
//* is read only
bool isReadOnly() const
{ return readOnly_; }
//*@name methods reimplemented from base class
//@{
//* flags
Qt::ItemFlags flags( const QModelIndex& ) const override;
// return data for a given index
QVariant data( const QModelIndex&, int ) const override;
// modify data
bool setData( const QModelIndex&, const QVariant&, int = Qt::EditRole ) override;
//* header data
QVariant headerData( int, Qt::Orientation, int role = Qt::DisplayRole ) const override;
//* number of columns for a given index
int columnCount( const QModelIndex& = QModelIndex() ) const override
{ return nColumns; }
//@}
Q_SIGNALS:
//* emitted when one special option is modified
void specialOptionModified( OptionPair );
//* emitted when one option is modified
void optionModified( OptionPair );
protected:
//* sorting
void _sort( int column, Qt::SortOrder order ) override
{ _root().sort( SortFTor( column, order ) ); }
private:
//* used to sort IconCaches
class SortFTor: public ItemModel::SortFTor
{
public:
//* constructor
explicit SortFTor( int type, Qt::SortOrder order ):
ItemModel::SortFTor( type, order )
{}
//* prediction
bool operator() ( const Item& first, const Item& second ) const
{ return (*this)( first.get(), second.get() ); }
//* prediction
bool operator() ( OptionPair, OptionPair ) const;
};
//* true if read only
bool readOnly_ = true;
//* column titles
const std::array<QString, nColumns> columnTitles_ =
{{
tr( "Name" ),
"",
tr( "Current Value" ),
tr( "Default Value" ),
tr( "Flags" )
}};
};
#endif
|
