/home/paulfitz/cvs/coopy_scm/coopy/src/libcoopy_core/SparseSheet.cpp

Go to the documentation of this file.

#include <coopy/SparseSheet.h>

#include <math.h>

using namespace std;
using namespace coopy::store;

Stat SparseFloatSheet::normalize(int first, int last, float sc, bool modify) {
  Stat s;
  //int hh = height();
  int ww = width();
  if (first==-1) first = 0;
  if (last==-1) last = ww-1;
  float tot = 0;
  float tot2 = 0;
  int ct = 0;
  for (efficient_map<long long,float>::iterator it=data.begin(); it!=data.end(); it++) {
    long long col = it->first % ww;
    if (col>=first&&col<=last) {
      float r = it->second;
      tot += r;
      tot2 += r*r;
      ct++;
    }
  }
  if (ct==0) return s;
  float mean = tot;
  float dev = 1;
  mean /= ct;
  dev = tot2 / ct - mean*mean;
  if (dev<0) { 
    dev = 0; 
  } else {
    dev = sqrt(dev);
  }
  //printf("mean %g, dev %g\n", mean, dev);
  if (dev<sc) dev = sc;
  if (modify) {
    for (efficient_map<long long,float>::iterator it=data.begin(); it!=data.end(); it++) {
      long long col = it->first % ww;
      if (col>=first&&col<=last) {
        float r = it->second;
        r = (r-mean)/dev;
        it->second = r;
      }
    }
  }
  s.mean = mean;
  s.stddev = dev;
  s.valid = true;
  return s;
}


void SparseFloatSheet::findBest(IntSheet& bestIndex, FloatSheet& bestValue, FloatSheet& bestInc) {
  bestIndex.resize(1,h,-1);
  bestValue.resize(1,h,0);
  bestInc.resize(1,h,0);
  for (efficient_map<long long,float>::iterator it=data.begin(); it!=data.end(); it++) {
    long long x = it->first % w;
    long long y = it->first / w;
    if (x>=w || y>=h) {
      fprintf(stderr,"SparseSheet - out of range: %ld %ld : (%dx%d)\n", 
              (long)x, (long)y, w, h);
      exit(1);
    }
    float val = it->second;
    float& best = bestValue.cell(0,y);
    if (val>best) {
      bestIndex.cell(0,y) = x;
      bestInc.cell(0,y) = val - best;
      best = val;
    }
  }
}