Struct kitsune_p2p::event::QueryAgentsEvt

pub struct QueryAgentsEvt {
    pub space: Arc<KitsuneSpace>,
    pub agents: Option<HashSet<Arc<KitsuneAgent>>>,
    pub window: Option<TimeWindow>,
    pub arc_set: Option<Arc<DhtArcSet>>,
    pub near_basis: Option<DhtLocation>,
    pub limit: Option<u32>,
}

Get agent info which satisfies a query.

Fields

space: Arc<KitsuneSpace>

The “space” context.

agents: Option<HashSet<Arc<KitsuneAgent>>>

Optional set of agents to filter by.

window: Option<TimeWindow>

Optional time range to filter by.

arc_set: Option<Arc<DhtArcSet>>

Optional arcset to intersect by.

near_basis: Option<DhtLocation>

If set, results are ordered by proximity to the specified location

limit: Option<u32>

Limit to the number of results returned

Implementations

impl QueryAgentsEvt

pub fn new(space: Arc<KitsuneSpace>) -> Self

Constructor. Every query needs to know what space it’s for.

pub fn by_agents<A: IntoIterator<Item = Arc<KitsuneAgent>>>(
    self,
    agents: A
) -> Self

Add in an agent list query

pub fn by_window(self, window: TimeWindow) -> Self

Add in an a time window query

pub fn by_arc_set(self, arc_set: Arc<DhtArcSet>) -> Self

Add in an an arcset query

pub fn near_basis(self, basis: DhtLocation) -> Self

Specify that the results should be ordered by proximity to this basis

pub fn limit(self, limit: u32) -> Self

Limit the number of results

Trait Implementations

impl Debug for QueryAgentsEvt

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

Formats the value using the given formatter.