| /dports/lang/rust/rustc-1.58.1-src/library/core/src/slice/ |
| H A D | sort.rs | 31 fn shift_head<T, F>(v: &mut [T], is_less: &mut F) in shift_head()
160 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
162 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
734 insertion_sort(v, is_less); in recurse()
741 heapsort(v, is_less); in recurse()
769 if !is_less(p, &v[pivot]) { in recurse()
815 recurse(v, &mut is_less, None, limit); in quicksort()
821 is_less: &mut F, in partition_at_index_loop()
830 insertion_sort(v, is_less); in partition_at_index_loop()
841 if !is_less(p, &v[pivot]) { in partition_at_index_loop()
[all …]
|
| /dports/devel/stylua/StyLua-0.11.0/cargo-crates/rayon-1.5.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/multimedia/librav1e/rav1e-0.5.1/cargo-crates/rayon-1.5.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/multimedia/rav1e/rav1e-0.5.1/cargo-crates/rayon-1.5.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/devel/texlab/texlab-3.3.0/cargo-crates/rayon-1.5.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/misc/broot/broot-1.7.0/cargo-crates/rayon-1.5.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/multimedia/gstreamer1-plugins-rust/gst-plugins-rs-d0466b3eee114207f851b37cae0015c0e718f021/cargo-crates/rayon-1.5.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/devel/rust-analyzer/rust-analyzer-2021-12-20/cargo-crates/rayon-1.5.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/devel/grcov/grcov-0.8.2/cargo-crates/rayon-1.5.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/multimedia/termplay/termplay-2.0.6/cargo-crates/rayon-1.3.0/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/net-im/zkgroup/zkgroup-0.7.4/cargo-crates/rayon-1.5.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/rayon/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/lang/spidermonkey60/firefox-60.9.0/third_party/rust/rayon/src/slice/ |
| H A D | quicksort.rs | 56 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
89 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
159 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
161 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
169 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
174 shift_tail(&mut v[..i + 1], is_less); in insertion_sort()
180 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
652 insertion_sort(v, is_less); in recurse()
659 heapsort(v, is_less); in recurse()
687 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/sysutils/vector/vector-0.10.0/cargo-crates/rayon-1.3.0/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/www/geckodriver/mozilla-central-e9783a644016aa9b317887076618425586730d73/testing/geckodriver/cargo-crates/rayon-1.2.0/src/slice/ |
| H A D | quicksort.rs | 56 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
91 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
163 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
165 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
173 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
178 shift_tail(&mut v[..=i], is_less); in insertion_sort()
184 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
666 insertion_sort(v, is_less); in recurse()
673 heapsort(v, is_less); in recurse()
701 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/sysutils/czkawka/czkawka-3.3.1/cargo-crates/rayon-1.5.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/audio/gnome-podcasts/podcasts-c86f7bfdef7692bbf20f315a90450321f6ca9ce7/cargo-crates/rayon-1.5.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/textproc/sd/sd-0.7.6/cargo-crates/rayon-1.3.1/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/devel/tokei/tokei-12.1.2/cargo-crates/rayon-1.5.0/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/shells/ion/ion-a8872014dbce730ccd00aaa722397dc394a52bf4/cargo-crates/rayon-1.1.0/src/slice/ |
| H A D | quicksort.rs | 56 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
91 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
163 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
165 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
173 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
178 shift_tail(&mut v[..=i], is_less); in insertion_sort()
184 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
666 insertion_sort(v, is_less); in recurse()
673 heapsort(v, is_less); in recurse()
701 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/www/firefox/firefox-99.0/third_party/rust/rayon/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/graphics/viu/viu-1.1/cargo-crates/rayon-1.4.0/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/rayon-1.4.0/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/rayon/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|
| /dports/net-im/libsignal-client/libsignal-client-0.9.6/cargo-crates/rayon-1.5.0/src/slice/ |
| H A D | quicksort.rs | 55 fn shift_head<T, F>(v: &mut [T], is_less: &F) in shift_head()
90 fn shift_tail<T, F>(v: &mut [T], is_less: &F) in shift_tail()
162 shift_tail(&mut v[..i], is_less); in partial_insertion_sort()
164 shift_head(&mut v[i..], is_less); in partial_insertion_sort()
172 fn insertion_sort<T, F>(v: &mut [T], is_less: &F) in insertion_sort()
177 shift_tail(&mut v[..=i], is_less); in insertion_sort()
183 fn heapsort<T, F>(v: &mut [T], is_less: &F) in heapsort()
665 insertion_sort(v, is_less); in recurse()
672 heapsort(v, is_less); in recurse()
700 if !is_less(p, &v[pivot]) { in recurse()
[all …]
|