pub fn ident_eq(tident: &TokenTree, id: Ident) -> bool {
    let tid = match *tident {
        TokenTree::Token(_, Token::Ident(ref id)) => id,
        _ => {
            return false;
        }
    };

    tid.name == id.name
}
/// Checks if two identifiers have the same name, disregarding context. This allows us to
/// fake 'reserved' keywords.
// FIXME We really want `free-identifier-=?` (a la Dybvig 1993). von Tander 2007 is
// probably the easiest way to do that.
Checks if two identifiers have the same name, disregarding context. This allows us to
fake 'reserved' keywords.
FIXME We really want `free-identifier-=?` (a la Dybvig 1993). von Tander 2007 is
probably the easiest way to do that.
Checks if two identifiers have the same name disregarding context . This allows us to fake ' reserved ' keywords . FIXME We really want ` free - identifier - = ? ` ( a la Dybvig 1993 ) . von Tander 2007 is probably the easiest way to do that .
pub fn ident_eq(tident: &TokenTree, id: Ident) -> bool {
    let tid = match *tident {
        TokenTree::Token(_, Token::Ident(ref id)) => id,
        _ => {
            return false;
        }
    };
    tid.name == id.name
}
pub fn ident_eq ( tident : & TokenTree , id : Ident ) -> bool { let tid = match * tident { TokenTree :: Token ( _ , Token :: Ident ( ref id ) ) => id , _ => { return false ; } } ; tid . name == id . name }
Checks if two identifiers have the same name, disregarding context.
Checks if two identifiers have the same name disregarding context .
tident
&TokenTree
id
Ident
tident
&TokenTree
id
Ident