/dports/devel/thrust/thrust-1.9.5/testing/ |
H A D | stable_sort_by_key.cu | 67 sorted_values.resize(9); in InitializeSimpleStableKeyValueSortTest() 69 sorted_keys[1] = 16; sorted_values[1] = 3; in InitializeSimpleStableKeyValueSortTest() 70 sorted_keys[2] = 15; sorted_values[2] = 8; in InitializeSimpleStableKeyValueSortTest() 71 sorted_keys[3] = 25; sorted_values[3] = 0; in InitializeSimpleStableKeyValueSortTest() 72 sorted_keys[4] = 26; sorted_values[4] = 4; in InitializeSimpleStableKeyValueSortTest() 73 sorted_keys[5] = 24; sorted_values[5] = 7; in InitializeSimpleStableKeyValueSortTest() 74 sorted_keys[6] = 35; sorted_values[6] = 2; in InitializeSimpleStableKeyValueSortTest() 75 sorted_keys[7] = 34; sorted_values[7] = 5; in InitializeSimpleStableKeyValueSortTest() 76 sorted_keys[8] = 36; sorted_values[8] = 6; in InitializeSimpleStableKeyValueSortTest() 86 Vector sorted_keys, sorted_values; in TestStableSortByKeySimple() local [all …]
|
H A D | sort_by_key.cu | 48 Vector& sorted_keys, Vector& sorted_values) in InitializeSimpleKeyValueSortTest() argument 61 sorted_values.resize(7); in InitializeSimpleKeyValueSortTest() 62 sorted_keys[0] = 0; sorted_values[1] = 0; in InitializeSimpleKeyValueSortTest() 63 sorted_keys[1] = 1; sorted_values[3] = 1; in InitializeSimpleKeyValueSortTest() 64 sorted_keys[2] = 2; sorted_values[6] = 2; in InitializeSimpleKeyValueSortTest() 65 sorted_keys[3] = 3; sorted_values[5] = 3; in InitializeSimpleKeyValueSortTest() 66 sorted_keys[4] = 4; sorted_values[2] = 4; in InitializeSimpleKeyValueSortTest() 67 sorted_keys[5] = 5; sorted_values[0] = 5; in InitializeSimpleKeyValueSortTest() 68 sorted_keys[6] = 6; sorted_values[4] = 6; in InitializeSimpleKeyValueSortTest() 76 Vector sorted_keys, sorted_values; in TestSortByKeySimple() local [all …]
|
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/operator/tensor/ |
H A D | sort_op-inl.cuh | 166 VDType* values_out_ptr = sorted_values == nullptr ? in SortByKeyImpl() 168 sorted_values->dptr_; in SortByKeyImpl() 187 if (sorted_values == nullptr) { in SortByKeyImpl() 201 if (sorted_values != nullptr) { in SortByKeyImpl() 202 v = sorted_values; in SortByKeyImpl() 244 if (sorted_values != nullptr) { in SortByKeyImpl() 245 v = sorted_values; in SortByKeyImpl() 284 if (sorted_values != nullptr) { in SortByKeyImpl() 285 v = sorted_values; in SortByKeyImpl() 325 if (sorted_values != nullptr) { in SortByKeyImpl() [all …]
|
H A D | sort_op.h | 61 mshadow::Tensor<cpu, 1, VDType>* sorted_values = nullptr) { 73 if (sorted_values == nullptr) { 74 sorted_values = &values; 92 (*sorted_values)[i] = values_vec[idx[i]]; 131 mshadow::Tensor<gpu, 1, VDType>* sorted_values = nullptr);
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/operator/tensor/ |
H A D | sort_op-inl.cuh | 166 VDType* values_out_ptr = sorted_values == nullptr ? in SortByKeyImpl() 168 sorted_values->dptr_; in SortByKeyImpl() 187 if (sorted_values == nullptr) { in SortByKeyImpl() 201 if (sorted_values != nullptr) { in SortByKeyImpl() 202 v = sorted_values; in SortByKeyImpl() 244 if (sorted_values != nullptr) { in SortByKeyImpl() 245 v = sorted_values; in SortByKeyImpl() 284 if (sorted_values != nullptr) { in SortByKeyImpl() 285 v = sorted_values; in SortByKeyImpl() 325 if (sorted_values != nullptr) { in SortByKeyImpl() [all …]
|
H A D | sort_op.h | 61 mshadow::Tensor<cpu, 1, VDType>* sorted_values = nullptr) { 73 if (sorted_values == nullptr) { 74 sorted_values = &values; 92 (*sorted_values)[i] = values_vec[idx[i]]; 131 mshadow::Tensor<gpu, 1, VDType>* sorted_values = nullptr);
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/VNL/src/vxl/core/vnl/ |
H A D | vnl_index_sort.h | 44 SortVectorType& sorted_values, in vector_sort() argument 50 reindexValues(values, indices, sorted_values); in vector_sort() 70 SortMatrixType& sorted_values, in matrix_sort() argument 73 sorted_values.set_size(values.rows(), values.cols()); in matrix_sort() 84 putVector(sortedValVect, direction, vIx, sorted_values); in matrix_sort() 119 SortVectorType& sorted_values) in reindexValues() argument 121 sorted_values.set_size(values.size()); in reindexValues() 123 sorted_values[ix] = values[indices[ix]]; in reindexValues()
|
/dports/misc/vxl/vxl-3.3.2/core/vnl/ |
H A D | vnl_index_sort.h | 44 SortVectorType& sorted_values, in vector_sort() argument 50 reindexValues(values, indices, sorted_values); in vector_sort() 70 SortMatrixType& sorted_values, in matrix_sort() argument 73 sorted_values.set_size(values.rows(), values.cols()); in matrix_sort() 84 putVector(sortedValVect, direction, vIx, sorted_values); in matrix_sort() 119 SortVectorType& sorted_values) in reindexValues() argument 121 sorted_values.set_size(values.size()); in reindexValues() 123 sorted_values[ix] = values[indices[ix]]; in reindexValues()
|
/dports/devel/thrust/thrust-1.9.5/testing/backend/cuda/ |
H A D | merge_sort.cu | 39 Vector& sorted_keys, Vector& sorted_values) in InitializeSimpleKeyValueSortTest() argument 52 sorted_values.resize(7); in InitializeSimpleKeyValueSortTest() 53 sorted_keys[0] = 0; sorted_values[1] = 0; in InitializeSimpleKeyValueSortTest() 54 sorted_keys[1] = 1; sorted_values[3] = 1; in InitializeSimpleKeyValueSortTest() 55 sorted_keys[2] = 2; sorted_values[6] = 2; in InitializeSimpleKeyValueSortTest() 56 sorted_keys[3] = 3; sorted_values[5] = 3; in InitializeSimpleKeyValueSortTest() 57 sorted_keys[4] = 4; sorted_values[2] = 4; in InitializeSimpleKeyValueSortTest() 58 sorted_keys[5] = 5; sorted_values[0] = 5; in InitializeSimpleKeyValueSortTest() 59 sorted_keys[6] = 6; sorted_values[4] = 6; in InitializeSimpleKeyValueSortTest() 119 Vector sorted_keys, sorted_values; in TestMergeSortKeyValueSimple() [all …]
|
/dports/audio/lenticular-lv2/lenticular_lv2-0.5.0-14-g14d8075/eurorack/marbles/ |
H A D | note_filter.h | 54 float sorted_values[N]; in Process() local 62 std::copy(&previous_values_[0], &previous_values_[N], &sorted_values[0]); in Process() 63 std::sort(&sorted_values[0], &sorted_values[N]); in Process() 64 value = sorted_values[(N - 1) / 2]; in Process()
|
/dports/audio/lenticular-lv2/lenticular_lv2-0.5.0-14-g14d8075/eurorack/rings/dsp/ |
H A D | note_filter.h | 74 float sorted_values[N]; in Process() local 80 std::copy(&previous_values_[0], &previous_values_[N], &sorted_values[0]); in Process() 81 std::sort(&sorted_values[0], &sorted_values[N]); in Process() 82 float median = 0.5f * (sorted_values[(N - 1) / 2] + sorted_values[N / 2]); in Process()
|
/dports/audio/lenticular-lv2/lenticular_lv2-0.5.0-14-g14d8075/parasites/rings/dsp/ |
H A D | note_filter.h | 74 float sorted_values[N]; in Process() local 80 std::copy(&previous_values_[0], &previous_values_[N], &sorted_values[0]); in Process() 81 std::sort(&sorted_values[0], &sorted_values[N]); in Process() 82 float median = 0.5f * (sorted_values[(N - 1) / 2] + sorted_values[N / 2]); in Process()
|
/dports/science/py-GPy/GPy-1.10.0/GPy/mappings/ |
H A D | piecewise_linear.py | 33 self.sorted_values = self.values[self.order] 35 self.grads = np.diff(self.sorted_values)/np.diff(self.sorted_breaks) 42 …y[x<self.sorted_breaks[0]] = x[x<self.sorted_breaks[0]] + self.sorted_values[0] - self.sorted_bre… 45 …y[x>self.sorted_breaks[-1]] = x[x>self.sorted_breaks[-1]] + self.sorted_values[-1] - self.sorted_… 48 …g, v in zip(self. sorted_breaks[:-1], self.sorted_breaks[1:], self.grads, self.sorted_values[:-1]): 59 dL_dv = np.zeros(self.sorted_values.size) 62 …merate(zip(self. sorted_breaks[:-1], self.sorted_breaks[1:], self.grads, self.sorted_values[:-1])): 89 …g, v in zip(self. sorted_breaks[:-1], self.sorted_breaks[1:], self.grads, self.sorted_values[:-1]):
|
/dports/devel/p5-Perl-Metrics-Simple/Perl-Metrics-Simple-0.18/lib/Perl/Metrics/Simple/ |
H A D | Analysis.pm | 95 my @sorted_values = sort _numerically map { $_->{$hash_key} } @{$nodes}; 96 my $min = $sorted_values[0]; 97 my $max = $sorted_values[-1]; 98 return ( $min, $max, \@sorted_values ); 157 _get_mean_median_std_dev( $sub_length{sorted_values} ); 171 _get_mean_median_std_dev( $sub_complexity{sorted_values} ); 186 _get_mean_median_std_dev( $main_complexity{sorted_values} );
|
/dports/graphics/py-pygal/pygal-2.4.0/pygal/ |
H A D | util.py | 38 sorted_values = sorted(values) 40 abs(2 * sorted_values[1] - sorted_values[0] - sorted_values[2]) > 41 abs(1.5 * (sorted_values[1] - sorted_values[0]))): 43 values_step = sorted_values[1] - sorted_values[0] 44 full_range = sorted_values[-1] - sorted_values[0] 58 return [value for value in sorted_values if value in major_values]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/dashboard/dashboard/common/ |
H A D | math_utils.py | 21 sorted_values = sorted(values) 24 return float(sorted_values[mid]) 25 return (sorted_values[mid - 1] + sorted_values[mid]) / 2.0
|
/dports/devel/mtbl/mtbl-1.4.0/t/ |
H A D | test-sorted-merge.c | 58 char *sorted_values[NUM_SORTED] = { variable 259 if (total > (sizeof(sorted_values) / sizeof(sorted_values[0]))) in main() 263 assert(bytes_compare((const uint8_t *)sorted_values[total - 1], in main() 264 strlen(sorted_values[total - 1]) + 1, key, len_key) == 0); in main() 275 assert(bytes_compare((const uint8_t *)sorted_values[total - 1], in main() 276 strlen(sorted_values[total - 1]) + 1, value, len_value) == 0); in main() 282 assert(total == (sizeof(sorted_values) / sizeof(sorted_values[0]))); in main()
|
/dports/math/vtk9/VTK-9.1.0/Infovis/Core/ |
H A D | vtkAdjacencyMatrixToEdgeTable.cxx | 138 sorted_values_t sorted_values; in RequestData() local 147 sorted_values.insert( in RequestData() 150 sorted_values.insert(std::make_pair(input_array->GetValue(coordinates), j)); in RequestData() 156 for (sorted_values_t::const_iterator value = sorted_values.begin(); in RequestData() 157 value != sorted_values.end(); ++value, ++count) in RequestData()
|
/dports/math/vtk8/VTK-8.2.0/Infovis/Core/ |
H A D | vtkAdjacencyMatrixToEdgeTable.cxx | 137 sorted_values_t sorted_values; in RequestData() local 145 sorted_values.insert(std::pair<const double,vtkIdType>(input_array->GetValue(coordinates),j)); in RequestData() 147 sorted_values.insert(std::make_pair(input_array->GetValue(coordinates), j)); in RequestData() 153 …for(sorted_values_t::const_iterator value = sorted_values.begin(); value != sorted_values.end(); +… in RequestData()
|
/dports/math/vtk6/VTK-6.2.0/Infovis/Core/ |
H A D | vtkAdjacencyMatrixToEdgeTable.cxx | 137 sorted_values_t sorted_values; in RequestData() local 145 sorted_values.insert(std::pair<const double,vtkIdType>(input_array->GetValue(coordinates),j)); in RequestData() 147 sorted_values.insert(std::make_pair(input_array->GetValue(coordinates), j)); in RequestData() 153 …for(sorted_values_t::const_iterator value = sorted_values.begin(); value != sorted_values.end(); +… in RequestData()
|
/dports/japanese/mozc-el/mozc-2.23.2815.102.01/src/composer/internal/ |
H A D | gen_typing_model.py | 112 sorted_values = list(sorted(set(values))) 113 mapping_table = sorted_values[0] 115 span = len(sorted_values) // (mapping_table_size_without_special_value - 1) 116 mapping_table = [sorted_values[i * span] 119 mapping_table.append(sorted_values[-1])
|
/dports/japanese/uim-mozc/mozc-2.23.2815.102.01/src/composer/internal/ |
H A D | gen_typing_model.py | 112 sorted_values = list(sorted(set(values))) 113 mapping_table = sorted_values[0] 115 span = len(sorted_values) // (mapping_table_size_without_special_value - 1) 116 mapping_table = [sorted_values[i * span] 119 mapping_table.append(sorted_values[-1])
|
/dports/japanese/mozc-tool/mozc-2.23.2815.102.01/src/composer/internal/ |
H A D | gen_typing_model.py | 112 sorted_values = list(sorted(set(values))) 113 mapping_table = sorted_values[0] 115 span = len(sorted_values) // (mapping_table_size_without_special_value - 1) 116 mapping_table = [sorted_values[i * span] 119 mapping_table.append(sorted_values[-1])
|
/dports/japanese/mozc-server/mozc-2.23.2815.102.01/src/composer/internal/ |
H A D | gen_typing_model.py | 112 sorted_values = list(sorted(set(values))) 113 mapping_table = sorted_values[0] 115 span = len(sorted_values) // (mapping_table_size_without_special_value - 1) 116 mapping_table = [sorted_values[i * span] 119 mapping_table.append(sorted_values[-1])
|
/dports/japanese/fcitx-mozc/mozc-2.23.2815.102.01/src/composer/internal/ |
H A D | gen_typing_model.py | 112 sorted_values = list(sorted(set(values))) 113 mapping_table = sorted_values[0] 115 span = len(sorted_values) // (mapping_table_size_without_special_value - 1) 116 mapping_table = [sorted_values[i * span] 119 mapping_table.append(sorted_values[-1])
|