printf("Relaxed NJ tree(s) in %s\n", nj_args->outfilename);
}
}
-
- //exit(0);
+
+ return 0;
}
rabund = new RAbundVector(list->getRAbundVector());
fileHandle.close();
+
+ return 0;
}
catch(exception& e) {
m->errorOut(e, "ClusterClassic", "readPhylipFile");
remove(outputFile.c_str()); //temp file is bad because file mismatch above
}
+ return good;
+
}
catch(exception& e) {
m->errorOut(e, "DistanceCommand", "sanityCheck");
if(nextCommand != NULL) { add_history(nextCommand); }
else{ //^D causes null string and we want it to quit mothur
- nextCommand = "quit";
+ strcpy(nextCommand, "quit");
mout->mothurOut(nextCommand);
}
names.insert(seqs[i]);
}
}
+
+ return 0;
}
catch(exception& e) {
m->errorOut(e, "GetGroupsCommand", "fillNames");
m->mothurOut(newList.getLabel() + " - selected " + toString(numOtus) + " of the " + toString(list->getNumBins()) + " OTUs."); m->mothurOutEndLine();
-
+ return 0;
}
catch(exception& e) {
m->errorOut(e, "GetOtusCommand", "processList");
int metastat_main (char* outputFileName, int numRows, int numCols, double threshold, int numPermutations, double** data, int secondGroupingStart){
- int size,c=0,i=0,j=0,k,counter=0, bflag=0;
+ int size,c=0,i=0,j=0,counter=0, bflag=0;
int B=numPermutations;
int row = numRows;
int col = numCols;
int g = secondGroupingStart;
double thresh=threshold;
- double placeholder=0,min=0;
+ double min=0;
char output[1024];
strcpy(output, outputFileName);
// Initialize the matrices
size = row*col;
double matrix[row][col];
- double pmatrix[size],pmatrix2[size],permuted[size];
+ double pmatrix[size],permuted[size];
double storage[row][9];
for (i=0;i<row;i++){
*ps) {
double Tvalues[*nr];
- int a, b, n, i, j,k=0;
+ int a, b, n, j;
a = *B;
b = *nr;
try {
#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
int process = 1;
- int num = 0;
vector<int> processIDS;
EstOutput results;
try {
#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
int process = 1;
- int num = 0;
+
vector<int> processIDS;
map< string, vector<float> >::iterator itSum;
for (int k = level; k < maxLevel; k++) { seqTaxonomy += "unclassified;"; }
}
}
-
+ return 0;
}
catch(exception& e) {
m->errorOut(e, "PhyloSummary", "addSeqToTree");
for (int k = level; k < maxLevel; k++) { seqTaxonomy += "unclassified;"; }
}
}
-
+ return 0;
}
catch(exception& e) {
m->errorOut(e, "PhyloSummary", "addSeqToTree");
if (seqTaxonomy == "") { uniqueTaxonomies[currentNode] = currentNode; }
}
+
+ return 0;
}
catch(exception& e) {
m->errorOut(e, "PhyloTree", "addSeqToTree");
}
in.close();
+
+ return 0;
}
catch(exception& e) {
m->errorOut(e, "PipelineCommand", "runUsersPipeline");
try {
#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
int process = 1;
- int num = 0;
+
vector<int> processIDS;
EstOutput results;
names.insert(seqs[i]);
}
}
+
+ return 0;
}
catch(exception& e) {
m->errorOut(e, "RemoveGroupsCommand", "fillNames");
m->mothurOut(newList.getLabel() + " - removed " + toString(numOtus) + " of the " + toString(list->getNumBins()) + " OTUs."); m->mothurOutEndLine();
+ return 0;
}
catch(exception& e) {
double clusterCutoff = cutoff;
while (matrix->getSmallDist() <= clusterCutoff && matrix->getNNodes() > 0){
cluster->update(clusterCutoff);
- float dist = matrix->getSmallDist();
}
list->setLabel(toString(cutoff));
for(int j=0;j<nSeqsPerOTU[i];j++){
int index = cumNumSeqs[i] + j;
int nI = seqIndex[index];
- int nIU = mapSeqToUnique[nI];
double tauValue = singleTau[seqNumber[index]];
for(int j=0;j<nSeqsPerOTU[i];j++){
int index = cumNumSeqs[i] + j;
- int nI = seqIndex[index];
double tauValue = singleTau[seqNumber[index]];
weight[i] += tauValue;
}
vector<vector<int> > qualities(numOTUs);
vector<double> pr(HOMOPS, 0);
- int index = 0;
for(int i=0;i<numOTUs;i++){
int index = 0;
if (large) { splitDistanceLarge(); }
else { splitDistanceRAM(); }
+
+ return 0;
}
catch(exception& e) {
}
in.close();
+ return 0;
+
}
catch(exception& e) {
m->errorOut(e, "SubSampleCommand", "getNames");
}
in.close();
+ return 0;
+
}
catch(exception& e) {
m->errorOut(e, "SubSampleCommand", "readNames");
outDist.close();
}
}
+ return 0;
}
catch(exception& e) {
m->errorOut(e, "SummarySharedCommand", "process");
oligo = oligo.substr(0,alnLength);
temp = temp.substr(0,alnLength);
- int newStart=0;
int numDiff = countDiffs(oligo, temp);
if(numDiff < minDiff){
m->openInputFile(flowFileName, in);
in.seekg(spot);
- unsigned long int newSpot = spot;
string dummy = m->getline(in);
-
//there was not another sequence before the end of the file
unsigned long int sanityPos = in.tellg();
try {
ofstream outFASTA;
- int able = m->openOutputFile(trimFile, outFASTA);
+ m->openOutputFile(trimFile, outFASTA);
ofstream scrapFASTA;
m->openOutputFile(scrapFile, scrapFASTA);
oligo = oligo.substr(0,alnLength);
temp = temp.substr(0,alnLength);
- int newStart=0;
int numDiff = countDiffs(oligo, temp);
// cout << oligo << '\t' << temp << '\t' << numDiff << endl;
oligo = oligo.substr(0,alnLength);
temp = temp.substr(0,alnLength);
- int newStart=0;
int numDiff = countDiffs(oligo, temp);
// cout << oligo << '\t' << temp << '\t' << numDiff << endl;
try {
#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
int process = 1;
- int num = 0;
vector<int> processIDS;
EstOutput results;
try {
#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
int process = 1;
- int num = 0;
vector<int> processIDS;
EstOutput results;
try {
#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
int process = 1;
- int num = 0;
vector<int> processIDS;
EstOutput results;
EstOutput results; results.resize(num);
int count = 0;
- int total = num;
- int twentyPercent = (total * 0.20);
int numLeaves = t->getNumLeaves();
Tree* copyTree = new Tree;
D += weightedSum;
}
-
- int numLeaves = t->getNumLeaves();
-
+
//calculate u for the group comb
for(int i=0;i<t->getNumNodes();i++){