about summary refs log tree commit diff
path: root/src/test/codegen/src-hash-algorithm
diff options
context:
space:
mode:
authorbors[bot] <26634292+bors[bot]@users.noreply.github.com>2021-09-26 12:54:12 +0000
committerGitHub <noreply@github.com>2021-09-26 12:54:12 +0000
commit0e3e3e2a519bae999a6ba6e621300ac85e8bf1b0 (patch)
tree1cb0a06d6cf0ffa03b9e48944c2b627d3fd99a65 /src/test/codegen/src-hash-algorithm
parent06181008551b4f920d6e91e1f6bc270d78428bc6 (diff)
parentdefe805fb763f3d4b11cbbe3dde460b825eea1ae (diff)
downloadrust-0e3e3e2a519bae999a6ba6e621300ac85e8bf1b0.tar.gz
rust-0e3e3e2a519bae999a6ba6e621300ac85e8bf1b0.zip
Merge #10357
10357: internal: fix and force-disable block validation ;-( r=matklad a=matklad

Originally we tried to maintain the invariant that `{}` always match.
That is, that in the parse tree the pair of corresponding `{}` is always
first and last tokens of some nodes.

We had the code to validate that, but apparently it's been broken for
**years** since we introduced tokens/nodes split. Fixing it now makes
some tests fail.

It's unclear if we want to keep this invariant: there's a strong
motivation for breaking it in the following case:

```
use std::{ // unclosed paren

fn main() {

}

} // don't actually want to pair up this with the one from `use`
```

So let's fix the code, but disable it for the time being

bors r+
🤖

Co-authored-by: Aleksey Kladov <aleksey.kladov@gmail.com>
Diffstat (limited to 'src/test/codegen/src-hash-algorithm')
0 files changed, 0 insertions, 0 deletions