File: and.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 (324 lines) | stat: -rw-r--r-- 9,775 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
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
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
// -*- mode: C++; c-indent-level: 4; c-basic-offset: 4; tab-width: 8 -*-
//
// and.h: Rcpp R/C++ interface class library --
//
// 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__logical_and_h
#define Rcpp__sugar__logical_and_h

namespace Rcpp{
namespace sugar{

template <bool LHS_NA, typename LHS_T, bool RHS_NA, typename RHS_T>
class And_SingleLogicalResult_SingleLogicalResult :
public SingleLogicalResult<
	(LHS_NA || RHS_NA) ,
	And_SingleLogicalResult_SingleLogicalResult<LHS_NA,LHS_T,RHS_NA,RHS_T>
	>
{
public:
	typedef SingleLogicalResult<LHS_NA,LHS_T> LHS_TYPE ;
	typedef SingleLogicalResult<RHS_NA,RHS_T> RHS_TYPE ;
	typedef SingleLogicalResult<
		(LHS_NA || RHS_NA) ,
		And_SingleLogicalResult_SingleLogicalResult<LHS_NA,LHS_T,RHS_NA,RHS_T>
	> BASE ;

	And_SingleLogicalResult_SingleLogicalResult( const LHS_TYPE& lhs_, const RHS_TYPE& rhs_) :
		lhs(lhs_), rhs(rhs_){} ;

	inline void apply(){
		int left = lhs.get() ;
		if( Rcpp::traits::is_na<LGLSXP>( left ) ){
			BASE::set( left ) ;
		} else if( left == FALSE ){
			BASE::set( FALSE ) ;
		} else {
			BASE::set( rhs.get() ) ;
		}
	}

private:
	const LHS_TYPE& lhs ;
	const RHS_TYPE& rhs ;

} ;

// special version when we know the rhs is not NA
template <bool LHS_NA, typename LHS_T, typename RHS_T>
class And_SingleLogicalResult_SingleLogicalResult<LHS_NA,LHS_T,false,RHS_T> :
public SingleLogicalResult<
	LHS_NA ,
	And_SingleLogicalResult_SingleLogicalResult<LHS_NA,LHS_T,false,RHS_T>
	>
{
public:
	typedef SingleLogicalResult<LHS_NA,LHS_T> LHS_TYPE ;
	typedef SingleLogicalResult<false,RHS_T> RHS_TYPE ;
	typedef SingleLogicalResult<
		LHS_NA,
		And_SingleLogicalResult_SingleLogicalResult<LHS_NA,LHS_T,false,RHS_T>
	> BASE ;

	And_SingleLogicalResult_SingleLogicalResult( const LHS_TYPE& lhs_, const RHS_TYPE& rhs_) :
		lhs(lhs_), rhs(rhs_){} ;

	inline void apply(){
		// here we know rhs does not have NA, so we start with the rhs
		int right = rhs.get() ;
		if( right == FALSE ){
			BASE::set( FALSE ) ;
		} else {
			BASE::set( lhs.get() ) ;
		}
	}

private:
	const LHS_TYPE& lhs ;
	const RHS_TYPE& rhs ;

} ;


// special version when we know the lhs is not NA
template <typename LHS_T, bool RHS_NA, typename RHS_T>
class And_SingleLogicalResult_SingleLogicalResult<false,LHS_T,RHS_NA,RHS_T> :
public SingleLogicalResult<
	RHS_NA ,
	And_SingleLogicalResult_SingleLogicalResult<false,LHS_T,RHS_NA,RHS_T>
	>
{
public:
	typedef SingleLogicalResult<false,LHS_T> LHS_TYPE ;
	typedef SingleLogicalResult<RHS_NA,RHS_T> RHS_TYPE ;
	typedef SingleLogicalResult<
		RHS_NA,
		And_SingleLogicalResult_SingleLogicalResult<false,LHS_T,RHS_NA,RHS_T>
	> BASE ;

	And_SingleLogicalResult_SingleLogicalResult( const LHS_TYPE& lhs_, const RHS_TYPE& rhs_) :
		lhs(lhs_), rhs(rhs_){} ;

	inline void apply(){
		// here we know lhs does not have NA, so we start with the rhs
		int left = lhs.get() ;
		if( left == FALSE ){
			BASE::set( FALSE ) ;
		} else {
			BASE::set( rhs.get() ) ;
		}
	}

private:
	const LHS_TYPE& lhs ;
	const RHS_TYPE& rhs ;

} ;

// special version when we know both the lhs and the rhs are not NA
template <typename LHS_T, typename RHS_T>
class And_SingleLogicalResult_SingleLogicalResult<false,LHS_T,false,RHS_T> :
public SingleLogicalResult<
	false ,
	And_SingleLogicalResult_SingleLogicalResult<false,LHS_T,false,RHS_T>
	>
{
public:
	typedef SingleLogicalResult<false,LHS_T> LHS_TYPE ;
	typedef SingleLogicalResult<false,RHS_T> RHS_TYPE ;
	typedef SingleLogicalResult<
		false,
		And_SingleLogicalResult_SingleLogicalResult<false,LHS_T,false,RHS_T>
	> BASE ;

	And_SingleLogicalResult_SingleLogicalResult( const LHS_TYPE& lhs_, const RHS_TYPE& rhs_) :
		lhs(lhs_), rhs(rhs_){} ;

	inline void apply(){
		int left = lhs.get() ;
		if( left == FALSE ){
			BASE::set( FALSE ) ;
		} else {
			BASE::set( rhs.get() ) ;
		}
	}

private:
	const LHS_TYPE& lhs ;
	const RHS_TYPE& rhs ;

} ;



template <bool LHS_NA, typename LHS_T>
class And_SingleLogicalResult_bool :
public SingleLogicalResult<
	LHS_NA ,
	And_SingleLogicalResult_bool<LHS_NA,LHS_T>
	>
{
public:
	typedef SingleLogicalResult<LHS_NA,LHS_T> LHS_TYPE ;
	typedef SingleLogicalResult<
		LHS_NA ,
		And_SingleLogicalResult_bool<LHS_NA,LHS_T>
	> BASE ;

	And_SingleLogicalResult_bool( const LHS_TYPE& lhs_, bool rhs_) :
		lhs(lhs_), rhs(rhs_){} ;

	inline void apply(){
		if( !rhs ){
			BASE::set( FALSE ) ;
		} else{
			BASE::set( lhs.get() ) ;
		}
	}

private:
	const LHS_TYPE& lhs ;
	bool rhs ;

} ;



// (LogicalExpression) & (LogicalExpression)
template <bool LHS_NA, typename LHS_T, bool RHS_NA, typename RHS_T>
class And_LogicalExpression_LogicalExpression : public Rcpp::VectorBase< LGLSXP, true, And_LogicalExpression_LogicalExpression<LHS_NA,LHS_T,RHS_NA,RHS_T> >{
public:
    typedef typename Rcpp::VectorBase<LGLSXP,LHS_NA,LHS_T> LHS_TYPE ;
    typedef typename Rcpp::VectorBase<LGLSXP,RHS_NA,RHS_T> RHS_TYPE ;

