cuicui_chirp 0.12.0

A file format based on cuicui_dsl to describe bevy UIs
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

use std::marker::PhantomData;

use winnow::stream::Stream;
use winnow::{error::ErrMode, Parser};

use super::{AddNodes, BlockResult, Error};
use crate::parser::ast::AstBuilder;
use crate::parser::stream::{tokens, Input, Token};

pub(super) struct Delimited<T, P1, P2>(PhantomData<(T, P1, P2)>);
impl<T: AddNodes, P1, P2> AddNodes for Delimited<T, P1, P2>
where
    for<'i> P1: Default + Parser<Input<'i>, Token<'i>, Error>,
    for<'i> P2: Default + Parser<Input<'i>, Token<'i>, Error>,
{
    fn add_node(input: &mut Input, builder: &mut AstBuilder) -> BlockResult {
        P1::default().parse_next(input)?;
        let builder = T::add_node(input, builder)?;
        P2::default().parse_next(input)?;
        Ok(builder)
    }
}

pub(super) struct Terminated<T, P>(PhantomData<(T, P)>);
impl<T: AddNodes, P> AddNodes for Terminated<T, P>
where
    for<'i> P: Default + Parser<Input<'i>, Token<'i>, Error>,
{
    fn add_node(input: &mut Input, builder: &mut AstBuilder) -> BlockResult {
        let builder = T::add_node(input, builder)?;
        P::default().parse_next(input)?;
        Ok(builder)
    }
}

pub(super) struct SepList<T>(PhantomData<T>);
impl<T: AddNodes> AddNodes for SepList<T> {
    fn add_node(input: &mut Input, builder: &mut AstBuilder) -> BlockResult {
        let start = input.checkpoint();
        let mut count = match T::add_node(input, builder) {
            Err(ErrMode::Backtrack(_)) => {
                input.reset(start);
                return Ok(0);
            }
            Err(e) => return Err(e),
            Ok(count) => count,
        };
        loop {
            let start = input.checkpoint();
            let len = input.eof_offset();
            match tokens::Comma.parse_next(input) {
                Err(ErrMode::Backtrack(_)) => {
                    input.reset(start);
                    return Ok(count);
                }
                Err(e) => return Err(e),
                Ok(_) if input.eof_offset() == len => panic!("Infinite loop in parser"),
                Ok(_) => {}
            }
            match T::add_node(input, builder) {
                Err(ErrMode::Backtrack(_)) => {
                    input.reset(start);
                    return Ok(count);
                }
                Err(e) => return Err(e),
                Ok(incr) => count += incr,
            }
        }
    }
}

pub(super) struct Many<T>(PhantomData<T>);
impl<T: AddNodes> AddNodes for Many<T> {
    fn add_node(input: &mut Input, builder: &mut AstBuilder) -> BlockResult {
        let mut count = 0;
        loop {
            let start = input.checkpoint();
            let len = input.eof_offset();
            match T::add_node(input, builder) {
                Err(ErrMode::Backtrack(_)) => {
                    input.reset(start);
                    return Ok(count);
                }
                Err(e) => return Err(e),
                Ok(_) if input.eof_offset() == len => panic!("Infinite loop in parser"),
                Ok(incr) => count += incr,
            }
        }
    }
}

impl<T: AddNodes> AddNodes for Option<T> {
    fn add_node(input: &mut Input, builder: &mut AstBuilder) -> BlockResult {
        let start = input.checkpoint();
        match T::add_node(input, builder) {
            Ok(o) => Ok(o),
            Err(ErrMode::Backtrack(_)) => {
                input.reset(start);
                Ok(0)
            }
            Err(e) => Err(e),
        }
    }
}