2013-06-29 08:34:45 +08:00
|
|
|
use std::num::{Zero, One};
|
2013-08-26 05:01:44 +08:00
|
|
|
use vec::Vec3;
|
2013-08-31 17:41:32 +08:00
|
|
|
use mat::{Mat1, Mat2, Mat3, Inv, Row};
|
2013-09-05 05:29:58 +08:00
|
|
|
use mat;
|
2013-06-29 08:34:45 +08:00
|
|
|
|
|
|
|
// some specializations:
|
Rework of the traits for Vectors.
The goal is to make traits less fine-grained for vectors, and reduce the amount of `use`.
- Scalar{Mul, Div} are removed, replaced by Mul<N, V> and Div<N, V>,
- Ring and DivisionRing are removed. Use Num instead.
- VectorSpace, Dot, and Norm are removed, replaced by the new, higher-level traits.
Add four traits:
- Vec: common operations on vectors. Replaces VectorSpace and Dot.
- AlgebraicVec: Vec + the old Norm trait.
- VecExt: Vec + every other traits vectors implement.
- AlgebraicVecExt: AlgebraicVec + VecExt.
2013-08-19 00:33:25 +08:00
|
|
|
impl<N: Num + Clone>
|
2013-08-05 16:13:44 +08:00
|
|
|
Inv for Mat1<N> {
|
2013-08-05 16:15:11 +08:00
|
|
|
#[inline]
|
|
|
|
fn inverse(&self) -> Option<Mat1<N>> {
|
|
|
|
let mut res : Mat1<N> = self.clone();
|
|
|
|
|
|
|
|
if res.inplace_inverse() {
|
|
|
|
Some(res)
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
None
|
|
|
|
}
|
2013-08-05 16:13:44 +08:00
|
|
|
}
|
2013-06-29 08:34:45 +08:00
|
|
|
|
2013-08-05 16:15:11 +08:00
|
|
|
#[inline]
|
|
|
|
fn inplace_inverse(&mut self) -> bool {
|
|
|
|
if self.m11.is_zero() {
|
|
|
|
false
|
|
|
|
}
|
|
|
|
else {
|
2013-08-28 20:22:12 +08:00
|
|
|
let _1: N = One::one();
|
|
|
|
self.m11 = _1 / self.m11;
|
2013-08-05 16:15:11 +08:00
|
|
|
true
|
|
|
|
}
|
2013-07-04 22:23:08 +08:00
|
|
|
}
|
2013-06-29 08:34:45 +08:00
|
|
|
}
|
|
|
|
|
Rework of the traits for Vectors.
The goal is to make traits less fine-grained for vectors, and reduce the amount of `use`.
- Scalar{Mul, Div} are removed, replaced by Mul<N, V> and Div<N, V>,
- Ring and DivisionRing are removed. Use Num instead.
- VectorSpace, Dot, and Norm are removed, replaced by the new, higher-level traits.
Add four traits:
- Vec: common operations on vectors. Replaces VectorSpace and Dot.
- AlgebraicVec: Vec + the old Norm trait.
- VecExt: Vec + every other traits vectors implement.
- AlgebraicVecExt: AlgebraicVec + VecExt.
2013-08-19 00:33:25 +08:00
|
|
|
impl<N: Num + Clone>
|
2013-08-05 16:13:44 +08:00
|
|
|
Inv for Mat2<N> {
|
2013-08-05 16:15:11 +08:00
|
|
|
#[inline]
|
|
|
|
fn inverse(&self) -> Option<Mat2<N>> {
|
|
|
|
let mut res : Mat2<N> = self.clone();
|
|
|
|
|
|
|
|
if res.inplace_inverse() {
|
|
|
|
Some(res)
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
None
|
|
|
|
}
|
2013-08-05 16:13:44 +08:00
|
|
|
}
|
2013-06-29 08:34:45 +08:00
|
|
|
|
2013-08-05 16:15:11 +08:00
|
|
|
#[inline]
|
|
|
|
fn inplace_inverse(&mut self) -> bool {
|
|
|
|
let det = self.m11 * self.m22 - self.m21 * self.m12;
|
2013-06-29 08:34:45 +08:00
|
|
|
|
2013-08-05 16:15:11 +08:00
|
|
|
if det.is_zero() {
|
|
|
|
false
|
|
|
|
}
|
|
|
|
else {
|
2013-08-17 23:50:01 +08:00
|
|
|
*self = Mat2::new(
|
|
|
|
self.m22 / det , -self.m12 / det,
|
|
|
|
-self.m21 / det, self.m11 / det);
|
2013-06-29 08:34:45 +08:00
|
|
|
|
2013-08-05 16:15:11 +08:00
|
|
|
true
|
|
|
|
}
|
2013-07-04 22:23:08 +08:00
|
|
|
}
|
2013-06-29 08:34:45 +08:00
|
|
|
}
|
|
|
|
|
Rework of the traits for Vectors.
The goal is to make traits less fine-grained for vectors, and reduce the amount of `use`.
- Scalar{Mul, Div} are removed, replaced by Mul<N, V> and Div<N, V>,
- Ring and DivisionRing are removed. Use Num instead.
- VectorSpace, Dot, and Norm are removed, replaced by the new, higher-level traits.
Add four traits:
- Vec: common operations on vectors. Replaces VectorSpace and Dot.
- AlgebraicVec: Vec + the old Norm trait.
- VecExt: Vec + every other traits vectors implement.
- AlgebraicVecExt: AlgebraicVec + VecExt.
2013-08-19 00:33:25 +08:00
|
|
|
impl<N: Num + Clone>
|
2013-08-05 16:13:44 +08:00
|
|
|
Inv for Mat3<N> {
|
2013-08-05 16:15:11 +08:00
|
|
|
#[inline]
|
|
|
|
fn inverse(&self) -> Option<Mat3<N>> {
|
|
|
|
let mut res = self.clone();
|
|
|
|
|
|
|
|
if res.inplace_inverse() {
|
|
|
|
Some(res)
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
None
|
|
|
|
}
|
2013-08-05 16:13:44 +08:00
|
|
|
}
|
2013-06-29 08:34:45 +08:00
|
|
|
|
2013-08-05 16:15:11 +08:00
|
|
|
#[inline]
|
|
|
|
fn inplace_inverse(&mut self) -> bool {
|
|
|
|
let minor_m12_m23 = self.m22 * self.m33 - self.m32 * self.m23;
|
|
|
|
let minor_m11_m23 = self.m21 * self.m33 - self.m31 * self.m23;
|
|
|
|
let minor_m11_m22 = self.m21 * self.m32 - self.m31 * self.m22;
|
|
|
|
|
|
|
|
let det = self.m11 * minor_m12_m23
|
|
|
|
- self.m12 * minor_m11_m23
|
|
|
|
+ self.m13 * minor_m11_m22;
|
|
|
|
|
|
|
|
if det.is_zero() {
|
|
|
|
false
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
*self = Mat3::new(
|
2013-08-08 02:53:51 +08:00
|
|
|
(minor_m12_m23 / det),
|
2013-08-05 16:15:11 +08:00
|
|
|
((self.m13 * self.m32 - self.m33 * self.m12) / det),
|
|
|
|
((self.m12 * self.m23 - self.m22 * self.m13) / det),
|
|
|
|
|
|
|
|
(-minor_m11_m23 / det),
|
|
|
|
((self.m11 * self.m33 - self.m31 * self.m13) / det),
|
|
|
|
((self.m13 * self.m21 - self.m23 * self.m11) / det),
|
|
|
|
|
|
|
|
(minor_m11_m22 / det),
|
|
|
|
((self.m12 * self.m31 - self.m32 * self.m11) / det),
|
|
|
|
((self.m11 * self.m22 - self.m21 * self.m12) / det)
|
|
|
|
);
|
|
|
|
|
|
|
|
true
|
|
|
|
}
|
2013-07-04 22:23:08 +08:00
|
|
|
}
|
2013-06-29 08:34:45 +08:00
|
|
|
}
|
2013-08-26 05:01:44 +08:00
|
|
|
|
|
|
|
impl<N: Clone> Row<Vec3<N>> for Mat3<N> {
|
|
|
|
#[inline]
|
|
|
|
fn row(&self, i: uint) -> Vec3<N> {
|
|
|
|
match i {
|
|
|
|
0 => Vec3::new(self.m11.clone(), self.m12.clone(), self.m13.clone()),
|
|
|
|
1 => Vec3::new(self.m21.clone(), self.m22.clone(), self.m23.clone()),
|
|
|
|
2 => Vec3::new(self.m31.clone(), self.m32.clone(), self.m33.clone()),
|
|
|
|
_ => fail!("Index out of range: 3d matrices do not have " + i.to_str() + " rows.")
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
fn set_row(&mut self, i: uint, r: Vec3<N>) {
|
|
|
|
match i {
|
|
|
|
0 => {
|
|
|
|
self.m11 = r.x.clone();
|
|
|
|
self.m12 = r.y.clone();
|
|
|
|
self.m13 = r.z;
|
|
|
|
},
|
|
|
|
1 => {
|
|
|
|
self.m21 = r.x.clone();
|
|
|
|
self.m22 = r.y.clone();
|
|
|
|
self.m23 = r.z;
|
|
|
|
},
|
|
|
|
2 => {
|
|
|
|
self.m31 = r.x.clone();
|
|
|
|
self.m32 = r.y.clone();
|
|
|
|
self.m33 = r.z;
|
|
|
|
},
|
|
|
|
_ => fail!("Index out of range: 3d matrices do not have " + i.to_str() + " rows.")
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-09-05 05:29:58 +08:00
|
|
|
|
|
|
|
// FIXME: move this to another file?
|
|
|
|
impl<N: Real + NumCast + Zero + One> mat::Mat4<N> {
|
|
|
|
/// Computes a projection matrix given the frustrum near plane width, height, the field of
|
|
|
|
/// view, and the distance to the clipping planes (`znear` and `zfar`).
|
2013-09-05 19:45:11 +08:00
|
|
|
pub fn new_perspective(width: N, height: N, fov: N, znear: N, zfar: N) -> mat::Mat4<N> {
|
2013-09-05 05:29:58 +08:00
|
|
|
let aspect = width / height;
|
|
|
|
|
|
|
|
let _1: N = One::one();
|
|
|
|
let sy = _1 / (fov * NumCast::from(0.5)).tan();
|
|
|
|
let sx = -sy / aspect;
|
|
|
|
let sz = -(zfar + znear) / (znear - zfar);
|
|
|
|
let tz = zfar * znear * NumCast::from(2.0) / (znear - zfar);
|
|
|
|
|
|
|
|
mat::Mat4::new(
|
|
|
|
sx, Zero::zero(), Zero::zero(), Zero::zero(),
|
|
|
|
Zero::zero(), sy, Zero::zero(), Zero::zero(),
|
|
|
|
Zero::zero(), Zero::zero(), sz, tz,
|
|
|
|
Zero::zero(), Zero::zero(), One::one(), Zero::zero()
|
|
|
|
)
|
|
|
|
}
|
|
|
|
}
|