base/array.h · C++项目/libhv

【升级通知】Gitee 将于 7 月 11 日晚 23 点进行全站升级维护

代码拉取完成,页面将自动刷新

richgiteeai

Watch

不关注关注所有动态仅关注版本发行动态关注但不提醒动态

1 Star 0 Fork 333

C++项目/libhv

forked from libhv/libhv

代码 Issues 0 Pull Requests 0 Wiki 统计流水线

服务

加入 Gitee

与超过 1400万开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)

免费加入

已有帐号? 立即登录

文件

master

分支 (6)

标签 (13)

管理

master

dev

kcptun

tfb

check_unicode

annotate

v1.3.3

v1.3.2

v1.3.1

v1.3.0

v1.2.6

v1.2.5

v1.2.4

v1.2.3

v1.2.2

v1.2.1

v1.1.1

v1.1.0

v1.0.0

克隆/下载

HTTPS SSH SVN SVN+SSH 下载ZIP

提示

下载代码请复制以下命令到终端执行

为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置

git config --global user.name userName 
git config --global user.email userEmail

初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置

1 生成 RSA 密钥

2 获取 RSA 公钥内容,并配置到 SSH公钥中

在 Gitee 上使用 SVN,请访问使用指南

使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议配置并使用私人令牌替代登录密码进行克隆、推送等操作

Username for 'https://gitee.com': userName

Password for 'https://userName@gitee.com': # 私人令牌

分支 6

标签 13

libhv

base

array.h

array.h 3.42 KB

#ifndef HV_ARRAY_H_
#define HV_ARRAY_H_

/*
 * array
 * at: random access by pos
 * @effective
 * push_back,pop_back,del_nomove,swap
 * @ineffective
 * add,del
 */

#include <assert.h> // for assert
#include <stddef.h> // for NULL
#include <stdlib.h> // for malloc,realloc,free
#include <string.h> // for memset,memmove

#include "hbase.h" // for HV_ALLOC, HV_FREE

#define ARRAY_INIT_SIZE 16

// #include <vector>
// typedef std::vector<type> atype;
#define ARRAY_DECL(type, atype) \
struct atype { \
 type* ptr; \
 size_t size; \
 size_t maxsize;\
}; \
typedef struct atype atype;\
\
static inline type* atype##_data(atype* p) {\
 return p->ptr;\
}\
\
static inline int atype##_size(atype* p) {\
 return p->size;\
}\
\
static inline int atype##_maxsize(atype* p) {\
 return p->maxsize;\
}\
\
static inline int atype##_empty(atype* p) {\
 return p->size == 0;\
}\
\
static inline type* atype##_at(atype* p, int pos) {\
 if (pos < 0) {\
 pos += p->size;\
 }\
 assert(pos >= 0 && pos < p->size);\
 return p->ptr + pos;\
}\
\
static inline type* atype##_front(atype* p) {\
 return p->size == 0 ? NULL : p->ptr;\
}\
\
static inline type* atype##_back(atype* p) {\
 return p->size == 0 ? NULL : p->ptr + p->size - 1;\
}\
\
static inline void atype##_init(atype* p, int maxsize) {\
 p->size = 0;\
 p->maxsize = maxsize;\
 HV_ALLOC(p->ptr, sizeof(type) * maxsize);\
}\
\
static inline void atype##_clear(atype* p) {\
 p->size = 0;\
 memset(p->ptr, 0, sizeof(type) * p->maxsize);\
}\
\
static inline void atype##_cleanup(atype* p) {\
 HV_FREE(p->ptr);\
 p->size = p->maxsize = 0;\
}\
\
static inline void atype##_resize(atype* p, int maxsize) {\
 if (maxsize == 0) maxsize = ARRAY_INIT_SIZE;\
 p->ptr = (type*)hv_realloc(p->ptr, sizeof(type) * maxsize, sizeof(type) * p->maxsize);\
 p->maxsize = maxsize;\
}\
\
static inline void atype##_double_resize(atype* p) {\
 atype##_resize(p, p->maxsize * 2);\
}\
\
static inline void atype##_push_back(atype* p, type* elem) {\
 if (p->size == p->maxsize) {\
 atype##_double_resize(p);\
 }\
 p->ptr[p->size] = *elem;\
 p->size++;\
}\
\
static inline void atype##_pop_back(atype* p) {\
 assert(p->size > 0);\
 p->size--;\
}\
\
static inline void atype##_add(atype* p, type* elem, int pos) {\
 if (pos < 0) {\
 pos += p->size;\
 }\
 assert(pos >= 0 && pos <= p->size);\
 if (p->size == p->maxsize) {\
 atype##_double_resize(p);\
 }\
 if (pos < p->size) {\
 memmove(p->ptr + pos+1, p->ptr + pos, sizeof(type) * (p->size - pos));\
 }\
 p->ptr[pos] = *elem;\
 p->size++;\
}\
\
static inline void atype##_del(atype* p, int pos) {\
 if (pos < 0) {\
 pos += p->size;\
 }\
 assert(pos >= 0 && pos < p->size);\
 p->size--;\
 if (pos < p->size) {\
 memmove(p->ptr + pos, p->ptr + pos+1, sizeof(type) * (p->size - pos));\
 }\
}\
\
static inline void atype##_del_nomove(atype* p, int pos) {\
 if (pos < 0) {\
 pos += p->size;\
 }\
 assert(pos >= 0 && pos < p->size);\
 p->size--;\
 if (pos < p->size) {\
 p->ptr[pos] = p->ptr[p->size];\
 }\
}\
\
static inline void atype##_swap(atype* p, int pos1, int pos2) {\
 if (pos1 < 0) {\
 pos1 += p->size;\
 }\
 if (pos2 < 0) {\
 pos2 += p->size;\
 }\
 type tmp = p->ptr[pos1];\
 p->ptr[pos1] = p->ptr[pos2];\
 p->ptr[pos2] = tmp;\
}\

