refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
(* Title: Pure/Concurrent/par_list_sequential.ML
Author: Makarius
Dummy version of parallel list combinators -- plain sequential evaluation.
*)
structure Par_List: PAR_LIST =
struct
fun managed_results _ f = map (Exn.capture f);
fun map_name _ = map;
val map = map;
val get_some = get_first;
val find_some = find_first;
val exists = exists;
val forall = forall;
end;