epoc32/include/stdapis/stlportv5/stl/_algo.c
author William Roberts <williamr@symbian.org>
Wed, 31 Mar 2010 12:33:34 +0100
branchSymbian3
changeset 4 837f303aceeb
parent 3 e1b950c65cb4
permissions -rw-r--r--
Current Symbian^3 public API header files (from PDK 3.0.h)
This is the epoc32/include tree with the "platform" subtrees removed, and
all but a selected few mbg and rsg files removed.
williamr@2
     1
/*
williamr@2
     2
 *
williamr@2
     3
 * Copyright (c) 1994
williamr@2
     4
 * Hewlett-Packard Company
williamr@2
     5
 *
williamr@2
     6
 * Copyright (c) 1996,1997
williamr@2
     7
 * Silicon Graphics Computer Systems, Inc.
williamr@2
     8
 *
williamr@2
     9
 * Copyright (c) 1997
williamr@2
    10
 * Moscow Center for SPARC Technology
williamr@2
    11
 *
williamr@4
    12
 * Copyright (c) 1999
williamr@2
    13
 * Boris Fomitchev
williamr@2
    14
 *
williamr@2
    15
 * This material is provided "as is", with absolutely no warranty expressed
williamr@2
    16
 * or implied. Any use is at your own risk.
williamr@2
    17
 *
williamr@4
    18
 * Permission to use or copy this software for any purpose is hereby granted
williamr@2
    19
 * without fee, provided the above notices are retained on all copies.
williamr@2
    20
 * Permission to modify the code and to distribute modified code is granted,
williamr@2
    21
 * provided the above notices are retained, and a notice that the code was
williamr@2
    22
 * modified is included with the above copyright notice.
williamr@2
    23
 *
williamr@2
    24
 */
williamr@2
    25
williamr@2
    26
#ifndef _STLP_ALGO_C
williamr@4
    27
#define _STLP_ALGO_C
williamr@2
    28
williamr@4
    29
#if !defined (_STLP_INTERNAL_ALGO_H)
williamr@2
    30
#  include <stl/_algo.h>
williamr@4
    31
#endif
williamr@4
    32
williamr@4
    33
#ifndef _STLP_INTERNAL_TEMPBUF_H
williamr@4
    34
#  include <stl/_tempbuf.h>
williamr@4
    35
#endif
williamr@2
    36
williamr@2
    37
_STLP_BEGIN_NAMESPACE
williamr@2
    38
williamr@4
    39
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
    40
williamr@2
    41
template <class _BidirectionalIter, class _Distance, class _Compare>
williamr@2
    42
void __merge_without_buffer(_BidirectionalIter __first,
williamr@2
    43
                            _BidirectionalIter __middle,
williamr@2
    44
                            _BidirectionalIter __last,
williamr@2
    45
                            _Distance __len1, _Distance __len2,
williamr@2
    46
                            _Compare __comp);
williamr@2
    47
williamr@2
    48
williamr@2
    49
template <class _BidirectionalIter1, class _BidirectionalIter2,
williamr@2
    50
          class _BidirectionalIter3, class _Compare>
williamr@2
    51
_BidirectionalIter3 __merge_backward(_BidirectionalIter1 __first1,
williamr@2
    52
                                     _BidirectionalIter1 __last1,
williamr@2
    53
                                     _BidirectionalIter2 __first2,
williamr@2
    54
                                     _BidirectionalIter2 __last2,
williamr@2
    55
                                     _BidirectionalIter3 __result,
williamr@2
    56
                                     _Compare __comp);
williamr@2
    57
williamr@2
    58
template <class _Tp>
williamr@4
    59
#if !(defined (__SUNPRO_CC) && (__SUNPRO_CC < 0x420 ))
williamr@4
    60
inline
williamr@4
    61
#endif
williamr@2
    62
const _Tp& __median(const _Tp& __a, const _Tp& __b, const _Tp& __c) {
williamr@2
    63
  if (__a < __b)
williamr@2
    64
    if (__b < __c)
williamr@2
    65
      return __b;
williamr@2
    66
    else if (__a < __c)
williamr@2
    67
      return __c;
williamr@2
    68
    else
williamr@2
    69
      return __a;
williamr@2
    70
  else if (__a < __c)
williamr@2
    71
    return __a;
williamr@2
    72
  else if (__b < __c)
williamr@2
    73
    return __c;
williamr@2
    74
  else
williamr@2
    75
    return __b;
williamr@2
    76
}
williamr@2
    77
williamr@2
    78
template <class _Tp, class _Compare>
williamr@4
    79
#if !(defined (__SUNPRO_CC) && (__SUNPRO_CC < 0x420 ))
williamr@4
    80
inline
williamr@4
    81
#endif
williamr@2
    82
const _Tp&
williamr@2
    83
__median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) {
williamr@4
    84
  if (__comp(__a, __b)) {
williamr@4
    85
    _STLP_VERBOSE_ASSERT(!__comp(__b, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@4
    86
    if (__comp(__b, __c)) {
williamr@4
    87
      _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
    88
      return __b;
williamr@4
    89
    }
williamr@4
    90
    else if (__comp(__a, __c)) {
williamr@4
    91
      _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
    92
      return __c;
williamr@4
    93
    }
williamr@2
    94
    else
williamr@2
    95
      return __a;
williamr@4
    96
  }
williamr@4
    97
  else if (__comp(__a, __c)) {
williamr@4
    98
    _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
    99
    return __a;
williamr@4
   100
  }
williamr@4
   101
  else if (__comp(__b, __c)) {
williamr@4
   102
    _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
   103
    return __c;
williamr@4
   104
  }
williamr@2
   105
  else
williamr@2
   106
    return __b;
williamr@2
   107
}
williamr@2
   108
williamr@4
   109
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
   110
williamr@2
   111
template <class _ForwardIter1, class _ForwardIter2>
williamr@2
   112
_ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
williamr@4
   113
                     _ForwardIter2 __first2, _ForwardIter2 __last2) {
williamr@4
   114
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
williamr@4
   115
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
williamr@2
   116
  // Test for empty ranges
williamr@2
   117
  if (__first1 == __last1 || __first2 == __last2)
williamr@2
   118
    return __first1;
williamr@2
   119
williamr@2
   120
  // Test for a pattern of length 1.
williamr@4
   121
  _ForwardIter2 __p1(__first2);
williamr@4
   122
williamr@4
   123
  if ( ++__p1 == __last2 )
williamr@2
   124
    return find(__first1, __last1, *__first2);
williamr@2
   125
williamr@2
   126
  // General case.
williamr@2
   127
williamr@4
   128
  for ( ; ; ) { // __first1 != __last1 will be checked in find below
williamr@2
   129
    __first1 = find(__first1, __last1, *__first2);
williamr@2
   130
    if (__first1 == __last1)
williamr@2
   131
      return __last1;
williamr@2
   132
williamr@2
   133
    _ForwardIter2 __p = __p1;
williamr@4
   134
    _ForwardIter1 __current = __first1;
williamr@2
   135
    if (++__current == __last1)
williamr@2
   136
      return __last1;
williamr@2
   137
williamr@2
   138
    while (*__current == *__p) {
williamr@2
   139
      if (++__p == __last2)
williamr@2
   140
        return __first1;
williamr@2
   141
      if (++__current == __last1)
williamr@2
   142
        return __last1;
williamr@2
   143
    }
williamr@2
   144
williamr@2
   145
    ++__first1;
williamr@2
   146
  }
williamr@2
   147
  return __first1;
williamr@2
   148
}
williamr@2
   149
williamr@4
   150
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
   151
williamr@4
   152
template <class _RandomAccessIter, class _Integer, class _Tp,
williamr@4
   153
          class _BinaryPred, class _Distance>
williamr@4
   154
_RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last,
williamr@4
   155
                             _Integer __count, const _Tp& __val, _BinaryPred __pred,
williamr@4
   156
                             _Distance*, const random_access_iterator_tag &)
williamr@4
   157
{
williamr@4
   158
  _Distance __tailSize = __last - __first;
williamr@4
   159
  const _Distance __pattSize = __count;
williamr@4
   160
  const _Distance __skipOffset = __pattSize - 1;
williamr@4
   161
  _RandomAccessIter __backTrack;
williamr@4
   162
  _Distance __remainder, __prevRemainder;
williamr@4
   163
williamr@4
   164
  for ( _RandomAccessIter __lookAhead = __first + __skipOffset; __tailSize >= __pattSize; __lookAhead += __pattSize ) { // the main loop...
williamr@4
   165
    //__lookAhead here is always pointing to the last element of next possible match.
williamr@4
   166
    __tailSize -= __pattSize;
williamr@4
   167
williamr@4
   168
    while ( !__pred(*__lookAhead, __val) ) { // the skip loop...
williamr@4
   169
      if (__tailSize < __pattSize)
williamr@4
   170
        return __last;
williamr@4
   171
williamr@4
   172
      __lookAhead += __pattSize;
williamr@4
   173
      __tailSize -= __pattSize;
williamr@4
   174
    }
williamr@4
   175
williamr@4
   176
    if ( __skipOffset == 0 ) {
williamr@4
   177
      return (__lookAhead - __skipOffset); //Success
williamr@4
   178
    }
williamr@4
   179
williamr@4
   180
    __remainder = __skipOffset;
williamr@4
   181
williamr@4
   182
    for (__backTrack = __lookAhead; __pred(*--__backTrack, __val); ) {
williamr@4
   183
      if (--__remainder == 0)
williamr@4
   184
        return (__lookAhead - __skipOffset); //Success
williamr@4
   185
    }
williamr@4
   186
williamr@4
   187
    if (__remainder > __tailSize)
williamr@4
   188
      return __last; //failure
williamr@4
   189
williamr@4
   190
    __lookAhead += __remainder;
williamr@4
   191
    __tailSize -= __remainder;
williamr@4
   192
williamr@4
   193
    while ( __pred(*__lookAhead, __val) ) {
williamr@4
   194
      __prevRemainder = __remainder;
williamr@4
   195
      __backTrack = __lookAhead;
williamr@4
   196
williamr@4
   197
      do {
williamr@4
   198
        if (--__remainder == 0)
williamr@4
   199
          return (__lookAhead - __skipOffset); //Success
williamr@4
   200
      } while (__pred(*--__backTrack, __val));
williamr@4
   201
williamr@4
   202
      //adjust remainder for next comparison
williamr@4
   203
      __remainder += __pattSize - __prevRemainder;
williamr@4
   204
williamr@4
   205
      if (__remainder > __tailSize)
williamr@4
   206
        return __last; //failure
williamr@4
   207
williamr@4
   208
      __lookAhead += __remainder;
williamr@4
   209
      __tailSize -= __remainder;
williamr@4
   210
    }
williamr@4
   211
williamr@4
   212
    //__lookAhead here is always pointing to the element of the last mismatch.
williamr@4
   213
  }
williamr@4
   214
williamr@4
   215
  return __last; //failure
williamr@4
   216
}
williamr@4
   217
williamr@4
   218
template <class _ForwardIter, class _Integer, class _Tp,
williamr@4
   219
          class _Distance, class _BinaryPred>
williamr@4
   220
_ForwardIter __search_n(_ForwardIter __first, _ForwardIter __last,
williamr@4
   221
                        _Integer __count, const _Tp& __val, _BinaryPred __pred,
williamr@4
   222
                        _Distance*, const forward_iterator_tag &) {
williamr@4
   223
  for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
williamr@4
   224
  while (__first != __last) {
williamr@4
   225
    _Integer __n = __count - 1;
williamr@4
   226
    _ForwardIter __i = __first;
williamr@4
   227
    ++__i;
williamr@4
   228
    while (__i != __last && __n != 0 && __pred(*__i, __val)) {
williamr@4
   229
      ++__i;
williamr@4
   230
      --__n;
williamr@4
   231
    }
williamr@4
   232
    if (__n == 0)
williamr@4
   233
      return __first;
williamr@4
   234
    else if (__i != __last)
williamr@4
   235
      for (__first = ++__i; (__first != __last) && !__pred(*__first, __val); ++__first) {}
williamr@4
   236
    else
williamr@4
   237
      break;
williamr@4
   238
  }
williamr@4
   239
  return __last;
williamr@4
   240
}
williamr@4
   241
williamr@4
   242
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
   243
williamr@2
   244
// search_n.  Search for __count consecutive copies of __val.
williamr@2
   245
template <class _ForwardIter, class _Integer, class _Tp>
williamr@2
   246
_ForwardIter search_n(_ForwardIter __first, _ForwardIter __last,
williamr@2
   247
                      _Integer __count, const _Tp& __val) {
williamr@4
   248
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@2
   249
  if (__count <= 0)
williamr@2
   250
    return __first;
williamr@4
   251
  if (__count == 1)
williamr@4
   252
    //We use find when __count == 1 to use potential find overload.
williamr@4
   253
    return find(__first, __last, __val);
williamr@4
   254
  return _STLP_PRIV __search_n(__first, __last, __count, __val, equal_to<_Tp>(),
williamr@4
   255
                               _STLP_DISTANCE_TYPE(__first, _ForwardIter),
williamr@4
   256
                               _STLP_ITERATOR_CATEGORY(__first, _ForwardIter));
williamr@2
   257
}
williamr@2
   258
williamr@2
   259
template <class _ForwardIter, class _Integer, class _Tp, class _BinaryPred>
williamr@2
   260
_ForwardIter search_n(_ForwardIter __first, _ForwardIter __last,
williamr@2
   261
                      _Integer __count, const _Tp& __val,
williamr@2
   262
                      _BinaryPred __binary_pred) {
williamr@4
   263
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@2
   264
  if (__count <= 0)
williamr@2
   265
    return __first;
williamr@4
   266
  return _STLP_PRIV __search_n(__first, __last, __count, __val, __binary_pred,
williamr@4
   267
                               _STLP_DISTANCE_TYPE(__first, _ForwardIter),
williamr@4
   268
                               _STLP_ITERATOR_CATEGORY(__first, _ForwardIter));
williamr@4
   269
}
williamr@2
   270
