Home
last modified time | relevance | path

Searched refs:_iter (Results 1 – 19 of 19) sorted by relevance

/third_party/boost/boost/graph/
Dmatrix_as_graph.hpp102 matrix_adj_iterator(Iter i) : _iter(i) {} in matrix_adj_iterator()
103 matrix_adj_iterator(const self& x) : _iter(x._iter) {} in matrix_adj_iterator()
106 _iter = x._iter; in operator =()
109 Vertex operator*() { return _iter.column(); } in operator *()
112 ++_iter; in operator ++()
118 ++_iter; in operator ++()
121 bool operator==(const self& x) const { return _iter == x._iter; } in operator ==()
122 bool operator!=(const self& x) const { return _iter != x._iter; } in operator !=()
125 Iter _iter; member in boost::matrix_adj_iterator
139 matrix_incidence_iterator(Iter i) : _iter(i) {} in matrix_incidence_iterator()
[all …]
Dvector_as_graph.hpp124 val_out_edge_iterator(V s, Iter i) : _source(s), _iter(i) {} in val_out_edge_iterator()
125 Edge operator*() const { return Edge(_source, *_iter); } in operator *()
128 ++_iter; in operator ++()
134 ++_iter; in operator ++()
137 bool operator==(const self& x) const { return _iter == x._iter; } in operator ==()
138 bool operator!=(const self& x) const { return _iter != x._iter; } in operator !=()
142 Iter _iter; member in boost::detail::val_out_edge_iterator
Dedge_list.hpp77 edge_iterator(EdgeIter iter) : _iter(iter), _i(0) {} in edge_iterator()
78 E operator*() { return E(_iter, _i); } in operator *()
81 ++_iter; in operator ++()
91 bool operator==(const self& x) { return _iter == x._iter; } in operator ==()
92 bool operator!=(const self& x) { return _iter != x._iter; } in operator !=()
93 EdgeIter _iter; member
Dtopological_sort.hpp37 topo_sort_visitor(OutputIterator _iter) : m_iter(_iter) {} in topo_sort_visitor()
/third_party/boost/boost/icl/
Diterator.hpp32 : _cont(&cont), _iter(iter) {} in add_iterator()
38 _iter = icl::add(*_cont, _iter, value); in operator =()
39 if(_iter != _cont->end()) in operator =()
40 ++_iter; in operator =()
50 typename ContainerT::iterator _iter; member in boost::icl::add_iterator
76 : _cont(&cont), _iter(iter) {} in insert_iterator()
82 _iter = _cont->insert(_iter, value); in operator =()
83 if(_iter != _cont->end()) in operator =()
84 ++_iter; in operator =()
94 typename ContainerT::iterator _iter; member in boost::icl::insert_iterator
/third_party/glib/gio/kqueue/
Ddep-list.c299 dep_list *removed_list##_iter; \
306 removed_list##_iter = *removed_list; \
309 while (removed_list##_iter != NULL) { \
310 dep_list *added_list##_iter = *added_list; \
315 while (added_list##_iter != NULL) { \
322 removed_list##_prev->next = removed_list##_iter->next; \
324 *removed_list = removed_list##_iter->next; \
327 added_list##_prev->next = added_list##_iter->next; \
329 *added_list = added_list##_iter->next; \
331 free (added_list##_iter); \
[all …]
/third_party/boost/libs/type_erasure/example/
Dprint_sequence.cpp52 struct _iter : placeholder {}; struct
94 tuple<requirements, _os&, _iter, _iter> args(os, first, last); in print()
106 forward_iterator<_iter, const _t&>,
107 same_type<_t, forward_iterator<_iter, const _t&>::value_type>
110 typedef boost::type_erasure::any<requirements, _iter> iterator_type;
152 boost::type_erasure::any<requirements, _iter> temp = first; in do_print()
/third_party/pulseaudio/src/modules/
Dmodule-rygel-media-server.c249 DBusMessageIter _iter, variant, array; in append_variant_object_array() local
256 dbus_message_iter_init_append(m, &_iter); in append_variant_object_array()
257 iter = &_iter; in append_variant_object_array()
271 DBusMessageIter _iter, sub; in append_variant_string() local
277 dbus_message_iter_init_append(m, &_iter); in append_variant_string()
278 iter = &_iter; in append_variant_string()
287 DBusMessageIter _iter, sub; in append_variant_object() local
293 dbus_message_iter_init_append(m, &_iter); in append_variant_object()
294 iter = &_iter; in append_variant_object()
303 DBusMessageIter _iter, sub; in append_variant_unsigned() local
[all …]
/third_party/node/test/parallel/
Dtest-repl-autocomplete.js25 const _iter = data[Symbol.iterator]();
27 const next = _iter.next();
Dtest-repl-reverse-search.js24 const _iter = data[Symbol.iterator]();
26 const next = _iter.next();
Dtest-repl-programmatic-history.js26 const _iter = data[Symbol.iterator]();
28 const next = _iter.next();
Dtest-repl-persistent-history.js28 const _iter = data[Symbol.iterator]();
30 const next = _iter.next();
Dtest-repl-history-navigation.js25 const _iter = data[Symbol.iterator]();
27 const next = _iter.next();
/third_party/mindspore/mindspore/lite/minddata/wrapper/
DMDToDApi.cc59 std::shared_ptr<mindspore::dataset::AlbumOp> _iter; member in mindspore::MDToDApi
67 MDToDApi() : _iter(nullptr), _augs({}), _storage_folder(""), _file_id(-1), _hasBatch(false) { in MDToDApi()
167 pMDToDApi->_iter = iter; in MDToDApi_createPipeLine()
261 if (pMDToDApi == nullptr || pMDToDApi->_iter == nullptr) { in MDToDApi_GetNext()
275 bool ret = pMDToDApi->_iter->GetNextRow(&row); in MDToDApi_GetNext()
/third_party/skia/third_party/externals/jinja2/
Dlexer.py328 self._iter = iter(generator)
387 self.current = next(self._iter)
395 self._iter = None
/third_party/jinja2/
Dlexer.py328 self._iter = iter(generator)
387 self.current = next(self._iter)
395 self._iter = None
/third_party/node/tools/inspector_protocol/jinja2/
Dlexer.py304 self._iter = iter(generator)
359 self.current = next(self._iter)
367 self._iter = None
/third_party/boost/libs/graph/doc/
Disomorphism-impl.w641 the iterator range \code{[k\_iter,last)}. The function returns true if
643 \code{[k\_iter,last)} and the vertices of $G_2$ in \code{not\_in\_S}.
685 \noindent We have completed creating an isomorphism if \code{k\_iter == last}.
/third_party/python/Objects/
Dunicodeobject.c190 const from_type *_iter = (const from_type *)(begin);\
192 Py_ssize_t n = (_end) - (_iter); \
194 _iter + _Py_SIZE_ROUND_DOWN(n, 4); \
195 while (_iter < (_unrolled_end)) { \
196 _to[0] = (to_type) _iter[0]; \
197 _to[1] = (to_type) _iter[1]; \
198 _to[2] = (to_type) _iter[2]; \
199 _to[3] = (to_type) _iter[3]; \
200 _iter += 4; _to += 4; \
202 while (_iter < (_end)) \
[all …]