// SPDX-License-Identifier: Apache-2.0 // // Copyright 2008-2016 Conrad Sanderson (http://conradsanderson.id.au) // Copyright 2008-2016 National ICT Australia (NICTA) // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // ------------------------------------------------------------------------ //! \addtogroup op_find //! @{ template<typename T1> inline uword op_find::helper ( Mat<uword>& indices, const Base<typename T1::elem_type, T1>& X ) { arma_debug_sigprint(); typedef typename T1::elem_type eT; const Proxy<T1> A(X.get_ref()); const uword n_elem = A.get_n_elem(); indices.set_size(n_elem, 1); uword* indices_mem = indices.memptr(); uword n_nz = 0; if(Proxy<T1>::use_at == false) { typename Proxy<T1>::ea_type PA = A.get_ea(); for(uword i=0; i<n_elem; ++i) { if(PA[i] != eT(0)) { indices_mem[n_nz] = i; ++n_nz; } } } else { const uword n_rows = A.get_n_rows(); const uword n_cols = A.get_n_cols(); uword i = 0; for(uword col=0; col < n_cols; ++col) for(uword row=0; row < n_rows; ++row) { if(A.at(row,col) != eT(0)) { indices_mem[n_nz] = i; ++n_nz; } ++i; } } return n_nz; } template<typename T1, typename op_type> inline uword op_find::helper ( Mat<uword>& indices, const mtOp<uword, T1, op_type>& X, const typename arma_op_rel_only<op_type>::result* junk1, const typename arma_not_cx<typename T1::elem_type>::result* junk2 ) { arma_debug_sigprint(); arma_ignore(junk1); arma_ignore(junk2); typedef typename T1::elem_type eT; const eT val = X.aux; if((is_same_type<op_type, op_rel_eq>::yes || is_same_type<op_type, op_rel_noteq>::yes) && arma_config::check_conform && arma_isnan(val)) { arma_warn(1, "find(): NaN is not equal to anything; suggest to use find_nonfinite() instead"); } const Proxy<T1> A(X.m); const uword n_elem = A.get_n_elem(); indices.set_size(n_elem, 1); uword* indices_mem = indices.memptr(); uword n_nz = 0; if(Proxy<T1>::use_at == false) { typename Proxy<T1>::ea_type PA = A.get_ea(); uword i,j; for(i=0, j=1; j < n_elem; i+=2, j+=2) { const eT tpi = PA[i]; const eT tpj = PA[j]; bool not_zero_i; bool not_zero_j; if(is_same_type<op_type, op_rel_lt_pre >::yes) { not_zero_i = (val < tpi); } else if(is_same_type<op_type, op_rel_lt_post >::yes) { not_zero_i = (tpi < val); } else if(is_same_type<op_type, op_rel_gt_pre >::yes) { not_zero_i = (val > tpi); } else if(is_same_type<op_type, op_rel_gt_post >::yes) { not_zero_i = (tpi > val); } else if(is_same_type<op_type, op_rel_lteq_pre >::yes) { not_zero_i = (val <= tpi); } else if(is_same_type<op_type, op_rel_lteq_post>::yes) { not_zero_i = (tpi <= val); } else if(is_same_type<op_type, op_rel_gteq_pre >::yes) { not_zero_i = (val >= tpi); } else if(is_same_type<op_type, op_rel_gteq_post>::yes) { not_zero_i = (tpi >= val); } else if(is_same_type<op_type, op_rel_eq >::yes) { not_zero_i = (tpi == val); } else if(is_same_type<op_type, op_rel_noteq >::yes) { not_zero_i = (tpi != val); } else { not_zero_i = false; } if(is_same_type<op_type, op_rel_lt_pre >::yes) { not_zero_j = (val < tpj); } else if(is_same_type<op_type, op_rel_lt_post >::yes) { not_zero_j = (tpj < val); } else if(is_same_type<op_type, op_rel_gt_pre >::yes) { not_zero_j = (val > tpj); } else if(is_same_type<op_type, op_rel_gt_post >::yes) { not_zero_j = (tpj > val); } else if(is_same_type<op_type, op_rel_lteq_pre >::yes) { not_zero_j = (val <= tpj); } else if(is_same_type<op_type, op_rel_lteq_post>::yes) { not_zero_j = (tpj <= val); } else if(is_same_type<op_type, op_rel_gteq_pre >::yes) { not_zero_j = (val >= tpj); } else if(is_same_type<op_type, op_rel_gteq_post>::yes) { not_zero_j = (tpj >= val); } else if(is_same_type<op_type, op_rel_eq >::yes) { not_zero_j = (tpj == val); } else if(is_same_type<op_type, op_rel_noteq >::yes) { not_zero_j = (tpj != val); } else { not_zero_j = false; } if(not_zero_i) { indices_mem[n_nz] = i; ++n_nz; } if(not_zero_j) { indices_mem[n_nz] = j; ++n_nz; } } if(i < n_elem) { bool not_zero; const eT tmp = PA[i]; if(is_same_type<op_type, op_rel_lt_pre >::yes) { not_zero = (val < tmp); } else if(is_same_type<op_type, op_rel_lt_post >::yes) { not_zero = (tmp < val); } else if(is_same_type<op_type, op_rel_gt_pre >::yes) { not_zero = (val > tmp); } else if(is_same_type<op_type, op_rel_gt_post >::yes) { not_zero = (tmp > val); } else if(is_same_type<op_type, op_rel_lteq_pre >::yes) { not_zero = (val <= tmp); } else if(is_same_type<op_type, op_rel_lteq_post>::yes) { not_zero = (tmp <= val); } else if(is_same_type<op_type, op_rel_gteq_pre >::yes) { not_zero = (val >= tmp); } else if(is_same_type<op_type, op_rel_gteq_post>::yes) { not_zero = (tmp >= val); } else if(is_same_type<op_type, op_rel_eq >::yes) { not_zero = (tmp == val); } else if(is_same_type<op_type, op_rel_noteq >::yes) { not_zero = (tmp != val); } else { not_zero = false; } if(not_zero) { indices_mem[n_nz] = i; ++n_nz; } } } else { const uword n_rows = A.get_n_rows(); const uword n_cols = A.get_n_cols(); uword i = 0; for(uword col=0; col < n_cols; ++col) for(uword row=0; row < n_rows; ++row) { const eT tmp = A.at(row,col); bool not_zero; if(is_same_type<op_type, op_rel_lt_pre >::yes) { not_zero = (val < tmp); } else if(is_same_type<op_type, op_rel_lt_post >::yes) { not_zero = (tmp < val); } else if(is_same_type<op_type, op_rel_gt_pre >::yes) { not_zero = (val > tmp); } else if(is_same_type<op_type, op_rel_gt_post >::yes) { not_zero = (tmp > val); } else if(is_same_type<op_type, op_rel_lteq_pre >::yes) { not_zero = (val <= tmp); } else if(is_same_type<op_type, op_rel_lteq_post>::yes) { not_zero = (tmp <= val); } else if(is_same_type<op_type, op_rel_gteq_pre >::yes) { not_zero = (val >= tmp); } else if(is_same_type<op_type, op_rel_gteq_post>::yes) { not_zero = (tmp >= val); } else if(is_same_type<op_type, op_rel_eq >::yes) { not_zero = (tmp == val); } else if(is_same_type<op_type, op_rel_noteq >::yes) { not_zero = (tmp != val); } else { not_zero = false; } if(not_zero) { indices_mem[n_nz] = i; ++n_nz; } ++i; } } return n_nz; } template<typename T1, typename op_type> inline uword op_find::helper ( Mat<uword>& indices, const mtOp<uword, T1, op_type>& X, const typename arma_op_rel_only<op_type>::result* junk1, const typename arma_cx_only<typename T1::elem_type>::result* junk2 ) { arma_debug_sigprint(); arma_ignore(junk1); arma_ignore(junk2); typedef typename T1::elem_type eT; typedef typename Proxy<T1>::ea_type ea_type; const eT val = X.aux; if((is_same_type<op_type, op_rel_eq>::yes || is_same_type<op_type, op_rel_noteq>::yes) && arma_config::check_conform && arma_isnan(val)) { arma_warn(1, "find(): NaN is not equal to anything; suggest to use find_nonfinite() instead"); } const Proxy<T1> A(X.m); const uword n_elem = A.get_n_elem(); indices.set_size(n_elem, 1); uword* indices_mem = indices.memptr(); uword n_nz = 0; if(Proxy<T1>::use_at == false) { ea_type PA = A.get_ea(); for(uword i=0; i<n_elem; ++i) { const eT tmp = PA[i]; bool not_zero; if(is_same_type<op_type, op_rel_eq >::yes) { not_zero = (tmp == val); } else if(is_same_type<op_type, op_rel_noteq>::yes) { not_zero = (tmp != val); } else { not_zero = false; } if(not_zero) { indices_mem[n_nz] = i; ++n_nz; } } } else { const uword n_rows = A.get_n_rows(); const uword n_cols = A.get_n_cols(); uword i = 0; for(uword col=0; col<n_cols; ++col) for(uword row=0; row<n_rows; ++row) { const eT tmp = A.at(row,col); bool not_zero; if(is_same_type<op_type, op_rel_eq >::yes) { not_zero = (tmp == val); } else if(is_same_type<op_type, op_rel_noteq>::yes) { not_zero = (tmp != val); } else { not_zero = false; } if(not_zero) { indices_mem[n_nz] = i; ++n_nz; } i++; } } return n_nz; } template<typename T1, typename T2, typename glue_type> inline uword op_find::helper ( Mat<uword>& indices, const mtGlue<uword, T1, T2, glue_type>& X, const typename arma_glue_rel_only<glue_type>::result* junk1, const typename arma_not_cx<typename T1::elem_type>::result* junk2, const typename arma_not_cx<typename T2::elem_type>::result* junk3 ) { arma_debug_sigprint(); arma_ignore(junk1); arma_ignore(junk2); arma_ignore(junk3); typedef typename T1::elem_type eT1; typedef typename T2::elem_type eT2; typedef typename Proxy<T1>::ea_type ea_type1; typedef typename Proxy<T2>::ea_type ea_type2; const Proxy<T1> A(X.A); const Proxy<T2> B(X.B); arma_conform_assert_same_size(A, B, "relational operator"); const uword n_elem = A.get_n_elem(); indices.set_size(n_elem, 1); uword* indices_mem = indices.memptr(); uword n_nz = 0; if((Proxy<T1>::use_at == false) && (Proxy<T2>::use_at == false)) { ea_type1 PA = A.get_ea(); ea_type2 PB = B.get_ea(); for(uword i=0; i<n_elem; ++i) { const eT1 tmp1 = PA[i]; const eT2 tmp2 = PB[i]; bool not_zero; if(is_same_type<glue_type, glue_rel_lt >::yes) { not_zero = (tmp1 < tmp2); } else if(is_same_type<glue_type, glue_rel_gt >::yes) { not_zero = (tmp1 > tmp2); } else if(is_same_type<glue_type, glue_rel_lteq >::yes) { not_zero = (tmp1 <= tmp2); } else if(is_same_type<glue_type, glue_rel_gteq >::yes) { not_zero = (tmp1 >= tmp2); } else if(is_same_type<glue_type, glue_rel_eq >::yes) { not_zero = (tmp1 == tmp2); } else if(is_same_type<glue_type, glue_rel_noteq >::yes) { not_zero = (tmp1 != tmp2); } else if(is_same_type<glue_type, glue_rel_and >::yes) { not_zero = (tmp1 && tmp2); } else if(is_same_type<glue_type, glue_rel_or >::yes) { not_zero = (tmp1 || tmp2); } else { not_zero = false; } if(not_zero) { indices_mem[n_nz] = i; ++n_nz; } } } else { const uword n_rows = A.get_n_rows(); const uword n_cols = A.get_n_cols(); uword i = 0; for(uword col=0; col < n_cols; ++col) for(uword row=0; row < n_rows; ++row) { const eT1 tmp1 = A.at(row,col); const eT2 tmp2 = B.at(row,col); bool not_zero; if(is_same_type<glue_type, glue_rel_lt >::yes) { not_zero = (tmp1 < tmp2); } else if(is_same_type<glue_type, glue_rel_gt >::yes) { not_zero = (tmp1 > tmp2); } else if(is_same_type<glue_type, glue_rel_lteq >::yes) { not_zero = (tmp1 <= tmp2); } else if(is_same_type<glue_type, glue_rel_gteq >::yes) { not_zero = (tmp1 >= tmp2); } else if(is_same_type<glue_type, glue_rel_eq >::yes) { not_zero = (tmp1 == tmp2); } else if(is_same_type<glue_type, glue_rel_noteq >::yes) { not_zero = (tmp1 != tmp2); } else if(is_same_type<glue_type, glue_rel_and >::yes) { not_zero = (tmp1 && tmp2); } else if(is_same_type<glue_type, glue_rel_or >::yes) { not_zero = (tmp1 || tmp2); } else { not_zero = false; } if(not_zero) { indices_mem[n_nz] = i; ++n_nz; } i++; } } return n_nz; } template<typename T1, typename T2, typename glue_type> inline uword op_find::helper ( Mat<uword>& indices, const mtGlue<uword, T1, T2, glue_type>& X, const typename arma_glue_rel_only<glue_type>::result* junk1, const typename arma_cx_only<typename T1::elem_type>::result* junk2, const typename arma_cx_only<typename T2::elem_type>::result* junk3 ) { arma_debug_sigprint(); arma_ignore(junk1); arma_ignore(junk2); arma_ignore(junk3); typedef typename Proxy<T1>::ea_type ea_type1; typedef typename Proxy<T2>::ea_type ea_type2; const Proxy<T1> A(X.A); const Proxy<T2> B(X.B); arma_conform_assert_same_size(A, B, "relational operator"); const uword n_elem = A.get_n_elem(); indices.set_size(n_elem, 1); uword* indices_mem = indices.memptr(); uword n_nz = 0; if((Proxy<T1>::use_at == false) && (Proxy<T2>::use_at == false)) { ea_type1 PA = A.get_ea(); ea_type2 PB = B.get_ea(); for(uword i=0; i<n_elem; ++i) { bool not_zero; if(is_same_type<glue_type, glue_rel_eq >::yes) { not_zero = (PA[i] == PB[i]); } else if(is_same_type<glue_type, glue_rel_noteq >::yes) { not_zero = (PA[i] != PB[i]); } else { not_zero = false; } if(not_zero) { indices_mem[n_nz] = i; ++n_nz; } } } else { const uword n_rows = A.get_n_rows(); const uword n_cols = A.get_n_cols(); uword i = 0; for(uword col=0; col<n_cols; ++col) for(uword row=0; row<n_rows; ++row) { bool not_zero; if(is_same_type<glue_type, glue_rel_eq >::yes) { not_zero = (A.at(row,col) == B.at(row,col)); } else if(is_same_type<glue_type, glue_rel_noteq >::yes) { not_zero = (A.at(row,col) != B.at(row,col)); } else { not_zero = false; } if(not_zero) { indices_mem[n_nz] = i; ++n_nz; } i++; } } return n_nz; } template<typename T1> inline void op_find::apply(Mat<uword>& out, const mtOp<uword, T1, op_find>& X) { arma_debug_sigprint(); const uword k = X.aux_uword_a; const uword type = X.aux_uword_b; Mat<uword> indices; const uword n_nz = op_find::helper(indices, X.m); if(n_nz > 0) { if(type == 0) // "first" { out = (k > 0 && k <= n_nz) ? indices.rows(0, k-1 ) : indices.rows(0, n_nz-1); } else // "last" { out = (k > 0 && k <= n_nz) ? indices.rows(n_nz-k, n_nz-1) : indices.rows(0, n_nz-1); } } else { out.set_size(0,1); // empty column vector } } // template<typename T1> inline void op_find_simple::apply(Mat<uword>& out, const mtOp<uword, T1, op_find_simple>& X) { arma_debug_sigprint(); Mat<uword> indices; const uword n_nz = op_find::helper(indices, X.m); out.steal_mem_col(indices, n_nz); } // template<typename T1> inline void op_find_finite::apply(Mat<uword>& out, const mtOp<uword, T1, op_find_finite>& X) { arma_debug_sigprint(); if(arma_config::fast_math_warn) { arma_warn(1, "find_finite(): detection of non-finite values is not reliable in fast math mode"); } const Proxy<T1> P(X.m); const uword n_elem = P.get_n_elem(); Mat<uword> indices(n_elem, 1, arma_nozeros_indicator()); uword* indices_mem = indices.memptr(); uword count = 0; if(Proxy<T1>::use_at == false) { const typename Proxy<T1>::ea_type Pea = P.get_ea(); for(uword i=0; i<n_elem; ++i) { if( arma_isfinite(Pea[i]) ) { indices_mem[count] = i; count++; } } } else { const uword n_rows = P.get_n_rows(); const uword n_cols = P.get_n_cols(); uword i = 0; for(uword col=0; col<n_cols; ++col) for(uword row=0; row<n_rows; ++row) { if( arma_isfinite(P.at(row,col)) ) { indices_mem[count] = i; count++; } i++; } } out.steal_mem_col(indices, count); } template<typename T1> inline void op_find_nonfinite::apply(Mat<uword>& out, const mtOp<uword, T1, op_find_nonfinite>& X) { arma_debug_sigprint(); if(arma_config::fast_math_warn) { arma_warn(1, "find_nonfinite(): detection of non-finite values is not reliable in fast math mode"); } const Proxy<T1> P(X.m); const uword n_elem = P.get_n_elem(); Mat<uword> indices(n_elem, 1, arma_nozeros_indicator()); uword* indices_mem = indices.memptr(); uword count = 0; if(Proxy<T1>::use_at == false) { const typename Proxy<T1>::ea_type Pea = P.get_ea(); for(uword i=0; i<n_elem; ++i) { if( arma_isfinite(Pea[i]) == false ) { indices_mem[count] = i; count++; } } } else { const uword n_rows = P.get_n_rows(); const uword n_cols = P.get_n_cols(); uword i = 0; for(uword col=0; col<n_cols; ++col) for(uword row=0; row<n_rows; ++row) { if( arma_isfinite(P.at(row,col)) == false ) { indices_mem[count] = i; count++; } i++; } } out.steal_mem_col(indices, count); } template<typename T1> inline void op_find_nan::apply(Mat<uword>& out, const mtOp<uword, T1, op_find_nan>& X) { arma_debug_sigprint(); if(arma_config::fast_math_warn) { arma_warn(1, "find_nan(): detection of non-finite values is not reliable in fast math mode"); } const Proxy<T1> P(X.m); const uword n_elem = P.get_n_elem(); Mat<uword> indices(n_elem, 1, arma_nozeros_indicator()); uword* indices_mem = indices.memptr(); uword count = 0; if(Proxy<T1>::use_at == false) { const typename Proxy<T1>::ea_type Pea = P.get_ea(); for(uword i=0; i<n_elem; ++i) { if( arma_isnan(Pea[i]) ) { indices_mem[count] = i; count++; } } } else { const uword n_rows = P.get_n_rows(); const uword n_cols = P.get_n_cols(); uword i = 0; for(uword col=0; col<n_cols; ++col) for(uword row=0; row<n_rows; ++row) { if( arma_isnan(P.at(row,col)) ) { indices_mem[count] = i; count++; } i++; } } out.steal_mem_col(indices, count); } //! @}