HomeSort by relevance Sort by last modified time
    Searched defs:__prev (Results 26 - 42 of 42) sorted by null

12

  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/
pthread.h 187 struct _pthread_cleanup_buffer *__prev; /* Chaining of cleanup functions. */ member in struct:_pthread_cleanup_buffer
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/
pthread.h 187 struct _pthread_cleanup_buffer *__prev; /* Chaining of cleanup functions. */ member in struct:_pthread_cleanup_buffer
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/
pthread.h 187 struct _pthread_cleanup_buffer *__prev; /* Chaining of cleanup functions. */ member in struct:_pthread_cleanup_buffer
    [all...]
  /external/stlport/stlport/stl/
_slist.h 374 _Node_base* __prev = &this->_M_head._M_data;
378 __prev = __node;
383 _M_insert_after_range(__prev, __first, __last);
385 this->_M_erase_after(__prev, 0);
389 _Node_base* __prev = &this->_M_head._M_data; local
393 __prev = __node;
398 _M_insert_after_range(__prev, __first, __last);
400 this->_M_erase_after(__prev, 0);
711 // Moves the element that follows __prev to *this, inserting it immediately
713 void splice_after(iterator __pos, _Self& __x, iterator __prev) {
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_slist.h 374 _Node_base* __prev = &this->_M_head._M_data;
378 __prev = __node;
383 _M_insert_after_range(__prev, __first, __last);
385 this->_M_erase_after(__prev, 0);
389 _Node_base* __prev = &this->_M_head._M_data; local
393 __prev = __node;
398 _M_insert_after_range(__prev, __first, __last);
400 this->_M_erase_after(__prev, 0);
711 // Moves the element that follows __prev to *this, inserting it immediately
713 void splice_after(iterator __pos, _Self& __x, iterator __prev) {
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
hashtable.h 998 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code); local
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/
hashtable.h 923 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code); local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
hashtable.h 998 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code); local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/
hashtable.h 923 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code); local
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_slist.h 374 _Node_base* __prev = &this->_M_head._M_data;
378 __prev = __node;
383 _M_insert_after_range(__prev, __first, __last);
385 this->_M_erase_after(__prev, 0);
389 _Node_base* __prev = &this->_M_head._M_data; local
393 __prev = __node;
398 _M_insert_after_range(__prev, __first, __last);
400 this->_M_erase_after(__prev, 0);
711 // Moves the element that follows __prev to *this, inserting it immediately
713 void splice_after(iterator __pos, _Self& __x, iterator __prev) {
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_slist.h 374 _Node_base* __prev = &this->_M_head._M_data;
378 __prev = __node;
383 _M_insert_after_range(__prev, __first, __last);
385 this->_M_erase_after(__prev, 0);
389 _Node_base* __prev = &this->_M_head._M_data; local
393 __prev = __node;
398 _M_insert_after_range(__prev, __first, __last);
400 this->_M_erase_after(__prev, 0);
711 // Moves the element that follows __prev to *this, inserting it immediately
713 void splice_after(iterator __pos, _Self& __x, iterator __prev) {
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_slist.h 374 _Node_base* __prev = &this->_M_head._M_data;
378 __prev = __node;
383 _M_insert_after_range(__prev, __first, __last);
385 this->_M_erase_after(__prev, 0);
389 _Node_base* __prev = &this->_M_head._M_data; local
393 __prev = __node;
398 _M_insert_after_range(__prev, __first, __last);
400 this->_M_erase_after(__prev, 0);
711 // Moves the element that follows __prev to *this, inserting it immediately
713 void splice_after(iterator __pos, _Self& __x, iterator __prev) {
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
hashtable.h 998 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code); local
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/
hashtable.h 923 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code); local
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
hashtable.h 1244 _BaseNode* __prev = _M_find_before_node(__bkt, __k, __code); local
1373 _BaseNode* __prev local
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/
hashtable.h 923 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code); local
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_slist.h 374 _Node_base* __prev = &this->_M_head._M_data;
378 __prev = __node;
383 _M_insert_after_range(__prev, __first, __last);
385 this->_M_erase_after(__prev, 0);
389 _Node_base* __prev = &this->_M_head._M_data; local
393 __prev = __node;
398 _M_insert_after_range(__prev, __first, __last);
400 this->_M_erase_after(__prev, 0);
711 // Moves the element that follows __prev to *this, inserting it immediately
713 void splice_after(iterator __pos, _Self& __x, iterator __prev) {
    [all...]

Completed in 1355 milliseconds

12