Home
last modified time | relevance | path

Searched refs:PatWild (Results 1 – 10 of 10) sorted by relevance

/linux/rust/syn/
H A Dpat.rs84 Wild(PatWild),
220 pub struct PatWild {
254 PatTuple, PatTupleStruct, PatType, PatWild,
458 fn pat_wild(input: ParseStream) -> Result<PatWild> { in pat_wild() argument
459 Ok(PatWild { in pat_wild()
814 PatTuple, PatTupleStruct, PatType, PatWild,
939 impl ToTokens for PatWild { implementation
H A Dlib.rs488 PatReference, PatRest, PatSlice, PatStruct, PatTuple, PatTupleStruct, PatType, PatWild,
H A Ditem.rs929 use crate::pat::{Pat, PatType, PatWild};
1621 pat: Box::new(Pat::Wild(PatWild { in parse_fn_arg_or_variadic()
/linux/rust/syn/gen/
H A Dfold.rs725 fn fold_pat_wild(&mut self, i: crate::PatWild) -> crate::PatWild { in fold_pat_wild() argument
3091 pub fn fold_pat_wild<F>(f: &mut F, node: crate::PatWild) -> crate::PatWild in fold_pat_wild()
3095 crate::PatWild { in fold_pat_wild()
H A Dclone.rs1636 impl Clone for crate::PatWild { implementation
1638 crate::PatWild { in clone()
H A Deq.rs1612 impl Eq for crate::PatWild {} implementation
1615 impl PartialEq for crate::PatWild { implementation
H A Ddebug.rs2374 impl Debug for crate::PatWild { implementation
2380 impl crate::PatWild { implementation
H A Dvisit_mut.rs690 fn visit_pat_wild_mut(&mut self, i: &mut crate::PatWild) { in visit_pat_wild_mut() argument
2993 pub fn visit_pat_wild_mut<V>(v: &mut V, node: &mut crate::PatWild) in visit_pat_wild_mut()
H A Dvisit.rs682 fn visit_pat_wild(&mut self, i: &'ast crate::PatWild) { in visit_pat_wild() argument
3152 pub fn visit_pat_wild<'ast, V>(v: &mut V, node: &'ast crate::PatWild) in visit_pat_wild()
H A Dhash.rs2075 impl Hash for crate::PatWild { implementation