    And_LogicalExpression_LogicalExpression( const LHS_TYPE& lhs_, const RHS_TYPE& rhs_ ) : lhs(lhs_), rhs(rhs_){}

    inline int operator[]( R_xlen_t i ) const{
        if( lhs[i] == TRUE && rhs[i] == TRUE ) return TRUE ;
        if( lhs[i] == NA_LOGICAL || rhs[i] == NA_LOGICAL ) return NA_LOGICAL ;
        return FALSE ;
    }
    inline R_xlen_t size() const { return lhs.size(); }

private:
    const LHS_TYPE& lhs ;
    const RHS_TYPE& rhs ;
} ;
template <typename LHS_T, bool RHS_NA, typename RHS_T>
class And_LogicalExpression_LogicalExpression<false,LHS_T,RHS_NA,RHS_T>
    : public Rcpp::VectorBase< LGLSXP, true, And_LogicalExpression_LogicalExpression<false,LHS_T,RHS_NA,RHS_T> >{
public:
    typedef typename Rcpp::VectorBase<LGLSXP,false,LHS_T> LHS_TYPE ;
    typedef typename Rcpp::VectorBase<LGLSXP,RHS_NA,RHS_T> RHS_TYPE ;

    And_LogicalExpression_LogicalExpression( const LHS_TYPE& lhs_, const RHS_TYPE& rhs_ ) : lhs(lhs_), rhs(rhs_){}

    inline int operator[]( R_xlen_t i ) const{
        if( lhs[i] == TRUE && rhs[i] == TRUE ) return TRUE ;
        if( rhs[i] == NA_LOGICAL ) return NA_LOGICAL ;
        return FALSE ;
    }
    inline R_xlen_t size() const { return lhs.size(); }

private:
    const LHS_TYPE& lhs ;
    const RHS_TYPE& rhs ;
} ;
template <bool LHS_NA, typename LHS_T, typename RHS_T>
class And_LogicalExpression_LogicalExpression<LHS_NA,LHS_T,false,RHS_T>
    : public Rcpp::VectorBase< LGLSXP, true, And_LogicalExpression_LogicalExpression<LHS_NA,LHS_T,false,RHS_T> >{
public:
    typedef typename Rcpp::VectorBase<LGLSXP,LHS_NA,LHS_T> LHS_TYPE ;
    typedef typename Rcpp::VectorBase<LGLSXP,false,RHS_T> RHS_TYPE ;

    And_LogicalExpression_LogicalExpression( const LHS_TYPE& lhs_, const RHS_TYPE& rhs_ ) : lhs(lhs_), rhs(rhs_){}

    inline int operator[]( R_xlen_t i ) const{
        if( lhs[i] == TRUE && rhs[i] == TRUE ) return TRUE ;
        if( lhs[i] == NA_LOGICAL ) return NA_LOGICAL ;
        return FALSE;
    }
    inline R_xlen_t size() const { return lhs.size(); }

private:
    const LHS_TYPE& lhs ;
    const RHS_TYPE& rhs ;
} ;
template <typename LHS_T, typename RHS_T>
class And_LogicalExpression_LogicalExpression<false,LHS_T,false,RHS_T>
    : public Rcpp::VectorBase< LGLSXP, false, And_LogicalExpression_LogicalExpression<false,LHS_T,false,RHS_T> >{
public:
    typedef typename Rcpp::VectorBase<LGLSXP,false,LHS_T> LHS_TYPE ;
    typedef typename Rcpp::VectorBase<LGLSXP,false,RHS_T> RHS_TYPE ;

    And_LogicalExpression_LogicalExpression( const LHS_TYPE& lhs_, const RHS_TYPE& rhs_ ) : lhs(lhs_), rhs(rhs_){}

    inline int operator[]( R_xlen_t i ) const{
        if( lhs[i] == TRUE && rhs[i] == TRUE ) return TRUE ;
        return FALSE;
    }
    inline R_xlen_t size() const { return lhs.size(); }

private:
    const LHS_TYPE& lhs ;
    const RHS_TYPE& rhs ;
} ;

}
}

