1208     use crate::precedence::Precedence;
1283             return parse_expr(input, expr, allow_struct, Precedence::MIN);  in parse_with_earlier_boundary_rule()
1293             return parse_expr(input, expr, allow_struct, Precedence::MIN);  in parse_with_earlier_boundary_rule()
1316         base: Precedence,  in parse_expr()  argument
1324                 let precedence = Precedence::of_binop(&op);  in parse_expr()
1328                 if precedence == Precedence::Assign {  in parse_expr()
1333                 if precedence == Precedence::Compare {  in parse_expr()
1335                         if Precedence::of_binop(&lhs.op) == Precedence::Compare {  in parse_expr()
1348             } else if Precedence::Assign >= base  in parse_expr()
1357                 let right = parse_binop_rhs(input, allow_struct, Precedence::Assign)?;  in parse_expr()
1364             } else if Precedence::Range >= base && input.peek(Token![..]) {  in parse_expr()
1373             } else if Precedence::Cast >= base && input.peek(Token![as]) {  in parse_expr()
1393     fn parse_expr(input: ParseStream, mut lhs: Expr, base: Precedence) -> Result<Expr> {  in parse_expr()
1397                 let precedence = Precedence::of_binop(&op);  in parse_expr()
1401                 if precedence == Precedence::Compare {  in parse_expr()
1403                         if Precedence::of_binop(&lhs.op) == Precedence::Compare {  in parse_expr()
1416             } else if Precedence::Cast >= base && input.peek(Token![as]) {  in parse_expr()
1438         precedence: Precedence,  in parse_binop_rhs()  argument
1447             if next > precedence || next == precedence && precedence == Precedence::Assign {  in parse_binop_rhs()
1470     fn peek_precedence(input: ParseStream) -> Precedence {  in peek_precedence()  argument
1472             Precedence::of_binop(&op)  in peek_precedence()
1474             Precedence::Assign  in peek_precedence()
1476             Precedence::Range  in peek_precedence()
1478             Precedence::Cast  in peek_precedence()
1480             Precedence::MIN  in peek_precedence()
1499             Precedence::MIN,  in ambiguous_expr()
2223                 parse_expr(input, lhs, allow_struct, Precedence::Compare)?  in expr_let()
2916             let end = parse_binop_rhs(input, allow_struct, Precedence::Range)?;  in parse_range_end()
3145     use crate::precedence::Precedence;
3315                 Precedence::Assign,  in print_expr_assign()
3317             print_subexpression(&e.left, left_prec <= Precedence::Range, tokens, left_fixup);  in print_expr_assign()
3322                 fixup.rightmost_subexpression_fixup(false, false, Precedence::Assign),  in print_expr_assign()
3358             left_prec < Precedence::Unambiguous,  in print_expr_await()
3382             let binop_prec = Precedence::of_binop(&e.op);  in print_expr_binary()
3405                 Precedence::Assign => left_prec <= Precedence::Range,  in print_expr_binary()
3406                 Precedence::Compare => left_prec <= binop_prec,  in print_expr_binary()
3418             let right_needs_group = binop_prec != Precedence::Assign  in print_expr_binary()
3466                 fixup.rightmost_subexpression_fixup(true, true, Precedence::Jump),  in print_expr_break()
3487             Precedence::Unambiguous,  in print_expr_call()
3492             left_prec < Precedence::Unambiguous  in print_expr_call()
3523                 Precedence::Cast,  in print_expr_cast()
3525             print_subexpression(&e.expr, left_prec < Precedence::Cast, tokens, left_fixup);  in print_expr_cast()
3563                 fixup.rightmost_subexpression_fixup(false, false, Precedence::Jump),  in print_expr_closure()
3607             left_prec < Precedence::Unambiguous,  in print_expr_field()
3696             Precedence::Unambiguous,  in print_expr_index()
3700             left_prec < Precedence::Unambiguous,  in print_expr_index()
3732         let (right_prec, right_fixup) = fixup.rightmost_subexpression(&e.expr, Precedence::Let);  in print_expr_let()
3733         print_subexpression(&e.expr, right_prec < Precedence::Let, tokens, right_fixup);  in print_expr_let()
3803             left_prec < Precedence::Unambiguous,  in print_expr_method_call()
3862                     Precedence::Range,  in print_expr_range()
3864                 print_subexpression(start, left_prec <= Precedence::Range, tokens, left_fixup);  in print_expr_range()
3869                     fixup.rightmost_subexpression_fixup(false, true, Precedence::Range);  in print_expr_range()
3871                 print_subexpression(end, right_prec <= Precedence::Range, tokens, right_fixup);  in print_expr_range()
3896         let (right_prec, right_fixup) = fixup.rightmost_subexpression(&e.expr, Precedence::Prefix);  in print_expr_raw_addr()
3899             right_prec < Precedence::Prefix,  in print_expr_raw_addr()
3919             Precedence::Prefix,  in print_expr_reference()
3923             right_prec < Precedence::Prefix,  in print_expr_reference()
3958                 fixup.rightmost_subexpression_fixup(true, false, Precedence::Jump),  in print_expr_return()
3994             left_prec < Precedence::Unambiguous,  in print_expr_try()
4039             Precedence::Prefix,  in print_expr_unary()
4043             right_prec < Precedence::Prefix,  in print_expr_unary()
4093                 fixup.rightmost_subexpression_fixup(true, false, Precedence::Jump),  in print_expr_yield()