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 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379
|
#ifndef ListModel_h
#define ListModel_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 "ItemModel.h"
#include <QList>
#include <algorithm>
//* Job model. Stores job information for display in lists
template<typename T, typename EqualTo = std::equal_to<T>, typename LessThan = std::less<T> >
class ListModel : public ItemModel
{
public:
//* value type
using ValueType = T;
//* reference
using Reference = T&;
//* pointer
using Pointer = T*;
//* value list
using List = QList<ValueType>;
using ListIterator = QListIterator<ValueType>;
using MutableListIterator = QMutableListIterator<ValueType>;
//* constructor
explicit ListModel(QObject* parent = nullptr ):
ItemModel( parent )
{}
//*@name accessors
//@{
//* flags
Qt::ItemFlags flags(const QModelIndex &index) const override
{
if (!index.isValid()) Qt::ItemFlags();
return Qt::ItemIsEnabled | Qt::ItemIsSelectable;
}
//* unique index for given row, column and parent index
QModelIndex index(int row, int column, const QModelIndex &parent = QModelIndex()) const override
{
// check if index is valid
if( !hasIndex( row, column, parent ) ) return QModelIndex();
// return invalid index if parent is valid
if( parent.isValid() ) return QModelIndex();
// check against values_
return ( row < (int) values_.size() ) ? createIndex( row, column ):QModelIndex();
}
//* index of parent
QModelIndex parent(const QModelIndex &) const override
{ return QModelIndex(); }
//* number of rows below given index
int rowCount(const QModelIndex &parent = QModelIndex()) const override
{ return parent.isValid() ? 0:values_.size(); }
//* get list of internal selected items
QModelIndexList selectedIndexes() const override
{
QModelIndexList out;
for( const auto& value:selectedItems_ )
{
QModelIndex index( this->index( value ) );
if( index.isValid() ) out << index;
}
return out;
}
//* restore currentIndex
QModelIndex currentIndex() const override
{ return hasCurrentItem_ ? this->index( currentItem_ ) : QModelIndex(); }
//* return all values
const List& get() const
{ return values_; }
//* return true if model contains given index
bool contains( const QModelIndex& index ) const
{ return index.isValid() && index.row() < values_.size(); }
//* return value for given index
ValueType get( const QModelIndex& index ) const
{ return (index.isValid() && index.row() < values_.size() ) ? values_[index.row()]:ValueType(); }
//* return all values
List get( const QModelIndexList& indexes ) const
{
List out;
for( const auto& index:indexes )
{ if( index.isValid() && index.row() < values_.size() ) out << get( index ); }
return out;
}
//* return index associated to a given value
QModelIndex index( const ValueType& value, int column = 0 ) const
{
for( int row=0; row<values_.size(); ++row )
{ if( EqualTo()(value, values_[row]) ) return index( row, column ); }
return QModelIndex();
}
//@}
//*@name modifiers
//@{
//* clear internal list selected items
void clearSelectedIndexes() override
{ selectedItems_.clear(); }
//* set selected indexes
void setSelectedIndexes( const QModelIndexList& indexes ) override
{
selectedItems_.clear();
for( const auto& index:indexes )
{ if( contains( index ) ) selectedItems_ << values_[index.row()]; }
}
//* store index internal selection state
void setIndexSelected( const QModelIndex& index, bool value ) override
{
if( !contains( index ) ) return;
if( value ) selectedItems_ << values_[index.row()];
else selectedItems_.erase( std::remove_if( selectedItems_.begin(), selectedItems_.end(), std::bind2nd( EqualTo(), values_[index.row()] ) ), selectedItems_.end() );
}
//* current index;
void clearCurrentIndex() override
{ hasCurrentItem_ = false; }
//* store current index
void setCurrentIndex( const QModelIndex& index ) override
{
if( contains( index ) )
{
hasCurrentItem_ = true;
currentItem_ = values_[index.row()];
} else hasCurrentItem_ = false;
}
//* add value
void add( const ValueType& value )
{
emit layoutAboutToBeChanged();
_add( value );
_sort();
emit layoutChanged();
}
//* add values
void add( const List& values )
{
// check if not empty
// this avoids sending useless signals
if( values.empty() ) return;
emit layoutAboutToBeChanged();
for( const auto& value:values ) _add( value );
_sort();
emit layoutChanged();
}
//* insert values
void insert( const QModelIndex& index, const ValueType& value )
{
emit layoutAboutToBeChanged();
_insert( index, value );
emit layoutChanged();
}
//* insert values
void insert( const QModelIndex& index, const List& values )
{
emit layoutAboutToBeChanged();
// need to loop in reverse order so that the "values" ordering is preserved
ListIterator iter( values );
iter.toBack();
while( iter.hasPrevious() )
{ _insert( index, iter.previous() ); }
emit layoutChanged();
}
//* insert values
void replace( const QModelIndex& index, const ValueType& value )
{
if( !contains( index ) ) add( value );
else {
emit layoutAboutToBeChanged();
const ValueType& oldValue( values_[index.row()] );
if( selectedItems_.contains( oldValue ) )
{
selectedItems_.erase( std::remove_if( selectedItems_.begin(), selectedItems_.end(), std::bind2nd( EqualTo(), oldValue ) ), selectedItems_.end() );
values_[index.row()] = value;
selectedItems_ << value;
} else {
values_[index.row()] = value;
}
emit layoutChanged();
}
}
//* remove
void remove( const ValueType& value )
{
emit layoutAboutToBeChanged();
_remove( value );
emit layoutChanged();
return;
}
//* remove
void remove( const List& values )
{
// check if not empty
// this avoids sending useless signals
if( values.empty() ) return;
emit layoutAboutToBeChanged();
for( const auto& value:values ) _remove( value );
emit layoutChanged();
return;
}
//* clear
void clear()
{ set( List() ); }
//* update values from list
/**
values that are not found in current are removed
new values are set to the end.
This is slower than the "set" method, but the selection is not cleared in the process
*/
void update( List values )
{
emit layoutAboutToBeChanged();
// store values to be removed
List removedValues;
// update values that are common to both lists
for( auto&& iter = values_.begin(); iter != values_.end(); ++iter )
{
// see if iterator is in list
auto foundIter( std::find_if( values.begin(), values.end(), std::bind2nd( EqualTo(), *iter ) ) );
if( foundIter == values.end() ) removedValues << *iter;
else {
*iter = *foundIter;
values.erase( foundIter );
}
}
// remove values that have not been found in new list
for( const auto& value:removedValues ) _remove( value );
// add remaining values
for( const auto& value:values ) _add( value );
_sort();
emit layoutChanged();
}
//* set all values
void set( const List& values )
{
emit layoutAboutToBeChanged();
values_ = values;
_sort();
emit layoutChanged();
return;
}
//@}
protected:
//* return all values
List& _get()
{ return values_; }
//* add, without update
virtual void _add( const ValueType& value )
{
auto iter = std::find_if( values_.begin(), values_.end(), std::bind2nd( EqualTo(), value ) );
if( iter == values_.end() ) values_ << value;
else *iter = value;
}
//* add, without update
virtual void _insert( const QModelIndex& index, const ValueType& value )
{
if( !index.isValid() ) add( value );
int row = 0;
auto iter( values_.begin() );
for( ;iter != values_.end() && row != index.row(); ++iter, ++row ){}
values_.insert( iter, value );
}
//* remove, without update
virtual void _remove( const ValueType& value )
{
values_.erase( std::remove_if( values_.begin(), values_.end(), std::bind2nd( EqualTo(), value )), values_.end() );
selectedItems_.erase( std::remove_if( selectedItems_.begin(), selectedItems_.end(), std::bind2nd( EqualTo(), value ) ), selectedItems_.end() );
}
private:
//* values
List values_;
//* selection
List selectedItems_;
//* true if current item is valid
bool hasCurrentItem_ = false;
//* current item
ValueType currentItem_;
};
#endif
|