/dports/math/librsb/librsb-1.2.0.10/ |
H A D | rsb_mergesort.c | 361 #define RIGHT_ADVANCE right_index=(right_index+1); right_length--; in rsb_do_merge_double_CSR() 537 #define RIGHT_ADVANCE right_index=(right_index+1); right_length--; in rsb_do_merge_float_CSR() 713 #define RIGHT_ADVANCE right_index=(right_index+1); right_length--; in rsb_do_merge_float_complex_CSR() 889 #define RIGHT_ADVANCE right_index=(right_index+1); right_length--; in rsb_do_merge_double_complex_CSR() 1066 #define RIGHT_ADVANCE right_index=(right_index+1); right_length--; in rsb_do_merge_double_BCSR() 1243 #define RIGHT_ADVANCE right_index=(right_index+1); right_length--; in rsb_do_merge_float_BCSR() 1420 #define RIGHT_ADVANCE right_index=(right_index+1); right_length--; in rsb_do_merge_float_complex_BCSR() 1597 #define RIGHT_ADVANCE right_index=(right_index+1); right_length--; in rsb_do_merge_double_complex_BCSR() 1807 #define RIGHT_ADVANCE right_index=(right_index+1); right_length--; in rsb_do_merge_double_VBR() 2023 #define RIGHT_ADVANCE right_index=(right_index+1); right_length--; in rsb_do_merge_float_VBR() [all …]
|
H A D | mergesort_macros.m4 | 244 dnl #define RIGHT_ADVANCE right_index=(right_index+1)%right_mod; right_length--; 248 #define RIGHT_ADVANCE right_index=(right_index+1); right_length--; 281 iresult[result_index]=iright[right_index];\ 282 jresult[result_index]=jright[right_index];\ 284 biresult[result_index]=biright[right_index]; \ 289 result[result_index]= right[right_index];\ 296 bileft[left_index] < biright[right_index] || 298 bjleft[left_index] <= bjright[right_index] ) 302 ileft[left_index] < iright[right_index] || 303 ( ileft[left_index] == iright[right_index] && [all …]
|
/dports/math/py-pynndescent/pynndescent-0.5.4/pynndescent/ |
H A D | threaded_rp_trees.py | 50 right_index = tau_rand_int(rng_state) % indices.shape[0] 51 right_index += left_index == right_index 52 right_index = right_index % indices.shape[0] 54 right = indices[right_index] 73 right_index = tau_rand_int(rng_state) % indices.shape[0] 74 right_index += left_index == right_index 75 right_index = right_index % indices.shape[0] 77 right = indices[right_index]
|
H A D | rp_trees.py | 84 right_index += left_index == right_index 85 right_index = right_index % indices.shape[0] 87 right = indices[right_index] 205 right_index += left_index == right_index 206 right_index = right_index % indices.shape[0] 208 right = indices[right_index] 307 right_index += left_index == right_index 308 right_index = right_index % indices.shape[0] 310 right = indices[right_index] 423 right_index += left_index == right_index [all …]
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/utilities/ |
H A D | quickSort.hpp | 72 size_t right_index = length - 1; in partition() local 75 for ( ; true; ++left_index, --right_index) { in partition() 79 for ( ; comparator(array[right_index], pivot_val) > 0; --right_index) { in partition() 80 assert(right_index > 0, "reached start of partition"); in partition() 83 if (left_index < right_index) { in partition() 84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) { in partition() 85 swap(array, left_index, right_index); in partition() 88 return right_index; in partition()
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/utilities/ |
H A D | quickSort.hpp | 72 size_t right_index = length - 1; in partition() local 75 for ( ; true; ++left_index, --right_index) { in partition() 79 for ( ; comparator(array[right_index], pivot_val) > 0; --right_index) { in partition() 80 assert(right_index > 0, "reached start of partition"); in partition() 83 if (left_index < right_index) { in partition() 84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) { in partition() 85 swap(array, left_index, right_index); in partition() 88 return right_index; in partition()
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/utilities/ |
H A D | quickSort.hpp | 72 size_t right_index = length - 1; in partition() local 75 for ( ; true; ++left_index, --right_index) { in partition() 79 for ( ; comparator(array[right_index], pivot_val) > 0; --right_index) { in partition() 80 assert(right_index > 0, "reached start of partition"); in partition() 83 if (left_index < right_index) { in partition() 84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) { in partition() 85 swap(array, left_index, right_index); in partition() 88 return right_index; in partition()
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/utilities/ |
H A D | quickSort.hpp | 72 size_t right_index = length - 1; in partition() local 75 for ( ; true; ++left_index, --right_index) { in partition() 79 for ( ; comparator(array[right_index], pivot_val) > 0; --right_index) { in partition() 80 assert(right_index > 0, "reached start of partition"); in partition() 83 if (left_index < right_index) { in partition() 84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) { in partition() 85 swap(array, left_index, right_index); in partition() 88 return right_index; in partition()
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/utilities/ |
H A D | quickSort.hpp | 72 size_t right_index = length - 1; in partition() local 75 for ( ; true; ++left_index, --right_index) { in partition() 79 for ( ; comparator(array[right_index], pivot_val) > 0; --right_index) { in partition() 80 assert(right_index > 0, "reached start of partition"); in partition() 83 if (left_index < right_index) { in partition() 84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) { in partition() 85 swap(array, left_index, right_index); in partition() 88 return right_index; in partition()
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/utilities/ |
H A D | quickSort.hpp | 72 size_t right_index = length - 1; in partition() local 75 for ( ; true; ++left_index, --right_index) { in partition() 79 for ( ; comparator(array[right_index], pivot_val) > 0; --right_index) { in partition() 80 assert(right_index > 0, "reached start of partition"); in partition() 83 if (left_index < right_index) { in partition() 84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) { in partition() 85 swap(array, left_index, right_index); in partition() 88 return right_index; in partition()
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/utilities/ |
H A D | quickSort.hpp | 72 size_t right_index = length - 1; in partition() local 75 for ( ; true; ++left_index, --right_index) { in partition() 79 for ( ; comparator(array[right_index], pivot_val) > 0; --right_index) { in partition() 80 assert(right_index > 0, "reached start of partition"); in partition() 83 if (left_index < right_index) { in partition() 84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) { in partition() 85 swap(array, left_index, right_index); in partition() 88 return right_index; in partition()
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/utilities/ |
H A D | quickSort.hpp | 72 size_t right_index = length - 1; in partition() local 75 for ( ; true; ++left_index, --right_index) { in partition() 79 for ( ; comparator(array[right_index], pivot_val) > 0; --right_index) { in partition() 80 assert(right_index > 0, "reached start of partition"); in partition() 83 if (left_index < right_index) { in partition() 84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) { in partition() 85 swap(array, left_index, right_index); in partition() 88 return right_index; in partition()
|
/dports/math/py-numpy/numpy-1.20.3/numpy/lib/ |
H A D | arraypad.py | 179 right_index = padded.shape[axis] - width_pair[1] 180 right_slice = _slice_at_axis(slice(right_index - 1, right_index), axis) 258 right_index = padded.shape[axis] - width_pair[1] 260 max_length = right_index - left_index 288 slice(right_index - right_length, right_index), axis) 857 while left_index > 0 or right_index > 0: 861 left_index, right_index = _set_reflect_both( 862 roi, axis, (left_index, right_index), 869 while left_index > 0 or right_index > 0: 873 left_index, right_index = _set_wrap_both( [all …]
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/utilities/ |
H A D | quickSort.hpp | 72 int right_index = length; in partition() local 80 right_index--; in partition() 81 } while (comparator(array[right_index], pivot_val) == 1); in partition() 83 if (left_index < right_index) { in partition() 84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) { in partition() 85 swap(array, left_index, right_index); in partition() 88 return right_index; in partition()
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/utilities/ |
H A D | quickSort.hpp | 72 int right_index = length; in partition() local 80 right_index--; in partition() 81 } while (comparator(array[right_index], pivot_val) == 1); in partition() 83 if (left_index < right_index) { in partition() 84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) { in partition() 85 swap(array, left_index, right_index); in partition() 88 return right_index; in partition()
|
/dports/cad/ghdl/ghdl-1.0.0/libraries/ieee2008/ |
H A D | fixed_generic_pkg-body.vhdl | 348 right_index => right_index); 374 right_index => right_index); 2464 constant fw : INTEGER := mins (right_index, right_index); -- catch literals 2494 right_index => right_index, 2511 constant fw : INTEGER := mins (right_index, right_index); -- catch literals 2553 right_index => right_index, 2629 constant fw : INTEGER := mins (right_index, right_index); -- catch literals 2696 right_index => right_index, 2733 right_index => right_index, 6285 right_index := r; [all …]
|
/dports/devel/color/color-a04952cf27cc315e31811f2e940221bf8cf9f8ca/src/color/_internal/ |
H A D | reformat.hpp | 45 ,right_index_const_input_type right_index in process() 53 ,right_index in process() 68 ,right_index_const_input_type right_index in process() 76 ,right_index in process() 126 ,index_const_input_type right_index in process() 141 ,index_const_input_type right_index in process()
|
/dports/misc/urh/urh-2.9.2/src/urh/util/ |
H A D | RingBuffer.py | 34 def right_index(self): member in RingBuffer 37 @right_index.setter 38 def right_index(self, value): member in RingBuffer 68 self.right_index = 0 81 slide_1 = np.s_[self.right_index:min(self.right_index + n, self.size)] 82 slide_2 = np.s_[:max(self.right_index + n - self.size, 0)] 87 self.right_index += n
|
/dports/biology/tRNAscan-SE/tRNAscan-SE-2.0/lib/tRNAscanSE/ |
H A D | SS.pm | 117 my $right_index = -1; 178 $right_index = $stems[$ct]->{start_right}; 179 while ($left_index >= $stems[$ct]->{start_left} && $right_index <= $stems[$ct]->{end_right}) 183 if (substr($ss, $right_index, 1) eq ".") 186 $right_index++; 190 elsif (substr($ss, $right_index, 1) eq ".") 192 $right_index++; 197 $right_index++;
|
/dports/devel/py-dask/dask-2021.11.2/dask/dataframe/ |
H A D | multi.py | 357 right_index=right_index, 487 right_index=False, argument 520 right_index=right_index, 560 right_index=right_index, 578 right_index=right_index, 588 or right_index 601 right_index=right_index, 627 right_index=right_index, 877 right_index=False, argument 926 if right_index: [all …]
|
/dports/lang/mosml/mosml-ver-2.10.1/src/mosmllib/ |
H A D | PP.sml | 190 left_index = ref 0, right_index = ref 0, 320 left_index := 0; right_index := 0; 329 case (the_token_buffer sub (!right_index)) 331 | _ => ++right_index 336 | _ => ++right_index 340 (!left_index = !right_index) andalso 418 right_index := 0; 442 case (the_token_buffer sub (!right_index)) 492 else ++right_index; 493 update(the_token_buffer, !right_index, [all …]
|
/dports/databases/percona-toolkit/percona-toolkit-3.3.0/lib/ |
H A D | DuplicateKeyFinder.pm | 302 next RIGHT_KEY unless defined $right_keys->[$right_index]; 307 my $right_name = $right_keys->[$right_index]->{name}; 308 my $right_cols = $right_keys->[$right_index]->{colnames}; 309 my $right_len_cols = $right_keys->[$right_index]->{len_cols}; 330 if ( exists $right_keys->[$right_index]->{unique_col} ) { 333 $right_keys->[$right_index]->{cols}->[0]); 339 if ( my $type = $right_keys->[$right_index]->{unconstrained} ) { 341 . $right_keys->[$right_index]->{constraining_key}->{name} 351 cols => $right_keys->[$right_index]->{real_cols}, 352 ddl => $right_keys->[$right_index]->{ddl}, [all …]
|
/dports/audio/faust/faust-2.37.3/tools/faust2fpga/vhdl/ |
H A D | fixed_pkg_c.vhd | 2309 right_index => right_index); 2334 right_index => right_index); 4391 right_index => right_index, 4449 right_index => right_index, 4524 constant fw : INTEGER := mins (right_index, right_index); -- catch literals 4590 right_index => right_index, 4625 right_index => right_index, 8220 right_index := r; 8223 right_index := 0; 8302 right_index => right_index); [all …]
|
/dports/sysutils/vector/vector-0.10.0/cargo-crates/sized-chunks-0.1.3/src/tests/ |
H A D | sparse_chunk.rs | 46 Construct::Pair((left_index, left, right_index, right)) => { in make() 48 let right_index = right_index % SparseChunk::<A>::capacity(); in make() localVariable 49 let out = SparseChunk::pair(left_index, left.clone(), right_index, right.clone()); in make() 52 guide.insert(right_index, right); in make()
|
/dports/textproc/angle-grinder/angle-grinder-0.18.0/cargo-crates/sized-chunks-0.3.1/src/tests/ |
H A D | sparse_chunk.rs | 46 Construct::Pair((left_index, left, right_index, right)) => { in make() 48 let right_index = right_index % SparseChunk::<A>::CAPACITY; in make() localVariable 49 let out = SparseChunk::pair(left_index, left.clone(), right_index, right.clone()); in make() 52 guide.insert(right_index, right); in make()
|