HomeSort by relevance Sort by last modified time
    Searched defs:left_ (Results 1 - 14 of 14) sorted by null

  /external/libchrome/ui/gfx/geometry/
insets.h 26 constexpr Insets() : top_(0), left_(0), bottom_(0), right_(0) {}
28 : top_(all), left_(all), bottom_(all), right_(all) {}
31 left_(horizontal),
35 : top_(top), left_(left), bottom_(bottom), right_(right) {}
38 constexpr int left() const { return left_; }
44 constexpr int width() const { return left_ + right_; }
55 left_ = left;
61 return top_ == insets.top_ && left_ == insets.left_ &&
71 left_ += insets.left_
113 int left_; member in class:gfx::Insets
    [all...]
insets_f.h 17 constexpr InsetsF() : top_(0.f), left_(0.f), bottom_(0.f), right_(0.f) {}
19 : top_(all), left_(all), bottom_(all), right_(all) {}
22 left_(horizontal),
26 : top_(top), left_(left), bottom_(bottom), right_(right) {}
29 constexpr float left() const { return left_; }
35 constexpr float width() const { return left_ + right_; }
46 left_ = left;
52 return top_ == insets.top_ && left_ == insets.left_ &&
62 left_ += insets.left_
88 float left_; member in class:gfx::InsetsF
    [all...]
  /external/googletest/googlemock/src/
gmock-matchers.cc 70 // a vector<int> called 'left_' whose elements are initialized to the
74 // - An edge from source to each left_ node
76 // - An edge from each left_ node to each right_ node, if the
79 // When the TryAugment() method adds a flow, it sets left_[l] = r for some
88 // When the method augments a flow (moving left_[l] from some r1 to some
94 // information in 'graph' and in left_.
126 left_(graph_->LhsSize(), kUnused),
147 // source to sink starting at the left_[ilhs] node.
148 GTEST_CHECK_(left_[ilhs] == kUnused)
149 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs] local
220 ::std::vector<size_t> left_; member in class:testing::internal::MaxBipartiteMatchState
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/utils/unittest/googlemock/src/
gmock-matchers.cc 146 // a vector<int> called 'left_' whose elements are initialized to the
150 // - An edge from source to each left_ node
152 // - An edge from each left_ node to each right_ node, if the
155 // When the TryAugment() method adds a flow, it sets left_[l] = r for some
164 // When the method augments a flow (moving left_[l] from some r1 to some
170 // information in 'graph' and in left_.
202 left_(graph_->LhsSize(), kUnused),
224 // source to sink starting at the left_[ilhs] node.
225 GTEST_CHECK_(left_[ilhs] == kUnused)
226 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs] local
299 ::std::vector<size_t> left_; member in class:testing::internal::MaxBipartiteMatchState
    [all...]
  /external/v8/src/
splay-tree.h 101 : key_(key), value_(value), left_(nullptr), right_(nullptr) {}
117 Node* left() { return left_; }
125 Node* left_; member in class:v8::internal::SplayTree::Node
  /external/webrtc/webrtc/modules/desktop_capture/
desktop_geometry.h 99 DesktopRect() : left_(0), top_(0), right_(0), bottom_(0) {}
101 int32_t left() const { return left_; }
105 int32_t width() const { return right_ - left_; }
108 DesktopVector top_left() const { return DesktopVector(left_, top_); }
111 bool is_empty() const { return left_ >= right_ || top_ >= bottom_; }
114 return left_ == other.left_ && top_ == other.top_ &&
133 : left_(left), top_(top), right_(right), bottom_(bottom) {
136 int32_t left_; member in class:webrtc::DesktopRect
  /external/tensorflow/tensorflow/examples/android/jni/object_tracking/
geom.h 89 : left_(0),
95 : left_(bounding_box.left_),
99 SCHECK(left_ < right_, "Bounds out of whack! %.2f vs %.2f!", left_, right_);
107 : left_(left),
111 SCHECK(left_ < right_, "Bounds out of whack! %.2f vs %.2f!", left_, right_);
116 : left_(MIN(point1.x, point2.x)),
122 bounds_array[0] = left_;
244 float left_; member in class:tf_tracking::BoundingBox
    [all...]
  /external/v8/src/compiler/
js-type-hint-lowering.cc 56 left_(left),
147 std::swap(left_, right_); // a > b => b < a
152 std::swap(left_, right_); // a >= b => b <= a
168 return graph()->NewNode(op, left_, right_, effect_, control_);
204 Node* left_; member in class:v8::internal::compiler::final
node-matchers.h 239 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) {
243 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) {
250 const Left& left() const { return left_; }
258 std::swap(left_, right_);
273 Left left_; member in struct:v8::internal::compiler::BinopMatcher
  /external/libaom/libaom/test/
dr_prediction_test.cc 166 left_ = &left_data_[kOffset];
190 params_.ref_fn(dst_ref_, dst_stride_, bw_, bh_, above_, left_,
200 above_, left_, upsample_above_,
284 Pixel *left_; member in class:__anon26734::DrPredTest
  /external/v8/src/compiler/arm/
code-generator-arm.cc 247 : OutOfLineCode(gen), result_(result), left_(left), right_(right) {}
249 void Generate() final { __ FloatMinOutOfLine(result_, left_, right_); }
253 T const left_; member in class:v8::internal::compiler::__anon48249::final
263 : OutOfLineCode(gen), result_(result), left_(left), right_(right) {}
265 void Generate() final { __ FloatMaxOutOfLine(result_, left_, right_); }
269 T const left_; member in class:v8::internal::compiler::__anon48249::final
    [all...]
  /external/webp/src/dec/
idec_dec.c 83 VP8MB left_; member in struct:__anon49412
269 context->left_ = dec->mb_info_[-1];
276 dec->mb_info_[-1] = context->left_;
  /external/webp/src/enc/
vp8i_enc.h 286 // save the yuv_out_ boundary values to top_/left_ arrays for next iterations.
318 int left_; // how many free tokens left before the page is full member in struct:__anon49468
  /external/v8/src/ast/
ast.h 1847 Expression* left_; member in class:v8::internal::final
1960 Expression* left_; member in class:v8::internal::final
    [all...]

Completed in 517 milliseconds