Notebooks · lib/algo/legacy/tests/seq_argsort
lib/ algo/ legacy/ tests/ seq_argsort.viv
lib/algo/legacy/tests/seq_argsort.viv · 1 code cellOpen in the workbenchDownload .vivLook inside this program
- Atlas
The program’s map: every function and which calls which.
There’s no recorded run of this program yet.
Shift+Enter in a cell runs it and moves to the next. Running a cell runs every cell above it too, as one program.
[1]lines 1–36
# Generated by tools/algo/check.py from lib/algo/algo.spec: do not edit. # Each case prints its input (= X), its results, and the verdict of each postcondition # (? ...) as lib/algo/props.viv computes it; check.py checks them again in Python. from algo.cases import algo_case, CASE_NAMES from algo.props import algo_is_index_perm, algo_is_sorted_by, algo_is_stable_by from algo.legacy.seq_argsort import seq_argsort #| seq_argsort: the argsort every TheAlgorithms port uses (seq.viv), shadowing the builtin def algo_t_seq_argsort(kind, n, inside, skip: Arr) -> Bool { X = algo_case(kind, n, 1 + 97 * kind + n) print("@ seq_argsort", CASE_NAMES[kind], n) P = seq_argsort(X) print("= X", fmt(X)) print("= P", fmt(P)) p0 = algo_is_index_perm(P, len(X)) p1 = algo_is_sorted_by(P, X) p2 = algo_is_stable_by(P, X) print("?", p0, p1, p2) return inside == 0 or ((p0 or skip[0] == 1) and (p1 or skip[1] == 1) and (p2 or skip[2] == 1)) } algo_t_ok_seq_argsort = true algo_t_kinds_seq_argsort = [0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0] algo_t_inside_seq_argsort = [1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 0.0] algo_t_sizes_seq_argsort = [0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 7.0, 8.0, 9.0, 15.0, 16.0, 17.0, 31.0, 32.0, 33.0, 63.0, 64.0, 65.0, 129.0, 257.0] algo_t_skip_seq_argsort = [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0] for algo_t_k to len(algo_t_kinds_seq_argsort) { for algo_t_s to len(algo_t_sizes_seq_argsort) { algo_t_r = algo_t_seq_argsort(algo_t_kinds_seq_argsort[algo_t_k], algo_t_sizes_seq_argsort[algo_t_s], algo_t_inside_seq_argsort[algo_t_k], algo_t_skip_seq_argsort[algo_t_k * 3:(algo_t_k + 1) * 3]) algo_t_ok_seq_argsort = algo_t_ok_seq_argsort and algo_t_r } } test "seq_argsort: index-perm P X, ordered-by P X, stable-by P X (kinds random dups sorted reversed equal organ sawtooth nearly zeros)" { assert_true(algo_t_ok_seq_argsort) }