core :: HashCollection :: node_at_idx
# Return the node associated with the key (but with the index already known)
fun node_at_idx(i: Int, k: nullable Object): nullable N
do
if _the_length == 0 then return null
var c = _array[i]
while c != null do
var ck = c._key
if ck.is_same_instance(k) or ck == k then # FIXME prefilter because the compiler is not smart enought yet
break
end
c = c._next_in_bucklet
end
return c
end
lib/core/collection/hash_collection.nit:68,2--81,4
redef fun node_at_idx(i,k)
do
sys.gt_count += 1
sys.gt_tot_length += _the_length
sys.gt_tot_cap += _capacity
var c = _array[i]
if c != null and c._next_in_bucklet != null then gt_collide(i,k)
return super
end
lib/hash_debug/hash_debug.nit:137,2--146,4
redef fun node_at_idx(i, k)
do
var c = _array[i]
while c != null do
var ck = c._key
assert ck != null
if ck.is_same_serialized(k) then
break
end
c = c._next_in_bucklet
end
return c
end
lib/serialization/engine_tools.nit:34,2--46,4