| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| locale_facets_nonio.h | 186 __cache_type* _M_data;
223 __date[0] = _M_data->_M_date_format;
224 __date[1] = _M_data->_M_date_era_format;
231 __time[0] = _M_data->_M_time_format;
232 __time[1] = _M_data->_M_time_era_format;
239 __dt[0] = _M_data->_M_date_time_format;
240 __dt[1] = _M_data->_M_date_time_era_format;
245 { __ampm = _M_data->_M_am_pm_format; }
250 __ampm[0] = _M_data->_M_am;
251 __ampm[1] = _M_data->_M_pm
[all...] |
| /external/stlport/stlport/stl/ |
| _slist.h | 61 _Tp _M_data;
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
162 { _M_head._M_data._M_next = 0; }
167 { src.get()._M_head._M_data._M_next = 0; }
170 ~_Slist_base() { _M_erase_after(&_M_head._M_data, 0); }
177 _STLP_STD::_Destroy(&__next->_M_data);
256 _Copy_Construct(&__node->_M_data, __x);
267 _STLP_STD::_Construct(&__node->_M_data);
294 { _M_insert_after_fill(&this->_M_head._M_data, __n, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
297 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x);
[all...] |
| _rope.c | 60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos),
65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos),
79 size_t _p_size = _M_size._M_data + 1;
92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index];
99 __x._M_buf_start = __STATIC_CAST(const _RopeLeaf*, __leaf)->_M_data;
101 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size._M_data;
108 size_t __leaf_end = __leaf_pos + __leaf->_M_size._M_data;
121 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf._M_data);
122 __x._M_buf_ptr = __x._M_tmp_buf._M_data + (__pos - __buf_start_pos);
123 __x._M_buf_start = __x._M_tmp_buf._M_data;
[all...] |
| _list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next);
72 __cur != &(_M_node._M_data)) {
75 _STLP_STD::_Destroy(&__tmp->_M_data);
78 _M_node._M_data._M_next = &_M_node._M_data;
79 _M_node._M_data._M_prev = &_M_node._M_data;
208 if (__that._M_node._M_data._M_next == &__that._M_node._M_data ||
209 __that._M_node._M_data._M_next->_M_next == &__that._M_node._M_data
[all...] |
| _rope.h | 453 _CharT* _M_data; /* Not necessarily 0 terminated. */
462 this->_M_c_string = _M_data;
472 _M_data(__d) {
486 if (_M_data != this->_M_c_string) {
489 _RopeRep::_S_free_string(_M_data, this->_M_size._M_data, this->get_allocator());
506 __l->_M_size._M_data + __r->_M_size._M_data, __a), _M_left(__l), _M_right(__r)
580 _STLP_ASSERT(__start_pos + __req_len <= this->_M_size._M_data)
581 _STLP_ASSERT(_M_start + this->_M_size._M_data <= _M_base->_M_size._M_data
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _slist.h | 61 _Tp _M_data;
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
162 { _M_head._M_data._M_next = 0; }
167 { src.get()._M_head._M_data._M_next = 0; }
170 ~_Slist_base() { _M_erase_after(&_M_head._M_data, 0); }
177 _STLP_STD::_Destroy(&__next->_M_data);
256 _Copy_Construct(&__node->_M_data, __x);
267 _STLP_STD::_Construct(&__node->_M_data);
294 { _M_insert_after_fill(&this->_M_head._M_data, __n, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
297 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x);
[all...] |
| _rope.c | 60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos),
65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos),
79 size_t _p_size = _M_size._M_data + 1;
92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index];
99 __x._M_buf_start = __STATIC_CAST(const _RopeLeaf*, __leaf)->_M_data;
101 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size._M_data;
108 size_t __leaf_end = __leaf_pos + __leaf->_M_size._M_data;
121 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf._M_data);
122 __x._M_buf_ptr = __x._M_tmp_buf._M_data + (__pos - __buf_start_pos);
123 __x._M_buf_start = __x._M_tmp_buf._M_data;
[all...] |
| _list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next);
72 __cur != &(_M_node._M_data)) {
75 _STLP_STD::_Destroy(&__tmp->_M_data);
78 _M_node._M_data._M_next = &_M_node._M_data;
79 _M_node._M_data._M_prev = &_M_node._M_data;
208 if (__that._M_node._M_data._M_next == &__that._M_node._M_data ||
209 __that._M_node._M_data._M_next->_M_next == &__that._M_node._M_data
[all...] |
| _rope.h | 453 _CharT* _M_data; /* Not necessarily 0 terminated. */
462 this->_M_c_string = _M_data;
472 _M_data(__d) {
486 if (_M_data != this->_M_c_string) {
489 _RopeRep::_S_free_string(_M_data, this->_M_size._M_data, this->get_allocator());
506 __l->_M_size._M_data + __r->_M_size._M_data, __a), _M_left(__l), _M_right(__r)
580 _STLP_ASSERT(__start_pos + __req_len <= this->_M_size._M_data)
581 _STLP_ASSERT(_M_start + this->_M_size._M_data <= _M_base->_M_size._M_data
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _slist.h | 61 _Tp _M_data;
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
162 { _M_head._M_data._M_next = 0; }
167 { src.get()._M_head._M_data._M_next = 0; }
170 ~_Slist_base() { _M_erase_after(&_M_head._M_data, 0); }
177 _STLP_STD::_Destroy(&__next->_M_data);
256 _Copy_Construct(&__node->_M_data, __x);
267 _STLP_STD::_Construct(&__node->_M_data);
294 { _M_insert_after_fill(&this->_M_head._M_data, __n, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
297 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x);
[all...] |
| _rope.c | 60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos),
65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos),
79 size_t _p_size = _M_size._M_data + 1;
92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index];
99 __x._M_buf_start = __STATIC_CAST(const _RopeLeaf*, __leaf)->_M_data;
101 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size._M_data;
108 size_t __leaf_end = __leaf_pos + __leaf->_M_size._M_data;
121 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf._M_data);
122 __x._M_buf_ptr = __x._M_tmp_buf._M_data + (__pos - __buf_start_pos);
123 __x._M_buf_start = __x._M_tmp_buf._M_data;
[all...] |
| _list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next);
72 __cur != &(_M_node._M_data)) {
75 _STLP_STD::_Destroy(&__tmp->_M_data);
78 _M_node._M_data._M_next = &_M_node._M_data;
79 _M_node._M_data._M_prev = &_M_node._M_data;
208 if (__that._M_node._M_data._M_next == &__that._M_node._M_data ||
209 __that._M_node._M_data._M_next->_M_next == &__that._M_node._M_data
[all...] |
| _rope.h | 453 _CharT* _M_data; /* Not necessarily 0 terminated. */
462 this->_M_c_string = _M_data;
472 _M_data(__d) {
486 if (_M_data != this->_M_c_string) {
489 _RopeRep::_S_free_string(_M_data, this->_M_size._M_data, this->get_allocator());
506 __l->_M_size._M_data + __r->_M_size._M_data, __a), _M_left(__l), _M_right(__r)
580 _STLP_ASSERT(__start_pos + __req_len <= this->_M_size._M_data)
581 _STLP_ASSERT(_M_start + this->_M_size._M_data <= _M_base->_M_size._M_data
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _slist.h | 61 _Tp _M_data;
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
162 { _M_head._M_data._M_next = 0; }
167 { src.get()._M_head._M_data._M_next = 0; }
170 ~_Slist_base() { _M_erase_after(&_M_head._M_data, 0); }
177 _STLP_STD::_Destroy(&__next->_M_data);
256 _Copy_Construct(&__node->_M_data, __x);
267 _STLP_STD::_Construct(&__node->_M_data);
294 { _M_insert_after_fill(&this->_M_head._M_data, __n, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
297 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x);
[all...] |
| _rope.c | 60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos),
65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos),
79 size_t _p_size = _M_size._M_data + 1;
92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index];
99 __x._M_buf_start = __STATIC_CAST(const _RopeLeaf*, __leaf)->_M_data;
101 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size._M_data;
108 size_t __leaf_end = __leaf_pos + __leaf->_M_size._M_data;
121 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf._M_data);
122 __x._M_buf_ptr = __x._M_tmp_buf._M_data + (__pos - __buf_start_pos);
123 __x._M_buf_start = __x._M_tmp_buf._M_data;
[all...] |
| _list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next);
72 __cur != &(_M_node._M_data)) {
75 _STLP_STD::_Destroy(&__tmp->_M_data);
78 _M_node._M_data._M_next = &_M_node._M_data;
79 _M_node._M_data._M_prev = &_M_node._M_data;
208 if (__that._M_node._M_data._M_next == &__that._M_node._M_data ||
209 __that._M_node._M_data._M_next->_M_next == &__that._M_node._M_data
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _slist.h | 61 _Tp _M_data;
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
162 { _M_head._M_data._M_next = 0; }
167 { src.get()._M_head._M_data._M_next = 0; }
170 ~_Slist_base() { _M_erase_after(&_M_head._M_data, 0); }
177 _STLP_STD::_Destroy(&__next->_M_data);
256 _Copy_Construct(&__node->_M_data, __x);
267 _STLP_STD::_Construct(&__node->_M_data);
294 { _M_insert_after_fill(&this->_M_head._M_data, __n, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
297 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x);
[all...] |
| _rope.c | 60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos),
65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos),
79 size_t _p_size = _M_size._M_data + 1;
92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index];
99 __x._M_buf_start = __STATIC_CAST(const _RopeLeaf*, __leaf)->_M_data;
101 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size._M_data;
108 size_t __leaf_end = __leaf_pos + __leaf->_M_size._M_data;
121 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf._M_data);
122 __x._M_buf_ptr = __x._M_tmp_buf._M_data + (__pos - __buf_start_pos);
123 __x._M_buf_start = __x._M_tmp_buf._M_data;
[all...] |
| _list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next);
72 __cur != &(_M_node._M_data)) {
75 _STLP_STD::_Destroy(&__tmp->_M_data);
78 _M_node._M_data._M_next = &_M_node._M_data;
79 _M_node._M_data._M_prev = &_M_node._M_data;
208 if (__that._M_node._M_data._M_next == &__that._M_node._M_data ||
209 __that._M_node._M_data._M_next->_M_next == &__that._M_node._M_data
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _slist.h | 61 _Tp _M_data;
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
162 { _M_head._M_data._M_next = 0; }
167 { src.get()._M_head._M_data._M_next = 0; }
170 ~_Slist_base() { _M_erase_after(&_M_head._M_data, 0); }
177 _STLP_STD::_Destroy(&__next->_M_data);
256 _Copy_Construct(&__node->_M_data, __x);
267 _STLP_STD::_Construct(&__node->_M_data);
294 { _M_insert_after_fill(&this->_M_head._M_data, __n, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
297 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x);
[all...] |
| _rope.c | 60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos),
65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos),
79 size_t _p_size = _M_size._M_data + 1;
92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index];
99 __x._M_buf_start = __STATIC_CAST(const _RopeLeaf*, __leaf)->_M_data;
101 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size._M_data;
108 size_t __leaf_end = __leaf_pos + __leaf->_M_size._M_data;
121 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf._M_data);
122 __x._M_buf_ptr = __x._M_tmp_buf._M_data + (__pos - __buf_start_pos);
123 __x._M_buf_start = __x._M_tmp_buf._M_data;
[all...] |
| _list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next);
72 __cur != &(_M_node._M_data)) {
75 _STLP_STD::_Destroy(&__tmp->_M_data);
78 _M_node._M_data._M_next = &_M_node._M_data;
79 _M_node._M_data._M_prev = &_M_node._M_data;
208 if (__that._M_node._M_data._M_next == &__that._M_node._M_data ||
209 __that._M_node._M_data._M_next->_M_next == &__that._M_node._M_data
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _slist.h | 61 _Tp _M_data;
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
162 { _M_head._M_data._M_next = 0; }
167 { src.get()._M_head._M_data._M_next = 0; }
170 ~_Slist_base() { _M_erase_after(&_M_head._M_data, 0); }
177 _STLP_STD::_Destroy(&__next->_M_data);
256 _Copy_Construct(&__node->_M_data, __x);
267 _STLP_STD::_Construct(&__node->_M_data);
294 { _M_insert_after_fill(&this->_M_head._M_data, __n, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
297 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x);
[all...] |
| _rope.c | 60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos),
65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos),
79 size_t _p_size = _M_size._M_data + 1;
92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index];
99 __x._M_buf_start = __STATIC_CAST(const _RopeLeaf*, __leaf)->_M_data;
101 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size._M_data;
108 size_t __leaf_end = __leaf_pos + __leaf->_M_size._M_data;
121 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf._M_data);
122 __x._M_buf_ptr = __x._M_tmp_buf._M_data + (__pos - __buf_start_pos);
123 __x._M_buf_start = __x._M_tmp_buf._M_data;
[all...] |
| _list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next);
72 __cur != &(_M_node._M_data)) {
75 _STLP_STD::_Destroy(&__tmp->_M_data);
78 _M_node._M_data._M_next = &_M_node._M_data;
79 _M_node._M_data._M_prev = &_M_node._M_data;
208 if (__that._M_node._M_data._M_next == &__that._M_node._M_data ||
209 __that._M_node._M_data._M_next->_M_next == &__that._M_node._M_data
[all...] |
