| /dports/math/igraph/igraph-0.9.5/src/misc/ |
| H A D | other.c | 125 long int i, pivot_idx = 0, last_idx, before_last_idx, next_idx, j; in igraph_convex_hull() local
149 if (MATRIX(*data, i, 1) < MATRIX(*data, pivot_idx, 1)) { in igraph_convex_hull()
150 pivot_idx = i; in igraph_convex_hull()
151 } else if (MATRIX(*data, i, 1) == MATRIX(*data, pivot_idx, 1) && in igraph_convex_hull()
152 MATRIX(*data, i, 0) < MATRIX(*data, pivot_idx, 0)) { in igraph_convex_hull()
153 pivot_idx = i; in igraph_convex_hull()
156 px = MATRIX(*data, pivot_idx, 0); in igraph_convex_hull()
157 py = MATRIX(*data, pivot_idx, 1); in igraph_convex_hull()
161 if (i == pivot_idx) { in igraph_convex_hull()
180 pivot_idx = (long int) VECTOR(order)[no_of_nodes - 1]; in igraph_convex_hull()
[all …]
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | other.c | 121 long int i, pivot_idx = 0, last_idx, before_last_idx, next_idx, j; in igraph_convex_hull() local
145 if (MATRIX(*data, i, 1) < MATRIX(*data, pivot_idx, 1)) { in igraph_convex_hull()
146 pivot_idx = i; in igraph_convex_hull()
147 } else if (MATRIX(*data, i, 1) == MATRIX(*data, pivot_idx, 1) && in igraph_convex_hull()
148 MATRIX(*data, i, 0) < MATRIX(*data, pivot_idx, 0)) { in igraph_convex_hull()
149 pivot_idx = i; in igraph_convex_hull()
152 px = MATRIX(*data, pivot_idx, 0); in igraph_convex_hull()
153 py = MATRIX(*data, pivot_idx, 1); in igraph_convex_hull()
157 if (i == pivot_idx) { in igraph_convex_hull()
176 pivot_idx = (long int) VECTOR(order)[no_of_nodes - 1]; in igraph_convex_hull()
[all …]
|
| /dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | 1.cc | 93 for (int pivot_idx = 0; pivot_idx < 8; ++pivot_idx) in test4() local
96 for (int i = 0; i != pivot_idx; ++i) in test4()
102 for (int i = pivot_idx; i != 8; ++i) in test4()
104 s[i].a = i - pivot_idx; in test4()
108 inplace_merge(s, s + pivot_idx, s + 8); in test4()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | 1.cc | 93 for (int pivot_idx = 0; pivot_idx < 8; ++pivot_idx) in test4() local
96 for (int i = 0; i != pivot_idx; ++i) in test4()
102 for (int i = pivot_idx; i != 8; ++i) in test4()
104 s[i].a = i - pivot_idx; in test4()
108 inplace_merge(s, s + pivot_idx, s + 8); in test4()
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | 1.cc | 93 for (int pivot_idx = 0; pivot_idx < 8; ++pivot_idx) in test4() local
96 for (int i = 0; i != pivot_idx; ++i) in test4()
102 for (int i = pivot_idx; i != 8; ++i) in test4()
104 s[i].a = i - pivot_idx; in test4()
108 inplace_merge(s, s + pivot_idx, s + 8); in test4()
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
| H A D | 1.cc | 93 for (int pivot_idx = 0; pivot_idx < 8; ++pivot_idx) in test4() local
96 for (int i = 0; i != pivot_idx; ++i) in test4()
102 for (int i = pivot_idx; i != 8; ++i) in test4()
104 s[i].a = i - pivot_idx; in test4()
108 inplace_merge(s, s + pivot_idx, s + 8); in test4()
|
| /dports/sysutils/czkawka/czkawka-3.3.1/cargo-crates/img_hash-3.2.0/src/alg/ |
| H A D | blockhash.rs | 168 let pivot_idx = partition(data); in qselect_inplace() localVariable
170 if k == pivot_idx { in qselect_inplace()
171 &mut data[pivot_idx] in qselect_inplace()
172 } else if k < pivot_idx { in qselect_inplace()
173 qselect_inplace(&mut data[..pivot_idx], k) in qselect_inplace()
175 qselect_inplace(&mut data[pivot_idx + 1..], k - pivot_idx - 1) in qselect_inplace()
182 let pivot_idx = { in partition() localVariable
190 data.swap(pivot_idx, len - 1); in partition()
|
| /dports/math/octave-forge-interval/interval-3.2.0/doc/image/ |
| H A D | cameleon.m.texinfo | 86 [pivot_distance, pivot_idx] = min (distance);
88 neighbors_idx = adjacency(:, pivot_idx) & not (visited);
97 mid (paving(1, pivot_idx)) - mid (paving(1, neighbors_idx)), ...
98 mid (paving(2, pivot_idx)) - mid (paving(2, neighbors_idx))));
100 previous(shorter_path) = pivot_idx;
102 distance(pivot_idx) = nan;
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/cluster/ |
| H A D | _optimal_leaf_ordering.pyx | 70 cdef int pivot_idx, i, store_idx
91 pivot_idx = size // 2
94 if dist[size - 1] > dist[pivot_idx]:
95 dual_swap(dist, idx, size - 1, pivot_idx)
109 pivot_idx = store_idx
112 if pivot_idx > 1:
113 _simultaneous_sort(dist, idx, pivot_idx)
114 if pivot_idx + 2 < size:
115 _simultaneous_sort(dist + pivot_idx + 1,
116 idx + pivot_idx + 1,
[all …]
|
| /dports/misc/thrill/thrill-12c5b59bca66df93b66628b3829027bd0f110dd9/thrill/api/ |
| H A D | merge.hpp | 346 size_t pivot_idx = left[s][mp]; in SelectPivots() local
349 pivot_idx = left[s][mp] + (context_.rng_() % width[s][mp]); in SelectPivots()
350 assert(pivot_idx < files_[mp]->num_items()); in SelectPivots()
352 pivot_elem = files_[mp]->template GetItemAt<ValueType>(pivot_idx); in SelectPivots()
358 pivot_idx, in SelectPivots()
|
| /dports/lang/spidermonkey60/firefox-60.9.0/third_party/aom/av1/encoder/ |
| H A D | bgsprite.c | 404 static int partition(YuvPixel arr[], int left, int right, int pivot_idx) { in partition() argument
405 YuvPixel pivot = arr[pivot_idx]; in partition()
408 swap_yuv(&arr[pivot_idx], &arr[right]); in partition()
429 int pivot_idx = left + rand_r(&seed) % (right - left + 1); in qselect() local
430 pivot_idx = partition(arr, left, right, pivot_idx); in qselect()
432 if (k == pivot_idx) { in qselect()
434 } else if (k < pivot_idx) { in qselect()
435 return qselect(arr, left, pivot_idx - 1, k); in qselect()
437 return qselect(arr, pivot_idx + 1, right, k); in qselect()
|
| /dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/neighbors/ |
| H A D | _binary_tree.pxi | 642 cdef ITYPE_t pivot_idx, i, store_idx
663 pivot_idx = size / 2
666 if dist[size - 1] > dist[pivot_idx]:
667 dual_swap(dist, idx, size - 1, pivot_idx)
681 pivot_idx = store_idx
684 if pivot_idx > 1:
685 _simultaneous_sort(dist, idx, pivot_idx)
686 if pivot_idx + 2 < size:
687 _simultaneous_sort(dist + pivot_idx + 1,
688 idx + pivot_idx + 1,
[all …]
|
| /dports/games/eureka/eureka-1.27b-source/src/ |
| H A D | r_software.cc | 1740 int Sort_Partition(int lo, int hi, int pivot_idx) in Sort_Partition()
1744 const DrawWall *pivot = active[pivot_idx]; in Sort_Partition()
1758 if (pivot_idx != hi) in Sort_Partition()
1759 Sort_Swap(pivot_idx, hi); in Sort_Partition()
1771 if (pivot_idx != lo) in Sort_Partition()
1772 Sort_Swap(pivot_idx, lo); in Sort_Partition()
1817 int pivot_idx = (s + e) >> 1; in Sort_Range() local
1819 int mid = Sort_Partition(s, e, pivot_idx); in Sort_Range()
|
| /dports/math/octave/octave-6.4.0/scripts/linear-algebra/ |
| H A D | krylov.m | 156 pivot_idx = short_pv(maxidx); variable
159 if (pivot_idx != pivot_vec(nu))
|
| /dports/multimedia/mkvtoolnix/mkvtoolnix-65.0.0/src/common/hevc/ |
| H A D | util.cpp | 1028 for (uint64_t pivot_idx = 0; pivot_idx < num_pivots_minus2 + 2; pivot_idx++) in parse_dovi_rpu() local
|