knave 0.13.3

A Lisp programming language for humans and agents that infers types and ownership and compiles to readable Rust
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161

use std::rc::Rc;

use rustc_hash::FxHashMap;

use crate::core::BindingId;
use crate::source::Span;

#[derive(Clone)]
pub enum MoveSite {
    Whole(Span),
    Field { span: Span, place: Rc<str> },
}

impl MoveSite {
    pub fn span(&self) -> Span {
        match self {
            Self::Whole(span) | Self::Field { span, .. } => *span,
        }
    }

    pub fn moved_place<'a>(&'a self, name: &'a str) -> &'a str {
        match self {
            Self::Whole(_) => name,
            Self::Field { place, .. } => place,
        }
    }
}

pub type FieldPath = Vec<Rc<str>>;

#[derive(Clone)]
enum MovedValue {
    Whole(Span),
    Fields(Vec<MovedField>),
}

#[derive(Clone)]
struct MovedField {
    path: FieldPath,
    site: MoveSite,
}

#[derive(Clone, Default)]
pub struct MovedValues {
    values: FxHashMap<BindingId, MovedValue>,
}

impl MovedValues {
    pub fn site(&self, binding: BindingId) -> Option<MoveSite> {
        self.site_overlapping(binding, std::iter::empty())
    }

    pub fn site_overlapping<'p>(
        &self,
        binding: BindingId,
        read: impl Iterator<Item = &'p str> + Clone,
    ) -> Option<MoveSite> {
        self.values.get(&binding)?.site_overlapping(read)
    }

    pub fn move_whole(&mut self, binding: BindingId, span: Span) {
        self.values.insert(binding, MovedValue::Whole(span));
    }

    pub fn move_field(&mut self, binding: BindingId, path: FieldPath, site: MoveSite) {
        let moved = self
            .values
            .entry(binding)
            .or_insert_with(|| MovedValue::Fields(Vec::new()));
        moved.add_field(MovedField { path, site });
    }

    pub fn moved_since(&self, earlier: &MovedValues) -> MovedValues {
        let values = self
            .values
            .iter()
            .filter_map(|(binding, moved)| {
                let since = moved.moved_since(earlier.values.get(binding))?;
                Some((*binding, since))
            })
            .collect();
        MovedValues { values }
    }

    pub fn retain(&mut self, mut keep: impl FnMut(BindingId) -> bool) {
        self.values.retain(|binding, _| keep(*binding));
    }

    pub fn is_empty(&self) -> bool {
        self.values.is_empty()
    }

    pub fn merge(&mut self, other: MovedValues) {
        for (binding, moved) in other.values {
            match self.values.get_mut(&binding) {
                Some(existing) => existing.absorb(moved),
                None => {
                    self.values.insert(binding, moved);
                }
            }
        }
    }
}

impl MovedValue {
    fn site_overlapping<'p>(
        &self,
        read: impl Iterator<Item = &'p str> + Clone,
    ) -> Option<MoveSite> {
        match self {
            Self::Whole(span) => Some(MoveSite::Whole(*span)),
            Self::Fields(fields) => fields
                .iter()
                .find(|field| field.overlaps(read.clone()))
                .map(|field| field.site.clone()),
        }
    }

    fn add_field(&mut self, field: MovedField) {
        if let Self::Fields(fields) = self
            && !fields.iter().any(|moved| moved.path == field.path)
        {
            fields.push(field);
        }
    }

    fn moved_since(&self, earlier: Option<&MovedValue>) -> Option<MovedValue> {
        match (self, earlier) {
            (_, None) | (Self::Whole(_), Some(Self::Fields(_))) => Some(self.clone()),
            (_, Some(Self::Whole(_))) => None,
            (Self::Fields(fields), Some(Self::Fields(earlier))) => {
                Self::fields_moved_since(fields, earlier)
            }
        }
    }

    fn fields_moved_since(fields: &[MovedField], earlier: &[MovedField]) -> Option<MovedValue> {
        let since: Vec<MovedField> = fields
            .iter()
            .filter(|field| !earlier.iter().any(|moved| moved.path == field.path))
            .cloned()
            .collect();
        (!since.is_empty()).then_some(Self::Fields(since))
    }

    fn absorb(&mut self, other: MovedValue) {
        match other {
            Self::Whole(_) => *self = other,
            Self::Fields(fields) => fields.into_iter().for_each(|field| self.add_field(field)),
        }
    }
}

impl MovedField {
    fn overlaps<'p>(&self, read: impl Iterator<Item = &'p str>) -> bool {
        self.path
            .iter()
            .zip(read)
            .all(|(moved, read)| **moved == *read)
    }
}