/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
stl_bvector.h | 75 _Bit_reference(_Bit_type * __x, _Bit_type __y) 76 : _M_p(__x), _M_mask(__y) { } 84 operator=(bool __x) _GLIBCXX_NOEXCEPT 86 if (__x) 94 operator=(const _Bit_reference& __x) _GLIBCXX_NOEXCEPT 95 { return *this = bool(__x); } 98 operator==(const _Bit_reference& __x) const 99 { return bool(*this) == bool(__x); } 102 operator<(const _Bit_reference& __x) const 103 { return !bool(*this) && bool(__x); } 396 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local [all...] |
stl_vector.h | 101 void _M_swap_data(_Vector_impl& __x) 103 std::swap(_M_start, __x._M_start); 104 std::swap(_M_finish, __x._M_finish); 105 std::swap(_M_end_of_storage, __x._M_end_of_storage); 142 _Vector_base(_Vector_base&& __x) 143 : _M_impl(std::move(__x._M_get_Tp_allocator())) 144 { this->_M_impl._M_swap_data(__x._M_impl); } 146 _Vector_base(_Vector_base&& __x, const allocator_type& __a) 149 if (__x.get_allocator() == __a) 150 this->_M_impl._M_swap_data(__x._M_impl) 687 insert(end(), __new_size - size(), __x); local 707 insert(end(), __new_size - size(), __x); local [all...] |
stl_list.h | 83 swap(_List_node_base& __x, _List_node_base& __y) _GLIBCXX_USE_NOEXCEPT; 140 _List_iterator(__detail::_List_node_base* __x) 141 : _M_node(__x) { } 183 operator==(const _Self& __x) const 184 { return _M_node == __x._M_node; } 187 operator!=(const _Self& __x) const 188 { return _M_node != __x._M_node; } 216 _List_const_iterator(const __detail::_List_node_base* __x) 217 : _M_node(__x) { } 219 _List_const_iterator(const iterator& __x) 975 { this->_M_insert(begin(), __x); } local 1016 { this->_M_insert(end(), __x); } local 1481 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
stl_tree.h | 102 _S_minimum(_Base_ptr __x) 104 while (__x->_M_left != 0) __x = __x->_M_left; 105 return __x; 109 _S_minimum(_Const_Base_ptr __x) 111 while (__x->_M_left != 0) __x = __x->_M_left; 112 return __x; 1069 _Link_type __x = _M_begin(); local 1205 _Link_type __x = _M_begin(); local 1236 _Const_Link_type __x = _M_begin(); local 1318 _Link_type __x = _M_begin(); local 1350 _Link_type __x = _M_begin(); local 1603 _Link_type __x = _M_begin(); local 1839 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node); local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
stl_bvector.h | 75 _Bit_reference(_Bit_type * __x, _Bit_type __y) 76 : _M_p(__x), _M_mask(__y) { } 84 operator=(bool __x) _GLIBCXX_NOEXCEPT 86 if (__x) 94 operator=(const _Bit_reference& __x) _GLIBCXX_NOEXCEPT 95 { return *this = bool(__x); } 98 operator==(const _Bit_reference& __x) const 99 { return bool(*this) == bool(__x); } 102 operator<(const _Bit_reference& __x) const 103 { return !bool(*this) && bool(__x); } 396 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local [all...] |
stl_vector.h | 101 void _M_swap_data(_Vector_impl& __x) 103 std::swap(_M_start, __x._M_start); 104 std::swap(_M_finish, __x._M_finish); 105 std::swap(_M_end_of_storage, __x._M_end_of_storage); 142 _Vector_base(_Vector_base&& __x) 143 : _M_impl(std::move(__x._M_get_Tp_allocator())) 144 { this->_M_impl._M_swap_data(__x._M_impl); } 146 _Vector_base(_Vector_base&& __x, const allocator_type& __a) 149 if (__x.get_allocator() == __a) 150 this->_M_impl._M_swap_data(__x._M_impl) 687 insert(end(), __new_size - size(), __x); local 707 insert(end(), __new_size - size(), __x); local [all...] |
stl_list.h | 83 swap(_List_node_base& __x, _List_node_base& __y) _GLIBCXX_USE_NOEXCEPT; 140 _List_iterator(__detail::_List_node_base* __x) 141 : _M_node(__x) { } 183 operator==(const _Self& __x) const 184 { return _M_node == __x._M_node; } 187 operator!=(const _Self& __x) const 188 { return _M_node != __x._M_node; } 216 _List_const_iterator(const __detail::_List_node_base* __x) 217 : _M_node(__x) { } 219 _List_const_iterator(const iterator& __x) 975 { this->_M_insert(begin(), __x); } local 1016 { this->_M_insert(end(), __x); } local 1481 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
stl_bvector.h | 75 _Bit_reference(_Bit_type * __x, _Bit_type __y) 76 : _M_p(__x), _M_mask(__y) { } 84 operator=(bool __x) _GLIBCXX_NOEXCEPT 86 if (__x) 94 operator=(const _Bit_reference& __x) _GLIBCXX_NOEXCEPT 95 { return *this = bool(__x); } 98 operator==(const _Bit_reference& __x) const 99 { return bool(*this) == bool(__x); } 102 operator<(const _Bit_reference& __x) const 103 { return !bool(*this) && bool(__x); } 404 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local [all...] |
stl_vector.h | 115 void _M_swap_data(_Vector_impl& __x) _GLIBCXX_NOEXCEPT 117 std::swap(_M_start, __x._M_start); 118 std::swap(_M_finish, __x._M_finish); 119 std::swap(_M_end_of_storage, __x._M_end_of_storage); 156 _Vector_base(_Vector_base&& __x) noexcept 157 : _M_impl(std::move(__x._M_get_Tp_allocator())) 158 { this->_M_impl._M_swap_data(__x._M_impl); } 160 _Vector_base(_Vector_base&& __x, const allocator_type& __a) 163 if (__x.get_allocator() == __a) 164 this->_M_impl._M_swap_data(__x._M_impl) 770 insert(end(), __new_size - size(), __x); local 790 insert(end(), __new_size - size(), __x); local [all...] |
/ndk/sources/cxx-stl/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...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
stl_vector.h | 101 void _M_swap_data(_Vector_impl& __x) 103 std::swap(_M_start, __x._M_start); 104 std::swap(_M_finish, __x._M_finish); 105 std::swap(_M_end_of_storage, __x._M_end_of_storage); 142 _Vector_base(_Vector_base&& __x) 143 : _M_impl(std::move(__x._M_get_Tp_allocator())) 144 { this->_M_impl._M_swap_data(__x._M_impl); } 146 _Vector_base(_Vector_base&& __x, const allocator_type& __a) 149 if (__x.get_allocator() == __a) 150 this->_M_impl._M_swap_data(__x._M_impl) 687 insert(end(), __new_size - size(), __x); local 707 insert(end(), __new_size - size(), __x); local [all...] |
stl_list.h | 83 swap(_List_node_base& __x, _List_node_base& __y) _GLIBCXX_USE_NOEXCEPT; 140 _List_iterator(__detail::_List_node_base* __x) 141 : _M_node(__x) { } 183 operator==(const _Self& __x) const 184 { return _M_node == __x._M_node; } 187 operator!=(const _Self& __x) const 188 { return _M_node != __x._M_node; } 216 _List_const_iterator(const __detail::_List_node_base* __x) 217 : _M_node(__x) { } 219 _List_const_iterator(const iterator& __x) 975 { this->_M_insert(begin(), __x); } local 1016 { this->_M_insert(end(), __x); } local 1481 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local [all...] |
stl_tree.h | 102 _S_minimum(_Base_ptr __x) 104 while (__x->_M_left != 0) __x = __x->_M_left; 105 return __x; 109 _S_minimum(_Const_Base_ptr __x) 111 while (__x->_M_left != 0) __x = __x->_M_left; 112 return __x; 1069 _Link_type __x = _M_begin(); local 1205 _Link_type __x = _M_begin(); local 1236 _Const_Link_type __x = _M_begin(); local 1318 _Link_type __x = _M_begin(); local 1350 _Link_type __x = _M_begin(); local 1603 _Link_type __x = _M_begin(); local 1839 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node); local [all...] |
/external/opencv3/modules/calib3d/test/ |
test_undistort.cpp | 535 double __x = _x; local 541 __x = _x*(1+_distCoeffs->data.db[0]*r2+_distCoeffs->data.db[1]*r2*r2)+ 547 __x+=_x*_distCoeffs->data.db[4]*r2*r2*r2; 553 _dst->data.db[2*i] = __x*_cameraMatrix->data.db[0]+_cameraMatrix->data.db[2]; [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
_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...] |
_vector.h | 144 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type& /*_Movable*/, 146 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __true_type& /*_Movable*/, 149 if (_M_is_inside(__x)) { 150 value_type __x_copy = __x; 154 _M_insert_overflow_aux(__pos, __x, __false_type(), __fill_len, __atend); 157 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __false_type& /*_TrivialCopy*/, 162 _M_insert_overflow_aux(__pos, __x, _Movable(), __fill_len, __atend); 164 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __true_type& /*_TrivialCopy*/, 246 vector(const _Self& __x) 247 : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__x.size(), __x.get_allocator()) 643 insert(end(), __new_size - size(), __x); local [all...] |
_bvector.h | 45 _Bit_reference(unsigned int* __x, unsigned int __y) 46 : _M_p(__x), _M_mask(__y) {} 54 _Bit_reference& operator = (bool __x) { 55 if (__x) *_M_p |= _M_mask; 59 _Bit_reference& operator = (const _Bit_reference& __x) { 60 return *this = bool(__x); 62 bool operator == (const _Bit_reference& __x) const { 63 return bool(*this) == bool(__x); 65 bool operator < (const _Bit_reference& __x) const { 66 return !bool(*this) && bool(__x); 600 insert(end(), __n - size(), __x); local 674 _M_insert_aux(end(), __x); local 804 insert(end(), __new_size - size(), __x); local [all...] |
/prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/ |
_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...] |
_vector.h | 144 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type& /*_Movable*/, 146 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __true_type& /*_Movable*/, 149 if (_M_is_inside(__x)) { 150 value_type __x_copy = __x; 154 _M_insert_overflow_aux(__pos, __x, __false_type(), __fill_len, __atend); 157 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __false_type& /*_TrivialCopy*/, 162 _M_insert_overflow_aux(__pos, __x, _Movable(), __fill_len, __atend); 164 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __true_type& /*_TrivialCopy*/, 246 vector(const _Self& __x) 247 : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__x.size(), __x.get_allocator()) 643 insert(end(), __new_size - size(), __x); local [all...] |
/external/libunwind_llvm/src/ |
Registers.hpp | 1058 uint64_t __x[29]; // x0-x28 member in struct:libunwind::Registers_arm64::GPRs 1110 return _registers.__x[regNum]; 1120 _registers.__x[regNum] = value; [all...] |
/ndk/sources/cxx-stl/llvm-libc++abi/libcxxabi/src/Unwind/ |
Registers.hpp | 1058 uint64_t __x[29]; // x0-x28 member in struct:libunwind::Registers_arm64::GPRs 1110 return _registers.__x[regNum]; 1120 _registers.__x[regNum] = value; [all...] |