| /dports/lang/racket/racket-8.3/share/pkgs/srfi-lib/srfi/32/ |
| H A D | sort.rkt | 3 (rename list-sort list-sort!)
4 list-stable-sort
5 (rename list-stable-sort list-stable-sort!)
8 vector-stable-sort
9 vector-stable-sort!
62 #;(define list-sort! list-merge-sort!)
64 (define list-stable-sort list-merge-sort)
65 #;(define list-stable-sort! list-merge-sort!)
67 (define vector-sort vector-heap-sort)
70 (define vector-stable-sort vector-merge-sort)
[all …]
|
| /dports/lang/chibi-scheme/chibi-scheme-0.10/lib/srfi/132/ |
| H A D | test.sld | 16 (list-stable-sort > (list)))
18 (list-stable-sort > (list 987)))
24 (list-stable-sort (lambda (x y)
42 (vector-stable-sort > v)))
48 (vector-stable-sort > v)))
51 (vector-stable-sort > v)))
72 (vector-stable-sort > v 0)))
81 (vector-stable-sort > v 3)))
160 (vector-stable-sort! > v)
168 (vector-stable-sort! > v)
[all …]
|
| /dports/lang/ocaml/ocaml-4.05.0/testsuite/tests/misc/ |
| H A D | sorts.reference | 2 Testing List.sort...
3 List.sort with constant ints
7 List.sort with sorted ints
84 List.stable_sort with records (int[1]) [stable]
88 List.stable_sort with records (int[10]) [stable]
92 List.stable_sort with records (int[100]) [stable]
96 List.stable_sort with records (int[1000]) [stable]
182 Array.stable_sort with records (int[1]) [stable]
186 Array.stable_sort with records (int[10]) [stable]
190 Array.stable_sort with records (int[100]) [stable]
[all …]
|
| /dports/lang/ocaml-nox11/ocaml-4.05.0/testsuite/tests/misc/ |
| H A D | sorts.reference | 2 Testing List.sort...
3 List.sort with constant ints
7 List.sort with sorted ints
84 List.stable_sort with records (int[1]) [stable]
88 List.stable_sort with records (int[10]) [stable]
92 List.stable_sort with records (int[100]) [stable]
96 List.stable_sort with records (int[1000]) [stable]
182 Array.stable_sort with records (int[1]) [stable]
186 Array.stable_sort with records (int[10]) [stable]
190 Array.stable_sort with records (int[100]) [stable]
[all …]
|
| /dports/lang/guile2/guile-2.2.7/test-suite/tests/ |
| H A D | sort.test | 114 (with-test-prefix "stable-sort!"
116 (pass-if "stable-sort!"
118 (test-sort-inplace! v stable-sort!)))
120 (pass-if "stable-sort! of non-contigous array"
123 (test-sort-inplace! v stable-sort!)))
125 (pass-if "stable-sort! of negative-increment array"
128 (test-sort-inplace! v stable-sort!)))
131 (test-sort-inplace! (make-array 0 '(-99 0)) stable-sort!)))
134 (with-test-prefix "stable-sort"
139 (eq? '() (stable-sort '() <)))
[all …]
|
| /dports/lang/guile/guile-3.0.7/test-suite/tests/ |
| H A D | sort.test | 114 (with-test-prefix "stable-sort!"
116 (pass-if "stable-sort!"
118 (test-sort-inplace! v stable-sort!)))
120 (pass-if "stable-sort! of non-contigous array"
123 (test-sort-inplace! v stable-sort!)))
125 (pass-if "stable-sort! of negative-increment array"
128 (test-sort-inplace! v stable-sort!)))
131 (test-sort-inplace! (make-array 0 '(-99 0)) stable-sort!)))
134 (with-test-prefix "stable-sort"
139 (eq? '() (stable-sort '() <)))
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/sort/doc/ |
| H A D | linux_parallel.qbk | 38 OMP parallel sort | 1.1990 | 1564 MB |
42 OMP parallel stable sort | 1.5814 | 1972 MB |
43 TBB parallel stable sort | 1.1745 | 1570 MB |
44 sample sort | 1.2872 | 1566 MB |
45 parallel stable sort | 1.7158 | 1176 MB |
62 OMP parallel stable sort | 2.3214 | 2024 MB |
63 TBB parallel stable sort | 1.4383 | 1143 MB |
65 parallel stable sort | 2.0970 | 978 MB |
99 …OMP par stable sort | 1.55 1.55| 1.38 1.35| 1.23 1.22| 1.17 1.17| 1.09 1.08| 0.97 0.97| 19…
100 …TBB par stable sort | 1.23 1.23| 0.89 0.85| 0.74 0.72| 0.71 0.69| 0.69 0.69| 0.68 0.68| 15…
[all …]
|
| H A D | flat_stable_sort.qbk | 16 [*Flat_stable_sort] is a new stable sort algorithm, designed and implemented by Francisco Jose Tapi…
18 The goal of the algorithm is to stably sort with little additional memory (about 1% of the memory u…
20 …he default stable sort algorithms provided by most compilers and libraries use substantial additio…
22 This new algorithm provides around 80%-90% of the speed of the spinsort and the stable sort algorit…
42 Memory used by the stable sort algorithms measured on Linux x64
99 You only need to include the file boost/sort/sort.hpp.
101 The flat_stable_sort function is in the namespace boost::sort.
106 #include <boost/sort/sort.hpp>
113 This algorithm uses a [*comparison object], in the same way as the standard library sort
118 guarantee the integrity of the objects to sort, but not their relative order. If the exception
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/sort/doc/ |
| H A D | linux_parallel.qbk | 38 OMP parallel sort | 1.1990 | 1564 MB |
42 OMP parallel stable sort | 1.5814 | 1972 MB |
43 TBB parallel stable sort | 1.1745 | 1570 MB |
44 sample sort | 1.2872 | 1566 MB |
45 parallel stable sort | 1.7158 | 1176 MB |
62 OMP parallel stable sort | 2.3214 | 2024 MB |
63 TBB parallel stable sort | 1.4383 | 1143 MB |
65 parallel stable sort | 2.0970 | 978 MB |
99 …OMP par stable sort | 1.55 1.55| 1.38 1.35| 1.23 1.22| 1.17 1.17| 1.09 1.08| 0.97 0.97| 19…
100 …TBB par stable sort | 1.23 1.23| 0.89 0.85| 0.74 0.72| 0.71 0.69| 0.69 0.69| 0.68 0.68| 15…
[all …]
|
| H A D | flat_stable_sort.qbk | 16 [*Flat_stable_sort] is a new stable sort algorithm, designed and implemented by Francisco Jose Tapi…
18 The goal of the algorithm is to stably sort with little additional memory (about 1% of the memory u…
20 …he default stable sort algorithms provided by most compilers and libraries use substantial additio…
22 This new algorithm provides around 80%-90% of the speed of the spinsort and the stable sort algorit…
42 Memory used by the stable sort algorithms measured on Linux x64
99 You only need to include the file boost/sort/sort.hpp.
101 The flat_stable_sort function is in the namespace boost::sort.
106 #include <boost/sort/sort.hpp>
113 This algorithm uses a [*comparison object], in the same way as the standard library sort
118 guarantee the integrity of the objects to sort, but not their relative order. If the exception
|
| /dports/devel/boost-libs/boost_1_72_0/libs/sort/doc/ |
| H A D | linux_parallel.qbk | 38 OMP parallel sort | 1.1990 | 1564 MB |
42 OMP parallel stable sort | 1.5814 | 1972 MB |
43 TBB parallel stable sort | 1.1745 | 1570 MB |
44 sample sort | 1.2872 | 1566 MB |
45 parallel stable sort | 1.7158 | 1176 MB |
62 OMP parallel stable sort | 2.3214 | 2024 MB |
63 TBB parallel stable sort | 1.4383 | 1143 MB |
65 parallel stable sort | 2.0970 | 978 MB |
99 …OMP par stable sort | 1.55 1.55| 1.38 1.35| 1.23 1.22| 1.17 1.17| 1.09 1.08| 0.97 0.97| 19…
100 …TBB par stable sort | 1.23 1.23| 0.89 0.85| 0.74 0.72| 0.71 0.69| 0.69 0.69| 0.68 0.68| 15…
[all …]
|
| H A D | flat_stable_sort.qbk | 16 [*Flat_stable_sort] is a new stable sort algorithm, designed and implemented by Francisco Jose Tapi…
18 The goal of the algorithm is to stably sort with little additional memory (about 1% of the memory u…
20 …he default stable sort algorithms provided by most compilers and libraries use substantial additio…
22 This new algorithm provides around 80%-90% of the speed of the spinsort and the stable sort algorit…
42 Memory used by the stable sort algorithms measured on Linux x64
99 You only need to include the file boost/sort/sort.hpp.
101 The flat_stable_sort function is in the namespace boost::sort.
106 #include <boost/sort/sort.hpp>
113 This algorithm uses a [*comparison object], in the same way as the standard library sort
118 guarantee the integrity of the objects to sort, but not their relative order. If the exception
|
| /dports/devel/hyperscan/boost_1_75_0/libs/sort/doc/ |
| H A D | linux_parallel.qbk | 38 OMP parallel sort | 1.1990 | 1564 MB |
42 OMP parallel stable sort | 1.5814 | 1972 MB |
43 TBB parallel stable sort | 1.1745 | 1570 MB |
44 sample sort | 1.2872 | 1566 MB |
45 parallel stable sort | 1.7158 | 1176 MB |
62 OMP parallel stable sort | 2.3214 | 2024 MB |
63 TBB parallel stable sort | 1.4383 | 1143 MB |
65 parallel stable sort | 2.0970 | 978 MB |
99 …OMP par stable sort | 1.55 1.55| 1.38 1.35| 1.23 1.22| 1.17 1.17| 1.09 1.08| 0.97 0.97| 19…
100 …TBB par stable sort | 1.23 1.23| 0.89 0.85| 0.74 0.72| 0.71 0.69| 0.69 0.69| 0.68 0.68| 15…
[all …]
|
| H A D | flat_stable_sort.qbk | 16 [*Flat_stable_sort] is a new stable sort algorithm, designed and implemented by Francisco Jose Tapi…
18 The goal of the algorithm is to stably sort with little additional memory (about 1% of the memory u…
20 …he default stable sort algorithms provided by most compilers and libraries use substantial additio…
22 This new algorithm provides around 80%-90% of the speed of the spinsort and the stable sort algorit…
42 Memory used by the stable sort algorithms measured on Linux x64
99 You only need to include the file boost/sort/sort.hpp.
101 The flat_stable_sort function is in the namespace boost::sort.
106 #include <boost/sort/sort.hpp>
113 This algorithm uses a [*comparison object], in the same way as the standard library sort
118 guarantee the integrity of the objects to sort, but not their relative order. If the exception
|
| /dports/lang/chibi-scheme/chibi-scheme-0.10/lib/srfi/ |
| H A D | 132.sld | 5 list-sort list-stable-sort
6 list-sort! list-stable-sort!
7 vector-sort vector-stable-sort
8 vector-sort! vector-stable-sort!
19 (include "132/sort.scm"))
|
| /dports/lang/perl5-devel/perl5-5.35.4-102-ge43d289c7c/lib/ |
| H A D | sort.t | 141 use sort qw( defaults stable );
142 my @ignore = sort (5,4,3,2,1);
145 use sort qw( defaults stable );
150 use sort qw(stable);
155 $sort_current = sort::current();
165 use sort qw(defaults stable);
170 $sort_current = sort::current();
180 no sort qw(stable);
185 $sort_current = sort::current();
192 use sort qw(defaults);
[all …]
|
| /dports/math/minizinc/libminizinc-2.5.5/share/minizinc/std/stdlib/ |
| H A D | stdlib_sort.mzn | 2 @groupdef stdlib.sort Array sorting operations
7 The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
13 The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
19 The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
26 The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
32 The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
38 The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
50 /** @group stdlib.sort
54 The permutation is the stable sort hence \a x[\a p[\p i]] = \a x[\a p[\p i+1]] \(\rightarrow\) \a p…
59 /** @group stdlib.sort
[all …]
|
| /dports/lang/perl5.34/perl-5.34.0/lib/ |
| H A D | sort.t | 132 main(sub { sort {&{$_[0]}} @{$_[1]} }, 0);
141 use sort qw( defaults stable );
142 my @ignore = sort (5,4,3,2,1);
145 use sort qw( defaults stable );
146 my @nested = sort { dumbsort($a,$b) } (3,2,2,1);
150 use sort qw(stable);
151 my $sort_current; BEGIN { $sort_current = sort::current(); }
153 main(sub { sort {&{$_[0]}} @{$_[1]} }, 0);
159 use sort qw(defaults stable);
160 my $sort_current; BEGIN { $sort_current = sort::current(); }
[all …]
|
| /dports/lang/perl5.30/perl-5.30.3/lib/ |
| H A D | sort.t | 132 main(sub { sort {&{$_[0]}} @{$_[1]} }, 0);
141 use sort qw( defaults stable );
142 my @ignore = sort (5,4,3,2,1);
145 use sort qw( defaults stable );
146 my @nested = sort { dumbsort($a,$b) } (3,2,2,1);
150 use sort qw(stable);
151 my $sort_current; BEGIN { $sort_current = sort::current(); }
153 main(sub { sort {&{$_[0]}} @{$_[1]} }, 0);
159 use sort qw(defaults stable);
160 my $sort_current; BEGIN { $sort_current = sort::current(); }
[all …]
|
| /dports/lang/perl5.32/perl-5.32.1/lib/ |
| H A D | sort.t | 132 main(sub { sort {&{$_[0]}} @{$_[1]} }, 0);
141 use sort qw( defaults stable );
142 my @ignore = sort (5,4,3,2,1);
145 use sort qw( defaults stable );
146 my @nested = sort { dumbsort($a,$b) } (3,2,2,1);
150 use sort qw(stable);
151 my $sort_current; BEGIN { $sort_current = sort::current(); }
153 main(sub { sort {&{$_[0]}} @{$_[1]} }, 0);
159 use sort qw(defaults stable);
160 my $sort_current; BEGIN { $sort_current = sort::current(); }
[all …]
|
| /dports/devel/R-cran-bit64/bit64/man/ |
| H A D | sort.integer64.rd | 1 \name{sort.integer64}
2 \alias{sort.integer64}
12 \method{sort}{integer64}(x, decreasing = FALSE, has.na = TRUE, na.last = TRUE, stable = TRUE
14 \method{order}{integer64}(\dots, na.last = TRUE, decreasing = FALSE, has.na = TRUE, stable = TRUE
24 boolean scalar telling ramsort whether to sort \code{NA}s last or first.
28 boolean scalar telling ramsort whether to sort increasing or decreasing
30 \item{stable}{
31 boolean scalar defining whether stable sorting is needed. Allowing non-stable may speed-up.
43 see \code{\link{sort}} and \code{\link{order}}
53 \seealso{ \code{\link[=sort.integer64]{sort}}, \code{\link{sortcache}} }
[all …]
|
| /dports/devel/splint/splint-3.1.2/src/ |
| H A D | symtable.c | 136 ret->sort = v->sort; in varInfo_copy()
224 symtable stable = (symtable) dmalloc (sizeof (*stable)); in symtable_new() local
248 return stable; in symtable_new()
969 sort bsort, nullSort = sort_makeNoSort (); in parseLine()
1122 vi->sort = bsort; in parseLine()
1173 vi->sort = bsort; in parseLine()
1355 vi->sort = bsort; in parseLine()
1704 return x->content.sort; in htData_key()
2076 sort s; in domainMatches()
2097 sortSetList argSorts, sort q) in symtable_opsWithLegalDomain()
[all …]
|
| /dports/shells/zsh/zsh-5.8.1/Completion/Unix/Command/ |
| H A D | _sort | 1 #compdef sort gsort
4 …onary-order -g --general-numeric-sort -M --month-sort -h --human-numeric-sort -n --numeric-sort --…
7 "(-c --check -C -m --merge -s --stable)-c[check whether input is sorted; don't sort]"
26 '(-s --stable)'{-s,--stable}'[preserve original order of lines with the same key]'
31 "(-c --check -C)-C[check whether input is sorted silently; don't sort]"
45 "$ordering"{-R,--random-sort}'[sort by random hash of keys]'
46 "$ordering"{-V,--version-sort}'[sort version numbers]'
52 '--debug[annotate the part of the line used to sort]'
61 "${ordering}-l[sort by string length of field]"
62 "(-s)-S[don't use stable sort]"
[all …]
|
| /dports/math/minizinc/libminizinc-2.5.5/share/minizinc/std/ |
| H A D | arg_sort.mzn | 5 /** @group globals.sort
9 The permutation is the stable sort hence \a x[\a p[\p i]] = \a x[\a p[\p i+1]] \(\rightarrow\) \a p…
23 /** @group globals.sort
27 The permutation is the stable sort hence \a x[\a p[\p i]] = \a x[\a p[\p i+1]] \(\rightarrow\) \a p…
40 /** @group globals.sort
44 The permutation is the stable sort hence \a x[\a p[\p i]] = \a x[\a p[\p i+1]] \(\rightarrow\) \a p…
49 /** @group globals.sort
53 The permutation is the stable sort hence \a x[\a p[\p i]] = \a x[\a p[\p i+1]] \(\rightarrow\) \a p…
|
| /dports/science/siconos/siconos-4.4.0/externals/sort/ |
| H A D | README.md | 1 sort.h
4 <a href="https://travis-ci.org/swenson/sort"><img alt="build status" src="https://api.travis-ci.org…
22 * Binary insertion sort
25 * Merge sort (stable)
26 * In-place merge sort (*not* stable)
28 * Timsort (stable)
29 * Grail sort (stable)
34 * Sqrt Sort (stable, based on Grail sort, also by Andrey Astrelin).
53 * `#include "sort.h"`. Make sure that `sort.h` is in your include path.
63 #include "sort.h"
[all …]
|