190 lines
4.2 KiB
C++
190 lines
4.2 KiB
C++
// Copyright (C) 2010-2015 National ICT Australia (NICTA)
|
|
//
|
|
// 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/.
|
|
// -------------------------------------------------------------------
|
|
//
|
|
// Written by Conrad Sanderson - http://conradsanderson.id.au
|
|
|
|
|
|
//! \addtogroup glue_join
|
|
//! @{
|
|
|
|
|
|
|
|
template<typename T1, typename T2>
|
|
inline
|
|
void
|
|
glue_join_cols::apply_noalias(Mat<typename T1::elem_type>& out, const Proxy<T1>& A, const Proxy<T2>& B)
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
const uword A_n_rows = A.get_n_rows();
|
|
const uword A_n_cols = A.get_n_cols();
|
|
|
|
const uword B_n_rows = B.get_n_rows();
|
|
const uword B_n_cols = B.get_n_cols();
|
|
|
|
arma_debug_check
|
|
(
|
|
( (A_n_cols != B_n_cols) && ( (A_n_rows > 0) || (A_n_cols > 0) ) && ( (B_n_rows > 0) || (B_n_cols > 0) ) ),
|
|
"join_cols() / join_vert(): number of columns must be the same"
|
|
);
|
|
|
|
out.set_size( A_n_rows + B_n_rows, (std::max)(A_n_cols, B_n_cols) );
|
|
|
|
if( out.n_elem > 0 )
|
|
{
|
|
if(A.get_n_elem() > 0)
|
|
{
|
|
out.submat(0, 0, A_n_rows-1, out.n_cols-1) = A.Q;
|
|
}
|
|
|
|
if(B.get_n_elem() > 0)
|
|
{
|
|
out.submat(A_n_rows, 0, out.n_rows-1, out.n_cols-1) = B.Q;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
template<typename T1, typename T2>
|
|
inline
|
|
void
|
|
glue_join_cols::apply(Mat<typename T1::elem_type>& out, const Glue<T1,T2,glue_join_cols>& X)
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
typedef typename T1::elem_type eT;
|
|
|
|
const Proxy<T1> A(X.A);
|
|
const Proxy<T2> B(X.B);
|
|
|
|
if( (A.is_alias(out) == false) && (B.is_alias(out) == false) )
|
|
{
|
|
glue_join_cols::apply_noalias(out, A, B);
|
|
}
|
|
else
|
|
{
|
|
Mat<eT> tmp;
|
|
|
|
glue_join_cols::apply_noalias(tmp, A, B);
|
|
|
|
out.steal_mem(tmp);
|
|
}
|
|
}
|
|
|
|
|
|
|
|
template<typename T1, typename T2>
|
|
inline
|
|
void
|
|
glue_join_rows::apply_noalias(Mat<typename T1::elem_type>& out, const Proxy<T1>& A, const Proxy<T2>& B)
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
const uword A_n_rows = A.get_n_rows();
|
|
const uword A_n_cols = A.get_n_cols();
|
|
|
|
const uword B_n_rows = B.get_n_rows();
|
|
const uword B_n_cols = B.get_n_cols();
|
|
|
|
arma_debug_check
|
|
(
|
|
( (A_n_rows != B_n_rows) && ( (A_n_rows > 0) || (A_n_cols > 0) ) && ( (B_n_rows > 0) || (B_n_cols > 0) ) ),
|
|
"join_rows() / join_horiz(): number of rows must be the same"
|
|
);
|
|
|
|
out.set_size( (std::max)(A_n_rows, B_n_rows), A_n_cols + B_n_cols );
|
|
|
|
if( out.n_elem > 0 )
|
|
{
|
|
if(A.get_n_elem() > 0)
|
|
{
|
|
out.submat(0, 0, out.n_rows-1, A_n_cols-1) = A.Q;
|
|
}
|
|
|
|
if(B.get_n_elem() > 0)
|
|
{
|
|
out.submat(0, A_n_cols, out.n_rows-1, out.n_cols-1) = B.Q;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
template<typename T1, typename T2>
|
|
inline
|
|
void
|
|
glue_join_rows::apply(Mat<typename T1::elem_type>& out, const Glue<T1,T2,glue_join_rows>& X)
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
typedef typename T1::elem_type eT;
|
|
|
|
const Proxy<T1> A(X.A);
|
|
const Proxy<T2> B(X.B);
|
|
|
|
if( (A.is_alias(out) == false) && (B.is_alias(out) == false) )
|
|
{
|
|
glue_join_rows::apply_noalias(out, A, B);
|
|
}
|
|
else
|
|
{
|
|
Mat<eT> tmp;
|
|
|
|
glue_join_rows::apply_noalias(tmp, A, B);
|
|
|
|
out.steal_mem(tmp);
|
|
}
|
|
}
|
|
|
|
|
|
|
|
template<typename T1, typename T2>
|
|
inline
|
|
void
|
|
glue_join_slices::apply(Cube<typename T1::elem_type>& out, const GlueCube<T1,T2,glue_join_slices>& X)
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
typedef typename T1::elem_type eT;
|
|
|
|
const unwrap_cube<T1> A_tmp(X.A);
|
|
const unwrap_cube<T2> B_tmp(X.B);
|
|
|
|
const Cube<eT>& A = A_tmp.M;
|
|
const Cube<eT>& B = B_tmp.M;
|
|
|
|
if(A.n_elem == 0) { out = B; return; }
|
|
if(B.n_elem == 0) { out = A; return; }
|
|
|
|
arma_debug_check( ( (A.n_rows != B.n_rows) || (A.n_cols != B.n_cols) ), "join_slices(): size of slices must be the same" );
|
|
|
|
if( (&out != &A) && (&out != &B) )
|
|
{
|
|
out.set_size(A.n_rows, A.n_cols, A.n_slices + B.n_slices);
|
|
|
|
out.slices(0, A.n_slices-1 ) = A;
|
|
out.slices(A.n_slices, out.n_slices-1) = B;
|
|
}
|
|
else // we have aliasing
|
|
{
|
|
Cube<eT> C(A.n_rows, A.n_cols, A.n_slices + B.n_slices);
|
|
|
|
C.slices(0, A.n_slices-1) = A;
|
|
C.slices(A.n_slices, C.n_slices-1) = B;
|
|
|
|
out.steal_mem(C);
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//! @}
|