| /dports/misc/thrill/thrill-12c5b59bca66df93b66628b3829027bd0f110dd9/extlib/tlx/tlx/algorithm/ |
| H A D | merge_advance.hpp | 54 if (comp(*begin2, *begin1))
57 *target++ = *begin1++;
61 if (begin1 != end1)
63 target = std::copy(begin1, begin1 + max_size, target);
64 begin1 += max_size;
103 RandomAccessIterator1 next1 = begin1 + 1;
105 ValueType1 element1 = *begin1;
115 begin1 = next1;
124 if (begin1 != end1)
126 target = std::copy(begin1, begin1 + max_size, target);
[all …]
|
| /dports/devel/tlx/tlx-0.5.20200222-5-g8982a9d/tlx/algorithm/ |
| H A D | merge_advance.hpp | 54 if (comp(*begin2, *begin1))
57 *target++ = *begin1++;
61 if (begin1 != end1)
63 target = std::copy(begin1, begin1 + max_size, target);
64 begin1 += max_size;
103 RandomAccessIterator1 next1 = begin1 + 1;
105 ValueType1 element1 = *begin1;
115 begin1 = next1;
124 if (begin1 != end1)
126 target = std::copy(begin1, begin1 + max_size, target);
[all …]
|
| /dports/biology/seqan/seqan-library-2.4.0/include/seqan/align/ |
| H A D | fragment.h | 146 TSize begin1;
179 left.begin1 == right.begin1 &&
194 if (left.begin1 < right.begin1)
196 if (left.begin1 > right.begin1)
224 TSize begin1;
263 left.begin1 == right.begin1 &&
279 if (left.begin1 < right.begin1)
281 if (left.begin1 > right.begin1)
425 pos2 = f.begin2 + (pos - f.begin1);
558 if (lhs.seqId1 == rhs.seqId1 && lhs.begin1 > rhs.begin1)
[all …]
|
| /dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/align/ |
| H A D | fragment.h | 146 TSize begin1;
179 left.begin1 == right.begin1 &&
194 if (left.begin1 < right.begin1)
196 if (left.begin1 > right.begin1)
224 TSize begin1;
263 left.begin1 == right.begin1 &&
279 if (left.begin1 < right.begin1)
281 if (left.begin1 > right.begin1)
425 pos2 = f.begin2 + (pos - f.begin1);
558 if (lhs.seqId1 == rhs.seqId1 && lhs.begin1 > rhs.begin1)
[all …]
|
| /dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/align/ |
| H A D | fragment.h | 146 TSize begin1;
179 left.begin1 == right.begin1 &&
194 if (left.begin1 < right.begin1)
196 if (left.begin1 > right.begin1)
224 TSize begin1;
263 left.begin1 == right.begin1 &&
279 if (left.begin1 < right.begin1)
281 if (left.begin1 > right.begin1)
424 pos2 = f.begin2 + (pos - f.begin1);
560 if (lhs.seqId1 == rhs.seqId1 && lhs.begin1 > rhs.begin1)
[all …]
|
| /dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/ThirdParty/range-v3/include/range/v3/algorithm/ |
| H A D | search.hpp | 57 auto begin1 = uncounted(begin1_); in search_sized_impl() local
73 ++begin1; in search_sized_impl()
77 auto m1 = begin1; in search_sized_impl()
95 ++begin1; in search_sized_impl()
115 return {begin1, begin1}; in search_impl()
118 ++begin1; in search_impl()
121 I1 m1 = begin1; in search_impl()
127 return {begin1, ++m1}; in search_impl()
137 ++begin1; in search_impl()
160 subrange<I1> RANGES_FUNC(search)(I1 begin1, in RANGES_FUNC_BEGIN()
[all …]
|
| H A D | set_algorithm.hpp | 71 if(begin1 == end1 ||
153 ++begin1;
222 ++begin1;
229 ++begin1;
297 while(begin1 != end1)
308 ++begin1;
313 ++begin1;
317 return {begin1, out};
383 while(begin1 != end1)
394 ++begin1;
[all …]
|
| H A D | find_end.hpp | 74 auto e1 = ranges::next(begin1, end1); in find_end_impl()
81 if(begin1 == end1) in find_end_impl()
82 return {(found ? res_begin : begin1), (found ? res_end : begin1)}; in find_end_impl()
85 ++begin1; in find_end_impl()
87 auto tmp1 = begin1; in find_end_impl()
93 res_begin = begin1++; in find_end_impl()
102 ++begin1; in find_end_impl()
126 if(begin1 == l1) in find_end_impl()
138 else if(m1 == begin1) in find_end_impl()
156 auto len1 = end1 - begin1; in find_end_impl()
[all …]
|
| /dports/devel/range-v3/range-v3-0.11.0/include/range/v3/algorithm/ |
| H A D | search.hpp | 57 auto begin1 = uncounted(begin1_); in search_sized_impl() local
73 ++begin1; in search_sized_impl()
77 auto m1 = begin1; in search_sized_impl()
95 ++begin1; in search_sized_impl()
115 return {begin1, begin1}; in search_impl()
118 ++begin1; in search_impl()
121 I1 m1 = begin1; in search_impl()
127 return {begin1, ++m1}; in search_impl()
137 ++begin1; in search_impl()
160 subrange<I1> RANGES_FUNC(search)(I1 begin1, in RANGES_FUNC_BEGIN()
[all …]
|
| H A D | set_algorithm.hpp | 71 if(begin1 == end1 ||
153 ++begin1;
222 ++begin1;
229 ++begin1;
297 while(begin1 != end1)
308 ++begin1;
313 ++begin1;
317 return {begin1, out};
383 while(begin1 != end1)
394 ++begin1;
[all …]
|
| H A D | find_end.hpp | 74 auto e1 = ranges::next(begin1, end1); in find_end_impl()
81 if(begin1 == end1) in find_end_impl()
82 return {(found ? res_begin : begin1), (found ? res_end : begin1)}; in find_end_impl()
85 ++begin1; in find_end_impl()
87 auto tmp1 = begin1; in find_end_impl()
93 res_begin = begin1++; in find_end_impl()
102 ++begin1; in find_end_impl()
126 if(begin1 == l1) in find_end_impl()
138 else if(m1 == begin1) in find_end_impl()
156 auto len1 = end1 - begin1; in find_end_impl()
[all …]
|
| /dports/graphics/vigra/vigra-8acd73a/test/blockwisealgorithms/ |
| H A D | utils.hxx | 48 bool equivalentLabels(Iterator1 begin1, Iterator1 end1, in equivalentLabels() argument
53 if(end1 - begin1 != end2 - begin2) in equivalentLabels()
59 for( ; begin1 != end1; ++begin1, ++begin2) in equivalentLabels()
61 if(left_to_right.size() <= *begin1) in equivalentLabels()
62 left_to_right.resize(*begin1 + 1, -1); // "-1" means unmapped in equivalentLabels()
66 if(left_to_right[*begin1] == -1) // unmapped -> map it 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()
72 right_to_left[*begin2] = *begin1; in equivalentLabels()
73 else if(right_to_left[*begin2] != *begin1) in equivalentLabels()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/ |
| H A D | box_intersection_d.h | 50 RandomAccessIter1 begin1, RandomAccessIter1 end1, in box_intersection_segment_tree_d() argument
92 const diff_size r1s = std::distance(begin1, end1); in box_intersection_segment_tree_d()
215 RandomAccessIter1 begin1, RandomAccessIter1 end1,
233 RandomAccessIter1 begin1, RandomAccessIter1 end1, in box_intersection_d() argument
256 RandomAccessIter1 begin1, RandomAccessIter1 end1, in box_intersection_d() argument
434 ForwardIter1 begin1, ForwardIter1 end1, in box_intersection_all_pairs_d() argument
446 ForwardIter1 begin1, ForwardIter1 end1, in box_intersection_all_pairs_d() argument
467 ForwardIter1 begin1, ForwardIter1 end1, in box_intersection_all_pairs_d() argument
480 ForwardIter1 begin1, ForwardIter1 end1, in box_intersection_all_pairs_d() argument
493 ForwardIter1 begin1, ForwardIter1 end1, in box_intersection_all_pairs_d() argument
[all …]
|
| /dports/biology/seqan1/seqan-1.3.1/seqan/graph_types/ |
| H A D | graph_impl_fragment.h | 129 TSize begin1;
169 TSize begin1;
320 SEQAN_ASSERT_TRUE(pos - f.begin1 < f.len) ;
321 pos2 = f.begin2 + (pos - f.begin1);
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 | 25 Iterator begin1, end1; // [begin1,end1) is 1st 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()
37 Iterator m1 = r.begin1 + (r.end1-r.begin1)/2; in ParallelMergeRange()
39 begin1 = m1; in ParallelMergeRange()
43 out = r.out + (m1-r.begin1) + (m2-r.begin2); in ParallelMergeRange()
50 begin1(begin1_), end1(end1_), 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 | 25 Iterator begin1, end1; // [begin1,end1) is 1st 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()
37 Iterator m1 = r.begin1 + (r.end1-r.begin1)/2; in ParallelMergeRange()
39 begin1 = m1; in ParallelMergeRange()
43 out = r.out + (m1-r.begin1) + (m2-r.begin2); in ParallelMergeRange()
50 begin1(begin1_), end1(end1_), 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 | 25 Iterator begin1, end1; // [begin1,end1) is 1st 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()
37 Iterator m1 = r.begin1 + (r.end1-r.begin1)/2; in ParallelMergeRange()
39 begin1 = m1; in ParallelMergeRange()
43 out = r.out + (m1-r.begin1) + (m2-r.begin2); in ParallelMergeRange()
50 begin1(begin1_), end1(end1_), 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 | 25 Iterator begin1, end1; // [begin1,end1) is 1st 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()
37 Iterator m1 = r.begin1 + (r.end1-r.begin1)/2; in ParallelMergeRange()
39 begin1 = m1; in ParallelMergeRange()
43 out = r.out + (m1-r.begin1) + (m2-r.begin2); in ParallelMergeRange()
50 begin1(begin1_), end1(end1_), 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 | 25 Iterator begin1, end1; // [begin1,end1) is 1st 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()
37 Iterator m1 = r.begin1 + (r.end1-r.begin1)/2; in ParallelMergeRange()
39 begin1 = m1; in ParallelMergeRange()
43 out = r.out + (m1-r.begin1) + (m2-r.begin2); in ParallelMergeRange()
50 begin1(begin1_), end1(end1_), in ParallelMergeRange()
61 std::merge( r.begin1, r.end1, r.begin2, r.end2, r.out ); in operator ()()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/numeric/odeint/examples/2d_lattice/ |
| H A D | vector_vector_resize.hpp | 40 typename state_type::const_iterator begin1 = boost::begin( x1 ); in same_size() local
42 while( begin1 != boost::end( x1 ) ) in same_size()
43 same &= ( boost::size( *begin1++ ) == boost::size( *begin2++ ) ); in same_size()
56 typename state_type::iterator begin1 = boost::begin( x1 ); in resize() local
58 while( begin1 != boost::end( x1 ) ) in resize()
59 (*begin1++).resize( boost::size( *begin2++ ) ); in resize()
78 typename state_type::iterator begin1 = boost::begin( m_v ); in same_size() local
80 while( begin1 != boost::end( m_v ) ) in same_size()
91 typename state_type::iterator begin1 = boost::begin( m_v ); in resize() local
93 while( begin1 != boost::end( m_v ) ) in resize()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/numeric/odeint/examples/2d_lattice/ |
| H A D | vector_vector_resize.hpp | 40 typename state_type::const_iterator begin1 = boost::begin( x1 ); in same_size() local
42 while( begin1 != boost::end( x1 ) ) in same_size()
43 same &= ( boost::size( *begin1++ ) == boost::size( *begin2++ ) ); in same_size()
56 typename state_type::iterator begin1 = boost::begin( x1 ); in resize() local
58 while( begin1 != boost::end( x1 ) ) in resize()
59 (*begin1++).resize( boost::size( *begin2++ ) ); in resize()
78 typename state_type::iterator begin1 = boost::begin( m_v ); in same_size() local
80 while( begin1 != boost::end( m_v ) ) in same_size()
91 typename state_type::iterator begin1 = boost::begin( m_v ); in resize() local
93 while( begin1 != boost::end( m_v ) ) in resize()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/numeric/odeint/examples/2d_lattice/ |
| H A D | vector_vector_resize.hpp | 40 typename state_type::const_iterator begin1 = boost::begin( x1 ); in same_size() local
42 while( begin1 != boost::end( x1 ) ) in same_size()
43 same &= ( boost::size( *begin1++ ) == boost::size( *begin2++ ) ); in same_size()
56 typename state_type::iterator begin1 = boost::begin( x1 ); in resize() local
58 while( begin1 != boost::end( x1 ) ) in resize()
59 (*begin1++).resize( boost::size( *begin2++ ) ); in resize()
78 typename state_type::iterator begin1 = boost::begin( m_v ); in same_size() local
80 while( begin1 != boost::end( m_v ) ) in same_size()
91 typename state_type::iterator begin1 = boost::begin( m_v ); in resize() local
93 while( begin1 != boost::end( m_v ) ) in resize()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/numeric/odeint/examples/2d_lattice/ |
| H A D | vector_vector_resize.hpp | 40 typename state_type::const_iterator begin1 = boost::begin( x1 ); in same_size() local
42 while( begin1 != boost::end( x1 ) ) in same_size()
43 same &= ( boost::size( *begin1++ ) == boost::size( *begin2++ ) ); in same_size()
56 typename state_type::iterator begin1 = boost::begin( x1 ); in resize() local
58 while( begin1 != boost::end( x1 ) ) in resize()
59 (*begin1++).resize( boost::size( *begin2++ ) ); in resize()
78 typename state_type::iterator begin1 = boost::begin( m_v ); in same_size() local
80 while( begin1 != boost::end( m_v ) ) in same_size()
91 typename state_type::iterator begin1 = boost::begin( m_v ); in resize() local
93 while( begin1 != boost::end( m_v ) ) in resize()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/numeric/odeint/examples/2d_lattice/ |
| H A D | vector_vector_resize.hpp | 40 typename state_type::const_iterator begin1 = boost::begin( x1 ); in same_size() local
42 while( begin1 != boost::end( x1 ) ) in same_size()
43 same &= ( boost::size( *begin1++ ) == boost::size( *begin2++ ) ); in same_size()
56 typename state_type::iterator begin1 = boost::begin( x1 ); in resize() local
58 while( begin1 != boost::end( x1 ) ) in resize()
59 (*begin1++).resize( boost::size( *begin2++ ) ); in resize()
78 typename state_type::iterator begin1 = boost::begin( m_v ); in same_size() local
80 while( begin1 != boost::end( m_v ) ) in same_size()
91 typename state_type::iterator begin1 = boost::begin( m_v ); in resize() local
93 while( begin1 != boost::end( m_v ) ) in resize()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/libs/numeric/odeint/examples/2d_lattice/ |
| H A D | vector_vector_resize.hpp | 40 typename state_type::const_iterator begin1 = boost::begin( x1 ); in same_size() local
42 while( begin1 != boost::end( x1 ) ) in same_size()
43 same &= ( boost::size( *begin1++ ) == boost::size( *begin2++ ) ); in same_size()
56 typename state_type::iterator begin1 = boost::begin( x1 ); in resize() local
58 while( begin1 != boost::end( x1 ) ) in resize()
59 (*begin1++).resize( boost::size( *begin2++ ) ); in resize()
78 typename state_type::iterator begin1 = boost::begin( m_v ); in same_size() local
80 while( begin1 != boost::end( m_v ) ) in same_size()
91 typename state_type::iterator begin1 = boost::begin( m_v ); in resize() local
93 while( begin1 != boost::end( m_v ) ) in resize()
[all …]
|