|
max@0
|
1 // Copyright (C) 2008-2011 NICTA (www.nicta.com.au)
|
|
max@0
|
2 // Copyright (C) 2008-2011 Conrad Sanderson
|
|
max@0
|
3 //
|
|
max@0
|
4 // This file is part of the Armadillo C++ library.
|
|
max@0
|
5 // It is provided without any warranty of fitness
|
|
max@0
|
6 // for any purpose. You can redistribute this file
|
|
max@0
|
7 // and/or modify it under the terms of the GNU
|
|
max@0
|
8 // Lesser General Public License (LGPL) as published
|
|
max@0
|
9 // by the Free Software Foundation, either version 3
|
|
max@0
|
10 // of the License or (at your option) any later version.
|
|
max@0
|
11 // (see http://www.opensource.org/licenses for more info)
|
|
max@0
|
12
|
|
max@0
|
13
|
|
max@0
|
14 //! \addtogroup op_min
|
|
max@0
|
15 //! @{
|
|
max@0
|
16
|
|
max@0
|
17
|
|
max@0
|
18 //! Class for finding minimum values in a matrix
|
|
max@0
|
19 class op_min
|
|
max@0
|
20 {
|
|
max@0
|
21 public:
|
|
max@0
|
22
|
|
max@0
|
23 template<typename eT>
|
|
max@0
|
24 inline static eT direct_min(const eT* const X, const uword N);
|
|
max@0
|
25
|
|
max@0
|
26 template<typename eT>
|
|
max@0
|
27 inline static eT direct_min(const eT* const X, const uword N, uword& index_of_min_val);
|
|
max@0
|
28
|
|
max@0
|
29 template<typename eT>
|
|
max@0
|
30 inline static eT direct_min(const Mat<eT>& X, const uword row);
|
|
max@0
|
31
|
|
max@0
|
32 template<typename eT>
|
|
max@0
|
33 inline static eT direct_min(const subview<eT>& X);
|
|
max@0
|
34
|
|
max@0
|
35 template<typename eT>
|
|
max@0
|
36 inline static eT direct_min(const diagview<eT>& X);
|
|
max@0
|
37
|
|
max@0
|
38 template<typename T1>
|
|
max@0
|
39 inline static void apply(Mat<typename T1::elem_type>& out, const Op<T1,op_min>& in);
|
|
max@0
|
40
|
|
max@0
|
41
|
|
max@0
|
42 //
|
|
max@0
|
43 // for complex numbers
|
|
max@0
|
44
|
|
max@0
|
45 template<typename T>
|
|
max@0
|
46 inline static std::complex<T> direct_min(const std::complex<T>* const X, const uword n_elem);
|
|
max@0
|
47
|
|
max@0
|
48 template<typename T>
|
|
max@0
|
49 inline static std::complex<T> direct_min(const std::complex<T>* const X, const uword n_elem, uword& index_of_min_val);
|
|
max@0
|
50
|
|
max@0
|
51 template<typename T>
|
|
max@0
|
52 inline static std::complex<T> direct_min(const Mat< std::complex<T> >& X, const uword row);
|
|
max@0
|
53
|
|
max@0
|
54 template<typename T>
|
|
max@0
|
55 inline static std::complex<T> direct_min(const subview< std::complex<T> >&X);
|
|
max@0
|
56
|
|
max@0
|
57 template<typename T>
|
|
max@0
|
58 inline static std::complex<T> direct_min(const diagview< std::complex<T> >&X);
|
|
max@0
|
59
|
|
max@0
|
60 };
|
|
max@0
|
61
|
|
max@0
|
62 //! @}
|
