当前位置:网站首页>Numpy 的研究仿制 1
Numpy 的研究仿制 1
2022-06-29 15:34:00 【InfoQ】
struct _u_array {
char *start[2];
int axis_n;
};static size_t
__xd_coord_to_1d_offset(size_t coord[], size_t axes[], int axis_n) {
size_t offset = 0, axis_mulitply;
for (int i=0; i<axis_n; ++i) {
size_t co = coord[i];
axis_mulitply = __axis_mulitply(axes, axis_n, i+1);
offset += co * axis_mulitply;
}
return offset;
}static void
__1d_offset_to_xd_coord( size_t offset, size_t axes[], int axis_n, size_t coord[])
{
size_t div, mod, i, axis_mulitply, middle_value;
middle_value = offset;
for(i=0; i<axis_n-1; ++i) {
axis_mulitply = __axis_mulitply(axes, axis_n, i+1);
div = middle_value / axis_mulitply;
mod = middle_value % axis_mulitply;
coord[i] = div;
middle_value = mod;
}
coord[i] = mod;
return;
}- 初始化
/**
* 输入维度数量,例如 3 维
* 输入每一个维度,例如 [3, 3, 3]
*/
u_array_t UArray_create(int axis_n, size_t shape[])
{
if (axis_n >= 0) {
u_array_t n_array;
n_array.axis_n = axis_n;
start[0] = __alloc_shape(axis_n, shape);
start[1] = __alloc_data(__axis_mulitply(shape, axis_n, 0));
return n_array;
}
return ua_unable;
}- 加载数据
u_array_t* UArray_load(u_array_t* arr, vfloat_t data[])
{
size_t size_arr = UA_size(arr);
vfloat_t* ptr = UA_data_ptr(arr);
memcpy(ptr, data, size_arr);
return arr;
}- 访问数据
float UArray_get(u_array_t* arr, ...)
{
va_list valist;
va_start(valist, arr);
size_t coord[UA_axisn(arr)];
for (int i=0; i<UA_axisn(arr); ++i) {
coord[i] = va_arg(valist, size_t);
}
va_end(valist);
size_t offset = UA_cover_coordinate(arr, coord);
return ((float*)(UA_data_ptr(arr)))[offset];
}
void UArray_set(u_array_t* arr, ...)
{
va_list valist;
va_start(valist, arr);
size_t coord[UA_axisn(arr)];
vfloat_t value;
for (int i=0; i<UA_axisn(arr); ++i) {
coord[i] = va_arg(valist, size_t);
}
value = va_arg(valist, double);
va_end(valist);
size_t offset = UA_cover_coordinate(arr, coord);
((float*)(UA_data_ptr(arr)))[offset] = value;
return;
}int main()
{
// 定义一个 3 维的 ultra_array
u_array_t arr3 = UArray3d(2, 3, 4);
// 填入从 0 到 23 的数字。
UA_arange(&arr3, 2*3*4);
// 获取
float v = UA_get(&arr3, 1, 2, 3);
// v == 23
UA_set(&arr3, 1, 2, 3, 5.5);
v = UA_get(&arr3, 1, 2, 3);
// v == 5.5
return 0;
}边栏推荐
- three.js和高德地图结合引入obj格式模型-效果演示
- Swoole TCP distributed implementation
- Flink SQL任务TaskManager内存设置
- LeetCode-64-最小路径和
- SSL V**技术原理
- Middle order and post order traversal to construct binary tree [recursive partition interval and backtracking splicing subtree + similarity and difference between middle post order and middle pre orde
- CSDN无法复制问题
- C # learning 1: value type and reference type
- 微信公告号 图灵机器人实现智能回复
- MySQL development specification pdf
猜你喜欢

postgresql源码学习(24)—— 事务日志⑤-日志写入WAL Buffer

雷达基本组成

CVPR 2022 | 大幅减少零样本学习所需的人工标注,马普所和北邮提出富含视觉信息的类别语义嵌入

MySQL XA distributed transaction

架构实战营模块五作业

防范企业数据泄露,就用网络安全产品堡垒机!

Andorid Jetpack Hilt

LeetCode-64-最小路径和

About sql+nosql: newsql database

Business Intelligence BI and business management decision-making thinking No. 3: business quality analysis
随机推荐
Why MySQL chooses b+ tree to store indexes
SSL V**技术原理
NFT链游开发应用:2022年值得关注的6大NFT趋势
Kotlin annotation declaration and use
Training mode of deep learning network
微信公告号 图灵机器人实现智能回复
Flink SQL task taskmanager memory settings
kotlin 注解聲明與使用
MySQL为什么选择B+树存储索引
List集合详细讲解
stlink故障修复
Leetcode-470- implement rand10() with rand7()
极化SAR几种成像模式
JD health responded that it planned to acquire JD assets with us $355.4 million: related to pet health product category
复数卷积神经网络:CV-CNN
BFD principle and configuration
我想知道我在南宁,到哪里开户比较好?另外,手机开户安全么?
Leetcode notes: Weekly contest 299
攻防演练之战前扫雷:漏洞管理的5大措施
GWD:基于高斯Wasserstein距离的旋转目标检测 | ICML 2021