| /third_party/boost/boost/asio/ip/ |
| D | basic_resolver_iterator.hpp | 72 : index_(0) in basic_resolver_iterator()
79 index_(other.index_) in basic_resolver_iterator()
87 index_(other.index_) in basic_resolver_iterator()
89 other.index_ = 0; in basic_resolver_iterator()
97 index_ = other.index_; in operator =()
108 index_ = other.index_; in operator =()
109 other.index_ = 0; in operator =()
160 if (++index_ == values_->size()) in increment()
164 index_ = 0; in increment()
174 return index_ == other.index_; in equal()
[all …]
|
| /third_party/boost/boost/mpl/vector/aux_/ |
| D | item.hpp | 36 typedef typename Base::upper_bound_ index_; typedef
37 typedef typename next<index_>::type upper_bound_;
44 static aux::type_wrapper<T> item_(index_);
55 typedef typename prior<typename Base::lower_bound_>::type index_; typedef
56 typedef index_ lower_bound_;
61 static aux::type_wrapper<T> item_(index_);
73 typedef typename prior<typename Base::upper_bound_>::type index_; typedef
74 typedef index_ upper_bound_;
79 static aux::type_wrapper<void_> item_(index_);
89 typedef typename Base::lower_bound_ index_; typedef
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_ring_reader.h | 41 CordRepRing::index_type index() const { return index_; } in index()
45 CordRep* node() const { return ring_->entry_child(index_); } in node()
61 return ring_->entry_end_offset(index_); in consumed()
79 index_ = ring_->head(); in Reset()
80 return ring_->entry_data(index_); in Reset()
88 index_ = ring_->advance(index_); in Next()
89 return ring_->entry_data(index_); in Next()
100 size_t current = ring_->entry_end_offset(index_); in Seek()
101 CordRepRing::index_type hint = (offset >= current) ? index_ : ring_->head(); in Seek()
103 index_ = head.index; in Seek()
[all …]
|
| D | cord_rep_btree_navigator.h | 146 uint8_t index_[CordRepBtree::kMaxHeight]; variable
159 return node_[0]->Edge(index_[0]); in Current()
179 index_[height] = static_cast<uint8_t>(index); in Init()
184 index_[height] = static_cast<uint8_t>(index); in Init()
196 index_[height] = static_cast<uint8_t>(index.index); in Seek()
201 index_[height] = static_cast<uint8_t>(index.index); in Seek()
217 return index_[0] == edge->back() ? NextUp() : edge->Edge(++index_[0]); in Next()
222 return index_[0] == edge->begin() ? PreviousUp() : edge->Edge(--index_[0]); in Previous()
226 assert(index_[0] == node_[0]->back()); in NextUp()
233 index = index_[height] + 1; in NextUp()
[all …]
|
| D | cord_rep_btree_navigator.cc | 68 size_t index = index_[0]; in Skip()
82 index = index_[height]; in Skip()
91 index_[height] = index; in Skip()
102 index_[0] = index; in Skip()
109 size_t index = index_[0]; in Read()
127 index_[height] = index; in Read()
140 index = index_[height]; in Read()
155 index_[height] = index; in Read()
179 index_[0] = index; in Read()
|
| /third_party/glib/glib/ |
| D | garray.c | 611 guint index_, in g_array_insert_vals() argument
624 if (index_ >= array->len) in g_array_insert_vals()
626 g_array_maybe_expand (array, index_ - array->len + len); in g_array_insert_vals()
627 return g_array_append_vals (g_array_set_size (farray, index_), data, len); in g_array_insert_vals()
632 memmove (g_array_elt_pos (array, len + index_), in g_array_insert_vals()
633 g_array_elt_pos (array, index_), in g_array_insert_vals()
634 g_array_elt_len (array, array->len - index_)); in g_array_insert_vals()
636 memcpy (g_array_elt_pos (array, index_), data, g_array_elt_len (array, len)); in g_array_insert_vals()
692 guint index_) in g_array_remove_index() argument
698 g_return_val_if_fail (index_ < array->len, NULL); in g_array_remove_index()
[all …]
|
| D | garray.h | 102 guint index_,
110 guint index_);
113 guint index_);
116 guint index_,
138 #define g_ptr_array_index(array,index_) ((array)->pdata)[index_] argument
170 guint index_);
173 guint index_);
176 guint index_);
179 guint index_);
188 guint index_,
[all …]
|
| D | gbsearcharray.h | 74 guint index_);
196 guint index_) in g_bsearch_array_grow() argument
202 g_return_val_if_fail (index_ <= barray->n_nodes, NULL); in g_bsearch_array_grow()
213 node = G_BSEARCH_ARRAY_NODES (barray) + index_ * bconfig->sizeof_node; in g_bsearch_array_grow()
214 memmove (node + bconfig->sizeof_node, node, (barray->n_nodes - index_) * bconfig->sizeof_node); in g_bsearch_array_grow()
235 guint index_ = g_bsearch_array_get_index (barray, bconfig, node); in g_bsearch_array_insert() local
238 barray = g_bsearch_array_grow (barray, bconfig, index_); in g_bsearch_array_insert()
239 node = G_BSEARCH_ARRAY_NODES (barray) + index_ * bconfig->sizeof_node; in g_bsearch_array_insert()
262 guint index_) in g_bsearch_array_remove() argument
266 g_return_val_if_fail (index_ < barray->n_nodes, NULL); in g_bsearch_array_remove()
[all …]
|
| /third_party/gn/src/base/containers/ |
| D | circular_deque.h | 139 circular_deque_const_iterator() : parent_deque_(nullptr), index_(0) { in circular_deque_const_iterator()
148 parent_deque_->CheckValidIndex(index_);
149 return parent_deque_->buffer_[index_];
153 parent_deque_->CheckValidIndex(index_);
154 return &parent_deque_->buffer_[index_];
212 return lhs.index_ == rhs.index_;
241 : parent_deque_(parent), index_(index) { in circular_deque_const_iterator()
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()
[all …]
|
| /third_party/flutter/skia/third_party/externals/angle2/src/common/third_party/base/anglebase/containers/ |
| D | mru_cache.h | 97 typename KeyIndex::iterator index_iter = index_.find(key); in Put()
98 if (index_iter != index_.end()) in Put()
112 index_.emplace(key, ordering_.begin()); in Put()
121 typename KeyIndex::iterator index_iter = index_.find(key); in Get()
122 if (index_iter == index_.end()) in Get()
135 typename KeyIndex::const_iterator index_iter = index_.find(key); in Peek()
136 if (index_iter == index_.end()) in Peek()
143 typename KeyIndex::const_iterator index_iter = index_.find(key); in Peek()
144 if (index_iter == index_.end()) in Peek()
153 index_.swap(other.index_); in Swap()
[all …]
|
| /third_party/skia/third_party/externals/angle2/src/common/third_party/base/anglebase/containers/ |
| D | mru_cache.h | 97 typename KeyIndex::iterator index_iter = index_.find(key); in Put()
98 if (index_iter != index_.end()) in Put()
112 index_.emplace(key, ordering_.begin()); in Put()
121 typename KeyIndex::iterator index_iter = index_.find(key); in Get()
122 if (index_iter == index_.end()) in Get()
135 typename KeyIndex::const_iterator index_iter = index_.find(key); in Peek()
136 if (index_iter == index_.end()) in Peek()
143 typename KeyIndex::const_iterator index_iter = index_.find(key); in Peek()
144 if (index_iter == index_.end()) in Peek()
153 index_.swap(other.index_); in Swap()
[all …]
|
| /third_party/boost/boost/spirit/home/support/detail/lexer/ |
| D | generate_cpp.hpp | 148 const std::size_t index_ = i_ * 8; in generate_cpp() local
150 os_ << lookup_[index_]; in generate_cpp()
154 os_ << ", " << lookup_[index_ + j_]; in generate_cpp()
173 const std::size_t index_ = i_ * 8; in generate_cpp() local
175 os_ << dfa_[index_]; in generate_cpp()
179 os_ << ", " << dfa_[index_ + j_]; in generate_cpp()
192 const std::size_t index_ = count_ * 8; in generate_cpp() local
199 os_ << dfa_[index_]; in generate_cpp()
203 os_ << ", " << dfa_[index_ + j_]; in generate_cpp()
257 const std::size_t index_ = i_ * 8; in generate_cpp() local
[all …]
|
| D | generator.hpp | 37 std::size_t index_ = 0; in build() local
47 for (; index_ < size_; ++index_) in build()
56 for (index_ = 0, size_ = internals_._lookup->size (); in build()
57 index_ < size_; ++index_) in build()
59 internals_._lookup[index_]->resize (sizeof (CharT) == 1 ? in build()
62 if (!rules_.regexes ()[index_].empty ()) in build()
67 detail::node *root_ = build_tree (rules_, index_, in build()
71 internals_._dfa_alphabet[index_], in build()
72 *internals_._dfa[index_]); in build()
251 std::size_t index_ = 0; in build_tree() local
[all …]
|
| /third_party/grpc/src/cpp/common/ |
| D | auth_property_iterator.cc | 26 : property_(nullptr), ctx_(nullptr), index_(0), name_(nullptr) {} in AuthPropertyIterator()
32 index_(iter->index), in AuthPropertyIterator()
38 grpc_auth_property_iterator iter = {ctx_, index_, name_}; in operator ++()
41 index_ = iter.index; in operator ++()
56 return index_ == rhs.index_; in operator ==()
|
| /third_party/boost/libs/contract/example/features/ |
| D | move.cpp | 80 index_(start)
126 unsigned i = index_++; in read()
127 if(index_ == data_.size()) index_ = 0; // Circular. in read()
134 index_ = other.index_; in copy()
141 index_ = std::move(other.index_); in move()
148 unsigned index_; member in circular_buffer
153 return index_; in index()
|
| /third_party/boost/libs/parameter/test/ |
| D | mpl.cpp | 106 , Index const& index_ in f()
111 test::f_parameters()(t, name_, value_, index_) in f()
146 typedef test::tag::index index_; in run() typedef
150 boost::mp11::mp_list<tester_,name_,value_,index_> in run()
153 boost::mp11::mp_list<tester_,name_,index_> in run()
156 boost::mp11::mp_list<tester_,name_,index_> in run()
164 test::f<boost::mpl::list4<tester_,name_,value_,index_> >(1, 2, 3, 4); in run()
166 boost::mpl::list3<tester_,name_,index_> in run()
169 boost::mpl::list3<tester_,name_,index_> in run()
|
| /third_party/gn/src/base/json/ |
| D | json_parser.cc | 59 index_(0), in JSONParser()
73 index_ = 0; in Parse()
167 if (static_cast<size_t>(index_) + count > input_.length()) in PeekChars()
171 return std::string_view(input_.data() + index_, count); in PeekChars()
184 index_ += count; in ConsumeChars()
196 CHECK_LE(static_cast<size_t>(index_), input_.length()); in pos()
197 return input_.data() + index_; in pos()
250 index_last_line_ = index_; in EatWhitespaceAndComments()
252 if (!(c == '\n' && index_ > 0 && input_[index_ - 1] == '\r')) { in EatWhitespaceAndComments()
455 static_cast<int32_t>(input_.length()), &index_, in ConsumeStringRaw()
[all …]
|
| /third_party/boost/boost/fusion/container/map/detail/ |
| D | map_impl.hpp | 29 template <int index_>
30 struct map_impl<index_>
33 static int const index = index_;
57 template <int index_, typename Pair, typename ...T>
58 struct map_impl<index_, Pair, T...> : map_impl<index_ + 1, T...>
61 typedef map_impl<index_+1, T...> rest_type;
67 static int const index = index_;
|
| /third_party/grpc/src/core/lib/channel/ |
| D | handshaker.cc | 113 if (!is_shutdown_ && index_ > 0) { in Shutdown()
115 handshakers_[index_ - 1]->Shutdown(GRPC_ERROR_REF(why)); in Shutdown()
129 this, grpc_error_string(error), is_shutdown_, index_, in CallNextHandshakerLocked()
132 GPR_ASSERT(index_ <= handshakers_.size()); in CallNextHandshakerLocked()
137 index_ == handshakers_.size()) { in CallNextHandshakerLocked()
170 auto handshaker = handshakers_[index_]; in CallNextHandshakerLocked()
175 this, handshaker->name(), handshaker.get(), index_); in CallNextHandshakerLocked()
179 ++index_; in CallNextHandshakerLocked()
215 GPR_ASSERT(index_ == 0); in DoHandshake()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/reduce/ |
| D | reduction_pass.cpp | 47 if (index_ >= opportunities.size()) { in TryApplyReduction()
52 index_ = 0; in TryApplyReduction()
57 for (uint32_t i = index_; in TryApplyReduction()
58 i < std::min(index_ + granularity_, (uint32_t)opportunities.size()); in TryApplyReduction()
81 index_ += granularity_; in NotifyInteresting()
|
| /third_party/skia/third_party/externals/spirv-tools/source/reduce/ |
| D | reduction_pass.cpp | 47 if (index_ >= opportunities.size()) { in TryApplyReduction()
52 index_ = 0; in TryApplyReduction()
57 for (uint32_t i = index_; in TryApplyReduction()
58 i < std::min(index_ + granularity_, (uint32_t)opportunities.size()); in TryApplyReduction()
81 index_ += granularity_; in NotifyInteresting()
|
| /third_party/node/src/ |
| D | aliased_buffer.h | 113 : aliased_buffer_(aliased_buffer), index_(index) {} in Reference()
117 index_(that.index_) { in Reference()
121 aliased_buffer_->SetValue(index_, val);
130 return aliased_buffer_->GetValue(index_); in NativeT()
134 const NativeT current = aliased_buffer_->GetValue(index_);
135 aliased_buffer_->SetValue(index_, current + val);
144 const NativeT current = aliased_buffer_->GetValue(index_);
145 aliased_buffer_->SetValue(index_, current - val);
151 size_t index_; variable
|
| /third_party/boost/boost/spirit/home/support/detail/lexer/containers/ |
| D | ptr_vector.hpp | 53 Type * &operator [] (const std::size_t index_) in operator []() argument
55 return _vector[index_]; in operator []()
58 Type * const &operator [] (const std::size_t index_) const in operator []()
60 return _vector[index_]; in operator []()
|
| /third_party/boost/boost/spirit/home/lex/lexer/lexertl/ |
| D | generate_static.hpp | 208 std::size_t const index_ = i_ * 8; in generate_function_body_dfa() local
209 os_ << lookup_[index_]; in generate_function_body_dfa()
212 os_ << ", " << lookup_[index_ + j_]; in generate_function_body_dfa()
228 std::size_t const index_ = i_ * 8; in generate_function_body_dfa() local
229 os_ << dfa_[index_]; in generate_function_body_dfa()
232 os_ << ", " << dfa_[index_ + j_]; in generate_function_body_dfa()
243 std::size_t const index_ = count_ * 8; in generate_function_body_dfa() local
248 os_ << dfa_[index_]; in generate_function_body_dfa()
251 os_ << ", " << dfa_[index_ + j_]; in generate_function_body_dfa()
298 const std::size_t index_ = i_ * 8; in generate_function_body_dfa() local
[all …]
|
| /third_party/boost/boost/beast/websocket/detail/ |
| D | service.ipp | 26 index_ = svc_.v_.size();
37 other.index_ = index_;
38 svc_.v_[index_] = &other;
|