| /third_party/boost/boost/circular_buffer/ |
| D | base.hpp | 194 pointer m_last; member in boost::circular_buffer
481 return *((m_last == m_buff ? m_end : m_last) - 1); in back()
517 return *((m_last == m_buff ? m_end : m_last) - 1); in back()
567 return array_range(m_first, (m_last <= m_first && !empty() ? m_end : m_last) - m_first); in array_one()
587 return array_range(m_buff, m_last <= m_first && !empty() ? m_last - m_buff : 0); in array_two()
607 … return const_array_range(m_first, (m_last <= m_first && !empty() ? m_end : m_last) - m_first); in array_one()
627 return const_array_range(m_buff, m_last <= m_first && !empty() ? m_last - m_buff : 0); in array_two()
653 if (m_first < m_last || m_last == m_buff) in linearize()
681 m_last += constructed; in linearize()
689 m_last = add(m_buff, size()); in linearize()
[all …]
|
| D | details.hpp | 137 Iterator m_last; member
141 : m_first(first), m_last(last), m_alloc(alloc) {} in assign_range()
145 boost::cb_details::uninitialized_copy(m_first, m_last, p, m_alloc); in operator ()()
298 if (m_it == m_buff->m_last) in operator ++()
315 m_it = m_buff->m_last; in operator --()
333 if (m_it == m_buff->m_last) in operator +=()
349 m_it = m_buff->sub(m_it == 0 ? m_buff->m_last : m_it, n); in operator -=()
|
| /third_party/boost/boost/range/adaptor/ |
| D | adjacent_filtered.hpp | 59 skip_iterator() : m_last() {} in skip_iterator()
64 , m_last(last) in skip_iterator()
72 , m_last(other.m_last) in skip_iterator()
79 BOOST_ASSERT( it != m_last ); in increment()
83 if (it != m_last) in increment()
87 while (it != m_last && !bi_pred(*prev, *it)) in increment()
95 for (; it != m_last; ++it, ++prev) in increment()
106 iter_t m_last; member in boost::range_detail::skip_iterator
|
| D | strided.hpp | 52 , m_last() in strided_iterator()
61 , m_last(last) in strided_iterator()
75 , m_last(other.base_end()) in strided_iterator()
87 return m_last; in base_end()
99 (m_it != m_last) && (i < m_stride); ++i) in increment()
122 base_iterator m_last; member in boost::range_detail::strided_iterator
|
| /third_party/boost/libs/range/test/test_function/ |
| D | check_equal_fn.hpp | 26 : m_it(boost::begin(c)), m_last(boost::end(c)) {} in check_equal_fn()
33 BOOST_CHECK( m_it != m_last ); in operator ()()
34 if (m_it != m_last) in operator ()()
43 iter_t m_last; member in boost::range_test_function::check_equal_fn
|
| /third_party/vk-gl-cts/framework/delibs/decpp/ |
| D | deAppendList.hpp | 91 Block* volatile m_last; member in de::AppendList
168 , m_last (m_first) in AppendList()
220 m_last = m_first; in clear()
228 Block* curBlock = m_last; in append()
258 m_last = newBlock; in append()
286 return const_iterator(m_last, m_blockSize, m_numElements%m_blockSize); in end()
292 return iterator(m_last, m_blockSize, m_numElements%m_blockSize); in end()
|
| /third_party/boost/libs/range/test/ |
| D | begin.cpp | 81 , m_last() in MockTestBeginCollection()
87 const_iterator end() const { return m_last; } in end()
88 iterator end() { return m_last; } in end()
92 iterator m_last; member in boost::MockTestBeginCollection
|
| D | end.cpp | 81 , m_last() in MockTestEndCollection()
87 const_iterator end() const { return m_last; } in end()
88 iterator end() { return m_last; } in end()
92 iterator m_last; member in boost::MockTestEndCollection
|
| /third_party/boost/boost/test/ |
| D | unit_test_log.hpp | 68 entry_value_collector() : m_last( true ) {} in entry_value_collector()
69 … entry_value_collector( entry_value_collector const& rhs ) : m_last( true ) { rhs.m_last = false; } in entry_value_collector()
78 mutable bool m_last; member in boost::unit_test::ut_detail::entry_value_collector
|
| /third_party/boost/libs/compute/include/boost/compute/ |
| D | function.hpp | 310 m_last = last; in signature_argument_inserter()
324 if(n+1 < m_last){ in operator ()()
331 size_t m_last; member
367 m_last = last; in argument_list_inserter()
375 if(n+1 < m_last){ in operator ()()
382 size_t m_last; member
|
| D | closure.hpp | 213 m_last = last; in closure_signature_argument_inserter()
234 if(n+1 < m_last){ in operator ()()
241 size_t m_last; member
|
| /third_party/boost/boost/compute/ |
| D | function.hpp | 310 m_last = last; in signature_argument_inserter()
324 if(n+1 < m_last){ in operator ()()
331 size_t m_last; member
367 m_last = last; in argument_list_inserter()
375 if(n+1 < m_last){ in operator ()()
382 size_t m_last; member
|
| D | closure.hpp | 213 m_last = last; in closure_signature_argument_inserter()
234 if(n+1 < m_last){ in operator ()()
241 size_t m_last; member
|
| /third_party/boost/boost/container/ |
| D | deque.hpp | 140 Pointer m_last; member in boost::container::dtl::deque_iterator
147 BOOST_CONTAINER_FORCEINLINE Pointer get_last() const { return m_last; } in get_last()
151 : m_cur(x), m_first(*y), m_last(*y + block_size), m_node(y) in deque_iterator()
155 …: m_cur(), m_first(), m_last(), m_node() //Value initialization to achieve "null iterators" (N364… in deque_iterator()
159 : m_cur(x.get_cur()), m_first(x.get_first()), m_last(x.get_last()), m_node(x.get_node()) in deque_iterator()
163 : m_cur(x.get_cur()), m_first(x.get_first()), m_last(x.get_last()), m_node(x.get_node()) in deque_iterator()
167 : m_cur(cur), m_first(first), m_last(last), m_node(node) in deque_iterator()
171 …{ m_cur = x.get_cur(); m_first = x.get_first(); m_last = x.get_last(); m_node = x.get_node(); ret… in operator =()
189 const difference_type block_size = this->m_last - this->m_first; in operator -()
192 (this->m_cur - this->m_first) + (x.m_last - x.m_cur); in operator -()
[all …]
|
| D | string.hpp | 578 const Pointer m_last; member
581 : m_first(f), m_last(l) {} in Not_within_traits()
585 return boost::container::find_if(m_first, m_last, in operator ()()
586 boost::container::bind1st(Eq_traits<Tr>(), x)) == m_last; in operator ()()
|
| /third_party/boost/boost/move/algo/detail/ |
| D | merge.hpp | 223 : m_first(first), m_last(first), m_cap(last) in range_xbuf()
230 m_last = Op()(forward_t(), first, first+n, m_first); in move_assign()
243 { return m_last; } in end()
246 { return m_last-m_first; } in size()
249 { return m_first == m_last; } in empty()
253 m_last = m_first; in clear()
259 Iterator pos(m_last); in add()
261 ++m_last; in add()
267 m_last = m_first; in set_size()
268 m_last += size; in set_size()
[all …]
|
| /third_party/boost/boost/geometry/algorithms/detail/disjoint/ |
| D | multipoint_geometry.hpp | 66 : base_type(), m_first(first), m_last(last) in unary_disjoint_predicate()
73 m_last, in apply()
79 Iterator m_first, m_last; member in boost::geometry::detail::disjoint::multipoint_multipoint::unary_disjoint_predicate
|
| /third_party/gstreamer/gstplugins_bad/ext/sctp/usrsctp/usrsctplib/ |
| D | user_mbuf.h | 61 struct mbuf *m_last(struct mbuf *m);
|
| D | user_mbuf.c | 440 m_last(struct mbuf *m) in m_last() function
|
| /third_party/gstreamer/gstplugins_bad/ext/sctp/usrsctp/usrsctplib/netinet/ |
| D | sctp_output.c | 5075 struct mbuf *m, *m_last; local
5334 m_last = sctp_add_addresses_to_i_ia(inp, stcb, &stcb->asoc.scope,
5340 if (sctp_add_pad_tombuf(m_last, padding_len) == NULL) {
5931 struct mbuf *m, *m_tmp, *m_last, *m_cookie, *op_err; local
6552 m_last = m;
6569 m_last = sctp_add_addresses_to_i_ia(inp, stcb, &scp, m_last,
6587 SCTP_BUF_NEXT(m_last) = op_err;
6588 while (SCTP_BUF_NEXT(m_last) != NULL) {
6589 m_last = SCTP_BUF_NEXT(m_last);
6594 m_last = sctp_add_pad_tombuf(m_last, padding_len);
[all …]
|
| D | sctputil.c | 3216 struct mbuf *m_last; in sctp_add_pad_tombuf() local
3227 m_last = m; in sctp_add_pad_tombuf()
3230 m_last = sctp_get_mbuf_for_msg(padlen, 0, M_NOWAIT, 1, MT_DATA); in sctp_add_pad_tombuf()
3231 if (m_last == NULL) { in sctp_add_pad_tombuf()
3234 SCTP_BUF_LEN(m_last) = 0; in sctp_add_pad_tombuf()
3235 SCTP_BUF_NEXT(m_last) = NULL; in sctp_add_pad_tombuf()
3236 SCTP_BUF_NEXT(m) = m_last; in sctp_add_pad_tombuf()
3238 dp = mtod(m_last, caddr_t) + SCTP_BUF_LEN(m_last); in sctp_add_pad_tombuf()
3239 SCTP_BUF_LEN(m_last) += padlen; in sctp_add_pad_tombuf()
3241 return (m_last); in sctp_add_pad_tombuf()
|
| /third_party/boost/boost/graph/ |
| D | adjacency_matrix.hpp | 198 : super_t(i), m_last(last), m_src(0), m_targ(tgt), m_n(n) in dir_adj_matrix_in_edge_iter()
204 if (VerticesSizeType(m_last - this->base_reference()) >= m_n) in increment()
211 this->base_reference() = m_last; in increment()
220 MatrixIter m_last; member
|
| /third_party/boost/boost/test/impl/ |
| D | unit_test_log.ipp | 72 if( m_last )
|