Merge pull request #5116 from simon04/patch-1

tsort: use Iterator.all

src/uu/tsort/src/tsort.rs

@@ -171,11 +171,6 @@ impl Graph {
     }
 
     fn is_acyclic(&self) -> bool {
-        for edges in self.out_edges.values() {
-            if !edges.is_empty() {
-                return false;
-            }
-        }
-        true
+        self.out_edges.values().all(|edge| edge.is_empty())
     }
 }