mikros/rust
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

add some debugging logs

Browse Source
This commit is contained in:
Niko Matsakis 2011-12-06 21:33:47 -08:00
parent 13a3288f3f
commit 30a2361e68
1 changed files with 13 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
src/libstd/map.rs
View File

@ -133,16 +133,24 @@ mod chained {
fn search_rem<copy K, copy V>(tbl: t<K,V>,
k: K,
h: uint,
idx: uint,
e_root: @entry<K,V>) -> search_result<K,V> {
let e0 = e_root;
let comp = 1u; // for logging
while true {
alt e0.next {
absent. {
log("search_tbl", "absent", "comparisons", comp,
"hash", h, "idx", idx);
ret not_found;
}
present(e1) {
comp += 1u;
let e1_key = e1.key; // Satisfy alias checker.
if e1.hash == h && tbl.eqer(e1_key, k) {
log("search_tbl", "present", "comparisons", comp,
"hash", h, "idx", idx);
ret found_after(e0, e1);
} else {
e0 = e1;
@ -158,14 +166,18 @@ fn search_tbl<copy K, copy V>(
let idx = h % vec::len(tbl.chains);
alt tbl.chains[idx] {
absent. {
log("search_tbl", "absent", "comparisons", 0u,
"hash", h, "idx", idx);
ret not_found;
}
present(e) {
let e_key = e.key; // Satisfy alias checker.
if e.hash == h && tbl.eqer(e_key, k) {
log("search_tbl", "present", "comparisons", 1u,
"hash", h, "idx", idx);
ret found_first(idx, e);
} else {
ret search_rem(tbl, k, h, e);
ret search_rem(tbl, k, h, idx, e);
}
}
}