headers/cpp/stl_algo.h

239            _Size& __n) {
242       ++__n;
247               _Size& __n) {
250       ++__n;
258   typename iterator_traits<_InputIter>::difference_type __n = 0;
261       ++__n;
262   return __n;
268   typename iterator_traits<_InputIter>::difference_type __n = 0;
271       ++__n;
272   return __n;
384       _Integer __n = __count - 1;
387       while (__i != __last && __n != 0 && *__i == __val) {
389         --__n;
391       if (__n == 0)
413       _Integer __n = __count - 1;
416       while (__i != __last && __n != 0 && __binary_pred(*__i, __val)) {
418         --__n;
420       if (__n == 0)
510 _OutputIter generate_n(_OutputIter __first, _Size __n, _Generator __gen) {
511   for ( ; __n > 0; --__n, ++__first)
694                             _EuclideanRingElement __n)
696   while (__n != 0) {
697     _EuclideanRingElement __t = __m % __n;
698     __m = __n;
699     __n = __t;
771   _Distance __n = __last   - __first;
773   _Distance __l = __n - __k;
781   _Distance __d = __gcd(__n, __k);
832 // Return a random number in the range [0, __n).  This function encapsulates
837 inline _Distance __random_number(_Distance __n) {
839   return rand() % __n;
841   return lrand48() % __n;
867                             _OutputIter __out, const _Distance __n)
871   _Distance __m = min(__n, __remaining);
889                             _OutputIter __out, const _Distance __n,
894   _Distance __m = min(__n, __remaining);
912                                   const _Distance __n)
915   _Distance __t = __n;
916   for ( ; __first != __last && __m < __n; ++__m, ++__first)
922     if (__M < __n)
935                                   const _Distance __n)
938   _Distance __t = __n;
939   for ( ; __first != __last && __m < __n; ++__m, ++__first)
945     if (__M < __n)
1266 inline _Size __lg(_Size __n) {
1268   for (__k = 0; __n != 1; __n >>= 1) ++__k;
2809 bool __is_heap(_RandomAccessIter __first, _Distance __n)
2812   for (_Distance __child = 1; __child < __n; ++__child) {
2823                _Distance __n)
2826   for (_Distance __child = 1; __child < __n; ++__child) {