| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc10/gcc-10.3.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/devel/avr-gcc/gcc-10.2.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gnat_util/gcc-6-20180516/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
46 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
54 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
62 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
70 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
78 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
86 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
93 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
46 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
54 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
62 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
70 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
78 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
86 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
93 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc9-devel/gcc-9-20211007/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc6-aux/gcc-6-20180516/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
46 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
54 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
62 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
70 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
78 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
86 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
93 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc10-devel/gcc-10-20211008/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc8/gcc-8.5.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc9/gcc-9.4.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc9-aux/gcc-9.1.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
44 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
52 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
60 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
68 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
76 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
84 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
91 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
46 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
54 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
62 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
70 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
78 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
86 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
93 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc48/gcc-4.8.5/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
46 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); in test01()
54 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); in test01()
62 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); in test01()
70 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); in test01()
78 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); in test01()
86 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); in test01()
93 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered); in test01()
|
| /dports/lang/gcc8/gcc-8.5.0/libstdc++-v3/testsuite/25_algorithms/heap/ |
| H A D | moveable2.cc | 41 bool are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
56 std::make_heap(makecon.begin(), makecon.end(), are_ordered); in check_make()
60 VERIFY( std::__is_heap(makecon.begin(), makecon.end(), are_ordered) ); in check_make()
74 std::pop_heap(popcon.begin(), popcon.end(), are_ordered); in check_pop()
78 VERIFY( (std::__is_heap(popheap, popheap + length - 1), are_ordered) ); in check_pop()
92 std::sort_heap(sortcon.begin(), sortcon.end(), are_ordered); in check_sort()
112 std::push_heap(pushcon.begin(), pushcon.end(), are_ordered); in check_push()
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/testsuite/25_algorithms/heap/ |
| H A D | moveable2.cc | 41 bool are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
56 std::make_heap(makecon.begin(), makecon.end(), are_ordered); in check_make()
60 VERIFY( std::__is_heap(makecon.begin(), makecon.end(), are_ordered) ); in check_make()
74 std::pop_heap(popcon.begin(), popcon.end(), are_ordered); in check_pop()
78 VERIFY( (std::__is_heap(popheap, popheap + length - 1), are_ordered) ); in check_pop()
92 std::sort_heap(sortcon.begin(), sortcon.end(), are_ordered); in check_sort()
112 std::push_heap(pushcon.begin(), pushcon.end(), are_ordered); in check_push()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libstdc++-v3/testsuite/25_algorithms/heap/ |
| H A D | moveable2.cc | 41 bool are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
56 std::make_heap(makecon.begin(), makecon.end(), are_ordered); in check_make()
60 VERIFY( std::__is_heap(makecon.begin(), makecon.end(), are_ordered) ); in check_make()
74 std::pop_heap(popcon.begin(), popcon.end(), are_ordered); in check_pop()
78 VERIFY( (std::__is_heap(popheap, popheap + length - 1), are_ordered) ); in check_pop()
92 std::sort_heap(sortcon.begin(), sortcon.end(), are_ordered); in check_sort()
112 std::push_heap(pushcon.begin(), pushcon.end(), are_ordered); in check_push()
|
| /dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/heap/ |
| H A D | moveable2.cc | 41 bool are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) in are_ordered() function
56 std::make_heap(makecon.begin(), makecon.end(), are_ordered); in check_make()
60 VERIFY( std::__is_heap(makecon.begin(), makecon.end(), are_ordered) ); in check_make()
74 std::pop_heap(popcon.begin(), popcon.end(), are_ordered); in check_pop()
78 VERIFY( std::__is_heap(popheap, popheap + length - 1, are_ordered) ); in check_pop()
92 std::sort_heap(sortcon.begin(), sortcon.end(), are_ordered); in check_sort()
112 std::push_heap(pushcon.begin(), pushcon.end(), are_ordered); in check_push()
|