pub struct ApiVisibilityReviewQuery { /* private fields */ }Expand description
Bounded cursor for one resource-scoped API visibility review page.
The scan limit counts incoming relations inspected, including malformed or unrelated relations that the projection rejects. This prevents a resource with many noncanonical edges from forcing an unbounded clone or scan.
Relation cursors are opaque continuation capabilities, not authenticated pagination tokens. A cursor can identify the last relation inspected even when that relation was omitted from the review page. Hosts must authorize access to the resource before accepting a query, use non-secret relation identifiers, scope a cursor to the same resource, and avoid logging it.
Implementations§
Source§impl ApiVisibilityReviewQuery
impl ApiVisibilityReviewQuery
Sourcepub fn new(scan_limit: u16) -> Result<Self, ApiObservationError>
pub fn new(scan_limit: u16) -> Result<Self, ApiObservationError>
Creates a query with a positive scan limit under the compiled ceiling.
Sourcepub fn after_relation_id(
self,
relation_id: RelationId,
) -> Result<Self, ApiObservationError>
pub fn after_relation_id( self, relation_id: RelationId, ) -> Result<Self, ApiObservationError>
Starts after one previously scanned opaque, non-secret relation cursor.
The host must reuse this cursor only for the resource and authorization context from which it was returned. Reusing it with another resource is not rejected, but has no defined traversal meaning.
Sourcepub fn after(&self) -> Option<&RelationId>
pub fn after(&self) -> Option<&RelationId>
Returns the exclusive opaque relation cursor, when this is a later page.
Sourcepub const fn scan_limit(&self) -> u16
pub const fn scan_limit(&self) -> u16
Returns the maximum incoming relations inspected by this page.
Trait Implementations§
Source§impl Clone for ApiVisibilityReviewQuery
impl Clone for ApiVisibilityReviewQuery
Source§fn clone(&self) -> ApiVisibilityReviewQuery
fn clone(&self) -> ApiVisibilityReviewQuery
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for ApiVisibilityReviewQuery
impl Debug for ApiVisibilityReviewQuery
Source§impl Default for ApiVisibilityReviewQuery
impl Default for ApiVisibilityReviewQuery
Source§impl<'de> Deserialize<'de> for ApiVisibilityReviewQuery
impl<'de> Deserialize<'de> for ApiVisibilityReviewQuery
Source§fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
D: Deserializer<'de>,
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
D: Deserializer<'de>,
impl Eq for ApiVisibilityReviewQuery
Source§impl PartialEq for ApiVisibilityReviewQuery
impl PartialEq for ApiVisibilityReviewQuery
Source§impl Serialize for ApiVisibilityReviewQuery
impl Serialize for ApiVisibilityReviewQuery
impl StructuralPartialEq for ApiVisibilityReviewQuery
Auto Trait Implementations§
impl Freeze for ApiVisibilityReviewQuery
impl RefUnwindSafe for ApiVisibilityReviewQuery
impl Send for ApiVisibilityReviewQuery
impl Sync for ApiVisibilityReviewQuery
impl Unpin for ApiVisibilityReviewQuery
impl UnsafeUnpin for ApiVisibilityReviewQuery
impl UnwindSafe for ApiVisibilityReviewQuery
Blanket Implementations§
§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> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
§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
key and return true if they are equal.