/usr/include/armadillo_bits/op_symmat_meat.hpp is in libarmadillo-dev 1:4.200.0+dfsg-1.
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 | // Copyright (C) 2011-2012 Conrad Sanderson
// Copyright (C) 2011-2012 NICTA (www.nicta.com.au)
//
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at http://mozilla.org/MPL/2.0/.
//! \addtogroup op_symmat
//! @{
template<typename T1>
inline
void
op_symmat::apply
(
Mat<typename T1::elem_type>& out,
const Op<T1,op_symmat>& in,
const typename arma_not_cx<typename T1::elem_type>::result* junk
)
{
arma_extra_debug_sigprint();
arma_ignore(junk);
typedef typename T1::elem_type eT;
const unwrap<T1> tmp(in.m);
const Mat<eT>& A = tmp.M;
arma_debug_check( (A.is_square() == false), "symmatu()/symmatl(): given matrix must be square" );
const uword N = A.n_rows;
const bool upper = (in.aux_uword_a == 0);
if(&out != &A)
{
out.copy_size(A);
if(upper)
{
// upper triangular: copy the diagonal and the elements above the diagonal
for(uword i=0; i<N; ++i)
{
const eT* A_data = A.colptr(i);
eT* out_data = out.colptr(i);
arrayops::copy( out_data, A_data, i+1 );
}
}
else
{
// lower triangular: copy the diagonal and the elements below the diagonal
for(uword i=0; i<N; ++i)
{
const eT* A_data = A.colptr(i);
eT* out_data = out.colptr(i);
arrayops::copy( &out_data[i], &A_data[i], N-i );
}
}
}
if(upper)
{
// reflect elements across the diagonal from upper triangle to lower triangle
for(uword col=1; col < N; ++col)
{
const eT* coldata = out.colptr(col);
for(uword row=0; row < col; ++row)
{
out.at(col,row) = coldata[row];
}
}
}
else
{
// reflect elements across the diagonal from lower triangle to upper triangle
for(uword col=0; col < N; ++col)
{
const eT* coldata = out.colptr(col);
for(uword row=(col+1); row < N; ++row)
{
out.at(col,row) = coldata[row];
}
}
}
}
template<typename T1>
inline
void
op_symmat::apply
(
Mat<typename T1::elem_type>& out,
const Op<T1,op_symmat>& in,
const typename arma_cx_only<typename T1::elem_type>::result* junk
)
{
arma_extra_debug_sigprint();
arma_ignore(junk);
typedef typename T1::elem_type eT;
const unwrap<T1> tmp(in.m);
const Mat<eT>& A = tmp.M;
arma_debug_check( (A.is_square() == false), "symmatu()/symmatl(): given matrix must be square" );
const uword N = A.n_rows;
const bool upper = (in.aux_uword_a == 0);
if(&out != &A)
{
out.copy_size(A);
if(upper)
{
// upper triangular: copy the diagonal and the elements above the diagonal
for(uword i=0; i<N; ++i)
{
const eT* A_data = A.colptr(i);
eT* out_data = out.colptr(i);
arrayops::copy( out_data, A_data, i+1 );
}
}
else
{
// lower triangular: copy the diagonal and the elements below the diagonal
for(uword i=0; i<N; ++i)
{
const eT* A_data = A.colptr(i);
eT* out_data = out.colptr(i);
arrayops::copy( &out_data[i], &A_data[i], N-i );
}
}
}
if(upper)
{
// reflect elements across the diagonal from upper triangle to lower triangle
for(uword col=1; col < N; ++col)
{
const eT* coldata = out.colptr(col);
for(uword row=0; row < col; ++row)
{
out.at(col,row) = std::conj(coldata[row]);
}
}
}
else
{
// reflect elements across the diagonal from lower triangle to upper triangle
for(uword col=0; col < N; ++col)
{
const eT* coldata = out.colptr(col);
for(uword row=(col+1); row < N; ++row)
{
out.at(col,row) = std::conj(coldata[row]);
}
}
}
}
//! @}
|