diff options
author | Jacques Garrigue <garrigue at math.nagoya-u.ac.jp> | 2000-03-29 05:06:02 +0000 |
---|---|---|
committer | Jacques Garrigue <garrigue at math.nagoya-u.ac.jp> | 2000-03-29 05:06:02 +0000 |
commit | 06264d6d410fb2e2fa82644bcf81a683b494d07c (patch) | |
tree | 8ce6ef519f8898dc526de4d708f3e47b87428623 /otherlibs/labltk/compiler/tsort.ml | |
parent | 226fbcf2517bedb241265ca251d2bc17c6997aa9 (diff) |
erreur de commit
git-svn-id: http://caml.inria.fr/svn/ocaml/trunk@3011 f963ae5c-01c2-4b8c-9fe0-0dff7051ff02
Diffstat (limited to 'otherlibs/labltk/compiler/tsort.ml')
-rw-r--r-- | otherlibs/labltk/compiler/tsort.ml | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/otherlibs/labltk/compiler/tsort.ml b/otherlibs/labltk/compiler/tsort.ml index 246eca2db..4f0d49692 100644 --- a/otherlibs/labltk/compiler/tsort.ml +++ b/otherlibs/labltk/compiler/tsort.ml @@ -62,13 +62,13 @@ let sort order = let q = Queue.create () and result = ref [] in List.iter !order - f:(function {pred_count = n} as node -> + fun:(function {pred_count = n} as node -> if n = 0 then Queue.add node q); begin try while true do let t = Queue.take q in result := t.node :: !result; - List.iter t.successors f: + List.iter t.successors fun: begin fun s -> let n = s.pred_count - 1 in s.pred_count <- n; @@ -78,7 +78,7 @@ let sort order = with Queue.Empty -> List.iter !order - f:(fun node -> if node.pred_count <> 0 + fun:(fun node -> if node.pred_count <> 0 then raise Cyclic) end; !result |