37         it: &mut dyn Iterator<Item = TokenTree>,  in parse_primary()
62                 it.next()  in parse_primary()
73                 it.next()  in parse_primary()
79                 let Some(rhs_tok) = it.next() else {  in parse_primary()
85                 let next = self.parse_primary(rhs_tok, it, out)?;  in parse_primary()
106         it: &mut dyn Iterator<Item = TokenTree>,  in parse_binop()
112         let mut next = f(self, tok, it, out)?;  in parse_binop()
120             let Some(rhs_tok) = it.next() else {  in parse_binop()
127             next = f(self, rhs_tok, it, &mut rhs)?;  in parse_binop()
137         it: &mut dyn Iterator<Item = TokenTree>,  in parse_sub()
140         self.parse_binop(tok, it, out, '-', Self::parse_primary, "difference")  in parse_sub()
147         it: &mut dyn Iterator<Item = TokenTree>,  in parse_and()
150         self.parse_binop(tok, it, out, '&', Self::parse_sub, "intersection")  in parse_and()
157         it: &mut dyn Iterator<Item = TokenTree>,  in parse_xor()
160         self.parse_binop(tok, it, out, '^', Self::parse_and, "symmetric_difference")  in parse_xor()
167         it: &mut dyn Iterator<Item = TokenTree>,  in parse_or()
170         self.parse_binop(tok, it, out, '|', Self::parse_xor, "union")  in parse_or()
174         it: &mut dyn Iterator<Item = TokenTree>,  in parse()
183             let tok = it.next();  in parse()
190                     let tok = it.next();  in parse()
217         let next = state.parse_primary(tok, it, &mut out)?;  in parse()