src/reverseaction.h

   1 /***************************************************************************
   2  *   Copyright (C) 2006 by Michael Andreen                                 *
   3  *   andreen@student.chalmers.se                                           *
   4  *                                                                         *
   5  *   This program is free software; you can redistribute it and/or modify  *
   6  *   it under the terms of the GNU General Public License as published by  *
   7  *   the Free Software Foundation; either version 2 of the License, or     *
   8  *   (at your option) any later version.                                   *
   9  *                                                                         *
  10  *   This program is distributed in the hope that it will be useful,       *
  11  *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
  12  *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
  13  *   GNU General Public License for more details.                          *
  14  *                                                                         *
  15  *   You should have received a copy of the GNU General Public License     *
  16  *   along with this program; if not, write to the                         *
  17  *   Free Software Foundation, Inc.,                                       *
  18  *   51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA          *
  19  ***************************************************************************/
  20
  21 #ifndef __REVERSEACTION_H__
  22 #define __REVERSEACTION_H__
  23
  24 #include "sortaction.h"
  25 /**
  26  * Reverses an interval
  27  *
  28  * \author Michael Andreen
  29  */
  30 class ReverseAction : public SortAction{
  31         public:
  32
  33                 /**
  34                  * Creates a new reverse action for the interval [i,j]
  35                  */
  36                 ReverseAction(size_t i, size_t j):_i(i),_j(j){}
  37
  38                 /**
  39                  * Sort SortActions by score
  40                  */
  41                 virtual GeneOrder& operator()(GeneOrder& go) const{
  42                         go.reverse(_i,_j);
  43                         return go;
  44                 }
  45
  46                 virtual bool operator==(const SortAction& sa) const{
  47                         if (const ReverseAction* psa = dynamic_cast<const ReverseAction*>(&sa)){
  48                                 if (_i == psa->_i && _j == psa->_j)
  49                                         return true;
  50                         }
  51                         return false;
  52                 }
  53         private:
  54                 size_t _i;
  55                 size_t _j;
  56 };
  57
  58 #endif
  59