Struct Vertex

pub struct Vertex {
    pub id: Uuid,
    pub t: Identifier,
}

A vertex.

Vertices are how you would represent nouns in the datastore. An example might be a user, or a movie. All vertices have a unique ID and a type.

Fields

id: Uuid

The id of the vertex.

t: Identifier

The type of the vertex.

Implementations

impl Vertex

pub fn new(t: Identifier) -> Self

Creates a new vertex with an ID generated via UUIDv1. These vertex IDs are trivially guessable and consequently less secure, but index better. This method is suggested unless you need vertex IDs to not be trivially guessable.

Arguments

• t: The type of the vertex.

pub fn with_id(id: Uuid, t: Identifier) -> Self

Creates a new vertex with a specified id.

Arguments

• id: The id of the vertex.
• t: The type of the vertex.

Trait Implementations

impl Clone for Vertex

fn clone(&self) -> Vertex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Vertex

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

Formats the value using the given formatter.

impl Hash for Vertex

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Vertex

fn eq(&self, other: &Vertex) -> 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 Eq for Vertex