williamr@2
   271
template <class _ForwardIter1, class _ForwardIter2>
williamr@4
   272
_ForwardIter1
williamr@4
   273
find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
williamr@4
   274
         _ForwardIter2 __first2, _ForwardIter2 __last2) {
williamr@4
   275
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
williamr@4
   276
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
williamr@4
   277
  return _STLP_PRIV __find_end(__first1, __last1, __first2, __last2,
williamr@4
   278
#if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
williamr@4
   279
                               _STLP_ITERATOR_CATEGORY(__first1, _ForwardIter1),
williamr@4
   280
                               _STLP_ITERATOR_CATEGORY(__first2, _ForwardIter2),
williamr@4
   281
#else
williamr@4
   282
                               forward_iterator_tag(),
williamr@4
   283
                               forward_iterator_tag(),
williamr@4
   284
#endif
williamr@4
   285
                               _STLP_PRIV __equal_to(_STLP_VALUE_TYPE(__first1, _ForwardIter1))
williamr@2
   286
    );
williamr@2
   287
}
williamr@2
   288
williamr@2
   289
// unique and unique_copy
williamr@4
   290
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
   291
williamr@2
   292
template <class _InputIterator, class _OutputIterator, class _BinaryPredicate,
williamr@4
   293
          class _Tp>
williamr@4
   294
_STLP_INLINE_LOOP _OutputIterator
williamr@2
   295
__unique_copy(_InputIterator __first, _InputIterator __last,
williamr@2
   296
              _OutputIterator __result,
williamr@2
   297
              _BinaryPredicate __binary_pred, _Tp*) {
williamr@2
   298
  _Tp __val = *__first;
williamr@2
   299
  *__result = __val;
williamr@2
   300
  while (++__first != __last)
williamr@2
   301
    if (!__binary_pred(__val, *__first)) {
williamr@2
   302
      __val = *__first;
williamr@2
   303
      *++__result = __val;
williamr@2
   304
    }
williamr@2
   305
  return ++__result;
williamr@2
   306
}
williamr@2
   307
williamr@2
   308
template <class _InputIter, class _OutputIter, class _BinaryPredicate>
williamr@4
   309
inline _OutputIter
williamr@2
   310
__unique_copy(_InputIter __first, _InputIter __last,_OutputIter __result,
williamr@2
   311
              _BinaryPredicate __binary_pred, const output_iterator_tag &) {
williamr@2
   312
  return __unique_copy(__first, __last, __result, __binary_pred, _STLP_VALUE_TYPE(__first, _InputIter));
williamr@2
   313
}
williamr@2
   314
williamr@2
   315
template <class _InputIter, class _ForwardIter, class _BinaryPredicate>
williamr@4
   316
_STLP_INLINE_LOOP _ForwardIter
williamr@4
   317
__unique_copy(_InputIter __first, _InputIter __last, _ForwardIter __result,
williamr@2
   318
              _BinaryPredicate __binary_pred, const forward_iterator_tag &) {
williamr@2
   319
  *__result = *__first;
williamr@2
   320
  while (++__first != __last)
williamr@2
   321
    if (!__binary_pred(*__result, *__first)) *++__result = *__first;
williamr@2
   322
  return ++__result;
williamr@2
   323
}
williamr@2
   324
williamr@4
   325
#if defined (_STLP_NONTEMPL_BASE_MATCH_BUG)
williamr@2
   326
template <class _InputIterator, class _BidirectionalIterator, class _BinaryPredicate>
williamr@4
   327
inline _BidirectionalIterator
williamr@2
   328
__unique_copy(_InputIterator __first, _InputIterator __last,
williamr@2
   329
              _BidirectionalIterator __result, _BinaryPredicate __binary_pred,
williamr@2
   330
              const bidirectional_iterator_tag &) {
williamr@2
   331
  return __unique_copy(__first, __last, __result, __binary_pred, forward_iterator_tag());
williamr@2
   332
}
williamr@2
   333
williamr@2
   334
template <class _InputIterator, class _RandomAccessIterator, class _BinaryPredicate>
williamr@4
   335
inline _RandomAccessIterator
williamr@2
   336
__unique_copy(_InputIterator __first, _InputIterator __last,
williamr@2
   337
              _RandomAccessIterator __result, _BinaryPredicate __binary_pred,
williamr@2
   338
              const random_access_iterator_tag &) {
williamr@2
   339
  return __unique_copy(__first, __last, __result, __binary_pred, forward_iterator_tag());
williamr@2
   340
}
williamr@4
   341
#endif /* _STLP_NONTEMPL_BASE_MATCH_BUG */
williamr@2
   342
williamr@4
   343
_STLP_MOVE_TO_STD_NAMESPACE
williamr@2
   344
williamr@2
   345
template <class _InputIter, class _OutputIter>
williamr@4
   346
_OutputIter
williamr@2
   347
unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result) {
williamr@4
   348
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@2
   349
  if (__first == __last) return __result;
williamr@4
   350
  return _STLP_PRIV __unique_copy(__first, __last, __result,
williamr@4
   351
                                  _STLP_PRIV __equal_to(_STLP_VALUE_TYPE(__first, _InputIter)),
williamr@4
   352
                                  _STLP_ITERATOR_CATEGORY(__result, _OutputIter));
williamr@2
   353
}
williamr@2
   354
williamr@2
   355
template <class _InputIter, class _OutputIter, class _BinaryPredicate>
williamr@4
   356
_OutputIter
williamr@2
   357
unique_copy(_InputIter __first, _InputIter __last,_OutputIter __result,
williamr@2
   358
            _BinaryPredicate __binary_pred) {
williamr@4
   359
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@2
   360
  if (__first == __last) return __result;
williamr@4
   361
  return _STLP_PRIV __unique_copy(__first, __last, __result, __binary_pred,
williamr@4
   362
                                  _STLP_ITERATOR_CATEGORY(__result, _OutputIter));
williamr@2
   363
}
williamr@2
   364
williamr@2
   365
// rotate and rotate_copy, and their auxiliary functions
williamr@4
   366
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@2
   367
williamr@2
   368
template <class _ForwardIter, class _Distance>
williamr@2
   369
_ForwardIter __rotate_aux(_ForwardIter __first,
williamr@2
   370
                          _ForwardIter __middle,
williamr@2
   371
                          _ForwardIter __last,
williamr@2
   372
                          _Distance*,
williamr@2
   373
                          const forward_iterator_tag &) {
williamr@2
   374
  if (__first == __middle)
williamr@2
   375
    return __last;
williamr@2
   376
  if (__last  == __middle)
williamr@2
   377
    return __first;
williamr@2
   378
williamr@2
   379
  _ForwardIter __first2 = __middle;
williamr@2
   380
  do {
williamr@2
   381
    swap(*__first++, *__first2++);
williamr@2
   382
    if (__first == __middle)
williamr@2
   383
      __middle = __first2;
williamr@2
   384
  } while (__first2 != __last);
williamr@2
   385
williamr@2
   386
  _ForwardIter __new_middle = __first;
williamr@2
   387
williamr@2
   388
  __first2 = __middle;
williamr@2
   389
williamr@2
   390
  while (__first2 != __last) {
williamr@2
   391
    swap (*__first++, *__first2++);
williamr@2
   392
    if (__first == __middle)
williamr@2
   393
      __middle = __first2;
williamr@2
   394
    else if (__first2 == __last)
williamr@2
   395
      __first2 = __middle;
williamr@2
   396
  }
williamr@2
   397
williamr@2
   398
  return __new_middle;
williamr@2
   399
}
williamr@2
   400
williamr@4
   401
template <class _BidirectionalIter, class _Distance>
williamr@4
   402
_BidirectionalIter __rotate_aux(_BidirectionalIter __first,
williamr@4
   403
                                _BidirectionalIter __middle,
williamr@4
   404
                                _BidirectionalIter __last,
williamr@4
   405
                                _Distance*,
williamr@4
   406
                                const bidirectional_iterator_tag &) {
williamr@4
   407
  if (__first == __middle)
williamr@4
   408
    return __last;
williamr@4
   409
  if (__last  == __middle)
williamr@4
   410
    return __first;
williamr@4
   411
williamr@4
   412
  __reverse(__first,  __middle, bidirectional_iterator_tag());
williamr@4
   413
  __reverse(__middle, __last,   bidirectional_iterator_tag());
williamr@4
   414
williamr@4
   415
  while (__first != __middle && __middle != __last)
williamr@4
   416
    swap (*__first++, *--__last);
williamr@4
   417
williamr@4
   418
  if (__first == __middle) {
williamr@4
   419
    __reverse(__middle, __last,   bidirectional_iterator_tag());
williamr@4
   420
    return __last;
williamr@4
   421
  }
williamr@4
   422
  else {
williamr@4
   423
    __reverse(__first,  __middle, bidirectional_iterator_tag());
williamr@4
   424
    return __first;
williamr@4
   425
  }
williamr@4
   426
}
williamr@4
   427
williamr@4
   428
template <class _RandomAccessIter, class _Distance, class _Tp>
williamr@4
   429
_RandomAccessIter __rotate_aux(_RandomAccessIter __first,
williamr@4
   430
                               _RandomAccessIter __middle,
williamr@4
   431
                               _RandomAccessIter __last,
williamr@4
   432
                               _Distance *, _Tp *) {
williamr@4
   433
williamr@4
   434
  _Distance __n = __last   - __first;
williamr@4
   435
  _Distance __k = __middle - __first;
williamr@4
   436
  _Distance __l = __n - __k;
williamr@4
   437
  _RandomAccessIter __result = __first + (__last - __middle);
williamr@4
   438
williamr@4
   439
  if (__k == 0)  /* __first == middle */
williamr@4
   440
    return __last;
williamr@4
   441
williamr@4
   442
  if (__k == __l) {
williamr@4
   443
    swap_ranges(__first, __middle, __middle);
williamr@4
   444
    return __result;
williamr@4
   445
  }
williamr@4
   446
williamr@4
   447
  _Distance __d = __gcd(__n, __k);
williamr@4
   448
williamr@4
   449
  for (_Distance __i = 0; __i < __d; __i++) {
williamr@4
   450
    _Tp __tmp = *__first;
williamr@4
   451
    _RandomAccessIter __p = __first;
williamr@4
   452
williamr@4
   453
    if (__k < __l) {
williamr@4
   454
      for (_Distance __j = 0; __j < __l/__d; __j++) {
williamr@4
   455
        if (__p > __first + __l) {
williamr@4
   456
          *__p = *(__p - __l);
williamr@4
   457
          __p -= __l;
williamr@4
   458
        }
williamr@4
   459
williamr@4
   460
        *__p = *(__p + __k);
williamr@4
   461
        __p += __k;
williamr@4
   462
      }
williamr@4
   463
    }
williamr@4
   464
williamr@4
   465
    else {
williamr@4
   466
      for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
williamr@4
   467
        if (__p < __last - __k) {
williamr@4
   468
          *__p = *(__p + __k);
williamr@4
   469
          __p += __k;
williamr@4
   470
        }
williamr@4
   471
williamr@4
   472
        *__p = * (__p - __l);
williamr@4
   473
        __p -= __l;
williamr@4
   474
      }
williamr@4
   475
    }
williamr@4
   476
williamr@4
   477
    *__p = __tmp;
williamr@4
   478
    ++__first;
williamr@4
   479
  }
williamr@4
   480
williamr@4
   481
  return __result;
williamr@4
   482
}
williamr@4
   483
williamr@4
   484
template <class _RandomAccessIter, class _Distance>
williamr@4
   485
inline _RandomAccessIter
williamr@4
   486
__rotate_aux(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last,
williamr@4
   487
             _Distance * __dis, const random_access_iterator_tag &) {
williamr@4
   488
  return __rotate_aux(__first, __middle, __last,
williamr@4
   489
                      __dis, _STLP_VALUE_TYPE(__first, _RandomAccessIter));
williamr@4
   490
}
williamr@4
   491
williamr@4
   492
template <class _ForwardIter>
williamr@4
   493
_ForwardIter
williamr@4
   494
__rotate(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last) {
williamr@4
   495
  _STLP_DEBUG_CHECK(__check_range(__first, __middle))
williamr@4
   496
  _STLP_DEBUG_CHECK(__check_range(__middle, __last))
williamr@4
   497
  return __rotate_aux(__first, __middle, __last,
williamr@4
   498
                      _STLP_DISTANCE_TYPE(__first, _ForwardIter),
williamr@4
   499
                      _STLP_ITERATOR_CATEGORY(__first, _ForwardIter));
williamr@4
   500
}
williamr@4
   501
williamr@4
   502
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
   503
williamr@4
   504
template <class _ForwardIter>
williamr@4
   505
void rotate(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last) {
williamr@4
   506
  _STLP_PRIV __rotate(__first, __middle, __last);
williamr@4
   507
}
williamr@4
   508
williamr@4
   509
// Return a random number in the range [0, __n).  This function encapsulates
williamr@4
   510
// whether we're using rand (part of the standard C library) or lrand48
williamr@4
   511
// (not standard, but a much better choice whenever it's available).
williamr@4
   512
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
   513
williamr@4
   514
template <class _Distance>
williamr@4
   515
inline _Distance __random_number(_Distance __n) {
williamr@4
   516
#ifdef _STLP_NO_DRAND48
williamr@4
   517
  return rand() % __n;
williamr@4
   518
#else
williamr@4
   519
  return lrand48() % __n;
williamr@4
   520
#endif
williamr@4
   521
}
williamr@4
   522
williamr@4
   523
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
   524
williamr@4
   525
template <class _RandomAccessIter>
williamr@4
   526
