Struct rg3d::animation::AnimationContainer [−][src]
pub struct AnimationContainer { /* fields omitted */ }
Implementations
pub fn iter(&self) -> PoolIterator<'_, Animation>ⓘNotable traits for PoolIterator<'a, T>impl<'a, T> Iterator for PoolIterator<'a, T> type Item = &'a T;
impl<'a, T> Iterator for PoolIterator<'a, T> type Item = &'a T;
pub fn pair_iter(&self) -> PoolPairIterator<'_, Animation>ⓘNotable traits for PoolPairIterator<'a, T>impl<'a, T> Iterator for PoolPairIterator<'a, T> type Item = (Handle<T>, &'a T);
impl<'a, T> Iterator for PoolPairIterator<'a, T> type Item = (Handle<T>, &'a T);
pub fn pair_iter_mut(&mut self) -> PoolPairIteratorMut<'_, Animation>ⓘNotable traits for PoolPairIteratorMut<'a, T>impl<'a, T> Iterator for PoolPairIteratorMut<'a, T> type Item = (Handle<T>, &'a mut T);
impl<'a, T> Iterator for PoolPairIteratorMut<'a, T> type Item = (Handle<T>, &'a mut T);
pub fn iter_mut(&mut self) -> PoolIteratorMut<'_, Animation>ⓘNotable traits for PoolIteratorMut<'a, T>impl<'a, T> Iterator for PoolIteratorMut<'a, T> type Item = &'a mut T;
impl<'a, T> Iterator for PoolIteratorMut<'a, T> type Item = &'a mut T;
Extracts animation from container and reserves its handle. It is used to temporarily take ownership over animation, and then put animation back using given ticket.
Puts animation back by given ticket.
Makes animation handle vacant again.
Removes queued animation events from every animation in the container.
Potential use cases
Sometimes there is a need to use animation events only from one frame, in this case you should clear events each frame. This situation might come up when you have multiple animations with signals, but at each frame not every event gets processed. This might result in unwanted side effects, like multiple attack events may result in huge damage in a single frame.
Trait Implementations
Auto Trait Implementations
impl !RefUnwindSafe for AnimationContainer
impl Send for AnimationContainer
impl Sync for AnimationContainer
impl Unpin for AnimationContainer
impl !UnwindSafe for AnimationContainer
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: 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
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub 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. Read more
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.