Home
last modified time | relevance | path

Searched refs:m_base (Results 1 – 25 of 30) sorted by relevance

12

/third_party/boost/boost/regex/v4/
Dbasic_regex_parser.hpp105 const charT* m_base; // the start 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()
141 m_position = m_base = p1; in parse()
193 …fail(regex_constants::error_paren, ::boost::BOOST_REGEX_DETAIL_NS::distance(m_base, m_position), "… in parse()
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()
234 message += std::string(m_base + start_pos, m_base + position); in fail()
236 message += std::string(m_base + position, m_base + end_pos); in fail()
259 …fail(boost::regex_constants::error_complexity, m_position - m_base, "Exceeded nested brace limit."… in parse_all()
359 if(m_position == this->m_base) in parse_extended()
[all …]
Dmatch_results.hpp88 : m_subs(a), m_base(), m_null(), m_last_closed_paren(0), m_is_singular(true) {} in match_results()
90 : m_subs(), m_base(), m_null(), m_last_closed_paren(0), m_is_singular(true) { (void)a; }
98 …: m_subs(m.m_subs), m_base(), m_null(), m_named_subs(m.m_named_subs), m_last_closed_paren(m.m_last… in match_results()
102 m_base = m.m_base; in match_results()
114 m_base = m.m_base; in operator =()
170 … return ::boost::BOOST_REGEX_DETAIL_NS::distance((BidiIterator)(m_base), (BidiIterator)(s.first)); in position()
431 m_base = that.m_base; in swap()
437 that.m_base = m_base; in swap()
442 std::swap(m_base, that.m_base); in swap()
457 …return (m_subs == that.m_subs) && (m_base == that.m_base) && (m_last_closed_paren == that.m_last_c… in operator ==()
[all …]
/third_party/boost/libs/serialization/src/
Dvoid_cast.cpp57 if(m_base != rhs.m_base) in operator <()
58 return *m_base < *rhs.m_base; in operator <()
142 if ((*it)->m_base != m_base){ in vbc_downcast()
145 t_new = void_downcast(*(*it)->m_base, *m_base, t); in vbc_downcast()
168 if((*it)->m_base == m_base){ in vbc_upcast()
228 std::clog << m_base->get_debug_info(); in recursive_register()
240 if(* m_derived == * (*it)->m_base){ in recursive_register()
243 m_base in recursive_register()
250 m_base, in recursive_register()
257 if(* (*it)->m_derived == * m_base){ in recursive_register()
[all …]
/third_party/boost/boost/geometry/geometries/adapted/boost_polygon/
Dhole_iterator.hpp46 , m_base(it) in hole_iterator()
57 return RingProxy(m_polygon, this->m_base); in dereference()
60 inline void increment() { ++m_base; } in increment()
61 inline void decrement() { --m_base; } in decrement()
66 ++m_base; in advance()
72 return this->m_base == other.m_base; in equal()
76 ith_type m_base; member in boost::geometry::adapt::bp::hole_iterator
/third_party/boost/boost/interprocess/
Dmapped_region.hpp145 : m_base(0), m_size(0) in mapped_region()
150 : m_base(0), m_size(0), m_page_offset(0), m_mode(read_only), m_is_xsi(false) in mapped_region()
250 void* m_base; member in boost::interprocess::mapped_region
285 { return m_base; } in get_address()
288 { return static_cast<char*>(m_base) - m_page_offset; } in priv_map_address()
297 if(m_base == 0) in priv_flush_param_check()
317 if(m_base == 0 || bytes > m_size){ in priv_shrink_param_check()
338 m_base = static_cast<char *>(m_base) + bytes; in priv_shrink_param_check()
379 : m_base(0), m_size(0), m_page_offset(0), m_mode(read_only) in mapped_region()
399 : m_base(0), m_size(0), m_page_offset(0), m_mode(mode) in mapped_region()
[all …]
Danonymous_shared_memory.hpp57 region.m_base = address; in create_posix_mapped_region()
/third_party/boost/libs/serialization/test/
Dtest_enable_shared_from_this.cpp76 ar & BOOST_SERIALIZATION_NVP(m_base); in serialize()
82 int m_base; member in Base
111 d->m_base = 1; in BOOST_CLASS_EXPORT()
118 BOOST_CHECK(raw_d->m_base==1); in BOOST_CLASS_EXPORT()
138 BOOST_CHECK(raw_d->m_base==1); in BOOST_CLASS_EXPORT()
152 raw_d1->m_base = 1; in test_fails()
159 BOOST_CHECK(raw_d->m_base==1); in test_fails()
179 BOOST_CHECK(raw_d->m_base==1); in test_fails()
/third_party/boost/boost/numeric/odeint/stepper/detail/
Dgeneric_rk_algorithm.hpp119 stage_vector_base &m_base; member
124 : m_base( base ) , m_a( a ) , m_c( c ) { } in do_insertion()
130 boost::fusion::at< Index >( m_base ).c = m_c[ Index::value ]; in operator ()()
131 boost::fusion::at< Index >( m_base ).a = boost::fusion::at< Index >( m_a ); in operator ()()
137 const stage_vector_base &m_base; member
141 : m_base( base ) , m_os( os ) in print_butcher()
146 m_os << boost::fusion::at<Index>(m_base).c << " | "; in operator ()()
148 m_os << boost::fusion::at<Index>(m_base).a[i] << " "; in operator ()()
/third_party/boost/boost/graph/distributed/
Dcompressed_sparse_row_graph.hpp164 m_base(numverts) in compressed_sparse_row_graph()
171 m_base(numverts) in compressed_sparse_row_graph()
178 : m_process_group(pg), m_distribution(dist), m_base(numverts) {} in compressed_sparse_row_graph()
185 : m_process_group(pg), m_distribution(dist), m_base(numverts) {} in compressed_sparse_row_graph()
357 base_type& base() { return m_base; } in base()
358 const base_type& base() const { return m_base; } in base()
405 = boost::add_vertex(m_base); in add_vertex()
413 = boost::add_vertex(m_base, p); in add_vertex()
421 = boost::add_vertices(count, m_base); in add_vertices()
429 { boost::add_edges_global(first, last, get(vertex_local, *this), m_base); } in add_edges()
[all …]
/third_party/boost/boost/pending/
Dproperty.hpp29 property(const T& v, const Base& b) : m_value(v), m_base(b) {} in property()
33 Base m_base; member
151 return base_type::lookup(p.m_base, BOOST_JOIN(kind, _bundle_t)()); \
161 return base_type::lookup(p.m_base, BOOST_JOIN(kind, _bundle_t)()); \
206 return base_type::lookup(prop.m_base, tag); in lookup()
214 return base_type::lookup(prop.m_base, tag); in lookup()
367 return p.m_base; in operator ()()
372 return p.m_base; in operator ()()
Dproperty_serialize.hpp26 ar& serialization::make_nvp("property_base", prop.m_base); in serialize()
/third_party/boost/libs/intrusive/test/
Dbounded_pointer.hpp79 return &bounded_allocator< mut_val_t >::m_base[0]; in base()
240 m_base = static_cast< T* >(::operator new [] (max_offset * sizeof(T))); in init()
264 ::operator delete [] (m_base); in destroy()
271 static T* m_base; member in bounded_allocator
291 T* bounded_allocator< T >::m_base = 0; member in bounded_allocator< T >
/third_party/boost/boost/serialization/
Dvoid_cast.hpp117 const extended_type_info * m_base; member in boost::serialization::void_cast_detail::void_caster
142 m_base(base), in void_caster()
/third_party/boost/libs/regex/test/regress/
Dtest_partial_match.hpp283 : m_base(b), m_table(a) in grep_test_predicate()
287 test_result(what, m_base, m_table); in operator ()()
294 test_iter m_base; member
Dtest_regex_search.hpp407 : m_base(b), m_table(a) in grep_test_predicate()
411 test_result(what, m_base, m_table); in operator ()()
418 test_iter m_base; member
/third_party/python/Python/
Dimport.c448 if (def->m_base.m_copy) { in _PyImport_FixupExtensionObject()
452 Py_CLEAR(def->m_base.m_copy); in _PyImport_FixupExtensionObject()
458 def->m_base.m_copy = PyDict_Copy(dict); in _PyImport_FixupExtensionObject()
459 if (def->m_base.m_copy == NULL) { in _PyImport_FixupExtensionObject()
521 if (def->m_base.m_copy == NULL) in import_find_extension()
531 if (PyDict_Update(mdict, def->m_base.m_copy)) { in import_find_extension()
537 if (def->m_base.m_init == NULL) in import_find_extension()
539 mod = def->m_base.m_init(); in import_find_extension()
1027 def->m_base.m_init = p->initfunc; in create_builtin()
Dpystate.c702 Py_ssize_t index = module->m_base.m_index; in PyState_FindModule()
740 while (PyList_GET_SIZE(interp->modules_by_index) <= def->m_base.m_index) { in _PyState_AddModule()
748 def->m_base.m_index, module); in _PyState_AddModule()
761 Py_ssize_t index = def->m_base.m_index; in PyState_AddModule()
785 Py_ssize_t index = def->m_base.m_index; in PyState_RemoveModule()
815 Py_CLEAR(md->m_base.m_copy); in _PyInterpreterState_ClearModules()
Dimportdl.c223 def->m_base.m_init = p0; in _PyImport_LoadDynamicModuleWithSpec()
/third_party/boost/boost/graph/
Dadjacency_list_io.hpp44 in >> p.m_value >> p.m_base; // houpla !! in operator >>()
66 get(p.m_base, v, s); in get()
82 getSubset(p, s.m_base); in getSubset()
Dnamed_function_params.hpp192 bgl_named_params(T v, const Base& b) : m_value(v), m_base(b) {} in bgl_named_params()
194 Base m_base; member
294 return lookup_named_param< Tag1, Base >::get(p.m_base); in get()
324 return lookup_named_param_def< Tag1, Base, Def >::get(p.m_base, def); in get()
506 return type(tagged_arg_type(x.m_value), rest_conv::conv(x.m_base)); in conv()
518 return rest_conv::conv(x.m_base); in conv()
Ddirected_graph.hpp666 return get(vertex_all, g.impl(), k).m_base; in get()
674 return get(edge_all, g.impl(), k).m_base; in get()
Dundirected_graph.hpp690 return get(vertex_all, g.impl(), k).m_base; in get()
699 return get(edge_all, g.impl(), k).m_base; in get()
/third_party/python/Include/
Dmoduleobject.h76 PyModuleDef_Base m_base; member
/third_party/python/Objects/
Dmoduleobject.c51 if (def->m_base.m_index == 0) { in PyModuleDef_Init()
55 def->m_base.m_index = max_module_number; in PyModuleDef_Init()
/third_party/python/Modules/
D_queuemodule.c430 .m_base = PyModuleDef_HEAD_INIT,

12