Struct Node

pub struct Node {
    pub id: u128,
    pub label: String,
    pub properties: Option<HashMap<String, Value>>,
}

A node in the graph containing an ID, label, and property map. Properties are serialised without enum variant names in JSON format.

Fields

id: u128

The ID of the node.

This is not serialized when stored as it is the key.

label: String

The label of the node.

properties: Option<HashMap<String, Value>>

The properties of the node.

Properties are optional and can be None. Properties are serialised without enum variant names in JSON format.

Implementations

impl Node

pub const NUM_PROPERTIES: usize = 2usize

The number of properties in a node.

This is used as a constant in the return value mixin methods.

pub fn decode_node(bytes: &[u8], id: u128) -> Result<Node, GraphError>

Decodes a node from a byte slice.

Takes ID as the ID is not serialized when stored as it is the key. Uses the known ID (either from the query or the key in an LMDB iterator) to construct a new node.

pub fn encode_node(&self) -> Result<Vec<u8>, GraphError>

Encodes a node into a byte slice

This skips the ID and if the properties are None, it skips the properties.

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Node

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for Node

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

Formats the value using the given formatter.

impl Filterable for Node

fn type_name(&self) -> FilterableType

fn id(&self) -> &u128

fn uuid(&self) -> String

fn label(&self) -> &str

fn from_node(&self) -> u128

fn from_node_uuid(&self) -> String

fn to_node(&self) -> u128

fn to_node_uuid(&self) -> String

fn vector_data(&self) -> &[f64]

fn score(&self) -> f64

fn properties(self) -> Option<HashMap<String, Value>>

fn properties_ref(&self) -> &Option<HashMap<String, Value>>

fn properties_mut(&mut self) -> &mut Option<HashMap<String, Value>>

fn check_property(&self, key: &str) -> Result<&Value, GraphError>

fn find_property<'a>( &'a self, key: &str, secondary_properties: &'a HashMap<String, ReturnValue>, property: &'a mut ReturnValue, ) -> Option<&'a ReturnValue>

impl Ord for Node

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Node

fn eq(&self, other: &Node) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for Node

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for Node

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for Node

impl StructuralPartialEq for Node