| /external/v8/src/ |
| D | splay-tree-inl.h | 49 node->left_ = root_; in InsertInternal()
54 node->left_ = root_->left_; in InsertInternal()
55 root_->left_ = NULL; in InsertInternal()
103 root_ = root_->left_; in FindGreatestLessThan()
152 while (current->left_ != NULL) in FindLeast()
153 current = current->left_; in FindLeast()
192 if (root_->left_ == NULL) { in RemoveRootNode()
199 root_ = root_->left_; in RemoveRootNode()
226 if (current->left_ == NULL) in Splay()
228 if (Config::Compare(key, current->left_->key_) < 0) { in Splay()
[all …]
|
| D | splay-tree.h | 105 left_(NULL), in Node()
122 Node* left() { return left_; } in left()
130 Node* left_; variable
|
| /external/webrtc/webrtc/modules/desktop_capture/ |
| D | desktop_geometry.h | 99 DesktopRect() : left_(0), top_(0), right_(0), bottom_(0) {} in DesktopRect()
101 int32_t left() const { return left_; } in left()
105 int32_t width() const { return right_ - left_; } in width()
108 DesktopVector top_left() const { return DesktopVector(left_, top_); } in top_left()
111 bool is_empty() const { return left_ >= right_ || top_ >= bottom_; } in is_empty()
114 return left_ == other.left_ && top_ == other.top_ && in equals()
133 : left_(left), top_(top), right_(right), bottom_(bottom) { in DesktopRect()
136 int32_t left_; variable
|
| D | desktop_geometry.cc | 28 left_ = std::max(left(), rect.left()); in IntersectWith()
33 left_ = 0; in IntersectWith()
41 left_ += dx; in Translate()
|
| /external/opencv3/3rdparty/libwebp/enc/ |
| D | token.c | 48 b->left_ = 0; in VP8TBufferInit()
72 b->left_ = MAX_NUM_TOKEN; in TBufferNewPage()
87 if (b->left_ > 0 || TBufferNewPage(b)) { in AddToken()
88 const int slot = --b->left_; in AddToken()
98 if (b->left_ > 0 || TBufferNewPage(b)) { in AddConstantToken()
99 const int slot = --b->left_; in AddConstantToken()
199 const int N = (p->next_ == NULL) ? b->left_ : 0;
223 const int N = (next == NULL) ? b->left_ : 0; in VP8EmitTokens()
|
| D | vp8enci.h | 343 int left_; // how many free tokens left before the page is full. member
|
| /external/webp/src/enc/ |
| D | token.c | 49 b->left_ = 0; in VP8TBufferInit()
80 b->left_ = b->page_size_; in TBufferNewPage()
94 if (b->left_ > 0 || TBufferNewPage(b)) { in AddToken()
95 const int slot = --b->left_; in AddToken()
105 if (b->left_ > 0 || TBufferNewPage(b)) { in AddConstantToken()
106 const int slot = --b->left_; in AddConstantToken()
206 const int N = (p->next_ == NULL) ? b->left_ : 0;
230 const int N = (next == NULL) ? b->left_ : 0; in VP8EmitTokens()
256 const int N = (next == NULL) ? b->left_ : 0; in VP8EstimateTokenSize()
|
| D | vp8enci.h | 311 int left_; // how many free tokens left before the page is full member
|
| /external/gmock/src/ |
| D | gmock-matchers.cc | 202 left_(graph_->LhsSize(), kUnused), in MaxBipartiteMatchState()
225 GTEST_CHECK_(left_[ilhs] == kUnused) in Compute()
226 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
232 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute()
233 size_t irhs = left_[ilhs]; in Compute()
279 left_[ilhs] = irhs; in TryAugment()
299 ::std::vector<size_t> left_;
|
| /external/deqp/framework/referencerenderer/ |
| D | rrRenderState.hpp | 217 WindowRectangle (int left_, int bottom_, int width_, int height_) in WindowRectangle()
218 : left (left_) in WindowRectangle()
|
| /external/libchrome/base/test/ |
| D | trace_event_analyzer.cc | 204 left_(query.left_), in Query()
262 DCHECK(left_.get()); in Evaluate()
361 DCHECK(left_.get()); in EvaluateArithmeticOperator()
547 return left_->query(); in left()
617 left_(new QueryNode(left)), in Query()
627 left_(new QueryNode(left)), in Query()
|
| D | trace_event_analyzer.h | 539 scoped_refptr<QueryNode> left_; variable
|
| /external/v8/src/ast/ |
| D | ast.cc | 634 return MatchLiteralCompareTypeof(left_, op_, right_, expr, check) || in IsLiteralCompareTypeof()
635 MatchLiteralCompareTypeof(right_, op_, left_, expr, check); in IsLiteralCompareTypeof()
668 return MatchLiteralCompareUndefined(left_, op_, right_, expr, isolate) || in IsLiteralCompareUndefined()
669 MatchLiteralCompareUndefined(right_, op_, left_, expr, isolate); in IsLiteralCompareUndefined()
687 return MatchLiteralCompareNull(left_, op_, right_, expr) || in IsLiteralCompareNull()
688 MatchLiteralCompareNull(right_, op_, left_, expr); in IsLiteralCompareNull()
|
| D | ast-value-factory.h | 121 : length_(left->length() + right->length()), left_(left), right_(right) {} in AstConsString()
129 const AstString* left_; variable
|
| D | ast-value-factory.cc | 122 ->NewConsString(left_->string(), right_->string()) in Internalize()
|
| D | ast.h | 2181 Expression* left() const { return left_; } in left()
2182 void set_left(Expression* e) { left_ = e; } in set_left()
2226 left_(left), in BinaryOperation()
2240 Expression* left_; variable
2326 Expression* left() const { return left_; } in left()
2329 void set_left(Expression* e) { left_ = e; } in set_left()
2350 left_(left), in CompareOperation()
2361 Expression* left_; variable
|
| /external/v8/src/compiler/ |
| D | node-matchers.h | 212 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) { in BinopMatcher()
216 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) { in BinopMatcher()
223 const Left& left() const { return left_; } in left()
231 std::swap(left_, right_); in SwapInputs()
243 Left left_; member
|
| /external/webp/src/dec/ |
| D | idec.c | 81 VP8MB left_; member
263 context->left_ = dec->mb_info_[-1]; in SaveContext()
270 dec->mb_info_[-1] = context->left_; in RestoreContext()
|
| /external/opencv3/3rdparty/libwebp/dec/ |
| D | idec.c | 80 VP8MB left_; member
244 context->left_ = *left; in SaveContext()
258 *left = context->left_; in RestoreContext()
|
| /external/libcxx/include/ |
| D | __tree | 1165 // __cache->left_ == nullptr
|