void random_shuffle(_RandomAccessIter __first,
williamr@4
   527
                    _RandomAccessIter __last) {
williamr@4
   528
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
   529
  if (__first == __last) return;
williamr@4
   530
  for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
williamr@4
   531
    iter_swap(__i, __first + _STLP_PRIV __random_number((__i - __first) + 1));
williamr@4
   532
}
williamr@4
   533
williamr@4
   534
template <class _RandomAccessIter, class _RandomNumberGenerator>
williamr@4
   535
void random_shuffle(_RandomAccessIter __first, _RandomAccessIter __last,
williamr@4
   536
                    _RandomNumberGenerator &__rand) {
williamr@4
   537
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
   538
  if (__first == __last) return;
williamr@4
   539
  for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
williamr@4
   540
    iter_swap(__i, __first + __rand((__i - __first) + 1));
williamr@4
   541
}
williamr@4
   542
williamr@4
   543
#if !defined (_STLP_NO_EXTENSIONS)
williamr@4
   544
// random_sample and random_sample_n (extensions, not part of the standard).
williamr@4
   545
template <class _ForwardIter, class _OutputIter, class _Distance>
williamr@4
   546
_OutputIter random_sample_n(_ForwardIter __first, _ForwardIter __last,
williamr@4
   547
                            _OutputIter __out_ite, const _Distance __n) {
williamr@4
   548
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
   549
  _Distance __remaining = distance(__first, __last);
williamr@4
   550
  _Distance __m = (min) (__n, __remaining);
williamr@4
   551
williamr@4
   552
  while (__m > 0) {
williamr@4
   553
    if (_STLP_PRIV __random_number(__remaining) < __m) {
williamr@4
   554
      *__out_ite = *__first;
williamr@4
   555
      ++__out_ite;
williamr@4
   556
      --__m;
williamr@4
   557
    }
williamr@4
   558
williamr@4
   559
    --__remaining;
williamr@4
   560
    ++__first;
williamr@4
   561
  }
williamr@4
   562
  return __out_ite;
williamr@4
   563
}
williamr@4
   564
williamr@4
   565
williamr@4
   566
template <class _ForwardIter, class _OutputIter, class _Distance,
williamr@4
   567
          class _RandomNumberGenerator>
williamr@4
   568
_OutputIter random_sample_n(_ForwardIter __first, _ForwardIter __last,
williamr@4
   569
                            _OutputIter __out_ite, const _Distance __n,
williamr@4
   570
                            _RandomNumberGenerator& __rand) {
williamr@4
   571
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
   572
  _Distance __remaining = distance(__first, __last);
williamr@4
   573
  _Distance __m = (min) (__n, __remaining);
williamr@4
   574
williamr@4
   575
  while (__m > 0) {
williamr@4
   576
    if (__rand(__remaining) < __m) {
williamr@4
   577
      *__out_ite = *__first;
williamr@4
   578
      ++__out_ite;
williamr@4
   579
      --__m;
williamr@4
   580
    }
williamr@4
   581
williamr@4
   582
    --__remaining;
williamr@4
   583
    ++__first;
williamr@4
   584
  }
williamr@4
   585
  return __out_ite;
williamr@4
   586
}
williamr@4
   587
williamr@4
   588
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
   589
williamr@4
   590
template <class _InputIter, class _RandomAccessIter, class _Distance>
williamr@4
   591
_RandomAccessIter __random_sample(_InputIter __first, _InputIter __last,
williamr@4
   592
                                  _RandomAccessIter __out_ite,
williamr@4
   593
                                  const _Distance __n) {
williamr@4
   594
  _Distance __m = 0;
williamr@4
   595
  _Distance __t = __n;
williamr@4
   596
  for ( ; __first != __last && __m < __n; ++__m, ++__first)
williamr@4
   597
    __out_ite[__m] = *__first;
williamr@4
   598
williamr@4
   599
  while (__first != __last) {
williamr@4
   600
    ++__t;
williamr@4
   601
    _Distance __M = __random_number(__t);
williamr@4
   602
    if (__M < __n)
williamr@4
   603
      __out_ite[__M] = *__first;
williamr@4
   604
    ++__first;
williamr@4
   605
  }
williamr@4
   606
williamr@4
   607
  return __out_ite + __m;
williamr@4
   608
}
williamr@4
   609
williamr@4
   610
template <class _InputIter, class _RandomAccessIter,
williamr@4
   611
          class _RandomNumberGenerator, class _Distance>
williamr@4
   612
_RandomAccessIter __random_sample(_InputIter __first, _InputIter __last,
williamr@4
   613
                                  _RandomAccessIter __out_ite,
williamr@4
   614
                                  _RandomNumberGenerator& __rand,
williamr@4
   615
                                  const _Distance __n) {
williamr@4
   616
  _Distance __m = 0;
williamr@4
   617
  _Distance __t = __n;
williamr@4
   618
  for ( ; __first != __last && __m < __n; ++__m, ++__first)
williamr@4
   619
    __out_ite[__m] = *__first;
williamr@4
   620
williamr@4
   621
  while (__first != __last) {
williamr@4
   622
    ++__t;
williamr@4
   623
    _Distance __M = __rand(__t);
williamr@4
   624
    if (__M < __n)
williamr@4
   625
      __out_ite[__M] = *__first;
williamr@4
   626
    ++__first;
williamr@4
   627
  }
williamr@4
   628
williamr@4
   629
  return __out_ite + __m;
williamr@4
   630
}
williamr@4
   631
williamr@4
   632
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
   633
williamr@4
   634
template <class _InputIter, class _RandomAccessIter>
williamr@4
   635
_RandomAccessIter
williamr@4
   636
random_sample(_InputIter __first, _InputIter __last,
williamr@4
   637
              _RandomAccessIter __out_first, _RandomAccessIter __out_last) {
williamr@4
   638
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
   639
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__out_first, __out_last))
williamr@4
   640
  return _STLP_PRIV __random_sample(__first, __last,
williamr@4
   641
                                    __out_first, __out_last - __out_first);
williamr@4
   642
}
williamr@4
   643
williamr@4
   644
template <class _InputIter, class _RandomAccessIter, class _RandomNumberGenerator>
williamr@4
   645
_RandomAccessIter
williamr@4
   646
random_sample(_InputIter __first, _InputIter __last,
williamr@4
   647
              _RandomAccessIter __out_first, _RandomAccessIter __out_last,
williamr@4
   648
              _RandomNumberGenerator& __rand) {
williamr@4
   649
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
   650
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__out_first, __out_last))
williamr@4
   651
  return _STLP_PRIV __random_sample(__first, __last,
williamr@4
   652
                                    __out_first, __rand,
williamr@4
   653
                                    __out_last - __out_first);
williamr@4
   654
}
williamr@4
   655
williamr@4
   656
#endif /* _STLP_NO_EXTENSIONS */
williamr@4
   657
williamr@4
   658
// partition, stable_partition, and their auxiliary functions
williamr@4
   659
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
   660
williamr@4
   661
template <class _ForwardIter, class _Predicate>
williamr@4
   662
_STLP_INLINE_LOOP _ForwardIter __partition(_ForwardIter __first,
williamr@4
   663
                                           _ForwardIter __last,
williamr@4
   664
                                           _Predicate   __pred,
williamr@4
   665
                                           const forward_iterator_tag &) {
williamr@4
   666
  if (__first == __last) return __first;
williamr@4
   667
williamr@4
   668
  while (__pred(*__first))
williamr@4
   669
    if (++__first == __last) return __first;
williamr@4
   670
williamr@4
   671
  _ForwardIter __next = __first;
williamr@4
   672
williamr@4
   673
  while (++__next != __last) {
williamr@4
   674
    if (__pred(*__next)) {
williamr@4
   675
      swap(*__first, *__next);
williamr@4
   676
      ++__first;
williamr@4
   677
    }
williamr@4
   678
  }
williamr@4
   679
  return __first;
williamr@4
   680
}
williamr@4
   681
williamr@4
   682
template <class _BidirectionalIter, class _Predicate>
williamr@4
   683
_STLP_INLINE_LOOP _BidirectionalIter __partition(_BidirectionalIter __first,
williamr@4
   684
                                                 _BidirectionalIter __last,
williamr@4
   685
                                                 _Predicate __pred,
williamr@4
   686
                                                 const bidirectional_iterator_tag &) {
williamr@4
   687
  for (;;) {
williamr@4
   688
    for (;;) {
williamr@4
   689
      if (__first == __last)
williamr@4
   690
        return __first;
williamr@4
   691
      else if (__pred(*__first))
williamr@4
   692
        ++__first;
williamr@4
   693
      else
williamr@4
   694
        break;
williamr@4
   695
    }
williamr@4
   696
    --__last;
williamr@4
   697
    for (;;) {
williamr@4
   698
      if (__first == __last)
williamr@4
   699
        return __first;
williamr@4
   700
      else if (!__pred(*__last))
williamr@4
   701
        --__last;
williamr@4
   702
      else
williamr@4
   703
        break;
williamr@4
   704
    }
williamr@4
   705
    iter_swap(__first, __last);
williamr@4
   706
    ++__first;
williamr@4
   707
  }
williamr@4
   708
}
williamr@4
   709
williamr@4
   710
#if defined (_STLP_NONTEMPL_BASE_MATCH_BUG)
williamr@4
   711
template <class _BidirectionalIter, class _Predicate>
williamr@4
   712
inline
williamr@4
   713
_BidirectionalIter __partition(_BidirectionalIter __first,
williamr@4
   714
                               _BidirectionalIter __last,
williamr@4
   715
                               _Predicate __pred,
williamr@4
   716
                               const random_access_iterator_tag &) {
williamr@4
   717
  return __partition(__first, __last, __pred, bidirectional_iterator_tag());
williamr@4
   718
}
williamr@4
   719
#endif
williamr@4
   720
williamr@4
   721
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
   722
williamr@4
   723
template <class _ForwardIter, class _Predicate>
williamr@4
   724
_ForwardIter partition(_ForwardIter __first, _ForwardIter __last, _Predicate   __pred) {
williamr@4
   725
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
   726
  return _STLP_PRIV __partition(__first, __last, __pred, _STLP_ITERATOR_CATEGORY(__first, _ForwardIter));
williamr@4
   727
}
williamr@4
   728
williamr@4
   729
williamr@4
   730
/* __pred_of_first: false if we know that __pred(*__first) is false,
williamr@4
   731
 *                  true when we don't know the result of __pred(*__first).
williamr@4
   732
 * __not_pred_of_before_last: true if we know that __pred(*--__last) is true,
williamr@4
   733
 *                            false when we don't know the result of __pred(*--__last).
williamr@4
   734
 */
williamr@4
   735
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
   736
williamr@4
   737
template <class _ForwardIter, class _Predicate, class _Distance>
williamr@4
   738
_ForwardIter __inplace_stable_partition(_ForwardIter __first,
williamr@4
   739
                                        _ForwardIter __last,
williamr@4
   740
                                        _Predicate __pred, _Distance __len,
williamr@4
   741
                                        bool __pred_of_first, bool __pred_of_before_last) {
williamr@4
   742
  if (__len == 1)
williamr@4
   743
    return (__pred_of_first && (__pred_of_before_last || __pred(*__first))) ? __last : __first;
williamr@4
   744
  _ForwardIter __middle = __first;
williamr@4
   745
  _Distance __half_len = __len / 2;
williamr@4
   746
  advance(__middle, __half_len);
williamr@4
   747
  return __rotate(__inplace_stable_partition(__first, __middle, __pred, __half_len, __pred_of_first, false),
williamr@4
   748
                  __middle,
williamr@4
   749
                  __inplace_stable_partition(__middle, __last, __pred, __len - __half_len, true, __pred_of_before_last));
williamr@4
   750
}
williamr@2
   751
williamr@2
   752
template <class _ForwardIter, class _Pointer, class _Predicate,
williamr@2
   753
          class _Distance>
williamr@2
   754
_ForwardIter __stable_partition_adaptive(_ForwardIter __first,
williamr@2
   755
                                         _ForwardIter __last,
williamr@2
   756
                                         _Predicate __pred, _Distance __len,
williamr@2
   757
                                         _Pointer __buffer, _Distance __buffer_size,
williamr@2
   758
                                         bool __pred_of_first, bool __pred_of_before_last) {
williamr@2
   759
  if (__len <= __buffer_size) {
williamr@2
   760
    _ForwardIter __result1 = __first;
williamr@2
   761
    _Pointer __result2 = __buffer;
williamr@2
   762
    if ((__first != __last) && (!__pred_of_first || __pred(*__first))) {
williamr@2
   763
      *__result2 = *__first;
williamr@2
   764
      ++__result2; ++__first; --__len;
williamr@2
   765
    }
williamr@2
   766
    for (; __first != __last ; ++__first, --__len) {
williamr@2
   767
      if (((__len == 1) && (__pred_of_before_last || __pred(*__first))) ||
williamr@2
   768
          ((__len != 1) && __pred(*__first))){
williamr@2
   769
        *__result1 = *__first;
williamr@2
   770
        ++__result1;
williamr@2
   771
      }
williamr@2
   772
      else {
williamr@2
   773
        *__result2 = *__first;
williamr@2
   774
        ++__result2;
williamr@2
   775
      }
williamr@2
   776
    }
williamr@2
   777
    copy(__buffer, __result2, __result1);
williamr@2
   778
    return __result1;
williamr@2
   779
  }
williamr@2
   780
  else {
williamr@2
   781
    _ForwardIter __middle = __first;
williamr@2
   782
    _Distance __half_len = __len / 2;
williamr@2
   783
    advance(__middle, __half_len);
williamr@2
   784
    return __rotate(__stable_partition_adaptive(
williamr@2
   785
                          __first, __middle, __pred,
williamr@2
   786
                          __half_len, __buffer, __buffer_size,
williamr@2
   787
                          __pred_of_first, false),
williamr@2
   788
                    __middle,
williamr@2
   789
                    __stable_partition_adaptive(
williamr@2
   790
                          __middle, __last, __pred,
williamr@2
   791
                          __len - __half_len, __buffer, __buffer_size,
williamr@2
   792
                          true, __pred_of_before_last));
williamr@2
   793
  }
williamr@2
   794
}
williamr@2
   795
