pub struct PackageVersionsQuery {
pub versions: Range<u64>,
pub descending: bool,
/* private fields */
}Expand description
The versions a ListPackageVersions request lists and how its response pages: the request’s
version bounds, checkpoint range, page token, and cursors intersected into one version range,
validated against the lineage being listed. Public so other implementors of
MovePackageService parse requests and page responses the same way.
A lineage’s versions are published in non-decreasing checkpoint order, so the checkpoint range
is one version range: start_checkpoint starts it just above the lineage’s newest version at
the end of the checkpoint before it (Self::bound_by_start_checkpoint), and the listing
holds no version published after Self::bounding_checkpoint. Both read the lineage as of a
checkpoint, as a read pinned by at_checkpoint does.
Fields§
§versions: Range<u64>The versions to list. An end of u64::MAX leaves the range unbounded above, since no
version reaches it.
descending: boolWhether to list versions from highest to lowest.
Implementations§
Source§impl PackageVersionsQuery
impl PackageVersionsQuery
Sourcepub fn new(
request: &ListPackageVersionsRequest,
original_package_id: ObjectID,
highest_indexed: u64,
) -> Result<Self>
pub fn new( request: &ListPackageVersionsRequest, original_package_id: ObjectID, highest_indexed: u64, ) -> Result<Self>
Parse the paging of request, which lists the upgrade lineage of the package originally
published at original_package_id, on a server that has indexed every checkpoint up to
highest_indexed, and check that its page token or cursors name that lineage. The request
is validated with validate_request here as well, but callers run it first, so that a
malformed request is refused before check_checkpoint_range and any read.
Sourcepub fn read_limit(&self) -> usize
pub fn read_limit(&self) -> usize
The most versions to read for one response: a full page, plus in page-token mode the first version of the next page, which the next page token points at.
Sourcepub fn is_cursor_mode(&self) -> bool
pub fn is_cursor_mode(&self) -> bool
Whether the request pages by cursor, rather than by page token.
Sourcepub fn is_first_page(&self) -> bool
pub fn is_first_page(&self) -> bool
Whether the request starts a listing, rather than continuing one from a page token or cursor.
Sourcepub fn empty_range_end(&self) -> Option<QueryEndReason>
pub fn empty_range_end(&self) -> Option<QueryEndReason>
How the listing ends when its checkpoint range alone leaves nothing to list, before any
read, as ListTransactions ends such a range: an ascending listing whose
start_checkpoint is above the highest indexed checkpoint starts past the tip, with
LEDGER_TIP, and an empty range (end_checkpoint equal to start_checkpoint, or 0 when
that is unset) ends where it starts, with CHECKPOINT_BOUND.
Sourcepub fn start_checkpoint_lookup(&self) -> Option<u64>
pub fn start_checkpoint_lookup(&self) -> Option<u64>
The checkpoint whose version starts the range: the one before start_checkpoint. None
when start_checkpoint is unset or 0, which leave the range’s start as it is.
Sourcepub fn bound_by_start_checkpoint(&mut self, newest_before_start: Option<u64>)
pub fn bound_by_start_checkpoint(&mut self, newest_before_start: Option<u64>)
Start the range just above newest_before_start, the lineage’s newest version at the
end of Self::start_checkpoint_lookup, or leave it if the lineage had none by then.
Every version published at or after start_checkpoint is above it, since a lineage’s
versions are published in non-decreasing checkpoint order.
Sourcepub fn bounding_checkpoint(&self) -> u64
pub fn bounding_checkpoint(&self) -> u64
The checkpoint that bounds the listing: end_checkpoint - 1 when the server has indexed
it, else the highest indexed checkpoint. The listing holds no version published after
it. Not meaningful when Self::empty_range_end is set.
Sourcepub fn continues_listing(&self) -> bool
pub fn continues_listing(&self) -> bool
Whether the request continues a listing whose client holds the version just below
Self::versions: an after cursor names it, in either order, or a page token names the
version above it, and no start_version or start_checkpoint above either bounds the
range. Versions below OBJECT_START_VERSION are left out: no lineage has one, so a client
holds none. A server that lists only the versions it retains refuses such a request when
the range starts below the lowest version it retains: starting at that version instead
would skip the versions in between without saying so.
Sourcepub fn cursor_versions(&self) -> impl Iterator<Item = u64>
pub fn cursor_versions(&self) -> impl Iterator<Item = u64>
The versions named by the request’s cursors that the server checks against its tip: those
of a descending listing whose range reaches past the tip. A cursor naming a version above
every version the server serves comes from a newer view of the lineage, such as another
replica’s, and a descending page from this server’s view would start below versions it
lacks, skipping them without saying so. The server rejects it with
crate::AtCheckpointUpperBound::unindexed_cursor_error.
An ascending listing serves cursors past the tip from its own view, ending with
LEDGER_TIP (see Self::end_reason), and a descending listing whose end_checkpoint
the server has indexed holds no version above end_checkpoint - 1. A legacy page token
past the tip gets an empty page with no next_page_token, as from servers that predate
cursor paging. A named version below where the server’s history of the lineage begins,
such as an old version of a system package on a node restored from a snapshot, is not
rejected here: see Self::continues_listing. Versions below OBJECT_START_VERSION are
left out: no lineage has one, so a cursor naming one skips nothing.
Sourcepub fn listed_version(
&self,
storage_id: ObjectID,
version: u64,
checkpoint: Option<u64>,
) -> PackageVersion
pub fn listed_version( &self, storage_id: ObjectID, version: u64, checkpoint: Option<u64>, ) -> PackageVersion
One listed version. In cursor mode it carries its cursor, minted at the highest indexed checkpoint; a page-token listing’s versions carry none, as on servers that predate cursor paging.
Sourcepub fn needs_end_reason(&self, listed: usize) -> bool
pub fn needs_end_reason(&self, listed: usize) -> bool
Whether a response listing listed versions ends with Self::end_reason: a page in
cursor mode with fewer than the limit. A full page ends with ITEM_LIMIT.
Sourcepub fn end_reason(&self, visible_end: u64) -> QueryEndReason
pub fn end_reason(&self, visible_end: u64) -> QueryEndReason
How a listing that read Self::versions to the end ends, given visible_end, the
version after the lineage’s newest one at the end of Self::bounding_checkpoint (0 if
it had none), named as ListObjectVersions and the ledger List APIs name it:
- An ascending listing whose window reaches past the lineage’s newest version ends with
LEDGER_TIP, since versions published later extend it: itsend_checkpointis unset or above the checkpoint after the highest indexed one, andend_versionis unset or above both the version after the newest one and the window’s start. So does one whoseaftercursor is past the tip, which lists nothing, unless a tighter bound leaves nothing aboveafter, asListObjectVersionsdecides it:beforeat or below the version afterafter, and at or belowend_version, ends it withCURSOR_BOUND, and otherwiseend_versionat or below that version ends it withCHECKPOINT_BOUND. - Otherwise the far cursor in listing order ends it with
CURSOR_BOUNDwhen the version it names is inside the window the request’s version and checkpoint bounds set, or at its edge:beforeat or below the window’s end ascending,afterat or above its start descending. - Every other listing ends at the edge of that window, with
CHECKPOINT_BOUND. On a server that prunes history, so does a descending listing that stops at the oldest version it stores.
Sourcepub fn response(
&self,
versions: Vec<PackageVersion>,
end: Option<QueryEndReason>,
) -> ListPackageVersionsResponse
pub fn response( &self, versions: Vec<PackageVersion>, end: Option<QueryEndReason>, ) -> ListPackageVersionsResponse
The response listing versions: at most Self::read_limit versions, read in this
query’s order. In cursor mode, it ends with end, the Self::end_reason of a page
that Self::needs_end_reason, or else with ITEM_LIMIT.
Trait Implementations§
Source§impl Clone for PackageVersionsQuery
impl Clone for PackageVersionsQuery
Source§fn clone(&self) -> PackageVersionsQuery
fn clone(&self) -> PackageVersionsQuery
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreAuto Trait Implementations§
impl Freeze for PackageVersionsQuery
impl RefUnwindSafe for PackageVersionsQuery
impl Send for PackageVersionsQuery
impl Sync for PackageVersionsQuery
impl Unpin for PackageVersionsQuery
impl UnsafeUnpin for PackageVersionsQuery
impl UnwindSafe for PackageVersionsQuery
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<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.