| /third_party/boost/libs/algorithm/test/ |
| D | iterator_test.hpp | 33 BOOST_CXX14_CONSTEXPR It base() const {return it_;} in base()
35 BOOST_CXX14_CONSTEXPR input_iterator() : it_() {} in input_iterator()
36 BOOST_CXX14_CONSTEXPR explicit input_iterator(It it) : it_(it) {} in input_iterator()
39 BOOST_CXX14_CONSTEXPR input_iterator(const input_iterator<U>& u) :it_(u.it_) {} in input_iterator()
41 BOOST_CXX14_CONSTEXPR reference operator*() const {return *it_;} in operator *()
42 BOOST_CXX14_CONSTEXPR pointer operator->() const {return it_;} in operator ->()
44 BOOST_CXX14_CONSTEXPR input_iterator& operator++() {++it_; return *this;} in operator ++()
48 {return x.it_ == y.it_;} in operator ==()
53 It it_; member in input_iterator
82 BOOST_CXX14_CONSTEXPR It base() const {return it_;} in base()
[all …]
|
| /third_party/boost/boost/numeric/ublas/ |
| D | vector.hpp | 533 container_const_reference<self_type> (), it_ () {} in const_iterator()
536 container_const_reference<self_type> (v), it_ (it) {} in const_iterator()
539 container_const_reference<self_type> (it ()), it_ (it.it_) {} in const_iterator()
549 ++ it_; in operator ++()
557 -- it_; in operator --()
565 it_ += n; in operator +=()
573 it_ -= n; in operator -=()
581 return it_ - it.it_; in operator -()
589 … BOOST_UBLAS_CHECK (it_ >= (*this) ().begin ().it_ && it_ < (*this) ().end ().it_, bad_index ()); in operator *()
590 return *it_; in operator *()
[all …]
|
| D | matrix.hpp | 500 container_const_reference<self_type> (), it_ () {} in const_iterator1()
503 container_const_reference<self_type> (m), it_ (it) {} in const_iterator1()
506 container_const_reference<self_type> (it ()), it_ (it.it_) {} in const_iterator1()
511 layout_type::increment_i (it_, (*this) ().size1 (), (*this) ().size2 ()); in operator ++()
516 layout_type::decrement_i (it_, (*this) ().size1 (), (*this) ().size2 ()); in operator --()
521 layout_type::increment_i (it_, n, (*this) ().size1 (), (*this) ().size2 ()); in operator +=()
526 layout_type::decrement_i (it_, n, (*this) ().size1 (), (*this) ().size2 ()); in operator -=()
532 … return layout_type::distance_i (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ()); in operator -()
540 return *it_; in operator *()
612 return layout_type::index_i (it_ - m.begin1 ().it_, m.size1 (), m.size2 ()); in index1()
[all …]
|
| D | vector_proxy.hpp | 276 container_const_reference<self_type> (), it_ () {} in const_iterator()
279 container_const_reference<self_type> (vr), it_ (it) {} in const_iterator()
282 container_const_reference<self_type> (it ()), it_ (it.it_) {} in const_iterator()
287 ++ it_; in operator ++()
292 -- it_; in operator --()
297 it_ += n; in operator +=()
302 it_ -= n; in operator -=()
308 return it_ - it.it_; in operator -()
315 return *it_; in operator *()
325 return it_.index () - (*this) ().start (); in index()
[all …]
|
| D | vector_of_vector.hpp | 524 container_const_reference<self_type> (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} in const_iterator1()
527 … container_const_reference<self_type> (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} in const_iterator1()
530 …rence<self_type> (it ()), rank_ (it.rank_), i_ (it.i_), j_ (it.j_), itv_ (it.itv_), it_ (it.it_) {} in const_iterator1()
536 ++ it_; in operator ++()
543 it_ = (*itv_).begin (); in operator ++()
544 if (it_ == (*itv_).end () || index2 () != j_) in operator ++()
553 -- it_; in operator --()
560 it_ = (*itv_).begin (); in operator --()
561 if (it_ == (*itv_).end () || index2 () != j_) in operator --()
574 return *it_; in operator *()
[all …]
|
| D | matrix_sparse.hpp | 694 container_const_reference<self_type> (), rank_ (), i_ (), j_ (), it_ () {} in const_iterator1()
697 container_const_reference<self_type> (m), rank_ (rank), i_ (i), j_ (j), it_ (it) {} in const_iterator1()
700 …ainer_const_reference<self_type> (it ()), rank_ (it.rank_), i_ (it.i_), j_ (it.j_), it_ (it.it_) {} in const_iterator1()
706 ++ it_; in operator ++()
714 -- it_; in operator --()
726 return (*it_).second; in operator *()
799 …BOOST_UBLAS_CHECK (layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 … in index1()
800 return layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()); in index1()
809 …BOOST_UBLAS_CHECK (layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 … in index2()
810 return layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()); in index2()
[all …]
|
| /third_party/boost/libs/beast/include/boost/beast/http/impl/ |
| D | rfc7230.ipp | 76 it_ = last_;
79 auto need_comma = it_ != first_;
81 first_ = it_;
84 detail::skip_ows(it_, last_);
85 if(it_ == last_)
87 auto const c = *it_;
92 auto const p0 = it_;
95 ++it_;
96 if(it_ == last_)
98 if(! detail::is_token_char(*it_))
[all …]
|
| /third_party/boost/boost/beast/http/impl/ |
| D | rfc7230.ipp | 76 it_ = last_;
79 auto need_comma = it_ != first_;
81 first_ = it_;
84 detail::skip_ows(it_, last_);
85 if(it_ == last_)
87 auto const c = *it_;
92 auto const p0 = it_;
95 ++it_;
96 if(it_ == last_)
98 if(! detail::is_token_char(*it_))
[all …]
|
| /third_party/skia/third_party/externals/tint/src/ |
| D | block_allocator.h | 55 bool operator==(const Iterator& other) const { return it_ == other.it_; }
59 bool operator!=(const Iterator& other) const { return it_ != other.it_; }
63 ++it_;
67 T* operator*() const { return it_->get(); }
71 explicit Iterator(InternalIterator it) : it_(it) {} in Iterator()
72 InternalIterator it_; variable
82 return it_ == other.it_;
88 return it_ != other.it_;
93 ++it_;
97 T* operator*() const { return it_->get(); }
[all …]
|
| /third_party/boost/boost/icl/ |
| D | interval_map.hpp | 105 ICL_const_FORALL(typename base_map_type, it_, src) in assign()
106 prior_ = this->add(prior_, *it_); in assign()
154 iterator handle_inserted(iterator it_) in handle_inserted() argument
156 return segmental::join_neighbours(*this, it_); in handle_inserted()
159 void handle_inserted(iterator prior_, iterator it_) in handle_inserted() argument
161 if(prior_ != this->_map.end() && segmental::joinable(*this, prior_, it_)) in handle_inserted()
162 segmental::join_on_right(*this, prior_, it_); in handle_inserted()
166 void handle_left_combined(iterator it_) in handle_left_combined() argument
168 if(on_absorbtion<type,Combiner,Traits::absorbs_identities>::is_absorbable((*it_).second)) in handle_left_combined()
169 this->_map.erase(it_); in handle_left_combined()
[all …]
|
| D | interval_base_map.hpp | 298 const_iterator it_ = icl::find(*this, key_value); in operator ()() local
299 return it_==end() ? identity_element<codomain_type>::value() in operator ()()
300 : (*it_).second; in operator ()()
492 void add_segment(const interval_type& inter_val, const CodomainT& co_val, iterator& it_);
496 iterator& it_, const iterator& last_);
499 void add_rear(const interval_type& inter_val, const CodomainT& co_val, iterator& it_);
507 void subtract_main(const CodomainT& co_val, iterator& it_, const iterator& last_);
510 void subtract_rear(interval_type& inter_val, const CodomainT& co_val, iterator& it_);
533 for(const_iterator it_=exterior.first; it_ != exterior.second; it_++) in partial_add_intersection() local
535 interval_type common_interval = (*it_).first & inter_val; in partial_add_intersection()
[all …]
|
| D | split_interval_map.hpp | 135 iterator handle_inserted(iterator it_)const { return it_; } in handle_inserted()
139 void handle_left_combined(iterator it_) in handle_left_combined() argument
141 if(on_absorbtion<type,Combiner,Traits::absorbs_identities>::is_absorbable((*it_).second)) in handle_left_combined()
142 this->_map.erase(it_); in handle_left_combined()
146 void handle_combined(iterator it_) in handle_combined() argument
148 if(on_absorbtion<type,Combiner,Traits::absorbs_identities>::is_absorbable((*it_).second)) in handle_combined()
149 this->_map.erase(it_); in handle_combined()
153 void handle_preceeded_combined(iterator prior_, iterator& it_) in handle_preceeded_combined() argument
155 if(on_absorbtion<type,Combiner,Traits::absorbs_identities>::is_absorbable((*it_).second)) in handle_preceeded_combined()
157 this->_map.erase(it_); in handle_preceeded_combined()
[all …]
|
| /third_party/boost/boost/icl/detail/ |
| D | interval_set_algo.hpp | 80 typename IntervalContainerT::const_iterator it_ = first, next_ = first; in is_joinable() local
83 while(next_ != container.end() && it_ != past) in is_joinable()
84 if(!icl::touches(key_value<IntervalContainerT>(it_++), in is_joinable()
209 typename IntervalContainerT::const_iterator it_ = first, next_ = first; in is_dense() local
212 while(next_ != container.end() && it_ != past) in is_dense()
213 if(!icl::touches(key_value<IntervalContainerT>(it_++), in is_dense()
274 typename Type::iterator join_left(Type& object, typename Type::iterator& it_) in join_left() argument
278 if(it_ == object.begin()) in join_left()
279 return it_; in join_left()
282 iterator pred_ = it_; in join_left()
[all …]
|
| /third_party/libphonenumber/cpp/src/phonenumbers/utf/ |
| D | unicodetext.cc | 53 return CodepointDistance(first.it_, last.it_); in distance()
208 repr_.append(first.it_, static_cast<int>(last.it_ - first.it_)); in UnicodeText()
214 return string(first.it_, last.it_ - first.it_); in UTF8Substring()
311 repr_.append(first.it_, static_cast<int>(last.it_ - first.it_)); in append()
417 UnicodeText::const_iterator::const_iterator() : it_(0) {} in const_iterator()
420 : it_(other.it_) { in const_iterator()
426 it_ = other.it_; in operator =()
440 return lhs.it_ < rhs.it_; in operator <()
450 uint8 byte1 = static_cast<uint8>(it_[0]); in operator *()
454 uint8 byte2 = static_cast<uint8>(it_[1]); in operator *()
[all …]
|
| /third_party/boost/boost/icl/concept/ |
| D | interval_map.hpp | 46 const_iterator it_ = icl::find(super, key_value_pair.key); in contains() local
47 return it_ != super.end() && (*it_).second == key_value_pair.data; in contains()
358 const_iterator it_ = common_lwb; in add_intersection() local
359 while(it_ != common_upb) in add_intersection()
360 add_intersection(section, object, *it_++); in add_intersection()
375 const_iterator it_ = icl::find(object, key_value); in add_intersection() local
376 if(it_ != object.end()) in add_intersection()
377 add(section, segment_type(interval_type(key_value),(*it_).second)); in add_intersection()
399 for(const_iterator it_=exterior.first; it_ != exterior.second; it_++) in add_intersection() local
401 interval_type common_interval = (*it_).first & inter_val; in add_intersection()
[all …]
|
| D | interval_set.hpp | 201 for(const_iterator it_=exterior.first; it_ != exterior.second; it_++) in add_intersection() local
203 interval_type common_interval = key_value<Type>(it_) & segment; in add_intersection()
242 const_iterator it_ = fst_; in flip() local
243 while(it_ != end_) in flip()
245 covered = *it_++; in flip()
279 const_iterator it_ = operand.begin(); in flip() local
282 while(it_ != common_lwb) in flip()
283 icl::add(object, *it_++); in flip()
285 while(it_ != common_upb) in flip()
286 icl::flip(object, *it_++); in flip()
[all …]
|
| D | interval_associator_base.hpp | 112 iterator it_ = object.begin(); in join() local
113 if(it_ == object.end()) in join()
116 iterator next_ = it_; next_++; in join()
120 if( segmental::is_joinable<Type>(it_, next_) ) in join()
122 iterator fst_mem = it_; // hold the first member in join()
125 it_++; next_++; in join()
127 && segmental::is_joinable<Type>(it_, next_) ) in join()
128 { it_++; next_++; } in join()
132 const_cast<interval_type&>(key_value<Type>(it_)) in join()
133 = hull(key_value<Type>(it_), key_value<Type>(fst_mem)); in join()
[all …]
|
| /third_party/boost/libs/stl_interfaces/example/ |
| D | filtered_int_iterator.cpp | 22 filtered_int_iterator() : it_(nullptr) {} in filtered_int_iterator()
24 it_(it), in filtered_int_iterator()
31 it_ = std::find_if(it_, last_, pred_); in filtered_int_iterator()
40 it_ = std::find_if(std::next(it_), last_, pred_); in operator ++()
46 int * base() const { return it_; } in base()
58 constexpr int *& base_reference() noexcept { return it_; } in base_reference()
59 constexpr int * base_reference() const noexcept { return it_; } in base_reference()
61 int * it_; member
|
| D | node_iterator.cpp | 32 constexpr node_iterator() noexcept : it_(nullptr) {} in node_iterator()
33 constexpr node_iterator(node<T> * it) noexcept : it_(it) {} in node_iterator()
37 constexpr T & operator*() const noexcept { return it_->value_; } in operator *()
40 it_ = it_->next_; in operator ++()
46 return lhs.it_ == rhs.it_; in operator ==()
57 node<T> * it_; member
|
| D | interoperability.cpp | 31 constexpr random_access_iterator(ValueType * it) noexcept : it_(it) {} in random_access_iterator()
43 it_(other.it_) in random_access_iterator()
46 constexpr ValueType & operator*() const noexcept { return *it_; } in operator *()
49 it_ += i; in operator +=()
54 return it_ - other.it_; in operator -()
58 ValueType * it_; member
|
| /third_party/boost/libs/stl_interfaces/test/ |
| D | input.cpp | 21 basic_input_iter() : it_(nullptr) {} in basic_input_iter()
22 basic_input_iter(int * it) : it_(it) {} in basic_input_iter()
24 int & operator*() const noexcept { return *it_; } in operator *()
27 ++it_; in operator ++()
32 return lhs.it_ == rhs.it_; in operator ==()
40 int * it_; member
60 input_iter() : it_(nullptr) {} in input_iter()
61 input_iter(ValueType * it) : it_(it) {} in input_iter()
66 input_iter(input_iter<ValueType2> it) : it_(it.it_) in input_iter()
69 ValueType & operator*() const noexcept { return *it_; } in operator *()
[all …]
|
| D | bidirectional.cpp | 24 basic_bidirectional_iter() : it_(nullptr) {} in basic_bidirectional_iter()
25 basic_bidirectional_iter(int * it) : it_(it) {} in basic_bidirectional_iter()
27 int & operator*() const { return *it_; } in operator *()
30 ++it_; in operator ++()
35 --it_; in operator --()
41 return lhs.it_ == rhs.it_; in operator ==()
52 int * it_; member
77 basic_adapted_bidirectional_ptr_iter() : it_(nullptr) {} in basic_adapted_bidirectional_ptr_iter()
78 basic_adapted_bidirectional_ptr_iter(int * it) : it_(it) {} in basic_adapted_bidirectional_ptr_iter()
82 int *& base_reference() noexcept { return it_; } in base_reference()
[all …]
|
| /third_party/boost/boost/beast/core/impl/ |
| D | buffers_cat.hpp | 127 buffers_iterator_type<Bn>..., past_end> it_{}; member in boost::beast::buffers_cat_view::const_iterator
198 return *self.it_.template get<I::value>(); in operator ()()
217 ++self.it_.template get<I>(); in operator ()()
225 auto& it = self.it_.template get<I>(); in next()
235 self.it_.template emplace<I+1>( in next()
245 ++self.it_.template get<I>(); in operator ()()
253 auto& it = self.it_.template get<I>(); in next()
264 self.it_.template emplace<I+1>(); in next()
291 auto& it = self.it_.template get<I>(); in operator ()()
310 auto& it = self.it_.template get<I>(); in operator ()()
[all …]
|
| /third_party/boost/libs/beast/include/boost/beast/core/impl/ |
| D | buffers_cat.hpp | 127 buffers_iterator_type<Bn>..., past_end> it_{}; member in boost::beast::buffers_cat_view::const_iterator
198 return *self.it_.template get<I::value>(); in operator ()()
217 ++self.it_.template get<I>(); in operator ()()
225 auto& it = self.it_.template get<I>(); in next()
235 self.it_.template emplace<I+1>( in next()
245 ++self.it_.template get<I>(); in operator ()()
253 auto& it = self.it_.template get<I>(); in next()
264 self.it_.template emplace<I+1>(); in next()
291 auto& it = self.it_.template get<I>(); in operator ()()
310 auto& it = self.it_.template get<I>(); in operator ()()
[all …]
|
| /third_party/boost/boost/stl_interfaces/ |
| D | reverse_iterator.hpp | 76 constexpr reverse_iterator() noexcept(noexcept(BidiIter())) : it_() {} in reverse_iterator()
79 it_(it) in reverse_iterator()
85 reverse_iterator(reverse_iterator<BidiIter2> const & it) : it_(it.it_) in reverse_iterator()
91 lhs.it_, in operator -()
92 rhs.it_, in operator -()
96 rhs.it_,
97 lhs.it_,
105 return *v1_dtl::ce_prev(it_); in operator *()
119 it_,
125 constexpr BidiIter base() const noexcept { return it_; } in base()
[all …]
|