Type Definition conrod::widget::id::Id

type Id = NodeIndex<u32>;

Unique widget identifier.

Each widget instance must use its own, uniquely generated widget::Id so that it's state can be cached within the Ui type.

Indices are generated consecutively from 0. This allows us to avoid the need for hashing identifiers in favour of indexing directly into the Graph's underlying node array.

widget::Ids may be generated via the widget_ids! macro.

Trait Implementations

impl Index<Id> for Graph

type Output = Node

The returned type after indexing.

fn index<'a>(&'a self, id: Id) -> &'a Node

Performs the indexing (container[index]) operation.

impl IndexMut<Id> for Graph

fn index_mut<'a>(&'a mut self, id: Id) -> &'a mut Node

Performs the mutable indexing (container[index]) operation.