pub enum RotOrder {
XYZ,
XZY,
YXZ,
YZX,
ZXY,
ZYX,
}impl<T> Any for T where
T: 'static + ?Sized, [src]
impl<T> Any for T where
T: Any, [src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
[+] Show hidden undocumented itemsThe inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
Checks if self is actually part of its subset T (and can be converted to it).
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
The inclusion map: converts self to the equivalent element of its superset.
[+] Show hidden undocumented itemsThe inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
Checks if self is actually part of its subset T (and can be converted to it).
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
The inclusion map: converts self to the equivalent element of its superset.
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]