Struct Cache 

pub struct Cache { /* private fields */ }

The RDAP answers a finder holds, and for how long.

The regional registries limit how often you can ask, and a run that reports a spam wave asks about the same few networks again and again. An answer for an address is held for the whole network range the registry returned, so it also answers for every other address in that range. An answer for a domain is held for that name.

A clone shares the answers with the original. Give a clone to crate::Finder::with_cache and keep one to call Cache::clear.

The cache drops an answer when its time is over, the next time it stores one. It sets no other limit on its size. Read Cache::len and call Cache::clear when you want one.

DNS answers are not held here. The resolver holds them for the TTL of the record.

Implementations

impl Cache

pub const DEFAULT_HOLD: Duration

How long Cache::default holds an answer.

pub fn new(hold: Duration) -> Self

Returns an empty cache that holds each answer for this long.

A hold of zero holds nothing, so every lookup asks the registry.

pub fn len(&self) -> usize

Returns how many answers the cache holds, including answers whose time is over and that it has not dropped yet.

pub fn is_empty(&self) -> bool

Returns whether the cache holds no answers.

pub fn clear(&self)

Drops every answer.

Trait Implementations

impl Clone for Cache

fn clone(&self) -> Cache

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Cache

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

Formats the value using the given formatter.

impl Default for Cache

fn default() -> Self

Returns an empty cache that holds each answer for Cache::DEFAULT_HOLD.