about summary refs log tree commit diff
path: root/compiler/rustc_passes/src/loops.rs
diff options
context:
space:
mode:
authorbors <bors@rust-lang.org>2022-07-07 07:38:08 +0000
committerbors <bors@rust-lang.org>2022-07-07 07:38:08 +0000
commitc461f7a16e8372216dbf7a54ab86ee958bec83b5 (patch)
treed0ac9ca1113c0ddf0ae3dcd6f811dc83e102535b /compiler/rustc_passes/src/loops.rs
parente78e747f53c36e53ff99c94438d2efa26830fc4b (diff)
parent928c17203a4d6ca9c119787c7ebfd3d2a487eeab (diff)
downloadrust-c461f7a16e8372216dbf7a54ab86ee958bec83b5.tar.gz
rust-c461f7a16e8372216dbf7a54ab86ee958bec83b5.zip
Auto merge of #98841 - Kobzol:hir-validator-bitset, r=cjgillot
Use a bitset instead of a hash map in HIR ID validator

The hashset insertion was slightly hot in incr patched runs, but it seems unnecessary to use a hashset here, as it just checks that a dense set of N integers was seen.

I'm not sure if it's possible to know the amount of items beforehand to preallocate the bitset? I suppose not.
Diffstat (limited to 'compiler/rustc_passes/src/loops.rs')
0 files changed, 0 insertions, 0 deletions