mpstthree 0.1.17

A library implementing Multiparty Session Types for 2 or more participants
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

#![allow(clippy::type_complexity, dead_code)]

use mpstthree::binary::close::close;
use mpstthree::binary::fork::fork_with_thread_id;
use mpstthree::binary::recv::recv;
use mpstthree::binary::send::send;
use mpstthree::binary::struct_trait::{end::End, recv::Recv, session::Session};
use mpstthree::{choose, offer};

use std::error::Error;
use std::thread::spawn;

// S
enum Binary0A {
    Success(Recv<(), Recv<(), Offer1A>>),
    // Not used
    Failure(Recv<(), Recv<(), End>>),
}
enum Binary1A {
    Continue(Recv<(), Offer1A>),
    Quit(Recv<(), End>),
}
type Rec0A = Recv<Binary0A, End>;
type Rec1A = Recv<Binary1A, End>;
type Offer1A = Recv<(), Rec1A>;
type FullA = Recv<(), Rec0A>;

fn binary_a(s: FullA) -> Result<(), Box<dyn Error>> {
    let (_hard_ping, s) = recv(s)?;

    recurs_0_a(s)
}

fn recurs_0_a(s: Rec0A) -> Result<(), Box<dyn Error>> {
    offer!(s, {
        Binary0A::Success(s) => {
            let (_login_ok_c, s) = recv(s)?;
            let (_login_ok_s, s) = recv(s)?;
            recurs_1_a(s)
        },
        Binary0A::Failure(s) => {
            let (_login_fail_c, s) = recv(s)?;
            let (_login_fail_s, s) = recv(s)?;
            close(s)
        },
    })
}

fn recurs_1_a(s: Offer1A) -> Result<(), Box<dyn Error>> {
    let (_account, s) = recv(s)?;

    offer!(s, {
        Binary1A::Continue(s) => {
            let (_pay, s) = recv(s)?;
            recurs_1_a(s)
        },
        Binary1A::Quit(s) => {
            let (_quit, s) = recv(s)?;
            close(s)
        },
    })
}

// C
type Choice1B = <Offer1A as Session>::Dual;
type FullB = <FullA as Session>::Dual;

fn binary_success_pay_b(s: Choice1B) -> Result<Choice1B, Box<dyn Error>> {
    let s = send((), s);
    let s = choose!(Binary1A::Continue, s);
    let s = send((), s);
    Ok(s)
}

fn binary_success_quit_b(s: Choice1B) -> Result<(), Box<dyn Error>> {
    let s = send((), s);
    let s = choose!(Binary1A::Quit, s);
    let s = send((), s);
    close(s)
}

// Not used
fn binary_quit_b(s: FullB) -> Result<(), Box<dyn Error>> {
    let s = send((), s);
    let s = choose!(Binary0A::Failure, s);
    let s = send((), s);
    let s = send((), s);
    close(s)
}

fn main() {
    let mut threads = Vec::new();
    let mut sessions = Vec::new();

    let (thread, session) = fork_with_thread_id(binary_a);

    let session = send((), session);
    let session = choose!(Binary0A::Success, session);
    let session = send((), session);
    let session = send((), session);

    threads.push(thread);
    sessions.push(session);

    let main = spawn(move || {
        for _ in 0..LOOPS {
            sessions = sessions
                .into_iter()
                .map(|s| binary_success_pay_b(s).unwrap())
                .collect::<Vec<_>>();
        }

        sessions
            .into_iter()
            .for_each(|s| binary_success_quit_b(s).unwrap());

        threads.into_iter().for_each(|elt| elt.join().unwrap());
    });

    main.join().unwrap();
}

static LOOPS: i32 = 100;