Searched refs:_M_t (Results 1 - 23 of 23) sorted by relevance

/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dstl_multiset.h59 _Rep_type _M_t; // red-black tree representing multiset member in class:multiset
75 multiset() : _M_t(_Compare(), allocator_type()) {}
78 : _M_t(__comp, __a) {}
84 : _M_t(_Compare(), allocator_type())
85 { _M_t.insert_equal(__first, __last); }
91 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
96 : _M_t(_Compare(), allocator_type())
97 { _M_t.insert_equal(__first, __last); }
102 : _M_t(__com
[all...]
H A Dstl_set.h59 _Rep_type _M_t; // red-black tree representing set member in class:set
75 set() : _M_t(_Compare(), allocator_type()) {}
78 : _M_t(__comp, __a) {}
83 : _M_t(_Compare(), allocator_type())
84 { _M_t.insert_unique(__first, __last); }
89 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
92 : _M_t(_Compare(), allocator_type())
93 { _M_t.insert_unique(__first, __last); }
98 : _M_t(__com
[all...]
H A Dstl_map.h74 _Rep_type _M_t; // red-black tree representing map member in class:map
90 map() : _M_t(_Compare(), allocator_type()) {}
93 : _M_t(__comp, __a) {}
98 : _M_t(_Compare(), allocator_type())
99 { _M_t.insert_unique(__first, __last); }
104 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
107 : _M_t(_Compare(), allocator_type())
108 { _M_t.insert_unique(__first, __last); }
113 : _M_t(__com
[all...]
H A Dstl_multimap.h73 _Rep_type _M_t; // red-black tree representing multimap member in class:multimap
89 multimap() : _M_t(_Compare(), allocator_type()) { }
92 : _M_t(__comp, __a) { }
97 : _M_t(_Compare(), allocator_type())
98 { _M_t.insert_equal(__first, __last); }
104 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
107 : _M_t(_Compare(), allocator_type())
108 { _M_t.insert_equal(__first, __last); }
112 : _M_t(__com
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dstl_map.h138 _Rep_type _M_t; member in class:map
166 : _M_t() { }
176 : _M_t(__comp, _Pair_alloc_type(__a)) { }
186 : _M_t(__x._M_t) { }
198 : _M_t(std::move(__x._M_t)) { }
214 : _M_t(__comp, _Pair_alloc_type(__a))
215 { _M_t._M_insert_unique(__l.begin(), __l.end()); }
220 : _M_t(_Compar
[all...]
H A Dstl_multimap.h136 _Rep_type _M_t; member in class:multimap
164 : _M_t() { }
174 : _M_t(__comp, _Pair_alloc_type(__a)) { }
184 : _M_t(__x._M_t) { }
196 : _M_t(std::move(__x._M_t)) { }
211 : _M_t(__comp, _Pair_alloc_type(__a))
212 { _M_t._M_insert_equal(__l.begin(), __l.end()); }
217 : _M_t(_Compar
[all...]
H A Dstl_set.h116 _Rep_type _M_t; // Red-black tree representing set. member in class:set
146 : _M_t() { }
156 : _M_t(__comp, _Key_alloc_type(__a)) { }
170 : _M_t()
171 { _M_t._M_insert_unique(__first, __last); }
189 : _M_t(__comp, _Key_alloc_type(__a))
190 { _M_t._M_insert_unique(__first, __last); }
200 : _M_t(__x._M_t) { }
212 : _M_t(st
[all...]
H A Dstl_multiset.h117 _Rep_type _M_t; member in class:multiset
144 : _M_t() { }
154 : _M_t(__comp, _Key_alloc_type(__a)) { }
167 : _M_t()
168 { _M_t._M_insert_equal(__first, __last); }
185 : _M_t(__comp, _Key_alloc_type(__a))
186 { _M_t._M_insert_equal(__first, __last); }
196 : _M_t(__x._M_t) { }
208 : _M_t(st
[all...]
H A Dunique_ptr.h147 __tuple_type _M_t; member in class:unique_ptr
158 : _M_t() function in class:unique_ptr
170 : _M_t(__p, deleter_type()) function in class:unique_ptr
184 : _M_t(__p, __d) { } function in class:unique_ptr
195 : _M_t(std::move(__p), std::move(__d))
206 : _M_t(__u.release(), std::forward<deleter_type>(__u.get_deleter())) { } function in class:unique_ptr
221 : _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter())) function in class:unique_ptr
234 auto& __ptr = std::get<0>(_M_t);
305 { return std::get<0>(_M_t); }
310 { return std::get<1>(_M_t); }
383 __tuple_type _M_t; member in class:unique_ptr
415 : _M_t() function in class:unique_ptr
427 : _M_t(__p, deleter_type()) function in class:unique_ptr
447 : _M_t(__p, __d) { } function in class:unique_ptr
464 : _M_t(__u.release(), std::forward<deleter_type>(__u.get_deleter())) { } function in class:unique_ptr
476 : _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter())) function in class:unique_ptr
[all...]
H A Dstl_tree.h366 : _M_root(__t._M_root()), _M_nodes(__t._M_rightmost()), _M_t(__t)
384 { _M_t._M_erase(static_cast<_Link_type>(_M_root)); }
397 _M_t._M_destroy_node(__node);
398 _M_t._M_construct_node(__node, _GLIBCXX_FORWARD(_Arg, __arg));
402 return _M_t._M_create_node(_GLIBCXX_FORWARD(_Arg, __arg));
442 _Rb_tree& _M_t;
450 : _M_t(__t) { }
459 { return _M_t._M_create_node(_GLIBCXX_FORWARD(_Arg, __arg)); }
462 _Rb_tree& _M_t;
H A Drandom.h3628 : _M_t(__t), _M_p(__p)
3630 _GLIBCXX_DEBUG_ASSERT((_M_t >= _IntType(0))
3638 { return _M_t; }
3646 { return __p1._M_t == __p2._M_t && __p1._M_p == __p2._M_p; }
3652 _IntType _M_t; member in struct:binomial_distribution::param_type
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/
H A Darray21.C16 { return ::get<0>(_M_t); }
18 __tuple_type _M_t; member in struct:unique_ptr
H A Drepo11.C27 C<typename B::type, A<M>> _M_t; member in struct:L
28 L(typename B::type) : _M_t(0, A<M>()) {}
/haiku-buildtools/gcc/libstdc++-v3/include/ext/
H A Daligned_buffer.h52 struct _Tp2 { _Tp _M_t; }; member in struct:__gnu_cxx::__aligned_membuf::_Tp2
54 alignas(__alignof__(_Tp2::_M_t)) unsigned char _M_storage[sizeof(_Tp)];
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/
H A Dpr65032.C39 _Rep_type _M_t; member in class:D
43 return _M_t.erase (p1);
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/ipa/
H A Dpr63587-1.C49 I<key_type, value_type, int, _Compare, _Pair_alloc_type> _M_t; member in class:K
54 _M_t._M_emplace_hint_unique (0);
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/tree-ssa/
H A Dpr22444.C132 _Rep_type _M_t; member in class:std::set
136 std::pair<typename _Rep_type::iterator, bool> __p = _M_t.insert_unique(__x);
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/
H A Dpr57101.C200 _Rep_type _M_t; member in class:std::multimap
203 _M_t
H A Dvariadic98.C363 _Rep_type _M_t; member in class:std::multimap
375 multimap(initializer_list<value_type> __l, const _Compare& __comp = _Compare(), const allocator_type& __a = allocator_type()) : _M_t(__comp, __a) {
376 _M_t._M_insert_equal(__l.begin(), __l.end());
378 template<typename _InputIterator> multimap(_InputIterator __first, _InputIterator __last) : _M_t() {
380 template<typename _InputIterator> multimap(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) : _M_t(__comp, __a) {
385 return _M_t.count(__x);
388 return _M_t.equal_range(__x);
/haiku-buildtools/gcc/libstdc++-v3/include/backward/
H A Dauto_ptr.h323 : _M_t(__u.release(), deleter_type()) { } function
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/lto/
H A Dpr47333.C909 _Rep_type _M_t; member in class:std::map
917 : _M_t() { }
921 { return _M_t.end(); }
925 { return _M_t.key_comp(); }
929 { return _M_t.find(__x); }
/haiku-buildtools/gcc/libstdc++-v3/include/tr1/
H A Drandom.h1972 : _M_t(__t), _M_p(__p), _M_nd()
1974 _GLIBCXX_DEBUG_ASSERT((_M_t >= 0) && (_M_p >= 0.0) && (_M_p <= 1.0));
1983 { return _M_t; }
2048 _IntType _M_t;
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/tm/
H A Dpr46646.C853 _Rep_type _M_t; member in class:std::set
868 _M_t._M_insert_unique(__x);

Completed in 496 milliseconds