5 * Created by Pat Schloss on 4/8/09.
6 * Copyright 2009 Patrick D. Schloss. All rights reserved.
10 #include "slibshuff.h"
12 /***********************************************************************/
14 SLibshuff::SLibshuff(FullMatrix* D, int it, float co) : Libshuff(D, it, 0, co){}
16 /***********************************************************************/
18 float SLibshuff::evaluatePair(int i, int j){
19 return sCalculate(i,j);
22 /***********************************************************************/
24 vector<vector<double> > SLibshuff::evaluateAll(){
26 savedMins.resize(numGroups);
27 vector<vector<double> > dCXYValues(numGroups);
29 for(int i=0;i<numGroups;i++){
30 dCXYValues[i].resize(numGroups);
31 savedMins[i].resize(numGroups);
32 for(int j=0;j<numGroups;j++){
34 dCXYValues[i][j] = sCalculate(i,j);
35 savedMins[i][j] = minXY;
38 if(savedMins[i][i].size() == 0){
39 savedMins[i][i] = minX;
47 errorOut(e, "SLibshuff", "evaluateAll");
52 /***********************************************************************/
54 double SLibshuff::sCalculate(int x, int y){
57 minXY = getMinXY(x,y);
59 sort(minX.begin(), minX.end());
60 sort(minXY.begin(), minXY.end());
62 double sum = 0.0,t=0.0;
64 while( (ix < groupSizes[x]) && (iy < groupSizes[x]) ) {
65 double h = (ix-iy)/double(groupSizes[x]);
67 if(minX[ix] < minXY[iy]) {
68 sum += (minX[ix] - t)*h*h;
72 sum += (minXY[iy] - t)*h*h;
78 if(ix < groupSizes[x]) {
80 while(ix < groupSizes[x]) {
81 double h = (ix-iy)/double(groupSizes[x]);
82 sum += (minX[ix] - t)*h*h;
89 while(iy < groupSizes[x]) {
90 double h = (ix-iy)/double(groupSizes[x]);
91 sum += (minXY[iy] - t)*h*h;
100 errorOut(e, "SLibshuff", "sCalculate");
105 /***********************************************************************/