bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

Auto merge of #29247 - dcarral:missing_word_trpl, r=steveklabnik

Browse source 
I somehow missed a word behind the numbers while going through this section, don't know what the best approach would be though since "**available** addresses" sounds good to me, too".
This commit is contained in:
bors 2015-10-26 12:08:51 +00:00
commit 7de9c4eea8
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/doc/trpl/the-stack-and-the-heap.md
View file

@ -224,7 +224,7 @@ like this:
| 1 | y | 42 |
| 0 | x | → (2<sup>30</sup>) - 1 |
We have (2<sup>30</sup>) - 1 in our hypothetical computer with 1GB of RAM. And since
We have (2<sup>30</sup>) - 1 addresses in our hypothetical computer with 1GB of RAM. And since
our stack grows from zero, the easiest place to allocate memory is from the
other end. So our first value is at the highest place in memory. And the value
of the struct at `x` has a [raw pointer][rawpointer] to the place we’ve