Rcpp Version 1.0.9
range.h
Go to the documentation of this file.
1
// -*- mode: C++; c-indent-level: 4; c-basic-offset: 4; tab-width: 8 -*-
2
//
3
// range.h: Rcpp R/C++ interface class library -- range
4
//
5
// Copyright (C) 2012 - 2013 Dirk Eddelbuettel and Romain Francois
6
//
7
// This file is part of Rcpp.
8
//
9
// Rcpp is free software: you can redistribute it and/or modify it
10
// under the terms of the GNU General Public License as published by
11
// the Free Software Foundation, either version 2 of the License, or
12
// (at your option) any later version.
13
//
14
// Rcpp is distributed in the hope that it will be useful, but
15
// WITHOUT ANY WARRANTY; without even the implied warranty of
16
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17
// GNU General Public License for more details.
18
//
19
// You should have received a copy of the GNU General Public License
20
// along with Rcpp. If not, see <http://www.gnu.org/licenses/>.
21
22
#ifndef Rcpp__sugar__range_h
23
#define Rcpp__sugar__range_h
24
25
namespace
Rcpp
{
26
namespace
sugar{
27
28
template
<
int
RTYPE,
bool
NA,
typename
T>
29
class
Range
{
30
public
:
31
typedef
typename
Rcpp::traits::storage_type<RTYPE>::type
STORAGE
;
32
33
Range
(
const
T& obj_) :
obj
(obj_) {}
34
35
operator
Vector<RTYPE>
(){
36
min_
=
max_
=
obj
[0] ;
37
if
( Rcpp::traits::is_na<RTYPE>(
min_
) )
return
Vector<RTYPE>::create
(
min_
,
max_
) ;
38
39
R_xlen_t n =
obj
.size() ;
40
for
( R_xlen_t i=1; i<n; i++){
41
current
=
obj
[i] ;
42
if
( Rcpp::traits::is_na<RTYPE>(
current
) )
return
Vector<RTYPE>::create
(
min_
,
max_
) ;
43
if
(
current
<
min_
)
min_
=
current
;
44
if
(
current
>
max_
)
max_
=
current
;
45
46
}
47
return
Vector<RTYPE>::create
(
min_
,
max_
) ;
48
}
49
50
51
private
:
52
const
T&
obj
;
53
STORAGE
min_
,
max_
,
current
;
54
} ;
55
56
// version for NA = false
57
template
<
int
RTYPE,
typename
T>
58
class
Range
<RTYPE,false,T> {
59
public
:
60
typedef
typename
Rcpp::traits::storage_type<RTYPE>::type
STORAGE
;
61
62
Range
(
const
T& obj_) :
obj
(obj_) {}
63
64
operator
Vector<RTYPE>
(){
65
min_
=
max_
=
obj
[0] ;
66
67
R_xlen_t n =
obj
.size() ;
68
for
( R_xlen_t i=1; i<n; i++){
69
current
=
obj
[i] ;
70
if
(
current
<
min_
)
min_
=
current
;
71
if
(
current
>
max_
)
max_
=
current
;
72
}
73
return
Vector<RTYPE>::create
(
min_
,
max_
) ;
74
}
75
76
77
private
:
78
const
T&
obj
;
79
STORAGE
min_
,
max_
,
current
;
80
} ;
81
82
83
}
// sugar
84
85
template
<
int
RTYPE,
bool
NA,
typename
T>
86
sugar::Range<RTYPE,NA,T>
range
(
const
VectorBase<RTYPE,NA,T>
& x){
87
return
sugar::Range<RTYPE,NA,T>
(x.
get_ref
()) ;
88
}
89
90
}
// Rcpp
91
92
#endif
Rcpp::VectorBase
Definition:
VectorBase.h:29
Rcpp::VectorBase::get_ref
VECTOR & get_ref()
Definition:
VectorBase.h:37
Rcpp::Vector
Definition:
Vector.h:36
Rcpp::Vector::create
static Vector create()
Definition:
Vector.h:1122
Rcpp::sugar::Range< RTYPE, false, T >::STORAGE
Rcpp::traits::storage_type< RTYPE >::type STORAGE
Definition:
range.h:60
Rcpp::sugar::Range< RTYPE, false, T >::current
STORAGE current
Definition:
range.h:79
Rcpp::sugar::Range< RTYPE, false, T >::Range
Range(const T &obj_)
Definition:
range.h:62
Rcpp::sugar::Range< RTYPE, false, T >::obj
const T & obj
Definition:
range.h:78
Rcpp::sugar::Range
Definition:
range.h:29
Rcpp::sugar::Range::current
STORAGE current
Definition:
range.h:53
Rcpp::sugar::Range::Range
Range(const T &obj_)
Definition:
range.h:33
Rcpp::sugar::Range::min_
STORAGE min_
Definition:
range.h:53
Rcpp::sugar::Range::STORAGE
Rcpp::traits::storage_type< RTYPE >::type STORAGE
Definition:
range.h:31
Rcpp::sugar::Range::obj
const T & obj
Definition:
range.h:52
Rcpp::sugar::Range::max_
STORAGE max_
Definition:
range.h:53
Rcpp
Rcpp API.
Definition:
algo.h:28
Rcpp::range
sugar::Range< RTYPE, NA, T > range(const VectorBase< RTYPE, NA, T > &x)
Definition:
range.h:86
Rcpp::traits::storage_type::type
SEXP type
Definition:
storage_type.h:36
inst
include
Rcpp
sugar
functions
range.h
Generated on Sat Jul 9 2022 09:14:52 for Rcpp Version 1.0.9 by
1.9.1