| File: | daq/rawdata/tools/dummy_data_distrib.cc |
| Warning: | line 334, column 3 The 1st argument to 'bind' is -1 but should be >= 0 |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
| 1 | /************************************************************************** | ||||
| 2 | * basf2 (Belle II Analysis Software Framework) * | ||||
| 3 | * Author: The Belle II Collaboration * | ||||
| 4 | * * | ||||
| 5 | * See git log for contributors and copyright holders. * | ||||
| 6 | * This file is licensed under LGPL-3.0, see LICENSE.md. * | ||||
| 7 | **************************************************************************/ | ||||
| 8 | #include <iostream> | ||||
| 9 | #include <vector> | ||||
| 10 | #include <stdio.h> | ||||
| 11 | #include <stdlib.h> | ||||
| 12 | #include <netinet/in.h> | ||||
| 13 | #include <sys/types.h> | ||||
| 14 | #include <sys/socket.h> | ||||
| 15 | #include <sys/time.h> | ||||
| 16 | #include <time.h> | ||||
| 17 | #include <string.h> | ||||
| 18 | #include <unistd.h> | ||||
| 19 | #include <arpa/inet.h> | ||||
| 20 | #include <limits.h> | ||||
| 21 | #include <signal.h> | ||||
| 22 | #include <poll.h> | ||||
| 23 | |||||
| 24 | |||||
| 25 | ///////////////////////////////////////// | ||||
| 26 | // Parameter for data-contents | ||||
| 27 | //////////////////////////////////////// | ||||
| 28 | //#define REDUCED_DATA | ||||
| 29 | //#define CRC_ON | ||||
| 30 | #define LISTENQ1 1 | ||||
| 31 | #define NUM_CLIENTS5 5 | ||||
| 32 | #define MAX_EVENT1000 1000 | ||||
| 33 | |||||
| 34 | // Format (PCIe40) | ||||
| 35 | #define NW_SEND_HEADER6 6 | ||||
| 36 | #define NW_SEND_TRAILER2 2 | ||||
| 37 | |||||
| 38 | #define NW_RAW_HEADER8 8 | ||||
| 39 | #define NW_RAW_TRAILER4 4 | ||||
| 40 | |||||
| 41 | #ifdef REDUCED_DATA | ||||
| 42 | #define NW_B2L_HEADER7 3 | ||||
| 43 | #define NW_B2L_TRAILER3 2 | ||||
| 44 | #else | ||||
| 45 | #define NW_B2L_HEADER7 7 | ||||
| 46 | #define NW_B2L_TRAILER3 3 | ||||
| 47 | #endif | ||||
| 48 | |||||
| 49 | #define CTIME_VAL0x12345601 0x12345601 | ||||
| 50 | |||||
| 51 | using namespace std; | ||||
| 52 | |||||
| 53 | unsigned short CalcCRC16LittleEndian(unsigned short crc16, const int buf[], int nwords) | ||||
| 54 | { | ||||
| 55 | |||||
| 56 | if (nwords < 0) { | ||||
| 57 | char err_buf[500]; | ||||
| 58 | sprintf(err_buf, "nwords value(%d) is invalid. Cannot calculate CRC16. Exiting...\n %s %s %d\n", | ||||
| 59 | nwords, __FILE__"daq/rawdata/tools/dummy_data_distrib.cc", __PRETTY_FUNCTION__, __LINE__59); | ||||
| 60 | printf("%s", err_buf); fflush(stdoutstdout); | ||||
| 61 | string err_str = err_buf; | ||||
| 62 | throw (err_str); | ||||
| 63 | } | ||||
| 64 | |||||
| 65 | const unsigned short CRC16Table0x1021[ 256 ] = { | ||||
| 66 | 0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50A5, 0x60C6, 0x70E7, | ||||
| 67 | 0x8108, 0x9129, 0xA14A, 0xB16B, 0xC18C, 0xD1AD, 0xE1CE, 0xF1EF, | ||||
| 68 | 0x1231, 0x0210, 0x3273, 0x2252, 0x52B5, 0x4294, 0x72F7, 0x62D6, | ||||
| 69 | 0x9339, 0x8318, 0xB37B, 0xA35A, 0xD3BD, 0xC39C, 0xF3FF, 0xE3DE, | ||||
| 70 | 0x2462, 0x3443, 0x0420, 0x1401, 0x64E6, 0x74C7, 0x44A4, 0x5485, | ||||
| 71 | 0xA56A, 0xB54B, 0x8528, 0x9509, 0xE5EE, 0xF5CF, 0xC5AC, 0xD58D, | ||||
| 72 | 0x3653, 0x2672, 0x1611, 0x0630, 0x76D7, 0x66F6, 0x5695, 0x46B4, | ||||
| 73 | 0xB75B, 0xA77A, 0x9719, 0x8738, 0xF7DF, 0xE7FE, 0xD79D, 0xC7BC, | ||||
| 74 | |||||
| 75 | 0x48C4, 0x58E5, 0x6886, 0x78A7, 0x0840, 0x1861, 0x2802, 0x3823, | ||||
| 76 | 0xC9CC, 0xD9ED, 0xE98E, 0xF9AF, 0x8948, 0x9969, 0xA90A, 0xB92B, | ||||
| 77 | 0x5AF5, 0x4AD4, 0x7AB7, 0x6A96, 0x1A71, 0x0A50, 0x3A33, 0x2A12, | ||||
| 78 | 0xDBFD, 0xCBDC, 0xFBBF, 0xEB9E, 0x9B79, 0x8B58, 0xBB3B, 0xAB1A, | ||||
| 79 | 0x6CA6, 0x7C87, 0x4CE4, 0x5CC5, 0x2C22, 0x3C03, 0x0C60, 0x1C41, | ||||
| 80 | 0xEDAE, 0xFD8F, 0xCDEC, 0xDDCD, 0xAD2A, 0xBD0B, 0x8D68, 0x9D49, | ||||
| 81 | 0x7E97, 0x6EB6, 0x5ED5, 0x4EF4, 0x3E13, 0x2E32, 0x1E51, 0x0E70, | ||||
| 82 | 0xFF9F, 0xEFBE, 0xDFDD, 0xCFFC, 0xBF1B, 0xAF3A, 0x9F59, 0x8F78, | ||||
| 83 | |||||
| 84 | 0x9188, 0x81A9, 0xB1CA, 0xA1EB, 0xD10C, 0xC12D, 0xF14E, 0xE16F, | ||||
| 85 | 0x1080, 0x00A1, 0x30C2, 0x20E3, 0x5004, 0x4025, 0x7046, 0x6067, | ||||
| 86 | 0x83B9, 0x9398, 0xA3FB, 0xB3DA, 0xC33D, 0xD31C, 0xE37F, 0xF35E, | ||||
| 87 | 0x02B1, 0x1290, 0x22F3, 0x32D2, 0x4235, 0x5214, 0x6277, 0x7256, | ||||
| 88 | 0xB5EA, 0xA5CB, 0x95A8, 0x8589, 0xF56E, 0xE54F, 0xD52C, 0xC50D, | ||||
| 89 | 0x34E2, 0x24C3, 0x14A0, 0x0481, 0x7466, 0x6447, 0x5424, 0x4405, | ||||
| 90 | 0xA7DB, 0xB7FA, 0x8799, 0x97B8, 0xE75F, 0xF77E, 0xC71D, 0xD73C, | ||||
| 91 | 0x26D3, 0x36F2, 0x0691, 0x16B0, 0x6657, 0x7676, 0x4615, 0x5634, | ||||
| 92 | |||||
| 93 | 0xD94C, 0xC96D, 0xF90E, 0xE92F, 0x99C8, 0x89E9, 0xB98A, 0xA9AB, | ||||
| 94 | 0x5844, 0x4865, 0x7806, 0x6827, 0x18C0, 0x08E1, 0x3882, 0x28A3, | ||||
| 95 | 0xCB7D, 0xDB5C, 0xEB3F, 0xFB1E, 0x8BF9, 0x9BD8, 0xABBB, 0xBB9A, | ||||
| 96 | 0x4A75, 0x5A54, 0x6A37, 0x7A16, 0x0AF1, 0x1AD0, 0x2AB3, 0x3A92, | ||||
| 97 | 0xFD2E, 0xED0F, 0xDD6C, 0xCD4D, 0xBDAA, 0xAD8B, 0x9DE8, 0x8DC9, | ||||
| 98 | 0x7C26, 0x6C07, 0x5C64, 0x4C45, 0x3CA2, 0x2C83, 0x1CE0, 0x0CC1, | ||||
| 99 | 0xEF1F, 0xFF3E, 0xCF5D, 0xDF7C, 0xAF9B, 0xBFBA, 0x8FD9, 0x9FF8, | ||||
| 100 | 0x6E17, 0x7E36, 0x4E55, 0x5E74, 0x2E93, 0x3EB2, 0x0ED1, 0x1EF0 | ||||
| 101 | }; | ||||
| 102 | |||||
| 103 | int cnt = 0, nints = 0; | ||||
| 104 | // printf("### %.8x %.4x\n", buf[ 0 ], crc16); | ||||
| 105 | while (nwords != 0) { | ||||
| 106 | |||||
| 107 | unsigned char temp_buf = *((unsigned char*)(buf + nints) + (-(cnt % 4) + 3)); | ||||
| 108 | crc16 = CRC16Table0x1021[(crc16 >> (16 - CHAR_BIT8)) ^ temp_buf ] ^ (crc16 << CHAR_BIT8); | ||||
| 109 | // printf("%.2x %.4x\n", temp_buf, crc16); | ||||
| 110 | if ((cnt % 4) == 3) { | ||||
| 111 | nwords--; | ||||
| 112 | nints++; | ||||
| 113 | // printf("### %.8x\n", buf[ nints ] ); | ||||
| 114 | } | ||||
| 115 | |||||
| 116 | cnt++; | ||||
| 117 | } | ||||
| 118 | |||||
| 119 | |||||
| 120 | return crc16; | ||||
| 121 | |||||
| 122 | } | ||||
| 123 | |||||
| 124 | |||||
| 125 | double getTimeSec() | ||||
| 126 | { | ||||
| 127 | struct timeval t; | ||||
| 128 | gettimeofday(&t, NULL__null); | ||||
| 129 | return (t.tv_sec + t.tv_usec * 1.e-6 - 1417570000.); | ||||
| 130 | } | ||||
| 131 | |||||
| 132 | int fillDataContents(int* buf, int nwords_per_fee, unsigned int node_id, int ncpr, int nhslb, int run) | ||||
| 133 | { | ||||
| 134 | int nwords = NW_SEND_HEADER6 + NW_SEND_TRAILER2 + | ||||
| 135 | ncpr * (NW_RAW_HEADER8 + | ||||
| 136 | (NW_B2L_HEADER7 + NW_B2L_TRAILER3 + nwords_per_fee) * nhslb | ||||
| 137 | + NW_RAW_TRAILER4); | ||||
| 138 | |||||
| 139 | // Send Header | ||||
| 140 | int offset = 0; | ||||
| 141 | buf[ offset + 0 ] = nwords; | ||||
| 142 | buf[ offset + 1 ] = 6; | ||||
| 143 | buf[ offset + 2 ] = (1 << 16) | ncpr; | ||||
| 144 | unsigned int exp_run = run << 8; | ||||
| 145 | buf[ offset + 3 ] = exp_run; | ||||
| 146 | buf[ offset + 5 ] = node_id; | ||||
| 147 | offset += NW_SEND_HEADER6; | ||||
| 148 | |||||
| 149 | for (int k = 0; k < ncpr; k++) { | ||||
| 150 | // | ||||
| 151 | // RawHeader | ||||
| 152 | // | ||||
| 153 | int cpr_nwords = NW_RAW_HEADER8 + | ||||
| 154 | (NW_B2L_HEADER7 + NW_B2L_TRAILER3 + nwords_per_fee) * nhslb | ||||
| 155 | + NW_RAW_TRAILER4; | ||||
| 156 | unsigned int ctime = CTIME_VAL0x12345601; | ||||
| 157 | unsigned int utime = 0x98765432; | ||||
| 158 | |||||
| 159 | buf[ offset + 0 ] = cpr_nwords; | ||||
| 160 | #ifdef REDUCED_DATA | ||||
| 161 | buf[ offset + 1 ] = 0x7f7f020c; | ||||
| 162 | #else | ||||
| 163 | buf[ offset + 1 ] = 0x7f7f820c; | ||||
| 164 | #endif | ||||
| 165 | buf[ offset + 2 ] = exp_run; | ||||
| 166 | printf("run_no %u\n", exp_run); fflush(stdoutstdout); | ||||
| 167 | buf[ offset + 4 ] = ctime; | ||||
| 168 | buf[ offset + 5 ] = utime; | ||||
| 169 | buf[ offset + 6 ] = node_id + k; | ||||
| 170 | buf[ offset + 7 ] = 0x34567890; | ||||
| 171 | offset += NW_RAW_HEADER8; | ||||
| 172 | |||||
| 173 | for (int i = 0; i < nhslb ; i++) { | ||||
| 174 | #ifdef REDUCED_DATA | ||||
| 175 | buf[ offset + 0 ] = nwords_per_fee + 3; | ||||
| 176 | buf[ offset + 1 ] = 0xffaa0000; | ||||
| 177 | buf[ offset + 2 ] = ctime; | ||||
| 178 | #else | ||||
| 179 | buf[ offset + 0 ] = nwords_per_fee + 7; | ||||
| 180 | buf[ offset + 1 ] = 0xffaa0000; | ||||
| 181 | buf[ offset + 3 ] = ctime; | ||||
| 182 | buf[ offset + 4 ] = utime; | ||||
| 183 | buf[ offset + 5 ] = exp_run; | ||||
| 184 | buf[ offset + 6 ] = ctime; | ||||
| 185 | #endif | ||||
| 186 | offset += NW_B2L_HEADER7; | ||||
| 187 | |||||
| 188 | for (int j = offset; j < offset + nwords_per_fee; j++) { | ||||
| 189 | buf[ j ] = rand(); | ||||
| 190 | } | ||||
| 191 | offset += nwords_per_fee; | ||||
| 192 | |||||
| 193 | #ifdef REDUCED_DATA | ||||
| 194 | buf[ offset ] = 0; | ||||
| 195 | buf[ offset + 1 ] = 0xff550000; | ||||
| 196 | #else | ||||
| 197 | buf[ offset ] = ctime; | ||||
| 198 | buf[ offset + 1 ] = 0; | ||||
| 199 | buf[ offset + 2 ] = 0xff550000; | ||||
| 200 | #endif | ||||
| 201 | |||||
| 202 | offset += NW_B2L_TRAILER3; | ||||
| 203 | } | ||||
| 204 | buf[ offset ] = 0x0; // error bits | ||||
| 205 | buf[ offset + 1 ] = 0x0; // error slots | ||||
| 206 | buf[ offset + 2 ] = 0x0; // XOR checksum | ||||
| 207 | buf[ offset + 3 ] = 0x7fff0006; | ||||
| 208 | offset += NW_RAW_TRAILER4; | ||||
| 209 | } | ||||
| 210 | |||||
| 211 | // Send trailer | ||||
| 212 | buf[ offset ] = 0; | ||||
| 213 | buf[ offset + 1 ] = 0x7fff0000; | ||||
| 214 | offset += NW_SEND_TRAILER2; | ||||
| 215 | return offset; | ||||
| 216 | } | ||||
| 217 | |||||
| 218 | |||||
| 219 | |||||
| 220 | inline void addEvent(int* buf, int nwords_per_fee, unsigned int event, int ncpr, int nhslb) | ||||
| 221 | //inline void addEvent(int* buf, int nwords, unsigned int event) | ||||
| 222 | { | ||||
| 223 | int offset = 0; | ||||
| 224 | buf[ offset + 4 ] = event; | ||||
| 225 | offset += NW_SEND_HEADER6; | ||||
| 226 | |||||
| 227 | for (int k = 0; k < ncpr; k++) { | ||||
| 228 | int nwords = buf[ offset ]; | ||||
| 229 | int posback_xorchksum = 2; | ||||
| 230 | int pos_xorchksum = offset + nwords - posback_xorchksum; | ||||
| 231 | if (buf[ offset + 4 ] != CTIME_VAL0x12345601) { | ||||
| 232 | printf("[FATAL] data-production error 2 0x%.x", buf[ offset + 4 ]); | ||||
| 233 | fflush(stdoutstdout); | ||||
| 234 | exit(1); | ||||
| 235 | } | ||||
| 236 | // RawHeader | ||||
| 237 | buf[ pos_xorchksum ] ^= buf[ offset + 3]; | ||||
| 238 | buf[ offset + 3] = event; | ||||
| 239 | buf[ pos_xorchksum ] ^= buf[ offset + 3]; | ||||
| 240 | |||||
| 241 | // COPPER header | ||||
| 242 | offset += NW_RAW_HEADER8; | ||||
| 243 | for (int i = 0; i < nhslb ; i++) { | ||||
| 244 | if ((buf[ offset + 1 ] & 0xffff0000) != 0xffaa0000) { | ||||
| 245 | printf("[FATAL] data-production error 3 : 0x%.x hslb %d cpr %d\n", buf[ offset ], i, k); | ||||
| 246 | fflush(stdoutstdout); | ||||
| 247 | exit(1); | ||||
| 248 | } | ||||
| 249 | buf[ offset + 1 ] = 0xffaa0000 + (event & 0xffff); | ||||
| 250 | buf[ offset + 3 ] = event; | ||||
| 251 | |||||
| 252 | #ifdef CRC_ON | ||||
| 253 | int* crc_buf = buf + offset + 2; // 1 => size of HSLB B2L header | ||||
| 254 | int crc_nwords = nwords_per_fee + 5; // 5 => size of FEE B2L header | ||||
| 255 | unsigned short temp_crc16 = CalcCRC16LittleEndian(0xffff, crc_buf, crc_nwords); | ||||
| 256 | buf[ offset + NW_B2L_HEADER7 + nwords_per_fee + 1 ] = ((event & 0x0000ffff) << 16) | temp_crc16; | ||||
| 257 | #endif | ||||
| 258 | |||||
| 259 | #ifdef REDUCED_DATA | ||||
| 260 | offset += NW_B2L_HEADER7 + nwords_per_fee + NW_B2L_TRAILER3; | ||||
| 261 | #else | ||||
| 262 | offset += NW_B2L_HEADER7 + nwords_per_fee + NW_B2L_TRAILER3; | ||||
| 263 | #endif | ||||
| 264 | } | ||||
| 265 | offset += NW_RAW_TRAILER4; | ||||
| 266 | } | ||||
| 267 | |||||
| 268 | } | ||||
| 269 | |||||
| 270 | |||||
| 271 | int main(int argc, char** argv) | ||||
| 272 | { | ||||
| 273 | |||||
| 274 | printf("###################################################\n"); | ||||
| 275 | #ifdef REDUCED_DATA | ||||
| 276 | printf("# PCIe40 data after reduction (#define REDUCED_DATA) #\n"); | ||||
| 277 | #else | ||||
| 278 | printf("# PCIe40 data before reduction (//#define REDUCED_DATA) #\n"); | ||||
| 279 | #endif | ||||
| 280 | printf("###################################################\n"); | ||||
| 281 | |||||
| 282 | if (argc != 6) { | ||||
| |||||
| 283 | printf("Usage : %s <node ID> <run#> <nwords of det. buf per FEE> <# of CPR per COPPER> <# of HSLBs>\n", argv[ 0 ]); | ||||
| 284 | exit(1); | ||||
| 285 | } | ||||
| 286 | |||||
| 287 | // | ||||
| 288 | // network connection | ||||
| 289 | // | ||||
| 290 | int listenfd; | ||||
| 291 | struct sockaddr_in servaddr; | ||||
| 292 | struct pollfd client[NUM_CLIENTS5 + 1]; | ||||
| 293 | |||||
| 294 | // | ||||
| 295 | // dummy data | ||||
| 296 | // | ||||
| 297 | unsigned int node_id = 0; | ||||
| 298 | sscanf(argv[1], "0x%x", &node_id); | ||||
| 299 | |||||
| 300 | int run_no = atoi(argv[2]); | ||||
| 301 | int nwords_per_fee = atoi(argv[3]); | ||||
| 302 | int ncpr = atoi(argv[4]); | ||||
| 303 | int nhslb = atoi(argv[5]); | ||||
| 304 | |||||
| 305 | int total_words = NW_SEND_HEADER6 + NW_SEND_TRAILER2 + | ||||
| 306 | ncpr * (NW_RAW_HEADER8 + (NW_B2L_HEADER7 + NW_B2L_TRAILER3 + nwords_per_fee) * nhslb + | ||||
| 307 | NW_RAW_TRAILER4); | ||||
| 308 | printf("TET %d %d %d %d %d\n ", NW_SEND_HEADER6 + NW_SEND_TRAILER2, ncpr, | ||||
| 309 | NW_RAW_HEADER8, (NW_B2L_HEADER7 + NW_B2L_TRAILER3 + nwords_per_fee) * nhslb, NW_RAW_TRAILER4); | ||||
| 310 | vector<int> buff(total_words); | ||||
| 311 | |||||
| 312 | // | ||||
| 313 | // Prepare header | ||||
| 314 | // | ||||
| 315 | int temp_ret = fillDataContents(buff.data(), nwords_per_fee, node_id, ncpr, nhslb, run_no); | ||||
| 316 | if (temp_ret != total_words) { | ||||
| 317 | printf("[FATAL] data-production error 1 %d %d\n", total_words, temp_ret); | ||||
| 318 | fflush(stdoutstdout); | ||||
| 319 | exit(1); | ||||
| 320 | } | ||||
| 321 | |||||
| 322 | listenfd = socket(AF_INET2, SOCK_STREAMSOCK_STREAM, 0); | ||||
| 323 | memset(&servaddr, 0, sizeof(servaddr)); | ||||
| 324 | servaddr.sin_family = AF_INET2; | ||||
| 325 | servaddr.sin_addr.s_addr = htonl(INADDR_ANY)__bswap_32 (((in_addr_t) 0x00000000)); | ||||
| 326 | servaddr.sin_port = htons(30000)__bswap_16 (30000); | ||||
| 327 | |||||
| 328 | int flags = 1; | ||||
| 329 | int ret = setsockopt(listenfd, SOL_SOCKET1, SO_REUSEADDR2, &flags, (socklen_t)sizeof(flags)); | ||||
| 330 | if (ret
| ||||
| 331 | perror("Failed to set REUSEADDR"); | ||||
| 332 | } | ||||
| 333 | |||||
| 334 | bind(listenfd, (struct sockaddr*)&servaddr, sizeof(servaddr)); | ||||
| |||||
| 335 | |||||
| 336 | listen(listenfd, LISTENQ1); | ||||
| 337 | |||||
| 338 | client[0].fd = listenfd; | ||||
| 339 | client[0].events = POLLRDNORM0x040; | ||||
| 340 | |||||
| 341 | for (int i = 1; i <= NUM_CLIENTS5; i++) { | ||||
| 342 | client[i].fd = -1; | ||||
| 343 | } | ||||
| 344 | |||||
| 345 | int maxi = 0; | ||||
| 346 | int nconn = 0; | ||||
| 347 | |||||
| 348 | while (1) { | ||||
| 349 | //int nready = poll(client, maxi + 1, -1); | ||||
| 350 | if (client[0].revents & POLLRDNORM0x040) { | ||||
| 351 | printf("Accepting..."); fflush(stdoutstdout); | ||||
| 352 | int connfd = accept(listenfd, (struct sockaddr*) NULL__null, NULL__null); | ||||
| 353 | int id; | ||||
| 354 | for (id = 1; id <= NUM_CLIENTS5; id++) { | ||||
| 355 | if (client[id].fd < 0) { | ||||
| 356 | client[id].fd = connfd; | ||||
| 357 | client[id].events = POLLRDNORM0x040; | ||||
| 358 | nconn++; | ||||
| 359 | printf("Done. connections (%d/%d)", nconn, NUM_CLIENTS5); fflush(stdoutstdout); | ||||
| 360 | break; | ||||
| 361 | } | ||||
| 362 | } | ||||
| 363 | if (id > NUM_CLIENTS5) { | ||||
| 364 | perror("[FATAL] too many clients."); | ||||
| 365 | exit(1); | ||||
| 366 | } | ||||
| 367 | if (id > maxi) maxi = id; | ||||
| 368 | if (nconn >= NUM_CLIENTS5) break; | ||||
| 369 | // if( -nready <= 0 ) continue; | ||||
| 370 | |||||
| 371 | } else { | ||||
| 372 | printf("No connection request. Still waiting..."); fflush(stdoutstdout); | ||||
| 373 | } | ||||
| 374 | } | ||||
| 375 | |||||
| 376 | printf("All connections accepted\n"); fflush(stdoutstdout); | ||||
| 377 | |||||
| 378 | double init_time = getTimeSec(); | ||||
| 379 | double prev_time = init_time; | ||||
| 380 | |||||
| 381 | unsigned long long int cnt = 0; | ||||
| 382 | unsigned long long int prev_cnt = 0; | ||||
| 383 | unsigned long long int start_cnt = 300000; | ||||
| 384 | |||||
| 385 | #ifdef MAX_EVENT1000 | ||||
| 386 | for (int j = 0; j < MAX_EVENT1000; j++) { | ||||
| 387 | #else | ||||
| 388 | for (;;) { | ||||
| 389 | #endif | ||||
| 390 | // addEvent(buff, total_words, cnt); | ||||
| 391 | addEvent(buff.data(), nwords_per_fee, cnt, ncpr, nhslb); | ||||
| 392 | // printf("cnt %d bytes\n", cnt*total_words); fflush(stdout); | ||||
| 393 | // sprintf( buff, "event %d dessa", cnt ); | ||||
| 394 | |||||
| 395 | // for(int i = 0 ; i < total_words ; i++){ | ||||
| 396 | // printf("%.8x ", buff[ i ]); | ||||
| 397 | // if( i % 10 == 9 ) printf("\n"); | ||||
| 398 | // } | ||||
| 399 | |||||
| 400 | for (int i = 1 ; i <= NUM_CLIENTS5 ; i++) { | ||||
| 401 | int Ret = 0; | ||||
| 402 | if ((Ret = write(client[i].fd, buff.data(), total_words * sizeof(int))) <= 0) { | ||||
| 403 | printf("[FATAL] Return value %d\n", Ret); | ||||
| 404 | fflush(stdoutstdout); | ||||
| 405 | exit(1); | ||||
| 406 | } | ||||
| 407 | } | ||||
| 408 | |||||
| 409 | cnt++; | ||||
| 410 | |||||
| 411 | if (cnt == start_cnt) init_time = getTimeSec(); | ||||
| 412 | if (cnt % 10000 == 1) { | ||||
| 413 | if (cnt > start_cnt) { | ||||
| 414 | double cur_time = getTimeSec(); | ||||
| 415 | printf("run %d evt %llu time %.1lf dataflow %.1lf MB/s rate %.2lf kHz : so far dataflow %.1lf MB/s rate %.2lf kHz size %d\n", | ||||
| 416 | run_no, | ||||
| 417 | cnt, | ||||
| 418 | cur_time - init_time, | ||||
| 419 | NUM_CLIENTS5 * (cnt - prev_cnt)*total_words * sizeof(int) / 1000000. / (cur_time - prev_time), | ||||
| 420 | (cnt - prev_cnt) / (cur_time - prev_time) / 1000., | ||||
| 421 | NUM_CLIENTS5 * (cnt - start_cnt)*total_words * sizeof(int) / 1000000. / (cur_time - init_time), | ||||
| 422 | (cnt - start_cnt) / (cur_time - init_time) / 1000., total_words); | ||||
| 423 | |||||
| 424 | fflush(stdoutstdout); | ||||
| 425 | prev_time = cur_time; | ||||
| 426 | prev_cnt = cnt; | ||||
| 427 | } else { | ||||
| 428 | // printf("Eve %lld\n", cnt);fflush(stdout); | ||||
| 429 | } | ||||
| 430 | } | ||||
| 431 | } | ||||
| 432 | |||||
| 433 | |||||
| 434 | for (int i = 1; i <= NUM_CLIENTS5; i++) { | ||||
| 435 | close(client[i].fd); | ||||
| 436 | } | ||||
| 437 | |||||
| 438 | |||||
| 439 | } |
| 1 | // Vector implementation -*- C++ -*- |
| 2 | |
| 3 | // Copyright (C) 2001-2025 Free Software Foundation, Inc. |
| 4 | // |
| 5 | // This file is part of the GNU ISO C++ Library. This library is free |
| 6 | // software; you can redistribute it and/or modify it under the |
| 7 | // terms of the GNU General Public License as published by the |
| 8 | // Free Software Foundation; either version 3, or (at your option) |
| 9 | // any later version. |
| 10 | |
| 11 | // This library is distributed in the hope that it will be useful, |
| 12 | // but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 | // GNU General Public License for more details. |
| 15 | |
| 16 | // Under Section 7 of GPL version 3, you are granted additional |
| 17 | // permissions described in the GCC Runtime Library Exception, version |
| 18 | // 3.1, as published by the Free Software Foundation. |
| 19 | |
| 20 | // You should have received a copy of the GNU General Public License and |
| 21 | // a copy of the GCC Runtime Library Exception along with this program; |
| 22 | // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see |
| 23 | // <http://www.gnu.org/licenses/>. |
| 24 | |
| 25 | /* |
| 26 | * |
| 27 | * Copyright (c) 1994 |
| 28 | * Hewlett-Packard Company |
| 29 | * |
| 30 | * Permission to use, copy, modify, distribute and sell this software |
| 31 | * and its documentation for any purpose is hereby granted without fee, |
| 32 | * provided that the above copyright notice appear in all copies and |
| 33 | * that both that copyright notice and this permission notice appear |
| 34 | * in supporting documentation. Hewlett-Packard Company makes no |
| 35 | * representations about the suitability of this software for any |
| 36 | * purpose. It is provided "as is" without express or implied warranty. |
| 37 | * |
| 38 | * |
| 39 | * Copyright (c) 1996 |
| 40 | * Silicon Graphics Computer Systems, Inc. |
| 41 | * |
| 42 | * Permission to use, copy, modify, distribute and sell this software |
| 43 | * and its documentation for any purpose is hereby granted without fee, |
| 44 | * provided that the above copyright notice appear in all copies and |
| 45 | * that both that copyright notice and this permission notice appear |
| 46 | * in supporting documentation. Silicon Graphics makes no |
| 47 | * representations about the suitability of this software for any |
| 48 | * purpose. It is provided "as is" without express or implied warranty. |
| 49 | */ |
| 50 | |
| 51 | /** @file bits/stl_vector.h |
| 52 | * This is an internal header file, included by other library headers. |
| 53 | * Do not attempt to use it directly. @headername{vector} |
| 54 | */ |
| 55 | |
| 56 | #ifndef _STL_VECTOR_H1 |
| 57 | #define _STL_VECTOR_H1 1 |
| 58 | |
| 59 | #include <bits/stl_iterator_base_funcs.h> |
| 60 | #include <bits/functexcept.h> |
| 61 | #include <bits/concept_check.h> |
| 62 | #if __cplusplus202002L >= 201103L |
| 63 | #include <initializer_list> |
| 64 | #endif |
| 65 | #if __cplusplus202002L >= 202002L |
| 66 | # include <compare> |
| 67 | #endif |
| 68 | #if __glibcxx_concepts202002L // C++ >= C++20 |
| 69 | # include <bits/ranges_base.h> // ranges::distance |
| 70 | #endif |
| 71 | #if __glibcxx_containers_ranges // C++ >= 23 |
| 72 | # include <bits/ranges_algobase.h> // ranges::copy |
| 73 | # include <bits/ranges_util.h> // ranges::subrange |
| 74 | #endif |
| 75 | |
| 76 | #include <debug/assertions.h> |
| 77 | |
| 78 | #if _GLIBCXX_SANITIZE_STD_ALLOCATOR && _GLIBCXX_SANITIZE_VECTOR |
| 79 | extern "C" void |
| 80 | __sanitizer_annotate_contiguous_container(const void*, const void*, |
| 81 | const void*, const void*); |
| 82 | #endif |
| 83 | |
| 84 | namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default"))) |
| 85 | { |
| 86 | _GLIBCXX_BEGIN_NAMESPACE_VERSION |
| 87 | _GLIBCXX_BEGIN_NAMESPACE_CONTAINER |
| 88 | |
| 89 | /// See bits/stl_deque.h's _Deque_base for an explanation. |
| 90 | template<typename _Tp, typename _Alloc> |
| 91 | struct _Vector_base |
| 92 | { |
| 93 | typedef typename __gnu_cxx::__alloc_traits<_Alloc>::template |
| 94 | rebind<_Tp>::other _Tp_alloc_type; |
| 95 | typedef typename __gnu_cxx::__alloc_traits<_Tp_alloc_type>::pointer |
| 96 | pointer; |
| 97 | |
| 98 | struct _Vector_impl_data |
| 99 | { |
| 100 | pointer _M_start; |
| 101 | pointer _M_finish; |
| 102 | pointer _M_end_of_storage; |
| 103 | |
| 104 | _GLIBCXX20_CONSTEXPRconstexpr |
| 105 | _Vector_impl_data() _GLIBCXX_NOEXCEPTnoexcept |
| 106 | : _M_start(), _M_finish(), _M_end_of_storage() |
| 107 | { } |
| 108 | |
| 109 | #if __cplusplus202002L >= 201103L |
| 110 | _GLIBCXX20_CONSTEXPRconstexpr |
| 111 | _Vector_impl_data(_Vector_impl_data&& __x) noexcept |
| 112 | : _M_start(__x._M_start), _M_finish(__x._M_finish), |
| 113 | _M_end_of_storage(__x._M_end_of_storage) |
| 114 | { __x._M_start = __x._M_finish = __x._M_end_of_storage = pointer(); } |
| 115 | #endif |
| 116 | |
| 117 | _GLIBCXX20_CONSTEXPRconstexpr |
| 118 | void |
| 119 | _M_copy_data(_Vector_impl_data const& __x) _GLIBCXX_NOEXCEPTnoexcept |
| 120 | { |
| 121 | _M_start = __x._M_start; |
| 122 | _M_finish = __x._M_finish; |
| 123 | _M_end_of_storage = __x._M_end_of_storage; |
| 124 | } |
| 125 | |
| 126 | _GLIBCXX20_CONSTEXPRconstexpr |
| 127 | void |
| 128 | _M_swap_data(_Vector_impl_data& __x) _GLIBCXX_NOEXCEPTnoexcept |
| 129 | { |
| 130 | // Do not use std::swap(_M_start, __x._M_start), etc as it loses |
| 131 | // information used by TBAA. |
| 132 | _Vector_impl_data __tmp; |
| 133 | __tmp._M_copy_data(*this); |
| 134 | _M_copy_data(__x); |
| 135 | __x._M_copy_data(__tmp); |
| 136 | } |
| 137 | }; |
| 138 | |
| 139 | struct _Vector_impl |
| 140 | : public _Tp_alloc_type, public _Vector_impl_data |
| 141 | { |
| 142 | _GLIBCXX20_CONSTEXPRconstexpr |
| 143 | _Vector_impl() _GLIBCXX_NOEXCEPT_IF(noexcept(is_nothrow_default_constructible<_Tp_alloc_type> ::value) |
| 144 | is_nothrow_default_constructible<_Tp_alloc_type>::value)noexcept(is_nothrow_default_constructible<_Tp_alloc_type> ::value) |
| 145 | #if __cpp_lib_concepts202002L |
| 146 | requires is_default_constructible_v<_Tp_alloc_type> |
| 147 | #endif |
| 148 | : _Tp_alloc_type() |
| 149 | { } |
| 150 | |
| 151 | _GLIBCXX20_CONSTEXPRconstexpr |
| 152 | _Vector_impl(_Tp_alloc_type const& __a) _GLIBCXX_NOEXCEPTnoexcept |
| 153 | : _Tp_alloc_type(__a) |
| 154 | { } |
| 155 | |
| 156 | #if __cplusplus202002L >= 201103L |
| 157 | // Not defaulted, to enforce noexcept(true) even when |
| 158 | // !is_nothrow_move_constructible<_Tp_alloc_type>. |
| 159 | _GLIBCXX20_CONSTEXPRconstexpr |
| 160 | _Vector_impl(_Vector_impl&& __x) noexcept |
| 161 | : _Tp_alloc_type(std::move(__x)), _Vector_impl_data(std::move(__x)) |
| 162 | { } |
| 163 | |
| 164 | _GLIBCXX20_CONSTEXPRconstexpr |
| 165 | _Vector_impl(_Tp_alloc_type&& __a) noexcept |
| 166 | : _Tp_alloc_type(std::move(__a)) |
| 167 | { } |
| 168 | |
| 169 | _GLIBCXX20_CONSTEXPRconstexpr |
| 170 | _Vector_impl(_Tp_alloc_type&& __a, _Vector_impl&& __rv) noexcept |
| 171 | : _Tp_alloc_type(std::move(__a)), _Vector_impl_data(std::move(__rv)) |
| 172 | { } |
| 173 | #endif |
| 174 | |
| 175 | #if _GLIBCXX_SANITIZE_STD_ALLOCATOR && _GLIBCXX_SANITIZE_VECTOR |
| 176 | template<typename = _Tp_alloc_type> |
| 177 | struct _Asan |
| 178 | { |
| 179 | typedef typename __gnu_cxx::__alloc_traits<_Tp_alloc_type> |
| 180 | ::size_type size_type; |
| 181 | |
| 182 | static _GLIBCXX20_CONSTEXPRconstexpr void |
| 183 | _S_shrink(_Vector_impl&, size_type) { } |
| 184 | static _GLIBCXX20_CONSTEXPRconstexpr void |
| 185 | _S_on_dealloc(_Vector_impl&) { } |
| 186 | |
| 187 | typedef _Vector_impl& _Reinit; |
| 188 | |
| 189 | struct _Grow |
| 190 | { |
| 191 | _GLIBCXX20_CONSTEXPRconstexpr _Grow(_Vector_impl&, size_type) { } |
| 192 | _GLIBCXX20_CONSTEXPRconstexpr void _M_grew(size_type) { } |
| 193 | }; |
| 194 | }; |
| 195 | |
| 196 | // Enable ASan annotations for memory obtained from std::allocator. |
| 197 | template<typename _Up> |
| 198 | struct _Asan<allocator<_Up> > |
| 199 | { |
| 200 | typedef typename __gnu_cxx::__alloc_traits<_Tp_alloc_type> |
| 201 | ::size_type size_type; |
| 202 | |
| 203 | // Adjust ASan annotation for [_M_start, _M_end_of_storage) to |
| 204 | // mark end of valid region as __curr instead of __prev. |
| 205 | static _GLIBCXX20_CONSTEXPRconstexpr void |
| 206 | _S_adjust(_Vector_impl& __impl, pointer __prev, pointer __curr) |
| 207 | { |
| 208 | #if __cpp_lib_is_constant_evaluated201811L |
| 209 | if (std::is_constant_evaluated()) |
| 210 | return; |
| 211 | #endif |
| 212 | __sanitizer_annotate_contiguous_container(__impl._M_start, |
| 213 | __impl._M_end_of_storage, __prev, __curr); |
| 214 | } |
| 215 | |
| 216 | static _GLIBCXX20_CONSTEXPRconstexpr void |
| 217 | _S_grow(_Vector_impl& __impl, size_type __n) |
| 218 | { _S_adjust(__impl, __impl._M_finish, __impl._M_finish + __n); } |
| 219 | |
| 220 | static _GLIBCXX20_CONSTEXPRconstexpr void |
| 221 | _S_shrink(_Vector_impl& __impl, size_type __n) |
| 222 | { _S_adjust(__impl, __impl._M_finish + __n, __impl._M_finish); } |
| 223 | |
| 224 | static _GLIBCXX20_CONSTEXPRconstexpr void |
| 225 | _S_on_dealloc(_Vector_impl& __impl) |
| 226 | { |
| 227 | if (__impl._M_start) |
| 228 | _S_adjust(__impl, __impl._M_finish, __impl._M_end_of_storage); |
| 229 | } |
| 230 | |
| 231 | // Used on reallocation to tell ASan unused capacity is invalid. |
| 232 | struct _Reinit |
| 233 | { |
| 234 | explicit _GLIBCXX20_CONSTEXPRconstexpr |
| 235 | _Reinit(_Vector_impl& __impl) : _M_impl(__impl) |
| 236 | { |
| 237 | // Mark unused capacity as valid again before deallocating it. |
| 238 | _S_on_dealloc(_M_impl); |
| 239 | } |
| 240 | |
| 241 | _GLIBCXX20_CONSTEXPRconstexpr |
| 242 | ~_Reinit() |
| 243 | { |
| 244 | // Mark unused capacity as invalid after reallocation. |
| 245 | if (_M_impl._M_start) |
| 246 | _S_adjust(_M_impl, _M_impl._M_end_of_storage, |
| 247 | _M_impl._M_finish); |
| 248 | } |
| 249 | |
| 250 | _Vector_impl& _M_impl; |
| 251 | |
| 252 | #if __cplusplus202002L >= 201103L |
| 253 | _Reinit(const _Reinit&) = delete; |
| 254 | _Reinit& operator=(const _Reinit&) = delete; |
| 255 | #endif |
| 256 | }; |
| 257 | |
| 258 | // Tell ASan when unused capacity is initialized to be valid. |
| 259 | struct _Grow |
| 260 | { |
| 261 | _GLIBCXX20_CONSTEXPRconstexpr |
| 262 | _Grow(_Vector_impl& __impl, size_type __n) |
| 263 | : _M_impl(__impl), _M_n(__n) |
| 264 | { _S_grow(_M_impl, __n); } |
| 265 | |
| 266 | _GLIBCXX20_CONSTEXPRconstexpr |
| 267 | ~_Grow() { if (_M_n) _S_shrink(_M_impl, _M_n); } |
| 268 | |
| 269 | _GLIBCXX20_CONSTEXPRconstexpr |
| 270 | void _M_grew(size_type __n) { _M_n -= __n; } |
| 271 | |
| 272 | #if __cplusplus202002L >= 201103L |
| 273 | _Grow(const _Grow&) = delete; |
| 274 | _Grow& operator=(const _Grow&) = delete; |
| 275 | #endif |
| 276 | private: |
| 277 | _Vector_impl& _M_impl; |
| 278 | size_type _M_n; |
| 279 | }; |
| 280 | }; |
| 281 | |
| 282 | #define _GLIBCXX_ASAN_ANNOTATE_REINIT \ |
| 283 | typename _Base::_Vector_impl::template _Asan<>::_Reinit const \ |
| 284 | __attribute__((__unused__)) __reinit_guard(this->_M_impl) |
| 285 | #define _GLIBCXX_ASAN_ANNOTATE_GROW(n) \ |
| 286 | typename _Base::_Vector_impl::template _Asan<>::_Grow \ |
| 287 | __attribute__((__unused__)) __grow_guard(this->_M_impl, (n)) |
| 288 | #define _GLIBCXX_ASAN_ANNOTATE_GREW(n) __grow_guard._M_grew(n) |
| 289 | #define _GLIBCXX_ASAN_ANNOTATE_SHRINK(n) \ |
| 290 | _Base::_Vector_impl::template _Asan<>::_S_shrink(this->_M_impl, n) |
| 291 | #define _GLIBCXX_ASAN_ANNOTATE_BEFORE_DEALLOC \ |
| 292 | _Base::_Vector_impl::template _Asan<>::_S_on_dealloc(this->_M_impl) |
| 293 | #else // ! (_GLIBCXX_SANITIZE_STD_ALLOCATOR && _GLIBCXX_SANITIZE_VECTOR) |
| 294 | #define _GLIBCXX_ASAN_ANNOTATE_REINIT |
| 295 | #define _GLIBCXX_ASAN_ANNOTATE_GROW(n) |
| 296 | #define _GLIBCXX_ASAN_ANNOTATE_GREW(n) |
| 297 | #define _GLIBCXX_ASAN_ANNOTATE_SHRINK(n) |
| 298 | #define _GLIBCXX_ASAN_ANNOTATE_BEFORE_DEALLOC |
| 299 | #endif // _GLIBCXX_SANITIZE_STD_ALLOCATOR && _GLIBCXX_SANITIZE_VECTOR |
| 300 | }; |
| 301 | |
| 302 | public: |
| 303 | typedef _Alloc allocator_type; |
| 304 | |
| 305 | _GLIBCXX20_CONSTEXPRconstexpr |
| 306 | _Tp_alloc_type& |
| 307 | _M_get_Tp_allocator() _GLIBCXX_NOEXCEPTnoexcept |
| 308 | { return this->_M_impl; } |
| 309 | |
| 310 | _GLIBCXX20_CONSTEXPRconstexpr |
| 311 | const _Tp_alloc_type& |
| 312 | _M_get_Tp_allocator() const _GLIBCXX_NOEXCEPTnoexcept |
| 313 | { return this->_M_impl; } |
| 314 | |
| 315 | _GLIBCXX20_CONSTEXPRconstexpr |
| 316 | allocator_type |
| 317 | get_allocator() const _GLIBCXX_NOEXCEPTnoexcept |
| 318 | { return allocator_type(_M_get_Tp_allocator()); } |
| 319 | |
| 320 | #if __cplusplus202002L >= 201103L |
| 321 | _Vector_base() = default; |
| 322 | #else |
| 323 | _Vector_base() { } |
| 324 | #endif |
| 325 | |
| 326 | _GLIBCXX20_CONSTEXPRconstexpr |
| 327 | _Vector_base(const allocator_type& __a) _GLIBCXX_NOEXCEPTnoexcept |
| 328 | : _M_impl(__a) { } |
| 329 | |
| 330 | // Kept for ABI compatibility. |
| 331 | #if !_GLIBCXX_INLINE_VERSION0 |
| 332 | _GLIBCXX20_CONSTEXPRconstexpr |
| 333 | _Vector_base(size_t __n) |
| 334 | : _M_impl() |
| 335 | { _M_create_storage(__n); } |
| 336 | #endif |
| 337 | |
| 338 | _GLIBCXX20_CONSTEXPRconstexpr |
| 339 | _Vector_base(size_t __n, const allocator_type& __a) |
| 340 | : _M_impl(__a) |
| 341 | { _M_create_storage(__n); } |
| 342 | |
| 343 | #if __cplusplus202002L >= 201103L |
| 344 | _Vector_base(_Vector_base&&) = default; |
| 345 | |
| 346 | // Kept for ABI compatibility. |
| 347 | # if !_GLIBCXX_INLINE_VERSION0 |
| 348 | _GLIBCXX20_CONSTEXPRconstexpr |
| 349 | _Vector_base(_Tp_alloc_type&& __a) noexcept |
| 350 | : _M_impl(std::move(__a)) { } |
| 351 | |
| 352 | _GLIBCXX20_CONSTEXPRconstexpr |
| 353 | _Vector_base(_Vector_base&& __x, const allocator_type& __a) |
| 354 | : _M_impl(__a) |
| 355 | { |
| 356 | if (__x.get_allocator() == __a) |
| 357 | this->_M_impl._M_swap_data(__x._M_impl); |
| 358 | else |
| 359 | { |
| 360 | size_t __n = __x._M_impl._M_finish - __x._M_impl._M_start; |
| 361 | _M_create_storage(__n); |
| 362 | } |
| 363 | } |
| 364 | # endif |
| 365 | |
| 366 | _GLIBCXX20_CONSTEXPRconstexpr |
| 367 | _Vector_base(const allocator_type& __a, _Vector_base&& __x) |
| 368 | : _M_impl(_Tp_alloc_type(__a), std::move(__x._M_impl)) |
| 369 | { } |
| 370 | #endif |
| 371 | |
| 372 | _GLIBCXX20_CONSTEXPRconstexpr |
| 373 | ~_Vector_base() _GLIBCXX_NOEXCEPTnoexcept |
| 374 | { |
| 375 | _M_deallocate(_M_impl._M_start, |
| 376 | _M_impl._M_end_of_storage - _M_impl._M_start); |
| 377 | } |
| 378 | |
| 379 | public: |
| 380 | _Vector_impl _M_impl; |
| 381 | |
| 382 | _GLIBCXX20_CONSTEXPRconstexpr |
| 383 | pointer |
| 384 | _M_allocate(size_t __n) |
| 385 | { |
| 386 | typedef __gnu_cxx::__alloc_traits<_Tp_alloc_type> _Tr; |
| 387 | return __n != 0 ? _Tr::allocate(_M_impl, __n) : pointer(); |
| 388 | } |
| 389 | |
| 390 | _GLIBCXX20_CONSTEXPRconstexpr |
| 391 | void |
| 392 | _M_deallocate(pointer __p, size_t __n) |
| 393 | { |
| 394 | typedef __gnu_cxx::__alloc_traits<_Tp_alloc_type> _Tr; |
| 395 | if (__p) |
| 396 | _Tr::deallocate(_M_impl, __p, __n); |
| 397 | } |
| 398 | |
| 399 | protected: |
| 400 | |
| 401 | _GLIBCXX20_CONSTEXPRconstexpr |
| 402 | void |
| 403 | _M_create_storage(size_t __n) |
| 404 | { |
| 405 | this->_M_impl._M_start = this->_M_allocate(__n); |
| 406 | this->_M_impl._M_finish = this->_M_impl._M_start; |
| 407 | this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; |
| 408 | } |
| 409 | |
| 410 | #if __glibcxx_containers_ranges // C++ >= 23 |
| 411 | // Called by insert_range, and indirectly by assign_range, append_range. |
| 412 | // Initializes new elements in storage at __ptr and updates __ptr to |
| 413 | // point after the last new element. |
| 414 | // Provides strong exception safety guarantee. |
| 415 | // Requires [ptr, ptr+distance(rg)) is a valid range. |
| 416 | template<ranges::input_range _Rg> |
| 417 | constexpr void |
| 418 | _M_append_range_to(_Rg&& __rg, pointer& __ptr) |
| 419 | { |
| 420 | __ptr = std::__uninitialized_copy_a(ranges::begin(__rg), |
| 421 | ranges::end(__rg), |
| 422 | __ptr, _M_get_Tp_allocator()); |
| 423 | } |
| 424 | |
| 425 | // Called by assign_range, append_range, insert_range. |
| 426 | // Requires capacity() >= size()+distance(rg). |
| 427 | template<ranges::input_range _Rg> |
| 428 | constexpr void |
| 429 | _M_append_range(_Rg&& __rg) |
| 430 | { _M_append_range_to(std::forward<_Rg>(__rg), _M_impl._M_finish); } |
| 431 | #endif |
| 432 | }; |
| 433 | |
| 434 | /** |
| 435 | * @brief A standard container which offers fixed time access to |
| 436 | * individual elements in any order. |
| 437 | * |
| 438 | * @ingroup sequences |
| 439 | * @headerfile vector |
| 440 | * @since C++98 |
| 441 | * |
| 442 | * @tparam _Tp Type of element. |
| 443 | * @tparam _Alloc Allocator type, defaults to allocator<_Tp>. |
| 444 | * |
| 445 | * Meets the requirements of a <a href="tables.html#65">container</a>, a |
| 446 | * <a href="tables.html#66">reversible container</a>, and a |
| 447 | * <a href="tables.html#67">sequence</a>, including the |
| 448 | * <a href="tables.html#68">optional sequence requirements</a> with the |
| 449 | * %exception of @c push_front and @c pop_front. |
| 450 | * |
| 451 | * In some terminology a %vector can be described as a dynamic |
| 452 | * C-style array, it offers fast and efficient access to individual |
| 453 | * elements in any order and saves the user from worrying about |
| 454 | * memory and size allocation. Subscripting ( @c [] ) access is |
| 455 | * also provided as with C-style arrays. |
| 456 | */ |
| 457 | template<typename _Tp, typename _Alloc = std::allocator<_Tp> > |
| 458 | class vector : protected _Vector_base<_Tp, _Alloc> |
| 459 | { |
| 460 | #ifdef _GLIBCXX_CONCEPT_CHECKS |
| 461 | // Concept requirements. |
| 462 | typedef typename _Alloc::value_type _Alloc_value_type; |
| 463 | # if __cplusplus202002L < 201103L |
| 464 | __glibcxx_class_requires(_Tp, _SGIAssignableConcept) |
| 465 | # endif |
| 466 | __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept) |
| 467 | #endif |
| 468 | |
| 469 | #if __cplusplus202002L >= 201103L |
| 470 | static_assert(is_same<typename remove_cv<_Tp>::type, _Tp>::value, |
| 471 | "std::vector must have a non-const, non-volatile value_type"); |
| 472 | # if __cplusplus202002L > 201703L || defined __STRICT_ANSI__1 |
| 473 | static_assert(is_same<typename _Alloc::value_type, _Tp>::value, |
| 474 | "std::vector must have the same value_type as its allocator"); |
| 475 | # endif |
| 476 | #endif |
| 477 | |
| 478 | typedef _Vector_base<_Tp, _Alloc> _Base; |
| 479 | typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; |
| 480 | typedef __gnu_cxx::__alloc_traits<_Tp_alloc_type> _Alloc_traits; |
| 481 | |
| 482 | public: |
| 483 | typedef _Tp value_type; |
| 484 | typedef typename _Base::pointer pointer; |
| 485 | typedef typename _Alloc_traits::const_pointer const_pointer; |
| 486 | typedef typename _Alloc_traits::reference reference; |
| 487 | typedef typename _Alloc_traits::const_reference const_reference; |
| 488 | typedef __gnu_cxx::__normal_iterator<pointer, vector> iterator; |
| 489 | typedef __gnu_cxx::__normal_iterator<const_pointer, vector> |
| 490 | const_iterator; |
| 491 | typedef std::reverse_iterator<const_iterator> const_reverse_iterator; |
| 492 | typedef std::reverse_iterator<iterator> reverse_iterator; |
| 493 | typedef size_t size_type; |
| 494 | typedef ptrdiff_t difference_type; |
| 495 | typedef _Alloc allocator_type; |
| 496 | |
| 497 | private: |
| 498 | #if __cplusplus202002L >= 201103L |
| 499 | static constexpr bool |
| 500 | _S_nothrow_relocate(true_type) |
| 501 | { |
| 502 | return noexcept(std::__relocate_a(std::declval<pointer>(), |
| 503 | std::declval<pointer>(), |
| 504 | std::declval<pointer>(), |
| 505 | std::declval<_Tp_alloc_type&>())); |
| 506 | } |
| 507 | |
| 508 | static constexpr bool |
| 509 | _S_nothrow_relocate(false_type) |
| 510 | { return false; } |
| 511 | |
| 512 | static constexpr bool |
| 513 | _S_use_relocate() |
| 514 | { |
| 515 | // Instantiating std::__relocate_a might cause an error outside the |
| 516 | // immediate context (in __relocate_object_a's noexcept-specifier), |
| 517 | // so only do it if we know the type can be move-inserted into *this. |
| 518 | return _S_nothrow_relocate(__is_move_insertable<_Tp_alloc_type>{}); |
| 519 | } |
| 520 | |
| 521 | static pointer |
| 522 | _S_do_relocate(pointer __first, pointer __last, pointer __result, |
| 523 | _Tp_alloc_type& __alloc, true_type) noexcept |
| 524 | { |
| 525 | return std::__relocate_a(__first, __last, __result, __alloc); |
| 526 | } |
| 527 | |
| 528 | static pointer |
| 529 | _S_do_relocate(pointer, pointer, pointer __result, |
| 530 | _Tp_alloc_type&, false_type) noexcept |
| 531 | { return __result; } |
| 532 | |
| 533 | static _GLIBCXX20_CONSTEXPRconstexpr pointer |
| 534 | _S_relocate(pointer __first, pointer __last, pointer __result, |
| 535 | _Tp_alloc_type& __alloc) noexcept |
| 536 | { |
| 537 | #if __cpp_if_constexpr201606L |
| 538 | // All callers have already checked _S_use_relocate() so just do it. |
| 539 | return std::__relocate_a(__first, __last, __result, __alloc); |
| 540 | #else |
| 541 | using __do_it = __bool_constant<_S_use_relocate()>; |
| 542 | return _S_do_relocate(__first, __last, __result, __alloc, __do_it{}); |
| 543 | #endif |
| 544 | } |
| 545 | #endif // C++11 |
| 546 | |
| 547 | protected: |
| 548 | using _Base::_M_allocate; |
| 549 | using _Base::_M_deallocate; |
| 550 | using _Base::_M_impl; |
| 551 | using _Base::_M_get_Tp_allocator; |
| 552 | |
| 553 | public: |
| 554 | // [23.2.4.1] construct/copy/destroy |
| 555 | // (assign() and get_allocator() are also listed in this section) |
| 556 | |
| 557 | /** |
| 558 | * @brief Creates a %vector with no elements. |
| 559 | */ |
| 560 | #if __cplusplus202002L >= 201103L |
| 561 | vector() = default; |
| 562 | #else |
| 563 | vector() { } |
| 564 | #endif |
| 565 | |
| 566 | /** |
| 567 | * @brief Creates a %vector with no elements. |
| 568 | * @param __a An allocator object. |
| 569 | */ |
| 570 | explicit |
| 571 | _GLIBCXX20_CONSTEXPRconstexpr |
| 572 | vector(const allocator_type& __a) _GLIBCXX_NOEXCEPTnoexcept |
| 573 | : _Base(__a) { } |
| 574 | |
| 575 | #if __cplusplus202002L >= 201103L |
| 576 | /** |
| 577 | * @brief Creates a %vector with default constructed elements. |
| 578 | * @param __n The number of elements to initially create. |
| 579 | * @param __a An allocator. |
| 580 | * |
| 581 | * This constructor fills the %vector with @a __n default |
| 582 | * constructed elements. |
| 583 | */ |
| 584 | explicit |
| 585 | _GLIBCXX20_CONSTEXPRconstexpr |
| 586 | vector(size_type __n, const allocator_type& __a = allocator_type()) |
| 587 | : _Base(_S_check_init_len(__n, __a), __a) |
| 588 | { _M_default_initialize(__n); } |
| 589 | |
| 590 | /** |
| 591 | * @brief Creates a %vector with copies of an exemplar element. |
| 592 | * @param __n The number of elements to initially create. |
| 593 | * @param __value An element to copy. |
| 594 | * @param __a An allocator. |
| 595 | * |
| 596 | * This constructor fills the %vector with @a __n copies of @a __value. |
| 597 | */ |
| 598 | _GLIBCXX20_CONSTEXPRconstexpr |
| 599 | vector(size_type __n, const value_type& __value, |
| 600 | const allocator_type& __a = allocator_type()) |
| 601 | : _Base(_S_check_init_len(__n, __a), __a) |
| 602 | { _M_fill_initialize(__n, __value); } |
| 603 | #else |
| 604 | /** |
| 605 | * @brief Creates a %vector with copies of an exemplar element. |
| 606 | * @param __n The number of elements to initially create. |
| 607 | * @param __value An element to copy. |
| 608 | * @param __a An allocator. |
| 609 | * |
| 610 | * This constructor fills the %vector with @a __n copies of @a __value. |
| 611 | */ |
| 612 | explicit |
| 613 | vector(size_type __n, const value_type& __value = value_type(), |
| 614 | const allocator_type& __a = allocator_type()) |
| 615 | : _Base(_S_check_init_len(__n, __a), __a) |
| 616 | { _M_fill_initialize(__n, __value); } |
| 617 | #endif |
| 618 | |
| 619 | /** |
| 620 | * @brief %Vector copy constructor. |
| 621 | * @param __x A %vector of identical element and allocator types. |
| 622 | * |
| 623 | * All the elements of @a __x are copied, but any unused capacity in |
| 624 | * @a __x will not be copied |
| 625 | * (i.e. capacity() == size() in the new %vector). |
| 626 | * |
| 627 | * The newly-created %vector uses a copy of the allocator object used |
| 628 | * by @a __x (unless the allocator traits dictate a different object). |
| 629 | */ |
| 630 | _GLIBCXX20_CONSTEXPRconstexpr |
| 631 | vector(const vector& __x) |
| 632 | : _Base(__x.size(), |
| 633 | _Alloc_traits::_S_select_on_copy(__x._M_get_Tp_allocator())) |
| 634 | { |
| 635 | this->_M_impl._M_finish = |
| 636 | std::__uninitialized_copy_a(__x.begin(), __x.end(), |
| 637 | this->_M_impl._M_start, |
| 638 | _M_get_Tp_allocator()); |
| 639 | } |
| 640 | |
| 641 | #if __cplusplus202002L >= 201103L |
| 642 | /** |
| 643 | * @brief %Vector move constructor. |
| 644 | * |
| 645 | * The newly-created %vector contains the exact contents of the |
| 646 | * moved instance. |
| 647 | * The contents of the moved instance are a valid, but unspecified |
| 648 | * %vector. |
| 649 | */ |
| 650 | vector(vector&&) noexcept = default; |
| 651 | |
| 652 | /// Copy constructor with alternative allocator |
| 653 | _GLIBCXX20_CONSTEXPRconstexpr |
| 654 | vector(const vector& __x, const __type_identity_t<allocator_type>& __a) |
| 655 | : _Base(__x.size(), __a) |
| 656 | { |
| 657 | this->_M_impl._M_finish = |
| 658 | std::__uninitialized_copy_a(__x.begin(), __x.end(), |
| 659 | this->_M_impl._M_start, |
| 660 | _M_get_Tp_allocator()); |
| 661 | } |
| 662 | |
| 663 | private: |
| 664 | _GLIBCXX20_CONSTEXPRconstexpr |
| 665 | vector(vector&& __rv, const allocator_type& __m, true_type) noexcept |
| 666 | : _Base(__m, std::move(__rv)) |
| 667 | { } |
| 668 | |
| 669 | _GLIBCXX20_CONSTEXPRconstexpr |
| 670 | vector(vector&& __rv, const allocator_type& __m, false_type) |
| 671 | : _Base(__m) |
| 672 | { |
| 673 | if (__rv.get_allocator() == __m) |
| 674 | this->_M_impl._M_swap_data(__rv._M_impl); |
| 675 | else if (!__rv.empty()) |
| 676 | { |
| 677 | this->_M_create_storage(__rv.size()); |
| 678 | this->_M_impl._M_finish = |
| 679 | std::__uninitialized_move_a(__rv.begin(), __rv.end(), |
| 680 | this->_M_impl._M_start, |
| 681 | _M_get_Tp_allocator()); |
| 682 | __rv.clear(); |
| 683 | } |
| 684 | } |
| 685 | |
| 686 | public: |
| 687 | /// Move constructor with alternative allocator |
| 688 | _GLIBCXX20_CONSTEXPRconstexpr |
| 689 | vector(vector&& __rv, const __type_identity_t<allocator_type>& __m) |
| 690 | noexcept( noexcept( |
| 691 | vector(std::declval<vector&&>(), std::declval<const allocator_type&>(), |
| 692 | std::declval<typename _Alloc_traits::is_always_equal>())) ) |
| 693 | : vector(std::move(__rv), __m, typename _Alloc_traits::is_always_equal{}) |
| 694 | { } |
| 695 | |
| 696 | /** |
| 697 | * @brief Builds a %vector from an initializer list. |
| 698 | * @param __l An initializer_list. |
| 699 | * @param __a An allocator. |
| 700 | * |
| 701 | * Create a %vector consisting of copies of the elements in the |
| 702 | * initializer_list @a __l. |
| 703 | * |
| 704 | * This will call the element type's copy constructor N times |
| 705 | * (where N is @a __l.size()) and do no memory reallocation. |
| 706 | */ |
| 707 | _GLIBCXX20_CONSTEXPRconstexpr |
| 708 | vector(initializer_list<value_type> __l, |
| 709 | const allocator_type& __a = allocator_type()) |
| 710 | : _Base(__a) |
| 711 | { |
| 712 | _M_range_initialize_n(__l.begin(), __l.end(), __l.size()); |
| 713 | } |
| 714 | #endif |
| 715 | |
| 716 | /** |
| 717 | * @brief Builds a %vector from a range. |
| 718 | * @param __first An input iterator. |
| 719 | * @param __last An input iterator. |
| 720 | * @param __a An allocator. |
| 721 | * |
| 722 | * Create a %vector consisting of copies of the elements from |
| 723 | * [first,last). |
| 724 | * |
| 725 | * If the iterators are forward, bidirectional, or |
| 726 | * random-access, then this will call the elements' copy |
| 727 | * constructor N times (where N is distance(first,last)) and do |
| 728 | * no memory reallocation. But if only input iterators are |
| 729 | * used, then this will do at most 2N calls to the copy |
| 730 | * constructor, and logN memory reallocations. |
| 731 | */ |
| 732 | #if __cplusplus202002L >= 201103L |
| 733 | template<typename _InputIterator, |
| 734 | typename = std::_RequireInputIter<_InputIterator>> |
| 735 | _GLIBCXX20_CONSTEXPRconstexpr |
| 736 | vector(_InputIterator __first, _InputIterator __last, |
| 737 | const allocator_type& __a = allocator_type()) |
| 738 | : _Base(__a) |
| 739 | { |
| 740 | #if __glibcxx_concepts202002L // C++ >= C++20 |
| 741 | if constexpr (sized_sentinel_for<_InputIterator, _InputIterator> |
| 742 | || forward_iterator<_InputIterator>) |
| 743 | { |
| 744 | const auto __n |
| 745 | = static_cast<size_type>(ranges::distance(__first, __last)); |
| 746 | _M_range_initialize_n(__first, __last, __n); |
| 747 | return; |
| 748 | } |
| 749 | else |
| 750 | #endif |
| 751 | _M_range_initialize(__first, __last, |
| 752 | std::__iterator_category(__first)); |
| 753 | } |
| 754 | #else |
| 755 | template<typename _InputIterator> |
| 756 | vector(_InputIterator __first, _InputIterator __last, |
| 757 | const allocator_type& __a = allocator_type()) |
| 758 | : _Base(__a) |
| 759 | { |
| 760 | // Check whether it's an integral type. If so, it's not an iterator. |
| 761 | typedef typename std::__is_integer<_InputIterator>::__type _Integral; |
| 762 | _M_initialize_dispatch(__first, __last, _Integral()); |
| 763 | } |
| 764 | #endif |
| 765 | |
| 766 | #if __glibcxx_containers_ranges // C++ >= 23 |
| 767 | /** |
| 768 | * @brief Construct a vector from a range. |
| 769 | * @param __rg A range of values that are convertible to `bool`. |
| 770 | * @since C++23 |
| 771 | */ |
| 772 | template<__detail::__container_compatible_range<_Tp> _Rg> |
| 773 | constexpr |
| 774 | vector(from_range_t, _Rg&& __rg, const _Alloc& __a = _Alloc()) |
| 775 | : vector(__a) |
| 776 | { |
| 777 | if constexpr (ranges::forward_range<_Rg> || ranges::sized_range<_Rg>) |
| 778 | { |
| 779 | const auto __n = static_cast<size_type>(ranges::distance(__rg)); |
| 780 | _M_range_initialize_n(ranges::begin(__rg), ranges::end(__rg), |
| 781 | __n); |
| 782 | } |
| 783 | else |
| 784 | { |
| 785 | auto __first = ranges::begin(__rg); |
| 786 | const auto __last = ranges::end(__rg); |
| 787 | for (; __first != __last; ++__first) |
| 788 | emplace_back(*__first); |
| 789 | } |
| 790 | } |
| 791 | #endif |
| 792 | |
| 793 | /** |
| 794 | * The dtor only erases the elements, and note that if the |
| 795 | * elements themselves are pointers, the pointed-to memory is |
| 796 | * not touched in any way. Managing the pointer is the user's |
| 797 | * responsibility. |
| 798 | */ |
| 799 | _GLIBCXX20_CONSTEXPRconstexpr |
| 800 | ~vector() _GLIBCXX_NOEXCEPTnoexcept |
| 801 | { |
| 802 | std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, |
| 803 | _M_get_Tp_allocator()); |
| 804 | _GLIBCXX_ASAN_ANNOTATE_BEFORE_DEALLOC; |
| 805 | } |
| 806 | |
| 807 | /** |
| 808 | * @brief %Vector assignment operator. |
| 809 | * @param __x A %vector of identical element and allocator types. |
| 810 | * |
| 811 | * All the elements of @a __x are copied, but any unused capacity in |
| 812 | * @a __x will not be copied. |
| 813 | * |
| 814 | * Whether the allocator is copied depends on the allocator traits. |
| 815 | */ |
| 816 | _GLIBCXX20_CONSTEXPRconstexpr |
| 817 | vector& |
| 818 | operator=(const vector& __x); |
| 819 | |
| 820 | #if __cplusplus202002L >= 201103L |
| 821 | /** |
| 822 | * @brief %Vector move assignment operator. |
| 823 | * @param __x A %vector of identical element and allocator types. |
| 824 | * |
| 825 | * The contents of @a __x are moved into this %vector (without copying, |
| 826 | * if the allocators permit it). |
| 827 | * Afterwards @a __x is a valid, but unspecified %vector. |
| 828 | * |
| 829 | * Whether the allocator is moved depends on the allocator traits. |
| 830 | */ |
| 831 | _GLIBCXX20_CONSTEXPRconstexpr |
| 832 | vector& |
| 833 | operator=(vector&& __x) noexcept(_Alloc_traits::_S_nothrow_move()) |
| 834 | { |
| 835 | constexpr bool __move_storage = |
| 836 | _Alloc_traits::_S_propagate_on_move_assign() |
| 837 | || _Alloc_traits::_S_always_equal(); |
| 838 | _M_move_assign(std::move(__x), __bool_constant<__move_storage>()); |
| 839 | return *this; |
| 840 | } |
| 841 | |
| 842 | /** |
| 843 | * @brief %Vector list assignment operator. |
| 844 | * @param __l An initializer_list. |
| 845 | * |
| 846 | * This function fills a %vector with copies of the elements in the |
| 847 | * initializer list @a __l. |
| 848 | * |
| 849 | * Note that the assignment completely changes the %vector and |
| 850 | * that the resulting %vector's size is the same as the number |
| 851 | * of elements assigned. |
| 852 | */ |
| 853 | _GLIBCXX20_CONSTEXPRconstexpr |
| 854 | vector& |
| 855 | operator=(initializer_list<value_type> __l) |
| 856 | { |
| 857 | this->_M_assign_aux(__l.begin(), __l.end(), |
| 858 | random_access_iterator_tag()); |
| 859 | return *this; |
| 860 | } |
| 861 | #endif |
| 862 | |
| 863 | /** |
| 864 | * @brief Assigns a given value to a %vector. |
| 865 | * @param __n Number of elements to be assigned. |
| 866 | * @param __val Value to be assigned. |
| 867 | * |
| 868 | * This function fills a %vector with @a __n copies of the given |
| 869 | * value. Note that the assignment completely changes the |
| 870 | * %vector and that the resulting %vector's size is the same as |
| 871 | * the number of elements assigned. |
| 872 | */ |
| 873 | _GLIBCXX20_CONSTEXPRconstexpr |
| 874 | void |
| 875 | assign(size_type __n, const value_type& __val) |
| 876 | { _M_fill_assign(__n, __val); } |
| 877 | |
| 878 | /** |
| 879 | * @brief Assigns a range to a %vector. |
| 880 | * @param __first An input iterator. |
| 881 | * @param __last An input iterator. |
| 882 | * |
| 883 | * This function fills a %vector with copies of the elements in the |
| 884 | * range [__first,__last). |
| 885 | * |
| 886 | * Note that the assignment completely changes the %vector and |
| 887 | * that the resulting %vector's size is the same as the number |
| 888 | * of elements assigned. |
| 889 | */ |
| 890 | #if __cplusplus202002L >= 201103L |
| 891 | template<typename _InputIterator, |
| 892 | typename = std::_RequireInputIter<_InputIterator>> |
| 893 | _GLIBCXX20_CONSTEXPRconstexpr |
| 894 | void |
| 895 | assign(_InputIterator __first, _InputIterator __last) |
| 896 | { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } |
| 897 | #else |
| 898 | template<typename _InputIterator> |
| 899 | void |
| 900 | assign(_InputIterator __first, _InputIterator __last) |
| 901 | { |
| 902 | // Check whether it's an integral type. If so, it's not an iterator. |
| 903 | typedef typename std::__is_integer<_InputIterator>::__type _Integral; |
| 904 | _M_assign_dispatch(__first, __last, _Integral()); |
| 905 | } |
| 906 | #endif |
| 907 | |
| 908 | #if __cplusplus202002L >= 201103L |
| 909 | /** |
| 910 | * @brief Assigns an initializer list to a %vector. |
| 911 | * @param __l An initializer_list. |
| 912 | * |
| 913 | * This function fills a %vector with copies of the elements in the |
| 914 | * initializer list @a __l. |
| 915 | * |
| 916 | * Note that the assignment completely changes the %vector and |
| 917 | * that the resulting %vector's size is the same as the number |
| 918 | * of elements assigned. |
| 919 | */ |
| 920 | _GLIBCXX20_CONSTEXPRconstexpr |
| 921 | void |
| 922 | assign(initializer_list<value_type> __l) |
| 923 | { |
| 924 | this->_M_assign_aux(__l.begin(), __l.end(), |
| 925 | random_access_iterator_tag()); |
| 926 | } |
| 927 | #endif |
| 928 | |
| 929 | #if __glibcxx_containers_ranges // C++ >= 23 |
| 930 | /** |
| 931 | * @brief Assign a range to the vector. |
| 932 | * @param __rg A range of values that are convertible to `value_type`. |
| 933 | * @pre `__rg` and `*this` do not overlap. |
| 934 | * @since C++23 |
| 935 | */ |
| 936 | template<__detail::__container_compatible_range<_Tp> _Rg> |
| 937 | constexpr void |
| 938 | assign_range(_Rg&& __rg) |
| 939 | { |
| 940 | static_assert(assignable_from<_Tp&, ranges::range_reference_t<_Rg>>); |
| 941 | |
| 942 | if constexpr (ranges::forward_range<_Rg> || ranges::sized_range<_Rg>) |
| 943 | { |
| 944 | const auto __n = size_type(ranges::distance(__rg)); |
| 945 | if (__n <= size()) |
| 946 | { |
| 947 | auto __res = ranges::copy(__rg, this->_M_impl._M_start); |
| 948 | _M_erase_at_end(__res.out); |
| 949 | return; |
| 950 | } |
| 951 | |
| 952 | reserve(__n); |
| 953 | auto __first = ranges::copy_n(ranges::begin(__rg), size(), |
| 954 | this->_M_impl._M_start).in; |
| 955 | [[maybe_unused]] const auto __diff = __n - size(); |
| 956 | _GLIBCXX_ASAN_ANNOTATE_GROW(__diff); |
| 957 | _Base::_M_append_range(ranges::subrange(std::move(__first), |
| 958 | ranges::end(__rg))); |
| 959 | _GLIBCXX_ASAN_ANNOTATE_GREW(__diff); |
| 960 | } |
| 961 | else // input_range<_Rg> && !sized_range<_Rg> |
| 962 | { |
| 963 | auto __first = ranges::begin(__rg); |
| 964 | const auto __last = ranges::end(__rg); |
| 965 | pointer __ptr = this->_M_impl._M_start; |
| 966 | pointer const __end = this->_M_impl._M_finish; |
| 967 | |
| 968 | while (__ptr < __end && __first != __last) |
| 969 | { |
| 970 | *__ptr = *__first; |
| 971 | ++__ptr; |
| 972 | ++__first; |
| 973 | } |
| 974 | |
| 975 | if (__first == __last) |
| 976 | _M_erase_at_end(__ptr); |
| 977 | else |
| 978 | { |
| 979 | do |
| 980 | emplace_back(*__first); |
| 981 | while (++__first != __last); |
| 982 | } |
| 983 | } |
| 984 | } |
| 985 | #endif // containers_ranges |
| 986 | |
| 987 | /// Get a copy of the memory allocation object. |
| 988 | using _Base::get_allocator; |
| 989 | |
| 990 | // iterators |
| 991 | /** |
| 992 | * Returns a read/write iterator that points to the first |
| 993 | * element in the %vector. Iteration is done in ordinary |
| 994 | * element order. |
| 995 | */ |
| 996 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 997 | iterator |
| 998 | begin() _GLIBCXX_NOEXCEPTnoexcept |
| 999 | { return iterator(this->_M_impl._M_start); } |
| 1000 | |
| 1001 | /** |
| 1002 | * Returns a read-only (constant) iterator that points to the |
| 1003 | * first element in the %vector. Iteration is done in ordinary |
| 1004 | * element order. |
| 1005 | */ |
| 1006 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1007 | const_iterator |
| 1008 | begin() const _GLIBCXX_NOEXCEPTnoexcept |
| 1009 | { return const_iterator(this->_M_impl._M_start); } |
| 1010 | |
| 1011 | /** |
| 1012 | * Returns a read/write iterator that points one past the last |
| 1013 | * element in the %vector. Iteration is done in ordinary |
| 1014 | * element order. |
| 1015 | */ |
| 1016 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1017 | iterator |
| 1018 | end() _GLIBCXX_NOEXCEPTnoexcept |
| 1019 | { return iterator(this->_M_impl._M_finish); } |
| 1020 | |
| 1021 | /** |
| 1022 | * Returns a read-only (constant) iterator that points one past |
| 1023 | * the last element in the %vector. Iteration is done in |
| 1024 | * ordinary element order. |
| 1025 | */ |
| 1026 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1027 | const_iterator |
| 1028 | end() const _GLIBCXX_NOEXCEPTnoexcept |
| 1029 | { return const_iterator(this->_M_impl._M_finish); } |
| 1030 | |
| 1031 | /** |
| 1032 | * Returns a read/write reverse iterator that points to the |
| 1033 | * last element in the %vector. Iteration is done in reverse |
| 1034 | * element order. |
| 1035 | */ |
| 1036 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1037 | reverse_iterator |
| 1038 | rbegin() _GLIBCXX_NOEXCEPTnoexcept |
| 1039 | { return reverse_iterator(end()); } |
| 1040 | |
| 1041 | /** |
| 1042 | * Returns a read-only (constant) reverse iterator that points |
| 1043 | * to the last element in the %vector. Iteration is done in |
| 1044 | * reverse element order. |
| 1045 | */ |
| 1046 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1047 | const_reverse_iterator |
| 1048 | rbegin() const _GLIBCXX_NOEXCEPTnoexcept |
| 1049 | { return const_reverse_iterator(end()); } |
| 1050 | |
| 1051 | /** |
| 1052 | * Returns a read/write reverse iterator that points to one |
| 1053 | * before the first element in the %vector. Iteration is done |
| 1054 | * in reverse element order. |
| 1055 | */ |
| 1056 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1057 | reverse_iterator |
| 1058 | rend() _GLIBCXX_NOEXCEPTnoexcept |
| 1059 | { return reverse_iterator(begin()); } |
| 1060 | |
| 1061 | /** |
| 1062 | * Returns a read-only (constant) reverse iterator that points |
| 1063 | * to one before the first element in the %vector. Iteration |
| 1064 | * is done in reverse element order. |
| 1065 | */ |
| 1066 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1067 | const_reverse_iterator |
| 1068 | rend() const _GLIBCXX_NOEXCEPTnoexcept |
| 1069 | { return const_reverse_iterator(begin()); } |
| 1070 | |
| 1071 | #if __cplusplus202002L >= 201103L |
| 1072 | /** |
| 1073 | * Returns a read-only (constant) iterator that points to the |
| 1074 | * first element in the %vector. Iteration is done in ordinary |
| 1075 | * element order. |
| 1076 | */ |
| 1077 | [[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1078 | const_iterator |
| 1079 | cbegin() const noexcept |
| 1080 | { return const_iterator(this->_M_impl._M_start); } |
| 1081 | |
| 1082 | /** |
| 1083 | * Returns a read-only (constant) iterator that points one past |
| 1084 | * the last element in the %vector. Iteration is done in |
| 1085 | * ordinary element order. |
| 1086 | */ |
| 1087 | [[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1088 | const_iterator |
| 1089 | cend() const noexcept |
| 1090 | { return const_iterator(this->_M_impl._M_finish); } |
| 1091 | |
| 1092 | /** |
| 1093 | * Returns a read-only (constant) reverse iterator that points |
| 1094 | * to the last element in the %vector. Iteration is done in |
| 1095 | * reverse element order. |
| 1096 | */ |
| 1097 | [[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1098 | const_reverse_iterator |
| 1099 | crbegin() const noexcept |
| 1100 | { return const_reverse_iterator(end()); } |
| 1101 | |
| 1102 | /** |
| 1103 | * Returns a read-only (constant) reverse iterator that points |
| 1104 | * to one before the first element in the %vector. Iteration |
| 1105 | * is done in reverse element order. |
| 1106 | */ |
| 1107 | [[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1108 | const_reverse_iterator |
| 1109 | crend() const noexcept |
| 1110 | { return const_reverse_iterator(begin()); } |
| 1111 | #endif |
| 1112 | |
| 1113 | // [23.2.4.2] capacity |
| 1114 | /** Returns the number of elements in the %vector. */ |
| 1115 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1116 | size_type |
| 1117 | size() const _GLIBCXX_NOEXCEPTnoexcept |
| 1118 | { |
| 1119 | ptrdiff_t __dif = this->_M_impl._M_finish - this->_M_impl._M_start; |
| 1120 | if (__dif < 0) |
| 1121 | __builtin_unreachable (); |
| 1122 | return size_type(__dif); |
| 1123 | } |
| 1124 | |
| 1125 | /** Returns the size() of the largest possible %vector. */ |
| 1126 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1127 | size_type |
| 1128 | max_size() const _GLIBCXX_NOEXCEPTnoexcept |
| 1129 | { return _S_max_size(_M_get_Tp_allocator()); } |
| 1130 | |
| 1131 | #if __cplusplus202002L >= 201103L |
| 1132 | /** |
| 1133 | * @brief Resizes the %vector to the specified number of elements. |
| 1134 | * @param __new_size Number of elements the %vector should contain. |
| 1135 | * |
| 1136 | * This function will %resize the %vector to the specified |
| 1137 | * number of elements. If the number is smaller than the |
| 1138 | * %vector's current size the %vector is truncated, otherwise |
| 1139 | * default constructed elements are appended. |
| 1140 | */ |
| 1141 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1142 | void |
| 1143 | resize(size_type __new_size) |
| 1144 | { |
| 1145 | if (__new_size > size()) |
| 1146 | _M_default_append(__new_size - size()); |
| 1147 | else if (__new_size < size()) |
| 1148 | _M_erase_at_end(this->_M_impl._M_start + __new_size); |
| 1149 | } |
| 1150 | |
| 1151 | /** |
| 1152 | * @brief Resizes the %vector to the specified number of elements. |
| 1153 | * @param __new_size Number of elements the %vector should contain. |
| 1154 | * @param __x Data with which new elements should be populated. |
| 1155 | * |
| 1156 | * This function will %resize the %vector to the specified |
| 1157 | * number of elements. If the number is smaller than the |
| 1158 | * %vector's current size the %vector is truncated, otherwise |
| 1159 | * the %vector is extended and new elements are populated with |
| 1160 | * given data. |
| 1161 | */ |
| 1162 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1163 | void |
| 1164 | resize(size_type __new_size, const value_type& __x) |
| 1165 | { |
| 1166 | if (__new_size > size()) |
| 1167 | _M_fill_insert(end(), __new_size - size(), __x); |
| 1168 | else if (__new_size < size()) |
| 1169 | _M_erase_at_end(this->_M_impl._M_start + __new_size); |
| 1170 | } |
| 1171 | #else |
| 1172 | /** |
| 1173 | * @brief Resizes the %vector to the specified number of elements. |
| 1174 | * @param __new_size Number of elements the %vector should contain. |
| 1175 | * @param __x Data with which new elements should be populated. |
| 1176 | * |
| 1177 | * This function will %resize the %vector to the specified |
| 1178 | * number of elements. If the number is smaller than the |
| 1179 | * %vector's current size the %vector is truncated, otherwise |
| 1180 | * the %vector is extended and new elements are populated with |
| 1181 | * given data. |
| 1182 | */ |
| 1183 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1184 | void |
| 1185 | resize(size_type __new_size, value_type __x = value_type()) |
| 1186 | { |
| 1187 | if (__new_size > size()) |
| 1188 | _M_fill_insert(end(), __new_size - size(), __x); |
| 1189 | else if (__new_size < size()) |
| 1190 | _M_erase_at_end(this->_M_impl._M_start + __new_size); |
| 1191 | } |
| 1192 | #endif |
| 1193 | |
| 1194 | #if __cplusplus202002L >= 201103L |
| 1195 | /** A non-binding request to reduce capacity() to size(). */ |
| 1196 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1197 | void |
| 1198 | shrink_to_fit() |
| 1199 | { _M_shrink_to_fit(); } |
| 1200 | #endif |
| 1201 | |
| 1202 | /** |
| 1203 | * Returns the total number of elements that the %vector can |
| 1204 | * hold before needing to allocate more memory. |
| 1205 | */ |
| 1206 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1207 | size_type |
| 1208 | capacity() const _GLIBCXX_NOEXCEPTnoexcept |
| 1209 | { |
| 1210 | ptrdiff_t __dif = this->_M_impl._M_end_of_storage |
| 1211 | - this->_M_impl._M_start; |
| 1212 | if (__dif < 0) |
| 1213 | __builtin_unreachable (); |
| 1214 | return size_type(__dif); |
| 1215 | } |
| 1216 | |
| 1217 | /** |
| 1218 | * Returns true if the %vector is empty. (Thus begin() would |
| 1219 | * equal end().) |
| 1220 | */ |
| 1221 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1222 | bool |
| 1223 | empty() const _GLIBCXX_NOEXCEPTnoexcept |
| 1224 | { return begin() == end(); } |
| 1225 | |
| 1226 | /** |
| 1227 | * @brief Attempt to preallocate enough memory for specified number of |
| 1228 | * elements. |
| 1229 | * @param __n Number of elements required. |
| 1230 | * @throw std::length_error If @a n exceeds @c max_size(). |
| 1231 | * |
| 1232 | * This function attempts to reserve enough memory for the |
| 1233 | * %vector to hold the specified number of elements. If the |
| 1234 | * number requested is more than max_size(), length_error is |
| 1235 | * thrown. |
| 1236 | * |
| 1237 | * The advantage of this function is that if optimal code is a |
| 1238 | * necessity and the user can determine the number of elements |
| 1239 | * that will be required, the user can reserve the memory in |
| 1240 | * %advance, and thus prevent a possible reallocation of memory |
| 1241 | * and copying of %vector data. |
| 1242 | */ |
| 1243 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1244 | void |
| 1245 | reserve(size_type __n); |
| 1246 | |
| 1247 | // element access |
| 1248 | /** |
| 1249 | * @brief Subscript access to the data contained in the %vector. |
| 1250 | * @param __n The index of the element for which data should be |
| 1251 | * accessed. |
| 1252 | * @return Read/write reference to data. |
| 1253 | * |
| 1254 | * This operator allows for easy, array-style, data access. |
| 1255 | * Note that data access with this operator is unchecked and |
| 1256 | * out_of_range lookups are not defined. (For checked lookups |
| 1257 | * see at().) |
| 1258 | */ |
| 1259 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1260 | reference |
| 1261 | operator[](size_type __n) _GLIBCXX_NOEXCEPTnoexcept |
| 1262 | { |
| 1263 | __glibcxx_requires_subscript(__n)do { if (std::__is_constant_evaluated() && !bool(__n < this->size())) std::__glibcxx_assert_fail(); } while (false ); |
| 1264 | return *(this->_M_impl._M_start + __n); |
| 1265 | } |
| 1266 | |
| 1267 | /** |
| 1268 | * @brief Subscript access to the data contained in the %vector. |
| 1269 | * @param __n The index of the element for which data should be |
| 1270 | * accessed. |
| 1271 | * @return Read-only (constant) reference to data. |
| 1272 | * |
| 1273 | * This operator allows for easy, array-style, data access. |
| 1274 | * Note that data access with this operator is unchecked and |
| 1275 | * out_of_range lookups are not defined. (For checked lookups |
| 1276 | * see at().) |
| 1277 | */ |
| 1278 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1279 | const_reference |
| 1280 | operator[](size_type __n) const _GLIBCXX_NOEXCEPTnoexcept |
| 1281 | { |
| 1282 | __glibcxx_requires_subscript(__n)do { if (std::__is_constant_evaluated() && !bool(__n < this->size())) std::__glibcxx_assert_fail(); } while (false ); |
| 1283 | return *(this->_M_impl._M_start + __n); |
| 1284 | } |
| 1285 | |
| 1286 | protected: |
| 1287 | /// Safety check used only from at(). |
| 1288 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1289 | void |
| 1290 | _M_range_check(size_type __n) const |
| 1291 | { |
| 1292 | if (__n >= this->size()) |
| 1293 | __throw_out_of_range_fmt(__N("vector::_M_range_check: __n "("vector::_M_range_check: __n " "(which is %zu) >= this->size() " "(which is %zu)") |
| 1294 | "(which is %zu) >= this->size() "("vector::_M_range_check: __n " "(which is %zu) >= this->size() " "(which is %zu)") |
| 1295 | "(which is %zu)")("vector::_M_range_check: __n " "(which is %zu) >= this->size() " "(which is %zu)"), |
| 1296 | __n, this->size()); |
| 1297 | } |
| 1298 | |
| 1299 | public: |
| 1300 | /** |
| 1301 | * @brief Provides access to the data contained in the %vector. |
| 1302 | * @param __n The index of the element for which data should be |
| 1303 | * accessed. |
| 1304 | * @return Read/write reference to data. |
| 1305 | * @throw std::out_of_range If @a __n is an invalid index. |
| 1306 | * |
| 1307 | * This function provides for safer data access. The parameter |
| 1308 | * is first checked that it is in the range of the vector. The |
| 1309 | * function throws out_of_range if the check fails. |
| 1310 | */ |
| 1311 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1312 | reference |
| 1313 | at(size_type __n) |
| 1314 | { |
| 1315 | _M_range_check(__n); |
| 1316 | return (*this)[__n]; |
| 1317 | } |
| 1318 | |
| 1319 | /** |
| 1320 | * @brief Provides access to the data contained in the %vector. |
| 1321 | * @param __n The index of the element for which data should be |
| 1322 | * accessed. |
| 1323 | * @return Read-only (constant) reference to data. |
| 1324 | * @throw std::out_of_range If @a __n is an invalid index. |
| 1325 | * |
| 1326 | * This function provides for safer data access. The parameter |
| 1327 | * is first checked that it is in the range of the vector. The |
| 1328 | * function throws out_of_range if the check fails. |
| 1329 | */ |
| 1330 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1331 | const_reference |
| 1332 | at(size_type __n) const |
| 1333 | { |
| 1334 | _M_range_check(__n); |
| 1335 | return (*this)[__n]; |
| 1336 | } |
| 1337 | |
| 1338 | /** |
| 1339 | * Returns a read/write reference to the data at the first |
| 1340 | * element of the %vector. |
| 1341 | */ |
| 1342 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1343 | reference |
| 1344 | front() _GLIBCXX_NOEXCEPTnoexcept |
| 1345 | { |
| 1346 | __glibcxx_requires_nonempty()do { if (std::__is_constant_evaluated() && !bool(!this ->empty())) std::__glibcxx_assert_fail(); } while (false); |
| 1347 | return *begin(); |
| 1348 | } |
| 1349 | |
| 1350 | /** |
| 1351 | * Returns a read-only (constant) reference to the data at the first |
| 1352 | * element of the %vector. |
| 1353 | */ |
| 1354 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1355 | const_reference |
| 1356 | front() const _GLIBCXX_NOEXCEPTnoexcept |
| 1357 | { |
| 1358 | __glibcxx_requires_nonempty()do { if (std::__is_constant_evaluated() && !bool(!this ->empty())) std::__glibcxx_assert_fail(); } while (false); |
| 1359 | return *begin(); |
| 1360 | } |
| 1361 | |
| 1362 | /** |
| 1363 | * Returns a read/write reference to the data at the last |
| 1364 | * element of the %vector. |
| 1365 | */ |
| 1366 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1367 | reference |
| 1368 | back() _GLIBCXX_NOEXCEPTnoexcept |
| 1369 | { |
| 1370 | __glibcxx_requires_nonempty()do { if (std::__is_constant_evaluated() && !bool(!this ->empty())) std::__glibcxx_assert_fail(); } while (false); |
| 1371 | return *(end() - 1); |
| 1372 | } |
| 1373 | |
| 1374 | /** |
| 1375 | * Returns a read-only (constant) reference to the data at the |
| 1376 | * last element of the %vector. |
| 1377 | */ |
| 1378 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1379 | const_reference |
| 1380 | back() const _GLIBCXX_NOEXCEPTnoexcept |
| 1381 | { |
| 1382 | __glibcxx_requires_nonempty()do { if (std::__is_constant_evaluated() && !bool(!this ->empty())) std::__glibcxx_assert_fail(); } while (false); |
| 1383 | return *(end() - 1); |
| 1384 | } |
| 1385 | |
| 1386 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
| 1387 | // DR 464. Suggestion for new member functions in standard containers. |
| 1388 | // data access |
| 1389 | /** |
| 1390 | * Returns a pointer such that [data(), data() + size()) is a valid |
| 1391 | * range. For a non-empty %vector, data() == &front(). |
| 1392 | */ |
| 1393 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1394 | _Tp* |
| 1395 | data() _GLIBCXX_NOEXCEPTnoexcept |
| 1396 | { return _M_data_ptr(this->_M_impl._M_start); } |
| 1397 | |
| 1398 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 1399 | const _Tp* |
| 1400 | data() const _GLIBCXX_NOEXCEPTnoexcept |
| 1401 | { return _M_data_ptr(this->_M_impl._M_start); } |
| 1402 | |
| 1403 | // [23.2.4.3] modifiers |
| 1404 | /** |
| 1405 | * @brief Add data to the end of the %vector. |
| 1406 | * @param __x Data to be added. |
| 1407 | * |
| 1408 | * This is a typical stack operation. The function creates an |
| 1409 | * element at the end of the %vector and assigns the given data |
| 1410 | * to it. Due to the nature of a %vector this operation can be |
| 1411 | * done in constant time if the %vector has preallocated space |
| 1412 | * available. |
| 1413 | */ |
| 1414 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1415 | void |
| 1416 | push_back(const value_type& __x) |
| 1417 | { |
| 1418 | if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage) |
| 1419 | { |
| 1420 | _GLIBCXX_ASAN_ANNOTATE_GROW(1); |
| 1421 | _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish, |
| 1422 | __x); |
| 1423 | ++this->_M_impl._M_finish; |
| 1424 | _GLIBCXX_ASAN_ANNOTATE_GREW(1); |
| 1425 | } |
| 1426 | else |
| 1427 | _M_realloc_append(__x); |
| 1428 | } |
| 1429 | |
| 1430 | #if __cplusplus202002L >= 201103L |
| 1431 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1432 | void |
| 1433 | push_back(value_type&& __x) |
| 1434 | { emplace_back(std::move(__x)); } |
| 1435 | |
| 1436 | template<typename... _Args> |
| 1437 | #if __cplusplus202002L > 201402L |
| 1438 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1439 | reference |
| 1440 | #else |
| 1441 | void |
| 1442 | #endif |
| 1443 | emplace_back(_Args&&... __args); |
| 1444 | #endif |
| 1445 | |
| 1446 | /** |
| 1447 | * @brief Removes last element. |
| 1448 | * |
| 1449 | * This is a typical stack operation. It shrinks the %vector by one. |
| 1450 | * |
| 1451 | * Note that no data is returned, and if the last element's |
| 1452 | * data is needed, it should be retrieved before pop_back() is |
| 1453 | * called. |
| 1454 | */ |
| 1455 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1456 | void |
| 1457 | pop_back() _GLIBCXX_NOEXCEPTnoexcept |
| 1458 | { |
| 1459 | __glibcxx_requires_nonempty()do { if (std::__is_constant_evaluated() && !bool(!this ->empty())) std::__glibcxx_assert_fail(); } while (false); |
| 1460 | --this->_M_impl._M_finish; |
| 1461 | _Alloc_traits::destroy(this->_M_impl, this->_M_impl._M_finish); |
| 1462 | _GLIBCXX_ASAN_ANNOTATE_SHRINK(1); |
| 1463 | } |
| 1464 | |
| 1465 | #if __cplusplus202002L >= 201103L |
| 1466 | /** |
| 1467 | * @brief Inserts an object in %vector before specified iterator. |
| 1468 | * @param __position A const_iterator into the %vector. |
| 1469 | * @param __args Arguments. |
| 1470 | * @return An iterator that points to the inserted data. |
| 1471 | * |
| 1472 | * This function will insert an object of type T constructed |
| 1473 | * with T(std::forward<Args>(args)...) before the specified location. |
| 1474 | * Note that this kind of operation could be expensive for a %vector |
| 1475 | * and if it is frequently used the user should consider using |
| 1476 | * std::list. |
| 1477 | */ |
| 1478 | template<typename... _Args> |
| 1479 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1480 | iterator |
| 1481 | emplace(const_iterator __position, _Args&&... __args) |
| 1482 | { return _M_emplace_aux(__position, std::forward<_Args>(__args)...); } |
| 1483 | |
| 1484 | /** |
| 1485 | * @brief Inserts given value into %vector before specified iterator. |
| 1486 | * @param __position A const_iterator into the %vector. |
| 1487 | * @param __x Data to be inserted. |
| 1488 | * @return An iterator that points to the inserted data. |
| 1489 | * |
| 1490 | * This function will insert a copy of the given value before |
| 1491 | * the specified location. Note that this kind of operation |
| 1492 | * could be expensive for a %vector and if it is frequently |
| 1493 | * used the user should consider using std::list. |
| 1494 | */ |
| 1495 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1496 | iterator |
| 1497 | insert(const_iterator __position, const value_type& __x); |
| 1498 | #else |
| 1499 | /** |
| 1500 | * @brief Inserts given value into %vector before specified iterator. |
| 1501 | * @param __position An iterator into the %vector. |
| 1502 | * @param __x Data to be inserted. |
| 1503 | * @return An iterator that points to the inserted data. |
| 1504 | * |
| 1505 | * This function will insert a copy of the given value before |
| 1506 | * the specified location. Note that this kind of operation |
| 1507 | * could be expensive for a %vector and if it is frequently |
| 1508 | * used the user should consider using std::list. |
| 1509 | */ |
| 1510 | iterator |
| 1511 | insert(iterator __position, const value_type& __x); |
| 1512 | #endif |
| 1513 | |
| 1514 | #if __cplusplus202002L >= 201103L |
| 1515 | /** |
| 1516 | * @brief Inserts given rvalue into %vector before specified iterator. |
| 1517 | * @param __position A const_iterator into the %vector. |
| 1518 | * @param __x Data to be inserted. |
| 1519 | * @return An iterator that points to the inserted data. |
| 1520 | * |
| 1521 | * This function will insert a copy of the given rvalue before |
| 1522 | * the specified location. Note that this kind of operation |
| 1523 | * could be expensive for a %vector and if it is frequently |
| 1524 | * used the user should consider using std::list. |
| 1525 | */ |
| 1526 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1527 | iterator |
| 1528 | insert(const_iterator __position, value_type&& __x) |
| 1529 | { return _M_insert_rval(__position, std::move(__x)); } |
| 1530 | |
| 1531 | /** |
| 1532 | * @brief Inserts an initializer_list into the %vector. |
| 1533 | * @param __position An iterator into the %vector. |
| 1534 | * @param __l An initializer_list. |
| 1535 | * |
| 1536 | * This function will insert copies of the data in the |
| 1537 | * initializer_list @a l into the %vector before the location |
| 1538 | * specified by @a position. |
| 1539 | * |
| 1540 | * Note that this kind of operation could be expensive for a |
| 1541 | * %vector and if it is frequently used the user should |
| 1542 | * consider using std::list. |
| 1543 | */ |
| 1544 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1545 | iterator |
| 1546 | insert(const_iterator __position, initializer_list<value_type> __l) |
| 1547 | { |
| 1548 | auto __offset = __position - cbegin(); |
| 1549 | _M_range_insert(begin() + __offset, __l.begin(), __l.end(), |
| 1550 | std::random_access_iterator_tag()); |
| 1551 | return begin() + __offset; |
| 1552 | } |
| 1553 | #endif |
| 1554 | |
| 1555 | #if __cplusplus202002L >= 201103L |
| 1556 | /** |
| 1557 | * @brief Inserts a number of copies of given data into the %vector. |
| 1558 | * @param __position A const_iterator into the %vector. |
| 1559 | * @param __n Number of elements to be inserted. |
| 1560 | * @param __x Data to be inserted. |
| 1561 | * @return An iterator that points to the inserted data. |
| 1562 | * |
| 1563 | * This function will insert a specified number of copies of |
| 1564 | * the given data before the location specified by @a position. |
| 1565 | * |
| 1566 | * Note that this kind of operation could be expensive for a |
| 1567 | * %vector and if it is frequently used the user should |
| 1568 | * consider using std::list. |
| 1569 | */ |
| 1570 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1571 | iterator |
| 1572 | insert(const_iterator __position, size_type __n, const value_type& __x) |
| 1573 | { |
| 1574 | difference_type __offset = __position - cbegin(); |
| 1575 | _M_fill_insert(begin() + __offset, __n, __x); |
| 1576 | return begin() + __offset; |
| 1577 | } |
| 1578 | #else |
| 1579 | /** |
| 1580 | * @brief Inserts a number of copies of given data into the %vector. |
| 1581 | * @param __position An iterator into the %vector. |
| 1582 | * @param __n Number of elements to be inserted. |
| 1583 | * @param __x Data to be inserted. |
| 1584 | * |
| 1585 | * This function will insert a specified number of copies of |
| 1586 | * the given data before the location specified by @a position. |
| 1587 | * |
| 1588 | * Note that this kind of operation could be expensive for a |
| 1589 | * %vector and if it is frequently used the user should |
| 1590 | * consider using std::list. |
| 1591 | */ |
| 1592 | void |
| 1593 | insert(iterator __position, size_type __n, const value_type& __x) |
| 1594 | { _M_fill_insert(__position, __n, __x); } |
| 1595 | #endif |
| 1596 | |
| 1597 | #if __cplusplus202002L >= 201103L |
| 1598 | /** |
| 1599 | * @brief Inserts a range into the %vector. |
| 1600 | * @param __position A const_iterator into the %vector. |
| 1601 | * @param __first An input iterator. |
| 1602 | * @param __last An input iterator. |
| 1603 | * @return An iterator that points to the inserted data. |
| 1604 | * |
| 1605 | * This function will insert copies of the data in the range |
| 1606 | * [__first,__last) into the %vector before the location specified |
| 1607 | * by @a pos. |
| 1608 | * |
| 1609 | * Note that this kind of operation could be expensive for a |
| 1610 | * %vector and if it is frequently used the user should |
| 1611 | * consider using std::list. |
| 1612 | */ |
| 1613 | template<typename _InputIterator, |
| 1614 | typename = std::_RequireInputIter<_InputIterator>> |
| 1615 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1616 | iterator |
| 1617 | insert(const_iterator __position, _InputIterator __first, |
| 1618 | _InputIterator __last) |
| 1619 | { |
| 1620 | difference_type __offset = __position - cbegin(); |
| 1621 | _M_range_insert(begin() + __offset, __first, __last, |
| 1622 | std::__iterator_category(__first)); |
| 1623 | return begin() + __offset; |
| 1624 | } |
| 1625 | #else |
| 1626 | /** |
| 1627 | * @brief Inserts a range into the %vector. |
| 1628 | * @param __position An iterator into the %vector. |
| 1629 | * @param __first An input iterator. |
| 1630 | * @param __last An input iterator. |
| 1631 | * |
| 1632 | * This function will insert copies of the data in the range |
| 1633 | * [__first,__last) into the %vector before the location specified |
| 1634 | * by @a pos. |
| 1635 | * |
| 1636 | * Note that this kind of operation could be expensive for a |
| 1637 | * %vector and if it is frequently used the user should |
| 1638 | * consider using std::list. |
| 1639 | */ |
| 1640 | template<typename _InputIterator> |
| 1641 | void |
| 1642 | insert(iterator __position, _InputIterator __first, |
| 1643 | _InputIterator __last) |
| 1644 | { |
| 1645 | // Check whether it's an integral type. If so, it's not an iterator. |
| 1646 | typedef typename std::__is_integer<_InputIterator>::__type _Integral; |
| 1647 | _M_insert_dispatch(__position, __first, __last, _Integral()); |
| 1648 | } |
| 1649 | #endif |
| 1650 | |
| 1651 | #if __glibcxx_containers_ranges // C++ >= 23 |
| 1652 | /** |
| 1653 | * @brief Insert a range into the vector. |
| 1654 | * @param __rg A range of values that are convertible to `value_type`. |
| 1655 | * @return An iterator that points to the first new element inserted, |
| 1656 | * or to `__pos` if `__rg` is an empty range. |
| 1657 | * @pre `__rg` and `*this` do not overlap. |
| 1658 | * @since C++23 |
| 1659 | */ |
| 1660 | template<__detail::__container_compatible_range<_Tp> _Rg> |
| 1661 | constexpr iterator |
| 1662 | insert_range(const_iterator __pos, _Rg&& __rg); |
| 1663 | |
| 1664 | /** |
| 1665 | * @brief Append a range at the end of the vector. |
| 1666 | * @param __rg A range of values that are convertible to `value_type`. |
| 1667 | * @since C++23 |
| 1668 | */ |
| 1669 | template<__detail::__container_compatible_range<_Tp> _Rg> |
| 1670 | constexpr void |
| 1671 | append_range(_Rg&& __rg) |
| 1672 | { |
| 1673 | // N.B. __rg may overlap with *this, so we must copy from __rg before |
| 1674 | // existing elements or iterators referring to *this are invalidated. |
| 1675 | // e.g. in v.append_range(views::concat(v, foo)) rg overlaps v. |
| 1676 | if constexpr (ranges::forward_range<_Rg> || ranges::sized_range<_Rg>) |
| 1677 | { |
| 1678 | const auto __n = size_type(ranges::distance(__rg)); |
| 1679 | |
| 1680 | // If there is no existing storage, there are no iterators that |
| 1681 | // can be referring to our storage, so it's safe to allocate now. |
| 1682 | if (capacity() == 0) |
| 1683 | reserve(__n); |
| 1684 | |
| 1685 | const auto __sz = size(); |
| 1686 | const auto __capacity = capacity(); |
| 1687 | if ((__capacity - __sz) >= __n) |
| 1688 | { |
| 1689 | _GLIBCXX_ASAN_ANNOTATE_GROW(__n); |
| 1690 | _Base::_M_append_range(__rg); |
| 1691 | _GLIBCXX_ASAN_ANNOTATE_GREW(__n); |
| 1692 | return; |
| 1693 | } |
| 1694 | |
| 1695 | const size_type __len = _M_check_len(__n, "vector::append_range"); |
| 1696 | |
| 1697 | pointer __old_start = this->_M_impl._M_start; |
| 1698 | pointer __old_finish = this->_M_impl._M_finish; |
| 1699 | |
| 1700 | allocator_type& __a = _M_get_Tp_allocator(); |
| 1701 | const pointer __start = this->_M_allocate(__len); |
| 1702 | const pointer __mid = __start + __sz; |
| 1703 | const pointer __back = __mid + __n; |
| 1704 | _Guard_alloc __guard(__start, __len, *this); |
| 1705 | std::__uninitialized_copy_a(ranges::begin(__rg), |
| 1706 | ranges::end(__rg), |
| 1707 | __mid, __a); |
| 1708 | |
| 1709 | if constexpr (_S_use_relocate()) |
| 1710 | _S_relocate(__old_start, __old_finish, __start, __a); |
| 1711 | else |
| 1712 | { |
| 1713 | // RAII type to destroy initialized elements. |
| 1714 | struct _Guard_elts |
| 1715 | { |
| 1716 | pointer _M_first, _M_last; // Elements to destroy |
| 1717 | _Tp_alloc_type& _M_alloc; |
| 1718 | |
| 1719 | constexpr |
| 1720 | _Guard_elts(pointer __f, pointer __l, _Tp_alloc_type& __a) |
| 1721 | : _M_first(__f), _M_last(__l), _M_alloc(__a) |
| 1722 | { } |
| 1723 | |
| 1724 | constexpr |
| 1725 | ~_Guard_elts() |
| 1726 | { std::_Destroy(_M_first, _M_last, _M_alloc); } |
| 1727 | |
| 1728 | _Guard_elts(_Guard_elts&&) = delete; |
| 1729 | }; |
| 1730 | _Guard_elts __guard_elts{__mid, __back, __a}; |
| 1731 | |
| 1732 | std::__uninitialized_move_a(__old_start, __old_finish, |
| 1733 | __start, __a); |
| 1734 | |
| 1735 | // Let old elements get destroyed by __guard_elts: |
| 1736 | __guard_elts._M_first = __old_start; |
| 1737 | __guard_elts._M_last = __old_finish; |
| 1738 | } |
| 1739 | |
| 1740 | // Now give ownership of old storage to __guard: |
| 1741 | __guard._M_storage = __old_start; |
| 1742 | __guard._M_len = __capacity; |
| 1743 | // Finally, take ownership of new storage: |
| 1744 | this->_M_impl._M_start = __start; |
| 1745 | this->_M_impl._M_finish = __back; |
| 1746 | this->_M_impl._M_end_of_storage = __start + __len; |
| 1747 | } |
| 1748 | else |
| 1749 | { |
| 1750 | auto __first = ranges::begin(__rg); |
| 1751 | const auto __last = ranges::end(__rg); |
| 1752 | |
| 1753 | // Fill up to the end of current capacity. |
| 1754 | for (auto __free = capacity() - size(); |
| 1755 | __first != __last && __free > 0; |
| 1756 | ++__first, (void) --__free) |
| 1757 | emplace_back(*__first); |
| 1758 | |
| 1759 | if (__first == __last) |
| 1760 | return; |
| 1761 | |
| 1762 | // Copy the rest of the range to a new vector. |
| 1763 | vector __tmp(_M_get_Tp_allocator()); |
| 1764 | for (; __first != __last; ++__first) |
| 1765 | __tmp.emplace_back(*__first); |
| 1766 | reserve(_M_check_len(__tmp.size(), "vector::append_range")); |
| 1767 | ranges::subrange __r(std::make_move_iterator(__tmp.begin()), |
| 1768 | std::make_move_iterator(__tmp.end())); |
| 1769 | append_range(__r); // This will take the fast path above. |
| 1770 | } |
| 1771 | } |
| 1772 | #endif // containers_ranges |
| 1773 | |
| 1774 | /** |
| 1775 | * @brief Remove element at given position. |
| 1776 | * @param __position Iterator pointing to element to be erased. |
| 1777 | * @return An iterator pointing to the next element (or end()). |
| 1778 | * |
| 1779 | * This function will erase the element at the given position and thus |
| 1780 | * shorten the %vector by one. |
| 1781 | * |
| 1782 | * Note This operation could be expensive and if it is |
| 1783 | * frequently used the user should consider using std::list. |
| 1784 | * The user is also cautioned that this function only erases |
| 1785 | * the element, and that if the element is itself a pointer, |
| 1786 | * the pointed-to memory is not touched in any way. Managing |
| 1787 | * the pointer is the user's responsibility. |
| 1788 | */ |
| 1789 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1790 | iterator |
| 1791 | #if __cplusplus202002L >= 201103L |
| 1792 | erase(const_iterator __position) |
| 1793 | { return _M_erase(begin() + (__position - cbegin())); } |
| 1794 | #else |
| 1795 | erase(iterator __position) |
| 1796 | { return _M_erase(__position); } |
| 1797 | #endif |
| 1798 | |
| 1799 | /** |
| 1800 | * @brief Remove a range of elements. |
| 1801 | * @param __first Iterator pointing to the first element to be erased. |
| 1802 | * @param __last Iterator pointing to one past the last element to be |
| 1803 | * erased. |
| 1804 | * @return An iterator pointing to the element pointed to by @a __last |
| 1805 | * prior to erasing (or end()). |
| 1806 | * |
| 1807 | * This function will erase the elements in the range |
| 1808 | * [__first,__last) and shorten the %vector accordingly. |
| 1809 | * |
| 1810 | * Note This operation could be expensive and if it is |
| 1811 | * frequently used the user should consider using std::list. |
| 1812 | * The user is also cautioned that this function only erases |
| 1813 | * the elements, and that if the elements themselves are |
| 1814 | * pointers, the pointed-to memory is not touched in any way. |
| 1815 | * Managing the pointer is the user's responsibility. |
| 1816 | */ |
| 1817 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1818 | iterator |
| 1819 | #if __cplusplus202002L >= 201103L |
| 1820 | erase(const_iterator __first, const_iterator __last) |
| 1821 | { |
| 1822 | const auto __beg = begin(); |
| 1823 | const auto __cbeg = cbegin(); |
| 1824 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg)); |
| 1825 | } |
| 1826 | #else |
| 1827 | erase(iterator __first, iterator __last) |
| 1828 | { return _M_erase(__first, __last); } |
| 1829 | #endif |
| 1830 | |
| 1831 | /** |
| 1832 | * @brief Swaps data with another %vector. |
| 1833 | * @param __x A %vector of the same element and allocator types. |
| 1834 | * |
| 1835 | * This exchanges the elements between two vectors in constant time. |
| 1836 | * (Three pointers, so it should be quite fast.) |
| 1837 | * Note that the global std::swap() function is specialized such that |
| 1838 | * std::swap(v1,v2) will feed to this function. |
| 1839 | * |
| 1840 | * Whether the allocators are swapped depends on the allocator traits. |
| 1841 | */ |
| 1842 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1843 | void |
| 1844 | swap(vector& __x) _GLIBCXX_NOEXCEPTnoexcept |
| 1845 | { |
| 1846 | #if __cplusplus202002L >= 201103L |
| 1847 | __glibcxx_assert(_Alloc_traits::propagate_on_container_swap::valuedo { if (std::__is_constant_evaluated() && !bool(_Alloc_traits ::propagate_on_container_swap::value || _M_get_Tp_allocator() == __x._M_get_Tp_allocator())) std::__glibcxx_assert_fail(); } while (false) |
| 1848 | || _M_get_Tp_allocator() == __x._M_get_Tp_allocator())do { if (std::__is_constant_evaluated() && !bool(_Alloc_traits ::propagate_on_container_swap::value || _M_get_Tp_allocator() == __x._M_get_Tp_allocator())) std::__glibcxx_assert_fail(); } while (false); |
| 1849 | #endif |
| 1850 | this->_M_impl._M_swap_data(__x._M_impl); |
| 1851 | _Alloc_traits::_S_on_swap(_M_get_Tp_allocator(), |
| 1852 | __x._M_get_Tp_allocator()); |
| 1853 | } |
| 1854 | |
| 1855 | /** |
| 1856 | * Erases all the elements. Note that this function only erases the |
| 1857 | * elements, and that if the elements themselves are pointers, the |
| 1858 | * pointed-to memory is not touched in any way. Managing the pointer is |
| 1859 | * the user's responsibility. |
| 1860 | */ |
| 1861 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1862 | void |
| 1863 | clear() _GLIBCXX_NOEXCEPTnoexcept |
| 1864 | { _M_erase_at_end(this->_M_impl._M_start); } |
| 1865 | |
| 1866 | private: |
| 1867 | // RAII guard for allocated storage. |
| 1868 | struct _Guard_alloc |
| 1869 | { |
| 1870 | pointer _M_storage; // Storage to deallocate |
| 1871 | size_type _M_len; |
| 1872 | _Base& _M_vect; |
| 1873 | |
| 1874 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1875 | _Guard_alloc(pointer __s, size_type __l, _Base& __vect) |
| 1876 | : _M_storage(__s), _M_len(__l), _M_vect(__vect) |
| 1877 | { } |
| 1878 | |
| 1879 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1880 | ~_Guard_alloc() |
| 1881 | { |
| 1882 | if (_M_storage) |
| 1883 | _M_vect._M_deallocate(_M_storage, _M_len); |
| 1884 | } |
| 1885 | |
| 1886 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1887 | pointer |
| 1888 | _M_release() |
| 1889 | { |
| 1890 | pointer __res = _M_storage; |
| 1891 | _M_storage = pointer(); |
| 1892 | return __res; |
| 1893 | } |
| 1894 | |
| 1895 | private: |
| 1896 | _Guard_alloc(const _Guard_alloc&); |
| 1897 | }; |
| 1898 | |
| 1899 | protected: |
| 1900 | /** |
| 1901 | * Memory expansion handler. Uses the member allocation function to |
| 1902 | * obtain @a n bytes of memory, and then copies [first,last) into it. |
| 1903 | */ |
| 1904 | template<typename _ForwardIterator> |
| 1905 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1906 | pointer |
| 1907 | _M_allocate_and_copy(size_type __n, |
| 1908 | _ForwardIterator __first, _ForwardIterator __last) |
| 1909 | { |
| 1910 | _Guard_alloc __guard(this->_M_allocate(__n), __n, *this); |
| 1911 | std::__uninitialized_copy_a |
| 1912 | (__first, __last, __guard._M_storage, _M_get_Tp_allocator()); |
| 1913 | return __guard._M_release(); |
| 1914 | } |
| 1915 | |
| 1916 | |
| 1917 | // Internal constructor functions follow. |
| 1918 | |
| 1919 | // Called by the range constructor to implement [23.1.1]/9 |
| 1920 | |
| 1921 | #if __cplusplus202002L < 201103L |
| 1922 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
| 1923 | // 438. Ambiguity in the "do the right thing" clause |
| 1924 | template<typename _Integer> |
| 1925 | void |
| 1926 | _M_initialize_dispatch(_Integer __int_n, _Integer __value, __true_type) |
| 1927 | { |
| 1928 | const size_type __n = static_cast<size_type>(__int_n); |
| 1929 | pointer __start = |
| 1930 | _M_allocate(_S_check_init_len(__n, _M_get_Tp_allocator())); |
| 1931 | this->_M_impl._M_start = __start; |
| 1932 | this->_M_impl._M_end_of_storage = __start + __n; |
| 1933 | _M_fill_initialize(__n, __value); |
| 1934 | } |
| 1935 | |
| 1936 | // Called by the range constructor to implement [23.1.1]/9 |
| 1937 | template<typename _InputIterator> |
| 1938 | void |
| 1939 | _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, |
| 1940 | __false_type) |
| 1941 | { |
| 1942 | _M_range_initialize(__first, __last, |
| 1943 | std::__iterator_category(__first)); |
| 1944 | } |
| 1945 | #endif |
| 1946 | |
| 1947 | // Called by the second initialize_dispatch above |
| 1948 | template<typename _InputIterator> |
| 1949 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1950 | void |
| 1951 | _M_range_initialize(_InputIterator __first, _InputIterator __last, |
| 1952 | std::input_iterator_tag) |
| 1953 | { |
| 1954 | __trytry { |
| 1955 | for (; __first != __last; ++__first) |
| 1956 | #if __cplusplus202002L >= 201103L |
| 1957 | emplace_back(*__first); |
| 1958 | #else |
| 1959 | push_back(*__first); |
| 1960 | #endif |
| 1961 | } __catch(...)catch(...) { |
| 1962 | clear(); |
| 1963 | __throw_exception_againthrow; |
| 1964 | } |
| 1965 | } |
| 1966 | |
| 1967 | // Called by the second initialize_dispatch above |
| 1968 | template<typename _ForwardIterator> |
| 1969 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1970 | void |
| 1971 | _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, |
| 1972 | std::forward_iterator_tag) |
| 1973 | { |
| 1974 | _M_range_initialize_n(__first, __last, |
| 1975 | std::distance(__first, __last)); |
| 1976 | } |
| 1977 | |
| 1978 | template<typename _Iterator, typename _Sentinel> |
| 1979 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1980 | void |
| 1981 | _M_range_initialize_n(_Iterator __first, _Sentinel __last, |
| 1982 | size_type __n) |
| 1983 | { |
| 1984 | pointer __start = |
| 1985 | this->_M_allocate(_S_check_init_len(__n, _M_get_Tp_allocator())); |
| 1986 | this->_M_impl._M_start = this->_M_impl._M_finish = __start; |
| 1987 | this->_M_impl._M_end_of_storage = __start + __n; |
| 1988 | this->_M_impl._M_finish |
| 1989 | = std::__uninitialized_copy_a(_GLIBCXX_MOVE(__first)std::move(__first), __last, |
| 1990 | __start, _M_get_Tp_allocator()); |
| 1991 | } |
| 1992 | |
| 1993 | // Called by the first initialize_dispatch above and by the |
| 1994 | // vector(n,value,a) constructor. |
| 1995 | _GLIBCXX20_CONSTEXPRconstexpr |
| 1996 | void |
| 1997 | _M_fill_initialize(size_type __n, const value_type& __value) |
| 1998 | { |
| 1999 | this->_M_impl._M_finish = |
| 2000 | std::__uninitialized_fill_n_a(this->_M_impl._M_start, __n, __value, |
| 2001 | _M_get_Tp_allocator()); |
| 2002 | } |
| 2003 | |
| 2004 | #if __cplusplus202002L >= 201103L |
| 2005 | // Called by the vector(n) constructor. |
| 2006 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2007 | void |
| 2008 | _M_default_initialize(size_type __n) |
| 2009 | { |
| 2010 | this->_M_impl._M_finish = |
| 2011 | std::__uninitialized_default_n_a(this->_M_impl._M_start, __n, |
| 2012 | _M_get_Tp_allocator()); |
| 2013 | } |
| 2014 | #endif |
| 2015 | |
| 2016 | // Internal assign functions follow. The *_aux functions do the actual |
| 2017 | // assignment work for the range versions. |
| 2018 | |
| 2019 | // Called by the range assign to implement [23.1.1]/9 |
| 2020 | |
| 2021 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
| 2022 | // 438. Ambiguity in the "do the right thing" clause |
| 2023 | template<typename _Integer> |
| 2024 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2025 | void |
| 2026 | _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) |
| 2027 | { _M_fill_assign(__n, __val); } |
| 2028 | |
| 2029 | // Called by the range assign to implement [23.1.1]/9 |
| 2030 | template<typename _InputIterator> |
| 2031 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2032 | void |
| 2033 | _M_assign_dispatch(_InputIterator __first, _InputIterator __last, |
| 2034 | __false_type) |
| 2035 | { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } |
| 2036 | |
| 2037 | // Called by the second assign_dispatch above |
| 2038 | template<typename _InputIterator> |
| 2039 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2040 | void |
| 2041 | _M_assign_aux(_InputIterator __first, _InputIterator __last, |
| 2042 | std::input_iterator_tag); |
| 2043 | |
| 2044 | // Called by the second assign_dispatch above |
| 2045 | template<typename _ForwardIterator> |
| 2046 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2047 | void |
| 2048 | _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, |
| 2049 | std::forward_iterator_tag); |
| 2050 | |
| 2051 | // Called by assign(n,t), and the range assign when it turns out |
| 2052 | // to be the same thing. |
| 2053 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2054 | void |
| 2055 | _M_fill_assign(size_type __n, const value_type& __val); |
| 2056 | |
| 2057 | // Internal insert functions follow. |
| 2058 | |
| 2059 | // Called by the range insert to implement [23.1.1]/9 |
| 2060 | |
| 2061 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
| 2062 | // 438. Ambiguity in the "do the right thing" clause |
| 2063 | template<typename _Integer> |
| 2064 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2065 | void |
| 2066 | _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, |
| 2067 | __true_type) |
| 2068 | { _M_fill_insert(__pos, __n, __val); } |
| 2069 | |
| 2070 | // Called by the range insert to implement [23.1.1]/9 |
| 2071 | template<typename _InputIterator> |
| 2072 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2073 | void |
| 2074 | _M_insert_dispatch(iterator __pos, _InputIterator __first, |
| 2075 | _InputIterator __last, __false_type) |
| 2076 | { |
| 2077 | _M_range_insert(__pos, __first, __last, |
| 2078 | std::__iterator_category(__first)); |
| 2079 | } |
| 2080 | |
| 2081 | // Called by the second insert_dispatch above |
| 2082 | template<typename _InputIterator> |
| 2083 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2084 | void |
| 2085 | _M_range_insert(iterator __pos, _InputIterator __first, |
| 2086 | _InputIterator __last, std::input_iterator_tag); |
| 2087 | |
| 2088 | // Called by the second insert_dispatch above |
| 2089 | template<typename _ForwardIterator> |
| 2090 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2091 | void |
| 2092 | _M_range_insert(iterator __pos, _ForwardIterator __first, |
| 2093 | _ForwardIterator __last, std::forward_iterator_tag); |
| 2094 | |
| 2095 | // Called by insert(p,n,x), and the range insert when it turns out to be |
| 2096 | // the same thing. |
| 2097 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2098 | void |
| 2099 | _M_fill_insert(iterator __pos, size_type __n, const value_type& __x); |
| 2100 | |
| 2101 | #if __cplusplus202002L >= 201103L |
| 2102 | // Called by resize(n). |
| 2103 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2104 | void |
| 2105 | _M_default_append(size_type __n); |
| 2106 | |
| 2107 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2108 | bool |
| 2109 | _M_shrink_to_fit(); |
| 2110 | #endif |
| 2111 | |
| 2112 | #if __cplusplus202002L < 201103L |
| 2113 | // Called by insert(p,x) |
| 2114 | void |
| 2115 | _M_insert_aux(iterator __position, const value_type& __x); |
| 2116 | |
| 2117 | void |
| 2118 | _M_realloc_insert(iterator __position, const value_type& __x); |
| 2119 | |
| 2120 | void |
| 2121 | _M_realloc_append(const value_type& __x); |
| 2122 | #else |
| 2123 | // A value_type object constructed with _Alloc_traits::construct() |
| 2124 | // and destroyed with _Alloc_traits::destroy(). |
| 2125 | struct _Temporary_value |
| 2126 | { |
| 2127 | template<typename... _Args> |
| 2128 | _GLIBCXX20_CONSTEXPRconstexpr explicit |
| 2129 | _Temporary_value(vector* __vec, _Args&&... __args) : _M_this(__vec) |
| 2130 | { |
| 2131 | _Alloc_traits::construct(_M_this->_M_impl, _M_ptr(), |
| 2132 | std::forward<_Args>(__args)...); |
| 2133 | } |
| 2134 | |
| 2135 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2136 | ~_Temporary_value() |
| 2137 | { _Alloc_traits::destroy(_M_this->_M_impl, _M_ptr()); } |
| 2138 | |
| 2139 | _GLIBCXX20_CONSTEXPRconstexpr value_type& |
| 2140 | _M_val() noexcept { return _M_storage._M_val; } |
| 2141 | |
| 2142 | private: |
| 2143 | _GLIBCXX20_CONSTEXPRconstexpr _Tp* |
| 2144 | _M_ptr() noexcept { return std::__addressof(_M_storage._M_val); } |
| 2145 | |
| 2146 | union _Storage |
| 2147 | { |
| 2148 | constexpr _Storage() : _M_byte() { } |
| 2149 | _GLIBCXX20_CONSTEXPRconstexpr ~_Storage() { } |
| 2150 | _Storage& operator=(const _Storage&) = delete; |
| 2151 | unsigned char _M_byte; |
| 2152 | _Tp _M_val; |
| 2153 | }; |
| 2154 | |
| 2155 | vector* _M_this; |
| 2156 | _Storage _M_storage; |
| 2157 | }; |
| 2158 | |
| 2159 | // Called by insert(p,x) and other functions when insertion needs to |
| 2160 | // reallocate or move existing elements. _Arg is either _Tp& or _Tp. |
| 2161 | template<typename _Arg> |
| 2162 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2163 | void |
| 2164 | _M_insert_aux(iterator __position, _Arg&& __arg); |
| 2165 | |
| 2166 | template<typename... _Args> |
| 2167 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2168 | void |
| 2169 | _M_realloc_insert(iterator __position, _Args&&... __args); |
| 2170 | |
| 2171 | template<typename... _Args> |
| 2172 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2173 | void |
| 2174 | _M_realloc_append(_Args&&... __args); |
| 2175 | |
| 2176 | // Either move-construct at the end, or forward to _M_insert_aux. |
| 2177 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2178 | iterator |
| 2179 | _M_insert_rval(const_iterator __position, value_type&& __v); |
| 2180 | |
| 2181 | // Try to emplace at the end, otherwise forward to _M_insert_aux. |
| 2182 | template<typename... _Args> |
| 2183 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2184 | iterator |
| 2185 | _M_emplace_aux(const_iterator __position, _Args&&... __args); |
| 2186 | |
| 2187 | // Emplacing an rvalue of the correct type can use _M_insert_rval. |
| 2188 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2189 | iterator |
| 2190 | _M_emplace_aux(const_iterator __position, value_type&& __v) |
| 2191 | { return _M_insert_rval(__position, std::move(__v)); } |
| 2192 | #endif |
| 2193 | |
| 2194 | // Called by _M_fill_insert, _M_insert_aux etc. |
| 2195 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2196 | size_type |
| 2197 | _M_check_len(size_type __n, const char* __s) const |
| 2198 | { |
| 2199 | if (max_size() - size() < __n) |
| 2200 | __throw_length_error(__N(__s)(__s)); |
| 2201 | |
| 2202 | const size_type __len = size() + (std::max)(size(), __n); |
| 2203 | return (__len < size() || __len > max_size()) ? max_size() : __len; |
| 2204 | } |
| 2205 | |
| 2206 | // Called by constructors to check initial size. |
| 2207 | static _GLIBCXX20_CONSTEXPRconstexpr size_type |
| 2208 | _S_check_init_len(size_type __n, const allocator_type& __a) |
| 2209 | { |
| 2210 | if (__n > _S_max_size(_Tp_alloc_type(__a))) |
| 2211 | __throw_length_error( |
| 2212 | __N("cannot create std::vector larger than max_size()")("cannot create std::vector larger than max_size()")); |
| 2213 | return __n; |
| 2214 | } |
| 2215 | |
| 2216 | static _GLIBCXX20_CONSTEXPRconstexpr size_type |
| 2217 | _S_max_size(const _Tp_alloc_type& __a) _GLIBCXX_NOEXCEPTnoexcept |
| 2218 | { |
| 2219 | // std::distance(begin(), end()) cannot be greater than PTRDIFF_MAX, |
| 2220 | // and realistically we can't store more than PTRDIFF_MAX/sizeof(T) |
| 2221 | // (even if std::allocator_traits::max_size says we can). |
| 2222 | const size_t __diffmax |
| 2223 | = __gnu_cxx::__numeric_traits<ptrdiff_t>::__max / sizeof(_Tp); |
| 2224 | const size_t __allocmax = _Alloc_traits::max_size(__a); |
| 2225 | return (std::min)(__diffmax, __allocmax); |
| 2226 | } |
| 2227 | |
| 2228 | // Internal erase functions follow. |
| 2229 | |
| 2230 | // Called by erase(q1,q2), clear(), resize(), _M_fill_assign, |
| 2231 | // _M_assign_aux. |
| 2232 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2233 | void |
| 2234 | _M_erase_at_end(pointer __pos) _GLIBCXX_NOEXCEPTnoexcept |
| 2235 | { |
| 2236 | if (size_type __n = this->_M_impl._M_finish - __pos) |
| 2237 | { |
| 2238 | std::_Destroy(__pos, this->_M_impl._M_finish, |
| 2239 | _M_get_Tp_allocator()); |
| 2240 | this->_M_impl._M_finish = __pos; |
| 2241 | _GLIBCXX_ASAN_ANNOTATE_SHRINK(__n); |
| 2242 | } |
| 2243 | } |
| 2244 | |
| 2245 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2246 | iterator |
| 2247 | _M_erase(iterator __position); |
| 2248 | |
| 2249 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2250 | iterator |
| 2251 | _M_erase(iterator __first, iterator __last); |
| 2252 | |
| 2253 | #if __cplusplus202002L >= 201103L |
| 2254 | private: |
| 2255 | // Constant-time move assignment when source object's memory can be |
| 2256 | // moved, either because the source's allocator will move too |
| 2257 | // or because the allocators are equal. |
| 2258 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2259 | void |
| 2260 | _M_move_assign(vector&& __x, true_type) noexcept |
| 2261 | { |
| 2262 | vector __tmp(get_allocator()); |
| 2263 | this->_M_impl._M_swap_data(__x._M_impl); |
| 2264 | __tmp._M_impl._M_swap_data(__x._M_impl); |
| 2265 | std::__alloc_on_move(_M_get_Tp_allocator(), __x._M_get_Tp_allocator()); |
| 2266 | } |
| 2267 | |
| 2268 | // Do move assignment when it might not be possible to move source |
| 2269 | // object's memory, resulting in a linear-time operation. |
| 2270 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2271 | void |
| 2272 | _M_move_assign(vector&& __x, false_type) |
| 2273 | { |
| 2274 | if (__x._M_get_Tp_allocator() == this->_M_get_Tp_allocator()) |
| 2275 | _M_move_assign(std::move(__x), true_type()); |
| 2276 | else |
| 2277 | { |
| 2278 | // The rvalue's allocator cannot be moved and is not equal, |
| 2279 | // so we need to individually move each element. |
| 2280 | this->_M_assign_aux(std::make_move_iterator(__x.begin()), |
| 2281 | std::make_move_iterator(__x.end()), |
| 2282 | std::random_access_iterator_tag()); |
| 2283 | __x.clear(); |
| 2284 | } |
| 2285 | } |
| 2286 | #endif |
| 2287 | |
| 2288 | template<typename _Up> |
| 2289 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2290 | _Up* |
| 2291 | _M_data_ptr(_Up* __ptr) const _GLIBCXX_NOEXCEPTnoexcept |
| 2292 | { return __ptr; } |
| 2293 | |
| 2294 | #if __cplusplus202002L >= 201103L |
| 2295 | template<typename _Ptr> |
| 2296 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2297 | typename std::pointer_traits<_Ptr>::element_type* |
| 2298 | _M_data_ptr(_Ptr __ptr) const |
| 2299 | { return empty() ? nullptr : std::__to_address(__ptr); } |
| 2300 | #else |
| 2301 | template<typename _Ptr> |
| 2302 | value_type* |
| 2303 | _M_data_ptr(_Ptr __ptr) const |
| 2304 | { return empty() ? (value_type*)0 : __ptr.operator->(); } |
| 2305 | #endif |
| 2306 | }; |
| 2307 | |
| 2308 | #if __cpp_deduction_guides201703L >= 201606 |
| 2309 | template<typename _InputIterator, typename _ValT |
| 2310 | = typename iterator_traits<_InputIterator>::value_type, |
| 2311 | typename _Allocator = allocator<_ValT>, |
| 2312 | typename = _RequireInputIter<_InputIterator>, |
| 2313 | typename = _RequireAllocator<_Allocator>> |
| 2314 | vector(_InputIterator, _InputIterator, _Allocator = _Allocator()) |
| 2315 | -> vector<_ValT, _Allocator>; |
| 2316 | |
| 2317 | #if __glibcxx_containers_ranges // C++ >= 23 |
| 2318 | template<ranges::input_range _Rg, |
| 2319 | typename _Alloc = allocator<ranges::range_value_t<_Rg>>> |
| 2320 | vector(from_range_t, _Rg&&, _Alloc = _Alloc()) |
| 2321 | -> vector<ranges::range_value_t<_Rg>, _Alloc>; |
| 2322 | #endif |
| 2323 | #endif |
| 2324 | |
| 2325 | /** |
| 2326 | * @brief Vector equality comparison. |
| 2327 | * @param __x A %vector. |
| 2328 | * @param __y A %vector of the same type as @a __x. |
| 2329 | * @return True iff the size and elements of the vectors are equal. |
| 2330 | * |
| 2331 | * This is an equivalence relation. It is linear in the size of the |
| 2332 | * vectors. Vectors are considered equivalent if their sizes are equal, |
| 2333 | * and if corresponding elements compare equal. |
| 2334 | */ |
| 2335 | template<typename _Tp, typename _Alloc> |
| 2336 | _GLIBCXX_NODISCARD[[__nodiscard__]] _GLIBCXX20_CONSTEXPRconstexpr |
| 2337 | inline bool |
| 2338 | operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) |
| 2339 | { return (__x.size() == __y.size() |
| 2340 | && std::equal(__x.begin(), __x.end(), __y.begin())); } |
| 2341 | |
| 2342 | #if __cpp_lib_three_way_comparison201907L // >= C++20 |
| 2343 | /** |
| 2344 | * @brief Vector ordering relation. |
| 2345 | * @param __x A `vector`. |
| 2346 | * @param __y A `vector` of the same type as `__x`. |
| 2347 | * @return A value indicating whether `__x` is less than, equal to, |
| 2348 | * greater than, or incomparable with `__y`. |
| 2349 | * |
| 2350 | * See `std::lexicographical_compare_three_way()` for how the determination |
| 2351 | * is made. This operator is used to synthesize relational operators like |
| 2352 | * `<` and `>=` etc. |
| 2353 | */ |
| 2354 | template<typename _Tp, typename _Alloc> |
| 2355 | [[nodiscard]] |
| 2356 | constexpr __detail::__synth3way_t<_Tp> |
| 2357 | operator<=>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) |
| 2358 | { |
| 2359 | return std::lexicographical_compare_three_way(__x.begin(), __x.end(), |
| 2360 | __y.begin(), __y.end(), |
| 2361 | __detail::__synth3way); |
| 2362 | } |
| 2363 | #else |
| 2364 | /** |
| 2365 | * @brief Vector ordering relation. |
| 2366 | * @param __x A %vector. |
| 2367 | * @param __y A %vector of the same type as @a __x. |
| 2368 | * @return True iff @a __x is lexicographically less than @a __y. |
| 2369 | * |
| 2370 | * This is a total ordering relation. It is linear in the size of the |
| 2371 | * vectors. The elements must be comparable with @c <. |
| 2372 | * |
| 2373 | * See std::lexicographical_compare() for how the determination is made. |
| 2374 | */ |
| 2375 | template<typename _Tp, typename _Alloc> |
| 2376 | _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool |
| 2377 | operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) |
| 2378 | { return std::lexicographical_compare(__x.begin(), __x.end(), |
| 2379 | __y.begin(), __y.end()); } |
| 2380 | |
| 2381 | /// Based on operator== |
| 2382 | template<typename _Tp, typename _Alloc> |
| 2383 | _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool |
| 2384 | operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) |
| 2385 | { return !(__x == __y); } |
| 2386 | |
| 2387 | /// Based on operator< |
| 2388 | template<typename _Tp, typename _Alloc> |
| 2389 | _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool |
| 2390 | operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) |
| 2391 | { return __y < __x; } |
| 2392 | |
| 2393 | /// Based on operator< |
| 2394 | template<typename _Tp, typename _Alloc> |
| 2395 | _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool |
| 2396 | operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) |
| 2397 | { return !(__y < __x); } |
| 2398 | |
| 2399 | /// Based on operator< |
| 2400 | template<typename _Tp, typename _Alloc> |
| 2401 | _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool |
| 2402 | operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) |
| 2403 | { return !(__x < __y); } |
| 2404 | #endif // three-way comparison |
| 2405 | |
| 2406 | /// See std::vector::swap(). |
| 2407 | template<typename _Tp, typename _Alloc> |
| 2408 | _GLIBCXX20_CONSTEXPRconstexpr |
| 2409 | inline void |
| 2410 | swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) |
| 2411 | _GLIBCXX_NOEXCEPT_IF(noexcept(__x.swap(__y)))noexcept(noexcept(__x.swap(__y))) |
| 2412 | { __x.swap(__y); } |
| 2413 | |
| 2414 | _GLIBCXX_END_NAMESPACE_CONTAINER |
| 2415 | |
| 2416 | #if __cplusplus202002L >= 201703L |
| 2417 | namespace __detail::__variant |
| 2418 | { |
| 2419 | template<typename> struct _Never_valueless_alt; // see <variant> |
| 2420 | |
| 2421 | // Provide the strong exception-safety guarantee when emplacing a |
| 2422 | // vector into a variant, but only if move assignment cannot throw. |
| 2423 | template<typename _Tp, typename _Alloc> |
| 2424 | struct _Never_valueless_alt<_GLIBCXX_STD_Cstd::vector<_Tp, _Alloc>> |
| 2425 | : std::is_nothrow_move_assignable<_GLIBCXX_STD_Cstd::vector<_Tp, _Alloc>> |
| 2426 | { }; |
| 2427 | } // namespace __detail::__variant |
| 2428 | #endif // C++17 |
| 2429 | |
| 2430 | _GLIBCXX_END_NAMESPACE_VERSION |
| 2431 | } // namespace std |
| 2432 | |
| 2433 | #endif /* _STL_VECTOR_H */ |