Searched defs:vec3 (Results 1 - 12 of 12) sorted by relevance

/external/chromium-trace/trace-viewer/third_party/gl-matrix/src/gl-matrix/
H A Dvec3.js25 * @name vec3
27 var vec3 = {};
30 * Creates a new, empty vec3
32 * @returns {vec3} a new 3D vector
34 vec3.create = function() {
43 * Creates a new vec3 initialized with values from an existing vector
45 * @param {vec3} a vector to clone
46 * @returns {vec3} a new 3D vector
48 vec3.clone = function(a) {
57 * Creates a new vec3 initialize
[all...]
/external/chromium-trace/trace-viewer/third_party/gl-matrix/dist/
H A Dgl-matrix.js435 * @param {vec3} out the receiving vector
438 * @returns {vec3} out
610 * @name vec3
613 var vec3 = {};
616 * Creates a new, empty vec3
618 * @returns {vec3} a new 3D vector
620 vec3.create = function() {
629 * Creates a new vec3 initialized with values from an existing vector
631 * @param {vec3} a vector to clone
632 * @returns {vec3}
[all...]
/external/clang/test/Sema/
H A Dext_vector_components.c12 float3 vec3; local
25 vec3 = vec4.xyz; // legal, shorten
H A Dext_vector_casts.c15 float3 vec3; local
23 vec3 += vec2; // expected-error {{can't convert between vector values of different size}}
24 vec4 += vec3; // expected-error {{can't convert between vector values of different size}}
/external/eigen/test/eigen2/
H A Deigen2_sparse_solvers.cpp47 DenseVector vec2 = vec1, vec3 = vec1; local
54 m2.template marked<LowerTriangular>().solveTriangular(vec3));
59 m2.template marked<LowerTriangular>().transpose().solveTriangular(vec3));
64 m2.template marked<UpperTriangular>().solveTriangular(vec3));
69 m2.template marked<UpperTriangular>().transpose().solveTriangular(vec3));
H A Deigen2_geometry.cpp414 Vector3 vec3 = Vector3::Random(); local
417 mcross = mat3.colwise().cross(vec3);
418 VERIFY_IS_APPROX(mcross.col(i), mat3.col(i).cross(vec3));
419 mcross = mat3.rowwise().cross(vec3);
420 VERIFY_IS_APPROX(mcross.row(i), mat3.row(i).cross(vec3));
H A Deigen2_geometry_with_eigen2_prefix.cpp416 Vector3 vec3 = Vector3::Random(); local
419 mcross = mat3.colwise().cross(vec3);
420 VERIFY_IS_APPROX(mcross.col(i), mat3.col(i).cross(vec3));
421 mcross = mat3.rowwise().cross(vec3);
422 VERIFY_IS_APPROX(mcross.row(i), mat3.row(i).cross(vec3));
/external/eigen/test/
H A Dsparse_solvers.cpp47 DenseVector vec2 = vec1, vec3 = vec1; local
54 m2.template triangularView<Lower>().solve(vec3));
59 m2.template triangularView<Upper>().solve(vec3));
61 m2.conjugate().template triangularView<Upper>().solve(vec3));
67 mm2.conjugate().template triangularView<Upper>().solve(vec3));
73 m2.transpose().template triangularView<Upper>().solve(vec3));
78 m2.transpose().template triangularView<Lower>().solve(vec3));
100 m2.template triangularView<Lower>().solve(vec3));
H A Dgeo_orthomethods.cpp45 Vector3 vec3 = Vector3::Random(); local
48 mcross = mat3.colwise().cross(vec3);
49 VERIFY_IS_APPROX(mcross.col(i), mat3.col(i).cross(vec3));
50 mcross = mat3.rowwise().cross(vec3);
51 VERIFY_IS_APPROX(mcross.row(i), mat3.row(i).cross(vec3));
92 Vector3 vec3 = Vector3::Random(); local
97 mcross3N = mat3N.colwise().cross(vec3);
98 VERIFY_IS_APPROX(mcross3N.col(i), mat3N.col(i).cross(vec3));
102 mcrossN3 = matN3.rowwise().cross(vec3);
103 VERIFY_IS_APPROX(mcrossN3.row(i), matN3.row(i).cross(vec3));
[all...]
/external/clang/test/CodeGen/
H A Dinit.c34 typedef union vec3 { union
37 } vec3; typedef in typeref:union:vec3
38 vec3 f5(vec3 value) {
39 return (vec3) {{
/external/chromium_org/third_party/skia/tests/
H A DMatrix44Test.cpp507 SkScalar vec3[3] = { 2, 4, 8 }; local
513 a33.mapHomogeneousPoints(vec3transformed, vec3, 1);
/external/skia/tests/
H A DMatrix44Test.cpp507 SkScalar vec3[3] = { 2, 4, 8 }; local
513 a33.mapHomogeneousPoints(vec3transformed, vec3, 1);

Completed in 1075 milliseconds