pub struct GraphSelection {
pub nodes: Vec<Handle<Node>>,
}Fields§
§nodes: Vec<Handle<Node>>Implementations§
Source§impl GraphSelection
impl GraphSelection
pub fn from_list(nodes: Vec<Handle<Node>>) -> Self
Sourcepub fn single_or_empty(node: Handle<Node>) -> Self
pub fn single_or_empty(node: Handle<Node>) -> Self
Creates new selection as single if node handle is not none, and empty if it is.
Sourcepub fn insert_or_exclude(&mut self, handle: Handle<Node>)
pub fn insert_or_exclude(&mut self, handle: Handle<Node>)
Adds new selected node, or removes it if it is already in the list of selected nodes.
pub fn contains(&self, handle: Handle<Node>) -> bool
pub fn nodes(&self) -> &[Handle<Node>]
pub fn extend(&mut self, other: &GraphSelection)
pub fn root_nodes(&self, graph: &Graph) -> Vec<Handle<Node>>
pub fn global_rotation_position( &self, graph: &Graph, ) -> Option<(UnitQuaternion<f32>, Vector3<f32>)>
pub fn offset(&self, graph: &mut Graph, offset: Vector3<f32>)
pub fn rotate(&self, graph: &mut Graph, rotation: UnitQuaternion<f32>)
pub fn scale(&self, graph: &mut Graph, scale: Vector3<f32>)
pub fn local_positions(&self, graph: &Graph) -> Vec<Vector3<f32>> ⓘ
pub fn local_rotations(&self, graph: &Graph) -> Vec<UnitQuaternion<f32>> ⓘ
pub fn local_scales(&self, graph: &Graph) -> Vec<Vector3<f32>> ⓘ
Trait Implementations§
Source§impl Clone for GraphSelection
impl Clone for GraphSelection
Source§fn clone(&self) -> GraphSelection
fn clone(&self) -> GraphSelection
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for GraphSelection
impl Debug for GraphSelection
Source§impl Default for GraphSelection
impl Default for GraphSelection
Source§fn default() -> GraphSelection
fn default() -> GraphSelection
Returns the “default value” for a type. Read more
Source§impl PartialEq for GraphSelection
impl PartialEq for GraphSelection
Source§impl SelectionContainer for GraphSelection
impl SelectionContainer for GraphSelection
fn len(&self) -> usize
fn first_selected_entity( &self, controller: &dyn SceneController, scenes: &SceneContainer, callback: &mut dyn FnMut(EntityInfo<'_>), )
fn on_property_changed( &mut self, controller: &mut dyn SceneController, args: &PropertyChanged, engine: &mut Engine, sender: &MessageSender, )
fn paste_property( &mut self, path: &str, value: &dyn Reflect, sender: &MessageSender, )
fn provide_docs( &self, controller: &dyn SceneController, engine: &Engine, ) -> Option<String>
fn is_empty(&self) -> bool
fn is_single_selection(&self) -> bool
fn is_multi_selection(&self) -> bool
impl Eq for GraphSelection
Auto Trait Implementations§
impl Freeze for GraphSelection
impl !RefUnwindSafe for GraphSelection
impl Send for GraphSelection
impl Sync for GraphSelection
impl Unpin for GraphSelection
impl UnsafeUnpin for GraphSelection
impl !UnwindSafe for GraphSelection
Blanket Implementations§
Source§impl<T> AsyncTaskResult for T
impl<T> AsyncTaskResult for T
Source§impl<T> BaseSelectionContainer for T
impl<T> BaseSelectionContainer for T
fn clone_boxed(&self) -> Box<dyn SelectionContainer>
fn eq_ref(&self, other: &(dyn SelectionContainer + 'static)) -> bool
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Converts
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Converts
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
Source§impl<T, U> ObjectOrVariant<T> for Uwhere
PhantomData<U>: ObjectOrVariantHelper<T, U>,
impl<T, U> ObjectOrVariant<T> for Uwhere
PhantomData<U>: ObjectOrVariantHelper<T, U>,
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<R, P> ReadPrimitive<R> for P
impl<R, P> ReadPrimitive<R> for P
Source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
Read this value from the supplied reader. Same as
ReadEndian::read_from_little_endian().Source§impl<T> SelectionContainerAsAny for Twhere
T: SelectionContainer,
impl<T> SelectionContainerAsAny for Twhere
T: SelectionContainer,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.