1 /***************************************************************************
2 * Copyright (C) 2006 by Michael Andreen *
3 * andreen@student.chalmers.se *
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. *
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. *
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 ***************************************************************************/
21 #ifndef __REVERSEACTION_H__
22 #define __REVERSEACTION_H__
24 #include "sortaction.h"
25 #include "genealgorithms.h"
31 * Reverses an interval
33 * \author Michael Andreen
35 class ReverseAction : public SortAction{
39 * Creates a new reverse action for the interval [i,j]
41 ReverseAction(size_t i, size_t j): SortAction(0),_i(i),_j(j){
43 ReverseAction(Interval i): SortAction(0){
44 _i = std::min(i.first,i.second);
45 _j = std::max(i.first,i.second)-1;
49 * Applies the sort action on the gene order
51 virtual GeneOrder& operator()(GeneOrder& go) const{
56 virtual bool operator==(const SortAction& sa) const{
57 if (const ReverseAction* psa = dynamic_cast<const ReverseAction*>(&sa)){
58 if (_i == psa->_i && _j == psa->_j)
65 * Gives a string representation of the action, for output
67 virtual std::string toString() const{
68 std::ostringstream os;
69 os << "[" << _i << "," << _j << "]";