| Age | Commit message (Collapse) | Author | Lines |
|
This reverts commit 7a4c1865fb2f58c57e3f09645515dec8be3022c6.
|
|
This reverts commit 2af0218bf1ffca0750a352554f20a07b760a30a8.
|
|
This reverts commit 5685e4dd90ad2f4978c63b9097f0b568e4ce6e5c.
|
|
|
|
|
|
|
|
Some tokens need to be broken in a loop until we reach
'unbreakable' tokens.
|
|
Fixes #68489
When checking two `TokenStreams` to see if they are 'probably equal',
we ignore the `IsJoint` information associated with each `TokenTree`.
However, the `IsJoint` information determines whether adjacent tokens
will be 'glued' (if possible) when construction the `TokenStream` - e.g.
`[Gt Gt]` can be 'glued' to `BinOp(Shr)`.
Since we are ignoring the `IsJoint` information, 'glued' and 'unglued'
tokens are equivalent for determining if two `TokenStreams` are
'probably equal'. Therefore, we need to 'unglue' all tokens in the
stream to avoid false negatives (which cause us to throw out the cached
tokens, losing span information).
|
|
|
|
|