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

  /external/googletest/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 105 left_(NULL),
122 Node* left() { return left_; }
130 Node* left_; member in class:v8::internal::SplayTree::Node
  /external/v8/testing/gmock/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/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
  /frameworks/native/libs/vr/libdvrcommon/include/private/dvr/
field_of_view.h 19 FieldOfView() : left_(0.0f), right_(0.0f), bottom_(0.0f), top_(0.0f) {}
23 : left_(left), right_(right), bottom_(bottom), top_(top) {}
29 float GetLeft() const { return left_; }
35 void SetLeft(float left) { left_ = left; }
42 float x_left = -std::tan(left_) * z_near;
86 float left_; member in class:android::dvr::FieldOfView
  /external/v8/src/ast/
ast-value-factory.h 139 left_(left),
148 const AstString* left_; member in class:v8::internal::final
ast.h 2181 Expression* left_; member in class:v8::internal::final
2314 Expression* left_; member in class:v8::internal::final
    [all...]
  /external/v8/src/compiler/
loop-variable-optimizer.cc 79 Node* left() const { return left_; }
86 : left_(left), right_(right), kind_(kind), next_(next) {}
89 Node* left_; member in class:v8::internal::compiler::LoopVariableOptimizer::Constraint
node-matchers.h 235 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) {
239 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) {
246 const Left& left() const { return left_; }
254 std::swap(left_, right_);
266 Left left_; member in struct:v8::internal::compiler::BinopMatcher
  /system/tools/aidl/
ast_cpp.h 343 std::unique_ptr<AstNode> left_; member in class:android::aidl::cpp::Comparison
  /external/v8/src/compiler/arm/
code-generator-arm.cc 266 : OutOfLineCode(gen), result_(result), left_(left), right_(right) {}
268 void Generate() final { __ FloatMinOutOfLine(result_, left_, right_); }
272 T const left_; member in class:v8::internal::compiler::__anon34136::final
282 : OutOfLineCode(gen), result_(result), left_(left), right_(right) {}
284 void Generate() final { __ FloatMaxOutOfLine(result_, left_, right_); }
288 T const left_; member in class:v8::internal::compiler::__anon34136::final
    [all...]
  /external/webp/src/dec/
idec_dec.c 83 VP8MB left_; member in struct:__anon36746
270 context->left_ = dec->mb_info_[-1];
277 dec->mb_info_[-1] = context->left_;
  /toolchain/binutils/binutils-2.25/gold/
expression.cc 356 : left_(left), right_(right)
361 delete this->left_;
371 return this->left_->eval_maybe_dot(eei->symtab, eei->layout,
404 { this->left_->print(f); }
423 Expression* left_; member in class:gold::Binary_expression
    [all...]
  /external/libchrome/base/test/
trace_event_analyzer.h 587 // Try to compare left_ against right_ based on operator_.
592 // Try to compare left_ against right_ based on operator_.
605 // Evaluate this Query as an arithmetic operator on left_ and right_.
634 scoped_refptr<QueryNode> left_; member in class:trace_analyzer::Query
  /external/webp/src/enc/
vp8i_enc.h 277 // save the yuv_out_ boundary values to top_/left_ arrays for next iterations.
309 int left_; // how many free tokens left before the page is full member in struct:__anon36806
  /prebuilts/tools/common/m2/repository/net/sourceforge/cssparser/cssparser/0.9.13/
cssparser-0.9.13.jar 
  /prebuilts/tools/common/m2/repository/net/sourceforge/htmlunit/htmlunit/2.14/
htmlunit-2.14.jar 

Completed in 353 milliseconds