Searched refs:Vector2d (Results 1 – 21 of 21) sorted by relevance
| /external/eigen/unsupported/doc/examples/ |
| D | BVH_Example.cpp | 10 …Box2d bounding_box(const Vector2d &v) { return Box2d(v, v); } //compute the bounding box of a sing… in bounding_box()
20 …double minimumOnVolumeObject(const Box2d &r, const Vector2d &v) { ++calls; return r.squaredExterio… in minimumOnVolumeObject()
21 …double minimumOnObjectVolume(const Vector2d &v, const Box2d &r) { ++calls; return r.squaredExterio… in minimumOnObjectVolume()
22 …double minimumOnObjectObject(const Vector2d &v1, const Vector2d &v2) { ++calls; return (v1 - v2).s… in minimumOnObjectObject()
29 typedef std::vector<Vector2d, aligned_allocator<Vector2d> > StdVectorOfVector2d; in main()
32 redPoints.push_back(Vector2d::Random()); in main()
33 bluePoints.push_back(Vector2d::Random()); in main()
47 …KdBVH<double, 2, Vector2d> redTree(redPoints.begin(), redPoints.end()), blueTree(bluePoints.begin(… in main()
|
| /external/ceres-solver/internal/ceres/ |
| D | dogleg_strategy.h | 79 typedef Eigen::Matrix<double, 2, 1, Eigen::DontAlign> Vector2d; typedef
92 bool FindMinimumOnTrustRegionBoundary(Vector2d* minimum) const;
94 Vector2d ComputeSubspaceStepFromRoot(double lambda) const;
95 double EvaluateSubspaceModel(const Vector2d& x) const;
158 Vector2d subspace_g_;
|
| D | dogleg_strategy.cc | 318 Vector2d minimum(0.0, 0.0); in ComputeSubspaceDoglegStep()
344 const Vector2d grad_minimum = subspace_B_ * minimum + subspace_g_; in ComputeSubspaceDoglegStep()
445 DoglegStrategy::Vector2d DoglegStrategy::ComputeSubspaceStepFromRoot( in ComputeSubspaceStepFromRoot()
453 double DoglegStrategy::EvaluateSubspaceModel(const Vector2d& x) const { in EvaluateSubspaceModel()
470 bool DoglegStrategy::FindMinimumOnTrustRegionBoundary(Vector2d* minimum) const { in FindMinimumOnTrustRegionBoundary()
495 const Vector2d x_i = ComputeSubspaceStepFromRoot(roots_real(i)); in FindMinimumOnTrustRegionBoundary()
|
| /external/eigen/bench/ |
| D | BenchTimer.h | 153 Vector2d m_starts;
154 Vector2d m_times;
155 Vector2d m_bests;
156 Vector2d m_worsts;
157 Vector2d m_totals;
|
| /external/eigen/test/ |
| D | unalignedassert.cpp | 32 Vector2d m;
52 Vector2d m;
90 construct_at_boundary<Vector2d>(16); in unalignedassert()
115 VERIFY_RAISES_ASSERT(construct_at_boundary<Vector2d>(8)); in unalignedassert()
|
| D | zerosized.cpp | 79 zeroSizedVector<Vector2d>(); in test_zerosized()
|
| D | dynalloc.cpp | 101 CALL_SUBTEST(check_dynaligned<Vector2d>() ); in test_dynalloc()
|
| /external/eigen/doc/ |
| D | StructHavingEigenMembers.dox | 19 Eigen::Vector2d v;
38 Eigen::Vector2d v;
61 Eigen::Vector2d v;
70 A Eigen::Vector2d consists of 2 doubles, which is 128 bits. Which is exactly the size of a SSE pack…
72 For this reason, Eigen takes care by itself to require 128-bit alignment for Eigen::Vector2d, by do…
73 \li Eigen requires 128-bit alignment for the Eigen::Vector2d's array (of 2 doubles). With GCC, this…
74 \li Eigen overloads the "operator new" of Eigen::Vector2d so it will always return 128-bit aligned …
92 Eigen::Vector2d v;
151 Eigen::Vector2d av(v);
167 Vector2d v;
|
| D | PassingByValue.dox | 12 void my_function(Eigen::Vector2d v);
18 void my_function(const Eigen::Vector2d& v);
26 Eigen::Vector2d v;
|
| D | StlContainers.dox | 46 the specialization needs to be defined before all code pieces in which e.g. std::vector<Vector2d> i…
54 std::vector<Eigen::Vector2d>
|
| D | UnalignedArrayAssert.dox | 38 Eigen::Vector2d v;
47 Note that here, Eigen::Vector2d is only used as an example, more generally the issue arises for all…
|
| D | FixedSizeVectorizable.dox | 12 \li Eigen::Vector2d
|
| D | TutorialMatrixClass.dox | 106 Vector2d a(5.0, 6.0);
|
| /external/eigen/test/eigen2/ |
| D | eigen2_unalignedassert.cpp | 30 Vector2d m; // bad: sizeof(m)%16==0 so alignment is required
46 Vector2d m;
66 Vector2d m;
|
| D | eigen2_dynalloc.cpp | 100 CALL_SUBTEST( check_dynaligned<Vector2d>() ); in test_eigen2_dynalloc()
|
| /external/eigen/unsupported/test/ |
| D | openglsupport.cpp | 183 Vector2d vd2; vd2.setRandom(); Vector3d vd23; vd23 << vd2, 0; in test_openglsupport()
202 Vector2d vd2; vd2.setRandom(); Vector3d vd23; vd23 << vd2, 1; in test_openglsupport()
321 typedef Vector2d Vector2d; in test_openglsupport() typedef
325 VERIFY_UNIFORM(dv,v2d, Vector2d); in test_openglsupport()
|
| D | splines.cpp | 196 Vector2d pt = spline(u(i)); in eval_closed_spline2d()
|
| /external/ceres-solver/examples/ |
| D | ellipse_approximation.cc | 275 const Eigen::Vector2d y) in PointToLineSegmentContourCostFunction()
326 const Eigen::Vector2d y) { in Create()
336 const Eigen::Vector2d y_;
|
| /external/eigen/doc/examples/ |
| D | tut_arithmetic_matrix_mul.cpp | 10 Vector2d u(-1,1), v(2,0); in main()
|
| /external/eigen/demos/mandelbrot/ |
| D | mandelbrot.h | 39 Eigen::Vector2d center;
|
| D | mandelbrot.cpp | 179 center = Eigen::Vector2d(center.x() + (event->pos().x() - width()/2) * xradius * 2 / width(), in mousePressEvent()
|