Tests moved to 'interactive'

git-svn-id: http://caml.inria.fr/svn/ocaml/trunk@10257 f963ae5c-01c2-4b8c-9fe0-0dff7051ff02

5 files changed, 0 insertions, 730 deletions

diff --git a/test/Moretest/graph_example.ml b/test/Moretest/graph_example.ml
deleted file mode 100644
index 6fbe988ce3..0000000000
--- a/test/Moretest/graph_example.ml
+++ /dev/null
@@ -1,131 +0,0 @@
-(* To run this example:
-   ********************
-   1. Select all the text in this window.
-   2. Drag it to the toplevel window.
-   3. Watch the colors.
-   4. Drag the mouse over the graphics window and click here and there.
-   5. Type any key to the graphics window to stop the program.
-*)
-
-open Graphics;;
-open_graph " 480x270";;
-
-let xr = size_x () / 2 - 30
-and yr = size_y () / 2 - 26
-and xg = size_x () / 2 + 30
-and yg = size_y () / 2 - 26
-and xb = size_x () / 2
-and yb = size_y () / 2 + 26
-;;
-
-let point x y =
-  let dr = (x-xr)*(x-xr) + (y-yr)*(y-yr)
-  and dg = (x-xg)*(x-xg) + (y-yg)*(y-yg)
-  and db = (x-xb)*(x-xb) + (y-yb)*(y-yb)
-  in
-  if dr > dg && dr > db then set_color (rgb 255 (255*dg/dr) (255*db/dr))
-  else if dg > db then set_color (rgb (255*dr/dg) 255 (255*db/dg))
-  else set_color (rgb (255*dr/db) (255*dg/db) 255);
-  fill_rect x y 2 2;
-;;
-
-for y = (size_y () - 1) / 2 downto 0 do
-  for x = 0 to (size_x () - 1) / 2 do
-    point (2*x) (2*y);
-  done
-done
-;;
-
-let n = 0x000000
-and w = 0xFFFFFF
-and b = 0xFFCC99
-and y = 0xFFFF00
-and o = 0xCC9966
-and v = 0x00BB00
-and g = 0x888888
-and c = 0xDDDDDD
-and t = transp
-;;
-
-let caml = make_image [|
-  [|t;t;t;t;t;t;t;t;t;t;t;n;n;n;n;n;n;t;t;t;t;t;t;t;t;t;t;t;t;t;t;t;|];
-  [|t;t;t;t;t;t;t;t;t;t;n;n;n;n;n;n;n;n;n;t;t;t;t;t;t;t;t;t;t;t;t;t;|];
-  [|t;t;t;t;t;t;t;t;n;n;n;n;n;n;n;n;n;n;n;n;t;t;t;t;t;t;t;t;t;t;t;t;|];
-  [|n;n;n;n;n;n;t;n;n;n;n;n;b;b;b;b;b;b;b;n;n;t;t;t;t;t;n;n;n;n;n;t;|];
-  [|n;o;o;o;o;o;n;n;n;n;b;b;b;b;b;b;b;b;b;b;b;n;n;n;n;n;n;n;n;n;n;t;|];
-  [|n;o;o;o;o;o;o;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;t;|];
-  [|n;o;o;o;o;o;o;o;n;n;n;g;g;g;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;t;t;|];
-  [|n;n;o;o;o;o;o;o;o;n;n;n;c;c;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;t;t;|];
-  [|t;n;n;o;o;o;o;o;o;o;n;n;n;c;n;n;n;n;n;n;n;b;b;n;n;n;n;n;n;t;t;t;|];
-  [|t;t;n;n;n;o;o;o;o;o;o;n;n;n;n;n;n;n;n;n;b;b;b;b;n;n;n;n;t;t;t;t;|];
-  [|t;t;t;t;n;n;o;o;o;o;o;o;n;n;n;n;n;n;n;n;b;b;b;b;b;b;n;n;t;t;t;t;|];
-  [|t;t;t;t;t;n;n;o;o;o;o;o;o;n;n;n;n;n;n;o;o;b;b;b;b;b;b;n;n;t;t;t;|];
-  [|t;t;t;t;t;n;n;o;o;o;o;o;o;b;b;b;b;b;n;n;o;o;b;b;b;b;b;b;n;n;t;t;|];
-  [|t;t;t;t;n;n;n;o;o;o;o;o;b;b;b;b;b;b;b;n;n;o;o;b;b;b;b;b;b;n;n;t;|];
-  [|t;t;t;t;n;n;n;o;o;o;o;b;b;b;b;b;b;b;b;b;n;n;o;o;b;b;b;b;b;b;n;n;|];
-  [|t;t;t;t;n;n;n;o;o;o;o;b;b;b;b;b;n;n;b;b;b;n;n;o;o;b;b;b;b;b;n;n;|];
-  [|t;t;t;t;n;n;n;o;o;o;o;b;b;b;b;b;n;n;b;b;b;b;n;n;o;o;b;o;b;b;n;n;|];
-  [|t;t;t;t;n;n;n;o;o;o;o;b;b;b;b;b;n;n;b;b;b;b;b;n;n;o;o;o;o;o;n;n;|];
-  [|t;t;t;t;n;n;n;o;o;o;o;b;b;b;b;b;n;n;b;b;b;b;b;b;n;n;o;o;o;o;n;n;|];
-  [|t;t;t;t;n;n;n;o;o;o;o;o;b;b;b;b;n;n;b;b;b;b;b;b;b;n;n;o;o;n;n;n;|];
-  [|t;t;t;t;n;n;n;n;o;o;o;o;o;b;b;b;n;n;n;b;b;b;b;b;b;b;n;n;o;n;b;n;|];
-  [|t;t;t;t;t;n;n;n;o;o;o;o;o;o;b;b;n;n;n;b;b;b;b;b;b;b;b;n;n;n;b;n;|];
-  [|t;t;t;t;t;t;n;n;o;o;o;o;o;o;o;y;v;y;n;b;b;b;b;b;b;b;b;n;n;b;b;n;|];
-  [|t;t;t;t;t;t;t;n;o;o;o;o;o;v;y;o;o;n;n;n;b;b;b;b;b;b;b;n;n;b;b;n;|];
-  [|t;t;t;t;t;t;t;n;o;o;o;y;v;o;o;o;o;n;n;n;n;b;b;b;b;b;b;n;n;b;b;n;|];
-  [|t;t;t;t;t;t;n;n;o;v;y;o;y;o;o;o;o;o;o;n;n;n;b;b;b;b;b;n;n;b;b;n;|];
-  [|t;t;t;t;t;t;n;o;y;y;o;o;v;o;o;o;o;o;o;o;n;n;n;b;b;b;n;n;n;b;n;t;|];
-  [|t;t;t;t;t;n;n;v;o;v;o;o;o;o;o;o;o;o;o;o;o;n;n;n;b;n;n;n;n;b;n;t;|];
-  [|t;t;t;t;t;n;v;o;o;v;o;o;o;o;o;o;o;o;o;o;o;o;n;n;n;n;n;n;n;n;t;t;|];
-  [|t;t;t;t;n;n;o;o;o;o;o;o;o;o;o;o;o;o;o;o;o;n;n;n;n;n;n;t;t;t;t;t;|];
-  [|t;t;t;t;n;o;o;o;o;o;o;o;o;o;o;o;o;o;o;o;n;n;t;t;t;t;t;t;t;t;t;t;|];
-  [|t;t;t;t;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;t;t;t;t;t;t;t;t;t;t;t;|];
-|];;
-
-(*
-let x = ref 0 and y = ref 0;;
-let bg = get_image !x !y 32 32;;
-while true do
-  let st = wait_next_event [Mouse_motion; Button_down] in
-  if not st.button then draw_image bg !x !y;
-  x := st.mouse_x;
-  y := st.mouse_y;
-  blit_image bg !x !y;
-  draw_image caml !x !y;
-done;;
-*)
-set_color (rgb 0 0 0);
-remember_mode false;
-try while true do
-  let st = wait_next_event [Mouse_motion; Button_down; Key_pressed] in
-  synchronize ();
-  if st.keypressed then raise Exit;
-  if st.button then begin
-    remember_mode true;
-    draw_image caml st.mouse_x st.mouse_y;
-    remember_mode false;
-  end;
-  let x = st.mouse_x + 16 and y = st.mouse_y + 16 in
-
-  moveto 0 y;
-  lineto (x - 25) y;
-  moveto 10000 y;
-  lineto (x + 25) y;
-
-  moveto x 0;
-  lineto x (y - 25);
-  moveto x 10000;
-  lineto x (y + 25);
-
-  draw_image caml st.mouse_x st.mouse_y;
-done with Exit -> ()
-;;
-
-(* To run this example:
-   ********************
-   1. Select all the text in this window.
-   2. Drag it to the toplevel window.
-   3. Watch the colors.
-   4. Drag the mouse over the graphics window and click here and there.
-   5. Type any key to the graphics window to stop the program.
-*)
diff --git a/test/Moretest/graph_test.ml b/test/Moretest/graph_test.ml
deleted file mode 100644
index cd4c0813db..0000000000
--- a/test/Moretest/graph_test.ml
+++ /dev/null
@@ -1,288 +0,0 @@
-(***********************************************************************)
-(*                                                                     *)
-(*                           Objective Caml                            *)
-(*                                                                     *)
-(*            Pierre Weis, projet Cristal, INRIA Rocquencourt          *)
-(*                                                                     *)
-(*  Copyright 2000 Institut National de Recherche en Informatique et   *)
-(*  en Automatique.  All rights reserved.  This file is distributed    *)
-(*  under the terms of the GNU Library General Public License, with    *)
-(*  the special exception on linking described in file ../../LICENSE.  *)
-(*                                                                     *)
-(***********************************************************************)
-
-(* graph_test.ml : tests various drawing and filling primitives of the
-   Graphics library. *)
-
-(* To run this example just load this file into a suitable toplevel.
-   Alternatively execute
-   ocamlc graphics.cma graph_test.ml *)
-
-open Graphics;;
-
-auto_synchronize false;;
-display_mode false;;
-remember_mode true;;
-
-let sz = 450;;
-
-open_graph (Printf.sprintf " %ix%i" sz sz);;
-
-(* To be defined for older versions of O'Caml
-   Lineto, moveto and draw_rect.
-
-let rlineto x y =
- let xc, yc = current_point () in
- lineto (x + xc) (y + yc);;
-
-let rmoveto x y =
- let xc, yc = current_point () in
- moveto (x + xc) (y + yc);;
-
-let draw_rect x y w h =
- let x0, y0 = current_point () in
- moveto x y;
- rlineto w 0;
- rlineto 0 h;
- rlineto (- w) 0;
- rlineto 0 (-h);
- moveto x0 y0;;
-*)
-
-(* A set of points. *)
-
-set_color foreground;;
-
-let dashes y =
- for i = 1 to 100 do
-  plot y (2 * i);
-  plot y (3 * i);
-  plot y (4 * i);
- done;;
-
-dashes 3;;
-
-set_line_width 20;;
-dashes (sz - 20);;
-
-(* Drawing chars *)
-
-draw_char 'C';
-draw_char 'a';
-draw_char 'm';
-draw_char 'l';;
-
-(* More and more red enlarging squares *)
-moveto 10 10;;
-set_line_width 5;;
-
-let carre c =
- rlineto 0 c;
- rlineto c 0;
- rlineto 0 (- c);
- rlineto (- c) 0;;
-
-for i = 1 to 10 do
- moveto (10 * i) (10 * i);
- set_color (rgb (155 + 10 * i) 0 0);
- carre (10 * i)
-done;;
-
-(* Blue squares in arithmetic progression *)
-moveto 10 210;;
-set_color blue;;
-set_line_width 1;;
-
-for i = 1 to 10 do
- carre (10 * i)
-done;;
-
-(* Tiny circles filled or not *)
-rmoveto 0 120;;
-(* Must not change the current point *)
-fill_circle 20 190 10;;
-set_color green;;
-rlineto 0 10;;
-rmoveto 50 10;;
-let x, y = current_point () in
-(* Must not change the current point *)
-draw_circle x y 20;;
-set_color black;;
-rlineto 0 20;;
-
-(* Cyan rectangles as a kind of graphical representation *)
-set_color cyan;;
-
-let lw = 15;;
-set_line_width lw;;
-let go_caption l = moveto 210 (130 - lw + l);;
-let go_legend () = go_caption (- 3 * lw);;
-
-go_caption 0;;
-fill_rect 210 130 5 10;;
-fill_rect 220 130 10 20;;
-fill_rect 235 130 15 40;;
-fill_rect 255 130 20 80;;
-fill_rect 280 130 25 160;;
-(* A green rectangle below the graph. *)
-set_color green;;
-rlineto 50 0;;
-
-(* A black frame for each of our rectangles *)
-set_color black;;
-set_line_width (lw / 4);;
-
-draw_rect 210 130 5 10;;
-draw_rect 220 130 10 20;;
-draw_rect 235 130 15 40;;
-draw_rect 255 130 20 80;;
-draw_rect 280 130 25 160;;
-
-(* A black rectangle after the green one, below the graph. *)
-set_line_width lw;;
-rlineto 50 0;;
-
-(* Write a text in yellow on a blue background. *)
-(* x = 210, y = 70 *)
-go_legend ();;
-set_text_size 10;;
-set_color (rgb 150 100 250);;
-let x,y = current_point () in
-fill_rect x (y - 5) (8 * 20) 25;;
-set_color yellow;;
-go_legend ();;
-draw_string "Graphics (Caml)";;
-
-(* Pie parts in different colors. *)
-let draw_green_string s = set_color green; draw_string s;;
-let draw_red_string s = set_color red; draw_string s;;
-
-moveto 120 210;;
-set_color red;;
-fill_arc 150 260 25 25 60 300;
-draw_green_string "A ";
-draw_red_string "red";
-draw_green_string " pie.";
-
-set_text_size 5;
-moveto 180 240;
-draw_red_string "A "; draw_green_string "green"; draw_red_string " slice.";;
-set_color green;
-fill_arc 200 260 25 25 0 60;
-set_color black;
-set_line_width 2;
-draw_arc 200 260 27 27 0 60;;
-
-(* Should do nothing since this is a line *)
-set_color red;;
-fill_poly [| (40, 10); (150, 70); (150, 10); (40, 10) |];;
-set_color blue;;
-
-(* Drawing polygones. *)
-(* Redefining the draw_poly primitive for the usual library. *)
-let draw_poly v =
- let l = Array.length v in
-  if l > 0 then begin
-  let x0, y0 = current_point () in
-  let p0 = v.(0) in
-  let x, y = p0 in moveto x y;
-  for i = 1 to l - 1 do
-   let x, y = v.(i) in lineto x y
-  done;
-  lineto x y;
-  moveto x0 y0
- end;;
-
-draw_poly [| (150, 10); (150, 70); (260, 10); (150, 10) |];;
-
-(* Filling polygones. *)
-(* Two equilateral triangles, one red and one blue, and their inside
-   filled in black. *)
-let equi x y l =
- [| (x - l / 2, y);
-    (x, y + int_of_float (float_of_int l *. (sqrt 3.0 /. 2.0)));
-    (x + l / 2, y) |];;
-
-set_color black;;
-fill_poly (Array.append (equi 300 20 40) (equi 300 44 (- 40)));;
-
-set_line_width 1;;
-set_color cyan;;
-draw_poly (equi 300 20 40);;
-set_color red;;
-draw_poly (equi 300 44 (- 40));;
-
-(* Drawing and filling ellipses. *)
-let x, y = current_point () in
-rlineto 10 10; moveto x y;
-
-moveto 395 100;;
-
-let x, y = current_point () in
-fill_ellipse x y 25 15;;
-
-set_color (rgb 0xFF 0x00 0xFF);;
-rmoveto 0 (- 50);;
-
-let x, y = current_point () in
-fill_ellipse x y 15 30;;
-
-rmoveto (- 45) 0;;
-let x, y = current_point () in
-draw_ellipse x y 25 10;;
-
-(* Drawing and filling arcs. *)
-
-let draw_arc_ellipse x y r1 r2 =
-  set_color green;
-  draw_arc x y r1 r2 60 120;
-  set_color black;
-  draw_arc x y r1 r2 120 420;;
-
-set_line_width 3;;
-
-let draw_arc_ellipses x y r1 r2 =
-  let step = 5 in
-  for i = 0 to (r1 - step) / (2 * step) do
-   for j = 0 to (r2 - step) / (2 * step) do
-    draw_arc_ellipse x y (3 * i * step) (3 * j * step)
-   done
-  done;;
-
-draw_arc_ellipses 20 128 15 50;;
-
-let fill_arc_ellipse x y r1 r2 c1 c2 =
-  set_color c1;
-  fill_arc x y r1 r2 60 120;
-  set_color c2;
-  fill_arc x y r1 r2 120 420;;
-
-let fill_arc_ellipses x y r1 r2 =
-  let step = 3 in
-  let c1 = ref black
-  and c2 = ref yellow in
-  let exchange r1 r2 = let tmp = !r1 in r1 := !r2; r2 := tmp in
-  for i = r1 / (2 * step) downto 10 do
-   for j = r2 / (2 * step) downto 30 do
-    exchange c1 c2;
-    fill_arc_ellipse x y (3 * i) (3 * j) !c1 !c2
-   done
-  done;;
-
-fill_arc_ellipses 400 240 150 200;;
-
-
-synchronize ();;
-
-(* transparent color drawing *)
-set_color transp;;
-draw_circle 400 240 50;;
-draw_circle 400 240 40;;
-draw_circle 400 240 30;;
-(* try to go back a normal color *)
-set_color red;;
-draw_circle 400 240 20;;
-
-synchronize ();;
-
-input_line stdin;;
diff --git a/test/Moretest/signals.ml b/test/Moretest/signals.ml
deleted file mode 100644
index ce93a27e20..0000000000
--- a/test/Moretest/signals.ml
+++ /dev/null
@@ -1,32 +0,0 @@
-let rec tak (x, y, z as tuple) =
-  if x > y then tak(tak (x-1, y, z), tak (y-1, z, x), tak (z-1, x, y))
-           else z
-
-let break_handler _ =
-  print_string "Thank you for pressing ctrl-C."; print_newline();
-  print_string "Allocating a bit..."; flush stdout;
-  tak(18,12,6); print_string "done."; print_newline()
-
-let stop_handler _ =
-  print_string "Thank you for pressing ctrl-Z."; print_newline();
-  print_string "Now raising an exception..."; print_newline();
-  raise Exit
-
-let _ =
-  Sys.signal Sys.sigint (Sys.Signal_handle break_handler);
-  Sys.signal Sys.sigtstp (Sys.Signal_handle stop_handler);
-  begin try
-    print_string "Computing like crazy..."; print_newline();
-    for i = 1 to 1000 do tak(18,12,6) done;
-    print_string "Reading on input..."; print_newline();
-    for i = 1 to 5 do
-      try
-        let s = read_line () in
-        print_string ">> "; print_string s; print_newline()
-      with Exit ->
-        print_string "Got Exit, continuing."; print_newline()
-    done
-  with Exit ->
-    print_string "Got Exit, exiting."; print_newline()
-  end;
-  exit 0
diff --git a/test/alloc.ml b/test/alloc.ml
deleted file mode 100644
index ea103e42af..0000000000
--- a/test/alloc.ml
+++ /dev/null
@@ -1,51 +0,0 @@
-(***********************************************************************)
-(*                                                                     *)
-(*                           Objective Caml                            *)
-(*                                                                     *)
-(*             Damien Doligez, projet Para, INRIA Rocquencourt         *)
-(*                                                                     *)
-(*  Copyright 1996 Institut National de Recherche en Informatique et   *)
-(*  en Automatique.  All rights reserved.  This file is distributed    *)
-(*  under the terms of the Q Public License version 1.0.               *)
-(*                                                                     *)
-(***********************************************************************)
-
-(* $Id$ *)
-
-(* Random allocation test *)
-
-(*
-  Allocate arrays of strings, of random sizes in [0..1000[, and put them
-  into an array of 32768.  Replace a randomly-selected array with a new
-  random-length array.  Reiterate ad infinitum.
-*)
-
-let l = 32768;;
-let m = 1000;;
-
-let ar = Array.create l "";;
-
-Random.init 1234;;
-
-let compact_flag = ref false;;
-
-let main () =
-  while true do
-    for i = 1 to 100000 do
-      ar.(Random.int l) <- String.create (Random.int m);
-    done;
-    if !compact_flag then Gc.compact () else Gc.full_major ();
-    print_newline ();
-    Gc.print_stat stdout;
-    flush stdout;
-  done
-;;
-
-let argspecs = [
-  "-c", Arg.Set compact_flag, "do heap compactions";
-];;
-
-Arg.parse argspecs (fun _ -> ()) "Usage: alloc [-c]";;
-
-main ();;
-
diff --git a/test/sorts.ml b/test/sorts.ml
deleted file mode 100644
index abc8dc1b5c..0000000000
--- a/test/sorts.ml
+++ /dev/null
@@ -1,228 +0,0 @@
-(* Animation of sorting algorithms. *)
-
-open Graphics
-
-(* Information on a given sorting process *)
-
-type graphic_context =
-  { array: int array;                   (* Data to sort *)
-    x0: int;                            (* X coordinate, lower left corner *)
-    y0: int;                            (* Y coordinate, lower left corner *)
-    width: int;                         (* Width in pixels *)
-    height: int;                        (* Height in pixels *)
-    nelts: int;                         (* Number of elements in the array *)
-    maxval: int;                        (* Max val in the array + 1 *)
-    rad: int                            (* Dimension of the rectangles *)
-  }
-
-(* Array assignment and exchange with screen update *)
-
-let screen_mutex = Mutex.create()
-
-let draw gc i v =
-  fill_rect (gc.x0 + (gc.width * i) / gc.nelts)
-            (gc.y0 + (gc.height * v) / gc.maxval)
-            gc.rad gc.rad
-
-let assign gc i v =
-  Mutex.lock screen_mutex;
-  set_color background; draw gc i gc.array.(i);
-  set_color foreground; draw gc i v;
-  gc.array.(i) <- v;
-  Mutex.unlock screen_mutex
-
-let exchange gc i j =
-  let val_i = gc.array.(i) in
-  assign gc i gc.array.(j);
-  assign gc j val_i
-
-(* Construction of a graphic context *)
-
-let initialize name array maxval x y w h =
-  let (_, label_height) = text_size name in
-  let rad = (w - 2) / (Array.length array) - 1 in
-  let gc =
-    { array = Array.copy array;
-      x0 = x + 1;                       (* Leave one pixel left for Y axis *)
-      y0 = y + 1;                       (* Leave one pixel below for X axis *)
-      width = w - 2;                    (* 1 pixel left, 1 pixel right *)
-      height = h - 1 - label_height - rad;
-      nelts = Array.length array;
-      maxval = maxval;
-      rad = rad } in
-  moveto (gc.x0 - 1) (gc.y0 + gc.height);
-  lineto (gc.x0 - 1) (gc.y0 - 1);
-  lineto (gc.x0 + gc.width) (gc.y0 - 1);
-  moveto (gc.x0 - 1) (gc.y0 + gc.height);
-  draw_string name;
-  for i = 0 to Array.length array - 1 do
-    draw gc i array.(i)
-  done;
-  gc
-
-(* Main animation function *)
-
-let display functs nelts maxval =
-  let a = Array.create nelts 0 in
-  for i = 0 to nelts - 1 do
-    a.(i) <- Random.int maxval
-  done;
-  let num_finished = ref 0 in
-  let lock_finished = Mutex.create() in
-  let cond_finished = Condition.create() in
-  for i = 0 to Array.length functs - 1 do
-    let (name, funct, x, y, w, h) = functs.(i) in
-    let gc = initialize name a maxval x y w h in
-    Thread.create
-      (fun () ->
-        funct gc;
-        Mutex.lock lock_finished;
-        incr num_finished;
-        Mutex.unlock lock_finished;
-        Condition.signal cond_finished)
-      ()
-  done;
-  Mutex.lock lock_finished;
-  while !num_finished < Array.length functs do
-    Condition.wait cond_finished lock_finished
-  done;
-  Mutex.unlock lock_finished;
-  read_key()
-
-(*****
-  let delay = ref 0 in
-  try
-    while true do
-      let gc = Queue.take q in
-        begin match gc.action with
-          Finished -> ()
-        | Pause f ->
-            gc.action <- f ();
-            for i = 0 to !delay do () done;
-            Queue.add gc q
-        end;
-      if key_pressed() then begin
-        match read_key() with
-          'q'|'Q' ->
-            raise Exit
-        | '0'..'9' as c ->
-            delay := (Char.code c - 48) * 500
-        | _ ->
-            ()
-      end
-    done
-  with Exit -> ()
-     | Queue.Empty -> read_key(); ()
-*****)
-
-(* The sorting functions. *)
-
-(* Bubble sort *)
-
-let bubble_sort gc =
-  let ordered = ref false in
-  while not !ordered do
-    ordered := true;
-    for i = 0 to Array.length gc.array - 2 do
-      if gc.array.(i+1) < gc.array.(i) then begin
-        exchange gc i (i+1);
-        ordered := false
-      end
-    done
-  done
-
-(* Insertion sort *)
-
-let insertion_sort gc =
-  for i = 1 to Array.length gc.array - 1 do
-    let val_i = gc.array.(i) in
-    let j = ref (i - 1) in
-    while !j >= 0 && val_i < gc.array.(!j) do
-      assign gc (!j + 1) gc.array.(!j);
-      decr j
-    done;
-    assign gc (!j + 1) val_i
-  done
-
-(* Selection sort *)
-
-let selection_sort gc =
-  for i = 0 to Array.length gc.array - 1 do
-    let min = ref i in
-    for j = i+1 to Array.length gc.array - 1 do
-      if gc.array.(j) < gc.array.(!min) then min := j
-    done;
-    exchange gc i !min
-  done
-
-(* Quick sort *)
-
-let quick_sort gc =
-  let rec quick lo hi =
-    if lo < hi then begin
-      let i = ref lo in
-      let j = ref hi in
-      let pivot = gc.array.(hi) in
-      while !i < !j do
-        while !i < hi && gc.array.(!i) <= pivot do incr i done;
-        while !j > lo && gc.array.(!j) >= pivot do decr j done;
-        if !i < !j then exchange gc !i !j
-      done;
-      exchange gc !i hi;
-      quick lo (!i-1);
-      quick (!i+1) hi
-    end
-  in quick 0 (Array.length gc.array - 1)
-
-(* Merge sort *)
-
-let merge_sort gc =
-  let rec merge i l1 l2 =
-    match (l1, l2) with
-      ([], []) ->
-        ()
-    | ([], v2::r2) ->
-        assign gc i v2; merge (i+1) l1 r2
-    | (v1::r1, []) ->
-        assign gc i v1; merge (i+1) r1 l2
-    | (v1::r1, v2::r2) ->
-        if v1 < v2
-        then begin assign gc i v1; merge (i+1) r1 l2 end
-        else begin assign gc i v2; merge (i+1) l1 r2 end in
-  let rec msort start len =
-    if len < 2 then () else begin
-      let m = len / 2 in
-      msort start m;
-      msort (start+m) (len-m);
-      merge start
-            (Array.to_list (Array.sub gc.array start m))
-            (Array.to_list (Array.sub gc.array (start+m) (len-m)))
-    end in
-  msort 0 (Array.length gc.array)
-
-(* Main program *)
-
-let animate() =
-  open_graph "";
-  moveto 0 0; draw_string "Press a key to start...";
-  let seed = ref 0 in
-  while not (key_pressed()) do incr seed done;
-  read_key();
-  Random.init !seed;
-  clear_graph();
-  let prompt = "0: fastest ... 9: slowest, press 'q' to quit" in
-  moveto 0 0; draw_string prompt;
-  let (_, h) = text_size prompt in
-  let sx = size_x() / 2 and sy = (size_y() - h) / 3 in
-  display [| "Bubble", bubble_sort, 0, h, sx, sy;
-             "Insertion", insertion_sort, 0, h+sy, sx, sy;
-             "Selection", selection_sort, 0, h+2*sy, sx, sy;
-             "Quicksort", quick_sort, sx, h, sx, sy;
-             (** "Heapsort", heap_sort, sx, h+sy, sx, sy; **)
-             "Mergesort", merge_sort, sx, h+2*sy, sx, sy |]
-          100 1000;
-  close_graph()
-
-let _ = if !Sys.interactive then () else begin animate(); exit 0 end
-
-;;