Searched refs:__root (Results 1 - 25 of 46) sorted by relevance

12

/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/
H A D	losertree.h	184 __init_winner(unsigned int __root) argument 186 if (__root >= _M_k) 187 return __root; 190 unsigned int __left = __init_winner(2 * __root); 191 unsigned int __right = __init_winner(2 * __root + 1); 198 _M_losers[__root] = _M_losers[__right]; 204 _M_losers[__root] = _M_losers[__left]; 277 * Computes the winner of the competition at position "__root". 281 * @param __root __index of the "game" to start. 284 __init_winner(unsigned int __root) argument 423 __init_winner(unsigned int __root) argument 505 __init_winner(unsigned int __root) argument 661 __init_winner(unsigned int __root) argument 749 __init_winner(unsigned int __root) argument 906 __init_winner(unsigned int __root) argument 992 __init_winner(unsigned int __root) argument [all...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/
H A D	losertree.h	184 __init_winner(unsigned int __root) argument 186 if (__root >= _M_k) 187 return __root; 190 unsigned int __left = __init_winner(2 * __root); 191 unsigned int __right = __init_winner(2 * __root + 1); 198 _M_losers[__root] = _M_losers[__right]; 204 _M_losers[__root] = _M_losers[__left]; 277 * Computes the winner of the competition at position "__root". 281 * @param __root __index of the "game" to start. 284 __init_winner(unsigned int __root) argument 423 __init_winner(unsigned int __root) argument 505 __init_winner(unsigned int __root) argument 661 __init_winner(unsigned int __root) argument 749 __init_winner(unsigned int __root) argument 906 __init_winner(unsigned int __root) argument 992 __init_winner(unsigned int __root) argument [all...]
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/parallel/
H A D	losertree.h	184 __init_winner(unsigned int __root) argument 186 if (__root >= _M_k) 187 return __root; 190 unsigned int __left = __init_winner(2 * __root); 191 unsigned int __right = __init_winner(2 * __root + 1); 198 _M_losers[__root] = _M_losers[__right]; 204 _M_losers[__root] = _M_losers[__left]; 277 * Computes the winner of the competition at position "__root". 281 * @param __root __index of the "game" to start. 284 __init_winner(unsigned int __root) argument 423 __init_winner(unsigned int __root) argument 505 __init_winner(unsigned int __root) argument 661 __init_winner(unsigned int __root) argument 749 __init_winner(unsigned int __root) argument 906 __init_winner(unsigned int __root) argument 992 __init_winner(unsigned int __root) argument [all...]
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/
H A D	losertree.h	184 __init_winner(unsigned int __root) argument 186 if (__root >= _M_k) 187 return __root; 190 unsigned int __left = __init_winner(2 * __root); 191 unsigned int __right = __init_winner(2 * __root + 1); 198 _M_losers[__root] = _M_losers[__right]; 204 _M_losers[__root] = _M_losers[__left]; 277 * Computes the winner of the competition at position "__root". 281 * @param __root __index of the "game" to start. 284 __init_winner(unsigned int __root) argument 423 __init_winner(unsigned int __root) argument 505 __init_winner(unsigned int __root) argument 661 __init_winner(unsigned int __root) argument 749 __init_winner(unsigned int __root) argument 906 __init_winner(unsigned int __root) argument 992 __init_winner(unsigned int __root) argument [all...]
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
H A D	losertree.h	184 __init_winner(unsigned int __root) argument 186 if (__root >= _M_k) 187 return __root; 190 unsigned int __left = __init_winner(2 * __root); 191 unsigned int __right = __init_winner(2 * __root + 1); 198 _M_losers[__root] = _M_losers[__right]; 204 _M_losers[__root] = _M_losers[__left]; 277 * Computes the winner of the competition at position "__root". 281 * @param __root __index of the "game" to start. 284 __init_winner(unsigned int __root) argument 423 __init_winner(unsigned int __root) argument 505 __init_winner(unsigned int __root) argument 661 __init_winner(unsigned int __root) argument 749 __init_winner(unsigned int __root) argument 906 __init_winner(unsigned int __root) argument 992 __init_winner(unsigned int __root) argument [all...]
/prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
H A D	losertree.h	184 __init_winner(unsigned int __root) argument 186 if (__root >= _M_k) 187 return __root; 190 unsigned int __left = __init_winner(2 * __root); 191 unsigned int __right = __init_winner(2 * __root + 1); 198 _M_losers[__root] = _M_losers[__right]; 204 _M_losers[__root] = _M_losers[__left]; 277 * Computes the winner of the competition at position "__root". 281 * @param __root __index of the "game" to start. 284 __init_winner(unsigned int __root) argument 423 __init_winner(unsigned int __root) argument 505 __init_winner(unsigned int __root) argument 661 __init_winner(unsigned int __root) argument 749 __init_winner(unsigned int __root) argument 906 __init_winner(unsigned int __root) argument 992 __init_winner(unsigned int __root) argument [all...]
/prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
H A D	losertree.h	184 __init_winner(unsigned int __root) argument 186 if (__root >= _M_k) 187 return __root; 190 unsigned int __left = __init_winner(2 * __root); 191 unsigned int __right = __init_winner(2 * __root + 1); 198 _M_losers[__root] = _M_losers[__right]; 204 _M_losers[__root] = _M_losers[__left]; 277 * Computes the winner of the competition at position "__root". 281 * @param __root __index of the "game" to start. 284 __init_winner(unsigned int __root) argument 423 __init_winner(unsigned int __root) argument 505 __init_winner(unsigned int __root) argument 661 __init_winner(unsigned int __root) argument 749 __init_winner(unsigned int __root) argument 906 __init_winner(unsigned int __root) argument 992 __init_winner(unsigned int __root) argument [all...]
/prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
H A D	losertree.h	184 __init_winner(unsigned int __root) argument 186 if (__root >= _M_k) 187 return __root; 190 unsigned int __left = __init_winner(2 * __root); 191 unsigned int __right = __init_winner(2 * __root + 1); 198 _M_losers[__root] = _M_losers[__right]; 204 _M_losers[__root] = _M_losers[__left]; 277 * Computes the winner of the competition at position "__root". 281 * @param __root __index of the "game" to start. 284 __init_winner(unsigned int __root) argument 423 __init_winner(unsigned int __root) argument 505 __init_winner(unsigned int __root) argument 661 __init_winner(unsigned int __root) argument 749 __init_winner(unsigned int __root) argument 906 __init_winner(unsigned int __root) argument 992 __init_winner(unsigned int __root) argument [all...]
/prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/
H A D	_tree.c	61 _Rb_tree_node_base*& __root) { 68 if (__x == __root) 69 __root = __y; 80 _Rb_tree_node_base*& __root) { 87 if (__x == __root) 88 __root = __y; 99 _Rb_tree_node_base*& __root) { 101 while (__x != __root && __x->_M_parent->_M_color == _S_rb_tree_red) { 113 _Rotate_left(__x, __root); 117 _Rotate_right(__x->_M_parent->_M_parent, __root); 60 _Rotate_left(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 79 _Rotate_right(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 98 _Rebalance(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 143 _Rebalance_for_erase(_Rb_tree_node_base* __z, _Rb_tree_node_base*& __root, _Rb_tree_node_base*& __leftmost, _Rb_tree_node_base*& __rightmost) argument 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) argument [all...]
H A D	_string_operators.h	130 __root_type __root(__rhs, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__lhs.get_allocator())); 133 _STLP_PRIV __on_right>(__lhs, __root); 175 __root_type __root(_STLP_PRIV __cstr_wrapper<_CharT>(__s, __n), _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator())); 177 __root_type, _STLP_PRIV __on_right>(__x, __root); 194 __root_type __root(__y, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__y.get_allocator())); 197 _STLP_PRIV __on_right>(_STLP_PRIV __cstr_wrapper<_CharT>(__s, __n), __root); 239 __root_type __root(__c, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator())); 241 __root_type, _STLP_PRIV __on_right>(__x, __root); 256 __root_type __root(__x, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator())); 258 __root_type, _STLP_PRIV __on_right>(__c, __root); [all...]
/prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/
H A D	_tree.c	61 _Rb_tree_node_base*& __root) { 68 if (__x == __root) 69 __root = __y; 80 _Rb_tree_node_base*& __root) { 87 if (__x == __root) 88 __root = __y; 99 _Rb_tree_node_base*& __root) { 101 while (__x != __root && __x->_M_parent->_M_color == _S_rb_tree_red) { 113 _Rotate_left(__x, __root); 117 _Rotate_right(__x->_M_parent->_M_parent, __root); 60 _Rotate_left(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 79 _Rotate_right(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 98 _Rebalance(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 143 _Rebalance_for_erase(_Rb_tree_node_base* __z, _Rb_tree_node_base*& __root, _Rb_tree_node_base*& __leftmost, _Rb_tree_node_base*& __rightmost) argument 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) argument [all...]
H A D	_string_operators.h	130 __root_type __root(__rhs, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__lhs.get_allocator())); 133 _STLP_PRIV __on_right>(__lhs, __root); 175 __root_type __root(_STLP_PRIV __cstr_wrapper<_CharT>(__s, __n), _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator())); 177 __root_type, _STLP_PRIV __on_right>(__x, __root); 194 __root_type __root(__y, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__y.get_allocator())); 197 _STLP_PRIV __on_right>(_STLP_PRIV __cstr_wrapper<_CharT>(__s, __n), __root); 239 __root_type __root(__c, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator())); 241 __root_type, _STLP_PRIV __on_right>(__x, __root); 256 __root_type __root(__x, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator())); 258 __root_type, _STLP_PRIV __on_right>(__c, __root); [all...]
/prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/
H A D	_tree.c	61 _Rb_tree_node_base*& __root) { 68 if (__x == __root) 69 __root = __y; 80 _Rb_tree_node_base*& __root) { 87 if (__x == __root) 88 __root = __y; 99 _Rb_tree_node_base*& __root) { 101 while (__x != __root && __x->_M_parent->_M_color == _S_rb_tree_red) { 113 _Rotate_left(__x, __root); 117 _Rotate_right(__x->_M_parent->_M_parent, __root); 60 _Rotate_left(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 79 _Rotate_right(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 98 _Rebalance(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 143 _Rebalance_for_erase(_Rb_tree_node_base* __z, _Rb_tree_node_base*& __root, _Rb_tree_node_base*& __leftmost, _Rb_tree_node_base*& __rightmost) argument 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) argument [all...]
H A D	_string_operators.h	130 __root_type __root(__rhs, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__lhs.get_allocator())); 133 _STLP_PRIV __on_right>(__lhs, __root); 175 __root_type __root(_STLP_PRIV __cstr_wrapper<_CharT>(__s, __n), _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator())); 177 __root_type, _STLP_PRIV __on_right>(__x, __root); 194 __root_type __root(__y, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__y.get_allocator())); 197 _STLP_PRIV __on_right>(_STLP_PRIV __cstr_wrapper<_CharT>(__s, __n), __root); 239 __root_type __root(__c, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator())); 241 __root_type, _STLP_PRIV __on_right>(__x, __root); 256 __root_type __root(__x, _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator())); 258 __root_type, _STLP_PRIV __on_right>(__c, __root); [all...]
/prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/
H A D	_tree.c	61 _Rb_tree_node_base*& __root) { 68 if (__x == __root) 69 __root = __y; 80 _Rb_tree_node_base*& __root) { 87 if (__x == __root) 88 __root = __y; 99 _Rb_tree_node_base*& __root) { 101 while (__x != __root && __x->_M_parent->_M_color == _S_rb_tree_red) { 113 _Rotate_left(__x, __root); 117 _Rotate_right(__x->_M_parent->_M_parent, __root); 60 _Rotate_left(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 79 _Rotate_right(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 98 _Rebalance(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 143 _Rebalance_for_erase(_Rb_tree_node_base* __z, _Rb_tree_node_base*& __root, _Rb_tree_node_base*& __leftmost, _Rb_tree_node_base*& __rightmost) argument 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) argument [all...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/
H A D	search.h	151 extern void twalk (__const void *__root, __action_fn_t __action); 159 extern void tdestroy (void *__root, __free_fn_t __freefct);
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/
H A D	search.h	151 extern void twalk (__const void *__root, __action_fn_t __action); 159 extern void tdestroy (void *__root, __free_fn_t __freefct);
/prebuilts/gdb/darwin-x86/lib/python2.7/
H A D	collections.py	47 self.__root 49 self.__root = root = [] # sentinel node 59 root = self.__root 76 root = self.__root 85 root = self.__root 93 root = self.__root
/prebuilts/gdb/linux-x86/lib/python2.7/
H A D	collections.py	47 self.__root 49 self.__root = root = [] # sentinel node 59 root = self.__root 76 root = self.__root 85 root = self.__root 93 root = self.__root
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
H A D	collections.py	47 self.__root 49 self.__root = root = [] # sentinel node 59 root = self.__root 76 root = self.__root 85 root = self.__root 93 root = self.__root
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/
H A D	collections.py	47 self.__root 49 self.__root = root = [] # sentinel node 59 root = self.__root 76 root = self.__root 85 root = self.__root 93 root = self.__root
/prebuilts/gdb/darwin-x86/lib/python2.7/distutils/
H A D	msvccompiler.py	241 self.__root = r"Software\Microsoft\VisualStudio" 244 self.__root = r"Software\Microsoft\Devstudio" 615 % (self.__root, self.__version)) 618 r"\Win32 (%s)\Directories" % (self.__root, platform)) 631 if read_values(base, r"%s\6.0" % self.__root) is not None:
/prebuilts/gdb/linux-x86/lib/python2.7/distutils/
H A D	msvccompiler.py	241 self.__root = r"Software\Microsoft\VisualStudio" 244 self.__root = r"Software\Microsoft\Devstudio" 615 % (self.__root, self.__version)) 618 r"\Win32 (%s)\Directories" % (self.__root, platform)) 631 if read_values(base, r"%s\6.0" % self.__root) is not None:
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/
H A D	msvccompiler.py	241 self.__root = r"Software\Microsoft\VisualStudio" 244 self.__root = r"Software\Microsoft\Devstudio" 615 % (self.__root, self.__version)) 618 r"\Win32 (%s)\Directories" % (self.__root, platform)) 631 if read_values(base, r"%s\6.0" % self.__root) is not None:
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/
H A D	msvccompiler.py	241 self.__root = r"Software\Microsoft\VisualStudio" 244 self.__root = r"Software\Microsoft\Devstudio" 615 % (self.__root, self.__version)) 618 r"\Win32 (%s)\Directories" % (self.__root, platform)) 631 if read_values(base, r"%s\6.0" % self.__root) is not None:

Completed in 1209 milliseconds

12

Indexes created Sun Sep 10 09:05:34 CEST 2017