/usr/lib/R/site-library/dplyr/include/dplyr/Result/Var.h is in r-cran-dplyr 0.7.4-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 | #ifndef dplyr_Result_Var_H
#define dplyr_Result_Var_H
#include <dplyr/Result/Processor.h>
namespace dplyr {
namespace internal {
inline double square(double x) {
return x * x;
}
}
// version for NA_RM = false
template <int RTYPE, bool NA_RM>
class Var : public Processor<REALSXP, Var<RTYPE, NA_RM> > {
public:
typedef Processor<REALSXP, Var<RTYPE, NA_RM> > Base;
typedef typename Rcpp::traits::storage_type<RTYPE>::type STORAGE;
Var(SEXP x, bool is_summary_ = false) :
Base(x),
data_ptr(Rcpp::internal::r_vector_start<RTYPE>(x)),
is_summary(is_summary_)
{}
~Var() {}
inline double process_chunk(const SlicingIndex& indices) {
if (is_summary) return NA_REAL;
int n = indices.size();
if (n == 1) return NA_REAL;
double m = internal::Mean_internal<RTYPE, NA_RM, SlicingIndex>::process(data_ptr, indices);
if (!R_FINITE(m)) return m;
double sum = 0.0;
for (int i = 0; i < n; i++) {
sum += internal::square(data_ptr[indices[i]] - m);
}
return sum / (n - 1);
}
private:
STORAGE* data_ptr;
bool is_summary;
};
// version for NA_RM = true
template <int RTYPE>
class Var<RTYPE, true> : public Processor<REALSXP, Var<RTYPE, true> > {
public:
typedef Processor<REALSXP, Var<RTYPE, true> > Base;
typedef typename Rcpp::traits::storage_type<RTYPE>::type STORAGE;
Var(SEXP x, bool is_summary_ = false) :
Base(x),
data_ptr(Rcpp::internal::r_vector_start<RTYPE>(x)),
is_summary(is_summary_)
{}
~Var() {}
inline double process_chunk(const SlicingIndex& indices) {
if (is_summary) return NA_REAL;
int n = indices.size();
if (n == 1) return NA_REAL;
double m = internal::Mean_internal<RTYPE, true, SlicingIndex>::process(data_ptr, indices);
if (!R_FINITE(m)) return m;
double sum = 0.0;
int count = 0;
for (int i = 0; i < n; i++) {
STORAGE current = data_ptr[indices[i]];
if (Rcpp::Vector<RTYPE>::is_na(current)) continue;
sum += internal::square(current - m);
count++;
}
if (count == 1) return NA_REAL;
return sum / (count - 1);
}
private:
STORAGE* data_ptr;
bool is_summary;
};
}
#endif
|