williamr@4
   796
template <class _ForwardIter, class _Predicate, class _Tp, class _Distance>
williamr@4
   797
inline _ForwardIter
williamr@4
   798
__stable_partition_aux_aux(_ForwardIter __first, _ForwardIter __last,
williamr@4
   799
                           _Predicate __pred, _Tp*, _Distance*, bool __pred_of_before_last = false) {
williamr@4
   800
  _Temporary_buffer<_ForwardIter, _Tp> __buf(__first, __last);
williamr@4
   801
  _STLP_MPWFIX_TRY    //*TY 06/01/2000 - they forget to call dtor for _Temporary_buffer if no try/catch block is present
williamr@4
   802
  return (__buf.size() > 0) ?
williamr@4
   803
    __stable_partition_adaptive(__first, __last, __pred,
williamr@4
   804
                                _Distance(__buf.requested_size()),
williamr@4
   805
                                __buf.begin(), __buf.size(),
williamr@4
   806
                                false, __pred_of_before_last)  :
williamr@4
   807
    __inplace_stable_partition(__first, __last, __pred,
williamr@4
   808
                               _Distance(__buf.requested_size()),
williamr@4
   809
                               false, __pred_of_before_last);
williamr@4
   810
  _STLP_MPWFIX_CATCH  //*TY 06/01/2000 - they forget to call dtor for _Temporary_buffer if no try/catch block is present
williamr@2
   811
}
williamr@2
   812
williamr@4
   813
template <class _ForwardIter, class _Predicate>
williamr@4
   814
_ForwardIter
williamr@4
   815
__stable_partition_aux(_ForwardIter __first, _ForwardIter __last, _Predicate __pred,
williamr@4
   816
                       const forward_iterator_tag &) {
williamr@4
   817
  return __stable_partition_aux_aux(__first, __last, __pred,
williamr@4
   818
                                    _STLP_VALUE_TYPE(__first, _ForwardIter),
williamr@4
   819
                                    _STLP_DISTANCE_TYPE(__first, _ForwardIter));
williamr@4
   820
}
williamr@2
   821
williamr@4
   822
template <class _BidirectIter, class _Predicate>
williamr@4
   823
_BidirectIter
williamr@4
   824
__stable_partition_aux(_BidirectIter __first, _BidirectIter __last, _Predicate __pred,
williamr@4
   825
                       const bidirectional_iterator_tag &) {
williamr@4
   826
  for (--__last;;) {
williamr@4
   827
    if (__first == __last)
williamr@4
   828
      return __first;
williamr@4
   829
    else if (!__pred(*__last))
williamr@4
   830
      --__last;
williamr@4
   831
    else
williamr@4
   832
      break;
williamr@4
   833
  }
williamr@4
   834
  ++__last;
williamr@4
   835
  //Here we know that __pred(*--__last) is true
williamr@4
   836
  return __stable_partition_aux_aux(__first, __last, __pred,
williamr@4
   837
                                    _STLP_VALUE_TYPE(__first, _BidirectIter),
williamr@4
   838
                                    _STLP_DISTANCE_TYPE(__first, _BidirectIter), true);
williamr@4
   839
}
williamr@4
   840
williamr@4
   841
#if defined (_STLP_NONTEMPL_BASE_MATCH_BUG)
williamr@4
   842
template <class _BidirectIter, class _Predicate>
williamr@4
   843
_BidirectIter
williamr@4
   844
__stable_partition_aux(_BidirectIter __first, _BidirectIter __last, _Predicate __pred,
williamr@4
   845
                       const random_access_iterator_tag &) {
williamr@4
   846
  return __stable_partition_aux(__first, __last, __pred, bidirectional_iterator_tag());
williamr@4
   847
}
williamr@4
   848
#endif
williamr@4
   849
williamr@4
   850
_STLP_MOVE_TO_STD_NAMESPACE
williamr@2
   851
williamr@2
   852
template <class _ForwardIter, class _Predicate>
williamr@2
   853
_ForwardIter
williamr@2
   854
stable_partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred) {
williamr@2
   855
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@2
   856
  for (;;) {
williamr@2
   857
    if (__first == __last)
williamr@2
   858
      return __first;
williamr@2
   859
    else if (__pred(*__first))
williamr@2
   860
      ++__first;
williamr@2
   861
    else
williamr@2
   862
      break;
williamr@2
   863
  }
williamr@4
   864
  return _STLP_PRIV __stable_partition_aux(__first, __last, __pred,
williamr@2
   865
                                           _STLP_ITERATOR_CATEGORY(__first, _ForwardIter));
williamr@2
   866
}
williamr@2
   867
williamr@4
   868
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@2
   869
williamr@4
   870
template <class _RandomAccessIter, class _Tp, class _Compare>
williamr@4
   871
_RandomAccessIter __unguarded_partition(_RandomAccessIter __first,
williamr@4
   872
                                        _RandomAccessIter __last,
williamr@4
   873
                                        _Tp __pivot, _Compare __comp) {
williamr@4
   874
  for (;;) {
williamr@4
   875
    while (__comp(*__first, __pivot)) {
williamr@4
   876
      _STLP_VERBOSE_ASSERT(!__comp(__pivot, *__first), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@4
   877
      ++__first;
williamr@4
   878
    }
williamr@2
   879
    --__last;
williamr@4
   880
    while (__comp(__pivot, *__last)) {
williamr@4
   881
      _STLP_VERBOSE_ASSERT(!__comp(*__last, __pivot), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
   882
      --__last;
williamr@4
   883
    }
williamr@2
   884
    if (!(__first < __last))
williamr@2
   885
      return __first;
williamr@2
   886
    iter_swap(__first, __last);
williamr@2
   887
    ++__first;
williamr@2
   888
  }
williamr@2
   889
}
williamr@2
   890
williamr@4
   891
// sort() and its auxiliary functions.
williamr@4
   892
#define __stl_threshold  16
williamr@2
   893
williamr@2
   894
template <class _RandomAccessIter, class _Tp, class _Compare>
williamr@4
   895
void __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val,
williamr@2
   896
                               _Compare __comp) {
williamr@2
   897
  _RandomAccessIter __next = __last;
williamr@4
   898
  --__next;
williamr@2
   899
  while (__comp(__val, *__next)) {
williamr@4
   900
    _STLP_VERBOSE_ASSERT(!__comp(*__next, __val), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
   901
    *__last = *__next;
williamr@2
   902
    __last = __next;
williamr@2
   903
    --__next;
williamr@2
   904
  }
williamr@2
   905
  *__last = __val;
williamr@2
   906
}
williamr@2
   907
williamr@2
   908
template <class _RandomAccessIter, class _Tp, class _Compare>
williamr@4
   909
inline void __linear_insert(_RandomAccessIter __first,
williamr@2
   910
                            _RandomAccessIter __last, _Tp __val, _Compare __comp) {
williamr@4
   911
  //*TY 12/26/1998 - added __val as a paramter
williamr@4
   912
  //  _Tp __val = *__last;        //*TY 12/26/1998 - __val supplied by caller
williamr@2
   913
  if (__comp(__val, *__first)) {
williamr@4
   914
    _STLP_VERBOSE_ASSERT(!__comp(*__first, __val), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
   915
    copy_backward(__first, __last, __last + 1);
williamr@2
   916
    *__first = __val;
williamr@2
   917
  }
williamr@2
   918
  else
williamr@2
   919
    __unguarded_linear_insert(__last, __val, __comp);
williamr@2
   920
}
williamr@2
   921
williamr@4
   922
template <class _RandomAccessIter, class _Tp, class _Compare>
williamr@2
   923
void __insertion_sort(_RandomAccessIter __first,
williamr@4
   924
                      _RandomAccessIter __last,
williamr@4
   925
                      _Tp *, _Compare __comp) {
williamr@2
   926
  if (__first == __last) return;
williamr@2
   927
  for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
williamr@4
   928
    __linear_insert<_RandomAccessIter, _Tp, _Compare>(__first, __i, *__i, __comp);  //*TY 12/26/1998 - supply *__i as __val
williamr@2
   929
}
williamr@2
   930
williamr@2
   931
template <class _RandomAccessIter, class _Tp, class _Compare>
williamr@4
   932
void __unguarded_insertion_sort_aux(_RandomAccessIter __first,
williamr@2
   933
                                    _RandomAccessIter __last,
williamr@2
   934
                                    _Tp*, _Compare __comp) {
williamr@2
   935
  for (_RandomAccessIter __i = __first; __i != __last; ++__i)
williamr@4
   936
    __unguarded_linear_insert<_RandomAccessIter, _Tp, _Compare>(__i, *__i, __comp);
williamr@2
   937
}
williamr@2
   938
williamr@2
   939
template <class _RandomAccessIter, class _Compare>
williamr@4
   940
inline void __unguarded_insertion_sort(_RandomAccessIter __first,
williamr@2
   941
                                       _RandomAccessIter __last,
williamr@2
   942
                                       _Compare __comp) {
williamr@2
   943
  __unguarded_insertion_sort_aux(__first, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter), __comp);
williamr@2
   944
}
williamr@2
   945
williamr@2
   946
template <class _RandomAccessIter, class _Compare>
williamr@4
   947
void __final_insertion_sort(_RandomAccessIter __first,
williamr@2
   948
                            _RandomAccessIter __last, _Compare __comp) {
williamr@2
   949
  if (__last - __first > __stl_threshold) {
williamr@4
   950
    __insertion_sort(__first, __first + __stl_threshold, _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
williamr@2
   951
    __unguarded_insertion_sort(__first + __stl_threshold, __last, __comp);
williamr@2
   952
  }
williamr@2
   953
  else
williamr@4
   954
    __insertion_sort(__first, __last, _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
williamr@2
   955
}
williamr@2
   956
williamr@2
   957
template <class _RandomAccessIter, class _Tp, class _Size, class _Compare>
williamr@2
   958
void __introsort_loop(_RandomAccessIter __first,
williamr@2
   959
                      _RandomAccessIter __last, _Tp*,
williamr@4
   960
                      _Size __depth_limit, _Compare __comp) {
williamr@2
   961
  while (__last - __first > __stl_threshold) {
williamr@2
   962
    if (__depth_limit == 0) {
williamr@2
   963
      partial_sort(__first, __last, __last, __comp);
williamr@2
   964
      return;
williamr@2
   965
    }
williamr@2
   966
    --__depth_limit;
williamr@2
   967
    _RandomAccessIter __cut =
williamr@2
   968
      __unguarded_partition(__first, __last,
williamr@2
   969
                            _Tp(__median(*__first,
williamr@2
   970
                                         *(__first + (__last - __first)/2),
williamr@2
   971
                                         *(__last - 1), __comp)),
williamr@2
   972
       __comp);
williamr@2
   973
    __introsort_loop(__cut, __last, (_Tp*) 0, __depth_limit, __comp);
williamr@2
   974
    __last = __cut;
williamr@2
   975
  }
williamr@2
   976
}
williamr@2
   977
williamr@4
   978
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
   979
williamr@2
   980
template <class _RandomAccessIter>
williamr@2
   981
void sort(_RandomAccessIter __first, _RandomAccessIter __last) {
williamr@4
   982
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@2
   983
  if (__first != __last) {
williamr@4
   984
    _STLP_PRIV __introsort_loop(__first, __last,
williamr@4
   985
                                _STLP_VALUE_TYPE(__first, _RandomAccessIter),
williamr@4
   986
                                _STLP_PRIV __lg(__last - __first) * 2,
williamr@4
   987
                                _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)));
williamr@4
   988
    _STLP_PRIV __final_insertion_sort(__first, __last,
williamr@4
   989
                                      _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)));
williamr@2
   990
  }
williamr@2
   991
}
williamr@2
   992
williamr@2
   993
template <class _RandomAccessIter, class _Compare>
williamr@2
   994
void sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) {
williamr@4
   995
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@2
   996
  if (__first != __last) {
williamr@4
   997
    _STLP_PRIV __introsort_loop(__first, __last,
williamr@4
   998
                                _STLP_VALUE_TYPE(__first, _RandomAccessIter),
williamr@4
   999
                                _STLP_PRIV __lg(__last - __first) * 2, __comp);
williamr@4
  1000
    _STLP_PRIV __final_insertion_sort(__first, __last, __comp);
williamr@2
  1001
  }
williamr@2
  1002
}
williamr@2
  1003
williamr@2
  1004
// stable_sort() and its auxiliary functions.
williamr@4
  1005
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@2
  1006
williamr@2
  1007
template <class _RandomAccessIter, class _Compare>
williamr@2
  1008
