Searched refs:x_ (Results 1 - 25 of 53) sorted by relevance

123

/external/chromium/testing/gtest/test/
H A Dproduction.cc36 PrivateCode::PrivateCode() : x_(0) {}
H A Dproduction.h49 int x() const { return x_; }
51 void set_x(int an_x) { x_ = an_x; }
52 int x_; member in class:PrivateCode
H A Dgtest_prod_test.cc41 EXPECT_EQ(0, a.x_);
44 EXPECT_EQ(1, a.x_);
53 EXPECT_EQ(0, a.x_);
56 EXPECT_EQ(2, a.x_);
/external/gtest/test/
H A Dproduction.cc36 PrivateCode::PrivateCode() : x_(0) {}
H A Dproduction.h49 int x() const { return x_; }
51 void set_x(int an_x) { x_ = an_x; }
52 int x_; member in class:PrivateCode
H A Dgtest_prod_test.cc47 EXPECT_EQ(0, a.x_);
50 EXPECT_EQ(1, a.x_);
59 EXPECT_EQ(0, a.x_);
62 EXPECT_EQ(2, a.x_);
/external/libvpx/libvpx/third_party/googletest/src/test/
H A Dproduction.cc36 PrivateCode::PrivateCode() : x_(0) {}
H A Dproduction.h49 int x() const { return x_; }
51 void set_x(int an_x) { x_ = an_x; }
52 int x_; member in class:PrivateCode
H A Dgtest_prod_test.cc41 EXPECT_EQ(0, a.x_);
44 EXPECT_EQ(1, a.x_);
53 EXPECT_EQ(0, a.x_);
56 EXPECT_EQ(2, a.x_);
/external/protobuf/gtest/test/
H A Dproduction.cc36 PrivateCode::PrivateCode() : x_(0) {}
H A Dgtest_prod_test.cc41 EXPECT_EQ(0, a.x_);
44 EXPECT_EQ(1, a.x_);
53 EXPECT_EQ(0, a.x_);
56 EXPECT_EQ(2, a.x_);
H A Dproduction.h49 int x() const { return x_; }
51 void set_x(int x) { x_ = x; }
52 int x_; member in class:PrivateCode
/external/v8/test/mjsunit/
H A Dglobal-accessors.js30 var x_ = 0; variable
32 __defineSetter__('x', function(x) { x_ = x; });
33 __defineGetter__('x', function() { return x_; });
/external/chromium/ui/gfx/
H A Dpoint.h41 int x() const { return x_; }
45 x_ = x;
49 void set_x(int x) { x_ = x; }
53 x_ += delta_x;
59 copy.Offset(other.x_, other.y_);
65 copy.Offset(-other.x_, -other.y_);
70 return Point((x_ + other.x_) / 2, (y_ + other.y_) / 2);
74 return x_ == rhs.x_
101 int x_; member in class:gfx::Point
[all...]
H A Dpoint.cc15 Point::Point() : x_(0), y_(0) {
18 Point::Point(int x, int y) : x_(x), y_(y) {
24 x_ = points.x;
28 Point::Point(const POINT& point) : x_(point.x), y_(point.y) {
32 x_ = point.x;
39 p.x = x_;
44 Point::Point(const CGPoint& point) : x_(point.x), y_(point.y) {
48 return CGPointMake(x_, y_);
53 return base::StringPrintf("%d,%d", x_, y_);
/external/stlport/test/unit/
H A Dunary.h20 double operator()(double x_) const
21 { return ::sqrt(x_); }
H A Dfunc_test.cpp27 static bool bigger_than(int x_, int y_);
39 bool FuncTest::bigger_than(int x_, int y_) argument
41 return x_ > y_;
H A Dptr2_test.cpp35 static int sum(int x_, int y_) argument
37 return x_ + y_;
/external/ceres-solver/internal/ceres/
H A Ddogleg_strategy_test.cc49 Vector x_; member in class:ceres::internal::__anon1583::Fixture
84 x_.resize(6);
85 x_.setZero();
112 x_.resize(6);
113 x_.setZero();
145 x_.data());
148 EXPECT_LE(x_.norm(), options_.initial_radius * (1.0 + 4.0 * kEpsilon));
165 x_.data());
168 EXPECT_LE(x_.norm(), options_.initial_radius * (1.0 + 4.0 * kEpsilon));
185 x_
[all...]
H A Dparameter_block_ordering_test.cc66 problem_.AddParameterBlock(x_, 3);
71 problem_.AddResidualBlock(new DummyCostFunction<2, 3>, NULL, x_);
73 problem_.AddResidualBlock(new DummyCostFunction<3, 3, 5>, NULL, x_, z_);
74 problem_.AddResidualBlock(new DummyCostFunction<7, 5, 3>, NULL, z_, x_);
76 z_, x_, w_);
80 double x_[3], y_[4], z_[5], w_[6]; member in class:ceres::internal::SchurOrderingTest
125 problem_.SetParameterBlockConstant(x_);
136 problem_.SetParameterBlockConstant(x_);
H A Dsystem_test.cc202 x_[0] = 3.0;
203 x_[1] = -1.0;
204 x_[2] = 0.0;
205 x_[3] = 1.0;
208 new AutoDiffCostFunction<F1, 1, 1, 1>(new F1), NULL, &x_[0], &x_[1]);
210 new AutoDiffCostFunction<F2, 1, 1, 1>(new F2), NULL, &x_[2], &x_[3]);
212 new AutoDiffCostFunction<F3, 1, 1, 1>(new F3), NULL, &x_[1], &x_[
269 double x_[4]; member in class:ceres::internal::PowellsFunction
[all...]
/external/compiler-rt/lib/tsan/rtl/
H A Dtsan_rtl.h149 x_ = tid << kTidShift;
150 x_ |= epoch << kClkShift;
157 : x_(x) {
161 return x_;
165 u64 res = (x_ & ~kIgnoreBit) >> kTidShift;
170 u64 res = x_ >> kTidShift;
175 u64 res = (x_ << (kTidBits + 1)) >> (64 - kClkBits);
181 x_ += 1 << kClkShift;
186 void SetIgnoreBit() { x_ |= kIgnoreBit; }
187 void ClearIgnoreBit() { x_
217 u64 x_; member in class:__tsan::FastState
[all...]
/external/clang/test/CodeGenCXX/
H A Dincomplete-types.cpp7 int x_; member in struct:Bar
/external/ceres-solver/docs/
H A Dreference-overview.tex6 \frac{1}{2}\sum_{i=1} \rho_i\left(\left\|f_i\left(x_{i_1},\hdots,x_{i_k}\right)\right\|^2\right).
9 Where $f_i(\cdot)$ is a cost function that depends on the parameter blocks $\left[x_{i_1}, \hdots , x_{i_k}\right]$ and $\rho_i$ is a loss function. In most optimization problems small groups of scalars occur together. For example the three components of a translation vector and the four components of the quaternion that define the pose of a camera. We refer to such a group of small scalars as a Parameter Block. Of course a parameter block can just have a single parameter.
10 The term $ \rho_i\left(\left\|f_i\left(x_{i_1},\hdots,x_{i_k}\right)\right\|^2\right)$ is known as a Residual Block. A Ceres problem is a collection of residual blocks, each of which depends on a subset of the parameter blocks.
/external/compiler-rt/lib/
H A Dint_math.h42 __typeof((x)) x_ = (x); \
43 !crt_isinf(x_) && !crt_isnan(x_); \

Completed in 431 milliseconds

123