1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
/*
* Hanzo Cloud API
*
* The Hanzo Cloud API as a customer calls it: every operation under /v1/ except the operator's admin product, relay routes, legacy spellings and capabilities still reached by flag. Tagged by product: the first path segment after /v1/.
*
* The version of the OpenAPI document: v1
*
* Generated by: https://openapi-generator.tech
*/
use crate::models;
use serde::{Deserialize, Serialize};
#[derive(Clone, Default, Debug, PartialEq, Serialize, Deserialize)]
pub struct GraphNeighborsOut {
/// Bound is the ceiling this walk was held to, the same for every caller, so Truncated can be read against a number rather than guessed at.
#[serde(rename = "bound", skip_serializing_if = "Option::is_none")]
pub bound: Option<i32>,
/// Depth is the deepest hop count actually reached. It is at most the depth asked for, and smaller when the walk ran out of edges first.
#[serde(rename = "depth", skip_serializing_if = "Option::is_none")]
pub depth: Option<i32>,
/// Entities is everything reached, the seeds included, ordered by the fewest hops that reach each one and then by key.
#[serde(rename = "entities", skip_serializing_if = "Option::is_none")]
pub entities: Option<Vec<String>>,
/// Truncated says the bound stopped the walk. The bound is part of the answer rather than a silent short read.
#[serde(rename = "truncated", skip_serializing_if = "Option::is_none")]
pub truncated: Option<bool>,
}
impl GraphNeighborsOut {
pub fn new() -> GraphNeighborsOut {
GraphNeighborsOut {
bound: None,
depth: None,
entities: None,
truncated: None,
}
}
}