autoarray.h
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #pragma once | ||
| 2 | |||
| 3 | #include "std-includes.h" | ||
| 4 | |||
| 5 | //Note: T must be a pointer type, or stuff will screw up. To make a pointer last longer than this object, assign nullptr to it and it won't free the old one. | ||
| 6 | template<typename T> class autoptr { | ||
| 7 | T ptr; | ||
| 8 | public: | ||
| 9 | 254041 | operator T() const | |
| 10 | { | ||
| 11 | 254041 | return ptr; | |
| 12 | } | ||
| 13 | |||
| 14 | 402 | autoptr& operator=(T ptr_) | |
| 15 | { | ||
| 16 | 402 | ptr = ptr_; | |
| 17 | 402 | return *this; | |
| 18 | } | ||
| 19 | |||
| 20 | 522 | autoptr() | |
| 21 | { | ||
| 22 | 522 | ptr = nullptr; | |
| 23 | 522 | } | |
| 24 | |||
| 25 | 80131 | autoptr(T ptr_) | |
| 26 | { | ||
| 27 | 80131 | ptr = ptr_; | |
| 28 | 80131 | } | |
| 29 | |||
| 30 | autoptr(const autoptr<T>& ptr_) | ||
| 31 | { | ||
| 32 | ptr = ptr_.ptr; | ||
| 33 | } | ||
| 34 | |||
| 35 | 80653 | ~autoptr() | |
| 36 | { | ||
| 37 | 80653 | if (ptr) free((void*)ptr); | |
| 38 | 80653 | } | |
| 39 | }; | ||
| 40 | |||
| 41 | template<typename T> class autoarray { | ||
| 42 | public: | ||
| 43 | int count; | ||
| 44 | |||
| 45 | private: | ||
| 46 | T* ptr; | ||
| 47 | int bufferlen; | ||
| 48 | |||
| 49 | T dummy; | ||
| 50 | static const int default_size = 128; | ||
| 51 | |||
| 52 | 14 | const T& getconst(int id) const | |
| 53 | { | ||
| 54 | 14 | if (id < 0) return dummy; | |
| 55 | 14 | if (id >= count) return dummy; | |
| 56 | 14 | return ptr[id]; | |
| 57 | } | ||
| 58 | |||
| 59 | 1770026 | T& get(int id) | |
| 60 | { | ||
| 61 | 1770026 | if (id < 0) return dummy; | |
| 62 | 1770026 | if (id >= bufferlen - 4) | |
| 63 | { | ||
| 64 | 293 | resize(id); | |
| 65 | } | ||
| 66 | 1770026 | if (id >= count) | |
| 67 | { | ||
| 68 | 39048 | for (int i = count;i <= id;i++) new(ptr + i) T(); | |
| 69 | 19471 | count = id + 1; | |
| 70 | } | ||
| 71 | 1770026 | return ptr[id]; | |
| 72 | } | ||
| 73 | |||
| 74 | 322 | void resize(int size) | |
| 75 | { | ||
| 76 | 322 | int oldlen = count; | |
| 77 | 644 | while (bufferlen <= size + 4) bufferlen *= 2; | |
| 78 | 322 | T *old = ptr; | |
| 79 | 322 | ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen); | |
| 80 | 25082 | for(int i = 0; i < oldlen; i++){ | |
| 81 | 24760 | new(ptr + i) T(); | |
| 82 | 24760 | ptr[i] = static_cast<T &&>(old[i]); | |
| 83 | } | ||
| 84 | 322 | free(old); | |
| 85 | 322 | memset((void*)(ptr + oldlen), 0, (size_t)(bufferlen - oldlen) * sizeof(T)); | |
| 86 | 322 | } | |
| 87 | |||
| 88 | public: | ||
| 89 | |||
| 90 | 11616 | void reset(int keep = 0) | |
| 91 | { | ||
| 92 | 11616 | if (keep >= count) return; | |
| 93 | 9897 | for (int i = keep;i < count;i++) ptr[i].~T(); | |
| 94 | 1630 | memset((void*)(ptr + keep), 0, (size_t)(count - keep) * sizeof(T)); | |
| 95 | 1630 | if (keep < bufferlen / 2) | |
| 96 | { | ||
| 97 | 2132 | while (keep < bufferlen / 2 && bufferlen>8) bufferlen /= 2; | |
| 98 | 1630 | T *old = ptr; | |
| 99 | 1630 | ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen); | |
| 100 | 1654 | for(int i = 0; i < keep; i++){ | |
| 101 | 24 | new(ptr + i) T(); | |
| 102 | 24 | ptr[i] = static_cast<T &&>(old[i]); | |
| 103 | } | ||
| 104 | 1630 | free(old); | |
| 105 | |||
| 106 | } | ||
| 107 | 1630 | count = keep; | |
| 108 | } | ||
| 109 | |||
| 110 | 1753539 | T& operator[](int id) | |
| 111 | { | ||
| 112 | 1753539 | return get(id); | |
| 113 | } | ||
| 114 | |||
| 115 | 14 | const T& operator[](int id) const | |
| 116 | { | ||
| 117 | 14 | return getconst(id); | |
| 118 | } | ||
| 119 | |||
| 120 | 826 | operator T*() | |
| 121 | { | ||
| 122 | 826 | return ptr; | |
| 123 | } | ||
| 124 | |||
| 125 | operator const T*() const | ||
| 126 | { | ||
| 127 | return ptr; | ||
| 128 | } | ||
| 129 | |||
| 130 | 16487 | T& append(const T& item) | |
| 131 | { | ||
| 132 | 16487 | return (get(count) = item); | |
| 133 | } | ||
| 134 | |||
| 135 | //insert is not safe for non pod types!!! | ||
| 136 | void insert(int pos) | ||
| 137 | { | ||
| 138 | if (pos<0 || pos>count) return; | ||
| 139 | if (count >= bufferlen - 4) | ||
| 140 | { | ||
| 141 | resize(count); | ||
| 142 | } | ||
| 143 | memmove(ptr + pos + 1, ptr + pos, sizeof(T)*(count - pos)); | ||
| 144 | memset((void*)(ptr + pos), 0, sizeof(T)); | ||
| 145 | new(ptr + pos) T(); | ||
| 146 | count++; | ||
| 147 | } | ||
| 148 | |||
| 149 | 138473 | void insert(int pos, const T& item) | |
| 150 | { | ||
| 151 | 138473 | if (pos<0 || pos>count) return; | |
| 152 | 138473 | if (count >= bufferlen - 4) | |
| 153 | { | ||
| 154 | 29 | resize(count); | |
| 155 | } | ||
| 156 | 138473 | memmove(ptr + pos + 1, ptr + pos, sizeof(T)*(size_t)(count - pos)); | |
| 157 | 138473 | memset((void*)(ptr + pos), 0, sizeof(T)); | |
| 158 | 138473 | new(ptr + pos) T(); | |
| 159 | 138473 | ptr[pos] = item; | |
| 160 | 138473 | count++; | |
| 161 | } | ||
| 162 | |||
| 163 | 138504 | void remove(int id) | |
| 164 | { | ||
| 165 | 138504 | if (id < 0 || id >= count) return; | |
| 166 | 138504 | count--; | |
| 167 | 138504 | ptr[id].~T(); | |
| 168 | 325267 | for(int i = id; i < count; i++){ | |
| 169 | 186763 | ptr[i] = static_cast<T &&>(ptr[i+1]); | |
| 170 | } | ||
| 171 | } | ||
| 172 | |||
| 173 | 2942 | autoarray() | |
| 174 | 1570 | { | |
| 175 | 2942 | ptr = (T*)malloc(sizeof(T) * default_size); | |
| 176 | 2942 | memset((void*)ptr, 0, default_size*sizeof(T)); | |
| 177 | 2942 | bufferlen = default_size; | |
| 178 | 2942 | count = 0; | |
| 179 | 2942 | } | |
| 180 | |||
| 181 | 2918 | ~autoarray() | |
| 182 | { | ||
| 183 | 14187 | for (int i = 0;i < count;i++) ptr[i].~T(); | |
| 184 | 2918 | free(ptr); | |
| 185 | 2918 | } | |
| 186 | }; | ||
| 187 |