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
|
//
// optidata.cpp
// Mothur
//
// Created by Sarah Westcott on 5/10/18.
// Copyright © 2018 Schloss Lab. All rights reserved.
//
#include "optidata.hpp"
/***********************************************************************/
long long OptiData::print(ostream& out) {
try {
long long count = 0;
for (long long i = 0; i < closeness.size(); i++) {
out << i << '\t' << getName(i) << '\t';
for(set<long long>::iterator it = closeness[i].begin(); it != closeness[i].end(); it++){
out << *it << '\t';
count++;
}
out << endl;
}
out << endl;
return count;
}
catch(exception& e) {
m->errorOut(e, "OptiData", "print");
exit(1);
}
}
/***********************************************************************/
long long OptiData::getNumClose(long long index) {
try {
if (index < 0) { return 0; }
else if (index > closeness.size()) { m->mothurOut("[ERROR]: index is not valid.\n"); m->setControl_pressed(true); return 0; }
else { return closeness[index].size(); }
}
catch(exception& e) {
m->errorOut(e, "OptiData", "getNumClose");
exit(1);
}
}
/***********************************************************************/
bool OptiData::isClose(long long i, long long toFind){
try {
if (i < 0) { return false; }
else if (i > closeness.size()) { m->mothurOut("[ERROR]: index is not valid.\n"); m->setControl_pressed(true); return false; }
bool found = false;
if (closeness[i].count(toFind) != 0) { found = true; }
return found;
}
catch(exception& e) {
m->errorOut(e, "OptiData", "isClose");
exit(1);
}
}
/***********************************************************************/
set<long long> OptiData::getCloseSeqs(long long i){
try {
if (i < 0) { set<long long> temp; return temp; }
else if (i > closeness.size()) { m->mothurOut("[ERROR]: index is not valid.\n"); m->setControl_pressed(true); set<long long> temp; return temp; }
return closeness[i];
}
catch(exception& e) {
m->errorOut(e, "OptiData", "getNumClose");
exit(1);
}
}
/***********************************************************************/
//maps unique name to index in distance matrix
//used by sensspec to get translate the list file name to the index name for closeness
map<string, long long> OptiData::getNameIndexMap() {
try {
map<string, long long> nameIndexes;
for (int i = 0; i < nameMap.size(); i++) {
vector<string> thisBinsSeqs; util.splitAtComma(nameMap[i], thisBinsSeqs);
if (i < closeness.size()) { nameIndexes[thisBinsSeqs[0]] = i; }
}
return nameIndexes;
}
catch(exception& e) {
m->errorOut(e, "OptiData", "getNameIndexMap");
exit(1);
}
}
/***********************************************************************/
set<long long> OptiData::getIndexes(set<string> seqs) {
try {
map<string, long long> nameIndexes = getNameIndexMap();
map<string, long long>::iterator it;
set<long long> indexes;
for (set<string>::iterator itSeqs = seqs.begin(); itSeqs != seqs.end(); itSeqs++) {
it = nameIndexes.find(*itSeqs);
if (it != nameIndexes.end()) {
indexes.insert(it->second);
}
}
return indexes;
}
catch(exception& e) {
m->errorOut(e, "OptiData", "getNameIndexMap");
exit(1);
}
}
/***********************************************************************/
string OptiData::getName(long long index) {
try {
if (index < 0) { return ""; }
else if (index > closeness.size()) { m->mothurOut("[ERROR]: index is not valid.\n"); m->setControl_pressed(true); return ""; }
return nameMap[index];
}
catch(exception& e) {
m->errorOut(e, "OptiData", "getName");
exit(1);
}
}
/***********************************************************************/
set<string> OptiData::getNames(set<long long> indexes) {
try {
set<string> names;
for (set<long long>::iterator it = indexes.begin(); it != indexes.end(); it++) {
if (m->getControl_pressed()) { break; }
names.insert(getName(*it));
}
return names;
}
catch(exception& e) {
m->errorOut(e, "OptiData", "getNames");
exit(1);
}
}
/***********************************************************************/
long long OptiData::getNumDists(){
try {
long long foundDists = 0;
for (int i = 0; i < closeness.size(); i++) { foundDists += closeness[i].size(); }
return foundDists;
}
catch(exception& e) {
m->errorOut(e, "OptiData", "getNumDists");
exit(1);
}
}
/***********************************************************************/
ListVector* OptiData::getListSingle() {
try {
ListVector* singlelist = nullptr;
if (singletons.size() == 0) { }
else {
singlelist = new ListVector();
for (int i = 0; i < singletons.size(); i++) { singlelist->push_back(singletons[i]); }
}
return singlelist;
}
catch(exception& e) {
m->errorOut(e, "OptiData", "getListSingle");
exit(1);
}
}
/***********************************************************************/
|
