1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
/*
Ray
Copyright (C) 2010, 2011, 2012 Sébastien Boisvert
http://DeNovoAssembler.SourceForge.Net/
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, version 3 of the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You have received a copy of the GNU General Public License
along with this program (gpl-3.0.txt).
see <http://www.gnu.org/licenses/>
*/
#include "NeighbourPair.h"
#include <code/Mock/constants.h>
NeighbourPair::NeighbourPair(PathHandle contig1,Strand strand1,int progression1,PathHandle contig2,Strand strand2,int progression2,
int depth){
m_contigName1=contig1;
m_strand1=strand1;
m_progression1=progression1;
m_contigName2=contig2;
m_strand2=strand2;
m_progression2=progression2;
m_depth=depth;
}
Strand NeighbourPair::getStrand1(){
return m_strand1;
}
PathHandle NeighbourPair::getContig1(){
return m_contigName1;
}
int NeighbourPair::getProgression1(){
return m_progression1;
}
Strand NeighbourPair::getStrand2(){
return m_strand2;
}
PathHandle NeighbourPair::getContig2(){
return m_contigName2;
}
int NeighbourPair::getProgression2(){
return m_progression2;
}
int NeighbourPair::getDepth(){
return m_depth;
}
|
