/external/llvm/test/DebugInfo/Inputs/ |
dwarfdump-test.cc | 2 int a_; member in class:DummyClass 4 DummyClass(int a) : a_(a) {} 6 return a_ + b;
|
/external/protobuf/src/google/protobuf/stubs/ |
common_unittest.cc | 165 void SetA123Method() { a_ = 123; } 166 static void SetA123Function() { current_instance_->a_ = 123; } 168 void SetAMethod(int a) { a_ = a; } 171 static void SetAFunction(int a) { current_instance_->a_ = a; } 174 void SetABMethod(int a, const char* b) { a_ = a; b_ = b; } 176 current_instance_->a_ = a; 182 a_ = 0; 187 int a_; member in class:google::protobuf::__anon12916::ClosureTest 198 EXPECT_NE(123, a_); 200 EXPECT_EQ(123, a_); [all...] |
/external/ceres-solver/internal/ceres/ |
loss_function.cc | 51 rho[0] = 2 * a_ * r - b_; 52 rho[1] = a_ / r; 84 rho[0] = a_ * atan2(s, a_); 90 : a_(a), 98 const double x = (s - a_) / b_; 105 rho[0] = s - a_ - c_; 146 rho[0] = a_ * s; 147 rho[1] = a_; 151 rho[0] *= a_; [all...] |
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...] |
/external/stlport/test/unit/ |
bsearch_test.cpp | 22 static bool str_compare(const char* a_, const char* b_); 46 bool BsearchTest::str_compare(const char* a_, const char* b_) 48 return strcmp(a_, b_) < 0 ? 1 : 0;
|
foreach_test.cpp | 31 static void increase(int& a_) 33 a_ += 1; 52 static void sqr(int& a_) 54 a_ = a_ * a_;
|
innerprod_test.cpp | 27 static size_t add(size_t a_, size_t b_) { 28 return a_ + b_; 31 static size_t mult(size_t a_, size_t b_) { 32 return a_ * b_;
|
transform_test.cpp | 28 static int negate_int(int a_) { 29 return -a_; 31 static char map_char(char a_, int b_) { 32 return char(a_ + b_);
|
find_test.cpp | 29 static bool odd(int a_); 30 static bool div_3(int a_); 107 bool FindTest::odd(int a_) 109 return (a_ % 2) != 0; 112 bool FindTest::div_3(int a_) 114 return a_ % 3 ? 0 : 1;
|
max_test.cpp | 28 static bool str_compare(const char* a_, const char* b_) 29 { return strcmp(a_, b_) < 0 ? 1 : 0; }
|
min_test.cpp | 27 static bool str_compare(const char* a_, const char* b_) 28 { return strcmp(a_, b_) < 0 ? 1 : 0; }
|
/ndk/tests/device/test-gnustl-full/unit/ |
bsearch_test.cpp | 22 static bool str_compare(const char* a_, const char* b_); 46 bool BsearchTest::str_compare(const char* a_, const char* b_) 48 return strcmp(a_, b_) < 0 ? 1 : 0;
|
foreach_test.cpp | 31 static void increase(int& a_) 33 a_ += 1; 52 static void sqr(int& a_) 54 a_ = a_ * a_;
|
innerprod_test.cpp | 27 static size_t add(size_t a_, size_t b_) { 28 return a_ + b_; 31 static size_t mult(size_t a_, size_t b_) { 32 return a_ * b_;
|
transform_test.cpp | 28 static int negate_int(int a_) { 29 return -a_; 31 static char map_char(char a_, int b_) { 32 return char(a_ + b_);
|
find_test.cpp | 29 static bool odd(int a_); 30 static bool div_3(int a_); 107 bool FindTest::odd(int a_) 109 return (a_ % 2) != 0; 112 bool FindTest::div_3(int a_) 114 return a_ % 3 ? 0 : 1;
|
/ndk/tests/device/test-stlport/unit/ |
bsearch_test.cpp | 22 static bool str_compare(const char* a_, const char* b_); 46 bool BsearchTest::str_compare(const char* a_, const char* b_) 48 return strcmp(a_, b_) < 0 ? 1 : 0;
|
foreach_test.cpp | 31 static void increase(int& a_) 33 a_ += 1; 52 static void sqr(int& a_) 54 a_ = a_ * a_;
|
innerprod_test.cpp | 27 static size_t add(size_t a_, size_t b_) { 28 return a_ + b_; 31 static size_t mult(size_t a_, size_t b_) { 32 return a_ * b_;
|
transform_test.cpp | 28 static int negate_int(int a_) { 29 return -a_; 31 static char map_char(char a_, int b_) { 32 return char(a_ + b_);
|
find_test.cpp | 29 static bool odd(int a_); 30 static bool div_3(int a_); 107 bool FindTest::odd(int a_) 109 return (a_ % 2) != 0; 112 bool FindTest::div_3(int a_) 114 return a_ % 3 ? 0 : 1;
|
/ndk/sources/cxx-stl/llvm-libc++/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) {}
|
/ndk/sources/cxx-stl/llvm-libc++/test/utilities/memory/unique.ptr/unique.ptr.runtime/unique.ptr.runtime.ctor/ |
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/ceres-solver/include/ceres/ |
loss_function.h | 176 explicit HuberLoss(double a) : a_(a), b_(a * a) { } 180 const double a_; member in class:ceres::HuberLoss 230 explicit ArctanLoss(double a) : a_(a), b_(1 / (a * a)) { } 234 const double a_; member in class:ceres::ArctanLoss 273 const double a_, b_, c_; member in class:ceres::TolerantLoss 314 rho_(rho), a_(a), ownership_(ownership) { } 325 const double a_; member in class:ceres::ScaledLoss
|