phundrak/blog
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

fix: correcting a mistake in c vector doc

Browse Source
This commit is contained in:
phundrak
2023-10-27 15:56:10 +02:00
parent f77a1ebcd2
commit 77c1184049
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
content-org/blog.org
+2 -2
View File
@@ -446,13 +446,13 @@ then a sixteen-slots array. And in a couple more calls to ~realloc~,
we’ll quickly reach our tens of thousands slots array, way faster than we’ll quickly reach our tens of thousands slots array, way faster than
by incrementing its capacity one by one. by incrementing its capacity one by one.
/“But, we’ll end up with a lot of unused memory if we need just one more element than 2^{16} elements! We don’t need a 2^{32} elements array for 2^{16}+1 elements!”/ /“But, we’ll end up with a lot of unused memory if we need just one more element than 2^{16} elements! We don’t need a 2^{17} elements array for 2^{16}+1 elements!”/
You’re completely right, but that’s a tradeoff. Would you rather have You’re completely right, but that’s a tradeoff. Would you rather have
a slow but memory-efficient program, or a fast but memory-hungry a slow but memory-efficient program, or a fast but memory-hungry
software? Plus, as you’ll see later, there is a function to shrink the software? Plus, as you’ll see later, there is a function to shrink the
size of the allocated array down to the actual amount of elements you size of the allocated array down to the actual amount of elements you
stored in it, making it possible to temporarily have a 2^{32} elements stored in it, making it possible to temporarily have a 2^{17} elements
array, and immediately after shrink it down to 2^{16}+1, once you know array, and immediately after shrink it down to 2^{16}+1, once you know
you won’t be adding any other elements. you won’t be adding any other elements.