| /external/stlport/stlport/stl/ |
| _tree.h | 332 size_type _M_node_count; // keeps track of size of tree
383 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(_Compare())
387 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(__comp)
391 : _Rb_tree_base<_Value, _Alloc>(__a), _M_node_count(0), _M_key_compare(__comp)
396 _M_node_count(0), _M_key_compare(__x._M_key_compare) {
403 _M_node_count = __x._M_node_count;
409 _M_node_count(src.get()._M_node_count),
411 { src.get()._M_node_count = 0;
[all...] |
| _tree.c | 326 _M_node_count = 0;
337 _M_node_count = __x._M_node_count;
380 ++_M_node_count;
683 if (_M_node_count == 0 || begin() == end())
684 return ((_M_node_count == 0) &&
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 332 size_type _M_node_count; // keeps track of size of tree
383 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(_Compare())
387 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(__comp)
391 : _Rb_tree_base<_Value, _Alloc>(__a), _M_node_count(0), _M_key_compare(__comp)
396 _M_node_count(0), _M_key_compare(__x._M_key_compare) {
403 _M_node_count = __x._M_node_count;
409 _M_node_count(src.get()._M_node_count),
411 { src.get()._M_node_count = 0;
[all...] |
| _tree.c | 326 _M_node_count = 0;
337 _M_node_count = __x._M_node_count;
380 ++_M_node_count;
683 if (_M_node_count == 0 || begin() == end())
684 return ((_M_node_count == 0) &&
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 332 size_type _M_node_count; // keeps track of size of tree
383 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(_Compare())
387 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(__comp)
391 : _Rb_tree_base<_Value, _Alloc>(__a), _M_node_count(0), _M_key_compare(__comp)
396 _M_node_count(0), _M_key_compare(__x._M_key_compare) {
403 _M_node_count = __x._M_node_count;
409 _M_node_count(src.get()._M_node_count),
411 { src.get()._M_node_count = 0;
[all...] |
| _tree.c | 326 _M_node_count = 0;
337 _M_node_count = __x._M_node_count;
380 ++_M_node_count;
683 if (_M_node_count == 0 || begin() == end())
684 return ((_M_node_count == 0) &&
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 332 size_type _M_node_count; // keeps track of size of tree
383 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(_Compare())
387 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(__comp)
391 : _Rb_tree_base<_Value, _Alloc>(__a), _M_node_count(0), _M_key_compare(__comp)
396 _M_node_count(0), _M_key_compare(__x._M_key_compare) {
403 _M_node_count = __x._M_node_count;
409 _M_node_count(src.get()._M_node_count),
411 { src.get()._M_node_count = 0;
[all...] |
| _tree.c | 326 _M_node_count = 0;
337 _M_node_count = __x._M_node_count;
380 ++_M_node_count;
683 if (_M_node_count == 0 || begin() == end())
684 return ((_M_node_count == 0) &&
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 332 size_type _M_node_count; // keeps track of size of tree
383 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(_Compare())
387 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(__comp)
391 : _Rb_tree_base<_Value, _Alloc>(__a), _M_node_count(0), _M_key_compare(__comp)
396 _M_node_count(0), _M_key_compare(__x._M_key_compare) {
403 _M_node_count = __x._M_node_count;
409 _M_node_count(src.get()._M_node_count),
411 { src.get()._M_node_count = 0;
[all...] |
| _tree.c | 326 _M_node_count = 0;
337 _M_node_count = __x._M_node_count;
380 ++_M_node_count;
683 if (_M_node_count == 0 || begin() == end())
684 return ((_M_node_count == 0) &&
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 332 size_type _M_node_count; // keeps track of size of tree
383 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(_Compare())
387 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(__comp)
391 : _Rb_tree_base<_Value, _Alloc>(__a), _M_node_count(0), _M_key_compare(__comp)
396 _M_node_count(0), _M_key_compare(__x._M_key_compare) {
403 _M_node_count = __x._M_node_count;
409 _M_node_count(src.get()._M_node_count),
411 { src.get()._M_node_count = 0;
[all...] |
| _tree.c | 326 _M_node_count = 0;
337 _M_node_count = __x._M_node_count;
380 ++_M_node_count;
683 if (_M_node_count == 0 || begin() == end())
684 return ((_M_node_count == 0) &&
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_tree.h | 430 size_type _M_node_count; // Keeps track of size of tree.
434 _M_node_count(0)
439 _M_node_count(0)
645 _M_impl._M_node_count = __x._M_impl._M_node_count;
707 { return _M_impl._M_node_count == 0; }
711 { return _M_impl._M_node_count; }
770 _M_impl._M_node_count = 0;
883 this->_M_impl._M_node_count = __x._M_impl._M_node_count;
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_tree.h | 430 size_type _M_node_count; // Keeps track of size of tree.
434 _M_node_count(0)
439 _M_node_count(0)
645 _M_impl._M_node_count = __x._M_impl._M_node_count;
707 { return _M_impl._M_node_count == 0; }
711 { return _M_impl._M_node_count; }
770 _M_impl._M_node_count = 0;
883 this->_M_impl._M_node_count = __x._M_impl._M_node_count;
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_tree.h | 430 size_type _M_node_count; // Keeps track of size of tree.
434 _M_node_count(0)
439 _M_node_count(0)
645 _M_impl._M_node_count = __x._M_impl._M_node_count;
707 { return _M_impl._M_node_count == 0; }
711 { return _M_impl._M_node_count; }
770 _M_impl._M_node_count = 0;
883 this->_M_impl._M_node_count = __x._M_impl._M_node_count;
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_tree.h | 430 size_type _M_node_count; // Keeps track of size of tree.
434 _M_node_count(0)
439 _M_node_count(0)
645 _M_impl._M_node_count = __x._M_impl._M_node_count;
707 { return _M_impl._M_node_count == 0; }
711 { return _M_impl._M_node_count; }
770 _M_impl._M_node_count = 0;
883 this->_M_impl._M_node_count = __x._M_impl._M_node_count;
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_tree.h | 430 size_type _M_node_count; // Keeps track of size of tree.
434 _M_node_count(0)
439 _M_node_count(0)
645 _M_impl._M_node_count = __x._M_impl._M_node_count;
707 { return _M_impl._M_node_count == 0; }
711 { return _M_impl._M_node_count; }
770 _M_impl._M_node_count = 0;
883 this->_M_impl._M_node_count = __x._M_impl._M_node_count;
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_tree.h | 441 size_type _M_node_count; // Keeps track of size of tree.
445 _M_node_count(0)
450 _M_node_count(0)
670 _M_impl._M_node_count = __x._M_impl._M_node_count;
732 { return _M_impl._M_node_count == 0; }
736 { return _M_impl._M_node_count; }
853 _M_impl._M_node_count = 0;
966 this->_M_impl._M_node_count = __x._M_impl._M_node_count;
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_tree.h | 441 size_type _M_node_count; // Keeps track of size of tree.
445 _M_node_count(0)
450 _M_node_count(0)
670 _M_impl._M_node_count = __x._M_impl._M_node_count;
732 { return _M_impl._M_node_count == 0; }
736 { return _M_impl._M_node_count; }
853 _M_impl._M_node_count = 0;
966 this->_M_impl._M_node_count = __x._M_impl._M_node_count;
[all...] |
