// Copyright (C) 2008-2016 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
// Written by Ryan Curtin
//! \addtogroup Mat
//! @{
template<typename eT>
inline
Mat<eT>::~Mat()
{
arma_extra_debug_sigprint_this(this);
if( (mem_state == 0) && (n_elem > arma_config::mat_prealloc) )
{
memory::release( access::rw(mem) );
}
if(arma_config::debug == true)
{
// try to expose buggy user code that accesses deleted objects
access::rw(mem) = 0;
}
arma_type_check(( is_supported_elem_type<eT>::value == false ));
}
template<typename eT>
inline
Mat<eT>::Mat()
: n_rows(0)
, n_cols(0)
, n_elem(0)
, vec_state(0)
, mem_state(0)
, mem()
{
arma_extra_debug_sigprint_this(this);
}
//! construct the matrix to have user specified dimensions
template<typename eT>
inline
Mat<eT>::Mat(const uword in_n_rows, const uword in_n_cols)
: n_rows(in_n_rows)
, n_cols(in_n_cols)
, n_elem(in_n_rows*in_n_cols)
, vec_state(0)
, mem_state(0)
, mem()
{
arma_extra_debug_sigprint_this(this);
init_cold();
}
template<typename eT>
inline
Mat<eT>::Mat(const SizeMat& s)
: n_rows(s.n_rows)
, n_cols(s.n_cols)
, n_elem(s.n_rows*s.n_cols)
, vec_state(0)
, mem_state(0)
, mem()
{
arma_extra_debug_sigprint_this(this);
init_cold();
}
//! construct the matrix to have user specified dimensions and fill with specified pattern
template<typename eT>
template<typename fill_type>
inline
Mat<eT>::Mat(const uword in_n_rows, const uword in_n_cols, const fill::fill_class<fill_type>& f)
: n_rows(in_n_rows)
, n_cols(in_n_cols)
, n_elem(in_n_rows*in_n_cols)
, vec_state(0)
, mem_state(0)
, mem()
{
arma_extra_debug_sigprint_this(this);
init_cold();
(*this).fill(f);
}
template<typename eT>
template<typename fill_type>
inline
Mat<eT>::Mat(const SizeMat& s, const fill::fill_class<fill_type>& f)
: n_rows(s.n_rows)
, n_cols(s.n_cols)
, n_elem(s.n_rows*s.n_cols)
, vec_state(0)
, mem_state(0)
, mem()
{
arma_extra_debug_sigprint_this(this);
init_cold();
(*this).fill(f);
}
//! constructor used by Row and Col classes
template<typename eT>
inline
Mat<eT>::Mat(const arma_vec_indicator&, const uhword in_vec_state)
: n_rows( (in_vec_state == 2) ? 1 : 0 )
, n_cols( (in_vec_state == 1) ? 1 : 0 )
, n_elem(0)
, vec_state(in_vec_state)
, mem_state(0)
, mem()
{
arma_extra_debug_sigprint_this(this);
}
//! constructor used by Row and Col classes
template<typename eT>
inline
Mat<eT>::Mat(const arma_vec_indicator&, const uword in_n_rows, const uword in_n_cols, const uhword in_vec_state)
: n_rows(in_n_rows)
, n_cols(in_n_cols)
, n_elem(in_n_rows*in_n_cols)
, vec_state(in_vec_state)
, mem_state(0)
, mem()
{
arma_extra_debug_sigprint_this(this);
init_cold();
}
template<typename eT>
inline
Mat<eT>::Mat(const arma_fixed_indicator&, const uword in_n_rows, const uword in_n_cols, const uhword in_vec_state, const eT* in_mem)
: n_rows (in_n_rows)
, n_cols (in_n_cols)
, n_elem (in_n_rows*in_n_cols)
, vec_state (in_vec_state)
, mem_state (3)
, mem (in_mem)
{
arma_extra_debug_sigprint_this(this);
}
template<typename eT>
inline
void
Mat<eT>::init_cold()
{
arma_extra_debug_sigprint( arma_str::format("n_rows = %d, n_cols = %d") % n_rows % n_cols );
// ensure that n_elem can hold the result of (n_rows * n_cols)
#if (defined(ARMA_USE_CXX11) || defined(ARMA_64BIT_WORD))
const char* error_message = "Mat::init(): requested size is too large";
#else
const char* error_message = "Mat::init(): requested size is too large; suggest to compile in C++11 mode or enable ARMA_64BIT_WORD";
#endif
arma_debug_check
(
(
( (n_rows > ARMA_MAX_UHWORD) || (n_cols > ARMA_MAX_UHWORD) )
? ( (double(n_rows) * double(n_cols)) > double(ARMA_MAX_UWORD) )
: false
),
error_message
);
if(n_elem <= arma_config::mat_prealloc)
{
if(n_elem == 0)
{
access::rw(mem) = NULL;
}
else
{
arma_extra_debug_print("Mat::init(): using local memory");
access::rw(mem) = mem_local;
}
}
else
{
arma_extra_debug_print("Mat::init(): acquiring memory");
access::rw(mem) = memory::acquire<eT>(n_elem);
}
}
template<typename eT>
inline
void
Mat<eT>::init_warm(uword in_n_rows, uword in_n_cols)
{
arma_extra_debug_sigprint( arma_str::format("in_n_rows = %d, in_n_cols = %d") % in_n_rows % in_n_cols );
if( (n_rows == in_n_rows) && (n_cols == in_n_cols) ) { return; }
bool err_state = false;
char* err_msg = 0;
const uhword t_vec_state = vec_state;
const uhword t_mem_state = mem_state;
arma_debug_set_error( err_state, err_msg, (t_mem_state == 3), "Mat::init(): size is fixed and hence cannot be changed" );
if(t_vec_state > 0)
{
if( (in_n_rows == 0) && (in_n_cols == 0) )
{
if(t_vec_state == 1) { in_n_cols = 1; }
if(t_vec_state == 2) { in_n_rows = 1; }
}
else
{
if(t_vec_state == 1) { arma_debug_set_error( err_state, err_msg, (in_n_cols != 1), "Mat::init(): requested size is not compatible with column vector layout" ); }
if(t_vec_state == 2) { arma_debug_set_error( err_state, err_msg, (in_n_rows != 1), "Mat::init(): requested size is not compatible with row vector layout" ); }
}
}
// ensure that n_elem can hold the result of (n_rows * n_cols)
#if (defined(ARMA_USE_CXX11) || defined(ARMA_64BIT_WORD))
const char* error_message = "Mat::init(): requested size is too large";
#else
const char* error_message = "Mat::init(): requested size is too large; suggest to compile in C++11 mode or enable ARMA_64BIT_WORD";
#endif
arma_debug_set_error
(
err_state,
err_msg,
(
( (in_n_rows > ARMA_MAX_UHWORD) || (in_n_cols > ARMA_MAX_UHWORD) )
? ( (double(in_n_rows) * double(in_n_cols)) > double(ARMA_MAX_UWORD) )
: false
),
error_message
);
arma_debug_check(err_state, err_msg);
const uword old_n_elem = n_elem;
const uword new_n_elem = in_n_rows * in_n_cols;
if(old_n_elem == new_n_elem)
{
arma_extra_debug_print("Mat::init(): reusing memory");
access::rw(n_rows) = in_n_rows;
access::rw(n_cols) = in_n_cols;
}
else // condition: old_n_elem != new_n_elem
{
arma_debug_check( (t_mem_state == 2), "Mat::init(): mismatch between size of auxiliary memory and requested size" );
if(new_n_elem < old_n_elem) // reuse existing memory if possible
{
if( (t_mem_state == 0) && (new_n_elem <= arma_config::mat_prealloc) )
{
if(old_n_elem > arma_config::mat_prealloc)
{
arma_extra_debug_print("Mat::init(): releasing memory");
memory::release( access::rw(mem) );
}
if(new_n_elem == 0)
{
access::rw(mem) = NULL;
}
else
{
arma_extra_debug_print("Mat::init(): using local memory");
access::rw(mem) = mem_local;
}
}
else
{
arma_extra_debug_print("Mat::init(): reusing memory");
}
}
else // condition: new_n_elem > old_n_elem
{
if( (t_mem_state == 0) && (old_n_elem > arma_config::mat_prealloc) )
{
arma_extra_debug_print("Mat::init(): releasing memory");
memory::release( access::rw(mem) );
}
if(new_n_elem <= arma_config::mat_prealloc)
{
arma_extra_debug_print("Mat::init(): using local memory");
access::rw(mem) = mem_loc
Armadillo线代矩阵运算库在QT中配置和使用 （493个子文件） 
libopenblas.a 28.04MB armadillo 24KB config.hpp.cmake 8KB libopenblas.dll 24.02MB
Armadillo使用说明.docx 51KB Mat_meat.hpp 176KB auxlib_meat.hpp 120KB SpMat_meat.hpp 117KB Cube_meat.hpp 102KB diskio_meat.hpp 100KB subview_meat.hpp 81KB Proxy.hpp 67KB field_meat.hpp 60KB unwrap.hpp 59KB subview_cube_meat.hpp 54KB gmm_diag_meat.hpp 52KB sp_auxlib_meat.hpp 45KB Mat_bones.hpp 38KB wrapper_lapack.hpp 37KB SpSubview_meat.hpp 36KB Col_meat.hpp 35KB Row_meat.hpp 33KB traits.hpp 32KB eglue_core_meat.hpp 31KB def_lapack.hpp 30KB glue_times_meat.hpp 30KB debug.hpp 30KB subview_each_meat.hpp 29KB SpMat_bones.hpp 28KB op_min_meat.hpp 26KB op_max_meat.hpp 26KB SpSubview_iterators_meat.hpp 24KB Cube_bones.hpp 23KB eop_core_meat.hpp 22KB subview_elem1_meat.hpp 22KB subview_cube_each_meat.hpp 22KB diagview_meat.hpp 21KB op_norm_meat.hpp 19KB spdiagview_meat.hpp 19KB fn_elem.hpp 19KB subview_elem2_meat.hpp 18KB arma_ostream_meat.hpp 18KB SpMat_iterators_meat.hpp 18KB hdf5_misc.hpp 18KB eop_aux.hpp 18KB arrayops_meat.hpp 17KB op_strans_meat.hpp 17KB ProxyCube.hpp 16KB SpProxy.hpp 16KB spop_min_meat.hpp 16KB fn_conv_to.hpp 15KB field_bones.hpp 15KB op_princomp_meat.hpp 15KB diagmat_proxy.hpp 15KB spop_max_meat.hpp 15KB op_find_meat.hpp 15KB SpSubview_bones.hpp 15KB subview_bones.hpp 14KB promote_type.hpp 14KB glue_mixed_meat.hpp 14KB fn_approx_equal.hpp 14KB op_mean_meat.hpp 13KB running_stat_vec_meat.hpp 13KB compiler_setup.hpp 13KB fn_misc.hpp 13KB mul_herk.hpp 13KB subview_field_meat.hpp 13KB op_dot_meat.hpp 13KB mul_gemv.hpp 12KB mul_gemm.hpp 12KB mul_syrk.hpp 12KB mul_gemm_mixed.hpp 12KB op_cx_scalar_meat.hpp 12KB operator_times.hpp 11KB fn_as_scalar.hpp 11KB op_htrans_meat.hpp 11KB diskio_bones.hpp 11KB newarp_SymEigsSolver_meat.hpp 11KB newarp_GenEigsSolver_meat.hpp 11KB arma_cmath.hpp 11KB auxlib_bones.hpp 11KB op_all_meat.hpp 11KB op_median_meat.hpp 11KB fft_engine.hpp 10KB injector_meat.hpp 10KB fn_accu.hpp 10KB arma_str.hpp 10KB wrapper_atlas.hpp 10KB constants.hpp 10KB op_any_meat.hpp 10KB op_relational_meat.hpp 10KB include_superlu.hpp 9KB restrictors.hpp 9KB Col_bones.hpp 9KB op_logmat_meat.hpp 9KB Row_bones.hpp 9KB spop_var_meat.hpp 9KB newarp_DoubleShiftQR_meat.hpp 9KB SpRow_meat.hpp 9KB fn_svds.hpp 9KB共 493 条
- 1
- 2
- 3
- 4
- 5
资源评论
只道是寻常百姓家
- 粉丝: 0
- 资源: 1
最新资源
- AllSort(直接插入排序，希尔排序，选择排序，堆排序，冒泡排序，快速排序，归并排序)
- 模拟qsort,改造冒泡排序使其能排序任意数据类型，即日常练习
- 数组经典习题之顺序排序和二分查找和冒泡排序
- 基于 Oops Framework 提供的游戏项目开发模板，项目中提供了最新版本 Cocos Creator 3.x 插件与游戏资源初始化通用逻辑
- live-ai这是一个深度学习的资料
- FeiQ.rar 局域网内通信服务软件
- 172.16.100.195
- 光储并网simulink仿真模型，直流微电网 光伏系统采用扰动观察法是实现mppt控制，储能可由单独蓄电池构成，也可由蓄电池和超级电容构成的混合储能系统，并采用lpf进行功率分配 并网采用pq控制
- python编写微信读取smart200plc的数据发送给微信联系人
- 光储并网VSG系统Matlab simulink仿真模型，附参考文献 系统前级直流部分包括光伏阵列、变器、储能系统和双向dcdc变器，后级交流子系统包括逆变器LC滤波器，交流负载 光储并网VSG系
资源上传下载、课程学习等过程中有任何疑问或建议，欢迎提出宝贵意见哦~我们会及时处理！
点击此处反馈
