class Edge

Defined at line 351 of file fidling/gen/sdk/fidl/fuchsia.hardware.interconnect/fuchsia.hardware.interconnect/cpp/fidl/fuchsia.hardware.interconnect/cpp/natural_types.h

Public Methods

void Edge (Storage_ storage)

void Edge ()

Defined at line 357 of file fidling/gen/sdk/fidl/fuchsia.hardware.interconnect/fuchsia.hardware.interconnect/cpp/fidl/fuchsia.hardware.interconnect/cpp/natural_types.h

void Edge (Edge && )

Defined at line 358 of file fidling/gen/sdk/fidl/fuchsia.hardware.interconnect/fuchsia.hardware.interconnect/cpp/fidl/fuchsia.hardware.interconnect/cpp/natural_types.h

void Edge (const Edge & other)

Edge & operator= (Edge && )

Defined at line 359 of file fidling/gen/sdk/fidl/fuchsia.hardware.interconnect/fuchsia.hardware.interconnect/cpp/fidl/fuchsia.hardware.interconnect/cpp/natural_types.h

Edge & operator= (const Edge & other)

bool operator== (const Edge & other)

bool operator!= (const Edge & other)

bool IsEmpty ()

const std::optional<uint32_t> & src_node_id ()

Source where bus traffic may originate.

::std::optional<uint32_t> & src_node_id ()

Source where bus traffic may originate.

Edge & src_node_id (std::optional<uint32_t> value)

Source where bus traffic may originate.

const std::optional<uint32_t> & dst_node_id ()

Destination where bus traffic may travel to.

::std::optional<uint32_t> & dst_node_id ()

Destination where bus traffic may travel to.

Edge & dst_node_id (std::optional<uint32_t> value)

Destination where bus traffic may travel to.

const std::optional<uint32_t> & weight ()

An optional weight to apply to the edge. Used for calculating the optimal

path from between two nodes. If there are multiple paths from one node to

another, the path will be calculated by optimizing for the smallest sum of

all edge weights along the path. If not provided, the weight is assumed to

be 1.

::std::optional<uint32_t> & weight ()

An optional weight to apply to the edge. Used for calculating the optimal

path from between two nodes. If there are multiple paths from one node to

another, the path will be calculated by optimizing for the smallest sum of

all edge weights along the path. If not provided, the weight is assumed to

be 1.

Edge & weight (std::optional<uint32_t> value)

An optional weight to apply to the edge. Used for calculating the optimal

path from between two nodes. If there are multiple paths from one node to

another, the path will be calculated by optimizing for the smallest sum of

all edge weights along the path. If not provided, the weight is assumed to

be 1.

void Edge (::fidl::internal::DefaultConstructPossiblyInvalidObjectTag )

Friends

class MemberVisitor

class NaturalTableCodingTraits