/usr/include/armadillo_bits/fn_dot.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 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 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 | // Copyright (C) 2008-2014 Conrad Sanderson
// Copyright (C) 2008-2014 NICTA (www.nicta.com.au)
// Copyright (C) 2012 Ryan Curtin
//
// 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 fn_dot
//! @{
template<typename T1, typename T2>
arma_inline
arma_warn_unused
typename
enable_if2
<
is_arma_type<T1>::value && is_arma_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::yes,
typename T1::elem_type
>::result
dot
(
const T1& A,
const T2& B
)
{
arma_extra_debug_sigprint();
return op_dot::apply(A,B);
}
template<typename T1, typename T2>
inline
arma_warn_unused
typename
enable_if2
<
is_arma_type<T1>::value && is_arma_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::no,
typename promote_type<typename T1::elem_type, typename T2::elem_type>::result
>::result
dot
(
const T1& A,
const T2& B
)
{
arma_extra_debug_sigprint();
return op_dot_mixed::apply(A,B);
}
template<typename T1, typename T2>
arma_inline
arma_warn_unused
typename
enable_if2
<
is_arma_type<T1>::value && is_arma_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::value && is_cx<typename T1::elem_type>::no,
typename T1::elem_type
>::result
norm_dot
(
const T1& A,
const T2& B
)
{
arma_extra_debug_sigprint();
return op_norm_dot::apply(A,B);
}
template<typename T1, typename T2>
arma_inline
arma_warn_unused
typename
enable_if2
<
is_arma_type<T1>::value && is_arma_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::value && is_complex_strict<typename T1::elem_type>::value,
typename T1::elem_type
>::result
norm_dot
(
const T1& A,
const T2& B
)
{
arma_extra_debug_sigprint();
return op_norm_dot_slow::apply(A,B);
}
//
// cdot
template<typename T1, typename T2>
arma_inline
arma_warn_unused
typename
enable_if2
<
is_arma_type<T1>::value && is_arma_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::value && is_not_complex<typename T1::elem_type>::value,
typename T1::elem_type
>::result
cdot
(
const T1& A,
const T2& B
)
{
arma_extra_debug_sigprint();
return op_dot::apply(A,B);
}
template<typename T1, typename T2>
arma_inline
arma_warn_unused
typename
enable_if2
<
is_arma_type<T1>::value && is_arma_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::value && is_complex<typename T1::elem_type>::value,
typename T1::elem_type
>::result
cdot
(
const T1& A,
const T2& B
)
{
arma_extra_debug_sigprint();
return op_cdot::apply(A,B);
}
// convert dot(htrans(x), y) to cdot(x,y)
template<typename T1, typename T2>
arma_inline
arma_warn_unused
typename
enable_if2
<
is_arma_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::value && is_complex<typename T1::elem_type>::value,
typename T1::elem_type
>::result
dot
(
const Op<T1, op_htrans>& A,
const T2& B
)
{
arma_extra_debug_sigprint();
return cdot(A.m, B);
}
//
// for sparse matrices
//
namespace priv
{
template<typename T1, typename T2>
arma_hot
inline
typename T1::elem_type
dot_helper(const SpProxy<T1>& pa, const SpProxy<T2>& pb)
{
typedef typename T1::elem_type eT;
// Iterate over both objects and see when they are the same
eT result = eT(0);
typename SpProxy<T1>::const_iterator_type a_it = pa.begin();
typename SpProxy<T1>::const_iterator_type a_end = pa.end();
typename SpProxy<T2>::const_iterator_type b_it = pb.begin();
typename SpProxy<T2>::const_iterator_type b_end = pb.end();
while((a_it != a_end) && (b_it != b_end))
{
if(a_it == b_it)
{
result += (*a_it) * (*b_it);
++a_it;
++b_it;
}
else if((a_it.col() < b_it.col()) || ((a_it.col() == b_it.col()) && (a_it.row() < b_it.row())))
{
// a_it is "behind"
++a_it;
}
else
{
// b_it is "behind"
++b_it;
}
}
return result;
}
}
//! dot product of two sparse objects
template<typename T1, typename T2>
arma_warn_unused
arma_hot
inline
typename
enable_if2
<(is_arma_sparse_type<T1>::value) && (is_arma_sparse_type<T2>::value) && (is_same_type<typename T1::elem_type, typename T2::elem_type>::value),
typename T1::elem_type
>::result
dot
(
const T1& x,
const T2& y
)
{
arma_extra_debug_sigprint();
const SpProxy<T1> pa(x);
const SpProxy<T2> pb(y);
arma_debug_assert_same_size(pa.get_n_rows(), pa.get_n_cols(), pb.get_n_rows(), pb.get_n_cols(), "dot()");
typedef typename T1::elem_type eT;
typedef typename SpProxy<T1>::stored_type pa_Q_type;
typedef typename SpProxy<T2>::stored_type pb_Q_type;
if(
( (SpProxy<T1>::must_use_iterator == false) && (SpProxy<T2>::must_use_iterator == false) )
&& ( (is_SpMat<pa_Q_type>::value == true ) && (is_SpMat<pb_Q_type>::value == true ) )
)
{
const unwrap_spmat<pa_Q_type> tmp_a(pa.Q);
const unwrap_spmat<pb_Q_type> tmp_b(pb.Q);
const SpMat<eT>& A = tmp_a.M;
const SpMat<eT>& B = tmp_b.M;
if( &A == &B )
{
// We can do it directly!
return op_dot::direct_dot_arma(A.n_nonzero, A.values, A.values);
}
else
{
return priv::dot_helper(pa,pb);
}
}
else
{
return priv::dot_helper(pa,pb);
}
}
//! dot product of one dense and one sparse object
template<typename T1, typename T2>
arma_warn_unused
arma_hot
inline
typename
enable_if2
<(is_arma_type<T1>::value) && (is_arma_sparse_type<T2>::value) && (is_same_type<typename T1::elem_type, typename T2::elem_type>::value),
typename T1::elem_type
>::result
dot
(
const T1& x,
const T2& y
)
{
arma_extra_debug_sigprint();
const Proxy<T1> pa(x);
const SpProxy<T2> pb(y);
arma_debug_assert_same_size(pa.get_n_rows(), pa.get_n_cols(), pb.get_n_rows(), pb.get_n_cols(), "dot()");
typedef typename T1::elem_type eT;
eT result = eT(0);
typename SpProxy<T2>::const_iterator_type it = pb.begin();
typename SpProxy<T2>::const_iterator_type it_end = pb.end();
// prefer_at_accessor won't save us operations
while(it != it_end)
{
result += (*it) * pa.at(it.row(), it.col());
++it;
}
return result;
}
//! dot product of one sparse and one dense object
template<typename T1, typename T2>
arma_warn_unused
arma_hot
inline
typename
enable_if2
<(is_arma_sparse_type<T1>::value) && (is_arma_type<T2>::value) && (is_same_type<typename T1::elem_type, typename T2::elem_type>::value),
typename T1::elem_type
>::result
dot
(
const T1& x,
const T2& y
)
{
arma_extra_debug_sigprint();
// this is commutative
return dot(y, x);
}
//! @}
|