1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
open Core
open Graphics
(* ****************** *)
(* The user interface *)
(* ****************** *)
exception Exit_judge
module UI (C : CORE) : sig
val init : unit -> unit
val close : unit -> unit
val handle_events : unit -> unit
val display : unit -> unit
end = struct
module G = C.G
open G_util
(* Init/Close *)
let init () =
open_graph " 800x600";
set_font "-misc-fixed-bold-r-normal--15-120-90--c-90-iso8859-1";
auto_synchronize false;
display_mode false;
remember_mode true;
fullscreen_msg "Starting up..."
let close () =
close_graph ()
(* View types *)
type view =
| ScoreBoard
| MatchList of bool
| ViewLastGame
| NavGame of C.game * int
| Question of string * (unit -> unit) * view
let rec handle_events () =
while key_pressed () do
match !curr_view, read_key() with
| ScoreBoard, '\t' -> curr_view := MatchList false
| MatchList _, '\t' -> curr_view := ScoreBoard
| MatchList e, 'f' -> curr_view := MatchList (not e)
| MatchList _, 'r' -> curr_view := Question(
"Launch new round?",
(fun () -> C.add_rounds(); curr_view := MatchList false),
!curr_view
)
| MatchList _, 'v' when C.games () <> [] -> curr_view := ViewLastGame
| MatchList _, 'n' when C.games () <> [] ->
curr_view := NavGame ((List.hd (C.games())), 0)
| NavGame (g, n), 'b' when n > 0 ->
curr_view := NavGame (g, n-1)
| NavGame (g, n), 'f' when n < List.length (C.hist g) - 1 ->
curr_view := NavGame (g, n+1)
| NavGame (g, _), 'n' ->
let rec dx = function
| gg::pg::_ when pg == g -> curr_view := NavGame (gg, 0)
| _::l -> dx l
| [] -> ()
in dx (C.games())
| NavGame (g, _), 'p' ->
let rec dx = function
| pg::gg::_ when pg == g -> curr_view := NavGame (gg, 0)
| _::l -> dx l
| [] -> ()
in dx (C.games())
| ViewLastGame, '\t' | NavGame _, '\t' -> curr_view := MatchList false
| Question(_, y, n), 'y' -> y()
| Question(_, y, n), 'n' -> curr_view := n
| v, 'q' ->
curr_view := Question(
"Really quit?",
(fun () ->
fullscreen_msg "Exiting...";
raise Exit_judge),
v)
| _ -> ()
done
and display () =
clear_graph ();
begin match !curr_view with
| ScoreBoard -> scoreboard_disp ()
| MatchList f -> matchlist_disp f
| ViewLastGame -> last_game_disp ()
| NavGame (g, n) -> nav_game_disp g n
| Question (q, _, _) -> fullscreen_msg (q ^ " (y/n)")
end;
synchronize ()
and curr_view = ref ScoreBoard
(* Scoreboard view *)
and scoreboard_disp () =
text1 1 black "score board";
text4 1 grey "match list >";
hl();
let scores = List.sort
(fun (_, sc) (_, sc') -> sc' - sc)
(C.scores())
in
let show_sc i (n, s) =
text2 (i+4) black (string_of_int (i+1)^". ");
text3 (i+4) black n;
text4 (i+4) black (string_of_int s)
in
List.iteri show_sc scores
(* Match list view *)
and matchlist_disp show_only_running =
text1 1 black "match list";
text2 1 black "queued matches:";
text3 1 black (string_of_int (C.ql ()));
text4 1 grey "score board >";
hl();
let games =
if show_only_running then
List.filter
(fun g -> match C.p1 g, C.p2 g with Dead, Dead -> false | _ -> true)
(C.games())
else C.games()
in
let time = Unix.gettimeofday() in
let print_g i g =
let cp1, cp2 = match C.s g with
| TurnOf _ -> black, black
| Won P1 -> green, red
| Won P2 -> red, green
| Tie -> grey, grey
| Eliminated P1 -> red, grey
| Eliminated P2 -> grey, red
in
let mp = function
| Loading -> grey, ">>>"
| Saving -> grey, "<<<"
| Dead -> black, ""
| StandBy t -> grey, Format.sprintf "%.2f" t
| Thinking (t, tb) -> black,
Format.sprintf "[ %.2f ]" (t -. (time -. tb))
in
let p1n, p2n = C.pn g in
let c, m = mp (C.p1 g) in text1 (i+4) c m;
text2 (i+4) cp1 p1n;
text3 (i+4) cp2 p2n;
let c, m = mp (C.p2 g) in text4 (i+4) c m
in
List.iteri print_g games
(* Game view *)
and last_game_disp () =
match C.games () with
| g::_ ->
let p1n, p2n = C.pn g in
text1 1 p1c p1n;
text2 1 p2c p2n;
text4 1 grey "match list >";
hl();
G.display_game (C.g g) (p1n, p2n)
| _ -> ()
and nav_game_disp g n =
let p1n, p2n = C.pn g in
text1 1 p1c p1n;
text2 1 p2c p2n;
text4 1 grey "match list >";
hl();
let put_st i g =
let cx = 10 * i + 30 in
let cy = size_y () - 60 in
begin match G.s g with
| TurnOf p ->
set_color (pc p);
draw_circle cx cy 2
| Won p ->
set_color (pc p);
draw_circle cx cy 2;
draw_circle cx cy 4
| Tie ->
set_color black;
draw_circle cx cy 4
| Eliminated p ->
set_color (pc p);
draw_segments [| cx - 3, cy - 3, cx + 4, cy + 4; cx - 3, cy + 3, cx + 4, cy - 4 |]
end;
if i = n then begin
set_color black;
fill_circle cx (cy-10) 2;
G.display_game g (p1n, p2n)
end
in
List.iteri put_st (List.rev (C.hist g))
end
(* ************* *)
(* The main loop *)
(* ************* *)
module Juge (C : CORE) : sig
val run : unit -> unit
end = struct
module UI = UI(C)
let run () =
C.init();
UI.init();
begin try while true do
C.handle_events ();
UI.handle_events ();
UI.display ()
done with
Exit_judge ->
C.finish ();
UI.close ()
end
end
|
