macroonz-compiler 0.2.0

Deterministic Rust code generation for procedural macros: plan, render, close, explain, and bind one sealed expansion from declared input.
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

//! Conventional Rust projections over informed bounded values.
//!
//! The informed values own membership and order, while the caller owns every token written for one row and every item surrounding the returned expression.

use super::compose::{comma_many, group};
use super::{GENERATED_TOKEN_LIMIT, GeneratedDelimiter, GeneratedRowRefusal, GeneratedToken};
use crate::bounded::{KeyedRoster, KeyedRosterAssignment, NonEmpty, NonEmptyError, Overflow};

/// Projects one keyed roster into a borrowed Rust slice expression in retained order.
///
/// The caller supplies every row's tokens and remains responsible for any item name, visibility, element type, and semantic body surrounding the expression.
///
/// # Errors
///
/// Returns the first [`Overflow`] produced by the row projection or by the completed bracket group.
pub fn keyed_roster_slice<T, K, const N: usize>(
    roster: &KeyedRoster<T, K, N>,
    mut row: impl FnMut(usize, &K, &T) -> Result<Vec<GeneratedToken>, Overflow>,
) -> Result<Vec<GeneratedToken>, Overflow> {
    let rows = roster
        .indexed()
        .map(|(index, key, member)| row(index, key, member))
        .collect::<Result<Vec<_>, _>>()?;
    borrowed_slice(rows)
}

/// Projects one keyed roster into a flat item run in retained order.
///
/// The caller supplies every row's complete tokens and remains responsible for the meaning of each item.
///
/// # Errors
///
/// Returns the first [`GeneratedRowRefusal`] where a callback refuses, emits no token, or emits more than the generated-token magnitude.
pub fn keyed_roster_items<T, K, const N: usize>(
    roster: &KeyedRoster<T, K, N>,
    mut row: impl FnMut(usize, &K, &T) -> Result<Vec<GeneratedToken>, Overflow>,
) -> Result<Vec<GeneratedToken>, GeneratedRowRefusal> {
    let mut items = Vec::new();
    for (index, key, member) in roster.indexed() {
        let row = row(index, key, member)
            .map_err(|cause| GeneratedRowRefusal::at(index, NonEmptyError::Overflow(cause)))?;
        let row = NonEmpty::<GeneratedToken, GENERATED_TOKEN_LIMIT>::new(row)
            .map_err(|cause| GeneratedRowRefusal::at(index, cause))?;
        items.extend(row.iter().cloned());
    }
    Ok(items)
}

/// Projects one exact keyed assignment into a borrowed Rust slice expression in denominator order.
///
/// The caller supplies every row's tokens and remains responsible for any item name, visibility, element type, payload meaning, and semantic body surrounding the expression.
///
/// # Errors
///
/// Returns the first [`Overflow`] produced by the row projection or by the completed bracket group.
pub fn keyed_assignment_slice<D, K, P, S, const N: usize>(
    assignment: &KeyedRosterAssignment<D, K, P, S, N>,
    mut row: impl FnMut(usize, &K, &D, &S, &P) -> Result<Vec<GeneratedToken>, Overflow>,
) -> Result<Vec<GeneratedToken>, Overflow> {
    let rows = assignment
        .indexed()
        .map(|(index, key, member, seat, payload)| row(index, key, member, seat, payload))
        .collect::<Result<Vec<_>, _>>()?;
    borrowed_slice(rows)
}

/// Projects one exact keyed assignment into a flat item run in denominator order.
///
/// The caller supplies every row's complete tokens and remains responsible for the meaning of each item.
///
/// # Errors
///
/// Returns the first [`GeneratedRowRefusal`] where a callback refuses, emits no token, or emits more than the generated-token magnitude.
pub fn keyed_assignment_items<D, K, P, S, const N: usize>(
    assignment: &KeyedRosterAssignment<D, K, P, S, N>,
    mut row: impl FnMut(usize, &K, &D, &S, &P) -> Result<Vec<GeneratedToken>, Overflow>,
) -> Result<Vec<GeneratedToken>, GeneratedRowRefusal> {
    let mut items = Vec::new();
    for (index, key, member, seat, payload) in assignment.indexed() {
        let row = row(index, key, member, seat, payload)
            .map_err(|cause| GeneratedRowRefusal::at(index, NonEmptyError::Overflow(cause)))?;
        let row = NonEmpty::<GeneratedToken, GENERATED_TOKEN_LIMIT>::new(row)
            .map_err(|cause| GeneratedRowRefusal::at(index, cause))?;
        items.extend(row.iter().cloned());
    }
    Ok(items)
}

/// Writes `&[rows]` without changing the rows or their order.
fn borrowed_slice(rows: Vec<Vec<GeneratedToken>>) -> Result<Vec<GeneratedToken>, Overflow> {
    Ok(vec![
        GeneratedToken::alone('&'),
        group(GeneratedDelimiter::Bracket, comma_many(rows))?,
    ])
}