|
3495 | 3495 |
|
3496 | 3496 | \indexlibrary{\idxcode{is_heap}}%
|
3497 | 3497 | \begin{itemdecl}
|
3498 |
| - template<class RandomAccessIterator> |
3499 |
| - bool is_heap(RandomAccessIterator first, RandomAccessIterator last); |
| 3498 | +template<class RandomAccessIterator> |
| 3499 | + bool is_heap(RandomAccessIterator first, RandomAccessIterator last); |
3500 | 3500 | \end{itemdecl}
|
3501 | 3501 |
|
3502 | 3502 |
|
|
3507 | 3507 |
|
3508 | 3508 | \indexlibrary{\idxcode{is_heap}}%
|
3509 | 3509 | \begin{itemdecl}
|
3510 |
| - template<class RandomAccessIterator, class Compare> |
3511 |
| - bool is_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); |
| 3510 | +template<class RandomAccessIterator, class Compare> |
| 3511 | + bool is_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); |
3512 | 3512 | \end{itemdecl}
|
3513 | 3513 |
|
3514 | 3514 |
|
|
3519 | 3519 |
|
3520 | 3520 | \indexlibrary{\idxcode{is_heap_until}}%
|
3521 | 3521 | \begin{itemdecl}
|
3522 |
| - template<class RandomAccessIterator> |
3523 |
| - RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last); |
3524 |
| - template<class RandomAccessIterator, class Compare> |
3525 |
| - RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last, |
3526 |
| - Compare comp); |
| 3522 | +template<class RandomAccessIterator> |
| 3523 | + RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last); |
| 3524 | +template<class RandomAccessIterator, class Compare> |
| 3525 | + RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last, |
| 3526 | + Compare comp); |
3527 | 3527 | \end{itemdecl}
|
3528 | 3528 |
|
3529 | 3529 |
|
|
0 commit comments