forked from mahulchak/quickmerge
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathAlignment.cpp
More file actions
257 lines (205 loc) · 6.6 KB
/
Alignment.cpp
File metadata and controls
257 lines (205 loc) · 6.6 KB
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
using namespace std;
class Alignment_Data{
public:
string label; //the row data, uesd as key
//ex: 2620178 2620733 6424 6980 6 6 0
string refid;
long Rstart;
long Rend;
long Qstart;
long Qend;
int Error;
int SimError; //similar error
int negNum; //negative number ( Deletion )
double pid;
// Constructor
Alignment_Data(string label, long Rstart, long Rend, long Qstart, long Qend, int Error ,int SimError ,int negNum){
this->label = label;
this->Rstart = Rstart;
this->Rend = Rend;
this->Qstart = Qstart;
this->Qend = Qend;
this->Error = Error;
this->SimError = SimError;
this->negNum = negNum;
}
void set_pid (double pid){
this->pid = pid;
}
double get_pid(){
return pid;
}
long get_left_most_position(){
if(Rend > Rstart){
return Rstart;
}else{
return Rend;
}
}
long get_right_most_position(){
if(Rend < Rstart){
return Rstart;
}else{
return Rend;
}
}
long get_rstart(){
return Rstart;
}
long get_rend(){
return Rend;
}
long get_qstart(){
return Qstart;
}
long get_qend(){
return Qend;
}
};
class Header{
public:
string header; // rname + qname , used as key
// ex:>000003F|arrow scf7180000001372|quiver
string rname; // ex:>000003F|arrow
string qname; // ex:scf7180000001372|quiver
long rlen;
long qlen;
unordered_map< string , Alignment_Data* > dataMap; //map sotres key and ptr pair.
//constructor
Header(string header, long rlen, long qlen){
this->header = header;
this->rlen = rlen;
this->qlen = qlen;
}
// adding data by information Rstart Rend .......
void add_alignment( string label, long Rstart, long Rend, long Qstart, long Qend, int Error ,int SimError ,int negNum){
Alignment_Data *ad = new Alignment_Data(label, Rstart, Rend, Qstart, Qend, Error ,SimError ,negNum);
dataMap.insert( make_pair( label, ad ) );
}
// adding data by object
void add_aglinment( string label, Alignment_Data* ad){
dataMap.insert( make_pair( label, ad ) );
}
//serach data by label, return ptr of object
Alignment_Data* get_alignment(string label){
unordered_map< string , Alignment_Data* >::iterator iter = dataMap.find(label);
if(iter != dataMap.end()){
return iter->second;
}
else{
cout<<"Do not Find alignment data: "<<label<<endl;
}
}
//remove data from map
void remove_alignment( string label ){
unordered_map< string , Alignment_Data* >::iterator iter = dataMap.find(label);
if (iter != dataMap.end()){
delete iter->second; //remove object
dataMap.erase(iter); //remove key in map
}
else{
cout<<"Do not Find header:"<< label<<endl;
}
}
string get_ref_name(){
return rname;
}
string get_query_name(){
return qname;
}
long get_rlen(){
return rlen;
}
long get_qlen(){
return qlen;
}
};
class Alignment {
public:
string source;
string datatype;
unordered_map< string , Header* > headerMap;
Alignment(string source, string datatype){
this->source = source;
this->datatype = datatype;
}
/*
void add_header( string header, long rlen, long qlen ){
Header head( header, rlen, qlen);
headerMap.insert( make_pair( header , head ) );
}
*/
void add_header( string header, Header* h ){
headerMap.insert( make_pair( header , h ) );
//headerMap[header] = h; //need empty constructor at begin : Header(){}
}
Header* get_header( string header){
unordered_map< string , Header* >::iterator iter = headerMap.find(header);
if(iter != headerMap.end()){
return iter->second;
}
else{
cout<<"Do not Find header: "<<header<<endl;
}
}
void remove_header( string header ){
unordered_map< string , Header* >::iterator iter = headerMap.find(header); //iterator
if (iter != headerMap.end()){
delete iter->second;
headerMap.erase(iter);
}
else{
cout<<"Do not Find header:"<< header<<endl;
}
}
};
// test Alignment.cpp
/*
int main(){
// test Alignment_data
Alignment_Data ad1("1 2 3 4 5 6 0",1,2,3,4,5,6,7);
cout<<"test Alignment data:" << endl<<endl;
cout<<" label: " <<ad1.label<<endl;
cout<<" Rstart:" <<ad1.Rstart<<endl;
cout<<" get R: " <<ad1.get_rstart()<<endl;
cout<<" Rend: " <<ad1.Rend<<endl;
cout<<" Qstart:" <<ad1.Qstart<<endl;
cout<<" Qend: " <<ad1.Qend<<endl;
cout<<" error: " <<ad1.Error<<endl;
cout<<" negative numbers:"<<ad1.negNum<<endl<<endl<<endl;
Alignment_Data ad2("11 22 33 44 55 66 00",11,22,33,44,55,66,77);
// test Header
Header h( ">000003F|arrow scf7180000001372|quiver" , 9085994 , 21655);
cout<<"test Header:" << endl<<endl;
h.add_alignment("1 2 3 4 5 6 0",1,2,3,4,5,6,7);
h.add_alignment("11 22 33 44 55 66 00",11,22,33,44,55,66,77);
cout<< " get info from map:" <<h.get_alignment("1 2 3 4 5 6 0")->Rend<<endl;
cout<< " get info from map:" <<h.get_alignment("11 22 33 44 55 66 00")->Qstart<<endl;
cout<<endl<<endl;
// test Alignment
Alignment a( "/data/users/yuanhunl/Lab/self_oneline.fa /data/users/yuanhunl/Lab/hybrid_oneline.fa" ,
"NUCMER" );
cout<< " test Alignment: "<<endl<<endl;
cout<< " data source: "<<a.source<<endl;
cout<< " data type: " <<a.datatype<<endl<<endl;
Header *h1 = new Header( ">000010F|arrow scf7180000001375|quiver" , 2187667 , 18219 );
Alignment_Data *a1 = new Alignment_Data("8373859 8395578 21655 1 72 72 0" , 8373859, 8395578, 21655, 1, 72, 72, 15);
h1->add_aglinment("8373859 8395578 21655 1 72 72 0", a1);
a.add_header(">000010F|arrow scf7180000001375|quiver" , h1);
a.get_header(">000010F|arrow scf7180000001375|quiver")->add_alignment("8373859 8395578 21655 1 72 72 0" , 8373859, 8395578, 21655, 1, 72, 72, 15);
cout<<a.get_header(">000010F|arrow scf7180000001375|quiver")->get_alignment("8373859 8395578 21655 1 72 72 0")->Rstart<<endl;
h1 = new Header( ">000010F|arrow scf7180000001375|quiver" , 2187667 , 18219 );
a1 = new Alignment_Data("8373859 8395578 21655 1 72 72 0" , 8373859, 8395578, 21655, 1, 72, 72, 15);
h1->add_aglinment("8373859 8395578 21655 1 72 72 0", a1);
a.add_header(">000010F|arrow scf7180000001375|quiver" , h1);
a.get_header(">000010F|arrow scf7180000001375|quiver")->add_alignment("8373859 8395578 21655 1 72 72 0" , 8373859, 8395578, 21655, 1, 72, 72, 15);
cout<<a.get_header(">000010F|arrow scf7180000001375|quiver")->get_alignment("8373859 8395578 21655 1 72 72 0")->Rstart<<endl;
system("pause");
return 0;
}
*/