void __inplace_stable_sort(_RandomAccessIter __first,
williamr@2
  1009
                           _RandomAccessIter __last, _Compare __comp) {
williamr@2
  1010
  if (__last - __first < 15) {
williamr@4
  1011
    __insertion_sort(__first, __last, _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
williamr@2
  1012
    return;
williamr@2
  1013
  }
williamr@2
  1014
  _RandomAccessIter __middle = __first + (__last - __first) / 2;
williamr@2
  1015
  __inplace_stable_sort(__first, __middle, __comp);
williamr@2
  1016
  __inplace_stable_sort(__middle, __last, __comp);
williamr@2
  1017
  __merge_without_buffer(__first, __middle, __last,
williamr@2
  1018
                         __middle - __first,
williamr@2
  1019
                         __last - __middle,
williamr@2
  1020
                         __comp);
williamr@2
  1021
}
williamr@2
  1022
williamr@2
  1023
template <class _RandomAccessIter1, class _RandomAccessIter2,
williamr@2
  1024
          class _Distance, class _Compare>
williamr@2
  1025
void __merge_sort_loop(_RandomAccessIter1 __first,
williamr@4
  1026
                       _RandomAccessIter1 __last,
williamr@2
  1027
                       _RandomAccessIter2 __result, _Distance __step_size,
williamr@2
  1028
                       _Compare __comp) {
williamr@2
  1029
  _Distance __two_step = 2 * __step_size;
williamr@2
  1030
williamr@2
  1031
  while (__last - __first >= __two_step) {
williamr@2
  1032
    __result = merge(__first, __first + __step_size,
williamr@2
  1033
                     __first + __step_size, __first + __two_step,
williamr@2
  1034
                     __result,
williamr@2
  1035
                     __comp);
williamr@2
  1036
    __first += __two_step;
williamr@2
  1037
  }
williamr@2
  1038
  __step_size = (min) (_Distance(__last - __first), __step_size);
williamr@2
  1039
williamr@2
  1040
  merge(__first, __first + __step_size,
williamr@2
  1041
        __first + __step_size, __last,
williamr@2
  1042
        __result,
williamr@2
  1043
        __comp);
williamr@2
  1044
}
williamr@2
  1045
williamr@2
  1046
const int __stl_chunk_size = 7;
williamr@4
  1047
williamr@2
  1048
template <class _RandomAccessIter, class _Distance, class _Compare>
williamr@4
  1049
void __chunk_insertion_sort(_RandomAccessIter __first,
williamr@2
  1050
                            _RandomAccessIter __last,
williamr@4
  1051
                            _Distance __chunk_size, _Compare __comp) {
williamr@2
  1052
  while (__last - __first >= __chunk_size) {
williamr@4
  1053
    __insertion_sort(__first, __first + __chunk_size,
williamr@4
  1054
                     _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
williamr@2
  1055
    __first += __chunk_size;
williamr@2
  1056
  }
williamr@4
  1057
  __insertion_sort(__first, __last, _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
williamr@2
  1058
}
williamr@2
  1059
williamr@2
  1060
template <class _RandomAccessIter, class _Pointer, class _Distance,
williamr@2
  1061
          class _Compare>
williamr@4
  1062
void __merge_sort_with_buffer(_RandomAccessIter __first,
williamr@2
  1063
                              _RandomAccessIter __last, _Pointer __buffer,
williamr@2
  1064
                              _Distance*, _Compare __comp) {
williamr@2
  1065
  _Distance __len = __last - __first;
williamr@2
  1066
  _Pointer __buffer_last = __buffer + __len;
williamr@2
  1067
williamr@2
  1068
  _Distance __step_size = __stl_chunk_size;
williamr@2
  1069
  __chunk_insertion_sort(__first, __last, __step_size, __comp);
williamr@2
  1070
williamr@2
  1071
  while (__step_size < __len) {
williamr@2
  1072
    __merge_sort_loop(__first, __last, __buffer, __step_size, __comp);
williamr@2
  1073
    __step_size *= 2;
williamr@2
  1074
    __merge_sort_loop(__buffer, __buffer_last, __first, __step_size, __comp);
williamr@2
  1075
    __step_size *= 2;
williamr@2
  1076
  }
williamr@2
  1077
}
williamr@2
  1078
williamr@2
  1079
template <class _BidirectionalIter1, class _BidirectionalIter2,
williamr@2
  1080
          class _Distance>
williamr@2
  1081
_BidirectionalIter1 __rotate_adaptive(_BidirectionalIter1 __first,
williamr@2
  1082
                                      _BidirectionalIter1 __middle,
williamr@2
  1083
                                      _BidirectionalIter1 __last,
williamr@2
  1084
                                      _Distance __len1, _Distance __len2,
williamr@2
  1085
                                      _BidirectionalIter2 __buffer,
williamr@2
  1086
                                      _Distance __buffer_size) {
williamr@2
  1087
  if (__len1 > __len2 && __len2 <= __buffer_size) {
williamr@2
  1088
    _BidirectionalIter2 __buffer_end = copy(__middle, __last, __buffer);
williamr@2
  1089
    copy_backward(__first, __middle, __last);
williamr@2
  1090
    return copy(__buffer, __buffer_end, __first);
williamr@2
  1091
  }
williamr@2
  1092
  else if (__len1 <= __buffer_size) {
williamr@2
  1093
    _BidirectionalIter2 __buffer_end = copy(__first, __middle, __buffer);
williamr@2
  1094
    copy(__middle, __last, __first);
williamr@2
  1095
    return copy_backward(__buffer, __buffer_end, __last);
williamr@2
  1096
  }
williamr@2
  1097
  else
williamr@4
  1098
    return __rotate(__first, __middle, __last);
williamr@2
  1099
}
williamr@2
  1100
williamr@2
  1101
template <class _BidirectionalIter, class _Distance, class _Pointer,
williamr@2
  1102
          class _Compare>
williamr@4
  1103
void __merge_adaptive(_BidirectionalIter __first,
williamr@4
  1104
                      _BidirectionalIter __middle,
williamr@2
  1105
                      _BidirectionalIter __last,
williamr@2
  1106
                      _Distance __len1, _Distance __len2,
williamr@2
  1107
                      _Pointer __buffer, _Distance __buffer_size,
williamr@2
  1108
                      _Compare __comp) {
williamr@2
  1109
  if (__len1 <= __len2 && __len1 <= __buffer_size) {
williamr@2
  1110
    _Pointer __buffer_end = copy(__first, __middle, __buffer);
williamr@2
  1111
    merge(__buffer, __buffer_end, __middle, __last, __first, __comp);
williamr@2
  1112
  }
williamr@2
  1113
  else if (__len2 <= __buffer_size) {
williamr@2
  1114
    _Pointer __buffer_end = copy(__middle, __last, __buffer);
williamr@2
  1115
    __merge_backward(__first, __middle, __buffer, __buffer_end, __last,
williamr@2
  1116
                     __comp);
williamr@2
  1117
  }
williamr@2
  1118
  else {
williamr@2
  1119
    _BidirectionalIter __first_cut = __first;
williamr@2
  1120
    _BidirectionalIter __second_cut = __middle;
williamr@2
  1121
    _Distance __len11 = 0;
williamr@2
  1122
    _Distance __len22 = 0;
williamr@2
  1123
    if (__len1 > __len2) {
williamr@2
  1124
      __len11 = __len1 / 2;
williamr@2
  1125
      advance(__first_cut, __len11);
williamr@2
  1126
      __second_cut = lower_bound(__middle, __last, *__first_cut, __comp);
williamr@4
  1127
      __len22 += distance(__middle, __second_cut);
williamr@2
  1128
    }
williamr@2
  1129
    else {
williamr@2
  1130
      __len22 = __len2 / 2;
williamr@2
  1131
      advance(__second_cut, __len22);
williamr@2
  1132
      __first_cut = upper_bound(__first, __middle, *__second_cut, __comp);
williamr@2
  1133
      __len11 += distance(__first, __first_cut);
williamr@2
  1134
    }
williamr@2
  1135
    _BidirectionalIter __new_middle =
williamr@2
  1136
      __rotate_adaptive(__first_cut, __middle, __second_cut, __len1 - __len11,
williamr@2
  1137
                        __len22, __buffer, __buffer_size);
williamr@2
  1138
    __merge_adaptive(__first, __first_cut, __new_middle, __len11,
williamr@2
  1139
                     __len22, __buffer, __buffer_size, __comp);
williamr@2
  1140
    __merge_adaptive(__new_middle, __second_cut, __last, __len1 - __len11,
williamr@2
  1141
                     __len2 - __len22, __buffer, __buffer_size, __comp);
williamr@2
  1142
  }
williamr@2
  1143
}
williamr@2
  1144
williamr@4
  1145
template <class _RandomAccessIter, class _Pointer, class _Distance,
williamr@2
  1146
          class _Compare>
williamr@4
  1147
void __stable_sort_adaptive(_RandomAccessIter __first,
williamr@2
  1148
                            _RandomAccessIter __last, _Pointer __buffer,
williamr@2
  1149
                            _Distance __buffer_size, _Compare __comp) {
williamr@2
  1150
  _Distance __len = (__last - __first + 1) / 2;
williamr@2
  1151
  _RandomAccessIter __middle = __first + __len;
williamr@2
  1152
  if (__len > __buffer_size) {
williamr@4
  1153
    __stable_sort_adaptive(__first, __middle, __buffer, __buffer_size,
williamr@2
  1154
                           __comp);
williamr@4
  1155
    __stable_sort_adaptive(__middle, __last, __buffer, __buffer_size,
williamr@2
  1156
                           __comp);
williamr@2
  1157
  }
williamr@2
  1158
  else {
williamr@2
  1159
    __merge_sort_with_buffer(__first, __middle, __buffer, (_Distance*)0,
williamr@2
  1160
                               __comp);
williamr@2
  1161
    __merge_sort_with_buffer(__middle, __last, __buffer, (_Distance*)0,
williamr@2
  1162
                               __comp);
williamr@2
  1163
  }
williamr@4
  1164
  __merge_adaptive(__first, __middle, __last, _Distance(__middle - __first),
williamr@2
  1165
                   _Distance(__last - __middle), __buffer, __buffer_size,
williamr@2
  1166
                   __comp);
williamr@2
  1167
}
williamr@2
  1168
williamr@2
  1169
template <class _RandomAccessIter, class _Tp, class _Distance, class _Compare>
williamr@2
  1170
void __stable_sort_aux(_RandomAccessIter __first,
williamr@4
  1171
                       _RandomAccessIter __last, _Tp*, _Distance*,
williamr@4
  1172
                       _Compare __comp) {
williamr@4
  1173
  _Temporary_buffer<_RandomAccessIter, _Tp> buf(__first, __last);
williamr@4
  1174
  if (buf.begin() == 0)
williamr@2
  1175
    __inplace_stable_sort(__first, __last, __comp);
williamr@4
  1176
  else
williamr@4
  1177
    __stable_sort_adaptive(__first, __last, buf.begin(),
williamr@4
  1178
                           _Distance(buf.size()),
williamr@2
  1179
                           __comp);
williamr@2
  1180
}
williamr@2
  1181
williamr@4
  1182
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  1183
williamr@2
  1184
template <class _RandomAccessIter>
williamr@2
  1185
void stable_sort(_RandomAccessIter __first,
williamr@4
  1186
                 _RandomAccessIter __last) {
williamr@4
  1187
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
  1188
  _STLP_PRIV __stable_sort_aux(__first, __last,
williamr@4
  1189
                               _STLP_VALUE_TYPE(__first, _RandomAccessIter),
williamr@4
  1190
                               _STLP_DISTANCE_TYPE(__first, _RandomAccessIter),
williamr@4
  1191
                               _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)));
williamr@2
  1192
}
williamr@2
  1193
williamr@2
  1194
template <class _RandomAccessIter, class _Compare>
williamr@2
  1195
void stable_sort(_RandomAccessIter __first,
williamr@4
  1196
                 _RandomAccessIter __last, _Compare __comp) {
williamr@4
  1197
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
  1198
  _STLP_PRIV __stable_sort_aux(__first, __last,
williamr@4
  1199
                               _STLP_VALUE_TYPE(__first, _RandomAccessIter),
williamr@4
  1200
                               _STLP_DISTANCE_TYPE(__first, _RandomAccessIter),
williamr@4
  1201
                               __comp);
williamr@2
  1202
}
williamr@2
  1203
williamr@2
  1204
// partial_sort, partial_sort_copy, and auxiliary functions.
williamr@4
  1205
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@2
  1206
williamr@2
  1207
template <class _RandomAccessIter, class _Tp, class _Compare>
williamr@2
  1208
void __partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle,
williamr@2
  1209
                    _RandomAccessIter __last, _Tp*, _Compare __comp) {
williamr@2
  1210
  make_heap(__first, __middle, __comp);
williamr@4
  1211
  for (_RandomAccessIter __i = __middle; __i < __last; ++__i) {
williamr@4
  1212
    if (__comp(*__i, *__first)) {
williamr@4
  1213
      _STLP_VERBOSE_ASSERT(!__comp(*__first, *__i), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1214
      __pop_heap(__first, __middle, __i, _Tp(*__i), __comp,
williamr@2
  1215
                 _STLP_DISTANCE_TYPE(__first, _RandomAccessIter));
williamr@4
  1216
    }
williamr@4
  1217
  }
williamr@2
  1218
  sort_heap(__first, __middle, __comp);
williamr@2
  1219
}
williamr@2
  1220
williamr@4
  1221
_STLP_MOVE_TO_STD_NAMESPACE
williamr@2
  1222
williamr@2
  1223
template <class _RandomAccessIter>
williamr@4
  1224
void partial_sort(_RandomAccessIter __first,_RandomAccessIter __middle,
williamr@4
  1225
                  _RandomAccessIter __last) {
williamr@4
  1226
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
williamr@4
  1227
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
williamr@4
  1228
  _STLP_PRIV __partial_sort(__first, __middle, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter),
williamr@4
  1229
                            _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)));
williamr@2
  1230
}
williamr@2
  1231
williamr@2
  1232
template <class _RandomAccessIter, class _Compare>
williamr@2
  1233
void partial_sort(_RandomAccessIter __first,_RandomAccessIter __middle,
williamr@2
  1234
                  _RandomAccessIter __last, _Compare __comp) {
williamr@4
  1235
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
williamr@4
  1236
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
williamr@4
  1237
  _STLP_PRIV __partial_sort(__first, __middle, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter), __comp);
williamr@2
  1238
}
williamr@2
  1239
williamr@4
  1240
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
  1241
williamr@2
  1242
template <class _InputIter, class _RandomAccessIter, class _Compare,
williamr@2
  1243
          class _Distance, class _Tp>
williamr@2
  1244
