squiid/rust
1
0
Fork 0
Code Issues Pull requests Projects Activity

Rollup merge of #26695 - rutsky:patch-2, r=Manishearth

Browse source 
r? @steveklabnik
This commit is contained in:
Manish Goregaokar 2015-07-16 10:48:36 +05:30
commit 9ac3f42771
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -176,7 +176,7 @@ After `bar()` is over, its frame is deallocated, leaving just `foo()` and
| 1 | a | 5 | | 1 | a | 5 |
| 0 | x | 42 | | 0 | x | 42 |
And then `foo()` ends, leaving just `main()` And then `foo()` ends, leaving just `main()`:
| Address | Name | Value | | Address | Name | Value |
|---------|------|-------| |---------|------|-------|
@ -537,7 +537,7 @@ Generally, you should prefer stack allocation, and so, Rust stack-allocates by
default. The LIFO model of the stack is simpler, at a fundamental level. This default. The LIFO model of the stack is simpler, at a fundamental level. This
has two big impacts: runtime efficiency and semantic impact. has two big impacts: runtime efficiency and semantic impact.
## Runtime Efficiency. ## Runtime Efficiency
Managing the memory for the stack is trivial: The machine just Managing the memory for the stack is trivial: The machine just
increments or decrements a single value, the so-called “stack pointer”. increments or decrements a single value, the so-called “stack pointer”.