exclusive-choice 0.1.0

An implementation of affine addative conjunction in the rust type system.
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
127
128
129
130
131
132
133
134
135
136
137
138
139

//! Derivative Choice types from helper methods.
use super::*;

#[derive(Debug, PartialEq, Eq, Hash, Clone, Copy)]
pub struct LeftFilterIter<I, A, B> {
    pub(super) iter: I,
    pub(super) _l: std::marker::PhantomData<A>,
    pub(super) _r: std::marker::PhantomData<B>,
}

impl<I: Iterator<Item = Either<A, B>>, A, B> Iterator for LeftFilterIter<I, A, B> {
    type Item = A;

    fn next(&mut self) -> Option<A> {
        loop {
            match self.iter.next() {
                Some(Either::Left(a)) => break Some(a),
                Some(Either::Right(_)) => continue,
                None => break None,
            }
        }
    }
}

#[derive(Debug, PartialEq, Eq, Hash, Clone, Copy)]
pub struct RightFilterIter<I, A, B> {
    pub(super) iter: I,
    pub(super) _l: std::marker::PhantomData<A>,
    pub(super) _r: std::marker::PhantomData<B>,
}

impl<I: Iterator<Item = Either<A, B>>, A, B> Iterator for RightFilterIter<I, A, B> {
    type Item = B;

    fn next(&mut self) -> Option<B> {
        loop {
            match self.iter.next() {
                Some(Either::Left(_)) => continue,
                Some(Either::Right(b)) => break Some(b),
                None => break None,
            }
        }
    }
}

#[derive(Debug, PartialEq, Eq, Hash, Clone, Copy)]
pub struct Swap<T> {
    pub(super) choice: T,
}

impl<T: Choice> DynChoice for Swap<T> {
    type Left = T::Right;
    type Right = T::Left;

    fn into_left(self: Box<Self>) -> T::Right {
        self.choice.right()
    }

    fn into_right(self: Box<Self>) -> T::Left {
        self.choice.left()
    }
}

#[derive(Debug, PartialEq, Eq, Hash, Clone, Copy)]
pub struct ChooseMap<T, U> {
    pub(super) choice: T,
    pub(super) other: U,
}

impl<T: Choice, U: Choice, C, D> DynChoice for ChooseMap<T, U>
where
    U::Left: FnOnce(T::Left) -> C,
    U::Right: FnOnce(T::Right) -> D,
{
    type Left = C;
    type Right = D;

    fn into_left(self: Box<Self>) -> C {
        (self.other.left())(self.choice.left())
    }

    fn into_right(self: Box<Self>) -> D {
        (self.other.right())(self.choice.right())
    }
}

#[derive(Debug, PartialEq, Eq, Hash, Clone, Copy)]
pub struct LeftCoBind<T, F> {
    pub(super) choice: T,
    pub(super) cobind: F,
}

impl<T: Choice, C, F: FnOnce(T) -> C> DynChoice for LeftCoBind<T, F> {
    type Left = C;
    type Right = T::Right;

    fn into_left(self: Box<Self>) -> C {
        (self.cobind)(self.choice)
    }

    fn into_right(self: Box<Self>) -> T::Right {
        self.choice.right()
    }
}

#[derive(Debug, PartialEq, Eq, Hash, Clone, Copy)]
pub struct RightCoBind<T, F> {
    pub(super) choice: T,
    pub(super) cobind: F,
}

impl<T: Choice, C, F: FnOnce(T) -> C> DynChoice for RightCoBind<T, F> {
    type Left = T::Left;
    type Right = C;

    fn into_left(self: Box<Self>) -> T::Left {
        self.choice.left()
    }

    fn into_right(self: Box<Self>) -> C {
        (self.cobind)(self.choice)
    }
}

use impl_trait_for_tuples::*;

#[impl_for_tuples(0, 16)]
impl DynChoice for Tuple {
    for_tuples!( type Left = ( #( Tuple::Left ),* ); );
    for_tuples!( type Right = ( #( Tuple::Right ),* ); );

    fn into_left(self: Box<Self>) -> Self::Left {
        for_tuples!( ( #( self.Tuple.left() ),* ) )
    }

    fn into_right(self: Box<Self>) -> Self::Right {
        for_tuples!( ( #( self.Tuple.right() ),* ) )
    }
}