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 #include "genealgorithms.h"
  26
  27 #include <algorithm>
  28
  29 /**
  30  * Reverses an interval
  31  *
  32  * \author Michael Andreen
  33  */
  34 class ReverseAction : public SortAction{
  35         public:
  36
  37                 /**
  38                  * Creates a new reverse action for the interval [i,j]
  39                  */
  40                 ReverseAction(size_t i, size_t j): SortAction(0),_i(i),_j(j){
  41                 }
  42                 ReverseAction(Interval i): SortAction(0){
  43                         _i = std::min(i.first,i.second);
  44                         _j = std::max(i.first,i.second)-1;
  45                 }
  46
  47                 /**
  48                  * Applies the sort action on the gene order
  49                  */
  50                 virtual GeneOrder& operator()(GeneOrder& go) const{
  51                         go.reverse(_i,_j);
  52                         return go;
  53                 }
  54
  55                 virtual bool operator==(const SortAction& sa) const{
  56                         if (const ReverseAction* psa = dynamic_cast<const ReverseAction*>(&sa)){
  57                                 if (_i == psa->_i && _j == psa->_j)
  58                                         return true;
  59                         }
  60                         return false;
  61                 }
  62         private:
  63                 size_t _i;
  64                 size_t _j;
  65 };
  66
  67 #endif
  68