mikros/rust
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Punctuation and clarity fixes.

Browse Source
This commit is contained in:
James Mantooth 2018-01-17 05:23:21 -06:00 committed by GitHub
parent da569fa9dd
commit c2e26121db
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/doc/unstable-book/src/language-features/generators.md
View File

@ -139,11 +139,11 @@ closure-like semantics. Namely:
types and such. types and such.
* Traits like `Send` and `Sync` are automatically implemented for a `Generator` * Traits like `Send` and `Sync` are automatically implemented for a `Generator`
depending on the captured variables of the environment. Unlike closures though depending on the captured variables of the environment. Unlike closures,
generators also depend on variables live across suspension points. This means generators also depend on variables live across suspension points. This means
that although the ambient environment may be `Send` or `Sync`, the generator that although the ambient environment may be `Send` or `Sync`, the generator
itself may not be due to internal variables live across `yield` points being itself may not be due to internal variables live across `yield` points being
not-`Send` or not-`Sync`. Note, though, that generators, like closures, do not-`Send` or not-`Sync`. Note that generators, like closures, do
not implement traits like `Copy` or `Clone` automatically. not implement traits like `Copy` or `Clone` automatically.
* Whenever a generator is dropped it will drop all captured environment * Whenever a generator is dropped it will drop all captured environment
@ -155,7 +155,7 @@ lifted at a future date, the design is ongoing!
### Generators as state machines ### Generators as state machines
In the compiler generators are currently compiled as state machines. Each In the compiler, generators are currently compiled as state machines. Each
`yield` expression will correspond to a different state that stores all live `yield` expression will correspond to a different state that stores all live
variables over that suspension point. Resumption of a generator will dispatch on variables over that suspension point. Resumption of a generator will dispatch on
the current state and then execute internally until a `yield` is reached, at the current state and then execute internally until a `yield` is reached, at