OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:_M_node
(Results
1 - 10
of
10
) sorted by null
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/
forward_list.h
133
:
_M_node
() { }
137
:
_M_node
(__n) { }
141
{ return *static_cast<_Node*>(this->
_M_node
)->_M_valptr(); }
145
{ return static_cast<_Node*>(this->
_M_node
)->_M_valptr(); }
150
_M_node
=
_M_node
->_M_next;
158
_M_node
=
_M_node
->_M_next;
164
{ return
_M_node
== __x.
_M_node
; }
[
all
...]
hashtable_policy.h
[
all
...]
stl_deque.h
126
_Map_pointer
_M_node
;
130
_M_last(*__y + _S_buffer_size()),
_M_node
(__y) { }
133
: _M_cur(0), _M_first(0), _M_last(0),
_M_node
(0) { }
137
_M_last(__x._M_last),
_M_node
(__x.
_M_node
) { }
153
_M_set_node(
_M_node
+ 1);
172
_M_set_node(
_M_node
- 1);
199
_M_set_node(
_M_node
+ __node_offset);
236
_M_node
= __new_node;
275
{ return (__x.
_M_node
== __y._M_node) ? (__x._M_cur < __y._M_cur
[
all
...]
stl_list.h
137
:
_M_node
() { }
141
:
_M_node
(__x) { }
146
{ return static_cast<_Node*>(
_M_node
)->_M_data; }
150
{ return std::__addressof(static_cast<_Node*>(
_M_node
)->_M_data); }
155
_M_node
=
_M_node
->_M_next;
163
_M_node
=
_M_node
->_M_next;
170
_M_node
=
_M_node
->_M_prev
[
all
...]
stl_tree.h
171
:
_M_node
() { }
175
:
_M_node
(__x) { }
179
{ return static_cast<_Link_type>(
_M_node
)->_M_value_field; }
184
(
_M_node
)->_M_value_field); }
189
_M_node
= _Rb_tree_increment(
_M_node
);
197
_M_node
= _Rb_tree_increment(
_M_node
);
204
_M_node
= _Rb_tree_decrement(
_M_node
);
[
all
...]
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
forward_list.h
133
:
_M_node
() { }
137
:
_M_node
(__n) { }
141
{ return *static_cast<_Node*>(this->
_M_node
)->_M_valptr(); }
145
{ return static_cast<_Node*>(this->
_M_node
)->_M_valptr(); }
150
_M_node
=
_M_node
->_M_next;
158
_M_node
=
_M_node
->_M_next;
164
{ return
_M_node
== __x.
_M_node
; }
[
all
...]
hashtable_policy.h
[
all
...]
stl_deque.h
126
_Map_pointer
_M_node
;
130
_M_last(*__y + _S_buffer_size()),
_M_node
(__y) { }
133
: _M_cur(0), _M_first(0), _M_last(0),
_M_node
(0) { }
137
_M_last(__x._M_last),
_M_node
(__x.
_M_node
) { }
153
_M_set_node(
_M_node
+ 1);
172
_M_set_node(
_M_node
- 1);
199
_M_set_node(
_M_node
+ __node_offset);
236
_M_node
= __new_node;
275
{ return (__x.
_M_node
== __y._M_node) ? (__x._M_cur < __y._M_cur
[
all
...]
stl_list.h
137
:
_M_node
() { }
141
:
_M_node
(__x) { }
146
{ return static_cast<_Node*>(
_M_node
)->_M_data; }
150
{ return std::__addressof(static_cast<_Node*>(
_M_node
)->_M_data); }
155
_M_node
=
_M_node
->_M_next;
163
_M_node
=
_M_node
->_M_next;
170
_M_node
=
_M_node
->_M_prev
[
all
...]
stl_tree.h
171
:
_M_node
() { }
175
:
_M_node
(__x) { }
179
{ return static_cast<_Link_type>(
_M_node
)->_M_value_field; }
184
(
_M_node
)->_M_value_field); }
189
_M_node
= _Rb_tree_increment(
_M_node
);
197
_M_node
= _Rb_tree_increment(
_M_node
);
204
_M_node
= _Rb_tree_decrement(
_M_node
);
[
all
...]
Completed in 148 milliseconds