_RandomAccessIter __partial_sort_copy(_InputIter __first,
williamr@4
  1245
                                      _InputIter __last,
williamr@4
  1246
                                      _RandomAccessIter __result_first,
williamr@4
  1247
                                      _RandomAccessIter __result_last,
williamr@4
  1248
                                      _Compare __comp, _Distance*, _Tp*) {
williamr@2
  1249
  if (__result_first == __result_last) return __result_last;
williamr@2
  1250
  _RandomAccessIter __result_real_last = __result_first;
williamr@2
  1251
  while(__first != __last && __result_real_last != __result_last) {
williamr@2
  1252
    *__result_real_last = *__first;
williamr@2
  1253
    ++__result_real_last;
williamr@2
  1254
    ++__first;
williamr@2
  1255
  }
williamr@2
  1256
  make_heap(__result_first, __result_real_last, __comp);
williamr@2
  1257
  while (__first != __last) {
williamr@4
  1258
    if (__comp(*__first, *__result_first)) {
williamr@4
  1259
      _STLP_VERBOSE_ASSERT(!__comp(*__result_first, *__first), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1260
      __adjust_heap(__result_first, _Distance(0),
williamr@2
  1261
                    _Distance(__result_real_last - __result_first),
williamr@2
  1262
                    _Tp(*__first),
williamr@2
  1263
                    __comp);
williamr@4
  1264
    }
williamr@2
  1265
    ++__first;
williamr@2
  1266
  }
williamr@2
  1267
  sort_heap(__result_first, __result_real_last, __comp);
williamr@2
  1268
  return __result_real_last;
williamr@2
  1269
}
williamr@2
  1270
williamr@4
  1271
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  1272
williamr@2
  1273
template <class _InputIter, class _RandomAccessIter>
williamr@2
  1274
_RandomAccessIter
williamr@2
  1275
partial_sort_copy(_InputIter __first, _InputIter __last,
williamr@2
  1276
                  _RandomAccessIter __result_first, _RandomAccessIter __result_last) {
williamr@4
  1277
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
  1278
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__result_first, __result_last))
williamr@4
  1279
  return _STLP_PRIV __partial_sort_copy(__first, __last, __result_first, __result_last,
williamr@4
  1280
                                        _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _InputIter)),
williamr@4
  1281
                                        _STLP_DISTANCE_TYPE(__result_first, _RandomAccessIter),
williamr@4
  1282
                                        _STLP_VALUE_TYPE(__first, _InputIter));
williamr@2
  1283
}
williamr@2
  1284
williamr@2
  1285
template <class _InputIter, class _RandomAccessIter, class _Compare>
williamr@2
  1286
_RandomAccessIter
williamr@2
  1287
partial_sort_copy(_InputIter __first, _InputIter __last,
williamr@2
  1288
                  _RandomAccessIter __result_first,
williamr@2
  1289
                  _RandomAccessIter __result_last, _Compare __comp) {
williamr@4
  1290
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
  1291
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__result_first, __result_last))
williamr@4
  1292
  return _STLP_PRIV __partial_sort_copy(__first, __last, __result_first, __result_last,
williamr@4
  1293
                                        __comp,
williamr@4
  1294
                                        _STLP_DISTANCE_TYPE(__result_first, _RandomAccessIter),
williamr@4
  1295
                                        _STLP_VALUE_TYPE(__first, _InputIter));
williamr@2
  1296
}
williamr@2
  1297
williamr@4
  1298
// nth_element() and its auxiliary functions.
williamr@4
  1299
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@2
  1300
williamr@2
  1301
template <class _RandomAccessIter, class _Tp, class _Compare>
williamr@2
  1302
void __nth_element(_RandomAccessIter __first, _RandomAccessIter __nth,
williamr@2
  1303
                   _RandomAccessIter __last, _Tp*, _Compare __comp) {
williamr@2
  1304
  while (__last - __first > 3) {
williamr@2
  1305
    _RandomAccessIter __cut =
williamr@2
  1306
      __unguarded_partition(__first, __last,
williamr@2
  1307
                            _Tp(__median(*__first,
williamr@4
  1308
                                         *(__first + (__last - __first)/2),
williamr@2
  1309
                                         *(__last - 1),
williamr@2
  1310
                                         __comp)),
williamr@2
  1311
                            __comp);
williamr@2
  1312
    if (__cut <= __nth)
williamr@2
  1313
      __first = __cut;
williamr@4
  1314
    else
williamr@2
  1315
      __last = __cut;
williamr@2
  1316
  }
williamr@4
  1317
  __insertion_sort(__first, __last, _STLP_VALUE_TYPE(__first,_RandomAccessIter), __comp);
williamr@2
  1318
}
williamr@2
  1319
williamr@4
  1320
_STLP_MOVE_TO_STD_NAMESPACE
williamr@2
  1321
williamr@2
  1322
template <class _RandomAccessIter>
williamr@2
  1323
void nth_element(_RandomAccessIter __first, _RandomAccessIter __nth,
williamr@2
  1324
                 _RandomAccessIter __last) {
williamr@4
  1325
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __nth))
williamr@4
  1326
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__nth, __last))
williamr@4
  1327
  _STLP_PRIV __nth_element(__first, __nth, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter),
williamr@4
  1328
                           _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)));
williamr@2
  1329
}
williamr@2
  1330
williamr@2
  1331
template <class _RandomAccessIter, class _Compare>
williamr@2
  1332
void nth_element(_RandomAccessIter __first, _RandomAccessIter __nth,
williamr@2
  1333
                 _RandomAccessIter __last, _Compare __comp) {
williamr@4
  1334
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __nth))
williamr@4
  1335
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__nth, __last))
williamr@4
  1336
  _STLP_PRIV __nth_element(__first, __nth, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter), __comp);
williamr@2
  1337
}
williamr@2
  1338
williamr@2
  1339
// Binary search (lower_bound, upper_bound, equal_range, binary_search).
williamr@4
  1340
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@2
  1341
williamr@4
  1342
template <class _ForwardIter, class _Tp,
williamr@4
  1343
          class _Compare1, class _Compare2, class _Distance>
williamr@4
  1344
_ForwardIter __upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
williamr@4
  1345
                           _Compare1 __comp1, _Compare2 __comp2, _Distance*) {
williamr@2
  1346
  _Distance __len = distance(__first, __last);
williamr@2
  1347
  _Distance __half;
williamr@2
  1348
williamr@2
  1349
  while (__len > 0) {
williamr@2
  1350
    __half = __len >> 1;
williamr@2
  1351
    _ForwardIter __middle = __first;
williamr@2
  1352
    advance(__middle, __half);
williamr@4
  1353
    if (__comp2(__val, *__middle)) {
williamr@4
  1354
      _STLP_VERBOSE_ASSERT(!__comp1(*__middle, __val), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1355
      __len = __half;
williamr@4
  1356
    }
williamr@2
  1357
    else {
williamr@2
  1358
      __first = __middle;
williamr@2
  1359
      ++__first;
williamr@2
  1360
      __len = __len - __half - 1;
williamr@2
  1361
    }
williamr@2
  1362
  }
williamr@2
  1363
  return __first;
williamr@2
  1364
}
williamr@2
  1365
williamr@4
  1366
template <class _ForwardIter, class _Tp,
williamr@4
  1367
          class _Compare1, class _Compare2, class _Distance>
williamr@2
  1368
pair<_ForwardIter, _ForwardIter>
williamr@2
  1369
__equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
williamr@4
  1370
              _Compare1 __comp1, _Compare2 __comp2, _Distance* __dist) {
williamr@2
  1371
  _Distance __len = distance(__first, __last);
williamr@2
  1372
  _Distance __half;
williamr@2
  1373
williamr@2
  1374
  while (__len > 0) {
williamr@2
  1375
    __half = __len >> 1;
williamr@2
  1376
    _ForwardIter __middle = __first;
williamr@2
  1377
    advance(__middle, __half);
williamr@4
  1378
    if (__comp1(*__middle, __val)) {
williamr@4
  1379
      _STLP_VERBOSE_ASSERT(!__comp2(__val, *__middle), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1380
      __first = __middle;
williamr@2
  1381
      ++__first;
williamr@2
  1382
      __len = __len - __half - 1;
williamr@2
  1383
    }
williamr@4
  1384
    else if (__comp2(__val, *__middle)) {
williamr@4
  1385
      _STLP_VERBOSE_ASSERT(!__comp1(*__middle, __val), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1386
      __len = __half;
williamr@4
  1387
    }
williamr@2
  1388
    else {
williamr@4
  1389
      _ForwardIter __left = __lower_bound(__first, __middle, __val, __comp1, __comp2, __dist);
williamr@4
  1390
      //Small optim: If lower_bound haven't found an equivalent value
williamr@4
  1391
      //there is no need to call upper_bound.
williamr@4
  1392
      if (__comp1(*__left, __val)) {
williamr@4
  1393
        _STLP_VERBOSE_ASSERT(!__comp2(__val, *__left), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@4
  1394
        return pair<_ForwardIter, _ForwardIter>(__left, __left);
williamr@4
  1395
      }
williamr@2
  1396
      advance(__first, __len);
williamr@4
  1397
      _ForwardIter __right = __upper_bound(++__middle, __first, __val, __comp1, __comp2, __dist);
williamr@2
  1398
      return pair<_ForwardIter, _ForwardIter>(__left, __right);
williamr@2
  1399
    }
williamr@2
  1400
  }
williamr@2
  1401
  return pair<_ForwardIter, _ForwardIter>(__first, __first);
williamr@4
  1402
}
williamr@4
  1403
williamr@4
  1404
_STLP_MOVE_TO_STD_NAMESPACE
williamr@2
  1405
williamr@2
  1406
template <class _InputIter1, class _InputIter2, class _OutputIter>
williamr@2
  1407
_OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1408
                  _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1409
                  _OutputIter __result) {
williamr@4
  1410
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
williamr@4
  1411
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
williamr@2
  1412
  while (__first1 != __last1 && __first2 != __last2) {
williamr@2
  1413
    if (*__first2 < *__first1) {
williamr@2
  1414
      *__result = *__first2;
williamr@2
  1415
      ++__first2;
williamr@2
  1416
    }
williamr@2
  1417
    else {
williamr@2
  1418
      *__result = *__first1;
williamr@2
  1419
      ++__first1;
williamr@2
  1420
    }
williamr@2
  1421
    ++__result;
williamr@2
  1422
  }
williamr@2
  1423
  return copy(__first2, __last2, copy(__first1, __last1, __result));
williamr@2
  1424
}
williamr@2
  1425
williamr@2
  1426
template <class _InputIter1, class _InputIter2, class _OutputIter,
williamr@2
  1427
          class _Compare>
williamr@2
  1428
_OutputIter merge(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1429
                  _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1430
                  _OutputIter __result, _Compare __comp) {
williamr@4
  1431
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
williamr@4
  1432
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2))
williamr@2
  1433
  while (__first1 != __last1 && __first2 != __last2) {
williamr@2
  1434
    if (__comp(*__first2, *__first1)) {
williamr@4
  1435
      _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1436
      *__result = *__first2;
williamr@2
  1437
      ++__first2;
williamr@2
  1438
    }
williamr@2
  1439
    else {
williamr@2
  1440
      *__result = *__first1;
williamr@2
  1441
      ++__first1;
williamr@2
  1442
    }
williamr@2
  1443
    ++__result;
williamr@2
  1444
  }
williamr@2
  1445
  return copy(__first2, __last2, copy(__first1, __last1, __result));
williamr@2
  1446
}
williamr@2
  1447
williamr@4
  1448
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
  1449
williamr@2
  1450
template <class _BidirectionalIter, class _Distance, class _Compare>
williamr@2
  1451
