/external/llvm/test/DebugInfo/Inputs/ |
dwarfdump-test-zlib.cc | 2 int a_; member in class:DummyClass 4 DummyClass(int a) : a_(a) {} 6 return a_ + b;
|
dwarfdump-test.cc | 2 int a_; member in class:DummyClass 4 DummyClass(int a) : a_(a) {} 6 return a_ + b;
|
/external/ceres-solver/internal/ceres/ |
autodiff_cost_function_test.cc | 43 explicit BinaryScalarCost(double a): a_(a) {} 47 cost[0] = x[0] * y[0] + x[1] * y[1] - T(a_); 51 double a_; member in class:ceres::internal::BinaryScalarCost
|
gradient_checker_test.cc | 58 a_.resize(arity_); 60 a_[j].resize(dim[j]); 62 a_[j][u] = 2.0 * RandDouble() - 1.0; 79 ax += a_[j][u] * parameters[j][u]; 93 jacobians[j][u] = - f * a_[j][u]; 104 vector<vector<double> > a_; // our vectors. member in class:ceres::internal::GoodTestTerm 111 a_.resize(arity_); 113 a_[j].resize(dim[j]); 115 a_[j][u] = 2.0 * RandDouble() - 1.0; 132 ax += a_[j][u] * parameters[j][u] 157 vector<vector<double> > a_; \/\/ our vectors. member in class:ceres::internal::BadTestTerm [all...] |
conditioned_cost_function_test.cc | 49 LinearCostFunction(double a, double b) : a_(a), b_(b) { 57 *residuals = **parameters * a_ + b_; 59 **jacobians = a_; 66 const double a_, b_; member in class:ceres::internal::LinearCostFunction
|
gradient_checking_cost_function_test.cc | 74 a_.resize(arity_); 76 a_[j].resize(dim[j]); 78 a_[j][u] = 2.0 * RandDouble() - 1.0; 95 ax += a_[j][u] * parameters[j][u]; 109 jacobians[j][u] = - f * a_[j][u]; 129 vector<vector<double> > a_; member in class:ceres::internal::TestTerm
|
/external/chromium_org/tools/gn/ |
header_checker_unittest.cc | 18 : a_(setup_.settings(), Label(SourceDir("//a/"), "a")), 21 a_.deps().push_back(LabelTargetPair(&b_)); 25 a_.visibility().SetPublic(); 29 targets_.push_back(&a_); 41 Target a_; member in class:__anon20363::HeaderCheckerTest 55 EXPECT_FALSE(checker->IsDependencyOf(&a_, &a_, &chain)); 58 EXPECT_TRUE(checker->IsDependencyOf(&b_, &a_, &chain)); 61 EXPECT_EQ(&a_, chain[1]); 64 EXPECT_TRUE(checker->IsDependencyOf(&c_, &a_, &chain)) [all...] |
/external/libnl/lib/ |
data.c | 176 void *a_ = nl_data_get(a); local 179 if (a_ && b_) 180 return memcmp(a_, b_, nl_data_get_size(a));
|
/external/libcxx/test/utilities/memory/unique.ptr/unique.ptr.runtime/unique.ptr.runtime.ctor/ |
default02.pass.cpp | 43 std::unique_ptr<A[], D> a_; member in struct:B 47 A* get() const {return a_.get();} 48 D& get_deleter() {return a_.get_deleter();}
|
pointer02.pass.cpp | 43 std::unique_ptr<A[], D> a_; member in struct:B 47 A* get() const {return a_.get();} 48 D& get_deleter() {return a_.get_deleter();} 92 B<D>::B(A* a) : a_(a) {}
|
/external/libcxx/test/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.ctor/ |
default02.pass.cpp | 43 std::unique_ptr<A, D> a_; member in struct:B 47 A* get() const {return a_.get();} 48 D& get_deleter() {return a_.get_deleter();}
|
pointer02.pass.cpp | 43 std::unique_ptr<A, D> a_; member in struct:B 47 A* get() const {return a_.get();} 48 D& get_deleter() {return a_.get_deleter();} 92 B<D>::B(A* a) : a_(a) {}
|
/external/stressapptest/src/ |
finelock_queue.h | 103 int64 a_; // 'a' multiplicative value for progressing member in class:FineLockPEQueue
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/unique.ptr/unique.ptr.runtime/unique.ptr.runtime.ctor/ |
default02.pass.cpp | 43 std::unique_ptr<A[], D> a_; member in struct:B 47 A* get() const {return a_.get();} 48 D& get_deleter() {return a_.get_deleter();}
|
pointer02.pass.cpp | 43 std::unique_ptr<A[], D> a_; member in struct:B 47 A* get() const {return a_.get();} 48 D& get_deleter() {return a_.get_deleter();} 92 B<D>::B(A* a) : a_(a) {}
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.ctor/ |
default02.pass.cpp | 43 std::unique_ptr<A, D> a_; member in struct:B 47 A* get() const {return a_.get();} 48 D& get_deleter() {return a_.get_deleter();}
|
pointer02.pass.cpp | 43 std::unique_ptr<A, D> a_; member in struct:B 47 A* get() const {return a_.get();} 48 D& get_deleter() {return a_.get_deleter();} 92 B<D>::B(A* a) : a_(a) {}
|
/external/chromium_org/testing/gtest/test/ |
gtest-tuple_test.cc | 264 a_(1, 0, 0, 0, 0, 0, 0, 0, 0, 2), 267 BigTuple a_, b_; member in class:__anon14824::BigTupleTest 278 EXPECT_EQ(1, get<0>(a_)); 279 EXPECT_EQ(2, get<9>(a_)); 282 const BigTuple a(a_); 289 EXPECT_TRUE(a_ == a_); 290 EXPECT_FALSE(a_ != a_); 292 EXPECT_TRUE(a_ != b_) [all...] |
/external/gtest/test/ |
gtest-tuple_test.cc | 264 a_(1, 0, 0, 0, 0, 0, 0, 0, 0, 2), 267 BigTuple a_, b_; member in class:__anon25417::BigTupleTest 278 EXPECT_EQ(1, get<0>(a_)); 279 EXPECT_EQ(2, get<9>(a_)); 282 const BigTuple a(a_); 289 EXPECT_TRUE(a_ == a_); 290 EXPECT_FALSE(a_ != a_); 292 EXPECT_TRUE(a_ != b_) [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
fill_n.pass.cpp | 99 char a_; member in class:A 102 explicit A(char a) : a_(a) {} 106 {return x.a_ == y.a_;}
|
/external/protobuf/gtest/test/ |
gtest-tuple_test.cc | 232 a_(1, 0, 0, 0, 0, 0, 0, 0, 0, 2), 235 BigTuple a_, b_; member in class:__anon32630::BigTupleTest 246 EXPECT_EQ(1, get<0>(a_)); 247 EXPECT_EQ(2, get<9>(a_)); 250 const BigTuple a(a_); 257 EXPECT_TRUE(a_ == a_); 258 EXPECT_FALSE(a_ != a_); 260 EXPECT_TRUE(a_ != b_) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
fill_n.pass.cpp | 99 char a_; member in class:A 102 explicit A(char a) : a_(a) {} 106 {return x.a_ == y.a_;}
|
/ndk/sources/third_party/googletest/googletest/test/ |
gtest-tuple_test.cc | 264 a_(1, 0, 0, 0, 0, 0, 0, 0, 0, 2), 267 BigTuple a_, b_; member in class:__anon43082::BigTupleTest 278 EXPECT_EQ(1, get<0>(a_)); 279 EXPECT_EQ(2, get<9>(a_)); 282 const BigTuple a(a_); 289 EXPECT_TRUE(a_ == a_); 290 EXPECT_FALSE(a_ != a_); 292 EXPECT_TRUE(a_ != b_) [all...] |
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/smart_ptr/detail/ |
sp_counted_impl.hpp | 191 A a_; // copy constructor must not throw member in class:boost::detail::sp_counted_impl_pda 202 sp_counted_impl_pda( P p, D & d, A a ): p_( p ), d_( d ), a_( a ) 206 sp_counted_impl_pda( P p, A a ): p_( p ), d_(), a_( a ) 219 A2 a2( a_ );
|
/external/ceres-solver/include/ceres/ |
loss_function.h | 177 explicit HuberLoss(double a) : a_(a), b_(a * a) { } 181 const double a_; member in class:ceres::HuberLoss 231 explicit ArctanLoss(double a) : a_(a), b_(1 / (a * a)) { } 235 const double a_; member in class:ceres::ArctanLoss 274 const double a_, b_, c_; member in class:ceres::TolerantLoss 315 rho_(rho), a_(a), ownership_(ownership) { } 326 const double a_; member in class:ceres::ScaledLoss
|