File: pmax.h

package info (click to toggle)
rcpp 1.1.0-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 7,480 kB
  • sloc: cpp: 27,436; ansic: 7,778; sh: 53; makefile: 2
file content (193 lines) | stat: -rw-r--r-- 5,035 bytes parent folder | download | duplicates (7)
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
// -*- mode: C++; c-indent-level: 4; c-basic-offset: 4; tab-width: 8 -*-
//
// pmax.h: Rcpp R/C++ interface class library -- pmax
//
// Copyright (C) 2010 - 2012 Dirk Eddelbuettel and Romain Francois
//
// This file is part of Rcpp.
//
// Rcpp is free software: you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 2 of the License, or
// (at your option) any later version.
//
// Rcpp is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Rcpp.  If not, see <http://www.gnu.org/licenses/>.

#ifndef Rcpp__sugar__pmax_h
#define Rcpp__sugar__pmax_h

namespace Rcpp{
namespace sugar{

template <int RTYPE, bool LHS_NA, bool RHS_NA> struct pmax_op ;

// specializations for double.
// we use the fact that NA < x is false
template <>
struct pmax_op<REALSXP,true,true>{
	inline double operator()( double left, double right ) const {
		return ( Rcpp::traits::is_na<REALSXP>( left ) || (left > right) ) ? left : right ;
	}
} ;
template <> struct pmax_op<REALSXP,true,false> {
	inline double operator()( double left, double right ) const {
		return right > left ? right : left ;
	}
} ;
template <> struct pmax_op<REALSXP,false,true> {
	inline double operator()( double left, double right ) const {
		return right > left ? right : left ;
	}
} ;
template <> struct pmax_op<REALSXP,false,false> {
	inline double operator()( double left, double right ) const {
		return left > right ? left : right ;
	}
} ;

// specializations for INTSXP. Since NA is represented as the smallest
// int, NA is always the smallest, so it is safe to return NA
template <bool LHS_NA, bool RHS_NA>
struct pmax_op<INTSXP,LHS_NA,RHS_NA> {
    inline int operator()(int left, int right) const {
        return left > right ? left : right ;
    }
} ;


// general case
template <int RTYPE, bool NA> class pmax_op_Vector_Primitive {
public:
	typedef typename Rcpp::traits::storage_type<RTYPE>::type STORAGE ;

	pmax_op_Vector_Primitive( STORAGE right_ ) :  right(right_) {}

	inline STORAGE operator()( STORAGE left ) const {
		return left > right ? left : right ;
	}

private:
	STORAGE right ;
} ;
// only special case we need to take care of
template <> class pmax_op_Vector_Primitive<REALSXP,true> {
public:
	pmax_op_Vector_Primitive( double right_ ) :  right(right_) {}

	inline double operator()( double left ) const {
		return ( Rcpp::traits::is_na<REALSXP>( left ) || (left > right) ) ? left : right ;
	}

private:
	double right ;
} ;




template <
	int RTYPE,
	bool LHS_NA, typename LHS_T,
	bool RHS_NA, typename RHS_T
	>
class Pmax_Vector_Vector : public VectorBase<
	RTYPE ,
	( LHS_NA || RHS_NA ) ,
	Pmax_Vector_Vector<RTYPE,LHS_NA,LHS_T,RHS_NA,RHS_T>
> {
public:
	typedef typename Rcpp::traits::storage_type<RTYPE>::type STORAGE ;
	typedef pmax_op<RTYPE,LHS_NA,RHS_NA> OPERATOR ;

	Pmax_Vector_Vector( const LHS_T& lhs_, const RHS_T& rhs_ ) : lhs(lhs_), rhs(rhs_), op() {}

        inline STORAGE operator[]( R_xlen_t i ) const {
		return op( lhs[i], rhs[i] ) ;
	}
        inline R_xlen_t size() const { return lhs.size() ; }

private:
	const LHS_T& lhs ;
	const RHS_T& rhs ;
	OPERATOR op ;
} ;



template <
	int RTYPE,
	bool LHS_NA, typename LHS_T
	>
class Pmax_Vector_Primitive : public VectorBase<
	RTYPE ,
	true ,
	Pmax_Vector_Primitive<RTYPE,LHS_NA,LHS_T>
> {
public:
	typedef typename Rcpp::traits::storage_type<RTYPE>::type STORAGE ;
	typedef pmax_op_Vector_Primitive<RTYPE,LHS_NA> OPERATOR ;

	Pmax_Vector_Primitive( const LHS_T& lhs_, STORAGE rhs_ ) : lhs(lhs_), op(rhs_) {}

        inline STORAGE operator[]( R_xlen_t i ) const {
		return op( lhs[i] ) ;
	}
        inline R_xlen_t size() const { return lhs.size() ; }

private:
	const LHS_T& lhs ;
	OPERATOR op ;
} ;



} // sugar

template <
	int RTYPE,
	bool LHS_NA, typename LHS_T,
	bool RHS_NA, typename RHS_T
>
inline sugar::Pmax_Vector_Vector<RTYPE,LHS_NA,LHS_T,RHS_NA,RHS_T>
pmax(
	const Rcpp::VectorBase<RTYPE,LHS_NA,LHS_T>& lhs,
	const Rcpp::VectorBase<RTYPE,RHS_NA,RHS_T>& rhs
	){
	return sugar::Pmax_Vector_Vector<RTYPE,LHS_NA,LHS_T,RHS_NA,RHS_T>( lhs.get_ref(), rhs.get_ref() ) ;
}

template <
	int RTYPE,
	bool LHS_NA, typename LHS_T
>
inline sugar::Pmax_Vector_Primitive<RTYPE,LHS_NA,LHS_T>
pmax(
	const Rcpp::VectorBase<RTYPE,LHS_NA,LHS_T>& lhs,
	typename Rcpp::traits::storage_type<RTYPE>::type rhs
	){
	return sugar::Pmax_Vector_Primitive<RTYPE,LHS_NA,LHS_T>( lhs.get_ref(), rhs ) ;
}


template <
	int RTYPE,
	bool RHS_NA, typename RHS_T
>
inline sugar::Pmax_Vector_Primitive<RTYPE,RHS_NA,RHS_T>
pmax(
	typename Rcpp::traits::storage_type<RTYPE>::type lhs,
	const Rcpp::VectorBase<RTYPE,RHS_NA,RHS_T>& rhs
	){
	return sugar::Pmax_Vector_Primitive<RTYPE,RHS_NA,RHS_T>( rhs.get_ref(), lhs ) ;
}


} // Rcpp

#endif