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 ***************************************************************************/
26 #include "geneorder.h"
30 * Implements the GeneOrder class
32 * \author Michael Andreen
36 GeneOrder::GeneOrder(const GeneOrder& go){
37 _geneorder = go._geneorder;
40 void GeneOrder::pad(){
41 if (_geneorder[0] != 0)
42 _geneorder.insert(_geneorder.begin(),0);
43 if(_geneorder.back() != static_cast<Gene>(_geneorder.size() - 1))
44 _geneorder.push_back(_geneorder.size());
48 Gene operator()(Gene x) const{
53 void GeneOrder::verify(){
54 if(_geneorder[0] != 0)
55 throw invalid_argument("Permutation doesn't start with 0");
56 if ( _geneorder.back() != static_cast<Gene>(_geneorder.size() - 1))
57 throw invalid_argument("Permutation doesn't end with n+1");
59 GeneList genes(_geneorder);
60 transform(genes.begin(),genes.end(),genes.begin(),Abs());
61 sort(genes.begin(),genes.end());
62 if (unique(genes.begin(),genes.end()) != genes.end())
63 throw std::invalid_argument("Not all genes are present exactly 1 time");
67 GeneOrder::~GeneOrder(){
70 const GeneOrder& GeneOrder::operator=(const GeneOrder& go){
71 _geneorder = go._geneorder;
76 * Check so i is in the valid range, then return the gene.
78 const Gene& GeneOrder::operator[](size_type i) const{
79 if (i < 0 || i >= _geneorder.size())
80 throw out_of_range("Indexis not in valid range");
84 GeneOrder::size_type GeneOrder::size() const{
85 return _geneorder.size();
88 const GeneOrder::GeneList& GeneOrder::list() const{
93 GeneOrder::iterator GeneOrder::begin() const{
94 return _geneorder.begin();
97 GeneOrder::iterator GeneOrder::end() const{
98 return _geneorder.end();
102 Gene operator()(Gene x) const{
107 void GeneOrder::reverse(size_type i, size_type j){
109 throw out_of_range("i can't be bigger than j");
111 throw out_of_range("Index i is not in valid range");
112 if (j >= _geneorder.size())
113 throw out_of_range("Index j is not in valid range");
114 GeneList::iterator begin = _geneorder.begin()+i;
115 GeneList::iterator end = _geneorder.begin()+j+1;
117 transform(begin,end,begin,Sign());
118 std::reverse(begin,end);