void __merge_without_buffer(_BidirectionalIter __first,
williamr@2
  1452
                            _BidirectionalIter __middle,
williamr@2
  1453
                            _BidirectionalIter __last,
williamr@2
  1454
                            _Distance __len1, _Distance __len2,
williamr@2
  1455
                            _Compare __comp) {
williamr@2
  1456
  if (__len1 == 0 || __len2 == 0)
williamr@2
  1457
    return;
williamr@2
  1458
  if (__len1 + __len2 == 2) {
williamr@4
  1459
    if (__comp(*__middle, *__first)) {
williamr@4
  1460
      _STLP_VERBOSE_ASSERT(!__comp(*__first, *__middle), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1461
      iter_swap(__first, __middle);
williamr@4
  1462
    }
williamr@2
  1463
    return;
williamr@2
  1464
  }
williamr@2
  1465
  _BidirectionalIter __first_cut = __first;
williamr@2
  1466
  _BidirectionalIter __second_cut = __middle;
williamr@2
  1467
  _Distance __len11 = 0;
williamr@2
  1468
  _Distance __len22 = 0;
williamr@2
  1469
  if (__len1 > __len2) {
williamr@2
  1470
    __len11 = __len1 / 2;
williamr@2
  1471
    advance(__first_cut, __len11);
williamr@2
  1472
    __second_cut = lower_bound(__middle, __last, *__first_cut, __comp);
williamr@2
  1473
    __len22 += distance(__middle, __second_cut);
williamr@2
  1474
  }
williamr@2
  1475
  else {
williamr@2
  1476
    __len22 = __len2 / 2;
williamr@2
  1477
    advance(__second_cut, __len22);
williamr@2
  1478
    __first_cut = upper_bound(__first, __middle, *__second_cut, __comp);
williamr@2
  1479
    __len11 +=distance(__first, __first_cut);
williamr@2
  1480
  }
williamr@2
  1481
  _BidirectionalIter __new_middle
williamr@4
  1482
    = __rotate(__first_cut, __middle, __second_cut);
williamr@2
  1483
  __merge_without_buffer(__first, __first_cut, __new_middle, __len11, __len22,
williamr@2
  1484
                         __comp);
williamr@2
  1485
  __merge_without_buffer(__new_middle, __second_cut, __last, __len1 - __len11,
williamr@2
  1486
                         __len2 - __len22, __comp);
williamr@2
  1487
}
williamr@2
  1488
williamr@2
  1489
template <class _BidirectionalIter1, class _BidirectionalIter2,
williamr@2
  1490
          class _BidirectionalIter3, class _Compare>
williamr@2
  1491
_BidirectionalIter3 __merge_backward(_BidirectionalIter1 __first1,
williamr@2
  1492
                                     _BidirectionalIter1 __last1,
williamr@2
  1493
                                     _BidirectionalIter2 __first2,
williamr@2
  1494
                                     _BidirectionalIter2 __last2,
williamr@2
  1495
                                     _BidirectionalIter3 __result,
williamr@2
  1496
                                     _Compare __comp) {
williamr@2
  1497
  if (__first1 == __last1)
williamr@2
  1498
    return copy_backward(__first2, __last2, __result);
williamr@2
  1499
  if (__first2 == __last2)
williamr@2
  1500
    return copy_backward(__first1, __last1, __result);
williamr@2
  1501
  --__last1;
williamr@2
  1502
  --__last2;
williamr@4
  1503
  for (;;) {
williamr@2
  1504
    if (__comp(*__last2, *__last1)) {
williamr@4
  1505
      _STLP_VERBOSE_ASSERT(!__comp(*__last1, *__last2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1506
      *--__result = *__last1;
williamr@2
  1507
      if (__first1 == __last1)
williamr@2
  1508
        return copy_backward(__first2, ++__last2, __result);
williamr@2
  1509
      --__last1;
williamr@2
  1510
    }
williamr@2
  1511
    else {
williamr@2
  1512
      *--__result = *__last2;
williamr@2
  1513
      if (__first2 == __last2)
williamr@2
  1514
        return copy_backward(__first1, ++__last1, __result);
williamr@2
  1515
      --__last2;
williamr@2
  1516
    }
williamr@2
  1517
  }
williamr@2
  1518
}
williamr@2
  1519
williamr@4
  1520
template <class _BidirectionalIter, class _Tp,
williamr@2
  1521
          class _Distance, class _Compare>
williamr@2
  1522
inline void __inplace_merge_aux(_BidirectionalIter __first,
williamr@2
  1523
                                _BidirectionalIter __middle,
williamr@2
  1524
                                _BidirectionalIter __last, _Tp*, _Distance*,
williamr@2
  1525
                                _Compare __comp) {
williamr@2
  1526
  _Distance __len1 = distance(__first, __middle);
williamr@2
  1527
  _Distance __len2 = distance(__middle, __last);
williamr@2
  1528
williamr@4
  1529
  _Temporary_buffer<_BidirectionalIter, _Tp> __buf(__first, __last);
williamr@2
  1530
  if (__buf.begin() == 0)
williamr@2
  1531
    __merge_without_buffer(__first, __middle, __last, __len1, __len2, __comp);
williamr@2
  1532
  else
williamr@2
  1533
    __merge_adaptive(__first, __middle, __last, __len1, __len2,
williamr@2
  1534
                     __buf.begin(), _Distance(__buf.size()),
williamr@2
  1535
                     __comp);
williamr@2
  1536
}
williamr@2
  1537
williamr@4
  1538
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  1539
williamr@2
  1540
template <class _BidirectionalIter>
williamr@2
  1541
void inplace_merge(_BidirectionalIter __first,
williamr@4
  1542
                   _BidirectionalIter __middle,
williamr@4
  1543
                   _BidirectionalIter __last) {
williamr@4
  1544
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
williamr@4
  1545
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
williamr@2
  1546
  if (__first == __middle || __middle == __last)
williamr@2
  1547
    return;
williamr@4
  1548
  _STLP_PRIV __inplace_merge_aux(__first, __middle, __last,
williamr@4
  1549
                                 _STLP_VALUE_TYPE(__first, _BidirectionalIter), _STLP_DISTANCE_TYPE(__first, _BidirectionalIter),
williamr@4
  1550
                                 _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _BidirectionalIter)));
williamr@2
  1551
}
williamr@2
  1552
williamr@2
  1553
template <class _BidirectionalIter, class _Compare>
williamr@2
  1554
void inplace_merge(_BidirectionalIter __first,
williamr@4
  1555
                   _BidirectionalIter __middle,
williamr@4
  1556
                   _BidirectionalIter __last, _Compare __comp) {
williamr@4
  1557
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
williamr@4
  1558
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
williamr@2
  1559
  if (__first == __middle || __middle == __last)
williamr@2
  1560
    return;
williamr@4
  1561
  _STLP_PRIV __inplace_merge_aux(__first, __middle, __last,
williamr@4
  1562
                                 _STLP_VALUE_TYPE(__first, _BidirectionalIter), _STLP_DISTANCE_TYPE(__first, _BidirectionalIter),
williamr@4
  1563
                                 __comp);
williamr@2
  1564
}
williamr@2
  1565
williamr@4
  1566
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@2
  1567
williamr@2
  1568
template <class _InputIter1, class _InputIter2, class _Compare>
williamr@2
  1569
bool __includes(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1570
                _InputIter2 __first2, _InputIter2 __last2, _Compare __comp) {
williamr@2
  1571
  _STLP_DEBUG_CHECK(__check_range(__first1, __last1))
williamr@2
  1572
  _STLP_DEBUG_CHECK(__check_range(__first2, __last2))
williamr@2
  1573
  while (__first1 != __last1 && __first2 != __last2)
williamr@4
  1574
    if (__comp(*__first2, *__first1)) {
williamr@4
  1575
      _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1576
      return false;
williamr@4
  1577
    }
williamr@4
  1578
    else if (__comp(*__first1, *__first2))
williamr@2
  1579
      ++__first1;
williamr@2
  1580
    else
williamr@2
  1581
      ++__first1, ++__first2;
williamr@2
  1582
williamr@2
  1583
  return __first2 == __last2;
williamr@2
  1584
}
williamr@2
  1585
williamr@4
  1586
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  1587
williamr@2
  1588
template <class _InputIter1, class _InputIter2, class _Compare>
williamr@2
  1589
bool includes(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1590
              _InputIter2 __first2, _InputIter2 __last2, _Compare __comp) {
williamr@4
  1591
  return _STLP_PRIV __includes(__first1, __last1, __first2, __last2, __comp);
williamr@2
  1592
}
williamr@2
  1593
williamr@2
  1594
template <class _InputIter1, class _InputIter2>
williamr@2
  1595
bool includes(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1596
              _InputIter2 __first2, _InputIter2 __last2) {
williamr@4
  1597
  return _STLP_PRIV __includes(__first1, __last1, __first2, __last2,
williamr@4
  1598
                               _STLP_PRIV __less(_STLP_VALUE_TYPE(__first1, _InputIter1)));
williamr@2
  1599
}
williamr@2
  1600
williamr@4
  1601
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
  1602
williamr@2
  1603
template <class _InputIter1, class _InputIter2, class _OutputIter,
williamr@2
  1604
          class _Compare>
williamr@2
  1605
_OutputIter __set_union(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1606
                        _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1607
                        _OutputIter __result, _Compare __comp) {
williamr@2
  1608
  _STLP_DEBUG_CHECK(__check_range(__first1, __last1))
williamr@2
  1609
  _STLP_DEBUG_CHECK(__check_range(__first2, __last2))
williamr@2
  1610
  while (__first1 != __last1 && __first2 != __last2) {
williamr@2
  1611
    if (__comp(*__first1, *__first2)) {
williamr@4
  1612
      _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1613
      *__result = *__first1;
williamr@2
  1614
      ++__first1;
williamr@2
  1615
    }
williamr@2
  1616
    else if (__comp(*__first2, *__first1)) {
williamr@4
  1617
      _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1618
      *__result = *__first2;
williamr@2
  1619
      ++__first2;
williamr@2
  1620
    }
williamr@2
  1621
    else {
williamr@2
  1622
      *__result = *__first1;
williamr@2
  1623
      ++__first1;
williamr@2
  1624
      ++__first2;
williamr@2
  1625
    }
williamr@2
  1626
    ++__result;
williamr@2
  1627
  }
williamr@2
  1628
  return copy(__first2, __last2, copy(__first1, __last1, __result));
williamr@2
  1629
}
williamr@2
  1630
williamr@4
  1631
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  1632
williamr@2
  1633
template <class _InputIter1, class _InputIter2, class _OutputIter>
williamr@2
  1634
_OutputIter set_union(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1635
                      _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1636
                      _OutputIter __result) {
williamr@4
  1637
  return _STLP_PRIV __set_union(__first1, __last1, __first2, __last2, __result,
williamr@4
  1638
                                _STLP_PRIV __less(_STLP_VALUE_TYPE(__first1, _InputIter1)));
williamr@2
  1639
}
williamr@2
  1640
williamr@2
  1641
template <class _InputIter1, class _InputIter2, class _OutputIter,
williamr@2
  1642
          class _Compare>
williamr@2
  1643
_OutputIter set_union(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1644
                      _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1645
                      _OutputIter __result, _Compare __comp) {
williamr@4
  1646
  return _STLP_PRIV __set_union(__first1, __last1, __first2, __last2, __result, __comp);
williamr@2
  1647
}
williamr@2
  1648
williamr@4
  1649
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
  1650
williamr@2
  1651
template <class _InputIter1, class _InputIter2, class _OutputIter,
williamr@2
  1652
          class _Compare>
williamr@2
  1653
_OutputIter __set_intersection(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1654
                               _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1655
                               _OutputIter __result, _Compare __comp) {
williamr@2
  1656
  _STLP_DEBUG_CHECK(__check_range(__first1, __last1))
williamr@2
  1657
  _STLP_DEBUG_CHECK(__check_range(__first2, __last2))
williamr@2
  1658
  while (__first1 != __last1 && __first2 != __last2)
williamr@4
  1659
    if (__comp(*__first1, *__first2)) {
williamr@4
  1660
      _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1661
      ++__first1;
williamr@4
  1662
    }
williamr@2
  1663
    else if (__comp(*__first2, *__first1))
williamr@2
  1664
      ++__first2;
williamr@2
  1665
    else {
williamr@2
  1666
      *__result = *__first1;
williamr@2
  1667
      ++__first1;
williamr@2
  1668
      ++__first2;
williamr@2
  1669
      ++__result;
williamr@2
  1670
    }
williamr@2
  1671
  return __result;
williamr@2
  1672
}
williamr@2
  1673
williamr@4
  1674
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  1675
williamr@2
  1676
template <class _InputIter1, class _InputIter2, class _OutputIter>
williamr@2
  1677
_OutputIter set_intersection(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1678
                             _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1679
                             _OutputIter __result) {
williamr@4
  1680
  return _STLP_PRIV __set_intersection(__first1, __last1, __first2, __last2, __result,
williamr@4
  1681
                                       _STLP_PRIV __less(_STLP_VALUE_TYPE(__first1, _InputIter1)));
williamr@2
  1682
}
williamr@2
  1683
williamr@2
  1684
template <class _InputIter1, class _InputIter2, class _OutputIter,
williamr@2
  1685
          class _Compare>
williamr@2
  1686
_OutputIter set_intersection(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1687
                             _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1688
                             _OutputIter __result, _Compare __comp) {
williamr@4
  1689
  return _STLP_PRIV __set_intersection(__first1, __last1, __first2, __last2, __result, __comp);
williamr@2
  1690
}
williamr@2
  1691
williamr@4
  1692
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
  1693
williamr@4
  1694
template <class _InputIter1, class _InputIter2, class _OutputIter,
williamr@2
  1695
          class _Compare>
williamr@2
  1696
_OutputIter __set_difference(_InputIter1 __first1, _InputIter1 __last1,
williamr@4
  1697
                             _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1698
                             _OutputIter __result, _Compare __comp) {
williamr@2
  1699
  _STLP_DEBUG_CHECK(__check_range(__first1, __last1))
williamr@2
  1700
  _STLP_DEBUG_CHECK(__check_range(__first2, __last2))
williamr@2
  1701
  while (__first1 != __last1 && __first2 != __last2)
williamr@2
  1702
    if (__comp(*__first1, *__first2)) {
williamr@4
  1703
      _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1704
      *__result = *__first1;
williamr@2
  1705
      ++__first1;
williamr@2
  1706
      ++__result;
williamr@2
  1707
    }
williamr@2
  1708
    else if (__comp(*__first2, *__first1))
williamr@2
  1709
      ++__first2;
williamr@2
  1710
    else {
williamr@2
  1711
      ++__first1;
williamr@2
  1712
      ++__first2;
williamr@2
  1713
    }
williamr@2
  1714
  return copy(__first1, __last1, __result);
williamr@2
  1715
}
williamr@2
  1716
williamr@4
  1717
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  1718
williamr@2
  1719
template <class _InputIter1, class _InputIter2, class _OutputIter>
williamr@2
  1720
_OutputIter set_difference(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1721
                           _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1722
                           _OutputIter __result) {
williamr@4
  1723
  return _STLP_PRIV __set_difference(__first1, __last1, __first2, __last2, __result,
williamr@4
  1724
                                     _STLP_PRIV __less(_STLP_VALUE_TYPE(__first1, _InputIter1)));
williamr@2
  1725
}
williamr@2
  1726
williamr@4
  1727
template <class _InputIter1, class _InputIter2, class _OutputIter,
williamr@2
  1728
          class _Compare>
williamr@2
  1729
_OutputIter set_difference(_InputIter1 __first1, _InputIter1 __last1,
williamr@4
  1730
                           _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1731
                           _OutputIter __result, _Compare __comp) {
williamr@4
  1732
  return _STLP_PRIV __set_difference(__first1, __last1, __first2, __last2, __result, __comp);
williamr@2
  1733
}
williamr@2
  1734
williamr@4
  1735
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
  1736
williamr@2
  1737
template <class _InputIter1, class _InputIter2, class _OutputIter, class _Compare>
williamr@4
  1738
_OutputIter
williamr@2
  1739
__set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1740
                           _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1741
                           _OutputIter __result, _Compare __comp) {
williamr@2
  1742
  _STLP_DEBUG_CHECK(__check_range(__first1, __last1))
williamr@2
  1743
  _STLP_DEBUG_CHECK(__check_range(__first2, __last2))
williamr@4
  1744
  while (__first1 != __last1 && __first2 != __last2) {
williamr@2
  1745
    if (__comp(*__first1, *__first2)) {
williamr@4
  1746
      _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1747
      *__result = *__first1;
williamr@2
  1748
      ++__first1;
williamr@2
  1749
      ++__result;
williamr@2
  1750
    }
williamr@2
  1751
    else if (__comp(*__first2, *__first1)) {
williamr@2
  1752
      *__result = *__first2;
williamr@2
  1753
      ++__first2;
williamr@2
  1754
      ++__result;
williamr@2
  1755
    }
williamr@2
  1756
    else {
williamr@2
  1757
      ++__first1;
williamr@2
  1758
      ++__first2;
williamr@2
  1759
    }
williamr@4
  1760
  }
williamr@2
  1761
  return copy(__first2, __last2, copy(__first1, __last1, __result));
williamr@2
  1762
}
williamr@2
  1763
