| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_until.pass.cpp | 15 // is_heap_until(Iter first, Iter last);
23 assert(std::is_heap_until(i1, i1) == i1);
24 assert(std::is_heap_until(i1, i1+1) == i1+1);
27 assert(std::is_heap_until(i1, i1+2) == i1+2);
28 assert(std::is_heap_until(i2, i2+2) == i2+1);
29 assert(std::is_heap_until(i3, i3+2) == i3+2);
37 assert(std::is_heap_until(i4, i4+3) == i4+3);
38 assert(std::is_heap_until(i5, i5+3) == i5+2);
39 assert(std::is_heap_until(i6, i6+3) == i6+1);
40 assert(std::is_heap_until(i7, i7+3) == i7+1)
[all...] |
| is_heap_until_comp.pass.cpp | 15 // is_heap_until(Iter first, Iter last, Compare comp);
24 assert(std::is_heap_until(i1, i1, std::greater<int>()) == i1);
25 assert(std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1);
28 assert(std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2);
29 assert(std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2);
30 assert(std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+1);
38 assert(std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3);
39 assert(std::is_heap_until(i5, i5+3, std::greater<int>()) == i5+3);
40 assert(std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3);
41 assert(std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3)
[all...] |
| is_heap.pass.cpp | 24 assert(std::is_heap(i1, i1+1) == (std::is_heap_until(i1, i1+1) == i1+1));
27 assert(std::is_heap(i1, i1+2) == (std::is_heap_until(i1, i1+2) == i1+2));
28 assert(std::is_heap(i2, i2+2) == (std::is_heap_until(i2, i2+2) == i2+2));
29 assert(std::is_heap(i3, i3+2) == (std::is_heap_until(i3, i3+2) == i3+2));
37 assert(std::is_heap(i4, i4+3) == (std::is_heap_until(i4, i4+3) == i4+3));
38 assert(std::is_heap(i5, i5+3) == (std::is_heap_until(i5, i5+3) == i5+3));
39 assert(std::is_heap(i6, i6+3) == (std::is_heap_until(i6, i6+3) == i6+3));
40 assert(std::is_heap(i7, i7+3) == (std::is_heap_until(i7, i7+3) == i7+3));
41 assert(std::is_heap(i8, i8+3) == (std::is_heap_until(i8, i8+3) == i8+3));
42 assert(std::is_heap(i9, i9+3) == (std::is_heap_until(i9, i9+3) == i9+3))
[all...] |
| is_heap_comp.pass.cpp | 25 assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1));
28 assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2));
29 assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2));
30 assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+2));
38 assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3));
39 assert(std::is_heap(i5, i5+3, std::greater<int>()) == (std::is_heap_until(i5, i5+3, std::greater<int>()) == i5+3));
40 assert(std::is_heap(i6, i6+3, std::greater<int>()) == (std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3));
41 assert(std::is_heap(i7, i7+3, std::greater<int>()) == (std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3));
42 assert(std::is_heap(i8, i8+3, std::greater<int>()) == (std::is_heap_until(i8, i8+3, std::greater<int>()) == i8+3));
43 assert(std::is_heap(i9, i9+3, std::greater<int>()) == (std::is_heap_until(i9, i9+3, std::greater<int>()) == i9+3))
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_heap.h | 126 // + is_heap and is_heap_until in C++0x.
510 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) function
536 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, function
559 { return std::is_heap_until(__first, __last) == __last; }
573 { return std::is_heap_until(__first, __last, __comp) == __last; }
|
| algorithmfwd.h | 68 is_heap_until (C++0x)
300 is_heap_until(_RAIter, _RAIter);
304 is_heap_until(_RAIter, _RAIter, _Compare);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_heap.h | 128 // + is_heap and is_heap_until in C++0x.
512 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) function
538 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, function
561 { return std::is_heap_until(__first, __last) == __last; }
575 { return std::is_heap_until(__first, __last, __comp) == __last; }
|
| algorithmfwd.h | 70 is_heap_until (C++0x)
296 is_heap_until(_RAIter, _RAIter);
300 is_heap_until(_RAIter, _RAIter, _Compare);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_heap.h | 128 // + is_heap and is_heap_until in C++0x.
512 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) function
538 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, function
561 { return std::is_heap_until(__first, __last) == __last; }
575 { return std::is_heap_until(__first, __last, __comp) == __last; }
|
| algorithmfwd.h | 70 is_heap_until (C++0x)
296 is_heap_until(_RAIter, _RAIter);
300 is_heap_until(_RAIter, _RAIter, _Compare);
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_heap.h | 126 // + is_heap and is_heap_until in C++0x.
510 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) function
536 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, function
559 { return std::is_heap_until(__first, __last) == __last; }
573 { return std::is_heap_until(__first, __last, __comp) == __last; }
|
| algorithmfwd.h | 68 is_heap_until (C++0x)
300 is_heap_until(_RAIter, _RAIter);
304 is_heap_until(_RAIter, _RAIter, _Compare);
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_heap.h | 126 // + is_heap and is_heap_until in C++0x.
510 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) function
536 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, function
559 { return std::is_heap_until(__first, __last) == __last; }
573 { return std::is_heap_until(__first, __last, __comp) == __last; }
|
| algorithmfwd.h | 68 is_heap_until (C++0x)
300 is_heap_until(_RAIter, _RAIter);
304 is_heap_until(_RAIter, _RAIter, _Compare);
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_heap.h | 126 // + is_heap and is_heap_until in C++0x.
510 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) function
536 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, function
559 { return std::is_heap_until(__first, __last) == __last; }
573 { return std::is_heap_until(__first, __last, __comp) == __last; }
|
| algorithmfwd.h | 68 is_heap_until (C++0x)
300 is_heap_until(_RAIter, _RAIter);
304 is_heap_until(_RAIter, _RAIter, _Compare);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| stl_heap.h | 126 // + is_heap and is_heap_until in C++0x.
510 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) function
536 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, function
559 { return std::is_heap_until(__first, __last) == __last; }
573 { return std::is_heap_until(__first, __last, __comp) == __last; }
|
| algorithmfwd.h | 68 is_heap_until (C++0x)
300 is_heap_until(_RAIter, _RAIter);
304 is_heap_until(_RAIter, _RAIter, _Compare);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_heap.h | 128 // + is_heap and is_heap_until in C++0x.
512 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) function
538 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, function
561 { return std::is_heap_until(__first, __last) == __last; }
575 { return std::is_heap_until(__first, __last, __comp) == __last; }
|
| algorithmfwd.h | 70 is_heap_until (C++0x)
296 is_heap_until(_RAIter, _RAIter);
300 is_heap_until(_RAIter, _RAIter, _Compare);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_heap.h | 128 // + is_heap and is_heap_until in C++0x.
518 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) function
544 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, function
567 { return std::is_heap_until(__first, __last) == __last; }
581 { return std::is_heap_until(__first, __last, __comp) == __last; }
|
| algorithmfwd.h | 72 is_heap_until (C++0x)
298 is_heap_until(_RAIter, _RAIter);
302 is_heap_until(_RAIter, _RAIter, _Compare);
|
