vector.h 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110
  1. #ifndef AL_VECTOR_H
  2. #define AL_VECTOR_H
  3. #include <stdlib.h>
  4. #include <AL/al.h>
  5. #include "almalloc.h"
  6. #define TYPEDEF_VECTOR(T, N) typedef struct { \
  7. size_t Capacity; \
  8. size_t Size; \
  9. T Data[]; \
  10. } _##N; \
  11. typedef _##N* N; \
  12. typedef const _##N* const_##N;
  13. #define VECTOR(T) struct { \
  14. size_t Capacity; \
  15. size_t Size; \
  16. T Data[]; \
  17. }*
  18. #define VECTOR_INIT(_x) do { (_x) = NULL; } while(0)
  19. #define VECTOR_INIT_STATIC() NULL
  20. #define VECTOR_DEINIT(_x) do { al_free((_x)); (_x) = NULL; } while(0)
  21. #define VECTOR_RESIZE(_x, _s, _c) do { \
  22. size_t _size = (_s); \
  23. size_t _cap = (_c); \
  24. if(_size > _cap) \
  25. _cap = _size; \
  26. \
  27. if(!(_x) && _cap == 0) \
  28. break; \
  29. \
  30. if(((_x) ? (_x)->Capacity : 0) < _cap) \
  31. { \
  32. size_t old_size = ((_x) ? (_x)->Size : 0); \
  33. void *temp; \
  34. \
  35. temp = al_calloc(16, sizeof(*(_x)) + sizeof((_x)->Data[0])*_cap); \
  36. assert(temp != NULL); \
  37. if((_x)) \
  38. memcpy(((ALubyte*)temp)+sizeof(*(_x)), (_x)->Data, \
  39. sizeof((_x)->Data[0])*old_size); \
  40. \
  41. al_free((_x)); \
  42. (_x) = temp; \
  43. (_x)->Capacity = _cap; \
  44. } \
  45. (_x)->Size = _size; \
  46. } while(0) \
  47. #define VECTOR_CAPACITY(_x) ((_x) ? (_x)->Capacity : 0)
  48. #define VECTOR_SIZE(_x) ((_x) ? (_x)->Size : 0)
  49. #define VECTOR_BEGIN(_x) ((_x) ? (_x)->Data + 0 : NULL)
  50. #define VECTOR_END(_x) ((_x) ? (_x)->Data + (_x)->Size : NULL)
  51. #define VECTOR_PUSH_BACK(_x, _obj) do { \
  52. size_t _pbsize = VECTOR_SIZE(_x)+1; \
  53. VECTOR_RESIZE(_x, _pbsize, _pbsize); \
  54. (_x)->Data[(_x)->Size-1] = (_obj); \
  55. } while(0)
  56. #define VECTOR_POP_BACK(_x) ((void)((_x)->Size--))
  57. #define VECTOR_BACK(_x) ((_x)->Data[(_x)->Size-1])
  58. #define VECTOR_FRONT(_x) ((_x)->Data[0])
  59. #define VECTOR_ELEM(_x, _o) ((_x)->Data[(_o)])
  60. #define VECTOR_FOR_EACH(_t, _x, _f) do { \
  61. _t *_iter = VECTOR_BEGIN((_x)); \
  62. _t *_end = VECTOR_END((_x)); \
  63. for(;_iter != _end;++_iter) \
  64. _f(_iter); \
  65. } while(0)
  66. #define VECTOR_FOR_EACH_PARAMS(_t, _x, _f, ...) do { \
  67. _t *_iter = VECTOR_BEGIN((_x)); \
  68. _t *_end = VECTOR_END((_x)); \
  69. for(;_iter != _end;++_iter) \
  70. _f(__VA_ARGS__, _iter); \
  71. } while(0)
  72. #define VECTOR_FIND_IF(_i, _t, _x, _f) do { \
  73. _t *_iter = VECTOR_BEGIN((_x)); \
  74. _t *_end = VECTOR_END((_x)); \
  75. for(;_iter != _end;++_iter) \
  76. { \
  77. if(_f(_iter)) \
  78. break; \
  79. } \
  80. (_i) = _iter; \
  81. } while(0)
  82. #define VECTOR_FIND_IF_PARMS(_i, _t, _x, _f, ...) do { \
  83. _t *_iter = VECTOR_BEGIN((_x)); \
  84. _t *_end = VECTOR_END((_x)); \
  85. for(;_iter != _end;++_iter) \
  86. { \
  87. if(_f(__VA_ARGS__, _iter)) \
  88. break; \
  89. } \
  90. (_i) = _iter; \
  91. } while(0)
  92. #endif /* AL_VECTOR_H */