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

  /external/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/v8/src/
splay-tree.h 105 left_(NULL),
122 Node* left() { return left_; }
130 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/v8/src/ast/
ast-value-factory.h 121 : length_(left->length() + right->length()), left_(left), right_(right) {}
129 const AstString* left_; member in class:v8::internal::final
ast.h 2240 Expression* left_; member in class:v8::internal::final
2361 Expression* left_; member in class:v8::internal::final
    [all...]
  /system/tools/aidl/
ast_cpp.h 327 std::unique_ptr<AstNode> left_; member in class:android::aidl::cpp::Comparison
  /external/opencv3/3rdparty/libwebp/dec/
idec.c 80 VP8MB left_; member in struct:__anon21022
244 context->left_ = *left;
258 *left = context->left_;
  /external/v8/src/compiler/
node-matchers.h 212 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) {
216 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) {
223 const Left& left() const { return left_; }
231 std::swap(left_, right_);
243 Left left_; member in struct:v8::internal::compiler::BinopMatcher
  /external/webp/src/dec/
idec.c 81 VP8MB left_; member in struct:__anon26572
263 context->left_ = dec->mb_info_[-1];
270 dec->mb_info_[-1] = context->left_;
  /external/libchrome/base/test/
trace_event_analyzer.h 495 // Try to compare left_ against right_ based on operator_.
500 // Try to compare left_ against right_ based on operator_.
513 // Evaluate this Query as an arithmetic operator on left_ and right_.
539 scoped_refptr<QueryNode> left_; member in class:trace_analyzer::Query
  /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/opencv3/3rdparty/libwebp/enc/
vp8enci.h 309 // save the boundary values to top_/left_ arrays. block_to_save can be
343 int left_; // how many free tokens left before the page is full. member in struct:__anon21069
  /external/webp/src/enc/
vp8enci.h 279 // save the yuv_out_ boundary values to top_/left_ arrays for next iterations.
311 int left_; // how many free tokens left before the page is full member in struct:__anon26629
  /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 685 milliseconds