| /external/compiler-rt/lib/tsan/rtl/ |
| D | tsan_vector.h | 29 , begin_() in Vector()
35 if (begin_) in ~Vector()
36 internal_free(begin_); in ~Vector()
40 if (begin_) in Reset()
41 internal_free(begin_); in Reset()
42 begin_ = 0; in Reset()
48 return end_ - begin_; in Size()
52 DCHECK_LT(i, end_ - begin_);
53 return begin_[i];
57 DCHECK_LT(i, end_ - begin_);
[all …]
|
| /external/perfetto/include/perfetto/ext/base/ |
| D | small_vector.h | 42 AlignedFree(begin_); in ~SmallVector()
43 begin_ = end_ = end_of_storage_ = nullptr; in ~SmallVector()
52 begin_ = other.begin_; in noexcept()
60 new (&begin_[i]) T(std::move(other.begin_[i])); in noexcept()
61 other.begin_[i].~T(); in noexcept()
63 end_ = begin_ + other_size; in noexcept()
66 other.end_ = other.begin_ = other_inline_storage; in noexcept()
84 new (&begin_[i]) T(other.begin_[i]); in SmallVector()
85 end_ = begin_ + other_size; in SmallVector()
96 T* data() { return begin_; } in data()
[all …]
|
| D | circular_queue.h | 183 begin_(other.begin_), in CircularQueue()
228 for (; n && (begin_ < end_); --n) { in erase_front()
229 Get(begin_)->~T(); in erase_front()
230 begin_++; // This needs to be its own statement, Get() checks begin_. in erase_front()
250 return *Get(begin_ + idx); in at()
253 Iterator begin() { return Iterator(this, begin_, generation()); } in begin()
261 PERFETTO_DCHECK(end_ - begin_ <= capacity_); in size()
262 return static_cast<size_t>(end_ - begin_); in size()
297 for (uint64_t i = begin_; i < end_; i++) in ChangeCapacity()
302 for (uint64_t i = begin_; i < end_; i++) in ChangeCapacity()
[all …]
|
| /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()
29 size_t GetBegin() const { return begin_; } in GetBegin()
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()
51 return IsValid() && data_range.IsValid() && data_range.begin_ >= begin_ && in Contains()
62 return DataRange(std::max(data_range.begin_, begin_), in GetIntersection()
69 return begin_ == rhs.begin_ && end_ == rhs.end_;
75 return begin_ != rhs.begin_ || end_ != rhs.end_;
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/ranges/range.adaptors/range.common.view/ |
| D | types.h | 17 int* begin_ = nullptr; member
20 constexpr int *begin() const { return begin_; } in begin()
27 int* begin_; member
29 constexpr explicit MoveOnlyView(int* b, int* e) : begin_(b), end_(e) { } in MoveOnlyView()
32 constexpr int *begin() const { return begin_; } in begin()
40 int* begin_; member
42 constexpr explicit CopyableView(int* b, int* e) : begin_(b), end_(e) { } in CopyableView()
43 constexpr int *begin() const { return begin_; } in begin()
51 int* begin_; member
53 constexpr explicit SizedForwardView(int* b, int* e) : begin_(b), end_(e) { } in SizedForwardView()
[all …]
|
| D | base.pass.cpp | 32 assert(common.base().begin_ == buf); in test()
33 assert(std::move(common).base().begin_ == buf); in test()
43 assert(std::move(common).base().begin_ == buf); in test()
52 assert(common.base().begin_ == buf); in test()
53 assert(std::move(common).base().begin_ == buf); in test()
|
| /external/cronet/base/containers/ |
| D | circular_deque.h | 257 if (index_ >= parent_deque_->begin_) in OffsetFromBegin()
258 return index_ - parent_deque_->begin_; // On the same side as begin. in OffsetFromBegin()
259 return parent_deque_->buffer_.capacity() - parent_deque_->begin_ + index_; in OffsetFromBegin()
296 index_ = (new_offset + parent_deque_->begin_) % in Add()
450 begin_(other.begin_), in circular_deque()
452 other.begin_ = 0; in circular_deque()
458 ~circular_deque() { DestructRange(begin_, end_); } in ~circular_deque()
481 begin_ = other.begin_;
484 other.begin_ = 0;
530 size_t right_size = buffer_.capacity() - begin_; in at()
[all …]
|
| /external/libchrome/base/containers/ |
| D | circular_deque.h | 250 if (index_ >= parent_deque_->begin_) in OffsetFromBegin()
251 return index_ - parent_deque_->begin_; // On the same side as begin. in OffsetFromBegin()
252 return parent_deque_->buffer_.capacity() - parent_deque_->begin_ + index_; in OffsetFromBegin()
289 index_ = (new_offset + parent_deque_->begin_) % in Add()
438 begin_(other.begin_), in circular_deque()
440 other.begin_ = 0; in circular_deque()
446 ~circular_deque() { DestructRange(begin_, end_); } in ~circular_deque()
469 begin_ = other.begin_;
472 other.begin_ = 0;
518 size_t right_size = buffer_.capacity() - begin_; in at()
[all …]
|
| /external/cronet/base/timer/ |
| D | elapsed_timer.cc | 15 ElapsedTimer::ElapsedTimer() : begin_(TimeTicks::Now()) {} in ElapsedTimer()
17 ElapsedTimer::ElapsedTimer(ElapsedTimer&& other) : begin_(other.begin_) {} in ElapsedTimer()
20 begin_ = other.begin_; in operator =()
26 return TimeTicks::Now() - begin_; in Elapsed()
31 begin_(is_supported_ ? ThreadTicks::Now() : ThreadTicks()) {} in ElapsedThreadTimer()
38 return ThreadTicks::Now() - begin_; in Elapsed()
|
| /external/cronet/net/third_party/quiche/src/quiche/common/ |
| D | quiche_circular_deque.h | 187 if (index_ >= deque_->begin_) { in ExternalPosition()
188 return index_ - deque_->begin_; in ExternalPosition()
190 return index_ + deque_->data_capacity() - deque_->begin_; in ExternalPosition()
251 : begin_(other.begin_), in QuicheCircularDeque()
254 other.begin_ = other.end_ = 0; in QuicheCircularDeque()
278 begin_ = end_ = 0;
325 size_type index = begin_ + pos; in at()
342 return *index_to_address(begin_); in front()
358 iterator begin() { return iterator(this, begin_); } in begin()
359 const_iterator begin() const { return const_iterator(this, begin_); } in begin()
[all …]
|
| /external/libwebm/webm_parser/src/ |
| D | ancestory.h | 37 assert(begin_ < end_); in next()
39 ++copy.begin_; in next()
47 assert(begin_ < end_); in id()
48 return *begin_; in id()
52 bool empty() const { return begin_ == end_; } in empty()
64 : begin_(ancestory), end_(ancestory + count) { in Ancestory()
74 const Id* begin_ = nullptr; variable
|
| /external/libchrome/base/timer/ |
| D | elapsed_timer.cc | 10 begin_ = TimeTicks::Now(); in ElapsedTimer()
14 begin_ = other.begin_; in ElapsedTimer()
18 begin_ = other.begin_; in operator =()
22 return TimeTicks::Now() - begin_; in Elapsed()
|
| /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()
147 constexpr const Iterator& begin() const { return begin_; } in begin()
151 Iterator begin_;
197 constexpr TokenDatabase() : begin_{.data = nullptr}, end_{.data = nullptr} {} in TokenDatabase()
204 return (end_.data - begin_.data) / sizeof(RawEntry); in size()
208 constexpr bool ok() const { return begin_.data != nullptr; } in ok()
210 Iterator begin() const { return Iterator(begin_.entry, end_.data); } in begin()
294 : begin_{.data = begin}, end_{.data = end} {} in TokenDatabase()
[all …]
|
| /external/jsoncpp/src/lib_json/ |
| D | json_reader.cpp | 117 begin_ = beginDoc; in parse()
120 current_ = begin_; in parse()
170 currentValue().setOffsetLimit(current_ - begin_); in readValue()
174 currentValue().setOffsetLimit(current_ - begin_); in readValue()
185 currentValue().setOffsetStart(token.start_ - begin_); in readValue()
186 currentValue().setOffsetLimit(token.end_ - begin_); in readValue()
191 currentValue().setOffsetStart(token.start_ - begin_); in readValue()
192 currentValue().setOffsetLimit(token.end_ - begin_); in readValue()
197 currentValue().setOffsetStart(token.start_ - begin_); in readValue()
198 currentValue().setOffsetLimit(token.end_ - begin_); in readValue()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/ranges/range.adaptors/range.reverse/ |
| D | types.h | 16 int *begin_; member
19 constexpr BidirRange(int* b, int* e) : begin_(b), end_(e) { } in BidirRange()
21 constexpr bidirectional_iterator<int*> begin() { return bidirectional_iterator<int*>{begin_}; } in begin()
22 …rectional_iterator<const int*> begin() const { return bidirectional_iterator<const int*>{begin_}; } in begin()
37 int* begin_; member
40 constexpr BidirSentRange(int* b, int* e) : begin_(b), end_(e) { } in BidirSentRange()
46 constexpr bidirectional_iterator<int*> begin() { return bidirectional_iterator<int*>{begin_}; } in begin()
47 …rectional_iterator<const int*> begin() const { return bidirectional_iterator<const int*>{begin_}; } in begin()
|
| D | base.pass.cpp | 31 assert(base.begin_ == buffer); in test()
35 assert(moved.begin_ == buffer); in test()
43 assert(base.begin_ == buffer); in test()
47 assert(moved.begin_ == buffer); in test()
57 assert(base.begin_ == buffer); in test()
65 assert(base.begin_ == buffer); in test()
69 assert(moved.begin_ == buffer); in test()
|
| D | begin.pass.cpp | 51 int* begin_; member
54 CountedView(int* b, int* e) : begin_(b), end_(e) { } in CountedView()
56 auto begin() { return CountedIter(begin_); } in begin()
57 auto begin() const { return CountedIter(begin_); } in begin()
66 int* begin_; member
69 constexpr RASentRange(int* b, int* e) : begin_(b), end_(e) { } in RASentRange()
71 constexpr random_access_iterator<int*> begin() { return random_access_iterator<int*>{begin_}; } in begin()
72 …om_access_iterator<const int*> begin() const { return random_access_iterator<const int*>{begin_}; } in begin()
|
| D | ctor.view.pass.cpp | 27 assert(rev.base().begin_ == buffer); in test()
33 assert(rev.base().begin_ == buffer); in test()
39 assert(moved.begin_ == buffer); in test()
44 assert(rev.base().begin_ == buffer); in test()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/ranges/range.adaptors/range.filter/ |
| D | base.pass.cpp | 21 constexpr explicit Range(int* b, int* e) : begin_(b), end_(e) { } in Range()
22 …constexpr Range(Range const& other) : begin_(other.begin_), end_(other.end_), wasCopyInitialized(t… in Range()
23 …constexpr Range(Range&& other) : begin_(other.begin_), end_(other.end_), wasMoveInitialized(true) … in Range()
26 constexpr int* begin() const { return begin_; } in begin()
29 int* begin_; member
|
| D | end.pass.cpp | 23 constexpr explicit Range(int* b, int* e) : begin_(b), end_(e) { } in Range()
24 constexpr Iterator begin() const { return Iterator(begin_); } in begin()
28 int* begin_; member
34 constexpr explicit CommonRange(int* b, int* e) : begin_(b), end_(e) { } in CommonRange()
35 constexpr Iterator begin() const { return Iterator(begin_); } in begin()
39 int* begin_; member
|
| /external/cronet/net/third_party/quiche/src/quiche/spdy/core/ |
| D | array_output_buffer.h | 20 : current_(buffer), begin_(buffer), capacity_(size) {} in ArrayOutputBuffer()
30 size_t Size() const { return current_ - begin_; } in Size()
31 char* Begin() const { return begin_; } in Begin()
36 current_ = begin_; in Reset()
41 char* begin_ = nullptr; variable
|
| /external/webrtc/logging/rtc_event_log/ |
| D | rtc_event_processor.h | 54 : begin_(begin), end_(end), f_(f), tie_breaker_(tie_breaker) {} in ProcessableEventList()
58 f_(*begin_); in ProcessNext()
59 ++begin_; in ProcessNext()
62 bool IsEmpty() const override { return begin_ == end_; } in IsEmpty()
66 return begin_->log_time_us(); in GetNextTime()
71 Iterator begin_;
|
| /external/libgav1/src/utils/ |
| D | queue.h | 56 const T element = std::move(elements_[begin_++]); in Pop()
58 if (begin_ == capacity_) begin_ = 0; in Pop()
66 return elements_[begin_]; in Front()
98 size_t begin_ = 0; variable
|
| /external/pigweed/pw_minimal_cpp_stdlib/public/internal/ |
| D | initializer_list.h | 30 constexpr initializer_list() : begin_(nullptr), size_(0) {} in initializer_list()
34 iterator begin() const { return begin_; } in begin()
35 iterator end() const { return begin_ + size_; } in end()
40 const T* begin_;
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/ranges/range.adaptors/range.drop/ |
| D | adaptor.pass.cpp | 29 int* begin_ = nullptr; member
31 constexpr SizedView(int* begin, int* end) : begin_(begin), end_(end) {} in SizedView()
33 constexpr auto begin() const { return forward_iterator<int*>(begin_); } in begin()
44 int* begin_ = nullptr; member
46 constexpr SizedViewWithUnsizedSentinel(int* begin, int* end) : begin_(begin), end_(end) {} in SizedViewWithUnsizedSentinel()
48 constexpr auto begin() const { return iterator(begin_); } in begin()
50 constexpr std::size_t size() const { return end_ - begin_; } in size()
79 assert(result.base().begin_ == buf); in test()
94 assert(result.base().base().begin_ == buf); in test()
109 assert(result.base().base().begin_ == buf); in test()
|