sure 0.3.0

Refinement types
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226

#![feature(const_result_trait_fn, const_trait_impl)]

use sure::*;

#[test]
fn basic() {
    macro_rules! unsigned {
        ($([$ty:ident, $module:ident]),+) => {$(
            {
                let a: $ty![1, 2, 3] = $ty::new(2 ).unwrap();
                let b: $ty![10, 20]  = $ty::new(10).unwrap();

                let c: $ty![11, 21, 12, 22, 13, 23] = a + b;
                let d: $ty![11, 12, 13, 21, 22, 23] = c.sort();
                let e: $ty![11, 12, 13, 21, 22, 23] = c.normalize();

                assert_eq!(d.inner(), 12);
                assert_eq!(e.inner(), 12);
            }
            {
                let a: $ty![11, 11, 11] = $ty::new(11).unwrap();
                let b: $ty![2, 3]       = $ty::new(3).unwrap();

                let c: $ty![5, 3, 5, 3, 5, 3] = a / b;
                let d: $ty![3, 3, 3, 5, 5, 5] = c.sort();
                let e: $ty![3, 5            ] = c.normalize();

                assert_eq!(d.inner(), 3);
                assert_eq!(e.inner(), 3);
            }
            {
                use $module::Range;
                let a: $ty![Range![5..=7]]  = $ty::new(7).unwrap();
                let b: $ty![Range![3..=4]]  = $ty::new(4).unwrap();

                let c: $ty![2, 1, 3, 2, 4, 3] = a - b;
                let d: $ty![1, 2, 2, 3, 3, 4] = c.sort();
                let e: $ty![1, 2, 3, 4      ] = c.normalize();

                assert_eq!(d.inner(), 3);
                assert_eq!(e.inner(), 3);
            }
        )+};
    }

    macro_rules! signed {
        ($([$ty:ident, $module:ident]),+) => {$(
            {
                let a: $ty![-1, -2, 3] = $ty::new(-2).unwrap();
                let b: $ty![-10, 20]   = $ty::new(20).unwrap();

                let c: $ty![-11, 19, -12, 18, -7, 23] = a + b;
                let d: $ty![-12, -11, -7, 18, 19, 23] = c.sort();
                let e: $ty![-12, -11, -7, 18, 19, 23] = c.normalize();

                assert_eq!(d.inner(), 18);
                assert_eq!(e.inner(), 18);
            }
            {
                let a: $ty![11, 11, 11] = $ty::new(11).unwrap();
                let b: $ty![2, -3]      = $ty::new(-3).unwrap();

                let c: $ty! [5, -3,  5, -3, 5, -3] = a / b;
                let d: $ty![-3, -3, -3,  5, 5,  5] = c.sort();
                let e: $ty![-3,  5            ] = c.normalize();

                assert_eq!(d.inner(), -3);
                assert_eq!(e.inner(), -3);
            }
            {
                use $module::Range;

                assert_eq!(Range![ -3..2   ], &[-3, -2, -1, 0, 1   ]);
                assert_eq!(Range![ -3..=2  ], &[-3, -2, -1, 0, 1, 2]);
            }
        )+};
    }

    #[rustfmt::skip]
    unsigned!(
        [SureU8, sure_u8], [SureU16, sure_u16], [SureU32, sure_u32], [SureU64, sure_u64], [SureU128, sure_u128], [SureUsize, sure_usize],
        [SureI8, sure_i8], [SureI16, sure_i16], [SureI32, sure_i32], [SureI64, sure_i64], [SureI128, sure_i128], [SureIsize, sure_isize]
    );

    #[rustfmt::skip]
    signed!(
        [SureI8, sure_i8], [SureI16, sure_i16], [SureI32, sure_i32], [SureI64, sure_i64], [SureI128, sure_i128], [SureIsize, sure_isize]
    );
}

#[test]
fn onion() {
    use sure_u32::Range;
    use sure_u32::Union;

    let _r1: SureU32![Union![Range![0..=2], Range![4..=5]]] =
        <SureU32![0, 1, 2, 4, 5]>::new(2).unwrap();
}

#[test]
fn onion2() {
    use sure_u32::Range;
    use sure_u32::Union;

    let _r1: SureU32![Union![Range![0..=2], Range![4..=5]]] =
        <SureU32![0, 1, 2, 4, 5]>::new(2).unwrap();
}

