mirror of
				https://gitee.com/jiuyilian/embedded-framework.git
				synced 2025-10-24 18:20:15 -04:00 
			
		
		
		
	
		
			
				
	
	
		
			153 lines
		
	
	
		
			3.4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			153 lines
		
	
	
		
			3.4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| #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_
 | 
