/usr/lib/R/site-library/dplyr/include/dplyr/JoinVisitorImpl.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 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 | #ifndef dplyr_JoinVisitorImpl_H
#define dplyr_JoinVisitorImpl_H
#include <tools/utils.h>
#include <tools/match.h>
#include <dplyr/join_match.h>
#include <dplyr/JoinVisitor.h>
#include <dplyr/Column.h>
namespace dplyr {
CharacterVector get_uniques(const CharacterVector& left, const CharacterVector& right);
void check_attribute_compatibility(const Column& left, const Column& right);
template <int LHS_RTYPE, int RHS_RTYPE>
class DualVector {
public:
enum { RTYPE = (LHS_RTYPE > RHS_RTYPE ? LHS_RTYPE : RHS_RTYPE) };
typedef Vector<LHS_RTYPE> LHS_Vec;
typedef Vector<RHS_RTYPE> RHS_Vec;
typedef Vector<RTYPE> Vec;
typedef typename Rcpp::traits::storage_type<LHS_RTYPE>::type LHS_STORAGE;
typedef typename Rcpp::traits::storage_type<RHS_RTYPE>::type RHS_STORAGE;
typedef typename Rcpp::traits::storage_type<RTYPE>::type STORAGE;
public:
DualVector(LHS_Vec left_, RHS_Vec right_) : left(left_), right(right_) {}
LHS_STORAGE get_left_value(const int i) const {
if (i < 0) stop("get_left_value() called with negative argument");
return left[i];
}
RHS_STORAGE get_right_value(const int i) const {
if (i >= 0) stop("get_right_value() called with nonnegative argument");
return right[-i - 1];
}
bool is_left_na(const int i) const {
return left.is_na(get_left_value(i));
}
bool is_right_na(const int i) const {
return right.is_na(get_right_value(i));
}
bool is_na(const int i) const {
if (i >= 0) return is_left_na(i);
else return is_right_na(i);
}
LHS_STORAGE get_value_as_left(const int i) const {
if (i >= 0) return get_left_value(i);
else {
RHS_STORAGE x = get_right_value(i);
if (LHS_RTYPE == RHS_RTYPE) return x;
else return Rcpp::internal::r_coerce<RHS_RTYPE, LHS_RTYPE>(x);
}
}
RHS_STORAGE get_value_as_right(const int i) const {
if (i >= 0) {
LHS_STORAGE x = get_left_value(i);
if (LHS_RTYPE == RHS_RTYPE) return x;
else return Rcpp::internal::r_coerce<LHS_RTYPE, RHS_RTYPE>(x);
}
else return get_right_value(i);
}
STORAGE get_value(const int i) const {
if (RTYPE == LHS_RTYPE) return get_value_as_left(i);
else return get_value_as_right(i);
}
template <class iterator>
SEXP subset(iterator it, const int n) {
// We use the fact that LGLSXP < INTSXP < REALSXP, this defines our coercion precedence
RObject ret;
if (LHS_RTYPE == RHS_RTYPE)
ret = subset_same(it, n);
else if (LHS_RTYPE > RHS_RTYPE)
ret = subset_left(it, n);
else
ret = subset_right(it, n);
copy_most_attributes(ret, left);
return ret;
}
template <class iterator>
SEXP subset_same(iterator it, const int n) {
Vec res = no_init(n);
for (int i = 0; i < n; i++, ++it) {
res[i] = get_value(*it);
}
return res;
}
template <class iterator>
SEXP subset_left(iterator it, const int n) {
LHS_Vec res = no_init(n);
for (int i = 0; i < n; i++, ++it) {
res[i] = get_value_as_left(*it);
}
return res;
}
template <class iterator>
SEXP subset_right(iterator it, const int n) {
RHS_Vec res = no_init(n);
for (int i = 0; i < n; i++, ++it) {
res[i] = get_value_as_right(*it);
}
return res;
}
private:
LHS_Vec left;
RHS_Vec right;
};
template <int LHS_RTYPE, int RHS_RTYPE, bool ACCEPT_NA_MATCH>
class JoinVisitorImpl : public JoinVisitor {
protected:
typedef DualVector<LHS_RTYPE, RHS_RTYPE> Storage;
typedef boost::hash<typename Storage::STORAGE> hasher;
typedef typename Storage::LHS_Vec LHS_Vec;
typedef typename Storage::RHS_Vec RHS_Vec;
typedef typename Storage::Vec Vec;
public:
JoinVisitorImpl(const Column& left, const Column& right, const bool warn) : dual((SEXP)left.get_data(), (SEXP)right.get_data()) {
if (warn) check_attribute_compatibility(left, right);
}
inline size_t hash(int i) {
// If NAs don't match, we want to distribute their hashes as evenly as possible
if (!ACCEPT_NA_MATCH && dual.is_na(i)) return static_cast<size_t>(i);
typename Storage::STORAGE x = dual.get_value(i);
return hash_fun(x);
}
inline bool equal(int i, int j) {
if (LHS_RTYPE == RHS_RTYPE) {
// Shortcut for same data type
return join_match<LHS_RTYPE, LHS_RTYPE, ACCEPT_NA_MATCH>::is_match(dual.get_value(i), dual.get_value(j));
}
else if (i >= 0 && j >= 0) {
return join_match<LHS_RTYPE, LHS_RTYPE, ACCEPT_NA_MATCH>::is_match(dual.get_left_value(i), dual.get_left_value(j));
} else if (i < 0 && j < 0) {
return join_match<RHS_RTYPE, RHS_RTYPE, ACCEPT_NA_MATCH>::is_match(dual.get_right_value(i), dual.get_right_value(j));
} else if (i >= 0 && j < 0) {
return join_match<LHS_RTYPE, RHS_RTYPE, ACCEPT_NA_MATCH>::is_match(dual.get_left_value(i), dual.get_right_value(j));
} else {
return join_match<RHS_RTYPE, LHS_RTYPE, ACCEPT_NA_MATCH>::is_match(dual.get_right_value(i), dual.get_left_value(j));
}
}
SEXP subset(const std::vector<int>& indices) {
return dual.subset(indices.begin(), indices.size());
}
SEXP subset(const VisitorSetIndexSet<DataFrameJoinVisitors>& set) {
return dual.subset(set.begin(), set.size());
}
public:
hasher hash_fun;
private:
Storage dual;
};
template <bool ACCEPT_NA_MATCH>
class POSIXctJoinVisitor : public JoinVisitorImpl<REALSXP, REALSXP, ACCEPT_NA_MATCH> {
typedef JoinVisitorImpl<REALSXP, REALSXP, ACCEPT_NA_MATCH> Parent;
public:
POSIXctJoinVisitor(const Column& left, const Column& right) :
Parent(left, right, false),
tzone(R_NilValue)
{
RObject tzone_left = left.get_data().attr("tzone");
RObject tzone_right = right.get_data().attr("tzone");
if (tzone_left.isNULL() && tzone_right.isNULL()) return;
if (tzone_left.isNULL()) {
tzone = tzone_right;
} else if (tzone_right.isNULL()) {
tzone = tzone_left;
} else {
std::string s_left = as<std::string>(tzone_left);
std::string s_right = as<std::string>(tzone_right);
if (s_left == s_right) {
tzone = wrap(s_left);
} else {
tzone = wrap("UTC");
}
}
}
inline SEXP subset(const std::vector<int>& indices) {
return promote(Parent::subset(indices));
}
inline SEXP subset(const VisitorSetIndexSet<DataFrameJoinVisitors>& set) {
return promote(Parent::subset(set));
}
private:
inline SEXP promote(NumericVector x) {
set_class(x, Rcpp::CharacterVector::create("POSIXct", "POSIXt"));
if (!tzone.isNULL()) {
x.attr("tzone") = tzone;
}
return x;
}
private:
RObject tzone;
};
class DateJoinVisitorGetter {
public:
virtual ~DateJoinVisitorGetter() {};
virtual double get(int i) = 0;
virtual bool is_na(int i) const = 0;
};
template <int LHS_RTYPE, int RHS_RTYPE, bool ACCEPT_NA_MATCH>
class DateJoinVisitor : public JoinVisitorImpl<LHS_RTYPE, RHS_RTYPE, ACCEPT_NA_MATCH> {
typedef JoinVisitorImpl<LHS_RTYPE, RHS_RTYPE, ACCEPT_NA_MATCH> Parent;
public:
DateJoinVisitor(const Column& left, const Column& right) : Parent(left, right, false) {}
inline SEXP subset(const std::vector<int>& indices) {
return promote(Parent::subset(indices));
}
inline SEXP subset(const VisitorSetIndexSet<DataFrameJoinVisitors>& set) {
return promote(Parent::subset(set));
}
private:
static SEXP promote(SEXP x) {
set_class(x, "Date");
return x;
}
private:
typename Parent::hasher hash_fun;
};
}
#endif
|