1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
// Copyright 2008-2024 Emil Dotchevski and Reverge Studios, Inc.
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifdef BOOST_QVM_TEST_SINGLE_HEADER
# include BOOST_QVM_TEST_SINGLE_HEADER
#else
# include <boost/qvm/vec_operations.hpp>
# include <boost/qvm/vec_access.hpp>
# include <boost/qvm/mat_access.hpp>
# include <boost/qvm/vec_operations3.hpp>
# include <boost/qvm/vec.hpp>
#endif
#include "test_qvm_vector.hpp"
#include "test_qvm_matrix.hpp"
#include "gold.hpp"
namespace
{
template <class T,class U> struct same_type_tester;
template <class T> struct same_type_tester<T,T> { };
template <class T,class U> void test_same_type( T, U ) { same_type_tester<T,U>(); }
}
int
main()
{
using namespace boost::qvm;
{
test_qvm::vector<V1,3> x(42,1);
test_qvm::vector<V1,3> y=x*2;
test_qvm::matrix<M1,3,3> m;
A00(m) = 0;
A01(m) = -A2(x);
A02(m) = A1(x);
A10(m) = A2(x);
A11(m) = 0;
A12(m) = -A0(x);
A20(m) = -A1(x);
A21(m) = A0(x);
A22(m) = 0;
{
test_same_type(x,cross(x,y));
test_qvm::vector<V1,3> c=cross(x,y);
test_qvm::multiply_mv(c.b,m.a,y.a);
BOOST_QVM_TEST_EQ(c.a,c.b);
}
{
test_qvm::vector<V2,3> c=cross(vref(x),y);
test_qvm::multiply_mv(c.b,m.a,y.a);
BOOST_QVM_TEST_EQ(c.a,c.b);
}
{
test_qvm::vector<V2,3> c=cross(x,vref(y));
test_qvm::multiply_mv(c.b,m.a,y.a);
BOOST_QVM_TEST_EQ(c.a,c.b);
}
}
{
test_qvm::vector<V1,2> x(42,1);
test_qvm::vector<V1,2,int> y(43,1);
float r = cross(x,y);
BOOST_QVM_TEST_EQ(r, x.a[0]*y.a[1] - x.a[1]*y.a[0]);
}
return boost::report_errors();
}
|
