pub struct Plane {
pub normal: Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>>,
pub d: f32,
}Fields§
§normal: Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>>§d: f32Implementations§
source§impl Plane
impl Plane
sourcepub fn from_normal_and_point(
normal: &Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>>,
point: &Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>>
) -> Option<Plane>
pub fn from_normal_and_point( normal: &Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>>, point: &Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>> ) -> Option<Plane>
Creates plane from a point and normal vector at that point. May fail if normal is degenerated vector.
sourcepub fn from_abcd(a: f32, b: f32, c: f32, d: f32) -> Option<Plane>
pub fn from_abcd(a: f32, b: f32, c: f32, d: f32) -> Option<Plane>
Creates plane using coefficients of plane equation Ax + By + Cz + D = 0 May fail if length of normal vector is zero (normal is degenerated vector).
pub fn dot( &self, point: &Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>> ) -> f32
pub fn distance( &self, point: &Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>> ) -> f32
sourcepub fn intersection_point(
&self,
b: &Plane,
c: &Plane
) -> Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>>
pub fn intersection_point( &self, b: &Plane, c: &Plane ) -> Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>>
Trait Implementations§
source§impl PartialEq for Plane
impl PartialEq for Plane
source§impl Visit for Planewhere
Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>>: Visit,
f32: Visit,
impl Visit for Planewhere Matrix<f32, Const<3>, Const<1>, ArrayStorage<f32, 3, 1>>: Visit, f32: Visit,
impl Copy for Plane
impl StructuralPartialEq for Plane
Auto Trait Implementations§
impl RefUnwindSafe for Plane
impl Send for Plane
impl Sync for Plane
impl Unpin for Plane
impl UnwindSafe for Plane
Blanket Implementations§
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
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§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.§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.§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.§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> FieldValue for Twhere
T: 'static,
impl<T> FieldValue for Twhere T: 'static,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T> ScriptMessagePayload for Twhere
T: 'static + Send,
impl<T> ScriptMessagePayload for Twhere T: 'static + Send,
source§fn as_any_ref(&self) -> &(dyn Any + 'static)
fn as_any_ref(&self) -> &(dyn Any + 'static)
Returns
self as &dyn Anysource§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Returns
self as &dyn Any§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.