Struct InMemFrontier 

pub struct InMemFrontier { /* private fields */ }

An in-memory Frontier that crawls in insertion, reverse or priority order.

Implementations

impl InMemFrontier

pub const fn fifo() -> Self

Crawls seeds in the order they were pushed: breadth-first.

pub const fn lifo() -> Self

Crawls the most recently pushed seed first: depth-first.

pub const fn priority() -> Self

Crawls the seed with the highest priority first, and seeds of equal priority in the order they were pushed.

Trait Implementations

impl Debug for InMemFrontier

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

Formats the value using the given formatter.

impl Default for InMemFrontier

fn default() -> Self

Returns the “default value” for a type.

impl Extend<Seed> for InMemFrontier

fn extend<I: IntoIterator<Item = Seed>>(&mut self, seeds: I)

Queues seeds as is, e.g. from a snapshot, without any facade refusing them.

fn extend_one(&mut self, item: T)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl FromIterator<Seed> for InMemFrontier

fn from_iter<I: IntoIterator<Item = Seed>>(seeds: I) -> Self

Collects seeds into a FIFO frontier, e.g. to restore a snapshot.

impl Frontier for InMemFrontier

fn pop(&self) -> impl Future<Output = Result<NextSeed>> + Send

Hands out a due scheduled seed first, then the queue.

fn report(&self, report: Report) -> impl Future<Output = Result<Ack>> + Send

Re-queues seeds the crawl stopped before finishing, so a snapshot taken after the run includes them.

fn snapshot(&self) -> Option<Vec<Seed>>

Lists queued and scheduled seeds, the latter without when they are due.

fn push(&self, seed: Seed) -> impl Future<Output = Result<Admission>> + Send

Offers a seed, which the frontier may refuse.

fn size_hint(&self) -> Option<usize>

Returns the number of queued seeds, if known.

impl Schedule for InMemFrontier

fn schedule( &self, seed: Seed, due: Instant, ) -> impl Future<Output = Result<()>> + Send

Holds seed back until due, then hands it out from pop like a queued seed. A seed with the same fingerprint scheduled before is replaced, so a page has at most one revisit.

fn next_due(&self) -> impl Future<Output = Result<Option<Instant>>> + Send

Returns when the next scheduled seed is due, if any.