/external/sfntly/cpp/src/sfntly/data/ |
growable_memory_byte_array.cc | 38 os->Write(&b_, offset, length); 43 if ((size_t)index >= b_.size()) { 44 b_.resize((size_t)(index + 1)); 46 b_[index] = b; 53 if ((size_t)index + length >= b_.size()) { 56 b_.resize((size_t)(index + length + 1)); 58 std::copy(b + offset, b + offset + length, b_.begin() + index); 63 return b_[index]; 70 memcpy(b + offset, &(b_[0]) + index, length); 75 b_.clear() [all...] |
memory_byte_array.cc | 24 : ByteArray(0, length), b_(NULL), allocated_(true) { 28 : ByteArray(filled_length, filled_length), b_(b), allocated_(false) { 40 os->Write(b_, offset, length); 45 if (allocated_ && b_ == NULL) { 46 b_ = new byte_t[Size()]; 47 memset(b_, 0, Size()); 53 b_[index] = b; 62 memcpy(b_ + index, b + offset, length); 68 return b_[index]; 77 memcpy(b + offset, b_ + index, length) [all...] |
/external/ceres-solver/internal/ceres/ |
normal_prior.cc | 43 : A_(A), b_(b) { 44 CHECK_GT(b_.rows(), 0); 46 CHECK_EQ(b_.rows(), A.cols()); 48 mutable_parameter_block_sizes()->push_back(b_.rows()); 57 // r = A_ * (p - b_); 59 r = A_ * (p - b_).eval();
|
loss_function.cc | 47 if (s > b_) { 51 rho[0] = 2 * a_ * r - b_; 66 rho[0] = 2 * b_ * (tmp - 1); 75 rho[0] = b_ * log(sum); 81 const double sum = 1 + s * s * b_; 86 rho[2] = -2 * s * b_ * (inv * inv); 91 b_(b), 98 const double x = (s - a_) / b_; 110 rho[0] = b_ * log(1.0 + e_x) - c_; 112 rho[2] = 0.5 / (b_ * (1.0 + cosh(x))) [all...] |
iterative_schur_complement_solver_test.cc | 67 b_.reset(problem->b.release()); 90 qr->Solve(&dense_A, b_.get(), per_solve_options, reference_solution.data()); 100 isc.Solve(A_.get(), b_.get(), per_solve_options, isc_sol.data()); 115 scoped_array<double> b_; member in class:ceres::internal::IterativeSchurComplementSolverTest
|
conditioned_cost_function_test.cc | 49 LinearCostFunction(double a, double b) : a_(a), b_(b) { 57 *residuals = **parameters * a_ + b_; 66 const double a_, b_; member in class:ceres::internal::LinearCostFunction
|
/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;
|
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_;
|
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; }
|
bound_test.cpp | 28 static bool char_str_less(const char* a_, const char* b_) 30 return strcmp(a_, b_) < 0 ? 1 : 0;
|
transform_test.cpp | 31 static char map_char(char a_, int b_) { 32 return char(a_ + b_);
|
/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;
|
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_;
|
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-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;
|
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_;
|
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; }
|
/external/ceres-solver/include/ceres/ |
normal_prior.h | 70 Vector b_; member in class:ceres::NormalPrior
|
loss_function.h | 176 explicit HuberLoss(double a) : a_(a), b_(a * a) { } 182 const double b_; member in class:ceres::HuberLoss 192 explicit SoftLOneLoss(double a) : b_(a * a), c_(1 / b_) { } 197 const double b_; member in class:ceres::SoftLOneLoss 209 explicit CauchyLoss(double a) : b_(a * a), c_(1 / b_) { } 214 const double b_; member in class:ceres::CauchyLoss 230 explicit ArctanLoss(double a) : a_(a), b_(1 / (a * a)) { } 236 const double b_; member in class:ceres::ArctanLoss 273 const double a_, b_, c_; member in class:ceres::TolerantLoss [all...] |
/external/chromium_org/skia/ext/ |
recursive_gaussian_convolution.h | 32 const float* b() const { return b_; } 37 float b_[4]; member in class:skia::RecursiveFilter
|
/external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/ |
common_unittest.cc | 174 void SetABMethod(int a, const char* b) { a_ = a; b_ = b; } 177 current_instance_->b_ = b; 183 b_ = NULL; 193 const char* b_; member in class:google::protobuf::__anon15824::ClosureTest 251 EXPECT_NE(cstr, b_); 254 EXPECT_EQ(cstr, b_); 262 EXPECT_NE(cstr, b_); 265 EXPECT_EQ(cstr, b_); 320 EXPECT_NE(cstr, b_); 323 EXPECT_EQ(cstr, b_); [all...] |
/external/protobuf/src/google/protobuf/stubs/ |
common_unittest.cc | 174 void SetABMethod(int a, const char* b) { a_ = a; b_ = b; } 177 current_instance_->b_ = b; 183 b_ = NULL; 188 const char* b_; member in class:google::protobuf::__anon26350::ClosureTest 245 EXPECT_NE(cstr, b_); 248 EXPECT_EQ(cstr, b_); 256 EXPECT_NE(cstr, b_); 259 EXPECT_EQ(cstr, b_); 314 EXPECT_NE(cstr, b_); 317 EXPECT_EQ(cstr, b_); [all...] |