1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
|
if(replay_mark>replay_pos) replay_mark--;
return 0;
case '^+': // Insert moves
if(solution_replay) return 0;
inputs_count=0;
inserting^=1;
return 0;
case '^D': // Delete all moves forward
inputs_count=0;
if(solution_replay) {
screen_message("You cannot delete moves during the solution replay");
return -3;
}
if(replay_pos==replay_count) return 0;
|
>
>
>
>
>
>
>
>
|
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
|
if(replay_mark>replay_pos) replay_mark--;
return 0;
case '^+': // Insert moves
if(solution_replay) return 0;
inputs_count=0;
inserting^=1;
return 0;
case '^?': // Debug information
printf("timerflag=%d exam_scroll=%d inputs_size=%d inputs_count=%d\n",timerflag,exam_scroll,(int)inputs_size,inputs_count);
printf("side_mode=%d replay_speed=%d replay_time=%d solved=%d\n",side_mode,replay_speed,replay_time,solved);
printf("should_record_solution=%d should_record_private_solution=%d\n",should_record_solution,should_record_private_solution);
printf("autowin=%p inserting=%d saved_inserting=%d solution_replay=%d\n",autowin,inserting,saved_inserting,solution_replay);
printf("replay_size=%d replay_count=%d replay_pos=%d replay_mark=%d\n",(int)replay_size,replay_count,replay_pos,replay_mark);
printf("best_list=%p strlen(best_list)=%d best_score=%d\n",best_list,(int)strlen(best_list?:""),best_score);
return -3;
case '^D': // Delete all moves forward
inputs_count=0;
if(solution_replay) {
screen_message("You cannot delete moves during the solution replay");
return -3;
}
if(replay_pos==replay_count) return 0;
|