HomeSort by relevance Sort by last modified time
    Searched defs:__x (Results 1 - 25 of 55) sorted by null

1 2 3

  /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/libs/armeabi/include/bits/
ctype_noninline.h 66 int __x = __c; local
67 return (this->is(ctype_base::lower, __c) ? (__x - 'a' + 'A') : __x);
84 int __x = __c; local
85 return (this->is(ctype_base::upper, __c) ? (__x - 'A' + 'a') : __x);
  /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/libs/armeabi-v7a/include/bits/
ctype_noninline.h 66 int __x = __c; local
67 return (this->is(ctype_base::lower, __c) ? (__x - 'a' + 'A') : __x);
84 int __x = __c; local
85 return (this->is(ctype_base::upper, __c) ? (__x - 'A' + 'a') : __x);
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/libs/armeabi/include/bits/
ctype_noninline.h 66 int __x = __c; local
67 return (this->is(ctype_base::lower, __c) ? (__x - 'a' + 'A') : __x);
84 int __x = __c; local
85 return (this->is(ctype_base::upper, __c) ? (__x - 'A' + 'a') : __x);
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/libs/armeabi-v7a/include/bits/
ctype_noninline.h 66 int __x = __c; local
67 return (this->is(ctype_base::lower, __c) ? (__x - 'a' + 'A') : __x);
84 int __x = __c; local
85 return (this->is(ctype_base::upper, __c) ? (__x - 'A' + 'a') : __x);
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/libs/x86/include/bits/
ctype_noninline.h 66 int __x = __c; local
67 return (this->is(ctype_base::lower, __c) ? (__x - 'a' + 'A') : __x);
84 int __x = __c; local
85 return (this->is(ctype_base::upper, __c) ? (__x - 'A' + 'a') : __x);
  /external/stlport/stlport/stl/