williamr@4
  1764
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  1765
williamr@2
  1766
template <class _InputIter1, class _InputIter2, class _OutputIter>
williamr@4
  1767
_OutputIter
williamr@2
  1768
set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1769
                         _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1770
                         _OutputIter __result) {
williamr@4
  1771
  return _STLP_PRIV __set_symmetric_difference(__first1, __last1, __first2, __last2, __result,
williamr@4
  1772
                                               _STLP_PRIV __less(_STLP_VALUE_TYPE(__first1, _InputIter1)));
williamr@2
  1773
}
williamr@2
  1774
williamr@2
  1775
template <class _InputIter1, class _InputIter2, class _OutputIter, class _Compare>
williamr@4
  1776
_OutputIter
williamr@2
  1777
set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1,
williamr@2
  1778
                         _InputIter2 __first2, _InputIter2 __last2,
williamr@2
  1779
                         _OutputIter __result,
williamr@2
  1780
                         _Compare __comp) {
williamr@4
  1781
  return _STLP_PRIV __set_symmetric_difference(__first1, __last1, __first2, __last2, __result, __comp);
williamr@2
  1782
}
williamr@2
  1783
williamr@2
  1784
// min_element and max_element, with and without an explicitly supplied
williamr@2
  1785
// comparison function.
williamr@2
  1786
williamr@4
  1787
template <class _ForwardIter>
williamr@4
  1788
_ForwardIter max_element(_ForwardIter __first, _ForwardIter __last) {
williamr@4
  1789
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@2
  1790
  if (__first == __last) return __first;
williamr@2
  1791
  _ForwardIter __result = __first;
williamr@4
  1792
  while (++__first != __last)
williamr@2
  1793
    if (*__result < *__first)
williamr@2
  1794
      __result = __first;
williamr@2
  1795
  return __result;
williamr@2
  1796
}
williamr@2
  1797
williamr@4
  1798
template <class _ForwardIter, class _Compare>
williamr@4
  1799
_ForwardIter max_element(_ForwardIter __first, _ForwardIter __last,
williamr@4
  1800
                         _Compare __comp) {
williamr@4
  1801
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
  1802
  if (__first == __last) return __first;
williamr@4
  1803
  _ForwardIter __result = __first;
williamr@4
  1804
  while (++__first != __last) {
williamr@4
  1805
    if (__comp(*__result, *__first)) {
williamr@4
  1806
      _STLP_VERBOSE_ASSERT(!__comp(*__first, *__result), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@4
  1807
      __result = __first;
williamr@4
  1808
    }
williamr@4
  1809
  }
williamr@4
  1810
  return __result;
williamr@4
  1811
}
williamr@4
  1812
williamr@2
  1813
template <class _ForwardIter>
williamr@2
  1814
_ForwardIter min_element(_ForwardIter __first, _ForwardIter __last) {
williamr@4
  1815
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@2
  1816
  if (__first == __last) return __first;
williamr@2
  1817
  _ForwardIter __result = __first;
williamr@4
  1818
  while (++__first != __last)
williamr@2
  1819
    if (*__first < *__result)
williamr@2
  1820
      __result = __first;
williamr@2
  1821
  return __result;
williamr@2
  1822
}
williamr@2
  1823
williamr@2
  1824
template <class _ForwardIter, class _Compare>
williamr@2
  1825
_ForwardIter min_element(_ForwardIter __first, _ForwardIter __last,
williamr@4
  1826
                         _Compare __comp) {
williamr@4
  1827
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@2
  1828
  if (__first == __last) return __first;
williamr@2
  1829
  _ForwardIter __result = __first;
williamr@4
  1830
  while (++__first != __last) {
williamr@4
  1831
    if (__comp(*__first, *__result)) {
williamr@4
  1832
      _STLP_VERBOSE_ASSERT(!__comp(*__result, *__first), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@4
  1833
      __result = __first;
williamr@4
  1834
    }
williamr@4
  1835
  }
williamr@2
  1836
  return __result;
williamr@2
  1837
}
williamr@2
  1838
williamr@4
  1839
// next_permutation and prev_permutation, with and without an explicitly
williamr@2
  1840
// supplied comparison function.
williamr@4
  1841
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
  1842
williamr@2
  1843
template <class _BidirectionalIter, class _Compare>
williamr@2
  1844
bool __next_permutation(_BidirectionalIter __first, _BidirectionalIter __last,
williamr@2
  1845
                        _Compare __comp) {
williamr@2
  1846
  _STLP_DEBUG_CHECK(__check_range(__first, __last))
williamr@2
  1847
  if (__first == __last)
williamr@2
  1848
    return false;
williamr@2
  1849
  _BidirectionalIter __i = __first;
williamr@2
  1850
  ++__i;
williamr@2
  1851
  if (__i == __last)
williamr@2
  1852
    return false;
williamr@2
  1853
  __i = __last;
williamr@2
  1854
  --__i;
williamr@2
  1855
williamr@2
  1856
  for(;;) {
williamr@2
  1857
    _BidirectionalIter __ii = __i;
williamr@2
  1858
    --__i;
williamr@2
  1859
    if (__comp(*__i, *__ii)) {
williamr@4
  1860
      _STLP_VERBOSE_ASSERT(!__comp(*__ii, *__i), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1861
      _BidirectionalIter __j = __last;
williamr@4
  1862
      while (!__comp(*__i, *--__j)) {}
williamr@2
  1863
      iter_swap(__i, __j);
williamr@2
  1864
      reverse(__ii, __last);
williamr@2
  1865
      return true;
williamr@2
  1866
    }
williamr@2
  1867
    if (__i == __first) {
williamr@2
  1868
      reverse(__first, __last);
williamr@2
  1869
      return false;
williamr@2
  1870
    }
williamr@2
  1871
  }
williamr@4
  1872
#if defined (_STLP_NEED_UNREACHABLE_RETURN)
williamr@4
  1873
    return false;
williamr@2
  1874
#endif
williamr@2
  1875
}
williamr@2
  1876
williamr@4
  1877
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  1878
williamr@2
  1879
template <class _BidirectionalIter>
williamr@2
  1880
bool next_permutation(_BidirectionalIter __first, _BidirectionalIter __last) {
williamr@4
  1881
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
  1882
  return _STLP_PRIV __next_permutation(__first, __last,
williamr@4
  1883
                                       _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _BidirectionalIter)));
williamr@2
  1884
}
williamr@2
  1885
williamr@2
  1886
template <class _BidirectionalIter, class _Compare>
williamr@2
  1887
bool next_permutation(_BidirectionalIter __first, _BidirectionalIter __last,
williamr@2
  1888
                      _Compare __comp) {
williamr@4
  1889
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
  1890
  return _STLP_PRIV __next_permutation(__first, __last, __comp);
williamr@2
  1891
}
williamr@2
  1892
williamr@4
  1893
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
  1894
williamr@2
  1895
template <class _BidirectionalIter, class _Compare>
williamr@2
  1896
bool __prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last,
williamr@4
  1897
                        _Compare __comp) {
williamr@2
  1898
  if (__first == __last)
williamr@2
  1899
    return false;
williamr@2
  1900
  _BidirectionalIter __i = __first;
williamr@2
  1901
  ++__i;
williamr@2
  1902
  if (__i == __last)
williamr@2
  1903
    return false;
williamr@2
  1904
  __i = __last;
williamr@2
  1905
  --__i;
williamr@2
  1906
williamr@2
  1907
  for(;;) {
williamr@2
  1908
    _BidirectionalIter __ii = __i;
williamr@2
  1909
    --__i;
williamr@2
  1910
    if (__comp(*__ii, *__i)) {
williamr@4
  1911
      _STLP_VERBOSE_ASSERT(!__comp(*__i, *__ii), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1912
      _BidirectionalIter __j = __last;
williamr@4
  1913
      while (!__comp(*--__j, *__i)) {}
williamr@2
  1914
      iter_swap(__i, __j);
williamr@2
  1915
      reverse(__ii, __last);
williamr@2
  1916
      return true;
williamr@2
  1917
    }
williamr@2
  1918
    if (__i == __first) {
williamr@2
  1919
      reverse(__first, __last);
williamr@2
  1920
      return false;
williamr@2
  1921
    }
williamr@2
  1922
  }
williamr@4
  1923
#if defined (_STLP_NEED_UNREACHABLE_RETURN)
williamr@4
  1924
    return false;
williamr@2
  1925
#endif
williamr@2
  1926
}
williamr@2
  1927
williamr@4
  1928
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  1929
williamr@2
  1930
template <class _BidirectionalIter>
williamr@2
  1931
bool prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last) {
williamr@4
  1932
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
  1933
  return _STLP_PRIV __prev_permutation(__first, __last,
williamr@4
  1934
                                       _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _BidirectionalIter)));
williamr@2
  1935
}
williamr@2
  1936
williamr@2
  1937
template <class _BidirectionalIter, class _Compare>
williamr@2
  1938
bool prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last,
williamr@2
  1939
                      _Compare __comp) {
williamr@4
  1940
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
  1941
  return _STLP_PRIV __prev_permutation(__first, __last, __comp);
williamr@2
  1942
}
williamr@2
  1943
williamr@4
  1944
#if !defined (_STLP_NO_EXTENSIONS)
williamr@2
  1945
williamr@2
  1946
// is_heap, a predicate testing whether or not a range is
williamr@2
  1947
// a heap.  This function is an extension, not part of the C++
williamr@2
  1948
// standard.
williamr@4
  1949
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@2
  1950
williamr@2
  1951
template <class _RandomAccessIter, class _Distance, class _StrictWeakOrdering>
williamr@2
  1952
bool __is_heap(_RandomAccessIter __first, _StrictWeakOrdering __comp,
williamr@4
  1953
               _Distance __n) {
williamr@2
  1954
  _Distance __parent = 0;
williamr@2
  1955
  for (_Distance __child = 1; __child < __n; ++__child) {
williamr@4
  1956
    if (__comp(__first[__parent], __first[__child])) {
williamr@4
  1957
      _STLP_VERBOSE_ASSERT(!__comp(__first[__child], __first[__parent]), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1958
      return false;
williamr@4
  1959
    }
williamr@2
  1960
    if ((__child & 1) == 0)
williamr@2
  1961
      ++__parent;
williamr@2
  1962
  }
williamr@2
  1963
  return true;
williamr@2
  1964
}
williamr@2
  1965
williamr@4
  1966
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  1967
williamr@2
  1968
template <class _RandomAccessIter>
williamr@4
  1969
bool is_heap(_RandomAccessIter __first, _RandomAccessIter __last) {
williamr@4
  1970
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
  1971
  return _STLP_PRIV __is_heap(__first, _STLP_PRIV __less(_STLP_VALUE_TYPE(__first, _RandomAccessIter)), __last - __first);
williamr@2
  1972
}
williamr@2
  1973
williamr@2
  1974
template <class _RandomAccessIter, class _StrictWeakOrdering>
williamr@2
  1975
bool is_heap(_RandomAccessIter __first, _RandomAccessIter __last,
williamr@4
  1976
             _StrictWeakOrdering __comp) {
williamr@4
  1977
  _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
williamr@4
  1978
  return _STLP_PRIV __is_heap(__first, __comp, __last - __first);
williamr@2
  1979
}
williamr@2
  1980
williamr@2
  1981
williamr@4
  1982
_STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4
  1983
williamr@2
  1984
template <class _ForwardIter, class _StrictWeakOrdering>
williamr@2
  1985
bool __is_sorted(_ForwardIter __first, _ForwardIter __last,
williamr@4
  1986
                 _StrictWeakOrdering __comp) {
williamr@2
  1987
  _STLP_DEBUG_CHECK(__check_range(__first, __last))
williamr@2
  1988
  if (__first == __last)
williamr@2
  1989
    return true;
williamr@2
  1990
williamr@2
  1991
  _ForwardIter __next = __first;
williamr@2
  1992
  for (++__next; __next != __last; __first = __next, ++__next) {
williamr@4
  1993
    if (__comp(*__next, *__first)) {
williamr@4
  1994
      _STLP_VERBOSE_ASSERT(!__comp(*__first, *__next), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
williamr@2
  1995
      return false;
williamr@4
  1996
    }
williamr@2
  1997
  }
williamr@2
  1998
williamr@2
  1999
  return true;
williamr@2
  2000
}
williamr@2
  2001
williamr@4
  2002
_STLP_MOVE_TO_STD_NAMESPACE
williamr@4
  2003
#endif /* _STLP_NO_EXTENSIONS */
williamr@2
  2004
williamr@2
  2005
_STLP_END_NAMESPACE
williamr@2
  2006
williamr@4
  2007
#undef __stl_threshold
williamr@2
  2008
williamr@2
  2009
#endif /* _STLP_ALGO_C */
williamr@2
  2010
// Local Variables:
williamr@2
  2011
// mode:C++
williamr@2
  2012
// End: