timetrack.h.bak

charm是基于垂直数据集挖掘关联规则的一个著名算法

#include  <sys/types.h>
#include  <sys/times.h>
#include <limits.h>

class TimeTracker {
 private:
  clock_t   start_user;
  clock_t   start_sys;
  bool  running;
 public:
  TimeTracker() {
    start_user=start_sys=0;
    running=false;
  }

  void Start() {
    struct  tms     l_time;

    if (times(&l_time) != -1) {
      start_user = l_time.tms_utime;
      start_sys  = l_time.tms_stime;
      running=true;
    }
  }

  double Stop() {
    struct  tms     l_time;
    clock_t   stop_user;
    clock_t   stop_sys;

    if ((!running) || (times(&l_time) == -1)) {
      return(-1.0);
    } else {
      stop_user = l_time.tms_utime;
      stop_sys  = l_time.tms_stime;
      running=false;
      return( ((double)(stop_user - start_user))/(double) CLK_TCK + 
              ((double)(stop_sys-start_sys))/(double)CLK_TCK);
    }
  }
};