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
41
42
43
44
/*
* 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 GraphNeighborsIn {
/// AsOf walks the graph as it stood at an instant, RFC 3339. Absent walks it as it stands now.
#[serde(rename = "as_of", skip_serializing_if = "Option::is_none")]
pub as_of: Option<String>,
/// Depth is how many hops. Absent is one.
#[serde(rename = "depth", skip_serializing_if = "Option::is_none")]
pub depth: Option<i32>,
/// Direction is out, in or both. Out follows an edge from its entity to its value — what the node points at; in follows it the other way — what points at the node; both is the union of the two, not a third rule. Absent is out.
#[serde(rename = "direction", skip_serializing_if = "Option::is_none")]
pub direction: Option<String>,
/// Relation narrows the walk to one edge relation. Absent follows all. Only edges are ever followed: an assertion whose value is a scalar is a property and is never a hop.
#[serde(rename = "relation", skip_serializing_if = "Option::is_none")]
pub relation: Option<String>,
/// Seeds is where the walk starts. At least one.
#[serde(rename = "seeds", skip_serializing_if = "Option::is_none")]
pub seeds: Option<Vec<String>>,
}
impl GraphNeighborsIn {
pub fn new() -> GraphNeighborsIn {
GraphNeighborsIn {
as_of: None,
depth: None,
direction: None,
relation: None,
seeds: None,
}
}
}