| /external/chromium_org/third_party/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/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.0 * a_ * r - b_;
66 rho[0] = 2.0 * b_ * (tmp - 1.0);
75 rho[0] = b_ * log(sum);
81 const double sum = 1 + s * s * b_;
86 rho[2] = -2.0 * 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
|
| /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; }
|
| /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 | 71 Vector b_; member in class:ceres::NormalPrior
|
| loss_function.h | 177 explicit HuberLoss(double a) : a_(a), b_(a * a) { }
183 const double b_; member in class:ceres::HuberLoss
193 explicit SoftLOneLoss(double a) : b_(a * a), c_(1 / b_) { }
198 const double b_; member in class:ceres::SoftLOneLoss
210 explicit CauchyLoss(double a) : b_(a * a), c_(1 / b_) { }
215 const double b_; member in class:ceres::CauchyLoss
231 explicit ArctanLoss(double a) : a_(a), b_(1 / (a * a)) { }
237 const double b_; member in class:ceres::ArctanLoss
274 const double a_, b_, c_; member in class:ceres::TolerantLoss
[all...] |
| /external/chromium_org/tools/gn/ |
| header_checker_unittest.cc | 20 b_(setup_.settings(), Label(SourceDir("//b/"), "b")),
24 b_.set_output_type(Target::SOURCE_SET);
30 b_.SetToolchain(setup_.toolchain(), &err);
34 a_.public_deps().push_back(LabelTargetPair(&b_));
35 b_.public_deps().push_back(LabelTargetPair(&c_));
39 b_.visibility().SetPublic();
45 b_.OnResolved(&err);
49 targets_.push_back(&b_);
62 Target b_; member in class:__anon166::HeaderCheckerTest
96 EXPECT_TRUE(checker->IsDependencyOf(&b_, &a_, &chain, &is_permitted))
[all...] |
| /external/clang/test/Analysis/ |
| temp-obj-dtors-cfg-output.cpp | 55 C():b_(true) {}
58 operator bool() { return b_; }
59 bool b_; member in struct:C
63 D():b_(true) {}
65 operator bool() { return b_; }
66 bool b_; member in struct:D
536 // CHECK: C() : b_(true)
541 // CHECK: 2: b_([B1.1]) (Member initializer)
556 // CHECK: 2: [B1.1]->b_
563 // CHECK: D() : b_(true
[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::__anon19479::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...] |
