let neighbs = UriTbl.find adjlist uri in
if Lazy.lazy_is_val neighbs.adjacency then begin
let adjacency, _ =
- HExtlib.split_nth "MD 1" neighbs.shown (Lazy.force neighbs.adjacency)
+ HExtlib.split_nth neighbs.shown (Lazy.force neighbs.adjacency)
in
List.iter
(fun dest ->
UriTbl.add adjlist dest neighborhood)
adjacency;
neighbs.shown <- weight;
- fst (HExtlib.split_nth "MD 2" weight adjacency), weight
+ fst (HExtlib.split_nth weight adjacency), weight
else begin (* nodes has been expanded at least once *)
let adjacency = Lazy.force neighbs.adjacency in
let total_nodes = List.length adjacency in
let shown_before = neighbs.shown in
neighbs.shown <- min (neighbs.shown + fat_increment) total_nodes;
let new_shown = neighbs.shown - shown_before in
- (fst (HExtlib.split_nth "MD 3" new_shown (List.rev adjacency))), new_shown
+ (fst (HExtlib.split_nth new_shown (List.rev adjacency))), new_shown
end else
[], 0 (* all children are already shown *)
end