_list.c 95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) {
103 insert(end(), __new_size - __len, __x); local
107 list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x) {
108 if (this != &__x) {
111 const_iterator __first2 = __x.begin();
112 const_iterator __last2 = __x.end();
168 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x,
173 _Literator __first2 = __x.begin();
174 _Literator __last2 = __x.end();
175 if (__that.get_allocator() == __x.get_allocator())
    [all...]
_tree.c 60 _Rb_global<_Dummy>::_Rotate_left(_Rb_tree_node_base* __x,
62 _Rb_tree_node_base* __y = __x->_M_right;
63 __x->_M_right = __y->_M_left;
65 __y->_M_left->_M_parent = __x;
66 __y->_M_parent = __x->_M_parent;
68 if (__x == __root)
70 else if (__x == __x->_M_parent->_M_left)
71 __x->_M_parent->_M_left = __y;
73 __x->_M_parent->_M_right = __y
148 _Rb_tree_node_base* __x; local
389 _Base_ptr __x = _M_root(); local
407 _Base_ptr __x = _M_root(); local
691 _Base_ptr __x = __it._M_node; local
    [all...]
_list.h 89 _List_iterator_base(_List_node_base* __x) : _M_node(__x) {}
113 explicit _List_iterator(_List_node_base* __x) : _List_iterator_base(__x) {}
116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {}
242 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x,
281 _Node_base* _M_create_node(const_reference __x = value_type()) {
283 _Node_base* _M_create_node(const_reference __x) {
287 _Copy_Construct(&__p->_M_data, __x);
508 void push_front(const_reference __x) { insert(begin(), __x); } local
509 void push_back (const_reference __x) { insert(end(), __x); } local
    [all...]
_slist.h 72 _Slist_iterator_base(_Slist_node_base *__x) : _M_node(__x) {}
97 explicit _Slist_iterator(_Slist_node_base *__x) : _Slist_iterator_base(__x) {}
100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {}
209 void _Slist_merge(slist<_Tp, _Alloc>& __that, slist<_Tp, _Alloc>& __x,
250 _Node* _M_create_node(const value_type& __x = _Tp()) {
252 _Node* _M_create_node(const value_type& __x) {
256 _Copy_Construct(&__node->_M_data, __x);
574 __n, __x); local
651 _M_insert_after_fill(_STLP_PRIV _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node), __n, __x); local
    [all...]
_tree.h 93 static _Base_ptr _STLP_CALL _S_minimum(_Base_ptr __x) {
94 while (__x->_M_left != 0) __x = __x->_M_left;
95 return __x;
98 static _Base_ptr _STLP_CALL _S_maximum(_Base_ptr __x) {
99 while (__x->_M_right != 0) __x = __x->_M_right;
100 return __x;
493 _Base_ptr __x = _Rb_global_inst::_Rebalance_for_erase(__pos._M_node, local
550 _Base_ptr __x = _M_root(); \/\/ Current node. local
569 _Base_ptr __x = _M_root(); \/* Current node. *\/ local
583 _Base_ptr __x = _M_root(); \/* Current node. *\/ local
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_list.c 95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) {
103 insert(end(), __new_size - __len, __x); local
107 list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x) {
108 if (this != &__x) {
111 const_iterator __first2 = __x.begin();
112 const_iterator __last2 = __x.end();
168 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x,
173 _Literator __first2 = __x.begin();
174 _Literator __last2 = __x.end();
175 if (__that.get_allocator() == __x.get_allocator())
    [all...]
_tree.c 60 _Rb_global<_Dummy>::_Rotate_left(_Rb_tree_node_base* __x,
62 _Rb_tree_node_base* __y = __x->_M_right;
63 __x->_M_right = __y->_M_left;
65 __y->_M_left->_M_parent = __x;
66 __y->_M_parent = __x->_M_parent;
68 if (__x == __root)
70 else if (__x == __x->_M_parent->_M_left)
71 __x->_M_parent->_M_left = __y;
73 __x->_M_parent->_M_right = __y
148 _Rb_tree_node_base* __x; local
389 _Base_ptr __x = _M_root(); local
407 _Base_ptr __x = _M_root(); local
691 _Base_ptr __x = __it._M_node; local
    [all...]
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
boost_concept_check.h 57 void (_Concept::*__x)() _IsUnused = &_Concept::__constraints;
218 _To __y _IsUnused = __x;
220 _From __x; member in struct:_ConvertibleConcept
234 bool __x _IsUnused = __t;
stl_vector.h 119 _Vector_base(_Vector_base&& __x)
120 : _M_impl(__x._M_get_Tp_allocator())
122 this->_M_impl._M_start = __x._M_impl._M_start;
123 this->_M_impl._M_finish = __x._M_impl._M_finish;
124 this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;
125 __x._M_impl._M_start = 0;
126 __x._M_impl._M_finish = 0;
127 __x._M_impl._M_end_of_storage = 0;
241 vector(const vector& __x)
242 : _Base(__x.size(), __x._M_get_Tp_allocator()
557 insert(end(), __new_size - size(), __x); local
757 _M_insert_aux(end(), __x); local
    [all...]
  /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/
boost_concept_check.h 57 void (_Concept::*__x)() _IsUnused = &_Concept::__constraints;
218 _To __y _IsUnused = __x;
220 _From __x; member in struct:_ConvertibleConcept
234 bool __x _IsUnused = __t;
stl_vector.h 119 _Vector_base(_Vector_base&& __x)
120 : _M_impl(__x._M_get_Tp_allocator())
122 this->_M_impl._M_start = __x._M_impl._M_start;
123 this->_M_impl._M_finish = __x._M_impl._M_finish;
124 this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;
125 __x._M_impl._M_start = 0;
126 __x._M_impl._M_finish = 0;
127 __x._M_impl._M_end_of_storage = 0;
241 vector(const vector& __x)
242 : _Base(__x.size(), __x._M_get_Tp_allocator()
557 insert(end(), __new_size - size(), __x); local
757 _M_insert_aux(end(), __x); local
    [all...]
  /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/
_list.c 95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) {
103 insert(end(), __new_size - __len, __x); local
107 list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x) {
108 if (this != &__x) {
111 const_iterator __first2 = __x.begin();
112 const_iterator __last2 = __x.end();
168 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x,
173 _Literator __first2 = __x.begin();
174 _Literator __last2 = __x.end();
175 if (__that.get_allocator() == __x.get_allocator())
    [all...]
_tree.c 60 _Rb_global<_Dummy>::_Rotate_left(_Rb_tree_node_base* __x,
62 _Rb_tree_node_base* __y = __x->_M_right;
63 __x->_M_right = __y->_M_left;
65 __y->_M_left->_M_parent = __x;
66 __y->_M_parent = __x->_M_parent;
68 if (__x == __root)
70 else if (__x == __x->_M_parent->_M_left)
71 __x->_M_parent->_M_left = __y;
73 __x->_M_parent->_M_right = __y
148 _Rb_tree_node_base* __x; local
389 _Base_ptr __x = _M_root(); local
407 _Base_ptr __x = _M_root(); local
691 _Base_ptr __x = __it._M_node; local
    [all...]
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/
boost_concept_check.h 57 void (_Concept::*__x)() _IsUnused = &_Concept::__constraints;
218 _To __y _IsUnused = __x;
220 _From __x; member in struct:_ConvertibleConcept
234 bool __x _IsUnused = __t;
stl_vector.h 119 _Vector_base(_Vector_base&& __x)
120 : _M_impl(__x._M_get_Tp_allocator())
122 this->_M_impl._M_start = __x._M_impl._M_start;
123 this->_M_impl._M_finish = __x._M_impl._M_finish;
124 this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;
125 __x._M_impl._M_start = 0;
126 __x._M_impl._M_finish = 0;
127 __x._M_impl._M_end_of_storage = 0;
241 vector(const vector& __x)
242 : _Base(__x.size(), __x._M_get_Tp_allocator()
557 insert(end(), __new_size - size(), __x); local
757 _M_insert_aux(end(), __x); local
    [all...]
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/
_list.c 95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) {
103 insert(end(), __new_size - __len, __x); local
107 list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x) {
108 if (this != &__x) {
111 const_iterator __first2 = __x.begin();
112 const_iterator __last2 = __x.end();
168 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x,
173 _Literator __first2 = __x.begin();
174 _Literator __last2 = __x.end();
175 if (__that.get_allocator() == __x.get_allocator())
    [all...]
_tree.c 60 _Rb_global<_Dummy>::_Rotate_left(_Rb_tree_node_base* __x,
62 _Rb_tree_node_base* __y = __x->_M_right;
63 __x->_M_right = __y->_M_left;
65 __y->_M_left->_M_parent = __x;
66 __y->_M_parent = __x->_M_parent;
68 if (__x == __root)
70 else if (__x == __x->_M_parent->_M_left)
71 __x->_M_parent->_M_left = __y;
73 __x->_M_parent->_M_right = __y
148 _Rb_tree_node_base* __x; local
389 _Base_ptr __x = _M_root(); local
407 _Base_ptr __x = _M_root(); local
691 _Base_ptr __x = __it._M_node; local
    [all...]
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/
stdlib.h 420 unsigned short int __x[3]; /* Current state. */ member in struct:drand48_data
691 extern int abs (int __x) __THROW __attribute__ ((__const__)) __wur;
692 extern long int labs (long int __x) __THROW __attribute__ ((__const__)) __wur;
696 __extension__ extern long long int llabs (long long int __x)
  /external/stlport/src/
num_put_float.cpp 588 float_sign_helper(_FloatT __x)
589 { _M_number._num = __x; }
844 void _STLP_CALL __get_floor_digits(__iostring &out, _STLP_LONGEST_FLOAT_TYPE __x) {
849 snprintf(_STLP_ARRAY_AND_SIZE(cvtbuf), "%Lf", __x); // check for 1234.56! local
851 snprintf(_STLP_ARRAY_AND_SIZE(cvtbuf), "%f", __x); // check for 1234.56! local
863 bp = _Stl_fcvtR(__x, 0, &decpt, &sign, _STLP_CVT_BUFFER(cvtbuf));
    [all...]
  /ndk/sources/cxx-stl/stlport/src/
num_put_float.cpp 587 float_sign_helper(_FloatT __x)
588 { _M_number._num = __x; }
843 void _STLP_CALL __get_floor_digits(__iostring &out, _STLP_LONGEST_FLOAT_TYPE __x) {
848 snprintf(_STLP_ARRAY_AND_SIZE(cvtbuf), "%Lf", __x); // check for 1234.56! local
850 snprintf(_STLP_ARRAY_AND_SIZE(cvtbuf), "%f", __x); // check for 1234.56! local
862 bp = _Stl_fcvtR(__x, 0, &decpt, &sign, _STLP_CVT_BUFFER(cvtbuf));
    [all...]

Completed in 468 milliseconds

1 2 3