bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

Refactor block_needs_anonymous_module

Browse source
This commit is contained in:
Jeffrey Seyfried 2016-01-27 10:51:22 +00:00
parent 2ed210d5fe
commit 23bdbb13f4
1 changed files with 7 additions and 19 deletions
Download patch file Download diff file Expand all files Collapse all files

24
src/librustc_resolve/build_reduced_graph.rs
View file

@ -142,29 +142,17 @@ impl<'a, 'b:'a, 'tcx:'b> GraphBuilder<'a, 'b, 'tcx> {
}
fn block_needs_anonymous_module(&mut self, block: &Block) -> bool {
// Check each statement.
for statement in &block.stmts {
match statement.node {
StmtDecl(ref declaration, _) => {
match declaration.node {
DeclItem(_) => {
fn is_item(statement: &hir::Stmt) -> bool {
if let StmtDecl(ref declaration, _) = statement.node {
if let DeclItem(_) = declaration.node {
return true;
}
_ => {
// Keep searching.
}
}
}
_ => {
// Keep searching.
}
}
false
}
// If we found no items, we don't need to create
// an anonymous module.
return false;
// If any statements are items, we need to create an anonymous module
block.stmts.iter().any(is_item)
}
/// Constructs the reduced graph for one item.