future proofs: back to Future.fork_pri ~1 for improved parallelism;
authorwenzelm
Sun, 04 Jan 2009 00:01:16 +0100
changeset 29343 43ac99cdeb5b
parent 29342 23504001c4fb
child 29344 fc4a04a2970a
future proofs: back to Future.fork_pri ~1 for improved parallelism;
src/Pure/Isar/toplevel.ML
src/Pure/goal.ML
--- a/src/Pure/Isar/toplevel.ML	Sun Jan 04 00:00:03 2009 +0100
+++ b/src/Pure/Isar/toplevel.ML	Sun Jan 04 00:01:16 2009 +0100
@@ -718,7 +718,7 @@
 
         val future_proof = Proof.future_proof
           (fn prf =>
-            Future.fork_pri 1 (fn () =>
+            Future.fork_pri ~1 (fn () =>
               let val (states, State (result_node, _)) =
                 (case st' of State (SOME (Proof (_, (_, orig_gthy)), exit), prev)
                   => State (SOME (Proof (ProofNode.init prf, (finish, orig_gthy)), exit), prev))
--- a/src/Pure/goal.ML	Sun Jan 04 00:00:03 2009 +0100
+++ b/src/Pure/goal.ML	Sun Jan 04 00:01:16 2009 +0100
@@ -179,7 +179,7 @@
     val res =
       if immediate orelse #maxidx (Thm.rep_cterm stmt) >= 0 orelse not (Future.enabled ())
       then result ()
-      else future_result ctxt' (Future.fork_pri 1 result) (Thm.term_of stmt);
+      else future_result ctxt' (Future.fork_pri ~1 result) (Thm.term_of stmt);
   in
     Conjunction.elim_balanced (length props) res
     |> map (Assumption.export false ctxt' ctxt)