Searched refs:end_ (Results 1 - 25 of 116) sorted by relevance

12345

/external/compiler-rt/lib/tsan/rtl/
H A Dtsan_vector.h30 , end_()
43 end_ = 0;
48 return end_ - begin_;
52 DCHECK_LT(i, end_ - begin_);
57 DCHECK_LT(i, end_ - begin_);
63 T *p = &end_[-1];
70 T *p = &end_[-1];
76 DCHECK_GT(end_, begin_);
77 end_--;
82 end_
96 T *end_; member in class:__tsan::Vector
[all...]
/external/libmojo/ui/gfx/range/
H A Drange_f.cc34 uint32_t end = end_ > 0 ? static_cast<uint32_t>(std::floor(end_)) : 0;
40 uint32_t end = end_ > 0 ? static_cast<uint32_t>(std::ceil(end_)) : 0;
46 uint32_t end = end_ > 0 ? static_cast<uint32_t>(std::round(end_)) : 0;
H A Drange_f.h19 // than |end_| to respect the directionality of the range.
26 constexpr RangeF(float start, float end) : start_(start), end_(end) {}
43 constexpr float end() const { return end_; }
44 void set_end(float end) { end_ = end; }
93 float end_; member in class:gfx::RangeF
H A Drange.h36 // |start_| can be greater than |end_| to respect the directionality of the
44 constexpr Range(uint32_t start, uint32_t end) : start_(start), end_(end) {}
70 constexpr uint32_t end() const { return end_; }
71 void set_end(uint32_t end) { end_ = end; }
132 uint32_t end_; member in class:gfx::Range
/external/v8/src/base/
H A Diterator.h28 iterator_range() : begin_(), end_() {}
31 : begin_(begin), end_(end) {}
34 iterator end() { return end_; }
36 const_iterator end() const { return end_; }
38 const_iterator cend() const { return end_; }
48 const_iterator const end_; member in class:v8::base::iterator_range
/external/libchrome/base/trace_event/
H A Dcategory_registry.h32 Range(TraceCategory* begin, TraceCategory* end) : begin_(begin), end_(end) {
36 TraceCategory* end() const { return end_; }
40 TraceCategory* const end_; member in class:base::trace_event::CategoryRegistry::Range
/external/sfntly/cpp/src/sample/subtly/
H A Dcharacter_predicate.cc26 end_(end) {
32 return start_ <= character && character <= end_;
/external/v8/src/wasm/
H A Dfunction-body-decoder.h104 DCHECK_LT(ptr_, end_);
105 ptr_ += OpcodeLength(ptr_, end_);
117 const byte* end_; member in class:v8::internal::wasm::BytecodeIterator::iterator_base
118 iterator_base(const byte* ptr, const byte* end) : ptr_(ptr), end_(end) {}
128 DCHECK_LT(ptr_, end_);
144 DCHECK_LT(ptr_, end_);
162 return base::iterator_range<opcode_iterator>(opcode_iterator(pc_, end_),
163 opcode_iterator(end_, end_));
168 offset_iterator(start_, pc_, end_),
[all...]
H A Ddecoder.h37 end_(end),
43 end_(end),
52 if ((base + offset + length) > end_) {
127 DCHECK(ptr >= start_ && (ptr + 2) <= end_);
133 DCHECK(ptr >= start_ && (ptr + 4) <= end_);
139 DCHECK(ptr >= start_ && (ptr + 8) <= end_);
203 pc_ = end_;
207 // Check that at least {size} bytes exist between {pc_} and {end_}.
213 } else if (pc_ < start_ || end_ < (pc_ + size)) {
254 for (const byte* ptr = pc_; ptr < end_; pt
303 const byte* end_; member in class:v8::internal::wasm::Decoder
[all...]
/external/v8/src/parsing/
H A Dpreparse-data.h52 : end_(-1),
61 end_ = end;
69 int end() const { return end_; }
85 int end_; member in class:v8::internal::final
/external/libchrome/base/strings/
H A Dstring_tokenizer.h162 end_ = string_end;
175 if (token_end_ == end_)
182 while (token_end_ != end_ && delims_.find(*token_end_) == str::npos)
193 if (token_end_ == end_)
204 while (token_end_ != end_ && AdvanceOne(&state, *token_end_))
245 const_iterator end_; member in class:base::StringTokenizerT
/external/protobuf/js/binary/
H A Ddecoder.js240 this.end_ = 0;
320 this.start_, this.end_ - this.start_);
330 this.end_ = 0;
356 this.end_ =
366 return this.end_;
374 this.end_ = end;
410 goog.asserts.assert(this.cursor_ <= this.end_);
419 return this.cursor_ == this.end_;
428 return this.cursor_ > this.end_;
439 (this.cursor_ > this.end_);
[all...]
/external/jsoncpp/src/lib_json/
H A Djson_batchallocator.h61 if (currentBatch_->used_ == currentBatch_->end_) {
63 while (currentBatch_ && currentBatch_->used_ == currentBatch_->end_)
91 AllocatedType* end_; member in struct:Json::BatchAllocator::BatchInfo
106 batch->end_ = batch->buffer_ + objectsPerPage;
H A Djson_reader.cpp80 : errors_(), document_(), begin_(), end_(), current_(), lastValueEnd_(),
85 : errors_(), document_(), begin_(), end_(), current_(), lastValueEnd_(),
119 end_ = endDoc;
141 token.end_ = endDoc;
187 currentValue().setOffsetLimit(token.end_ - begin_);
192 currentValue().setOffsetLimit(token.end_ - begin_);
197 currentValue().setOffsetLimit(token.end_ - begin_);
212 currentValue().setOffsetLimit(token.end_ - begin_);
308 token.end_ = current_;
313 while (current_ != end_) {
[all...]
/external/perfetto/src/base/
H A Dstring_splitter.cc46 end_ = str + size;
54 for (; next_ < end_; next_++) {
66 next_ = end_;
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/utils/
H A Dsparse_column_iterable.h49 if (cur_ < end_ && iter_->ix()(cur_, 0) < example_idx_) {
74 if (cur_ < end_ && iter_->ix()(cur_, 0) == example_idx_) {
86 next_ = std::min(next_ + 1, end_);
87 while (next_ < end_ && iter_->ix()(cur_, 0) == iter_->ix()(next_, 0)) {
96 const int64 end_; member in class:tensorflow::boosted_trees::utils::SparseColumnIterable::Iterator
/external/perfetto/include/perfetto/base/
H A Dstring_splitter.h67 char* end_; // STL-style, points one past the last char. member in class:perfetto::base::StringSplitter
/external/clang/test/SemaCXX/
H A Dfor-range-examples.cpp16 value_range(const T &a, const T &b) : begin_(a), end_(b) {}
17 value_range_iter<T> begin_, end_; member in struct:value_range_detail::value_range
23 value_range_iter<T> end(const value_range<T> &r) { return r.end_; }
40 T it, step, end_; member in class:value_range_detail::value_range_step
43 it(it), end_(end), step(step) {}
46 iterator end() const { return iterator(end_, step); }
94 T begin_, end_; member in struct:map_range::iter_pair
95 iter_pair(T begin, T end) : begin_(begin), end_(end) {}
98 template<typename T> T end(iter_pair<T> p) { return p.end_; }
/external/v8/src/
H A Deh-frame.h206 : start_(start), next_(start), end_(end) {
224 DCHECK_LE(next_, end_);
238 DCHECK_LE(next_, end_);
239 return next_ == end_;
247 int GetBufferSize() { return static_cast<int>(end_ - start_); }
262 DCHECK_LE(next_ + sizeof(result), end_);
270 const byte* end_; member in class:v8::internal::EhFrameIterator
278 : start_(start), end_(end) {
291 const byte* end_; member in class:v8::internal::final
/external/webrtc/webrtc/base/
H A Dbytebuffer.cc58 end_ = len;
59 memcpy(bytes_, bytes, end_);
61 end_ = 0;
190 char* start = bytes_ + end_;
191 end_ += len;
196 size_t len = std::min(end_ - start_, size);
209 end_ = len;
234 start_ = end_ = 0;
/external/libcxx/test/support/
H A Dtest_iterators.h345 : begin_(nullptr), end_(nullptr), current_(nullptr), action_(TADereference), index_(0) {}
347 : begin_(first), end_(last), current_(first), action_(action), index_(index) {}
349 : begin_(rhs.begin_), end_(rhs.end_), current_(rhs.current_), action_(rhs.action_), index_(rhs.index_) {}
365 end_ = rhs.end_;
449 bool atEndL = current_ == end_;
450 bool atEndR = rhs.current_ == rhs.end_;
458 const T* end_; member in struct:ThrowingIterator
482 : begin_(nullptr), end_(nullpt
538 const T* end_; member in struct:NonThrowingIterator
[all...]
/external/tensorflow/tensorflow/core/lib/gtl/
H A Dflatrep.h56 CopyEntries(src.array_, src.end_, CopyEntry());
67 Bucket* limit() const { return end_; }
77 CopyEntries(src.array_, src.end_, CopyEntry());
82 for (Bucket* b = array_; b != end_; b++) {
103 swap(end_, x.end_);
217 Bucket* old_end = end_;
230 Bucket* end_; // Points just past last bucket in array_ member in class:tensorflow::gtl::internal::FlatRep
257 end_ = array + n;
/external/chromium-trace/catapult/systrace/atrace_helper/jni/
H A Dfile_utils.cc97 : ptr_(buf), end_(buf + size) {
104 if (ptr_ >= end_)
112 ptr_ = end_;
/external/libchrome/base/metrics/
H A Dsample_map.cc40 const SampleToCountMap::const_iterator end_; member in class:base::__anon10898::SampleMapIterator
45 end_(sample_counts.end()) {
52 return iter_ == end_;
/external/libcxx/src/
H A Ddebug.cpp300 while (p->end_ != p->beg_)
302 --p->end_;
303 (*p->end_)->__c_ = nullptr;
392 while (p->end_ != p->beg_)
394 --p->end_;
395 (*p->end_)->__c_ = nullptr;
507 std::swap(p1->end_, p2->end_);
509 for (__i_node** p = p1->beg_; p != p1->end_; ++p)
511 for (__i_node** p = p2->beg_; p != p2->end_;
[all...]

Completed in 2468 milliseconds

12345