knave-expand 0.13.2

The reading, scoping and expansion stages of knave
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

use std::ops::Range;

use super::Forms;
use crate::diagnostic::Diagnostic;
use crate::interpret::arguments::Arguments;
use crate::interpret::problems::InterpretProblems;
use crate::interpret::{CodeList, NestedTooDeep, Value};
use crate::source::Span;

pub struct ListOperations<'a> {
    arguments: &'a Arguments,
    call_site: Span,
}

impl<'a> ListOperations<'a> {
    pub fn new(arguments: &'a Arguments, call_site: Span) -> Self {
        Self {
            arguments,
            call_site,
        }
    }

    pub fn first(&self) -> Result<Value, Diagnostic> {
        self.arguments.expect_count(1)?;
        self.item(&self.arguments.list(0)?, 0)
    }

    pub fn rest(&self) -> Result<Value, Diagnostic> {
        self.arguments.expect_count(1)?;
        self.dropped(&self.arguments.list(0)?, 1)
    }

    pub fn list(&self) -> Result<Value, Diagnostic> {
        let values = (0..self.arguments.values().len())
            .map(|index| self.arguments.code(index))
            .collect::<Result<Vec<Value>, Diagnostic>>()?;
        self.built(CodeList::new(values, self.call_site))
    }

    pub fn prepend(&self) -> Result<Value, Diagnostic> {
        self.arguments.expect_count(2)?;
        let item = self.arguments.code(0)?;
        let items = self.arguments.list(1)?;
        self.built(items.prepended(item, self.call_site))
    }

    pub fn concat(&self) -> Result<Value, Diagnostic> {
        let lists = (0..self.arguments.values().len())
            .map(|index| self.arguments.list(index))
            .collect::<Result<Vec<CodeList>, Diagnostic>>()?;
        let Some((head, tail)) = lists.split_first() else {
            return self.built(CodeList::new(Vec::new(), self.call_site));
        };
        let extra = tail.iter().flat_map(CodeList::values).collect();
        self.built(head.appended(extra, self.call_site))
    }

    pub fn len(&self) -> Result<Value, Diagnostic> {
        self.arguments.expect_count(1)?;
        Ok(Forms::count(self.arguments.list(0)?.len(), self.call_site))
    }

    pub fn is_empty(&self) -> Result<Value, Diagnostic> {
        self.arguments.expect_count(1)?;
        Ok(Value::Bool(self.arguments.list(0)?.is_empty()))
    }

    pub fn nth(&self) -> Result<Value, Diagnostic> {
        self.arguments.expect_count(2)?;
        let items = self.arguments.list(0)?;
        self.item(&items, self.arguments.index(1)?)
    }

    pub fn take(&self) -> Result<Value, Diagnostic> {
        self.arguments.expect_count(2)?;
        let items = self.arguments.list(0)?;
        let count = self.arguments.index(1)?;
        self.sliced(&items, 0..count)
    }

    pub fn drop(&self) -> Result<Value, Diagnostic> {
        self.arguments.expect_count(2)?;
        let count = self.arguments.index(1)?;
        self.dropped(&self.arguments.list(0)?, count)
    }

    fn built(&self, list: Result<CodeList, NestedTooDeep>) -> Result<Value, Diagnostic> {
        list.map(Value::List)
            .map_err(|deep| deep.at(self.arguments.span()))
    }

    fn item(&self, items: &CodeList, index: usize) -> Result<Value, Diagnostic> {
        items.get(index).ok_or_else(|| self.out_of_range())
    }

    fn dropped(&self, items: &CodeList, count: usize) -> Result<Value, Diagnostic> {
        self.sliced(items, count..items.len())
    }

    fn sliced(&self, items: &CodeList, range: Range<usize>) -> Result<Value, Diagnostic> {
        items
            .slice(range, self.call_site)
            .map(Value::List)
            .ok_or_else(|| self.out_of_range())
    }

    fn out_of_range(&self) -> Diagnostic {
        InterpretProblems::out_of_range(self.arguments.function(), self.arguments.span())
    }
}