pub struct ResolvedScan<P> {
pub bounds: ScanBounds<P>,
pub entry_checkpoint: u64,
pub end_public_position: LedgerPoint,
pub end_scan_position: P,
pub exhaustion: RangeExhaustion,
pub window_claim: Option<u64>,
}Expand description
A request’s checkpoint bounds resolved into the scan-position interval to scan, along with the checkpoint-space facts for watermark rendering.
Fields§
§bounds: ScanBounds<P>Scan-position interval to scan, expressed as explicit lo/hi
Bounds.
entry_checkpoint: u64The window’s first checkpoint in scan direction, raised to the serving floor for an ascending scan. No coverage claim passes it. Cursors do not move it: a cursor vouches for every position before it in scan order, so a scan claims each checkpoint whose end it reaches, wherever its cursor started.
end_public_position: LedgerPointThe public position of end_scan_position, unless a request cursor names that position
(see ResolvedScan::end_cursor_public_position): the window’s edge, the serving floor,
or where the request cursor that ends the scan resumes.
end_scan_position: PScan-direction terminal edge of the interval, in the lane’s private scan order: a
tx_seq, a (tx_seq, event_index), or a checkpoint.
exhaustion: RangeExhaustionWhy the interval is exhausted once the scan drains it.
window_claim: Option<u64>The checkpoint a scan that drains the window reports as fully covered: the window’s last
checkpoint in scan direction, or the one before it in scan direction where a request
position cuts it, which lies outside a one-checkpoint window
(ResolvedScan::natural_end_claim drops such a claim). None when the window holds no
checkpoint, when the checkpoint before it would precede genesis, or when an ascending
scan’s after cursor resumes past the ledger tip (see ResolvedScan::resolve).
Cursors do not move it: a non-empty window’s natural end claims its edge even when the
scan reads nothing, because the request’s starting cursor vouches for every position
before it.
Implementations§
Source§impl ResolvedScan<u64>
impl ResolvedScan<u64>
Source§impl<P: ScanPosition> ResolvedScan<P>where
CursorToken: ScanCursor<P>,
impl<P: ScanPosition> ResolvedScan<P>where
CursorToken: ScanCursor<P>,
Sourcepub fn resolve(
cp_range: ResolvedCheckpointRange,
window: ScanWindow<P>,
options: &QueryOptions,
) -> Result<Self, RpcError>
pub fn resolve( cp_range: ResolvedCheckpointRange, window: ScanWindow<P>, options: &QueryOptions, ) -> Result<Self, RpcError>
Record the request’s checkpoint bounds, then apply cursor bounds to tighten the window
scanning interval. Cursors bound the scan by position alone; their public positions only
label the cursors this scan hands back. If the backend data source has a serving floor,
apply_serving_floor must be called to reconcile the scanning interval.
The window’s request positions and its cursors bound the scan by intersection. A position that cuts the window’s first checkpoint in scan direction acts as a starting cursor does: it vouches for every position before it, so the scan still claims that checkpoint once it reaches its end. A position that cuts the window’s last checkpoint in scan direction acts as a far cursor does: the scan never reaches that checkpoint’s end, so its natural end does not claim it.
In a window that reaches the ledger tip, empty or not, an ascending scan whose after
cursor resumes past the tip ends empty where that cursor resumes, or at a before cursor
at or below that position, and claims no checkpoint.
pub fn is_empty(&self) -> bool
Sourcepub fn natural_end_claim(&self, options: &QueryOptions) -> Option<u64>
pub fn natural_end_claim(&self, options: &QueryOptions) -> Option<u64>
The checkpoint this scan’s natural end reports as fully covered in Watermark.checkpoint:
the window’s last checkpoint in scan direction, just below its exclusive upper edge
ascending, or its inclusive lower edge descending. A scan that drains its window has
covered every checkpoint up to that edge, and so has a scan its starting cursor leaves
empty, because the cursor vouches for every position before it. A request position that
cuts that last checkpoint moves the claim to the checkpoint before it in scan direction.
None when the window has no checkpoint, when an ascending scan’s after cursor resumes
past the ledger tip, or when the claim would precede entry_checkpoint.
Sourcepub fn range_end(
&self,
window: &ScanWindow<P>,
options: &QueryOptions,
position_at: impl FnOnce(P, LedgerPoint) -> Position,
) -> RangeEnd
pub fn range_end( &self, window: &ScanWindow<P>, options: &QueryOptions, position_at: impl FnOnce(P, LedgerPoint) -> Position, ) -> RangeEnd
Where this scan ends once it drains its range, as its terminal frame renders it: its
reason, the terminal cursor position_at builds from the end’s scan position and public
position (see Self::end_cursor_public_position), where the frame resumes in ledger
coordinates (see Self::end_resume_position), and the natural end’s claim (see
Self::natural_end_claim). window is the window this scan was resolved from.
Sourcepub fn end_cursor_public_position(&self, options: &QueryOptions) -> LedgerPoint
pub fn end_cursor_public_position(&self, options: &QueryOptions) -> LedgerPoint
The public position of this scan’s terminal cursor, at its end scan position: that of a
request cursor that names that position (see request_cursor_point), else
Self::end_public_position.
Sourcepub fn end_resume_position(
&self,
window: &ScanWindow<P>,
options: &QueryOptions,
) -> LedgerPoint
pub fn end_resume_position( &self, window: &ScanWindow<P>, options: &QueryOptions, ) -> LedgerPoint
Where this scan’s terminal frame resumes in ledger coordinates, known without a read.
window is the window this scan was resolved from.
The frame resumes at its end scan position, clamped so it never lies before the request’s
effective start ascending (the window’s start, the position its after cursor resumes at)
or past its effective end descending (the window’s end, its before cursor). A window
that holds no checkpoint names the request’s own start (ascending) or end (descending):
past this server’s tip, an ascending terminal echoes where the request starts.
A position is placed by the serving floor, by a window edge (the request’s own fields), by
the public position of a request cursor that names it (see request_cursor_point): where
an after cursor resumes, including past this server’s tip, or a before cursor’s
position; or, for the end scan position itself, by its cursor’s public position.
Sourcepub fn apply_serving_floor(
&mut self,
floor: P,
floor_checkpoint: u64,
options: &QueryOptions,
) -> Result<(), RpcError>
pub fn apply_serving_floor( &mut self, floor: P, floor_checkpoint: u64, options: &QueryOptions, ) -> Result<(), RpcError>
Raises the scan’s low end to the serving floor, for a scan with no lower bound of its own
whose low end lies below the floor. An ascending scan starts at the floor and claims
coverage from floor_checkpoint on. A descending scan ends at the floor with
RangeExhaustion::ServingFloor: everything below it is pruned.
A floor that leaves the scan nothing to cover (its before cursor sits at or below the
floor) is OutOfRange.
Trait Implementations§
Source§impl<P: Clone> Clone for ResolvedScan<P>
impl<P: Clone> Clone for ResolvedScan<P>
Source§fn clone(&self) -> ResolvedScan<P>
fn clone(&self) -> ResolvedScan<P>
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<P: Debug> Debug for ResolvedScan<P>
impl<P: Debug> Debug for ResolvedScan<P>
impl<P: Eq> Eq for ResolvedScan<P>
Source§impl<P: PartialEq> PartialEq for ResolvedScan<P>
impl<P: PartialEq> PartialEq for ResolvedScan<P>
Source§fn eq(&self, other: &ResolvedScan<P>) -> bool
fn eq(&self, other: &ResolvedScan<P>) -> bool
self and other values to be equal, and is used by ==.impl<P: PartialEq> StructuralPartialEq for ResolvedScan<P>
Auto Trait Implementations§
impl<P> Freeze for ResolvedScan<P>where
P: Freeze,
impl<P> RefUnwindSafe for ResolvedScan<P>where
P: RefUnwindSafe,
impl<P> Send for ResolvedScan<P>where
P: Send,
impl<P> Sync for ResolvedScan<P>where
P: Sync,
impl<P> Unpin for ResolvedScan<P>where
P: Unpin,
impl<P> UnsafeUnpin for ResolvedScan<P>where
P: UnsafeUnpin,
impl<P> UnwindSafe for ResolvedScan<P>where
P: UnwindSafe,
Blanket Implementations§
§impl<T> AnySync for T
impl<T> AnySync for T
§impl<U> As for U
impl<U> As for U
§fn as_<T>(self) -> Twhere
T: CastFrom<U>,
U: Sized,
fn as_<T>(self) -> Twhere
T: CastFrom<U>,
U: Sized,
self to type T. The semantics of numeric casting with the as operator are followed, so <T as As>::as_::<U> can be used in the same way as T as U for numeric conversions. Read more§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Conv for T
impl<T> Conv for T
§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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.§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
§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
impl<T> ErasedDestructor for Twhere
T: 'static,
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self to use its Binary implementation when Debug-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self to use its Display implementation when
Debug-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self to use its Octal implementation when Debug-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
§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<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T in a Request§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T in a tonic::Request§impl<L> LayerExt<L> for L
impl<L> LayerExt<L> for L
§fn named_layer<S>(&self, service: S) -> Layered<<L as Layer<S>>::Service, S>where
L: Layer<S>,
fn named_layer<S>(&self, service: S) -> Layered<<L as Layer<S>>::Service, S>where
L: Layer<S>,
Layered].impl<T> MaybeSendSync for T
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self, then passes self.as_ref() into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self, then passes self.as_mut() into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self, then passes self.deref() into the pipe function.§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
§impl<T> ServiceExt for T
impl<T> ServiceExt for T
§fn propagate_header(self, header: HeaderName) -> PropagateHeader<Self>where
Self: Sized,
fn propagate_header(self, header: HeaderName) -> PropagateHeader<Self>where
Self: Sized,
§fn add_extension<T>(self, value: T) -> AddExtension<Self, T>where
Self: Sized,
fn add_extension<T>(self, value: T) -> AddExtension<Self, T>where
Self: Sized,
§fn map_request_body<F>(self, f: F) -> MapRequestBody<Self, F>where
Self: Sized,
fn map_request_body<F>(self, f: F) -> MapRequestBody<Self, F>where
Self: Sized,
§fn map_response_body<F>(self, f: F) -> MapResponseBody<Self, F>where
Self: Sized,
fn map_response_body<F>(self, f: F) -> MapResponseBody<Self, F>where
Self: Sized,
§fn compression(self) -> Compression<Self>where
Self: Sized,
fn compression(self) -> Compression<Self>where
Self: Sized,
§fn decompression(self) -> Decompression<Self>where
Self: Sized,
fn decompression(self) -> Decompression<Self>where
Self: Sized,
§fn trace_for_http(self) -> Trace<Self, SharedClassifier<ServerErrorsAsFailures>>where
Self: Sized,
fn trace_for_http(self) -> Trace<Self, SharedClassifier<ServerErrorsAsFailures>>where
Self: Sized,
§fn trace_for_grpc(self) -> Trace<Self, SharedClassifier<GrpcErrorsAsFailures>>where
Self: Sized,
fn trace_for_grpc(self) -> Trace<Self, SharedClassifier<GrpcErrorsAsFailures>>where
Self: Sized,
§fn follow_redirects(self) -> FollowRedirect<Self>where
Self: Sized,
fn follow_redirects(self) -> FollowRedirect<Self>where
Self: Sized,
§fn sensitive_headers(
self,
headers: impl IntoIterator<Item = HeaderName>,
) -> SetSensitiveRequestHeaders<SetSensitiveResponseHeaders<Self>>where
Self: Sized,
fn sensitive_headers(
self,
headers: impl IntoIterator<Item = HeaderName>,
) -> SetSensitiveRequestHeaders<SetSensitiveResponseHeaders<Self>>where
Self: Sized,
§fn sensitive_request_headers(
self,
headers: impl IntoIterator<Item = HeaderName>,
) -> SetSensitiveRequestHeaders<Self>where
Self: Sized,
fn sensitive_request_headers(
self,
headers: impl IntoIterator<Item = HeaderName>,
) -> SetSensitiveRequestHeaders<Self>where
Self: Sized,
§fn sensitive_response_headers(
self,
headers: impl IntoIterator<Item = HeaderName>,
) -> SetSensitiveResponseHeaders<Self>where
Self: Sized,
fn sensitive_response_headers(
self,
headers: impl IntoIterator<Item = HeaderName>,
) -> SetSensitiveResponseHeaders<Self>where
Self: Sized,
§fn override_request_header<M>(
self,
header_name: HeaderName,
make: M,
) -> SetRequestHeader<Self, M>where
Self: Sized,
fn override_request_header<M>(
self,
header_name: HeaderName,
make: M,
) -> SetRequestHeader<Self, M>where
Self: Sized,
§fn append_request_header<M>(
self,
header_name: HeaderName,
make: M,
) -> SetRequestHeader<Self, M>where
Self: Sized,
fn append_request_header<M>(
self,
header_name: HeaderName,
make: M,
) -> SetRequestHeader<Self, M>where
Self: Sized,
§fn insert_request_header_if_not_present<M>(
self,
header_name: HeaderName,
make: M,
) -> SetRequestHeader<Self, M>where
Self: Sized,
fn insert_request_header_if_not_present<M>(
self,
header_name: HeaderName,
make: M,
) -> SetRequestHeader<Self, M>where
Self: Sized,
§fn override_response_header<M>(
self,
header_name: HeaderName,
make: M,
) -> SetResponseHeader<Self, M>where
Self: Sized,
fn override_response_header<M>(
self,
header_name: HeaderName,
make: M,
) -> SetResponseHeader<Self, M>where
Self: Sized,
§fn append_response_header<M>(
self,
header_name: HeaderName,
make: M,
) -> SetResponseHeader<Self, M>where
Self: Sized,
fn append_response_header<M>(
self,
header_name: HeaderName,
make: M,
) -> SetResponseHeader<Self, M>where
Self: Sized,
§fn insert_response_header_if_not_present<M>(
self,
header_name: HeaderName,
make: M,
) -> SetResponseHeader<Self, M>where
Self: Sized,
fn insert_response_header_if_not_present<M>(
self,
header_name: HeaderName,
make: M,
) -> SetResponseHeader<Self, M>where
Self: Sized,
§fn set_request_id<M>(
self,
header_name: HeaderName,
make_request_id: M,
) -> SetRequestId<Self, M>where
Self: Sized,
M: MakeRequestId,
fn set_request_id<M>(
self,
header_name: HeaderName,
make_request_id: M,
) -> SetRequestId<Self, M>where
Self: Sized,
M: MakeRequestId,
§fn set_x_request_id<M>(self, make_request_id: M) -> SetRequestId<Self, M>where
Self: Sized,
M: MakeRequestId,
fn set_x_request_id<M>(self, make_request_id: M) -> SetRequestId<Self, M>where
Self: Sized,
M: MakeRequestId,
x-request-id as the header name. Read more§fn propagate_request_id(
self,
header_name: HeaderName,
) -> PropagateRequestId<Self>where
Self: Sized,
fn propagate_request_id(
self,
header_name: HeaderName,
) -> PropagateRequestId<Self>where
Self: Sized,
§fn propagate_x_request_id(self) -> PropagateRequestId<Self>where
Self: Sized,
fn propagate_x_request_id(self) -> PropagateRequestId<Self>where
Self: Sized,
x-request-id as the header name. Read more§fn catch_panic(self) -> CatchPanic<Self, DefaultResponseForPanic>where
Self: Sized,
fn catch_panic(self) -> CatchPanic<Self, DefaultResponseForPanic>where
Self: Sized,
500 Internal Server responses. Read more§fn request_body_limit(self, limit: usize) -> RequestBodyLimit<Self>where
Self: Sized,
fn request_body_limit(self, limit: usize) -> RequestBodyLimit<Self>where
Self: Sized,
413 Payload Too Large responses. Read more§fn trim_trailing_slash(self) -> NormalizePath<Self>where
Self: Sized,
fn trim_trailing_slash(self) -> NormalizePath<Self>where
Self: Sized,
§fn append_trailing_slash(self) -> NormalizePath<Self>where
Self: Sized,
fn append_trailing_slash(self) -> NormalizePath<Self>where
Self: Sized,
§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow() only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref() only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut() only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref() only in debug builds, and is erased in release
builds.