Searched defs:__after (Results 1 - 25 of 34) sorted by relevance

12

/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
H A D_slist_base.c51 _Slist_node_base* __after = __pos->_M_next; local
54 __before_last->_M_next = __after;
65 _Slist_node_base* __after = __pos->_M_next; local
68 __before_last->_M_next = __after;
H A D_tree.c453 iterator __after = __position;
454 ++__after;
458 if (__after._M_node == &this->_M_header._M_data)
468 if (_M_key_compare( _KeyOfValue()(__val), _S_key(__after._M_node) )) {
472 return _M_insert(__after._M_node, __val, __after._M_node);
505 iterator __after = __position; local
506 ++__after;
519 && (__after._M_node == &this->_M_header._M_data ||
520 _M_key_compare( _KeyOfValue()(__val), _S_key(__after
603 iterator __after = __position; local
[all...]
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
H A D_slist_base.c51 _Slist_node_base* __after = __pos->_M_next; local
54 __before_last->_M_next = __after;
65 _Slist_node_base* __after = __pos->_M_next; local
68 __before_last->_M_next = __after;
H A D_tree.c453 iterator __after = __position;
454 ++__after;
458 if (__after._M_node == &this->_M_header._M_data)
468 if (_M_key_compare( _KeyOfValue()(__val), _S_key(__after._M_node) )) {
472 return _M_insert(__after._M_node, __val, __after._M_node);
505 iterator __after = __position; local
506 ++__after;
519 && (__after._M_node == &this->_M_header._M_data ||
520 _M_key_compare( _KeyOfValue()(__val), _S_key(__after
603 iterator __after = __position; local
[all...]
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
H A D_slist_base.c51 _Slist_node_base* __after = __pos->_M_next; local
54 __before_last->_M_next = __after;
65 _Slist_node_base* __after = __pos->_M_next; local
68 __before_last->_M_next = __after;
H A D_tree.c453 iterator __after = __position;
454 ++__after;
458 if (__after._M_node == &this->_M_header._M_data)
468 if (_M_key_compare( _KeyOfValue()(__val), _S_key(__after._M_node) )) {
472 return _M_insert(__after._M_node, __val, __after._M_node);
505 iterator __after = __position; local
506 ++__after;
519 && (__after._M_node == &this->_M_header._M_data ||
520 _M_key_compare( _KeyOfValue()(__val), _S_key(__after
603 iterator __after = __position; local
[all...]
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
H A D_slist_base.c51 _Slist_node_base* __after = __pos->_M_next; local
54 __before_last->_M_next = __after;
65 _Slist_node_base* __after = __pos->_M_next; local
68 __before_last->_M_next = __after;
H A D_tree.c453 iterator __after = __position;
454 ++__after;
458 if (__after._M_node == &this->_M_header._M_data)
468 if (_M_key_compare( _KeyOfValue()(__val), _S_key(__after._M_node) )) {
472 return _M_insert(__after._M_node, __val, __after._M_node);
505 iterator __after = __position; local
506 ++__after;
519 && (__after._M_node == &this->_M_header._M_data ||
520 _M_key_compare( _KeyOfValue()(__val), _S_key(__after
603 iterator __after = __position; local
[all...]
/prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/
H A D_slist_base.c51 _Slist_node_base* __after = __pos->_M_next; local
54 __before_last->_M_next = __after;
65 _Slist_node_base* __after = __pos->_M_next; local
68 __before_last->_M_next = __after;
H A D_tree.c453 iterator __after = __position;
454 ++__after;
458 if (__after._M_node == &this->_M_header._M_data)
468 if (_M_key_compare( _KeyOfValue()(__val), _S_key(__after._M_node) )) {
472 return _M_insert(__after._M_node, __val, __after._M_node);
505 iterator __after = __position; local
506 ++__after;
519 && (__after._M_node == &this->_M_header._M_data ||
520 _M_key_compare( _KeyOfValue()(__val), _S_key(__after
603 iterator __after = __position; local
[all...]
/prebuilts/ndk/9/sources/cxx-stl/stlport/stlport/stl/
H A D_slist_base.c51 _Slist_node_base* __after = __pos->_M_next; local
54 __before_last->_M_next = __after;
65 _Slist_node_base* __after = __pos->_M_next; local
68 __before_last->_M_next = __after;
H A D_tree.c453 iterator __after = __position;
454 ++__after;
458 if (__after._M_node == &this->_M_header._M_data)
468 if (_M_key_compare( _KeyOfValue()(__val), _S_key(__after._M_node) )) {
472 return _M_insert(__after._M_node, __val, __after._M_node);
505 iterator __after = __position; local
506 ++__after;
519 && (__after._M_node == &this->_M_header._M_data ||
520 _M_key_compare( _KeyOfValue()(__val), _S_key(__after
603 iterator __after = __position; local
[all...]
/prebuilts/ndk/current/sources/cxx-stl/EH/stlport/stlport/stl/
H A D_slist_base.c51 _Slist_node_base* __after = __pos->_M_next; local
54 __before_last->_M_next = __after;
65 _Slist_node_base* __after = __pos->_M_next; local
68 __before_last->_M_next = __after;
H A D_tree.c453 iterator __after = __position;
454 ++__after;
458 if (__after._M_node == &this->_M_header._M_data)
468 if (_M_key_compare( _KeyOfValue()(__val), _S_key(__after._M_node) )) {
472 return _M_insert(__after._M_node, __val, __after._M_node);
505 iterator __after = __position; local
506 ++__after;
519 && (__after._M_node == &this->_M_header._M_data ||
520 _M_key_compare( _KeyOfValue()(__val), _S_key(__after
603 iterator __after = __position; local
[all...]
/prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/
H A D_slist_base.c51 _Slist_node_base* __after = __pos->_M_next; local
54 __before_last->_M_next = __after;
65 _Slist_node_base* __after = __pos->_M_next; local
68 __before_last->_M_next = __after;
H A D_tree.c453 iterator __after = __position;
454 ++__after;
458 if (__after._M_node == &this->_M_header._M_data)
468 if (_M_key_compare( _KeyOfValue()(__val), _S_key(__after._M_node) )) {
472 return _M_insert(__after._M_node, __val, __after._M_node);
505 iterator __after = __position; local
506 ++__after;
519 && (__after._M_node == &this->_M_header._M_data ||
520 _M_key_compare( _KeyOfValue()(__val), _S_key(__after
603 iterator __after = __position; local
[all...]
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
H A Dstl_tree.h1282 const_iterator __after = __position; local
1286 _S_key((++__after)._M_node)))
1291 return _M_insert_(__after._M_node, __after._M_node, __v);
1340 const_iterator __after = __position; local
1343 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1349 return _M_insert_(__after._M_node, __after._M_node, __v);
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
H A Dstl_tree.h1408 const_iterator __after = __position; local
1413 _S_key((++__after)._M_node)))
1419 return _M_insert_(__after._M_node, __after._M_node,
1479 const_iterator __after = __position; local
1483 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1490 return _M_insert_(__after._M_node, __after._M_node,
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
H A Dstl_tree.h1408 const_iterator __after = __position; local
1413 _S_key((++__after)._M_node)))
1419 return _M_insert_(__after._M_node, __after._M_node,
1479 const_iterator __after = __position; local
1483 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1490 return _M_insert_(__after._M_node, __after._M_node,
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/
H A Dstl_tree.h1282 const_iterator __after = __position; local
1286 _S_key((++__after)._M_node)))
1291 return _M_insert_(__after._M_node, __after._M_node, __v);
1340 const_iterator __after = __position; local
1343 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1349 return _M_insert_(__after._M_node, __after._M_node, __v);
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
H A Dstl_tree.h1282 const_iterator __after = __position; local
1286 _S_key((++__after)._M_node)))
1291 return _M_insert_(__after._M_node, __after._M_node, __v);
1340 const_iterator __after = __position; local
1343 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1349 return _M_insert_(__after._M_node, __after._M_node, __v);
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/
H A Dstl_tree.h1282 const_iterator __after = __position; local
1286 _S_key((++__after)._M_node)))
1291 return _M_insert_(__after._M_node, __after._M_node, __v);
1340 const_iterator __after = __position; local
1343 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1349 return _M_insert_(__after._M_node, __after._M_node, __v);
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/
H A Dstl_tree.h1274 const_iterator __after = __position; local
1278 _S_key((++__after)._M_node)))
1283 return _M_insert_(__after._M_node, __after._M_node, __v);
1332 const_iterator __after = __position; local
1335 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1341 return _M_insert_(__after._M_node, __after._M_node, __v);
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
H A Dstl_tree.h1408 const_iterator __after = __position; local
1413 _S_key((++__after)._M_node)))
1419 return _M_insert_(__after._M_node, __after._M_node,
1479 const_iterator __after = __position; local
1483 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1490 return _M_insert_(__after._M_node, __after._M_node,
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
H A Dstl_tree.h1376 const_iterator __after = __position; local
1381 _S_key((++__after)._M_node)))
1387 return _M_insert_(__after._M_node, __after._M_node,
1447 const_iterator __after = __position; local
1451 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1458 return _M_insert_(__after._M_node, __after._M_node,

Completed in 302 milliseconds

12