| 77 | /// "have no collision (as low as possible)" |
| 78 | #[derive(Debug, Eq)] |
| 79 | struct Identifier<'n, N: NormalizeEq> { |
| 80 | // Hash of `node` built up incrementally during the first, visiting traversal. |
| 81 | // Its value is not necessarily equal to default hash of the node. E.g. it is not |
| 82 | // equal to `expr.hash()` if the node is `Expr`. |
| 83 | hash: u64, |
| 84 | node: &'n N, |
| 85 | } |
| 86 | |
| 87 | impl<N: NormalizeEq> Clone for Identifier<'_, N> { |
| 88 | fn clone(&self) -> Self { |
no outgoing calls
no test coverage detected
searching dependent graphs…