airlang 0.23.0

Air is a minimalist and universal programming language.
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

use std::rc::Rc;

use super::ConstFn;
use super::FreeFn;
use crate::semantics::cfg::Cfg;
use crate::semantics::val::Val;
use crate::type_::ConstRef;
use crate::type_::Either;
use crate::type_::ref_::DynRef;

pub trait MutFn<Cfg, Ctx, I, O>: ConstFn<Cfg, Ctx, I, O> {
    fn mut_call(&self, cfg: &mut Cfg, ctx: &mut Ctx, input: I) -> O {
        self.const_call(cfg, ConstRef::new(ctx), input)
    }

    fn dyn_call(&self, cfg: &mut Cfg, ctx: DynRef<Ctx>, input: I) -> O {
        match ctx.into_either() {
            Either::This(ctx) => self.const_call(cfg, ctx, input),
            Either::That(ctx) => self.mut_call(cfg, ctx, input),
        }
    }

    fn opt_dyn_call(&self, cfg: &mut Cfg, ctx: Option<DynRef<Ctx>>, input: I) -> O {
        match ctx {
            Some(ctx) => self.dyn_call(cfg, ctx, input),
            None => self.free_call(cfg, input),
        }
    }
}

impl<Cfg, Ctx, I, O, T> MutFn<Cfg, Ctx, I, O> for &T
where T: MutFn<Cfg, Ctx, I, O>
{
    fn mut_call(&self, cfg: &mut Cfg, ctx: &mut Ctx, input: I) -> O {
        (**self).mut_call(cfg, ctx, input)
    }

    fn dyn_call(&self, cfg: &mut Cfg, ctx: DynRef<Ctx>, input: I) -> O {
        (**self).dyn_call(cfg, ctx, input)
    }

    fn opt_dyn_call(&self, cfg: &mut Cfg, ctx: Option<DynRef<Ctx>>, input: I) -> O {
        (**self).opt_dyn_call(cfg, ctx, input)
    }
}

impl<Cfg, Ctx, I, O, T> MutFn<Cfg, Ctx, I, O> for &mut T
where T: MutFn<Cfg, Ctx, I, O>
{
    fn mut_call(&self, cfg: &mut Cfg, ctx: &mut Ctx, input: I) -> O {
        (**self).mut_call(cfg, ctx, input)
    }

    fn dyn_call(&self, cfg: &mut Cfg, ctx: DynRef<Ctx>, input: I) -> O {
        (**self).dyn_call(cfg, ctx, input)
    }

    fn opt_dyn_call(&self, cfg: &mut Cfg, ctx: Option<DynRef<Ctx>>, input: I) -> O {
        (**self).opt_dyn_call(cfg, ctx, input)
    }
}

#[derive(Clone)]
pub struct MutPrimFunc {
    pub(crate) raw_input: bool,
    pub(crate) fn_: Rc<dyn MutFn<Cfg, Val, Val, Val>>,
}

impl FreeFn<Cfg, Val, Val> for MutPrimFunc {
    fn free_call(&self, cfg: &mut Cfg, input: Val) -> Val {
        self.fn_.free_call(cfg, input)
    }
}

impl ConstFn<Cfg, Val, Val, Val> for MutPrimFunc {
    fn const_call(&self, cfg: &mut Cfg, ctx: ConstRef<Val>, input: Val) -> Val {
        self.fn_.const_call(cfg, ctx, input)
    }
}

impl MutFn<Cfg, Val, Val, Val> for MutPrimFunc {
    fn mut_call(&self, cfg: &mut Cfg, ctx: &mut Val, input: Val) -> Val {
        self.fn_.mut_call(cfg, ctx, input)
    }
}

impl PartialEq for MutPrimFunc {
    fn eq(&self, other: &MutPrimFunc) -> bool {
        self.raw_input == other.raw_input && Rc::ptr_eq(&self.fn_, &other.fn_)
    }
}

impl Eq for MutPrimFunc {}