Vector => 1024 bytes allocd at end, total: 2040 bytes mallocd, 8 malloc(s), 7 free(s) Unordered_set => 1800 bytes allocd at end, total: 2504 bytes mallocd, 70 malloc(s), 5 free(s)ĭeque => 1088 bytes allocd at end, total: 1088 bytes mallocd, 3 malloc(s), 0 free(s) Unordered_map => 2312 bytes allocd at end, total: 3016 bytes mallocd, 70 malloc(s), 5 free(s) Set => 2560 bytes allocd at end, total: 2560 bytes mallocd, 64 malloc(s), 0 free(s) Map => 3072 bytes allocd at end, total: 3072 bytes mallocd, 64 malloc(s), 0 free(s) Vector => 512 bytes allocd at end, total: 1016 bytes mallocd, 7 malloc(s), 6 free(s) Unordered_set => 888 bytes allocd at end, total: 1216 bytes mallocd, 37 malloc(s), 4 free(s) Unordered_map => 1144 bytes allocd at end, total: 1472 bytes mallocd, 37 malloc(s), 4 free(s) Set => 1280 bytes allocd at end, total: 1280 bytes mallocd, 32 malloc(s), 0 free(s) Map => 1536 bytes allocd at end, total: 1536 bytes mallocd, 32 malloc(s), 0 free(s) Vector => 256 bytes allocd at end, total: 504 bytes mallocd, 6 malloc(s), 5 free(s) Unordered_set => 440 bytes allocd at end, total: 584 bytes mallocd, 20 malloc(s), 3 free(s) Unordered_map => 568 bytes allocd at end, total: 712 bytes mallocd, 20 malloc(s), 3 free(s) Set => 640 bytes allocd at end, total: 640 bytes mallocd, 16 malloc(s), 0 free(s) Map => 768 bytes allocd at end, total: 768 bytes mallocd, 16 malloc(s), 0 free(s) Vector => 128 bytes allocd at end, total: 248 bytes mallocd, 5 malloc(s), 4 free(s) Unordered_set => 216 bytes allocd at end, total: 272 bytes mallocd, 11 malloc(s), 2 free(s) Unordered_map => 280 bytes allocd at end, total: 336 bytes mallocd, 11 malloc(s), 2 free(s) Set => 320 bytes allocd at end, total: 320 bytes mallocd, 8 malloc(s), 0 free(s) Map => 384 bytes allocd at end, total: 384 bytes mallocd, 8 malloc(s), 0 free(s) Vector => 64 bytes allocd at end, total: 120 bytes mallocd, 4 malloc(s), 3 free(s) Unordered_set => 104 bytes allocd at end, total: 120 bytes mallocd, 6 malloc(s), 1 free(s) Unordered_map => 136 bytes allocd at end, total: 152 bytes mallocd, 6 malloc(s), 1 free(s) Set => 160 bytes allocd at end, total: 160 bytes mallocd, 4 malloc(s), 0 free(s) Map => 192 bytes allocd at end, total: 192 bytes mallocd, 4 malloc(s), 0 free(s) Vector => 32 bytes allocd at end, total: 56 bytes mallocd, 3 malloc(s), 2 free(s) Unordered_set => 72 bytes allocd at end, total: 88 bytes mallocd, 4 malloc(s), 1 free(s) Unordered_map => 88 bytes allocd at end, total: 104 bytes mallocd, 4 malloc(s), 1 free(s) Set => 80 bytes allocd at end, total: 80 bytes mallocd, 2 malloc(s), 0 free(s) Map => 96 bytes allocd at end, total: 96 bytes mallocd, 2 malloc(s), 0 free(s) Vector => 16 bytes allocd at end, total: 24 bytes mallocd, 2 malloc(s), 1 free(s) Unordered_set => 32 bytes allocd at end, total: 32 bytes mallocd, 2 malloc(s), 0 free(s) Unordered_map => 40 bytes allocd at end, total: 40 bytes mallocd, 2 malloc(s), 0 free(s) Set => 40 bytes allocd at end, total: 40 bytes mallocd, 1 malloc(s), 0 free(s) Map => 48 bytes allocd at end, total: 48 bytes mallocd, 1 malloc(s), 0 free(s) Vector => 8 bytes allocd at end, total: 8 bytes mallocd, 1 malloc(s), 0 free(s) Unordered_set => 0 bytes allocd at end, total: 0 bytes mallocd, 0 malloc(s), 0 free(s)ĭeque => 576 bytes allocd at end, total: 576 bytes mallocd, 2 malloc(s), 0 free(s)
Unordered_map => 0 bytes allocd at end, total: 0 bytes mallocd, 0 malloc(s), 0 free(s) Set => 0 bytes allocd at end, total: 0 bytes mallocd, 0 malloc(s), 0 free(s) Map => 0 bytes allocd at end, total: 0 bytes mallocd, 0 malloc(s), 0 free(s) Vector => 0 bytes allocd at end, total: 0 bytes mallocd, 0 malloc(s), 0 free(s)
#ARANGODB NOSQL ARANGODB 27.8M IRIS PLUS#
Plus the number of calls to malloc and free the container issued. The container during its whole lifetime (i.e.
Reported are the amount of heap memory allocated by the container after allĮlements have been inserted, the total number of heap memory allocated by The memory usage pattern should be quite clear by then. The number of elements in theĬontainers ( n) is increased exponentially from 0 (empty) to 512 in the The containers will need to use heap memory. The containers themselves are creared on the stack.
The results may be completely different for other platforms and/or other For the associative containers I alsoĪll results are for the STL implementation I had ready at hand (g++5.3 on Here is the answer for some frequently used containers types containing Ever wondered how much heap memory will be used by STL containers, and
0 kommentar(er)
