#include <stat.hpp>

Collaboration diagram for jubatus::core::stat::stat::stat_val:

Public Member Functions
void	add (double d)

	MSGPACK_DEFINE (n_, sum_, sum2_, max_, min_)

void	rem (double d, const std::string &key, stat &st)

	stat_val ()

Public Attributes
double	max_

double	min_

size_t	n_

double	sum2_

double	sum_

Detailed Description

Definition at line 86 of file stat.hpp.

Constructor & Destructor Documentation

jubatus::core::stat::stat::stat_val::stat_val ( )

inline

Definition at line 87 of file stat.hpp.

         : n_(0),
           sum_(0),
           sum2_(0),
           max_(0),
           min_(0) {
     }

Member Function Documentation

void jubatus::core::stat::stat::stat_val::add ( double d )

inline

Definition at line 95 of file stat.hpp.

References max_, min_, n_, sum2_, and sum_.

                        {
       n_ += 1;
       sum_ += d;
       sum2_ += d * d;
 
       if (n_ > 1) {
         max_ = std::max(max_, d);
       } else {
         max_ = d;
       }
 
       if (n_ > 1) {
         min_ = std::min(min_, d);
       } else {
         min_ = d;
       }
     }

jubatus::core::stat::stat::stat_val::MSGPACK_DEFINE	(	n_	,
		sum_	,
		sum2_	,
		max_	,
		min_
	)

void jubatus::core::stat::stat::stat_val::rem	(	double	d,
		const std::string &	key,
		stat &	st
	)

inline

Definition at line 113 of file stat.hpp.

References max_, min_, n_, sum2_, and sum_.

Referenced by jubatus::core::stat::stat::push().

                                                        {
       n_ -= 1;
       sum_ -= d;
       sum2_ -= d * d;
       if (max_ == d) {
         if (n_ > 0) {
           bool first = true;
           for (size_t i = 0; i < st.window_.size(); ++i) {
             if (st.window_[i].second.first != key) {
               continue;
             }
             double d = st.window_[i].second.second;
             if (first) {
               max_ = d;
               first = false;
             } else {
               max_ = std::max(max_, d);
             }
           }
         } else {
           max_ = 0;
         }
       }
       if (min_ == d) {
         if (n_ > 0) {
           bool first = true;
           for (size_t i = 0; i < st.window_.size(); ++i) {
             if (st.window_[i].second.first != key) {
               continue;
             }
             double d = st.window_[i].second.second;
             if (first) {
               min_ = d;
               first = false;
             } else {
               min_ = std::min(min_, d);
             }
           }
         } else {
           min_ = 0;
         }
       }
     }