Relintai/pmlpp
1
0
Fork 0
mirror of https://github.com/Relintai/pmlpp.git synced 2024-12-21 14:56:47 +01:00
Code Issues Packages Projects Releases Wiki Activity

Added vector based feature map get/set api to MLPPTensor3.

Browse Source
This commit is contained in:
Relintai 2023-04-23 11:09:46 +02:00
parent be0c2f11b5
commit b1d00a629f
1 changed files with 142 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

142
mlpp/lin_alg/mlpp_tensor3.h
View File

@ -403,6 +403,148 @@ public:
}
}
_FORCE_INLINE_ Vector<real_t> get_feature_map_vector(int p_index_z) {
ERR_FAIL_INDEX_V(p_index_z, _size.z, Vector<real_t>());
Vector<real_t> ret;
int fmds = feature_map_data_size();
if (unlikely(fmds == 0)) {
return ret;
}
ret.resize(fmds);
int ind_start = calculate_feature_map_index(p_index_z);
real_t *row_ptr = ret.ptrw();
for (int i = 0; i < fmds; ++i) {
row_ptr[i] = _data[ind_start + i];
}
return ret;
}
_FORCE_INLINE_ PoolRealArray get_feature_map_pool_vector(int p_index_z) {
ERR_FAIL_INDEX_V(p_index_z, _size.z, PoolRealArray());
PoolRealArray ret;
int fmds = feature_map_data_size();
if (unlikely(fmds == 0)) {
return ret;
}
ret.resize(fmds);
int ind_start = calculate_feature_map_index(p_index_z);
PoolRealArray::Write w = ret.write();
real_t *row_ptr = w.ptr();
for (int i = 0; i < fmds; ++i) {
row_ptr[i] = _data[ind_start + i];
}
return ret;
}
_FORCE_INLINE_ Ref<MLPPVector> get_feature_map_mlpp_vector(int p_index_z) {
ERR_FAIL_INDEX_V(p_index_z, _size.z, Ref<MLPPVector>());
Ref<MLPPVector> ret;
ret.instance();
int fmds = feature_map_data_size();
if (unlikely(fmds == 0)) {
return ret;
}
ret->resize(fmds);
int ind_start = calculate_feature_map_index(p_index_z);
real_t *row_ptr = ret->ptrw();
for (int i = 0; i < fmds; ++i) {
row_ptr[i] = _data[ind_start + i];
}
return ret;
}
_FORCE_INLINE_ void get_feature_map_into_mlpp_vector(int p_index_z, Ref<MLPPVector> target) const {
ERR_FAIL_INDEX(p_index_z, _size.z);
int fmds = feature_map_data_size();
if (unlikely(target->size() != fmds)) {
target->resize(fmds);
}
int ind_start = calculate_feature_map_index(p_index_z);
real_t *row_ptr = target->ptrw();
for (int i = 0; i < fmds; ++i) {
row_ptr[i] = _data[ind_start + i];
}
}
_FORCE_INLINE_ void set_feature_map_vector(int p_index_z, const Vector<real_t> &p_row) {
ERR_FAIL_INDEX(p_index_z, _size.z);
int fmds = feature_map_data_size();
ERR_FAIL_COND(p_row.size() != fmds);
int ind_start = calculate_feature_map_index(p_index_z);
const real_t *row_ptr = p_row.ptr();
for (int i = 0; i < fmds; ++i) {
_data[ind_start + i] = row_ptr[i];
}
}
_FORCE_INLINE_ void set_feature_map_pool_vector(int p_index_z, const PoolRealArray &p_row) {
ERR_FAIL_INDEX(p_index_z, _size.z);
int fmds = feature_map_data_size();
ERR_FAIL_COND(p_row.size() != fmds);
int ind_start = calculate_feature_map_index(p_index_z);
PoolRealArray::Read r = p_row.read();
const real_t *row_ptr = r.ptr();
for (int i = 0; i < fmds; ++i) {
_data[ind_start + i] = row_ptr[i];
}
}
_FORCE_INLINE_ void set_feature_map_mlpp_vector(int p_index_z, const Ref<MLPPVector> &p_row) {
ERR_FAIL_INDEX(p_index_z, _size.z);
ERR_FAIL_COND(!p_row.is_valid());
int fmds = feature_map_data_size();
ERR_FAIL_COND(p_row->size() != fmds);
int ind_start = calculate_feature_map_index(p_index_z);
const real_t *row_ptr = p_row->ptr();
for (int i = 0; i < fmds; ++i) {
_data[ind_start + i] = row_ptr[i];
}
}
void fill(real_t p_val) {
if (!_data) {
return;