Struct Page 

pub struct Page<T> { /* private fields */ }

One page of lookup results.

A capability path can hold more registrations than a single DHT read can return, so lookups page. next is Some only when the backend knows more results remain; an empty page with next: None means the query is exhausted.

Implementations

impl<T> Page<T>

pub const fn complete(items: Vec<T>) -> Self

Creates a page that completes the query.

pub const fn partial(items: Vec<T>, next: Cursor) -> Self

Creates a page with more results available from next.

pub fn items(&self) -> &[T]

Returns the results in this page.

pub const fn next_cursor(&self) -> Option<Cursor>

Returns the cursor for the next page, if more results remain.

pub const fn has_more(&self) -> bool

Returns true if more results remain beyond this page.

pub fn len(&self) -> usize

Returns the number of results in this page.

pub fn is_empty(&self) -> bool

Returns true if this page carries no results.

pub fn into_items(self) -> Vec<T>

Consumes the page and returns its results.

Trait Implementations

impl<T: Clone> Clone for Page<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for Page<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Eq> Eq for Page<T>

impl<T> IntoIterator for Page<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq for Page<T>

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<T: PartialEq> StructuralPartialEq for Page<T>