#endif // HV_ARRAY_H_

一键复制编辑原始数据按行查看历史

ithewei 提交于 2022年03月28日 00:34 +08:00 . use prefix hv

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152

#ifndef HV_ARRAY_H_
#define HV_ARRAY_H_

/*
 * array
 * at: random access by pos
 * @effective
 * push_back,pop_back,del_nomove,swap
 * @ineffective
 * add,del
 */

#include <assert.h> // for assert
#include <stddef.h> // for NULL
#include <stdlib.h> // for malloc,realloc,free
#include <string.h> // for memset,memmove

#include "hbase.h" // for HV_ALLOC, HV_FREE

#define ARRAY_INIT_SIZE 16

// #include <vector>
// typedef std::vector<type> atype;
#define ARRAY_DECL(type, atype) \
struct atype { \
 type* ptr; \
 size_t size; \
 size_t maxsize;\
}; \
typedef struct atype atype;\
\
static inline type* atype##_data(atype* p) {\
 return p->ptr;\
}\
\
static inline int atype##_size(atype* p) {\
 return p->size;\
}\
\
static inline int atype##_maxsize(atype* p) {\
 return p->maxsize;\
}\
\
static inline int atype##_empty(atype* p) {\
 return p->size == 0;\
}\
\
static inline type* atype##_at(atype* p, int pos) {\
 if (pos < 0) {\
 pos += p->size;\
 }\
 assert(pos >= 0 && pos < p->size);\
 return p->ptr + pos;\
}\
\
static inline type* atype##_front(atype* p) {\
 return p->size == 0 ? NULL : p->ptr;\
}\
\
static inline type* atype##_back(atype* p) {\
 return p->size == 0 ? NULL : p->ptr + p->size - 1;\
}\
\
static inline void atype##_init(atype* p, int maxsize) {\
 p->size = 0;\
 p->maxsize = maxsize;\
 HV_ALLOC(p->ptr, sizeof(type) * maxsize);\
}\
\
static inline void atype##_clear(atype* p) {\
 p->size = 0;\
 memset(p->ptr, 0, sizeof(type) * p->maxsize);\
}\
\
static inline void atype##_cleanup(atype* p) {\
 HV_FREE(p->ptr);\
 p->size = p->maxsize = 0;\
}\
\
static inline void atype##_resize(atype* p, int maxsize) {\
 if (maxsize == 0) maxsize = ARRAY_INIT_SIZE;\
 p->ptr = (type*)hv_realloc(p->ptr, sizeof(type) * maxsize, sizeof(type) * p->maxsize);\
 p->maxsize = maxsize;\
}\
\
static inline void atype##_double_resize(atype* p) {\
 atype##_resize(p, p->maxsize * 2);\
}\
\
static inline void atype##_push_back(atype* p, type* elem) {\
 if (p->size == p->maxsize) {\
 atype##_double_resize(p);\
 }\
 p->ptr[p->size] = *elem;\
 p->size++;\
}\
\
static inline void atype##_pop_back(atype* p) {\
 assert(p->size > 0);\
 p->size--;\
}\
\
static inline void atype##_add(atype* p, type* elem, int pos) {\
 if (pos < 0) {\
 pos += p->size;\
 }\
 assert(pos >= 0 && pos <= p->size);\
 if (p->size == p->maxsize) {\
 atype##_double_resize(p);\
 }\
 if (pos < p->size) {\
 memmove(p->ptr + pos+1, p->ptr + pos, sizeof(type) * (p->size - pos));\
 }\
 p->ptr[pos] = *elem;\
 p->size++;\
}\
\
static inline void atype##_del(atype* p, int pos) {\
 if (pos < 0) {\
 pos += p->size;\
 }\
 assert(pos >= 0 && pos < p->size);\
 p->size--;\
 if (pos < p->size) {\
 memmove(p->ptr + pos, p->ptr + pos+1, sizeof(type) * (p->size - pos));\
 }\
}\
\
static inline void atype##_del_nomove(atype* p, int pos) {\
 if (pos < 0) {\
 pos += p->size;\
 }\
 assert(pos >= 0 && pos < p->size);\
 p->size--;\
 if (pos < p->size) {\
 p->ptr[pos] = p->ptr[p->size];\
 }\
}\
\
static inline void atype##_swap(atype* p, int pos1, int pos2) {\
 if (pos1 < 0) {\
 pos1 += p->size;\
 }\
 if (pos2 < 0) {\
 pos2 += p->size;\
 }\
 type tmp = p->ptr[pos1];\
 p->ptr[pos1] = p->ptr[pos2];\
 p->ptr[pos2] = tmp;\
}\

#endif // HV_ARRAY_H_