| /third_party/boost/libs/test/example/ |
| D | const_string.hpp | 40 : m_begin( "" ), m_end( m_begin ) {} in const_string()
46 m_end( m_begin + s.length() ) {} in const_string()
50 , m_end( s ? m_begin + std::strlen( s ) : m_begin ) in const_string()
54 : m_begin( s ), m_end( m_begin + length ) { if( length == 0 ) erase(); } in const_string()
57 : m_begin( first ), m_end( last ) {} in const_string()
66 size_t length() const { return m_end - m_begin; } in length()
67 bool is_empty() const { return m_end == m_begin; } in is_empty()
69 void erase() { m_begin = m_end = ""; } in erase()
70 …void resize( size_t new_len ) { if( m_begin + new_len < m_end ) m_end = … in resize()
71 …void rshorten( size_t shift = 1 ) { m_end -= shift; if( m_end <= m_begin ) … in rshorten()
[all …]
|
| /third_party/boost/libs/test/doc/snippet/ |
| D | const_string.hpp | 37 m_end( m_begin ) in const_string()
44 m_end( m_begin + s.length() ) in const_string()
51 m_end( m_begin + length ) in const_string()
59 m_end( last ) in const_string()
68 size_t length() const { return m_end - m_begin;} in length()
69 bool is_empty() const { return m_end == m_begin;} in is_empty()
71 void erase() { m_begin = m_end = ""; } in erase()
72 …void resize( size_t new_len ) { if( m_begin + new_len < m_end ) m_end = m_begin + new_len;… in resize()
73 void rshorten( size_t shift = 1 ) { m_end -= shift; if( m_end <= m_begin ) erase(); } in rshorten()
74 void lshorten( size_t shift = 1 ) { m_begin += shift; if( m_end <= m_begin ) erase(); } in lshorten()
[all …]
|
| /third_party/boost/boost/lexical_cast/detail/ |
| D | lcast_unsigned_converters.hpp | 164 const CharT* m_end; member in boost::detail::lcast_ret_unsigned
168 … : m_multiplier_overflowed(false), m_multiplier(1), m_value(value), m_begin(begin), m_end(end) in lcast_ret_unsigned()
186 --m_end; in convert()
189 if (m_begin > m_end || *m_end < czero || *m_end >= czero + 10) in convert()
191 m_value = static_cast<T>(*m_end - czero); in convert()
192 --m_end; in convert()
218 for (;m_end >= m_begin; --m_end) in convert()
226 if ( !Traits::eq(*m_end, thousands_sep) ) //|| begin == end ) return false; in convert()
241 if (m_begin == m_end) return false; in convert()
262 T const dig_value = static_cast<T>(*m_end - czero); in main_convert_iteration()
[all …]
|
| /third_party/boost/boost/regex/v4/ |
| D | basic_regex_parser.hpp | 106 const charT* m_end; // the end of the string being parsed member in boost::BOOST_REGEX_DETAIL_NS::basic_regex_parser
130 : basic_regex_creator<charT, traits>(data), m_parser_proc(), m_base(0), m_end(0), m_position(0), in basic_regex_parser()
142 m_end = p2; in parse()
217 m_position = m_end; // don't bother parsing anything else in fail()
225 …std::min)(position + static_cast<std::ptrdiff_t>(10), static_cast<std::ptrdiff_t>(m_end - m_base)); in fail()
228 if((start_pos != 0) || (end_pos != (m_end - m_base))) in fail()
262 while(result && (m_position != m_end)) in parse_all()
411 while((m_position != m_end) && !is_separator(*m_position++)){} in parse_extended()
449 if(++m_position == m_end) in parse_open_paren()
532 if(m_position == m_end) in parse_open_paren()
[all …]
|
| D | regex_format.hpp | 103 …: m_traits(t), m_results(r), m_out(o), m_position(), m_end(), m_flags(), m_state(output_copy), m_r… in basic_regex_formatter()
201 ForwardIter m_end; // format string end member in boost::BOOST_REGEX_DETAIL_NS::basic_regex_formatter
218 m_end = p2; in format()
228 while(m_position != m_end) in format_all()
252 if(m_position == m_end) in format_all()
314 if(++m_position == m_end) in format_perl()
344 if((++m_position != m_end) && (*m_position == '{')) in format_perl()
347 while((m_position != m_end) && (*m_position != '}')) ++m_position; in format_perl()
348 if(m_position != m_end) in format_perl()
369 std::ptrdiff_t len = ::boost::BOOST_REGEX_DETAIL_NS::distance(m_position, m_end); in format_perl()
[all …]
|
| /third_party/boost/boost/test/utils/basic_cstring/ |
| D | basic_cstring.hpp | 83 basic_cstring( pointer s, LenType len ) : m_begin( s ), m_end( m_begin + len ) {} in basic_cstring()
169 iterator m_end; member in boost::unit_test::basic_cstring
217 , m_end( m_begin ) in basic_cstring()
227 , m_end( s.m_end ) in basic_cstring()
237 , m_end( m_begin + s.size() ) in basic_cstring()
247 , m_end ( m_begin + (s ? traits_type::length( s ) : 0 ) ) in basic_cstring()
257 , m_end( last ) in basic_cstring()
276 if( m_begin + index >= m_end ) in at()
288 return static_cast<size_type>(m_end - m_begin); in size()
297 return m_end == m_begin; in is_empty()
[all …]
|
| /third_party/boost/boost/iterator/ |
| D | filter_iterator.hpp | 57 : super_t(x), m_predicate(f), m_end(end_) in filter_iterator()
63 : super_t(x), m_predicate(), m_end(end_) in filter_iterator()
80 : super_t(t.base()), m_predicate(t.predicate()), m_end(t.end()) {} in filter_iterator()
84 Iterator end() const { return m_end; } in end()
100 while (this->base() != this->m_end && !this->m_predicate(*this->base())) in satisfy_predicate()
107 Iterator m_end; member in boost::iterators::filter_iterator
|
| /third_party/boost/boost/geometry/algorithms/detail/buffer/ |
| D | piece_border.hpp | 110 std::size_t m_end; member
135 , m_end(0) in piece_border()
155 m_ring->begin() + m_end, in get_full_ring()
177 calculate_radii(center, m_ring->begin() + m_begin, m_ring->begin() + m_end); in get_properties_of_border()
187 check_monotonicity(m_ring->begin() + m_begin, m_ring->begin() + m_end); in get_properties_of_offsetted_ring_part()
199 m_end = end; in set_offsetted()
216 expand_envelope(envelope, m_ring->begin() + m_begin, m_ring->begin() + m_end); in calculate_envelope()
241 Point const offsetted_back = *(m_ring->begin() + m_end - 1); in point_on_piece()
275 walk_offsetted(point, m_ring->begin() + m_begin, m_ring->begin() + m_end, in point_on_piece()
285 return m_ring == NULL || m_begin >= m_end || m_original_size == 0; in ring_or_original_empty()
[all …]
|
| /third_party/vk-gl-cts/framework/randomshaders/ |
| D | rsgVariableManager.hpp | 124 , m_end (end) in FilteredIterator()
133 nextEntry = findNext(m_filter, nextEntry, m_end); in operator +()
134 return FilteredIterator(nextEntry, m_end, m_filter); 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 ++()
164 DE_ASSERT(m_iter != m_end); in operator *()
179 Iterator m_end; member in rsg::FilteredIterator
|
| /third_party/boost/boost/geometry/iterators/ |
| D | ever_circling_iterator.hpp | 49 , m_end(end) in ever_circling_iterator()
58 , m_end(end) in ever_circling_iterator()
82 if (this->base() == this->m_end) in check_end()
93 Iterator m_end; member
|
| D | closing_iterator.hpp | 64 , m_end(boost::end(range)) in closing_iterator()
73 , m_end(boost::end(range)) in closing_iterator()
152 typename boost::range_iterator<Range>::type m_end; member
|
| /third_party/boost/boost/circular_buffer/ |
| D | base.hpp | 188 pointer m_end; 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()
607 … return const_array_range(m_first, (m_last <= m_first && !empty() ? m_end : m_last) - m_first); in array_one()
661 for (size_type ii = 0; src < m_end; ++src, ++dest, ++moved, ++ii) { in linearize()
686 for (src = m_end - constructed; src < m_end; ++src) in linearize()
852 capacity_type capacity() const BOOST_NOEXCEPT { return m_end - m_buff; } in capacity()
1025 : base(boost::empty_init_t(), alloc), m_buff(0), m_end(0), m_first(0), m_last(0), m_size(0) {} in circular_buffer()
1113 if (m_last == m_end) in circular_buffer()
[all …]
|
| D | details.hpp | 406 (it.m_it < m_buff->m_first ? it.m_it + (m_buff->m_end - m_buff->m_first) in linearize_pointer()
|
| /third_party/boost/boost/test/utils/iterator/ |
| D | token_iterator.hpp | 354 : m_begin( begin ), m_end( end ) in range_token_iterator()
363 m_end = rhs.m_end; in range_token_iterator()
369 : m_begin( begin ), m_end( end ) in range_token_iterator()
382 return base::get( m_begin, m_end ); in get()
387 Iter m_end; member in boost::unit_test::utils::range_token_iterator
|
| /third_party/boost/libs/iterator/doc/ |
| D | filter_iterator_ref.rst | 34 Iterator m_end; // exposition only
117 :Effects: Constructs a ``filter_iterator`` whose``m_pred``, ``m_iter``, and ``m_end``
126 ``f`` and ``m_end`` from ``end``.
158 :Returns: ``m_end``
175 increment ``m_iter`` until either ``m_iter == m_end``
|
| /third_party/boost/boost/geometry/algorithms/detail/envelope/ |
| D | range_of_boxes.hpp | 58 m_end[0] = left; in longitude_interval()
59 m_end[1] = right; in longitude_interval()
65 return m_end[Index]; in get()
74 T m_end[2]; member in boost::geometry::detail::envelope::longitude_interval
|
| /third_party/boost/libs/iterator/doc/quickbook/ |
| D | filter_iterator.qbk | 110 Iterator m_end; // exposition only
181 [*Effects: ] Constructs a `filter_iterator` whose`m_pred`, `m_iter`, and `m_end`
190 `f` and `m_end` from `end`.
220 [*Returns: ] `m_end`
236 increment `m_iter` until either `m_iter == m_end`
|
| /third_party/vk-gl-cts/framework/common/ |
| D | tcuFormatUtil.hpp | 96 , m_end (end) in Bitfield()
103 for (const BitDesc* curDesc = m_begin; curDesc != m_end; curDesc++) in toStream()
127 const BitDesc* m_end; member in tcu::Format::Bitfield
|
| /third_party/vk-gl-cts/modules/glshared/ |
| D | glsFboUtil.hpp | 56 const T* m_end; member
59 const T* end (void) const { return m_end; } in end()
|
| /third_party/gstreamer/gstplugins_bad/ext/sctp/usrsctp/usrsctplib/netinet/ |
| D | sctp_auth.h | 199 extern struct mbuf *sctp_add_auth_chunk(struct mbuf *m, struct mbuf **m_end,
|
| D | sctp_output.c | 11467 struct mbuf *m_out, *m_end = NULL; local
11490 m_out = sctp_add_auth_chunk(NULL, &m_end, &auth, &auth_offset,
11525 SCTP_BUF_NEXT(m_end) = m_abort;
14808 sctp_add_auth_chunk(struct mbuf *m, struct mbuf **m_end, argument
14817 if ((m_end == NULL) || (auth_ret == NULL) || (offset == NULL) ||
14855 m = sctp_copy_mbufchain(m_auth, m, m_end, 1, chunk_len, 0);
|
| /third_party/boost/libs/geometry/doc/src/docutils/tools/doxygen_xml2qbk/contrib/rapidxml-1.13/ |
| D | rapidxml.hpp | 570 m_end = m_static_memory + sizeof(m_static_memory); in init()
605 if (result + size > m_end) in allocate_aligned()
622 m_end = raw_memory + alloc_size; in allocate_aligned()
635 …char *m_end; // One past last available byte in current pool member in rapidxml::memory_pool
|
| /third_party/boost/boost/property_tree/detail/ |
| D | rapidxml.hpp | 558 m_end = m_static_memory + sizeof(m_static_memory); in init()
589 if (result + size > m_end) in allocate_aligned()
606 m_end = raw_memory + alloc_size; in allocate_aligned()
619 …char *m_end; // One past last available byte in current pool member in boost::property_tree::detail::rapidxml::memory_pool
|