/home/paulfitz/cvs/coopy_scm/coopy/src/libcoopy_core/include/coopy/FMap.h

Go to the documentation of this file.

#ifndef COOPY_FMAP
#define COOPY_FMAP

#include <string>

#include <coopy/FVal.h>
#include <coopy/Dbg.h>
#include <coopy/EfficientMap.h>


namespace coopy {
  namespace cmp {
    typedef std::string Feature;
    template <class FVal> class FPolyMap;
    typedef FPolyMap<FSingleVal> FMap;
    typedef FPolyMap<FMultiVal> FMultiMap;
  }
}


template <class FVal>
class coopy::cmp::FPolyMap {
public:
  typedef efficient_map<Feature,FVal> Cache;
  int ct;
  int xcurr, ycurr;
  Cache f;
  coopy::store::SparseFloatSheet& rowMatch;
  bool query;
  int len;

  FPolyMap(coopy::store::SparseFloatSheet& sheet, int len) : rowMatch(sheet) {
    query = false;
    ct = 0;
    this->len = len;
  }

  coopy::store::FloatSheet& getMatch();

  //void setSize(int w, int h) {
  //rowMatch.resize(w,h,0);
  //  }

  void setCurr(int x, int y) {
    xcurr = x;
    ycurr = y;
  }

  void resetCount() {
    ct = 0;
    query = -1;
  }

  void resetCache() {
    f.clear();
  }

  void queryBit(std::string txt) {
    typename Cache::iterator it = f.find(txt);
    if (it!=f.end()) {
      it->second.apply(rowMatch,ycurr);
    }
    ct++;
    summarize();
  }

  void addBit(std::string txt, bool alt) {
    if (f.find(Feature(txt))==f.end()) {
      if (alt) return;
      f[Feature(txt)] = FVal();
    }
    FVal& val = f[Feature(txt)];
    val.setIndex(ycurr,alt);
    if (!alt) {
      ct++;
      summarize();
    }
  }

  void applyBit(const std::string& bit, bool query, bool alt) {
    if (query) {
      queryBit(bit);
    } else {
      addBit(bit,alt);
    }
  }


  void add(std::string txt, bool query, bool alt, int ctrl) {
    //printf("add %s %d %d\n", txt.c_str(), query, ctrl);
    this->query = query;
    applyBit(txt,query,alt);
    if (ctrl!=0) {
      txt = std::string("^") + txt + "$";
      int len = txt.length();
      std::string txt_low = txt;
      for (size_t c=0; c<txt_low.length(); c++) {
        txt_low[c] = tolower(txt_low[c]);
      }
      bool need_case = (txt_low!=txt);
      int base = 8-ctrl*2;
      for (int k=base; k<10; k+=2) {
        for (int i=0; i<len-k; i++){
          std::string part = txt.substr(i,k+1);
          applyBit(part,query,alt);
          if (need_case) {
            std::string low = txt_low.substr(i,k+1);
            if (low!=part) {
              applyBit(low,query,alt);
            }
          }
        }
      }
    }
  }

  static int getCtrlMax() { return 4; }

  void summarize(bool force = false) {
    if (ct%10000==0 || force) {
      //dbg_printf("%s %d features\n", query?"Queried":"Added",ct);
    }
  }

};


#endif