Skip to content

Document become keyword #113095

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
63 changes: 63 additions & 0 deletions library/std/src/keyword_docs.rs
Original file line number Diff line number Diff line change
Expand Up @@ -1228,6 +1228,69 @@ mod ref_keyword {}
/// ```
mod return_keyword {}

#[doc(keyword = "become")]
//
/// Perform a tail-call of a function.
///
/// A `become` transfers the execution flow to a function in such a way, that
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
/// A `become` transfers the execution flow to a function in such a way, that
/// A `become` transfers the execution flow to a function in such a way that

/// returning from the callee returns to the caller of the current function:
///
/// ```
/// #![feature(explicit_tail_calls)]
///
/// fn a() -> u32 {
/// become b();
/// }
///
/// fn b() -> u32 {
/// return 2; // this return directly returns to the main ---+
/// } // |
/// // |
/// fn main() { // |
/// let res = a(); // <--------------------------------------+
/// assert_eq!(res, 2);
/// }
/// ```
///
/// This is an optimization that allows function calls to not exhaust the stack.
/// This is most useful for (mutually) recursive algorithms, but may be used in
/// other cases too.
///
/// It is guaranteed that the call will not cause unbounded stack growth if it
/// is part of a recursive cycle in the call graph.
///
/// For example note that the functions `halt` and `halt_loop` below are
/// identical, they both do nothing, forever. However `stack_overflow` is
/// different from them, even though it is written almost identically to
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
/// different from them, even though it is written almost identically to
/// different from them. Even though it is written almost identically to

/// `halt`, `stack_overflow` exhausts the stack and so causes a stack
/// overflow, instead of running forever.
///
///
/// ```
/// #![feature(explicit_tail_calls)]
///
/// # #[allow(unreachable_code)]
/// fn halt() -> ! {
/// become halt()
/// }
///
/// fn halt_loop() -> ! {
/// loop {}
/// }
///
/// # #[allow(unconditional_recursion)]
/// fn stack_overflow() -> ! {
/// stack_overflow() // implicit return
/// }
/// ```
///
/// Note that from the algorithmic standpoint loops and tail-calls are
/// interchangeable, you can always rewrite a loop to use tail-calls
/// instead and vice versa. They are, however, very different in the code
/// structure, so sometimes one approach can make more sense that the other.
#[cfg(not(bootstrap))]
mod become_keyword {}

#[doc(keyword = "self")]
//
/// The receiver of a method, or the current module.
Expand Down