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
|
// SubMatrix.h: Rcpp R/C++ interface class library -- sub matrices
//
// Copyright (C) 2010 - 2013 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__vector__SubMatrix_h
#define Rcpp__vector__SubMatrix_h
namespace Rcpp{
template <int RTYPE>
class SubMatrix : public Rcpp::MatrixBase< RTYPE, true, SubMatrix<RTYPE> > {
public:
typedef Matrix<RTYPE> MATRIX ;
typedef typename Vector<RTYPE>::iterator vec_iterator ;
typedef typename MATRIX::Proxy Proxy ;
SubMatrix( MATRIX& m_, const Range& row_range_, const Range& col_range_ ) :
m(m_),
iter( static_cast< Vector<RTYPE>& >(m_).begin() + row_range_.get_start() + col_range_.get_start() * m_.nrow() ),
m_nr( m.nrow() ),
nc( col_range_.size() ),
nr( row_range_.size() )
{}
inline R_xlen_t size() const { return ((R_xlen_t)ncol()) * nrow() ; }
inline R_xlen_t ncol() const { return nc ; }
inline R_xlen_t nrow() const { return nr ; }
inline Proxy operator()(int i, int j) const {
return iter[ i + j*m_nr ] ;
}
inline vec_iterator column_iterator( int j ) const { return iter + j*m_nr ; }
private:
MATRIX& m ;
vec_iterator iter ;
R_xlen_t m_nr, nc, nr ;
} ;
template <int RTYPE, template <class> class StoragePolicy >
Matrix<RTYPE,StoragePolicy>::Matrix( const SubMatrix<RTYPE>& sub ) : VECTOR( Rf_allocMatrix( RTYPE, (int)sub.nrow(), (int)sub.ncol() )), nrows((int)sub.nrow()) {
R_xlen_t nc = sub.ncol() ;
iterator start = VECTOR::begin() ;
iterator rhs_it ;
for( R_xlen_t j=0; j<nc; j++){
rhs_it = sub.column_iterator((int)j) ;
for( int i=0; i<nrows; i++, ++start){
*start = rhs_it[i] ;
}
}
}
template <int RTYPE, template <class> class StoragePolicy >
Matrix<RTYPE,StoragePolicy>& Matrix<RTYPE,StoragePolicy>::operator=( const SubMatrix<RTYPE>& sub ){
int nc = sub.ncol(), nr = sub.nrow() ;
if( nc != nrow() || nr != ncol() ){
nrows = nr ;
VECTOR::set__( Rf_allocMatrix( RTYPE, nr, nc ) ) ;
}
iterator start = VECTOR::begin() ;
iterator rhs_it ;
for( int j=0; j<nc; j++){
rhs_it = sub.column_iterator(j) ;
for( int i=0; i<nrows; i++, ++start){
*start = rhs_it[i] ;
}
}
return *this ;
}
#undef RCPP_WRAP_SUBMATRIX
#define RCPP_WRAP_SUBMATRIX(RTYPE) \
template<> inline SEXP wrap< SubMatrix<RTYPE> >( \
const SubMatrix<RTYPE>& object \
) { \
return Matrix<RTYPE>( object ) ; \
}
RCPP_WRAP_SUBMATRIX(REALSXP)
RCPP_WRAP_SUBMATRIX(INTSXP)
RCPP_WRAP_SUBMATRIX(LGLSXP)
RCPP_WRAP_SUBMATRIX(RAWSXP)
// RCPP_WRAP_SUBMATRIX(STRSXP)
// RCPP_WRAP_SUBMATRIX(VECSXP)
// RCPP_WRAP_SUBMATRIX(EXPRSXP)
#undef RCPP_WRAP_SUBMATRIX
}
#endif
|
