nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2025-02-22 03:44:24 +00:00
Code Issues Packages Projects Releases Wiki Activity

Minor change.

Browse Source
This commit is contained in:
Sandeep Datta 2016-02-11 19:55:45 +05:30
parent a8fd1bbd2f
commit a6fedc85bf
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
src/doc/book/ownership.md
View File

@ -148,12 +148,12 @@ on the [heap][sh] for the actual data (`[1, 2, 3]`). Rust copies the address
of this heap allocation to an internal pointer, which is part of the vector of this heap allocation to an internal pointer, which is part of the vector
object placed on the stack (let's call it the data pointer). object placed on the stack (let's call it the data pointer).
It is worth pointing out (even at the risk of repeating things) that the vector It is worth pointing out (even at the risk of stating the obvious) that the
object and its data live in separate memory regions instead of being a single vector object and its data live in separate memory regions instead of being a
contiguous memory allocation (due to reasons we will not go into at this point single contiguous memory allocation (due to reasons we will not go into at
of time). These two parts of the vector (the one on the stack and one on the this point of time). These two parts of the vector (the one on the stack and
heap) must agree with each other at all times with regards to things like the one on the heap) must agree with each other at all times with regards to
length, capacity etc. things like the length, capacity etc.
When we move `v` to `v2`, rust actually does a bitwise copy of the vector When we move `v` to `v2`, rust actually does a bitwise copy of the vector
object `v` into the stack allocation represented by `v2`. This shallow copy object `v` into the stack allocation represented by `v2`. This shallow copy
@ -169,7 +169,7 @@ For example if we truncated the vector to just two elements through `v2`:
v2.truncate(2); v2.truncate(2);
``` ```
and `v1` were still accessible we'd end up with an invalid vector since it and `v1` were still accessible we'd end up with an invalid vector since `v1`
would not know that the heap data has been truncated. Now, the part of the would not know that the heap data has been truncated. Now, the part of the
vector `v1` on the stack does not agree with the corresponding part on the vector `v1` on the stack does not agree with the corresponding part on the
heap. `v1` still thinks there are three elements in the vector and will heap. `v1` still thinks there are three elements in the vector and will