module Make: functor (
G
:
G
) ->
SIG
with module G = G
Functor
module G: OpamParallel.G
val iter : int ->
OpamParallel.G.t ->
pre:(G.V.t -> unit) -> child:(G.V.t -> unit) -> post:(G.V.t -> unit) -> unit
iter n t pre child paren
parallel iteration on n
cores. child
is evaluated in a remote process and when it as
finished, whereas pre
and post
are evaluated on the current
process (respectively before and after the child process has
been created).
val iter_l : int ->
OpamParallel.G.vertex list ->
pre:(G.V.t -> unit) -> child:(G.V.t -> unit) -> post:(G.V.t -> unit) -> unit
Parallel iteration on a list.
val map_reduce : int ->
OpamParallel.G.t ->
map:(G.V.t -> 'a) -> merge:('a -> 'a -> 'a) -> init:'a -> 'a
Map-reduce on a graph
val map_reduce_l : int ->
OpamParallel.G.vertex list ->
map:(G.V.t -> 'a) -> merge:('a -> 'a -> 'a) -> init:'a -> 'a
Map-reduce on a list.
val create : G.V.t list -> OpamParallel.G.t
Build a graph on concurrent tasks from a list of tasks.
exception Errors of (G.V.t * OpamParallel.error) list * G.V.t list
Errors (errors
, remaining
)
exception Cyclic of G.V.t list list
The graph is cyclic.