/dports/misc/thrill/thrill-12c5b59bca66df93b66628b3829027bd0f110dd9/extlib/tlx/tlx/algorithm/ |
H A D | merge_advance.hpp | 51 while (begin1 != end1 && begin2 != end2 && max_size > 0) 54 if (comp(*begin2, *begin1)) 55 *target++ = *begin2++; 68 target = std::copy(begin2, begin2 + max_size, target); 69 begin2 += max_size; 101 while (begin1 != end1 && begin2 != end2 && max_size > 0) 104 RandomAccessIterator2 next2 = begin2 + 1; 106 ValueType2 element2 = *begin2; 111 begin2 = next2; 131 target = std::copy(begin2, begin2 + max_size, target); [all …]
|
/dports/devel/tlx/tlx-0.5.20200222-5-g8982a9d/tlx/algorithm/ |
H A D | merge_advance.hpp | 51 while (begin1 != end1 && begin2 != end2 && max_size > 0) 54 if (comp(*begin2, *begin1)) 55 *target++ = *begin2++; 68 target = std::copy(begin2, begin2 + max_size, target); 69 begin2 += max_size; 101 while (begin1 != end1 && begin2 != end2 && max_size > 0) 104 RandomAccessIterator2 next2 = begin2 + 1; 106 ValueType2 element2 = *begin2; 111 begin2 = next2; 131 target = std::copy(begin2, begin2 + max_size, target); [all …]
|
/dports/biology/seqan/seqan-library-2.4.0/include/seqan/align/ |
H A D | fragment.h | 148 TSize begin2; 181 left.begin2 == right.begin2 && 202 if (left.begin2 < right.begin2) 204 if (left.begin2 > right.begin2) 226 TSize begin2; 265 left.begin2 == right.begin2 && 287 if (left.begin2 < right.begin2) 289 if (left.begin2 > right.begin2) 425 pos2 = f.begin2 + (pos - f.begin1); 431 pos2 = f.begin1 + (pos - f.begin2); [all …]
|
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/align/ |
H A D | fragment.h | 148 TSize begin2; 181 left.begin2 == right.begin2 && 202 if (left.begin2 < right.begin2) 204 if (left.begin2 > right.begin2) 226 TSize begin2; 265 left.begin2 == right.begin2 && 287 if (left.begin2 < right.begin2) 289 if (left.begin2 > right.begin2) 425 pos2 = f.begin2 + (pos - f.begin1); 431 pos2 = f.begin1 + (pos - f.begin2); [all …]
|
/dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/align/ |
H A D | fragment.h | 148 TSize begin2; 181 left.begin2 == right.begin2 && 202 if (left.begin2 < right.begin2) 204 if (left.begin2 > right.begin2) 226 TSize begin2; 265 left.begin2 == right.begin2 && 287 if (left.begin2 < right.begin2) 289 if (left.begin2 > right.begin2) 424 pos2 = f.begin2 + (pos - f.begin1); 430 pos2 = f.begin1 + (pos - f.begin2); [all …]
|
/dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/ThirdParty/range-v3/include/range/v3/algorithm/ |
H A D | set_algorithm.hpp | 75 ++begin2; 138 if(begin2 == end2) 145 *out = *begin2; 146 ++begin2; 152 ++begin2; 231 ++begin2; 299 if(begin2 == end2) 314 ++begin2; 385 if(begin2 == end2) 400 *out = *begin2; [all …]
|
H A D | swap_ranges.hpp | 44 RANGES_FUNC(swap_ranges)(I1 begin1, S1 end1, I2 begin2) // in RANGES_FUNC_BEGIN() 46 for(; begin1 != end1; ++begin1, ++begin2) in RANGES_FUNC_BEGIN() 47 ranges::iter_swap(begin1, begin2); in RANGES_FUNC_BEGIN() 48 return {begin1, begin2}; in RANGES_FUNC_BEGIN() 59 I2 begin2, in RANGES_FUNC() 62 for(; begin1 != end1 && begin2 != end2; ++begin1, ++begin2) in RANGES_FUNC() 63 ranges::iter_swap(begin1, begin2); in RANGES_FUNC() 64 return {begin1, begin2}; in RANGES_FUNC() 72 RANGES_FUNC(swap_ranges)(Rng1 && rng1, I2_ && begin2) // in RANGES_FUNC() 74 return (*this)(begin(rng1), end(rng1), (I2_ &&) begin2); in RANGES_FUNC()
|
H A D | mismatch.hpp | 61 I2 begin2, in RANGES_FUNC_BEGIN() 66 for(; begin1 != end1; ++begin1, ++begin2) 67 if(!invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2))) 69 return {begin1, begin2}; 86 I2 begin2, in RANGES_FUNC() 92 for(; begin1 != end1 && begin2 != end2; ++begin1, ++begin2) 93 if(!invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2))) 95 return {begin1, begin2}; 113 I2Ref && begin2, in RANGES_FUNC() 122 static_cast<uncvref_t<I2Ref> &&>(begin2),
|
H A D | find_end.hpp | 67 subrange<I1> find_end_impl(I1 begin1, S1 end1, I2 begin2, S2 end2, R pred, P proj, in find_end_impl() argument 72 if(begin2 == end2) in find_end_impl() 83 if(invoke(pred, invoke(proj, *begin1), *begin2)) in find_end_impl() 88 auto tmp2 = begin2; in find_end_impl() 115 if(begin2 == end2) in find_end_impl() 135 if(m2 == begin2) in find_end_impl() 153 auto len2 = end2 - begin2; in find_end_impl() 173 if(m2 == begin2) in find_end_impl() 198 I1 begin1, S1 end1, I2 begin2, S2 end2, R pred = R{}, P proj = P{}) // in RANGES_FUNC_BEGIN() 204 begin2, [all …]
|
H A D | search.hpp | 53 subrange<I1> search_sized_impl(I1 const begin1_, S1 end1, D1 const d1_, I2 begin2, in search_sized_impl() argument 71 if(invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2))) in search_sized_impl() 78 I2 m2 = begin2; in search_sized_impl() 105 subrange<I1> search_impl(I1 begin1, S1 end1, I2 begin2, S2 end2, C & pred, in search_impl() argument 116 if(invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2))) in search_impl() 122 I2 m2 = begin2; in search_impl() 162 I2 begin2, in RANGES_FUNC_BEGIN() 168 if(begin2 == end2) 175 std::move(begin2), 177 distance(begin2, end2), [all …]
|
/dports/devel/range-v3/range-v3-0.11.0/include/range/v3/algorithm/ |
H A D | set_algorithm.hpp | 75 ++begin2; 138 if(begin2 == end2) 145 *out = *begin2; 146 ++begin2; 152 ++begin2; 231 ++begin2; 299 if(begin2 == end2) 314 ++begin2; 385 if(begin2 == end2) 400 *out = *begin2; [all …]
|
H A D | swap_ranges.hpp | 44 RANGES_FUNC(swap_ranges)(I1 begin1, S1 end1, I2 begin2) // in RANGES_FUNC_BEGIN() 46 for(; begin1 != end1; ++begin1, ++begin2) in RANGES_FUNC_BEGIN() 47 ranges::iter_swap(begin1, begin2); in RANGES_FUNC_BEGIN() 48 return {begin1, begin2}; in RANGES_FUNC_BEGIN() 59 I2 begin2, in RANGES_FUNC() 62 for(; begin1 != end1 && begin2 != end2; ++begin1, ++begin2) in RANGES_FUNC() 63 ranges::iter_swap(begin1, begin2); in RANGES_FUNC() 64 return {begin1, begin2}; in RANGES_FUNC() 72 RANGES_FUNC(swap_ranges)(Rng1 && rng1, I2_ && begin2) // in RANGES_FUNC() 74 return (*this)(begin(rng1), end(rng1), (I2_ &&) begin2); in RANGES_FUNC()
|
H A D | mismatch.hpp | 61 I2 begin2, in RANGES_FUNC_BEGIN() 66 for(; begin1 != end1; ++begin1, ++begin2) 67 if(!invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2))) 69 return {begin1, begin2}; 86 I2 begin2, in RANGES_FUNC() 92 for(; begin1 != end1 && begin2 != end2; ++begin1, ++begin2) 93 if(!invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2))) 95 return {begin1, begin2}; 113 I2Ref && begin2, in RANGES_FUNC() 122 static_cast<uncvref_t<I2Ref> &&>(begin2),
|
H A D | find_end.hpp | 67 subrange<I1> find_end_impl(I1 begin1, S1 end1, I2 begin2, S2 end2, R pred, P proj, in find_end_impl() argument 72 if(begin2 == end2) in find_end_impl() 83 if(invoke(pred, invoke(proj, *begin1), *begin2)) in find_end_impl() 88 auto tmp2 = begin2; in find_end_impl() 115 if(begin2 == end2) in find_end_impl() 135 if(m2 == begin2) in find_end_impl() 153 auto len2 = end2 - begin2; in find_end_impl() 173 if(m2 == begin2) in find_end_impl() 198 I1 begin1, S1 end1, I2 begin2, S2 end2, R pred = R{}, P proj = P{}) // in RANGES_FUNC_BEGIN() 204 begin2, [all …]
|
H A D | search.hpp | 53 subrange<I1> search_sized_impl(I1 const begin1_, S1 end1, D1 const d1_, I2 begin2, in search_sized_impl() argument 71 if(invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2))) in search_sized_impl() 78 I2 m2 = begin2; in search_sized_impl() 105 subrange<I1> search_impl(I1 begin1, S1 end1, I2 begin2, S2 end2, C & pred, in search_impl() argument 116 if(invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2))) in search_impl() 122 I2 m2 = begin2; in search_impl() 162 I2 begin2, in RANGES_FUNC_BEGIN() 168 if(begin2 == end2) 175 std::move(begin2), 177 distance(begin2, end2), [all …]
|
/dports/graphics/vigra/vigra-8acd73a/test/blockwisealgorithms/ |
H A D | utils.hxx | 49 Iterator2 begin2, Iterator2 end2) in equivalentLabels() argument 53 if(end1 - begin1 != end2 - begin2) in equivalentLabels() 59 for( ; begin1 != end1; ++begin1, ++begin2) in equivalentLabels() 63 if(right_to_left.size() <= *begin2) in equivalentLabels() 64 right_to_left.resize(*begin2 + 1, -1); in equivalentLabels() 67 left_to_right[*begin1] = *begin2; in equivalentLabels() 68 …else if(left_to_right[*begin1] != *begin2) // already mapped to different value -> not equivalent … in equivalentLabels() 71 if(right_to_left[*begin2] == -1) in equivalentLabels() 72 right_to_left[*begin2] = *begin1; in equivalentLabels() 73 else if(right_to_left[*begin2] != *begin1) in equivalentLabels()
|
/dports/biology/seqan1/seqan-1.3.1/seqan/graph_types/ |
H A D | graph_impl_fragment.h | 131 TSize begin2; 171 TSize begin2; 321 pos2 = f.begin2 + (pos - f.begin1); 326 SEQAN_ASSERT_TRUE(pos - f.begin2 < f.len); 327 pos2 = f.begin1 + (pos - f.begin2); 353 pos2 = f.begin2 + (pos - f.begin1); 359 pos2 = f.begin1 + (pos - f.begin2); 384 else pos2 = f.begin2 + (pos - f.begin1); 391 else pos2 = f.begin1 + (pos - f.begin2); 418 else pos2 = f.begin2 + (pos - f.begin1); [all …]
|
/dports/devel/boost-docs/boost_1_72_0/libs/compute/perf/ |
H A D | perf_tbb_merge.cpp | 26 Iterator begin2, end2; // [begin2,end2) is 2nd sequence to be merged member 28 bool empty() const {return (end1-begin1)+(end2-begin2)==0;} in empty() 30 return (std::min)( end1-begin1, end2-begin2 ) > grainsize; in is_divisible() 33 if( r.end1-r.begin1 < r.end2-r.begin2 ) { in ParallelMergeRange() 34 std::swap(r.begin1,r.begin2); in ParallelMergeRange() 38 Iterator m2 = std::lower_bound( r.begin2, r.end2, *m1 ); in ParallelMergeRange() 40 begin2 = m2; in ParallelMergeRange() 43 out = r.out + (m1-r.begin1) + (m2-r.begin2); in ParallelMergeRange() 51 begin2(begin2_), end2(end2_), out(out_) in ParallelMergeRange() 61 std::merge( r.begin1, r.end1, r.begin2, r.end2, r.out ); in operator ()() [all …]
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/compute/perf/ |
H A D | perf_tbb_merge.cpp | 26 Iterator begin2, end2; // [begin2,end2) is 2nd sequence to be merged member 28 bool empty() const {return (end1-begin1)+(end2-begin2)==0;} in empty() 30 return (std::min)( end1-begin1, end2-begin2 ) > grainsize; in is_divisible() 33 if( r.end1-r.begin1 < r.end2-r.begin2 ) { in ParallelMergeRange() 34 std::swap(r.begin1,r.begin2); in ParallelMergeRange() 38 Iterator m2 = std::lower_bound( r.begin2, r.end2, *m1 ); in ParallelMergeRange() 40 begin2 = m2; in ParallelMergeRange() 43 out = r.out + (m1-r.begin1) + (m2-r.begin2); in ParallelMergeRange() 51 begin2(begin2_), end2(end2_), out(out_) in ParallelMergeRange() 61 std::merge( r.begin1, r.end1, r.begin2, r.end2, r.out ); in operator ()() [all …]
|
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/libs/compute/perf/ |
H A D | perf_tbb_merge.cpp | 26 Iterator begin2, end2; // [begin2,end2) is 2nd sequence to be merged member 28 bool empty() const {return (end1-begin1)+(end2-begin2)==0;} in empty() 30 return (std::min)( end1-begin1, end2-begin2 ) > grainsize; in is_divisible() 33 if( r.end1-r.begin1 < r.end2-r.begin2 ) { in ParallelMergeRange() 34 std::swap(r.begin1,r.begin2); in ParallelMergeRange() 38 Iterator m2 = std::lower_bound( r.begin2, r.end2, *m1 ); in ParallelMergeRange() 40 begin2 = m2; in ParallelMergeRange() 43 out = r.out + (m1-r.begin1) + (m2-r.begin2); in ParallelMergeRange() 51 begin2(begin2_), end2(end2_), out(out_) in ParallelMergeRange() 61 std::merge( r.begin1, r.end1, r.begin2, r.end2, r.out ); in operator ()() [all …]
|
/dports/devel/boost-libs/boost_1_72_0/libs/compute/perf/ |
H A D | perf_tbb_merge.cpp | 26 Iterator begin2, end2; // [begin2,end2) is 2nd sequence to be merged member 28 bool empty() const {return (end1-begin1)+(end2-begin2)==0;} in empty() 30 return (std::min)( end1-begin1, end2-begin2 ) > grainsize; in is_divisible() 33 if( r.end1-r.begin1 < r.end2-r.begin2 ) { in ParallelMergeRange() 34 std::swap(r.begin1,r.begin2); in ParallelMergeRange() 38 Iterator m2 = std::lower_bound( r.begin2, r.end2, *m1 ); in ParallelMergeRange() 40 begin2 = m2; in ParallelMergeRange() 43 out = r.out + (m1-r.begin1) + (m2-r.begin2); in ParallelMergeRange() 51 begin2(begin2_), end2(end2_), out(out_) in ParallelMergeRange() 61 std::merge( r.begin1, r.end1, r.begin2, r.end2, r.out ); in operator ()() [all …]
|
/dports/devel/hyperscan/boost_1_75_0/libs/compute/perf/ |
H A D | perf_tbb_merge.cpp | 26 Iterator begin2, end2; // [begin2,end2) is 2nd sequence to be merged member 28 bool empty() const {return (end1-begin1)+(end2-begin2)==0;} in empty() 30 return (std::min)( end1-begin1, end2-begin2 ) > grainsize; in is_divisible() 33 if( r.end1-r.begin1 < r.end2-r.begin2 ) { in ParallelMergeRange() 34 std::swap(r.begin1,r.begin2); in ParallelMergeRange() 38 Iterator m2 = std::lower_bound( r.begin2, r.end2, *m1 ); in ParallelMergeRange() 40 begin2 = m2; in ParallelMergeRange() 43 out = r.out + (m1-r.begin1) + (m2-r.begin2); in ParallelMergeRange() 51 begin2(begin2_), end2(end2_), out(out_) in ParallelMergeRange() 61 std::merge( r.begin1, r.end1, r.begin2, r.end2, r.out ); in operator ()() [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | box_intersection_d.h | 51 RandomAccessIter2 begin2, RandomAccessIter2 end2, in box_intersection_segment_tree_d() argument 93 const diff_size r2s = std::distance(begin2, end2); in box_intersection_segment_tree_d() 216 RandomAccessIter2 begin2, RandomAccessIter2 end2, 234 RandomAccessIter2 begin2, RandomAccessIter2 end2, in box_intersection_d() argument 257 RandomAccessIter2 begin2, RandomAccessIter2 end2, in box_intersection_d() argument 435 ForwardIter2 begin2, ForwardIter2 end2, in box_intersection_all_pairs_d() argument 447 ForwardIter2 begin2, ForwardIter2 end2, in box_intersection_all_pairs_d() argument 468 ForwardIter2 begin2, ForwardIter2 end2, in box_intersection_all_pairs_d() argument 481 ForwardIter2 begin2, ForwardIter2 end2, in box_intersection_all_pairs_d() argument 494 ForwardIter2 begin2, ForwardIter2 end2, in box_intersection_all_pairs_d() argument [all …]
|
/dports/devel/py-numba/numba-0.51.2/numba/tests/ |
H A D | test_sys_stdin_assignment.py | 13 def f1(begin1, end1, begin2, end2): argument 14 if begin1 > begin2: return f1(begin2, end2, begin1, end1) 15 return end1 + 1 >= begin2 24 def f1_2(begin1, end1, begin2, end2): argument 25 if begin1 > begin2: return f1_2(begin2, end2, begin1, end1) 26 return end1 + 1 >= begin2
|
/dports/devel/boost-docs/boost_1_72_0/libs/numeric/odeint/examples/2d_lattice/ |
H A D | vector_vector_resize.hpp | 41 typename state_type::const_iterator begin2 = boost::begin( x2 ); in same_size() local 43 same &= ( boost::size( *begin1++ ) == boost::size( *begin2++ ) ); in same_size() 57 typename state_type::const_iterator begin2 = boost::begin( x2 ); in resize() local 59 (*begin1++).resize( boost::size( *begin2++ ) ); in resize() 79 typename State::const_iterator begin2 = boost::begin( x ); in same_size() local 81 same &= ( boost::size( *begin1++ ) == boost::size( *begin2++ ) ); in same_size() 92 typename State::const_iterator begin2 = boost::begin( x ); in resize() local 94 (*begin1++).resize( boost::size( *begin2++ ) ); in resize()
|