pub struct ObjectVersionsQuery {
pub object_id: ObjectID,
pub read_mask: FieldMaskTree,
pub removal_read_mask: FieldMaskTree,
pub start_checkpoint: Option<u64>,
pub end_checkpoint: Option<u64>,
pub descending: bool,
pub limit: usize,
/* private fields */
}Expand description
What a ListObjectVersions request lists: the object, the fields to render, the order, the
limit, and the bounds the request sets. Public so other implementors of LedgerService parse
requests, bound listings, end them, and mint cursors the same way.
Fields§
§object_id: ObjectID§read_mask: FieldMaskTreeThe fields of each listed live version to render.
removal_read_mask: FieldMaskTreeThe fields of each listed removal to render.
start_checkpoint: Option<u64>start_checkpoint: list only the versions written in this checkpoint or later.
end_checkpoint: Option<u64>end_checkpoint: list only the versions written before this checkpoint.
descending: boolWhether to list versions from highest to lowest.
limit: usizeThe most items, live versions and removals, one stream lists.
Implementations§
Source§impl ObjectVersionsQuery
impl ObjectVersionsQuery
Sourcepub fn new(
request: &ListObjectVersionsRequest,
default_limit: u32,
max_limit: u32,
) -> Result<Self>
pub fn new( request: &ListObjectVersionsRequest, default_limit: u32, max_limit: u32, ) -> Result<Self>
Parse and validate request, with options.limit defaulting to default_limit and
coerced into 1..=max_limit. A malformed cursor, one for another object, an
end_version below start_version, or an end_checkpoint below start_checkpoint is
INVALID_ARGUMENT.
Sourcepub fn lists_removal_transactions(&self) -> bool
pub fn lists_removal_transactions(&self) -> bool
Whether Self::removal_read_mask selects each removal’s transaction. A backend that
lists removals sets ObjectVersionItem::Removal’s transaction exactly when it does,
failing the listing when it cannot.
Sourcepub fn has_held_after_cursor(&self, floor_checkpoint: Option<u64>) -> bool
pub fn has_held_after_cursor(&self, floor_checkpoint: Option<u64>) -> bool
Whether the request carries an after cursor whose client holds history right below the
versions the listing lists that pruning through floor_checkpoint may have cut a gap
after: an item’s cursor, whose item the client holds, or a boundary from a listing bounded
by a checkpoint K below the floor, so that the lowest start_checkpoint the server
accepts, the floor + 1, is above K + 1. This checkpoint rule is complete only for the
boundary at version 0, below every version: its client holds what was written by the end
of K, and pruning keeps every version written after the floor. A boundary above version 0
can sit at an end_version cut and vouches for nothing above it (see
Self::needs_history_retained_from); the nothing-retained path and the
low-start_checkpoint gate apply the checkpoint rule to it as ruled. With nothing pruned
(floor_checkpoint unset), no boundary is held.
Sourcepub fn starts_after_cursor(&self, start: SequenceNumber) -> bool
pub fn starts_after_cursor(&self, start: SequenceNumber) -> bool
Whether the listing’s lowest version, start, is the one right after its after cursor,
of either kind.
Sourcepub fn needs_history_retained_from(
&self,
start: SequenceNumber,
floor_checkpoint: Option<u64>,
) -> bool
pub fn needs_history_retained_from( &self, start: SequenceNumber, floor_checkpoint: Option<u64>, ) -> bool
Whether a server whose listing floor is floor_checkpoint must find the object’s history
retained from start, the listing’s lowest version, so as not to follow the history its
client holds with a gap: the listing starts right after its after cursor (see
Self::starts_after_cursor), which is an item’s cursor, a boundary that pruning through
the floor passed (see Self::has_held_after_cursor), or a boundary above version 0.
Such a boundary can sit at an end_version cut, below versions written by its checkpoint,
so it vouches for nothing above it: the history from start is retained only when the
object’s version at the floor is at most one above the boundary’s version, as it is for a
boundary minted at the top of its window bounded at or above the floor. The boundary at
version 0, below every version, keeps the checkpoint rule.
Sourcepub fn after_at_or_above(&self, version: Option<SequenceNumber>) -> bool
pub fn after_at_or_above(&self, version: Option<SequenceNumber>) -> bool
Whether the request’s after cursor is at or above version, the object’s version at the
end of some checkpoint, so that every version the listing lists was written after that
checkpoint. false without an after cursor or a version.
Sourcepub fn check_some_cursor_indexed(
&self,
window: &CheckpointWindow,
upper_bound: &AtCheckpointUpperBound,
) -> Result<()>
pub fn check_some_cursor_indexed( &self, window: &CheckpointWindow, upper_bound: &AtCheckpointUpperBound, ) -> Result<()>
Fails with OUT_OF_RANGE / ABOVE_LATEST_AVAILABLE (AtCheckpointUpperBound::check_cursor,
naming the lowest of their checkpoints) when the listing runs to the tip (end_checkpoint
unset, or above the checkpoint after the tip) and the request has cursors, all from
listings bounded by a checkpoint above upper_bound’s highest indexed one: from servers
that have indexed further than this one. A cursor from a listing bounded at or below it
names a version this server has indexed.
Sourcepub fn floor_error(
&self,
floor_checkpoint: u64,
upper_bound: &AtCheckpointUpperBound,
) -> RpcError
pub fn floor_error( &self, floor_checkpoint: u64, upper_bound: &AtCheckpointUpperBound, ) -> RpcError
The error for a request a server whose listing floor is floor_checkpoint cannot serve
because pruning took history it would list: OUT_OF_RANGE / BELOW_EARLIEST_AVAILABLE
(below_serving_floor), reporting floor_checkpoint + 1, the lowest start_checkpoint
it accepts, as lowestAvailableCheckpoint. A request whose after cursor comes from a
listing bounded above upper_bound‘s highest indexed checkpoint, by a server that has
indexed further, gets that cursor’s ABOVE_LATEST_AVAILABLE
(AtCheckpointUpperBound::check_cursor) instead, which it can retry once this server
catches up: ListTransactions’ floor_error_or puts the tip refusal of a request with
an after cursor before the floor rules.
Sourcepub fn check_checkpoint_floor(
&self,
floor_checkpoint: Option<u64>,
upper_bound: &AtCheckpointUpperBound,
version_at_floor: impl FnOnce(u64) -> Result<Option<SequenceNumber>>,
) -> Result<()>
pub fn check_checkpoint_floor( &self, floor_checkpoint: Option<u64>, upper_bound: &AtCheckpointUpperBound, version_at_floor: impl FnOnce(u64) -> Result<Option<SequenceNumber>>, ) -> Result<()>
Fails with Self::floor_error when a server whose listing floor is floor_checkpoint
cannot serve the request’s checkpoint range, as ListTransactions refuses one below its
floor. The lowest start_checkpoint it accepts is the checkpoint after the floor, since a
range starts above the object’s version at the end of the checkpoint before it. A lower
start_checkpoint is served only when an after cursor bounds the listing at or above
the floor, as ListTransactions checks the start only after the cursors narrow it: the
cursor is at or above version_at_floor(floor_checkpoint), the object’s version at the
end of the floor checkpoint, so every version after it was written after the floor, or
the object has no version there. A pruned server cannot tell whether an object without
one did not exist yet or was removed at or before the floor, so it must also find the
object’s history retained from the listing’s lowest version on. An end_checkpoint at or
below that lowest start is refused when the listing has no lower bound of its own
(neither start_checkpoint nor an after cursor). An empty range lists nothing,
whatever the floor. With nothing pruned (floor_checkpoint unset), every range is served.
Sourcepub fn nothing_retained(&self) -> ObjectVersionsPlan
pub fn nothing_retained(&self) -> ObjectVersionsPlan
The plan of a listing for an object of which a pruning server retains nothing up to the
bounding checkpoint: it lists nothing and ends as at the object’s first version, with
CHECKPOINT_BOUND.
Sourcepub fn checkpoint_window(
&self,
upper_bound: &AtCheckpointUpperBound,
) -> Result<CheckpointWindow>
pub fn checkpoint_window( &self, upper_bound: &AtCheckpointUpperBound, ) -> Result<CheckpointWindow>
The checkpoints the listing covers, against upper_bound’s highest indexed checkpoint,
the tip, as ListTransactions bounds them. A descending listing whose end_checkpoint is
above the checkpoint after the tip, or whose start_checkpoint is above the tip with
end_checkpoint unset, is OUT_OF_RANGE / ABOVE_LATEST_AVAILABLE (bound
end_checkpoint or start_checkpoint): it would start above versions this server has
not indexed. An ascending listing is never refused for its range: it runs through the tip
and ends with LEDGER_TIP.
Sourcepub fn plan(
&self,
window: &CheckpointWindow,
upper_bound: &AtCheckpointUpperBound,
newest_visible: Option<SequenceNumber>,
newest_before_start: Option<SequenceNumber>,
) -> Result<ObjectVersionsPlan>
pub fn plan( &self, window: &CheckpointWindow, upper_bound: &AtCheckpointUpperBound, newest_visible: Option<SequenceNumber>, newest_before_start: Option<SequenceNumber>, ) -> Result<ObjectVersionsPlan>
What the listing reads and how it ends, given newest_visible, the object’s version at
the end of CheckpointWindow::bounding_checkpoint, live or not (the newest version
written by then), or None if the object did not exist yet, and newest_before_start,
its version at the end of CheckpointWindow::below_start (None when that is unset).
The checkpoint range lists the versions above newest_before_start up to
newest_visible: an object’s versions only increase from checkpoint to checkpoint, so
the versions written in a checkpoint range are one version range. The cursors narrow it
to the versions between their positions (see ObjectVersionCursor).
A cursor comes from a listing on any server, such as another replica that has indexed
further, so it can name a version past this server’s tip: above newest_visible, or at or
above [OBJECT_START_VERSION] if it is None. When the window runs to the tip
(end_checkpoint unset, or above the checkpoint after the tip), the ledger List APIs’
rules apply to such a cursor:
- Descending, it is
AtCheckpointUpperBound::unindexed_cursor_error, whatever the version range: listing from this server’s view would start below versions it lacks. Abeforeat the version right afternewest_visibleleaves none between them, so it is served. Withnewest_visibleNone, that version is [OBJECT_START_VERSION], the first an object can have, so the boundary at version 0, which a listing of the object that lists nothing mints, is served back as either cursor, unless every cursor of the request comes from a listing bounded above the tip (seeSelf::check_some_cursor_indexed). - Ascending, the listing is served from this server’s view, which holds nothing above
the tip. If its window reaches past the tip (see
LEDGER_TIPbelow), anafterpast the tip lists nothing and ends withLEDGER_TIP, where the client resumes from the cursor it holds, withCURSOR_BOUNDifbeforeis at or below the version afterafter, leaving nothing between them, or withCHECKPOINT_BOUNDifend_versionis. A window that ends at or below the tip ends by the rules below. Abeforepast the tip leaves the tip as the listing’s end.
A listing with an indexed end_checkpoint stops at it, so every cursor is safe to page
from. An empty checkpoint range lists nothing. It ends with CHECKPOINT_BOUND when
end_checkpoint - 1 is indexed; ascending above the tip, it ends with LEDGER_TIP, as
ListTransactions does.
The listing ends where its range does, at the bound the ledger List APIs would name:
- The far cursor in listing order ends it with
CURSOR_BOUNDwhen the version it names is inside the request’s window (start_version,end_versionand the versions written in the checkpoint range) or at its edge:beforeat or below the window’s end ascending,afterat or above its start descending. - Otherwise an ascending listing whose window runs to the tip and reaches past the
object’s newest version (
end_versionunset, or above both the version after it andstart_version) ends withLEDGER_TIP, since versions written later extend it, even when itsaftercursor leaves nothing to list: a client following an object’s new versions resumes from its newest version’s cursor. - Every other listing ends at the edge of the window the request set, with
CHECKPOINT_BOUND, including one whose starting cursor (afterascending,beforedescending) sits at or past that edge.
Sourcepub fn end_cursor(
&self,
plan: &ObjectVersionsPlan,
bounding_checkpoint: u64,
) -> Bytes
pub fn end_cursor( &self, plan: &ObjectVersionsPlan, bounding_checkpoint: u64, ) -> Bytes
The cursor the last frame of a listing that plan plans resumes from, when the listing
ends with its planned reason, bounded by bounding_checkpoint: a request in the same
order resumes from it.
CURSOR_BOUND: the far cursor (beforeascending,afterdescending), unchanged.- The starting cursor (
afterascending,beforedescending), unchanged, when it sits at or past the window’s edge, so the listing reached nothing. That includes an ascendingafterpast the tip. - Otherwise the window’s edge, which is what the listing reached, as an
ObjectVersionCursor::Boundary: ascending, the boundary below the window’s end, above whichafterlists what the window left; descending, the boundary below the window’s lowest version, at or below whichbeforelists, or abovenewest_visiblewhen the window lies wholly above it. Versions written later land on the far side of the boundary from what the listing reached, whichever order resumes from it.
Sourcepub fn cursor(&self, version: u64, bounding_checkpoint: u64) -> Bytes
pub fn cursor(&self, version: u64, bounding_checkpoint: u64) -> Bytes
The cursor of the item at version, minted by a listing bounded by bounding_checkpoint.
Sourcepub fn boundary_cursor(&self, version: u64, bounding_checkpoint: u64) -> Bytes
pub fn boundary_cursor(&self, version: u64, bounding_checkpoint: u64) -> Bytes
The cursor of the boundary between version and the version after it, minted by a
listing bounded by bounding_checkpoint.
Sourcepub fn frames(
&self,
bounding_checkpoint: u64,
listed: BoxStream<'static, Result<ObjectVersionItem>>,
end: QueryEndReason,
end_cursor: impl Future<Output = Bytes> + Send + 'static,
) -> ObjectVersionFrames
pub fn frames( &self, bounding_checkpoint: u64, listed: BoxStream<'static, Result<ObjectVersionItem>>, end: QueryEndReason, end_cursor: impl Future<Output = Bytes> + Send + 'static, ) -> ObjectVersionFrames
The frames of a listing bounded by bounding_checkpoint (see
CheckpointWindow::bounding_checkpoint) whose items listed yields in listing order.
Each item goes out on its own frame, whose cursor is the item’s: a live version as
object, a removal as removal with the fields Self::removal_read_mask selects. The
frame with the Self::limitth item ends the stream with ITEM_LIMIT, whatever end
says, and listed is not polled again. A listed that ends first is followed by a final
frame ending with end, whose cursor end_cursor resolves to once listed has ended (see
Self::end_cursor), so a listing with no items still returns a resume cursor. An error
listed yields ends the stream with it.
Trait Implementations§
Source§impl Clone for ObjectVersionsQuery
impl Clone for ObjectVersionsQuery
Source§fn clone(&self) -> ObjectVersionsQuery
fn clone(&self) -> ObjectVersionsQuery
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 ObjectVersionsQuery
impl RefUnwindSafe for ObjectVersionsQuery
impl Send for ObjectVersionsQuery
impl Sync for ObjectVersionsQuery
impl Unpin for ObjectVersionsQuery
impl UnsafeUnpin for ObjectVersionsQuery
impl UnwindSafe for ObjectVersionsQuery
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.