Home
last modified time | relevance | path

Searched refs:__p1 (Results 1 – 6 of 6) sorted by relevance

/trueos/contrib/libstdc++/include/tr1/
Dhashtable784 _Node* __p1 = __p->_M_next;
785 for (; __p1; __p1 = __p1->_M_next)
786 if (!this->_M_compare(__k, __code, __p1))
790 iterator __last(__p1, __head);
791 if (!__p1)
822 _Node* __p1 = __p->_M_next;
823 for (; __p1; __p1 = __p1->_M_next)
824 if (!this->_M_compare(__k, __code, __p1))
828 const_iterator __last(__p1, __head);
829 if (!__p1)
Drandom1172 template<class _UniformRandomNumberGenerator1, int __p1, int __r1,
1177 __p1, __r1>& __x);
1189 template<class _UniformRandomNumberGenerator1, int __p1, int __r1,
1194 __p1, __r1>& __x);
/trueos/contrib/libstdc++/include/ext/
Dslist735 _Node_base* __p1 = &this->_M_head;
741 __p1 = __n1;
746 this->_M_erase_after(__p1, 0);
748 _M_insert_after_range(__p1, const_iterator((_Node*)__n2),
/trueos/contrib/libstdc++/src/
Dcompatibility.cc248 bool (* __p1)(const char&, const char&) = &char_traits<char>::eq;
/trueos/contrib/libstdc++/include/bits/
Dstl_algo.h509 _ForwardIterator2 __p1, __p; in search() local
510 __p1 = __first2; ++__p1; in search()
519 __p = __p1; in search()
587 _ForwardIterator2 __p1, __p; in search() local
588 __p1 = __first2; ++__p1; in search()
604 __p = __p1; in search()
/trueos/contrib/libc++/include/
Dalgorithm2444 _RandomAccessIterator __p1 = __p;
2445 _RandomAccessIterator __p2 = __p1 + __m1;
2448 *__p1 = _VSTD::move(*__p2);
2449 __p1 = __p2;
2456 *__p1 = _VSTD::move(__t);