Home
last modified time | relevance | path

Searched refs:m_iter (Results 1 – 10 of 10) sorted by relevance

/third_party/boost/boost/mpl/map/aux_/
Diterator.hpp59 struct m_iter struct
66 struct m_iter<Map,max_order,max_order> struct
73 struct next< m_iter<Map,order,max_order> >
75 typedef m_iter<
83 struct next< m_iter<Map,max_order,max_order> >
130 struct m_iter;
143 typedef m_iter<
155 struct m_iter
Dbegin_end_impl.hpp30 typedef m_iter<
44 typedef m_iter< Map,max_order_::value,max_order_::value > type;
/third_party/vk-gl-cts/framework/randomshaders/
DrsgVariableManager.hpp123 : m_iter (iter) in FilteredIterator()
131 Iterator nextEntry = m_iter; in operator +()
140 m_iter = findNext(m_filter, m_iter, m_end); in operator ++()
148 m_iter = findNext(m_filter, m_iter, m_end); in operator ++()
154 return m_iter == other.m_iter; in operator ==()
159 return m_iter != other.m_iter; in operator !=()
164 DE_ASSERT(m_iter != m_end); in operator *()
165 DE_ASSERT(m_filter(*m_iter)); in operator *()
166 return *m_iter; in operator *()
178 Iterator m_iter; member in rsg::FilteredIterator
/third_party/boost/libs/iterator/doc/
Dfilter_iterator_ref.rst33 Iterator m_iter; // exposition only
117 :Effects: Constructs a ``filter_iterator`` whose``m_pred``, ``m_iter``, and ``m_end``
123 :Effects: Constructs a ``filter_iterator`` where ``m_iter`` is either
124 the first position in the range ``[x,end)`` such that ``f(*m_iter) == true``
125 or else``m_iter == end``. The member ``m_pred`` is constructed from
134 :Effects: Constructs a ``filter_iterator`` where ``m_iter`` is either
135 the first position in the range ``[x,end)`` such that ``m_pred(*m_iter) == true``
136 or else``m_iter == end``. The member ``m_pred`` is default constructed.
169 :Returns: ``*m_iter``
174 :Effects: Increments ``m_iter`` and then continues to
[all …]
/third_party/vk-gl-cts/framework/common/
DtcuFormatUtil.hpp228 HexIterator (Iterator iter) : m_iter(iter) {} in HexIterator()
230 HexIterator<T, Iterator>& operator++ (void) { ++m_iter; return *this; } in operator ++()
231 HexIterator<T, Iterator> operator++ (int) { return HexIterator(m_iter++); } in operator ++()
233 … operator== (const HexIterator<T, Iterator>& other) const { return m_iter == other.m_iter; } in operator ==()
234 … operator!= (const HexIterator<T, Iterator>& other) const { return m_iter != other.m_iter; } in operator !=()
238 Hex<sizeof(T)*2> operator* (void) const { return Hex<sizeof(T)*2>(*m_iter); } in operator *()
242 Iterator m_iter; member in tcu::Format::HexIterator
/third_party/boost/libs/iterator/doc/quickbook/
Dfilter_iterator.qbk109 Iterator m_iter; // exposition only
181 [*Effects: ] Constructs a `filter_iterator` whose`m_pred`, `m_iter`, and `m_end`
187 [*Effects: ] Constructs a `filter_iterator` where `m_iter` is either
188 the first position in the range `[x,end)` such that `f(*m_iter) == true`
189 or else`m_iter == end`. The member `m_pred` is constructed from
198 [*Effects: ] Constructs a `filter_iterator` where `m_iter` is either
199 the first position in the range `[x,end)` such that `m_pred(*m_iter) == true`
200 or else`m_iter == end`. The member `m_pred` is default constructed.
230 [*Returns: ] `*m_iter`
235 [*Effects: ] Increments `m_iter` and then continues to
[all …]
/third_party/boost/boost/graph/
Dtopological_sort.hpp37 topo_sort_visitor(OutputIterator _iter) : m_iter(_iter) {} in topo_sort_visitor()
48 *m_iter++ = u; in finish_vertex()
51 OutputIterator m_iter; member
/third_party/boost/boost/geometry/algorithms/detail/
Dcalculate_point_order.hpp36 : m_iter(iter), m_azi(0), m_razi(0), m_azi_diff(0) in clean_point()
42 return *m_iter; in ref()
94 Iter m_iter; member
/third_party/boost/boost/iterator/
Diterator_facade.hpp363 : m_iter(iter) in operator_brackets_proxy()
368 return *m_iter; in operator reference()
373 *m_iter = val; in operator =()
378 Iterator m_iter; member in boost::iterators::detail::operator_brackets_proxy
/third_party/boost/boost/graph/detail/
Dadjacency_list.hpp351 : stored_edge< Vertex >(v), m_iter(i) in stored_edge_iter()
354 inline Property& get_property() { return m_iter->get_property(); } in get_property()
357 return m_iter->get_property(); in get_property()
359 inline Iter get_iter() const { return m_iter; } in get_iter()
362 Iter m_iter; member in boost::detail::stored_edge_iter