Struct refraction::RefractionEq
source · pub struct RefractionEq<T> {
pub d: T,
pub h: T,
pub w: T,
pub n: T,
}
Expand description
Define the parameters required to solve a refraction problem.
In the following drawing, we want to find x
when we know w
, h
, d
,
and the ratio of refractive indices n
where n = n2/n1
.
a
and b
are angles, n1
and n2
are refractive indices, d
, h
and
w
are lengths.
---
----/ a|
n1 ----/ |
----/ |
-----/ |
----/ | w
----/ |
----/ |
x --/ d-x |
|--------|----------------------------------------|
| /
| h |
| /
| /
| / n2
| |
| /
| /
| /
|b|
|/
sin(a) n2
------ = -- = n
sin(b) n1
See this for an explanation of the problem and this solution. Ascii drawing done with textik.com.
Fields§
§d: T
Distance along the refractive boundary
h: T
Height below the refractive boundary
w: T
Height above the refractive boundary
n: T
Ratio of refractive indices
Implementations§
Trait Implementations§
source§impl<T: Clone> Clone for RefractionEq<T>
impl<T: Clone> Clone for RefractionEq<T>
source§fn clone(&self) -> RefractionEq<T>
fn clone(&self) -> RefractionEq<T>
Returns a copy 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 moreAuto Trait Implementations§
impl<T> Freeze for RefractionEq<T>where
T: Freeze,
impl<T> RefUnwindSafe for RefractionEq<T>where
T: RefUnwindSafe,
impl<T> Send for RefractionEq<T>where
T: Send,
impl<T> Sync for RefractionEq<T>where
T: Sync,
impl<T> Unpin for RefractionEq<T>where
T: Unpin,
impl<T> UnwindSafe for RefractionEq<T>where
T: UnwindSafe,
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
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.