# HG changeset patch
# User wenzelm
# Date 1221132254 -7200
# Node ID e63d05ceec2407caf34c0b03c6f7c99cefb50528
# Parent  90dd4068bf61703e157e58d85af7290c8d36751e
Parallel list combinators.

diff -r 90dd4068bf61 -r e63d05ceec24 src/Pure/Concurrent/par_list.ML
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/Pure/Concurrent/par_list.ML	Thu Sep 11 13:24:14 2008 +0200
@@ -0,0 +1,68 @@
+(*  Title:      Pure/Concurrent/par_list.ML
+    ID:         $Id$
+    Author:     Makarius
+
+Parallel list combinators.
+
+Notes:
+
+  * These combinators only make sense if the operator (function or
+    predicate) applied to the list of operands takes considerable
+    time.  The overhead of scheduling is significantly higher than
+    just traversing the list of operands sequentially.
+
+  * The order of operator application is non-determined.  Watch out
+    for operators that have side-effects or raise exceptions!
+*)
+
+signature PAR_LIST =
+sig
+  val map: ('a -> 'b) -> 'a list -> 'b list
+  val get_some: ('a -> 'b option) -> 'a list -> 'b option
+  val find_some: ('a -> bool) -> 'a list -> 'a option
+  val exists: ('a -> bool) -> 'a list -> bool
+  val forall: ('a -> bool) -> 'a list -> bool
+end;
+
+structure ParList: PAR_LIST =
+struct
+
+fun proper_exn (Exn.Result _) = NONE
+  | proper_exn (Exn.Exn Interrupt) = NONE
+  | proper_exn (Exn.Exn exn) = SOME exn;
+
+fun raw_map f xs =
+  let val group = TaskQueue.new_group ()
+  in Future.join_results (List.map (fn x => Future.future (SOME group) [] (fn () => f x)) xs) end;
+
+fun map f xs =
+  let val results = raw_map f xs in
+    (case get_first proper_exn results of
+      SOME exn => raise exn
+    | NONE => List.map Exn.release results)
+  end;
+
+fun get_some f xs =
+  let
+    exception FOUND of 'b option;
+    fun found (Exn.Exn (FOUND some)) = some
+      | found _ = NONE;
+    val results = raw_map (fn x => (case f x of NONE => () | some => raise FOUND some)) xs;
+  in
+    (case get_first found results of
+      SOME y => SOME y
+    | NONE =>
+        (case get_first proper_exn results of
+          SOME exn => raise exn
+        | NONE =>
+            (case get_first Exn.get_exn results of
+              SOME exn => raise exn
+            | NONE => NONE)))
+  end;
+
+fun find_some P = get_some (fn x => if P x then SOME x else NONE);
+
+fun exists P = is_some o get_some (fn x => if P x then SOME () else NONE);
+fun forall P = not o exists (not o P);
+
+end;