/dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/ThirdParty/range-v3/test/algorithm/ |
H A D | push_heap.cpp | 52 auto push_heap = make_testable_1(ranges::push_heap); in test() local 60 push_heap(ia, ia+i).check([&](int *r){CHECK(r == ia + i);}); in test() 68 auto push_heap = make_testable_1(ranges::push_heap); in test_comp() local 76 push_heap(ia, ia+i, std::greater<int>()).check([&](int *r){CHECK(r == ia+i);}); in test_comp() 89 auto push_heap = make_testable_1(ranges::push_heap); in test_proj() local 98 push_heap(ia, ia+i, std::greater<int>(), &S::i).check([&](S *r){CHECK(r == ia+i);}); in test_proj() 115 auto const push_heap = make_testable_1(ranges::push_heap); in test_move_only() local 122 … push_heap(ia, ia+i, indirect_less()).check([&](std::unique_ptr<int> *r){CHECK(r == ia+i);}); in test_move_only() 145 … CHECK(ranges::push_heap(ranges::make_subrange(ia, ia+i), std::greater<int>(), &S::i) == ia+i); in main()
|
/dports/devel/range-v3/range-v3-0.11.0/test/algorithm/ |
H A D | push_heap.cpp | 52 auto push_heap = make_testable_1(ranges::push_heap); in test() local 60 push_heap(ia, ia+i).check([&](int *r){CHECK(r == ia + i);}); in test() 68 auto push_heap = make_testable_1(ranges::push_heap); in test_comp() local 76 push_heap(ia, ia+i, std::greater<int>()).check([&](int *r){CHECK(r == ia+i);}); in test_comp() 89 auto push_heap = make_testable_1(ranges::push_heap); in test_proj() local 98 push_heap(ia, ia+i, std::greater<int>(), &S::i).check([&](S *r){CHECK(r == ia+i);}); in test_proj() 115 auto const push_heap = make_testable_1(ranges::push_heap); in test_move_only() local 122 … push_heap(ia, ia+i, indirect_less()).check([&](std::unique_ptr<int> *r){CHECK(r == ia+i);}); in test_move_only() 145 … CHECK(ranges::push_heap(ranges::make_subrange(ia, ia+i), std::greater<int>(), &S::i) == ia+i); in main()
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
H A D | push_heap.pass.cpp | 30 std::push_heap(Iter(work), Iter(work+i)); in test() 37 std::push_heap(Iter(input), Iter(input + 1)); assert(input[0] == 1); in test() 38 std::push_heap(Iter(input), Iter(input + 2)); assert(input[0] == 3); in test() 39 std::push_heap(Iter(input), Iter(input + 3)); assert(input[0] == 3); in test() 40 std::push_heap(Iter(input), Iter(input + 4)); assert(input[0] == 5); in test() 41 std::push_heap(Iter(input), Iter(input + 5)); assert(input[0] == 5); in test()
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
H A D | push_heap.pass.cpp | 30 std::push_heap(Iter(work), Iter(work+i)); in test() 37 std::push_heap(Iter(input), Iter(input + 1)); assert(input[0] == 1); in test() 38 std::push_heap(Iter(input), Iter(input + 2)); assert(input[0] == 3); in test() 39 std::push_heap(Iter(input), Iter(input + 3)); assert(input[0] == 3); in test() 40 std::push_heap(Iter(input), Iter(input + 4)); assert(input[0] == 5); in test() 41 std::push_heap(Iter(input), Iter(input + 5)); assert(input[0] == 5); in test()
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
H A D | push_heap.pass.cpp | 30 std::push_heap(Iter(work), Iter(work+i)); in test() 37 std::push_heap(Iter(input), Iter(input + 1)); assert(input[0] == 1); in test() 38 std::push_heap(Iter(input), Iter(input + 2)); assert(input[0] == 3); in test() 39 std::push_heap(Iter(input), Iter(input + 3)); assert(input[0] == 3); in test() 40 std::push_heap(Iter(input), Iter(input + 4)); assert(input[0] == 5); in test() 41 std::push_heap(Iter(input), Iter(input + 5)); assert(input[0] == 5); in test()
|
/dports/devel/llvm13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
H A D | push_heap.pass.cpp | 30 std::push_heap(Iter(work), Iter(work+i)); in test() 37 std::push_heap(Iter(input), Iter(input + 1)); assert(input[0] == 1); in test() 38 std::push_heap(Iter(input), Iter(input + 2)); assert(input[0] == 3); in test() 39 std::push_heap(Iter(input), Iter(input + 3)); assert(input[0] == 3); in test() 40 std::push_heap(Iter(input), Iter(input + 4)); assert(input[0] == 5); in test() 41 std::push_heap(Iter(input), Iter(input + 5)); assert(input[0] == 5); in test()
|
/dports/devel/boost-docs/boost_1_72_0/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/devel/boost-python-libs/boost_1_72_0/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/math/pdal/PDAL-2.3.0/vendor/pdalboost/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(pdalboost::begin(rng), pdalboost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(pdalboost::begin(rng), pdalboost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(pdalboost::begin(rng), pdalboost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(pdalboost::begin(rng), pdalboost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/devel/R-cran-BH/BH/inst/include/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/databases/percona57-server/boost_1_59_0/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/databases/xtrabackup/boost_1_59_0/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/databases/percona57-client/boost_1_59_0/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/emulators/citra/citra-ac98458e0/externals/boost/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/devel/boost-libs/boost_1_72_0/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/range/algorithm/ |
H A D | heap_algorithm.hpp | 30 inline RandomAccessRange& push_heap(RandomAccessRange& rng) in push_heap() function 33 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 39 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng) in push_heap() function 42 std::push_heap(boost::begin(rng), boost::end(rng)); in push_heap() 48 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred) in push_heap() function 51 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 57 inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred) in push_heap() function 60 std::push_heap(boost::begin(rng), boost::end(rng), comp_pred); in push_heap() 188 using range::push_heap;
|