mirror of
https://bitbucket.org/smil3y/kde-playground.git
synced 2025-02-24 10:52:52 +00:00
105 lines
3.2 KiB
C++
105 lines
3.2 KiB
C++
![]() |
/*
|
||
|
Copyright (c) 2009 KDAB
|
||
|
Author: Frank Osterfeld <frank@kdab.net>
|
||
|
|
||
|
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.
|
||
|
|
||
|
As a special exception, permission is given to link this program
|
||
|
with any edition of Qt, and distribute the resulting executable,
|
||
|
without including the source code for Qt in the source distribution.
|
||
|
*/
|
||
|
|
||
|
#include "collectionselection.h"
|
||
|
#include "utils.h"
|
||
|
|
||
|
#include <QItemSelectionModel>
|
||
|
|
||
|
using namespace CalendarSupport;
|
||
|
|
||
|
class CollectionSelection::Private
|
||
|
{
|
||
|
public:
|
||
|
explicit Private( QItemSelectionModel *model_ ) : model( model_ )
|
||
|
{
|
||
|
}
|
||
|
|
||
|
QItemSelectionModel *model;
|
||
|
};
|
||
|
|
||
|
CollectionSelection::CollectionSelection( QItemSelectionModel *selectionModel, QObject *parent )
|
||
|
: QObject( parent ), d( new Private ( selectionModel ) )
|
||
|
{
|
||
|
connect( selectionModel, SIGNAL(selectionChanged(QItemSelection,QItemSelection)),
|
||
|
this, SLOT(slotSelectionChanged(QItemSelection,QItemSelection)) );
|
||
|
}
|
||
|
|
||
|
CollectionSelection::~CollectionSelection()
|
||
|
{
|
||
|
delete d;
|
||
|
}
|
||
|
|
||
|
QItemSelectionModel *CollectionSelection::model() const
|
||
|
{
|
||
|
return d->model;
|
||
|
}
|
||
|
|
||
|
bool CollectionSelection::hasSelection() const
|
||
|
{
|
||
|
return d->model->hasSelection();
|
||
|
}
|
||
|
|
||
|
bool CollectionSelection::contains( const Akonadi::Collection &c ) const
|
||
|
{
|
||
|
return selectedCollectionIds().contains( c.id() );
|
||
|
}
|
||
|
|
||
|
bool CollectionSelection::contains( const Akonadi::Collection::Id &id ) const
|
||
|
{
|
||
|
return selectedCollectionIds().contains( id );
|
||
|
}
|
||
|
|
||
|
Akonadi::Collection::List CollectionSelection::selectedCollections() const
|
||
|
{
|
||
|
Akonadi::Collection::List selected;
|
||
|
Q_FOREACH ( const QModelIndex &idx, d->model->selectedIndexes() ) {
|
||
|
selected.append( collectionFromIndex( idx ) );
|
||
|
}
|
||
|
return selected;
|
||
|
}
|
||
|
|
||
|
QList<Akonadi::Collection::Id> CollectionSelection::selectedCollectionIds() const
|
||
|
{
|
||
|
QList<Akonadi::Collection::Id> selected;
|
||
|
Q_FOREACH ( const QModelIndex &idx, d->model->selectedIndexes() ) {
|
||
|
selected.append( collectionIdFromIndex( idx ) );
|
||
|
}
|
||
|
return selected;
|
||
|
}
|
||
|
|
||
|
void CollectionSelection::slotSelectionChanged( const QItemSelection &selectedIndexes,
|
||
|
const QItemSelection &deselIndexes )
|
||
|
{
|
||
|
const Akonadi::Collection::List selected = collectionsFromIndexes( selectedIndexes.indexes() );
|
||
|
const Akonadi::Collection::List deselected = collectionsFromIndexes( deselIndexes.indexes() );
|
||
|
|
||
|
emit selectionChanged( selected, deselected );
|
||
|
Q_FOREACH ( const Akonadi::Collection &c, deselected ) {
|
||
|
emit collectionDeselected( c );
|
||
|
}
|
||
|
Q_FOREACH ( const Akonadi::Collection &c, selected ) {
|
||
|
emit collectionSelected( c );
|
||
|
}
|
||
|
}
|