OpenE2K/rust
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Remove redundant sorting of projections in TypeIdHasher.

Browse Source
This commit is contained in:
Michael Woerister 2016-09-13 08:40:14 -04:00
parent 5c923f0159
commit 94d75013bc
1 changed files with 4 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
src/librustc/ty/util.rs
View File

@ -458,15 +458,11 @@ impl<'a, 'gcx, 'tcx> TypeVisitor<'tcx> for TypeIdHasher<'a, 'gcx, 'tcx> {
data.region_bound.visit_with(self); data.region_bound.visit_with(self);
self.hash(data.builtin_bounds); self.hash(data.builtin_bounds);
// Only projection bounds are left, sort and hash them. // Only projection bounds are left, hash them.
let mut projection_bounds: Vec<_> = data.projection_bounds self.hash(data.projection_bounds.len());
.iter() for bound in &data.projection_bounds {
.map(|b| (b.item_name().as_str(), b))
.collect();
projection_bounds.sort_by_key(|&(ref name, _)| name.clone());
for (name, bound) in projection_bounds {
self.def_id(bound.0.trait_ref.def_id); self.def_id(bound.0.trait_ref.def_id);
self.hash(name); self.hash(bound.0.item_name);
bound.visit_with(self); bound.visit_with(self);
} }