bisync_macros 0.2.3

macro implementations for the bisync crate
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

//! Do not use this crate directly.

use proc_macro::{Group, TokenStream};

#[proc_macro_attribute]
pub fn internal_noop(_attr: TokenStream, item: TokenStream) -> TokenStream {
    item
}

#[proc_macro_attribute]
pub fn internal_delete(_attr: TokenStream, _item: TokenStream) -> TokenStream {
    TokenStream::new()
}

#[proc_macro_attribute]
pub fn internal_strip_async(attr: TokenStream, item: TokenStream) -> TokenStream {
    use proc_macro::TokenTree;

    let mut new = Vec::new();
    let tokens: Vec<TokenTree> = item.into_iter().collect();
    let mut i = 0;

    while i < tokens.len() {
        match &tokens[i] {
            TokenTree::Group(group) => {
                let new_inner = internal_strip_async(attr.clone(), group.stream());
                let mut new_group = Group::new(group.delimiter(), new_inner);
                new_group.set_span(group.span());
                new.push(TokenTree::Group(new_group));
            }
            TokenTree::Ident(ident) => {
                if ident.to_string() == "async" {
                    if i + 1 < tokens.len() && tokens[i + 1].to_string() == "move" {
                        i += 1;
                    }
                } else {
                    new.push(tokens[i].clone());
                }
            }
            TokenTree::Punct(punct) => {
                if punct.as_char() == '.'
                    && i + 1 < tokens.len()
                    && tokens[i + 1].to_string() == "await"
                {
                    i += 2;
                    continue;
                } else {
                    new.push(tokens[i].clone());
                }
            }
            TokenTree::Literal(..) => new.push(tokens[i].clone()),
        }
        i += 1;
    }

    new.into_iter().collect()
}