Skip to content

Commit 3607174

Browse files
incr.comp.: Uniformly represent DepNodes as (Kind, StableHash) pairs.
1 parent a7ac71b commit 3607174

File tree

39 files changed

+864
-721
lines changed

39 files changed

+864
-721
lines changed

src/librustc/dep_graph/debug.rs

Lines changed: 5 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,6 @@
1212
1313
use super::dep_node::DepNode;
1414
use std::error::Error;
15-
use std::fmt::Debug;
1615

1716
/// A dep-node filter goes from a user-defined string to a query over
1817
/// nodes. Right now the format is like this:
@@ -39,7 +38,7 @@ impl DepNodeFilter {
3938
}
4039

4140
/// Tests whether `node` meets the filter, returning true if so.
42-
pub fn test<D: Clone + Debug>(&self, node: &DepNode<D>) -> bool {
41+
pub fn test(&self, node: &DepNode) -> bool {
4342
let debug_str = format!("{:?}", node);
4443
self.text.split("&")
4544
.map(|s| s.trim())
@@ -67,10 +66,10 @@ impl EdgeFilter {
6766
}
6867
}
6968

70-
pub fn test<D: Clone + Debug>(&self,
71-
source: &DepNode<D>,
72-
target: &DepNode<D>)
73-
-> bool {
69+
pub fn test(&self,
70+
source: &DepNode,
71+
target: &DepNode)
72+
-> bool {
7473
self.source.test(source) && self.target.test(target)
7574
}
7675
}

0 commit comments

Comments
 (0)