Home
last modified time | relevance | path

Searched refs:cur_ (Results 1 – 25 of 56) sorted by relevance

123

/third_party/mindspore/mindspore/ccsrc/minddata/dataset/util/
Dtreap.h118 explicit iterator(Treap *tr) : tr_(tr), cur_(nullptr) { in iterator()
120 cur_ = tr_->root_; in iterator()
121 while (cur_ != nullptr) { in iterator()
122 stack_.push(cur_); in iterator()
123 cur_ = cur_->left; in iterator()
127 cur_ = stack_.top(); in iterator()
129 cur_ = nullptr; in iterator()
134 cur_ = nullptr; in ~iterator()
137 NodeValue &operator*() { return cur_->nv; }
139 NodeValue *operator->() { return &(cur_->nv); }
[all …]
Dbtree_iterator.tpp27 cur_->rw_lock_.Unlock();
34 if (slot_ + 1u < cur_->slotuse_) {
36 } else if (cur_->link_.next) {
38 cur_->link_.next->rw_lock_.LockShared();
39 cur_->rw_lock_.Unlock();
41 cur_ = cur_->link_.next;
44 slot_ = cur_->slotuse_;
52 if (slot_ + 1u < cur_->slotuse_) {
54 } else if (cur_->link_.next) {
56 cur_->link_.next->rw_lock_.LockShared();
[all …]
Dbtree.h387 explicit Iterator(BPlusTree *btree) : cur_(btree->leaf_nodes_.head), slot_(0), locked_(false) {} in Iterator()
389 …Iterator(LeafNode *leaf, slot_type slot, bool locked = false) : cur_(leaf), slot_(slot), locked_(l… in cur_() function
401 pointer operator->() const { return cur_->data_[cur_->slot_dir_[slot_]].get(); }
403 reference operator*() const { return *(cur_->data_[cur_->slot_dir_[slot_]].get()); }
405 const key_type &key() const { return cur_->keys_[cur_->slot_dir_[slot_]]; } in key()
407 value_type &value() const { return *(cur_->data_[cur_->slot_dir_[slot_]].get()); } in value()
421 bool operator==(const Iterator &x) const { return (x.cur_ == cur_) && (x.slot_ == slot_); }
422 bool operator!=(const Iterator &x) const { return (x.cur_ != cur_) || (x.slot_ != slot_); }
425 cur_->rw_lock_.LockShared(); in LockShared()
430 cur_->rw_lock_.LockExclusive(); in LockExclusive()
[all …]
/third_party/boost/boost/xpressive/detail/core/matcher/
Dlookbehind_matcher.hpp63 BidiIter const tmp = state.cur_; in match_()
64 … if(!detail::advance_to(state.cur_, -static_cast<difference_type>(this->width_), state.begin_)) in match_()
66 state.cur_ = tmp; in match_()
74 BOOST_ASSERT(state.cur_ == tmp); in match_()
77 state.cur_ = tmp; in match_()
87 state.cur_ = tmp; in match_()
90 BOOST_ASSERT(state.cur_ == tmp); in match_()
97 BOOST_ASSERT(state.cur_ == tmp); in match_()
105 BidiIter const tmp = state.cur_; in match_()
106 … if(!detail::advance_to(state.cur_, -static_cast<difference_type>(this->width_), state.begin_)) in match_()
[all …]
Dsimple_repeat_matcher.hpp99 BidiIter const tmp = state.cur_; in match_()
113 ? state.cur_ in match_()
119 state.cur_ = tmp; in match_()
124 for(; ; --matches, std::advance(state.cur_, diff)) in match_()
132 state.cur_ = tmp; in match_()
143 BidiIter const tmp = state.cur_; in match_()
150 state.cur_ = tmp; in match_()
164 state.cur_ = tmp; in match_()
172 BidiIter const tmp = state.cur_; in match_()
186 state.cur_ += (std::min)((std::size_t)this->max_, diff_to_end); in match_()
[all …]
Dlookahead_matcher.hpp58 BidiIter const tmp = state.cur_; in match_()
68 state.cur_ = tmp; in match_()
82 state.cur_ = tmp; in match_()
89 BOOST_ASSERT(state.cur_ == tmp); in match_()
96 BidiIter const tmp = state.cur_; in match_()
111 state.cur_ = tmp; in match_()
130 state.cur_ = tmp; in match_()
140 BOOST_ASSERT(state.cur_ == tmp); in match_()
Dlogical_newline_matcher.hpp48 char_type ch = *state.cur_; in match()
51 ++state.cur_; in match()
52 if(this->cr_ == ch && !state.eos() && this->nl_ == *state.cur_) in match()
54 ++state.cur_; in match()
59 --state.cur_; in match()
66 --state.cur_; in match()
Dmark_matcher.hpp54 BidiIter const tmp = state.cur_; in match()
55 for(BidiIter begin = br.first, end = br.second; begin != end; ++begin, ++state.cur_) in match()
58 || detail::translate(*state.cur_, traits_cast<Traits>(state), icase_type()) in match()
61 state.cur_ = tmp; in match()
71 state.cur_ = tmp; in match()
Dstring_matcher.hpp61 BidiIter const tmp = state.cur_; in match()
63 for(; begin != this->end_; ++begin, ++state.cur_) in match()
66 … (detail::translate(*state.cur_, traits_cast<Traits>(state), icase_type()) != *begin)) in match()
68 state.cur_ = tmp; in match()
78 state.cur_ = tmp; in match()
Dkeeper_matcher.hpp48 BidiIter const tmp = state.cur_; in match_()
60 state.cur_ = tmp; in match_()
67 BidiIter const tmp = state.cur_; in match_()
86 state.cur_ = tmp; in match_()
Dcharset_matcher.hpp47 … if(state.eos() || !this->charset_.test(*state.cur_, traits_cast<Traits>(state), icase_type())) in match()
52 ++state.cur_; in match()
58 --state.cur_; in match()
Dposix_charset_matcher.hpp52 *state.cur_, this->mask_)) in match()
57 ++state.cur_; in match()
63 --state.cur_; in match()
Dliteral_matcher.hpp48 … (detail::translate(*state.cur_, traits_cast<Traits>(state), icase_type()) == this->ch_)) in match()
53 ++state.cur_; in match()
59 --state.cur_; in match()
/third_party/boost/boost/xpressive/detail/core/
Dfinder.hpp47 state.cur_ = this->bm_.find(state.cur_, state.end_, tr); in operator ()()
48 return state.cur_ != state.end_; in operator ()()
75 state.cur_ = (this->bset_.icase() in operator ()()
76 ? this->find_(state.cur_, state.end_, tr, mpl::true_()) in operator ()()
77 : this->find_(state.cur_, state.end_, tr, mpl::false_())); in operator ()()
78 return state.cur_ != state.end_; in operator ()()
120 BidiIter cur = state.cur_; in operator ()()
128 state.cur_ = ++cur; in operator ()()
170 BidiIter cur = state.cur_; in operator ()()
178 state.cur_ = ++cur; in operator ()()
[all …]
/third_party/flutter/skia/third_party/externals/libwebp/src/utils/
Dbit_writer_utils.c210 const size_t current_size = bw->cur_ - bw->buf_; in VP8LBitWriterResize()
232 bw->cur_ = bw->buf_ + current_size; in VP8LBitWriterResize()
244 const size_t current_size = src->cur_ - src->buf_; in VP8LBitWriterClone()
245 assert(src->cur_ >= src->buf_ && src->cur_ <= src->end_); in VP8LBitWriterClone()
251 dst->cur_ = dst->buf_ + current_size; in VP8LBitWriterClone()
266 bw->cur_ = bw->buf_ + (bw_init->cur_ - bw_init->buf_); in VP8LBitWriterReset()
267 assert(bw->cur_ <= bw->end_); in VP8LBitWriterReset()
279 if (bw->cur_ + VP8L_WRITER_BYTES > bw->end_) { in VP8LPutBitsFlushBits()
283 bw->cur_ = bw->buf_; in VP8LPutBitsFlushBits()
288 *(vp8l_wtype_t*)bw->cur_ = (vp8l_wtype_t)WSWAP((vp8l_wtype_t)bw->bits_); in VP8LPutBitsFlushBits()
[all …]
/third_party/skia/third_party/externals/libwebp/src/utils/
Dbit_writer_utils.c210 const size_t current_size = bw->cur_ - bw->buf_; in VP8LBitWriterResize()
232 bw->cur_ = bw->buf_ + current_size; in VP8LBitWriterResize()
244 const size_t current_size = src->cur_ - src->buf_; in VP8LBitWriterClone()
245 assert(src->cur_ >= src->buf_ && src->cur_ <= src->end_); in VP8LBitWriterClone()
251 dst->cur_ = dst->buf_ + current_size; in VP8LBitWriterClone()
266 bw->cur_ = bw->buf_ + (bw_init->cur_ - bw_init->buf_); in VP8LBitWriterReset()
267 assert(bw->cur_ <= bw->end_); in VP8LBitWriterReset()
279 if (bw->cur_ + VP8L_WRITER_BYTES > bw->end_) { in VP8LPutBitsFlushBits()
283 bw->cur_ = bw->buf_; in VP8LPutBitsFlushBits()
288 *(vp8l_wtype_t*)bw->cur_ = (vp8l_wtype_t)WSWAP((vp8l_wtype_t)bw->bits_); in VP8LPutBitsFlushBits()
[all …]
/third_party/boost/boost/format/
Dexceptions.hpp54 std::size_t cur_, expected_; member in boost::io::too_few_args
57 : cur_(cur), expected_(expected) {} in too_few_args()
58 std::size_t get_cur() const { return cur_; } in get_cur()
68 std::size_t cur_, expected_; member in boost::io::too_many_args
71 : cur_(cur), expected_(expected) {} in too_many_args()
72 std::size_t get_cur() const { return cur_; } in get_cur()
/third_party/gn/src/gn/
Dtokenizer.cc103 size_t token_begin = cur_; in Run()
107 size_t token_end = cur_; in Run()
253 char following_char = CanIncrement() ? input_[cur_ + 1] : '\0'; in ClassifyCurrent()
302 if (CanIncrement() && CouldBeTwoCharOperatorEnd(input_[cur_ + 1])) in AdvanceToEndOfToken()
353 char c = input_[cur_]; in IsCurrentWhitespace()
368 for (int i = static_cast<int>(cur_) - 1; i >= 0 && input_[i] == '\\'; i--) in IsCurrentStringTerminator()
377 return IsNewline(input_, cur_); in IsCurrentNewline()
381 DCHECK(cur_ < input_.size()); in Advance()
388 cur_++; in Advance()
405 } else if (cur_char() == '/' && cur_ + 1 < input_.size() && in GetErrorForInvalidToken()
[all …]
Dtokenizer.h76 bool CanIncrement() const { return cur_ < input_.size() - 1; } in CanIncrement()
88 bool at_end() const { return cur_ == input_.size(); } in at_end()
89 char cur_char() const { return input_[cur_]; } in cur_char()
99 size_t cur_ = 0; // Byte offset into input buffer. variable
/third_party/skia/third_party/externals/spirv-tools/source/opt/
Diterator.h186 : cur_(iteration_range.begin()), in FilterIterator()
207 reference operator*() const { return *cur_; }
208 pointer operator->() { return &*cur_; }
211 return cur_ == rhs.cur_ && end_ == rhs.end_;
218 SubIterator Get() const { return cur_; } in Get()
226 bool IsPredicateSatisfied() { return cur_ == end_ || predicate_(*cur_); } in IsPredicateSatisfied()
229 if (cur_ == end_) return; in MoveToNextPosition()
232 ++cur_; in MoveToNextPosition()
236 SubIterator cur_; variable
/third_party/spirv-tools/source/opt/
Diterator.h186 : cur_(iteration_range.begin()), in FilterIterator()
207 reference operator*() const { return *cur_; }
208 pointer operator->() { return &*cur_; }
211 return cur_ == rhs.cur_ && end_ == rhs.end_;
218 SubIterator Get() const { return cur_; } in Get()
226 bool IsPredicateSatisfied() { return cur_ == end_ || predicate_(*cur_); } in IsPredicateSatisfied()
229 if (cur_ == end_) return; in MoveToNextPosition()
232 ++cur_; in MoveToNextPosition()
236 SubIterator cur_; variable
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
Diterator.h186 : cur_(iteration_range.begin()), in FilterIterator()
207 reference operator*() const { return *cur_; }
208 pointer operator->() { return &*cur_; }
211 return cur_ == rhs.cur_ && end_ == rhs.end_;
218 SubIterator Get() const { return cur_; } in Get()
226 bool IsPredicateSatisfied() { return cur_ == end_ || predicate_(*cur_); } in IsPredicateSatisfied()
229 if (cur_ == end_) return; in MoveToNextPosition()
232 ++cur_; in MoveToNextPosition()
236 SubIterator cur_; variable
/third_party/boost/boost/iostreams/detail/adapter/
Drange_adapter.hpp69 iterator first_, cur_, last_; member in boost::iostreams::detail::range_adapter
76 : first_(rng.begin()), cur_(rng.begin()), last_(rng.end()) { } in range_adapter()
80 : first_(first), cur_(first), last_(last) { } in range_adapter()
85 { return impl::read(cur_, last_, s, n); } in read()
90 { return impl::write(cur_, last_, s, n); } in write()
97 impl::seek(first_, cur_, last_, off, way); in seek()
98 return offset_to_position(cur_ - first_); in seek()
/third_party/protobuf/src/google/protobuf/io/
Dcoded_stream.h1061 cur_ = impl_.FlushAndResetBuffer(cur_); in HadError()
1062 GOOGLE_DCHECK(cur_); in HadError()
1071 void Trim() { cur_ = impl_.Trim(cur_); } in Trim()
1079 bool Skip(int count) { return impl_.Skip(count, &cur_); } in Skip()
1090 return impl_.GetDirectBufferPointer(data, size, &cur_); in GetDirectBufferPointer()
1101 return impl_.GetDirectBufferForNBytesAndAdvance(size, &cur_); in GetDirectBufferForNBytesAndAdvance()
1106 cur_ = impl_.WriteRaw(buffer, size, cur_); in WriteRaw()
1129 cur_ = impl_.EnsureSpace(cur_); in WriteLittleEndian32()
1136 cur_ = impl_.EnsureSpace(cur_); in WriteLittleEndian64()
1190 return static_cast<int>(impl_.ByteCount(cur_) - start_count_); in ByteCount()
[all …]
/third_party/boost/boost/xpressive/
Dregex_iterator.hpp53 this->state_.cur_ = cur; in regex_iterator_impl()
68 this->state_.cur_ = this->state_.next_search_ = this->what_[0].second; in next()
78 && this->state_.cur_ == that.state_.cur_ in equal_to()
233 , that->state_.cur_ in fork_()

123