goish 0.17.0

Goish Rust — write Rust using Go idioms. Ports Go's standard library and syntax so Go programmers can write Rust code that reads and feels like Go.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126

// Port of go1.25.5 src/sort/sort_test.go — table-driven sorts and searches.
//
// Skipped: benchmarks, TestSort (reflection-based heap-sort comparison),
// TestNonDeterministic (stability stress). Covered: Ints, Strings,
// Float64s, Slice, SliceStable, SearchInts, SearchStrings.

#![allow(non_snake_case)]
use goish::prelude::*;

test!{ fn TestSortInts(t) {
    let mut data: Vec<i64> = vec![74, 59, 238, -784, 9845, 959, 905, 0, 0, 42, 7586, -5467984, 7586];
    sort::Ints(&mut data);
    for i in 1..data.len() {
        if data[i] < data[i-1] {
            t.Errorf(Sprintf!("not sorted at %d", i as i64));
            return;
        }
    }
    if !sort::IntsAreSorted(&data) {
        t.Errorf(Sprintf!("IntsAreSorted returned false after sort"));
    }
}}

test!{ fn TestSortStrings(t) {
    let mut data: Vec<string> = vec!["Banana", "apple", "cherry", "BANANA", ""]
        .into_iter().map(string::from).collect();
    sort::Strings(&mut data);
    for i in 1..data.len() {
        if data[i] < data[i-1] {
            t.Errorf(Sprintf!("not sorted at %d", i as i64));
            return;
        }
    }
}}

test!{ fn TestSortFloat64s(t) {
    let mut data: Vec<f64> = vec![74.3, 59.0, 238.2, -784.0, 2.3, 9845.768];
    sort::Float64s(&mut data);
    for i in 1..data.len() {
        if data[i] < data[i-1] {
            t.Errorf(Sprintf!("not sorted at %d", i as i64));
            return;
        }
    }
    if !sort::Float64sAreSorted(&data) {
        t.Errorf(Sprintf!("Float64sAreSorted = false after sort"));
    }
}}

test!{ fn TestSortSlice(t) {
    let mut data = vec![3i64, 1, 4, 1, 5, 9, 2, 6];
    sort::Slice(&mut data, |a, b| a < b);
    if data != vec![1i64, 1, 2, 3, 4, 5, 6, 9] {
        t.Errorf(Sprintf!("sort::Slice ascending failed"));
    }
    sort::Slice(&mut data, |a, b| a > b);
    if data != vec![9i64, 6, 5, 4, 3, 2, 1, 1] {
        t.Errorf(Sprintf!("sort::Slice descending failed"));
    }
}}

test!{ fn TestSortSliceStable(t) {
    // Stable: equal-keyed items preserve original order.
    let mut data: Vec<(i64, &'static str)> = vec![
        (1, "a"), (2, "b"), (1, "c"), (2, "d"), (1, "e"),
    ];
    sort::SliceStable(&mut data, |a, b| a.0 < b.0);
    // All 1s first (in original order a, c, e), then 2s (b, d).
    let tags: Vec<&str> = data.iter().map(|p| p.1).collect();
    if tags != vec!["a", "c", "e", "b", "d"] {
        t.Errorf(Sprintf!("SliceStable did not preserve order"));
    }
}}

test!{ fn TestSearchInts(t) {
    let data: Vec<i64> = vec![0, 42, 59, 74, 238, 905, 959];
    // exact matches
    for (v, want) in [(0, 0), (42, 1), (59, 2), (959, 6)] {
        let got = sort::SearchInts(&data, v);
        if got != want {
            t.Errorf(Sprintf!("SearchInts(%d) = %d, want %d", v, got, want));
        }
    }
    // missing — returns insertion point
    let got = sort::SearchInts(&data, 100);
    if got != 4 {
        t.Errorf(Sprintf!("SearchInts(100) = %d, want 4", got));
    }
    let got = sort::SearchInts(&data, 1000);
    if got != 7 {
        t.Errorf(Sprintf!("SearchInts(1000) = %d, want 7 (end)", got));
    }
}}

test!{ fn TestSearchStrings(t) {
    let data: Vec<string> = vec!["alice", "bob", "carol", "dave"]
        .into_iter().map(string::from).collect();
    let got = sort::SearchStrings(&data, "carol");
    if got != 2 {
        t.Errorf(Sprintf!("SearchStrings(carol) = %d, want 2", got));
    }
    let got = sort::SearchStrings(&data, "zzz");
    if got != 4 {
        t.Errorf(Sprintf!("SearchStrings(zzz) = %d, want 4 (end)", got));
    }
}}

test!{ fn TestStressRandom(t) {
    // Large sort: 1000 reverse-sorted ints.
    let mut data: Vec<i64> = (0..1000i64).rev().collect();
    sort::Ints(&mut data);
    for i in 0..1000 {
        if data[i] != i as i64 {
            t.Errorf(Sprintf!("stress: data[%d] = %d, want %d", i as i64, data[i], i as i64));
            return;
        }
    }
}}

test!{ fn TestSortedEmpty(t) {
    let mut empty: Vec<i64> = Vec::new();
    sort::Ints(&mut empty);
    if !sort::IntsAreSorted(&empty) {
        t.Errorf(Sprintf!("empty slice not sorted?"));
    }
}}