kmail/undostack.cpp

   1 /*
   2     This file is part of KMail
   3
   4     Copyright (C) 1999 Waldo Bastian (bastian@kde.org)
   5     Copyright (c) 2003 Zack Rusin <zack@kde.org>
   6
   7     This library is free software; you can redistribute it and/or
   8     modify it under the terms of the GNU General Public License
   9     version 2 as published by the Free Software Foundation.
  10
  11     This software is distributed in the hope that it will be useful,
  12     but WITHOUT ANY WARRANTY; without even the implied warranty of
  13     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14     General Public License for more details.
  15
  16     You should have received a copy of the GNU General Public License
  17     along with this library; see the file COPYING. If not, write to
  18     the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  19     Boston, MA 02110-1301, USA.
  20 */
  21
  22 #include "undostack.h"
  23
  24 #include "kmmainwin.h"
  25 #include "kmkernel.h"
  26 #include <KJob>
  27 #include <akonadi/itemmovejob.h>
  28
  29 #include <kmessagebox.h>
  30 #include <klocale.h>
  31 #include <kdebug.h>
  32
  33 #include <QList>
  34
  35 namespace KMail {
  36
  37 UndoStack::UndoStack(int size)
  38   : QObject(0), mSize(size), mLastId(0),
  39     mCachedInfo(0)
  40 {
  41   setObjectName( "undostack" );
  42 }
  43
  44 UndoStack::~UndoStack()
  45 {
  46   qDeleteAll( mStack );
  47 }
  48
  49 void UndoStack::clear()
  50 {
  51   qDeleteAll( mStack );
  52   mStack.clear();
  53 }
  54
  55 int UndoStack::newUndoAction( const Akonadi::Collection &srcFolder, const Akonadi::Collection &destFolder )
  56 {
  57   UndoInfo *info = new UndoInfo;
  58   info->id         = ++mLastId;
  59   info->srcFolder  = srcFolder;
  60   info->destFolder = destFolder;
  61   if ((int) mStack.count() == mSize) {
  62     delete mStack.last();
  63     mStack.removeLast();
  64   }
  65   mStack.prepend( info );
  66   emit undoStackChanged();
  67   return info->id;
  68 }
  69
  70 void UndoStack::addMsgToAction( int undoId, const Akonadi::Item &item )
  71 {
  72   if ( !mCachedInfo || mCachedInfo->id != undoId ) {
  73     QList<UndoInfo*>::const_iterator itr = mStack.constBegin();
  74     while ( itr != mStack.constEnd() ) {
  75       if ( (*itr)->id == undoId ) {
  76         mCachedInfo = (*itr);
  77         break;
  78       }
  79       ++itr;
  80     }
  81   }
  82
  83   Q_ASSERT( mCachedInfo );
  84   mCachedInfo->items.append( item );
  85 }
  86
  87 void UndoStack::undo()
  88 {
  89   if ( mStack.count() > 0 )
  90   {
  91     UndoInfo *info = mStack.takeFirst();
  92     emit undoStackChanged();
  93     Akonadi::ItemMoveJob * job = new Akonadi::ItemMoveJob( info->items, info->srcFolder, this );
  94     connect( job, SIGNAL(result(KJob*)), this, SLOT(slotMoveResult(KJob*)) );
  95     delete info;
  96   }
  97   else
  98   {
  99     // Sorry.. stack is empty..
 100     KMessageBox::sorry( kmkernel->mainWin(), i18n("There is nothing to undo."));
 101   }
 102 }
 103
 104 void UndoStack::slotMoveResult( KJob *job )
 105 {
 106   if ( job->error() )
 107     KMessageBox::sorry( kmkernel->mainWin(), i18n("Can not move message. %1", job->errorString() ) );
 108 }
 109
 110 void
 111 UndoStack::pushSingleAction(const Akonadi::Item &item, const Akonadi::Collection &folder, const Akonadi::Collection &destFolder)
 112 {
 113   int id = newUndoAction( folder, destFolder );
 114   addMsgToAction( id, item );
 115 }
 116
 117 void
 118 UndoStack::msgDestroyed( const Akonadi::Item & /*msg*/)
 119 {
 120   /*
 121    for(UndoInfo *info = mStack.first(); info; )
 122    {
 123       if (info->msgIdMD5 == msg->msgIdMD5())
 124       {
 125          mStack.removeRef( info );
 126          info = mStack.current();
 127       }
 128       else
 129          info = mStack.next();
 130    }
 131   */
 132 }
 133
 134 void
 135 UndoStack::folderDestroyed( const Akonadi::Collection &folder)
 136 {
 137   QList<UndoInfo*>::iterator it = mStack.begin();
 138   while ( it != mStack.end() ) {
 139     UndoInfo *info = *it;
 140     if ( info &&
 141           ( (info->srcFolder == folder) ||
 142             (info->destFolder == folder) ) ) {
 143       delete info;
 144       it = mStack.erase( it );
 145     }
 146     else
 147       it++;
 148   }
 149   emit undoStackChanged();
 150 }
 151
 152 }
 153
 154 #include "undostack.moc"