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 #include "geneorder.h"
  27
  28 #include <algorithm>
  29 #include <sstream>
  30
  31 /**
  32  * Reverses an interval
  33  *
  34  * \author Michael Andreen
  35  */
  36 class ReverseAction : public SortActionImpl{
  37         public:
  38
  39                 /**
  40                  * Creates a new reverse action for the interval [i,j]
  41                  */
  42                 ReverseAction(size_t i, size_t j): _i(i),_j(j){
  43                 }
  44
  45                 ReverseAction(Interval i){
  46                         _i = std::min(i.first,i.second);
  47                         _j = std::max(i.first,i.second)-1;
  48                 }
  49
  50                 /**
  51                  * Applies the sort action on the gene order
  52                  */
  53                 virtual GeneOrder& operator()(GeneOrder& go) const{
  54                         go.reverse(_i,_j);
  55                         return go;
  56                 }
  57
  58                 virtual bool operator==(const SortActionImpl& sa) const{
  59                         if (const ReverseAction* psa = dynamic_cast<const ReverseAction*>(&sa)){
  60                                 if (_i == psa->_i && _j == psa->_j)
  61                                         return true;
  62                         }
  63                         return false;
  64                 }
  65
  66                 /**
  67                  * Gives a string representation of the action, for output
  68                  */
  69                 virtual std::string toString() const{
  70                         std::ostringstream os;
  71                         os << "[" << _i << "," << _j << "]";
  72                         return os.str();
  73                 }
  74
  75                 size_t i() const{
  76                         return _i;
  77                 }
  78                 size_t j() const{
  79                         return _j;
  80                 }
  81
  82
  83         private:
  84                 size_t _i;
  85                 size_t _j;
  86 };
  87
  88 #endif
  89