Searched refs:is_heap (Results 1 - 9 of 9) sorted by relevance
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 15 // is_heap(Iter first, Iter last);
23 assert(std::is_heap(i1, i1));
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(i
[all...] |
| H A D | is_heap_comp.pass.cpp | 15 // is_heap(Iter first, Iter last);
24 assert(std::is_heap(i1, i1, std::greater<int>()));
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(i
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| H A D | push_heap.pass.cpp | 33 assert(std::is_heap(ia, ia+i));
|
| H A D | push_heap_comp.pass.cpp | 45 assert(std::is_heap(ia, ia+i, std::greater<int>()));
64 assert(std::is_heap(ia, ia+i, indirect_less()));
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| H A D | make_heap_comp.pass.cpp | 43 assert(std::is_heap(ia, ia+N, std::greater<int>()));
53 assert(std::is_heap(ia, ia+N, pred));
63 assert(std::is_heap(ia, ia+N, pred));
72 assert(std::is_heap(ia, ia+N, pred));
97 assert(std::is_heap(ia, ia+N, indirect_less()));
|
| H A D | make_heap.pass.cpp | 30 assert(std::is_heap(ia, ia+N));
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| H A D | pop_heap.pass.cpp | 33 assert(std::is_heap(ia, ia+i-1));
|
| H A D | pop_heap_comp.pass.cpp | 46 assert(std::is_heap(ia, ia+i-1, std::greater<int>()));
67 assert(std::is_heap(ia, ia+i-1, indirect_less()));
|
| /external/v8/src/compiler/ |
| H A D | wasm-compiler.cc | 1847 Node* is_heap; local
1848 BranchExpectFalse(BuildTestNotSmi(value), &is_heap, &is_smi); local
1854 // is_heap
1855 *control_ = is_heap;
1856 Node* heap_f64 = BuildLoadHeapNumberValue(value, is_heap);
1858 // *control_ needs to point to the current control dependency (is_heap) in
1866 is_heap = *control_;
1869 Node* merge = graph()->NewNode(common->Merge(2), is_heap, is_smi);
|
Completed in 169 milliseconds