Struct ParkedKeys 

pub struct ParkedKeys {
    ttl: Duration,
    held: Mutex<BTreeMap<(String, String), ParkedKey>>,
}

Keys parked at this server, in memory, keyed by name and fingerprint.

Several keys may be parked under one name at once, so parking is not a way to hold a name against the machine that wants it: the operator admits one by its fingerprint, which is what the registering machine printed.

Nothing lists them: a park is looked up by the name the operator was told, and a name nobody was told is not guessable from here.

Fields

ttl: Duration

held: Mutex<BTreeMap<(String, String), ParkedKey>>

Implementations

impl ParkedKeys

pub fn new(ttl: Duration) -> Self

Holds each park for ttl.

pub fn park( &self, name: &str, kind: AccountKind, key: &str, now: OffsetDateTime, ) -> Result<ParkedKey, OffsetDateTime>

Parks key under name, or answers when the park this same key already has there lapses.

Another key parked under the same name is no obstacle: both wait, and the operator admits the fingerprint they were shown.

pub fn describe( &self, name: &str, fingerprint: Option<&str>, now: OffsetDateTime, ) -> Option<ParkedKey>

The live park under name whose fingerprint is fingerprint, or, with none given, the one made most recently.

One answer, because bot.did.describeParkedKey returns one park. A caller that knows which key it means names it; the newest is what a caller that names none is shown.

pub fn take( &self, name: &str, fingerprint: &str, now: OffsetDateTime, ) -> Option<ParkedKey>

Takes the live park under name whose fingerprint is fingerprint, so the key is admitted once.

Trait Implementations

impl Debug for ParkedKeys

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

Formats the value using the given formatter.