mod generated; use itertools::Itertools; use smol_str::SmolStr; use { SyntaxNodeRef, SyntaxKind::*, }; pub use self::generated::*; pub trait AstNode<'a>: Clone + Copy + 'a { fn cast(syntax: SyntaxNodeRef<'a>) -> Option where Self: Sized; fn syntax(self) -> SyntaxNodeRef<'a>; } pub trait NameOwner<'a>: AstNode<'a> { fn name(self) -> Option> { child_opt(self) } } pub trait LoopBodyOwner<'a>: AstNode<'a> { fn loop_body(self) -> Option> { child_opt(self) } } pub trait TypeParamsOwner<'a>: AstNode<'a> { fn type_param_list(self) -> Option> { child_opt(self) } fn where_clause(self) -> Option> { child_opt(self) } } pub trait AttrsOwner<'a>: AstNode<'a> { fn attrs(self) -> Box> + 'a> { Box::new(children(self)) } } impl<'a> FnDef<'a> { pub fn has_atom_attr(&self, atom: &str) -> bool { self.attrs() .filter_map(|x| x.as_atom()) .any(|x| x == atom) } } impl<'a> Attr<'a> { pub fn as_atom(&self) -> Option { let tt = self.value()?; let (_bra, attr, _ket) = tt.syntax().children().collect_tuple()?; if attr.kind() == IDENT { Some(attr.leaf_text().unwrap()) } else { None } } pub fn as_call(&self) -> Option<(SmolStr, TokenTree<'a>)> { let tt = self.value()?; let (_bra, attr, args, _ket) = tt.syntax().children().collect_tuple()?; let args = TokenTree::cast(args)?; if attr.kind() == IDENT { Some((attr.leaf_text().unwrap(), args)) } else { None } } } impl<'a> Lifetime<'a> { pub fn text(&self) -> SmolStr { self.syntax().leaf_text().unwrap() } } impl<'a> Name<'a> { pub fn text(&self) -> SmolStr { let ident = self.syntax().first_child() .unwrap(); ident.leaf_text().unwrap() } } impl<'a> NameRef<'a> { pub fn text(&self) -> SmolStr { let ident = self.syntax().first_child() .unwrap(); ident.leaf_text().unwrap() } } impl<'a> ImplItem<'a> { pub fn target_type(self) -> Option> { match self.target() { (Some(t), None) | (_, Some(t)) => Some(t), _ => None, } } pub fn target_trait(self) -> Option> { match self.target() { (Some(t), Some(_)) => Some(t), _ => None, } } fn target(self) -> (Option>, Option>) { let mut types = children(self); let first = types.next(); let second = types.next(); (first, second) } } impl<'a> Module<'a> { pub fn has_semi(self) -> bool { match self.syntax().last_child() { None => false, Some(node) => node.kind() == SEMI, } } } impl<'a> LetStmt<'a> { pub fn has_semi(self) -> bool { match self.syntax().last_child() { None => false, Some(node) => node.kind() == SEMI, } } } impl<'a> IfExpr<'a> { pub fn then_branch(self) -> Option> { self.blocks().nth(0) } pub fn else_branch(self) -> Option> { self.blocks().nth(1) } fn blocks(self) -> impl Iterator> { children(self) } } fn child_opt<'a, P: AstNode<'a>, C: AstNode<'a>>(parent: P) -> Option { children(parent).next() } fn children<'a, P: AstNode<'a>, C: AstNode<'a>>(parent: P) -> impl Iterator + 'a { parent.syntax() .children() .filter_map(C::cast) }