/usr/lib/R/site-library/dplyr/include/dplyr/Result/Sum.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 95 96 97 98 99 100 101 102 103 104 105 | #ifndef dplyr_Result_Sum_H
#define dplyr_Result_Sum_H
#include <dplyr/Result/Processor.h>
namespace dplyr {
namespace internal {
// this one is actually only used for RTYPE = REALSXP and NA_RM = true
template <int RTYPE, bool NA_RM, typename Index>
struct Sum {
typedef typename Rcpp::traits::storage_type<RTYPE>::type STORAGE;
static STORAGE process(typename Rcpp::traits::storage_type<RTYPE>::type* ptr, const Index& indices) {
long double res = 0;
int n = indices.size();
for (int i = 0; i < n; i++) {
double value = ptr[indices[i]];
if (! Rcpp::traits::is_na<RTYPE>(value)) res += value;
}
return (double)res;
}
};
template <typename Index>
struct Sum<INTSXP, true, Index> {
static int process(int* ptr, const Index& indices) {
long double res = 0;
int n = indices.size();
for (int i = 0; i < n; i++) {
int value = ptr[indices[i]];
if (! Rcpp::traits::is_na<INTSXP>(value)) res += value;
}
if (res > INT_MAX || res <= INT_MIN) {
warning("integer overflow - use sum(as.numeric(.))");
return IntegerVector::get_na();
}
return (int)res;
}
};
template <typename Index>
struct Sum<INTSXP, false, Index> {
static int process(int* ptr, const Index& indices) {
long double res = 0;
int n = indices.size();
for (int i = 0; i < n; i++) {
int value = ptr[indices[i]];
if (Rcpp::traits::is_na<INTSXP>(value)) {
return NA_INTEGER;
}
res += value;
}
if (res > INT_MAX || res <= INT_MIN) {
warning("integer overflow - use sum(as.numeric(.))");
return IntegerVector::get_na();
}
return (int)res;
}
};
template <typename Index>
struct Sum<REALSXP, false, Index> {
static double process(double* ptr, const Index& indices) {
long double res = 0.0;
int n = indices.size();
for (int i = 0; i < n; i++) {
// we don't test for NA here because += NA will give NA
// this is faster in the most common case where there are no NA
// if there are NA, we could return quicker as in the version for
// INTSXP above, but we would penalize the most common case
res += ptr[ indices[i] ];
}
return (double)res;
}
};
} // namespace internal
template <int RTYPE, bool NA_RM>
class Sum : public Processor< RTYPE, Sum<RTYPE, NA_RM> > {
public:
typedef Processor< RTYPE, Sum<RTYPE, NA_RM> > Base;
typedef typename Rcpp::traits::storage_type<RTYPE>::type STORAGE;
Sum(SEXP x, bool is_summary_ = false) :
Base(x),
data_ptr(Rcpp::internal::r_vector_start<RTYPE>(x)),
is_summary(is_summary_)
{}
~Sum() {}
inline STORAGE process_chunk(const SlicingIndex& indices) {
if (is_summary) return data_ptr[indices.group()];
return internal::Sum<RTYPE, NA_RM, SlicingIndex>::process(data_ptr, indices);
}
STORAGE* data_ptr;
bool is_summary;
};
}
#endif
|