@@ -1861,7 +1861,7 @@ where
1861
1861
}
1862
1862
1863
1863
if *self == DUMMY_SP {
1864
- std::hash:: Hash::hash(&TAG_INVALID_SPAN, hasher);
1864
+ Hash::hash(&TAG_INVALID_SPAN, hasher);
1865
1865
return;
1866
1866
}
1867
1867
@@ -1872,28 +1872,28 @@ where
1872
1872
let (file_lo, line_lo, col_lo) = match ctx.byte_pos_to_line_and_col(span.lo) {
1873
1873
Some(pos) => pos,
1874
1874
None => {
1875
- std::hash:: Hash::hash(&TAG_INVALID_SPAN, hasher);
1875
+ Hash::hash(&TAG_INVALID_SPAN, hasher);
1876
1876
span.ctxt.hash_stable(ctx, hasher);
1877
1877
return;
1878
1878
}
1879
1879
};
1880
1880
1881
1881
if !file_lo.contains(span.hi) {
1882
- std::hash:: Hash::hash(&TAG_INVALID_SPAN, hasher);
1882
+ Hash::hash(&TAG_INVALID_SPAN, hasher);
1883
1883
span.ctxt.hash_stable(ctx, hasher);
1884
1884
return;
1885
1885
}
1886
1886
1887
- std::hash:: Hash::hash(&TAG_VALID_SPAN, hasher);
1887
+ Hash::hash(&TAG_VALID_SPAN, hasher);
1888
1888
// We truncate the stable ID hash and line and column numbers. The chances
1889
1889
// of causing a collision this way should be minimal.
1890
- std::hash:: Hash::hash(&(file_lo.name_hash as u64), hasher);
1890
+ Hash::hash(&(file_lo.name_hash as u64), hasher);
1891
1891
1892
1892
let col = (col_lo.0 as u64) & 0xFF;
1893
1893
let line = ((line_lo as u64) & 0xFF_FF_FF) << 8;
1894
1894
let len = ((span.hi - span.lo).0 as u64) << 32;
1895
1895
let line_col_len = col | line | len;
1896
- std::hash:: Hash::hash(&line_col_len, hasher);
1896
+ Hash::hash(&line_col_len, hasher);
1897
1897
span.ctxt.hash_stable(ctx, hasher);
1898
1898
}
1899
1899
}
0 commit comments