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 #include "GeneOrder.h"
27 * Implements the GeneOrder class
29 * \author Michael Andreen
34 GeneOrder::GeneOrder(const GeneOrder& go){
35 _geneorder = go._geneorder;
39 GeneOrder::~GeneOrder(){
42 const GeneOrder& GeneOrder::operator=(const GeneOrder& go){
43 _geneorder = go._geneorder;
48 * Check so i is in the valid range, then return the gene.
50 const Gene& GeneOrder::operator[](size_type i) const{
51 if (i < 0 || i >= _geneorder.size())
52 throw out_of_range("Index is not in valid range");
56 int GeneOrder::size() const{
57 return _geneorder.size();
60 const GeneOrder::GeneList& GeneOrder::list() const{