#[test]
fn all_ranges() {
    use sure_i8::Range;

    assert_eq!(Range![-3..2], &[-3, -2, -1, 0, 1]);
    assert_eq!(Range![125..], &[125, 126, 127]);
    assert_eq!(Range![-3..=2], &[-3, -2, -1, 0, 1, 2]);
    assert_eq!(Range![..-125], &[-128, -127, -126]);
    assert_eq!(Range![..=-125], &[-128, -127, -126, -125]);
}

#[test]
fn intersections() {
    use set::SORT;
    use sure_i8::Intersection;
    use sure_i8::Range;

    // Intersection on one set should be the identity
    assert_eq!(Intersection![Range![-3..27]], Range![-3..27]);

    // Intersection of one set with itself should be the identity
    assert_eq!(
        Intersection![Range![-3..27], Range![-3..27],],
        Range![-3..27]
    );

    // Intersection with the "full" set should be the identity
    assert_eq!(
        Intersection![Range![-3..27], Range![-128..=127]],
        Range![-3..27]
    );

    assert_eq!(
        SORT::<i8, { Intersection![Range![1..=20], Range![10..=30]] }>,
        Range![10..=20]
    );

    assert_eq!(
        SORT::<i8, { Intersection![Range![10..=50], Range![20..=100], Range![30..=40]] }>,
        Range![30..=40]
    );
}

#[test]
fn widen() {
    // {5} is a subset of 5
    let _: SureU32<{ &[5] }> = <SureU32![5]>::new(5).unwrap().widen();

    // {4} is a subset of {1, 2, 3}
    let _: SureU32![1, 2, 3] = <SureU32![3]>::new(3).unwrap().widen();

    // {6, 4} is a subset of {3, 4, 5, 6}
    let _: SureU32![3, 4, 5, 6] = <SureU32![6, 4]>::new(6).unwrap().widen();

    // {4, 4, 4} is a subset of {4}, for now? subject to change?
    let _: SureU32<{ &[4] }> = <SureU32![4, 4, 4]>::new(4).unwrap().widen();
}

#[test]
fn cast() {
    let _: SureU32<{ &[5] }> = <SureU32![1, 5]>::new(5).unwrap().cast().unwrap();

    let _: SureU32![1, 2, 3] = <SureU32![1, 2, 5]>::new(2).unwrap().cast().unwrap();

    let _: SureU32![1, 2] = <SureU32![1, 2, 3]>::new(2).unwrap().cast().unwrap();

    // let _: SureU32![1, 2] = <SureU32![3, 4]>::new(4).unwrap().cast().unwrap();
}

#[test]
fn generic() {
    use sure::base::Sure;

    let a: Sure<u8, { &[5, 4] }> = Sure::new(5).unwrap();
    let b: Sure<u8, { &[1, 2] }> = Sure::new(2).unwrap();

    let _c: Sure<u8, { &[5, 6, 7] }> = (b + a).normalize();

    let x: Sure<isize, { &[5, 4] }> = Sure::new(5).unwrap();
    let y: Sure<isize, { &[1, 2] }> = Sure::new(2).unwrap();

    let _z: Sure<isize, { &[4, 5, 8, 10] }> = (x * y).normalize();
}

#[test]
fn generic2() {
    use sure::base::Sure;
    use sure::sure_u16::Range;

    const {
        let a: Sure<u16, { Range![1..=4] }> = Sure::new(4).ok().unwrap();
        let b: Sure<u16, { Range![2..=6] }> = Sure::new(2).ok().unwrap();

        let _c: Sure<u16, { Range![3..=10] }> = a.wrapping_add(b).normalize();
        let _d = a.isqrt();
    }
}

#[test]
fn to_as() {
    use sure::base::Sure;
    use sure::sure_i8::Range as RangeI8;
    use sure::sure_i8::Union;
    use sure::sure_u16::Range as RangeU16;

    let a: SureU16![RangeU16![1..=130]] = Sure::new(4).unwrap();
    let _b: SureI8![Union![&[-128, -127, -126], RangeI8![1..=127]]] = a.as_i8().normalize();

    let c: SureU16![RangeU16![1..=5]] = Sure::new(2).unwrap();
    let _d: SureI8![RangeI8![1..=5]] = c.to_i8();
}

#[test]
fn to_nonzero() {
    use sure::base::Sure;
    let set_not_zero: SureI32![1, 2, 3] = Sure::new(1).unwrap();
    let _real_non_zero: core::num::NonZeroI32 = set_not_zero.to_non_zero();
}