anodized-logic 0.5.1

Helps Anodized embed non-trivial elements of logic into Rust code
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

use num_bigint::BigInt;

#[allow(non_camel_case_types)]
#[derive(Debug, Clone, Eq, PartialEq, Ord, PartialOrd)]
#[repr(transparent)]
pub struct int(BigInt);

mod interop;
use interop::impl_primitive_interop;

pub trait Primitive: Copy {}

impl_primitive_interop!(i8);
impl_primitive_interop!(i16);
impl_primitive_interop!(i32);
impl_primitive_interop!(i64);
impl_primitive_interop!(i128);
impl_primitive_interop!(isize);

impl_primitive_interop!(u8);
impl_primitive_interop!(u16);
impl_primitive_interop!(u32);
impl_primitive_interop!(u64);
impl_primitive_interop!(u128);
impl_primitive_interop!(usize);

impl ::core::ops::Add<int> for int {
    type Output = int;

    #[inline]
    fn add(self, rhs: int) -> int {
        int(self.0 + rhs.0)
    }
}

impl ::core::ops::Sub<int> for int {
    type Output = int;

    #[inline]
    fn sub(self, rhs: int) -> int {
        int(self.0 - rhs.0)
    }
}

impl ::core::ops::Mul<int> for int {
    type Output = int;

    #[inline]
    fn mul(self, rhs: int) -> int {
        int(self.0 * rhs.0)
    }
}

impl ::core::ops::Div<int> for int {
    type Output = int;

    #[inline]
    fn div(self, rhs: int) -> int {
        int(self.0 / rhs.0)
    }
}

impl ::core::ops::Rem<int> for int {
    type Output = int;

    #[inline]
    fn rem(self, rhs: int) -> int {
        int(self.0 % rhs.0)
    }
}