forked from M-Labs/nalgebra
527 lines
14 KiB
Rust
527 lines
14 KiB
Rust
#[macro_escape];
|
|
|
|
macro_rules! mat_impl(
|
|
($t: ident, $comp0: ident $(,$compN: ident)*) => (
|
|
impl<N> $t<N> {
|
|
#[inline]
|
|
pub fn new($comp0: N $(, $compN: N )*) -> $t<N> {
|
|
$t {
|
|
$comp0: $comp0
|
|
$(, $compN: $compN )*
|
|
}
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! at_fast_impl(
|
|
($t: ident, $dim: expr) => (
|
|
impl<N: Clone> $t<N> {
|
|
#[inline]
|
|
unsafe fn at_fast(&self, (i, j): (uint, uint)) -> N {
|
|
(*cast::transmute::<&$t<N>, &[N, ..$dim * $dim]>(self)
|
|
.unsafe_ref(i + j * $dim)).clone()
|
|
}
|
|
|
|
#[inline]
|
|
unsafe fn set_fast(&mut self, (i, j): (uint, uint), val: N) {
|
|
(*cast::transmute::<&mut $t<N>, &mut [N, ..$dim * $dim]>(self)
|
|
.unsafe_mut_ref(i + j * $dim)) = val
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! mat_cast_impl(
|
|
($t: ident, $tcast: ident, $comp0: ident $(,$compN: ident)*) => (
|
|
impl<Nin: Clone, Nout: Clone + Cast<Nin>> $tcast<Nout> for $t<Nin> {
|
|
#[inline]
|
|
fn to(v: $t<Nin>) -> $t<Nout> {
|
|
$t::new(Cast::from(v.$comp0.clone()) $(, Cast::from(v.$compN.clone()))*)
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! add_impl(
|
|
($t: ident, $trhs: ident, $comp0: ident $(,$compN: ident)*) => (
|
|
impl<N: Clone + Add<N, N>> $trhs<N, $t<N>> for $t<N> {
|
|
#[inline]
|
|
fn binop(left: &$t<N>, right: &$t<N>) -> $t<N> {
|
|
$t::new(left.$comp0 + right.$comp0 $(, left.$compN + right.$compN)*)
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! sub_impl(
|
|
($t: ident, $trhs: ident, $comp0: ident $(,$compN: ident)*) => (
|
|
impl<N: Clone + Sub<N, N>> $trhs<N, $t<N>> for $t<N> {
|
|
#[inline]
|
|
fn binop(left: &$t<N>, right: &$t<N>) -> $t<N> {
|
|
$t::new(left.$comp0 - right.$comp0 $(, left.$compN - right.$compN)*)
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! scalar_mul_impl(
|
|
($t: ident, $n: ident, $trhs: ident, $comp0: ident $(,$compN: ident)*) => (
|
|
impl $trhs<$n, $t<$n>> for $n {
|
|
#[inline]
|
|
fn binop(left: &$t<$n>, right: &$n) -> $t<$n> {
|
|
$t::new(left.$comp0 * *right $(, left.$compN * *right)*)
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! scalar_div_impl(
|
|
($t: ident, $n: ident, $trhs: ident, $comp0: ident $(,$compN: ident)*) => (
|
|
impl $trhs<$n, $t<$n>> for $n {
|
|
#[inline]
|
|
fn binop(left: &$t<$n>, right: &$n) -> $t<$n> {
|
|
$t::new(left.$comp0 / *right $(, left.$compN / *right)*)
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! scalar_add_impl(
|
|
($t: ident, $n: ident, $trhs: ident, $comp0: ident $(,$compN: ident)*) => (
|
|
impl $trhs<$n, $t<$n>> for $n {
|
|
#[inline]
|
|
fn binop(left: &$t<$n>, right: &$n) -> $t<$n> {
|
|
$t::new(left.$comp0 + *right $(, left.$compN + *right)*)
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! scalar_sub_impl(
|
|
($t: ident, $n: ident, $trhs: ident, $comp0: ident $(,$compN: ident)*) => (
|
|
impl $trhs<$n, $t<$n>> for $n {
|
|
#[inline]
|
|
fn binop(left: &$t<$n>, right: &$n) -> $t<$n> {
|
|
$t::new(left.$comp0 - *right $(, left.$compN - *right)*)
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! absolute_impl(
|
|
($t: ident, $comp0: ident $(,$compN: ident)*) => (
|
|
impl<N: Signed> Absolute<$t<N>> for $t<N> {
|
|
#[inline]
|
|
fn abs(m: &$t<N>) -> $t<N> {
|
|
$t::new(m.$comp0.abs() $(, m.$compN.abs() )*)
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! iterable_impl(
|
|
($t: ident, $dim: expr) => (
|
|
impl<N> Iterable<N> for $t<N> {
|
|
#[inline]
|
|
fn iter<'l>(&'l self) -> VecIterator<'l, N> {
|
|
unsafe {
|
|
cast::transmute::<&'l $t<N>, &'l [N, ..$dim * $dim]>(self).iter()
|
|
}
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! iterable_mut_impl(
|
|
($t: ident, $dim: expr) => (
|
|
impl<N> IterableMut<N> for $t<N> {
|
|
#[inline]
|
|
fn mut_iter<'l>(&'l mut self) -> VecMutIterator<'l, N> {
|
|
unsafe {
|
|
cast::transmute::<&'l mut $t<N>, &'l mut [N, ..$dim * $dim]>(self).mut_iter()
|
|
}
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! one_impl(
|
|
($t: ident, $value0: expr $(, $valueN: expr)* ) => (
|
|
impl<N: Clone + One + Zero> One for $t<N> {
|
|
#[inline]
|
|
fn one() -> $t<N> {
|
|
$t::new($value0() $(, $valueN() )*)
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! dim_impl(
|
|
($t: ident, $dim: expr) => (
|
|
impl<N> Dim for $t<N> {
|
|
#[inline]
|
|
fn dim(_: Option<$t<N>>) -> uint {
|
|
$dim
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! indexable_impl(
|
|
($t: ident, $dim: expr) => (
|
|
impl<N: Clone> Indexable<(uint, uint), N> for $t<N> {
|
|
#[inline]
|
|
fn at(&self, (i, j): (uint, uint)) -> N {
|
|
unsafe {
|
|
cast::transmute::<&$t<N>, &[N, ..$dim * $dim]>(self)[i + j * $dim].clone()
|
|
}
|
|
}
|
|
|
|
#[inline]
|
|
fn set(&mut self, (i, j): (uint, uint), val: N) {
|
|
unsafe {
|
|
cast::transmute::<&mut $t<N>, &mut [N, ..$dim * $dim]>(self)[i + j * $dim] = val
|
|
}
|
|
}
|
|
|
|
#[inline]
|
|
fn swap(&mut self, (i1, j1): (uint, uint), (i2, j2): (uint, uint)) {
|
|
unsafe {
|
|
cast::transmute::<&mut $t<N>, &mut [N, ..$dim * $dim]>(self)
|
|
.swap(i1 + j1 * $dim, i2 + j2 * $dim)
|
|
}
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! row_impl(
|
|
($t: ident, $tv: ident, $dim: expr) => (
|
|
impl<N: Clone + Zero> Row<$tv<N>> for $t<N> {
|
|
#[inline]
|
|
fn nrows(&self) -> uint {
|
|
Dim::dim(None::<$t<N>>)
|
|
}
|
|
|
|
#[inline]
|
|
fn set_row(&mut self, row: uint, v: $tv<N>) {
|
|
for (i, e) in v.iter().enumerate() {
|
|
self.set((row, i), e.clone());
|
|
}
|
|
}
|
|
|
|
#[inline]
|
|
fn row(&self, row: uint) -> $tv<N> {
|
|
let mut res: $tv<N> = Zero::zero();
|
|
|
|
for (i, e) in res.mut_iter().enumerate() {
|
|
*e = self.at((row, i));
|
|
}
|
|
|
|
res
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! col_impl(
|
|
($t: ident, $tv: ident, $dim: expr) => (
|
|
impl<N: Clone + Zero> Col<$tv<N>> for $t<N> {
|
|
#[inline]
|
|
fn ncols(&self) -> uint {
|
|
Dim::dim(None::<$t<N>>)
|
|
}
|
|
|
|
#[inline]
|
|
fn set_col(&mut self, col: uint, v: $tv<N>) {
|
|
for (i, e) in v.iter().enumerate() {
|
|
self.set((i, col), e.clone());
|
|
}
|
|
}
|
|
|
|
#[inline]
|
|
fn col(&self, col: uint) -> $tv<N> {
|
|
let mut res: $tv<N> = Zero::zero();
|
|
|
|
for (i, e) in res.mut_iter().enumerate() {
|
|
*e = self.at((i, col));
|
|
}
|
|
|
|
res
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! mat_mul_mat_impl(
|
|
($t: ident, $trhs: ident, $dim: expr) => (
|
|
impl<N: Clone + Num> $trhs<N, $t<N>> for $t<N> {
|
|
#[inline]
|
|
fn binop(left: &$t<N>, right: &$t<N>) -> $t<N> {
|
|
// careful! we need to comute other * self here (self is the rhs).
|
|
let mut res: $t<N> = Zero::zero();
|
|
|
|
for i in range(0u, $dim) {
|
|
for j in range(0u, $dim) {
|
|
let mut acc: N = Zero::zero();
|
|
|
|
unsafe {
|
|
for k in range(0u, $dim) {
|
|
acc = acc + left.at_fast((i, k)) * right.at_fast((k, j));
|
|
}
|
|
|
|
res.set_fast((i, j), acc);
|
|
}
|
|
}
|
|
}
|
|
|
|
res
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! vec_mul_mat_impl(
|
|
($t: ident, $v: ident, $trhs: ident, $dim: expr) => (
|
|
impl<N: Clone + Num> $trhs<N, $v<N>> for $t<N> {
|
|
#[inline]
|
|
fn binop(left: &$v<N>, right: &$t<N>) -> $v<N> {
|
|
let mut res : $v<N> = Zero::zero();
|
|
|
|
for i in range(0u, $dim) {
|
|
for j in range(0u, $dim) {
|
|
unsafe {
|
|
let val = res.at_fast(i) + left.at_fast(j) * right.at_fast((j, i));
|
|
res.set_fast(i, val)
|
|
}
|
|
}
|
|
}
|
|
|
|
res
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! mat_mul_vec_impl(
|
|
($t: ident, $v: ident, $trhs: ident, $dim: expr) => (
|
|
impl<N: Clone + Num> $trhs<N, $v<N>> for $v<N> {
|
|
#[inline]
|
|
fn binop(left: &$t<N>, right: &$v<N>) -> $v<N> {
|
|
let mut res : $v<N> = Zero::zero();
|
|
|
|
for i in range(0u, $dim) {
|
|
for j in range(0u, $dim) {
|
|
unsafe {
|
|
let val = res.at_fast(i) + left.at_fast((i, j)) * right.at_fast(j);
|
|
res.set_fast(i, val)
|
|
}
|
|
}
|
|
}
|
|
|
|
res
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! inv_impl(
|
|
($t: ident, $dim: expr) => (
|
|
impl<N: Clone + Eq + Num>
|
|
Inv for $t<N> {
|
|
#[inline]
|
|
fn inv_cpy(m: &$t<N>) -> Option<$t<N>> {
|
|
let mut res : $t<N> = m.clone();
|
|
|
|
if res.inv() {
|
|
Some(res)
|
|
}
|
|
else {
|
|
None
|
|
}
|
|
}
|
|
|
|
fn inv(&mut self) -> bool {
|
|
let mut res: $t<N> = One::one();
|
|
let _0N: N = Zero::zero();
|
|
|
|
// inversion using Gauss-Jordan elimination
|
|
for k in range(0u, $dim) {
|
|
// search a non-zero value on the k-th column
|
|
// FIXME: would it be worth it to spend some more time searching for the
|
|
// max instead?
|
|
|
|
let mut n0 = k; // index of a non-zero entry
|
|
|
|
while (n0 != $dim) {
|
|
if self.at((n0, k)) != _0N {
|
|
break;
|
|
}
|
|
|
|
n0 = n0 + 1;
|
|
}
|
|
|
|
if n0 == $dim {
|
|
return false
|
|
}
|
|
|
|
// swap pivot line
|
|
if n0 != k {
|
|
for j in range(0u, $dim) {
|
|
self.swap((n0, j), (k, j));
|
|
res.swap((n0, j), (k, j));
|
|
}
|
|
}
|
|
|
|
let pivot = self.at((k, k));
|
|
|
|
for j in range(k, $dim) {
|
|
let selfval = self.at((k, j)) / pivot;
|
|
self.set((k, j), selfval);
|
|
}
|
|
|
|
for j in range(0u, $dim) {
|
|
let resval = res.at((k, j)) / pivot;
|
|
res.set((k, j), resval);
|
|
}
|
|
|
|
for l in range(0u, $dim) {
|
|
if l != k {
|
|
let normalizer = self.at((l, k));
|
|
|
|
for j in range(k, $dim) {
|
|
let selfval = self.at((l, j)) - self.at((k, j)) * normalizer;
|
|
self.set((l, j), selfval);
|
|
}
|
|
|
|
for j in range(0u, $dim) {
|
|
let resval = res.at((l, j)) - res.at((k, j)) * normalizer;
|
|
res.set((l, j), resval);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
*self = res;
|
|
|
|
true
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! transpose_impl(
|
|
($t: ident, $dim: expr) => (
|
|
impl<N: Clone> Transpose for $t<N> {
|
|
#[inline]
|
|
fn transpose_cpy(m: &$t<N>) -> $t<N> {
|
|
let mut res = m.clone();
|
|
|
|
res.transpose();
|
|
|
|
res
|
|
}
|
|
|
|
#[inline]
|
|
fn transpose(&mut self) {
|
|
for i in range(1u, $dim) {
|
|
for j in range(0u, i) {
|
|
self.swap((i, j), (j, i))
|
|
}
|
|
}
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! approx_eq_impl(
|
|
($t: ident) => (
|
|
impl<N: ApproxEq<N>> ApproxEq<N> for $t<N> {
|
|
#[inline]
|
|
fn approx_epsilon() -> N {
|
|
fail!("approx_epsilon is broken since rust revision 8693943676487c01fa09f5f3daf0df6a1f71e24d.")
|
|
// ApproxEq::<N>::approx_epsilon()
|
|
}
|
|
|
|
#[inline]
|
|
fn approx_eq(&self, other: &$t<N>) -> bool {
|
|
let mut zip = self.iter().zip(other.iter());
|
|
|
|
do zip.all |(a, b)| {
|
|
a.approx_eq(b)
|
|
}
|
|
}
|
|
|
|
#[inline]
|
|
fn approx_eq_eps(&self, other: &$t<N>, epsilon: &N) -> bool {
|
|
let mut zip = self.iter().zip(other.iter());
|
|
|
|
do zip.all |(a, b)| {
|
|
a.approx_eq_eps(b, epsilon)
|
|
}
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! to_homogeneous_impl(
|
|
($t: ident, $t2: ident, $dim: expr, $dim2: expr) => (
|
|
impl<N: One + Zero + Clone> ToHomogeneous<$t2<N>> for $t<N> {
|
|
#[inline]
|
|
fn to_homogeneous(m: &$t<N>) -> $t2<N> {
|
|
let mut res: $t2<N> = One::one();
|
|
|
|
for i in range(0u, $dim) {
|
|
for j in range(0u, $dim) {
|
|
res.set((i, j), m.at((i, j)))
|
|
}
|
|
}
|
|
|
|
res
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! from_homogeneous_impl(
|
|
($t: ident, $t2: ident, $dim: expr, $dim2: expr) => (
|
|
impl<N: One + Zero + Clone> FromHomogeneous<$t2<N>> for $t<N> {
|
|
#[inline]
|
|
fn from(m: &$t2<N>) -> $t<N> {
|
|
let mut res: $t<N> = One::one();
|
|
|
|
for i in range(0u, $dim2) {
|
|
for j in range(0u, $dim2) {
|
|
res.set((i, j), m.at((i, j)))
|
|
}
|
|
}
|
|
|
|
// FIXME: do we have to deal the lost components
|
|
// (like if the 1 is not a 1… do we have to divide?)
|
|
|
|
res
|
|
}
|
|
}
|
|
)
|
|
)
|
|
|
|
macro_rules! outer_impl(
|
|
($t: ident, $m: ident) => (
|
|
impl<N: Mul<N, N> + Zero + Clone> Outer<$m<N>> for $t<N> {
|
|
#[inline]
|
|
fn outer(a: &$t<N>, b: &$t<N>) -> $m<N> {
|
|
let mut res: $m<N> = Zero::zero();
|
|
|
|
for i in range(0u, Dim::dim(None::<$t<N>>)) {
|
|
for j in range(0u, Dim::dim(None::<$t<N>>)) {
|
|
res.set((i, j), a.at(i) * b.at(j))
|
|
}
|
|
}
|
|
|
|
res
|
|
}
|
|
}
|
|
)
|
|
)
|