]> git.donarmstrong.com Git - mothur.git/blob - libshuff.cpp
added logfile feature
[mothur.git] / libshuff.cpp
1 /*
2  *  libshuffform.cpp
3  *  Mothur
4  *
5  *  Created by Pat Schloss on 4/8/09.
6  *  Copyright 2009 Patrick D. Schloss. All rights reserved.
7  *
8  */
9
10 #include "libshuff.h"
11
12 /***********************************************************************/
13
14 void swap(int& i,int& j){       int t = i;  i = j;  j = t;      }
15
16 /***********************************************************************/
17
18 Libshuff::Libshuff(FullMatrix* D, int it, float step, float co) : matrix(D), iters(it), stepSize(step), cutOff(co){
19         try{
20                 groupNames = matrix->getGroups();
21                 groupSizes = matrix->getSizes();
22                 numGroups = matrix->getNumGroups();
23
24                 initializeGroups(matrix);
25         }
26         catch(exception& e) {
27                 errorOut(e, "Libshuff", "Libshuff");
28                 exit(1);
29         }
30 }
31
32 /***********************************************************************/
33
34 void Libshuff::initializeGroups(FullMatrix* matrix){
35         try{
36                 groups.resize(numGroups);
37                 savedGroups.resize(numGroups);
38                 
39                 savedGroups.resize(numGroups);
40                 for(int i=0;i<numGroups;i++) {
41                         groups[i].resize(groupSizes[i]);
42                         savedGroups[i].resize(groupSizes[i]);
43                 }
44                 int index=0;
45                 for(int i=0;i<numGroups;i++){
46                         for(int j=0;j<groupSizes[i];j++){
47                                 savedGroups[i][j] = groups[i][j] = index++;
48                         }
49                 }
50         }
51         catch(exception& e) {
52                 errorOut(e, "Libshuff", "initializeGroups");
53                 exit(1);
54         }
55 }
56
57 /***********************************************************************/
58
59 vector<vector<vector<double> > > Libshuff::getSavedMins(){
60         return savedMins;
61 }
62
63 /***********************************************************************/
64
65 vector<double> Libshuff::getMinX(int x){
66         try{
67                 vector<double> minX(groupSizes[x], 0);
68                 for(int i=0;i<groupSizes[x];i++){
69                         minX[i] = (groupSizes[x] > 1 ? (i==0 ? matrix->get(groups[x][0], groups[x][1]) : matrix->get(groups[x][i], groups[x][0])) : 0.0);
70                         for(int j=0;j<groupSizes[x];j++){
71                                 if(i != j)      {
72                                         double dx = matrix->get(groups[x][i], groups[x][j]);
73                                         if(dx < minX[i]){       minX[i] = dx;   }
74                                 }
75                         }
76                 }
77                 return minX;
78         }
79         catch(exception& e) {
80                 errorOut(e, "Libshuff", "getMinX");
81                 exit(1);
82         }
83 }
84
85 /***********************************************************************/
86
87 vector<double> Libshuff::getMinXY(int x, int y){
88         try{
89                 vector<double> minXY(groupSizes[x], 0);
90
91                 for(int i=0;i<groupSizes[x];i++){
92                         minXY[i] = matrix->get(groups[x][i], groups[y][0]);
93                         for(int j=0;j<groupSizes[y];j++){
94                                 double dxy = matrix->get(groups[x][i], groups[y][j]);
95                                 if(dxy<minXY[i]){       minXY[i] = dxy; }
96                         }
97                 }
98                 return minXY;
99         }
100         catch(exception& e) {
101                 errorOut(e, "Libshuff", "getMinXY");
102                 exit(1);
103         }
104 }
105
106 /***********************************************************************/
107
108 void Libshuff::randomizeGroups(int x, int y){
109         try{
110                 int nv = groupSizes[x]+groupSizes[y];
111                 vector<int> v(nv);
112                 
113                 int index=0;
114                 for(int k=0;k<groupSizes[x];k++)        {       v[index++] = groups[x][k];      }
115                 for(int k=0;k<groupSizes[y];k++)        {       v[index++] = groups[y][k];      }
116                 
117                 for(int k=nv-1;k>0;k--){
118                         int z = (int)(rand() % k);
119                         swap(v[z],v[k]);
120                 }
121                 
122                 index=0;
123                 for(int k=0;k<groupSizes[x];k++)        {       groups[x][k]=v[index++];        }
124                 for(int k=0;k<groupSizes[y];k++)        {       groups[y][k]=v[index++];        }
125         }
126         catch(exception& e) {
127                 errorOut(e, "Libshuff", "randomizeGroups");
128                 exit(1);
129         }
130 }
131
132 /***********************************************************************/
133
134 void Libshuff::resetGroup(int x){
135         
136         for(int k=0;k<groupSizes[x];k++)        {       groups[x][k] = savedGroups[x][k];       }
137         
138 }
139
140 /***********************************************************************/