184 lines
4.2 KiB
C++
184 lines
4.2 KiB
C++
// 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 glue_max
|
|
//! @{
|
|
|
|
|
|
|
|
template<typename T1, typename T2>
|
|
inline
|
|
void
|
|
glue_max::apply(Mat<typename T1::elem_type>& out, const Glue<T1, T2, glue_max>& X)
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
typedef typename T1::elem_type eT;
|
|
|
|
const Proxy<T1> PA(X.A);
|
|
const Proxy<T2> PB(X.B);
|
|
|
|
if( (PA.is_alias(out) && PA.has_subview) || (PB.is_alias(out) && PB.has_subview) )
|
|
{
|
|
Mat<eT> tmp;
|
|
|
|
glue_max::apply(tmp, PA, PB);
|
|
|
|
out.steal_mem(tmp);
|
|
}
|
|
else
|
|
{
|
|
glue_max::apply(out, PA, PB);
|
|
}
|
|
}
|
|
|
|
|
|
|
|
template<typename eT, typename T1, typename T2>
|
|
inline
|
|
void
|
|
glue_max::apply(Mat<eT>& out, const Proxy<T1>& PA, const Proxy<T2>& PB)
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
const uword n_rows = PA.get_n_rows();
|
|
const uword n_cols = PA.get_n_cols();
|
|
|
|
arma_debug_assert_same_size(n_rows, n_cols, PB.get_n_rows(), PB.get_n_cols(), "element-wise max()");
|
|
|
|
const arma_gt_comparator<eT> comparator;
|
|
|
|
out.set_size(n_rows, n_cols);
|
|
|
|
eT* out_mem = out.memptr();
|
|
|
|
if( (Proxy<T1>::use_at == false) && (Proxy<T2>::use_at == false) )
|
|
{
|
|
typename Proxy<T1>::ea_type A = PA.get_ea();
|
|
typename Proxy<T2>::ea_type B = PB.get_ea();
|
|
|
|
const uword N = PA.get_n_elem();
|
|
|
|
for(uword i=0; i<N; ++i)
|
|
{
|
|
const eT Ai = A[i];
|
|
const eT Bi = B[i];
|
|
|
|
out_mem[i] = comparator(Ai,Bi) ? Ai : Bi;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
for(uword col=0; col < n_cols; ++col)
|
|
for(uword row=0; row < n_rows; ++row)
|
|
{
|
|
const eT Ai = PA.at(row,col);
|
|
const eT Bi = PB.at(row,col);
|
|
|
|
*out_mem = comparator(Ai,Bi) ? Ai : Bi;
|
|
|
|
++out_mem;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
template<typename T1, typename T2>
|
|
inline
|
|
void
|
|
glue_max::apply(Cube<typename T1::elem_type>& out, const GlueCube<T1, T2, glue_max>& X)
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
typedef typename T1::elem_type eT;
|
|
|
|
const ProxyCube<T1> PA(X.A);
|
|
const ProxyCube<T2> PB(X.B);
|
|
|
|
if( (PA.is_alias(out) && PA.has_subview) || (PB.is_alias(out) && PB.has_subview) )
|
|
{
|
|
Cube<eT> tmp;
|
|
|
|
glue_max::apply(tmp, PA, PB);
|
|
|
|
out.steal_mem(tmp);
|
|
}
|
|
else
|
|
{
|
|
glue_max::apply(out, PA, PB);
|
|
}
|
|
}
|
|
|
|
|
|
|
|
template<typename eT, typename T1, typename T2>
|
|
inline
|
|
void
|
|
glue_max::apply(Cube<eT>& out, const ProxyCube<T1>& PA, const ProxyCube<T2>& PB)
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
const uword n_rows = PA.get_n_rows();
|
|
const uword n_cols = PA.get_n_cols();
|
|
const uword n_slices = PA.get_n_slices();
|
|
|
|
arma_debug_assert_same_size(n_rows, n_cols, n_slices, PB.get_n_rows(), PB.get_n_cols(), PB.get_n_slices(), "element-wise max()");
|
|
|
|
const arma_gt_comparator<eT> comparator;
|
|
|
|
out.set_size(n_rows, n_cols, n_slices);
|
|
|
|
eT* out_mem = out.memptr();
|
|
|
|
if( (ProxyCube<T1>::use_at == false) && (ProxyCube<T2>::use_at == false) )
|
|
{
|
|
typename ProxyCube<T1>::ea_type A = PA.get_ea();
|
|
typename ProxyCube<T2>::ea_type B = PB.get_ea();
|
|
|
|
const uword N = PA.get_n_elem();
|
|
|
|
for(uword i=0; i<N; ++i)
|
|
{
|
|
const eT Ai = A[i];
|
|
const eT Bi = B[i];
|
|
|
|
out_mem[i] = comparator(Ai,Bi) ? Ai : Bi;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
for(uword slice=0; slice < n_slices; ++slice)
|
|
for(uword col=0; col < n_cols; ++col )
|
|
for(uword row=0; row < n_rows; ++row )
|
|
{
|
|
const eT Ai = PA.at(row,col,slice);
|
|
const eT Bi = PB.at(row,col,slice);
|
|
|
|
*out_mem = comparator(Ai,Bi) ? Ai : Bi;
|
|
|
|
++out_mem;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
//! @}
|