template <bool LHS_NA, typename LHS_T, bool RHS_NA, typename RHS_T>
inline Rcpp::sugar::And_SingleLogicalResult_SingleLogicalResult<LHS_NA,LHS_T,RHS_NA,RHS_T>
operator&&(
	const Rcpp::sugar::SingleLogicalResult<LHS_NA,LHS_T>& lhs,
	const Rcpp::sugar::SingleLogicalResult<LHS_NA,LHS_T>& rhs
){
	return Rcpp::sugar::And_SingleLogicalResult_SingleLogicalResult<LHS_NA,LHS_T,RHS_NA,RHS_T>( lhs, rhs ) ;
}

template <bool LHS_NA, typename LHS_T>
inline Rcpp::sugar::And_SingleLogicalResult_bool<LHS_NA,LHS_T>
operator&&(
	const Rcpp::sugar::SingleLogicalResult<LHS_NA,LHS_T>& lhs,
	bool rhs
){
	return Rcpp::sugar::And_SingleLogicalResult_bool<LHS_NA,LHS_T>( lhs, rhs ) ;
}

template <bool LHS_NA, typename LHS_T>
inline Rcpp::sugar::And_SingleLogicalResult_bool<LHS_NA,LHS_T>
operator&&(
	bool rhs,
	const Rcpp::sugar::SingleLogicalResult<LHS_NA,LHS_T>& lhs
){
	return Rcpp::sugar::And_SingleLogicalResult_bool<LHS_NA,LHS_T>( lhs, rhs ) ;
}

// (logical expression) & (logical expression)
template <bool LHS_NA, typename LHS_T, bool RHS_NA, typename RHS_T>
inline Rcpp::sugar::And_LogicalExpression_LogicalExpression<LHS_NA,LHS_T,RHS_NA,RHS_T>
operator&(
    const Rcpp::VectorBase<LGLSXP,LHS_NA,LHS_T>& lhs,
    const Rcpp::VectorBase<LGLSXP,RHS_NA,RHS_T>& rhs
){
    return Rcpp::sugar::And_LogicalExpression_LogicalExpression<LHS_NA,LHS_T,RHS_NA,RHS_T>( lhs, rhs ) ;
}


#endif