pub enum ControlFlow<B, C = ()> {
Continue(C),
Break(B),
}
Expand description
Used to tell an operation whether it should exit early or go on as usual.
This is used when exposing things (like graph traversals or visitors) where
you want the user to be able to choose whether to exit early.
Having the enum makes it clearer – no more wondering “wait, what did false
mean again?” – and allows including a value.
Similar to Option
and Result
, this enum can be used with the ?
operator
to return immediately if the Break
variant is present or otherwise continue normally
with the value inside the Continue
variant.
§Examples
Early-exiting from Iterator::try_for_each
:
use std::ops::ControlFlow;
let r = (2..100).try_for_each(|x| {
if 403 % x == 0 {
return ControlFlow::Break(x)
}
ControlFlow::Continue(())
});
assert_eq!(r, ControlFlow::Break(13));
A basic tree traversal:
use std::ops::ControlFlow;
pub struct TreeNode<T> {
value: T,
left: Option<Box<TreeNode<T>>>,
right: Option<Box<TreeNode<T>>>,
}
impl<T> TreeNode<T> {
pub fn traverse_inorder<B>(&self, f: &mut impl FnMut(&T) -> ControlFlow<B>) -> ControlFlow<B> {
if let Some(left) = &self.left {
left.traverse_inorder(f)?;
}
f(&self.value)?;
if let Some(right) = &self.right {
right.traverse_inorder(f)?;
}
ControlFlow::Continue(())
}
fn leaf(value: T) -> Option<Box<TreeNode<T>>> {
Some(Box::new(Self { value, left: None, right: None }))
}
}
let node = TreeNode {
value: 0,
left: TreeNode::leaf(1),
right: Some(Box::new(TreeNode {
value: -1,
left: TreeNode::leaf(5),
right: TreeNode::leaf(2),
}))
};
let mut sum = 0;
let res = node.traverse_inorder(&mut |val| {
if *val < 0 {
ControlFlow::Break(*val)
} else {
sum += *val;
ControlFlow::Continue(())
}
});
assert_eq!(res, ControlFlow::Break(-1));
assert_eq!(sum, 6);
Variants§
Continue(C)
Move on to the next phase of the operation as normal.
Break(B)
Exit the operation without running subsequent phases.
Implementations§
Source§impl<B, C> ControlFlow<B, C>
impl<B, C> ControlFlow<B, C>
1.59.0 · Sourcepub fn is_break(&self) -> bool
pub fn is_break(&self) -> bool
Returns true
if this is a Break
variant.
§Examples
use std::ops::ControlFlow;
assert!(ControlFlow::<&str, i32>::Break("Stop right there!").is_break());
assert!(!ControlFlow::<&str, i32>::Continue(3).is_break());
1.59.0 · Sourcepub fn is_continue(&self) -> bool
pub fn is_continue(&self) -> bool
Returns true
if this is a Continue
variant.
§Examples
use std::ops::ControlFlow;
assert!(!ControlFlow::<&str, i32>::Break("Stop right there!").is_continue());
assert!(ControlFlow::<&str, i32>::Continue(3).is_continue());
1.83.0 · Sourcepub fn break_value(self) -> Option<B> ⓘ
pub fn break_value(self) -> Option<B> ⓘ
Converts the ControlFlow
into an Option
which is Some
if the
ControlFlow
was Break
and None
otherwise.
§Examples
use std::ops::ControlFlow;
assert_eq!(ControlFlow::<&str, i32>::Break("Stop right there!").break_value(), Some("Stop right there!"));
assert_eq!(ControlFlow::<&str, i32>::Continue(3).break_value(), None);
1.83.0 · Sourcepub fn map_break<T>(self, f: impl FnOnce(B) -> T) -> ControlFlow<T, C>
pub fn map_break<T>(self, f: impl FnOnce(B) -> T) -> ControlFlow<T, C>
Maps ControlFlow<B, C>
to ControlFlow<T, C>
by applying a function
to the break value in case it exists.
1.83.0 · Sourcepub fn continue_value(self) -> Option<C> ⓘ
pub fn continue_value(self) -> Option<C> ⓘ
Converts the ControlFlow
into an Option
which is Some
if the
ControlFlow
was Continue
and None
otherwise.
§Examples
use std::ops::ControlFlow;
assert_eq!(ControlFlow::<&str, i32>::Break("Stop right there!").continue_value(), None);
assert_eq!(ControlFlow::<&str, i32>::Continue(3).continue_value(), Some(3));
1.83.0 · Sourcepub fn map_continue<T>(self, f: impl FnOnce(C) -> T) -> ControlFlow<B, T>
pub fn map_continue<T>(self, f: impl FnOnce(C) -> T) -> ControlFlow<B, T>
Maps ControlFlow<B, C>
to ControlFlow<B, T>
by applying a function
to the continue value in case it exists.
impl<R> ControlFlow<R, <R as Try>::Output>where
R: Try,
These are used only as part of implementing the iterator adapters. They have mediocre names and non-obvious semantics, so aren’t currently on a path to potential stabilization.
Trait Implementations§
1.55.0 · Source§impl<B, C> Clone for ControlFlow<B, C>
impl<B, C> Clone for ControlFlow<B, C>
Source§fn clone(&self) -> ControlFlow<B, C>
fn clone(&self) -> ControlFlow<B, C>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more1.55.0 · Source§impl<B, C> Debug for ControlFlow<B, C>
impl<B, C> Debug for ControlFlow<B, C>
Source§impl<B, C> FromResidual<ControlFlow<B, Infallible>> for ControlFlow<B, C>
impl<B, C> FromResidual<ControlFlow<B, Infallible>> for ControlFlow<B, C>
Source§fn from_residual(residual: ControlFlow<B, Infallible>) -> ControlFlow<B, C>
fn from_residual(residual: ControlFlow<B, Infallible>) -> ControlFlow<B, C>
try_trait_v2
)Residual
type. Read more1.55.0 · Source§impl<B, C> Hash for ControlFlow<B, C>
impl<B, C> Hash for ControlFlow<B, C>
1.55.0 · Source§impl<B, C> PartialEq for ControlFlow<B, C>
impl<B, C> PartialEq for ControlFlow<B, C>
Source§impl<B, C> Residual<C> for ControlFlow<B, Infallible>
impl<B, C> Residual<C> for ControlFlow<B, Infallible>
Source§type TryType = ControlFlow<B, C>
type TryType = ControlFlow<B, C>
try_trait_v2_residual
)Source§impl<B, C> Try for ControlFlow<B, C>
impl<B, C> Try for ControlFlow<B, C>
Source§type Output = C
type Output = C
try_trait_v2
)?
when not short-circuiting.Source§type Residual = ControlFlow<B, Infallible>
type Residual = ControlFlow<B, Infallible>
try_trait_v2
)FromResidual::from_residual
as part of ?
when short-circuiting. Read moreSource§fn from_output(output: <ControlFlow<B, C> as Try>::Output) -> ControlFlow<B, C>
fn from_output(output: <ControlFlow<B, C> as Try>::Output) -> ControlFlow<B, C>
try_trait_v2
)Output
type. Read moreSource§fn branch(
self,
) -> ControlFlow<<ControlFlow<B, C> as Try>::Residual, <ControlFlow<B, C> as Try>::Output>
fn branch( self, ) -> ControlFlow<<ControlFlow<B, C> as Try>::Residual, <ControlFlow<B, C> as Try>::Output>
try_trait_v2
)?
to decide whether the operator should produce a value
(because this returned ControlFlow::Continue
)
or propagate a value back to the caller
(because this returned ControlFlow::Break
). Read moreimpl<B, C> Copy for ControlFlow<B, C>
impl<B, C> Eq for ControlFlow<B, C>
impl<B, C> StructuralPartialEq for ControlFlow<B, C>
Auto Trait Implementations§
impl<B, C> Freeze for ControlFlow<B, C>
impl<B, C> RefUnwindSafe for ControlFlow<B, C>where
C: RefUnwindSafe,
B: RefUnwindSafe,
impl<B, C> Send for ControlFlow<B, C>
impl<B, C> Sync for ControlFlow<B, C>
impl<B, C> Unpin for ControlFlow<B, C>
impl<B, C> UnwindSafe for ControlFlow<B, C>where
C: UnwindSafe,
B: UnwindSafe,
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.