| /external/image_io/includes/image_io/base/ |
| D | data_range.h | 19 DataRange(size_t begin, size_t end) : begin_(begin), end_(end) {} in DataRange()
23 DataRange() : begin_(0), end_(0) {} in DataRange()
32 size_t GetEnd() const { return end_; } in GetEnd()
35 bool IsValid() const { return begin_ < end_; } in IsValid()
38 size_t GetLength() const { return IsValid() ? end_ - begin_ : 0; } in GetLength()
44 return location >= begin_ && location < end_; in Contains()
52 data_range.end_ <= end_; in Contains()
63 std::min(data_range.end_, end_)); in GetIntersection()
69 return begin_ == rhs.begin_ && end_ == rhs.end_;
75 return begin_ != rhs.begin_ || end_ != rhs.end_;
[all …]
|
| /external/llvm-project/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_vector.h | 26 Vector() : begin_(), end_(), last_() {} in Vector()
37 end_ = 0; in Reset()
42 return end_ - begin_; in Size()
46 DCHECK_LT(i, end_ - begin_);
51 DCHECK_LT(i, end_ - begin_);
57 T *p = &end_[-1]; in PushBack()
64 T *p = &end_[-1]; in PushBack()
70 DCHECK_GT(end_, begin_); in PopBack()
71 end_--; in PopBack()
76 end_ = begin_; in Resize()
[all …]
|
| /external/compiler-rt/lib/tsan/rtl/ |
| D | tsan_vector.h | 30 , end_() in Vector()
43 end_ = 0; in Reset()
48 return end_ - begin_; in Size()
52 DCHECK_LT(i, end_ - begin_);
57 DCHECK_LT(i, end_ - begin_);
63 T *p = &end_[-1]; in PushBack()
70 T *p = &end_[-1]; in PushBack()
76 DCHECK_GT(end_, begin_); in PopBack()
77 end_--; in PopBack()
82 end_ = begin_; in Resize()
[all …]
|
| /external/libchrome/base/ |
| D | big_endian.cc | 12 : ptr_(buf), end_(ptr_ + len) {} in BigEndianReader()
15 if (ptr_ + len > end_) in Skip()
22 if (ptr_ + len > end_) in ReadBytes()
30 if (ptr_ + len > end_) in ReadPiece()
39 if (ptr_ + sizeof(T) > end_) in Read()
63 : ptr_(buf), end_(ptr_ + len) {} in BigEndianWriter()
66 if (ptr_ + len > end_) in Skip()
73 if (ptr_ + len > end_) in WriteBytes()
82 if (ptr_ + sizeof(T) > end_) in Write()
|
| /external/libchrome/base/containers/ |
| D | circular_deque.h | 439 end_(other.end_) { in circular_deque()
441 other.end_ = 0; in circular_deque()
446 ~circular_deque() { DestructRange(begin_, end_); } in ~circular_deque()
470 end_ = other.end_;
473 other.end_ = 0;
519 if (begin_ <= end_ || i < right_size) in at()
558 iterator end() { return iterator(this, end_); } in end()
559 const_iterator end() const { return const_iterator(this, end_); } in end()
560 const_iterator cend() const { return const_iterator(this, end_); } in cend()
617 bool empty() const { return begin_ == end_; } in empty()
[all …]
|
| /external/jsoncpp/src/lib_json/ |
| D | json_reader.cpp | 119 end_ = endDoc; in parse()
141 token.end_ = endDoc; in parse()
187 currentValue().setOffsetLimit(token.end_ - begin_); in readValue()
193 currentValue().setOffsetLimit(token.end_ - begin_); in readValue()
199 currentValue().setOffsetLimit(token.end_ - begin_); in readValue()
216 currentValue().setOffsetLimit(token.end_ - begin_); in readValue()
305 token.end_ = current_; in readToken()
310 while (current_ != end_) { in skipSpaces()
320 if (end_ - current_ < patternLength) in match()
385 while ((current_ + 1) < end_) { in readCStyleComment()
[all …]
|
| /external/pigweed/pw_tokenizer/public/pw_tokenizer/ |
| D | token_database.h | 134 : begin_(begin), end_(end) {} in Entries()
137 constexpr size_t size() const { return end_ - begin_; } in size()
140 constexpr bool empty() const { return begin_ == end_; } in empty()
148 constexpr const Iterator& end() const { return end_; } in end()
152 Iterator end_; variable
197 constexpr TokenDatabase() : begin_{.data = nullptr}, end_{.data = nullptr} {} in TokenDatabase()
204 return (end_.data - begin_.data) / sizeof(RawEntry); in size()
210 Iterator begin() const { return Iterator(begin_.entry, end_.data); } in begin()
211 Iterator end() const { return Iterator(end_.entry, nullptr); } in end()
294 : begin_{.data = begin}, end_{.data = end} {} in TokenDatabase()
[all …]
|
| /external/perfetto/include/perfetto/protozero/ |
| D | proto_decoder.h | 48 end_(begin_ + length), in ProtoDecoder()
66 PERFETTO_DCHECK(pos >= begin_ && pos < end_); in Reset()
74 PERFETTO_DCHECK(read_ptr_ <= end_); in bytes_left()
75 return static_cast<size_t>(end_ - read_ptr_); in bytes_left()
79 const uint8_t* end() const { return end_; } in end()
83 const uint8_t* const end_; variable
107 : field_id_(field_id), iter_(begin), end_(end), last_(last) { in RepeatedFieldIterator()
113 : field_id_(0u), iter_(nullptr), end_(nullptr), last_(nullptr) {} in RepeatedFieldIterator()
115 explicit operator bool() const { return iter_ != end_; }
126 PERFETTO_DCHECK(iter_ != end_);
[all …]
|
| /external/protobuf/js/binary/ |
| D | decoder.js | 241 this.end_ = 0;
321 this.start_, this.end_ - this.start_);
331 this.end_ = 0;
357 this.end_ =
367 return this.end_;
375 this.end_ = end;
411 goog.asserts.assert(this.cursor_ <= this.end_);
420 return this.cursor_ == this.end_;
429 return this.cursor_ > this.end_;
440 (this.cursor_ > this.end_);
[all …]
|
| /external/libgav1/libgav1/src/utils/ |
| D | queue.h | 46 elements_[end_++] = std::move(value); in Push()
47 if (end_ == capacity_) end_ = 0; in Push()
72 const size_t back = ((end_ == 0) ? capacity_ : end_) - 1; in Back()
99 size_t end_ = 0; variable
|
| /external/libchrome/ui/gfx/range/ |
| D | range_f.cc | 34 uint32_t end = end_ > 0 ? static_cast<uint32_t>(std::floor(end_)) : 0; in Floor()
40 uint32_t end = end_ > 0 ? static_cast<uint32_t>(std::ceil(end_)) : 0; in Ceil()
46 uint32_t end = end_ > 0 ? static_cast<uint32_t>(std::round(end_)) : 0; in Round()
|
| /external/libwebm/webm_parser/src/ |
| D | ancestory.h | 37 assert(begin_ < end_); in next()
47 assert(begin_ < end_); in id()
52 bool empty() const { return begin_ == end_; } in empty()
64 : begin_(ancestory), end_(ancestory + count) { in Ancestory()
78 const Id* end_ = nullptr; variable
|
| /external/perfetto/include/perfetto/ext/base/ |
| D | circular_queue.h | 162 PERFETTO_DCHECK(pos_ <= queue_->end_); in Add()
203 T* slot = Get(end_++); in emplace_back()
209 for (; n && (begin_ < end_); --n) { in erase_front()
225 Iterator end() { return Iterator(this, end_, generation()); } in end()
232 PERFETTO_DCHECK(end_ - begin_ <= capacity_); in size()
233 return static_cast<size_t>(end_ - begin_); in size()
265 for (uint64_t i = begin_; i < end_; i++)
270 for (uint64_t i = begin_; i < end_; i++)
275 end_ = new_size;
281 PERFETTO_DCHECK(pos >= begin_ && pos < end_); in Get()
[all …]
|
| /external/llvm-project/flang/include/flang/Common/ |
| D | static-multimap-view.h | 29 constexpr const_iterator end() const { return end_; } in end()
36 : begin_{&array[0]}, end_{&array[0] + N} {} in StaticMultimapView()
41 return std::equal_range(begin_, end_, key); in equal_range()
50 for (const auto *x{begin_}; x != end_; ++x) { in Verify()
59 const_iterator end_{nullptr};
|
| D | format.h | 54 : format_{format}, end_{format + length}, reporter_{reporter}, in ENUM_CLASS()
117 token.set_length(cursor_ - format_ - token.offset() + (cursor_ < end_)); in ENUM_CLASS()
132 const CHAR *const end_; // one-past-last of format_ text in ENUM_CLASS() local
153 for (++cursor_; cursor_ < end_; ++cursor_) { in NextChar()
158 cursor_ = end_; // don't allow cursor_ > end_ in NextChar()
163 for (laCursor_ = cursor_ + 1; laCursor_ < end_; ++laCursor_) { in LookAheadChar()
168 laCursor_ = end_; // don't allow laCursor_ > end_ in LookAheadChar()
227 if (laCursor_ + integerValue_ < end_) { in NextToken()
232 cursor_ = end_; in NextToken()
409 for (++cursor_; cursor_ < end_; ++cursor_) { in NextToken()
[all …]
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/source/opt/ |
| D | iterator.h | 117 : begin_(b), end_(e) {} in IteratorRange()
119 : begin_(std::move(b)), end_(std::move(e)) {} in IteratorRange()
122 IteratorType end() const { return end_; } in end()
124 bool empty() const { return begin_ == end_; } in empty()
125 size_t size() const { return end_ - begin_; } in size()
129 IteratorType end_; variable
187 end_(iteration_range.end()), in FilterIterator()
211 return cur_ == rhs.cur_ && end_ == rhs.end_;
221 FilterIterator GetEnd() const { return FilterIterator(end_, predicate_); } in GetEnd()
226 bool IsPredicateSatisfied() { return cur_ == end_ || predicate_(*cur_); } in IsPredicateSatisfied()
[all …]
|
| /external/llvm-project/libcxx/src/ |
| D | debug.cpp | 260 while (p->end_ != p->beg_) in __invalidate_all()
262 --p->end_; in __invalidate_all()
263 (*p->end_)->__c_ = nullptr; in __invalidate_all()
352 while (p->end_ != p->beg_) in __erase_c()
354 --p->end_; in __erase_c()
355 (*p->end_)->__c_ = nullptr; in __erase_c()
467 std::swap(p1->end_, p2->end_); in swap()
469 for (__i_node** p = p1->beg_; p != p1->end_; ++p) in swap()
471 for (__i_node** p = p2->beg_; p != p2->end_; ++p) in swap()
487 if (end_ == cap_) in __add()
[all …]
|
| /external/libcxx/src/ |
| D | debug.cpp | 300 while (p->end_ != p->beg_) in __invalidate_all()
302 --p->end_; in __invalidate_all()
303 (*p->end_)->__c_ = nullptr; in __invalidate_all()
392 while (p->end_ != p->beg_) in __erase_c()
394 --p->end_; in __erase_c()
395 (*p->end_)->__c_ = nullptr; in __erase_c()
507 std::swap(p1->end_, p2->end_); in swap()
509 for (__i_node** p = p1->beg_; p != p1->end_; ++p) in swap()
511 for (__i_node** p = p2->beg_; p != p2->end_; ++p) in swap()
527 if (end_ == cap_) in __add()
[all …]
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | iterator.h | 121 : begin_(b), end_(e) {} in IteratorRange()
123 : begin_(std::move(b)), end_(std::move(e)) {} in IteratorRange()
126 IteratorType end() const { return end_; } in end()
128 bool empty() const { return begin_ == end_; } in empty()
129 size_t size() const { return end_ - begin_; } in size()
133 IteratorType end_; variable
195 end_(iteration_range.end()), in FilterIterator()
219 return cur_ == rhs.cur_ && end_ == rhs.end_;
229 FilterIterator GetEnd() const { return FilterIterator(end_, predicate_); } in GetEnd()
234 bool IsPredicateSatisfied() { return cur_ == end_ || predicate_(*cur_); } in IsPredicateSatisfied()
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | iterator.h | 121 : begin_(b), end_(e) {} in IteratorRange()
123 : begin_(std::move(b)), end_(std::move(e)) {} in IteratorRange()
126 IteratorType end() const { return end_; } in end()
128 bool empty() const { return begin_ == end_; } in empty()
129 size_t size() const { return end_ - begin_; } in size()
133 IteratorType end_; variable
195 end_(iteration_range.end()), in FilterIterator()
219 return cur_ == rhs.cur_ && end_ == rhs.end_;
229 FilterIterator GetEnd() const { return FilterIterator(end_, predicate_); } in GetEnd()
234 bool IsPredicateSatisfied() { return cur_ == end_ || predicate_(*cur_); } in IsPredicateSatisfied()
[all …]
|
| /external/libchrome/base/strings/ |
| D | string_tokenizer.h | 160 end_ = string_end; in Init()
173 if (token_end_ == end_) in QuickGetNext()
180 while (token_end_ != end_ && delims_.find(*token_end_) == str::npos) in QuickGetNext()
191 if (token_end_ == end_) in FullGetNext()
202 while (token_end_ != end_ && AdvanceOne(&state, *token_end_)) in FullGetNext()
243 const_iterator end_; variable
|
| /external/clang/test/SemaCXX/ |
| D | for-range-examples.cpp | 16 value_range(const T &a, const T &b) : begin_(a), end_(b) {} in value_range()
17 value_range_iter<T> begin_, end_; member
23 value_range_iter<T> end(const value_range<T> &r) { return r.end_; } in end()
40 T it, step, end_; member in value_range_detail::value_range_step
43 it(it), end_(end), step(step) {} in value_range_step()
46 iterator end() const { return iterator(end_, step); } in end()
94 T begin_, end_; member
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
|
| /external/llvm-project/clang/test/SemaCXX/ |
| D | for-range-examples.cpp | 16 value_range(const T &a, const T &b) : begin_(a), end_(b) {} in value_range()
17 value_range_iter<T> begin_, end_; member
23 value_range_iter<T> end(const value_range<T> &r) { return r.end_; } in end()
40 T it, step, end_; member in value_range_detail::value_range_step
43 it(it), end_(end), step(step) {} in value_range_step()
46 iterator end() const { return iterator(end_, step); } in end()
94 T begin_, end_; member
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {} in iter_pair()
98 template<typename T> T end(iter_pair<T> p) { return p.end_; } in end()
|
| /external/libcxx/test/support/ |
| D | test_iterators.h | 345 : begin_(nullptr), end_(nullptr), current_(nullptr), action_(TADereference), index_(0) {} in ThrowingIterator()
347 : begin_(first), end_(last), current_(first), action_(action), index_(index) {} in begin_()
349 …: begin_(rhs.begin_), end_(rhs.end_), current_(rhs.current_), action_(rhs.action_), index_(rhs.ind… in ThrowingIterator()
365 end_ = rhs.end_;
449 bool atEndL = current_ == end_;
450 bool atEndR = rhs.current_ == rhs.end_;
458 const T* end_; member
482 : begin_(nullptr), end_(nullptr), current_(nullptr) {} in NonThrowingIterator()
484 : begin_(first), end_(last), current_(first) {} in NonThrowingIterator()
486 : begin_(rhs.begin_), end_(rhs.end_), current_(rhs.current_) {} in NonThrowingIterator()
[all …]
|
| /external/llvm-project/libcxx/test/support/ |
| D | test_iterators.h | 344 : begin_(nullptr), end_(nullptr), current_(nullptr), action_(TADereference), index_(0) {} in ThrowingIterator()
346 : begin_(first), end_(last), current_(first), action_(action), index_(index) {} in begin_()
348 …: begin_(rhs.begin_), end_(rhs.end_), current_(rhs.current_), action_(rhs.action_), index_(rhs.ind… in ThrowingIterator()
364 end_ = rhs.end_;
448 bool atEndL = current_ == end_;
449 bool atEndR = rhs.current_ == rhs.end_;
457 const T* end_; member
481 : begin_(nullptr), end_(nullptr), current_(nullptr) {} in NonThrowingIterator()
483 : begin_(first), end_(last), current_(first) {} in NonThrowingIterator()
485 : begin_(rhs.begin_), end_(rhs.end_), current_(rhs.current_) {} in NonThrowingIterator()
[all …]
|