Repository navigation
Expand file tree
/
Copy pathtree_admin.cpp
More file actions
347 lines (297 loc) · 10.1 KB
/
Copy pathtree_admin.cpp
File metadata and controls
347 lines (297 loc) · 10.1 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
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
/***************************************************************************************************
* This file is part of PolyMoSim.
*
* Copyright (c) 2004-2026, Christoph Mayer
* Contributors: see README.md
*
* Author: Dr. Christoph Mayer
* Affiliation: Leibniz Institute for the Analysis of Biodiversity Change (LIB), Bonn, Germany
*
* PolyMoSim is free software: you can redistribute it and/or modify it under the terms of
* the GNU General Public License version 3 as published by the Free Software Foundation.
*
* PolyMoSim 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 should have received a copy of the GNU General Public License along with PolyMoSim
* (see the file LICENSE). If not, see <https://www.gnu.org/licenses/>.
*
* SPDX-License-Identifier: GPL-3.0-only
*
* This project makes use of code coming from other projects. What follows is a complete
* list of files which make use of external code. Please refer to the copyright within
* these files.
*
* Files in tclap folder: Copyright (c) 2003 Michael E. Smoot, MIT license.
* See tclap/COPYING for details.
* discrete_gamma.cpp: Copyright 1993-2004 by Ziheng Yang (PAML), GNU GPL v3.
* See copyright in this file for details.
* CRandom.h, CRandom.cpp: Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
* BSD 3-clause license. See copyright in these files for details.
***************************************************************************************************/
#include "tree_admin.h" // error checking still inconsisten xxxxxxxxxxxxxxxxxxxxxxxx
#include <iterator>
#include <climits>
#include <cstdlib>
using namespace std;
void tree_admin::destroy(int i) { // error checking xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
treevector.erase(treevector.begin()+i);
}
void tree_admin::add(int i, double f, unsigned y, const faststring &m, const faststring &treestring) { // error checking xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
tree_struct* newtree;
newtree = new tree_struct(f, y, m, treestring);
treevector.insert(treevector.begin()+i,newtree);
}
void tree_admin::swap(unsigned i,unsigned y) {
if(i >= treevector.size() || y >= treevector.size()) {
throw indexerror();
}
tree_struct* temp;
temp = treevector[i];
treevector[i] = treevector[y];
treevector[y] = temp;
}
void tree_admin::create(const char* filename) {
CFile is;
if(!FileExists(filename)) {
faststring errormsg = faststring("File: ") + filename + " does not exist";
throw readerror(0, errormsg);
}
treevector.clear();
is.ffopen(filename);
tree_struct* temp;
vector<faststring> token;
faststring line;
unsigned number_of_tokens;
is.getline(line);
while(!is.fail()) {
line.shorten_to_first_occurrence_of('#');
line.removeSpacesFront();
if (line.empty())
{
// ignore_spaces(is);
is.getline(line);
continue;
}
line.removeSpacesBack();
temp = new tree_struct; // error checking xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
number_of_tokens = (unsigned)split_respect(token, line);
if (number_of_tokens != 4)
{
throw readerror(is.line(), "Bad tree record. Wrong number of Elements. "
"I expect on one line:\nscale-factor alignment-length default-model newick-tree");
}
temp->scalingfactor = atof(token[0].c_str()); //evtl. mit token[0].ToDouble
// atoi would turn e.g. -5 into about 4.3e9 sites when stored as unsigned.
unsigned long size = 0;
if (token[1].isAnUnsigned())
size = strtoul(token[1].c_str(), NULL, 10);
if (size == 0 || size > UINT_MAX)
{
throw readerror(is.line(), "Bad partition size: \"" + token[1] + "\". The alignment length must be a positive integer.");
}
temp->partitionSize = (unsigned)size;
temp->default_modelName = token[2];
temp->default_modelName.ToLower();
temp->treeString = token[3];
treevector.push_back(temp);
// ignore_spaces(is);
is.getline(line);
// cout << "String read: \'" << line << '\''<< endl;
// cout << "Status: " << (int)is.status() << endl;
}
}
void tree_admin::print(ostream& os, unsigned flag, const char * pretext) {
if (flag == 0) // Print in the PolyMoSim tree file format
{
for(unsigned i = 0; i < treevector.size(); i++) {
os << pretext
<< treevector[i]->scalingfactor << " "
<< treevector[i]->partitionSize << " "
<< treevector[i]->default_modelName << " "
<< treevector[i]->treeString << endl;
}
}
else if (flag == 1) // for header in nexus or log file
{
os << pretext
<< "Partitions of data sets:" << endl
<< pretext
<< "------------------------" << endl;
for(unsigned i = 0; i < treevector.size(); i++) {
os << pretext << "Partition " << i+1 << ":" << endl
<< pretext << " scaling factor: " << treevector[i]->scalingfactor << endl
<< pretext << " partition size: " << treevector[i]->partitionSize << endl
<< pretext << " default start model: " << treevector[i]->default_modelName << endl;
if ( treevector[i]->treeData != NULL)
{
os << pretext << " tree with models: ";
treevector[i]->treeData->output(os, 0);
os << endl;
}
else
{
os << pretext << " Tree data is NULL at this point. This can be the expected status." << endl;
}
}
}
}
void tree_admin::default_treevector(int s) {
tree_struct* temp;
treevector.clear();
for(int i = 0; i < s; i++) {
temp = new tree_struct;
treevector.push_back(temp);
}
}
// tree_struct* tree_admin::getTree(int i) const { // get_tree // should return const ?? xxxxxxxxxxxxxxxxxxxxxx
// if(i >= treevector.size()) {
// throw indexerror();
// }else{
// return treevector[i];
// }
// }
// const faststring* tree_admin::getTreeString(int i) const { // get_tree // should return const ?? xxxxxxxxxxxxxxxxxxxxxx
// if(i >= treevector.size()) {
// throw indexerror();
// }else{
// return treevector[i];
// }
// }
void tree_admin::set(int i, double f, unsigned y, const faststring &model, const faststring &treestring) {
treevector[i]->scalingfactor = f;
treevector[i]->partitionSize = y;
treevector[i]->default_modelName = model;
treevector[i]->treeString = treestring;
}
void tree_admin::ini(int s) {
tree_struct *temp;
for(int i = 0; i < s; ++i) {
temp = new tree_struct;
treevector.push_back(temp);
}
}
unsigned tree_admin::getAlignmentLength() const
{
unsigned i, length=0;
for (i=0; i < treevector.size(); ++i)
{
length += treevector[i]->partitionSize;
}
return length;
}
unsigned tree_admin::getPartitionStartCoordinate(unsigned p) const
{
unsigned i, length=0;
for (i=0; i < p; ++i)
{
length += treevector[i]->partitionSize;
}
return length;
}
faststring tree_admin::get_dataTypeString() const
{
int i, N = (int)treevector.size();
vector<faststring> dt_vec;
int partition_start, partition_end;
bool same_data_type = true;
faststring res;
for (i=0; i<N; ++i)
{
dt_vec.push_back(treevector[i]->treeData->get_root_model()->get_datatypename());
if (i > 0 && (dt_vec[i-1] != dt_vec[i]) )
same_data_type = false;
}
if (same_data_type)
return dt_vec[0];
partition_start = 1;
partition_end = 0;
res = "mixed(";
for (i=0; i<N; ++i)
{
partition_end += treevector[i]->partitionSize;
res.append(dt_vec[i].c_str());
res.push_back(':');
res.append(faststring(partition_start));
res.push_back('-');
res.append(faststring(partition_end));
if (i < N-1)
{
res.push_back(',');
partition_start += treevector[i]->partitionSize;
}
}
res.push_back(')');
return res;
}
double tree_admin::getScalingFactor(unsigned i) const
{
return treevector[i]->scalingfactor;
}
void tree_admin::set_itsBasicTree(unsigned i, BasicTree *p) // should 2nd parameter better be const?
{
treevector[i]->treeData = p; // In future versions it should not be possible to overwrite a previous setting.
}
BasicTree* tree_admin::get_itsBasicTree(unsigned i)
{
return treevector[i]->treeData;
}
unsigned tree_admin::getPartitionSize(unsigned i) const
{
return treevector[i]->partitionSize;
}
const faststring& tree_admin::getDefaultModelName(unsigned i) const
{
return treevector[i]->default_modelName;
}
const faststring& tree_admin::getTreeString(unsigned p) const
{
return treevector[p]->treeString;
}
bool tree_admin::equal_takon_sets() const
{
BasicTree::set_of_OTUs first_set, curr_set;
unsigned i, N = (unsigned)treevector.size();
unsigned size1;
BasicTree::set_of_OTUs::iterator it1;
BasicTree::set_of_OTUs::iterator it2;
BasicTree::set_of_OTUs::iterator it1_end;
BasicTree::set_of_OTUs::iterator it2_end;
if ( treevector.empty() )
return true;
treevector[0]->treeData->get_set_of_OTUs( first_set );
it1 = first_set.begin();
it1_end = first_set.end();
size1 = (unsigned)first_set.size();
// cout << "Taxa in tree 0:" << endl;
// for(it = last_set.begin();
// it != last_set.end(); ++it)
// cout << **it << " ";
// cout << endl;
for ( i=1; i < N; ++i )
{
treevector[i]->treeData->get_set_of_OTUs( curr_set );
it1 = first_set.begin();
it2 = curr_set.begin();
it2_end = curr_set.end();
// cout << "Taxa in tree " << i << ":" << endl;
// for(it = curr_set.begin();
// it != curr_set.end(); ++it)
// cout << **it << " ";
// cout << endl;
// The comparison operators of sets do not use the specified
// comparison oject, but simply compares the values of the pointers.
// So we have to do it for ourselves.
if (size1 != curr_set.size() )
return false;
while (it1 != it1_end)
{
if ( **it1 != **it2)
return false;
++it1;
++it2;
}
}
return true;
}